{"version":3,"file":"static/chunks/pages/_app-a7d21f31ff7aa896.js","mappings":"AwbACA,CAAAA,KAAK,gBAAmB,CAAGA,KAAK,gBAAmB,EAAI,EAAE,EAAEC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAElE,KACC,SAASC,CAAuB,CAAEC,CAAmB,CAAEC,CAAmB,CAAE,CAEnF,aACqBA,EAAoBC,CAAC,CAACF,EAAqB,CACzC,GAAM,UAAW,CAAE,OAA2CG,EAA2CC,CAAC,CAC5G,GAE0CH,EAAoB,MAA9D,Ixbs7IrBI,EAAAC,EACAC,EACAC,EAOAX,EA0hBAY,EAx9JyBC,EAA+CT,EAAoB,MACnEU,EAAqCV,EAAoB,MACzDE,EAA0DF,EAAoBW,CAAC,CAACD,GAChFE,EAAoCZ,EAAoB,MACxDa,EAAyDb,EAAoBW,CAAC,CAACC,GACtCZ,EAAoB,MAEjE,IAAIc,EAAgDd,EAAoB,MAEhBA,EAAoB,MACpCA,EAAoB,MACXA,EAAoB,MAtB9C,IAAAe,EAAAf,EAAA,aAqB5C,SAAAgB,EAAAC,CAAA,CAAAC,CAAA,EACA,OAAAC,MAAAC,KAAA,SAAAC,KAAAC,IAAA,CAAAL,EAAAM,MAAA,CAAAL,KAAAM,GAAA,EAAAC,EAAAC,IAAAT,EAAAU,KAAA,CAAAD,EAAAR,EAAA,CAAAQ,EAAA,GAAAR,GACA,CAOA,IAAAU,EAAA,GACA,YAAAC,EA2CA,SAAAC,EAAWC,CAAA,EACX,OAAAlB,IAAAmB,MAAA,CAAAD,EACA,CA4CIjB,EAAemB,MAAA,EACfnB,EAAAoB,SAAW,cACfpB,EAAAqB,KAAA,SACA,CAuGA,OAAAC,UAAAC,UACAC,YAAAC,CAAA,CAAAC,CAAA,MACAC,EACA,IACAC,QAAAA,CAAA,CACM,GAAAC,EACN,CAAAJ,EACA,CACMK,KAAAA,CAAA,CACN,CAAAL,EACAM,EAAAD,IAAAA,EAAArB,MAAA,CAAAmB,EAAA,YAAAE,EAAAE,IAAA,aAAAJ,CAAA,CACA,MAAAG,GACA,KAAAE,KAAA,QACA,KAAAC,GAAA,QACA,KAAAC,IAAA,QACA,KAAAC,UAAA,QACA,KAAAN,IAAA,QACA,KAAAO,MAAA,QACA,KAAAX,QAAA,QACAY,OAAAC,MAAA,MAAAV,GAAA,KAAAW,IAAA,MAAAhB,WAAA,CAAAgB,IAAA,CAGA,KAAAd,QAAA,UAAAe,EAGA,aAAAA,CAAAA,EAAAd,CAAA,EAAAc,EAAAd,EAAA,CAAAF,KAAAC,IAAA,CACA,CAEA,CAMA,SAAAgB,EAAAC,CAAA,EACA,OAAAC,EAAAD,IAAA,mBAAAA,CAAA,CAAAE,OAAAC,QAAA,EAOA,SAAAF,EAAAD,CAAA,EACA,uBAAAA,GAAAA,IAAA,EAAAA,CACA,CAKA,SAAAI,EAAAd,CAAA,EACA,uBAAAA,EAAAe,KAAAC,SAAA,CAAAhB,GAAA,GAAAA,CAAA,CAOA,SAAAiB,EAAAC,CAAA,EACA,IACAC,KAAAA,CAAA,CACInB,MAAAA,CAAA,CACJ,CAAAkB,EAAAE,IAAA,GACA,OAAAD,EAAAE,KAAAA,EAAArB,CAAA,CAMA,SAAAsB,EAAAC,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EACA,GAAAuB,CAAA,IAAAA,EACI,MAMJ,EALA,IAAAA,EACIA,EAAA,GACJ,iBAAAA,GACAA,CAAAA,EAAA,CACA5B,QAAA4B,CACA,GAGA,IACA1B,KAAAA,CAAA,CACIO,OAAAA,CAAA,CACJ,CAAAoB,EACA,CACItB,KAAAA,CAAA,CACJ,CAAAhB,EACA,CACAiB,WAAAA,CAAA,CACIR,QAAAA,EAAA,6BAAAO,EAAA,IAAAC,CAAAA,EAAA,qBAAAA,EAAA,4BAAAW,EAAAd,GAAA,IACJ,CAAAuB,EACA,OACAvB,MAAAA,EACAE,KAAAA,EACAC,WAAAA,EACAF,IAAAJ,CAAA,CAAAA,EAAArB,MAAA,IACAqB,KAAAA,EACAO,OAAAA,EACA,GAAAmB,CAAA,CACA5B,QAAAA,CACA,CACA,CAKA,SAAA8B,EAAAF,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EAKA,QAAA0B,KAJAjB,EAAAc,IACAA,CAAAA,EAAA,CAAAA,EAAA,EAGAA,GAAA,KAAA/B,EAAA8B,EAAAI,EAAAF,EAAAtC,EAAAc,GAGAR,GACA,OAAAA,CAAA,CAEA,CACA,CAMA,SAAAmC,EAAA3B,CAAA,CAAAd,CAAA,CAAA0C,CAAA,EACA,SAAAA,GACAA,CAAAA,EAAA,IAGA,IACA/B,KAAAA,EAAA,GACAO,OAAAA,EAAA,CAAAJ,EAAA,CACA6B,OAAAA,EAAA,GACIC,KAAAA,EAAA,GACJ,CAAAF,EACAnE,EAAA,CACAoC,KAAAA,EACAO,OAAAA,CAAA,EAGA,GAAAyB,IAAA7B,EAAAd,EAAA6C,OAAA,CAAA/B,EAAAvC,GAGAqE,GAAA5C,SAAAA,EAAAgB,IAAA,EAAAS,EAAAzB,EAAA8C,MAAA,GAAArB,EAAAX,IAAA,CAAA5B,MAAA6D,OAAA,CAAAjC,IACA,QAAAC,KAAAD,EACAqB,KAAAA,IAAAnC,EAAA8C,MAAA,CAAA/B,EAAA,EACA,OAAAD,CAAA,CAAAC,EAAA,CAKA,IAAAiC,EAAA,GAGA,QAAA1C,KAAAN,EAAAiD,SAAA,CAAAnC,EAAAvC,GACAyE,EAAA,GACA,MAAA1C,EAAA6B,KAAAA,EAAA,CAGA,QAAAe,EAAAC,EAAAC,EAAA,GAAApD,EAAAqD,OAAA,CAAAvC,EAAAvC,GAAA,CACA,IAAA+E,EAAAb,EAAAU,EAAAC,EAAA,CACAzC,KAAAuC,KAAAf,IAAAe,EAAAvC,EAAA,IAAAA,EAAAuC,EAAA,CACAhC,OAAAgC,KAAAf,IAAAe,EAAAhC,EAAA,IAAAA,EAAAiC,EAAA,CACAR,OAAAA,EACKC,KAAAA,CAAA,GAGL,QAAAW,KAAAD,EACAC,CAAA,KACAP,EAAA,GACQ,MAAAO,CAAA,IAAApB,KAAAA,EAAA,EACRQ,IAAAQ,EAAAI,CAAA,IAGAL,KAAAf,IAAAe,EACUpC,EAAAqC,EACVrC,aAAA0C,IACU1C,EAAA2C,GAAA,CAAAP,EAAAC,GACVrC,aAAA4C,IACU5C,EAAA6C,GAAA,CAAAR,GACV1B,EAAAX,IACAA,CAAAA,CAAA,CAAAoC,EAAA,CAAAC,CAAAA,EAGA,CAGA,GAAAH,EACA,QAAA1C,KAAAN,EAAA4D,OAAA,CAAA9C,EAAAvC,GACAyE,EAAA,GACA,MAAA1C,EAAA6B,KAAAA,EAAA,CAIAa,GACA,OAAAb,KAAAA,EAAArB,EAAA,CACA,CASA,MAAA+C,EACAxD,YAAAyD,CAAA,EACA,KAAAC,IAAA,QACA,KAAA/C,IAAA,QACA,KAAA8B,MAAA,QACA,KAAAD,OAAA,QACA,KAAAI,SAAA,QACA,KAAAW,OAAA,QACA,KAAAP,OAAA,QACA,IACArC,KAAAA,CAAA,CACA8B,OAAAA,CAAA,CACAG,UAAAA,CAAA,CACAW,QAAAA,CAAA,CACAf,QAAAA,EAAA/B,GAAAA,CAAA,CACMuC,QAAAA,EAAA,cACN,CAAAS,CACA,MAAA9C,IAAA,CAAAA,EACA,KAAA8B,MAAA,CAAAA,EACA,KAAAO,OAAA,CAAAA,EAAA,KAAAR,OAAA,CAAAA,EAGAI,EACA,KAAAA,SAAA,EAAAnC,EAAAwB,IAAA,CACA,IAAAD,EAAAY,EAAAnC,EAAAwB,GACA,OAAAC,EAAAF,EAAAC,EAAA,KAAAxB,EACM,EAEN,KAAAmC,SAAA,QAGAW,EACA,KAAAA,OAAA,EAAA9C,EAAAwB,IAAA,CACA,IAAAD,EAAAuB,EAAA9C,EAAAwB,GACA,OAAAC,EAAAF,EAAAC,EAAA,KAAAxB,EACM,EAEN,KAAA8C,OAAA,QAQAI,OAAAlD,CAAA,EACA,OAAAkD,EAAAlD,EAAA,KACA,CAMAmD,OAAAnD,CAAA,EACA,OAAAmD,EAAAnD,EAAA,KACA,CAMAoD,GAAApD,CAAA,EACA,OAAAoD,EAAApD,EAAA,KACA,CAOA8B,KAAA9B,CAAA,EACA,OAAA8B,EAAA9B,EAAA,KACA,CAWAqD,SAAArD,CAAA,CAAA4B,CAAA,EAKA,OAJA,SAAAA,GACAA,CAAAA,EAAA,IAGAyB,EAAArD,EAAA,KAAA4B,EAAA,CAGA,CAKA,SAAAsB,EAAAlD,CAAA,CAAAd,CAAA,MAAAqC,EAAA8B,EAAArD,EAAAd,GAGA,GAAAqC,CAAA,IACA,MAAAA,CAAA,IAOA,SAAA4B,EAAAnD,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,EAAA,CACG2C,OAAA,KAGH,IAAAN,CAAA,IAGA,OAAAA,CAAA,UAFIA,CAAA,IASJ,SAAAO,EAAA9B,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,EAAA,CACA2C,OAAA,GACGC,KAAA,KAGH,IAAAP,CAAA,IAGA,OAAAA,CAAA,UAFIA,CAAA,IASJ,SAAA6B,EAAApD,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,GACA,OAAAqC,CAAA,IAOA,SAAA8B,EAAArD,CAAA,CAAAd,CAAA,CAAA0C,CAAA,EACA,SAAAA,GACAA,CAAAA,EAAA,IAGA,IAAA0B,EAAA3B,EAAA3B,EAAAd,EAAA0C,GAAA2B,EAAAtC,EAAAqC,GAGA,GAAAC,CAAA,KACA,IAAAC,EAAA,IAAAnE,EAAAkE,CAAA,gBACA,QAAAd,KAAAa,EACAb,CAAA,KACA,OAAAA,CAAA,IAGA,GACI,OAAAe,EAAAnC,KAAAA,EAAA,CAIJ,CAFA,IAAAgB,EAAAkB,CAAA,IACA,OAAAlC,KAAAA,EAAAgB,EAAA,CAEA,CAKA,SAAAoB,EAAAlD,CAAA,CAAA4B,CAAA,EACA,WAAAY,EAAA,CACA7C,KAAAK,EACAyB,OAAA,KACGG,UAAAA,CACH,GAOA,SAAAuB,GAAA,CACA,OAAAD,EAAA,aACA,CACA,SAAAvF,EAAAyF,CAAA,EACA,WAAAZ,EAAA,CACA7C,KAAA,QAAA8B,OAAA2B,EAGA,CAAApB,QAAAvC,CAAA,EACA,GAAA2D,GAAAvF,MAAA6D,OAAA,CAAAjC,GACA,QAAA4D,EAAAvB,EAAA,GAAArC,EAAAuC,OAAA,GACA,MAAAqB,EAAAvB,EAAAsB,EAAA,EAKA5B,QAAAA,GACK3D,MAAA6D,OAAA,CAAAjC,GAAAA,EAAApB,KAAA,GAAAoB,CAAA,CAGLmC,UAAAA,GACA/D,MAAA6D,OAAA,CAAAjC,IAAA,0CAAAc,EAAAd,EAGA,EACA,CAKA,SAAA6D,GAAA,CACA,OAAAJ,EAAA,UAAAzD,GACG,kBAAAA,EAEH,CACA,SAAA8D,EAAAC,CAAA,EACA,IAAAC,EAAAlD,EAAAiD,GACAtB,EAAA,OAAAsB,EACA,WAAAhB,EAAA,CACA7C,KAAA,UAAA8B,OAAAS,WAAAA,GAAAA,WAAAA,GAAAA,YAAAA,EAAAsB,EAAA,KAGA5B,UAAAA,GACAnC,IAAA+D,GAAA,yBAAAC,EAAA,oBAAAlD,EAAAd,EAGA,EACA,CAKA,SAAAiE,EAAA/E,CAAsB,EACtB,WAAA6D,EAAA,IAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACGqF,QAAA,CAAA9C,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACH,EACA,CAKA,SAAAyG,GAAA,CACA,OAAAT,EAAA,SAAAzD,GACG,iBAAAA,GAAA,CAAAmE,MAAAnE,IAAA,oCAAAc,EAAAd,GAEH,CAKA,SAAAoE,EAAAlF,CAAsB,EACtB,WAAA6D,EAAA,IAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACGqF,QAAA,CAAA9C,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACH,EACA,CAKA,SAAA4G,GAAA,CACA,OAAAZ,EAAA,SAAAzD,GACG,iBAAAA,GAAA,oCAAAc,EAAAd,GAEH,CAQA,SAAAE,EAAA8B,CAAA,EACA,IAAAsC,EAAAjE,OAAAiE,IAAA,CAAAtC,GACA,WAAAe,EAAA,CACA7C,KAAA,OAAA8B,OAAAA,EAGA,CAAAO,QAAAvC,CAAA,EACA,GAAAW,EAAAX,GACA,QAAAoC,KAAAkC,EACA,MAAAlC,EAAApC,CAAA,CAAAoC,EAAA,CAAAJ,CAAA,CAAAI,EAAA,GAKAD,UAAAA,GACAxB,EAAAX,IAAA,qCAAAc,EAAAd,EAGA,EACA,CAKA,SAAAuE,EAAAC,CAAA,EACA,IAAAR,EAAAQ,EAAA/F,GAAA,CAAA6D,GAAAA,EAAApC,IAAA,EAAAH,IAAA,QACA,WAAAgD,EAAA,CACA7C,KAAA,QAAA8B,OAAA,KAGAD,QAAA/B,CAAA,CAAAvC,CAAA,EACA,IAAAgH,EAAAD,EAAAE,IAAA,CAAApC,GAAA,CACA,IAAAqC,EAAA,CAAArC,EAAAe,QAAA,CAAArD,EAAA,CACS6B,OAAA,EACT,GACO,OAAA8C,CACP,IAAAC,IACK,OAAAH,EAAA1C,OAAA,CAAA/B,EAAAvC,EAAA,EAGL0E,UAAAnC,CAAA,CAAAvC,CAAA,MAAAgC,EAAA,GAGA,QAAAoF,KAAAL,EAAA,CACA,OAAAlB,EAAA,CAAA3B,EAAA3B,EAAA6E,EAAApH,GAAA,CAAAqH,EAAA,CAAAxB,EAGA,IAAAwB,CAAA,IACU,SAEV,QAAAtF,EAAA,GAAA8D,EACA9D,GACAC,EAAA3C,IAAA,CAAA0C,EAGA,CAGA,oDAAAwE,EAAA,oBAAAlD,EAAAd,MAAAP,EAAA,CAGA,EACA,CAKA,SAAAmF,GAAA,CACA,OAAAnB,EAAA,kBAcA,SAAA5B,EAAA3C,CAAsB,CAAA6F,CAAA,CAAAhD,CAAA,EACtB,WAAAgB,EAAA,IAAA7D,CAAA,CACA6C,QAAA,CAAA/B,EAAAvC,IACA2F,EAAApD,EAAA+E,GAAA7F,EAAA6C,OAAA,CAAAA,EAAA/B,EAAAvC,GAAAA,GAAAyB,EAAA6C,OAAA,CAAA/B,EAAAvC,EAAA,EAEA,CAuBA,IAAAuH,EAAA,GAmBA,eAAAC,EAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAYD,MAAAA,EAA+BA,EAAAF,EAAAG,UAAA,CAC3C,CAAArF,MAAAsF,CAAA,CAAA9D,QAAAA,CAAA,QAAA0D,EAAAK,iCAAA,CAAAJ,EAAAE,GACAG,EAAAF,EAAA7G,GAAA,EAAAgH,EAAAC,IACA,OAAAD,EACA,KAEA,CACAtG,UAAAgG,CAAA,CAAAO,EAAA,CACAD,QAAAA,EACAjE,QAAAA,CACK,CALL,EAOA,OAAAgE,CACA,CAEA,eAAAG,EAAAT,CAAA,CAAAU,CAAA,CAAAC,CAAA,CAAAR,CAAA,CAAAS,CAAA,EACA,IAAAC,EACAF,GAAAA,EAAArH,MAAA,IACAoH,EAAAI,IAAA,IAAAH,GAGA,IAAAlG,EAAAiG,EAAAK,QAAA,GACAC,EAAAvG,EAAAwG,SAAA,GAEAC,EAAAR,EAAAS,UAAA,CAAAH,GACAI,EAAAF,EAAAG,QAAA,WACAC,EAAA,CACAC,SAAA,SACApB,WAAAA,MAAAA,EAAAA,EAAAH,EAAAG,UAAA,EAEA,GAAAS,EAAA,CACA,IAAAY,EAAA,CAAAtI,MAAA6D,OAAA,CAAA6D,GAAAA,EAAAnG,EAAAgH,aAAA,IAAAlI,GAAA,IAAAwB,EAAA2G,QAAA,GACAJ,CAAAA,EAAA,UACAC,SAAA,SACAC,UAAAA,CACA,CACA,IACAb,EAAArH,MAAA,IACAgI,CAAAA,EAAAK,SAAA,KAEA,IAAAC,EAAA,CAAAR,EAAAE,EAAA,CAEAO,EAAA,MAAA7B,EAAA8B,WAAA,uBAAAF,GACAG,EAAA9D,EAAA4D,EAAAG,GACA,aAAAD,EAAA,CACA,IAAAE,EACA,YAAAF,EAAAzD,KAAA,EACA2D,CAAAA,EAAA,OAAApB,CAAAA,EAAAkB,EAAAzD,KAAA,CAAAxE,IAAA,GAAA+G,KAAA,IAAAA,EAAA,OAAAA,EAAAoB,IAAA,GACA/I,MAAA6D,OAAA,CAAAkF,GAAA,CACA,IAAAC,EAAA,SACAC,EAAAD,EAAAD,EAAApH,IAAA,CAAAqH,GACAE,QAAA9D,KAAA,CAAAyD,EAAAzD,KAAA,CAAA7D,OAAA,CAAA0H,EACA,CACA,MACA,IAAA3J,EAAA6J,oBAAA,oCAAAN,EAAAzD,KAAA,CAAA7D,OAAA,CAAAwH,EAAA,CACA,OACAF,EAAA1F,MAAA,CAGA,SAAAiG,EAAAxF,CAAA,EACA,OAAAH,EAAA4F,EAAAzF,GAAA0F,EAAA,GACA,UAAA1H,EACAA,EAGA,CACA,GAAAA,CAAA,CACAuB,OAAA4B,EAAAnD,EAAAuB,MAAA,CAAAS,EACA,CACK,CAEL,CAEA,IAAA0F,EAAAD,EAAA7C,KAEA,SAAA6C,EAAAlG,CAAA,EACA,OAAAgD,EAAA,CACArE,EAAA,CACAyH,QAAA7D,EAAA,OACA8D,GAAAvD,IACS9C,OAAAA,CACT,GACArB,EAAA,CACAyH,QAAA7D,EAAA,OACA8D,GAAAvD,IACAb,MAAAtD,EAAA,CACA2H,KAAAjD,IACAjF,QAAA0E,IACarF,KAAAoF,EAAAV,IACJ,EACT,GACA,CACA,CAEA,SAAAoE,EAAA9H,CAAA,EACA,OAAAwH,EAAAtH,EAAA,CACAsB,QAAAtB,EAAA,CACS6H,KAAA7D,GACT,GACKlE,MAAAA,CACL,GACA,CAEA,IAAAkH,EAAkCY,EAAA5H,EAAA,CAClC8H,IAAA/D,EAAAM,EAAA,CAAArE,EAAA,IAAAmE,IAAA,GACA8C,KAAAlD,EAAA/F,EAAAmG,MACAmB,SAAApB,EAAAH,EAAA/F,EAAA+F,EAAA/D,EAAA,CACA+H,WAAApE,IACAqE,MAAA7D,IACA8D,SAAAjE,IACAlF,KAAAd,EAAAmG,KACK+D,UAAAhE,EAAAF,IACL,OACCmE,cAAAjE,EAAAF,IAAA,GAeD,OAAAoE,GAMA/I,YAAA2F,CAAA,CAAAqD,CAAA,CAAAC,EAAAF,GAAAG,cAAA,IACA,KAAAvD,UAAA,CAAAA,EACA,KAAAqD,MAAA,CAAAA,EACA,KAAAC,IAAA,CAAAA,EACA,KAAArJ,SAAA,CAAAoJ,MAAAA,EAAA,OAAAA,EAAApJ,SAAA,CAEA,OAAAsJ,gBAAA,CACA,OACAC,oBAAA,YACArD,WAAA,WACA,CACA,CASA,OAAAsD,MAAAC,CAAA,CAAAJ,EAAAF,GAAAG,cAAA,IAEA,2DASA,OAAAI,KAAA,CAEA,yDAUA,MAAAC,eAAAhK,CAAA,CAAA+G,CAAA,CAAA2C,CAAA,EACA,IAAAzC,EAAAgD,EAAAC,EAAAC,EAIA,GAHA5H,KAAAA,IAAAmH,GACAA,CAAAA,EAAA,KAAAA,IAAA,EAEA3J,EAAAC,GACA+G,GACA/G,EAAAkH,IAAA,CAAAH,QAMA,GAFA/G,EAAAoK,QAAA,QAAAnD,CAAAA,EAAAjH,EAAAoK,QAAA,GAAAnD,KAAA,IAAAA,EAAAA,EAAA,KAAAwC,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,aAAAjE,UAAA,CAAAkE,kBAAA,CAAAZ,EAAAE,mBAAA,GAAAW,SAAA,CACAxD,EACA,QAAAyD,KAAAzD,EACA/G,EAAAyK,WAAA,CAAAD,EAEA,CAEAxK,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,GACA,IAAA2K,EAAA3K,EAAAqH,SAAA,GACA,IACA,aAAAuD,GAAA,KAAAxE,UAAA,CAAAuE,EAAAjB,EACA,CACA,MAAAR,EAAA,CAGA,GAAAA,aAAA2B,GAAA,CAKA,IAAAC,EAAA7K,EAAAF,EAAAC,GACA,QAAAiK,CAAAA,EAAAjK,EAAA+K,UAAA,GAAAd,KAAA,IAAAA,EAAA,OAAAA,CAAA,UAAAe,WACA,OAAAd,CAAAA,EAAAlK,EAAAiL,SAAA,GAAAf,KAAA,IAAAA,EAAAA,EAAA,IAAAc,UAAA,EACAE,EAAAnL,EAAAC,GAAA,EAAAuC,KAAAA,CAAA,CACA4I,EAAA,WAAA/E,UAAA,CAAAgF,cAAA,CAAAN,EAAA,CACAvE,WAAA,YACiB8E,+BAAAH,CACjB,GACA,GAAAC,EAGA,CACA,IAAA9C,EAAA,IAA4C,GAA5C8B,CAAAA,EAAAgB,EAA4CG,IAAA,GAAAnB,KAAA,IAAAA,EAAA,OAAAA,EAAAoB,WAAA,OAC5C,MAAA3M,EAAA6J,oBAAA,CAAAS,EAAArI,OAAA,CAAAwH,GAAAa,CAAA,CACA,CAIA,MADAA,CAAA,CAGA,CAQA,MAAAsC,QAAAC,CAAA,CAAA/B,CAAA,EACA,IAAAzC,EAAAgD,EAAAC,CACA3H,MAAAA,IAAAmH,GACAA,CAAAA,EAAA,KAAAA,IAAA,EAEA,IAAAW,EAAA,YAAAjE,UAAA,CAAAkE,kBAAA,CAAAZ,EAAAE,mBAAA,GAAAW,SAAA,CACAmB,EAAAD,EAAA9L,GAAA,KACA,IAAAsH,EAAAgD,EACA,GAAAlK,EAAA6C,EAAA5C,EAAA,GACA,IAAAA,EAAA4C,EAAA5C,EAAA,CAIA,OAHA4C,EAAAmE,OAAA,EACA/G,EAAAkH,IAAA,CAAAtE,EAAAmE,OAAA,EAEA/G,CACA,CAUS,CART,IAAAA,EAAA4C,EAAA5C,EAAA,CACA+G,EAAA,OAAAE,CAAAA,EAAArE,EAAAmE,OAAA,GAAAE,KAAA,IAAAA,EAAAA,EAAA,GAMA,OALAjH,EAAAoK,QAAA,QAAAH,CAAAA,EAAAjK,EAAAoK,QAAA,GAAAH,KAAA,IAAAA,EAAAA,EAAA,KAAAR,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,CAAAA,EACAtD,EAAA4E,OAAA,KACiB3L,EAAAyK,WAAA,CAAAmB,EACjB,GACA5L,CACS,CACT,GACA6L,EAAA,WAAApC,MAAA,CAAAqC,mBAAA,CAAAJ,GACAK,EAAA,GACA,QAAAzI,EAAA,EAAAA,EAAAoI,EAAAhM,MAAA,CAAA4D,GAAA,GACA,IAAAtD,EAAA6L,CAAA,CAAAvI,EAAA,CACAqH,EAAA3K,EAAAqH,SAAA,GACA,IACA0E,EAAA/N,IAAA,OAAA4M,GAAA,KAAAxE,UAAA,CAAAuE,EAAAjB,GACA,CACA,MAAAR,EAAA,CAGA,GAAAA,aAAA2B,GAAA,CAKA,IAAAC,EAAA7K,EAAAF,EAAAC,GACA,QAAAiH,CAAAA,EAAAjH,EAAA+K,UAAA,GAAA9D,KAAA,IAAAA,EAAA,OAAAA,CAAA,UAAA+D,WACA,OAAAf,CAAAA,EAAAjK,EAAAiL,SAAA,GAAAhB,KAAA,IAAAA,EAAAA,EAAA,IAAAe,UAAA,EACAE,EAAAnL,EAAAC,GAAA,EAAAuC,KAAAA,CAAA,CACA4I,EAAA,WAAA/E,UAAA,CAAAgF,cAAA,CAAAN,EAAA,CACAvE,WAAA,YACqB8E,+BAAAH,CACrB,GACA,GAAAC,EAGA,CACA,IAAA9C,EAAA,IAAgD,GAAhD6B,CAAAA,EAAAiB,EAAgDG,IAAA,GAAApB,KAAA,IAAAA,EAAA,OAAAA,EAAAqB,WAAA,OAChD,MAAA3M,EAAA6J,oBAAA,CAAAS,EAAArI,OAAA,CAAAwH,GAAAa,CAAA,CACA,CAIA,MADAA,CAAA,CAGA,CACA,OAAA6C,CACA,CAWA,MAAAC,SAAAhM,CAAA,CAAA+G,CAAA,CAAAR,CAAA,CAAAS,CAAA,EACA,IACAvE,EADA4H,EAAA,YAAAjE,UAAA,CAAAkE,kBAAA,CAAA/D,MAAAA,EAAAA,EAAA,KAAAH,UAAA,CAAAG,UAAA,GAAAgE,SAAA,CAmBA,GAjBAxK,EAAAC,IACA+G,GAAAA,EAAArH,MAAA,KACAM,EAAAkH,IAAA,CAAAH,GACA/G,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,IAIAyC,EAAA,WAAA2D,UAAA,CAAAS,mBAAA,CAAA7G,EAAA,CAAAuG,WAAAA,CAAA,KAGAvG,EAAAoK,QAAA,CAAApK,EAAAoK,QAAA,OAAAX,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,CAAAA,EACAtD,GAAAA,EAAArH,MAAA,IACAM,CAAAA,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,EAAA,EAEAyC,EAAA,MAAAoE,EAAA,KAAAT,UAAA,CAAApG,EAAA+G,EAAAR,EAAAS,IAEAvE,EAAAvB,KAAA,CAAAgI,GAAA,CACA,UAAA+C,GAAAxJ,EAAAvB,KAAA,EAEA,OAAAuB,EAAAvB,KAAA,CAEA,CACA,MAAA+K,WAAAC,MACAzL,YAAA0L,CAAA,CAAAtL,CAAA,EACA,MAAAA,GACA,KAAAsL,kBAAA,CAAAA,CACA,CACA,CAGA,eAAAvB,GAAAxE,CAAA,CAAAgG,CAAA,CAAAtJ,CAAA,EACA,IAAAuJ,EAAAvJ,GAAA,CACAwJ,cAAAxJ,EAAAwJ,aAAA,CACA1C,oBAAA9G,EAAA8G,mBAAA,EAAA9G,EAAAyD,UAAA,EAEA0E,EAAA,MAAA7E,EAAAmG,kBAAA,CAAAH,EAAAC,GACAG,EAAA,OAAApG,EAAAqG,kBAAA,CAAAxB,EAAAnI,GAAAA,EAAAyD,UAAA,GAAArF,KAAA,CACA,GAAAsL,EAAAtD,GAAA,CACA,UAAA2B,GAAA,mBAAAI,EAAA,WAAAhJ,KAAAC,SAAA,CAAAsK,GAAA,IAEA,OAAAvB,CACA,CACA,MAAAJ,WAAAqB,MACAzL,YAAAI,CAAA,EACA,MAAAA,EACA,CACA,CAgBA,IAAA6L,GAAA,KAEqJ,IAAAC,GAAA,oBAAAC,WAAAA,WAAA,oBAAAC,OAAAA,OAAA,SAAA1O,EAAA2O,CAAA,CAAA3O,EAAA2O,CAAA,qBAAA/O,KAAAA,KAAA,GAGrJ,SAAAgP,GAAAnL,CAAA,EACA,OAAAA,GAAAA,EAAAoL,UAAA,EAAAzL,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAvL,EAAA,WAAAA,EAAA,QAAAA,CAAA,CAEA,IAAAwL,GAAA,GAIA7L,OAAA8L,cAAA,CAAAD,GAAA,cAAAlM,MAAA,KACA,IAAAoM,GAAAF,GAAAE,iCAAA,CAAAC,GAAAH,GAAAG,8BAAA,CAAAC,GAAAJ,GAAAI,gEAAA,CAAAC,GAAAL,GAAAK,+DAAA,CAAAC,GAAAN,GAAAM,qDAAA,CAAAC,GAAAP,GAAAO,mEAAA,CAAAC,GAAAR,GAAAQ,0DAAA,CAAAC,GAAAT,GAAAS,iEAAA,CAAAC,GAAAV,GAAAU,uDAAA,CAAAC,GAAAX,GAAAW,yEAAA,CAAAC,GAAAZ,GAAAY,kEAAA,CAAAC,GAAAb,GAAAa,wDAAA,CAAAC,GAAAd,GAAAc,2EAAA,CAAAC,GAAAf,GAAAe,sEAAA,CAAAC,GAAAhB,GAAAgB,4DAAA,CAAAC,GAAAjB,GAAAiB,mEAAA,CAAAC,GAAAlB,GAAAkB,+DAAA,CAAAC,GAAAnB,GAAAmB,qDAAA,CAAAC,GAAApB,GAAAoB,uDAAA,CAAAC,GAAArB,GAAAqB,2CAAA,CAAAC,GAAAtB,GAAAsB,4CAAA,CAAAC,GAAAvB,GAAAuB,wCAAA,CAAAC,GAAAxB,GAAAwB,8BAAA,CAAAC,GAAAzB,GAAAyB,sCAAA,CAAAC,GAAA1B,GAAA0B,8CAAA,CAAAC,GAAA3B,GAAA2B,4CAAA,CAAAC,GAAA5B,GAAA4B,oCAAA,CAAAC,GAAA7B,GAAA6B,mCAAA,CAAAC,GAAA9B,GAAA8B,6BAAA,CAAAC,GAAA/B,GAAA+B,gCAAA,CAAAC,GAAAhC,GAAAgC,8BAAA,CAAAC,GAAAjC,GAAAiC,wCAAA,CAAAC,GAAAlC,GAAAkC,mCAAA,CAAAC,GAAAnC,GAAAmC,8BAAA,CAAAC,GAAApC,GAAAoC,mCAAA,CAAAC,GAAArC,GAAAqC,8BAAA,CAAAC,GAAAtC,GAAAsC,oCAAA,CAAAC,GAAAvC,GAAAuC,8BAAA,CAAAC,GAAAxC,GAAAwC,4BAAA,CAAAC,GAAAzC,GAAAyC,+BAAA,CAAAC,GAAA1C,GAAA0C,gCAAA,CAAAC,GAAA3C,GAAA2C,4BAAA,CAAAC,GAAA5C,GAAA4C,oCAAA,CAAAC,GAAA7C,GAAA6C,mCAAA,CAAAC,GAAA9C,GAAA8C,6CAAA,CAAAC,GAAA/C,GAAA+C,kCAAA,CAAAC,GAAAhD,GAAAgD,2CAAA,CAAAC,GAAAjD,GAAAiD,6CAAA,CAAAC,GAAAlD,GAAAkD,4CAAA,CAAAC,GAAAnD,GAAAmD,iCAAA,QACAC,GAAApD,GAAAoD,wBAAA,CAAAC,GAAArD,GAAAqD,wCAAA,CAAAC,GAAAtD,GAAAsD,qDAAA,CAAAC,GAAAvD,GAAAuD,0CAAA,CAAAC,GAAAxD,GAAAwD,wCAAA,CAAAC,GAAAzD,GAAAyD,2CAAA,CAAAC,GAAA1D,GAAA0D,qCAAA,CAAAC,GAAA3D,GAAA2D,kDAAA,CAAAC,GAAA5D,GAAA4D,sCAAA,CAAAC,GAAA7D,GAAA6D,qCAAA,CAAAC,GAAA9D,GAAA8D,sCAAA,CAAAC,GAAA/D,GAAA+D,gCAAA,CAAAC,GAAAhE,GAAAgE,wCAAA,CAAAC,GAAAjE,GAAAiE,gCAAA,CAAAC,GAAAlE,GAAAkE,4CAAA,CAAAC,GAAAnE,GAAAmE,iCAAA,CAAAC,GAAApE,GAAAoE,qCAAA,CAAAC,GAAArE,GAAAqE,uCAAA,CAAAC,GAAAtE,GAAAsE,yCAAA,CAAAC,GAAAvE,GAAAuE,4CAAA,CAAAC,GAAAxE,GAAAwE,6CAAA,CAAAC,GAAAzE,GAAAyE,+CAAA,CAAAC,GAAA1E,GAAA0E,kCAAA,CAAAC,GAAA3E,GAAA2E,iCAAA,CAAAC,GAAA5E,GAAA4E,uCAAA,CAAAC,GAAA7E,GAAA6E,kCAAA,CAAAC,GAAA9E,GAAA8E,sCAAA,QAEA3B,GAAAnD,GAAAmD,iCAAA,KAEAD,GAAAlD,GAAAkD,4CAAA,KAEAD,GAAAjD,GAAAiD,6CAAA,KAEAD,GAAAhD,GAAAgD,2CAAA,KAGAD,GAAA/C,GAAA+C,kCAAA,KAEAD,GAAA9C,GAAA8C,6CAAA,MAEAD,GAAA7C,GAAA6C,mCAAA,MAGAD,GAAA5C,GAAA4C,oCAAA,MAGAD,GAAA3C,GAAA2C,4BAAA,KAEAD,GAAA1C,GAAA0C,gCAAA,MAEAD,GAAAzC,GAAAyC,+BAAA,MAEAD,GAAAxC,GAAAwC,4BAAA,MAEAD,GAAAvC,GAAAuC,8BAAA,MAEAD,GAAAtC,GAAAsC,oCAAA,MAEAD,GAAArC,GAAAqC,8BAAA,MAEAD,GAAApC,GAAAoC,mCAAA,MAEAD,GAAAnC,GAAAmC,8BAAA,MAEAD,GAAAlC,GAAAkC,mCAAA,MAEAD,GAAAjC,GAAAiC,wCAAA,MAEAD,GAAAhC,GAAAgC,8BAAA,MAEAD,GAAA/B,GAAA+B,gCAAA,MAEAD,GAAA9B,GAAA8B,6BAAA,MAEAD,GAAA7B,GAAA6B,mCAAA,MAEAD,GAAA5B,GAAA4B,oCAAA,MAEAD,GAAA3B,GAAA2B,4CAAA,MAEAD,GAAA1B,GAAA0B,8CAAA,MAEAD,GAAAzB,GAAAyB,sCAAA,MAEAD,GAAAxB,GAAAwB,8BAAA,MAEAD,GAAAvB,GAAAuB,wCAAA,MAEAD,GAAAtB,GAAAsB,4CAAA,MAEAD,GAAArB,GAAAqB,2CAAA,MAEAD,GAAApB,GAAAoB,uDAAA,MAEAD,GAAAnB,GAAAmB,qDAAA,MAEAD,GAAAlB,GAAAkB,+DAAA,MAEAD,GAAAjB,GAAAiB,mEAAA,MAEAD,GAAAhB,GAAAgB,4DAAA,MAEAD,GAAAf,GAAAe,sEAAA,MAEAD,GAAAd,GAAAc,2EAAA,MAEAD,GAAAb,GAAAa,wDAAA,MAEAD,GAAAZ,GAAAY,kEAAA,MAEAD,GAAAX,GAAAW,yEAAA,MAEAD,GAAAV,GAAAU,uDAAA,MAEAD,GAAAT,GAAAS,iEAAA,MAEAD,GAAAR,GAAAQ,0DAAA,MAEAD,GAAAP,GAAAO,mEAAA,MAEAD,GAAAN,GAAAM,qDAAA,MAEAD,GAAAL,GAAAK,+DAAA,MAEAD,GAAAJ,GAAAI,gEAAA,MAGAD,GAAAH,GAAAG,8BAAA,MAEAD,GAAAF,GAAAE,iCAAA,MAEA,IAAA4E,GAAA9E,GAAA8E,sCAAA,MAEAD,GAAA7E,GAAA6E,kCAAA,MAEAD,GAAA5E,GAAA4E,uCAAA,MAEAD,GAAA3E,GAAA2E,iCAAA,MAEAD,GAAA1E,GAAA0E,kCAAA,MAGAD,GAAAzE,GAAAyE,+CAAA,KAEAD,GAAAxE,GAAAwE,6CAAA,MAEAD,GAAAvE,GAAAuE,4CAAA,MAEAD,GAAAtE,GAAAsE,yCAAA,MAEAD,GAAArE,GAAAqE,uCAAA,MAEAD,GAAApE,GAAAoE,qCAAA,MAEAD,GAAAnE,GAAAmE,iCAAA,MAEAD,GAAAlE,GAAAkE,4CAAA,MAEAD,GAAAjE,GAAAiE,gCAAA,MAEAD,GAAAhE,GAAAgE,wCAAA,MAEAD,GAAA/D,GAAA+D,gCAAA,MAEAD,GAAA9D,GAAA8D,sCAAA,MAEAD,GAAA7D,GAAA6D,qCAAA,MAEAD,GAAA5D,GAAA4D,sCAAA,MAEAD,GAAA3D,GAAA2D,kDAAA,MAEAD,GAAA1D,GAAA0D,qCAAA,MAEAD,GAAAzD,GAAAyD,2CAAA,MAEAD,GAAAxD,GAAAwD,wCAAA,MAGAD,GAAAvD,GAAAuD,0CAAA,MAEAD,GAAAtD,GAAAsD,qDAAA,MAEAD,GAAArD,GAAAqD,wCAAA,MAEAD,GAAApD,GAAAoD,wBAAA,KAkPA,IAAA2B,GAAA,CAEAC,mBAAA7B,GACA8B,4BAAA/B,GACAgC,6BAAAjC,GACAkC,2BAAAnC,GAEAoC,mBAAArC,GACAsC,6BAAAvC,GACAwC,mBAAAzC,GAEA0C,qBAAA3C,GAEA4C,cAAA7C,GACA8C,iBAAA/C,GACAgD,iBAAAjD,GACAkD,cAAAnD,GACAoD,gBAAArD,GACAsD,qBAAAvD,GACAwD,gBAAAzD,GACA0D,qBAAA3D,GACA4D,gBAAA7D,GACA8D,qBAAA/D,GACAgE,yBAAAjE,GACAkE,gBAAAnE,GACAoE,kBAAArE,GACAsE,eAAAvE,GACAwE,oBAAAzE,GACA0E,qBAAA3E,GACA4E,4BAAA7E,GACA8E,8BAAA/E,GACAgF,uBAAAjF,GACAkF,gBAAAnF,GACAoF,wBAAArF,GACAsF,4BAAAvF,GACAwF,2BAAAzF,GACA0F,sCAAA3F,GACA4F,oCAAA7F,GACA8F,6CAAA/F,GACAgG,gDAAAjG,GACAkG,0CAAAnG,GACAoG,mDAAArG,GACAsG,uDAAAvG,GACAwG,uCAAAzG,GACA0G,gDAAA3G,GACA4G,sDAAA7G,GACA8G,sCAAA/G,GACAgH,+CAAAjH,GACAkH,yCAAAnH,GACAoH,iDAAArH,GACAsH,oCAAAvH,GACAwH,6CAAAzH,GACA0H,6CAAA3H,GAEA4H,gBAAA7H,GACA8H,kBAAA/H,GACAgI,sBAAApD,GACAqD,mBAAAtD,GACAuD,uBAAAxD,GACAyD,kBAAA1D,GACA2D,mBAAA5D,GAEA6D,+BAAA9D,GACA+D,6BAAAhE,GACAiE,6BAAAlE,GACAmE,yBAAApE,GACAqE,uBAAAtE,GACAuE,qBAAAxE,GACAyE,kBAAA1E,GACA2E,2BAAA5E,GACA6E,iBAAA9E,GACA+E,yBAAAhF,GACAiF,iBAAAlF,GACAmF,sBAAApF,GACAqF,sBAAAtF,GACAuF,sBAAAxF,GACAyF,iCAAA1F,GACA2F,sBAAA5F,GACA6F,2BAAA9F,GACA+F,yBAAAhG,GAEAiG,0BAAAlG,GACAmG,kCAAApG,GACAqG,yBAAAtG,GAEAuG,WAAAxG,EACA,CAIA2B,CAAAA,GAAAC,kBAAA,CAIAD,GAAAE,2BAAA,CAIAF,GAAAG,4BAAA,CAIAH,GAAAI,0BAAA,CAKAJ,GAAAK,kBAAA,CAIAL,GAAAM,4BAAA,CAIAN,GAAAO,kBAAA,CAKAP,GAAAQ,oBAAA,CAIAR,GAAAS,aAAA,CACAT,GAAAU,gBAAA,CACAV,GAAAW,gBAAA,CACAX,GAAAY,aAAA,CACAZ,GAAAa,eAAA,CAEAb,GAAAc,oBAAA,CAGAd,GAAAe,eAAA,CACAf,GAAAgB,oBAAA,CAEAhB,GAAAiB,eAAA,CAGAjB,GAAAkB,oBAAA,CAEAlB,GAAAmB,wBAAA,CAGAnB,GAAAoB,eAAA,CACApB,GAAAqB,iBAAA,CACArB,GAAAsB,cAAA,CACAtB,GAAAuB,mBAAA,CACAvB,GAAAwB,oBAAA,CAEAxB,GAAAyB,2BAAA,CAIAzB,GAAA0B,6BAAA,CAIA1B,GAAA2B,sBAAA,CAGA3B,GAAA4B,eAAA,CAEA5B,GAAA6B,uBAAA,CAIA7B,GAAA8B,2BAAA,CAIA9B,GAAA+B,0BAAA,CAIA/B,GAAAgC,qCAAA,CAIAhC,GAAAiC,mCAAA,CAIAjC,GAAAkC,4CAAA,CAIAlC,GAAAmC,+CAAA,CAIAnC,GAAAoC,yCAAA,CAIApC,GAAAqC,kDAAA,CAIArC,GAAAsC,sDAAA,CAIAtC,GAAAuC,sCAAA,CAIAvC,GAAAwC,+CAAA,CAIAxC,GAAAyC,qDAAA,CAIAzC,GAAA0C,qCAAA,CAIA1C,GAAA2C,8CAAA,CAIA3C,GAAA4C,wCAAA,CAIA5C,GAAA6C,gDAAA,CAIA7C,GAAA8C,mCAAA,CAIA9C,GAAA+C,4CAAA,CAIA/C,GAAAgD,4CAAA,CAIAhD,GAAAiD,eAAA,CACAjD,GAAAkD,iBAAA,CAEAlD,GAAAmD,qBAAA,CAGAnD,GAAAoD,kBAAA,CAEApD,GAAAqD,sBAAA,CAGArD,GAAAsD,iBAAA,CACAtD,GAAAuD,kBAAA,CAGAvD,GAAAwD,8BAAA,CAIAxD,GAAAyD,4BAAA,CAIAzD,GAAA0D,4BAAA,CAGA1D,GAAA2D,wBAAA,CACA3D,GAAA4D,sBAAA,CAEA5D,GAAA6D,oBAAA,CAGA7D,GAAA8D,iBAAA,CAEA9D,GAAA+D,0BAAA,CAGA/D,GAAAgE,gBAAA,CACAhE,GAAAiE,wBAAA,CACAjE,GAAAkE,gBAAA,CAEAlE,GAAAmE,qBAAA,CAIAnE,GAAAoE,qBAAA,CAIApE,GAAAqE,qBAAA,CAIArE,GAAAsE,gCAAA,CAIAtE,GAAAuE,qBAAA,CAIAvE,GAAAwE,0BAAA,CAIAxE,GAAAyE,wBAAA,CAKAzE,GAAA0E,yBAAA,CAIA1E,GAAA2E,iCAAA,CAIA3E,GAAA4E,wBAAA,CAKA5E,GAAA6E,UAAA,OA+1BAC,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAAH,GACA,2CAWA,KAAAA,IAAA,CAAAA,EAWA,KAAAC,QAAA,CAAAA,CAAA,CAkBAG,uBAAA,CACA,SAeAC,OAAAC,CAAA,CAAAC,CAAA,EACA,kCAyBAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,kCAmBAE,QAAAH,CAAA,CAAAC,CAAA,EACA,UAAAP,IAAA,CACA,uCAEA,YAAAA,IAAA,CAmBAU,UAAAT,CAAA,EACA,IAAAU,EAAAtW,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,EAGA,OAFA1L,OAAAC,MAAA,CAAAqW,EAAA,MACAA,EAAAV,QAAA,CAAAA,EACAU,CAAA,CAuBAC,UAAAC,CAAA,EAEA,CACA,KAAAC,GAAAf,GAQA,SAAAgB,GAAAxW,CAAA,CAAAyW,CAAA,SACA,EAAAf,QAAA,CACA1V,EAAA,IAAAyW,EAAAf,QAAA,KAEA1V,CADA,CAyBA,MAAA0W,WAAAlB,GAYAmB,SAAA,CACA,0CACA,CAuBA,MAAAC,WAAAF,GACA1X,YAAA6X,CAAA,CAAAb,CAAA,CAAAN,CAAA,EACA,IAAAmB,CAAAA,aAAArB,EAAA,EACA,2CAGA,GAAA1U,KAAAA,IAAAkV,EACMA,EAAA,OACN,IAAAL,OAAAC,SAAA,CAAAI,GACA,uDAEA,MAAAa,EAAApB,IAAA,CAAAC,GAAAmB,EAAAnB,QAAA,EAGA,KAAAmB,MAAA,CAAAA,EASA,KAAAb,MAAA,CAAAA,CAAA,CAIAW,SAAA,CACA,YAAAE,MAAA,YAAAC,IACA,KAAAD,MAAA,YAAAE,EAAA,CAIAjB,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,KAAAA,MAAA,EAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAAAA,MAAA,CACA,EAmBA,MAAAc,WAAAtB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAiB,UAAA,CAAAhB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAkB,WAAA,CAAAhB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAAsB,WAAAvB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAmB,UAAA,CAAAlB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAoB,WAAA,CAAAlB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAEA,IAAA2B,GAAArZ,WAKA,SAAAsZ,GAAApB,CAAA,EACA,IAAAqB,EAAAvZ,KAAAwZ,KAAA,CAAAtB,EAAAmB,IACAI,EAAUvB,EAAAqB,EAAAF,GACV,OAAAE,KAAAA,EAAAE,KAAAA,CAAA,CACA,CAEA,SAAAC,GAAAH,CAAA,CAAAE,CAAA,EACA,OAAAF,EAAAF,GAAAI,CAAA,CAcA,MAAAE,WAAAlC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAA4B,YAAA,CAAA3B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAA8B,aAAA,CAAAD,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAA8B,WAAAtC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAAgC,WAAA,CAAA/B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAAiC,YAAA,CAAAJ,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAmCA,MAAAiC,WAAAzC,GACAxW,YAAAkZ,CAAA,CAAAxC,CAAA,CAAAyC,CAAA,EACA,IAAAta,CAAAA,MAAA6D,OAAA,CAAAwW,IACAA,EAAAE,MAAA,EAAAC,EAAAvW,IAAAuW,GAAAvW,aAAA0T,GAAA,KACA,4DASA,QAAA8C,KAPA,kBAAA5C,GACA5U,KAAAA,IAAAqX,IACAA,EAAAzC,EACAA,EAAA5U,KAAAA,GAIAoX,GACA,KAAAI,EAAA7C,IAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,CACA,oEAIA,IAAAD,EAAA,GACA,IACMA,EAAAyC,EAAAE,MAAA,EAAA3C,EAAA6C,IAAA7C,EAAA6C,EAAApC,OAAA,KACN,OAAA9R,EAAA,CACA,OAAAqR,EAAAC,GAYA,KAAAwC,MAAA,CAAAA,EAYA,KAAAC,cAAA,GAAAA,CAAA,CAIAjC,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA,IACAA,EAAA,KAAAyC,MAAA,CAAAE,MAAA,EAAA3C,EAAA6C,IAAA,CACA,IAAAC,EAAAD,EAAApC,OAAA,CAAAH,EAAAC,GAEO,OADPA,GAAAuC,EACO9C,EAAA8C,CACD,IACN,OAAAnU,EAAA,CACA,uCAEA,OAAAqR,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CAKA,GAJApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAAC,EAAA,EAEAA,GAAAsC,EAAApC,OAAA,CAAAH,EAAAC,GACA,KAAAmC,cAAA,EACApC,EAAA9X,MAAA,GAAA+X,EACA,MAGA,OAAAwC,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAyC,EAAAzC,EACA0C,EAAA,EACAC,EAAA,EACA,QAAAL,KAAA,KAAAJ,MAAA,EACA,IAAAzC,EAAA6C,EAAA7C,IAAA,CAEA,GADAkD,EAAA,EAAAlD,EAAAA,EAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,IACAD,EAAAL,EAAA5Z,MAAA,CAAAka,EAAA7C,EAAAC,GACA,EAAAP,GAGAA,CAAAA,EAAA6C,EAAApC,OAAA,CAAAH,EAAAC,EAAA,EAGA,GACAA,EACAA,GAAAP,CACA,CAKA,SAAAkD,EAAAF,CAAA,CAIApC,UAAAC,CAAA,EACA,IAAAkC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,EAAAY,EAAArY,MAAA,EACAua,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAAY,EAAAuC,KAAA,IAGA,OAAAL,CAAA,CAWAM,UAAApD,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAeAS,SAAArD,CAAA,EACA,oBAAAA,EACA,2CAEA,IAAAM,EAAA,EACA,QAAAsC,KAAA,KAAAJ,MAAA,EACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAAM,CACA,CACA,EAAAsC,EAAA7C,IAAA,CACQO,EAAA,GACR,GAAAA,GACAA,CAAAA,GAAAsC,EAAA7C,IAAA,CAEA,CACA,EAiBA,MAAAuD,GACAha,YAAa0W,CAAA,EAKb,KAAAA,QAAA,CAAAA,CAAA,CAOAI,QAAA,CACA,8CAOApX,QAAA,CACA,8CACA,CAoBA,MAAAua,WAAAD,GACAha,YAAA6X,CAAA,CAAAnB,CAAA,EACA,kBAAAgB,IACAG,EAAAF,OAAA,IACA,qEAEA,MAAAjB,GAAAmB,EAAAnB,QAAA,aAKA,KAAAmB,MAAA,CAAAA,CAAA,CAIAf,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EACA,EA8DA,MAAAkD,WAAA1D,GACAxW,YAAAma,CAAA,CAAAC,CAAA,CAAA1D,CAAA,EACA,IAAA2D,EAAA,aAAAvC,IACAqC,aAAApC,GACA,GAAAsC,EACMF,EAAA,IAAAF,GAAA,IAAArC,GAAAuC,SACN,gBAAAzC,IACAyC,EAAAxC,OAAA,GACMwC,EAAA,IAAAF,GAAAE,QACN,IAAAA,CAAAA,aAAAH,EAAA,EACA,mFACA,CAKA,GAHAlY,KAAAA,IAAAsY,GACAA,CAAAA,EAAA,MAEA,SAAAA,GACAA,aAAA5D,EAAA,EACA,0DAEA,UAAA4D,EAAA,CACA,KAAAA,EAAA3D,IAAA,CACA,0DAEA3U,IAAAsY,EAAA1D,QAAA,EACA0D,CAAAA,EAAAA,EAAAjD,SAAA,YACA,KAOAV,EAAA,GACA2D,GAEA,GADA3D,CAAAA,EAAA2D,EAAA3D,IAAA,GACA4D,GACA5D,CAAAA,GAAA0D,EAAAtC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAUA,KAAA4D,aAAA,CAAAH,EAOA,KAAAI,uBAAA,CAAAF,EASA,KAAAD,aAAA,CAAAA,EAYA,KAAAI,QAAA,IAGA,IAAAC,EAAA,KAAAC,uBAAA,CAAAC,IAAA,MAgBA,MAAAC,gBAAA,UAAA3D,CAAA,EACA,OAAAwD,EAAAxD,EAAA,EAgBA,KAAA4D,sBAAA,UAAAC,CAAA,EACAL,EAAAK,EAAAH,IAAA,MACA,EAIAzD,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAKA,IAAA+D,EAAA,KAAAC,UAAA,CAAAjE,EAAAC,GACA,IAAA+D,EACA,iEAEA,OAAAA,EAAA7D,OAAA,CAAAH,EAAAC,EAAA,CAgCA0D,wBAAAzD,CAAA,EACA,GAAAA,EAAAxK,cAAA,MAAA6N,aAAA,CAAA5D,QAAA,GACA,QAAA0D,aAAA,EACAnD,EAAAxK,cAAA,MAAA2N,aAAA,CAAA1D,QAAA,EACA,MACA,CACA,IAAAqE,EAAA,KAAAP,QAAA,CAAAvD,CAAA,MAAAqD,aAAA,CAAA5D,QAAA,GACA,GAAAqE,GACA,EAAAA,EAAAlD,MAAA,EACAZ,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,GACA,OAAAqE,CACM,MAEN,QAAAE,KAAA,KAAAT,QAAA,EACA,IAAAO,EAAA,KAAAP,QAAA,CAAAS,EAAA,CACA,GAAAhE,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,EACA,OAAAqE,CACA,CAEA,MACA,qCASAjE,OAAAC,CAAA,CAAAC,CAAA,MAIAwC,CAHA1X,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAGA,IAAAkE,EAAA,KAAAZ,aAAA,CACAH,EAAAe,EAAApE,MAAA,CAAAC,EAAAC,GACAmE,EAAA,KAAAX,QAAA,CAAAL,EAAA,CACA,GAAArY,KAAAA,IAAAqZ,EAAA,CACA,IAAAC,EAAA,EACAD,EAAA,KAAAf,aAAA,CACA,KAAAG,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAGA+C,CADAA,EAAA,KAAA3C,qBAAA,GACA,CAAAqE,EAAAxE,QAAA,EAAAyD,EACMX,CAAA,CAAA2B,EAAAzE,QAAA,OAAA0D,aAAA,CAAAtD,MAAA,CAAAC,EAAAC,EAAAoE,EACN,MACA5B,EAAA2B,EAAArE,MAAA,CAAAC,EAAAC,EACA,CACA,OAAAwC,CAAA,CASA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA+D,EAAA,KAAAH,gBAAA,CAAA3D,GACA,GAAAnV,KAAAA,IAAAiZ,EAAA,CACA,IAAAG,EAAA,KAAAZ,aAAA,CACAa,EAAA,KAAAf,aAAA,CACAgB,EAAA,EAKA,OAJA,KAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAEAyE,EAAAxb,MAAA,CAAAuX,CAAA,CAAAiE,EAAAxE,QAAA,EAAAK,EAAAC,GACAoE,EAAAD,EAAAzb,MAAA,CAAAuX,CAAA,CAAAkE,EAAAzE,QAAA,EAAAK,EACAC,EAAAoE,EACA,QACAL,EAAArb,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,CAgBAqE,WAAAC,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAU,EAAA,IAAAmE,GAAA,KAAAD,EAAAzD,EAAAnB,GAEA,OADA,KAAA8D,QAAA,CAAAc,EAAA,CAAAlE,EACAA,CAAA,CAiBA4D,WAAAQ,CAAA,CAAAxE,CAAA,EACA,IAAQsE,EAAME,EAOd,OANA/c,EAAAgd,QAAA,CAAAD,KACA1Z,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAsE,EAAA,KAAAhB,aAAA,CAAAxD,MAAA,CAAA0E,EAAAxE,IAEA,KAAAwD,QAAA,CAAAc,EAAA,CACA,CAgCA,MAAAC,WAAA/E,GACAxW,YAAA0b,CAAA,CAAAJ,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAgF,CAAAA,aAAAxB,EAAA,EACA,yCAEA,IAAAvD,OAAAC,SAAA,CAAA0E,IAAA,EAAAA,EACA,4DAOA,GALA,iBAAAzD,GACA/V,KAAAA,IAAA4U,IACAA,EAAAmB,EACAA,EAAA,MAEAA,EAAA,CACA,IAAAA,CAAAA,aAAArB,EAAA,EACA,2CAEA,UAAAkF,EAAAtB,aAAA,EACA,GAAAvC,EAAApB,IAAA,EACAoB,EAAApB,IAAA,CAAAiF,EAAAtB,aAAA,CAAA3D,IAAA,CACA,6DAEA,oBAAAC,EACA,uDAEA,IACAD,EAAAiF,EAAAjF,IAAA,CACA,EAAAiF,EAAAjF,IAAA,EAEA,GADAA,CAAAA,EAAAoB,EAAAA,EAAApB,IAAA,KACAiF,EAAAnB,uBAAA,EACA9D,CAAAA,GAAAiF,EAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAgF,KAAA,CAAAA,EAKA,KAAAJ,OAAA,CAAAA,EAOA,KAAAzD,MAAA,CAAAA,GAAA,KAIAX,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CAGA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAKA,OAJA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA2E,EAAA,KAAAvD,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,EAAA,CAIAtE,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,GAIA,GAHA/U,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,YAAA0E,KAAA,CAAAV,UAAA,CAAAjE,EAAAC,GACA,gCAEA,IAAAoE,EAAA,EAWA,OAVA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,CACM2B,CAAA,MAAA9C,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAAoE,GACN,KAAA1E,QAAA,CACM8C,CAAA,MAAA9C,QAAA,KACN,KAAAgF,KAAA,CAAAnB,uBAAA,EACAf,CAAAA,CAAA,MAAAkC,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAEA9B,CAAA,CAIA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAIA,GAHA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,EACA,CAAAZ,EAAAxK,cAAA,MAAAiK,QAAA,EACA,+CAAAA,QAAA,EAEA,KAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAvE,EAAAC,GACA,IAAAP,EAAA2E,EACA,QAAAvD,MAAA,GACA,KAAAA,MAAA,CAAAnY,MAAA,CAAAuX,CAAA,MAAAP,QAAA,EAAAK,EAAAC,EAAAoE,GACA3E,GAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,GACA,QAAAM,KAAA,CAAAjF,IAAA,EACAA,EAAA,KAAAiF,KAAA,CAAAjF,IAAA,EACA,yDAGA,OAAAA,CAAA,CAKAY,UAAAC,CAAA,EACA,QAAAO,MAAA,CACA,YAAAA,MAAA,CAAAR,SAAA,CAAAC,EACA,CAEA,CAiBA,MAAAqE,WAAAnF,GACAxW,YAAAf,CAAA,CAAAyX,CAAA,EACA,kBAAAgB,IAAAzY,EAAA0Y,OAAA,IACAhB,OAAAC,SAAA,CAAA3X,IAAA,GAAAA,CAAA,EACA,wFACA,CAGA,IAAAwX,EAAA,GACAxX,aAAAyY,IACAjB,CAAAA,EAAAxX,CAAA,EACA,MAAAwX,EAAAC,GAQA,KAAAzX,MAAA,CAAAA,CAAA,CAIAiY,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAP,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,CAQA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAxX,MAAA,CAIA,GAHA,KAAAA,MAAA,YAAAyY,IACAjB,CAAAA,EAAAQ,EAAAhY,MAAA,EAEA,CAAAR,CAAAA,EAAAgd,QAAA,CAAAxE,IACAR,IAAAQ,EAAAhY,MAAA,EACA,gBAAAuY,GAAA,oBACA,qBAAAf,EAAA,mBAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAMA,OAJA8X,EAAA6E,KAAA,CAAA3E,EAAAjQ,QAAA,QAAAgQ,EAAAP,EAAA,OACA,KAAAxX,MAAA,YAAAyY,IACA,KAAAzY,MAAA,CAAAS,MAAA,CAAA+W,EAAAM,EAAAC,GAEAP,CACA,EAGA,IAAAO,GAAA,CAAAa,EAAAb,EAAAN,IAAA,IAAAkB,GAAAC,EAAAb,EAAAN,GAIAmF,GAAAnF,GAAA,IAAAoB,GAAA,EAAApB,GAIAoF,GAAApF,GAAA,IAAAoB,GAAA,EAAApB,GAIAqF,GAAArF,GAAA,IAAAgC,GAAAhC,GAIAsF,GAAAtF,GAAA,IAAAoC,GAAApC,GAGA/W,GAAA,CAAAuZ,EAAAxC,EAAAyC,IAAA,IAAAF,GAAAC,EAAAxC,EAAAyC,GAGAuC,GAAA,CAAAvB,EAAAC,EAAA1D,IAAA,IAAAwD,GAAAC,EAAAC,EAAA1D,GAGAuF,GAAA,CAAAhd,EAAAyX,IAAA,IAAAiF,GAAA1c,EAAAyX,EAqDA,OAAAwF,WAAA3E,GACAvX,YAAA0W,CAAA,EACA,SAAAA,GACA,KAAAA,QAAA,CAAAA,EACA,KAAAmB,MAAA,CAAAlY,GAAA,CACAmc,GAAA,UACAA,GAAA,iBACAG,GAAAjF,GAAA8E,KAAA,aACA,MAAApF,QAAA,CACA,CACAhX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,GAAAC,MAAAA,EACA,YAAAY,MAAA,CAAApB,IAAA,CAEA,IAAAhX,EAAmB,CACnB0c,MAAA1d,EAAA2d,IAAA,CAAAnF,EAAA,OACA,EACA,YAAAY,MAAA,CAAAnY,MAAA,CAAAD,EAAAsX,EAAAC,EACA,CACAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAvX,EAAA,KAAAoY,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,OAAAvX,EAAA,MAAAuH,QAAA,EACA,CACAkQ,QAAAH,CAAA,CAAAC,EAAA,GACA,OAAA8E,KAAArF,IAAA,CACAqF,KAAgBrF,IAAA,CAChB,GAAA7Y,CAAAA,GAAA,MAAA2M,WAAAwM,GAAA1X,KAAA,CAAA2X,EAAAA,EAAA,YAAAqF,QAAA,EACA,CACA,CACA,SAAAC,GAAA5F,CAAA,EACA,WAAAwF,GAAAxF,EACA,CACA,SAAA6F,GAAA7F,CAAA,EACA,OAAAuF,GAAA,GAAAvF,EACA,CAgFA,IAAA8F,GAAAd,GAAAI,GAAA,gBACAU,GAAAnB,UAAA,GAAA1b,GAAA,CACAqc,GAAA,YACAA,GAAA,SACAO,GAAA,SACA,mBACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,qBACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,0BACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAN,GAAA,YACAA,GAAA,SACAO,GAAA,SACA,2BACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,uCACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,sCACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,0CACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,yCACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,uBACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAN,GAAA,SACAO,GAAA,SACA,sBACAC,GAAAnB,UAAA,IAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAC,GAAA,SACA,oBACAC,GAAAnB,UAAA,IAAA1b,GAAA,CACAqc,GAAA,YACAM,GAAA,QACAC,GAAA,SACA,sBAQAzb,OAAAwW,MAAA,CAAAkF,GAAAhC,QAAA,EAAAtb,GAAA,IAAAiD,EAAAsU,IAAA,CAoDA,OAAAgG,WAAAlF,GACAvX,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAA4F,GAAAlG,CAAA,EACA,WAAA+F,GAAAR,GAAA,WAAA9d,EAAA0e,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA/W,GAAA,CACAmc,GAAA,WACAA,GAAA,SACAc,GAAA,oBACAA,GAAA,SACAjd,GAAA,CAAAoc,GAAA,4CAwDA,IAAA5d,EAAkC0e,SAAA,gDACL,IAAA1e,EAAc0e,SAAA,iDAWpB,IAAAE,GAAA,CAAAhf,QAAA,IAGvBD,EA0iBCif,GA1iBDhf,EA0iBCgf,GAAAhf,OAAA,CAziBDC,EAAA,oBAAAV,KAAAA,KAAA4O,EAAA,CAQA5O,EAPAW,EAAA,WACA,SAAA+e,GAAA,CACA,KAAAC,KAAA,IACA,KAAAC,YAAA,CAAAlf,EAAAkf,YAAA,CAGA,OADAF,EAAAxQ,SAAA,CAAAxO,EACC,IAAAgf,CACD,IAEA,SAAAjf,CAAA,EAGA,IAAAof,EAAA,CACAC,aAAA,oBAAA9f,EACA+f,SAAA,WAAA/f,GAAA,aAAA+D,OACA4a,KACA,eAAA3e,GACA,SAAAA,GACA,WACA,IAEU,OADV,IAAAggB,KACU,EACV,OAAAlY,EAAA,CACA,QACO,CACP,IACAmY,SAAA,aAAAjgB,EACAkgB,YAAA,gBAAAlgB,CAAA,EAGA,SAAAmgB,EAAAC,CAAA,EACA,OAAAA,GAAAC,SAAAnR,SAAA,CAAAoR,aAAA,CAAAF,EAAA,CAGA,GAAAP,EAAAK,WAAA,CACA,IAAAK,EAAA,CACA,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,yBAGAC,EACAC,YAAAC,MAAA,EACA,SAAAN,CAAA,EACA,OAAAA,GAAAG,EAAAI,OAAA,CAAAnd,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,IAAA,EACA,EAGA,SAAAQ,EAAAld,CAAA,EAIA,GAHA,iBAAAA,GACAA,CAAAA,EAAAmd,OAAAnd,EAAA,EAEA,4BAAAod,IAAA,CAAApd,GACA,0DAEA,OAAAA,EAAAqd,WAAA,GAGA,SAAAC,EAAA7d,CAAA,EAIA,MAHA,iBAAAA,GACAA,CAAAA,EAAA0d,OAAA1d,EAAA,EAEAA,CAAA,CAIA,SAAA8d,EAAAC,CAAA,EACA,IAAAld,EAAA,CACAO,KAAA,WACA,IAAApB,EAAgB+d,EAAA3E,KAAA,GAChB,OAAAjY,KAAAnB,KAAAqB,IAAArB,EAAAA,MAAAA,CAAA,CACA,GASA,OANA0c,EAAAE,QAAA,EACA/b,CAAAA,CAAA,CAAAD,OAAAC,QAAA,aACA,OAAAA,CACA,GAGAA,CAAA,CAGA,SAAAmd,EAAAC,CAAA,OAAAxf,GAAA,IAGAwf,aAAAD,EACAC,EAAAxT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACO,KAAA2d,MAAA,CAAA3d,EAAAP,EACD,QACN5B,MAAA6D,OAAA,CAAAgc,GACAA,EAAAxT,OAAA,UAAA0T,CAAA,EACO,KAAAD,MAAA,CAAAC,CAAA,IAAAA,CAAA,IACD,QACNF,GACA5d,OAAA+d,mBAAA,CAAAH,GAAAxT,OAAA,UAAAlK,CAAA,EACO,KAAA2d,MAAA,CAAA3d,EAAA0d,CAAA,CAAA1d,EAAA,CACP,OACA,CA+DA,SAAA8d,EAAAC,CAAA,EACA,GAAAA,EAAAC,QAAA,CACA,OAAAC,QAAAC,MAAA,2BACA,CACAH,EAAAC,QAAA,IAGA,SAAAG,EAAAC,CAAA,EACA,WAAAH,QAAA,SAAAI,CAAA,CAAAH,CAAA,EACAE,EAAAE,MAAA,YACAD,EAAAD,EAAApd,MAAA,CACA,EACAod,EAAAG,OAAA,YACAL,EAAAE,EAAAnb,KAAA,CACK,CACL,GAGA,SAAAub,EAAAvD,CAAA,EACA,IAAAmD,EAAA,IAAAK,WACAC,EAAAP,EAAAC,GAEA,OADAA,EAAAO,iBAAA,CAAA1D,GACAyD,CAAA,CAGA,SAAAE,EAAA3D,CAAA,EACA,IAAAmD,EAAA,IAAAK,WACAC,EAAAP,EAAAC,GAEA,OADAA,EAAAS,UAAA,CAAA5D,GACAyD,CAAA,CAGA,SAAAI,EAAAC,CAAA,EAIA,QAHAC,EAAA,IAAAzV,WAAAwV,GAAA5D,EAAA,MAAA6D,EAAA/gB,MAAA,EAGAoF,EAAA,EAAAA,EAAA2b,EAAA/gB,MAAA,CAAAoF,IACA8X,CAAA,CAAA9X,EAAA,CAAA8Z,OAAA8B,YAAA,CAAAD,CAAA,CAAA3b,EAAA,EAEA,OAAA8X,EAAA3b,IAAA,KAGA,SAAA0f,EAAAH,CAAA,EACA,GAAAA,EAAA1gB,KAAA,CACM,OAAA0gB,EAAA1gB,KAAA,GAKN,CAHA,IAAA2gB,EAAA,IAAAzV,WAAAwV,EAAAI,UAAA,EAEA,OADAH,EAAA5c,GAAA,KAAAmH,WAAAwV,IACAC,EAAAI,MAAA,CAIA,SAAAC,GAAA,CA0FA,OA1FA,KAAArB,QAAA,IAGA,KAAAsB,SAAA,UAAAvB,CAAA,EACA,KAAAwB,SAAA,CAAAxB,EACAA,EAEA,iBAAAA,EACQ,KAAAyB,SAAA,CAAAzB,EACR5B,EAAAlB,IAAA,EAAAqB,KAAA9Q,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAA0B,SAAA,CAAA1B,EACR5B,EAAAI,QAAA,EAAAmD,SAAAlU,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAA4B,aAAA,CAAA5B,EACR5B,EAAAC,YAAA,EAAAwD,gBAAApU,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAAyB,SAAA,CAAAzB,EAAA/X,QAAA,GACRmW,EAAAK,WAAA,EAAAL,EAAAlB,IAAA,EAAAwB,EAAAsB,IACA,KAAA8B,gBAAA,CAAAX,EAAAnB,EAAAqB,MAAA,EAEQ,KAAAG,SAAA,KAAAjD,KAAA,MAAAuD,gBAAA,IACR1D,EAAAK,WAAA,EAAAO,CAAAA,YAAAvR,SAAA,CAAAoR,aAAA,CAAAmB,IAAAjB,EAAAiB,EAAA,EACQ,KAAA8B,gBAAA,CAAAX,EAAAnB,GAER,KAAAyB,SAAA,CAAAzB,EAAAje,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAqS,GAhBQ,KAAAyB,SAAA,IAmBR,MAAA9B,OAAA,CAAAoC,GAAA,mBACA,iBAAA/B,EACU,KAAAL,OAAA,CAAAtb,GAAA,4CACV,KAAAqd,SAAA,OAAAA,SAAA,CAAA9f,IAAA,CACU,KAAA+d,OAAA,CAAAtb,GAAA,qBAAAqd,SAAA,CAAA9f,IAAA,EACVwc,EAAAC,YAAA,EAAAwD,gBAAApU,SAAA,CAAAoR,aAA8E,CAAAmB,IAC9E,KAAAL,OAAA,CAAAtb,GAAA,mEAEA,EAGA+Z,EAAAlB,IAAA,GACA,KAAAA,IAAA,YACA,IAAA8E,EAAAjC,EAAA,MACA,GAAAiC,EACA,OAAAA,CAAA,CAGA,QAAAN,SAAA,CACU,OAAAxB,QAAAI,OAAA,MAAAoB,SAAA,CAOV,CANA,QAAAI,gBAAA,CACU,OAAA5B,QAAAI,OAAA,KAAA/B,KAAA,MAAAuD,gBAAA,GAKV,CAJA,SAAAF,aAAA,CAGA,OAAA1B,QAAAI,OAAA,KAAA/B,KAAA,MAAAkD,SAAA,GACA,OAHU,+CAMV,KAAAhD,WAAA,mBACA,KAAAqD,gBAAA,CACU/B,EAAA,OAAAG,QAAAI,OAAA,MAAAwB,gBAAA,EAEV,KAAA5E,IAAA,GAAA+E,IAAA,CAAAxB,EACA,GAIA,KAAAyB,IAAA,YACA,IAAAF,EAAAjC,EAAA,MACA,GAAAiC,EACA,OAAAA,CAAA,CAGA,QAAAN,SAAA,CACQ,OAAAb,EAAA,KAAAa,SAAA,CAOR,CANA,QAAAI,gBAAA,CACQ,OAAA5B,QAAAI,OAAA,CAAAS,EAAA,KAAAe,gBAAA,EAKR,CAJA,SAAAF,aAAA,CAGA,OAAA1B,QAAAI,OAAA,MAAAmB,SAAA,CACA,OAHQ,+CAMRrD,EAAAI,QAAA,EACA,MAAAA,QAAA,YACA,YAAA0D,IAAA,GAAAD,IAAA,CAAAlK,EACA,GAGA,KAAAoK,IAAA,YACA,YAAAD,IAAA,GAAAD,IAAA,CAAAxf,KAAA2f,KAAA,GAGA,KA1MA1C,EAAAjS,SAAA,CAAAmS,MAAA,UAAA3d,CAAA,CAAAP,CAAA,EACAO,EAAAkd,EAAAld,GACAP,EAAA6d,EAAA7d,GACA,IAAA2gB,EAAA,KAAAliB,GAAA,CAAA8B,EAAA,CACA,KAAA9B,GAAA,CAAA8B,EAAA,CAAAogB,EAAAA,EAAA,KAAA3gB,EAAAA,CAAA,EAGAge,EAAAjS,SAAA,iBAAAxL,CAAA,EACA,YAAA9B,GAAA,CAAAgf,EAAAld,GAAA,EAGAyd,EAAAjS,SAAA,CAAAsU,GAAA,UAAA9f,CAAA,EAEA,OADAA,EAAAkd,EAAAld,GACA,KAAAqgB,GAAA,CAAArgB,GAAA,KAAA9B,GAAA,CAAA8B,EAAA,OAGAyd,EAAAjS,SAAA,CAAA6U,GAAA,UAAArgB,CAAA,EACA,YAAA9B,GAAA,CAAAuN,cAAA,CAAAyR,EAAAld,GAAA,EAGAyd,EAAAjS,SAAA,CAAApJ,GAAA,UAAApC,CAAA,CAAAP,CAAA,EACA,KAAAvB,GAAA,CAAAgf,EAAAld,GAAA,CAAAsd,EAAA7d,EAAA,EAGAge,EAAAjS,SAAA,CAAAtB,OAAA,UAAAoW,CAAA,CAAAC,CAAA,EACA,QAAAvgB,KAAA,KAAA9B,GAAA,CACA,KAAAA,GAAA,CAAAuN,cAAA,CAAAzL,IACAsgB,EAAA5U,IAAA,CAAA6U,EAAA,KAAAriB,GAAA,CAAA8B,EAAA,CAAAA,EAAA,KAEA,EAGAyd,EAAAjS,SAAA,CAAAzH,IAAA,YACA,IAAAyZ,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACKwd,EAAAjhB,IAAA,CAAAyD,EACL,GACAud,EAAAC,EAAA,EAGAC,EAAAjS,SAAA,CAAA8K,MAAA,YACA,IAAAkH,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,EACK+d,EAAAjhB,IAAA,CAAAkD,EACL,GACA8d,EAAAC,EAAA,EAGAC,EAAAjS,SAAA,CAAAxJ,OAAA,YACA,IAAAwb,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACKwd,EAAAjhB,IAAA,EAAAyD,EAAAP,EAAA,CACL,GACA8d,EAAAC,EAAA,EAGArB,EAAAE,QAAA,EACAoB,CAAAA,EAAAjS,SAAA,CAAAnL,OAAAC,QAAA,EAAAmd,EAAAjS,SAAA,CAAAxJ,OAAA,EAoJA,IAAAwe,EAAA,+CAGA,SAAAC,EAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAE,WAAA,GACA,OAAAJ,EAAAvD,OAAA,CAAA0D,GAAA,GAAAA,EAAAD,CAAA,CAGA,SAAAG,EAAAlgB,CAAA,CAAAU,CAAA,EACA,IAAA0c,EAAA1c,CAAAA,EAAAA,GAAA,IAAA0c,IAAA,CAGA,GAAApd,aAAAkgB,EAAA,CACA,GAAAlgB,EAAAqd,QAAA,CACA,gCAEA,KAAA3V,GAAA,CAAA1H,EAAA0H,GAAA,CACA,KAAAyY,WAAA,CAAAngB,EAAAmgB,WAAA,CACAzf,EAAAqc,OAAA,EACA,MAAAA,OAAA,KAAAD,EAAA9c,EAAA+c,OAAA,GAEA,KAAAgD,MAAA,CAAA/f,EAAA+f,MAAA,CACA,KAAAK,IAAA,CAAApgB,EAAAogB,IAAA,CACA,KAAAC,MAAA,CAAArgB,EAAAqgB,MAAA,CACAjD,GAAApd,IAAA,EAAAA,EAAA4e,SAAA,GACAxB,EAAApd,EAAA4e,SAAA,CACA5e,EAAAqd,QAAA,IAEA,MACA,KAAA3V,GAAA,CAAA8U,OAAAxc,EAAA,CAYA,GATA,KAAAmgB,WAAA,CAAAzf,EAAAyf,WAAA,OAAAA,WAAA,gBACAzf,CAAAA,EAAAqc,OAAA,QAAAA,OAAA,GACA,MAAAA,OAAA,KAAAD,EAAApc,EAAAqc,OAAA,GAEA,KAAAgD,MAAA,CAAAD,EAAApf,EAAAqf,MAAA,OAAAA,MAAA,SACA,KAAAK,IAAA,CAAA1f,EAAA0f,IAAA,OAAAA,IAAA,OACA,KAAAC,MAAA,CAAA3f,EAAA2f,MAAA,OAAAA,MAAA,MAAAC,QAAA,MAGA,cAAAP,MAAA,gBAAAA,MAAA,GAAA3C,EACA,6DAEA,KAAAuB,SAAA,CAAAvB,EAAA,CAOA,SAAAjI,EAAAiI,CAAA,EACA,IAAAmD,EAAA,IAAAxB,SAYA,OAXA3B,EACAoD,IAAA,GACAvJ,KAAA,MACA1N,OAAA,UAAAkX,CAAA,EACA,GAAAA,EAAA,CACA,IAAAxJ,EAAAwJ,EAAAxJ,KAAA,MACA5X,EAAA4X,EAAAiB,KAAA,GAAAwI,OAAA,YACA5hB,EAAAmY,EAAApY,IAAA,MAAA6hB,OAAA,YACAH,EAAAvD,MAAA,CAAA2D,mBAAAthB,GAAAshB,mBAAA7hB,GACO,IAEPyhB,CAAA,CAGA,SAAAK,EAAAC,CAAA,EACA,IAAA9D,EAAA,IAAAD,EAYA,OARAgE,EADAJ,OAAA,qBACAzJ,KAAA,UAAA1N,OAAA,UAAAwX,CAAA,EACA,IAAAC,EAAAD,EAAA9J,KAAA,MACAlY,EAAAiiB,EAAA9I,KAAA,GAAAsI,IAAA,GACA,GAAAzhB,EAAA,CACA,IAAAD,EAAAkiB,EAAAniB,IAAA,MAAA2hB,IAAA,GACAzD,EAAAC,MAAA,CAAAje,EAAAD,EACK,IAELie,CAAA,CAKA,SAAAkE,EAAAC,CAAA,CAAAxgB,CAAA,EACAA,GACAA,CAAAA,EAAA,IAGA,KAAA1B,IAAA,WACA,KAAAoL,MAAA,CAAA1J,KAAAP,IAAAO,EAAA0J,MAAA,KAAA1J,EAAA0J,MAAA,CACA,KAAA+W,EAAA,MAAA/W,MAAA,YAAAA,MAAA,KACA,KAAAgX,UAAA,gBAAA1gB,EAAAA,EAAA0gB,UAAA,MACA,KAAArE,OAAA,KAAAD,EAAApc,EAAAqc,OAAA,EACA,KAAArV,GAAA,CAAAhH,EAAAgH,GAAA,KACA,KAAAiX,SAAA,CAAAuC,EAAA,CAjDAhB,EAAArV,SAAA,CAAAwW,KAAA,WAA8B,CAC9B,WAAAnB,EAAA,MAAA9C,KAAA,KAAAwB,SAAA,IAkCAF,EAAA3T,IAAA,CAAAmV,EAAArV,SAAA,EAgBA6T,EAAA3T,IAAA,CAAAkW,EAAApW,SAAA,EAGAoW,EAAApW,SAAA,CAAAwW,KAAA,YACA,WAAAJ,EAAA,KAAArC,SAAA,EACAxU,OAAA,KAAAA,MAAA,CACAgX,WAAA,KAAAA,UAAA,CACArE,QAAA,IAAAD,EAAA,KAAAC,OAAA,EACKrV,IAAA,KAAAA,GAAA,EACL,EAGAuZ,EAAA3e,KAAA,YACA,IAAAgf,EAAA,IAAAL,EAAA,MAAA7W,OAAA,EAAAgX,WAAA,KAEA,OADAE,EAAAtiB,IAAA,SACAsiB,CAAA,EAEA,IAAAC,EAAA,sBAGAN,EAAAO,QAAA,UAAA9Z,CAAA,CAAA0C,CAAA,EACA,GAAAmX,KAAAA,EAAAjF,OAAA,CAAAlS,GACA,wCAGA,WAAA6W,EAAA,MAAA7W,OAAAA,EAAA2S,QAAA,CAAA0E,SAAA/Z,CAAA,KAGAtL,EAAAmf,YAAA,CAAA5f,EAAA4f,YAAA,CACA,IACI,IAAAnf,EAAAmf,YAAA,CACJ,MAAAzU,EAAA,CACA1K,EAAAmf,YAAA,UAAA9c,CAAA,CAAAY,CAAA,EACA,KAAAZ,OAAA,CAAAA,EACA,KAAAY,IAAA,CAAAA,EACA,IAAAiD,EAAAwH,MAAArL,EACA,MAAAijB,KAAA,CAAApf,EAAAof,KAAA,EAEAtlB,EAAAmf,YAAA,CAAA1Q,SAAA,CAAA1L,OAAA8C,MAAA,CAAA6H,MAAAe,SAAA,EACAzO,EAAAmf,YAAA,CAAA1Q,SAAA,CAAAxM,WAAA,CAAAjC,EAAAmf,YAAA,CAGA,SAAAD,EAAAtb,CAAA,CAAA2hB,CAAA,EACA,WAAArE,QAAA,SAAAI,CAAA,CAAAH,CAAA,MAAAqE,EAAA,IAAA1B,EAAAlgB,EAAA2hB,GAGA,GAAAC,EAAAvB,MAAA,EAAAuB,EAAAvB,MAAA,CAAAwB,OAAA,CACA,OAAAtE,EAAA,IAAAnhB,EAAAmf,YAAA,0BAEA,IAAAuG,EAAA,IAAAC,eAGA,SAAAC,GAAA,CACAF,EAAAG,KAAA,GAGAH,EAAAnE,MAAA,YACA,IAAAjd,EAAA,CACA0J,OAAA0X,EAAA1X,MAAA,CACAgX,WAAAU,EAAAV,UAAA,CACArE,QAAA6D,EAAAkB,EAAAI,qBAAA,OACA,CACAxhB,CAAAA,EAAAgH,GAAA,iBAAAoa,EAAAA,EAAAK,WAAA,CAAAzhB,EAAAqc,OAAA,CAAAoC,GAAA,kBACA,IAAA/B,EAAA,aAAA0E,EAAAA,EAAAR,QAAA,CAAAQ,EAAAM,YAAA,CACA1E,EAAA,IAAAuD,EAAA7D,EAAA1c,GAAA,EAGAohB,EAAAlE,OAAA,YACAL,EAAA,sCAGAuE,EAAAO,SAAA,YACA9E,EAAA,sCAGAuE,EAAAQ,OAAA,YACA/E,EAAA,IAAAnhB,EAAAmf,YAAA,2BAEAuG,EAAAS,IAAA,CAAAX,EAAA7B,MAAA,CAAA6B,EAAAla,GAAA,KAGAka,YAAAA,EAAAzB,WAAA,CACQ2B,EAAAU,eAAA,IACR,SAAAZ,EAAAzB,WAAA,EACA2B,CAAAA,EAAAU,eAAA,KAGA,iBAAAV,GAAAtG,EAAAlB,IAAA,EACAwH,CAAAA,EAAAW,YAAA,SAGAb,EAAA7E,OAAA,CAAAxT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACOyiB,EAAAY,gBAAA,CAAArjB,EAAAP,EAAA,GAGP8iB,EAAAvB,MAAA,GAAAuB,EAAAvB,MAAA,CAAAsC,gBAAA,SAAAX,GAGAF,EAAAc,kBAAA,YAEA,IAAAd,EAAAe,UAAA,EACAjB,EAAAvB,MAAA,CAAAyC,mBAAA,SAAAd,EAEA,GAGKF,EAAAiB,IAAA,UAAAnB,EAAAhD,SAAA,MAAAgD,EAAAhD,SAAA,CACL,GAEAtD,EAAA0H,QAAA,IAGArnB,EAAA2f,KAAA,GACA3f,EAAA2f,KAAA,CAAAA,EACA3f,EAAAmhB,OAAA,CAAAA,EACAnhB,EAAAukB,OAAA,CAAAA,EACAvkB,EAAAslB,QAAA,CAAAA,GAGA7kB,EAAA0gB,OAAA,CAAAA,EACA1gB,EAAA8jB,OAAA,CAAAA,EACA9jB,EAAA6kB,QAAA,CAAAA,EAAA7kB,EAAAkf,KAAA,CAAAA,EAE8Dnc,OAAA8L,cAAA,CAAA7O,EAAA,cAAA0C,MAAA,IAK9D,EAAC,IAEDxC,EAAAgf,KAAA,CAAA2H,QAAA,IAEA,OAAA3mB,EAAAgf,KAAA,CAAA0H,QAAA,CAKA5mB,CADAA,EAAAG,CADAA,EAAAD,GACAgf,KAAA,EACA4H,OAAA,CAAA3mB,EAAA+e,KAA2B,CAC3Blf,EAAAkf,KAAA,CAAA/e,EAAA+e,KAAA,CACAlf,EAAA0gB,OAAA,CAAAvgB,EAAAugB,OAAA,CACA1gB,EAAA8jB,OAAA,CAAA3jB,EAAA2jB,OAAA,CACA9jB,EAAA6kB,QAAA,CAAA1kB,EAAA0kB,QAAA,CACA9kB,EAACC,OAAA,CAAAA,EAEDgf,GAAAhf,OAAA,CA6CA,IAAI+mB,GAAAtmB,EAAYumB,QAAA,EACZvmB,EAAAmB,MAAY,GAAE,kBACdnB,EAAAmB,MAAY,EAAEnB,EAAAwmB,MAAA,CAAAxmB,EAAeoB,SAAA,kCAC7BpB,EAAAmB,MAAY,EAAAnB,EAAAoB,SAAA,mCAChBpB,EAAQmB,MAAA,CAAS,CACTnB,EAAAymB,GAAA,SACRzmB,EAAAwmB,MAAA,CAAAxmB,EAAAoB,SAAA,8BACA,gBACA,CAAAkC,KAAAA,EAAAtD,EAAAsd,GAAA,IACA,SAAAoJ,GAAAzlB,CAAA,EACA,OAAAqlB,GAAAhO,MAAA,CAAArX,EAAA,CAilBA,SAAA0lB,GAAAzO,CAAA,EACA,WAAA0O,GAAAnJ,GAAA,MAAAgJ,GAAAI,UAAA,CAAAtO,GAAA,GAAA1Y,EAAAye,QAAA,GAAApG,EACA,CACA,SAAA9W,GAAA8W,CAAA,EACA,WAAA0O,GAAAnJ,GAAA,WAAA9d,EAAA0e,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA,SAAA4O,GAAAzN,CAAA,CAAAnB,CAAA,EACA,WAAA6O,GAAA1N,EAAAnB,EACA,CACA,MAAA0O,WAAA7N,GACAvX,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,MAAAuO,WAAAhO,GACAvX,YAAA6X,CAAA,CAAAnB,CAAA,EACA,SAAAA,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAAyC,aAAA,CAAAwB,IACA,CACApc,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,UACA,MAAAC,EACA,KAAAY,MAAA,CAAApB,IAAA,MAAA6D,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,IAEA,KAAAsD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,GACA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAFA,CAIAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,YAEA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,EACA,OACA,8BAAAa,MAAA,CAAAnB,QAAA,EAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAA,IACA,CACA,CACA,MAAAiO,WAAArnB,IAIAkf,UAAA,CACA,IAAAjf,EAAkB,MAAM2nB,OAAA,GAAAC,OAAA,GACxB1O,EAAAtY,EAAA2d,IAAA,CAAAve,GACA,GAAAkZ,IAAAA,EAAA9X,MAAA,CACA,OAAA8X,CACA,CACA,GAAAA,EAAA9X,MAAA,IACA,6BAEA,IAAAymB,EAAAjnB,EAAAknB,KAAA,IAEA,OADA5O,EAAA6O,IAAA,CAAAF,GACAA,CACA,CAIA,OAAAL,WAAAjF,CAAA,EACA,GAAAA,IAAAA,EAAAnhB,MAAA,CACA,sCAAAmhB,EAAAnhB,MAAA,IAEA,WAAAgmB,GAAA,IAAA7E,EAAA,CACAqF,OAAA,GACAvmB,GAAA,SAAAmF,EAAA2C,QAAA,OAAA3H,KAAA,MACAmB,IAAA,QACA,CACA,CACAb,GAAA,CACAC,GAAA,QACAA,GAAA,SACAulB,GAAA,UACAG,GAAA1lB,KAAA,YACA,KACA,IAAAimB,EAAAnK,GAAAG,GAAA,sBAAAiK,GAIK,OAHLD,EAAAxK,UAAA,GAAA1b,GAAA,qBACAkmB,EAAAxK,UAAA,GAAA1b,GAAA,mBACAkmB,EAAAxK,UAAA,GAAA1b,GAAA,cACKkmB,CACL,YACAP,GAAAH,KAAA,YACAA,GAAA,mBACAG,GAAA1lB,KAAA,kBACA,EA8zBA,IAAAzB,EAAA0e,SAAA,oCAwYA,gBAAArf,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCz5NA,IAAAqoB,EAAAroB,EAAyB,MACzBsoB,EAAAtoB,EAAoB,MACpBuoB,EAAAvoB,EAAA,KAIA,OAAAwoB,EACAlmB,YAAAmmB,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CACA,OAAA/c,OAAA,CACA,IAAAgd,EAAA1oB,EAAA,MACA,IAAA0oB,EAAA9c,GAAA,CAAA+c,aAAA,EAAAD,KAAAA,EAAA9c,GAAA,CAAA+c,aAAA,CACA,yEAEA,IAAAF,EAAAH,EAAAM,OAAA,CAAAC,aAAA,CAAAR,EAAAtnB,MAAA,CAAA2d,IAAA,CAAA5a,KAAA2f,KAAA,SAAAqF,YAAA,CAAAJ,EAAA9c,GAAA,CAAA+c,aAAA,EACSnf,SAAA,OACT,MACA,WAAAgf,EAAAC,EACA,CACA,MAAAlc,gBAAA1K,CAAA,EAOA,MANA,GAAA0mB,EAAA3mB,sBAAA,EAAAC,GACAA,EAAAkH,IAAA,OAAA0f,KAAA,GAGA5mB,EAAAyK,WAAA,MAAAmc,KAAA,EAEA5mB,CACA,CACA,MAAA8L,oBAAAJ,CAAA,EACA,OAAAA,EAAA/L,GAAA,KACA,GAAA+mB,EAAA3mB,sBAAA,EAAA4D,GACAA,EAAAuD,IAAA,OAAA0f,KAAA,GAGAjjB,EAAA8G,WAAA,MAAAmc,KAAA,EAESjjB,GAET,CACA,IAAAtD,WAAA,CACA,YAAAumB,KAAA,CAAAvmB,SAAA,CAEA,CACA7B,EAAA0oB,CAAA,CAAAP,CAAA,gBAAA1oB,CAAA,CAAAO,CAAA,CAAAL,CAAA,eC/Ca,IAEb8I,EAFa4f,EAAA1oB,EAAA,MAkBb,SAAAgB,EAAAC,CAAA,CAAAC,CAAA,EACA,OAAAC,MAAAC,KAAA,SAAAC,KAAAC,IAAA,CAAAL,EAAAM,MAAA,CAAAL,KAAAM,GAAA,EAAAC,EAAAC,IAAAT,EAAAU,KAAA,CAAAD,EAAAR,EAAA,CAAAQ,EAAA,GAAAR,GACA,CAjBAkC,OAAA8L,cAAA,CAAA7O,EAA8B,aAAG,CAAc0C,MAAG,KAClD1C,EAAAuB,sBAAA,CAAAvB,EAAAW,MAAA,CAAAX,EAAA2oB,SAAA,QAKA3oB,EAAA2oB,SAAA,CAAAN,EAAA9c,GAAA,CAAAqd,cAAA,EACA,oBAAAva,QAAA,SAAA5F,CAAAA,EAAA4F,OAAAga,OAAA,GAAA5f,KAAA,IAAAA,EAAA,OAAAA,EAAAiG,cAAA,UAWA1O,EAAAW,MAAA,CAAAA,EAOA,IAAAY,EAAA,GACA,YAAAC,CAEAxB,CAAAA,EAAAuB,sBAAA,CAAAA,CAAA,gBAAAxB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC9BA,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAhpB,CAAA,ECHa,aAGb,IAAAipB,EAAA,YACAC,EAAA,YACAC,EAAA,0BACAC,EAAA,yBAAAC,EAAA,WAGAC,EAAA,WAAAD,EAAAE,MAAA,EACAC,EAAA,OAAAH,EAAAE,MAAA,CAAAH,EAAAG,MAAA,OAAAE,EAAA,cAAAL,EAAAG,MAAA,OAGAG,EAAA,CAAA1iB,EAAAuZ,EAAAuD,IAAA,CACA,IAAA6F,EAAA,GACAC,EAAA,GAAAC,EAAA,GAGA,QAAAtjB,EAAA,EAAAA,EAAAS,EAAA7F,MAAA,CAAAoF,IAAA,KAAAujB,EAAA9iB,CAAA,CAAAT,EAAA,CAGAojB,GAAAV,EAAA3I,IAAA,CAAAwJ,IACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,GAAA,IAAAS,EAAAzF,KAAA,CAAAgF,GACAojB,EAAA,GACAE,EAAAD,EACAA,EAAA,GACArjB,KACAqjB,GAAAC,GAAAX,EAAA5I,IAAA,CAAAwJ,IACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,EAAA,OAAAS,EAAAzF,KAAA,CAAAgF,EAAA,GACAsjB,EAAAD,EACAA,EAAA,GACAD,EAAI,KAEJA,EAAApJ,EAAAuJ,KAAAA,GAAAhG,EAAAgG,KAAAA,EACAD,EAAAD,EACAA,EAAA9F,EAAAgG,KAAAA,GAAAvJ,EAAAuJ,KAAAA,EACA,CAGA,OAAA9iB,CAAA,EAGA+iB,EAAA,CAAAlmB,EAAA0c,KAAA4I,EAAAa,SAAA,GAGAnmB,EAAA0gB,OAAA,CAAA4E,EAAAc,GAAA1J,EAAA0J,KAGAC,EAAA,CAAArmB,EAAAigB,KACA0F,EAAAQ,SAAA,GAAAP,EAAAO,SAAA,GAGAnmB,EAAA0gB,OAAA,CAAAiF,EAAA,CAAAnoB,EAAA8oB,IAAArG,EAAAqG,IACA5F,OAAA,CAAAkF,EAAAW,GAAAtG,EAAAsG,KAGAC,EAAA,CAAAxmB,EAAAU,IAAA,CACA,sBAAAV,GAAA9C,MAAA6D,OAAA,CAAAf,EAAA,EACA,gEAiBA,GAdAU,EAAA,CACA+lB,WAAA,GACAP,6BAAA,GACA,GAAAxlB,CAAA,EAWAV,IAAAA,CAPAA,EADA9C,MAAA6D,OAAA,CAAAf,GACAA,EAAAzC,GAAA,CAAAiC,GAAAA,EAAAghB,IAAA,IACAkG,MAAA,CAAAlnB,GAAAA,EAAAlC,MAAA,EACGuB,IAAA,MAEHmB,EAAAwgB,IAAA,IAGAljB,MAAA,CACA,SAGA,IAAAof,EAAAhc,CAAA,IAAAA,EAAAimB,MAAA,CACAxjB,GAAAA,EAAAuZ,WAAA,GACAvZ,GAAAA,EAAAyjB,iBAAA,CAAAlmB,EAAAimB,MAAA,EACA1G,EAAAvf,CAAA,IAAAA,EAAAimB,MAAA,CACAxjB,GAAAA,EAAA8c,WAAA,GAAA9c,GAAAA,EAAA0jB,iBAAA,CAAAnmB,EAAAimB,MAAA,EAGA,GAAA3mB,IAAAA,EAAA1C,MAAA,CACA,OAAAoD,EAAA+lB,UAAA,CAAAxG,EAAAjgB,GAAA0c,EAAA1c,EAAA,CAEA,IAAA8mB,EAAA9mB,IAAA0c,EAAA1c,GAmBA,OAhBA8mB,GACA9mB,CAAAA,EAAA6lB,EAAA7lB,EAAA0c,EAAAuD,EAAA,EAEAjgB,EAAAA,EAAA0gB,OAAA,CAAA+E,EAAA,IAIAzlB,EADAU,EAAAwlB,4BAAA,CACGA,EAAAlmB,EAAA0c,GAEHA,EAAA1c,GAGAU,EAAA+lB,UAAA,EACAzmB,CAAAA,EAAAigB,EAAAjgB,EAAA+mB,MAAA,KAAA/mB,EAAAtC,KAAA,KAGA2oB,EAAArmB,EAAAigB,EAAA,CAGA9jB,CAAAA,EAAAC,OAAA,CAAAoqB,EACsBrqB,EAAAC,OAAA,SAAAoqB,CAAA,gBAAA3qB,CAAA,CAAAO,CAAA,CAAAL,CAAA,eChHT,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAc,CAAA7O,EAAgB,aAAgB,CAAA0C,MAAG,EAAW,GAC5D1C,EAAAmB,GAAA,CAAAnB,EAAAY,KAAwB,CAAAZ,EAAAgnB,QAAQ,CAAehnB,EAAA8qB,GAAA,CAAA9qB,EAAA8B,KAAA,CAAA9B,EAAA+qB,MAAA,CAAA/qB,EAAAgrB,GAAA,CAAAhrB,EAAAirB,IAAA,CAAAjrB,EAAAinB,MAAA,CAAAjnB,EAAA6B,SAAA,CAAA7B,EAAAkrB,IAAA,CAAAlrB,EAAAmrB,IAAA,CAAAnrB,EAAAorB,IAAA,CAAAprB,EAAAqrB,IAAA,CAAArrB,EAAAsrB,GAAA,CAAAtrB,EAAAknB,GAAA,CAAAlnB,EAAA4B,MAAA,CAAA5B,EAAAurB,GAAA,CAAAvrB,EAAAwrB,GAAA,CAAAxrB,EAAAyrB,GAAA,CAAAzrB,EAAA+d,GAAA,CAAA/d,EAAA0rB,GAAA,CAAA1rB,EAAA2rB,GAAA,CAAA3rB,EAAA4rB,EAAA,CAAA5rB,EAAA8d,EAAA,QAC/C,IAAA+N,EAAkBlsB,EAAyB,KAC3CsoB,EAAAtoB,EAAgC,MAChCmsB,EAAAlB,EAAsBjrB,EAAuB,OAC7C,IAAAosB,EAAApsB,EAAuC,KACvCoD,OAAA8L,cAAA,CAAA7O,EAAA,KAAqC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAjO,EAAA,IAC5E/a,OAAA8L,cAAA,CAAA7O,EAAA,MAAsCgsB,WAAE,GAAAjJ,IAAA,kBAAqCgJ,EAAAE,EAAA,IAC7ElpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAJ,GAAA,IAC7E5oB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAG,GAAA,IAC7EnpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAhO,GAAA,IAC7Ehb,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAI,GAAA,IAC7EppB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAP,GAAA,IAC7EzoB,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAA2C,GAAAjJ,IAAA,kBAAqCgJ,EAAAR,GAAA,IAChFxoB,OAAA8L,cAAA,CAAA7O,EAAA,UAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAgJ,EAAAnqB,MAAA,GACA,OAAAwqB,UAAAP,EAAApT,MAAA,CACAxW,YAAAyW,CAAA,CAAA2T,CAAA,CAAA1T,CAAA,EACA,MAAAD,EAAAC,GACA,KAAAuF,IAAA,IAAA2N,EAAA3N,IAAA,EAAAxF,GACA,KAAA2T,MAAA,CAAAA,CACA,CACAtT,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAqT,EAAA,IAAAR,EAAAhF,OAAA,MAAA5I,IAAA,CAAAnF,MAAA,CAAAC,EAAAC,GAAA,gBACA,KAAAoT,MAAA,CACAC,EAAAC,QAAA,QAAA7T,IAAA,EAAAuM,KAAA,GAEAqH,CADA,CAGA3qB,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAIA,OAHA,KAAAoT,MAAA,EACAnT,CAAAA,EAAAA,EAAAsT,MAAA,QAAA9T,IAAA,GAEA,KAAAwF,IAAA,CAAAvc,MAAA,CAAAuX,EAAAuT,WAAA,CAAA/rB,EAAA,UAAAgY,IAAA,EAAAM,EAAAC,EACA,CACA,CACA,SAAAiO,EAAAvO,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA2S,EAAA3S,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA0S,EAAA1S,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAyS,EAAAzS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAwS,EAAAxS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAuS,EAAAvS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAnBA3Y,EAAAknB,GAAA,CAAAA,EAIAlnB,EAAAsrB,GAAA,CAAAA,EAIAtrB,EAAAqrB,IAAA,CAAAA,EAIArrB,EAAAorB,IAAA,CAAAA,EAIAprB,EAAAmrB,IAAA,CAAAA,EAIAnrB,EAAAkrB,IAAA,CAAAA,CACA,OAAA7D,UAAAwE,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAApX,EAAA8W,CAAA,EACA,WAAA0O,EAAA,GAAAwE,EAAA3N,IAAA,aAAA+J,EAAAnJ,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA3Y,EAAA6B,SAAA,CAAAA,CACA,OAAA6qB,UAAAb,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAAnB,CAAA,EACA,SAAAA,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAAyC,aAAA,IAAAsP,EAAA/N,EAAA,GACA,CACAnc,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,UACA,MAAAC,EACA,KAAAqD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,IAEA,KAAAsD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,GACA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAFA,CAIAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,YAEA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,EACA,OACA,6BAAAN,QAAA,EAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAA,IACA,OACA,6BAAAN,QAAA,EAEA,CACA,SAAAsO,EAAAnN,CAAA,CAAAnB,CAAA,EACA,WAAA+T,EAAA5S,EAAAnB,EACA,CAEA,SAAAsS,EAAAtS,CAAA,EACA,WAAA0O,EAAA,GAAAwE,EAAA/N,EAAA,IAAA6O,EAAAC,EAAAjU,EACA,CAEA,SAAAgU,EAAAjqB,CAAA,EACA,GAAAA,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,QACA,OACA,uBAAAA,EAAA,CAEA,SAAAkqB,EAAAlqB,CAAA,EACA,OAAAA,EAAA,IAEA,SAAAsoB,EAAA6B,CAAA,CAAAlU,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAAiB,GAAA,EAAAD,EAAA,GAAAhB,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAA,KAAAA,OAAAA,CAAA,GAAAZ,EACA,CAEA,SAAAoS,EAAA7N,CAAA,CAAApD,CAAA,CAAAnB,CAAA,EACA,IAAAoU,EAAA,GAAAlB,EAAAjqB,MAAA,GACAslB,EAAA,OACApN,EAAAV,SAAA,SACA,EACA,SAAA4T,EAAA,CAAA9P,IAAA+P,CAAA,CAAAvrB,KAAAA,CAAA,GACA,IAAAurB,EAAAC,EAAA,CAAAhQ,GACA,sCACAA,EAAAjU,QAAA,QACA,UACAgkB,EAAAhkB,QAAA,SAEA,OAAAvH,CACA,CACA,WAAA2lB,EAAA0F,EAAAC,EAAA,KAAA9P,IAAAA,EAAAxb,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAA7W,EAAA6W,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAA3N,IAAA,KAAA2N,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,UACA,EACA,WAAA2O,EAAAvN,EAAA,EAAApY,KAAAA,CAAA,IAAAA,EAAA,KAAAA,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAAmS,EAAAnS,CAAA,EACA,WAAA0O,EAAAvlB,IAAA,GAAAJ,EAAAuH,QAAA,aAAAvI,EAAA2d,IAAA,CAAArZ,EAAA,SAAA2T,EACA,CAEA,SAAAqO,EAAAmG,CAAA,CAAAxU,CAAA,CAAAyU,CAAA,EACA,IAAAC,EAAA,GAAAxB,EAAAlO,KAAA,EAAAyP,MAAAA,EAAAA,EAAA,GAAAvB,EAAA/N,EAAA,IAAAnF,GAEA,OADAwU,EAAAhgB,OAAA,EAAAoQ,EAAAlc,IAAAgsB,EAAA/P,UAAA,CAAAjc,EAAAkc,EAAAA,EAAA5E,QAAA,GACA0U,CACA,CAEA,SAAAzsB,EAAAisB,CAAA,CAAA3rB,CAAA,CAAAyX,CAAA,EACA,IAAAmB,EAAA,GAAA+R,EAAAjqB,MAAA,GACA,GAAAiqB,EAAAiB,GAAA,EAAAD,EAAA3rB,EAAA,UACA,EACA,WAAAmmB,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAA,KAAAA,OAAAA,CAAA,GAAAZ,EACA,CAnEA3Y,EAAAinB,MAAA,CAAAA,EAIAjnB,EAAAirB,IAAA,CAAAA,EAqBAjrB,EAAAgrB,GAAA,CAAAA,EAiBAhrB,EAAA+qB,MAAA,CAAAA,EASA/qB,EAAA8B,KAAA,CAAAA,EAIA9B,EAAA8qB,GAAA,CAAAA,EAMA9qB,EAAAgnB,QAAA,CAAAA,EAOAhnB,EAAAY,KAAA,CAAAA,CACA,OAAA0sB,UAAAzB,EAAApT,MAAA,CACAxW,YAAAsrB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,MAAA4U,EAAA7U,IAAA,CAAA8U,EAAA9U,IAAA,CAAAC,GACA,KAAA4U,SAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,CACA,CACAzU,OAAAC,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAtW,EAAA,KAAA4qB,SAAA,CAAAxU,MAAA,CAAAC,EAAAC,GACAvW,EAAA,KAAA8qB,WAAA,CAAAzU,MAAA,CAAAC,EAAAC,EAAA,KAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,IACA,OAAAtW,EAAAD,EAAA,CAEAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAwU,EAAA,KAAAF,SAAA,CAAA5rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,GACAyU,EAAA,KAAAF,WAAA,CAAA7rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,EAAAwU,GACA,OAAAA,EAAAC,CACA,CACAvU,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,GAAA,KAAAuU,WAAA,CAAArU,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAA9X,EAAAosB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAAiB,GAAA,MAAAQ,EAAAC,EAAAC,GAAA,GAAA3B,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,QAAAnU,IAAAmU,GAAA,KAAAA,OAAAzY,MAAAud,IAAA,CAAA9E,EAAAtU,OAAA,MAAA0T,EACA,CACA3Y,EAAAmB,GAAA,CAAAA,CAAA,gBAAA1B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eCrMA,SAAAguB,EAAAzQ,CAAA,EACA,GAAAA,EAAA0Q,KAAA,CAEI,OAAA1Q,EAAA0Q,KAAA,CAMJ,QAAAtnB,EAAA,EAAAA,EAAAunB,SAAAC,WAAA,CAAA5sB,MAAA,CAAAoF,IACA,GAAAunB,SAAAC,WAAA,CAAAxnB,EAAA,CAAAynB,SAAA,GAAA7Q,EAEA,OAAA2Q,SAAAC,WAAA,CAAAxnB,EAAA,CAKA,SAAA0nB,EAAA1pB,CAAA,EACA,IAAA4Y,EAAA2Q,SAAAI,aAAA,UASA,OATA/Q,EAAAgR,YAAA,gBAAA5pB,EAAA3B,GAAA,EAGAoB,KAAAA,IAAAO,EAAA6pB,KAAA,EACAjR,EAAAgR,YAAA,SAAA5pB,EAAA6pB,KAAA,EAGAjR,EAAAkR,WAAA,CAAAP,SAAAQ,cAAA,MACAnR,EAAAgR,YAAA,cACAhR,CAAA,CD0KAvd,EAAAC,CAAA,CAAAF,EAAA,qBAAA4uB,EAAA,ICvKA,IAAAC,EAAA,WAEA,SAAAA,EAAAjqB,CAAA,MAAAkqB,EAAA,KAGA,KAAAC,UAAA,UAAAvR,CAAA,MAAAwR,EAKUA,EAFVF,IAAAA,EAAAG,IAAA,CAAAztB,MAAA,CACAstB,EAAAI,cAAA,CACUJ,EAAAI,cAAA,CAAAC,WAAA,CACVL,EAAAM,OAAA,CACUN,EAAAO,SAAA,CAAAC,UAAA,CAEVR,EAAAE,MAAA,CAGAF,EAAAG,IAAA,CAAAH,EAAAG,IAAA,CAAAztB,MAAA,IAAA2tB,WAAA,CAEAL,EAAAO,SAAA,CAAAE,YAAA,CAAA/R,EAAAwR,GAGAF,EAAAG,IAAA,CAAAnvB,IAAA,CAAA0d,EAAA,EAGA,KAAAgS,QAAA,CAAA5qB,KAAAP,IAAAO,EAAA6qB,MAAA,EAAA7qB,EAAA6qB,MAAA,CACA,KAAAR,IAAA,IACA,KAAAS,GAAA,GAAgC,KAAAjB,KAAA,CAAA7pB,EAAA6pB,KAAA,CAGhC,KAAAxrB,GAAA,CAAA2B,EAAA3B,GAAA,CACA,KAAAosB,SAAA,CAAAzqB,EAAAyqB,SAAA,CACA,KAAAD,OAAA,CAAAxqB,EAAAwqB,OAAA,CACA,KAAAF,cAAA,CAAAtqB,EAAAsqB,cAAA,CACA,KAAAF,MAAA,MAEA,IAAAW,EAAAd,EAAA9f,SAAA,CA6DC,OA1DD4gB,EAAAC,OAAA,UAAAC,CAAA,EACAA,EAAApiB,OAAA,MAAAshB,UAAA,GAGAY,EAAAG,MAAA,UAAAC,CAAA,EAIA,KAAAL,GAAA,OAAAF,QAAA,aACA,KAAAT,UAAA,CAAAT,EAAA,OAEA,IAAA9Q,EAAA,KAAAyR,IAAA,MAAAA,IAAA,CAAAztB,MAAA,IAeA,QAAAguB,QAAA,MAAAtB,EAAAD,EAAAzQ,GAGA,IAGQ0Q,EAAA8B,UAAA,CAAAD,EAAA7B,EAAA+B,QAAA,CAAAzuB,MAAA,CACR,OAAYmG,EAAgM,CAItM,CACN,MACA6V,EAAAkR,WAAA,CAAAP,SAAAQ,cAAA,CAAAoB,GAAA,CAGA,KAAAL,GAAA,IAGAC,EAAAO,KAAA,YAEA,KAAAjB,IAAA,CAAAxhB,OAAA,UAAA+P,CAAA,EACK,OAAAA,EAAA2S,UAAA,EAAA3S,EAAA2S,UAAA,CAAAC,WAAA,CAAA5S,EACL,GACA,KAAAyR,IAAA,SAAAS,GAAA,EAKA,EAGCb,CAAA,ICnJMwB,EAAA/uB,KAAA+uB,GAAA,CAMQC,EAAA5P,OAAA8B,YAAA,CAME+N,EAAAltB,OAAAC,MAAA,CAQjB,SAAQktB,EAAAxtB,CAAA,CAAMxB,CAAA,EACd,OAAAivB,GAAAA,EAAAztB,EAAA,WAAAytB,EAAAztB,EAAA,OAAAytB,EAAAztB,EAAA,OAAAytB,EAAAztB,EAAA,OAAAytB,EAAAztB,EAAA,KAOA,SAAA0hB,EAAA1hB,CAAA,EACA,OAAAA,EAAA0hB,IAAA,GAQA,SAAAgM,EAAA1tB,CAAA,CAAA2tB,CAAA,EACA,OAAA3tB,EAAA2tB,EAAAC,IAAA,CAAA5tB,EAAA,EAAAA,CAAA,IAAAA,CAAA,CASA,SAAA6tB,EAAA7tB,CAAA,CAAA2tB,CAAA,CAAAG,CAAA,EACA,OAAA9tB,EAAA4hB,OAAA,CAAA+L,EAAAG,EAAA,CAQA,SAAAC,EAAA/tB,CAAA,CAAAguB,CAAA,EACA,OAAAhuB,EAAAwd,OAAA,CAAAwQ,EAAA,CAQA,SAAAP,EAAAztB,CAAA,CAAArB,CAAA,EACA,OAAAqB,EAAAA,EAAAiuB,UAAA,CAAAtvB,EAAA,CASA,SAAAuvB,EAAAluB,CAAA,CAAAmuB,CAAA,CAAAC,CAAA,EACA,OAAApuB,EAAApB,KAAA,CAAAuvB,EAAAC,EAAA,CAOA,SAAAC,EAAAruB,CAAA,EACA,OAAAA,EAAAxB,MAAA,CAOA,SAAA8vB,EAAAtuB,CAAA,EACA,OAAAA,EAAAxB,MAAA,CAQA,SAAA+vB,EAAAvuB,CAAA,CAAA9B,CAAA,EACA,OAAAA,EAAApB,IAAA,CAAAkD,GAAAA,CAAA,CAQA,SAAAwuB,EAAAtwB,CAAA,CAAA2iB,CAAA,EACA,OAAA3iB,EAAAO,GAAA,CAAAoiB,GAAA9gB,IAAA,KC/GO,IAAAkiB,EAAA,EACIwM,EAAA,EACJC,EAAA,EACAC,EAAA,EACAxH,EAAA,EAAAyH,EAAA,GAYP,SAASC,EAAA7uB,CAAA,CAAA8uB,CAAA,CAAAC,CAAA,CAAA7uB,CAAA,CAAA8C,CAAA,CAAAgsB,CAAA,CAAAxwB,CAAA,EACT,OAAAwB,MAAAA,EAAA8uB,KAAAA,EAAAC,OAAAA,EAAA7uB,KAAAA,EAAA8C,MAAAA,EAAAgsB,SAAAA,EAAA/M,KAAAA,EAAAwM,OAAAA,EAAAjwB,OAAAA,EAAAywB,OAAA,IAQA,SAAQC,EAAMJ,CAAA,CAAA9rB,CAAA,EACd,OAAAuqB,EAAAsB,EAAA,6BAAAC,EAAA,CAAAtwB,OAAA,CAAAswB,EAAAtwB,MAAA,EAAAwE,EAAA,CAMA,SAAAmsB,GAAA,CACA,OAAAhI,CAAA,CAMA,SAAAiI,GAAA,CAMA,OANkCjI,EAAAwH,EAAA,EAAAlB,EAAAmB,EAAA,EAAAD,GAAA,EAGlCF,IAAAA,KAAAtH,GAAAsH,CAAAA,EAAA,EAAAxM,GAAA,EAGAkF,CAAA,CAMA,SAAA/lB,GAAA,CAMA,OANuC+lB,EAAAwH,EAAAD,EAAAjB,EAAAmB,EAAAD,KAAA,EAGvCF,IAAAA,KAAAtH,GAAAsH,CAAAA,EAAA,EAAAxM,GAAA,EAGAkF,CAAA,CAMA,SAAQkI,GAAA,CACR,OAAA5B,EAAAmB,EAAAD,EAAA,CAMA,SAAAW,GAAA,CACA,OAAAX,CAAA,CAQA,SAAQ/vB,EAAAuvB,CAAA,CAAMC,CAAA,EACd,OAAAF,EAAAU,EAAAT,EAAAC,EAAA,CAOA,SAAAmB,EAAArvB,CAAA,EACA,OAAAA,GAEA,sCACA,QAEA,SAAW,iDAEX,0BACA,QAEA,SACA,QAEA,iCACA,QAEA,iBACA,SAGA,SAOA,SAAAglB,EAAAllB,CAAA,EACA,OAAAiiB,EAAAwM,EAAA,EAAAC,EAAAL,EAAAO,EAAA5uB,GAAA2uB,EAAA,KAOA,SAAAa,EAAAxvB,CAAA,EACA,OAAA4uB,EAAA,GAAA5uB,CAAA,CAOA,SAAQyvB,EAAIvvB,CAAA,EACZ,OAAAwhB,EAAA9iB,EAAA+vB,EAAA,EAAAe,EAAAxvB,KAAAA,EAAAA,EAAA,EAAAA,KAAAA,EAAAA,EAAA,EAAAA,CAAA,IAeA,SAAAyvB,EAAAzvB,CAAA,EACA,KAAAinB,EAAAkI,KACA,GAAAlI,EAAA,GACA/lB,SACA,MAGA,OAAAmuB,EAAArvB,GAAA,GAAAqvB,EAAApI,GAAA,SAyBA,SAAAyI,EAAAjxB,CAAA,CAAAkxB,CAAA,EACA,OAAAA,GAAAzuB,KAEA+lB,CAAAA,CAAAA,EAAA,MAAAA,CAAAA,EAAA,MAAAA,CAAAA,CAAAA,CAAAA,EAAA,MAAAA,CAAAA,EAAA,MAAAA,CAAAA,CAAAA,CAAAA,EAAA,MAAAA,CAAAA,EAAA,OAGA,OAAAvoB,EAAAD,EAAA2wB,IAAAO,CAAAA,EAAA,GAAAR,IAAAA,KAAAjuB,IAAAA,GAAA,GAOA,SAAAsuB,EAAAxvB,CAAA,EACA,KAAAkB,KACA,OAAA+lB,GAEA,KAAAjnB,EACA,OAAAyuB,CAEA,iBACA,KAAAzuB,GAAAA,KAAAA,GACAwvB,EAAAvI,GACA,WAEA,GACA,KAAAjnB,GACAwvB,EAAAxvB,GACA,WAEA,GACAkB,GACA,CAGA,OAAAutB,CAAA,CAQA,SAAAmB,EAAA5vB,CAAA,CAAAvB,CAAA,EACA,KAAAyC,KAEA,GAAAlB,EAAAinB,IAAA,GACA,WAEA,GAAAjnB,EAAAinB,IAAA,IAAAkI,KAAAA,IAAA,MAGA,WAAAzwB,EAAAD,EAAAgwB,EAAA,OAAArB,EAAAptB,KAAAA,EAAAA,EAAAkB,GAAA,EAOA,SAAAomB,EAAA7oB,CAAA,EACA,MAAA4wB,EAAAF,MAAAjuB,IAGA,OAAAxC,EAAAD,EAAAgwB,EAAA,CCpPO,IAAIoB,EAAG,OACHC,EAAM,QAAAC,EAAA,WAGNC,EAAA,OACAC,EAAA,OAAWC,EAAA,OAKfC,EAAA,UAMAC,EAAA,aAGAC,EAAA,SCXP,SAAAC,EAAAxB,CAAA,CAAAnO,CAAA,EAIA,QAHA4P,EAAc,GAAMjyB,EAAA8vB,EAAAU,GAGpBprB,EAAA,EAAAA,EAAApF,EAAAoF,IAAA6sB,GAAA5P,EAAAmO,CAAA,CAAAprB,EAAA,CAAAA,EAAAorB,EAAAnO,IAAA,GAGA,OAAA4P,CAAA,CAUA,SAAAzvB,EAAA0vB,CAAA,CAAA/xB,CAAA,CAAAqwB,CAAA,CAAAnO,CAAA,EACA,OAAO6P,EAAKxwB,IAAA,EACZ,KAAOqwB,EAAM,GAAAG,EAAO1B,QAAA,CAAAxwB,MAAW,YACxB6xB,EAAO,KAAAD,EAAA,OAAAM,EAAAzB,MAAA,CAAAyB,EAAAzB,MAAA,EAAAyB,EAAA1wB,KAAA,MACPkwB,EAAA,MAAS,EAChB,MAAOI,EAAO,OAAAI,EAAAzB,MAAA,CAAAyB,EAAA1wB,KAAA,KAAAwwB,EAAAE,EAAA1B,QAAA,CAAAnO,GAAA,GACd,MAAAsP,EAAAO,EAAA1wB,KAAA,CAAA0wB,EAAA1tB,KAAA,CAAAjD,IAAA,MAGA,OAAAsuB,EAAAW,EAAAwB,EAAAE,EAAA1B,QAAA,CAAAnO,IAAA6P,EAAAzB,MAAA,CAAAyB,EAAA1wB,KAAA,KAAAgvB,EAAA,OCxBA,SAAA2B,GAAcC,CAAM,MAAApyB,EAAA8vB,EAAAsC,GAGpB,gBAAAF,CAAA,CAAA/xB,CAAA,CAAAqwB,CAAA,CAAAnO,CAAA,EAGA,QAHA4P,EAAA,GAGA7sB,EAAA,EAAAA,EAAApF,EAAAoF,IAAA6sB,GAAAG,CAAA,CAAAhtB,EAAA,CAAA8sB,EAAA/xB,EAAAqwB,EAAAnO,IAAA,GAGA,OAAA4P,CACA,EAOA,SAAAI,GAAAhQ,CAAA,EACA,gBAAA6P,CAAA,EACA,CAAAA,EAAA5B,IAAA,EACA4B,CAAAA,EAAAA,EAAAzB,MAAA,GACApO,EAAA6P,EACA,ECxBA,SAAQI,GAAO9wB,CAAA,EACf,OAAAwvB,EAAA9O,GAAA,uBAAA1gB,EAAAklB,EAAAllB,GAAA,MAAAA,GAAA,CAeA,SAAA0gB,GAAA1gB,CAAA,CAAA8uB,CAAA,CAAAC,CAAA,CAAAhC,CAAA,CAAAgE,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAiBA,IAhBA,IAAAxyB,EAAA,EACA4X,EAAA,EACA/X,EAAAyyB,EACAG,EAAA,EACAnb,EAAA,EACAob,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACArK,EAAA,EACAjnB,EAAA,GACA8C,EAAA+tB,EACA/B,EAAAgC,EACAS,EAAA1E,EAAA6B,EAAA1uB,EAGAqxB,GACA,OAAAF,EAAAlK,EAAAA,EAAA/lB,GAAA,EAEA,QACA,GAAAiwB,KAAAA,GAAgB5D,IAAAA,EAAemB,EAAepwB,EAAA,IAC9C,IAAAuvB,EAAAa,GAAAf,EAAA4B,EAAAtI,GAAA,mBACAqK,CAAAA,EAAA,IACA,MACA,KAEA,WAAkB,KAAO,GACzB5C,GAAAa,EAAAtI,GACA,WAEA,UAAkB,QAAU,QAC5ByH,GAAAe,EAAA0B,GACA,WAEA,GACAzC,GAAAgB,EAAAN,IAAA,KACA,cAEA,GACA,OAAAD,KACA,KAAM,WACNd,EAAAmD,GAAA5B,EAAA1uB,IAAAkuB,KAAAR,EAAAC,GAAAoC,GACA,cAEAvC,GAAA,GACA,CACA,WAEA,IAAA0C,EACAJ,CAAU,CAAAvyB,IAAA,CAAA0vB,EAAAO,GAAA4C,CAEV,UAAAF,EAAA,eACA,OAAAnK,GAEA,gBAAAoK,EAAA,CAEA,SAAAhb,EAA2B,IAAAib,GAAM5C,CAAAA,EAAAf,EAAAe,EAAA,WAC1B3Y,EAAM,GAAAoY,EAAAO,GAAApwB,GACb+vB,EAAAtY,EAAA,GAAA0b,GAAA/C,EAAA,IAAA7B,EAAAgC,EAAAvwB,EAAA,GAAAmzB,GAAA9D,EAAAe,EAAA,YAAA7B,EAAAgC,EAAAvwB,EAAA,GAAA2yB,GACA,WAEU,GAAAvC,GAAA,GAEV,SAGA,GAHYL,EAAAkD,EAAAG,GAAAhD,EAAAE,EAAAC,EAAApwB,EAAA4X,EAAAwa,EAAAG,EAAAhxB,EAAA8C,EAAA,GAAAgsB,EAAA,GAAAxwB,GAAAwyB,GAGZ7J,MAAAA,GACA,GAAA5Q,IAAAA,EACAmK,GAAAkO,EAAAE,EAAA2C,EAAAA,EAAAzuB,EAAAguB,EAAAxyB,EAAA0yB,EAAAlC,QAEA,OAAAoC,KAAAA,GAAA3D,MAAAA,EAAAmB,EAAA,OAAAwC,CAAA,EAEA,oCACA1Q,GAAA1gB,EAAAyxB,EAAAA,EAAA1E,GAAAwB,EAAAqD,GAAA5xB,EAAAyxB,EAAAA,EAAA,IAAAV,EAAAG,EAAAhxB,EAAA6wB,EAAA/tB,EAAA,GAAAxE,GAAAwwB,GAAA+B,EAAA/B,EAAAxwB,EAAA0yB,EAAAnE,EAAA/pB,EAAAgsB,CAAA,EACA,cAEAtO,GAAAkO,EAAA6C,EAAAA,EAAAA,EAAA,KAAAzC,EAAA,EAAAkC,EAAAlC,EACA,GAGArwB,EAAA4X,EAAAN,EAAA,EAAAqb,EAAAE,EAAA,EAAAtxB,EAAA0uB,EAAA,GAAApwB,EAAAyyB,CAAA,CACA,WAEA,GACAzyB,EAAA,EAAA6vB,EAAAO,GAAA3Y,EAAAob,CAAA,SAEA,GAAAC,EAAA,GACA,GAAAnK,KAAAA,EACA,EAAAmK,OACA,GAAAnK,KAAAA,GAAAmK,GAAAA,KAAAlC,KAAAA,IAAA,gBAGAR,GAAAtB,EAAAnG,GAAAA,EAAAmK,CAAA,EAEA,QACAE,EAAAjb,EAAA,IAAAqY,CAAAA,GAAA,SACA,WAEA,GACAsC,CAAA,CAAAvyB,IAAA,EAAA0vB,EAAAO,GAAA,GAAA4C,EAAAA,EAAA,EACA,WAEA,GAEqB,KAArBnC,KAAiCT,CAAAA,GAAAa,EAAAruB,IAAA,EAGjCgwB,EAAA/B,IAAA9Y,EAAA/X,EAAA6vB,EAAAnuB,EAAA0uB,GAAApH,EAAA8H,MAAAnI,IACA,WAEA,GACA,KAAAkK,GAAAhD,GAAAA,EAAAO,IACA0C,CAAAA,EAAA,EACA,EAGA,OAAAN,CAAA,CAiBA,SAAAY,GAAA5xB,CAAA,CAAA8uB,CAAA,CAAAC,CAAA,CAAApwB,CAAA,CAAA4X,CAAA,CAAAwa,CAAA,CAAAG,CAAA,CAAAhxB,CAAA,CAAA8C,CAAA,CAAAgsB,CAAA,CAAAxwB,CAAA,EAKA,QAJAqzB,EAAAtb,EAAA,EACAwW,EAAYxW,IAAAA,EAAMwa,EAAA,KAAA5yB,EAAAmwB,EAAAvB,GAGlBnpB,EAAA,EAAAkuB,EAAA,EAAsB1vB,EAAA,EAAAwB,EAAAjF,EAAM,EAAAiF,EAC5B,QAAWlD,EAAI,EAAAqxB,EAAA7D,EAAAluB,EAA6B6xB,EAAA,EAAAA,EAAOxE,EAAAyE,EAAAZ,CAAA,CAAAttB,EAAA,GAAAouB,EAAAhyB,EAAAU,EAAAvC,EAAA,EAAAuC,EACnDsxB,CAAAA,EAAAtQ,EAAAoQ,EAAA,EAAA/E,CAAA,CAAArsB,EAAA,KAAAqxB,EAAAlE,EAAAkE,EAAA,OAAAhF,CAAA,CAAArsB,EAAA,KAAAsC,CAAAA,CAAA,CAAAZ,IAAA,CAAA4vB,CAAAA,EAGA,OAAAnD,EAAA7uB,EAAA8uB,EAAAC,EAAAxY,IAAAA,EAAA4Z,EAAAjwB,CAAA,CAAA8C,EAAAgsB,EAAAxwB,EAAA,CASA,SAAQkzB,GAAI1xB,CAAA,CAAA8uB,CAAA,CAAAC,CAAsB,EAClC,OAAAF,EAAA7uB,EAAA8uB,EAAAC,EAAAmB,EAAA5C,EAAA6B,KAAAjB,EAAAluB,EAAA,SAUA,SAAQ2xB,GAAI3xB,CAAA,CAAA8uB,CAAA,CAAsBC,CAAA,CAAAvwB,CAAA,CAAW,CAC7C,OAAAqwB,EAAA7uB,EAAA8uB,EAAAC,EAAAqB,EAAAlC,EAAAluB,EAAA,EAAAxB,GAAA0vB,EAAAluB,EAAAxB,EAAA,MAAAA,EAAA,CCxLA,IAAAyzB,GAAA,SAAA9D,CAAA,CAAA+C,CAAA,CAAAvyB,CAAA,EAIA,IAHA,IAAA0yB,EAAA,EAAAlK,EAAA,EAIAkK,EAAAlK,EAAwBA,EAAAkI,IAGxB,KAAAgC,GAAAlK,KAAAA,GACA+J,CAAAA,CAAA,CAAAvyB,EAAA,KAGA4wB,EAAApI,IAIA/lB,IAGA,OAAAxC,EAAAuvB,EAAAQ,EAAA,EAGAuD,GAAA,SAAAC,CAAA,CAAAjB,CAAA,EAEA,IAAAvyB,EAAA,GAAAwoB,EAAA,GAGA,GACA,OAAAoI,EAAApI,IACA,OAEA,KAAAA,GAAAkI,KAAAA,KAKA6B,CAAAA,CAAA,CAAAvyB,EAAA,IAGAwzB,CAAA,CAAAxzB,EAAA,EAAAszB,GAAAtD,EAAA,EAAAuC,EAAAvyB,GAAA,WAGA,EACAwzB,CAAA,CAAAxzB,EAAA,EAAA8wB,EAAAtI,GAAA,WAGA,EAEA,GAAAA,KAAAA,EAAA,CAEAgL,CAAA,GAAAxzB,EAAA,CAAA0wB,KAAAA,IAAA,SACA6B,CAAA,CAAAvyB,EAAA,CAAAwzB,CAAA,CAAAxzB,EAAA,CAAAH,MAAA,CACA,cAMA2zB,CAAA,CAAAxzB,EAAA,EAAA2uB,EAAAnG,EACI,OAAuBA,EAAA/lB,IAAA,CAG3B,OAAA+wB,CAAA,EAGAC,GAAS,SAAqBpyB,CAAA,CAAAkxB,CAAA,EAC9B,OAAG1B,EAAA0C,GAAAhN,EAAAllB,GAAAkxB,GAAA,EAIHmB,GAAA,IAAAC,QACAC,GAAA,SAAA7B,CAAA,EACA,GAAAA,SAAAA,EAAAxwB,IAAA,EAAAwwB,EAAA3B,MAAA,GAEA2B,CAAAA,EAAAlyB,MAAA,KAQA,IAJA,IAAAwB,EAAA0wB,EAAA1wB,KAAA,CACA+uB,EAAA2B,EAAA3B,MAAA,CAAAyD,EAAA9B,EAAAjC,MAAA,GAAAM,EAAAN,MAAA,EAAAiC,EAAAzO,IAAA,GAAA8M,EAAA9M,IAAA,CAGA8M,SAAAA,EAAA7uB,IAAA,EAEI,IADJ6uB,CAAAA,EAAAA,EAAAA,MAAA,EACI,OAIJ,GAAA2B,CAAAA,IAAAA,EAAA1tB,KAAA,CAAAxE,MAAA,EAAAwB,KAAAA,EAAAiuB,UAAA,KAEAoE,GAAAhS,GAAA,CAAA0O,EAAA,IAMAyD,GAIAH,GAAA1vB,GAAA,CAAA+tB,EAAA,IAKA,QAJAQ,EAAA,GACAH,EAAAqB,GAAApyB,EAAAkxB,GAAAuB,EAAA1D,EAAA/rB,KAAA,CAGAY,EAAA,EAAAxB,EAAoB,EAAAwB,EAAAmtB,EAAAvyB,MAAA,CAAAoF,IACpB,QAAAkuB,EAAA,EAAAA,EAAAW,EAAAj0B,MAAA,CAAAszB,IAAA1vB,GAAA,CACAsuB,EAAA1tB,KAAA,CAAAZ,EAAA,CAAA8uB,CAAA,CAAAttB,EAAA,CAAAmtB,CAAA,CAAAntB,EAAA,CAAAge,OAAA,QAAA6Q,CAAA,CAAAX,EAAA,EAAAW,CAAA,CAAAX,EAAA,KAAAf,CAAA,CAAAntB,EAAA,CAfA,CAjBA,EAoCA8uB,GAAA,SAAAhC,CAAA,EACA,GAAAA,SAAAA,EAAAxwB,IAAA,MAAAF,EAAA0wB,EAAA1wB,KAAA,CAIA,MAAAA,EAAAiuB,UAAA,KACAjuB,KAAAA,EAAAiuB,UAAA,MAEAyC,EAAA,UACAA,EAAA1wB,KAAA,IAEA,GAiHA,SAAA2yB,GAAc3yB,CAAA,CAAAxB,CAAA,EACd,OAAAgvB,EAAAxtB,EAAAxB,IAEA,UACA,OAAAyxB,EAAA,SAAAjwB,EAAAA,CAGA,WACA,UACA,UACA,UACA,UACA,oBAGA,UACA,UACA,UACA,UACA,oBAGA,UACA,UACA,UACA,UACA,oBAGA,UACA,UACA,UACA,UACA,UACA,UACA,OAAAiwB,EAAAjwB,EAAAA,CAGA,WACA,UACA,UACA,UACA,UACA,OAAAiwB,EAAAjwB,EAAAgwB,EAAAhwB,EAAA+vB,EAAA/vB,EAAAA,CAGA,WACA,UACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAA/vB,EAAAA,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAA,QAAA/vB,EAAAA,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA6tB,EAAA7tB,EAAA,iBAAAiwB,EAAA,WAAAF,EAAA,aAAA/vB,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAA,aAAAlC,EAAA7tB,EAAA,kBAAAA,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAA,iBAAAlC,EAAA7tB,EAAA,gCAAAA,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,qBAAAA,CAGA,WACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,0BAAAA,CAGA,WACA,OAAAiwB,EAAA,OAAApC,EAAA7tB,EAAA,YAAAiwB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,mBAAAA,CAGA,WACA,OAAAiwB,EAAApC,EAAA7tB,EAAA,0BAAAiwB,EAAA,MAAAjwB,CAGA,WACA,OAAA6tB,EAAAA,EAAAA,EAAA7tB,EAAA,eAAAiwB,EAAA,oBAAAA,EAAA,MAAAjwB,EAAA,IAAAA,CAGA,WACA,UACA,OAAA6tB,EAAA7tB,EAAA,oBAAAiwB,EAAAA,SAGA,WACA,OAAApC,EAAAA,EAAA7tB,EAAA,oBAAAiwB,EAAA,cAAAF,EAAA,wCAAAE,EAAAjwB,EAAAA,CAGA,WACA,UACA,UACA,UACA,OAAA6tB,EAAA7tB,EAAA,kBAAAiwB,EAAA,QAAAjwB,CAGA,WACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UAEA,GAAAquB,EAAAruB,GAAA,EAAAxB,EAAA,SAAAivB,EAAAztB,EAAAxB,EAAA,IAEA,SAEA,GAAAivB,KAAAA,EAAAztB,EAAAxB,EAAA,cAGA,IACA,OAAAqvB,EAAA7tB,EAAA,wBAAAiwB,EAAA,UAAAD,EAAAvC,CAAAA,KAAAA,EAAAztB,EAAAxB,EAAA,kBAAAwB,CAGA,UACA,OAAA+tB,EAAA/tB,EAAA,WAAA2yB,GAAA9E,EAAA7tB,EAAA,4BAAAxB,GAAAwB,EAAAA,CAAA,CACA,KACA,MAGA,KAEA,GAAAytB,MAAAA,EAAAztB,EAAAxB,EAAA,cAGA,KACA,OAAAivB,EAAAztB,EAAAquB,EAAAruB,GAAA,IAAA+tB,EAAA/tB,EAAA,qBAEA,SACA,OAAA6tB,EAAA7tB,EAAA,QAAAiwB,GAAAjwB,CAGA,UACA,OAAA6tB,EAAA7tB,EAAA,6BAAAiwB,EAAAxC,CAAAA,KAAAA,EAAAztB,EAAA,4BAAAiwB,EAAA,SAAAF,EAAA,WAAA/vB,CAAA,CAGA,WAGA,KACA,OAAAytB,EAAAztB,EAAAxB,EAAA,KAEA,SACA,OAAAyxB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,2BAAAA,CAGA,UACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,8BAAAA,CAGA,SACA,OAAAiwB,EAAAjwB,EAAA+vB,EAAAlC,EAAA7tB,EAAA,2BAAAA,CAAA,CAGA,OAAAiwB,EAAAjwB,EAAA+vB,EAAA/vB,EAAAA,CAAA,CAGA,OAAAA,CAAA,CAuCoC,IAAA4yB,GAAA,CApCpC,SAAAlC,CAAA,CAAA/xB,CAAA,CAAAqwB,CAAA,CAAAnO,CAAA,EACA,GAAA6P,EAASlyB,MAAA,KAAW,CAAAkyB,EAAA,cAAAA,EAAAxwB,IAAA,EACpB,KAAAkwB,EACAM,EAAA,OAAAiC,GAAAjC,EAAA1wB,KAAA,CAAA0wB,EAAAlyB,MAAA,aAGA8xB,EACA,OAAAE,EAAsB,CAAAtB,EAAAwB,EAA2B,CAC1C1wB,MAAA6tB,EAAA6C,EAAA1wB,KAAA,SAAAiwB,EAAA,IAAApP,EAGP,MAAAsP,EACA,GAAAO,EAAgBlyB,MAAA,QAAKgwB,EAAAkC,EAAA1tB,KAAA,UAAAhD,CAAA,EACrB,OAAA0tB,EAAA1tB,EAAA,0BAEA,iBACA,kBACA,OAAAwwB,EAA6B,CAAAtB,EAAAwB,EAAA,CAChB1tB,MAAA,CAAA6qB,EAAA7tB,EAAA,kBAAAgwB,EAAA,SACb,CAAAnP,EAGA,qBACA,OAAA2P,EAA6B,CAAAtB,EAAAwB,EAA4B,CAC5C1tB,MAAG,CAAA6qB,EAAI7tB,EAAA,iBAAAiwB,EAAA,eACpBf,EAAsBwB,EAAO,CAChB1tB,MAAG,CAAA6qB,EAAI7tB,EAAA,iBAAAgwB,EAAA,SACpBd,EAAsBwB,EAAO,CAChB1tB,MAAA,CAAA6qB,EAAA7tB,EAAA,aAAA+vB,EAAA,eACb,CAAAlP,EAAA,CAGO,QACP,GACA,EAEoC,CAGpC+K,GAAA,SAAAhqB,CAAA,MAwCAyqB,EAiBAwG,EAeAC,EAxEA7yB,EAAA2B,EAAA3B,GAAA,CAOA,GAAAA,QAAAA,EAAA,CACA,IAAA8yB,EAAA5H,SAAA6H,gBAAA,sCAKA50B,MAAA2N,SAAA,CAAAtB,OAAA,CAAAwB,IAAA,CAAA8mB,EAAA,SAAAlE,CAAA,EASA,KAAAoE,EAHAC,YAAA,iBAGA1V,OAAA,QAGA2N,SAAAgI,IAAA,CAAAzH,WAAA,CAAAmD,GACKA,EAAArD,YAAA,cACL,OAEA4H,EAAAxxB,EAAAwxB,aAAA,EAAAR,GAUAS,EAAA,GACAC,EAAA,GAIAjH,EAAAzqB,EAAAyqB,SAAA,EAAAlB,SAAAgI,IAAA,CACA/0B,MAAA2N,SAAA,CAAAtB,OAAA,CAAAwB,IAAA,CAEAkf,SAAA6H,gBAAA,yBAAA/yB,EAAA,OAAiE,SAAA4uB,CAAA,EAGjE,QAHiE0E,EAAA1E,EAAAqE,YAAA,iBAAA/a,KAAA,MAGjEvU,EAAA,EAAAA,EAAA2vB,EAAA/0B,MAAA,CAAAoF,IACAyvB,CAAA,CAAAE,CAAA,CAAA3vB,EAAA,KAGK0vB,EAAAx2B,IAAA,CAAA+xB,EACL,GA8B+B,IAAA2E,EAAA7C,GAAA8C,CA1B/BlB,GAAAG,GAAA,CA0B+BgB,MAAA,CAAAN,EAF/B,CAAApyB,EAAA6vB,GAAA,SAAA9D,CAAA,EACK+F,EAAAhG,MAAA,CAAAC,EACL,MAGA4G,EAAa,SAASC,CAAC,CAAO,CAC9B,OAAApD,EAAAM,GAAA8C,GAAAJ,EAAA,EAGAX,EAAA,SAAAgB,CAAA,CAAAC,CAAA,CAAA5I,CAAA,CAAA6I,CAAA,EAAAjB,EAAA5H,EAU+DyI,EAAAE,EAAAA,EAAA,IAAAC,EAAAF,MAAA,KAAAE,EAAAF,MAAA,EAG/DG,GACAC,CAAAA,EAAAX,QAAA,CAAAS,EAAAvzB,IAAA,KAEA,EAGA,IAAAyzB,EAAA,CACA/zB,IAAAA,EACAirB,MAAA,IAAAW,EAAA,CACA5rB,IAAAA,EACAosB,UAAAA,EACAZ,MAAA7pB,EAAA6pB,KAAA,CACAgB,OAAA7qB,EAAA6qB,MAAA,CACAL,QAAAxqB,EAAAwqB,OAAA,CACKF,eAAAtqB,EAAAsqB,cAAA,GAELT,MAAA7pB,EAAA6pB,KAAA,CACA4H,SAAAA,EACAY,WAAA,GACAnH,OAAA+F,CACA,EAEA,OADAmB,EAAA9I,KAAA,CAAA0B,OAAA,CAAA0G,GACAU,CAAA,CAEkC,gBAAAj3B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eCrkBlC,SAAAi3B,EAAAC,CAAA,EACA,IAAAH,EAAA3zB,OAAA8C,MAAA,OACA,gBAAAixB,CAAA,EAEA,OADA/yB,KAAAA,IAAA2yB,CAAA,CAAAI,EAAA,EAAAJ,CAAAA,CAAA,CAAAI,EAAA,CAAAD,EAAAC,EAAA,EACAJ,CAAA,CAAAI,EAAA,CACA,CDgkBkCn3B,EAAAC,CAAA,CAAAF,EAAA,qBAAAk3B,CAAA,CCtkBlC,EAQ8B,gBAAAn3B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAq3B,CAAA,sBAAAC,CAAA,sBAAArO,CAAA,sBAAAsO,CAAA,QAAAC,EAAAv3B,EAAA,MAAAw3B,EAAAx3B,EAAA,MAAAA,EAAA,MCRCA,EAAA,MAW/B,IAAAgpB,EAAe,GAGfyO,EAAAF,EAAAG,aAAA,CAMA,oBAAAC,YAAA,GAAAH,EAAAzO,CAAA,GACC/lB,IAAA,cAODo0B,EAAAK,EAAAG,QAAA,CAKAN,EAAA,SAAAO,CAAA,EAEA,SAAAN,EAAAO,UAAA,WAAA/xB,CAAA,CAAAgyB,CAAA,EAGG,OAAAF,EAAA9xB,EADH,GAAAwxB,EAAAS,UAAA,EAAAP,GACGM,EACH,IAGA/O,GACAsO,CAAAA,EAAA,SAAAO,CAAA,EACA,gBAAkB9xB,CAAA,EAAU,IAAAgxB,EAAA,GAAAQ,EAAAS,UAAA,EAAAP,UAG5B,OAAAV,GAMAA,EAAA,GAAAS,EAAAzO,CAAA,GACS/lB,IAAA,KACT,GACAu0B,EAAAjJ,aAAA,CAAAmJ,EAAAG,QAAA,EACS70B,MAAAg0B,CACD,EAAAc,EAAA9xB,EAAAgxB,KAERc,EAAA9xB,EAAAgxB,EACA,CAEA,GAEwD,IAAAM,EAAAE,EAAAG,aAAA,IAoMwK,eAAA53B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAk4B,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,QAAAC,EAAAp4B,EAAA,MAAAu3B,EAAAv3B,EAAA,MAAAq4B,EAAAr4B,EAAA,KAAAs4B,EAAAt4B,EAAA,MAAAu4B,EAAAv4B,EAAA,MAAAA,EAAA,MAAAA,EAAA,MC3FhO,IAAAm4B,EAOG,GAAAC,EAAAI,CAAA,WAAAzyB,CAAA,CAAAgxB,CAAA,EAGH,IAAAJ,EAAA5wB,EAAmB4wB,MAAA,CAAkEE,EAAA,GAAA0B,EAAAE,CAAA,GAAA9B,EAAA,CAAAvyB,KAAAA,EAAAmzB,EAAAS,UAAA,CAAAI,EAAAM,CAAA,GAGrF,IAAAN,EAAAzxB,CAAA,EAOA,IAJA,IAHAgyB,EAGAC,EAAA/B,EAAAvzB,IAAA,CACAu1B,EAAAhC,EAAAF,MAAA,CAAAxyB,EAAA0yB,EAAA1yB,IAAA,CAGAA,KAAAC,IAAAD,GACAy0B,GAAA,IAAAz0B,EAAAb,IAAA,CACAu1B,GAAA10B,EAAAwyB,MAAA,CACAxyB,EAAAA,EAAAA,IAAA,CAGA,IAAA2yB,EAAAC,CAAA,IAAAA,EAAAzB,MAAA,CACAxB,EAAAiD,EAAAlH,MAAA,KACAvsB,KAAAs1B,EACKjC,OAAAkC,CAAA,EAAA9B,EAAA9I,KAAA,CAAA6I,UAGL,EACA,KAGAS,EAAAjJ,aAAA,SAAAqK,CAAAA,CAAAA,EAAA,oBAAA5B,EAAA/zB,GAAA,YAAA41B,EAAAD,EAAAG,uBAAA,EACKC,OAAAjF,CACD,EAAA6E,EAAAnK,KAAA,CAAAuI,EAAA9I,KAAA,CAAAO,KAAA,CAAAmK,CAAA,EALJ,CAMA,IAMEK,EAAAzB,EAAA0B,MAAA,GAsDD,MArDD,GAAAX,EAAqCzD,CAAA,iBAAA7xB,EAAA+zB,EAAA/zB,GAAA,WAGrCirB,EAAA,IAAA8I,EAAA9I,KAAA,CAAA3rB,WAAA,EACAU,IAAAA,EACAwrB,MAAAuI,EAAA9I,KAAA,CAAAO,KAAA,CACAY,UAAA2H,EAAA9I,KAAA,CAAAmB,SAAA,CACKI,OAAAuH,EAAA9I,KAAA,CAAAsB,QAAA,GACwB2J,EAAA,GAE7BtH,EAAA1D,SAAAiL,aAAA,wBAAAn2B,EAAA,IAAA6zB,EAAAvzB,IAAA,OAeA,OAZAyzB,EAAA9I,KAAA,CAAAe,IAAA,CAAAztB,MAAA,EACA0sB,CAAAA,EAAAc,MAAA,CAAAgI,EAAA9I,KAAA,CAAAe,IAAA,KAGA,OAAA4C,IAA0BsH,EAAA,GAG1BtH,EAAArD,YAAA,gBAAAvrB,GACAirB,EAAA0B,OAAA,EAAAiC,EAAA,GAGAoH,EAAAI,OAAA,EAAAnL,EAAAiL,EAAA,CACA,WACAjL,EAAAgC,KAAA,EACG,CACD,GAAA8G,EAAA,EACF,GAAAuB,EAAAzD,CAAA,aACA,IAAAwE,EAAAL,EAAAI,OAAA,CACAnL,EAAAoL,CAAA,IAGA,GAHAA,CAAA,IAGA,CACAA,CAAA,OACA,UAGAj1B,KAAAA,IAAAyyB,EAAA1yB,IAAA,EAEA,GAAAk0B,EAAAiB,EAAA,EAAAvC,EAAAF,EAAA1yB,IAAA,KAGA8pB,EAAAe,IAAA,CAAAztB,MAAA,EAEA,IAAAkyB,EAAAxF,EAAAe,IAAA,CAAAf,EAAAe,IAAA,CAAAztB,MAAA,IAAAg4B,kBAAA,CACAtL,EAAAc,MAAA,CAAA0E,EACAxF,EAAAgC,KAAA,KAGGJ,MAAA,IAAAgH,EAAA5I,EAAA,GACH,GAAA8I,EAAAF,EAAAvzB,IAAA,GACC,OAOD,SAAA40B,GAAA,CACA,QAAAsB,EAAAC,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA2vB,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IACA7vB,CAAA,CAAA6vB,EAAA,CAAAD,SAAA,CAAAC,EAAA,CAGA,SAAAnB,EAAAE,CAAA,EAAA5uB,EAAA,CAGA,IAAAouB,EAAA,WACA,IAAA0B,EAAAzB,EAAA92B,KAAA,QAAAq4B,WAA6Cn2B,EAAA,aAAAq2B,EAAAr2B,IAAA,CAG7C,OACAA,KAAAA,EACAqzB,OAAA,cAAArzB,EAAA,IAAAq2B,EAAAhD,MAAA,KACAiD,KAAA,EACAtwB,SAAA,WACA,mBAAAhG,IAAA,UAAAqzB,MAAA,QACA,CACA,EAkJyE,gBAAA72B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eCrbzE,SAAA65B,EAAA1O,CAAA,EAYA,IAPa,IAGbhmB,EAHa20B,EAAA,EAIbnzB,EAAA,EAAAozB,EAAA5O,EAAA5pB,MAAA,CAGAw4B,GAAA,IAAApzB,EAAAozB,GAAA,EAEA50B,EAEA,CAAAA,MAHAA,CAAAA,EAAAgmB,IAAAA,EAAA6F,UAAA,CAAArqB,GAAA,CAAAwkB,IAAAA,EAAA6F,UAAA,GAAArqB,EAAA,MAAAwkB,IAAAA,EAAA6F,UAAA,GAAArqB,EAAA,OAAAwkB,IAAAA,EAAA6F,UAAA,GAAArqB,EAAA,MAGA,eAAAxB,IAAA,eACAA,GAEAA,IAAA,GACA20B,EAEA,CAAA30B,MAAAA,CAAA,eAAAA,IAAA,eAEI,CAAA20B,MAAAA,CAAA,eAAAA,IAAA,eAIJ,OAAAC,GACA,OAAAD,GAAA,CAAA3O,IAAAA,EAAA6F,UAAA,CAAArqB,EAAA,OAGA,QAAAmzB,GAAA,CAAA3O,IAAAA,EAAA6F,UAAA,CAAArqB,EAAA,MAGA,QACAmzB,GAAA3O,IAAAA,EAAA6F,UAAA,CAAArqB,GACAmzB,EAEI,CAAAA,MAAAA,CAAA,eAAAA,IAAA,cACJ,CAQA,OAJAA,GAAAA,IAAA,GAIA,EAAAA,CAHAA,EAEA,CAAAA,MAAAA,CAAA,eAAAA,IAAA,gBACAA,IAAA,SAAAxwB,QAAA,KDqYyEtJ,EAAAC,CAAA,CAAAF,EAAA,qBAAAi6B,CAAA,IExbzE,IC+OAC,ED/OAC,EAAA,CACAC,wBAAA,EACAC,YAAA,EACAC,kBAAA,EACAC,iBAAA,EACAC,iBAAA,EACAC,QAAA,EACAC,aAAA,EACAC,gBAAA,EACAC,YAAA,EACAC,QAAA,EACAC,KAAA,EACAC,SAAA,EACAC,aAAA,EACAC,WAAA,EACAC,aAAA,EACAC,UAAA,EACAC,QAAA,EACAC,WAAA,EACAC,YAAA,EACAC,aAAA,EACAC,WAAA,EACAC,cAAA,EACAC,eAAA,EACAC,gBAAA,EACAC,UAAA,EACAC,cAAA,EACAC,aAAA,EACAC,iBAAA,EACAC,WAAA,EACAC,WAAA,EACAC,QAAA,EACAC,MAAA,EACAC,QAAA,EACAC,QAAA,EACAC,OAAA,EACAC,OAAA,EACAC,KAAA,EACAC,gBAAA,EAEAC,YAAA,EACAC,aAAA,EACAC,YAAA,EACAC,gBAAA,EACAC,iBAAA,EACAC,iBAAA,EACAC,cAAA,EACAC,YAAA,GAEmCC,EAAAj9B,EAAA,MC3CnCk9B,EAAA,aAAAC,EAAA,8BAGAC,EAAA,SAAApkB,CAAA,EACA,OAAAA,KAAAA,EAAAgY,UAAA,KAGAqM,EAAA,SAAAt6B,CAAA,EACA,OAAAA,IAAA,EAAAA,GAAA,kBAAAA,CAAA,EAGAu6B,EAAA,GAAAL,EAAAlU,CAAA,WAAAwU,CAAA,EACC,OAAAH,EAAAG,GAAAA,EAAAA,EAAA5Y,OAAA,CAAAuY,EAAA,OAAAvc,WAAA,KAGD6c,EAAA,SAAAx6B,CAAA,CAAAD,CAAA,EACA,OAAAC,GACA,gBACA,oBAEA,oBAAAD,EACA,OAAAA,EAAA4hB,OAAA,CAAAwY,EAAA,SAAAM,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAMW,OALX1D,EAAA,CACA32B,KAAAo6B,EACA/G,OAAAgH,EACAx5B,KAAA81B,CACA,EACWyD,CACX,EACA,QAIA,IAAAxD,CAAA,CAAAl3B,EAAA,EAAAo6B,EAAAp6B,IAAA,iBAAAD,GAAAA,IAAAA,EAIAA,EAHAA,EAAA,MAoCA,SAAA66B,EAAAC,CAAA,CAAA7G,CAAA,CAAA8G,CAAA,EACA,GAAAA,IAAA,EAAAA,EACA,SAGA,GAAAA,KAEK15B,IAFL05B,EAEKC,gBAAA,CAGL,OAAAD,CAAA,CAGA,cAAAA,GACA,cAEA,QAGA,cAEA,GAAAA,IAAAA,EAAAlE,IAAA,CAMA,OALAK,EAAA,CACA32B,KAAAw6B,EAAAx6B,IAAA,CACAqzB,OAAAmH,EAAAnH,MAAA,CACAxyB,KAAA81B,CACA,EACA6D,EAAAx6B,IAAA,CAGA,GAAAw6B,KAAA15B,IAAA05B,EAAAnH,MAAA,MAAAxyB,EAAA25B,EAAA35B,IAAA,CAGA,GAAAA,KAAAC,IAAAD,EAGA,KAAAA,KAAAC,IAAAD,GACA81B,EAAA,CACA32B,KAAAa,EAAAb,IAAA,CACAqzB,OAAAxyB,EAAAwyB,MAAA,CACAxyB,KAAA81B,CACA,EACA91B,EAAAA,EAAAA,IAAA,CAUA,OAPgD25B,EAAAnH,MAAA,IAOhD,QAGAqH,EAAAH,EAAA7G,EAAA8G,EAGA,gBAEA,GAAAD,KAAAz5B,IAAAy5B,EAAA,CACA,IAAAI,EAAAhE,EACA31B,EAAAw5B,EAAAD,GAEU,OADV5D,EAAAgE,EACUL,EAEDC,EAAA7G,EAAA1yB,EAAA,EAwBT,GAAA0yB,IAAA,EAAAA,EACA,OAAA8G,CAAA,CAGA,IAAAr7B,EAAAu0B,CAAA,CAAA8G,EAAA,CACA,OAAAr7B,KAAA2B,IAAA3B,EAAAA,EAAAq7B,CAAA,CAGA,SAAAE,EAAAH,CAAA,CAAA7G,CAAA,CAAAhX,CAAA,MAAA5Y,EAAA,GAGA,GAAAjG,MAAA6D,OAAA,CAAoBgb,GACpB,QAAArZ,EAAA,EAAAA,EAAAqZ,EAAAze,MAAA,CAAAoF,IACAS,GAAAw2B,EAAAC,EAAA7G,EAAAhX,CAAA,CAAArZ,EAAA,WAGA,QAAA+yB,KAAA1Z,EAAA,KAAAjd,EAAAid,CAAA,CAAA0Z,EAAA,CAGA,oBAAA32B,EACAi0B,IAA6B,EAA7BA,GAA6BA,KAA0B5yB,IAA1B4yB,CAAA,CAAAj0B,EAAA,CACnBqE,GAAAsyB,EAAA,IAAA1C,CAAA,CAAAj0B,EAAA,KACVs6B,EAAAt6B,IACAqE,CAAAA,GAAAk2B,EAAA5D,GAAA,IAAA8D,EAAA9D,EAAA32B,GAAA,UAOA,GAAA5B,MAAA6D,OAAA,CAAAjC,IAA2B,iBAAAA,CAAmB,KAAAi0B,CAAAA,IAAA,EAAAA,GAAAA,KAAA5yB,IAAA4yB,CAAA,CAAAj0B,CAAA,MAC9C,QAAAm7B,EAAA,EAAAA,EAAAn7B,EAAAxB,MAAA,CAAA28B,IACAb,EAAAt6B,CAAA,CAAAm7B,EAAA,GACA92B,CAAAA,GAAAk2B,EAAA5D,GAAA,IAAA8D,EAAA9D,EAAA32B,CAAA,CAAAm7B,EAAA,WAGA,KAAAC,EAAAP,EAAAC,EAAA7G,EAAAj0B,GAGA,OAAA22B,GACA,gBACA,oBAEAtyB,GAAAk2B,EAAA5D,GAAA,IAAAyE,EAAA,IACA,cASA/2B,GAAAsyB,EAAA,IAAAyE,EAAA,GAEA,CACA,EAEA,OAGA/2B,CAAA,CAGA,IAAAg3B,EAAA,iCAUApE,EAAA,SAAAnwB,CAAA,CAAAmtB,CAAA,CAAA6G,CAAA,EACA,GAAAh0B,IAAAA,EAAAtI,MAAA,mBAAAsI,CAAA,KAAAA,IAAA,GAAAA,CAAA,KAAAA,KAAAzF,IAAAyF,CAAA,IAAA8sB,MAAA,CACA,OAAA9sB,CAAA,IAGA,IAwCa4zB,EAxCbY,EAAA,GACA1H,EAAA,GACAsD,EAAA71B,KAAAA,EAAA,IAAAk6B,EAAAz0B,CAAA,IAGA,MAAAy0B,GAAAA,KAAAl6B,IAAAk6B,EAAAC,GAAA,EACAF,EAAA,GACI1H,GAAAiH,EAAAC,EAAA7G,EAAAsH,IAMA3H,GAAA2H,CAAA,IAIJ,QAAA33B,EAAA,EAAAA,EAAAkD,EAAAtI,MAAA,CAAAoF,IAAAgwB,GAAAiH,EAAAC,EAAA7G,EAAAntB,CAAA,CAAAlD,EAAA,EAGA03B,GAKA1H,CAAAA,GAAA2H,CAAA,CAAA33B,EAAA,CAcAy3B,CAAAA,EAAAhU,SAAA,GAIA,IAHA,IAAAoU,EAAa,GAGb,OAAAf,CAAAA,EAAAW,EAAAzN,IAAA,CAAAgG,EAAA,GACA6H,GAAA,IACAf,CAAA,IAkBA,OACAn6B,KAjBuBu2B,EAAAlD,GAAA6H,EAkBvB7H,OAAAA,EACAxyB,KAAA81B,CACA,EAE2B,gBAAAn6B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA0+B,CAAA,sBAAAC,CAAA,IC3TI,ID2TJC,EC3TIpH,EAAAv3B,EAAA,MAG/B4+B,EAAA,SAAA14B,CAAA,EACA,OAAAA,GAAA,EAGA24B,EAAA,GAAAF,GAAAA,CAAAA,EAAA3+B,EAAAwF,CAAA,CAAA+xB,EAAA,0BAAAoH,GAAAA,CAAAA,EAAA3+B,EAAAwF,CAAA,CAAA+xB,EAAA,wBACAkH,EAAAI,GAAiED,EAAqBF,EAAAG,GAAAtH,EAAAuH,eAAA,EAEI,aAAAh/B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAg/B,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,CCV1F,GACA,IAAAjW,EAAA,GACA,SAAAgW,EAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,GAQA,OAPAD,EAAAjkB,KAAA,MAAA1N,OAAA,UAAA6xB,CAAA,EACArI,KAAA5yB,IAAA4yB,CAAA,CAAAqI,EAAA,CACMH,EAAAr/B,IAAA,CAAAm3B,CAAA,CAAAqI,EAAA,MAEND,GAAAC,EAAA,GAEA,GACAD,CACA,CACA,IAAAH,EAAA,SAAAlI,CAAA,CAAAF,CAAA,CAAAyI,CAAA,MAAAD,EAAAtI,EAAA/zB,GAAA,KAAA6zB,EAAAvzB,IAAA,CAQAg8B,CAAAA,CAAA,IAAAA,GAIAtW,CAAA,IAAAA,CAAA,GAAA+N,KAAA3yB,IAAA2yB,EAAAC,UAAA,CAAAqI,EAAA,EACAtI,CAAAA,EAAAC,UAAA,CAAAqI,EAAA,CAAAxI,EAAAF,MAAA,CAEA,EACAoI,EAAA,SAAAhI,CAAA,CAAAF,CAAA,CAAAyI,CAAA,EACAL,EAAAlI,EAAAF,EAAAyI,GAAA,IAAAD,EAAAtI,EAAA/zB,GAAA,KAAA6zB,EAAAvzB,IAAA,CAGA,GAAAyzB,KAAA3yB,IAAA2yB,EAAAX,QAAA,CAAAS,EAAAvzB,IAAA,OAAA81B,EAAAvC,EAGA,GAAAE,EAAAlH,MAAA,CAAAgH,IAAAuC,EAAA,IAAAiG,EAAA,GAAAjG,EAAArC,EAAA9I,KAAA,KAGMmL,EAAAA,EAAAj1B,IAAA,OACNi1B,KAAAh1B,IAAAg1B,EAAA,CACA,CAE6D,gBAAAt5B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAw/B,CAAA,IAAAv/B,EAAA,UAAAw/B,EAAAx/B,EAAA,MCjB7D,SAASu/B,EAAAE,CAAA,EACT,SAAAD,EAAA74B,CAAA,EAAA84B,EAAA,CA3BAz/B,EAAA,KA2BA,gBAAAF,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA2/B,CAAA,QAAAC,EAAA3/B,EAAA,MAAAA,EAAA,UAAA4/B,EAAA5/B,EAAA,MAAA6/B,EAAA7/B,EAAA,MAAA8/B,EAAA9/B,EAAA,MCS2B+/B,EA5B3B,UACApJ,OAAAA,CAAA,CACAqJ,QAAAA,CAAA,CACCC,aAAAA,EAAA,GACD,EACA,IAAAC,EAAA,GAAAL,EAAA9W,CAAA,EAAAkX,GACAE,EAAsB,mBAAAxJ,EAAKA,EAAAqJ,GAAeE,CAAA,CAAAF,EAAA,EAAAE,GAAAvJ,CAAA,CAC1C,SAAAmJ,EAAAM,GAAA,EAAAR,EAAA7W,CAAA,EACG4N,OAAAwJ,CACH,EACA,EAkB2BF,EAAAjgC,EAAA,KAAAuqB,EAAAvqB,EAAA,KCXA0/B,EAf3B,SAA2B35B,CAAA,EAC3B,MAAkB,GAAA+5B,EAAAM,GAAA,EAAAL,EAAY,GAAAJ,EAAA5W,CAAA,KAAAhjB,EAAA,CAC9Bk6B,aAAaA,EAAQlX,CAAA,CAClBiX,QAAAzV,EAAAxB,CAAA,GAEH,CAU2B,gBAAAjpB,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAsgC,EAAA,QAAAV,EAAA3/B,EAAA,MAAAsgC,EAAAtgC,EAAA,MAAAugC,EAAAvgC,EAAA,MAAAwgC,EAAAxgC,EAAA,MAAAygC,EAAAzgC,EAAA,MAAA0gC,EAAA1gC,EAAA,MAAA2gC,EAAA3gC,EAAA,MCvB3B,SAAS4gC,EAAAC,CAAA,CAAAC,CAAQ,EACjB,SAAAnB,EAAA5W,CAAA,GACAgY,QAAA,CACAC,UAAA,GACA,CAAAH,EAAAI,EAAA,SACA,mCACAD,UAAA,EACO,CACP,EACA,CAAAH,EAAAI,EAAA,SACAD,UAAA,EACA,CACG,CACH,EAAAF,EAAA,KAAAI,EAAAlhC,EAAA,MCdA,IAAAmhC,EAAA,CACAC,MAAA,OACAC,MAAA,MACA,EAAqB,IAAAC,EAAAH,ECHrB,IAAAI,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAC,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAmB,IAAAC,EAAAL,ECfnB,IAAAM,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAL,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAqB,IAAAG,EAAAD,ECfrB,IAAAE,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAP,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAkB,IAAAK,EAAAD,ECflB,IAAAE,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAT,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAqB,IAAAO,EAAAD,ECfrB,IAAAE,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAX,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAmB,IAAAS,EAAAD,ECfnB,IAAAE,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAb,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAwB,IAAAW,EAAAD,ECfxB,IAAAE,EAAA,CACA,aACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACA,cACAf,KAAA,UACAC,KAAA,UACAC,KAAA,UACAC,KAAA,SACA,EAAoB,IAAAa,EAAAD,ECZyB,IAAAE,EAAA,2CAW7CC,EAAA,CAEAnf,KAAA,CAEAof,QAAA,sBAEAC,UAAA,qBAEGC,SAAA,qBACH,EAEAC,QAAA,sBAGAC,WAAW,CACXC,MAAA1B,EAAaD,KAAA,CACVla,QAAAma,EAAAD,KAAA,EAGH4B,OAAA,CAEAC,OAAA,sBAEAC,MAAA,sBACAC,aAAA,IAEAC,SAAA,sBACAC,gBAAA,IAEAT,SAAA,sBAEAU,mBAAA,sBACAC,gBAAA,IACAC,MAAA,sBACAC,aAAA,IACAC,iBAAA,GACA,CACO,EACPC,EAAA,CACArgB,KAAA,CACAof,QAAArB,EAAAD,KAAA,CACAuB,UAAA,2BACAC,SAAA,2BACGgB,KAAA,0BACH,EACAf,QAAA,4BACAC,WAAA,CACAC,MAAA,UACG7b,QAAA,SACH,EACA8b,OAAA,CACAC,OAAA5B,EAAAD,KAAA,CACA8B,MAAA,4BACAC,aAAA,IACAC,SAAA,4BACAC,gBAAA,IACAT,SAAA,2BACAU,mBAAA,4BACAC,gBAAA,IACAC,MAAA,4BACAC,aAAA,IACAC,iBAAA,GACA,CACA,EACA,SAAAG,EAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAxB,KAAA,EAAAwB,EACAE,EAAAF,EAAAN,IAAA,EAAAM,IAAAA,CACAH,CAAAA,CAAA,CAAAC,EAAA,GACAD,EAAAh1B,cAAA,CAAAk1B,GACMF,CAAA,CAAAC,EAAA,CAAAD,CAAA,CAAAE,EAAA,CACND,UAAAA,EACMD,EAAArB,KAAA,IAAAxB,EAAAmD,EAAA,EAAAN,EAAAO,IAAA,CAAAH,GACc,SAApBH,GACAD,CAAAA,EAAAH,IAAA,IAAA1C,EAAAqD,EAAA,EAAAR,EAAAO,IAAA,CAAAF,EAAA,EAGA,CACA,SAAAI,EAAAngB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAAlC,CAAa,KAAQ,CACrBM,MAAYN,CAAA,IAAS,CACrBwB,KAAAxB,CAAA,OAGA,CACAkC,KAAAlC,CAAW,MACXM,MAAUN,CAAA,KAAS,CACnBwB,KAAAxB,CAAA,MAJA,CAOA,SAAAqC,EAAApgB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAAxC,CAAa,KAAU,CACvBY,MAAYZ,CAAA,IAAW,CACvB8B,KAAA9B,CAAA,OAGA,CACAwC,KAAAxC,CAAW,MACXY,MAAUZ,CAAA,KAAW,CACrB8B,KAAA9B,CAAA,MAJA,CAOA,SAAA4C,EAAArgB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAAtC,CAAa,MACbU,MAAYV,CAAA,KAAQ,CACpB4B,KAAA5B,CAAA,OAGA,CACAsC,KAAAtC,CAAW,MACXU,MAAUV,CAAA,KAAQ,CAClB4B,KAAA5B,CAAA,MAJA,CAOA,SAAA2C,EAAAtgB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAAhC,CAAa,MACbI,MAAYJ,CAAA,KAAc,CAC1BsB,KAAAtB,CAAA,OAGA,CACAgC,KAAAhC,CAAW,MACXI,MAAUJ,CAAA,KAAc,CACxBsB,KAAAtB,CAAA,MAJA,CAOA,SAAAsC,EAAAvgB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAA9B,CAAa,MACbE,MAAYF,CAAA,KAAU,CACtBoB,KAAApB,CAAA,OAGA,CACA8B,KAAA9B,CAAW,MACXE,MAAUF,CAAA,KAAU,CACpBoB,KAAApB,CAAA,MAJA,CAOA,SAAAqC,EAAAxgB,EAAA,eACA,SAAAA,EACA,CACAigB,KAAApC,CAAa,MACbQ,MAAYR,CAAA,KAAW,CACvB0B,KAAA1B,CAAA,OAGA,CACAoC,KAAA,UAEA5B,MAAUR,CAAA,KAAW,CACrB0B,KAAA1B,CAAA,MALA,CAQA,SAAA4C,EAAAC,CAAA,EACA,IACA1gB,KAAAA,EAAA,QACA2gB,kBAAAA,EAAA,EACMd,YAAAA,EAAA,GACN,CAAAa,EACAE,EAAA,GAAA3E,EAAAvX,CAAA,EAAAgc,EAAAtC,GACAE,EAAAoC,EAAApC,OAAA,EAAA6B,EAAAngB,GACAue,EAAAmC,EAAAnC,SAAA,EAAA6B,EAAApgB,GACA9d,EAAAw+B,EAAAx+B,KAAA,EAAAm+B,EAAArgB,GACA6gB,EAAAH,EAAAG,IAAA,EAAAP,EAAAtgB,GACA8gB,EAAAJ,EAAAI,OAAA,EAAAP,EAAAvgB,GAAA+gB,EAAAL,EAAAK,OAAA,EAAAP,EAAAxgB,GAMA,SAAAghB,EAAyBtC,CAAA,EACzB,IAAQuC,EAKH,GAAApE,EAAAqE,EAAA,EAAAxC,EAAAa,EAAArgB,IAAA,CAAAof,OAAA,GAAAqC,EAAApB,EAAArgB,IAAA,CAAAof,OAAA,CAAAD,EAAAnf,IAAA,CAAAof,OAAA,CAEL,OAAA2C,CACA,CACA,IAAAE,EAAA,EACAC,MAAAA,CAAA,CACAniC,KAAAA,CAAA,CACAoiC,UAAAA,EAAA,IACAC,WAAAA,EAAA,IACGC,UAAAA,EAAA,IACH,IAKA,GAHA,CAAAH,CADAA,EAAA,GAAA9F,EAAA5W,CAAA,KAAA0c,EAAA,EACAnB,IAAA,EAAAmB,CAAA,CAAAC,EAAA,EACAD,CAAAA,EAAAnB,IAAA,CAAAmB,CAAA,CAAAC,EAAA,EAEA,CAAAD,EAAA12B,cAA2D,SAE3D,eAAAwxB,EAAAxX,CAAA,KAAAzlB,EAAA,KAAAA,EAAA,MAAAoiC,GAAA,CAEA,oBAAAD,EAAAnB,IAAsB,CActB,eAAA/D,EAAAxX,CAAA,KAAAzlB,EAAA,KAAAA,EAAA,MAAAQ,KAAAC,SAAA,CAAA0hC,EAAAnB,IAAA,IAOA,OALAR,EAAA2B,EAAA,QAAAE,EAAAzB,GACAJ,EAAA2B,EAAA,OAAAG,EAAA1B,GACAuB,EAAAH,YAAA,EACAG,CAAAA,EAAAH,YAAA,CAAAD,EAAAI,EAAAnB,IAAA,GAEAmB,CACA,EACAI,EAAA,CACAjC,KAAAA,EACAlB,MAAAA,CACA,EAMAoD,EAAA,GAAAtF,EAAAzX,CAAA,KAAA4W,EAAA5W,CAAA,GAEAoY,OAAA,GAAAxB,EAAA5W,CAAA,KAAAuY,GAGAjd,KAAAA,EAEAse,QAAA6C,EAAA,CACAC,MAAA9C,EACKr/B,KAAA,SACL,GAEAs/B,UAAA4C,EAAA,CACAC,MAAA7C,EACAt/B,KAAA,YACAoiC,UAAA,OACAC,WAAA,OACKC,UAAA,MACL,GAEAr/B,MAAAi/B,EAAA,CACAC,MAAAl/B,EACKjD,KAAA,OACL,GAEA8hC,QAAAI,EAAA,CACAC,MAAAL,EACK9hC,KAAA,SACL,GAEA4hC,KAAAM,EAAA,CACAC,MAAAP,EACK5hC,KAAA,MACL,GAEA6hC,QAAAK,EAAA,CACAC,MAAAN,EACK7hC,KAAA,SACL,GAEAi+B,KAAAK,EAGAoD,kBAAAA,EAEAK,gBAAAA,EAEAG,aAAAA,EAIGtB,YAAAA,CACH,EAAA2B,CAAA,CAAAxhB,EAAA,EAAA4gB,GACA,OAAAa,CAAA,CC7S6C,IAAAC,EAAA,2IAE7C,SAAAC,EAAAjjC,CAAA,EACA,OAAA1B,KAAA2kC,KAAA,CAAAjjC,IAAAA,GAAA,GACA,CACA,IAAAkjC,EAAA,CACAC,cAAA,WACA,EAAAC,EAAA,6CAOA,SAAAC,EAAArB,CAAA,CAAAsB,CAAA,EACA,IAAA1N,EAAA,mBAAA0N,EAAAA,EAAAtB,GAAAsB,CAAA,CACA,CACAC,WAAAA,EAAAH,CAAA,CAEAI,SAAAA,EAAA,GAEAC,gBAAAA,EAAA,IACAC,kBAAAA,EAAA,IACAC,iBAAAA,EAAA,IACAC,eAAAA,EAAA,IAGAC,aAAAA,EAAA,GAEAC,YAAAA,CAAA,CACMC,QAAAC,CAAA,CACN,CAAApO,EACAsM,EAA2C,CAAE,EAO1C3E,EAAAvX,CAAA,EAAA4P,EAAAoN,GAEHiB,EAAAT,EAAA,GACAO,EAAAC,GAAA7lC,CAAAA,GAAA,GAAAA,EAAA0lC,EAAAI,EAAA,MACAC,EAAA,CAAAlL,EAAA76B,EAAA86B,EAAAkL,EAAAC,IAAA,GAAAxH,EAAA5W,CAAA,GACAud,WAAAA,EACAvK,WAAAA,EACAwK,SAAAO,EAAA5lC,GAEG86B,WAAAA,CACH,EAAAsK,IAAAH,EAAsB,CAClBe,cAAI,GAAAlB,EAAAkB,EAAAhmC,GAAA,KACR,GAAAimC,EAAAN,GACArZ,EAAA,CACA4Z,GAAAH,EAAAT,EAAA,eACAa,GAAAJ,EAAAT,EAAA,YACAc,GAAAL,EAAAR,EAAA,YACAc,GAAAN,EAAAR,EAAA,cACAe,GAAAP,EAAAR,EAAA,YACAgB,GAAAR,EAAAP,EAAA,YACAgB,UAAAT,EAAAR,EAAA,aACAkB,UAAAV,EAAAP,EAAA,YACAkB,MAAAX,EAAAR,EAAA,YACAoB,MAAAZ,EAAAR,EAAA,aACAqB,OAAAb,EAAAP,EAAA,WAAAT,GACA8B,QAAAd,EAAAR,EAAA,YACAuB,SAAAf,EAAAR,EAAA,UAAAR,GAEAgC,QAAA,CACA3B,WAAA,UACAvK,WAAA,UACAwK,SAAA,UACAvK,WAAA,UACAkL,cAAA,SACA,CACA,EACA,SAAA1G,EAAAzX,CAAA,KAAA4W,EAAA5W,CAAA,GACA6d,aAAAA,EACAE,QAAAA,EACAR,WAAAA,EACAC,SAAAA,EACAC,gBAAAA,EACAC,kBAAAA,EACAC,iBAAAA,EACGC,eAAAA,CACH,EAAAnZ,GAAAyX,EAAA,CACG3f,MAAA,EACH,GCxFA,IAAA4iB,EAAA,GACAC,EAAA,IACAC,EAAA,IACA,SAAAC,EAAmB,GAAKC,CAAA,EACxB,SAAAA,CAAA,SAAAA,CAAA,SAAAA,CAAA,SAAAA,CAAA,oBAAAJ,MAAAI,CAAA,SAAAA,CAAA,SAAAA,CAAA,SAAAA,CAAA,oBAAAH,MAAAG,CAAA,SAAAA,CAAA,SAAAA,CAAA,UAAAA,CAAA,qBAAAF,IAAA,CAIA,IAAAG,EAAA,QAAAF,EAAA,SAAe,MAAO,WAAAA,EAAA,0BAAAA,EAAA,0BAAAA,EAAA,2BAAAA,EAAA,2BAAAA,EAAA,4BAAAA,EAAA,4BAAAA,EAAA,4BAAAA,EAAA,4BAAAA,EAAA,6BAAAA,EAAA,6BAAAA,EAAA,6BAAAA,EAAA,6BAAAA,EAAA,6BAAAA,EAAA,6BAAAA,EAAA,8BAAAA,EAAA,8BAAAA,EAAA,8BAAAA,EAAA,8BAAAA,EAAA,+BAAAA,EAAA,+BAAAA,EAAA,+BAAAA,EAAA,+BAAAA,EAAA,oCAAAG,EAAAD,ECNtB,IAAAE,EAAA,8BAGAC,EAAA,CAEAC,UAAA,+BAGAC,QAAA,+BAEAC,OAAA,6BAEAC,MAAA,gCAKAC,EAAA,CACAC,SAAA,IACAC,QAAA,IACAC,MAAA,IAEAC,SAAA,IAEAC,QAAA,IAEAC,eAAA,IAEAC,cAAA,GACA,EACA,SAAAC,EAAYC,CAAA,EACZ,SAAAnoC,KAAA2kC,KAAA,CAAAwD,GAAA,IAEA,SAAAC,GAAAC,CAAA,EACA,IAAAA,EACA,QACA,KAAA5iC,EAAA4iC,EAAA,GAIA,OAAAroC,KAAA2kC,KAAA,OAAAl/B,GAAA,IAAAA,EAAA,MACe,CACf,SAAA6iC,GAAuBC,CAAA,EACvB,IAAAC,EAAA,GAAyBlK,EAAA5W,CAAA,GAAQ,EAAG2f,EAAAkB,EAAAlB,MAAA,EACpCoB,EAAA,GAAAnK,EAA+C5W,CAAA,KAAAggB,EAAAa,EAAAb,QAAA,EAC/C7iC,EAAA,CAAAH,EAAA,QAAApB,EAAA,MACA,IACAokC,SAAAgB,EAAAD,EAAAX,QAAA,CACAT,OAAAsB,EAAAH,EAAAlB,SAAA,CACQsB,MAAAA,EAAA,EACR,CAAAtlC,QAC6C,CAAE,EAuB1C27B,EAAAvX,CAAA,EAAApkB,EAAA8jC,GAEL,CAAAtnC,MAAA6D,OAAA,CAAAe,GAAAA,EAAA,CAAAA,EAAA,EAAAvE,GAAA,CAAA0oC,GAAA,GAAAA,EAAA,oBAAAH,EAAAA,EAAAR,EAAAQ,EAAA,IAAAC,EAAA,oBAAAC,EAAAA,EAAAV,EAAAU,EAAA,IAAAnnC,IAAA,KACA,EACA,SAAA68B,EAAA5W,CAAA,GACA0gB,sBAAAA,GACGvjC,OAAAA,CACH,EAAA0jC,EAAA,CACAlB,OAAAmB,EACGd,SAAAe,CACH,GCpFA,IAAAxN,GAAA,CACA6N,cAAA,IACAC,IAAA,KACAC,UAAA,KACAC,OAAA,KACAC,OAAA,KACAC,MAAA,KACAC,SAAA,KACAC,QAAA,IACA,EAAqB,IAAAC,GAAArO,GCRwB,IAAAsO,GAAA,gFAoFnB,IAAAvK,GAzE1B,SAAA17B,EAAA,MAAAkF,CAAA,EACA,IACAi3B,OAAA+J,EAAA,GACA9F,QAAA+F,EAAA,GACAC,YAAAC,EAAA,GACM3E,WAAA4E,EAAA,GACN,CAAAtmC,EACAsgC,EAAA,GAAA3E,EAAAvX,CAAA,EAAApkB,EAAAimC,IACA,GAAAjmC,EAAAumC,IAAA,CAEA,eAAA3K,EAAAxX,CAAA,OAEA,IAAAgc,EAAAD,EAAsBgG,GACtBK,EAAiB,GAAAxK,EAAS5X,CAAA,EAAApkB,GAC1BymC,EAAY,GAAA5K,EAAYzX,CAAA,EAAAoiB,EAAA,CACxBrK,OAAAF,EAAAuK,EAAAtK,WAAA,CAAAgK,GACA9F,QAAAA,EAEAwD,QAAAC,EAAgB7mC,KAAgB,GAChC0kC,WAAAD,EAAiBrB,EAAiBkG,GAClCF,YAAYpB,GAAAqB,GACT1O,OAAA,GAAAqD,EAAA5W,CAAA,KAAA4hB,GACH,UACAS,EAAA,GAAA5K,EAAAzX,CAAA,EAAAqiB,EAA4CnG,GAgC5CmG,CA/BAA,EAA6CvhC,EA6B1C6R,MAAA,EAAAC,EAAA0vB,IAAA,GAAA7K,EAAAzX,CAAA,EAAApN,EAAA0vB,GAAAD,EAAA,EAEHE,iBAAA,IAAA3L,EAAA5W,CAAA,KAAA0X,EAAA1X,CAAA,CAAAkc,IAAA,EAAAA,EAAA,OAAAA,EAAAqG,iBAAA,EACAF,EAAWG,WAAA,UAAAxlC,CAAA,EACX,SAAA26B,EAAA3X,CAAA,GACAyiB,GAAAzlC,EACK0lC,MAAA,MAEL,EACAL,CACA,CAU0B,eAAAtrC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eCxF1B,IAAA0rC,EAAA1rC,EAAA,MAIA,IAAAigC,EAAA,GAAAyL,EAA2B3iB,CAAA,GAAAhpB,CAAAA,EAAA,EAAAkgC,CAAA,eAAAngC,CAAA,CAAAC,CAAA,ECJ3B,YAA2BA,CAAAA,EAAA,8BAAAD,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA6/B,CAAA,IAAA5/B,EAAA,UAAA2rC,EAAA3rC,EAAA,KCA3B4rC,EAAA5rC,EAAA,MAOA,SAAA6rC,EAAA7rB,CAAA,EACA,OAAAA,MAAAA,GAAA5c,IAAAA,OAAAiE,IAAA,CAAA2Y,GAAAze,MAAA,CAEA,SAAAq+B,EAAA75B,CAAA,EACA,IACA4wB,OAAAA,CAAA,CACIsJ,aAAAA,EAAA,GACJ,CAAAl6B,EACAo6B,EAAsB,mBAAAxJ,EAAAmV,GAAAnV,EAAAkV,EAAKC,GAAA7L,EAAA6L,CAAA,EAAAnV,CAAA,CAC3B,SAAAiV,EAAAxL,GAAA,EAAAuL,EAAAI,EAAA,EACGpV,OAAAwJ,CACH,EACA,CAGE,gBAAArgC,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCnBF,IAAAgsC,EAA6ChsC,EAAA,KAI7CK,CAAAA,EAAA4rC,EAAA,CAAAC,EAGA7rC,EAAAkkC,EAAA,CAAA4H,EAGA9rC,EAAAklC,EAAA,CAAA6G,EAIA/rC,EAAAgkC,EAAA,CAAAgI,EAQA,IAAAC,EAAAN,EAAoChsC,EAA0B,MAC9DusC,EAAAP,EAAAhsC,EAAA,OAUA,SAAMwsC,EAIHzpC,CAAA,CAAA0pC,EAAA,EAAAC,EAAA,GAEH,SAAAH,EAAAplB,OAAA,EAAApkB,EAAA0pC,EAAAC,EAAA,CAQA,SAAAC,EAAAlH,CAAA,EACAA,EAAAA,EAAA9jC,KAAA,IACA,IAAAirC,EAAA,cAAAnH,EAAAlkC,MAAA,gBACAsrC,EAAApH,EAAAhI,KAAA,CAAAmP,GAIA,OAHAC,GAAAA,IAAAA,CAAA,IAAAtrC,MAAA,EACAsrC,CAAAA,EAAAA,EAAArrC,GAAA,CAAAb,GAAAA,EAAAA,EAAA,EAEAksC,EAAA,MAAAA,IAAAA,EAAAtrC,MAAA,WAAAsrC,EAAArrC,GAAA,EAAAb,EAAAe,IACGA,EAAa,EAAAorC,SAAAnsC,EAAA,IAAAU,KAAA2kC,KAAA,CAAA8G,SAAAnsC,EAAA,kBAChBmC,IAAA,aAcA,SAAAiqC,EAAAtH,CAAA,MAeAuH,EAbA,GAAAvH,EAAAxiC,IAAA,CACA,OAAAwiC,CACA,CACA,GAAAA,MAAAA,EAAAza,MAAA,IACA,OAAA+hB,EAAAJ,EAAAlH,GACA,CACA,IAAAwH,EAAAxH,EAAAllB,OAAA,MACAtd,EAAAwiC,EAAAyH,SAAA,GAAAD,GACA,sBAAoB,MAAwC,OAC+B,SAAA1sB,OAAA,CAAAtd,GAC3F,eAAAqpC,EAAAnlB,OAAA,IAAAse,GAAA,CAEA,IAAA7rB,EAAA6rB,EAAAyH,SAAA,CAAAD,EAAA,EAAAxH,EAAAlkC,MAAA,IAEA,GAAA0B,UAAAA,EAMA,IAJA+pC,EAAApzB,CADAA,EAAAA,EAAAsB,KAAA,OACAiB,KAAA,GACA,IAAAvC,EAAArY,MAAA,EAAAqY,MAAAA,CAAA,IAAAoR,MAAA,KACApR,CAAAA,CAAA,IAAAA,CAAA,IAAAjY,KAAA,KAEA,0BAA8D,UAC+B,2BAAA4e,OAAA,CAAAysB,GAC7F,eAAAV,EAAAnlB,OAAA,KAAA6lB,GAAA,MAGApzB,EAAAA,EAAAsB,KAAA,KACA,CAEA,OADAtB,EAAAA,EAAApY,GAAA,CAAAuB,GAAAoqC,WAAApqC,IACA,CACAE,KAAAA,EACA2W,OAAAA,EACAozB,WAAAA,CACA,EAiCA,SAAAI,EAAA3H,CAAA,EACA,IACAxiC,KAAAA,CAAA,CACI+pC,WAAAA,CAAA,CACJ,CAAAvH,EACA,CACI7rB,OAAAA,CAAA,CACJ,CAAA6rB,EAaA,OAZAxiC,KAAAA,EAAAsd,OAAA,QAEI3G,EAAAA,EAAApY,GAAA,EAAAb,EAAAgG,IAAAA,EAAA,EAAAmmC,SAAAnsC,EAAA,IAAAA,CAAA,EACyB,KAA7BsC,EAAAsd,OAAmB,UACnB3G,CAAA,OAAmBA,CAAA,IAAU,GAC7BA,CAAA,OAAAA,CAAA,QAOA,GAAA3W,EAAA,GAJI2W,EADJ3W,KAAAA,EAAAsd,OAAgB,UACZ,GAAAysB,EAAA,GAAApzB,EAAA9W,IAAA,QAEJ,GAAA8W,EAAA9W,IAAA,SAEA,GAwBA,SAAAuqC,EAAA5H,CAAA,EACAA,EAAAsH,EAAAtH,GACA,IACI7rB,OAAAA,CAAA,CACJ,CAAA6rB,EACA3L,EAAAlgB,CAAA,IACAvU,EAAAuU,CAAA,QACA0zB,EAAA1zB,CAAA,QACAzZ,EAAAkF,EAAAhE,KAAAorC,GAAA,CAAAa,EAAA,EAAAA,GACAC,EAAA,CAAA5sC,EAAAwE,EAAA,CAAAxE,EAAAm5B,EAAA,SAAAwT,EAAAntC,EAAAkB,KAAAqrC,GAAA,CAAArrC,KAAAorC,GAAA,CAAAtnC,EAAA,IAAAA,EAAA,OACAlC,EAAA,MACAuqC,EAAA,CAAAnsC,KAAA2kC,KAAA,CAAAuH,IAAAA,EAAA,IAAAlsC,KAAA2kC,KAAA,CAAAuH,IAAAA,EAAA,IAAAlsC,KAAA2kC,KAAA,CAAAuH,IAAAA,EAAA,KAKA,MAJA,SAAA9H,EAAAxiC,IAAA,GACAA,GAAA,IACAuqC,EAAA3tC,IAAA,CAAA+Z,CAAA,MAEAwzB,EAAA,CACAnqC,KAAAA,EACG2W,OAAA4zB,CACH,EACA,CASA,SAAAC,EAAAhI,CAAA,EAEA,IAAA+H,EAAA/H,QAAAA,CADAA,EAAAsH,EAAAtH,EAAA,EACAxiC,IAAA,EAAAwiC,SAAAA,EAAAxiC,IAAA,CAAA8pC,EAAAM,EAAA5H,IAAA7rB,MAAA,CAAA6rB,EAAA7rB,MAAA,CASA,OAAAX,OAAA,OAAAu0B,CARAA,EAAAA,EAAAhsC,GAAA,CAAAksC,IACkB,UAAlBjI,EAAAxiC,IAAkB,EAClByqC,CAAAA,GAAA,KAEGA,GAAA,OAAAA,EAAA,QAAAA,EAAA,oBAIH,UAAAF,CAAA,UAAAA,CAAA,KAAAG,OAAA,KAWA,SAAAvB,EAAAwB,CAAA,CAAA7K,CAAA,EACA,IAAA8K,EAAAJ,EAAAG,GACAE,EAAAL,EAAA1K,GACA,OAAA1hC,KAAAqrC,GAAA,CAAAmB,EAAAC,GAAA,KAAAzsC,CAAAA,KAAAorC,GAAA,CAAAoB,EAAAC,GAAA,KAUA,SAAA5B,EAAAzG,CAAA,CAAA1iC,CAAA,EAWA,OAVA0iC,EAAAsH,EAAAtH,GACA1iC,EAAAypC,EAAAzpC,GACA0iC,CAAAA,QAAAA,EAAAxiC,IAAA,EAAAwiC,QAAAA,EAAAxiC,IAAA,GACAwiC,CAAAA,EAAAxiC,IAAA,OAEAwiC,UAAAA,EAAAxiC,IAAA,CACIwiC,EAAA7rB,MAAA,QAAA7W,EAAA,EAEJ0iC,EAAA7rB,MAAA,IAAA7W,EAEAqqC,EAAA3H,EACA,CAkBA,SAAA0G,EAAA1G,CAAA,CAAAsI,CAAA,EAGA,GAFAtI,EAAAsH,EAAAtH,GACAsI,EAAAvB,EAAAuB,GACAtI,KAAAA,EAAAxiC,IAAA,CAAAsd,OAAA,QACIklB,EAAA7rB,MAAA,OAAAm0B,OACJ,GAAAtI,KAAAA,EAAAxiC,IAAoB,CAAAsd,OAAO,SAAAklB,KAAAA,EAAAxiC,IAAA,CAAAsd,OAAA,UAC3B,QAAA5Z,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACA8+B,EAAA7rB,MAAA,CAAAjT,EAAA,IAAAonC,CAEA,CACA,OAAAX,EAAA3H,EACA,CAkBA,SAAA4G,EAAA5G,CAAA,CAAAsI,CAAA,EAGA,GAFAtI,EAAAsH,EAAAtH,GACAsI,EAAAvB,EAAAuB,GACAtI,KAAAA,EAAAxiC,IAAA,CAAAsd,OAAA,QACIklB,EAAA7rB,MAAA,UAAA6rB,EAAA7rB,MAAA,KAAAm0B,OACJ,GAAAtI,KAAAA,EAAAxiC,IAAoB,CAAAsd,OAAO,QAC3B,QAAA5Z,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACA8+B,EAAA7rB,MAAA,CAAAjT,EAAA,OAAA8+B,EAAA7rB,MAAA,CAAAjT,EAAA,EAAAonC,OAEA,GAAAtI,KAAAA,EAAAxiC,IAAoB,CAAAsd,OAAO,UAC3B,QAAA5Z,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACA8+B,EAAA7rB,MAAA,CAAAjT,EAAA,KAAA8+B,EAAA7rB,MAAA,CAAAjT,EAAA,EAAAonC,CAEA,CACA,OAAAX,EAAA3H,EACA,CAiDA,gBAAA3lC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAw/B,CAAA,QAAAhI,EAAAv3B,EAAA,MAAAguC,EAAAhuC,EAAA,MCnXA4rC,EAAA5rC,EAAA,MAOA,IAAAiuC,EAAA1W,EAAAG,aAAA,CAAAtzB,KAAAA,GACA,SAAA8pC,EAAA,CACAnrC,MAAAA,CAAA,CACCgvB,SAAAA,CAAA,CACD,EACA,SAAA6Z,EAAAxL,GAAA,EAAA6N,EAAArW,QAAA,EACA70B,MAAAA,EACGgvB,SAAAA,CACH,EACA,CAeA,SAAAoc,EAAA1O,CAAA,EACA,IACAgM,MAAAA,CAAA,CACAnoC,KAAAA,CAAA,CACIyC,MAAAA,CAAA,CACJ,CAAA05B,EACA,IAAAgM,GAAA,CAAAA,EAAA2C,UAAA,GAAA3C,EAAA2C,UAAA,CAAA9qC,EAAA,CACA,OAAAyC,CACA,CACA,IAAAwD,EAAAkiC,EAAA2C,UAAA,CAAA9qC,EAAA,QACA,EAAA+qC,YAAA,CAEA,GAAAL,EAAAjlB,CAAA,EAAAxf,EAAA8kC,YAAA,CAAAtoC,GAEA,EAAAuoC,cAAA,EAAA/kC,EAAAikB,QAAA,CAIAznB,EAFA,GAAAioC,EAAAjlB,CAAA,EAAAxf,EAAAxD,EAHA,CAOA,SAAAw5B,EAAA,CACAx5B,MAAAA,CAAA,CACCzC,KAAAA,CAAA,CACD,EACA,IAAA9C,EAAA+2B,EAAAS,UAAA,CAAAiW,GACA,OAAAE,EAAA,CACApoC,MAAAA,EACAzC,KAAAA,EACAmoC,MAAA,CACA2C,WAAA5tC,CACG,CACH,EACA,CAAmCT,EAAA,EAAAmuC,CAAA,gBAAApuC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAwuC,CAAA,QAAAC,EAAAxuC,EAAA,MAAAyuC,EAAAzuC,EAAA,MAAAu3B,EAAAv3B,EAAA,MC/DuB4rC,EAAA5rC,EAAA,MAG3B,IAAAyiC,EAAA,UAI/BiM,EAAAnX,EAAAG,aAAA,GACA,SAAAiX,EAAAhW,CAAA,EACA,IACM51B,MAAAA,CAAA,CACN,CAAA41B,EACA5yB,EAAA,GAAA0oC,EAAgD1lB,CAAA,EAAA4P,EAAA8J,GAChD,SAAAmJ,EAAAxL,GAAA,EAAAsO,EAAA9W,QAAA,IAAA4W,EAAAzlB,CAAA,GACGhmB,MAAAA,IAAA,EAAAA,GAAAA,CACH,EAAAgD,GACA,CAKA,IAAAwoC,EAAA,IAAgB,CAChB,IAAAxrC,EAAAw0B,EAAAS,UAAA,CAAA0W,GACA,OAAA3rC,IAAA,EAAAA,GAAAA,CACA,CAA0BhD,CAAAA,EAAA,EAAA4uC,CAAA,gBAAA7uC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAA6uC,CAAA,uBAAAC,CAAA,uBAAAj1B,CAAA,uBAAAk1B,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,ICxBgC,IAAAC,EAAAjvC,EAAA,MAQ1D,IAAA4Z,EAAA,CACAs1B,GAAA,EAEAC,GAAA,IAEAC,GAAA,IAEAC,GAAA,KAEAC,GAAA,IACA,EACAC,EAAA,CAGAloC,KAAA,0BAAkC,CAClC45B,GAAAj+B,GAAA,qBAAA4W,CAAA,CAAA5W,EAAA,OAEA,SAAAgsC,EAAAjpC,CAAA,CAAAypC,CAAA,CAAAC,CAAA,EACA,IAAAhE,EAAA1lC,EAAA0lC,KAAA,KACA,GAAAtqC,MAAA6D,OAAA,CAAAwqC,GAAA,CACA,IAAAE,EAAAjE,EAAA5K,WAAA,EAAA0O,EACA,OAAAC,EAAA9zB,MAAA,EAAAC,EAAAg0B,EAAAjuC,KACAia,CAAA,CAAA+zB,EAAAzO,EAAA,CAAAyO,EAAAroC,IAAA,CAAA3F,EAAA,GAAA+tC,EAAAD,CAAA,CAAA9tC,EAAA,EACSia,GACT,GACA,IACA,iBAAA6zB,EAAA,CACA,IAAAE,EAAAjE,EAAA5K,WAAA,EAAA0O,EACA,OAAAnsC,OAAAiE,IAAA,CAAAmoC,GAAA9zB,MAAA,EAAAC,EAAAi0B,IAAA,CAEA,GAAAxsC,KAAAA,OAAAiE,IAAA,CAAAqoC,EAAA91B,MAAA,EAAAA,GAAA2G,OAAA,CAAAqvB,GAAA,CACA,IAAAC,EAAAH,EAAAzO,EAAA,CAAA2O,EACQj0B,CAAAA,CAAA,CAAAk0B,EAAA,CAAAJ,EAAAD,CAAA,CAAAI,EAAA,CAAAA,EACR,MACA,IAAAE,EAAAF,CACAj0B,CAAAA,CAAA,CAAAm0B,EAAA,CAAAN,CAAA,CAAAM,EAAA,CACA,OACSn0B,CACT,KACA,KACA6X,EAAAic,EAAAD,GACA,OAAAhc,CACA,CA6BA,SAAAsb,EAAAiB,EAAA,IACA,IAAAC,EACA,IAAAC,EAAA,MAAAD,CAAAA,EAAAD,EAAA1oC,IAAA,SAAA2oC,EAAAt0B,MAAA,EAAAC,EAAA3Y,IAAA,CACA,IAAAktC,EAAAH,EAAA9O,EAAA,CAAAj+B,GAEG,OADH2Y,CAAA,CAAAu0B,EAAA,IACOv0B,CACP,MACA,OAAAs0B,GAAA,EACO,CACP,SAAArB,EAAAuB,CAAA,CAAAC,CAAA,EACA,OAAAD,EAAAz0B,MAAA,EAAAC,EAAA3Y,IAAA,CACA,IAAAqtC,EAAA10B,CAAA,CAAA3Y,EAAA,CACAstC,EAAA,CAAAD,GAAAjtC,IAAAA,OAAAiE,IAAA,CAAAgpC,GAAA9uC,MAAA,CAIG,OAHH+uC,GACA,OAAA30B,CAAA,CAAA3Y,EAAA,CAEG2Y,CACH,EAAAy0B,EACO,CACP,SAAArB,EAAAgB,CAAA,IAAApZ,CAAA,EACA,IAAA4Z,EAAAzB,EAAAiB,GACAS,EAAA,CAAAD,KAAA5Z,EAAA,CAAAjb,MAAA,EAAAyW,EAAAhuB,IAAA,GAAA8qC,EAAAlmB,CAAA,EAAAoJ,EAAAhuB,GAAA,IACA,OAAAyqC,EAAAxrC,OAAAiE,IAAA,CAAAkpC,GAAAC,EAAA,CAMA,SAAAC,EAAAC,CAAA,CAAAhB,CAAA,EAEA,oBAAAgB,EACA,QACA,CACA,IAAAC,EAAA,GACAC,EAAAxtC,OAAAiE,IAAA,CAAAqoC,GAcA,OAbAvuC,MAAA6D,OAAA,CAAA0rC,GACAE,EAAApjC,OAAA,EAAAoiC,EAAAjpC,IAAA,CACAA,EAAA+pC,EAAAnvC,MAAA,EACAovC,CAAAA,CAAA,CAAAf,EAAA,IAEI,GAEJgB,EAAApjC,OAAA,CAAAoiC,GAAA,CACA,MAAAc,CAAA,CAAAd,EAAA,EACAe,CAAAA,CAAA,CAAAf,EAAA,IAEA,GAEAe,CACO,CACP,SAAA9B,EAAA,CACAj1B,OAAA82B,CAAA,CACA7P,YAAA6O,CAAA,CACCiB,KAAAE,CAAA,CACD,MAMAzc,EALA,IAAAuc,EAAAE,GAAAJ,EAAAC,EAAAhB,GACAroC,EAAAjE,OAAAiE,IAAA,CAAAspC,UACA,IAAAtpC,EAAA9F,MAAA,CACAmvC,EAGArpC,EAAAqU,MAAA,EAAAC,EAAAi0B,EAAAjpC,KACAxF,MAAA6D,OAAA,CAAA0rC,IACA/0B,CAAA,CAAAi0B,EAAA,CAAAc,IAAA,EAAAA,CAAA,CAAA/pC,EAAA,CAAA+pC,CAAA,CAAA/pC,EAAA,CAAA+pC,CAAA,CAAAtc,EAAA,CACMA,EAAAztB,GACN,iBAAA+pC,GACA/0B,CAAA,CAAAi0B,EAAA,CAAAc,IAAA,EAAAA,CAAA,CAAAd,EAAA,CAAAc,CAAA,CAAAd,EAAA,CAAAc,CAAA,CAAAtc,EAAA,CACMA,EAAAwb,GAENj0B,CAAA,CAAAi0B,EAAA,CAAAc,EAEO/0B,GACP,GAbA,CAc0B,gBAAA7b,CAAA,CAAAC,CAAA,CAAAC,CAAA,eC7F1B,SAAA8wC,EAAA9tC,CAAA,CAAA2zB,CAAA,EAEA,IAAA8U,EAAA,KACA,GAAAA,EAAAP,IAAA,qBAAAO,EAAAsF,sBAAA,EAGA,IAAAna,EAAA6U,EAAAsF,sBAAA,CAAA/tC,GAAA2hB,OAAA,+BACA,OACA,CAAAiS,EAAA,CAAAD,CACA,CACA,QACA,EAAAoO,OAAA,CAAA1gB,IAAA,GAAArhB,EACA2zB,EAEA,EADA,CDgF0B32B,EAAAC,CAAA,CAAAF,EAAA,qBAAA+wC,CAAA,CCxJ1B,EAyEA,gBAAAhxC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAixC,CAAA,QAAAC,EAAAjxC,EAAA,MCzEoGkxC,EAAAlxC,EAAA,MAGpG,IAAAyiC,EAAA,yBAIA0O,EAAAv3B,GAAA,CACA,IAAAw3B,EAAAhuC,OAAAiE,IAAA,CAAAuS,GAAApY,GAAA,CAAAwB,GAAA,EACAA,IAAAA,EACG0qC,IAAA9zB,CAAA,CAAA5W,EAAA,CACH,OAGA,OADAouC,EAAAC,IAAA,EAAAC,EAAAC,IAAAD,EAAA5D,GAAA,CAAA6D,EAAA7D,GAAA,EACA0D,EAAW11B,MAAA,EAAAC,EAAAqE,IACX,GAAAkxB,EAAAnoB,CAAA,KAAApN,EAAA,CACK,CAAAqE,EAAAhd,GAAA,EAAAgd,EAAA0tB,GAAA,GAEL,KAIA,SAAAsD,EAAAnQ,CAAA,EACA,IAGAjnB,OAAAA,EAAA,CACAs1B,GAAA,EAEAC,GAAA,IAEAC,GAAA,IAEAC,GAAA,KAEOC,GAAA,IACP,EACAkC,KAAAA,EAAA,KACMC,KAAAA,EAAA,EACN,CAAA5Q,EACAoE,EAAA,GAAAgM,EAAAloB,CAAA,EAAA8X,EAAA4B,GACAiP,EAAAP,EAAAv3B,GACAvS,EAAAjE,OAAAiE,IAAA,CAAAqqC,GACA,SAAAzQ,EAAAj+B,CAAA,EACA,IAAAD,EAAA,iBAAA6W,CAAA,CAAgC5W,EAAA,CAAa4W,CAAA,CAAA5W,EAAA,CAAAA,CAAA,CAC7C,2BAAAD,EAAA,EAAAyuC,EAAA,GAEA,SAAAG,EAAA3uC,CAAA,EACA,IAAAD,EAAA,iBAAA6W,CAAA,CAAgC5W,EAAA,CAAmB4W,CAAO,CAAA5W,EAAA,CAAAA,CAAA,CAC1D,2BAAAD,EAAA0uC,EAAA,MAAAD,EAAA,GAEA,SAAAI,EAAAC,CAAA,CAAA1gB,CAAA,EACA,IAAA2gB,EAAAzqC,EAAAkZ,OAAgC,CAAA4Q,GAChC,4CAAAvX,CAAA,CAAAi4B,EAAA,CAAAj4B,CAAA,CAAAi4B,EAAA,CAAAA,CAAA,GAAAL,EAAA,oBAAAM,KAAAA,GAAA,iBAAAl4B,CAAA,CAAAvS,CAAA,CAAAyqC,EAAA,EAAAl4B,CAAA,CAAAvS,CAAA,CAAAyqC,EAAA,EAAA3gB,CAAA,EAAAsgB,EAAA,MAAAD,EAAA,GAEA,SAAAO,EAAA/uC,CAAA,SACA,EAAAud,OAAA,CAAAvd,GAAA,EAAAqE,EAAA9F,MAAA,CACAqwC,EAAA5uC,EAAAqE,CAAA,CAAAA,EAAAkZ,OAAA,CAAAvd,GAAA,IAEAi+B,EAAAj+B,EADA,CAGA,SAAAgvC,EAAAhvC,CAAA,EAEA,IAAAivC,EAAA5qC,EAAAkZ,OAAA,CAAAvd,UACA,IAAAivC,EACAhR,EAAA55B,CAAA,KAEA4qC,IAAA5qC,EAAA9F,MAAA,GACAowC,EAAAtqC,CAAA,CAAA4qC,EAAA,EAEAL,EAAA5uC,EAAAqE,CAAA,CAAAA,EAAAkZ,OAAA,CAAAvd,GAAA,IAAA2hB,OAAA,+BAJA,CAMA,SAAAusB,EAAAnoB,CAAA,GACA1hB,KAAAA,EACAuS,OAAA83B,EACAzQ,GAAAA,EACA0Q,KAAAA,EACAC,QAAAA,EACAG,KAAAA,EACAC,IAAAA,EACGR,KAAAA,CACH,EAAAvM,EAAA,iBAAAnlC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAmyC,CAAA,QAAAvS,EAAA3/B,EAAA,MAAAsgC,EAAAtgC,EAAA,MAAAwgC,EAAAxgC,EAAA,MAAAgxC,EAAAhxC,EAAA,MChFA,IAAAmyC,EAAA,CACAC,aAAA,CACA,EAAoB,IAAAC,EAAAF,EAAAG,EAAAtyC,EAAA,MCGpB,SAAAuyC,EAAAC,EAAA,GAEA,GAAAA,EAAAC,GAAA,CACA,OAAAD,CAAA,CAMA,IAAAE,EAAA,GAAAJ,EAAAK,EAAA,GACGC,QAAAJ,CACH,GACQI,EAIH,IAAAC,IAAA,CAEL,IAAAhpC,EAAAgpC,IAAAA,EAAAtxC,MAAA,KAAAsxC,CAAA,CACA,OAAAhpC,EAAArI,GAAA,CAAA6pC,GAAA,CACA,IAAA7X,EAAAkf,EAAArH,GACK,uBAAA7X,EAAA,GAAAA,EAAA,IAAAA,CAAA,GACL1wB,IAAA,KACA,EAEA,OADA8vC,EAAAH,GAAA,IACAG,CAAA,KAAAlS,EAAA1gC,EAAA,MAAAygC,EAAAzgC,EAAA,MAAA8wC,EAAA9wC,EAAA,MC5B6C,IAAAyiC,EAAA,4CAuCnB,IAAAyP,EA/B1B,SAAAvtC,EAAA,MAAAkF,CAAA,EACA,IACAg3B,YAAAkP,EAAgC,GAChChL,QAAA+F,EAAA,GACA8H,QAAAJ,CAAA,CACML,MAAAW,EAAA,GACN,CAAAnuC,EACAsgC,EAAA,GAAA3E,EAAsBvX,CAAiB,EAAApkB,EAAA89B,GACvC5B,EAAkB,GAAAmQ,EAAajoB,CAAA,EAAAgnB,GAC/B6C,EAAiBL,EAAAC,GACjBpH,EAAA,GAAA5K,EAAAzX,CAAA,GACA8X,YAAAA,EACAmD,UAAA,MACAoK,WAAA,GAEArJ,QAAA,GAAApF,EAAA5W,CAAA,GACK1E,KAAA,OACL,EAAAymB,GACA8H,QAAAA,EACGT,MAAA,GAAAxS,EAAA5W,CAAA,KAAAspB,EAAAS,EACH,EAAA7N,GAUA,OATAmG,EAAA0F,WAAA,CAAAA,EAA4C/nB,CAAA,CAE5CqiB,CADAA,EAAAvhC,EAAA6R,MAAA,EAAAC,EAA+B0vB,IAAA,GAAA7K,EAAazX,CAAA,EAAApN,EAAA0vB,GAAAD,EAAe,EAC3DE,iBAAA,IAAA3L,EAAA5W,CAAA,KAAA0X,EAAA1X,CAAA,CAAAkc,IAAA,EAAAA,EAAA,OAAAA,EAAAqG,iBAAA,EACAF,EAAWG,WAAA,UAAAxlC,CAAA,EACX,SAAA26B,EAAA3X,CAAA,GACAyiB,GAAAzlC,EACK0lC,MAAA,MAEL,EACAL,CACA,CAA0B,gBAAAtrC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eC1CmB,IAAAivC,EAAAjvC,EAAA,MAE7C,SAAA+yC,EAAAp3B,CAAA,CAAAg0B,CAAA,SACA,EAGA,GAAAV,EAAAlmB,CAAA,EAAApN,EAAAg0B,EAAA,CACGrqB,MAAA,EACH,GAJA3J,CACA,CAIoB5b,EAAA,EAAAgzC,CAAA,gBAAAjzC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAizC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,QAAAvS,EAAA7gC,EAAA,MAAAowC,EAAApwC,EAAA,MAAA+yC,EAAA/yC,EAAA,MCRpB,SAAAi3B,EAAAC,CAAA,EACA,IAAAH,EAAA,GACA,OAAAI,IACA/yB,KAAAA,IAAA2yB,CAAA,CAAAI,EAAA,EACAJ,CAAAA,CAAA,CAAAI,EAAA,CAAAD,EAAAC,EAAA,EAEAJ,CAAA,CAAAI,EAAA,CACA,CCFA,IAAAkc,EAAA,CACA7oB,EAAA,SACApC,EAAA,SACA,EACAkrB,EAAA,CACA9tC,EAAA,MACAf,EAAA,QACA4U,EAAA,SACAi0B,EAAA,OACA7pC,EAAA,iBACAqxB,EAAA,kBAEAye,EAAA,CACAC,QAAA,KACAC,QAAA,KACAC,SAAA,KACAC,SAAA,MAMAC,EAAA3c,EAAA4c,GAAA,CAEA,GAAAA,EAAAtyC,MAAA,IACA,IAAAgyC,CAAA,CAAAM,EAAA,CAGA,OAAAA,EAAA,CAFMA,EAAAN,CAAA,CAAAM,EAAA,CAIN,GACA,CAAA1zC,EAAAkZ,EAAA,CAAAw6B,EAAA34B,KAAA,KACAlC,EAAAq6B,CAAA,CAAAlzC,EAAA,CACA6jC,EAAAsP,CAAA,CAAAj6B,EAAA,KACC,OAAAlY,MAAA6D,OAAA,CAAAg/B,GAAAA,EAAAxiC,GAAA,CAAAsyC,GAAA96B,EAAA86B,GAAA,CAAA96B,EAAAgrB,EAAA,GAEM+P,EAAA,8NACPC,EAAA,2OACOC,EAAA,IAAAF,KAAAC,EAAA,CACP,SAAAf,EAAAxH,CAAA,CAAAyI,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EACA,IAAAC,EAAA,MAAAD,CAAAA,EAAA,GAAAjE,EAAAmE,EAAA,EAAA9I,EAAAyI,EAAA,KAAAG,EAAAF,CAAA,OACA,iBAAAG,EACAlkB,GACA,iBAAAA,EACAA,EAOAkkB,EAAAlkB,CANA,CASAjvB,MAAA6D,OAAA,CAAAsvC,GACAlkB,GACA,iBAAAA,EACAA,EASAkkB,CAAA,CAAAlkB,EAAA,CAGA,mBAAAkkB,EACAA,EAKA,IAAAlwC,KAAAA,CAtBA,CAwBA,SAAA4uC,EAAAvH,CAAA,EACA,OAAAwH,EAAAxH,EAAA,sBACO,CACP,SAAAyH,EAAAsB,CAAA,CAAAhF,CAAA,EACA,oBAAAA,GAAAA,IAAA,EAAAA,EACA,OAAAA,CACA,CACA,IAAApf,EAAA/uB,KAAA+uB,GAAA,CAAAof,GACAiF,EAAAD,EAAApkB,UACA,KACAqkB,EAEA,iBAAAA,EACA,CAAAA,EAEA,IAAAA,EAAA,EAEA,SAAAC,EAAAC,CAAA,CAAAH,CAAA,EACA,OAAAhF,GAAAmF,EAAAj5B,MAAA,EAAAC,EAAAi5B,KACAj5B,CAAA,CAAAi5B,EAAA,CAAA1B,EAAAsB,EAAAhF,GACO7zB,GACP,GACA,CACA,SAAAk5B,EAAA9uC,CAAA,CAAAsB,CAAA,CAAAwsC,CAAA,CAAAW,CAAA,EAGA,GAAAntC,KAAAA,EAAAkZ,OAAA,CAAAszB,GACA,YAEA,IAAAc,EAAAf,EAAAC,GACApE,EAAAiF,EAAAC,EAAAH,GACAhF,EAASzpC,CAAA,CAAA8tC,EAAA,CACT,SAAAhT,EAAAiU,EAAA,EAAA/uC,EAAAypC,EAAAC,EACA,CACA,SAAAsF,EAAAhvC,CAAA,CAAAsB,CAAA,EACA,IAAAmtC,EAAAxB,EAAAjtC,EAAA0lC,KAAA,EACA,OAAAroC,OAAAiE,IAAA,CAAAtB,GAAAvE,GAAA,CAAAqyC,GAAAgB,EAAA9uC,EAAAsB,EAAAwsC,EAAAW,IAAA94B,MAAA,CAAAq3B,EAAAhqB,CAAA,IACO,CACP,SAASoqB,EAAAptC,CAAA,CAAK,CACd,OAAAgvC,EAAAhvC,EAAAguC,EACA,CAMA,SAASX,EAAArtC,CAAK,EACd,OAAAgvC,EAAAhvC,EAAAiuC,EACA,CAMA,SAASpB,EAAA7sC,CAAK,EACd,OAAAgvC,EAAAhvC,EAAAkuC,EACA,CAZAd,EAAA6B,SAAA,IACO7B,EAAA8B,WAAA,CAAAlB,EAOPX,EAAA4B,SAAA,IACA5B,EAAA6B,WAAA,CAAAjB,EAOApB,EAAAoC,SAAA,IACApC,EAAAqC,WAAA,CAAAhB,CAAsB,gBAAAn0C,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAm1C,CAAA,uBAAAC,CAAA,QAAAC,EAAAp1C,EAAA,MCjJyBq1C,EAAAr1C,EAAA,MAI/C,SAAAk1C,EAAAl1B,CAAA,CAAApd,CAAA,CAAA0yC,EAAA,IACA,IAAA1yC,GAAA,iBAAAA,EACA,YAIA,GAAAod,GAAAA,EAAAkrB,IAAA,EAAwBoK,EAAK,CAC7B,IAAA5H,EAAA,QAAA9qC,EAAA,EAAAsY,KAAA,MAAAQ,MAAA,EAAAC,EAAAg0B,IAAAh0B,GAAAA,CAAA,CAAAg0B,EAAA,CAAAh0B,CAAA,CAAAg0B,EAAA,MAAA3vB,GACA,GAAA0tB,IAAA,EAAAA,EACA,OAAAA,CACA,CACA,OACA9qC,EAAAsY,KAAA,MAAAQ,MAAA,EAAAC,EAAAg0B,IACA,GAAAh0B,IAAA,EAAAA,CAAA,CAAAg0B,EAAA,CACAh0B,CAAA,CAAAg0B,EAAA,CAEG,KACH3vB,EACO,CACP,SAAAm1B,EAAAI,CAAA,CAAA7C,CAAA,CAAA8C,CAAA,CAAAC,EAAAD,CAAA,EACA,IAAAzyC,EAWA,OATIA,EADJ,mBAAAwyC,EACIA,EAAAC,GACJr0C,MAAA6D,OAAA,CAAAuwC,GACIA,CAAA,CAAAC,EAAA,EAAAC,EAEJP,EAAAK,EAAAC,IAAAC,EAEA/C,GACA3vC,CAAAA,EAAA2vC,EAAA3vC,EAAA0yC,EAAAF,EAAA,EAEAxyC,CACA,CACA,SAAAqtC,EAAAzrC,CAAA,EACA,IACAkvC,KAAAA,CAAA,CACAe,YAAAA,EAAAjwC,EAAAkvC,IAAA,CACAK,SAAAA,CAAA,CACIxB,UAAAA,CAAA,EAAA/tC,EAKJuyB,EAAAnxB,GAAA,CACA,GAAAA,IAAA,EAAAA,CAAA,CAAA8tC,EAAA,CACA,YAEA,IAAArE,EAAAzpC,CAAA,CAAA8tC,EAAA,CACApI,EAAA1lC,EAAA0lC,KAAA,CACA8J,EAAAL,EAAAzJ,EAAAyI,IAAA,GACAzE,EAAA+F,GAAA,CACA,IAAAzyC,EAAAoyC,EAAAI,EAAA7C,EAAA8C,SAKA,CAJAA,IAAAzyC,GAAA,iBAAAyyC,GAEAzyC,CAAAA,EAAAoyC,EAAAI,EAAA7C,EAAA,GAAAmB,EAAA,EAAA2B,YAAAA,EAAA,MAAAJ,EAAArsB,CAAA,EAAAysB,EAAA,GAAAA,EAAA,EAEAZ,CAAA,IAAAA,GACA7xC,EAEA,CACA,CAAA6xC,EAAA,CAAA7xC,CACA,CAHA,EAKA,SAAAsyC,EAAAP,EAAA,EAAA/uC,EAAAypC,EAAAC,EACA,EAKA,OAFAvY,EAAA8d,SAAA,IACA9d,EAAA+d,WAAA,EAAApB,EAAA,CACA3c,CACA,CAAoBn3B,EAAA,GAAAqwC,CAAA,gBAAAtwC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA21C,CAAA,QAAA9C,EAAA5yC,EAAA,MAAAowC,EAAApwC,EAAA,MAAA+yC,EAAA/yC,EAAA,MCnDE21C,EArBtB,YAAAhf,CAAA,EACA,IAAAif,EAAAjf,EAAAjb,MAAA,EAAAC,EAAAy0B,KACAA,EAAA6E,WAAA,CAAAznC,OAAA,CAAAqmC,GAAA,CACKl4B,CAAA,CAAAk4B,EAAA,CAAAzD,CACL,GACOz0B,GAAA,IAKPub,EAAAnxB,GACA3C,OAAAiE,IAAA,CAAAtB,GAAA2V,MAAA,EAAAC,EAAAk4B,IACA,CAAe,CAAAA,EAAA,CACf,GAAAd,EAAAhqB,CAAA,EAAApN,EAAAi6B,CAAA,CAAA/B,EAAA,CAAA9tC,IAES4V,CADT,CAEA,IAIA,OAFAub,EAAA8d,SAAA,IACA9d,EAAA+d,WAAA,CAAAte,EAAAjb,MAAA,EAAAC,EAAAy0B,IAAAz0B,EAAA8a,MAAA,CAAA2Z,EAAA6E,WAAA,MACA/d,CACA,EAAsB2J,EAAA7gC,EAAA,MCjBtB,SAAA61C,EAAA9yC,CAAA,QACA,iBAAAA,EACAA,EAEA,GAAAA,EAAA,UAEA,SAAS+yC,EAAAjC,CAAA,CAAAnB,CAAK,EACd,SAAAtC,EAAA2F,EAAA,GACAlC,KAAAA,EACAK,SAAA,UACGxB,UAAAA,CACH,EACO,CACA,IAAAsD,EAAAF,EAAA,SAAAD,GACAI,EAAAH,EAAA,YAAAD,GACAK,EAAAJ,EAAA,cAAAD,GACAM,EAAAL,EAAA,eAAAD,GACAO,EAAAN,EAAA,aAAAD,GACAQ,EAAAP,EAAA,eACAQ,EAAAR,EAAA,kBACAS,EAAAT,EAAA,oBACAU,EAAAV,EAAA,qBACAW,EAAAX,EAAA,mBACAY,EAAAZ,EAAA,UAAAD,GAAAc,EAAAb,EAAA,gBAKP1D,EAAArsC,GAAA,CACA,GAAAA,KAAwB3B,IAAxB2B,EAAAqsC,YAAwB,EAAArsC,IAAe,GAAfA,EAAAqsC,YAAe,EACvC,IAAAoC,EAAA,GAAA5B,EAAAgE,EAAA,EAAA7wC,EAAA0lC,KAAA,wCACAgE,EAAoBD,GAAA,EACf4C,aAAA,GAAAQ,EAAAiE,EAAA,EAAArC,EAAAhF,EACL,GACA,SAAA3O,EAAAiU,EAAA,EAAA/uC,EAAAA,EAAAqsC,YAAA,CAAA3C,EACA,QACA,KAIA2C,CAAAA,EAAA4C,SAAA,IACA5C,EAAA6C,WAAgB,CAAO,iBACvBU,EAAAK,EAAAC,EAAAC,EAAeC,EAAAC,EAAAC,EAAAC,EAAOC,EAAAC,EAAAC,EAAArE,EAAAsE,EAAAC,GCvCtB,IAAAG,EAAA/wC,GAAA,CACA,GAAAA,KAAA3B,IAAA2B,EAAA+wC,GAAA,EAAwB/wC,IAAA,GAAAA,EAAA+wC,GAAA,EACxB,IAAAtC,EAAA,GAAA5B,EAAAgE,EAAA,EAAA7wC,EAAA0lC,KAAA,oBACAgE,EAAWD,GAAQ,EACdsH,IAAA,GAAAlE,EAAAiE,EAAA,EAAArC,EAAAhF,EACL,GACA,SAAA3O,EAAAiU,EAAA,EAAA/uC,EAAAA,EAAA+wC,GAAA,CAAArH,EACA,QACA,KAIAqH,CAAAA,EAAA9B,SAAA,IAAA8B,EAAA7B,WAAA,SAKA,IAAA8B,EAAAhxC,GAAA,CACA,GAAAA,KAAwB3B,IAAxB2B,EAAAgxC,SAAA,EAAwBhxC,IAAe,GAAfA,EAAAgxC,SAAA,CAAe,CACvC,IAAAvC,EAAA,GAAA5B,EAAAgE,EAAA,EAAA7wC,EAAA0lC,KAAA,0BACAgE,EAAiBD,GAAQ,EACpBuH,UAAA,GAAAnE,EAAAiE,EAAA,EAAArC,EAAAhF,EACL,GACA,SAAA3O,EAAAiU,EAAA,EAAA/uC,EAAAA,EAAAgxC,SAAA,CAAAtH,EACA,QACA,KAIAsH,CAAAA,EAAA/B,SAAA,IAAA+B,EAAA9B,WAAA,eAKA,IAAA+B,EAAAjxC,GAAA,CACA,GAAAA,KAAA3B,IAAA2B,EAAAixC,MAAA,EAAwBjxC,IAAA,GAAAA,EAAAixC,MAAA,CAAe,CACvC,IAAAxC,EAAA,GAAA5B,EAAAgE,EAAA,EAAA7wC,EAAA0lC,KAAA,uBACAgE,EAAcD,GAAQ,EACjBwH,OAAA,GAAApE,EAAAiE,EAAA,EAAArC,EAAAhF,EACL,GACA,SAAA3O,EAAAiU,EAAA,EAAA/uC,EAAAA,EAAAixC,MAAA,CAAAvH,EACA,QACA,KAIAuH,CAAAA,EAAAhC,SAAA,IACOgC,EAAA/B,WAAA,CAAmB,WAC1B,IAAA1Z,EAAA,GAAA6U,EAAA2F,EAAA,GACClC,KAAA,YACM,GACP1Y,EAAA,GAAAiV,EAAA2F,EAAA,GACClC,KAAA,SACM,GACPoD,EAAA,GAAA7G,EAAA2F,EAAA,GACClC,KAAA,cACM,GACPqD,EAAA,GAAA9G,EAAA2F,EAAA,GACClC,KAAA,iBACM,GACPsD,EAAA,GAAA/G,EAAA2F,EAAA,GACClC,KAAA,cACM,GACPuD,EAAA,GAAAhH,EAAA2F,EAAA,GACClC,KAAA,qBACM,GACPwD,EAAA,GAAAjH,EAAA2F,EAAA,GACClC,KAAA,kBACM,GACPyD,EAAA,GAAAlH,EAAA2F,EAAA,GACClC,KAAA,mBACM,GACP0D,EAAA,GAAAnH,EAAA2F,EAAA,GACClC,KAAA,UACD,GChFA,SAAA2D,EAAAz0C,CAAA,CAAA0yC,CAAA,QACA,SAAAA,EACAA,EAEA1yC,CADA,CD8EA4yC,EAAAmB,EAAAC,EAAAC,EAAezb,EAAAJ,EAAA8b,EAAAC,EAAIC,EAAAC,EAAAC,EAAAC,EAAAC,GC3EnB,IAAA9R,EAAA,GAAA2K,EAAA2F,EAAA,GACAlC,KAAA,QACAK,SAAA,UACCxB,UAAA8E,CACM,GACPC,EAAA,GAAArH,EAAA2F,EAAA,GACAlC,KAAA,UACAe,YAAA,kBACAV,SAAA,UACCxB,UAAA8E,CACM,GACPE,EAAA,GAAAtH,EAAA2F,EAAA,GACAlC,KAAA,kBACAK,SAAA,UACCxB,UAAA8E,CACD,GCpBA,SAAAG,EAAA50C,CAAA,EACA,OAAAA,GAAA,GAAAA,IAAAA,EAAA,GAAAA,IAAAA,EAAA,GAAAA,CAAA,CDoBA4yC,EAAAlQ,EAAAgS,EAAAC,GClBA,IAAAE,EAAA,GAAAxH,EAAA2F,EAAA,GACAlC,KAAA,QACCnB,UAAAiF,CACM,GACPE,EAAA9xC,GAAA,CACA,GAAAA,KAAA3B,IAAA2B,EAAA8xC,QAAA,EAAA9xC,IAAA,GAAAA,EAAA8xC,QAAA,EACA,IAAApI,EAAAD,GAAA,CACA,IAAAsI,EAAAC,EACA,IAAAnI,EAAA,OAAAkI,CAAAA,EAAA/xC,EAAA0lC,KAAA,SAAAqM,CAAAA,EAAAA,EAAAjX,WAAA,SAAAiX,CAAAA,EAAAA,EAAAl+B,MAAA,SAAAk+B,CAAA,CAAAtI,EAAA,GAAA3O,EAAAmX,EAAA,CAAAxI,EAAA,QACA,EAKA,OAAAuI,CAAAA,EAAAhyC,EAAA0lC,KAAA,SAAAsM,CAAAA,EAAAA,EAAAlX,WAAA,SAAAkX,EAAAvG,IAAA,SACA,CACAqG,SAAA,GAAAjI,EAAA,EAAA7pC,EAAA0lC,KAAA,CAAA5K,WAAA,CAAA2Q,IAAA,IAGA,CACAqG,SAAAjI,CACA,EAXA,CACAiI,SAAAF,EAAAnI,EACA,CACA,EAUA,SAAA3O,EAAAiU,EAAA,EAAA/uC,EAAAA,EAAA8xC,QAAA,CAAApI,EACA,QACA,KAEOoI,CAAAA,EAAA5C,WAAiB,cACxB,IAAAgD,EAAA,GAAA7H,EAAA2F,EAAA,GACAlC,KAAA,WACCnB,UAAAiF,CACM,GACPjO,EAAA,GAAA0G,EAAA2F,EAAA,GACAlC,KAAA,SACCnB,UAAAiF,CACM,GACPO,EAAA,GAAA9H,EAAA2F,EAAA,GACAlC,KAAA,YACCnB,UAAAiF,CACM,GACP3W,EAAA,GAAAoP,EAAA2F,EAAA,GACAlC,KAAA,YACCnB,UAAAiF,CACM,GACP,GAAAvH,EAAA2F,EAAA,GACAlC,KAAA,OACAe,YAAA,QACClC,UAAAiF,CACM,GACP,GAAAvH,EAAA2F,EAAA,GACAlC,KAAA,OACAe,YAAA,SACClC,UAAAiF,CACM,GACP,IAAAQ,EAAA,GAAA/H,EAAA2F,EAAA,GACClC,KAAA,WACD,GACA8B,EAAAiC,EAAAC,EAAAI,EAAevO,EAAAwO,EAAAlX,EAAAmX,GC1Df,IAAA1X,EAAA,CAEAuV,OAAA,CACA9B,SAAA,UACGxB,UAAAmD,CACH,EACAI,UAAA,CACA/B,SAAA,UACGxB,UAAAmD,CACH,EACAK,YAAA,CACAhC,SAAA,UACGxB,UAAAmD,CACH,EACAM,aAAA,CACAjC,SAAA,UACGxB,UAAAmD,CACH,EACAO,WAAA,CACAlC,SAAA,UACGxB,UAAAmD,CACH,EACAQ,YAAA,CACGnC,SAAA,SACH,EACAoC,eAAA,CACGpC,SAAA,SACH,EACAqC,iBAAA,CACGrC,SAAA,SACH,EACAsC,kBAAA,CACGtC,SAAA,SACH,EACAuC,gBAAA,CACGvC,SAAA,SACH,EACAwC,QAAA,CACAxC,SAAA,UACGxB,UAAAmD,CACH,EACAc,aAAA,CACGzC,SAAA,SACH,EACA9B,aAAA,CACA8B,SAAW,qBACR9D,MAAAgC,CACH,EAEA3M,MAAA,CACAyO,SAAA,UACGxB,UAAA8E,CACH,EACAC,QAAA,CACAvD,SAAA,UACAU,YAAe,kBACZlC,UAAA8E,CACH,EACAE,gBAAA,CACAxD,SAAA,UACGxB,UAAA8E,CACH,EAEApvB,EAAA,CACGgoB,MAAAwC,EAAAwF,EAAA,EAEHC,GAAA,CACGjI,MAAAwC,EAAAwF,EAAA,EAEHE,GAAA,CACGlI,MAAAwC,EAAAwF,EAAA,EAEHG,GAAA,CACGnI,MAAAwC,EAAAwF,EAAA,EAEHI,GAAA,CACGpI,MAAAwC,EAAAwF,EAAA,EAEH9P,GAAA,CACG8H,MAAAwC,EAAAwF,EAAA,EAEHK,GAAA,CACGrI,MAAAwC,EAAAwF,EAAA,EAEHhF,QAAW,CACRhD,MAAAwC,EAAAwF,EAAA,EAEHM,WAAW,CACRtI,MAAAwC,EAAAwF,EAAA,EAEHO,aAAW,CACRvI,MAAAwC,EAAAwF,EAAA,EAEHQ,cAAW,CACRxI,MAAAwC,EAAAwF,EAAA,EAEHS,YAAW,CACRzI,MAAAwC,EAAAwF,EAAA,EAEH1E,SAAW,CACRtD,MAAAwC,EAAAwF,EAAA,EAEHzE,SAAW,CACRvD,MAAAwC,EAAAwF,EAAA,EAEHU,cAAW,CACR1I,MAAAwC,EAAAwF,EAAA,EAEHW,mBAAW,CACR3I,MAAAwC,EAAAwF,EAAA,EAEHY,iBAAW,CACR5I,MAAAwC,EAAAwF,EAAA,EAEHa,aAAW,CACR7I,MAAAwC,EAAAwF,EAAA,EAEHc,kBAAW,CACR9I,MAAAwC,EAAAwF,EAAA,EAEHe,gBAAW,CACR/I,MAAAwC,EAAAwF,EAAA,EAEH5tB,EAAA,CACG4lB,MAAAwC,EAAAwG,EAAA,EAEHC,GAAA,CACGjJ,MAAAwC,EAAAwG,EAAA,EAEHE,GAAA,CACGlJ,MAAAwC,EAAAwG,EAAA,EAEHG,GAAA,CACGnJ,MAAAwC,EAAAwG,EAAA,EAEHI,GAAA,CACGpJ,MAAAwC,EAAAwG,EAAA,EAEHK,GAAA,CACGrJ,MAAAwC,EAAAwG,EAAA,EAEHM,GAAA,CACGtJ,MAAAwC,EAAAwG,EAAA,EAEHjG,OAAA,CACG/C,MAAAwC,EAAAwG,EAAA,EAEHO,UAAW,CACRvJ,MAAAwC,EAAAwG,EAAA,EAEHQ,YAAW,CACRxJ,MAAAwC,EAAAwG,EAAA,EAEHS,aAAW,CACRzJ,MAAAwC,EAAAwG,EAAA,EAEHU,WAAW,CACR1J,MAAAwC,EAAAwG,EAAA,EAEH5F,QAAW,CACRpD,MAAAwC,EAAAwG,EAAA,EAEH3F,QAAW,CACRrD,MAAAwC,EAAAwG,EAAA,EAEHW,aAAW,CACR3J,MAAAwC,EAAAwG,EAAA,EAEHY,kBAAW,CACR5J,MAAAwC,EAAAwG,EAAA,EAEHa,gBAAW,CACR7J,MAAAwC,EAAAwG,EAAA,EAEHc,YAAW,CACR9J,MAAAwC,EAAAwG,EAAA,EAEHe,iBAAW,CACR/J,MAAAwC,EAAAwG,EAAA,EAEHgB,eAAW,CACRhK,MAAAwC,EAAAwG,EAAA,EAGHiB,aAAA,CACAzF,YAAA,GACAlC,UAAA3vC,GAAA,EACA,gBACAu3C,QAAAv3C,CACK,CACF,EACH,EACAu3C,QAAA,GACAC,SAAA,GACAC,aAAgB,GAChBC,WAAA,GACAC,WAAA,GAEAC,UAAA,GACAC,cAAc,GACdC,SAAA,GACAC,eAAgB,GAChBC,WAAA,GACAC,aAAW,GACX9e,MAAA,CAAU,EACVrB,KAAA,GACAC,SAAA,GACAE,WAAA,CAAe,EACfigB,UAAA,GACAC,aAAA,CAAiB,EACjBC,YAAA,GAEArE,IAAA,CACG1G,MAAA0G,CACH,EACAE,OAAA,CACG5G,MAAA4G,CACH,EACAD,UAAW,CACR3G,MAAA2G,CACH,EACAxb,WAAa,GACbJ,QAAA,GACA8b,aAAA,GACAC,gBAAkB,GAClBC,aAAA,GACAC,oBAAsB,GACtBC,iBAAA,GACAC,kBAAc,GACdC,SAAA,GAEA7lB,SAAA,GACA4K,OAAA,CACG4X,SAAA,QACH,EACAkH,IAAA,GACAC,MAAA,GACAC,OAAU,GACVC,KAAA,GAEAC,UAAA,CACGtH,SAAA,SACH,EAEA0D,MAAA,CACGlF,UAAAiF,CACH,EACAE,SAAW,CACRzH,MAAAyH,CACH,EACAI,SAAA,CACGvF,UAAAiF,CACH,EACAjO,OAAA,CACGgJ,UAAAiF,CACH,EACAO,UAAA,CACGxF,UAAAiF,CACH,EACA3W,UAAA,CACG0R,UAAAiF,CACH,EACAQ,UAAA,GAEA7R,WAAA,CACG4N,SAAA,YACH,EACA3N,SAAA,CACG2N,SAAA,YACH,EACAuH,UAAA,CACGvH,SAAA,YACH,EACAnY,WAAA,CACGmY,SAAA,YACH,EACAhN,cAAA,GACAhB,cAAgB,GAChBlK,WAAA,CAAe,EACf0f,UAAA,GACArV,WAAA,CACAuO,YAAA,GACAV,SAAA,YACA,CACA,EAA8B,IAAAwB,EAAAjV,CAAA,gBAAA3gC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA47C,CAAA,QAAAC,EAAA57C,EAAA,MAAA67C,EAAA77C,EAAA,MAAA87C,EAAA97C,EAAA,MAAA+7C,EAAA/7C,EAAA,MClSiBg8C,EAAAh8C,EAAA,MAM/C,SAAAi8C,EAAA,GAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAxgC,MAAA,EAAArU,EAAA+0C,IAAA/0C,EAAAovB,MAAA,CAAArzB,OAAAiE,IAAA,CAAA+0C,IAAA,IACAp+B,EAAA,IAAArY,IAAAw2C,GACA,OAAAD,EAAAG,KAAA,CAAAD,GAAAp+B,EAAA9c,IAAA,GAAAkC,OAAAiE,IAAA,CAAA+0C,GAAA76C,MAAA,CACA,CACA,SAAA+6C,EAAAC,CAAA,CAAAplB,CAAA,EACA,yBAAAolB,EAAAA,EAAAplB,GAAAolB,CAAA,CAIA,SAAAZ,GAAA,CACA,SAAAa,EAAA3I,CAAA,CAAAnG,CAAA,CAAAjC,CAAA,CAAAliC,CAAA,EACA,IAAAxD,EAAA,CACA,CAAA8tC,EAAA,CAAAnG,EACAjC,MAAAA,CACA,EACA9mC,EAAA4E,CAAA,CAAAsqC,EAAA,CACA,IAAAlvC,EACA,OACA,CAAAkvC,EAAA,CAAAnG,CACA,CACA,CACA,IACAkH,YAAAA,EAAAf,CAAA,CACAK,SAAAA,CAAA,CACAxB,UAAAA,CAAA,CACMtC,MAAAA,CAAA,CACN,CAAAzrC,EACA,GAAA+oC,IAAA,EAAAA,EACA,YAIA,GAAAwG,eAAAA,GAAAxG,YAAAA,EACA,OACA,CAAAmG,EAAA,CAAAnG,CACA,CACA,CACA,IAAA6H,EAAA,GAAAuG,EAAAvH,EAAA,EAAA9I,EAAAyI,IAAA,GACA,GAAA9D,EACA,OAAAA,EAAArqC,EACA,CACA,IAAA0pC,EAAkB+F,GAAA,CAClB,IAAAzyC,EAAA,GAAA+4C,EAAAW,EAAA,EAAAlH,EAAA7C,EAAA8C,SAKA,CAJAA,IAAAzyC,GAAA,iBAAAyyC,GAEAzyC,CAAAA,EAAA,GAAA+4C,EAAAW,EAAA,EAAAlH,EAAA7C,EAAA,GAAAmB,EAAA,EAAA2B,YAAAA,EAAA,MAAAoG,EAAA7yB,CAAA,EAAAysB,EAAA,GAAAA,EAAA,EAEAZ,CAAA,IAAAA,GACA7xC,EAEA,CACA,CAAA6xC,EAAA,CAAA7xC,CACA,CAHA,EAKA,SAAAg5C,EAAAjH,EAAA,EAAA/uC,EAAA2nC,EAAA+B,EACA,CACA,SAAA/O,EAAA36B,CAAA,EACA,IAAA22C,EACA,IACAlR,GAAAA,CAAA,CACMC,MAAAA,EAAA,GACN,CAAA1lC,GAAA,GACA,IAAAylC,EACA,YACsH,IAAAjiC,EAAA,MAAAmzC,CAAAA,EAAAjR,EAAAH,iBAAA,EAAAoR,EAAAV,EAAAjzB,CAAA,CAQtH,SAAA4zB,EAAAC,CAAA,EACA,IAAAC,EAAAD,EACA,sBAAAA,EACQC,EAAAD,EAAAnR,QACR,oBAAAmR,EAEA,OAAAA,CACA,CACA,IAAAC,EACA,YAEA,IAAAtM,EAAA,GAAAwL,EAAAe,EAAA,EAAArR,EAAA5K,WAAA,EACA+P,EAAAxtC,OAAAiE,IAAA,CAAAkpC,GACArY,EAAAqY,EA2BA,OA1BAntC,OAAAiE,IAAA,CAAAw1C,GAAArvC,OAAA,CAAAuvC,GAAA,CACA,IAAAh6C,EAAAu5C,EAAAO,CAAA,CAAAE,EAAA,CAAAtR,GACA,GAAA1oC,MAAAA,GACA,oBAAAA,GACA,GAAAwG,CAAoB,CAAAwzC,EAAA,CACN7kB,EAAA,GAAA2jB,EAAA9yB,CAAA,EAAAmP,EAAAskB,EAAAO,EAAAh6C,EAAA0oC,EAAAliC,QACd,CACA,IAAAyzC,EAAA,GAAAjB,EAAAjH,EAAA,GACerJ,MAAAA,CACf,EAAA1oC,EAAAU,GAAA,EACe,CAAAs5C,EAAA,CAAAt5C,CACf,IACAw4C,EAAAe,EAAAj6C,GACAm1B,CAAA,CAAA6kB,EAAA,CAAArc,EAAA,CACA8K,GAAAzoC,EACiB0oC,MAAAA,CACD,GAEhBvT,EAAA,GAAA2jB,EAAA9yB,CAAA,EAAAmP,EAAA8kB,EAEY,OAEZ9kB,EAAA,GAAA2jB,EAAA9yB,CAAA,EAAAmP,EAAAskB,EAAAO,EAAAh6C,EAAA0oC,EAAAliC,GACA,CACO,GAEP,GAAAwyC,EAAAkB,EAAA,EAAArM,EAAA1Y,EACA,CACA,OAAA/2B,MAAA6D,OAAA,CAAAwmC,GAAAA,EAAAhqC,GAAA,CAAAm7C,GAAAA,EAAAnR,EAAA,CAEA,OAAA9K,CACA,CACA,IAAAA,EAAAib,GACAjb,CAAAA,EAAAuU,WAAA,QAA8Bl1C,EAAA,EAAA2gC,CAAA,gBAAA5gC,CAAA,CAAAC,CAAA,CAAAC,CAAA,mBAAA0rC,EAAA1rC,EAAA,MC9H9Bk9C,EAAAl9C,EAAA,MAKA,IAAAm9C,EAAA,GAAAzR,EAAA3iB,CAAA,IACA,SAAS8W,EAAAI,EAAAkd,CAAA,EACT,SAAAD,EAAAn0B,CAAA,EAAAkX,EACA,CAAuBlgC,EAAA,EAAA8/B,CAAA,gBAAA//B,CAAA,CAAAC,CAAA,CAAAC,CAAA,mBAAAu3B,EAAAv3B,EAAA,MCRvBo9C,EAAAp9C,EAAA,MAKA,SAAAq9C,EAAAr9B,CAAA,EACA,OAAA5c,IAAAA,OAAAiE,IAAA,CAAA2Y,GAAAze,MAAA,CAEA,SAAAs+B,EAAAI,EAAuB,MACvB,IAAAqd,EAAA/lB,EAAAS,UAAA,CAAAolB,EAAA1kB,CAAA,EACA,OAAA4kB,GAAAD,EAAAC,GAAArd,EAAAqd,CAAA,CACuBv9C,EAAA,EAAA8/B,CAAA,gBAAA//B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAw9C,CAAA,ICX+C,IAAAC,EAAAx9C,EAAA,MAMtE,SAAAu9C,EAAAn2C,CAAA,EACA,oBAAAA,EACA,eAAAo2C,EAAAz0B,CAAA,MAEA,OAAA3hB,EAAA4jB,MAAA,IAAA9G,WAAA,GAAA9c,EAAAzF,KAAA,oBAAA7B,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,2BAAA09C,CAAA,ICPoB,IAAAA,EAFpB,SAAA/P,CAAA,CAAAjB,EAAAxzB,OAAAykC,gBAAA,CAAAhR,EAAAzzB,OAAA0kC,gBAAA,EACA,OAAAt8C,KAAAqrC,GAAA,CAAAD,EAAAprC,KAAAorC,GAAA,CAAAiB,EAAAhB,GACA,CAAoB,gBAAA5sC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA69C,CAAA,sBAAApd,CAAA,IEHsC,IAAA0Q,EAAAlxC,EAAA,MAG1D,SAAA49C,EAAAjO,CAAA,EACA,oBAAAA,GAAAA,IAAA,GAAAA,EACA,QACA,CACA,IAAA7gC,EAAA1L,OAAAy6C,cAAA,CAAAlO,GACA,OAAA7gC,IAAA,GAAAA,GAAAA,IAAA1L,OAAA0L,SAAA,EAAA1L,IAAA,GAAAA,OAAAy6C,cAAA,CAAA/uC,EAAA,IAAAnL,CAAAA,OAAAm6C,WAAA,IAAAnO,CAAA,IAAAhsC,CAAAA,OAAAC,QAAA,IAAA+rC,CAAA,CACA,CACA,SAAAoO,EAAAp0B,CAAA,EACA,IAAAi0B,EAAAj0B,GACA,OAAAA,CACA,CACA,IAAA6J,EAAA,GAIA,OAHApwB,OAAAiE,IAAA,CAAAsiB,GAAAnc,OAAA,CAAAxK,GAAA,CACGwwB,CAAA,CAAAxwB,EAAA,CAAA+6C,EAAAp0B,CAAA,CAAA3mB,EAAA,CACH,GACAwwB,CACe,CACf,SAAAgN,EAAAwd,CAAA,CAAAr0B,CAAA,CAAAhlB,EAAA,CACC2gB,MAAA,EACD,GACA,IAAAkO,EAAA7uB,EAAA2gB,KAAA,IAAA4rB,EAAAnoB,CAAA,KAAAi1B,GAAAA,CAAA,CAeA,OAdAJ,EAAAI,IAAAJ,EAAAj0B,IACAvmB,OAAAiE,IAAA,CAAAsiB,GAAAnc,OAAA,CAAAxK,GAAA,CACA46C,EAAAj0B,CAAA,CAAA3mB,EAAA,GAEAI,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAgvC,EAAAh7C,IAAA46C,EAAAI,CAAA,CAAAh7C,EAAA,EAEQwwB,CAAA,CAAAxwB,EAAA,CAAAw9B,EAAAwd,CAAA,CAAAh7C,EAAA,CAAA2mB,CAAA,CAAA3mB,EAAA,CAAA2B,GACRA,EAAA2gB,KAAA,CACQkO,CAAA,CAAAxwB,EAAA,CAAA46C,EAAAj0B,CAAA,CAAA3mB,EAAA,EAAA+6C,EAAAp0B,CAAA,CAAA3mB,EAAA,EAAA2mB,CAAA,CAAA3mB,EAAA,CAERwwB,CAAA,CAAAxwB,EAAA,CAAA2mB,CAAA,CAAA3mB,EAAA,GAIAwwB,CAAA,iBAAA1zB,CAAA,CAAAC,CAAA,CAAAC,CAAA,eChCA,SAAAugC,EAAA31B,CAAA,EAKA,IAAAe,EAAA,0CAAwCf,EACxC,QAAAjE,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,GAAA,EAGAgF,GAAA,WAAAsyC,mBAAAxkB,SAAA,CAAA9yB,EAAA,EAEA,6BAAAiE,EAAA,WAAAe,EAAA,wBACA,CDoBA3L,EAAAC,CAAA,CAAAF,EAAA,qBAAAwgC,CAAA,CCtCA,EAkBA,eAAAzgC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,2BAAAm+C,EAAAn1B,CAAA,QAAAm1B,EAAAl+C,EAAA,qBAAAF,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAo+C,CAAA,IElB0D,IAAAjN,EAAAlxC,EAAA,MAQ1D,SAAAm+C,EAAiB9P,CAAA,CAAAtoC,CAAA,EACjB,IAAAytB,EAAA,GAAA0d,EAAAnoB,CAAA,KAAAhjB,GAwBA,OAvBA3C,OAAAiE,IAAA,CAAAgnC,GAAA7gC,OAAA,CAAA4mC,GAAA,CACA,GAAAA,EAAA9qC,QAAyB,GAAAm0B,KAAA,yBACnBjK,CAAA,CAAA4gB,EAAA,IAAAlD,EAAAnoB,CAAA,KAAAslB,CAAA,CAAA+F,EAAA,CAAA5gB,CAAA,CAAA4gB,EAAA,OACN,GAAAA,EAAA9qC,QAAA,GAAAm0B,KAAA,mCACA,IAAA2gB,EAAA/P,CAAA,CAAA+F,EAAA,KACAiK,EAAAt4C,CAAA,CAAAquC,EAAA,CACA5gB,CAAA,CAAA4gB,EAAA,IACA,GAAAhxC,OAAAiE,IAAA,CAAAg3C,GAGA,GAAAj7C,OAAAiE,IAAA,CAAA+2C,IAIA5qB,CAAA,CAAA4gB,EAAA,IAAAlD,EAAAnoB,CAAA,KAAAs1B,GACAj7C,OAAAiE,IAAA,CAAA+2C,GAAA5wC,OAAA,CAAA8wC,GAAA,CACS9qB,CAAA,CAAA4gB,EAAA,CAAAkK,EAAA,CAAAH,EAAAC,CAAA,CAAAE,EAAA,CAAAD,CAAA,CAAAC,EAAA,CACT,IALQ9qB,CAAA,CAAA4gB,EAAA,CAAAiK,EAHA7qB,CAAA,CAAA4gB,EAAA,CAAAgK,CAUR,MAAAh6C,KAAAA,IAAAovB,CAAA,CAAA4gB,EAAA,EACA5gB,CAAAA,CAAA,CAAA4gB,EAAA,CAAA/F,CAAA,CAAA+F,EAAA,CACG,GAEH5gB,CAAA,iBAAA1zB,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAqC,CAAA0C,MAAA,KACrC1C,EAAAk+C,6BAAoB,CAAQ,KAAmB,EAC/C,IAAAC,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAAA,MAEA,SAAAu+C,EAAAE,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,IAAAt2B,EAAAM,OAAA,CACAi2B,EAAAv2B,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAP,EACAQ,iBAAAL,EAAA18C,SAAA,CACAgJ,SAAAwzC,EAAA//B,QAAA,GAAAggC,EACAO,MAAAV,EAAAW,aAAA,CAAApmC,IAAA,CACKqmC,UAAAZ,EAAAa,gBAAA,GAELC,EAAAd,EAAAe,KAAA,CAAAC,4BAAA,CAAAhB,EAAAa,gBAAA,CAAAb,EAAAiB,WAAA,CAAAb,EAAA18C,SAAA,CAAAu8C,GACAiB,EAAAlB,EAAAe,KAAA,CAAAI,6BAAA,CAAAnB,EAAAa,gBAAA,CAAAT,EAAA18C,SAAA,CAAAu8C,EAAAA,EAAA,IACA,OACAmB,QAAAhB,EAAA18C,SAAA,CACA29C,aAAA,CAAAhB,EAAAS,EAAA,CACAQ,oBAAA,CAAAJ,EAAA,CACA92C,QAAA,CAAAg2C,EAAA,CAEA,CAAqCv+C,EAAAk+C,6BAAA,CAAAA,CAAA,gBAAAz+C,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECxBxB,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAgB,CAAA0C,MAAA,KAC7Bu9C,EAAatgD,EAAQ,MAAQK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjBhB,aAEb,IAAAirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAmB,CAAA7O,EAAA,cAAA0C,MAAA,KACnB1C,EAAAkgD,WAAA,CAAoB,OACpB,IAAA/B,EAAAx+C,EAAqC,MACrCwgD,EAAAv1B,EAAAjrB,EAAA,MACA,OAAAugD,EACA,OAAAE,eAAAx8C,CAAA,CAAAkY,EAAA,GACA,OAAAlY,EAAAy8C,GAAA,CAAAF,EAAAr5B,OAAA,CAAAw5B,GAAA,IAAAxkC,GACA,CACA,OAAAykC,QAAA38C,CAAA,CAAAkY,EAAA,GACA,WAAAqkC,EAAAr5B,OAAA,CAAAljB,EAAAqF,QAAA,IAAAo3C,GAAA,KAAAF,EAAAr5B,OAAA,KAAAw5B,GAAA,CAAAxkC,GACA,CACA,OAAA0kC,WAAA58C,CAAA,CAAAkY,EAAA,GACA,WAAAqkC,EAAAr5B,OAAA,CAAAljB,GAAAy8C,GAAA,KAAAF,EAAAr5B,OAAA,KAAAw5B,GAAA,CAAAxkC,GACA,CACA,OAAA2kC,MAAA78C,CAAA,CAAAkY,EAAA,GACA,GAAAlY,EAAA88C,KAAA,GACA,2EAEA,IAAAC,EAAA/8C,EAAAg9C,GAAA,KAAAT,EAAAr5B,OAAA,KAAAw5B,GAAA,CAAAxkC,IACA+kC,EAAAF,EAAAG,KAAA,GACA,WAAA3C,EAAAj3B,GAAA,CAAA25B,EAAA53C,QAAA,GACA,CACA,CAAmBjJ,EAAAkgD,WAAA,CAAAA,CAAA,gBAAAzgD,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC3BN,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAwB,CAAA0C,MAAA,KACrCu9C,EAAatgD,EAAQ,MAAaK,GAClCigD,EAAatgD,EAAQ,MAAcK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClBtB,aAEb,IAAAirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAmB,CAAA7O,EAAA,aAAkB,CAAA0C,MAAe,KACpD1C,EAAA+gD,QAAA,CAAiB/gD,EAAAghD,OAAA,CAAQhhD,EAAuBihD,IAAA,CAAAjhD,EAAAkhD,GAAA,CAAAlhD,EAAAmhD,GAAA,CAAAnhD,EAAAohD,IAAA,QAChD,IAAAC,EAAA1hD,EAAqC,MACrCwgD,EAAAv1B,EAAAjrB,EAAA,MAIAK,CAAAA,EAAAohD,IAAA,KAAAC,EAAAC,EAAA,IAIAthD,EAAAmhD,GAAA,KAAAE,EAAAC,EAAA,IAIAthD,EAAAkhD,GAAA,KAAAG,EAAAC,EAAA,IAIAthD,EAAAihD,IAAA,CAAAjhD,EAAAkhD,GAAA,CAAAZ,GAAA,KAAAe,EAAAC,EAAA,OAIAthD,EAAAghD,OAAA,CAAAhhD,EAAAkhD,GAAA,CAAAZ,GAAA,KAAAe,EAAAC,EAAA,MAAAC,GAAA,CAAAvhD,EAAAmhD,GAAA,CAIA,OAAAJ,EACA,OAAAS,SAAAl1B,CAAA,EACA,OAAAA,EAAAs0B,GAAA,KAAAS,EAAAC,EAAA,IAAAhB,GAAA,KAAAe,EAAAC,EAAA,MACA,CACA,OAAAG,cAAAn1B,CAAA,EACA,OAAAA,EAAAs0B,GAAA,CAAAT,EAAAr5B,OAAA,CAAAw5B,GAAA,OACA,CACA,OAAAoB,MAAAp1B,CAAA,EACA,WAAA+0B,EAAAC,EAAA,CAAAh1B,EAAAs0B,GAAA,CAAAT,EAAAr5B,OAAA,CAAAw5B,GAAA,QAAA9lC,KAAA,GAAA8yB,OAAA,GACA,CACA,OAAAqU,QAAAr1B,CAAA,EACA,WAAA6zB,EAAAr5B,OAAA,CAAAwF,EAAArjB,QAAA,IAAA23C,GAAA,CAAAT,EAAAr5B,OAAA,CAAAw5B,GAAA,QACA,CACA,OAAAsB,gBAAAt1B,CAAA,EACA,OAAAA,EAAAs0B,GAAA,CAAAT,EAAAr5B,OAAA,CAAAw5B,GAAA,QACA,CACA,OAAAuB,WAAAv1B,CAAA,EACA,OAAAA,EAAA+zB,GAAA,KAAAgB,EAAAC,EAAA,IAAAhB,GAAA,KAAAe,EAAAC,EAAA,MACA,CACA,OAAAQ,kBAAAxhD,CAAA,EACA,IAAA2D,EAAA3D,EAAAyhD,IAAA,KAIA,OAHAzhD,EAAAuqB,GAAA,CAAA7qB,EAAAghD,OAAA,EAAAgB,EAAA,CAAAhiD,EAAAohD,IAAA,GACAn9C,CAAAA,EAAAA,EAAAsB,GAAA,CAAAvF,EAAAmhD,GAAA,GAEAl9C,CACA,CACA,OAAAg+C,WAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,CAAAF,EAAAr3B,GAAA,CAAAs3B,GAAAj1B,EAAA,CAAAltB,EAAAohD,IAAA,SACA,EACAc,EAAA7B,GAAA,CAAA8B,GAAA58C,GAAA,KAAA87C,EAAAC,EAAA,KAGAY,EAAA7B,GAAA,CAAA8B,EACA,CAEA,OAAAE,iBAAAH,CAAA,CAAAC,CAAA,EACA,OAAAD,EAAA38C,GAAA,CAAAvF,EAAAihD,IAAA,EAAAM,GAAA,CAAAY,GAAAt3B,GAAA,CAAA7qB,EAAAihD,IAAA,CACA,CACA,CAAgBjhD,EAAA+gD,QAAA,CAAAA,CAAA,gBAAAthD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECtEH,aAEb,IAAAirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAkB,CAAA7O,EAAA,cAAA0C,MAAA,KAClB1C,EAAAsiD,UAAA,CAAoB,OACpB,IAAAnE,EAAAx+C,EAAqC,MACrCwgD,EAAAv1B,EAAAjrB,EAAA,MAIA,OAAA2iD,EACArgD,YAAAsgD,CAAA,CAAAC,CAAA,EACA,KAAAv5C,QAAA,CAAsB,IACtB,QAAAs5C,SAAA,CAAAt5C,QAAA,WAAAu5C,WAAA,CAAAv5C,QAAA,KAEA,KAAAs5C,SAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,CACA,CACA,OAAAC,YAAA77C,CAAA,EACA,OAAA07C,EAAAI,YAAA,CAAA97C,EAAA+7C,eAAA,IAAA/B,GAAA,KAAAtiC,QAAA,OACA,CACA,OAAAokC,aAAAH,CAAA,CAAAC,CAAA,EACA,IAAAl2B,EAAA,iBAAAi2B,EAAA,IAAApE,EAAAj3B,GAAA,CAAAq7B,EAAAt5C,QAAA,IAAAs5C,CAAA,CACAK,EAAA,iBAAAJ,EAAA,IAAArE,EAAAj3B,GAAA,CAAAs7B,EAAAv5C,QAAA,IAAAu5C,CAAA,CACA,WAAAF,EAAAh2B,EAAAs2B,EACA,CACAC,WAAA,QACA,KAAAL,WAAA,CAAAt1B,EAAA,KAAAixB,EAAAj3B,GAAA,KACA,IAAAi5B,EAAAr5B,OAAA,IAEA,IAAAq5B,EAAAr5B,OAAA,MAAAy7B,SAAA,CAAAt5C,QAAA,IAAAo3C,GAAA,KAAAF,EAAAr5B,OAAA,MAAA07B,WAAA,CAAAv5C,QAAA,IADA,CAGA1D,IAAA+3B,CAAA,EACA,IAAAwlB,EAAA,KAAAN,WAAA,CAAAO,GAAA,CAAAzlB,EAAAklB,WAAA,EACAQ,EAAA,KAAAR,WAAA,CAAAnC,GAAA,CAAAyC,GAAAlC,GAAA,CAAAtjB,EAAAklB,WAAA,EACAS,EAAAD,EAAA3C,GAAA,MAAAmC,WAAA,EACAU,EAAAF,EAAA3C,GAAA,CAAA/iB,EAAAklB,WAAA,EACAW,EAAA,KAAAZ,SAAA,CAAA3B,GAAA,CAAAqC,GACAG,EAAA9lB,EAAAilB,SAAA,CAAA3B,GAAA,CAAAsC,GACAG,EAAAF,EAAA59C,GAAA,CAAA69C,GACA,WAAAd,EAAA,IAAAnE,EAAAj3B,GAAA,CAAAm8B,EAAAp6C,QAAA,QAAAk1C,EAAAj3B,GAAA,CAAA87B,EAAA/5C,QAAA,IACA,CACA,CAAkBjJ,EAAAsiD,UAAA,CAAAA,CAAA,gBAAA7iD,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC5CL,aAEboD,OAAA8L,cAAmB,CAAA7O,EAAA,cAAA0C,MAAA,KACnB1C,EAAAsjD,WAAiB,QACjB,IAAAjC,EAAA1hD,EAAA,KAIA,OAAA2jD,EACA,OAAAC,SAAAhE,CAAA,EACA,SAAA8B,EAAAmC,gBAAA,EAAAjE,EACA,CACA,OAAAkE,UAAAr6C,CAAA,EACA,OAAAA,EAAAjI,GAAA,IAAAmiD,EAAAC,QAAA,CAAAhE,GACA,CACA,OAAAt2C,SAAAs2C,CAAA,EACA,OAAA+D,EAAAC,QAAA,CAAAhE,GAAAj2C,QAAA,EACA,CACA,OAAAo6C,UAAAt6C,CAAA,EACA,OAAAA,EAAAjI,GAAA,IAAAmiD,EAAAr6C,QAAA,CAAAs2C,GACA,CACA,OAAAoE,mBAAAC,CAAA,CAAA7E,CAAA,EACA,IAAAl9C,EAAiBgiD,EAAA,CAAAxC,EAAAyC,KAAA,CAAAjiD,SAAA,CAAAkiD,sBAAA,CAAAH,EAAA7E,GACjB,OAAAl9C,UAAAA,EAAAgiD,KAAAA,CAAA,CACA,CACA,CAAmB7jD,EAAAsjD,WAAA,CAAAA,CAAA,gBAAA7jD,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCzBN,IAAAe,EAAAf,EAAA,aAEbqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAoB,CAAA7O,EAAA,cAA2B0C,MAAG,KAClD1C,EAAAskD,SAAA,CAAoBtkD,EAAAukD,mBAA2B,CAAAvkD,EAAAwkD,kBAAA,QAC/C,IAAArG,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAA6B,MAC7B8kD,EAAqB9kD,EAAsB,MAC3C+kD,EAAgB/kD,EAA8B,MAC9CglD,EAAAhlD,EAAA,MAcA,SAAA6kD,EAAA58C,CAAA,CAAAg9C,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,EAAA,IAAA5G,EAAAj3B,GAAA,IAAAkB,EAAAw8B,CAAA,CAAAI,EAAA,IACA,OAAAhB,EAAA,+BACA,IAAAxE,EAAA,MAAA+E,EAAA38C,EAAAg9C,EAAA,EAAAC,UAAAA,EAAAE,mBAAAA,CAAA,GAAAD,EAAA18B,EAAA48B,GACK,OAAAxF,CAAA,KAEL,CAeA,SAAA+E,EAAA38C,CAAA,CAAAg9C,CAAA,CAAAK,CAAA,CAAAH,CAAA,CAAA18B,EAAAw8B,CAAA,CAAAI,EAAA,IACA,IAAAv8C,EACA,OAAAu7C,EAAA,8BAAkD,CAClD,IAAAkB,EAAAD,EAAA36B,MAAA,CAA+C,EAAAu6B,UAAAA,CAAW,KAAAA,EAAAM,MAAA,CAAAhH,EAAAiB,WAAA,GAC1DgG,EAAAH,EAAA36B,MAAA,GAAAu6B,UAAAA,CAAA,IAAAA,EAAAM,MAAA,CAAAhH,EAAAiB,WAAA,GACA,GAAAgG,EAAAlkD,MAAA,GACA,oDAEA,IAAAmkD,EAAA,GACA,GAAAH,EAAAhkD,MAAA,IACA,IAAAokD,EAAA,MAAApkC,QAAAqkC,GAAA,CAAAL,EAAA/jD,GAAA,GAAA0jD,UAAAA,CAAA,IAAAP,EAAAM,EAAAC,KACAW,EAAA,MAAA59C,EAAA69C,uBAAA,CAAAH,GACAI,EAAAF,EAAArkD,GAAA,IAAAujD,EAAAiB,SAAA,CAAAC,uBAAA,CAAAC,MAAAA,EAAA,OAAAA,EAAAnkD,IAAA,GACAgkD,EAAAv4C,OAAA,EAAA24C,EAAAzkD,IAAA,KAEA0kD,EADA,IAAAC,EAAAV,CAAA,CAAAjkD,EAAA,CAEA,GAAAykD,EAAA,CAGA,IAAAA,EAAAl7C,KAAA,CAAAu6C,MAAA,CAAAP,GACA,sDAAAoB,EAAA18C,QAAA,MAEAy8C,EAAAhjD,OAAAC,MAAA,EAAAu8C,QAAAyG,CAAA,EAAArB,EAAAsB,iBAAA,CACA,KACA,CACA,IAAAC,EAAAC,EAAAhI,EAAAiI,2BAAA,CAAAjI,EAAAa,gBAAA,CAAAkG,CAAA,CAAA7jD,EAAA,CAAAwjD,SAAA,CAAAmB,EAAApB,EAAAx8B,EAAA48B,GACAe,EAAA,CACAxG,QAAAyG,EACAxG,aAAA,CAAA0G,EAAA,CACAzG,oBAAA,GACAl3C,QAAA,GAEA,EACa,CAAA28C,CAAA,CAAA7jD,EAAA,CAAAwjD,SAAA,CAAAv7C,QAAA,IAAAy8C,CACb,EACA,IACAX,EAAAlkD,MAAA,IACA,IAAAmlD,EAAA,MAAAvB,IACAC,EAAA,QAAAt8C,CAAAA,EAAA28C,CAAA,MAAA38C,KAAA,IAAAA,EAAA,OAAAA,EAAAs8C,kBAAA,OAAA5G,EAAAj3B,GAAA,GACAm+B,CAAAA,CAAA,CAAAlH,EAAAiB,WAAA,CAAA91C,QAAA,OAAAm7C,EAAAvG,6BAAA,EAAA0G,EAAAG,EAAAsB,EACA,QAEKpB,EAAA9jD,GAAA,GAAA0jD,UAAAA,CAAA,IAAAQ,CAAA,CAAAR,EAAAv7C,QAAA,IACL,EACA,CAEA,SAAAg7C,EAAAM,CAAA,CAAAC,CAAA,EACA,OAAAb,EAAA,+BACK,aAAA7F,EAAAe,KAAA,CAAAoH,yBAAA,CAAAnI,EAAAiI,2BAAA,CAAAjI,EAAAa,gBAAA,CAAA6F,EAAAD,EACL,EACA,CAEA,SAAAuB,EAAAI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA97C,CAAA,CAAAwd,CAAA,CAAA48B,CAAA,EACA,IAAAA,EACA,OAAA7G,EAAAe,KAAA,CAAAiH,uCAAA,CAAAI,EAAAC,EAAAC,EAAAC,EAAA97C,EAAAwd,EACA,CAIA,IAAUphB,EAAA,CACV,CAAU2/C,OAAAv+B,EAAAw+B,SAAA,GAAAC,WAAA,IACV,CAAUF,OAAAD,EAAAE,SAAA,GAAAC,WAAmD,IAC7D,CAAUF,OAAA/7C,EAAAg8C,SAAA,GAAAC,WAAA,EAAkD,EAC5D,CAAUF,OAAAF,EAAAG,SAAA,GAAAC,WAAA,IACV,CAAUF,OAAA1+B,EAAAw2B,aAAA,CAAAM,SAAA,CAAA6H,SAAA,GAA4DC,WAAA,IACtE,CAAAF,OAAAH,EAAAI,SAAA,GAAAC,WAAA,IACA,CACAC,EAAApmD,EAAA2d,IAAA,MACA,WAAA4J,EAAA8+B,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAwH,EACK7kD,KAAAolD,CACL,GAtFA9mD,EAAAwkD,kBAAA,CAAAA,EA2DAxkD,EAAAukD,mBAAA,CAAAA,EAMAvkD,EAAAskD,SAAA,CAAAA,CAqBA,gBAAA7kD,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC3Ha,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAwB,CAAA0C,MAAA,KACrCu9C,EAAatgD,EAAQ,MAAYK,GACjCigD,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAoBK,GACzCigD,EAAatgD,EAAQ,MAAcK,GACnCigD,EAAatgD,EAAQ,MAAgBK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECrBxB,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACA8mB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAA,KAC9B1C,EAAAgnD,mBAAA,CAAAhnD,EAAAinD,yBAAiD,CAAgBjnD,EAAAknD,gBAAA,QACjE,IAAAC,EAAuBv8B,EAAAjrB,EAAyB,OAChDynD,EAAAznD,EAAA,MACA,SAAAunD,EAAAt/C,CAAA,CAAA23C,CAAA,CAAA8H,CAAA,EACA,OAAArD,EAAA,+BACA,IAAAthD,EAAA,MAAAkF,EAAA0/C,cAAA,CAAAF,EAAA9D,WAAA,CAAAC,QAAA,CAAAhE,IACK,OAAA8H,EAAAjkC,KAAA,CAAA1gB,MAAAA,EAAA,OAAAA,EAAAhB,IAAA,CACL,EACA,CAEA,SAAAulD,EAAAr/C,CAAA,CAAAwB,CAAA,CAAAi+C,CAAA,EACA,OAAArD,EAAA,+BACA,GAAA56C,IAAAA,EAAAlI,MAAA,CACA,SAEA,IAAAqY,EAAA,MAAAytC,EAAAp/C,EAAAw/C,EAAA9D,WAAA,CAAAG,SAAA,CAAAr6C,IACAm+C,EAAAhuC,EACApY,GAAA,IAAAkmD,EAAAjkC,KAAA,CAAA1gB,MAAAA,EAAA,OAAAA,EAAAhB,IAAA,GACA4oB,MAAA,IAAA5nB,KAAAqB,IAAArB,GAEK,MADL,GAAAykD,EAAArgC,OAAA,EAAAygC,EAAArmD,MAAA,GAAAkI,EAAAlI,MAAA,+BACKqmD,CACL,EACA,CAEA,SAAAP,EAAAp/C,CAAA,CAAAwB,CAAA,EACA,OAAA46C,EAAA,+BACA,GAAA56C,IAAAA,EAAAlI,MAAA,CACA,SAEA,IAAAsmD,EAAA,EAA2B,CAC3BC,EAAA,IACA,QAAAnhD,EAAA,EAAAA,EAAA8C,EAAAlI,MAAA,CAAAoF,GAAAmhD,EAAA,CACA,IAAAC,EAAAt+C,EAAA9H,KAAA,CAAAgF,EAAAA,EAAAmhD,GACA99C,EAAA/B,EAAA69C,uBAAA,CAAA2B,EAAA9D,WAAA,CAAAG,SAAA,CAAAiE,GAAA9/C,EAAAG,UAAA,EACAy/C,EAAAhoD,IAAA,CAAAmK,EACA,CACA,IAAAg+C,EAAA,OAAAzmC,QAAAqkC,GAAA,CAAAiC,EAAA,EAAAI,IAAA,GAEK,MADL,GAAAT,EAAArgC,OAAA,EAAA6gC,EAAAzmD,MAAA,GAAAkI,EAAAlI,MAAA,2CACKymD,CACL,EACA,CA/BA3nD,EAAAknD,gBAAA,CAAAA,EAcAlnD,EAAAinD,yBAAA,CAAAA,EAiB2BjnD,EAAAgnD,mBAAA,CAAAA,CAAA,gBAAAvnD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECvDd,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAA4B,CAAA0C,MAAA,KACzCu9C,EAAatgD,EAAQ,MAAWK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjBnB,aAEb,IAAAkoD,EAAA,WAAAA,UAAA,WAAAC,CAAA,CAAAnK,CAAA,CAAAh7C,CAAA,CAAAk9C,CAAA,EACA,IAAAjgD,EAAAmoD,EAAA3uB,UAAAl4B,MAAA,CAAAkD,EAAA2jD,EAAA,EAAApK,EAAAkC,IAAA,GAAAA,EAAAA,EAAA98C,OAAA+8C,wBAAA,CAAAnC,EAAAh7C,GAAAk9C,CAAA,CACA,oBAAAmI,SAAA,mBAA6CA,QAAQC,QAAA,CAAA7jD,EAAA4jD,QAAAC,QAAA,CAAAH,EAAAnK,EAAAh7C,EAAAk9C,QACrD,QAAAv5C,EAAAwhD,EAAA5mD,MAAA,GAAAoF,GAAA,EAAAA,IAAA1G,CAAAA,EAAAkoD,CAAA,CAAAxhD,EAAA,GAAAlC,CAAAA,EAAA,CAAA2jD,EAAA,EAAAnoD,EAAAwE,GAAA2jD,EAAA,EAAAnoD,EAAA+9C,EAAAh7C,EAAAyB,GAAAxE,EAAA+9C,EAAAh7C,EAAA,GAAAyB,CAAAA,CAAA,CACA,OAAA2jD,EAAA,GAAA3jD,GAAArB,OAAA8L,cAAA,CAAA8uC,EAAAh7C,EAAAyB,GAAAA,CAAA,EAEArB,OAAA8L,cAAA,CAAA7O,EAA2B,cAAA0C,MAA2B,KACtD1C,EAAAkoD,gBAAkB,CAAAloD,EAAAmoD,gBAAyB,CAAAnoD,EAAAooD,wBAAA,QAC3C,IAAAngC,EAAAtoB,EAAoB,MACpBw+C,EAAAx+C,EAA4B,MAC5B+kD,EAAA/kD,EAAA,MAIAyoD,EAAA,MACAnmD,aAAA,EACA,OAAAmhB,MAAA1hB,CAAA,EACA,IAAAA,EACA,YAEA,IACA,OAAAgjD,EAAAiB,SAAA,CAAAC,uBAAA,CAAAlkD,EACA,CACA,MAAA2F,EAAA,CAEA,OADA2C,QAAA9D,KAAA,sCAAAmB,EAAA,GACA,KAEA,CACA,EACA+gD,EAAAP,EAAA,CACAK,IACA,CAAAE,GACApoD,EAAAooD,wBAAA,CAAAA,EAIA,IAAAD,EAAA,MACAlmD,aAAA,EACA,OAAAmhB,MAAA1hB,CAAA,EACA,IAAAA,EACA,YAEA,IACA,GAAAA,EAAA0gB,UAAA,GAAA+7B,EAAAkK,UAAA,CAAA3vC,IAAA,CACA,gDAEA,IAAA2J,EAAA87B,EAAAkK,UAAA,CAAAtvC,MAAA,CAAArX,GACA4mD,EAAA,CACAC,cAAAlmC,IAAAA,EAAAmmC,mBAAA,UAAAvgC,EAAAnJ,SAAA,CAAAuD,EAAAkmC,aAAA,EACAE,OAAAtK,EAAAj3B,GAAA,CAAAI,UAAA,CAAAjF,EAAAomC,MAAA,EACAC,SAAArmC,EAAAqmC,QAAA,CACAC,cAAAtmC,IAAAA,EAAAsmC,aAAA,CACAC,gBAAAvmC,IAAAA,EAAAwmC,qBAAA,UAAA5gC,EAAAnJ,SAAA,CAAAuD,EAAAumC,eAAA,GAEA,OAAAN,CACA,CACA,MAAAjhD,EAAA,CAEA,OADA2C,QAAA9D,KAAA,kCAAAmB,EAAA,GACA,KAEA,CACA,EASA,SAAA6gD,GAAA,CACA,WAEA,CACA,CAZAC,EAAAN,EAAA,CACAK,IACA,CAAAC,GACAnoD,EAAAmoD,gBAAA,CAAAA,EASwBnoD,EAAAkoD,gBAAA,CAAAA,CAAA,gBAAAzoD,CAAA,CAAAO,CAAA,EC5EX,aAEb+C,OAAA8L,cAAA,CAAsB7O,EAAA,cAAA0C,MAAA,KACtB1C,EAAA8oD,cAAA,OACA,OAAAA,EAMA,OAAAC,SAAArmD,CAAA,EACA,gCAAA2d,IAAA,CAAA3d,EACA,CAMA,OAAAsmD,UAAA,GAAAhiD,CAAA,EACA,OAAAA,EAAAgqC,IAAA,CAAAiY,EACA,CACA,CAEA,SAAAA,EAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAF,EAAAG,OAAA,GACAC,EAAAH,EAAAE,OAAA,GAEA,GAAAD,EAAAhnC,UAAA,GAAAknC,EAAAlnC,UAAA,CACA,OAAAgnC,EAAAhnC,UAAA,CAAAknC,EAAAlnC,UAAA,CAEA,QAAA9b,EAAA,EAAAA,EAAA8iD,EAAAhnC,UAAA,CAAA9b,IAAA,CACA,IAAAijD,EAAAH,CAAA,CAAA9iD,EAAA,CACAkjD,EAAAF,CAAA,CAAAhjD,EAAA,CACA,GAAAijD,IAAAC,EACA,OAAAD,EAAAC,CACA,CAEA,SAfAxpD,EAAA8oD,cAAA,CAAAA,CAeA,gBAAArpD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECrCa,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACA2lD,EAAA,WAAAA,MAAA,WAAAzkD,CAAA,CAAAqC,CAAA,EACA,IAAAlC,EAAA,GACA,QAAA4iB,KAAA/iB,EAAAjC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA1gB,EAAAA,EAAA6Y,OAAA,CAAA6H,IACA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EACA,GAAA/iB,IAAA,EAAAA,GAAA,mBAAAjC,OAAA2mD,qBAAA,CACA,QAAApjD,EAAA,EAAAyhB,EAAAhlB,OAAA2mD,qBAAA,CAAA1kD,GAAAsB,EAAAyhB,EAAA7mB,MAAA,CAAAoF,IACA,EAAAe,EAAA6Y,OAAA,CAAA6H,CAAA,CAAAzhB,EAAA,GAAAvD,OAAA0L,SAAA,CAAAk7C,oBAAA,CAAAh7C,IAAA,CAAA3J,EAAA+iB,CAAA,CAAAzhB,EAAA,GACAnB,CAAAA,CAAA,CAAA4iB,CAAA,CAAAzhB,EAAA,EAAAtB,CAAA,CAAA+iB,CAAA,CAAAzhB,EAAA,EACA,CACA,OAAAnB,CACA,EACAylB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAiB,CAAA7O,EAAA,cAAA0C,MAAA,KACjB1C,EAAA2lD,SAAA,CAAoB,OACpB,IAAAxH,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAAA,MACAwnD,EAAev8B,EAAiBjrB,EAAA,OAChCiqD,EAAejqD,EAAQ,MACvBkqD,EAAAlqD,EAAA,KAIA,OAAAgmD,EACA,OAAAmE,aAAArD,CAAA,EACA,OAAAA,EAAAtB,MAAA,CAAAhH,EAAAiB,WAAA,CACA,CAgBA,OAAA2K,oCAAAniD,CAAA,CAAAoiD,CAAA,CAAAC,CAAA,CAAApF,CAAA,CAAAqF,CAAA,CAAAC,CAAA,CAAArF,CAAA,CAAA18B,CAAA,EACA,OAAA47B,EAAA,+BAGA,GAFA,GAAAmD,EAAArgC,OAAA,GAAAqjC,EAAAj9B,EAAA,CAAA08B,EAAAxI,IAAA,yDAEAyD,EAAAM,MAAA,CAAAhH,EAAAiB,WAAA,GACA,IAAAgL,EAAAniC,EAAAw2B,aAAA,CAAA4L,QAAA,EACA1L,WAAAqL,EACAM,SAAAL,EACiBp/C,SAAA0/C,OAAAJ,EAAAlhD,QAAA,GACjB,GACA,OACAu2C,aAAA,CAAA4K,EAAA,CACA3K,oBAAA,GACAl3C,QAAA,GAEA,KACAiiD,EAAA,QAAAX,EAAAvF,SAAA,EAAA0F,EAAAnF,GACAp8C,EAAA,QAAAohD,EAAArF,kBAAA,EAAA58C,EAAAqiD,EAAApF,EAAAC,EAAAqF,EAAA/hC,GAAA,CAAAm3B,QAAAkL,CAAA,EAAAhiD,EAAAiiD,EAAAjB,EAAAhhD,EAAA,aACAkiD,EAAAxM,EAAAe,KAAA,CAAA0L,gCAAA,CAAAzM,EAAAa,gBAAA,CAAAwL,EAAA3F,EAAA4F,EAAAT,EAAA,OAAA7L,EAAAj3B,GAAA,CAAAijC,EAAAlhD,QAAA,IAAAihD,GACA,OACA1K,aAAAkL,EAAAlL,YAAA,CAAAppB,MAAA,CAAAu0B,GACAlL,oBAAAiL,EAAAjL,mBAAA,CACAl3C,QAAAmiD,EAAAniD,OAAA,CAEA,EACA,CACA,CACAvI,EAAA2lD,SAAA,CAAAA,EACAA,EAAAC,uBAAA,KACA,IAAAlkD,EACA,YAEA,GAAAA,EAAA0gB,UAAA,GAAA+7B,EAAAW,aAAA,CAAApmC,IAAA,CACA,oDAEA,IAAAmyC,EAAA1M,EAAAW,aAAA,CAAA/lC,MAAA,CAAArX,GA4BA,OA3BAmpD,EAAApE,IAAA,KAAAx+B,EAAAnJ,SAAA,CAAA+rC,EAAApE,IAAA,EACAoE,EAAAjgD,KAAA,KAAAqd,EAAAnJ,SAAA,CAAA+rC,EAAAjgD,KAAA,EACAigD,EAAAV,MAAA,CAAAhM,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAV,MAAA,EACAU,IAAAA,EAAAC,cAAA,EACAD,EAAAE,QAAA,MACAF,EAAAG,eAAA,KAAA7M,EAAAj3B,GAAA,MAGA2jC,EAAAE,QAAA,KAAA9iC,EAAAnJ,SAAA,CAAA+rC,EAAAE,QAAA,EACAF,EAAAG,eAAA,CAAA7M,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAG,eAAA,GAEAH,EAAAlC,aAAA,CAAAkC,IAAAA,EAAAI,KAAA,CACAJ,EAAAK,QAAA,CAAAL,IAAAA,EAAAI,KAAA,CACAJ,IAAAA,EAAAM,cAAA,EACAN,EAAAO,iBAAA,CAAAjN,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAQ,QAAA,EACAR,EAAAQ,QAAA,MAGAR,EAAAO,iBAAA,MACAP,EAAAQ,QAAA,KAEAR,IAAAA,EAAAS,oBAAA,CACAT,EAAAU,cAAA,MAGAV,EAAAU,cAAA,KAAAtjC,EAAAnJ,SAAA,CAAA+rC,EAAAU,cAAA,EAEAV,CAAA,iBAAAprD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECrHa,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAgC,CAAA0C,MAAA,KAC7Cu9C,EAAatgD,EAAQ,MAA0BK,GAC/CigD,EAAatgD,EAAQ,KAASK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClBjB,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAA,CAAA7O,EAA0B,cAAA0C,MAAA,KAC1B1C,EAAAwrD,kBAAkB,QAClB,IAAAvjC,EAAAtoB,EAAiC,MACjC8rD,EAAA9rD,EAAA,IAIA,OAAA6rD,EACAvpD,YAAA2F,CAAA,CAAAqD,CAAA,EACA,KAAArD,UAAA,CAAAA,EACA,KAAAqD,MAAA,CAAAA,EACA,KAAAu0C,YAAA,IACA,KAAAj3C,OAAA,IAOAmjD,eAAAC,CAAA,EAEA,OADA,KAAAnM,YAAA,CAAAhgD,IAAA,CAAAmsD,GACA,KAOAC,gBAAApM,CAAA,EAEA,OADA,KAAAA,YAAA,MAAAA,YAAA,CAAAppB,MAAA,CAAAopB,GACA,KAOAqM,mBAAAF,CAAA,EAEA,OADA,KAAAnM,YAAA,CAAAsM,OAAA,CAAAH,GACA,KAOAI,oBAAAvM,CAAA,EAEA,OADA,KAAAA,YAAA,CAAAA,EAAAppB,MAAA,MAAAopB,YAAA,EACA,KAEAwM,UAAAhgD,CAAA,EAEA,OADA,KAAAzD,OAAA,CAAA/I,IAAA,CAAAwM,GACA,KAEAw/B,SAAA,CACA,eAAAgU,YAAA,CAAAt+C,MAAA,CAQA+qD,WAAAC,CAAA,EACA,IAAA1M,EAAA,GACAC,EAAA,GACAl3C,EAAA,GAWA,OAVA,KAAAi3C,YAAA,CAAAryC,OAAA,KACAqyC,EAAAA,EAAAppB,MAAA,CAAA+1B,EAAA3M,YAAA,EAEAC,EAAA0M,EAAA1M,mBAAA,CAAArpB,MAAA,CAAAqpB,GACSl3C,EAAAA,EAAA6tB,MAAA,CAAA+1B,EAAA5jD,OAAA,CACT,GACA2jD,IACA1M,EAAAA,EAAAppB,MAAA,CAAAqpB,GACAA,EAAA,IAEA,CACAD,aAAA,IAAAA,EAAA,CACAC,oBAAA,IAAAA,EAAA,CACAl3C,QAAAA,CACA,CACA,CAMA6jD,QAAA9nD,EAAA,CAAA+nD,gBAAAtoD,KAAAA,CAAA,GACA,OAAAigD,EAAA,+BACA,QAAAxY,OAAA,GACA,QACA,CACA,IAAAhmB,EAAA,WAAA8mC,KAAA,CAAAhoD,GACS,OAAAkhB,EAAAld,WAAA,CAAAO,SAAA,EAAA0jD,qBAAA,KAAArrD,MAAA,EAET,CAKAorD,MAAAhoD,EAAA,CAAA+nD,gBAAAtoD,KAAAA,CAAA,GACA,OAAAigD,EAAoB,YAAkB,mBACtC,IAAAqI,gBAAAA,CAAA,EAAA/nD,EACAuH,EAAA,GACA,YAAAjE,UAAA,CAAAkE,kBAAA,kBAEAxD,EAAA,IAAA2f,EAAAukC,WAAA,CAAAzpD,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAA6I,GAAA,CAAAD,SAAA,KAAAX,MAAA,CAAApJ,SAAA,IACA4qD,EAAA,KAAAR,UAAA,KAGA,OAFA3jD,EAAA/C,GAAA,IAAAknD,EAAAjN,YAAA,EACAl3C,EAAAsD,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CACA,CACAyG,YAAAA,EACAC,QAAAkkD,EAAAlkD,OAAA,CAAA6tB,MAAA,MAAA7tB,OAAA,CACS,CACT,EACA,CAKAmkD,iBAAA,CACA,OAAA1I,EAAA,+BACA,IAAAxiD,EAAA,WAAA8qD,KAAA,GACAK,EAAoB,IAAAlB,EAAUmB,oBAAA,MAAAhlD,UAAA,MAAAqD,MAAA,EAC9B,CAAA4hD,QAAAA,CAAA,QAAAF,EAAAG,2BAAA,CAAAtrD,GACS,OAAAqrD,GACT,EACA,CAKA,OAAA7/C,QAAA+/C,CAAA,CAAAC,CAAA,CAAA9hD,CAAA,EACA,OAAA84C,EAAA,+BACA,IAAAiJ,EAAwB,MAAA/rC,QAAAqkC,GAAuB,CAAAyH,EAAA7rD,GAAA,IAAA6iD,EAAA,+BAC/C,IAAA17C,YAAAA,CAAyB,CAAAC,QAAAA,CAAA,QAAA2kD,EAAAZ,KAAA,GACZ,OAAA9qD,GAAA8G,EAAAC,QAAAA,CAAA,CACb,KACS,aAAAwkD,EAAA//C,OAAA,CAAAigD,EAAA/hD,EACT,EACA,CACA,CAA0BlL,EAAAwrD,kBAAA,CAAAA,CAAA,eAAA/rD,CAAA,CAAAO,CAAA,ECzJb,aAEb,IAAAgkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAA,CAAA7O,EAA4B,cAAA0C,MAAA,KAC5B1C,EAAA4sD,oBAAA,OACA,OAAAA,EACA3qD,YAAA2F,CAAA,CAAAqD,CAAA,CAAAlD,EAAA,aACA,KAAAH,UAAA,CAAAA,EACA,KAAAqD,MAAA,CAAAA,EACA,KAAAlD,UAAA,CAAAA,CACA,CACAmE,gBAAA+gD,CAAA,EACA,OAAAjJ,EAAoB,+BACpB,IAAAmJ,aAAAA,CAAA,CAAAC,qBAAAA,CAAA,CAAArhD,UAAAA,CAAA,aAAAshD,gBAAA,EACAJ,EACA,EACS,OAAA3kD,YAAA6kD,CAAA,IAAAC,qBAAAA,EAAArhD,UAAAA,CAAA,CACT,EACA,CACAshD,iBAAAC,CAAA,EACA,OAAAtJ,EAAoB,8BAAkC,CACtD,IAAAj4C,UAAAA,CAAA,CAAAqhD,qBAAAA,CAAA,aAAAxlD,UAAA,CAAAkE,kBAAA,MAAA/D,UAAA,EACA6D,EAAA,KAAAX,MAAA,CAAApJ,SAAA,CACA0rD,EAAAD,EAAAnsD,GAAA,IACaqsD,EAAAP,EAAArhD,EAAAG,IAEbohD,EAAA,WAAAliD,MAAA,CAAAqC,mBAAA,CAAAigD,GACA,OACAJ,aAAAA,EACAC,qBAAAA,EACArhD,UAAAA,CACS,CACT,EACA,CACA0hD,gBAAAnlD,CAAA,CAAA8kD,CAAA,CAAArhD,CAAA,EACA,OAAAi4C,EAAA,+BACA,IAAA6I,EAAA,KAAAa,yBAAA,EAAAplD,EAAA,CAAA8kD,EAAArhD,GACAmB,EAAA,MAAA2/C,IACAc,EAAAzgD,CAAA,IACA,GAAAygD,cAAAA,EAAA3/C,MAAA,CACA,OAAA2/C,EAAAjrD,KAAA,OAGAirD,EAAAC,MAAA,EAGA,CACAF,0BAAAP,CAAA,CAAAC,CAAA,CAAArhD,CAAA,CAAA8hD,EAAA,IACA,IAAAC,EAAA,GAAA9J,EAAA,+BACA,IAAA+J,EAAAvsD,EAAAqH,SAAA,GACA,YAAAjB,UAAA,CAAAmG,kBAAA,CAAAggD,EAAA,CACa3iD,oBAAA,KAAArD,UAAA,EAEb,GACAimD,EAAA,GAAAhK,EAAA,+BACA,IAAA//C,EAAA,WAAA2D,UAAA,CAAAqG,kBAAA,EACAxB,UAAAwhD,EACAb,qBAAAA,EACarhD,UAAAA,CACb,OAAAhE,UAAA,EACA,GAAA9D,EAAAvB,KAAA,CAAAgI,GAAA,CACA,mCAAAjH,KAAAC,SAAA,CAAAO,EAAAvB,KAAA,OAGA,UAAAshD,EAAA,+BACA,GAAA6J,EAAA,CACA,IAAAtG,EAAA4F,EAAAhsD,GAAA,IAAA6iD,EAAA,+BACA,IAAAiK,EAAA,MAAAH,EAAAtsD,GAEiB,OADjB,MAAAwsD,EAAAC,GACiBA,CACjB,IACA,OAAA/sC,QAAAgtC,UAAA,CAAA3G,EACA,CASS,CAPT,IAAAA,EAAA,GACA,QAAA/lD,KAAA2rD,EAAA,CACA,IAAAc,EAAA,MAAAH,EAAAtsD,EACA,OAAAwsD,EAAAC,GACA1G,EAAA/nD,IAAA,CAAAyuD,EACA,CACA,OAAA/sC,QAAAgtC,UAAA,CAAA3G,EACS,CACT,EACA,CACAuF,4BAAAG,CAAA,EACA,OAAAjJ,EAAoB,+BACpB,IAAA17C,YAAAA,CAAA,CAAA8kD,qBAAAA,CAAA,CAAArhD,UAAAA,CAAA,aAAAG,eAAA,CAAA+gD,GACA,OACAkB,SAAA7lD,EACAukD,QAAA,IAAA7I,EAAA,2CAAAyJ,eAAA,CAAAnlD,EAAA8kD,EAAArhD,EAAA,EACS,CACT,EACA,CACAqiD,6BAAAd,CAAA,CAAAO,EAAA,IACA,OAAA7J,EAAoB,+BACpB,IAAAmJ,aAAAA,CAAA,CAAAC,qBAAAA,CAAA,CAAArhD,UAAAA,CAAA,aAAAshD,gBAAA,CAAAC,GACAT,EAAqB,KAAAa,yBAAA,CAAAP,EAAAC,EAAArhD,EAAA8hD,GACZ,OAAAxgD,UAAA8/C,EAAAN,QAAAA,CAAA,CACT,EACA,CACA,CAEA,SAAAW,EAAAP,CAAA,CAAArhD,CAAA,CAAAG,CAAA,EACA,IAAAtD,EACA,IAAAF,EAAA,OAAAE,CAAAA,EAAAwkD,EAAA1kD,OAAA,GAAAE,KAAA,IAAAA,EAAAA,EAAA,GACAjH,EAAAyrD,EAAA3kD,WAAA,CAIA,OAHA9G,EAAAoK,QAAA,CAAAA,EACApK,EAAAqK,eAAA,CAAAE,EACAxD,EAAA+hB,MAAA,IAAAtlB,KAAAjB,IAAAiB,GAAAmI,OAAA,IAAA3L,EAAAyK,WAAA,CAAAoiD,IACA7sD,CAAA,CARAxB,EAAA4sD,oBAAA,CAAAA,CAQA,gBAAAntD,CAAA,CAAAO,CAAA,ECrHa,aAEb+C,OAAA8L,cAAA,CAAA7O,EAAyB,cAAA0C,MAAA,KACzB1C,EAAAimD,iBAAA,QAIAjmD,EAAAimD,iBAAA,EACAzG,aAAA,GACAC,oBAAA,GACAl3C,QAAA,mBAAA9I,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,8CAAA4uD,EAAA,kCAAAC,EAAA,gCAAAC,EAAA,mCAAAC,EAAA,uBAAA5uD,EAAAC,CAAA,uCAAA4uD,EAAA,+BAAAC,EAAA,oCAAAC,EAAA,0CAAAC,EAAA,oCAAAC,EAAA,iCAAAC,EAAA,gCAAAC,EAAA,6BAAAhN,EAAA,kCAAAiN,EAAA,qCAAAC,EAAA,0CAAAC,EAAA,2BAAAC,EAAA,4BAAAC,EAAA,iCAAAC,EAAA,sCAAAC,EAAA,wBAAAC,EAAA,kCAAAC,EAAA,gCAAAC,EAAA,gCAAAC,EAAA,uCAAAC,EAAA,gCAAAC,EAAA,mCAAAC,CAAA,gCAAAC,EAAA,oCAAAC,EAAA,uCAAAC,EAAA,kCAAA7sD,CAAA,qCAAA8sD,CAAA,mCAAAC,EAAA,0BAAAC,EAAA,qCAAAlM,CAAA,yBAAA9jD,CAAA,QCMA+E,EAAAkC,EAAA/G,EAAA8D,EAAAe,EAAAw6C,EAAA0Q,EDNAC,EAAA3wD,EAAA,MAAAS,EAAAT,EAAA,MAAAU,EAAAV,EAAA,MAAAE,EAAAF,EAAAW,CAAA,CAAAD,GAAAE,EAAAZ,EAAA,MAAAa,EAAAb,EAAAW,CAAA,CAAAC,GAAAgwD,EAAA5wD,EAAA,MAAA6wD,EAAA7wD,EAAA,MAAA8wD,EAAA9wD,EAAAW,CAAA,CAAAkwD,GAAAE,EAAA/wD,EAAA,MAAAgxD,EAAAhxD,EAAA,MAAAixD,EAAAjxD,EAAA,MAAAkxD,EAAAlxD,EAAA,MAAAmxD,EAAAnxD,EAAAW,CAAA,CAAAuwD,GAAAE,EAAApxD,EAAA,MCV+jBe,EAAAf,EAAkC,aACjmB,SAAAoF,EAAAI,CAAA,aAAA6rD,YAAA,SAAAj4C,MAAA,CAAA5T,EAAA,UAAA6T,EAAA7T,CAAA,aAAA8rD,WAAA,EAAAtvD,MAAA,CAAAwD,EAAA,UAAA/D,EAAA+D,CAAA,SAAA3E,IAAAmB,MAAA,CAAAwD,EAAA,UAAA+rD,EAAA7pD,CAAA,SAAAipD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAkyC,EAAAY,WAAA,CAAA9pD,GAAA,KAAAvC,EAAA/B,OAAAquD,MAAA,EAAAC,UAAA,KAAAC,IAAAvuD,OAAAquD,MAAA,EAAAC,UAAA,KAAA1vD,OAAA,SAAAwD,CAAA,SAAAA,EAAAkW,MAAA,EAAAlW,EAAAkC,IAAAlC,EAAAkC,EAAA4B,QAAA,KAAAsoD,QAAA,eAAAx4C,OAAA,SAAA1R,CAAA,MAAAA,EAAA6Y,OAAA,QAAA7Y,CAAAA,EAAAA,EAAAmqD,MAAA,KAAAnqD,EAAAnG,MAAA,OAAAmG,CAAAA,EAAA,IAAAA,CAAAA,CAAA,KAAA/G,EAAA+G,EAAA+1B,KAAA,wBAAA98B,EAAAgwD,EAAA5vD,MAAA,CAAA2d,IAAA,KAAAiyC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAA/d,EAAAa,GAAA,CAAAgE,GAAAsnC,SAAAtnC,EAAA,SAAAssD,KAAA1uD,OAAAquD,MAAA,EAAAC,UAAA,KAAAt4C,OAAAhU,EAAApD,OAAAqX,CAAA,GAAA04C,KAAA3uD,OAAAquD,MAAA,EAAAC,UAAA,KAAA1vD,OAAAP,EAAA2X,OAAA,SAAA5T,CAAA,SAAA3E,IAAAuY,MAAA,CAAA5T,EAAA,IAAAwsD,OAAA5uD,OAAAquD,MAAA,EAAAC,UAAA,KAAA1vD,OAAA,SAAAwD,CAAA,SAAAorD,EAAAqB,aAAA,CAAAzsD,EAAA,EAAA4T,OAAAm4C,CAAA,cAAApB,EAAA3qD,CAAA,MAAAkC,EAAA,IAAAjC,IAAA,OAAAD,EAAA0sD,MAAA,EAAA1sD,EAAA0sD,MAAA,CAAA1kD,OAAA,CAAAhI,GAAA,KAAA7E,EAAA,IAAA8D,EAAA,OAAA9D,CAAAA,EAAA6E,EAAA3C,GAAA,YAAAlC,EAAAA,EAAA6E,EAAAlC,IAAA,CAAAoE,EAAAhC,GAAA,CAAAF,EAAAoF,IAAA,CAAAnG,EAAA,GAAAiD,CAAA,UAAAjE,EAAA+B,CAAA,IAAAkC,CAAA,KAAAlC,EAAAqE,IAAA,CAAAtI,MAAA,EAAAmG,EAAAnG,MAAA,4CAAAZ,EAAA,GAAA8D,EAAA,SAAAe,EAAAqE,IAAA,CAAA2D,OAAA,CAAAhI,GAAA,CAAA7E,CAAA,CAAA6E,EAAAlC,IAAA,EAAAoE,CAAA,CAAAjD,EAAA,CAAAA,GAAA,IAAA9D,CAAA,UAAA4jD,EAAA/+C,CAAA,CAAAkC,EAAA,IAAAlC,EAAAgI,OAAA,CAAAhI,GAAA,iBAAAA,EAAA++C,EAAA/+C,EAAA+C,QAAA,CAAAb,CAAA,CAAAlC,EAAAlC,IAAA,oBAAAoE,CAAA,CAAAlC,EAAAlC,IAAA,oCAAAkC,EAAAlC,IAAA,6BAAAitD,EAAA/qD,CAAA,SAAAA,aAAA/E,EAAA0e,SAAA,CAAA3Z,EAAA,IAAA/E,EAAA0e,SAAA,CAAA3Z,EAAA,OAAAkzB,UAAAr2B,UAAAC,YAAAkD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,IAAA+B,QAAA+B,CAAA,IAAAu7C,EAAA,CAAAx6C,EAAA,CAAA5C,KAAA+D,CAAA,EAAAnB,CAAA,WAAAmB,EAAApF,MAAA,CAAAkD,EAAA,YAAAkC,EAAA7D,IAAA,aAAA2B,CAAA,OAAA1B,KAAA,aAAAC,GAAA,aAAAC,IAAA,aAAAC,UAAA,aAAAN,IAAA,aAAAO,MAAA,aAAAX,QAAA,QAAAY,OAAAC,MAAA,MAAA28C,GAAA,KAAA18C,IAAA,MAAAhB,WAAA,CAAAgB,IAAA,MAAAd,QAAA,UAAAiC,EAAA,aAAAA,CAAAA,EAAA9D,CAAAA,EAAA8D,EAAA9D,EAAA,CAAA6E,KAAAkC,IAAA,YAAAyqD,EAAA3sD,CAAA,yBAAAA,GAAA,MAAAA,CAAA,UAAAuvB,EAAAvvB,CAAA,yBAAAA,EAAA1B,KAAAC,SAAA,CAAAyB,GAAA,GAAAA,CAAA,UAAA4sD,EAAA5sD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,UAAAe,EAAA,YAAAA,EAAAA,EAAA,oBAAAA,GAAAA,CAAAA,EAAA,CAAA9C,QAAA8C,CAAA,OAAA5C,KAAAo9C,CAAA,CAAA78C,OAAAwD,CAAA,EAAAe,EAAA,CAAAzE,KAAAoC,CAAA,EAAA1E,EAAA,CAAAuC,WAAA/C,CAAA,CAAAuC,QAAA0lD,EAAA,6BAAA/iD,EAAA,IAAAlF,CAAAA,EAAA,qBAAAA,EAAA,4BAAA40B,EAAAtwB,GAAA,KAAAe,EAAA,OAAAzC,MAAA0B,EAAAxB,KAAAoC,EAAAnC,WAAA/C,EAAA6C,IAAAg9C,CAAA,CAAAA,EAAAz+C,MAAA,IAAAqB,KAAAo9C,EAAA78C,OAAAwD,EAAA,GAAAnB,CAAA,CAAA9C,QAAA0lD,CAAA,WAAA3vB,EAAAjzB,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA,QAAAA,KAAAmS,EAAAnS,EAAAx6C,IAAA,mBAAAw6C,CAAA,CAAAr8C,OAAAC,QAAA,GAAA4B,CAAAA,EAAA,CAAAA,EAAA,EAAAA,GAAA,KAAAA,EAAA4sD,EAAApS,EAAAt4C,EAAA/G,EAAA8D,EAAAe,CAAAA,GAAA,OAAAA,CAAAA,CAAA,WAAA6sD,EAAA7sD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,QAAAiC,KAAA6B,EAAA,GAAAtB,OAAA68C,EAAA,CAAAx6C,EAAA,CAAAZ,OAAA+B,EAAA,GAAA9B,KAAAQ,EAAA,IAAA1E,EAAAR,EAAA,CAAAyC,KAAA6B,EAAAtB,OAAA68C,CAAA,KAAAr5C,GAAAnB,CAAAA,EAAAkC,EAAA5C,OAAA,CAAAU,EAAArF,GAAAkF,GAAA,SAAAqC,EAAAzE,IAAA,EAAAkvD,EAAAzqD,EAAA3C,MAAA,GAAAotD,EAAA3sD,IAAA,CAAArE,MAAA6D,OAAA,CAAAQ,EAAA,UAAA7E,KAAA6E,EAAA,SAAAkC,EAAA3C,MAAA,CAAApE,EAAA,SAAA6E,CAAA,CAAA7E,EAAA,KAAAynD,EAAA,WAAAznD,KAAA+G,EAAAxC,SAAA,CAAAM,EAAArF,GAAAioD,EAAA,SAAAznD,EAAA,gBAAAA,EAAA2xD,EAAAryD,EAAA,GAAAyH,EAAApC,OAAA,CAAAE,EAAArF,GAAA,KAAAuH,EAAA2qD,EAAAC,EAAAryD,EAAA,CAAA2C,KAAA,SAAAjC,EAAA8D,EAAA,IAAAA,EAAA9D,EAAA,CAAAwC,OAAA,SAAAxC,EAAAq/C,EAAA,IAAAA,EAAAsS,EAAA,CAAA1tD,OAAA+B,EAAA9B,KAAAQ,CAAA,WAAAZ,KAAAiD,EAAAjD,CAAA,IAAA2jD,CAAAA,EAAA,SAAA3jD,CAAA,aAAAkC,GAAA2rD,CAAAA,EAAA7tD,CAAA,aAAA9D,EAAA6E,EAAA8sD,EAAA9sD,aAAAC,IAAAD,EAAAE,GAAA,CAAA/E,EAAA2xD,GAAA9sD,aAAAG,IAAAH,EAAAI,GAAA,CAAA0sD,GAAAH,EAAA3sD,IAAAA,CAAAA,CAAA,CAAA7E,EAAA,CAAA2xD,CAAAA,CAAA,KAAAlK,EAAA,QAAAznD,KAAA+G,EAAA7B,OAAA,CAAAL,EAAArF,GAAAioD,EAAA,SAAAznD,EAAA,QAAAynD,GAAA,cAAA5iD,EAAA,QAAA+sD,EAAAjwD,YAAAkD,CAAA,OAAAQ,IAAA,aAAA/C,IAAA,aAAA8B,MAAA,aAAAD,OAAA,aAAAI,SAAA,aAAAW,OAAA,aAAAP,OAAA,YAAArC,KAAAyE,CAAA,CAAA3C,OAAApE,CAAA,CAAAuE,UAAAT,CAAA,CAAAoB,QAAAm6C,CAAA,CAAAl7C,QAAA6B,EAAAnB,GAAAA,CAAA,CAAAF,QAAAD,EAAA,eAAAG,CAAA,MAAAvC,IAAA,CAAAyE,EAAA,KAAA3C,MAAA,CAAApE,EAAA,KAAA2E,OAAA,CAAAD,EAAA,KAAAP,OAAA,CAAA6B,EAAA,KAAAzB,SAAA,CAAAT,EAAA,CAAAe,EAAAkC,IAAA+wB,EAAAh0B,EAAAe,EAAAkC,GAAAA,EAAA,KAAAlC,GAAA,YAAAK,OAAA,CAAAm6C,EAAA,CAAAx6C,EAAAkC,IAAA+wB,EAAAunB,EAAAx6C,EAAAkC,GAAAA,EAAA,KAAAlC,GAAA,OAAAS,OAAAT,CAAA,kBAAAA,CAAA,CAAAkC,CAAA,MAAA/G,EAAAwnB,EAAA3iB,EAAAkC,GAAA,GAAA/G,CAAA,UAAAA,CAAA,KAAA6E,EAAA,MAAAU,OAAAV,CAAA,SAAAgtD,EAAAhtD,EAAA,MAAAW,GAAAX,CAAA,SAAAitD,EAAAjtD,EAAA,MAAAX,KAAAW,CAAA,kBAAAA,CAAA,CAAAkC,CAAA,MAAA/G,EAAAwnB,EAAA3iB,EAAAkC,EAAA,CAAA9C,OAAA,GAAAC,KAAA,QAAAlE,CAAA,UAAAA,CAAA,WAAAA,CAAA,KAAA6E,EAAA,MAAAY,SAAAZ,CAAA,CAAAkC,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,IAAAygB,EAAA3iB,EAAA,KAAAkC,EAAA,WAAA8qD,EAAAhtD,CAAA,CAAAkC,CAAA,MAAA/G,EAAAwnB,EAAA3iB,EAAAkC,EAAA,CAAA9C,OAAA,QAAAjE,CAAA,UAAAA,CAAA,WAAAA,CAAA,aAAA8xD,EAAAjtD,CAAA,CAAAkC,CAAA,SAAAygB,EAAA3iB,EAAAkC,EAAA,aAAAygB,EAAA3iB,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,QAAA8D,EAAA4tD,EAAA7sD,EAAAkC,EAAA/G,GAAAq/C,EAAA,SAAAx6C,CAAA,MAAAtB,KAAAwD,CAAA,CAAA3E,MAAApC,CAAA,EAAA6E,EAAArB,IAAA,UAAAuD,EAAA,OAAA/G,CAAA,EAAA8D,UAAA,UAAAi0B,EAAAsnB,CAAA,wBAAAx6C,KAAAf,EAAAe,CAAA,YAAAA,CAAA,uBAAAw6C,CAAA,cAAAnrB,EAAArvB,CAAA,CAAAkC,CAAA,aAAA6qD,EAAA,CAAAtvD,KAAAuC,EAAAT,OAAA,KAAAG,UAAAwC,CAAA,YAAAgrD,EAAAltD,CAAA,aAAA+sD,EAAA,CAAAtvD,KAAA,QAAA8B,OAAAS,EAAA,CAAAF,QAAAoC,CAAA,KAAAlC,GAAArE,MAAA6D,OAAA,CAAA0C,GAAA,QAAA/G,EAAA8D,EAAA,GAAAiD,EAAApC,OAAA,SAAA3E,EAAA8D,EAAAe,EAAA,EAAAV,QAAAU,GAAArE,MAAA6D,OAAA,CAAAQ,GAAAA,EAAA7D,KAAA,GAAA6D,CAAA,CAAAN,UAAAM,GAAArE,MAAA6D,OAAA,CAAAQ,IAAA,0CAAAuvB,EAAAvvB,EAAA,YAAAmtD,EAAAntD,CAAA,MAAAkC,EAAAqtB,EAAAvvB,GAAA7E,EAAA,OAAA6E,EAAA,WAAA+sD,EAAA,CAAAtvD,KAAA,UAAA8B,OAAA,WAAApE,GAAA,WAAAA,GAAA,YAAAA,EAAA6E,EAAA,KAAAN,UAAAvE,GAAAA,IAAA6E,GAAA,yBAAAkC,EAAA,oBAAAqtB,EAAAp0B,EAAA,YAAAiyD,EAAAptD,CAAA,aAAA+sD,EAAA,IAAA/sD,CAAA,CAAAN,UAAA,CAAAwC,EAAA/G,IAAA,OAAA+G,GAAAlC,EAAAN,SAAA,CAAAwC,EAAA/G,GAAAkF,QAAA,CAAA6B,EAAA/G,IAAA,OAAA+G,GAAAlC,EAAAK,OAAA,CAAA6B,EAAA/G,EAAA,YAAA2e,GAAA,QAAAuV,EAAA,SAAArvB,GAAA,iBAAAA,GAAA,CAAA0B,MAAA1B,IAAA,oCAAAuvB,EAAAvvB,GAAA,UAAAqtD,EAAArtD,CAAA,aAAA+sD,EAAA,IAAA/sD,CAAA,CAAAN,UAAA,CAAAwC,EAAA/G,IAAA,SAAA+G,GAAAlC,EAAAN,SAAA,CAAAwC,EAAA/G,GAAAkF,QAAA,CAAA6B,EAAA/G,IAAA,SAAA+G,GAAAlC,EAAAK,OAAA,CAAA6B,EAAA/G,EAAA,YAAAmyD,GAAA,QAAAj+B,EAAA,SAAArvB,GAAA,iBAAAA,GAAA,oCAAAuvB,EAAAvvB,GAAA,UAAAutD,EAAAvtD,CAAA,MAAAkC,EAAAtE,OAAAiE,IAAA,CAAA7B,GAAA,WAAA+sD,EAAA,CAAAtvD,KAAA,OAAA8B,OAAAS,EAAA,CAAAF,QAAA3E,CAAA,KAAAwxD,EAAAxxD,GAAA,QAAA8D,KAAAiD,EAAA,MAAAjD,EAAA9D,CAAA,CAAA8D,EAAA,CAAAe,CAAA,CAAAf,EAAA,GAAAS,UAAAM,GAAA2sD,EAAA3sD,IAAA,qCAAAuvB,EAAAvvB,EAAA,YAAAwtD,EAAAxtD,CAAA,MAAAkC,EAAAlC,EAAAhE,GAAA,CAAAgE,GAAAA,EAAAvC,IAAA,EAAAH,IAAA,mBAAAyvD,EAAA,CAAAtvD,KAAA,QAAA8B,OAAA,KAAAD,QAAA,CAAA4C,EAAA/G,IAAA,CAAA6E,EAAAiC,IAAA,CAAAjC,GAAA,KAAA7E,EAAA,CAAA6E,EAAAY,QAAA,CAAAsB,EAAA,CAAA9C,OAAA,YAAAjE,CAAA,IAAAooB,IAAA,EAAAjkB,OAAA,CAAA4C,EAAA/G,GAAAuE,UAAAvE,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA,WAAAt4C,KAAAlC,EAAA,QAAAA,EAAA,CAAA6sD,EAAA1xD,EAAA+G,EAAAjD,GAAA,CAAAkC,EAAA,CAAAnB,EAAA,IAAAmB,CAAA,qBAAAe,EAAA,GAAAlC,EAAAkC,GAAAs4C,EAAAngD,IAAA,CAAA6H,EAAA,qDAAAA,EAAA,oBAAAqtB,EAAAp0B,MAAAq/C,EAAA,aAAAj3B,IAAA,QAAA8L,EAAA,iCAAAo+B,GAAAztD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,KAAA+G,EAAAnG,MAAA,kBAAA2xD,GAAA1tD,EAAAkC,EAAA/G,EAAA,MAAA6E,EAAAkC,EAAA,IAAAjD,GAAAiD,EAAA,GAAAvG,MAAAC,KAAA,SAAAC,KAAAC,IAAA,CAAAkE,CAAAA,EAAAkC,GAAAnG,MAAA,CAAAmG,KAAAlG,GAAA,EAAAb,EAAA8D,IAAAe,EAAA7D,KAAA,CAAA8C,EAAAiD,EAAA,CAAAjD,EAAA,GAAAiD,KAAA,aAAA6Z,QAAAqkC,GAAA,CAAAnhD,EAAAjD,GAAA,CAAAkG,GAAAwrD,GAAA1tD,EAAAkC,EAAA/G,IAAA,EAAAsnD,IAAA,mBAAAiL,GAAA1tD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,EAAA,MAAA9D,EAAAA,EAAA6E,EAAA4C,UAAA,cAAA5C,EAAAsgD,uBAAA,CAAAp+C,EAAAjD,EAAA,EAAAjD,GAAA,EAAAgE,EAAA7E,IAAA,OAAA6E,EAAA,MAAAtD,UAAAwF,CAAA,CAAA/G,EAAA,CAAA6H,QAAAhD,CAAA,kBAAA2tD,GAAA3tD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAkC,CAAA,EAAAhG,GAAAA,EAAAY,MAAA,IAAAmG,EAAAqB,IAAA,IAAApI,GAAA,IAAA0E,EAAAqC,EAAAsB,QAAA,GAAA7I,EAAAkF,EAAA6D,SAAA,GAAAk/C,EAAA1gD,EAAA0B,UAAA,CAAAjJ,GAAAmJ,QAAA,WAAAgpD,EAAA,CAAA9oD,SAAA,SAAApB,WAAA,MAAA3D,EAAAA,EAAAe,EAAA4C,UAAA,KAAAzB,EAAA,KAAAnB,EAAA,CAAArE,MAAA6D,OAAA,CAAA2B,GAAAA,EAAAtB,EAAAqE,aAAA,IAAAlI,GAAA,CAAAgE,GAAAA,EAAAmE,QAAA,GAAA2oD,CAAAA,EAAA/pD,QAAA,EAAAiB,SAAA,SAAAC,UAAAjE,CAAA,EAAA7E,GAAA2xD,CAAAA,EAAA1oD,SAAA,SAAA3J,EAAA,CAAAmoD,EAAAkK,EAAA,CAAAhlB,EAAAklB,EAAA,MAAAhtD,EAAAuE,WAAA,uBAAA9J,GAAAmzD,IAAA,aAAA9lB,EAAA,KAAA9nC,EAAA,YAAA8nC,EAAA/mC,KAAA,EAAAf,CAAAA,EAAA8nC,EAAA/mC,KAAA,CAAAxE,IAAA,CAAAmI,IAAA,GAAA/I,MAAA6D,OAAA,CAAAQ,GAAA,KAAAkC,EAAA,SAAA/G,EAAA+G,EAAAlC,EAAA1C,IAAA,CAAA4E,GAAA2C,QAAA9D,KAAA,CAAA+mC,EAAA/mC,KAAA,CAAA7D,OAAA,CAAA/B,EAAA,WAAAF,EAAA6J,oBAAA,oCAAAgjC,EAAA/mC,KAAA,CAAA7D,OAAA,CAAA8C,EAAA,QAAA8nC,EAAAhpC,MAAA,UAAA+uD,GAAA7tD,CAAA,MAAAA,EAAAkC,EAAA/G,EAAA,OAAA6E,EAAA8tD,GAAA9tD,GAAAkC,EAAA6rD,GAAA5yD,EAAA+G,GAAA,UAAAA,EAAAA,EAAA,IAAAA,CAAA,CAAApD,OAAAkuD,EAAA9qD,EAAApD,MAAA,CAAAkB,EAAA,MAAA+sD,EAAA,IAAA/sD,CAAA,CAAAV,QAAA,CAAAL,EAAAu7C,IAAAyS,EAAAhuD,EAAAiD,GAAAlC,EAAAV,OAAA,CAAAnE,EAAA8D,EAAAu7C,GAAAA,GAAAx6C,EAAAV,OAAA,CAAAL,EAAAu7C,EAAA,OAAAuT,GAAAD,GAAAvqC,MAAA,SAAAuqC,GAAA9tD,CAAA,SAAAwtD,EAAA,CAAAD,EAAA,CAAAroD,QAAAioD,EAAA,OAAAhoD,GAAAmoD,IAAAxuD,OAAAkB,CAAA,GAAAutD,EAAA,CAAAroD,QAAAioD,EAAA,OAAAhoD,GAAAmoD,IAAAvsD,MAAAwsD,EAAA,CAAAnoD,KAAAme,KAAArmB,QAAAowD,IAAA/wD,KAAA8wD,EAAAh+B,EAAA,yBAAAu+B,GAAAI,CAAAA,GAAAT,EAAA,CAAAhoD,IAAA6nD,EAAAI,EAAA,CAAAD,EAAA,IAAAD,IAAA,GAAA5oD,KAAA0oD,EAAAF,EAAAI,MAAAvqD,SAAAsqD,EAAAD,EAAAF,EAAAE,EAAAG,EAAA,CAAA/nD,WAAA6pB,EAAA,UAAArvB,GAAA,kBAAAA,GAAAyF,MAAA6nD,IAAA5nD,SAAAoU,IAAAvd,KAAA2wD,EAAAI,KAAA3nD,UAAA0nD,EAAAvzC,IAAA,OAAAlU,cAAAynD,EAAAvzC,IAAA,GAAA+zC,GAAAN,EAAA,CAAAxuD,QAAAwuD,EAAA,CAAAjoD,KAAAwU,GAAA,GAAAvc,MAAAywD,EAAA,SAAAA,GAAAC,GAAArwD,OAAAquD,MAAA,EAAAC,UAAA,KAAAgC,OAAA,eAAAluD,CAAA,CAAAkC,CAAA,CAAAs4C,CAAA,CAAAr5C,CAAA,EAAAnB,EAAA+qD,EAAA/qD,GAAAmB,GAAAA,CAAAA,EAAAupD,IAAA,MAAA7qD,EAAA,IAAA5E,EAAAosD,WAAA,IAAAxnD,EAAAO,GAAA,KAAAnF,EAAA2mD,sBAAA,EAAAhI,UAAA55C,EAAA6B,KAAA,MAAAK,EAAAA,EAAA,GAAA3F,KAAAi+C,CAAA,aAAAr5C,EAAAkF,cAAA,iGAAAlF,EAAAkF,cAAA,CAAAxG,EAAA,KAAAgiD,oBAAA4L,GAAAvqD,oBAAAyqD,EAAA,SAAArE,GAAAxsD,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,OAAAsH,UAAA,CAAAzC,EAAA,KAAA8F,MAAA,CAAA5D,EAAA,KAAA6D,IAAA,CAAA5K,EAAA,KAAAuB,SAAA,CAAAwF,EAAAxF,SAAA,QAAAsJ,gBAAA,QAAAC,oBAAA,YAAArD,WAAA,oBAAAsD,MAAAlG,CAAA,CAAAkC,CAAA,oEAAAkE,KAAA,gEAAAC,eAAArG,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,CAAA,UAAA9D,GAAAA,CAAAA,EAAA,KAAA4K,IAAA,EAAA/F,EAAAyG,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CAAAsD,EAAA0G,eAAA,aAAAjE,UAAA,CAAA0rD,kBAAA,CAAAhzD,EAAA8K,mBAAA,GAAAW,SAAA,CAAA5G,EAAA,WAAA8F,MAAA,CAAAiB,eAAA,CAAA/G,GAAA,OAAAkC,EAAAA,EAAA,IAAA8F,OAAA,CAAA9F,GAAA,CAAAlC,EAAA8G,WAAA,CAAA5E,EAAA,OAAAf,EAAAnB,EAAA0D,SAAA,oBAAA0qD,GAAA,KAAA3rD,UAAA,CAAAtB,EAAAhG,EAAA,OAAA+G,EAAA,IAAAA,aAAAmsD,GAAA,KAAAlzD,EAAA,WAAAsH,UAAA,CAAAgF,cAAA,CAAAxL,EAAA+D,EAAAsH,SAAA,GAAA1E,WAAA,iBAAAzH,EAAA,KAAA6E,EAAA,OAAAf,CAAAA,EAAA9D,EAAAwM,IAAA,YAAA1I,EAAA,OAAAA,EAAA2I,WAAA,OAAA5H,EAAA,IAAA/E,EAAA6J,oBAAA,CAAA5C,EAAAhF,OAAA,CAAA8C,GAAAkC,CAAA,QAAAA,CAAA,QAAA2F,QAAA7H,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,KAAA6D,IAAA,MAAA5K,EAAA,WAAAsH,UAAA,CAAA0rD,kBAAA,CAAAjsD,EAAA+D,mBAAA,EAAAhH,EAAAe,EAAAhE,GAAA,CAAAgE,GAAA,KAAAkC,EAAA,IAAAjD,EAAAe,EAAA3D,EAAA,CAAAm+C,EAAA,OAAAt4C,CAAAA,EAAAlC,EAAAoD,OAAA,YAAAlB,EAAAA,EAAA,UAAAjD,EAAAwH,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CAAAuC,EAAAyH,eAAA,CAAAvL,EAAAyL,SAAA,CAAA4zC,EAAAxyC,OAAA,CAAAhI,GAAA,CAAAf,EAAA6H,WAAA,CAAA9G,EAAA,GAAAf,CAAA,GAAAu7C,EAAA,WAAA10C,MAAA,CAAAqC,mBAAA,CAAAlJ,GAAAkC,EAAA,WAAAnB,EAAA,EAAAA,EAAAf,EAAAlD,MAAA,CAAAiE,GAAA,OAAA7E,EAAAq/C,CAAA,CAAAx6C,EAAA,CAAA0D,SAAA,GAAAvC,EAAA9G,IAAA,OAAA+zD,GAAA,KAAA3rD,UAAA,CAAAtH,EAAA+G,GAAA,QAAAf,CAAA,OAAAkH,SAAArI,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,EAAAe,EAAAyG,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CAAAsD,EAAA0G,eAAA,aAAAjE,UAAA,CAAAkE,kBAAA,OAAAxL,EAAAA,EAAA,KAAAsH,UAAA,CAAAG,UAAA,GAAAgE,SAAA,CAAA5G,EAAA,WAAA8F,MAAA,CAAAiB,eAAA,CAAA/G,EAAA,KAAAw6C,EAAA,MAAAmT,GAAA,KAAAlrD,UAAA,CAAAzC,EAAAkC,EAAA/G,EAAA8D,GAAA,GAAAu7C,EAAAj9C,KAAA,CAAAgI,GAAA,WAAA+oD,GAAA9T,EAAAj9C,KAAA,SAAAi9C,EAAAj9C,KAAA,QAAA+wD,WAAA/lD,MAAAzL,YAAAkD,CAAA,CAAAkC,CAAA,QAAAA,GAAA,KAAAsG,kBAAA,CAAAxI,CAAA,iBAAAouD,GAAApuD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,EAAA9D,GAAA,CAAAwN,cAAAxN,EAAAwN,aAAA,CAAA1C,oBAAA9K,EAAA8K,mBAAA,EAAA9K,EAAAyH,UAAA,EAAA43C,EAAA,MAAAx6C,EAAA4I,kBAAA,CAAA1G,EAAAjD,GAAAkC,EAAA,OAAAnB,EAAA8I,kBAAA,CAAA0xC,EAAAr/C,GAAAA,EAAAyH,UAAA,GAAArF,KAAA,IAAA4D,EAAAoE,GAAA,WAAA8oD,GAAA,mBAAA7T,EAAA,WAAAl8C,KAAAC,SAAA,CAAA4C,GAAA,WAAAq5C,CAAA,OAAA6T,WAAA9lD,MAAAzL,YAAAkD,CAAA,QAAAA,EAAA,WAAA4qD,GAAA5qD,CAAA,EAAAuuD,GAAAvuD,CAAA,UAAA0qD,IAAA,eAAA6D,GAAAjF,GAAApjD,KAAA,GAAAqoD,EAAA,KAAAA,GAAA,KAAA1b,GAAA,IAAA1yC,IAAA,0CAAAquD,GAAA,IAAAvuD,IAAA,SAAA4zC,GAAA7zC,CAAA,kBAAAwuD,GAAA5wC,GAAA,CAAA5d,EAAA,KAAAyuD,GAAA7wD,OAAAquD,MAAA,EAAAC,UAAA,KAAAhsD,IAAA,SAAAF,CAAA,MAAA6yC,GAAA10B,GAAA,CAAAne,GAAA,8BAAAwuD,CAAAA,GAAAtuD,GAAA,CAAAF,EAAA,KAAA0uD,MAAA7a,EAAA,SAAAgJ,WAAAt0C,MAAAzL,YAAAkD,CAAA,QAAAA,GAAA,KAAAlC,IAAA,mBAAAssD,GAAAttD,YAAAkD,CAAA,OAAAmgB,KAAA,CAAAngB,CAAA,QAAAie,MAAAje,CAAA,MAAA7E,EAAA,IAAA8D,EAAA,wBAAAu7C,EAAA,uBAAAr5C,EAAA,WAAAtB,EAAA,EAAAA,EAAAG,EAAAjE,MAAA,CAAA8D,IAAA,IAAA26C,EAAArvB,IAAA,CAAAnrB,CAAA,CAAAH,EAAA,GAAAsB,EAAAwtD,GAAA,gBAAAh0D,EAAA,OAAAQ,CAAAA,EAAA8D,EAAAksB,IAAA,CAAAnrB,CAAA,CAAAH,EAAA,aAAA1E,EAAA,OAAAA,CAAA,IAAAR,GAAAwG,EAAA9G,IAAA,KAAAY,EAAA0e,SAAA,CAAAhf,GAAA,YAAAyvD,GAAAjpD,EAAA,QAAAkoD,WAAA9gD,MAAAzL,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,CAAAr5C,CAAA,QAAAhG,EAAAmC,IAAA,OAAA6hB,OAAA,2BAAAyvC,SAAA,CAAAzzD,EAAA,KAAAuJ,IAAA,CAAAzF,EAAA,KAAA8B,KAAA,EAAA8tD,UAAA7uD,EAAA8uD,aAAA5sD,EAAA6sD,eAAA5tD,EAAA6tD,OAAAxU,CAAA,OAAAyU,kBAAA,CAAA7E,GAAAnsC,KAAA,CAAAhf,EAAA,QAAAgf,MAAAje,CAAA,MAAAmB,EAAA,IAAAnB,EAAA,gBAAA7E,EAAA6E,EAAAkvD,SAAA,CAAAlvD,GAAAA,EAAAmvD,UAAA,sCAAAh0D,EAAA,gBAAA8D,EAAAe,CAAA,CAAA7E,EAAA,CAAAq/C,EAAA,CAAAv7C,EAAA,IAAA9D,EAAA,EAAA6E,EAAAjE,MAAA,4BAAAiE,CAAA,CAAA7E,EAAA,QAAA8D,EAAA,sBAAAY,EAAAZ,EAAAksB,IAAA,CAAAnrB,CAAA,CAAA7E,EAAA,OAAAR,EAAAsE,EAAAksB,IAAA,CAAAnrB,CAAA,CAAA7E,EAAA,OAAAgG,EAAA,KAAAlG,EAAA0e,SAAA,CAAA9Z,GAAA,IAAA5E,EAAA0e,SAAA,CAAAhf,GAAA,CAAA6/C,EAAAngD,IAAA,IAAA2F,EAAA7D,KAAA,CAAAhB,EAAA,EAAAA,EAAA,YAAA6E,CAAA,CAAA7E,EAAA,GAAAg0D,UAAA,4BAAAjtD,EAAA,oCAAAjD,EAAAiD,EAAAipB,IAAA,CAAAnrB,CAAA,CAAA7E,EAAA,OAAA0E,EAAAqC,EAAAipB,IAAA,CAAAnrB,CAAA,CAAA7E,EAAA,OAAAq/C,EAAAngD,IAAA,IAAA2F,EAAA7D,KAAA,CAAAhB,EAAA,EAAAA,EAAA,IAAAgG,EAAA,CAAAlC,EAAAY,EAAA,MAAAA,EAAA,sGAAAsrB,IAAA,CAAAlsB,GAAAtE,EAAA,kHAAAwwB,IAAA,CAAAlsB,GAAA2jD,EAAA,qHAAAz3B,IAAA,CAAAlsB,GAAA,GAAAY,EAAA,KAAAqC,EAAA/G,EAAA8D,EAAA,CAAAY,EAAA1D,KAAA,MAAAxB,EAAA,CAAAyK,KAAAlD,EAAAT,OAAA6lC,SAAAnsC,EAAA,aAAAkuD,GAAA1uD,EAAAsE,EAAAu7C,EAAAx6C,EAAA,OAAAmB,EAAA,IAAAxG,EAAA,KAAAuH,EAAA/G,EAAA8D,EAAAY,EAAA+iD,EAAA,CAAAjoD,EAAAwB,KAAA,MAAA2wD,EAAA,CAAA1nD,KAAAnG,EAAAwC,OAAA6lC,SAAAznC,EAAA,EAAApF,EAAA,CAAA20D,KAAAltD,EAAAsd,KAAA8nB,SAAAnsC,EAAA,aAAAkuD,GAAAyD,EAAAlK,EAAApI,EAAAx6C,EAAAvF,EAAA0G,EAAA,IAAAyhD,EAAA,KAAA1gD,EAAA/G,EAAA8D,EAAAY,EAAA,CAAA+iD,EAAAzmD,KAAA,MAAAxB,EAAAuH,EAAA4qD,EAAA,CAAA1nD,KAAAjK,EAAAsG,OAAA6lC,SAAAroC,EAAA,aAAAoqD,GAAAyD,EAAAjtD,EAAA26C,EAAAx6C,EAAArF,EAAAwG,EAAA,iBAAAkuD,SAAA,aAAAJ,kBAAA,CAAA9uC,KAAA,MAAA8uC,kBAAA,CAAA9uC,KAAA,CAAApkB,MAAA,QAAAuzD,mBAAA,aAAAL,kBAAA,CAAA9uC,KAAA,CAAArc,UAAA,aAAA5G,OAAA,QAAAitD,WAAA5hD,MAAAzL,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,eAAAiK,IAAA,CAAApF,EAAA,KAAA3C,GAAA,CAAA6E,EAAA,KAAAwC,IAAA,CAAAvJ,EAAAA,GAAA,MAAA8zD,kBAAA,CAAA7E,GAAAnsC,KAAA,CAAA9iB,EAAA,SAAA8iB,MAAAje,CAAA,CAAAkC,CAAA,MAAAjD,EAAAu7C,EAAA,IAAAr/C,EAAA6E,EAAA8D,QAAA,MAAA3I,EAAAo0D,QAAA,+BAAAvvD,EAAA7E,EAAAua,KAAA,kCAAA1V,EAAAjE,MAAA,aAAAkD,EAAAe,CAAA,aAAAA,EAAA7E,EAAA88B,KAAA,4BAAAj4B,GAAAA,EAAAjE,MAAA,eAAAkD,EAAAe,CAAA,IAAAi4B,KAAA,qBAAAuiB,EAAAlT,SAAAroC,EAAA,OAAAe,EAAA,iBAAAmB,EAAAe,EAAA0b,GAAA,CAAA48B,GAAA,gBAAAr5C,EAAA,IAAAgpD,GAAA3P,EAAAr5C,EAAAnB,EAAA0E,IAAA,WAAAvD,CAAAA,EAAA4oD,GAAAnsC,GAAA,CAAA48B,EAAA,MAAA2P,GAAA3P,EAAAr5C,EAAAnB,EAAA0E,IAAA,WAAA2qD,SAAA,KAAArvD,EAAA,cAAAA,CAAAA,EAAA,KAAAivD,kBAAA,YAAAjvD,EAAA,OAAAA,EAAAmgB,KAAA,MAAA8uC,kBAAA,CAAA9uC,KAAA,CAAApkB,MAAA,QAAAuzD,mBAAA,KAAAtvD,EAAA,cAAAA,CAAAA,EAAA,KAAAivD,kBAAA,YAAAjvD,EAAA,OAAAA,EAAAmgB,KAAA,CAAArc,UAAA,aAAAzG,GAAA,WAAA2tD,GAAAhrD,CAAA,CAAAkC,CAAA,EAAA2xC,GAAA,eAAAhvC,QAAA2qD,GAAA,sBAAAxvD,GAAA,IAAA7E,EAAAkuD,GAAAprC,KAAA,CAAAje,EAAA0E,IAAA,KAAAvJ,EAAA,OAAAA,CAAA,KAAA8D,EAAAkrD,GAAAlsC,KAAA,CAAAje,EAAAkC,GAAA,GAAAjD,EAAA,OAAAA,CAAA,IAAAe,EAAA0E,IAAA,MAAAxC,EAAA,CAAA0b,IAAA,SAAA1b,CAAA,CAAA/G,CAAA,8BAAAA,EAAA+G,EAAAotD,iBAAA,CAAAnvC,KAAA,aAAAhlB,EAAA+G,EAAAotD,iBAAA,CAAAnvC,KAAA,CAAAngB,EAAAsvD,iBAAA,CAAAnvC,KAAA,CAAApkB,MAAA,IAAA8mD,QAAAjlC,GAAA,IAAAqW,UAAA,UAAAj0B,EAAAsvD,iBAAA,CAAAlF,GAAAnsC,KAAA,CAAAje,EAAA0E,IAAA,MAAA+qD,MAAAzvD,EAAAkC,EAAA,QAAAlC,CAAA,KAAA8pD,GAAA,CAAAr7C,mBAAA,IAAAC,4BAAA,IAAAC,6BAAA,IAAAC,2BAAA,IAAAC,mBAAA,IAAAC,6BAAA,KAAAG,cAAA,IAAAC,iBAAA,KAAAC,iBAAA,KAAAC,cAAA,KAAAC,gBAAA,KAAAC,qBAAA,KAAAC,gBAAA,KAAAC,qBAAA,KAAAC,gBAAA,KAAAC,qBAAA,KAAAC,yBAAA,KAAAC,gBAAA,KAAAC,kBAAA,KAAAC,eAAA,KAAAC,oBAAA,KAAAC,qBAAA,KAAAC,4BAAA,KAAAC,8BAAA,KAAAC,uBAAA,KAAAC,gBAAA,KAAAqB,gBAAA,KAAAC,kBAAA,KAAAC,sBAAA,KAAAC,mBAAA,KAAAC,uBAAA,KAAAC,kBAAA,KAAAC,mBAAA,KAAAC,+BAAA,IAAAC,6BAAA,KAAAC,6BAAA,KAAAC,yBAAA,KAAAC,uBAAA,KAAAC,qBAAA,KAAAC,kBAAA,KAAAC,2BAAA,KAAAC,iBAAA,KAAAC,yBAAA,KAAAC,iBAAA,KAAAC,sBAAA,KAAAC,sBAAA,KAAAC,sBAAA,KAAAC,iCAAA,KAAAC,sBAAA,KAAAC,2BAAA,KAAAC,yBAAA,KAAAy8C,oBAAA,IAAAx8C,0BAAA,KAAAG,WAAA,KAAA02C,GAAA,IAAA9pD,IAAA,EAAA6pD,GAAAr7C,kBAAA,gDAAAq7C,GAAAp7C,2BAAA,0CAAAo7C,GAAAn7C,4BAAA,6DAAAm7C,GAAAl7C,0BAAA,2DAAAk7C,GAAAj7C,kBAAA,uDAAAi7C,GAAAh7C,4BAAA,0EAAAg7C,GAAA76C,aAAA,mCAAA66C,GAAA56C,gBAAA,uCAAA46C,GAAA36C,gBAAA,sCAAA26C,GAAA16C,aAAA,mCAAA06C,GAAAz6C,eAAA,sCAAAy6C,GAAAx6C,oBAAA,8CAAAw6C,GAAAv6C,eAAA,qCAAAu6C,GAAAt6C,oBAAA,2CAAAs6C,GAAAr6C,eAAA,qCAAAq6C,GAAAp6C,oBAAA,2CAAAo6C,GAAAn6C,wBAAA,gDAAAm6C,GAAAl6C,eAAA,qCAAAk6C,GAAAj6C,iBAAA,wCAAAi6C,GAAAh6C,cAAA,wCAAAg6C,GAAA/5C,mBAAA,0CAAA+5C,GAAA95C,oBAAA,2CAAA85C,GAAA75C,2BAAA,mDAAA65C,GAAA55C,6BAAA,qDAAA45C,GAAA35C,sBAAA,6CAAA25C,GAAA15C,eAAA,qCAAA05C,GAAAr4C,eAAA,uCAAAq4C,GAAAp4C,iBAAA,0CAAAo4C,GAAAn4C,qBAAA,+CAAAm4C,GAAAl4C,kBAAA,2CAAAk4C,GAAAj4C,sBAAA,gDAAAi4C,GAAAh4C,iBAAA,0CAAAg4C,GAAA/3C,kBAAA,2CAAA+3C,GAAA93C,8BAAA,+DAAA83C,GAAA73C,4BAAA,sDAAA63C,GAAA53C,4BAAA,0DAAA43C,GAAA33C,wBAAA,uCAAA23C,GAAA13C,sBAAA,qCAAA03C,GAAAz3C,oBAAA,sDAAAy3C,GAAAx3C,iBAAA,sCAAAw3C,GAAAv3C,0BAAA,qEAAAu3C,GAAAt3C,gBAAA,oCAAAs3C,GAAAr3C,wBAAA,uCAAAq3C,GAAAp3C,gBAAA,oCAAAo3C,GAAAn3C,qBAAA,0DAAAm3C,GAAAl3C,qBAAA,iEAAAk3C,GAAAj3C,qBAAA,qDAAAi3C,GAAAh3C,gCAAA,2DAAAg3C,GAAA/2C,qBAAA,6DAAA+2C,GAAA92C,0BAAA,4EAAA82C,GAAA72C,wBAAA,+DAAA62C,GAAA4F,mBAAA,+DAAA5F,GAAA52C,yBAAA,kEAAA42C,GAAAz2C,UAAA,mEACA;;;;;;;;;;;;;8EAauD,GACvD,IAAAs8C,GAAA,iBAAAA,CAAAA,GAAA/xD,OAAAC,MAAA,WAAAmC,CAAA,UAAAkC,EAAA/G,EAAA,EAAA8D,EAAAg1B,UAAAl4B,MAAA,CAAAZ,EAAA8D,EAAA9D,IAAA,QAAAq/C,KAAAt4C,EAAA+xB,SAAA,CAAA94B,EAAA,CAAAyC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAtH,EAAAs4C,IAAAx6C,CAAAA,CAAA,CAAAw6C,EAAA,CAAAt4C,CAAA,CAAAs4C,EAAA,SAAAx6C,CAAA,GAAApE,MAAA,KAAAq4B,UAAA,WAAA27B,GAAA5vD,CAAA,SAAAA,EAAAmb,WAAA,OAAA00C,GAAA,8CAAAC,GAAA,wBAAAC,GAAA/vD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,SAAA+G,aAAA8tD,OAAAhwD,EAAAmf,OAAA,CAAAjd,EAAA/G,GAAA+G,EAAAgU,MAAA,UAAAlW,CAAA,CAAAkC,CAAA,SAAAlC,EAAAmf,OAAA,CAAAjd,EAAA/G,EAAA,EAAA6E,EAAA,UAAAiwD,GAAAjwD,CAAA,CAAAkC,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,aAAAlC,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,YAAA/G,EAAA+G,EAAAguD,WAAA,CAAAjxD,EAAA,SAAA9D,EAAA00D,GAAA10D,CAAA,CAAAq/C,EAAAt4C,EAAAiuD,WAAA,CAAAhvD,EAAA,SAAAq5C,EAAAsV,GAAAtV,CAAA,CAAA36C,EAAAqC,EAAAgrC,SAAA,CAAAvyC,EAAA,SAAAkF,EAAA+vD,GAAA/vD,CAAA,CAAA+iD,EAAA1gD,EAAA+qB,SAAA,CAAA6/B,EAAA,SAAAlK,EAAA,IAAAA,CAAA,CAAAnoD,EAAAs1D,GAAAA,GAAA/vD,EAAAf,EAAA,UAAAkC,EAAA,MAAA2mC,EAAA,EAAAxT,EAAA75B,EAAAsB,MAAA,QAAAtB,EAAA+qB,MAAA,CAAAsiB,IAAAA,IAAA,YAAArtC,EAAA+qB,MAAA,CAAA8O,EAAA,IAAAA,IAAA,OAAA75B,EAAA0B,KAAA,CAAA2rC,EAAAxT,GAAA5e,KAAA,OAAA1Z,GAAA,CAAArB,GAAA2C,IAAA,CAAAwvD,EAAA,EAAA9sD,EAAA2vD,GAAA,CAAA1iC,UAAA,KAAA/qB,GAAA,OAAAkuD,GAAA,OAAAC,YAAArwD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,SAAA6E,EAAAlC,IAAA,CAAAwtD,IAAAtrD,EAAAlC,IAAA,gBAAAkC,EAAAvC,IAAA,oBAAA+tD,EAAA1lC,IAAA,CAAA3qB,EAAA,iBAAAqwD,EAAA7yC,EAAA,CAAAxd,EAAA,iBAAAqwD,EAAA/kC,EAAA,CAAAtrB,EAAA,kBAAAqwD,EAAAhlC,GAAA,CAAArrB,EAAA,kBAAAqwD,EAAAjlC,GAAA,CAAAprB,EAAA,kBAAAqwD,EAAA5yC,GAAA,CAAAzd,EAAA,kBAAAqwD,EAAAllC,GAAA,CAAAnrB,EAAA,kBAAAqwD,EAAAnlC,GAAA,CAAAlrB,EAAA,kBAAAqwD,EAAAzpC,GAAA,CAAA5mB,EAAA,kBAAAqwD,EAAArlC,GAAA,CAAAhrB,EAAA,kBAAAqwD,EAAAplC,GAAA,CAAAjrB,EAAA,mBAAAqwD,EAAAtlC,IAAA,CAAA/qB,EAAA,mBAAAqwD,EAAAvlC,IAAA,CAAA9qB,EAAA,oBAAAqwD,EAAA7uD,KAAA,CAAAxB,EAAA,qBAAAqwD,EAAA7lC,GAAA,CAAAxqB,EAAA,wBAAAqwD,EAAA9uD,SAAA,CAAAvB,EAAA,oBAAA6E,EAAAvC,IAAA,QAAA+tD,EAAA3lC,GAAA,CAAAuqC,GAAAC,WAAA,EAAAvyD,KAAA,OAAAL,KAAAuC,EAAAvC,IAAA,CAAAooB,GAAA,EAAA3jB,GAAA/G,EAAA,eAAA6E,EAAAvC,IAAA,QAAA+tD,EAAA1pC,MAAA,CAAAsuC,GAAAC,WAAA,EAAAvyD,KAAA,OAAAL,KAAAuC,EAAAvC,IAAA,CAAAqkB,MAAA,EAAA5f,GAAA/G,EAAA,gBAAA6E,EAAAvC,IAAA,MAAAwB,EAAAe,EAAAvC,IAAA,CAAA6yD,OAAA,aAAApuD,EAAA,UAAA26C,GAAA,uCAAArC,EAAAt4C,EAAAijB,MAAA,CAAAnlB,GAAAA,EAAAlC,IAAA,GAAAmB,GAAA,OAAAu7C,EAAAz+C,MAAA,WAAA8gD,GAAA,mBAAAv+C,KAAAC,SAAA,CAAAyB,GAAA,UAAAowD,GAAAG,aAAA,CAAA/V,CAAA,IAAAt4C,EAAA/G,EAAA,cAAA6E,EAAAvC,IAAA,MAAAwB,EAAAe,EAAAvC,IAAA,CAAAhC,KAAA,IAAA++C,EAAAx6C,EAAAvC,IAAA,CAAAhC,KAAA,IAAA0F,EAAAivD,GAAAC,WAAA,EAAAvyD,KAAA,OAAAL,KAAAwB,CAAA,EAAAiD,GAAA,OAAAspD,EAAA/vD,KAAA,CAAA0F,EAAAq5C,EAAAr/C,EAAA,qCAAA6E,EAAA,WAAAuwD,cAAAvwD,CAAA,CAAAkC,EAAA,GAAA/G,CAAA,gBAAA6E,EAAAvC,IAAA,CAAA+yD,IAAA,MAAAvxD,EAAAe,EAAAvC,IAAA,CAAAuY,MAAA,CAAAha,GAAA,CAAAgE,GAAAowD,GAAAC,WAAA,CAAArwD,EAAAkC,IAAA,OAAAspD,EAAA/uD,MAAA,CAAAwC,EAAA9D,EAAA,aAAA6E,EAAAvC,IAAA,CAAA+yD,IAAA,MAAAvxD,EAAAe,EAAAvC,IAAA,CAAAuqB,QAAA,CAAAhsB,GAAA,CAAAgE,GAAA,KAAA7E,EAAAmwD,IAAAtrD,EAAAlC,IAAA,cAAAkC,EAAAgW,MAAA,QAAAw1C,EAAA/uD,MAAA,IAAAtB,EAAA,KAAA8D,EAAAe,EAAAgW,MAAA,CAAAha,GAAA,CAAAgE,GAAA,KAAAA,EAAAuJ,cAAA,wEAAA6mD,GAAAC,WAAA,CAAArwD,EAAAkC,EAAA,UAAAspD,EAAA/uD,MAAA,CAAAwC,EAAA9D,EAAA,mBAAAA,EAAAqwD,EAAA3pC,QAAA,CAAA5iB,GAAAgV,SAAA,CAAA9Y,GAAAqwD,EAAA3pC,QAAA,CAAA5iB,EAAA9D,EAAA,mCAAA6E,EAAA,UAAA0pD,GAAA5sD,YAAAkD,CAAA,OAAAywD,GAAA,CAAAzwD,EAAA,KAAA0wD,QAAA,CAAAhH,GAAAiH,aAAA,CAAA3wD,EAAA,KAAAkC,EAAA,IAAAjC,GAAAD,CAAAA,EAAAq6C,YAAA,CAAAryC,OAAA,CAAAhI,GAAA,KAAA7E,EAAAy1D,GAAA,SAAA5wD,EAAAlC,IAAA,EAAAoE,EAAAhC,GAAA,CAAA7E,IAAAmB,MAAA,CAAArB,GAAA,CAAAwZ,OAAA,KAAA+7C,QAAA,CAAA9yC,GAAA,CAAA5d,EAAAlC,IAAA,EAAAA,KAAAkC,EAAAlC,IAAA,KAAAkC,EAAA8lD,KAAA,EAAA9lD,EAAA8lD,KAAA,CAAAxnC,OAAA,CAAAtiB,GAAA,CAAAgE,GAAA,KAAA7E,EAAAy1D,GAAA,QAAA5wD,EAAAlC,IAAA,EAAAoE,EAAAhC,GAAA,CAAA7E,IAAAmB,MAAA,CAAArB,GAAA,CAAAwZ,OAAA,KAAA+7C,QAAA,CAAA9yC,GAAA,CAAA5d,EAAAlC,IAAA,EAAAA,KAAAkC,EAAAlC,IAAA,UAAA+yD,cAAA,CAAA3uD,CAAA,CAAA1F,OAAAwD,CAAA,CAAAkC,CAAA,cAAA4uD,OAAA,UAAA9wD,EAAAkC,EAAA,CAAA6uD,YAAA/wD,CAAA,CAAAkC,CAAA,cAAA4uD,OAAA,SAAA9wD,EAAAkC,EAAA,CAAA4uD,QAAA5uD,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA2Q,EAAA5vD,MAAA,CAAAknB,KAAA,MAAAthB,EAAAmqD,IAAAnwD,GAAA0E,EAAA,KAAA6wD,QAAA,CAAA9yC,GAAA,CAAAzc,GAAA,IAAAtB,EAAA,+BAAAsB,EAAA,OAAAxG,EAAAkF,EAAArD,MAAA,CAAAyC,EAAAu7C,GAAAoI,EAAApI,EAAAr+C,KAAA,GAAAxB,GAAA,OAAAwwD,EAAA5vD,MAAA,CAAA01B,MAAA,EAAA2/B,GAAA1uD,EAAA/G,GAAAynD,EAAA,SAAA+N,cAAA3wD,CAAA,MAAAkC,EAAA,CAAAlC,EAAA8lD,KAAA,CAAA9lD,EAAA8lD,KAAA,CAAAxnC,OAAA,KAAAtiB,GAAA,CAAAkG,GAAA,KAAA/G,EAAA+G,EAAAmC,IAAA,CAAArI,GAAA,CAAAkG,GAAA,KAAA/G,EAAA8D,EAAA,OAAAmxD,GAAAC,WAAA,CAAAnuD,EAAAvG,MAAAud,IAAA,YAAA/d,CAAAA,EAAA6E,EAAA+C,QAAA,YAAA5H,EAAAA,EAAA,aAAA8D,CAAAA,EAAAe,EAAAgxD,KAAA,YAAA/xD,EAAAA,EAAA,QAAAA,EAAAqsD,IAAAppD,EAAApE,IAAA,SAAAmB,EAAAusD,EAAA/uD,MAAA,CAAAtB,EAAA8D,GAAA,GAAAgyB,MAAA,CAAAjxB,EAAAq6C,YAAA,CAAAr+C,GAAA,CAAAkG,GAAA,KAAA/G,EAAA+G,EAAAmC,IAAA,CAAArI,GAAA,CAAAkG,GAAA,KAAA/G,EAAA8D,EAAA,OAAAmxD,GAAAC,WAAA,CAAAnuD,EAAAvG,MAAAud,IAAA,YAAA/d,CAAAA,EAAA6E,EAAA+C,QAAA,YAAA5H,EAAAA,EAAA,aAAA8D,CAAAA,EAAAe,EAAAgxD,KAAA,YAAA/xD,EAAAA,EAAA,QAAAA,EAAAqsD,IAAAppD,EAAApE,IAAA,SAAAmB,EAAAusD,EAAA/uD,MAAA,CAAAtB,EAAA8D,GAAA,eAAAgB,IAAAiC,EAAA,CAAA0R,OAAA1R,CAAA,CAAA/G,EAAA,wBAAA+G,GAAAA,CAAAA,EAAA,QAAA/G,EAAAgwD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAhX,EAAA,OAAA7G,IAAAuY,MAAA,CAAA1R,EAAA,MAAAjD,EAAA5D,IAAAmB,MAAA,CAAA0F,EAAA/F,KAAA,OAAAq+C,EAAAt4C,EAAA/F,KAAA,IAAAgF,EAAA,KAAA0vD,cAAA,CAAAjzC,GAAA,CAAA3e,GAAA,OAAAkC,EAAA,CAAA5E,KAAA4E,EAAAwT,MAAA,CAAAf,MAAA,CAAA4mC,GAAA18C,KAAAqD,EAAArD,IAAA,OAAAmzD,OAAAjxD,CAAA,CAAAkC,CAAA,SAAAgvD,GAAAD,MAAA,CAAAjxD,EAAAkC,EAAA,KAAAuuD,GAAA,SAAAS,GAAA,OAAAD,OAAAjxD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,EAAA9D,EAAAk/C,YAAA,CAAAl1B,MAAA,CAAAjjB,GAAAlC,EAAAlC,IAAA,GAAAoE,EAAApE,IAAA,iBAAAmB,EAAA,OAAA4F,QAAA9D,KAAA,uCAAAy5C,EAAAv7C,EAAAoF,IAAA,CAAArI,GAAA,CAAAkG,GAAA,EAAApE,KAAAoE,EAAApE,IAAA,CAAAL,KAAAyzD,GAAAC,aAAA,CAAAjvD,EAAAzE,IAAA,EAAAlB,KAAA20D,GAAAE,aAAA,CAAAlvD,EAAAlC,EAAAzD,IAAA,CAAA2F,EAAApE,IAAA,EAAA3C,EAAA61D,KAAA,KAAA7vD,EAAA+vD,GAAAG,kBAAA,CAAApyD,EAAA8D,QAAA,SAAAsB,KAAAm2C,EAAAz3C,SAAAb,EAAAlG,GAAA,EAAAgE,EAAAkC,IAAAA,EAAAf,EAAApF,MAAA,EAAA+B,KAAAqD,CAAA,CAAAe,EAAA,CAAApE,IAAA,IAAAkC,CAAA,GAAAlC,KAAA,UAAAkC,CAAA,WAAAmxD,cAAAnxD,CAAA,sBAAAA,EAAA,OAAAA,CAAA,YAAAA,EAAA,kBAAAmxD,aAAA,CAAAnxD,EAAA6lB,GAAA,mBAAA7lB,EAAA,qBAAAmxD,aAAA,CAAAnxD,EAAA8hB,MAAA,oBAAA9hB,EAAA,OAAAA,EAAAswD,OAAA,cAAAtwD,EAAA,eAAAA,EAAAvE,KAAA,QAAAuE,EAAAvE,KAAA,wCAAAuE,EAAA,UAAAoxD,cAAApxD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,sBAAA6E,EAAAvC,IAAA,QAAAyE,EAAA4B,QAAA,MAAA9D,EAAAvC,IAAA,CAAA8L,cAAA,kBAAArH,EAAAlG,GAAA,CAAAkG,GAAA,KAAAkvD,aAAA,EAAAtzD,KAAA,GAAAL,KAAAuC,EAAAvC,IAAA,CAAAooB,GAAA,EAAA3jB,IAAA5E,IAAA,cAAA0C,EAAAvC,IAAA,CAAA8L,cAAA,yBAAArH,EAAA,YAAAkvD,aAAA,EAAAtzD,KAAA,GAAAL,KAAAuC,EAAAvC,IAAA,CAAAqkB,MAAA,EAAA5f,EAAA/G,EAAA,IAAA6E,EAAAvC,IAAA,CAAA8L,cAAA,yBAAApO,EAAA,mDAAA8D,EAAA9D,EAAAgqB,MAAA,CAAAjjB,GAAAA,EAAApE,IAAA,GAAAkC,EAAAvC,IAAA,CAAA6yD,OAAA,SAAArxD,EAAAlD,MAAA,gCAAAiE,EAAAvC,IAAA,CAAA6yD,OAAA,WAAAY,GAAAI,oBAAA,CAAAryD,CAAA,IAAAiD,EAAA/G,EAAA,wBAAAm2D,qBAAAtxD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,gBAAA6E,EAAAvC,IAAA,CAAA+yD,IAAA,MAAAvxD,EAAAe,EAAAvC,IAAA,YAAAG,OAAAiE,IAAA,CAAAK,GAAAlG,GAAA,CAAAgE,GAAA,KAAAw6C,EAAAv7C,EAAA+W,MAAA,CAAAmP,MAAA,CAAAjjB,GAAAA,EAAApE,IAAA,GAAAkC,EAAA,gBAAAw6C,EAAA,0CAAAx6C,EAAA,KAAAkxD,GAAAE,aAAA,CAAA5W,EAAAt4C,CAAA,CAAAlC,EAAA,CAAA7E,EAAA,GAAAmC,IAAA,mBAAA0C,EAAAvC,IAAA,CAAAuqB,QAAA,CAAAjsB,MAAA,eAAAiE,EAAAvC,IAAA,CAAAuqB,QAAA,IAAAlqB,IAAA,MAAAmB,EAAAe,EAAAvC,IAAA,CAAAuqB,QAAA,CAAAwyB,EAAA58C,OAAAiE,IAAA,CAAAK,EAAA,IAAAf,EAAAe,CAAA,CAAAs4C,EAAA,CAAA36C,EAAAjC,OAAAiE,IAAA,CAAAV,GAAAnF,GAAA,CAAAgE,GAAA,KAAAkC,EAAA,IAAArC,EAAAsB,CAAA,CAAAnB,EAAA,CAAArF,EAAA,OAAAuH,CAAAA,EAAAjD,CAAA,CAAAu7C,EAAA,YAAAt4C,EAAA,OAAAA,EAAAijB,MAAA,CAAAjjB,GAAAA,EAAApE,IAAA,GAAAkC,EAAA,gBAAArF,EAAA,6CAAAqF,EAAA,KAAAkxD,GAAAE,aAAA,CAAAz2D,EAAAkF,EAAA1E,EAAA,GAAAmC,IAAA,OAAA3C,EAAA2wD,IAAA9Q,EAAA,CAAAt1B,WAAA,gBAAArlB,EAAA9D,MAAA,CAAApB,EAAA,GAAAA,EAAA,KAAAkF,EAAA,wDAAAwxD,mBAAArxD,CAAA,CAAAkC,CAAA,SAAAlC,EAAAhE,GAAA,CAAAgE,GAAA,KAAA7E,EAAA,SAAA6E,CAAA,MAAAkC,EAAAlC,EAAAmf,OAAA,0BAAAjd,EAAAsjB,MAAA,IAAA9G,WAAA,GAAAxc,EAAA/F,KAAA,KAAA6D,EAAAlC,IAAA,KAAAkC,EAAAuJ,cAAA,kBAAAtK,EAAAiD,EAAA,GAAAA,EAAA,KAAA/G,EAAA,EAAAA,CAAA,QAAA+1D,GAAAG,kBAAA,CAAArxD,EAAA+C,QAAA,CAAA9D,EAAA,WAAAe,CAAA,CAAAlC,KAAAoE,EAAA,GAAAA,EAAA,KAAA/G,EAAA,EAAAA,CAAA,IAAAsnD,IAAA,aAAAmO,GAAA1uD,CAAA,CAAA/G,CAAA,MAAA8D,EAAA,IAAAu7C,EAAA,GAAAt4C,EAAA,aAAAjD,GAAAA,CAAAA,EAAA,IAAAgxD,GAAA90D,EAAAw0D,GAAA,CAAA1iC,UAAA,KAAAhuB,GAAA,WAAAksD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAqyC,EAAAgG,MAAA,CAAAC,MAAA,CAAAhX,IAAAr+C,KAAA,eAAAs1D,GAAAzxD,CAAA,CAAAkC,CAAA,iBAAAA,EAAAzE,IAAA,CAAA+yD,IAAA,CAAA30D,KAAAqrC,GAAA,IAAAhlC,EAAAzE,IAAA,CAAAuqB,QAAA,CAAAhsB,GAAA,CAAAkG,GAAA,SAAAA,EAAA8T,MAAA,GAAA9T,EAAA8T,MAAA,CAAAha,GAAA,CAAAkG,GAAA,qBAAAA,GAAA,WAAAA,CAAAA,EAAA,+DAAAwvD,GAAA1xD,EAAAkC,EAAAzE,IAAA,IAAAyY,MAAA,EAAAlW,EAAAkC,IAAAlC,EAAAkC,EAAA,cAAAA,EAAAzE,IAAA,CAAAuY,MAAA,GAAA9T,EAAAzE,IAAA,CAAAuY,MAAA,CAAAha,GAAA,CAAAkG,GAAAwvD,GAAA1xD,EAAAkC,EAAAzE,IAAA,GAAAyY,MAAA,EAAAlW,EAAAkC,IAAAlC,EAAAkC,EAAA,YAAAwvD,GAAA1xD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA8D,EAAA,OAAAiD,GAAA,uPAAAA,EAAA,uBAAAA,EAAA,SAAAwvD,GAAA1xD,EAAAkC,EAAA4f,MAAA,iBAAA5f,EAAA,SAAAwvD,GAAA1xD,EAAAkC,EAAAkgB,OAAA,iBAAAlgB,EAAA,KAAAs4C,EAAA,OAAAv7C,CAAAA,EAAA,OAAA9D,CAAAA,EAAA6E,EAAAgxD,KAAA,YAAA71D,EAAA,OAAAA,EAAAgqB,MAAA,CAAAnlB,GAAAA,EAAAlC,IAAA,GAAAoE,EAAAouD,OAAA,aAAArxD,EAAAA,EAAA,UAAAu7C,EAAAz+C,MAAA,WAAA8gD,GAAA,mBAAAv+C,KAAAC,SAAA,CAAA2D,GAAA,UAAAuvD,GAAAzxD,EAAAw6C,CAAA,kBAAAt4C,EAAA,KAAA/G,EAAA+G,EAAAzG,KAAA,IAAAwD,EAAAiD,EAAAzG,KAAA,WAAAi2D,GAAA1xD,EAAA7E,GAAA8D,CAAA,6BAAAX,KAAAC,SAAA,CAAA2D,GAAA,QAAAinD,GAAA,QAAAI,GAAAzsD,YAAAkD,CAAA,cAAAA,EAAA+C,QAAA,kBAAA4uD,cAAA,KAAA1xD,GAAA,MAAAiC,EAAAlC,EAAA+C,QAAA,CAAA/G,GAAA,CAAAkG,GAAA,CAAAA,EAAApE,IAAA,CAAAsyD,GAAAG,aAAA,CAAAruD,EAAAlC,EAAAgxD,KAAA,SAAAW,cAAA,KAAA1xD,IAAAiC,GAAA,KAAAuuD,GAAA,CAAAzwD,CAAA,OAAAxD,OAAA0F,CAAA,CAAA/G,CAAA,MAAA8D,EAAAksD,EAAA5vD,MAAA,CAAAknB,KAAA,MAAA+3B,EAAA,KAAAmX,cAAA,CAAA/zC,GAAA,CAAA1b,GAAA,IAAAs4C,EAAA,gCAAAt4C,EAAA,OAAAf,EAAAq5C,EAAAh+C,MAAA,CAAArB,EAAA8D,GAAAY,EAAAZ,EAAA9C,KAAA,GAAAgF,GAAAxG,EAAA4uD,GAAAqI,oBAAA,CAAA1vD,GAAA,OAAAipD,EAAA5vD,MAAA,CAAA01B,MAAA,EAAAt2B,EAAAkF,EAAA,EAAA+T,OAAA5T,CAAA,CAAAkC,CAAA,KAAAqnD,GAAAqI,oBAAA,CAAA5xD,GAAA6xD,OAAA,CAAA3vD,EAAA/F,KAAA,gEAAA21D,eAAA,CAAA9xD,EAAAkC,EAAA,CAAA4vD,gBAAA9xD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA+G,EAAA/F,KAAA,IAAA8C,EAAA,KAAA0yD,cAAA,CAAA/zC,GAAA,CAAA5d,GAAA,IAAAf,EAAA,gCAAAe,EAAA,UAAAf,EAAA2U,MAAA,CAAAzY,EAAA,CAAA42D,OAAA7vD,CAAA,CAAA/G,CAAA,MAAA8D,EAAAsqD,GAAAqI,oBAAA,CAAA1vD,GAAA,OAAA4R,OAAA,EAAAoL,MAAA7jB,IAAAmB,MAAA,CAAArB,EAAAgwD,EAAA5vD,MAAA,CAAA01B,MAAA,EAAAhyB,EAAA9D,EAAA,EAAA8D,CAAA,GAAAvD,KAAAsE,CAAA,MAAAkC,EAAA,iBAAAA,CAAAA,EAAAuvD,GAAA,KAAAhB,GAAA,CAAAzwD,EAAA,YAAAkC,EAAAA,EAAA,UAAA0vD,qBAAA1vD,CAAA,SAAAipD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAqyC,EAAAgG,MAAA,CAAAC,MAAA,YAAAlG,IAAAppD,EAAA,CAAAgjB,WAAA,SAAA/oB,KAAA,aAAAstD,GAAA3sD,YAAAkD,CAAA,cAAAA,EAAAgyD,MAAA,kBAAAC,OAAA,KAAAhyD,GAAA,MAAAiC,EAAAlC,EAAAgyD,MAAA,CAAAh2D,GAAA,CAAAkG,GAAA,KAAA/G,EAAA,CAAA2C,KAAAoE,EAAApE,IAAA,CAAAL,KAAA,CAAA+yD,KAAA,SAAAx6C,OAAA9T,EAAA8T,MAAA,CAAAha,GAAA,CAAAgE,GAAA,EAAAlC,KAAAkC,EAAAlC,IAAA,CAAAL,KAAAuC,EAAAvC,IAAA,aAAAyE,EAAApE,IAAA,CAAAsyD,GAAAG,aAAA,CAAAp1D,EAAA6E,EAAAgxD,KAAA,UAAAiB,OAAA,KAAAhyD,IAAAiC,GAAA,KAAAgwD,cAAA,KAAAjyD,IAAA,SAAAD,EAAAgyD,MAAA,IAAAhyD,EAAAgyD,MAAA,CAAAh2D,GAAA,CAAAgE,GAAA,CAAAorD,EAAAqB,aAAA,CAAAhC,GAAAzqD,EAAAlC,IAAA,GAAAkC,EAAAlC,IAAA,IAAA8V,OAAA1R,CAAA,MAAA/G,EAAA,IAAAA,EAAAgwD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAkyC,EAAAY,WAAA,CAAA9pD,GAAA,OAAAlC,EAAA,iBAAAf,EAAAmsD,EAAAqB,aAAA,CAAAtxD,EAAAgB,KAAA,OAAAq+C,EAAA,KAAA0X,cAAA,CAAAt0C,GAAA,CAAA3e,GAAA,YAAAu7C,EAAA,gBAAAr5C,EAAA,KAAA8wD,OAAA,CAAAr0C,GAAA,CAAA48B,GAAA,IAAAr5C,EAAA,8BAAAq5C,EAAA,UAAAj+C,KAAA4E,EAAAyS,MAAA,CAAAzY,EAAAgB,KAAA,KAAA2B,KAAA08C,CAAA,YAAAiQ,GAAAvoD,CAAA,SAAAipD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAqyC,EAAAgG,MAAA,CAAAC,MAAA,UAAAtvD,EAAA,IAAA/F,KAAA,YAAAwtD,GAAA7sD,YAAAkD,CAAA,cAAAA,EAAA8lD,KAAA,4CAAAnxC,MAAA,CAAAy7C,GAAAG,aAAA,CAAAvwD,EAAA8lD,KAAA,CAAArpD,MAAA,CAAAuD,EAAAgxD,KAAA,QAAAx0D,OAAA0F,CAAA,CAAA/G,CAAA,MAAA8D,EAAAksD,EAAA5vD,MAAA,CAAAknB,KAAA,MAAA+3B,EAAA,KAAA7lC,MAAA,CAAAnY,MAAA,CAAArB,EAAA8D,GAAAkC,EAAA,MAAA2pD,GAAA5oD,GAAArC,EAAAZ,EAAA9C,KAAA,GAAAq+C,GAAA,OAAA2Q,EAAA5vD,MAAA,CAAA01B,MAAA,EAAA9vB,EAAAtB,EAAA,EAAA+T,OAAA5T,CAAA,MAAAkC,EAAAlC,EAAA7D,KAAA,gBAAAwY,MAAA,CAAAf,MAAA,CAAA1R,EAAA,iBAAA4oD,GAAA5oD,CAAA,MAAA/G,EAAA04C,GAAA,oDAAAsX,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAqyC,EAAAgG,MAAA,CAAAC,MAAA,IAAAr2D,EAAA,GAAA+G,EAAA,IAAA/F,KAAA,YAAAg2D,GAAAr1D,YAAAkD,CAAA,cAAAA,EAAAgxD,KAAA,kBAAAoB,WAAA,KAAAnyD,GAAA,MAAAiC,EAAAlC,EAAAgxD,KAAA,CAAAh1D,GAAA,CAAAkG,GAAA,CAAAA,EAAApE,IAAA,CAAAsyD,GAAAG,aAAA,CAAAruD,EAAAlC,EAAAgxD,KAAA,SAAAoB,WAAA,KAAAnyD,IAAAiC,GAAA,KAAAuuD,GAAA,CAAAzwD,CAAA,CAAAxD,OAAA0F,CAAA,CAAA/G,CAAA,MAAA8D,EAAAksD,EAAA5vD,MAAA,CAAAknB,KAAA,MAAA+3B,EAAA,KAAA4X,WAAA,CAAAx0C,GAAA,CAAA1b,GAAA,IAAAs4C,EAAA,6BAAAt4C,EAAA,OAAAf,EAAAq5C,EAAAh+C,MAAA,CAAArB,EAAA8D,GAAA,OAAAA,EAAA9C,KAAA,GAAAgF,EAAA,CAAAyS,OAAA5T,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAAi3D,WAAA,CAAAx0C,GAAA,CAAA5d,GAAA,IAAA7E,EAAA,6BAAA6E,EAAA,UAAA7E,EAAAyY,MAAA,CAAA1R,EAAA,QAAAsnD,GAAA1sD,YAAAkD,CAAA,OAAAwmD,WAAA,KAAAkD,GAAA1pD,GAAA,KAAA+C,QAAA,KAAAwmD,GAAAvpD,GAAA,KAAAgyD,MAAA,KAAAvI,GAAAzpD,GAAAA,EAAA8lD,KAAA,QAAAA,KAAA,KAAA6D,GAAA3pD,EAAA,OAAAgxD,KAAA,KAAAmB,GAAAnyD,EAAA,MAAAqyD,GAAA,oBAAAppD,WAAAA,WAAA,oBAAAC,OAAAA,OAAA,SAAA1O,EAAA2O,CAAA,CAAA3O,EAAA2O,CAAA,qBAAA/O,KAAAA,KAAA,YAAAk4D,GAAAtyD,CAAA,SAAAA,GAAAA,EAAAqJ,UAAA,EAAAzL,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAxJ,EAAA,WAAAA,EAAA2hB,OAAA,CAAA3hB,CAAA,OAAAuyD,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,MAAAuR,OAAAC,SAAA,CAAA1T,GAAA,gDAAAuT,IAAA,CAAAvT,EAAA,KAAAwT,QAAA,CAAAtR,CAAA,CAAAyR,uBAAA,UAAAC,OAAA5T,CAAA,CAAAkC,CAAA,oCAAA1F,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,oCAAA6Y,QAAAhU,CAAA,CAAAkC,CAAA,YAAAqR,IAAA,oDAAAA,IAAA,CAAAU,UAAAjU,CAAA,MAAAkC,EAAAtE,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,SAAA1L,OAAAC,MAAA,CAAAqE,EAAA,MAAAA,EAAAsR,QAAA,CAAAxT,EAAAkC,CAAA,CAAAiS,UAAAnU,CAAA,QAAAwyD,GAAAD,EAAA,OAAAE,WAAAF,GAAA99C,SAAA,kDAAAi+C,WAAAD,GAAA31D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA6E,CAAAA,aAAAuyD,EAAA,yDAAArwD,EAAAA,EAAA,WAAAuR,OAAAC,SAAA,CAAAxR,GAAA,6DAAAlC,EAAAuT,IAAA,CAAApY,GAAA6E,EAAAwT,QAAA,OAAAmB,MAAA,CAAA3U,EAAA,KAAA8T,MAAA,CAAA5R,CAAA,CAAAuS,SAAA,aAAAE,MAAA,YAAAg+C,IAAA,KAAAh+C,MAAA,YAAAi+C,EAAA,CAAAh/C,OAAA5T,CAAA,CAAAkC,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,QAAAyS,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,EAAA,KAAA4R,MAAA,EAAAtX,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,QAAAwZ,MAAA,CAAAnY,MAAA,CAAAwD,EAAAkC,EAAA/G,EAAA,KAAA2Y,MAAA,SAAA6+C,WAAAJ,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,WAAAlC,EAAAkC,GAAA,OAAAqR,IAAA,kDAAAK,OAAA5T,CAAA,CAAAkC,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,GAAAlC,EAAA8U,UAAA,CAAA5S,EAAA,KAAAqR,IAAA,EAAA/W,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,GAAA+G,EAAA6S,WAAA,CAAA/U,EAAA7E,EAAA,KAAAoY,IAAA,OAAAA,IAAA,QAAAq/C,WAAAL,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,WAAAlC,EAAAkC,GAAA,OAAAqR,IAAA,kDAAAK,OAAA5T,CAAA,CAAAkC,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,GAAAlC,EAAAgV,UAAA,CAAA9S,EAAA,KAAAqR,IAAA,EAAA/W,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,kBAAAA,GAAAA,CAAAA,EAAA,GAAA+G,EAAA+S,WAAA,CAAAjV,EAAA7E,EAAA,KAAAoY,IAAA,OAAAA,IAAA,MAAAs/C,GAAAh3D,WAAA,SAAAi3D,GAAA9yD,CAAA,MAAAkC,EAAArG,KAAAwZ,KAAA,CAAArV,EAAA6yD,IAAA,OAAAz9C,KAAAlT,EAAAoT,KAAAtV,EAAAkC,EAAA2wD,EAAA,WAAAE,GAAA/yD,CAAA,CAAAkC,CAAA,SAAAlC,EAAA6yD,GAAA3wD,CAAA,OAAA8wD,WAAAT,GAAAz1D,YAAAkD,CAAA,UAAAA,EAAA,CAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA/G,EAAA6E,EAAAyV,YAAA,CAAAvT,GAAA,OAAA6wD,GAAA/yD,EAAAyV,YAAA,CAAAvT,EAAA,GAAA/G,EAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA8D,EAAA6zD,GAAA9yD,GAAA,OAAAkC,EAAAyT,aAAA,CAAA1W,EAAAqW,IAAA,CAAAna,GAAA+G,EAAAyT,aAAA,CAAA1W,EAAAmW,IAAA,CAAAja,EAAA,YAAA83D,WAAAV,GAAAz1D,YAAAkD,CAAA,UAAAA,EAAA,CAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA/G,EAAA6E,EAAAyV,YAAA,CAAAvT,GAAA,OAAA6wD,GAAA/yD,EAAA6V,WAAA,CAAA3T,EAAA,GAAA/G,EAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA8D,EAAA6zD,GAAA9yD,GAAA,OAAAkC,EAAAyT,aAAA,CAAA1W,EAAAqW,IAAA,CAAAna,GAAA+G,EAAA4T,YAAA,CAAA7W,EAAAmW,IAAA,CAAAja,EAAA,YAAAisC,WAAAmrB,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAAQ,MAAA6D,OAAA,CAAAQ,IAAA,CAAAA,EAAAkW,MAAA,EAAAlW,EAAAkC,IAAAlC,GAAAkC,aAAAqwD,GAAA,wEAAArwD,KAAA,kBAAAA,GAAA,SAAA/G,GAAAA,CAAAA,EAAA+G,EAAAA,EAAA,QAAAlC,GAAA,KAAAkC,EAAAqR,IAAA,WAAArR,EAAAsR,QAAA,yEAAAvU,EAAA,OAAAA,EAAAe,EAAAkW,MAAA,EAAAlW,EAAAkC,IAAAlC,EAAAkC,EAAA8R,OAAA,YAAAhU,EAAA,QAAAf,EAAAiD,GAAA,KAAA8T,MAAA,CAAAhW,EAAA,KAAAiW,cAAA,GAAA9a,CAAA,CAAA6Y,QAAAhU,CAAA,CAAAkC,CAAA,aAAAqR,IAAA,aAAAA,IAAA,UAAArR,GAAAA,CAAAA,EAAA,OAAA/G,EAAA,MAAAA,EAAA,KAAA6a,MAAA,CAAAE,MAAA,EAAA/a,EAAA8D,IAAA,KAAAu7C,EAAAv7C,EAAA+U,OAAA,CAAAhU,EAAAkC,GAAA,OAAAA,GAAAs4C,EAAAr/C,EAAAq/C,CAAA,WAAAx6C,EAAA,+CAAA7E,CAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA/G,EAAA,KAAAwY,qBAAA,WAAA1U,KAAA,KAAA+W,MAAA,aAAA/W,EAAAuU,QAAA,EAAArY,CAAAA,CAAA,CAAA8D,EAAAuU,QAAA,EAAAvU,EAAA2U,MAAA,CAAA5T,EAAAkC,EAAA,EAAAA,GAAAjD,EAAA+U,OAAA,CAAAhU,EAAAkC,GAAA,KAAA+T,cAAA,EAAAjW,EAAAjE,MAAA,GAAAmG,CAAA,cAAA/G,CAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA8D,EAAA9D,EAAAq/C,EAAA,EAAAr5C,EAAA,UAAAlC,KAAA,KAAA+W,MAAA,MAAAnW,EAAAZ,EAAAsU,IAAA,IAAApS,EAAA,EAAAtB,EAAAA,EAAA,WAAAZ,EAAAuU,QAAA,MAAAgnC,EAAAx6C,CAAA,CAAAf,EAAAuU,QAAA,WAAAgnC,GAAAr5C,CAAAA,EAAAlC,EAAAzC,MAAA,CAAAg+C,EAAAt4C,EAAA/G,GAAA,EAAA0E,GAAAA,CAAAA,EAAAZ,EAAA+U,OAAA,CAAA9R,EAAA/G,EAAA,GAAAq/C,EAAAr/C,EAAAA,GAAA0E,CAAA,QAAA26C,EAAAr5C,EAAAlC,CAAA,CAAAkV,UAAAnU,CAAA,MAAAkC,EAAA,KAAAyR,qBAAA,WAAAxY,KAAA,KAAA6a,MAAA,UAAA7a,EAAAqY,QAAA,IAAAxT,EAAAjE,MAAA,EAAAmG,CAAAA,CAAA,CAAA/G,EAAAqY,QAAA,EAAAxT,EAAA2W,KAAA,WAAAzU,CAAA,CAAA0U,UAAA5W,CAAA,sBAAAA,EAAA,mDAAAkC,KAAA,KAAA8T,MAAA,IAAA9T,EAAAsR,QAAA,GAAAxT,EAAA,OAAAkC,CAAA,CAAA2U,SAAA7W,CAAA,sBAAAA,EAAA,+CAAAkC,EAAA,UAAA/G,KAAA,KAAA6a,MAAA,KAAA7a,EAAAqY,QAAA,GAAAxT,EAAA,OAAAkC,CAAA,GAAA/G,EAAAoY,IAAA,CAAArR,EAAA,MAAAA,GAAAA,CAAAA,GAAA/G,EAAAoY,IAAA,UAAA2/C,GAAAp2D,YAAAkD,CAAA,OAAAwT,QAAA,CAAAxT,CAAA,CAAA4T,QAAA,+CAAApX,QAAA,sDAAA22D,WAAAD,GAAAp2D,YAAAkD,CAAA,CAAAkC,CAAA,MAAAlC,CAAAA,aAAAyyD,IAAAzyD,EAAAyU,OAAA,+EAAAvS,GAAAlC,EAAAwT,QAAA,kBAAAmB,MAAA,CAAA3U,CAAA,CAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,cAAAyS,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,EAAA,CAAA1F,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,cAAAwZ,MAAA,CAAAnY,MAAA,CAAAwD,EAAAkC,EAAA/G,EAAA,QAAAi4D,WAAAb,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,EAAAe,aAAA2yD,IAAA3yD,aAAA4yD,GAAA,GAAA3zD,EAAAe,EAAA,IAAAmzD,GAAA,IAAAT,GAAA1yD,SAAA,GAAAA,aAAAyyD,IAAAzyD,EAAAyU,OAAA,GAAAzU,EAAA,IAAAmzD,GAAAnzD,QAAA,IAAAA,CAAAA,aAAAkzD,EAAA,kGAAAhxD,GAAAA,CAAAA,EAAA,eAAAA,GAAAA,aAAAqwD,EAAA,sEAAArwD,EAAA,MAAAA,EAAAqR,IAAA,+DAAArR,EAAAsR,QAAA,EAAAtR,CAAAA,EAAAA,EAAA+R,SAAA,iBAAAumC,EAAA,EAAAt4C,CAAAA,GAAA,GAAAs4C,CAAAA,EAAAt4C,EAAAqR,IAAA,GAAAtU,GAAAu7C,CAAAA,GAAAx6C,EAAA2U,MAAA,CAAApB,IAAA,QAAAinC,EAAAr/C,GAAA,KAAAic,aAAA,CAAApX,EAAA,KAAAqX,uBAAA,CAAApY,EAAA,KAAAiY,aAAA,CAAAhV,EAAA,KAAAoV,QAAA,QAAAnW,EAAA,KAAAqW,uBAAA,CAAAC,IAAA,YAAAC,gBAAA,UAAA1X,CAAA,SAAAmB,EAAAnB,EAAA,OAAA2X,sBAAA,UAAA3X,CAAA,EAAAmB,EAAAnB,EAAAyX,IAAA,QAAAzD,QAAAhU,CAAA,CAAAkC,CAAA,aAAAqR,IAAA,aAAAA,IAAA,UAAArR,GAAAA,CAAAA,EAAA,OAAA/G,EAAA,KAAA2c,UAAA,CAAA9X,EAAAkC,GAAA,IAAA/G,EAAA,wEAAAA,EAAA6Y,OAAA,CAAAhU,EAAAkC,EAAA,CAAAsV,wBAAAxX,CAAA,KAAAA,EAAAuJ,cAAA,MAAA6N,aAAA,CAAA5D,QAAA,WAAA0D,aAAA,EAAAlX,EAAAuJ,cAAA,MAAA2N,aAAA,CAAA1D,QAAA,aAAAtR,EAAA,KAAAoV,QAAA,CAAAtX,CAAA,MAAAoX,aAAA,CAAA5D,QAAA,MAAAtR,GAAA,EAAAA,EAAAyS,MAAA,EAAA3U,EAAAuJ,cAAA,CAAArH,EAAAsR,QAAA,UAAAtR,CAAA,cAAAA,KAAA,KAAAoV,QAAA,MAAAnc,EAAA,KAAAmc,QAAA,CAAApV,EAAA,IAAAlC,EAAAuJ,cAAA,CAAApO,EAAAqY,QAAA,SAAArY,CAAA,4CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,MAAA/G,CAAA,UAAA+G,GAAAA,CAAAA,EAAA,OAAAjD,EAAA,KAAAmY,aAAA,CAAAojC,EAAAv7C,EAAA2U,MAAA,CAAA5T,EAAAkC,GAAAf,EAAA,KAAAmW,QAAA,CAAAkjC,EAAA,aAAAr5C,EAAA,KAAAtB,EAAA,CAAAsB,CAAAA,EAAA,KAAA+V,aAAA,MAAAG,uBAAA,EAAAxX,CAAAA,EAAAZ,EAAA0V,MAAA,CAAApB,IAAA,EAAApY,CAAAA,EAAA,KAAAwY,qBAAA,IAAA1U,EAAAuU,QAAA,EAAAgnC,EAAAr/C,CAAA,CAAAgG,EAAAqS,QAAA,OAAA0D,aAAA,CAAAtD,MAAA,CAAA5T,EAAAkC,EAAArC,EAAA,MAAA1E,EAAAgG,EAAAyS,MAAA,CAAA5T,EAAAkC,EAAA,QAAA/G,CAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA8D,EAAA,KAAAyY,gBAAA,CAAA1X,GAAA,YAAAf,EAAA,KAAAA,EAAA,KAAAmY,aAAA,CAAAojC,EAAA,KAAAtjC,aAAA,CAAA/V,EAAA,cAAAkW,uBAAA,EAAAlW,CAAAA,EAAAlC,EAAA0V,MAAA,CAAApB,IAAA,EAAAtU,EAAAzC,MAAA,CAAAwD,CAAA,CAAAf,EAAAuU,QAAA,EAAAtR,EAAA/G,GAAAgG,EAAAq5C,EAAAh+C,MAAA,CAAAwD,CAAA,CAAAw6C,EAAAhnC,QAAA,EAAAtR,EAAA/G,EAAAgG,EAAA,QAAAlC,EAAAzC,MAAA,CAAAwD,EAAAkC,EAAA/G,EAAA,CAAAgd,WAAAnY,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAA8D,EAAA,IAAAo0D,GAAA,KAAArzD,EAAAkC,EAAA/G,GAAA,YAAAmc,QAAA,CAAAtX,EAAA,CAAAf,EAAAA,CAAA,CAAA6Y,WAAA9X,CAAA,CAAAkC,CAAA,MAAA/G,EAAA6E,EAAA,OAAAzE,EAAAgd,QAAA,CAAAvY,IAAA,UAAAkC,GAAAA,CAAAA,EAAA,GAAA/G,EAAA,KAAAic,aAAA,CAAAxD,MAAA,CAAA5T,EAAAkC,EAAA,OAAAoV,QAAA,CAAAnc,EAAA,QAAAk4D,WAAAd,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAe,CAAAA,aAAAozD,EAAA,+CAAA3/C,OAAAC,SAAA,CAAAxR,IAAA,EAAAA,EAAA,gFAAA/G,GAAA,SAAA8D,GAAAA,CAAAA,EAAA9D,EAAAA,EAAA,MAAAA,CAAA,MAAAA,CAAAA,aAAAo3D,EAAA,uDAAAvyD,EAAAkX,aAAA,KAAA/b,EAAAoY,IAAA,EAAApY,EAAAoY,IAAA,CAAAvT,EAAAkX,aAAA,CAAA3D,IAAA,kFAAAtU,EAAA,2DAAAu7C,EAAAx6C,EAAAuT,IAAA,GAAAvT,EAAAuT,IAAA,KAAAinC,CAAAA,EAAAr/C,EAAAA,EAAAoY,IAAA,KAAAvT,EAAAqX,uBAAA,EAAAmjC,CAAAA,GAAAx6C,EAAAoX,aAAA,CAAAzC,MAAA,CAAApB,IAAA,QAAAinC,EAAAv7C,GAAA,KAAAuZ,KAAA,CAAAxY,EAAA,KAAAoY,OAAA,CAAAlW,EAAA,KAAAyS,MAAA,CAAAxZ,GAAA,KAAA6Y,QAAAhU,CAAA,CAAAkC,CAAA,aAAAqR,IAAA,aAAAA,IAAA,UAAArR,GAAAA,CAAAA,EAAA,OAAA/G,EAAA,cAAAqd,KAAA,CAAAnB,uBAAA,EAAAlc,CAAAA,EAAA,KAAAqd,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAAApY,EAAA,KAAAwZ,MAAA,CAAAX,OAAA,CAAAhU,EAAAkC,EAAA/G,EAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAAwY,qBAAA,eAAAzR,GAAAA,CAAAA,EAAA,eAAAsW,KAAA,CAAAV,UAAA,CAAA9X,EAAAkC,EAAA,qCAAAjD,EAAA,cAAAuZ,KAAA,CAAAnB,uBAAA,EAAApY,CAAAA,EAAA,KAAAuZ,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,OAAAoB,MAAA,CAAAxZ,CAAA,MAAAqY,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,EAAAjD,GAAA,KAAAuU,QAAA,CAAArY,CAAA,MAAAqY,QAAA,UAAAgF,KAAA,CAAAnB,uBAAA,EAAAlc,CAAAA,CAAA,MAAAqd,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAAAjd,CAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA8D,EAAA,UAAAuZ,KAAA,CAAAnB,uBAAA,EAAApY,CAAAA,EAAA,KAAAuZ,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,OAAAoB,MAAA,GAAA3U,EAAAuJ,cAAA,MAAAiK,QAAA,iDAAAA,QAAA,OAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAlW,EAAA/G,GAAA,IAAAq/C,EAAAv7C,EAAA,QAAA0V,MAAA,QAAAA,MAAA,CAAAnY,MAAA,CAAAwD,CAAA,MAAAwT,QAAA,EAAAtR,EAAA/G,EAAA8D,GAAAu7C,GAAA,KAAA7lC,MAAA,CAAAX,OAAA,CAAA9R,EAAA/G,EAAA8D,GAAA,QAAAuZ,KAAA,CAAAjF,IAAA,EAAAinC,EAAA,KAAAhiC,KAAA,CAAAjF,IAAA,kEAAAinC,CAAA,CAAArmC,UAAAnU,CAAA,UAAA2U,MAAA,aAAAA,MAAA,CAAAR,SAAA,CAAAnU,EAAA,QAAAszD,WAAAf,GAAAz1D,YAAAkD,CAAA,CAAAkC,CAAA,MAAAlC,CAAAA,aAAAyyD,IAAAzyD,EAAAyU,OAAA,IAAAhB,OAAAC,SAAA,CAAA1T,IAAA,GAAAA,CAAAA,EAAA,6FAAA7E,EAAA,EAAA6E,CAAAA,aAAAyyD,IAAAt3D,CAAAA,EAAA6E,CAAAA,EAAA,MAAA7E,EAAA+G,GAAA,KAAAnG,MAAA,CAAAiE,CAAA,CAAAgU,QAAAhU,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAAoY,IAAA,UAAApY,GAAAA,CAAAA,EAAA,KAAAY,MAAA,CAAA6X,MAAA,CAAA5T,EAAAkC,EAAA,EAAA/G,CAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,WAAAA,GAAAA,CAAAA,EAAA,OAAA/G,EAAA,KAAAoY,IAAA,UAAApY,GAAAA,CAAAA,EAAA,KAAAY,MAAA,CAAA6X,MAAA,CAAA5T,EAAAkC,EAAA,EAAAlC,EAAA7D,KAAA,CAAA+F,EAAAA,EAAA/G,EAAA,CAAAqB,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,MAAAq/C,EAAAr5C,EAAA,IAAAlC,EAAA,KAAAlD,MAAA,SAAAA,MAAA,YAAA02D,IAAAxzD,CAAAA,EAAAe,EAAAjE,MAAA,GAAAR,EAAAgd,QAAA,CAAAvY,IAAAf,IAAAe,EAAAjE,MAAA,iBAAAy+C,CAAAA,EAAA,gBAAAr5C,EAAA,MAAAqS,QAAA,CAAAgnC,EAAA,IAAAr5C,EAAAqS,QAAA,KAAAgnC,CAAA,uBAAAv7C,EAAA,uBAAA9D,EAAA8D,EAAAiD,EAAAnG,MAAA,qDAAAmG,EAAAwW,KAAA,CAAA1Y,EAAA8D,QAAA,QAAA3I,EAAA8D,EAAA,YAAAlD,MAAA,YAAA02D,IAAA,KAAA12D,MAAA,CAAAS,MAAA,CAAAyC,EAAAiD,EAAA/G,GAAA8D,CAAA,MAAAs0D,GAAA,CAAAvzD,EAAAkC,EAAA/G,IAAA,IAAAu3D,GAAA1yD,EAAAkC,EAAA/G,GAAAq4D,GAAAxzD,GAAA,IAAA2yD,GAAA,EAAA3yD,GAAAyzD,GAAAzzD,GAAA,IAAA2yD,GAAA,EAAA3yD,GAAA0zD,GAAA1zD,GAAA,IAAAgzD,GAAAhzD,GAAA2zD,GAAA3zD,GAAA,IAAAizD,GAAAjzD,GAAA4zD,GAAA,CAAA5zD,EAAAkC,EAAA/G,IAAA,IAAAisC,GAAApnC,EAAAkC,EAAA/G,GAAA04D,GAAA,CAAA7zD,EAAAkC,EAAA/G,IAAA,IAAAi4D,GAAApzD,EAAAkC,EAAA/G,GAAA24D,GAAA,CAAA9zD,EAAAkC,IAAA,IAAAoxD,GAAAtzD,EAAAkC,EAAA,OAAA6xD,GAAAj3D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAA7E,CAAA,SAAAmwD,IAAAtrD,IAAA,sCAAAujD,SAAAvjD,CAAA,CAAAojD,cAAAjoD,CAAA,CAAAsoD,gBAAAxkD,CAAA,UAAA+0D,GAAA,CAAAC,eAAA,CAAA1Q,SAAAvjD,EAAAojD,cAAAjoD,EAAAye,QAAA,GAAA8pC,sBAAA,EAAAzkD,EAAAwkD,gBAAA,CAAAxkD,GAAAhE,EAAA0e,SAAA,UAAAC,QAAA,OAAAze,EAAA,gCAAA64D,GAAA,CAAAE,kBAAA,+CAAAlvC,EAAAhlB,CAAA,UAAAg0D,GAAA,CAAAG,mBAAA,CAAAnvC,EAAAhlB,CAAA,KAAA7E,EAAA,iCAAA6pD,OAAAhlD,CAAA,UAAAg0D,GAAA,CAAA9O,SAAA,CAAAF,OAAAhlD,CAAA,KAAA7E,EAAA,gCAAA6pD,OAAAhlD,CAAA,UAAAg0D,GAAA,CAAAI,QAAA,CAAApP,OAAAhlD,CAAA,KAAA7E,EAAA,qBAAA64D,GAAA,CAAAK,OAAA,yCAAAC,cAAAt0D,CAAA,CAAAu0D,aAAAryD,CAAA,UAAA8xD,GAAA,CAAAQ,aAAA,CAAAF,cAAAt0D,EAAAu0D,aAAAryD,CAAA,KAAA/G,EAAA,+BAAA6pD,OAAAhlD,CAAA,UAAAg0D,GAAA,CAAAS,OAAA,CAAAzP,OAAAhlD,CAAA,KAAA7E,EAAA,6BAAA6pD,OAAAhlD,CAAA,UAAAg0D,GAAA,CAAAU,KAAA,CAAA1P,OAAAhlD,CAAA,KAAA7E,EAAA,2BAAA64D,GAAA,CAAAW,aAAA,gCAAAX,GAAA,CAAAY,cAAA,8BAAAZ,GAAA,CAAAa,YAAA,4CAAA7P,OAAAhlD,CAAA,CAAAujD,SAAArhD,CAAA,UAAA8xD,GAAA,CAAAc,gBAAA,CAAA9P,OAAAhlD,EAAAujD,SAAArhD,CAAA,KAAA/G,EAAA,wCAAA6pD,OAAAhlD,CAAA,CAAAujD,SAAArhD,CAAA,UAAA8xD,GAAA,CAAAe,eAAA,CAAA/P,OAAAhlD,EAAAujD,SAAArhD,CAAA,KAAA/G,EAAA,sCAAA6pD,OAAAhlD,CAAA,CAAAujD,SAAArhD,CAAA,UAAA8xD,GAAA,CAAAgB,cAAA,CAAAhQ,OAAAhlD,EAAAujD,SAAArhD,CAAA,KAAA/G,EAAA,oCAAA6pD,OAAAhlD,CAAA,CAAAujD,SAAArhD,CAAA,UAAA8xD,GAAA,CAAAiB,YAAA,CAAAjQ,OAAAhlD,EAAAujD,SAAArhD,CAAA,KAAA/G,EAAA,0CAAA+5D,UAAAl1D,CAAA,UAAAg0D,GAAA,CAAAmB,mBAAA,CAAAD,UAAAl1D,CAAA,KAAA7E,EAAA,yBAAA64D,GAAA,CAAAoB,WAAA,+CAAAF,UAAAl1D,CAAA,UAAAg0D,GAAA,CAAAqB,mBAAA,CAAAH,UAAAl1D,CAAA,KAAA7E,EAAA,4CAAA6pB,EAAAhlB,CAAA,UAAAg0D,GAAA,CAAAsB,oBAAA,CAAAtwC,EAAAhlB,CAAA,KAAA7E,EAAA,wCAAAooD,SAAAvjD,CAAA,CAAAojD,cAAAlhD,CAAA,CAAAuhD,gBAAAtoD,CAAA,UAAA64D,GAAA,CAAAuB,sBAAA,CAAAhS,SAAAvjD,EAAAojD,cAAAlhD,EAAAuhD,gBAAAtoD,CAAA,KAAAA,EAAA,6CAAA6E,EAAA,IAAA+wD,YAAA/wD,CAAA,CAAAkC,CAAA,oDAAAszD,GAAA3B,GAAAL,GAAA,yBAAAiC,GAAAz1D,CAAA,SAAA8zD,GAAA,GAAA9zD,EAAA,UAAAg0D,GAAAh0D,CAAA,MAAAkC,EAAA3G,EAAAknB,KAAA,CAAAizC,IAAAv6D,EAAAq6D,GAAAh5D,MAAA,CAAAwD,EAAAkC,GAAA,OAAAA,EAAA/F,KAAA,GAAAhB,EAAA,CAAAq6D,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAJ,GAAA,YAAAM,GAAA,oBAAAN,GAAA,yBAAAiC,GAAA,uCAAAD,GAAAr9C,UAAA,GAAAy7C,GAAA,yBAAA4B,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAJ,GAAA,6BAAAgC,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAF,GAAA,wBAAA8B,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAF,GAAA,uBAAA8B,GAAAr9C,UAAA,GAAAy7C,GAAA,cAAA4B,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAJ,GAAA,iBAAAA,GAAA,sBAAAiC,GAAA,kCAAAD,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAF,GAAA,sBAAA8B,GAAAr9C,UAAA,GAAAy7C,GAAA,CAAAF,GAAA,oBAAA8B,GAAAr9C,UAAA,GAAAy7C,GAAA,oBAAA4B,GAAAr9C,UAAA,IAAAy7C,GAAA,qBAAA4B,GAAAr9C,UAAA,IAAAy7C,GAAA,mBAAA4B,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAF,GAAA,UAAAF,GAAA,iCAAAgC,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAF,GAAA,UAAAF,GAAA,iCAAAgC,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAF,GAAA,UAAAF,GAAA,+BAAAgC,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAF,GAAA,UAAAF,GAAA,+BAAAgC,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAA6B,GAAA,qCAAAD,GAAAr9C,UAAA,IAAAy7C,GAAA,kBAAA4B,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAA6B,GAAA,qCAAAD,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAJ,GAAA,8BAAAgC,GAAAr9C,UAAA,IAAAy7C,GAAA,CAAAJ,GAAA,YAAAiC,GAAA,iBAAAjC,GAAA,yBAAAiC,GAAA,4CAAAC,GAAA75D,KAAAqrC,GAAA,IAAAtpC,OAAAwW,MAAA,CAAAohD,GAAAl+C,QAAA,EAAAtb,GAAA,CAAAgE,GAAAA,EAAAuT,IAAA,SAAAoiD,GAAA74D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,+CAAA0R,OAAA5T,CAAA,yDAAA41D,GAAA51D,CAAA,aAAA61D,GAAA/B,GAAA,GAAA9zD,GAAA81D,GAAA3zC,UAAA,CAAAniB,GAAAA,GAAAA,EAAA4Z,QAAA,GAAA5Z,EAAA,UAAA+1D,GAAA/1D,CAAA,aAAA61D,GAAA/B,GAAA,IAAA9zD,GAAA,IAAA/E,EAAA0e,SAAA,CAAA3Z,GAAAA,GAAAA,EAAA4Z,QAAA,GAAA5Z,EAAA,UAAAg2D,GAAAh2D,CAAA,CAAAkC,CAAA,aAAA+zD,GAAAj2D,EAAAkC,EAAA,OAAA2zD,WAAArD,GAAA11D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,QAAAe,EAAAuT,IAAA,CAAAtU,GAAA,KAAA0V,MAAA,CAAA3U,EAAA,KAAAwZ,OAAA,CAAAtX,EAAA,KAAAuX,OAAA,CAAAte,CAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,cAAAsX,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,GAAA,CAAA1F,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,cAAAwZ,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAAzZ,GAAAkC,EAAA/G,EAAA,CAAA6Y,QAAAhU,CAAA,CAAAkC,CAAA,cAAAyS,MAAA,CAAAX,OAAA,CAAAhU,EAAAkC,EAAA,QAAA+zD,WAAAzD,GAAA11D,YAAAkD,CAAA,CAAAkC,CAAA,WAAAA,GAAA,KAAAyS,MAAA,CAAA3U,EAAA,KAAAoX,aAAA,CAAAq8C,IAAA,CAAAj3D,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,EAAA,gBAAA6E,EAAA,KAAA2U,MAAA,CAAApB,IAAA,MAAA6D,aAAA,CAAA5a,MAAA,GAAA0F,EAAA/G,GAAA,MAAAic,aAAA,CAAA5a,MAAA,GAAA0F,EAAA/G,GAAA,KAAAwZ,MAAA,CAAAnY,MAAA,CAAAwD,EAAAkC,EAAA/G,EAAA,MAAAyY,OAAA5T,CAAA,CAAAkC,EAAA,OAAA/G,EAAA,KAAAic,aAAA,CAAAxD,MAAA,CAAA5T,EAAAkC,GAAA,OAAA/G,EAAA,mBAAAA,EAAA,YAAAwZ,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,EAAA,uCAAAyS,MAAA,CAAAnB,QAAA,EAAAQ,QAAAhU,CAAA,CAAAkC,EAAA,eAAAyS,MAAA,CAAAX,OAAA,CAAAhU,EAAAkC,EAAA,eAAAg0D,GAAAl2D,CAAA,SAAAA,EAAA,gBAAAA,EAAA,sCAAAA,EAAA,UAAAm2D,GAAAn2D,CAAA,SAAAA,EAAA,UAAA81D,WAAAp7D,IAAAkf,UAAA,KAAA5Z,EAAA,MAAAsiB,OAAA,GAAAC,OAAA,GAAArgB,EAAA3G,EAAA2d,IAAA,CAAAlZ,GAAA,OAAAkC,EAAAnG,MAAA,QAAAmG,CAAA,IAAAA,EAAAnG,MAAA,qCAAAZ,EAAAI,EAAAknB,KAAA,WAAAvgB,EAAAwgB,IAAA,CAAAvnB,GAAAA,CAAA,QAAAgnB,WAAAniB,CAAA,SAAAA,EAAAjE,MAAA,uCAAAiE,EAAAjE,MAAA,eAAA+5D,GAAA,IAAA91D,EAAA,CAAAuiB,OAAA,GAAAvmB,GAAA,CAAAgE,GAAA,KAAAA,EAAA8D,QAAA,OAAA3H,KAAA,MAAAmB,IAAA,gBAAA84D,GAAAt5D,YAAAkD,CAAA,OAAAywD,GAAA,CAAAzwD,CAAA,OAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,SAAAlC,GAAA,iBAAAA,EAAAzE,EAAAknB,KAAA,MAAAtnB,EAAAk7D,GAAA75D,MAAA,CAAA0F,EAAAlC,GAAA,OAAAA,EAAA7D,KAAA,GAAAhB,EAAA,iBAAA6E,EAAAzE,EAAAknB,KAAA,KAAAtnB,EAAAm7D,GAAA95D,MAAA,CAAA0F,EAAAlC,GAAA,OAAAA,EAAA7D,KAAA,GAAAhB,EAAA,8CAAA6E,EAAA,IAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,cAAA4vD,eAAA,CAAA9xD,EAAAkC,EAAA,CAAA4vD,gBAAA9xD,CAAA,CAAAkC,CAAA,MAAAlC,EAAAA,EAAA,OAAAA,GAAA,mBAAAA,EAAAkC,EAAAm0D,GAAAziD,MAAA,CAAA5T,EAAA,mBAAAA,EAAAkC,EAAAo0D,GAAA1iD,MAAA,CAAA5T,EAAA,8CAAAA,EAAA,IAAA+xD,OAAA/xD,CAAA,CAAAkC,CAAA,SAAAlC,GAAA,mBAAAu2D,SAAA,uBAAAA,SAAA,iDAAAv2D,EAAA,IAAAtE,KAAAsE,CAAA,MAAAkC,EAAA,cAAAA,CAAAA,EAAAuvD,GAAA,KAAAhB,GAAA,CAAAzwD,EAAA,YAAAkC,EAAAA,EAAA,OAAAo0D,GAAA1C,GAAA,CAAAoC,GAAAD,KAAA,iBAAAH,GAAA,UAAApC,GAAA,YAAAtI,CAAAA,EAAA,oBAAA2K,GAAArC,KAAA0C,GAAAC,GAAAjL,EAAA,EAAA8K,GAAAD,KAAA,qBAAAM,GAAAzC,GAAA,CAAAmC,GAAA,QAAAA,GAAA,aAAAH,GAAA,UAAAI,GAAAD,KAAA,YAAAvC,GAAA,SAAAwC,GAAAJ,KAAA,YAAAA,GAAA,mBAAAI,GAAAD,KAAA,0BAAAS,GAAA15D,YAAAkD,CAAA,GAAA4T,OAAA5T,CAAA,+DAAAy2D,GAAA35D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,4DAAA0R,OAAA5T,CAAA,CAAAkC,CAAA,mEAAAooD,GAAAxtD,YAAAkD,CAAA,OAAAwmD,WAAA,KAAAuN,GAAA/zD,GAAA,KAAA+C,QAAA,KAAAqzD,GAAAp2D,GAAA,KAAAgyD,MAAA,KAAAwE,GAAAx2D,GAAA,KAAA8lD,KAAA,KAAA6P,GAAA31D,GAAA,KAAAgxD,KAAA,KAAAyF,GAAAz2D,EAAA,QAAA02D,GAAA55D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,SAAAopD,IAAAtrD,IAAA,qCAAA0F,SAAA1F,CAAA,CAAA05C,MAAAx3C,CAAA,CAAAuD,MAAAtK,CAAA,UAAAw7D,GAAA,CAAApd,cAAA,CAAA7zC,SAAA1F,EAAA05C,MAAAx3C,EAAAuD,MAAAtK,EAAAye,QAAA,OAAA1X,EAAA,+BAAAuD,MAAAzF,CAAA,UAAA22D,GAAA,CAAA94D,OAAA,CAAA4H,MAAAzF,EAAA4Z,QAAA,OAAA1X,EAAA,iCAAAwD,SAAA1F,CAAA,UAAA22D,GAAA,CAAAzR,SAAA,CAAAx/C,SAAA1F,CAAA,KAAAkC,EAAA,8CAAAipC,KAAAnrC,CAAA,CAAA42D,KAAA10D,CAAA,CAAAwD,SAAAvK,CAAA,CAAAu+C,MAAAz6C,CAAA,CAAAwG,MAAA+0C,CAAA,UAAAmc,GAAA,CAAAE,sBAAA,CAAA1rB,KAAAnrC,EAAA4Z,QAAA,GAAAg9C,KAAA10D,EAAAwD,SAAAvK,EAAAu+C,MAAAz6C,EAAAwG,MAAA+0C,EAAA5gC,QAAA,KAAAk9C,GAAAh/C,UAAA,IAAAvE,IAAA,CAAArR,EAAAnG,MAAA,GAAAmG,EAAA,4CAAA60D,WAAA/2D,CAAA,UAAA22D,GAAA,CAAAK,oBAAA,CAAAD,WAAA/2D,EAAA4Z,QAAA,OAAA1X,EAAA,6CAAAwD,SAAA1F,CAAA,UAAA22D,GAAA,CAAAM,qBAAA,CAAAvxD,SAAA1F,CAAA,KAAAkC,EAAA,+CAAA60D,WAAA/2D,CAAA,UAAA22D,GAAA,CAAAO,uBAAA,CAAAH,WAAA/2D,EAAA4Z,QAAA,OAAA1X,EAAA,8CAAA60D,WAAA/2D,CAAA,UAAA22D,GAAA,CAAAQ,sBAAA,CAAAJ,WAAA/2D,EAAA4Z,QAAA,OAAA1X,EAAA,iCAAAw3C,MAAA15C,CAAA,UAAA22D,GAAA,CAAAS,SAAA,CAAA1d,MAAA15C,CAAA,KAAAkC,EAAA,yCAAAipC,KAAAnrC,CAAA,CAAA42D,KAAA10D,CAAA,CAAAw3C,MAAAv+C,CAAA,CAAAsK,MAAAxG,CAAA,UAAA03D,GAAA,CAAAU,iBAAA,CAAAlsB,KAAAnrC,EAAA4Z,QAAA,GAAAg9C,KAAA10D,EAAAw3C,MAAAv+C,EAAAsK,MAAAxG,EAAA2a,QAAA,KAAAk9C,GAAAh/C,UAAA,IAAAvE,IAAA,CAAArR,EAAAnG,MAAA,GAAAmG,EAAA,uCAAAipC,KAAAnrC,CAAA,CAAA42D,KAAA10D,CAAA,CAAAuD,MAAAtK,CAAA,UAAAw7D,GAAA,CAAAW,eAAA,CAAAnsB,KAAAnrC,EAAA4Z,QAAA,GAAAg9C,KAAA10D,EAAAuD,MAAAtK,EAAAye,QAAA,KAAAk9C,GAAAh/C,UAAA,KAAAvE,IAAA,CAAArR,EAAAnG,MAAA,GAAAmG,EAAA,yCAAAwD,SAAA1F,CAAA,CAAA42D,KAAA10D,CAAA,CAAAuD,MAAAtK,CAAA,UAAAw7D,GAAA,CAAAY,iBAAA,CAAA7xD,SAAA1F,EAAA42D,KAAA10D,EAAAuD,MAAAtK,EAAAye,QAAA,KAAAk9C,GAAAh/C,UAAA,KAAAvE,IAAA,CAAArR,EAAAnG,MAAA,GAAAmG,EAAA,6CAAAlC,EAAA,IAAA+wD,YAAA/wD,CAAA,CAAAkC,CAAA,mDAAAs1D,WAAAhF,GAAA11D,YAAAkD,CAAA,WAAAA,GAAA,KAAAwT,QAAA,CAAAxT,EAAA,KAAA2U,MAAA,CAAAi/C,GAAA,CAAAH,GAAA,UAAAA,GAAA,iBAAAK,GAAAP,GAAAE,KAAA,mBAAAjgD,QAAA,EAAAhX,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,EAAA,YAAA6E,EAAA,YAAA2U,MAAA,CAAApB,IAAA,KAAAtU,EAAA,CAAAga,MAAA1d,EAAA2d,IAAA,CAAAlZ,EAAA,qBAAA2U,MAAA,CAAAnY,MAAA,CAAAyC,EAAAiD,EAAA/G,EAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,EAAA,eAAAyS,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,GAAA+W,KAAA,CAAAnV,QAAA,GAAAkQ,QAAAhU,CAAA,CAAAkC,EAAA,UAAAuxD,KAAAlgD,IAAA,CAAAkgD,KAAAlgD,IAAA,IAAA7Y,CAAAA,GAAA,MAAA2M,WAAArH,GAAA7D,KAAA,CAAA+F,EAAAA,EAAA,YAAAiX,QAAA,aAAAs+C,GAAAz3D,CAAA,aAAAw3D,GAAAx3D,EAAA,UAAA03D,GAAA13D,CAAA,SAAA8zD,GAAA,GAAA9zD,EAAA,KAAA82D,GAAAjD,GAAAJ,GAAA,yBAAAkD,GAAA32D,CAAA,CAAAkC,CAAA,MAAA/G,EAAAI,EAAAknB,KAAA,OAAAvgB,EAAAA,EAAAy1D,EAAA,EAAA14D,EAAA63D,GAAAt6D,MAAA,CAAAwD,EAAA7E,GAAA,gBAAA+G,EAAA/G,EAAAgB,KAAA,GAAA8C,GAAA9D,CAAA,CAAA27D,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAAD,GAAA,YAAAA,GAAA,SAAA+D,GAAA,4BAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,qBAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAAD,GAAA,0BAAAmD,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,QAAAD,GAAA,QAAA9D,GAAA,YAAAA,GAAA,SAAA+D,GAAA,oCAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,uCAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAAD,GAAA,sCAAAmD,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,0CAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,yCAAAZ,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAAD,GAAA,uBAAAmD,GAAA3+C,UAAA,GAAAy7C,GAAA,CAAA8D,GAAA,QAAAD,GAAA,QAAA9D,GAAA,SAAA+D,GAAA,+BAAAZ,GAAA3+C,UAAA,IAAAy7C,GAAA,CAAA8D,GAAA,QAAAD,GAAA,QAAAC,GAAA,6BAAAZ,GAAA3+C,UAAA,IAAAy7C,GAAA,CAAAD,GAAA,YAAA8D,GAAA,QAAAC,GAAA,mCAAAC,GAAA97D,KAAAqrC,GAAA,IAAAtpC,OAAAwW,MAAA,CAAA0iD,GAAAx/C,QAAA,EAAAtb,GAAA,CAAAgE,GAAAA,EAAAuT,IAAA,SAAAqkD,GAAA96D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,4CAAA0R,OAAA5T,CAAA,mDAAA63D,GAAA/6D,YAAAkD,CAAA,OAAAywD,GAAA,CAAAzwD,CAAA,OAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,eAAAlC,EAAA,KAAAA,EAAAzE,EAAAknB,KAAA,CAAAxnB,EAAA68D,oBAAA,EAAA38D,EAAA48D,GAAAv7D,MAAA,CAAA0F,EAAAlC,GAAA,OAAAA,EAAA7D,KAAA,GAAAhB,EAAA,sCAAA6E,EAAA,GAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,cAAA4vD,eAAA,CAAA9xD,EAAAkC,EAAA,CAAA4vD,gBAAA9xD,CAAA,CAAAkC,CAAA,eAAAlC,EAAA,KAAAA,EAAA,OAAAA,EAAAkC,EAAA61D,GAAAnkD,MAAA,CAAA5T,EAAA,sCAAAA,EAAA,GAAA+xD,OAAA/xD,CAAA,CAAAkC,CAAA,eAAAlC,EAAA,OAAAu2D,SAAAt7D,EAAA68D,oBAAA,uCAAA93D,EAAA,GAAAtE,KAAAsE,CAAA,MAAAkC,EAAA,cAAAA,CAAAA,EAAAuvD,GAAA,KAAAhB,GAAA,CAAAzwD,EAAA,YAAAkC,EAAAA,EAAA,SAAA81D,WAAAxF,GAAA11D,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,QAAAe,EAAAuT,IAAA,CAAAtU,GAAA,KAAA0V,MAAA,CAAA3U,EAAA,KAAAwZ,OAAA,CAAAtX,EAAA,KAAAuX,OAAA,CAAAte,CAAA,CAAAyY,OAAA5T,CAAA,CAAAkC,CAAA,cAAAsX,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAA5T,EAAAkC,GAAA,CAAA1F,OAAAwD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,cAAAwZ,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAAzZ,GAAAkC,EAAA/G,EAAA,CAAA6Y,QAAAhU,CAAA,CAAAkC,CAAA,cAAAyS,MAAA,CAAAX,OAAA,CAAAhU,EAAAkC,EAAA,WAAA+1D,GAAAj4D,CAAA,aAAAg4D,GAAAlE,GAAA,IAAA9zD,GAAA,IAAA/E,EAAA0e,SAAA,CAAA3Z,GAAAA,GAAAA,EAAA4Z,QAAA,GAAA5Z,EAAA,KAAA+3D,GAAAnE,GAAA,CAAAH,GAAA,WAAAA,GAAA,SAAAwE,GAAA,oBAAAA,GAAA,SAAArE,GAAA,CAAAF,GAAA,kDAAAwE,GAAAp7D,YAAAkD,CAAA,GAAA4T,OAAA5T,CAAA,4DAAAm4D,GAAAr7D,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,yDAAA0R,OAAA5T,CAAA,CAAAkC,CAAA,gEAAAsoD,GAAA1tD,YAAAkD,CAAA,OAAAwmD,WAAA,KAAAkQ,GAAA12D,GAAA,KAAA+C,QAAA,KAAA80D,GAAA73D,GAAA,KAAAgyD,MAAA,KAAAkG,GAAAl4D,GAAA,KAAA8lD,KAAA,KAAA8R,GAAA53D,GAAA,KAAAgxD,KAAA,KAAAmH,GAAAn4D,EAAA,MAAAo4D,GAAAx6D,OAAAquD,MAAA,EAAAC,UAAA,KAAAnhC,KAAA,SAAA/qB,CAAA,WAAAurD,EAAAgG,MAAA,EAAAvxD,EAAA,aAAAq4D,GAAAl9D,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,MAAAr5C,EAAAgqD,EAAA5vD,MAAA,CAAA01B,MAAA,EAAA91B,EAAAye,QAAA,GAAAuxC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAja,GAAAu7C,EAAA5gC,QAAA,KAAA/Z,EAAA0rD,EAAAgG,MAAA,CAAAC,MAAA,CAAArwD,GAAA,WAAAlG,EAAA0e,SAAA,CAAAwxC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAArZ,GAAA,UAAAy4D,GAAAn9D,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA2Q,EAAA5vD,MAAA,CAAAknB,KAAA,GAAAtnB,CAAAA,EAAA6M,OAAA,UAAA9F,CAAA,KAAAA,EAAAnG,MAAA,+CAAAy+C,CAAAA,EAAA2Q,EAAA5vD,MAAA,CAAA01B,MAAA,EAAAupB,EAAA+d,GAAAr2D,GAAA,IAAAs4C,EAAA2Q,EAAA5vD,MAAA,CAAA01B,MAAA,EAAAupB,EAAAv7C,EAAA2a,QAAA,GAAAuxC,EAAA5vD,MAAA,CAAA2d,IAAA,gCAAA/X,EAAA,GAAAoqD,EAAAgG,MAAA,MAAAlqD,WAAAmzC,IAAA36C,EAAA,GAAAnF,CAAAA,GAAA,EAAAyG,EAAA,IAAAmhB,OAAA,eAAArnB,EAAA0e,SAAA,CAAA6+C,SAAA,KAAAnxD,WAAAxH,IAAA,yEAAA5E,EAAA0e,SAAA,CAAA9Z,EAAA,UAAA44D,GAAAv2D,CAAA,CAAA/G,CAAA,MAAA8D,EAAAu7C,EAAA,YAAAA,GAAA,KAAAv7C,EAAAq5D,GAAAp2D,EAAA+uB,MAAA,CAAAk6B,EAAA5vD,MAAA,CAAA2d,IAAA,EAAAshC,EAAA,GAAAr/C,EAAA,OAAA6E,EAAA,IAAAA,aAAAnD,UAAA,MAAAmD,CAAAw6C,CAAAA,IAAA,gBAAAv7C,EAAAu7C,EAAA,kEAAA+d,GAAAr2D,GAAAA,aAAAipD,EAAA5vD,MAAA,CAAA2G,EAAAA,aAAAmF,WAAA8jD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAhX,EAAAgb,MAAA,CAAAhb,EAAAw2D,UAAA,CAAAx2D,EAAA+a,UAAA,EAAAkuC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAhX,EAAA,gBAAAy2D,GAAAx9D,CAAA,IAAA8D,CAAA,MAAAu7C,EAAA,CAAA2Q,EAAA5vD,MAAA,CAAA2d,IAAA,2BAAAja,EAAA+I,OAAA,CAAA9F,GAAA,CAAAs4C,EAAAngD,IAAA,CAAA6H,aAAAipD,EAAA5vD,MAAA,CAAA2G,EAAA6oD,EAAA7oD,GAAA0X,QAAA,UAAAzY,EAAA,OAAAlG,EAAA0e,SAAA,CAAA6kC,kBAAA,CAAAhE,EAAAuQ,EAAA5vD,IAAA,OAAAgG,CAAA,KAAAy3D,GAAAh7D,OAAAquD,MAAA,EAAAC,UAAA,KAAA2M,mBAAAR,GAAAS,yBAAAR,GAAA1Z,uBAAA6Z,GAAAM,WAAAJ,EAAA,OAAAK,GAAA,IAAA/9D,EAAA0e,SAAA,gDAAAs/C,GAAA,IAAAh+D,EAAA0e,SAAA,qDAAAu/C,GAAAt7D,OAAAquD,MAAA,EAAAC,UAAA,KAAArS,iBAAAmf,GAAAG,sBAAAF,GAAAG,kBAAA,gBAAA9X,KAAAthD,CAAA,CAAAyF,MAAAtK,CAAA,gBAAAF,EAAA0e,SAAA,CAAA6kC,kBAAA,EAAArjD,EAAAye,QAAA,GAAAo/C,GAAAp/C,QAAA,GAAA5Z,EAAA4Z,QAAA,IAAAq/C,GAAA,QAAAI,GAAA,CAAAx+D,QAAA,IAAAmF,EAAAq5D,GAAAn3D,EAAAm3D,GAAAx+D,OAAA,CAAAM,EAAA,oBAAAf,KAAAA,KAAAi4D,EAAA,CAAAryD,EAAAf,EAAA,oBAAAe,GAAA,MAAA+Z,KAAA,SAAAC,YAAA,CAAA7e,EAAA6e,YAAA,QAAAha,EAAAsJ,SAAA,CAAAnO,EAAA,IAAA6E,CAAA,aAAAkC,CAAA,MAAA/G,EAAA,oBAAA6E,EAAAf,EAAA,WAAAe,GAAA,aAAA7B,OAAAq8C,EAAA,eAAAx6C,GAAA,SAAAA,GAAA,0BAAAoa,KAAA,SAAApa,EAAA,cAAAmB,EAAA,aAAAnB,EAAAH,EAAA,gBAAAG,EAAA,GAAAH,EAAA,IAAAlF,EAAA,oNAAAioD,EAAA/nC,YAAAC,MAAA,WAAA9a,CAAA,SAAAA,GAAArF,EAAAogB,OAAA,CAAAnd,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAxJ,IAAA,aAAA8sD,EAAA9sD,CAAA,sBAAAA,GAAAA,CAAAA,EAAAib,OAAAjb,EAAA,8BAAAkb,IAAA,CAAAlb,EAAA,kEAAAA,EAAAmb,WAAA,YAAA1gB,EAAAuF,CAAA,yBAAAA,GAAAA,CAAAA,EAAAib,OAAAjb,EAAA,EAAAA,CAAA,UAAA8nC,EAAA9nC,CAAA,MAAAkC,EAAA,CAAAvD,KAAA,eAAAuD,EAAAlC,EAAA2W,KAAA,UAAAjY,KAAA,SAAAwD,EAAA3E,MAAA2E,CAAA,WAAAjD,GAAAiD,CAAAA,CAAA,CAAA/D,OAAAC,QAAA,oBAAA8D,CAAA,GAAAA,CAAA,UAAAoyB,EAAAt0B,CAAA,OAAAhE,GAAA,IAAAgE,aAAAs0B,EAAAt0B,EAAAgI,OAAA,UAAAhI,CAAA,CAAAkC,CAAA,OAAAuZ,MAAA,CAAAvZ,EAAAlC,EAAA,QAAArE,MAAA6D,OAAA,CAAAQ,GAAAA,EAAAgI,OAAA,UAAAhI,CAAA,OAAAyb,MAAA,CAAAzb,CAAA,IAAAA,CAAA,YAAAA,GAAApC,OAAA+d,mBAAA,CAAA3b,GAAAgI,OAAA,UAAA9F,CAAA,OAAAuZ,MAAA,CAAAvZ,EAAAlC,CAAA,CAAAkC,EAAA,kBAAA0gB,EAAA5iB,CAAA,KAAAA,EAAA8b,QAAA,QAAAC,QAAAC,MAAA,2BAAAhc,CAAAA,EAAA8b,QAAA,aAAAisB,EAAA/nC,CAAA,aAAA+b,QAAA,SAAA7Z,CAAA,CAAA/G,CAAA,EAAA6E,EAAAoc,MAAA,YAAAla,EAAAlC,EAAAlB,MAAA,GAAAkB,EAAAqc,OAAA,YAAAlhB,EAAA6E,EAAAe,KAAA,cAAAikB,EAAAhlB,CAAA,MAAAkC,EAAA,IAAAqa,WAAAphB,EAAA4sC,EAAA7lC,GAAA,OAAAA,EAAAua,iBAAA,CAAAzc,GAAA7E,CAAA,UAAAm0B,EAAAtvB,CAAA,KAAAA,EAAA7D,KAAA,QAAA6D,EAAA7D,KAAA,QAAA+F,EAAA,IAAAmF,WAAArH,EAAAid,UAAA,SAAA/a,EAAAhC,GAAA,KAAAmH,WAAArH,IAAAkC,EAAAgb,MAAA,UAAA/T,GAAA,aAAA2S,QAAA,SAAAsB,SAAA,UAAApd,CAAA,MAAAkC,CAAA,MAAAmb,SAAA,CAAArd,EAAAA,EAAA,iBAAAA,EAAA,KAAAsd,SAAA,CAAAtd,EAAAw6C,GAAApgC,KAAA9Q,SAAA,CAAAoR,aAAA,CAAA1a,GAAA,KAAAud,SAAA,CAAAvd,EAAAmB,GAAAqc,SAAAlU,SAAA,CAAAoR,aAAA,CAAA1a,GAAA,KAAAyd,aAAA,CAAAzd,EAAA7E,GAAAuiB,gBAAApU,SAAA,CAAAoR,aAAA,CAAA1a,GAAA,KAAAsd,SAAA,CAAAtd,EAAA8D,QAAA,GAAAjE,GAAA26C,GAAAt4C,CAAAA,EAAAlC,CAAAA,GAAAya,SAAAnR,SAAA,CAAAoR,aAAA,CAAAxY,GAAA,MAAAyb,gBAAA,CAAA2R,EAAAtvB,EAAAkd,MAAA,OAAAG,SAAA,KAAAjD,KAAA,MAAAuD,gBAAA,IAAA9d,GAAAgb,CAAAA,YAAAvR,SAAA,CAAAoR,aAAA,CAAA1a,IAAA4iD,EAAA5iD,EAAA,OAAA2d,gBAAA,CAAA2R,EAAAtvB,GAAA,KAAAsd,SAAA,CAAAtd,EAAApC,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAxJ,EAAA,MAAAsd,SAAA,SAAA9B,OAAA,CAAAoC,GAAA,oCAAA5d,EAAA,KAAAwb,OAAA,CAAAtb,GAAA,iDAAAqd,SAAA,OAAAA,SAAA,CAAA9f,IAAA,MAAA+d,OAAA,CAAAtb,GAAA,qBAAAqd,SAAA,CAAA9f,IAAA,EAAAtC,GAAAuiB,gBAAApU,SAAA,CAAAoR,aAAA,CAAA1a,IAAA,KAAAwb,OAAA,CAAAtb,GAAA,qEAAAs6C,GAAA,MAAAzhC,IAAA,gBAAA/Y,EAAA4iB,EAAA,SAAA5iB,EAAA,OAAAA,CAAA,SAAAud,SAAA,QAAAxB,QAAAI,OAAA,MAAAoB,SAAA,UAAAI,gBAAA,QAAA5B,QAAAI,OAAA,KAAA/B,KAAA,MAAAuD,gBAAA,YAAAF,aAAA,4DAAA1B,QAAAI,OAAA,KAAA/B,KAAA,MAAAkD,SAAA,UAAAhD,WAAA,wBAAAqD,gBAAA,CAAAiF,EAAA,OAAA7G,QAAAI,OAAA,MAAAwB,gBAAA,OAAA5E,IAAA,GAAA+E,IAAA,CAAAkH,EAAA,QAAAjH,IAAA,gBAAA/d,EAAAkC,EAAA/G,EAAA6E,EAAA4iB,EAAA,SAAA5iB,EAAA,OAAAA,CAAA,SAAAud,SAAA,QAAAvd,EAAA,KAAAud,SAAA,CAAApiB,EAAA4sC,EAAA7lC,EAAA,IAAAqa,YAAAra,EAAAya,UAAA,CAAA3c,GAAA7E,CAAA,SAAAwiB,gBAAA,QAAA5B,QAAAI,OAAA,UAAAnc,CAAA,UAAAkC,EAAA,IAAAmF,WAAArH,GAAA7E,EAAA,MAAA+G,EAAAnG,MAAA,EAAAkD,EAAA,EAAAA,EAAAiD,EAAAnG,MAAA,CAAAkD,IAAA9D,CAAA,CAAA8D,EAAA,CAAAgc,OAAA8B,YAAA,CAAA7a,CAAA,CAAAjD,EAAA,SAAA9D,EAAAmC,IAAA,WAAAqgB,gBAAA,WAAAF,aAAA,4DAAA1B,QAAAI,OAAA,MAAAmB,SAAA,GAAAnc,GAAA,MAAAkZ,QAAA,wBAAA0D,IAAA,GAAAD,IAAA,CAAAjK,EAAA,QAAAmK,IAAA,wBAAAD,IAAA,GAAAD,IAAA,CAAAxf,KAAA2f,KAAA,QAAAqW,EAAAhrB,SAAA,CAAAmS,MAAA,UAAAzb,CAAA,CAAAkC,CAAA,EAAAlC,EAAA8sD,EAAA9sD,GAAAkC,EAAAzH,EAAAyH,EAAA,KAAA/G,EAAA,KAAAa,GAAA,CAAAgE,EAAA,MAAAhE,GAAA,CAAAgE,EAAA,CAAA7E,EAAAA,EAAA,KAAA+G,EAAAA,CAAA,EAAAoyB,EAAAhrB,SAAA,CAAAgwD,MAAA,UAAAt5D,CAAA,cAAAhE,GAAA,CAAA8wD,EAAA9sD,GAAA,EAAAs0B,EAAAhrB,SAAA,CAAAsU,GAAA,UAAA5d,CAAA,SAAAA,EAAA8sD,EAAA9sD,GAAA,KAAAme,GAAA,CAAAne,GAAA,KAAAhE,GAAA,CAAAgE,EAAA,OAAAs0B,EAAAhrB,SAAA,CAAA6U,GAAA,UAAAne,CAAA,cAAAhE,GAAA,CAAAuN,cAAA,CAAAujD,EAAA9sD,GAAA,EAAAs0B,EAAAhrB,SAAA,CAAApJ,GAAA,UAAAF,CAAA,CAAAkC,CAAA,OAAAlG,GAAA,CAAA8wD,EAAA9sD,GAAA,CAAAvF,EAAAyH,EAAA,EAAAoyB,EAAAhrB,SAAA,CAAAtB,OAAA,UAAAhI,CAAA,CAAAkC,CAAA,UAAA/G,KAAA,KAAAa,GAAA,MAAAA,GAAA,CAAAuN,cAAA,CAAApO,IAAA6E,EAAAwJ,IAAA,CAAAtH,EAAA,KAAAlG,GAAA,CAAAb,EAAA,CAAAA,EAAA,OAAAm5B,EAAAhrB,SAAA,CAAAzH,IAAA,gBAAA7B,EAAA,eAAAgI,OAAA,UAAA9F,CAAA,CAAA/G,CAAA,EAAA6E,EAAA3F,IAAA,CAAAc,EAAA,GAAA2sC,EAAA9nC,EAAA,EAAAs0B,EAAAhrB,SAAA,CAAA8K,MAAA,gBAAApU,EAAA,eAAAgI,OAAA,UAAA9F,CAAA,EAAAlC,EAAA3F,IAAA,CAAA6H,EAAA,GAAA4lC,EAAA9nC,EAAA,EAAAs0B,EAAAhrB,SAAA,CAAAxJ,OAAA,gBAAAE,EAAA,eAAAgI,OAAA,UAAA9F,CAAA,CAAA/G,CAAA,EAAA6E,EAAA3F,IAAA,EAAAc,EAAA+G,EAAA,IAAA4lC,EAAA9nC,EAAA,EAAAf,GAAAq1B,CAAAA,EAAAhrB,SAAA,CAAAnL,OAAAC,QAAA,EAAAk2B,EAAAhrB,SAAA,CAAAxJ,OAAA,MAAAkzB,EAAA,wDAAApzB,EAAAI,CAAA,CAAAkC,CAAA,MAAA/G,EAAA8D,EAAAu7C,EAAA,CAAAt4C,EAAAA,GAAA,IAAA2Z,IAAA,IAAA7b,aAAAJ,EAAA,IAAAI,EAAA8b,QAAA,sCAAA3V,GAAA,CAAAnG,EAAAmG,GAAA,MAAAyY,WAAA,CAAA5e,EAAA4e,WAAA,CAAA1c,EAAAsZ,OAAA,QAAAA,OAAA,KAAA8Y,EAAAt0B,EAAAwb,OAAA,QAAAgD,MAAA,CAAAxe,EAAAwe,MAAA,MAAAK,IAAA,CAAA7e,EAAA6e,IAAA,MAAAC,MAAA,CAAA9e,EAAA8e,MAAA,CAAA07B,GAAA,MAAAx6C,EAAAqd,SAAA,EAAAm9B,CAAAA,EAAAx6C,EAAAqd,SAAA,CAAArd,EAAA8b,QAAA,eAAA3V,GAAA,CAAA8U,OAAAjb,EAAA,SAAA4e,WAAA,CAAA1c,EAAA0c,WAAA,OAAAA,WAAA,iBAAA1c,EAAAsZ,OAAA,OAAAA,OAAA,QAAAA,OAAA,KAAA8Y,EAAApyB,EAAAsZ,OAAA,QAAAgD,MAAA,CAAArjB,CAAAA,EAAAA,CAAAA,EAAA+G,EAAAsc,MAAA,OAAAA,MAAA,SAAAE,WAAA,GAAAsU,EAAAjY,OAAA,CAAA9b,GAAA,GAAAA,EAAA9D,CAAA,OAAA0jB,IAAA,CAAA3c,EAAA2c,IAAA,OAAAA,IAAA,YAAAC,MAAA,CAAA5c,EAAA4c,MAAA,OAAAA,MAAA,MAAAC,QAAA,oBAAAP,MAAA,gBAAAA,MAAA,GAAAg8B,CAAA,mEAAAp9B,SAAA,CAAAo9B,EAAA,UAAA3mC,EAAA7T,CAAA,MAAAkC,EAAA,IAAAsb,SAAA,OAAAxd,EAAAif,IAAA,GAAAvJ,KAAA,MAAA1N,OAAA,UAAAhI,CAAA,KAAAA,EAAA,KAAA7E,EAAA6E,EAAA0V,KAAA,MAAAzW,EAAA9D,EAAAwb,KAAA,GAAAwI,OAAA,YAAAq7B,EAAAr/C,EAAAmC,IAAA,MAAA6hB,OAAA,YAAAjd,EAAAuZ,MAAA,CAAA2D,mBAAAngB,GAAAmgB,mBAAAo7B,GAAA,IAAAt4C,CAAA,UAAAq3D,EAAAv5D,CAAA,CAAAkC,CAAA,EAAAA,GAAAA,CAAAA,EAAA,SAAAzE,IAAA,gBAAAoL,MAAA,UAAA3G,EAAA2G,MAAA,KAAA3G,EAAA2G,MAAA,MAAA+W,EAAA,MAAA/W,MAAA,YAAAA,MAAA,UAAAgX,UAAA,gBAAA3d,EAAAA,EAAA2d,UAAA,WAAArE,OAAA,KAAA8Y,EAAApyB,EAAAsZ,OAAA,OAAArV,GAAA,CAAAjE,EAAAiE,GAAA,UAAAiX,SAAA,CAAApd,EAAA,CAAAJ,EAAA0J,SAAA,CAAAwW,KAAA,uBAAAlgB,EAAA,MAAAic,KAAA,KAAAwB,SAAA,IAAAlU,EAAAK,IAAA,CAAA5J,EAAA0J,SAAA,EAAAH,EAAAK,IAAA,CAAA+vD,EAAAjwD,SAAA,EAAAiwD,EAAAjwD,SAAA,CAAAwW,KAAA,uBAAAy5C,EAAA,KAAAl8C,SAAA,EAAAxU,OAAA,KAAAA,MAAA,CAAAgX,WAAA,KAAAA,UAAA,CAAArE,QAAA,IAAA8Y,EAAA,KAAA9Y,OAAA,EAAArV,IAAA,KAAAA,GAAA,IAAAozD,EAAAx4D,KAAA,gBAAAf,EAAA,IAAAu5D,EAAA,MAAA1wD,OAAA,EAAAgX,WAAA,YAAA7f,EAAAvC,IAAA,SAAAuC,CAAA,MAAA/D,EAAA,sBAAAs9D,EAAAt5C,QAAA,UAAAjgB,CAAA,CAAAkC,CAAA,UAAAjG,EAAA8e,OAAA,CAAA7Y,GAAA,mDAAAq3D,EAAA,MAAA1wD,OAAA3G,EAAAsZ,QAAA,CAAA0E,SAAAlgB,CAAA,KAAAkC,EAAA8X,YAAA,CAAAha,EAAAga,YAAA,SAAA9X,EAAA8X,YAAA,OAAAha,EAAA,CAAAkC,EAAA8X,YAAA,UAAAha,CAAA,CAAAkC,CAAA,OAAAhF,OAAA,CAAA8C,EAAA,KAAAlC,IAAA,CAAAoE,CAAA,KAAA/G,EAAAoN,MAAAvI,EAAA,MAAAmgB,KAAA,CAAAhlB,EAAAglB,KAAA,EAAAje,EAAA8X,YAAA,CAAA1Q,SAAA,CAAA1L,OAAA8C,MAAA,CAAA6H,MAAAe,SAAA,EAAApH,EAAA8X,YAAA,CAAA1Q,SAAA,CAAAxM,WAAA,CAAAoF,EAAA8X,YAAA,UAAA5X,EAAApC,CAAA,CAAA7E,CAAA,aAAA4gB,QAAA,SAAA9c,CAAA,CAAAkC,CAAA,MAAAtB,EAAA,IAAAD,EAAAI,EAAA7E,GAAA,GAAA0E,EAAAif,MAAA,EAAAjf,EAAAif,MAAA,CAAAwB,OAAA,QAAAnf,EAAA,IAAAe,EAAA8X,YAAA,8BAAArf,EAAA,IAAA6lB,eAAA,SAAAoiC,GAAA,CAAAjoD,EAAA+lB,KAAA,GAAA/lB,EAAAyhB,MAAA,gBAAApc,EAAAkC,EAAA/G,EAAA,CAAA0N,OAAAlO,EAAAkO,MAAA,CAAAgX,WAAAllB,EAAAklB,UAAA,CAAArE,QAAAxb,CAAAA,EAAArF,EAAAgmB,qBAAA,OAAAze,EAAA,IAAAoyB,EAAAt0B,EAAAmf,OAAA,qBAAAzJ,KAAA,UAAA1N,OAAA,UAAAhI,CAAA,MAAA7E,EAAA6E,EAAA0V,KAAA,MAAAzW,EAAA9D,EAAAwb,KAAA,GAAAsI,IAAA,MAAAhgB,EAAA,KAAAu7C,EAAAr/C,EAAAmC,IAAA,MAAA2hB,IAAA,GAAA/c,EAAAuZ,MAAA,CAAAxc,EAAAu7C,EAAA,IAAAt4C,CAAA,EAAA/G,CAAAA,EAAAgL,GAAA,iBAAAxL,EAAAA,EAAAimB,WAAA,CAAAzlB,EAAAqgB,OAAA,CAAAoC,GAAA,sBAAA48B,EAAA,aAAA7/C,EAAAA,EAAAolB,QAAA,CAAAplB,EAAAkmB,YAAA,CAAA5hB,EAAA,IAAAs6D,EAAA/e,EAAAr/C,GAAA,EAAAR,EAAA0hB,OAAA,YAAAlb,EAAA,sCAAAxG,EAAAmmB,SAAA,YAAA3f,EAAA,sCAAAxG,EAAAomB,OAAA,YAAA5f,EAAA,IAAAe,EAAA8X,YAAA,2BAAArf,EAAAqmB,IAAA,CAAAnhB,EAAA2e,MAAA,CAAA3e,EAAAsG,GAAA,iBAAAtG,EAAA+e,WAAA,CAAAjkB,EAAAsmB,eAAA,aAAAphB,EAAA+e,WAAA,EAAAjkB,CAAAA,EAAAsmB,eAAA,sBAAAtmB,GAAA6/C,GAAA7/C,CAAAA,EAAAumB,YAAA,SAAArhB,EAAA2b,OAAA,CAAAxT,OAAA,UAAAhI,CAAA,CAAAkC,CAAA,EAAAvH,EAAAwmB,gBAAA,CAAAjf,EAAAlC,EAAA,GAAAH,EAAAif,MAAA,EAAAjf,CAAAA,EAAAif,MAAA,CAAAsC,gBAAA,SAAAwhC,GAAAjoD,EAAA0mB,kBAAA,gBAAA1mB,EAAA2mB,UAAA,EAAAzhB,EAAAif,MAAA,CAAAyC,mBAAA,SAAAqhC,EAAA,GAAAjoD,EAAA6mB,IAAA,UAAA3hB,EAAAwd,SAAA,MAAAxd,EAAAwd,SAAA,IAAAjb,EAAAqf,QAAA,IAAAzhB,EAAA+Z,KAAA,EAAA/Z,CAAAA,EAAA+Z,KAAA,CAAA3X,EAAApC,EAAAub,OAAA,CAAA+Y,EAAAt0B,EAAA2e,OAAA,CAAA/e,EAAAI,EAAA0f,QAAA,CAAA65C,CAAA,EAAAr3D,EAAAqZ,OAAA,CAAA+Y,EAAApyB,EAAAyc,OAAA,CAAA/e,EAAAsC,EAAAwd,QAAA,CAAA65C,EAAAr3D,EAAA6X,KAAA,CAAA3X,EAAAxE,OAAA8L,cAAA,CAAAxH,EAAA,cAAA3E,MAAA,UAAA0B,EAAA8a,KAAA,CAAA2H,QAAA,WAAAziB,EAAA8a,KAAA,CAAA0H,QAAA,EAAAvf,EAAAs4C,CAAAA,EAAAv7C,GAAA8a,KAAA,EAAA4H,OAAA,CAAA64B,EAAAzgC,KAAA,CAAA7X,EAAA6X,KAAA,CAAAygC,EAAAzgC,KAAA,CAAA7X,EAAAqZ,OAAA,CAAAi/B,EAAAj/B,OAAA,CAAArZ,EAAAyc,OAAA,CAAA67B,EAAA77B,OAAA,CAAAzc,EAAAwd,QAAA,CAAA86B,EAAA96B,QAAA,CAAA1f,EAAAnF,OAAA,CAAAqH,EAAA,IAAAs3D,GAAAlH,GAAA+G,GAAAx+D,OAAA,iBAAA4+D,GAAAz5D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,MAAA6E,EAAAmiD,cAAA,CAAAjgD,GAAA,UAAA/G,EAAA,6CAAAk0D,QAAApwD,CAAA,EAAAyyB,GAAAv2B,EAAAoB,IAAA,EAAAi+C,EAAA,MAAAx6C,EAAAmiD,cAAA,CAAAljD,EAAAy6D,kBAAA,YAAAlf,EAAA,kDAAAmf,YAAAx4D,CAAA,EAAAuwB,GAAA8oB,EAAAj+C,IAAA,SAAA4E,CAAA,KAAAy4D,GAAApO,EAAA3pC,QAAA,EAAA2pC,EAAA/uD,MAAA,qBAAA+uD,EAAA/uD,MAAA,EAAA+uD,EAAA1pC,MAAA,CAAA0pC,EAAA9uD,SAAA,kCAAA8uD,EAAA/uD,MAAA,EAAA+uD,EAAA9uD,SAAA,mCAAA8uD,EAAA/uD,MAAA,EAAA+uD,EAAAzpC,GAAA,SAAAypC,EAAA1pC,MAAA,CAAA0pC,EAAA9uD,SAAA,sDAAA8uD,EAAA5yC,GAAA,aAAA8Y,GAAA1xB,CAAA,SAAA45D,GAAAhmD,MAAA,CAAA5T,EAAA,KAAAirD,GAAArtD,OAAAquD,MAAA,EAAAC,UAAA,KAAAqF,OAAA6G,GAAAyB,IAAA5L,GAAAvxD,UAAAk8D,GAAA15C,MAAAvf,EAAAmtB,MAAAosC,GAAAY,SAAArL,GAAAn3C,SAAA1Z,OAAAquD,MAAA,EAAAC,UAAA,KAAA6N,cAAA,eAAA/5D,CAAA,CAAAkC,CAAA,CAAA/G,EAAA,OAAA8D,EAAA,sCAAAiD,EAAA4B,QAAA,mBAAA3I,EAAA,GAAAq/C,EAAAr5C,EAAA,OAAA4a,QAAAqkC,GAAA,EAAAqZ,GAAAz5D,EAAAkC,GAAAs3D,GAAAv6D,GAAA,EAAAY,EAAA,OAAAsB,EAAA6c,IAAA,IAAAmH,MAAA,CAAAnlB,GAAA,CAAAA,EAAAsgB,OAAA,YAAAtgB,EAAA8lD,KAAA,eAAA9lD,EAAAg6D,QAAA,SAAAn6D,EAAA9D,MAAA,iBAAApB,EAAAkF,CAAA,WAAA26C,EAAAl1C,IAAA,CAAA6T,QAAA,KAAAxe,EAAAs/D,aAAA,MAAAt/D,CAAA,EAAAu/D,UAAAT,GAAAz3C,6BAAA0P,EAAA,SAAAyoC,GAAA3O,EAAA/uD,MAAA,EAAA+uD,EAAA9uD,SAAA,cAAA8uD,EAAA7uD,KAAA,oBAAAkuD,GAAA7qD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA8D,EAAA,IAAAu7C,EAAA,GAAAr5C,EAAAnB,EAAAqE,IAAA,CAAArE,EAAAqE,IAAA,CAAAtI,MAAA,MAAAmG,EAAAnG,MAAA,CAAAoF,EAAA,IAAAe,EAAAnG,MAAA,GAAAoF,EAAA,6CAAAe,EAAA,wBAAAlC,EAAA,OAAAA,EAAAlC,IAAA,sBAAAmB,CAAAA,EAAA,OAAA9D,CAAAA,EAAA6E,EAAAqE,IAAA,YAAAlJ,EAAA,OAAAA,EAAAa,GAAA,CAAAgE,GAAAA,EAAAlC,IAAA,aAAAmB,EAAAA,EAAA,KAAAu7C,CAAAA,EAAAt4C,EAAAysD,GAAA,UAAAzsD,EAAAs4C,EAAA,OAAA4f,GAAA,OAAAjT,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,gBAAA6E,EAAAlC,IAAA,WAAA++C,GAAA,mCAAArC,EAAA,IAAAr5C,IAAA,KAAAtB,EAAAlF,EAAA,CAAAkwD,GAAA7qD,EAAA,IAAAmB,EAAA,EAAA49C,EAAA/+C,EAAA+C,QAAA,CAAApI,EAAAoI,QAAA,MAAA6/C,EAAApI,EAAAz3C,QAAA,CAAApI,EAAAoI,QAAA,kBAAApI,EAAA0/D,iBAAA,EAAAzX,EAAAvoD,IAAA,IAAAM,EAAA0/D,iBAAA,EAAAxmB,GAAA,eAAAhvC,QAAA2qD,GAAA,2BAAA5M,GAAA,IAAA3nD,EAAA2mD,sBAAA,EAAA//C,KAAA+gD,EAAAhJ,UAAAz+C,EAAAoB,KAAA2F,EAAAlC,EAAAlC,IAAA,CAAAG,EAAA+B,KAAAH,GAAA,WAAA26C,EAAAz3C,QAAA,CAAAb,GAAAk4D,GAAAE,aAAA,CAAAp4D,EAAAlC,EAAA+C,QAAA,CAAA/C,EAAAlC,IAAA,EAAA08C,CAAA,QAAA8f,cAAAt6D,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,SAAA6E,EAAAkC,EAAAlG,GAAA,CAAAkG,GAAA,2BAAAA,EAAAA,EAAAa,QAAA,cAAA9D,EAAAe,CAAA,CAAAkC,EAAApE,IAAA,SAAAs8D,GAAAE,aAAA,CAAAr7D,EAAAiD,EAAAa,QAAA,CAAA5H,GAAAsnD,IAAA,QAAAjI,EAAA,IAAAv7C,EAAAiD,EAAA,IAAAs4C,EAAAuQ,EAAA/qD,CAAA,CAAAkC,EAAApE,IAAA,SAAAkC,EAAA,8CAAAkC,EAAApE,IAAA,gDAAA3C,EAAA,qBAAAA,EAAA,gDAAAqmD,OAAAhH,EAAAkH,WAAAziD,EAAAs7D,KAAA,CAAA9Y,SAAAxiD,EAAAwiD,QAAA,KAAAgB,IAAA,aAAA+X,GAAA,OAAArT,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,kBAAAu7C,IAAA,KAAAr5C,EAAA,IAAAtB,EAAAqC,KAAAs4C,GAAA,EAAA7/C,EAAA,CAAAkwD,GAAA7qD,EAAA,IAAAw6C,EAAA,cAAAv7C,EAAAoH,cAAA,qGAAApH,EAAAoH,cAAA,CAAAxG,EAAA,OAAAsB,CAAAA,EAAAxG,EAAAyI,OAAA,YAAAjC,EAAAA,EAAA,GAAAxG,EAAAwE,OAAA,QAAAa,EAAA,OAAAgrD,GAAAhrD,EAAA7E,EAAA,UAAAs/D,GAAA,OAAAtT,MAAAnnD,CAAA,CAAAkC,CAAA,YAAAjD,IAAA,KAAAu7C,EAAAr5C,EAAAtB,EAAA,KAAAlF,EAAA,CAAAkwD,GAAA7qD,EAAA,IAAAf,EAAA,EAAA2jD,EAAA,IAAA3nD,EAAAosD,WAAA,IAAA1sD,EAAA+/D,eAAA,EAAA//D,EAAA0/C,YAAA,8EAAAG,CAAAA,EAAA7/C,EAAA+/D,eAAA,YAAAlgB,GAAAA,EAAAxyC,OAAA,CAAAhI,GAAA4iD,EAAAxiD,GAAA,CAAAJ,IAAA,OAAAmB,CAAAA,EAAAxG,EAAA0/C,YAAA,YAAAl5C,GAAAA,EAAA6G,OAAA,CAAAhI,GAAA4iD,EAAAxiD,GAAA,CAAAJ,IAAA4iD,EAAAxiD,GAAA,CAAA8B,KAAAjD,IAAA,OAAAY,CAAAA,EAAAlF,EAAAggE,gBAAA,YAAA96D,GAAAA,EAAAmI,OAAA,CAAAhI,GAAA4iD,EAAAxiD,GAAA,CAAAJ,IAAA4iD,CAAA,SAAA2H,GAAAztD,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,EAAAuvD,IAAA,CAAAzrD,EAAA,IAAAuqD,GAAAxpD,EAAA,MAAAw6C,MAAAr5C,EAAAxG,EAAAioD,CAAA,MAAAgF,QAAA,CAAAzsD,EAAA,KAAAy/D,KAAA,CAAA37D,EAAA,KAAA47D,IAAA,CAAA76D,EAAA,KAAA86D,UAAA,CAAA54D,EAAA,KAAA64D,QAAA,CAAAC,GAAA94D,GAAA,KAAA+4D,IAAA,UAAAzgB,EAAAr5C,EAAAxG,EAAA,EAAAwG,EAAA,GAAAxG,EAAA,GAAAioD,EAAA,UAAApI,CAAAA,EAAAx6C,EAAA8lD,KAAA,YAAAtL,GAAAA,EAAAl8B,OAAA,CAAAtW,OAAA,CAAAwyC,GAAA,KAAAsS,EAAAsN,GAAAjT,KAAA,CAAA3M,EAAA,CAAAx6C,EAAAkC,IAAAjD,EAAAunD,WAAA,CAAAuK,WAAA,CAAA/wD,EAAAkC,GAAAA,EAAA4qD,CAAAA,EAAA/pD,QAAA,CAAA/C,GAAA,KAAAf,EAAA,SAAAe,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,aAAA9D,EAAA2C,IAAA,MAAA3C,EAAA,CAAAs9D,GAAA,GAAAz4D,GAAA,YAAAkC,EAAA4D,MAAA,4GAAA07C,OAAAt/C,EAAA4D,MAAA,CAAApJ,SAAA,CAAAglD,WAAA,GAAAD,SAAA,KAAAD,OAAAwZ,GAAAh7D,GAAA0hD,WAAA,GAAAD,SAAA,KAAAD,OAAArmD,EAAAumD,WAAA,GAAAD,SAAA,KAAAD,OAAAvmD,EAAAq+C,aAAA,CAAAM,SAAA,CAAA8H,WAAA,GAAAD,SAAA,KAAAD,OAAAxhD,EAAA0hD,WAAA,GAAAD,SAAA,YAAA1C,EAAA5jD,EAAA4H,QAAA,CAAA9D,GAAA,EAAAuiD,OAAAwZ,GAAAh7D,GAAA0hD,WAAA,GAAAD,SAAA,MAAAv/C,EAAA/G,EAAAq/C,EAAAx6C,GAAA,OAAAf,EAAAgyB,MAAA,CAAAmpC,GAAAE,aAAA,CAAAt6D,EAAAw6C,EAAAz3C,QAAA,CAAAy3C,EAAA18C,IAAA,QAAArD,EAAAggE,GAAAtT,KAAA,CAAA3M,EAAAsS,GAAAhlB,EAAA0yB,GAAArT,KAAA,CAAA3M,EAAA//C,EAAAkwD,EAAA3qD,GAAA7E,GAAAynB,EAAA0oC,IAAA9Q,EAAA18C,IAAA,CAAAqD,CAAAA,CAAA,CAAAyhB,EAAA,CAAAkqC,EAAAnyD,CAAA,CAAAioB,EAAA,CAAAnoB,EAAAmoD,CAAA,CAAAhgC,EAAA,CAAAklB,CAAA,IAAA3mC,EAAAxG,EAAAioD,EAAA,OAAA4D,WAAA,CAAAhM,EAAA,KAAAr3C,WAAA,CAAAhC,EAAA,KAAA04D,GAAA,CAAAl/D,CAAA,KAAAi/C,WAAA,aAAAkhB,UAAA,OAAA/gD,OAAA,KAAA/Z,EAAA,KAAAo6C,OAAA,GAAAl4C,EAAA,WAAA0lD,QAAA,CAAAnlD,UAAA,CAAA0/C,cAAA,CAAAniD,GAAA,UAAAkC,EAAA,sCAAAlC,EAAA8D,QAAA,UAAA3I,EAAA,KAAA0/D,IAAA,CAAA/U,KAAA,KAAA3qD,EAAA,wDAAA2vD,GAAA3vD,EAAAsB,MAAA,CAAAqB,IAAA,GAAA+zD,OAAA,CAAA3vD,EAAA3F,IAAA,CAAAJ,KAAA,gEAAAy+D,KAAA,CAAA9U,KAAA,CAAAlyC,MAAA,CAAA1R,EAAA3F,IAAA,EAAA69C,SAAA,aAAA2gB,QAAA,CAAAG,UAAAl7D,CAAA,iBAAAi7D,IAAA,aAAAA,IAAA,CAAAjI,EAAA,KAAA9wD,EAAA,GAAAypD,CAAAA,GAAA,EAAAxwD,EAAA,KAAAysD,QAAA,CAAAnlD,UAAA,CAAA04D,eAAA,MAAA/gB,OAAA,GAAAp6C,GAAA,KAAA7E,EAAA,KAAAy/D,KAAA,CAAA9U,KAAA,CAAAlyC,MAAA,CAAA5T,EAAAzD,IAAA,EAAA2F,EAAAk5D,IAAA,UAAAjgE,EAAA,EAAA6E,GAAA,YAAAi7D,IAAA,EAAAjI,GAAA9wD,EAAAm5D,SAAAlgE,CAAA,EAAA+G,CAAA,CAAAo5D,aAAA,aAAAL,IAAA,OAAArT,QAAA,CAAAnlD,UAAA,CAAA84D,2BAAA,MAAAN,IAAA,CAAAI,QAAA,EAAAv9C,IAAA,gBAAAm9C,IAAA,QAAAO,KAAA,CAAA32D,QAAA9D,KAAA,YAAAi6D,GAAAh7D,CAAA,MAAAkC,EAAA,CAAAu2D,GAAA,GAAAz4D,GAAA,OAAAq4D,GAAAn2D,EAAA,cAAAlC,EAAA,OAAAopD,GAAAtsD,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,OAAAihB,WAAA,CAAAv5D,EAAA,KAAA44D,UAAA,CAAA3/D,EAAA,KAAA4N,SAAA,OAAA9J,EAAAA,EAAAyrD,IAAA,MAAAgR,MAAA,OAAAlhB,EAAAA,EAAA,IAAAgP,GAAAxpD,EAAA,MAAA27D,KAAA,MAAAD,MAAA,CAAA34D,QAAA,CAAArH,IAAA,CAAAwG,EAAA,KAAAxG,MAAA,aAAAigE,KAAA,KAAA/hB,WAAA,aAAAkhB,UAAA,KAAAlT,UAAA,aAAA7+C,SAAA,KAAA6xD,OAAA,aAAAc,MAAA,OAAAE,cAAA57D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,WAAAgnD,cAAA,CAAAniD,EAAAkC,GAAA,cAAA/G,EAAA,UAAAugE,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAA3C,EAAAoB,IAAA,QAAAwd,MAAA/Z,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,WAAAygE,aAAA,CAAA57D,EAAAkC,GAAA,UAAA/G,EAAA,sCAAA6E,EAAA8D,QAAA,aAAA3I,CAAA,OAAA0gE,cAAA77D,CAAA,CAAAkC,CAAA,eAAAurD,GAAA,KAAA1kD,SAAA,CAAAtG,UAAA,CAAAzC,EAAAhE,GAAA,CAAAgE,GAAA+qD,EAAA/qD,IAAAkC,EAAA,EAAAlG,GAAA,CAAAgE,GAAA,MAAAA,EAAA,UAAA07D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,OAAAkC,EAAA,OAAAA,EAAAgD,OAAA,CAAAzG,IAAA,SAAA6jD,IAAApgD,CAAA,oBAAA+I,SAAA,CAAAtG,UAAA,CAAAq5D,kBAAA,MAAAhB,UAAA,EAAAl4D,WAAA,KAAAmG,SAAA,CAAAtG,UAAA,CAAAG,UAAA,CAAAm5D,QAAA,EAAAhK,OAAA,KAAA6I,KAAA,CAAA73D,QAAA,CAAAgvD,MAAA,MAAA0J,WAAA,CAAA39D,IAAA,CAAAkC,aAAAzE,EAAAyE,EAAA,YAAArE,MAAA6D,OAAA,CAAAQ,GAAAA,EAAA,OAAAhE,GAAA,GAAAwlD,OAAAxhD,CAAA,CAAAgD,QAAAd,CAAA,MAAAxF,UAAAsD,EAAAgD,QAAA,KAAA04D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAoE,EAAA3F,IAAA,KAAA2+D,UAAAl7D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA6gE,GAAAp+C,GAAA,CAAA5d,EAAA8D,QAAA,OAAA3I,EAAA,OAAAA,EAAA63D,EAAA,KAAA/zD,EAAA,GAAA0sD,CAAAA,GAAA,EAAA3rD,EAAA+qD,EAAA/qD,GAAA,IAAAw6C,EAAA,KAAAzxC,SAAA,CAAAtG,UAAA,CAAA04D,eAAA,CAAAn7D,EAAAA,GAAA,KAAAkC,EAAA,KAAAw5D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAkC,EAAAzD,IAAA,EAAA0C,EAAAm8D,IAAA,UAAAl5D,EAAA,EAAAA,GAAA,OAAA85D,GAAA97D,GAAA,CAAAF,EAAA8D,QAAA,IAAAkvD,GAAA/zD,EAAAo8D,SAAA7gB,CAAA,GAAAv7C,CAAA,OAAAq8D,YAAAt7D,CAAA,MAAAkC,EAAA85D,GAAAp+C,GAAA,CAAA5d,EAAA8D,QAAA,GAAA5B,CAAAA,EAAA85D,IAAA,WAAAjzD,SAAA,CAAAtG,UAAA,CAAA84D,2BAAA,CAAAr5D,EAAAm5D,QAAA,EAAAv9C,IAAA,MAAAk+C,GAAA1C,MAAA,CAAAt5D,EAAA8D,QAAA,MAAA03D,KAAA,CAAA32D,QAAA9D,KAAA,EAAA8D,QAAAo3D,IAAA,oCAAAC,kBAAAl8D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAAO,IAAA,kBAAAqN,SAAA,CAAAjD,MAAA,2GAAA7K,EAAAq+C,aAAA,CAAAC,aAAA,EAAAC,WAAA,KAAAzwC,SAAA,CAAAjD,MAAA,CAAApJ,SAAA,CAAA+8C,iBAAAz5C,EAAAtD,SAAA,CAAAg9C,MAAA,MAAAx3C,EAAAA,EAAA/G,CAAA,CAAAuK,SAAA,WAAAqD,SAAA,CAAAtG,UAAA,CAAA05D,iCAAA,OAAAj6D,EAAAA,EAAA/G,CAAA,EAAAy+C,UAAA,KAAAkhB,UAAA,SAAA/B,WAAA,GAAA/4D,CAAA,MAAAkC,EAAA,WAAAk3D,iBAAA,IAAAp5D,GAAA,kBAAA+Z,KAAA,CAAA7X,EAAA,OAAAk3D,kBAAA,GAAAp5D,CAAA,eAAA24D,GAAA,KAAAmC,UAAA,IAAA96D,EAAA,OAAAmiD,eAAAniD,CAAA,CAAAkC,CAAA,oBAAA6G,SAAA,CAAAtG,UAAA,CAAA0/C,cAAA,CAAA4I,EAAA/qD,GAAAkC,EAAA,MAAA85D,GAAA,IAAA/7D,IAAAm8D,GAAA,GAAAC,GAAA,SAAAzS,GAAA9sD,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,OAAA2/D,UAAA,CAAA96D,EAAA,KAAA+I,SAAA,CAAA7G,EAAA,KAAAo6D,YAAA,KAAAzS,GAAA7pD,EAAA7E,GAAA,KAAAohE,eAAA,KAAAt8D,IAAA,KAAAu8D,eAAA,KAAAv8D,IAAA,KAAAw8D,gBAAA,GAAAr7C,iBAAAphB,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,IAAA8D,EAAA,KAAAw9D,gBAAA,aAAAA,gBAAA,IAAAz8D,KAAA,KAAAu8D,eAAA,OAAAC,eAAA,CAAAt8D,GAAA,CAAAF,EAAA,SAAAw8D,eAAA,CAAAt8D,GAAA,CAAAF,EAAA,QAAA7E,CAAAA,EAAA,KAAAqhE,eAAA,CAAA5+C,GAAA,CAAA5d,EAAA,YAAA7E,EAAAA,EAAA,IAAA81B,MAAA,CAAAhyB,IAAA,KAAAs9D,eAAA,CAAAr8D,GAAA,CAAAjB,EAAA,CAAAe,EAAAkC,EAAA,gBAAAw6D,qBAAA,QAAAA,qBAAA,MAAA3zD,SAAA,CAAAtG,UAAA,CAAAk6D,MAAA,MAAA7B,UAAA,EAAA96D,EAAAkC,IAAA,KAAAlC,EAAAuF,GAAA,SAAApK,KAAA,KAAAmhE,YAAA,CAAAM,SAAA,CAAA58D,EAAA0E,IAAA,OAAAzF,EAAA,KAAAu9D,eAAA,CAAA5+C,GAAA,CAAAziB,EAAA2C,IAAA,CAAAmB,CAAAA,GAAAA,EAAA+I,OAAA,CAAA/I,GAAA,KAAAu7C,EAAA,KAAA+hB,eAAA,CAAA3+C,GAAA,CAAA3e,GAAA,GAAAu7C,EAAA,MAAAv7C,EAAA,CAAAu7C,EAAAv7C,EAAA9D,EAAAoB,IAAA,CAAA2F,EAAAoD,IAAA,CAAAtF,EAAAsH,SAAA,SAAArI,CAAA,OAAAsiB,oBAAAvhB,CAAA,MAAAkC,EAAA,KAAAq6D,eAAA,CAAA3+C,GAAA,CAAA5d,GAAA,IAAAkC,EAAA,8BAAAlC,EAAA,sBAAA7E,EAAA,CAAA+G,EAAAjD,EAAA,KAAAu9D,eAAA,CAAA5+C,GAAA,CAAAziB,GAAA,IAAA8D,EAAA,+CAAA9D,EAAA,SAAAohE,eAAA,CAAAjD,MAAA,CAAAt5D,GAAA,IAAAf,CAAAA,EAAAA,EAAAkmB,MAAA,CAAAjjB,GAAAA,IAAAlC,EAAA,EAAAjE,MAAA,OAAAygE,eAAA,CAAAlD,MAAA,CAAAn+D,GAAA,QAAAohE,eAAA,CAAA7gE,IAAA,EAAAkwD,CAAAA,EAAAhsC,EAAA,UAAA48C,eAAA,CAAA9gE,IAAA,gBAAAghE,qBAAA,cAAA3zD,SAAA,CAAAtG,UAAA,CAAAo6D,oBAAA,MAAAH,qBAAA,OAAAA,qBAAA,iBAAA7S,GAAA/sD,YAAAkD,CAAA,CAAAkC,CAAA,OAAA04D,KAAA,CAAA14D,EAAA,KAAA03C,SAAA,CAAA55C,CAAA,EAAA48D,UAAA58D,CAAA,MAAAkC,EAAA,IAAA46D,GAAA98D,GAAA7E,EAAA,IAAA4hE,GAAA99D,EAAAiD,EAAAvD,IAAA,eAAAM,GAAA,KAAAe,EAAAw6C,EAAAr5C,EAAA,MAAA67D,SAAA,CAAA7hE,EAAA8D,EAAAe,CAAAA,GAAA,OAAAA,CAAAA,EAAAw6C,GAAAr/C,EAAAd,IAAA,CAAAmgD,GAAAr5C,GAAAhG,EAAAwzD,GAAA,GAAA1vD,EAAAiD,EAAAvD,IAAA,IAAAq+D,UAAAh9D,CAAA,CAAAkC,CAAA,SAAAlC,EAAAmgB,KAAA,CAAApkB,MAAA,IAAAiE,EAAAqvD,OAAA,UAAAzV,SAAA,CAAA91C,QAAA,QAAAm5D,gBAAA,CAAA/6D,GAAA,cAAAg7D,eAAA,CAAAh7D,GAAA,CAAA+6D,iBAAAj9D,CAAA,KAAAA,EAAAmvD,UAAA,mBAAAnvD,EAAAmvD,UAAA,wBAAAjtD,EAAAlC,EAAAmvD,UAAA,kBAAAnvD,EAAA7D,KAAA,CAAAigE,IAAAp8D,EAAA7D,KAAA,CAAAkgE,GAAA,aAAAzB,KAAA,CAAA5I,MAAA,CAAAp+C,MAAA,CAAA1R,GAAA,6BAAAg7D,eAAA,CAAAl9D,GAAA,CAAAk9D,gBAAAl9D,CAAA,MAAAkC,EAAAlC,EAAA0V,KAAA,uBAAAxT,EAAA+1B,KAAA,qCAAA/1B,EAAAitD,UAAA,iBAAAvV,SAAA,CAAA91C,QAAA,mBAAA81C,SAAA,CAAA91C,QAAA,OAAA5B,EAAAqtD,QAAA,uCAAAwN,GAAAjgE,aAAA,MAAAqjB,KAAA,IAAAkvC,SAAA,QAAAzD,EAAAhsC,EAAA,MAAAO,KAAA,CAAApkB,MAAA,SAAAokB,KAAA,MAAAA,KAAA,CAAApkB,MAAA,IAAA1B,KAAA2F,CAAA,OAAAmgB,KAAA,CAAA9lB,IAAA,CAAA2F,EAAA,CAAA2uD,KAAA,CAAA/C,EAAAhsC,EAAA,MAAAO,KAAA,CAAApkB,MAAA,SAAAokB,KAAA,CAAAwuC,GAAA,UAAAmO,GAAAhgE,YAAAkD,CAAA,OAAA0E,IAAA,CAAA1E,CAAA,CAAArB,MAAA,aAAA+F,IAAA,CAAA3I,MAAA,iBAAAiE,EAAA,KAAA0E,IAAA,gBAAAA,IAAA,MAAAA,IAAA,CAAAvI,KAAA,IAAA6D,CAAA,MAAAm9D,GAAA,IAAAliE,EAAA0e,SAAA,yDAAAyjD,IAAA,YAAA9S,GAAA+S,GAAA,KAAAA,GAAA,CAAAC,QAAA,QAAAx/D,KAAA,YAAAu8C,aAAA,EAAAv8C,KAAA,iBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,OAAAK,KAAA,gBAAAL,KAAA,cAAAK,KAAA,kBAAAL,KAAA,CAAA2kB,QAAA,iBAAAtkB,KAAA,oBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,qBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,IAAAL,KAAA,SAAAK,KAAA,WAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,cAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,UAAAK,KAAA,UAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,WAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,UAAAK,KAAA,SAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,eAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,gBAAAL,KAAA,OAAAK,KAAA,eAAAL,KAAA,CAAA2kB,QAAA,iBAAAtkB,KAAA,SAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,UAAAK,KAAA,OAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,UAAAK,KAAA,eAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,cAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,gBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,cAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,kBAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,cAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,SAAAK,KAAA,iBAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,WAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,SAAAK,KAAA,gBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,SAAAK,KAAA,cAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,SAAAK,KAAA,qBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,YAAAL,KAAA,gBAAAK,KAAA,aAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,KAAAvG,KAAA,qBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,YAAAL,KAAA,gBAAAK,KAAA,sBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,IAAAL,KAAA,SAAAK,KAAA,kBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,OAAAK,KAAA,gBAAAL,KAAA,cAAAK,KAAA,kBAAAL,KAAA,CAAA2kB,QAAA,iBAAArf,SAAA,EAAAjF,KAAA,OAAAL,KAAA,CAAA+yD,KAAA,SAAAx6C,OAAA,EAAAlY,KAAA,gBAAAL,KAAA,CAAA2kB,QAAA,eAAAtkB,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,OAAAK,KAAA,gBAAAL,KAAA,SAAAK,KAAA,kBAAAL,KAAA,CAAA2kB,QAAA,kBAAAtkB,KAAA,QAAAL,KAAA,CAAA+yD,KAAA,SAAAx6C,OAAA,EAAAlY,KAAA,OAAAL,KAAA,cAAAK,KAAA,YAAAL,KAAA,cAAAK,KAAA,SAAAL,KAAA,QAAAK,KAAA,WAAAL,KAAA,CAAA2kB,QAAA,eAAAtkB,KAAA,QAAAL,KAAA,OAAAK,KAAA,WAAAL,KAAA,CAAA2kB,QAAA,SAAAtkB,KAAA,kBAAAL,KAAA,QAAAK,KAAA,iBAAAL,KAAA,CAAA2kB,QAAA,yBAAAm7C,GAAAzgE,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,CAAAr5C,CAAA,OAAAq8D,KAAA,CAAAx9D,EAAA,KAAAy9D,SAAA,CAAAv7D,EAAA,KAAA6G,SAAA,CAAA5N,EAAA,KAAA2/D,UAAA,CAAA77D,EAAA,KAAAy+D,MAAA,CAAAljB,EAAA,KAAAmjB,aAAA,KAAAC,GAAAziE,EAAAgG,EAAA,OAAAgb,SAAA,SAAAnc,EAAA,EAAAA,EAAA,KAAA09D,MAAA,CAAA36D,QAAA,CAAAhH,MAAA,CAAAiE,GAAA,OAAAkC,EAAA,KAAAw7D,MAAA,CAAA36D,QAAA,CAAA/C,EAAA,CAAA7E,EAAAmwD,IAAAppD,EAAApE,IAAA,MAAAoE,EAAAu/C,QAAA,OAAAgc,SAAA,CAAAtiE,EAAA,CAAA0nD,QAAA1kC,GAAA,CAAAo/C,GAAAM,cAAA,CAAA1iE,IAAA,MAAAsiE,SAAA,CAAAtiE,EAAA,QAAAsiE,SAAA,CAAAtiE,EAAA,CAAAoiE,GAAAM,cAAA,CAAA1iE,EAAA,wBAAA4N,SAAA,CAAAjD,MAAA,yGAAA23D,SAAA,CAAAtiE,EAAA,MAAA4N,SAAA,CAAAjD,MAAA,CAAApJ,SAAA,UAAAsD,EAAA,EAAAA,EAAA,KAAA09D,MAAA,CAAA36D,QAAA,CAAAhH,MAAA,CAAAiE,GAAA,OAAAkC,EAAA,KAAAw7D,MAAA,CAAA36D,QAAA,CAAA/C,EAAA,CAAA7E,EAAAmwD,IAAAppD,EAAApE,IAAA,CAAAoE,CAAAA,EAAA47D,GAAA,EAAA57D,EAAA47D,GAAA,CAAArf,KAAA,CAAA1iD,MAAA,UAAA0hE,SAAA,CAAAtiE,EAAA,aAAA4iE,eAAA,CAAA77D,EAAA,QAAA67D,gBAAA/9D,CAAA,MAAAA,EAAA89D,GAAA,GAAA99D,EAAA89D,GAAA,CAAArf,KAAA,oCAAAtjD,EAAA,MAAA4gB,QAAAqkC,GAAA,CAAApgD,EAAA89D,GAAA,CAAArf,KAAA,CAAAziD,GAAA,CAAAgE,GAAA,KAAA4Z,QAAA,CAAA5Z,KAAAf,EAAA,WAAA++D,cAAA,CAAAh+D,GAAA,CAAAw6C,EAAA,OAAAv/C,EAAA0e,SAAA,CAAA6kC,kBAAA,CAAArjD,EAAA8D,EAAA,MAAAw+D,SAAA,CAAAnS,IAAAtrD,EAAAlC,IAAA,GAAA08C,CAAA,OAAAwjB,eAAAh+D,CAAA,MAAA7E,EAAA,YAAAA,CAAAA,EAAA6E,EAAA89D,GAAA,YAAA3iE,EAAA,OAAAA,EAAAy+C,SAAA,cAAAkhB,UAAA,QAAA96D,EAAA89D,GAAA,CAAAlkB,SAAA,CAAA4W,IAAA,yBAAAv1D,EAAA0e,SAAA,MAAAskD,aAAA,CAAAj+D,EAAA89D,GAAA,CAAAlkB,SAAA,CAAAr8C,KAAA,yBAAA2gE,QAAA,CAAAl+D,EAAA89D,GAAA,CAAAlkB,SAAA,kCAAAukB,YAAA,CAAAn+D,EAAA89D,GAAA,CAAAlkB,SAAA,uDAAA55C,EAAA89D,GAAA,CAAAlkB,SAAA,CAAA4W,IAAA,WAAA52C,SAAA5Z,CAAA,SAAAA,EAAAwwD,IAAA,0BAAAyN,aAAA,CAAAj+D,EAAA,6BAAAo+D,WAAA,CAAAp+D,EAAA,iCAAAq+D,eAAA,CAAAr+D,EAAA,8CAAAA,EAAAwwD,IAAA,KAAAyN,cAAAj+D,CAAA,cAAAs+D,aAAA,CAAAt+D,EAAAvC,IAAA,CAAAuC,EAAAzC,KAAA,QAAA6gE,YAAAp+D,CAAA,MAAAkC,EAAA,KAAAg8D,QAAA,CAAAl+D,GAAA,YAAAs+D,aAAA,CAAAt+D,EAAAvC,IAAA,CAAAyE,EAAA,CAAAg8D,SAAAl+D,CAAA,MAAAkC,EAAAopD,IAAAtrD,EAAA5C,IAAA,CAAAsY,KAAA,UAAAva,EAAA,KAAAuiE,MAAA,CAAAr5D,IAAA,CAAA6qD,SAAA,CAAAlvD,GAAAA,EAAAlC,IAAA,GAAAoE,GAAA,QAAA/G,EAAA,iDAAA+G,EAAA,eAAAs7D,KAAA,CAAAriE,EAAA,OAAAkjE,gBAAAr+D,CAAA,MAAAkC,EAAA,WAAAi8D,YAAA,CAAAn+D,GAAA,YAAAs+D,aAAA,CAAAt+D,EAAAvC,IAAA,CAAAyE,EAAA,OAAAi8D,aAAAn+D,CAAA,MAAAkC,EAAAlC,EAAA5C,IAAA,CAAAsY,KAAA,MAAAva,EAAA+G,CAAA,IAAAjD,EAAA,KAAAw+D,SAAA,CAAAnS,IAAAnwD,GAAA,QAAA+G,EAAAnG,MAAA,QAAAkD,CAAA,KAAAu7C,EAAA,WAAAmjB,aAAA,CAAAY,YAAA,CAAAv+D,EAAAgD,OAAA,CAAA/D,GAAA,YAAAu/D,iBAAA,CAAAhkB,EAAAt4C,EAAA/F,KAAA,KAAAqiE,kBAAAx+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAA+G,EAAAnG,MAAA,IAAAZ,EAAA6E,CAAA,CAAAsrD,IAAAppD,CAAA,MAAAA,EAAAA,EAAA/F,KAAA,WAAAhB,CAAA,CAAAmjE,cAAAt+D,CAAA,CAAAkC,CAAA,SAAAlC,GAAA,gBAAAzE,EAAA2d,IAAA,EAAAhX,EAAA,gBAAA/G,EAAAI,EAAAknB,KAAA,WAAAtnB,EAAAsjE,aAAA,CAAAv8D,GAAA/G,CAAA,eAAA8D,EAAA1D,EAAAknB,KAAA,WAAAxjB,EAAA0W,aAAA,CAAAzT,GAAAjD,CAAA,eAAAu7C,EAAAj/C,EAAAknB,KAAA,WAAA+3B,EAAAkkB,gBAAA,CAAAtZ,OAAAljD,IAAAs4C,CAAA,qBAAAj/C,EAAA2d,IAAA,CAAArF,EAAA3R,GAAA,wBAAAA,EAAA0X,QAAA,cAAA5Z,EAAAvE,KAAA,QAAAF,EAAA2d,IAAA,CAAAhX,EAAA,sCAAAlC,EAAA,KAAAu9D,GAAAM,cAAA,EAAAc,uBAAA1F,GAAA2F,KAAA3jE,EAAA4jE,kBAAA,CAAAC,cAAA7jE,EAAAq+C,aAAA,CAAAM,SAAA,CAAAmlB,aAAA/F,EAAA,QAAA4E,GAAA9gE,YAAAkD,CAAA,CAAAkC,CAAA,OAAA6G,SAAA,CAAA/I,EAAA,KAAAy9D,SAAA,CAAAv7D,EAAA,KAAA88D,MAAA,KAAA/+D,GAAA,OAAAs+D,aAAAv+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA+G,EAAA4B,QAAA,YAAAk7D,MAAA,CAAA7gD,GAAA,CAAAhjB,IAAA,oBAAA6E,EAAA,KAAAA,EAAA,WAAA+I,SAAA,CAAAtG,UAAA,CAAA0/C,cAAA,CAAAjgD,GAAA,UAAAlC,EAAA,wCAAA7E,EAAA,OAAA8D,EAAAm+D,KAAAr6D,QAAA,CAAA6Q,MAAA,SAAA5T,EAAAzD,IAAA,OAAAyiE,MAAA,CAAA9+D,GAAA,CAAA/E,EAAA8D,EAAA,UAAAA,EAAA,KAAAw+D,SAAA,CAAAnS,IAAAtrD,GAAA,CAAA+Z,KAAA,CAAA7X,GAAA,KAAA88D,MAAA,CAAA9+D,GAAA,CAAA/E,EAAA8D,EAAA,cAAA+/D,MAAA,CAAAphD,GAAA,CAAAziB,EAAA,QAAA6uD,GAAA,OAAA7C,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,CAAAr5C,CAAA,CAAAtB,CAAA,CAAAlF,CAAA,CAAAioD,CAAA,YAAAkK,IAAA,IAAAmS,GAAAnS,EAAA7tD,EAAAu7C,EAAAr5C,EAAAtB,EAAAlF,EAAAqF,EAAAkC,EAAA/G,EAAAynD,EAAA,QAAAqc,GAAAniE,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,CAAAr5C,CAAA,CAAAtB,CAAA,CAAAlF,CAAA,CAAAioD,CAAA,CAAAkK,CAAA,OAAA0Q,KAAA,CAAAx9D,EAAA,KAAAk/D,KAAA,CAAAh9D,EAAA,KAAAi9D,KAAA,CAAAhkE,EAAA,KAAAikE,MAAA,CAAAngE,EAAA,KAAAogE,WAAA,CAAA7kB,EAAA,KAAA8kB,OAAA,CAAAn+D,EAAA,KAAAs8D,SAAA,SAAA8B,kBAAA,SAAAC,QAAA,SAAAC,gBAAA,SAAAC,iBAAA,SAAAC,oBAAA,SAAAC,iBAAA,KAAArC,GAAAv9D,EAAA,KAAAy9D,SAAA,CAAA59D,EAAAlF,EAAAioD,EAAAkK,EAAA,OAAA+S,SAAA,aAAAF,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,QAAAshD,SAAA,CAAA16D,SAAA/C,CAAA,cAAA2/D,oBAAA,IAAA/hE,OAAAC,MAAA,MAAA4/D,SAAA,CAAAz9D,GAAA,KAAA8/D,eAAA9/D,CAAA,cAAA2/D,oBAAA,IAAA/hE,OAAAC,MAAA,MAAA4/D,SAAA,CAAAz9D,GAAA,KAAAoD,QAAApD,CAAA,cAAAw/D,QAAA,MAAAA,QAAA,CAAAvuC,MAAA,CAAAjxB,GAAA,KAAAq6D,kBAAAr6D,CAAA,cAAAu/D,kBAAA,MAAAA,kBAAA,CAAAtuC,MAAA,CAAAjxB,GAAA,KAAA06D,gBAAA16D,CAAA,cAAAy/D,gBAAA,MAAAA,gBAAA,CAAAxuC,MAAA,CAAAjxB,GAAA,KAAA26D,iBAAA36D,CAAA,cAAA0/D,iBAAA,MAAAA,iBAAA,CAAAzuC,MAAA,CAAAjxB,GAAA,WAAA65D,IAAA75D,CAAA,cAAA2/D,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,QAAAijD,MAAA,SAAA5B,KAAA,EAAAz6D,SAAA,KAAA06D,SAAA,CAAAr6D,QAAA,KAAAo8D,QAAA,CAAAnF,kBAAA,KAAAkF,kBAAA,CAAA7E,gBAAA,KAAA+E,gBAAA,CAAA9E,iBAAA,KAAA+E,iBAAA,CAAAvgE,QAAAa,CAAA,SAAA8c,KAAA9c,CAAA,UAAA2/D,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,SAAAmjD,OAAA,0DAAAA,OAAA,SAAA9B,KAAA,EAAAz6D,SAAA,KAAA06D,SAAA,CAAAr6D,QAAA,KAAAo8D,QAAA,CAAAnF,kBAAA,KAAAkF,kBAAA,CAAA7E,gBAAA,KAAA+E,gBAAA,CAAA9E,iBAAA,KAAA+E,iBAAA,CAAAvgE,QAAAa,CAAA,SAAAqI,SAAArI,CAAA,cAAA2/D,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,QAAAkjD,WAAA,SAAA7B,KAAA,EAAAz6D,SAAA,KAAA06D,SAAA,CAAAr6D,QAAA,KAAAo8D,QAAA,CAAAnF,kBAAA,KAAAkF,kBAAA,CAAA7E,gBAAA,KAAA+E,gBAAA,CAAA9E,iBAAA,KAAA+E,iBAAA,CAAAvgE,QAAAa,CAAA,SAAAwmD,aAAA,aAAAmZ,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,QAAA+iD,KAAA,SAAA1B,KAAA,EAAAz6D,SAAA,KAAA06D,SAAA,CAAAr6D,QAAA,KAAAo8D,QAAA,CAAAnF,kBAAA,KAAAkF,kBAAA,CAAA7E,gBAAA,KAAA+E,gBAAA,CAAA9E,iBAAA,KAAA+E,iBAAA,SAAAv8D,aAAA,aAAAw8D,oBAAA,aAAAC,iBAAA,CAAAzjD,OAAA,QAAAgjD,KAAA,SAAA3B,KAAA,EAAAz6D,SAAA,KAAA06D,SAAA,CAAAr6D,QAAA,KAAAo8D,QAAA,CAAAnF,kBAAA,KAAAkF,kBAAA,CAAA7E,gBAAA,KAAA+E,gBAAA,CAAA9E,iBAAA,KAAA+E,iBAAA,UAAAxV,GAAAptD,YAAAkD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,EAAAiD,EAAA6oD,EAAA7oD,GAAA/G,GAAAA,CAAAA,EAAAuvD,IAAA,OAAAmQ,IAAA,CAAA76D,EAAA,KAAA+I,SAAA,CAAA5N,EAAA,KAAA2/D,UAAA,CAAA54D,EAAA,KAAAw5D,MAAA,OAAAz8D,EAAAA,EAAA,IAAAuqD,GAAAxpD,EAAA,MAAA+/D,OAAA,KAAAnW,GAAA,KAAAkR,UAAA,CAAA3/D,EAAA,KAAAugE,MAAA,MAAAlhB,EAAAr5C,EAAAtB,EAAAlF,EAAAioD,EAAAkK,EAAAryD,EAAAqtC,EAAA,eAAAqf,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA,GAAAr5C,EAAA,GAAAtB,EAAA,GAAAlF,EAAA,GAAAioD,EAAA,GAAAkK,EAAA,GAAAryD,EAAAkwD,EAAA3qD,GAAA8nC,EAAA9nC,EAAA+C,QAAA,eAAAokD,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAu7C,EAAA,IAAAr5C,EAAA,iBAAAq5C,CAAAA,EAAAx6C,EAAA+C,QAAA,YAAAy3C,GAAAA,EAAAxyC,OAAA,CAAAwyC,GAAA,KAAA36C,EAAAyrD,IAAA9Q,EAAA18C,IAAA,CAAAqD,CAAAA,CAAA,CAAAtB,EAAA,KAAAupD,GAAAppD,EAAAw6C,EAAAr/C,EAAA8D,EAAAiD,EAAA,GAAAf,CAAA,IAAAgmD,KAAA,CAAAnnD,EAAAkC,EAAA/G,EAAA8D,GAAA,GAAA2jB,EAAA,cAAAukC,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,cAAAe,EAAA8lD,KAAA,YAAAyE,GAAAvqD,EAAA7E,EAAA8D,EAAAiD,EAAA,IAAAilD,KAAA,CAAAnnD,EAAAkC,EAAA/G,EAAA8D,GAAA,OAAAe,EAAAq6C,YAAA,CAAAryC,OAAA,CAAA4a,GAAA,KAAAmlB,EAAAqyB,GAAAjT,KAAA,CAAAvkC,EAAA,CAAA5iB,EAAA7E,IAAA+G,EAAAskD,WAAA,CAAAhqD,MAAA,CAAAwD,EAAA7E,GAAAA,GAAA6pB,EAAAy1C,GAAAtT,KAAA,CAAAvkC,EAAAmlB,GAAAzY,EAAAkrC,GAAArT,KAAA,CAAAvkC,EAAAoC,EAAAvqB,EAAAwE,GAAAkK,EAAA,cAAAg+C,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,CAAAu7C,CAAA,CAAAr5C,CAAA,CAAAtB,CAAA,kBAAAlF,IAAA,KAAAioD,MAAA9a,EAAA,IAAAglB,EAAA5qD,KAAAvH,GAAA,EAAAF,EAAA,CAAAowD,GAAA7qD,EAAA,IAAArF,EAAA,cAAAsE,EAAAoJ,QAAA,kFAAAy/B,EAAA,MAAA7oC,EAAAoJ,QAAA,CAAAykD,EAAAryD,EAAA2I,OAAA,QAAAw/C,CAAAA,EAAAnoD,EAAA0E,OAAA,YAAAyjD,EAAA,OAAAA,EAAAhgD,UAAA,QAAA5C,EAAA,OAAAgrD,GAAAhrD,EAAA7E,EAAA,aAAA2sC,EAAA,kDAAAxT,EAAAwT,EAAApjC,IAAA,KAAA4vB,EAAA,4CAAA1R,EAAA,MAAA/iB,EAAAmyD,MAAA,SAAA9vD,KAAAlC,IAAA6pD,GAAA1oD,EAAAq5C,GAAAoiB,SAAA,CAAAtoC,GAAA1R,EAAAvoB,IAAA,CAAA6H,EAAA,QAAA8vD,OAAApvC,EAAAmW,IAAAzE,CAAA,MAAA6yB,KAAA,CAAAvkC,EAAAoC,EAAAvqB,EAAAwE,EAAAiD,EAAA/G,EAAA6E,GAAAgzB,EAAA,cAAAm0B,MAAAnnD,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,CAAA8D,CAAA,MAAAu7C,EAAAt4C,EAAAa,QAAA,CAAAd,IAAA,CAAAjC,GAAAA,EAAAu6D,KAAA,EAAAp5D,EAAA,EAAAe,EAAA89D,OAAA,KAAAxlB,GAAAr5C,EAAA,gBAAAq5C,IAAA,KAAAr5C,EAAAtB,EAAA,IAAAlF,EAAA,MAAAQ,KAAAq/C,GAAAoI,EAAA,mBAAA5iD,EAAA,GAAA8sD,EAAAnyD,EAAAo+B,GAAA,CAAA92B,IAAA,CAAAjC,GAAAA,EAAAmvD,UAAA,CAAAvM,IAAA,IAAAkK,EAAA,4CAAAryD,EAAAsxD,EAAAe,EAAA3wD,KAAA,CAAAymD,EAAA7mD,MAAA,GAAA+rC,EAAA5lC,EAAA89D,OAAA,KAAAl4B,EAAA,gDAAAsoB,GAAAC,WAAA,EAAA5yD,KAAAqqC,CAAA,EAAAnsC,MAAAud,IAAA,YAAA/X,CAAAA,EAAAlC,EAAA8D,QAAA,YAAA5B,EAAAA,EAAA,aAAAtB,CAAAA,EAAAZ,EAAA+xD,KAAA,YAAAnxD,EAAAA,EAAA,MAAA+T,MAAA,CAAAnZ,EAAA,KAAA0sD,KAAA,CAAAhsD,EAAAynB,EAAAzZ,EAAAnJ,GAAAJ,EAAAoqD,GAAA7C,KAAA,CAAAloD,EAAA9D,EAAAynB,EAAAmlB,EAAA/iB,EAAAsK,EAAAnmB,EAAA6pB,EAAA8U,GAAAj0B,EAAAy3C,IAAA1oC,EAAA9kB,IAAA,CAAAqD,CAAAA,CAAA,CAAA0S,EAAA,CAAAk0B,EAAAloC,CAAA,CAAAgU,EAAA,CAAAmR,EAAAw1B,CAAA,CAAA3mC,EAAA,CAAAyb,EAAA30B,CAAA,CAAAkZ,EAAA,CAAA1K,EAAAy5C,CAAA,CAAA/uC,EAAA,CAAAjU,EAAAozB,GAAA85B,CAAAA,CAAA,CAAAj5C,EAAA,CAAAmf,CAAAA,CAAA,IAAAwnB,EAAAr5C,EAAAtB,EAAAioC,EAAAntC,EAAAioD,EAAAhgC,EAAAkqC,EAAA,IAAA3F,KAAA,CAAAnnD,EAAA,KAAA07D,MAAA,CAAAx5D,EAAA/G,EAAA,MAAA0+D,GAAA,CAAArf,EAAA,KAAAgM,WAAA,CAAArlD,EAAA,KAAAgC,WAAA,CAAAtD,EAAA,KAAAmD,OAAA,CAAArI,EAAA,KAAA0N,QAAA,CAAAu6C,EAAA,KAAAtkC,OAAA,CAAAwuC,EAAA,KAAAhH,KAAA,CAAArrD,EAAA,KAAAwlE,KAAA,CAAAn4B,CAAA,KAAA8R,WAAA,aAAAkhB,UAAA,KAAArK,KAAA,aAAAoK,IAAA,KAAAD,OAAA,aAAAc,MAAA,KAAA9T,UAAA,aAAA7+C,SAAA,cAAAulD,GAAAtuD,CAAA,CAAAkC,CAAA,MAAA/G,EAAA4vD,EAAA/qD,GAAAf,EAAA,MAAAirD,GAAAgW,QAAA,CAAA/kE,EAAA+G,GAAA,IAAAjD,EAAA,0CAAAe,EAAA8D,QAAA,iBAAAomD,GAAAjrD,EAAA9D,EAAA+G,EAAA,cAAAg+D,SAAAlgE,CAAA,CAAA7E,CAAA,MAAAR,EAAAQ,EAAA,MAAAA,EAAAA,EAAAuvD,IAAA,KAAAzrD,EAAA8rD,EAAA/qD,GAAAw6C,EAAA,qBAAAx6C,CAAA,MAAA7E,EAAA,OAAAF,EAAA0e,SAAA,CAAA6kC,kBAAA,IAAAx+C,EAAA,kBAAA/E,EAAA0e,SAAA,CAAAwmD,cAAA,CAAAhlE,EAAA,aAAA6E,EAAA,EAAAf,GAAAkC,EAAA,MAAAhG,EAAAsH,UAAA,CAAA0/C,cAAA,CAAA3H,GAAA,IAAAr5C,EAAA,gBAAAtB,EAAAlF,CAAAA,EAAAwG,EAAA5E,IAAA,CAAAJ,KAAA,IAAAg+D,GAAAvmD,MAAA,CAAAjZ,EAAA,EAAAioD,EAAA,GAAA6I,EAAA2U,EAAA,EAAAvgE,EAAAtD,IAAA,SAAA+B,KAAA2f,KAAA,CAAAre,EAAAgjD,GAAA,CAAAxhC,iBAAAphB,CAAA,CAAAkC,CAAA,cAAA69D,OAAA,CAAA3+C,gBAAA,CAAAphB,EAAAkC,EAAA,OAAAqf,oBAAAvhB,CAAA,oBAAA+/D,OAAA,CAAAx+C,mBAAA,CAAAvhB,EAAA,QAAAqgE,GAAAvjE,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,gBAAAopD,IAAAtrD,GAAA,OAAAzE,EAAAknB,KAAA,wCAAAziB,EAAA,GAAA+wD,YAAA/wD,CAAA,CAAAkC,CAAA,iEAAAo+D,GAAAxjE,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,0DAAA0R,OAAA5T,CAAA,iEAAA6+B,GAAA/hC,YAAAkD,CAAA,OAAAywD,GAAA,CAAAzwD,CAAA,OAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,uCAAAlC,EAAA,GAAA4T,OAAA5T,CAAA,CAAAkC,CAAA,cAAA4vD,eAAA,CAAA9xD,EAAAkC,EAAA,CAAA4vD,gBAAA9xD,CAAA,CAAAkC,CAAA,uCAAAlC,EAAA,GAAA+xD,OAAA/xD,CAAA,CAAAkC,CAAA,uCAAAlC,EAAA,GAAAtE,KAAAsE,CAAA,MAAAkC,EAAA,cAAAA,CAAAA,EAAAuvD,GAAA,KAAAhB,GAAA,CAAAzwD,EAAA,YAAAkC,EAAAA,EAAA,SAAAq+D,GAAAzjE,YAAAkD,CAAA,GAAA4T,OAAA5T,CAAA,0EAAAwgE,GAAA1jE,YAAAkD,CAAA,GAAAxD,OAAAwD,CAAA,CAAAkC,CAAA,uEAAA0R,OAAA5T,CAAA,CAAAkC,CAAA,8EAAAu+D,GAAA3jE,YAAAkD,CAAA,OAAAwmD,WAAA,KAAA6Z,GAAArgE,GAAA,KAAA+C,QAAA,KAAA87B,GAAA7+B,GAAA,KAAAgyD,MAAA,KAAAuO,GAAAvgE,GAAA,KAAA8lD,KAAA,KAAAwa,GAAAtgE,GAAA,KAAAgxD,KAAA,KAAAwP,GAAAxgE,EAAA,MAAA0gE,GAAA,IAAAzlE,EAAA0e,SAAA,0DAAAgnD,GAAA3gE,CAAA,aAAAkqD,GAAA0W,GAAAF,GAAA1gE,EAAA,IAAAygE,GAAAG,IAAA,KAAAA,GAAA,CAAAtD,QAAA,QAAAx/D,KAAA,uBAAAu8C,aAAA,EAAAv8C,KAAA,SAAAiF,SAAA,EAAAjF,KAAA,YAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,oBAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,QAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,gBAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,eAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,YAAAgmD,GAAA,OAAAv9B,MAAA9sB,CAAA,MAAAA,EAAA,OAAAA,EAAAA,EAAA,IAAAkqD,GAAAmT,GAAAF,GAAAn9D,EAAAo9D,KAAA,QAAAyD,gBAAA7gE,CAAA,SAAA2gE,GAAA3gE,EAAA,MAAA8gE,GAAA,IAAA7lE,EAAA0e,SAAA,8CAAAonD,GAAA/gE,CAAA,aAAAkqD,GAAA8W,GAAAF,GAAA9gE,EAAA,IAAAwqD,GAAAwW,IAAA,KAAAA,GAAA,CAAA1D,QAAA,QAAAx/D,KAAA,iBAAAu8C,aAAA,EAAAv8C,KAAA,gBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,gBAAAK,KAAA,SAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,QAAAL,KAAA,gBAAAK,KAAA,WAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,UAAAK,KAAA,wBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,OAAAL,KAAA,cAAAK,KAAA,OAAAL,KAAA,WAAAK,KAAA,WAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,gBAAAK,KAAA,sBAAAiF,SAAA,EAAAjF,KAAA,QAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,oBAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,aAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,aAAAL,KAAA,gBAAAK,KAAA,uBAAAiF,SAAA,EAAAjF,KAAA,QAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,oBAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,aAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,UAAAK,KAAA,yBAAAiF,SAAA,EAAAjF,KAAA,QAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,oBAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,aAAAL,KAAA,gBAAAK,KAAA,wBAAAiF,SAAA,EAAAjF,KAAA,QAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,aAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,aAAAL,KAAA,gBAAAK,KAAA,WAAAiF,SAAA,EAAAjF,KAAA,SAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,QAAAL,KAAA,UAAAK,KAAA,mBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,OAAAL,KAAA,cAAAK,KAAA,OAAAL,KAAA,WAAAK,KAAA,QAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,gBAAAK,KAAA,iBAAAiF,SAAA,EAAAjF,KAAA,UAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,OAAAL,KAAA,cAAAK,KAAA,OAAAL,KAAA,WAAAK,KAAA,QAAAL,KAAA,gBAAAK,KAAA,mBAAAiF,SAAA,EAAAjF,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,OAAAy8D,MAAA,GAAA9Y,SAAA,KAAA3jD,KAAA,KAAAy8D,MAAA,GAAA9Y,SAAA,KAAAp9C,KAAA,EAAAvG,KAAA,WAAAL,KAAA,QAAAK,KAAA,OAAAL,KAAA,WAAAK,KAAA,QAAAL,KAAA,gBAAAsF,SAAA,EAAAjF,KAAA,QAAAL,KAAA,CAAA+yD,KAAA,SAAAx6C,OAAA,EAAAlY,KAAA,UAAAL,KAAA,QAAAK,KAAA,QAAAL,KAAA,QAAAK,KAAA,mBAAAL,KAAA,cAAAK,KAAA,QAAAL,KAAA,cAAAK,KAAA,gBAAAL,KAAA,CAAA6yD,QAAA,sBAAAU,MAAA,EAAAlzD,KAAA,gBAAAL,KAAA,CAAA+yD,KAAA,SAAAx6C,OAAA,EAAAlY,KAAA,uBAAAL,KAAA,kBAAAwsD,GAAA,OAAAgX,OAAAjhE,CAAA,SAAA+gE,GAAA/gE,EAAA,kBAAApF,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECfA,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAtpB,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCHa,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAc,CAAA7O,EAAgB,aAAgB,CAAA0C,MAAG,EAAW,GAC5D1C,EAAAmB,GAAA,CAAAnB,EAAAY,KAAwB,CAAAZ,EAAAgnB,QAAQ,CAAehnB,EAAA8qB,GAAA,CAAA9qB,EAAA8B,KAAA,CAAA9B,EAAA+qB,MAAA,CAAA/qB,EAAAgrB,GAAA,CAAAhrB,EAAAirB,IAAA,CAAAjrB,EAAAinB,MAAA,CAAAjnB,EAAA6B,SAAA,CAAA7B,EAAAorB,IAAA,CAAAprB,EAAAqrB,IAAA,CAAArrB,EAAAsrB,GAAA,CAAAtrB,EAAAknB,GAAA,CAAAlnB,EAAA4B,MAAA,CAAA5B,EAAAurB,GAAA,CAAAvrB,EAAAwrB,GAAA,CAAAxrB,EAAAyrB,GAAA,CAAAzrB,EAAA+d,GAAA,CAAA/d,EAAA0rB,GAAA,CAAA1rB,EAAA2rB,GAAA,CAAA3rB,EAAA4rB,EAAA,CAAA5rB,EAAA8d,EAAA,QAC/C,IAAA+N,EAAkBlsB,EAAyB,KAC3CsoB,EAAAtoB,EAAgC,MAChCmsB,EAAAlB,EAAsBjrB,EAAuB,OAC7C,IAAAosB,EAAApsB,EAAuC,KACvCoD,OAAA8L,cAAA,CAAA7O,EAAA,KAAqC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAjO,EAAA,IAC5E/a,OAAA8L,cAAA,CAAA7O,EAAA,MAAsCgsB,WAAE,GAAAjJ,IAAA,kBAAqCgJ,EAAAE,EAAA,IAC7ElpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAJ,GAAA,IAC7E5oB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAG,GAAA,IAC7EnpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAhO,GAAA,IAC7Ehb,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAI,GAAA,IAC7EppB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAP,GAAA,IAC7EzoB,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAA2C,GAAAjJ,IAAA,kBAAqCgJ,EAAAR,GAAA,IAChFxoB,OAAA8L,cAAA,CAAA7O,EAAA,UAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAgJ,EAAAnqB,MAAA,GACA,OAAAwqB,UAAAP,EAAApT,MAAA,CACAxW,YAAAyW,CAAA,CAAA2T,CAAA,CAAA1T,CAAA,EACA,MAAAD,EAAAC,GACA,KAAAuF,IAAA,CAAA2N,EAAA3N,IAAA,CAAAxF,GACA,KAAA2T,MAAA,CAAAA,CACA,CACAtT,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAqT,EAAA,IAAAR,EAAAhF,OAAA,MAAA5I,IAAA,CAAAnF,MAAA,CAAAC,EAAAC,GAAA,gBACA,KAAAoT,MAAA,CACAC,EAAAC,QAAA,QAAA7T,IAAA,EAAAuM,KAAA,GAEAqH,CADA,CAGA3qB,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAIA,OAHA,KAAAoT,MAAA,EACAnT,CAAAA,EAAAA,EAAAsT,MAAA,QAAA9T,IAAA,GAEA,KAAAwF,IAAA,CAAAvc,MAAA,CAAAuX,EAAAuT,WAAA,CAAA/rB,EAAA,UAAAgY,IAAA,EAAAM,EAAAC,EACA,CACA,CACA,SAAAiO,EAAAvO,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA2S,EAAA3S,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA0S,EAAA1S,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAyS,EAAAzS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAXA3Y,EAAAknB,GAAA,CAAAA,EAIAlnB,EAAAsrB,GAAA,CAAAA,EAIAtrB,EAAAqrB,IAAA,CAAAA,EAIArrB,EAAAorB,IAAA,CAAAA,CACA,OAAA/D,UAAAwE,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAApX,EAAA8W,CAAA,EACA,WAAA0O,EAAAwE,EAAA3N,IAAA,YAAA+J,EAAAnJ,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA3Y,EAAA6B,SAAA,CAAAA,CACA,OAAA6qB,UAAAb,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAAnB,CAAA,EACA,SAAAA,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAAyC,aAAA,CAAAsP,EAAA/N,EAAA,EACA,CACAnc,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,UACA,MAAAC,EACA,KAAAqD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,IAEA,KAAAsD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,GACA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAFA,CAIAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,YAEA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,EACA,OACA,6BAAAN,QAAA,EAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAA,IACA,OACA,6BAAAN,QAAA,EAEA,CACA,SAAAsO,EAAAnN,CAAA,CAAAnB,CAAA,EACA,WAAA+T,EAAA5S,EAAAnB,EACA,CAEA,SAAAsS,EAAAtS,CAAA,EACA,WAAA0O,EAAAwE,EAAA/N,EAAA,GAAA6O,EAAAC,EAAAjU,EACA,CAEA,SAAAgU,EAAAjqB,CAAA,EACA,GAAAA,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,QACA,OACA,uBAAAA,EAAA,CAEA,SAAAkqB,EAAAlqB,CAAA,EACA,OAAAA,EAAA,IAEA,SAAAsoB,EAAA6B,CAAA,CAAAlU,CAAA,EACA,IAAAzX,EAAA2qB,EAAA9N,GAAA,WACAjE,EAAA+R,EAAAjqB,MAAA,EACAV,EACA2qB,EAAAiB,GAAA,CAAAD,EAAAhB,EAAA5S,MAAA,CAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAAA,GAAA,EAAAA,OAAAA,CAAA,GAAAZ,EACA,CAEA,SAAAoS,EAAA7N,CAAA,CAAApD,CAAA,CAAAnB,CAAA,EACA,IAAAoU,EAAAlB,EAAAjqB,MAAA,EACAslB,EAAA,OACApN,EAAAV,SAAA,SACA,EACA,SAAA4T,EAAA,CAAA9P,IAAA+P,CAAA,CAAAvrB,KAAAA,CAAA,GACA,IAAAurB,EAAAC,EAAA,CAAAhQ,GACA,sCACAA,EAAAjU,QAAA,QACA,UACAgkB,EAAAhkB,QAAA,SAEA,OAAAvH,CACA,CACA,WAAA2lB,EAAA0F,EAAAC,EAAAtrB,GAAA,EAAAwb,IAAAA,EAAAxb,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAA7W,EAAA6W,CAAA,EACA,IAAAzX,EAAA2qB,EAAA9N,GAAA,WACAjE,EAAA+R,EAAAjqB,MAAA,EACAV,EACA2qB,EAAA3N,IAAA,CAAA2N,EAAA5S,MAAA,CAAA/X,EAAA,CAAAA,EAAAwX,IAAA,UACA,EACA,WAAA2O,EAAAvN,EAAA,EAAApY,KAAAA,CAAA,IAAAA,EAAAA,GAAA,EAAAA,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAAmS,EAAAnS,CAAA,EACA,WAAA0O,EAAAvlB,IAAAJ,GAAAA,EAAAuH,QAAA,UAAAjE,GAAAtE,EAAA2d,IAAA,CAAArZ,EAAA,SAAA2T,EACA,CAEA,SAAAqO,EAAAmG,CAAA,CAAAxU,CAAA,CAAAyU,CAAA,EACA,IAAAC,EAAAxB,EAAAlO,KAAA,CAAAyP,MAAAA,EAAAA,EAAAvB,EAAA/N,EAAA,GAAAnF,GAEA,OADAwU,EAAAhgB,OAAA,EAAAoQ,EAAAlc,IAAAgsB,EAAA/P,UAAA,CAAAjc,EAAAkc,EAAAA,EAAA5E,QAAA,GACA0U,CACA,CAEA,SAAAzsB,EAAAisB,CAAA,CAAA3rB,CAAA,CAAAyX,CAAA,EACA,IAAAmB,EAAA+R,EAAAjqB,MAAA,EACAiqB,EAAAiB,GAAA,CAAAD,EAAA3rB,EAAA,UACA,EACA,WAAAmmB,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAAA,GAAA,EAAAA,OAAAA,CAAA,GAAAZ,EACA,CAnEA3Y,EAAAinB,MAAA,CAAAA,EAIAjnB,EAAAirB,IAAA,CAAAA,EAqBAjrB,EAAAgrB,GAAA,CAAAA,EAiBAhrB,EAAA+qB,MAAA,CAAAA,EASA/qB,EAAA8B,KAAA,CAAAA,EAIA9B,EAAA8qB,GAAA,CAAAA,EAMA9qB,EAAAgnB,QAAA,CAAAA,EAOAhnB,EAAAY,KAAA,CAAAA,CACA,OAAA0sB,UAAAzB,EAAApT,MAAA,CACAxW,YAAAsrB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,MAAA4U,EAAA7U,IAAA,CAAA8U,EAAA9U,IAAA,CAAAC,GACA,KAAA4U,SAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,CACA,CACAzU,OAAAC,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAtW,EAAA,KAAA4qB,SAAA,CAAAxU,MAAA,CAAAC,EAAAC,GACAvW,EAAA,KAAA8qB,WAAA,CAAAzU,MAAA,CAAAC,EAAAC,EAAA,KAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,IACA,OAAAtW,EAAAD,EAAA,CAEAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAwU,EAAA,KAAAF,SAAA,CAAA5rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,GACAyU,EAAA,KAAAF,WAAA,CAAA7rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,EAAAwU,GACA,OAAAA,EAAAC,CACA,CACAvU,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,GAAA,KAAAuU,WAAA,CAAArU,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAA9X,EAAAosB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,IAAAzX,EAAA2qB,EAAA9N,GAAA,WACAjE,EAAA+R,EAAAjqB,MAAA,EACAV,EACA2qB,EAAAiB,GAAA,KAAAQ,EAAAC,EAAAC,GAAA3B,EAAA5S,MAAA,CAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,QAAAnU,IAAAmU,GAAAA,GAAA,EAAAA,OAAAzY,MAAAud,IAAA,CAAA9E,EAAAtU,OAAA,MAAA0T,EACA,CACA3Y,EAAAmB,GAAA,CAAAA,CAAA,eAAA1B,CAAA,CAAAO,CAAA,ECrNa,aAEb+C,OAAA8L,cAAW,CAAA7O,EAAA,cAAA0C,MAAA,KACX1C,EAAAqmE,GAAW,QACXrmE,EAAAqmE,GAAA,EACA,gBACA,0BACA,cACA,CACA,sBACA,MACA,sBACA,GACA,8GACA,GACA,6BACA,+CACA,mDACA,kFACA,GACA,gHACA,qGACA,GACA,gBACA,2EACA,wHACA,+FACA,wFACA,CACA,UACA,CACA,mBACA,SACA,YACA,MACA,uBACA,CACA,KACA,OACA,CACA,aACA,cAC6B,yBAC7B,EACA,CACA,eACA,iBACA,eAC6B,WAC7B,EACA,CACA,WACA,WACA,cACA,EACA,CAEA,EACA,CACA,wBACA,SACA,YACA,MACA,kCACiB,EAEjB,CACA,YACA,SACA,YACA,MACA,0BACiB,EAEjB,CACA,kBACA,SACA,YACA,MACA,cACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,yFACA,yEACiB,EAEjB,CACA,qBACA,SACA,YACA,MACA,wBACiB,EAEjB,CACA,8BACA,SACA,YACA,MACA,kCACiB,EAEjB,CACA,oBACA,SACA,YACA,MACA,uBACA,EAEA,CACA,MACA,CACA,eACiB,UACjB,EACA,CACA,YACA,MACA,OACA,KACA,GACA,CAEA,EACA,CACA,qBACiB,UACjB,EACA,CACA,mBACiB,UACjB,EACA,CACA,eACiB,UACjB,EACA,CACA,aACA,UACA,EACS,EAET,CACA,gBACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,mBACA,SACA,YACA,MACA,mBACA,CACA,KACA,OACA,CACA,aACA,cAC6B,mBAC7B,EACA,CACA,eACA,iBAC6B,eAC7B,EACA,CACA,eACA,iBACA,4BACA,kBACA,EACA,CAEA,EACA,CACA,YACA,SACA,YACA,MACA,uDACiB,EAEjB,CACA,UACA,SACA,YACA,MACA,yCACiB,EAEjB,CACA,gBACA,SACA,YACA,MACA,8BACiB,EAEjB,CACA,oBACA,SACA,YACA,MACA,uBACiB,EAEjB,CACA,qBACA,SACA,YACA,MACA,wBACA,EAEA,CACA,MACA,CACA,aACiB,UACjB,EACA,CACA,cACiB,UACjB,EACA,CACA,aACA,MACA,KACA,OACA,KACA,GACA,CAEA,CACA,EACS,EAET,CACA,gBACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,YACA,SACA,YACA,MACA,uDACiB,EAEjB,CACA,UACA,SACA,YACA,MACA,8BACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,gBACiB,EAEjB,CACA,qBACA,SACA,YACA,MACA,wBACiB,EAEjB,CACA,oBACA,SACA,YACA,MACA,uBACA,EAEA,CACA,MACA,CACA,cACA,UACA,EACS,EAET,CACA,2BACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,0BACA,SACA,YACA,MACA,uBACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,eACA,EAEA,CACS,SAET,CACA,gBACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,eACiB,EAEjB,CACA,gBACA,SACA,YACA,MACA,oBACA,EAEA,CACS,SAET,CACA,oBACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,eACA,EAEA,CACA,MACA,CACA,eACiB,UACjB,EACA,CACA,aACA,UACA,EACS,EAET,CACA,qBACA,UACA,CACA,mBACA,SACA,YACA,MACA,2BACiB,EAEjB,CACA,aACA,SACA,YACA,MACA,eACA,EAEA,CACA,MACA,CACA,YACA,MACA,OACA,KACA,GACA,CAEA,EACA,CACA,qBACiB,UACjB,EACA,CACA,mBACA,UACA,EACA,EAEA,CACA,UACA,CACA,mBACA,MACA,sDACA,CACA,MACA,cACA,QACA,CACA,iBACA,MACA,yCACA,CACqB,WACrB,EACA,CACA,gBACA,MACA,qCACA,CACqB,gBACrB,EACA,CACA,iBACA,MACA,gCACA,CACqB,UACrB,EACA,CACA,cACA,MACA,4BACA,CACA,UACA,EACA,CAEA,EACA,CACA,yBACA,MACA,kDACA,CACA,MACA,cACA,QACA,CACA,YACA,MACA,aACA,CACqB,SACrB,EACA,CACA,eACA,MACA,yBACA,CACqB,UACrB,EACA,CACA,YACA,MACA,2BACA,CACA,MACA,OACA,KACA,GACA,CAEA,EACA,CACA,YACA,MACA,yCACA,CACqB,gBACrB,EACA,CACA,kBACA,MACA,6BACA,CACqB,gBACrB,EACA,CACA,qBACA,MACA,mFACA,CACqB,UACrB,EACA,CACA,mBACA,MACA,kDACA,CACqB,UACrB,EACA,CACA,0BACA,MACA,iDACA,CACqB,UACrB,EACA,CACA,uBACA,MACA,0CACA,CACqB,UACrB,EACA,CACA,eACA,MACA,oCACA,CACqB,UACrB,EACA,CACA,aACA,MACA,kCACA,CACqB,UACrB,EACA,CACA,wBACA,MACA,oBACA,CACqB,gBACrB,EACA,CACA,aACA,MACA,eACA,CACA,gBACA,EACA,CAEA,EACA,CACA,QACA,CACA,qBACA,QACA,CACA,gBACA,iBACiB,QACjB,EACA,CACA,iBACA,WACA,QACA,EACS,EAET,CACA,oBACA,QACA,CACA,gBACA,iBACiB,QACjB,EACA,CACA,cACA,WACA,QACA,EACA,EAEA,CACA,QACA,CACA,SACA,oBACS,0BACT,EACA,CACA,UACA,wBACS,mCACT,EACA,CACA,UACA,wBACS,iCACT,EACA,CACA,UACA,oBACS,2DACT,EACA,CACA,UACA,qBACS,sDACT,EACA,CACA,UACA,4BACS,kDACT,EACA,CACA,UACA,iBACS,qCACT,EACA,CACA,UACA,oBACS,0BACT,EACA,CACA,UACA,uBACS,2CACT,EACA,CACA,UACA,8BACS,mDACT,EACA,CACA,UACA,6BACS,sCACT,EACA,CACA,UACA,kCACS,kCACT,EACA,CACA,UACA,kCACA,kCACA,EACA,iBAAA5mE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eC/qBa,IAAAe,EAAAf,EAAA,aAEbqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAA,CAAA7O,EAAyB,cAAA0C,MAAA,KACzB1C,EAAAsmE,iBAAkB,QAClB,IAAAr+C,EAAiBtoB,EAAQ,MACzB0hD,EAAA1hD,EAAqB,MACrB4mE,EAAA5mE,EAA6B,MAC7B6mE,EAAgB7mE,EAAkB,MAClC8mE,EAAA9mE,EAAwB,MACxBksB,EAAAlsB,EAA8B,MAC9B+mE,EAAoB/mE,EAA2B,MAC/Cw+C,EAAAx+C,EAAA,KACA,OAAA2mE,EACArkE,YAAA9B,CAAA,CAAA8iE,CAAA,EACA,KAAA9iE,GAAA,CAAAA,EACA,KAAA8iE,GAAA,CAAAA,CACA,CACA0D,eAAAlgB,CAAA,CAAAj1B,CAAA,CAAAo1C,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAvE,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAyE,EAAA,GAAAV,EAAAW,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAg8D,CAAA,GACAplE,EAAA,IAAA+kE,EAAA/a,kBAAA,MAAArrD,GAAA,CAAA4sD,QAAA,CAAAnlD,UAAA,MAAAzH,GAAA,CAAA4sD,QAAA,CAAA9hD,MAAA,EACAm8D,EAAA,WAAAjnE,GAAA,CAAAyH,UAAA,CAAA0/C,cAAA,CAAA4f,GACA,OAAAE,GACA5lE,EAAAkqD,cAAA,EACAlM,aAAA,CACArB,EAAAe,KAAA,CAAAiH,uCAAA,CAAAqgB,EAAApgB,2BAAA,CAAAogB,EAAAxnB,gBAAA,CAAAyH,EAAAygB,EAAAN,EAAA,KAAAzmE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EACA,CACA49C,oBAAA,GACiBl3C,QAAA,KAGjB,IAAA8+D,EAAA,GAAAb,EAAAW,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAq8D,EAAAtkE,GAAA,GACA2kE,EAAA,WAAAnnE,GAAA,CAAAsjB,OAAA,CAAAkjD,cAAA,EACAz+D,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACAikE,iBAAAM,EACAzgB,KAAAA,EACA4gB,WAAAA,EACiBE,MAAA,KAAApnE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EAEjB2lE,OAAA,CACA/E,QAAAA,EACAjxC,KAAA,GAAAi1C,EAAAgB,cAAA,EAAAj2C,GACAq1C,cAAAA,EACAC,YAAAA,EACAC,QAAAA,EACiBC,MAAAA,CACJ,CACb,GAIS,OAHTM,EAAA7a,EAAA,EACAjrD,EAAAkqD,cAAA,CAAA4b,EAAA7a,EAAA,EAESjrD,CACT,EACA,CACAkmE,SAAAjhB,CAAA,CAAAkhB,CAAA,CAAAlF,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAmF,EAAA,WAAAznE,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA0/D,iBAAA,CAAA3oD,KAAA,CAAA+nD,EAAAtkE,GAAA,EACA,IAAAilE,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA,IAAA9H,EAAA,YAAArB,GAAA,CAAAsjB,OAAA,CAAAikD,QAAA,EACAx/D,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACA4kE,MAAA,KAAApnE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CACiB8lE,SAAAA,CACjB,EACaH,OAAA,EACb,IAAAM,IAAA,GACS,OAAAtmE,CACT,EACA,CACAumE,oBAAAthB,CAAA,CAAAmgB,CAAA,CAAAnE,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAmF,EAAA,WAAAznE,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA0/D,iBAAA,CAAA3oD,KAAA,CAAA+nD,EAAAtkE,GAAA,EACA,IAAAilE,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA,IAAA49D,EAAA,GAAAV,EAAAW,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAg8D,CAAA,GACAplE,EAAA,IAAA+kE,EAAA/a,kBAAA,MAAArrD,GAAA,CAAA4sD,QAAA,CAAAnlD,UAAA,MAAAzH,GAAA,CAAA4sD,QAAA,CAAA9hD,MAAA,EACAm8D,EAAA,WAAAjnE,GAAA,CAAAyH,UAAA,CAAA0/C,cAAA,CAAA4f,GACA,OAAAE,GACA5lE,EAAAkqD,cAAA,EACAlM,aAAA,CACArB,EAAAe,KAAA,CAAAiH,uCAAA,CAAAqgB,EAAApgB,2BAAA,CAAAogB,EAAAxnB,gBAAA,CAAAyH,EAAAygB,EAAAN,EAAA,KAAAzmE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EACA,CACA49C,oBAAA,GACiBl3C,QAAA,KAGjB,IAAAy/D,EAAA,WAAA7nE,GAAA,CAAAsjB,OAAA,CAAAskD,mBAAA,EACA7/D,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACA4kE,MAAA,KAAApnE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CACiBomE,mBAAAf,CACjB,EACaM,OAAA,EACb,GAIS,OAHTQ,EAAAvb,EAAA,EACAjrD,EAAAkqD,cAAA,CAAAsc,EAAAvb,EAAA,EAESjrD,CACT,EACA,CACA0mE,cAAAzhB,CAAA,CAAAj1B,CAAA,CAAAq1C,CAAA,CAAAC,CAAA,CAAArE,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAmF,EAAA,WAAAznE,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA0/D,iBAAA,CAAA3oD,KAAA,CAAA+nD,EAAAtkE,GAAA,EACA,IAAAilE,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA,IAAA9H,EAAA,YAAArB,GAAA,CAAAsjB,OAAA,CAAAykD,aAAA,EACAhgE,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACiB4kE,MAAA,KAAApnE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EAEjB2lE,OAAA,CACAh2C,KAAA,GAAAi1C,EAAAgB,cAAA,EAAAj2C,GACAq1C,cAAAA,EACiBC,YAAAA,CACJ,CACb,IAAAgB,IAAA,GACS,OAAAtmE,CACT,EACA,CACA2mE,aAAA1hB,CAAA,CAAAsgB,CAAA,CAAAC,CAAA,CAAAvE,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAmF,EAAA,WAAAznE,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA0/D,iBAAA,CAAA3oD,KAAA,CAAA+nD,EAAAtkE,GAAA,EACA,IAAAilE,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA,IAAA9H,EAAA,YAAArB,GAAA,CAAAsjB,OAAA,CAAA0kD,YAAA,EACAjgE,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACiB4kE,MAAA,KAAApnE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EAEjB2lE,OAAA,CACAT,QAAAA,EACiBC,MAAAA,CACJ,CACb,IAAAc,IAAA,GACS,OAAAtmE,CACT,EACA,CACA4mE,QAAA3hB,CAAA,CAAA0D,CAAA,CAAAsY,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,mCAEA4jB,EADA,IAAAX,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GAEA,IACAmF,EAAA,WAAAznE,GAAA,CAAAkoE,OAAA,CAAAC,uBAAA,CAAArB,EAAAtkE,GAAA,CACA,CACA,MAAAuD,EAAA,CACA,oCAAAugD,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,IAAA2+D,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA,IAAAi/D,EAAA,GAAA/B,EAAAW,iBAAA,GACA1gB,KAAAA,EACa77C,MAAA,KAAAzK,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,GAGbwlE,EAAAO,EAAAP,UAAA,CACA7lE,EAAA,IAAA+kE,EAAA/a,kBAAA,MAAArrD,GAAA,CAAA4sD,QAAA,CAAAnlD,UAAA,MAAAzH,GAAA,CAAA4sD,QAAA,CAAA9hD,MAAA,EACkBjE,EAAA,GAAAy/D,EAAA+B,UAAA,GAClB,CAAkB7hB,OAAA4hB,EAAA3hB,SAAA,GAAAC,WAAuD,IACzE,CAAAF,OAAA0gB,EAAAzgB,SAAA,GAAAC,WAAA,IACA,MAAA1mD,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,KACA4mE,EAA+B,GAAA58C,EAAAjqB,MAAA,MAAAiqB,EAAA/N,EAAA,oBAAA4oD,EAAAx/C,GAAA,cAC/BxlB,EAAAhB,EAAAknB,KAAA,CAAA6gD,EAA6C/vD,IAAA,EAWpC,OAVT+vD,EAAA9mE,MAAA,EAAAgqD,YAAA8a,EAAAiC,gBAAA,CAAAC,QAAA,CAAAxe,OAAAI,OAAAJ,EAAAlhD,QAAA,KAAAvH,GACAF,EAAAkqD,cAAA,EACAlM,aAAA,KAAAv3B,EAAA8+B,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAynB,EAAAxnB,gBAAA,CACqBt9C,KAAAA,CACrB,IACA+9C,oBAAA,GACal3C,QAAA,KAEJ/G,CACT,EACA,CACAonE,SAAAniB,CAAA,CAAAplD,CAAA,CAAA8oD,CAAA,CAAA0e,CAAA,CAAApG,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,GAAA6kB,IAAAA,EAAA3nE,MAAA,CACA,8BAEA,IAAA+lE,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAqG,EAAA,KAAA7F,GAAA,CAAA8F,YAAA,MAAA5oE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAolE,EAAAtkE,GAAA,EACA,IAEA,MADA,WAAAxC,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA2gE,WAAA,CAAA5pD,KAAA,CAAA4pD,EAAAnmE,GAAA,EACA+K,MAAA,mBAEA,MAAAxH,EAAA,CACA,IAAAA,EAAA7D,OAAA,CAAAqyD,QAAA,2BACA,MAAAxuD,CAAA,CAGA,IAAAmY,EAAA,GAAAmoD,EAAAW,iBAAA,EAA8D,CAAA1gB,KAAAA,EAAA77C,MAAAq8D,EAAAtkE,GAAA,GAC9DqmE,EAAA,GAAAxC,EAAAW,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAA,KAAAzK,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,GACAonE,EAAA,WAAA9oE,GAAA,CAAAyH,UAAA,CAAA0/C,cAAA,CAAA0hB,GACAxnE,EAAA,IAAA+kE,EAAA/a,kBAAA,MAAArrD,GAAA,CAAA4sD,QAAA,CAAAnlD,UAAA,MAAAzH,GAAA,CAAA4sD,QAAA,CAAA9hD,MAAA,EACA,OAAAg+D,GACAznE,EAAAkqD,cAAA,EACAlM,aAAA,IAAAgnB,EAAA0C,oBAAA,GAAA3pB,QAAAypB,EAAAviB,KAAAA,EAAA77C,MAAA,KAAAzK,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAumB,MAAA,KAAAjoB,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,IACA49C,oBAAA,GACiBl3C,QAAA,KAGjB,IAAA4gE,EAAA,WAAAhpE,GAAA,CAAAsjB,OAAA,CAAAmlD,QAAA,EACA1gE,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACAmmE,YAAAA,EAAAnmE,GAAA,CACA0b,KAAAA,EACA2qD,GAAAA,EACiBI,SAAA,KAAAjpE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EAEjB2lE,OAAA,CACAnmE,MAAAA,EACA8oD,OAAAA,EACiB0e,MAAAA,EAAA1nE,GAAA,OAAAslE,EAAAgB,cAAA,EAAA1/C,GACJ,CACb,GAIS,OAHTohD,EAAA1c,EAAA,EACAjrD,EAAAkqD,cAAA,CAAAyd,EAAA1c,EAAA,EAESjrD,CACT,EACA,CACA6nE,SAAA5iB,CAAA,CAAA0D,CAAA,CAAAsY,EAAA,IAAAphB,EAAAC,EAAA,KACA,OAAA0C,EAAA,+BACA,IAAAijB,EAAA,KAAAhE,GAAA,CAAAgE,WAAA,CAAAxgB,EAAAgc,GACAmF,EAAA,WAAAznE,GAAA,CAAAq0D,OAAA,CAAArsD,OAAA,CAAA0/D,iBAAA,CAAA3oD,KAAA,CAAA+nD,EAAAtkE,GAAA,EACA,IAAAilE,EACA,oCAAAnhB,EAAAn9C,QAAA,cAAAm5D,EAAAx5D,QAAA,gBAEA,GAAA2+D,EAAAL,KAAA,CAAAj+D,QAAA,SAAwD,CAAAnJ,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,CAAAyH,QAA4B,GACpF,oCAAA29D,EAAAtkE,GAAA,CAAA2G,QAAA,gCAEA6gD,EAAAA,EAAAnI,EAAA,KAAAX,EAAAC,EAAA,KAAA6I,EAAA,IAAgE9I,EAAAC,EAAA,IAChE,IAAAjjC,EAAA,GAAAmoD,EAAAW,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAq8D,EAAAtkE,GAAA,GACAnB,EAAA,YAAArB,GAAA,CAAAsjB,OAAA,CAAA4lD,QAAA,EACAnhE,SAAA,CACA++D,YAAAA,EAAAtkE,GAAA,CACA0b,KAAAA,EACA2qD,GAAApB,EAAAhB,gBAAA,CACiBwC,SAAA,KAAAjpE,GAAA,CAAA8K,MAAA,CAAApJ,SAAA,EAEJ2lE,OAAA,CAAArd,OAAAA,CAAA,CACb,IAAA2d,IAAA,GACS,OAAAtmE,CACT,EACA,CACA,CAAyBxB,EAAAsmE,iBAAA,CAAAA,CAAA,gBAAA7mE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC1RZ,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAA8B,CAAA0C,MAAA,KAAAu9C,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,EChB9B,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAwC,CAAA0C,MAAA,EAAkB,GAC1D1C,EAAAspE,6BAAyB,CAACtpE,EAAiBupE,UAAA,QAC3C,IAAAthD,EAAkBtoB,EAAA,KAClBK,CAAAA,EAAAupE,UAAA,KAAAthD,EAAAnJ,SAAqC,iDAAA9e,EAAAspE,6BAAA,CAAAtpE,EAAAupE,UAAA,gBAAA9pE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECLxB,aAEboD,OAAA8L,cAAe,CAAA7O,EAAA,cAAA0C,MAAA,KACf1C,EAAAwpE,OAAA,CAAiB,OACjB,IAAAnoB,EAAgB1hD,EAAQ,MACxBglD,EAAAhlD,EAAkB,MAClB8pE,EAAkB9pE,EAAQ,MAC1B+pE,EAAA/pE,EAAA,KAIA,OAAA6pE,EACA,OAAAnrD,KAAAzW,CAAA,CAAAqD,CAAA,CAAA8zC,CAAA,CAAAspB,EAAA,IAAAoB,EAAAE,cAAA,CAAA/hE,EAAA,CAAAsD,EAAAm2C,EAAAr2C,cAAA,CAAAG,cAAA,IACA,IAAAy+D,EAAA,IAAAvoB,EAAAr2C,cAAA,CAAApD,EAAAqD,EAAAC,GACAspD,EAAA,IAAAnT,EAAAwoB,OAAA,CAAAllB,EAAAmlB,oBAAA,CAAA/qB,EAAA6qB,GACA,WAAAJ,EAAAI,EAAAA,EAAA3+D,MAAA,CAAAupD,EAAA6T,EAAAn9D,EACA,CACA,OAAA6+D,cAAAhd,CAAA,CAAAyH,CAAA,CAAA6T,EAAA,IAAAoB,EAAAE,cAAA,CAAA5c,EAAAnlD,UAAA,EAAAsD,EAAAm2C,EAAAr2C,cAAA,CAAAG,cAAA,IACA,WAAAq+D,EAAAzc,EAAAA,EAAA9hD,MAAA,CAAAupD,EAAA6T,EAAAn9D,EACA,CACA,OAAA8+D,aAAAjd,CAAA,CAAAhO,CAAA,CAAAspB,EAAA,IAAAoB,EAAAE,cAAA,CAAA5c,EAAAnlD,UAAA,EAAAsD,EAAAm2C,EAAAr2C,cAAA,CAAAG,cAAA,IACA,IAAAqpD,EAAA,IAAAnT,EAAAwoB,OAAA,CAAAllB,EAAAmlB,oBAAA,CAAA/qB,EAAAgO,GACA,WAAAyc,EAAAzc,EAAAA,EAAA9hD,MAAA,CAAAupD,EAAA6T,EAAAn9D,EACA,CACAjJ,YAAA8qD,CAAA,CAAA9hD,CAAA,CAAAupD,CAAA,CAAA6T,CAAA,CAAAn9D,CAAA,EACA,KAAAtD,UAAA,CAAAmlD,EAAAnlD,UAAA,CACA,KAAAqD,MAAA,CAAAA,EACA,KAAAC,IAAA,CAAAA,EAEA,KAAAspD,OAAA,CAAAA,EACA,KAAAzH,QAAA,CAAAA,EACA,KAAAsb,OAAA,CAAAA,EACA,KAAA5kD,OAAA,KAAAimD,EAAAO,OAAA,MACA,CACA,CAAejqE,EAAAwpE,OAAA,CAAAA,CAAA,eAAA/pE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eClCF,IAAAe,EAAAf,EAAA,aAEbqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACA8mB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAA,CAAsB7O,EAAA,cAAA0C,MAAA,KACtB1C,EAAA2pE,cAAiB,QACjB,IAAAtoB,EAAA1hD,EAAA,MACAwnD,EAAkBv8B,EAAQjrB,EAAW,OACrCuqE,EAAAvqE,EAAA,KACA,OAAAgqE,EACA1nE,YAAA2F,CAAA,CAAA8uB,CAAA,EACA,KAAAytC,MAAA,IACA,KAAAv8D,UAAA,CAAAA,EACA,KAAAu8D,MAAA,CAAAztC,MAAAA,EAAAA,EAAA,GAOAyzC,YAAA,CACA,OAAAnmB,EAAA,+BACA,IAAA56C,EAAArG,OAAAiE,IAAA,MAAAm9D,MAAA,EACAziE,EAAA,WAAA0oE,WAAA,CAAAhhE,GACA,QAAAhB,EAAA,CAAAzF,EAAA0nE,EAAA,IAAAtnE,OAAAkC,OAAA,MAAAk/D,MAAA,EAAAl/D,OAAA,IACA,IAAAqlE,EAAAD,EAAAC,MAAA,CACA5nE,EAAA4nE,EAAqClnD,KAAA,CAAA1hB,CAAA,CAAA0G,EAAA,CACrC,MAAA+7D,MAAA,CAAAxhE,EAAA,EAAA2nE,OAAAA,EAAA5nE,MAAAA,CAAA,CACS,CACT,EACA,CAKAqgB,IAAAw8B,CAAA,CAAA+qB,CAAA,CAAAC,CAAA,EACA,IAAA9hE,EACA,OAAAu7C,EAAA,+BACA,IAAArhD,EAAA48C,EAAAj2C,QAAA,GACAkhE,EAAA,OAAA/hE,CAAAA,EAAA,KAAA07D,MAAA,CAAAxhE,EAAA,GAAA8F,KAAA,IAAAA,EAAA,OAAAA,EAAA/F,KAAA,CACA,GAAA8nE,KAAAzmE,IAAAymE,GAAA,CAAAD,EACA,OAAAC,CACA,CACA,IAAA3f,EAAA,WAAAjjD,UAAA,CAAA0/C,cAAA,CAAA/H,GACAkrB,EAAA5f,MAAAA,EAAA,OAAAA,EAAAnpD,IAAA,CACAgB,EAAA4nE,EAAiClnD,KAAA,CAAAqnD,GAExB,OADT,KAAAtG,MAAA,CAAAxhE,EAAA,EAAA2nE,OAAAA,EAAA5nE,MAAAA,CAAA,EACSA,CACT,EACA,CAIAgoE,KAAAthE,CAAA,CAAAkhE,CAAA,CAAAC,CAAA,EACA,OAAAvmB,EAAA,+BACA,IAAAh9C,EAAAoC,EAAAjI,GAAA,IAAAo+C,EAAAj2C,QAAA,IACAqhE,EAAA3jE,EAAA7F,GAAA,KACA,IAAAsH,EACA,OACA9F,EACA4nE,EAAAxmE,KAAAA,EAAA,OAAA0E,CAAAA,EAAA,KAAA07D,MAAA,CAAAxhE,EAAA,GAAA8F,KAAA,IAAAA,EAAA,OAAAA,EAAA/F,KAAA,CACa,GAGbkoE,EAAA,GAOA,GANAD,EAAAx9D,OAAA,GAAAxK,EAAAD,EAAA,CAAAmoE,IAAA,CACA9mE,KAAAA,IAAArB,GACAkoE,EAAAprE,IAAA,EAAAqrE,WAAAA,EAAAloE,IAAAA,CAAA,EAEA,GAEAioE,EAAA1pE,MAAA,IACA,IAAAQ,EAAA,WAAA0oE,WAA6C,CAAAQ,EAAiBzpE,GAAA,IAAAgH,EAAAxF,GAAA,GAC9DioE,EAAAz9D,OAAA,GAAA09D,WAAAA,CAAA,CAAAloE,IAAAA,CAAA,EAAAmoE,IAAA,CACA,IAAAriE,EACA,IAAA/F,EAAA4nE,EAAAlnD,KAAA,CAAA1hB,CAAA,CAAAopE,EAAA,EACA,GAAA3jB,EAAArgC,OAAA,UAAAre,CAAAA,EAAAkiE,CAAA,CAAAE,EAAA,GAAApiE,KAAA,IAAAA,EAAA,OAAAA,CAAA,OAAA1E,KAAAA,EAAA,kCACA4mE,CAAA,CAAAE,EAAyC,EAAAloE,EAAAD,EAAA,CACxB,KAAAyhE,MAAA,CAAAxhE,EAAA,EAAA2nE,OAAAA,EAAA5nE,MAAAA,CAAA,CACjB,EACA,KACAuB,EAAA0mE,EACAxpE,GAAA,GAAAC,EAAAsB,EAAA,GAAAA,GACA4nB,MAAA,IAAA5nB,KAAAqB,IAAArB,GAES,MADT,GAAAykD,EAAArgC,OAAA,EAAA7iB,EAAA/C,MAAA,GAAAkI,EAAAlI,MAAA,+BACS+C,CACT,EACA,CAIAmmE,YAAAhhE,CAAA,EACA,OAAA46C,EAAA,+BACA,IAAAwD,EAAA,EAA+B,CAC/BC,EAAA,IACA,QAAAnhD,EAAA,EAAAA,EAAA8C,EAAAlI,MAAA,CAAAoF,GAAAmhD,EAAA,CACA,IAAAsjB,EAAA3hE,EAAA9H,KAAA,CAAAgF,EAAAA,EAAAmhD,GACA99C,EAAA,KAAA/B,UAAA,CAAA8B,WAAA,wBACAqhE,EACA,CAAAhjE,WAAA,KAAAH,UAAA,CAAAG,UAAA,EACA,EACAy/C,EAAAhoD,IAAA,CAAAmK,EACA,CACA,IAAAg+C,EAAA,GAeS,MAdT,OAAAzmC,QAAAqkC,GAAA,CAAAiC,EAAA,EAAAr6C,OAAA,KACA,IAAA1E,EACA,GAAA0+C,EAAArgC,OAAA,GAAAnd,EAAAzD,KAAA,8BAAAyD,EAAAzD,KAAA,IACA,GAAAihD,EAAArgC,OAAA,YAAAre,CAAAA,EAAAkB,EAAA1F,MAAA,GAAAwE,KAAA,IAAAA,EAAA,OAAAA,EAAA/F,KAAA,0BACAiH,EAAA1F,MAAA,CAAAvB,KAAA,CAAAyK,OAAA,KACA,GAAAhF,WAAAA,EAAAzG,IAAA,IAIAimD,EAAAnoD,IAAA,CAAAkB,EAAA2d,IAAA,CAAAlW,EAAAzG,IAAA,IAAAyG,EAAAzG,IAAA,MAHAimD,EAAAnoD,IAAA,MAKa,EACb,GACA,GAAA2nD,EAAArgC,OAAA,EAAA6gC,EAAAzmD,MAAA,GAAAkI,EAAAlI,MAAA,mCACSymD,CACT,EACA,CAEA2gB,wBAAA/oB,CAAA,CAAAgrB,EAAA,IACA,OAAAvmB,EAAA,+BACS,YAAAjhC,GAAA,IAAAs+B,EAAAmC,gBAAA,EAAAjE,GAAA2qB,EAAAc,yBAAA,CAAAT,EACT,EACA,CACAU,kBAAA1rB,CAAA,CAAAgrB,EAAA,IACA,OAAAvmB,EAAA,+BACS,YAAAjhC,GAAA,IAAAs+B,EAAAmC,gBAAA,EAAAjE,GAAA2qB,EAAAgB,mBAAA,CAAAX,EACT,EACA,CACA,CAAsBvqE,EAAA2pE,cAAA,CAAAA,CAAA,gBAAAlqE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC9IT,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAmB,CAAA0C,MAAA,KAChCu9C,EAAatgD,EAAQ,KAAWK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjBnB,aAEb,IAAAkoD,EAAA,WAAAA,UAAA,WAAAC,CAAA,CAAAnK,CAAA,CAAAh7C,CAAA,CAAAk9C,CAAA,EACA,IAAAjgD,EAAAmoD,EAAA3uB,UAAAl4B,MAAA,CAAAkD,EAAA2jD,EAAA,EAAApK,EAAAkC,IAAA,GAAAA,EAAAA,EAAA98C,OAAA+8C,wBAAA,CAAAnC,EAAAh7C,GAAAk9C,CAAA,CACA,oBAAAmI,SAAA,mBAA6CA,QAAQC,QAAA,CAAA7jD,EAAA4jD,QAAAC,QAAA,CAAAH,EAAAnK,EAAAh7C,EAAAk9C,QACrD,QAAAv5C,EAAAwhD,EAAA5mD,MAAA,GAAAoF,GAAA,EAAAA,IAAA1G,CAAAA,EAAAkoD,CAAA,CAAAxhD,EAAA,GAAAlC,CAAAA,EAAA,CAAA2jD,EAAA,EAAAnoD,EAAAwE,GAAA2jD,EAAA,EAAAnoD,EAAA+9C,EAAAh7C,EAAAyB,GAAAxE,EAAA+9C,EAAAh7C,EAAA,GAAAyB,CAAAA,CAAA,CACA,OAAA2jD,EAAA,GAAA3jD,GAAArB,OAAA8L,cAAA,CAAA8uC,EAAAh7C,EAAAyB,GAAAA,CAAA,EAEArB,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAA,KAC9B1C,EAAAkrE,mBAAiB,CAAAlrE,EAAQgrE,yBAAuB,QAChD,IAAA3pB,EAAgB1hD,EAAQ,MACxBglD,EAAAhlD,EAAA,MAKA,SAAAuoD,GAAA,CACA,WAEA,CACA,CACA,SAAAijB,EAAAC,CAAA,CAAA1pE,CAAA,EACA,IAAA6a,EAAA8kC,EAAAgqB,kBAAA,CAAAtU,oBAAA,CAAAqU,GACA,GAAA7uD,EAAAy6C,OAAA,CAAAt1D,EAAA4pE,QAAA,OAEA,OADAthE,QAAA9D,KAAA,0CACA,KAEA,IACA,OAAAy+C,EAAA4mB,aAAA,CAAAxyD,MAAA,CAAAqyD,EAAA1pE,EACA,CACA,MAAAo5D,EAAA,CAEA,OADA9wD,QAAA9D,KAAA,wCACA,KAEA,CAEA,IAAA8kE,EAAA,MACA/oE,aAAA,EACA,OAAAmhB,MAAA1hB,CAAA,EACA,IAAAA,EACA,YAEA,IACA,OAAAypE,EAAAxmB,EAAA6mB,WAAA,CAAAC,iBAAA,CAAA/pE,EACA,CACA,MAAA2F,EAAA,CAEA,OADA2C,QAAA9D,KAAA,2CAAAmB,EAAA,GACA,KAEA,CACA,EACA2jE,EAAAnjB,EAAA,CACAK,IACA,CAAA8iB,GACAhrE,EAAAgrE,yBAAA,CAAAA,EACA,IAAAE,EAAA,MACAjpE,aAAA,EACA,OAAAmhB,MAAA1hB,CAAA,EACA,IAAAA,EACA,YAEA,IACA,OAAAypE,EAAAxmB,EAAA6mB,WAAA,CAAAE,WAAA,CAAAhqE,EACA,CACA,MAAA2F,EAAA,CAEA,OADA2C,QAAA9D,KAAA,qCAAAmB,EAAA,GACA,KAEA,CACA,EACA6jE,EAAArjB,EAAA,CACAK,IACA,CAAAgjB,GAA2BlrE,EAAAkrE,mBAAA,CAAAA,CAAA,gBAAAzrE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECxEd,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAiB,CAAA0C,MAAA,KAC9Bu9C,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAOK,GAC5BigD,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAaK,GAClCigD,EAAatgD,EAAQ,MAASK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECtBjB,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAgB,CAAA7O,EAAA,cAAA0C,MAAA,KAChB1C,EAAAqpE,QAAA,CAAkB,OAClB,IAAAphD,EAAAtoB,EAAsB,MACtB6mE,EAAA7mE,EAAA,MACA,SAAA0pE,EAAA7U,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACA4lD,QAAA,CAAA7B,EAAArd,MAAA,EACAjiD,QAAA,CAAAnF,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAkF,GAAA,CAAA+7D,cAAAh8C,EAAAw2B,aAAA,CAAAM,SAAA,CAAAmlB,aAAAsC,EAAAxnB,gBAAA,IACA2M,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAAgBvI,EAAAqpE,QAAA,CAAAA,CAAA,gBAAA5pE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC5BH,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAoB,CAAA0C,MAAA,KACjCu9C,EAAatgD,EAAQ,MAAYK,GACjCigD,EAAatgD,EAAQ,MAAkBK,GACvCigD,EAAatgD,EAAQ,MAAYK,GACjCigD,EAAatgD,EAAQ,MAAuBK,GAC5CigD,EAAatgD,EAAQ,MAAiBK,GACtCigD,EAAatgD,EAAQ,MAAgBK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECtBxB,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAgB,CAAA7O,EAAA,cAAA0C,MAAA,KAChB1C,EAAA4oE,QAAA,CAAkB,OAClB,IAAA3gD,EAAAtoB,EAAsB,MACtB6mE,EAAA7mE,EAAA,MACA,SAAAipE,EAAApU,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACAmlD,QAAA,CAAApB,EAAAnmE,KAAA,CAAAmmE,EAAArd,MAAA,CAAAqd,EAAoDqB,KAAA,EACpD3gE,QAAA,CAAAnF,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAkF,GAAA,CAAAg8D,aAAAsC,EAAAxnB,gBAAA,CAAAilB,cAAAh8C,EAAAw2B,aAAA,CAAAM,SAAA,IACA4M,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAAgBvI,EAAA4oE,QAAA,CAAAA,CAAA,gBAAAnpE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC5BH,aAEb,IAAAqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAA,CAAsB7O,EAAA,cAAA0C,MAAA,KACtB1C,EAAA2mE,cAAkB,QAClB,IAAA1+C,EAAAtoB,EAAsB,MACtB6mE,EAAA7mE,EAAA,MACA,SAAAgnE,EAAAnS,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACAkjD,cAAA,CAAAa,EAAA/E,OAAA,CAAA+E,EAAAh2C,IAAoD,CAAAg2C,EAAAX,aAAe,CAAAW,EAAAV,WAAA,CAAAU,EAAAT,OAAA,CAAAS,EAAAR,KAAA,EACnE9+D,QAAA,CAAAnF,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAkF,GAAA,CAAA+7D,cAAAh8C,EAAAw2B,aAAA,CAAAM,SAAA,CAAA+kB,uBAAA0C,EAAApgB,2BAAA,CAAA8d,aAAAsC,EAAAxnB,gBAAA,IACA2M,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAAsBvI,EAAA2mE,cAAA,CAAAA,CAAA,gBAAAlnE,CAAA,CAAAO,CAAA,EC5BT,aAEb,IAAAgkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EAGA,SAAA4jE,EAAAlT,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACAikD,QAAA,GACAx/D,QAAA,CAAAnF,OAAAC,MAAA,IAAAkF,IACAyjD,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAfAxF,OAAA8L,cAAgB,CAAA7O,EAAA,cAAA0C,MAAA,KAChB1C,EAAA0nE,QAAA,QAcgB1nE,EAAA0nE,QAAA,CAAAA,CAAA,gBAAAjoE,CAAA,CAAAO,CAAA,EC1BH,aAEb,IAAAgkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EAGA,SAAAikE,EAAAvT,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,UAAY,qBAC5B,IAAA97C,SAAAA,CAAA,EAAAk3B,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACAskD,mBAAA,GACA7/D,QAAA,CAAAnF,OAAAC,MAAA,IAAAkF,IACAyjD,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAfAxF,OAAA8L,cAAA,CAAA7O,EAA2B,cAAA0C,MAAA,KAC3B1C,EAAA+nE,mBAAA,QAc2B/nE,EAAA+nE,mBAAA,CAAAA,CAAA,gBAAAtoE,CAAA,CAAAO,CAAA,EC1Bd,aAEb,IAAAgkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EAGA,SAAAokE,EAAA1T,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACAykD,aAAA,CAAAV,EAAAh2C,IAAsC,CAAAg2C,EAAAX,aAAA,CAAAW,EAAAV,WAAA,EACtC5+D,QAAA,CAAAnF,OAAAC,MAAA,IAAAkF,IACAyjD,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAfAxF,OAAA8L,cAAqB,CAAA7O,EAAA,cAAA0C,MAAA,KACrB1C,EAAAkoE,aAAA,QAcqBloE,EAAAkoE,aAAA,CAAAA,CAAA,gBAAAzoE,CAAA,CAAAO,CAAA,EC1BR,aAEb,IAAAgkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EAGA,SAAAqkE,EAAA3T,CAAA,CAAAp1B,CAAA,EACA,OAAA4kB,EAAgB,YAAmB,mBACnC,IAAA97C,SAAAA,CAAA,CAAAs/D,OAAAA,CAAA,EAAApoC,EACAqtB,EAAA,MAAA+H,EAAA/wC,OAAA,CACA0kD,YAAA,CAAAX,EAAAT,OAAsC,CAAAS,EAAAR,KAAA,EACtC9+D,QAAA,CAAAnF,OAAAC,MAAA,IAAAkF,IACAyjD,WAAA,GACA,OACAnM,aAAA,CAAAiN,EAAA,CACAhN,oBAAA,GACAl3C,QAAA,GAEA,EACA,CAfAxF,OAAA8L,cAAoB,CAAA7O,EAAA,cAAA0C,MAAA,KACpB1C,EAAAmoE,YAAA,QAcoBnoE,EAAAmoE,YAAA,CAAAA,CAAA,gBAAA1oE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC1BP,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACA6mE,EAAA,WAAAA,kBAA0C,EAAA5oE,CAAAA,OAA4B8C,MAAA,UAAA85C,CAAA,CAAA56C,CAAA,EACrEhC,OAAA8L,cAAA,CAAA8wC,EAAA,WAAA3zB,WAAA,GAAAtpB,MAAAqC,CAAA,EACD,WAAA46C,CAAA,CAAA56C,CAAA,EACC46C,EAAA,QAAA56C,CACD,GACA6mE,EAAA,WAAAA,YAAA,WAAA/gD,CAAA,EACA,GAAAA,GAAAA,EAAArc,UAAA,QAAAqc,CAAA,CACA,IAAA5mB,EAAA,GACA,GAAA4mB,IAAA,EAAAA,EAAA,QAAA/lB,KAAA+lB,EAAA,YAAA/lB,GAAA/B,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAkc,EAAA/lB,IAAA46C,EAAAz7C,EAAA4mB,EAAA/lB,EAAA,CAEA,OADA6mE,EAAA1nE,EAAA4mB,GACA5mB,CACA,EACA+/C,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAe,CAAA7O,EAAA,cAAA0C,MAAA,KACf1C,EAAAiqE,OAAA,MAAqB,EACrB,IAAA1D,EAAA5mE,EAAyB,MACzBksE,EAAAD,EAAAjsE,EAAA,MACA,OAAAsqE,EACAhoE,YAAA9B,CAAA,CAAAssD,CAAA,EACA,KAAAtsD,GAAA,CAAAA,EACA,KAAAssD,EAAA,CAAAA,CACA,CACAka,eAAAvnC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAAlF,cAAA,MAAAxmE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACAsoC,SAAAtoC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAAnE,QAAA,MAAAvnE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACA+oC,aAAA/oC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAA1D,YAAA,MAAAhoE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACA8oC,cAAA9oC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAA3D,aAAA,MAAA/nE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACA2oC,oBAAA3oC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAA9D,mBAAA,MAAA5nE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACAwpC,SAAAxpC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAAjD,QAAA,MAAAzoE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACAiqC,SAAAjqC,CAAA,EACA,OAAA4kB,EAAA,+BAES,OADT,KAAAyI,EAAA,OAAAof,EAAAxC,QAAA,MAAAlpE,GAAA,CAAAq0D,OAAA,CAAAp1B,GACS,MAET,CACA0oC,MAAA,CACA,IAAAtmE,EAAA,IAAA+kE,EAAA/a,kBAAA,MAAArrD,GAAA,CAAA4sD,QAAA,CAAAnlD,UAAA,MAAAzH,GAAA,CAAA4sD,QAAA,CAAA9hD,MAAA,EACA,YAAAwhD,EAAA,CAAAjrD,EAAAkqD,cAAA,MAAAe,EAAA,EAAAjrD,CAAA,CAEA,CAAexB,EAAAiqE,OAAA,CAAAA,CAAA,gBAAAxqE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCzFF,IAAAe,EAAAf,EAAA,aAEboD,OAAA8L,cAAW,CAAA7O,EAAA,cAAA0C,MAAA,KACX1C,EAAA8rE,GAAA,MAAiB,EACjB,IAAAzqB,EAAA1hD,EAAyB,MACzBsoB,EAAAtoB,EAAoB,MACpBosE,EAAApsE,EAAA,KACA,OAAAmsE,EACA7pE,YAAA88C,CAAA,EACA,KAAAkoB,WAAA,EAAAxgB,EAAAgc,EAAA,IAAAphB,EAAAC,EAAA,OACA,IAAA2hB,EAAApf,EAAA,CAAA57B,EAAAnJ,SAAA,CAAAilC,sBAAA,EAAA1C,EAAAyC,KAAA,CAAAz/B,KAAA,CAAAotC,IAAA,CAAA9vD,MAAA,sBAAA8kD,EAAA4C,OAAA,GAAAoZ,EAAAh2C,WAAA,CAAA/rB,EAAA,SAAAqrE,EAAAxC,UAAA,EACA,OACA5mE,IAAAsgE,EACApf,KAAAA,CACA,CACA,EACA,KAAAklB,YAAA,EAAAK,EAAAnC,IAAA,CACA,IAAAhE,EAAApf,EAAA,CAAA57B,EAAAnJ,SAAA,CAAAilC,sBAAA,EACA1C,EAAAyC,KAAA,CAAAz/B,KAAA,CAAAotC,IAAA,CAAA9vD,MAAA,gBACAynE,EAAA/f,OAAA,GACA4d,EAAA5d,OAAA,GACA,CAAA0iB,EAAAxC,UAAA,EACA,OACA5mE,IAAAsgE,EACApf,KAAAA,CACA,CACA,EACA,KAAA9E,SAAA,CAAAA,CACA,CACA,CAAW/+C,EAAA8rE,GAAA,CAAAA,CAAA,gBAAArsE,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7BE,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAgB,CAAA0C,MAAA,KAAAu9C,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,EChBhB,aAEb,IA8BA6rE,EADAA,EA7BA9rB,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACA6mE,EAAA,WAAAA,kBAA0C,EAAA5oE,CAAAA,OAA4B8C,MAAA,UAAA85C,CAAA,CAAA56C,CAAA,EACrEhC,OAAA8L,cAAA,CAAA8wC,EAAA,WAAA3zB,WAAA,GAAAtpB,MAAAqC,CAAA,EACD,WAAA46C,CAAA,CAAA56C,CAAA,EACC46C,EAAA,QAAA56C,CACD,GACA6mE,EAAA,WAAAA,YAAA,WAAA/gD,CAAA,EACA,GAAAA,GAAAA,EAAArc,UAAA,QAAAqc,CAAA,CACA,IAAA5mB,EAAA,GACA,GAAA4mB,IAAA,EAAAA,EAAA,QAAA/lB,KAAA+lB,EAAA,YAAA/lB,GAAA/B,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAkc,EAAA/lB,IAAA46C,EAAAz7C,EAAA4mB,EAAA/lB,EAAA,CAEA,OADA6mE,EAAA1nE,EAAA4mB,GACA5mB,CACA,EACAlB,OAAA8L,cAAmB,CAAG7O,EAAA,aAAwB,CAAA0C,MAAA,KAC9C1C,EAAAwrE,WAAiB,CAAAxrE,EAAAurE,aAA+B,CAAAvrE,EAAA8pE,oBAAA,QAChD,IAAAzoB,EAAA1hD,EAAyB,MACzB0mE,EAAAuF,EAAAjsE,EAA4B,MAC5BK,CAAAA,EAAA8pE,oBAAqB,CAAAzD,EACrBrmE,EAAAurE,aAAA,KAAAlqB,EAAAgqB,kBAAA,CAAArrE,EAAA8pE,oBAAA,EAGA0B,CADAA,EAEiEA,EAAAxrE,EAAAwrE,WAAA,EAAAxrE,CAAAA,EAAAwrE,WAAA,MADjE,sCACCA,EAAA,yBAAgE,gBAAA/rE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eClCpD,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAmB,CAAA7O,EAAA,cAAA0C,MAAA,KACnB1C,EAAAgsE,WAAA,QACA,IAAAlgD,EAAAlB,EAAkBjrB,EAAiB,OACnCssE,EAAAtsE,EAAsB,MACtBusE,EAAAvsE,EAAA,KACA,OAAAqsE,EACA/pE,YAAAkqE,CAAA,EACA,KAAAC,KAAA,KAAAF,EAAAG,UAAA,CAAAF,EAAAhrE,GAAA,GAAAgH,QAAAA,CAAA,CAAAgiD,OAAAA,CAAA,EAAA9oD,IACS2qE,EAAAM,MAAA,CAAAjrE,EAAA8G,EAAAgiD,IAET,CACA,OAAAoiB,YAAAlrE,CAAA,CAAA8G,CAAA,CAAAgiD,CAAA,CAAA0e,CAAA,CAAAr3C,CAAA,EACA,IAAAg7C,EAAAR,EAAAM,MAAA,CAAAjrE,EAAA8G,EAAAgiD,GACA,QAAA7a,KAAAu5B,EACA2D,EAAAN,EAAAG,UAAA,CAAAI,YAAA,CAAAD,EAAAl9B,GAEA,OAAAk9B,EAAArnB,MAAA,CAAA3zB,EACA,CAEA,OAAA86C,OAAkBjrE,CAAA,CAAM8G,CAAA,CAAAgiD,CAAA,EACxB,IAAAnoC,EAAAthB,EAAA01B,MAAA,EACA,IAAAtK,EAAAhF,OAAA,CAAAzlB,GAAAorB,WAAA,CAAA/rB,EAAA,QACAyH,EAAA4W,QAAA,GACA,IAAA+M,EAAAhF,OAAA,CAAAqjC,GAAA19B,WAAA,CAAA/rB,EAAA,QACA,EACAshB,EAAAthB,EAAA2d,IAAA,IAA4B4tD,EAAMS,UAAA,EAAA1qD,GAAA,OAClC,IAAc2qD,EAAMjsE,EAAA2d,IAAA,MAEpB,OADA2D,EAAAthB,EAAqB01B,MAAA,EAAAu2C,EAAA3qD,EAAA,EACrBthB,EAAA2d,IAAA,IAAA4tD,EAAAS,UAAA,EAAA1qD,GAAA,MACA,CACA4qD,YAAA,CACA,YAAAR,KAAA,CAAAQ,UAAA,EACA,CAEAC,YAAAxrE,CAAA,CAAA8G,CAAA,CAAAgiD,CAAA,EACA,YAAAiiB,KAAA,CAAAS,WAAA,CAAAb,EAAAM,MAAA,CAAAjrE,EAAA8G,EAAAgiD,GACA,CACA2iB,SAAA,CACA,YAAAV,KAAA,CAAAU,OAAA,EACA,CACAC,SAAA1rE,CAAA,CAAA8G,CAAA,CAAAgiD,CAAA,EACA,YAAAiiB,KAAA,CAAAW,QAAA,CAAAf,EAAAM,MAAA,CAAAjrE,EAAA8G,EAAAgiD,GACA,CACA,CAAmBnqD,EAAAgsE,WAAA,CAAAA,CAAA,gBAAAvsE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eChDN,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAA,CAAsB7O,EAAA,cAAA0C,MAAA,KACtB1C,EAAAynE,cAAA,QACA,IAAAtgB,EAAAv8B,EAAAjrB,EAAA,OACA8nE,EAAA,IACA,GAAAtgB,EAAsBrgC,OAAA,EAAA9N,EAAA9X,MAAA,uBAAA8X,EAAA9X,MAAA,IACtB,IAAA8gB,EAAAthB,EAAAknB,KAAA,KAEA,OADA5O,EAAA6O,IAAA,CAAA7F,EAAA,GAAAhJ,EAAA9X,MAAA,EACAJ,MAAAud,IAAA,CAAA2D,EACA,CAAsBhiB,CAAAA,EAAAynE,cAAA,CAAAA,CAAA,gBAAAhoE,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCbT,IAAAe,EAAAf,EAAA,aAEbqkD,EAAA,UAA4B,CAAAA,SAAA,WAAAxgC,CAAA,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,EACA,EACAf,OAAA8L,cAAA,CAAA7O,EAAA,aAAoC,CAAA0C,MAAA,KACpC1C,EAAAgtE,yBAAiB,CAAOhtE,EAAoBitE,iBAAA,QAC5C,IAAA5rB,EAAA1hD,EAAoB,MACpBw+C,EAAAx+C,EAAA,MACA,SAAAstE,EAAA7D,CAAA,CAAAnC,CAAA,CAAAloB,CAA2D,EAC3D,OAAAsC,EAAA6rB,IAAA,CAAApuD,SAAA,CAAAilC,sBAAA,EAAArjD,EAAA2d,IAAA,gBAAA+qD,EAAA/f,OAAA,GAAA4d,EAAA5d,OAAA,IAAAtK,EACA,CACA/+C,EAAAitE,iBAAA,CAAAA,EACA,IAAAD,EAAA,CAAAnoB,EAAAj6C,EAAAhD,EAAAulE,EAAA,GAAA/kD,EAAAxd,CAAA,GAAAo5C,EAAA,iCACA,IAAAopB,EACA,IACAA,EAAA,MAAAjvB,EAAAe,KAAA,CAAAoH,yBAAA,CAAAnI,EAAAiI,2BAAA,CAAAjI,EAAAa,gBAAA,CAAA6F,EAAAj6C,EAAAuiE,GACA,IAAAhlE,EAAA,MAAAP,EAAA0/C,cAAA,CAAA8lB,GACA,IAAAjlE,EAAA,CACA,IAAAskD,EAAAtO,EAAAe,KAAA,CAAAiH,uCAAA,CAAAhI,EAAAiI,2BAAA,CAAAjI,EAAAa,gBAAA,CAAA6F,EAAAuoB,EAAAxiE,EAAAwd,GACA,OAAAglD,EAAA3gB,EAAA,CACA,MACA,CAAA2gB,EAAArpE,KAAAA,EAAA,CAEA,MAAAsD,EAAA,CAGA,MADA2C,QAAA9D,KAAA,oCAAAmB,GACAA,CAAA,CAEA,EAAiCrH,CAAAA,EAAAgtE,yBAAA,CAAAA,CAAA,gBAAAvtE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECnCpB,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAwB,CAAA0C,MAAA,KACrCu9C,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAUK,GAC/BigD,EAAatgD,EAAQ,MAAeK,GACpCigD,EAAatgD,EAAQ,MAAWK,GAChCigD,EAAatgD,EAAQ,MAAOK,GAAAigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCrBf,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAkB,CAAA7O,EAAA,cAAA0C,MAAA,KAClB1C,EAAAqsE,UAAkB,QAClB,IAAAJ,EAAAtsE,EAAA,MACAwnD,EAAAv8B,EAAkCjrB,EAAA,OAClC0tE,EAAA3sE,EAAA2d,IAAA,MACA,SAAAivD,EAAAllE,CAAA,CAAAmlE,CAAA,EACA,IAAAC,EAAAplE,EAAA,KAAAA,EAAA,EAAAA,EAAA,EACA,IAAAolE,CAAAA,EAAAD,EAAArsE,MAAA,EAMA,aALA,IAAAusE,EAAAF,CAAA,CAAAC,EAAA,CAEA,MADA,GAAArmB,EAAArgC,OAAA,EAAA2mD,EAAA,UACAA,CACA,CAIA,CACA,SAAAC,EAAAC,CAAA,EACA,OAAAA,EAAArjD,MAAA,EAAAsjD,EAAAxlE,IAAA,CACA,IAAAK,EACK,OAAAL,IAAAA,GAAA,SAAAK,CAAAA,EAAAklE,CAAA,CAAAvlE,EAAA,KAAAK,KAAA,IAAAA,EAAA,OAAAA,EAAA08C,MAAA,CAAAyoB,EAAA,CACL,EACA,CACA,SAAAC,EAAAC,CAA0B,EAC1B,GAAAA,EAAAC,IAAA,KAAArtE,EAAAgd,QAAA,CAAAkwD,IACA,gDAEA,OAAAE,EAAA3sE,GAAA,SAAAysE,EAAA3kE,QAAA,QACA,CACA,SAAA+kE,EAAA,GAAAxkE,CAAA,EACA,IAAAykE,EAAA,IAAAzkE,EAAA,CAAAwnC,IAAA,CAAAtwC,EAAAs2D,OAAA,CAAAp6C,IAAA,QACAoF,EAAA,CAAAqrD,EAAA,CACA,QAAAv2C,KAAAm3C,EACAjsD,EAAAxiB,IAAA,CAAAs3B,GAEA,OAAAp2B,EAAA01B,MAAA,CAAApU,EACA,CACA,MAAAqqD,EACApqE,YAAA0rE,CAAA,EACA,KAAAO,SAAA,KAAAP,EAAA,CAEA,KAAAO,SAAA,CAAAl9B,IAAA,CAAAtwC,EAAAs2D,OAAA,CAAAp6C,IAAA,QAEA,KAAAsxD,SAAA,CAAAR,EAAA,KAAAQ,SAAA,EACA,KAAAC,2BAAA,MAAAD,SAAA,CAAA7yD,MAAA,EAAA+yD,EAAAR,EAAAvsE,KACA+sE,CAAA,CAAAR,EAAA3kE,QAAA,SAAA5H,EACa+sE,GACb,IAEA,KAAAC,OAAA,MAAAC,SAAA,MAAAJ,SAAA,CACA,CACAI,UAAAX,CAAA,EACA,IAAAllE,EAAAgD,EACA,GAAAkiE,IAAAA,EAAAzsE,MAAA,CACA,0BAEA,IAAAqtE,EAAA,GAGA,IAFAA,EAAA/uE,IAAA,CAAAmuE,GAEA,QAAAliE,CAAAA,EAAA,OAAAhD,CAAAA,EAAA8lE,CAAA,CAAAA,EAAArtE,MAAA,MAAAuH,KAAA,IAAAA,EAAA,OAAAA,EAAAvH,MAAA,GAAAuK,KAAA,IAAAA,EAAAA,EAAA,OACA,IAAA+iE,EAAAD,CAAA,CAAAA,EAAArtE,MAAA,IACA,GAAAimD,EAAArgC,OAAA,EAAA0nD,EAAA,kBACAD,EAAA/uE,IAAA,MAAAivE,YAAA,CAAAD,GACA,CACA,OAAAD,CACA,CACAE,aAAAd,CAAA,EACA,OAAAA,EAAAtyD,MAAA,EAAAkyD,EAAAK,EAAAxlE,EAAA0lE,IAAA,CACA,GAAA1lE,EAAA,MAEA,IAAAqlE,EAAAK,CAAA,CAAA1lE,EAAA,GACAmlE,EAAA/tE,IAAA,CAAA6sE,EAAAI,YAAA,CAAAmB,EAAAH,GACA,QACSF,CACT,KACA,CACA,OAAAd,aAAAjlE,CAAA,CAAAknE,CAAA,SACA,EAIAA,EAIAhuE,EAAA2d,IAAA,CAAA4tD,EAAAS,UAAA,CAAA/V,MAAA,CAAAqX,EAAAxmE,EAAAknE,MAHA,GAAAvnB,EAAArgC,OAAA,EAAAtf,EAAA,oCACAA,IALA,GAAA2/C,EAAArgC,OAAA,EAAA4nD,EAAA,qCACAA,EACA,CAOA5B,SAAA,CACA,IAAArkE,EACA,IAAA+oB,EAAA,OAAA/oB,CAAAA,EAAA,KAAA4lE,OAAA,MAAAA,OAAA,CAAAntE,MAAA,MAAAuH,KAAA,IAAAA,EAAA,OAAAA,CAAA,IAEA,MADA,GAAA0+C,EAAArgC,OAAA,EAAA0K,EAAA,QACAA,CACA,CACAo7C,YAAA,CACA,YAAAE,OAAA,GAAA7jE,QAAA,OACA,CACA8jE,SAAAa,CAAA,EACA,IAAAe,EAAA,KAAAR,2BAAA,CAAAP,EAAA3kE,QAAA,SACA,oBAAA0lE,EACA,qDAEA,IAAAvmE,EAAAumE,EACA,YAAAN,OAAA,CAAAhzD,MAAA,EAAAwtD,EAAA0E,IAAA,CACA,IAAAqB,EAAAtB,EAAAllE,EAAAmlE,GAKS,OAJTqB,GACA/F,EAAArpE,IAAA,CAAAovE,GAEAxmE,EAAApH,KAAAwZ,KAAA,CAAApS,EAAA,GACSygE,CACT,KACA,CACAgE,YAAAe,CAAA,EACA,IAAA/E,EAAA,KAAAkE,QAAA,CAAAa,GACA,OAAAC,EAAAhF,EACA,CACA,CAAkB7oE,EAAAqsE,UAAA,CAAAA,CAAA,gBAAA5sE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECvHL,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAsC,CAAA0C,MAAA,KACtC1C,EAAA6uE,8BAAyB,CAAmB,OAC5C,IAAAxtB,EAAA1hD,EAA6B,MAC7BmvE,EAAAnvE,EAAA,KACA,SAAAkvE,EAAA9hB,CAAA,CAAAhO,CAAA,EACA,IAAAyV,EAAA,IAAAnT,EAAAwoB,OAAA,CAAAiF,EAAAzI,GAAA,CAAAtnB,EAAAgO,GACA,OAAAyH,CACA,CAAsCx0D,EAAA6uE,8BAAA,CAAAA,CAAA,gBAAApvE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECTzB,iBAuBb+oE,EACAA,EAtBA3lE,OAAA8L,cAAA,CAAA7O,EAA2B,aAAkB,CAAA0C,MAAA,KAC7C1C,EAAA0oE,gBAAkB,CAAA1oE,EAAAwoE,UAAyB,QAC3C,IAAAvgD,EAAAtoB,EAAA,MAEA,SAAA6oE,EAAAxhE,CAAA,CAAA+nE,CAAA,CAAAC,CAAA,EAMA,QAAAhjE,KALAhF,EAAAxH,IAAA,EACAmnD,OAAAooB,EACAnoB,SAAAooB,IAAAA,EAAA9tE,MAAA,CACK2lD,WAAA,EACL,GACAmoB,GACAhoE,EAAAxH,IAAA,EACAmnD,OAAA36C,aAAAic,EAAAnJ,SAAA,CAAA9S,EAAAA,EAAAnK,SAAA,CACA+kD,SAAA,GACSC,WAAA,EACT,GAEA,OAAA7/C,CACA,CACAhH,EAAAwoE,UAAA,CAAAA,EAIAE,CADAA,EA0CgFA,EAAA1oE,EAAA0oE,gBAAA,EAAA1oE,CAAAA,EAAA0oE,gBAAA,KAzChF,CAAAA,EAAA,mCACAA,CAAA,CAAAA,EAAA,yCACAA,CAAA,CAAAA,EAAA,2CACAA,CAAA,CAAAA,EAAA,uBACAA,CAAA,CAAAA,EAAA,qBACAA,CAAA,CAAAA,EAAA,mBACAA,CAAA,CAAAA,EAAA,+BACAA,CAAA,CAAAA,EAAA,mBACAA,CAAA,CAAAA,EAAA,eACAA,CAAA,CAAAA,EAAA,+BACAA,CAAA,CAAAA,EAAA,kCACAA,CAAA,CAAAA,EAAA,8BACAA,CAAA,CAAAA,EAAA,sCACAA,CAAA,CAAAA,EAAA,oCACAA,CAAA,CAAAA,EAAA,kCACAA,CAAA,CAAAA,EAAA,8BACAA,CAAA,CAAAA,EAAA,4CACAA,CAAA,CAAAA,EAAA,4BACAA,CAAA,CAAAA,EAAA,4CACAA,CAAA,CAAAA,EAAA,8CACAA,CAAA,CAAAA,EAAA,sCACAA,CAAA,CAAAA,EAAA,4CACAA,CAAA,CAAAA,EAAA,wDACAA,CAAA,CAAAA,EAAA,wCACAA,CAAA,CAAAA,EAAA,wCACAA,CAAA,CAAAA,EAAA,gEACAA,CAAA,CAAAA,EAAA,gDACAA,CAAA,CAAAA,EAAA,kEACAA,CAAA,CAAAA,EAAA,gEACAA,CAAA,CAAAA,EAAA,4BACAA,CAAA,CAAAA,EAAA,kDACAA,CAAA,CAAAA,EAAA,wCACAA,CAAA,CAAAA,EAAA,kEACAA,CAAA,CAAAA,EAAA,gEACAA,CAAA,CAAAA,EAAA,0CACAA,CAAA,CAAAA,EAAA,8DACAA,CAAA,CAAAA,EAAA,kDAGAA,CAAA,CAAAA,EAAA,wDACAA,CAAA,CAAAA,EAAA,kDACCA,CAAA,CAAAA,EAAA,2BAAkD,KAAwB,6BAAK,gBAAAjpE,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,iCAAAuvE,EAAA,gCAAAC,EAAA,mCAAAlkE,EAAA,uBAAAnL,EAAAC,CAAA,uCAAAurE,EAAA,+BAAA8D,EAAA,oCAAAC,EAAA,0CAAAC,EAAA,uCAAAC,EAAA,iCAAAC,EAAA,gCAAAC,EAAA,6BAAAC,EAAA,kCAAA97D,EAAA,qCAAA+7D,EAAA,0CAAAC,EAAA,2BAAAC,EAAA,4BAAA/F,EAAA,iCAAAgG,EAAA,sCAAAC,EAAA,gCAAAC,EAAA,uCAAAC,EAAA,gCAAAC,EAAA,mCAAAC,CAAA,gCAAAC,EAAA,oCAAAC,EAAA,kCAAAC,CAAA,qCAAA7sB,CAAA,mCAAA8sB,EAAA,0BAAAjvE,EAAA,qCAAAkvE,CAAA,yBAAAnwE,CAAA,QC2+HhFL,EAAAC,EACAC,EACAC,EAOAX,EA0hBAY,ED9gJgFmwD,EAAA3wD,EAAA,MAAAS,EAAAT,EAAA,MAAAU,EAAAV,EAAA,MAAAE,EAAAF,EAAAW,CAAA,CAAAD,GAAAE,EAAAZ,EAAA,MAAAa,EAAAb,EAAAW,CAAA,CAAAC,GAAAiwE,EAAA7wE,EAAA,MAAA8wE,EAAA9wE,EAAAW,CAAA,CAAAkwE,GAAA/vE,EAAAd,EAAA,MAAA+wE,EAAA/wE,EAAA,MAAAgxE,EAAAhxE,EAAA,MAAAixE,EAAAjxE,EAAA,MAAAkxE,EAAAlxE,EAAAW,CAAA,CAAAswE,GClEpClwE,EAAAf,EAAA,aAqB5C,SAAAgB,EAAAC,CAAA,CAAAC,CAAA,EACA,OAAAC,MAAAC,KAAA,SAAAC,KAAAC,IAAA,CAAAL,EAAAM,MAAA,CAAAL,KAAAM,GAAA,EAAAC,EAAAC,IAAAT,EAAAU,KAAA,CAAAD,EAAAR,EAAA,CAAAQ,EAAA,GAAAR,GACA,CAOA,IAAAU,EAAA,GACA,YAAAC,EA0BA,SAAAsvE,EAAAlwE,CAAA,EACA,IAAU+d,EAAA,IAAAqyC,YAAA,SAEV,OAAAryC,EAAA5F,MAAA,CAAAnY,EACA,CACA,SAAAmwE,EAAAntE,CAAA,EACA,IAAUgb,EAAA,IAAAqyC,YAEV,OAAAryC,EAAAjd,MAAA,CAAAiC,EAAA,CASA,SAAAnC,EAAWC,CAAA,EACX,OAAAlB,IAAAmB,MAAA,CAAAD,EACA,CAWA,SAAAC,EAAAD,CAAA,EACA,OAAAA,EAAAuH,QAAA,UACA,CACA,SAAA8P,EAAWrX,CAAA,EACX,OAAA4uD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAA3c,EAAA,UASA,IAAAsvE,EAAAjuE,OAAAquD,MAAA,EACAC,UAAA,KACAC,IAnDAvuD,OAAAquD,MAAA,EACAC,UAAA,KACA1vD,OAnBA,SAAAD,CAAA,EACA,OAAAA,EAAA2Z,MAAA,EAAAyP,EAAAmmD,IAAAnmD,EAAAmmD,EAAAhoE,QAAA,KAAAsoD,QAAA,aACA,EAkBCx4C,OAjBD,SAAArX,CAAA,EACA,IAAAA,EAAAwe,OAAA,QACAxe,CAAAA,EAAAA,EAAA8vD,MAAA,KAEA9vD,EAAAR,MAAA,OACAQ,CAAAA,EAAA,IAAAA,CAAA,EAEA,IAAAiB,EAAAjB,EAAA07B,KAAA,iBACA,IAAe,GAAfz6B,EACA2tD,EAAA5vD,MAAA,CAAA2d,IAAA,KAEAiyC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAA1b,EAAAxB,GAAA,IAAAsrC,SAAAwkC,EAAA,KADA,CAOC,GAiDDxf,KAnCA1uD,OAAAquD,MAAA,EACAC,UAAA,KACAt4C,OAAA+3D,EACCnvE,OAAAovE,CAAA,GAiCDrf,KAvBA3uD,OAAAquD,MAAA,EACAC,UAAA,KACA1vD,OAAAF,EACCsX,OAPD,SAAWrX,CAAA,EACX,OAAAlB,IAAAuY,MAAA,CAAArX,EAAA,CAMC,GAqBAiwD,OAXD5uD,OAAAquD,MAAA,EACAC,UAAA,KACA1vD,OAAAA,EACCoX,OAAAA,CAAA,EAQA,GAGD,SAAAm3D,EAAAta,CAAA,EACA,IAAA/D,EAAA,IAAAzsD,IAQA,OAPAwwD,EAAA/D,MAAA,EACA+D,EAAA/D,MAAA,CAAA1kD,OAAA,KACA,IAAA1E,EACA,IAAAjG,EAAA,OAAAiG,CAAAA,EAAApB,EAAA7E,GAAA,GAAAiG,KAAA,IAAAA,EAAAA,EAAApB,EAAApE,IAAA,CACS4uD,EAAAxsD,GAAA,CAAAgC,EAAAkD,IAAA,CAAA/H,EACT,GAEAqvD,CACA,CAEA,SAAAwe,EAAAa,CAAA,IAAA1nE,CAAA,EACA,GAAA0nE,EAAA1nE,IAAA,CAAAtI,MAAA,EAAAsI,EAAAtI,MAAA,CACA,uCAEA,IAAAurD,EAAA,GACArkD,EAAA,EAKA,OAJA8oE,EAAA1nE,IAAA,CAAA2D,OAAA,KACAs/C,CAAA,CAAA0kB,EAAAluE,IAAA,EAAAuG,CAAA,CAAApB,EAAA,CACKA,GAAA,CACL,GACAqkD,CACA,CAEA,SAAA8jB,EAAAa,CAAA,CAAAlpE,EAAA,IACAkpE,EAAAjkE,OAAA,KACA,gBAAAmO,EACAi1D,EAAAj1D,EAAApT,QAAA,CAAAA,CAAA,CAAAoT,EAAArY,IAAA,QAGA,GAAAiF,KAAAnE,IAAAmE,CAAA,CAAAoT,EAAArY,IAAA,EACA,kCAAAqY,EAAArY,IAAA,mBAIA,CAEA,SAAAugD,EAAAjE,CAA8B,EAC9B,OAAAA,aAAAn/C,EAAA0e,SAAA,CAAAygC,EAAA,IAAAn/C,EAAA0e,SAAA,CAAAygC,EAAA,CAeA,MAAAx9C,UAAAC,UACAC,YAAAC,CAAA,CAAAC,CAAA,MACAC,EACA,IACAC,QAAAA,CAAA,CACM,GAAAC,EACN,CAAAJ,EACA,CACMK,KAAAA,CAAA,CACN,CAAAL,EACAM,EAAAD,IAAAA,EAAArB,MAAA,CAAAmB,EAAA,YAAAE,EAAAE,IAAA,aAAAJ,CAAA,CACA,MAAAG,GACA,KAAAE,KAAA,QACA,KAAAC,GAAA,QACA,KAAAC,IAAA,QACA,KAAAC,UAAA,QACA,KAAAN,IAAA,QACA,KAAAO,MAAA,QACA,KAAAX,QAAA,QACAY,OAAAC,MAAA,MAAAV,GAAA,KAAAW,IAAA,MAAAhB,WAAA,CAAAgB,IAAA,CAGA,KAAAd,QAAA,UAAAe,EAGA,aAAAA,CAAAA,EAAAd,CAAA,EAAAc,EAAAd,EAAA,CAAAF,KAAAC,IAAA,CACA,CAEA,CAMA,SAAAgB,EAAAC,CAAA,EACA,OAAAC,EAAAD,IAAA,mBAAAA,CAAA,CAAAE,OAAAC,QAAA,EAOA,SAAAF,EAAAD,CAAA,EACA,uBAAAA,GAAAA,IAAA,EAAAA,CACA,CAKA,SAAAI,EAAAd,CAAA,EACA,uBAAAA,EAAAe,KAAAC,SAAA,CAAAhB,GAAA,GAAAA,CAAA,CAOA,SAAAiB,EAAAC,CAAA,EACA,IACAC,KAAAA,CAAA,CACInB,MAAAA,CAAA,CACJ,CAAAkB,EAAAE,IAAA,GACA,OAAAD,EAAAE,KAAAA,EAAArB,CAAA,CAMA,SAAAsB,EAAAC,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EACA,GAAAuB,CAAA,IAAAA,EACI,MAMJ,EALA,IAAAA,EACIA,EAAA,GACJ,iBAAAA,GACAA,CAAAA,EAAA,CACA5B,QAAA4B,CACA,GAGA,IACA1B,KAAAA,CAAA,CACIO,OAAAA,CAAA,CACJ,CAAAoB,EACA,CACItB,KAAAA,CAAA,CACJ,CAAAhB,EACA,CACAiB,WAAAA,CAAA,CACIR,QAAAA,EAAA,6BAAAO,EAAA,IAAAC,CAAAA,EAAA,qBAAAA,EAAA,4BAAAW,EAAAd,GAAA,IACJ,CAAAuB,EACA,OACAvB,MAAAA,EACAE,KAAAA,EACAC,WAAAA,EACAF,IAAAJ,CAAA,CAAAA,EAAArB,MAAA,IACAqB,KAAAA,EACAO,OAAAA,EACA,GAAAmB,CAAA,CACA5B,QAAAA,CACA,CACA,CAKA,SAAA8B,EAAAF,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EAKA,QAAA0B,KAJAjB,EAAAc,IACAA,CAAAA,EAAA,CAAAA,EAAA,EAGAA,GAAA,KAAA/B,EAAA8B,EAAAI,EAAAF,EAAAtC,EAAAc,GAGAR,GACA,OAAAA,CAAA,CAEA,CACA,CAMA,SAAAmC,EAAA3B,CAAA,CAAAd,CAAA,CAAA0C,CAAA,EACA,SAAAA,GACAA,CAAAA,EAAA,IAGA,IACA/B,KAAAA,EAAA,GACAO,OAAAA,EAAA,CAAAJ,EAAA,CACA6B,OAAAA,EAAA,GACIC,KAAAA,EAAA,GACJ,CAAAF,EACAnE,EAAA,CACAoC,KAAAA,EACAO,OAAAA,CAAA,EAGA,GAAAyB,IAAA7B,EAAAd,EAAA6C,OAAA,CAAA/B,EAAAvC,GAGAqE,GAAA5C,SAAAA,EAAAgB,IAAA,EAAAS,EAAAzB,EAAA8C,MAAA,GAAArB,EAAAX,IAAA,CAAA5B,MAAA6D,OAAA,CAAAjC,IACA,QAAAC,KAAAD,EACAqB,KAAAA,IAAAnC,EAAA8C,MAAA,CAAA/B,EAAA,EACA,OAAAD,CAAA,CAAAC,EAAA,CAKA,IAAAiC,EAAA,GAGA,QAAA1C,KAAAN,EAAAiD,SAAA,CAAAnC,EAAAvC,GACAyE,EAAA,GACA,MAAA1C,EAAA6B,KAAAA,EAAA,CAGA,QAAAe,EAAAC,EAAAC,EAAA,GAAApD,EAAAqD,OAAA,CAAAvC,EAAAvC,GAAA,CACA,IAAA+E,EAAAb,EAAAU,EAAAC,EAAA,CACAzC,KAAAuC,KAAAf,IAAAe,EAAAvC,EAAA,IAAAA,EAAAuC,EAAA,CACAhC,OAAAgC,KAAAf,IAAAe,EAAAhC,EAAA,IAAAA,EAAAiC,EAAA,CACAR,OAAAA,EACKC,KAAAA,CAAA,GAGL,QAAAW,KAAAD,EACAC,CAAA,KACAP,EAAA,GACQ,MAAAO,CAAA,IAAApB,KAAAA,EAAA,EACRQ,IAAAQ,EAAAI,CAAA,IAGAL,KAAAf,IAAAe,EACUpC,EAAAqC,EACVrC,aAAA0C,IACU1C,EAAA2C,GAAA,CAAAP,EAAAC,GACVrC,aAAA4C,IACU5C,EAAA6C,GAAA,CAAAR,GACV1B,EAAAX,IACAA,CAAAA,CAAA,CAAAoC,EAAA,CAAAC,CAAAA,EAGA,CAGA,GAAAH,EACA,QAAA1C,KAAAN,EAAA4D,OAAA,CAAA9C,EAAAvC,GACAyE,EAAA,GACA,MAAA1C,EAAA6B,KAAAA,EAAA,CAIAa,GACA,OAAAb,KAAAA,EAAArB,EAAA,CACA,CASA,MAAA+C,EACAxD,YAAAyD,CAAA,EACA,KAAAC,IAAA,QACA,KAAA/C,IAAA,QACA,KAAA8B,MAAA,QACA,KAAAD,OAAA,QACA,KAAAI,SAAA,QACA,KAAAW,OAAA,QACA,KAAAP,OAAA,QACA,IACArC,KAAAA,CAAA,CACA8B,OAAAA,CAAA,CACAG,UAAAA,CAAA,CACAW,QAAAA,CAAA,CACAf,QAAAA,EAAA/B,GAAAA,CAAA,CACMuC,QAAAA,EAAA,cACN,CAAAS,CACA,MAAA9C,IAAA,CAAAA,EACA,KAAA8B,MAAA,CAAAA,EACA,KAAAO,OAAA,CAAAA,EAAA,KAAAR,OAAA,CAAAA,EAGAI,EACA,KAAAA,SAAA,EAAAnC,EAAAwB,IAAA,CACA,IAAAD,EAAAY,EAAAnC,EAAAwB,GACA,OAAAC,EAAAF,EAAAC,EAAA,KAAAxB,EACM,EAEN,KAAAmC,SAAA,QAGAW,EACA,KAAAA,OAAA,EAAA9C,EAAAwB,IAAA,CACA,IAAAD,EAAAuB,EAAA9C,EAAAwB,GACA,OAAAC,EAAAF,EAAAC,EAAA,KAAAxB,EACM,EAEN,KAAA8C,OAAA,QAQAI,OAAAlD,CAAA,EACA,OAAAkD,EAAAlD,EAAA,KACA,CAMAmD,OAAAnD,CAAA,EACA,OAAAmD,EAAAnD,EAAA,KACA,CAMAoD,GAAApD,CAAA,EACA,OAAAoD,EAAApD,EAAA,KACA,CAOA8B,KAAA9B,CAAA,EACA,OAAA8B,EAAA9B,EAAA,KACA,CAWAqD,SAAArD,CAAA,CAAA4B,CAAA,EAKA,OAJA,SAAAA,GACAA,CAAAA,EAAA,IAGAyB,EAAArD,EAAA,KAAA4B,EAAA,CAGA,CAKA,SAAAsB,EAAAlD,CAAA,CAAAd,CAAA,MAAAqC,EAAA8B,EAAArD,EAAAd,GAGA,GAAAqC,CAAA,IACA,MAAAA,CAAA,IAOA,SAAA4B,EAAAnD,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,EAAA,CACG2C,OAAA,KAGH,IAAAN,CAAA,IAGA,OAAAA,CAAA,UAFIA,CAAA,IASJ,SAAAO,EAAA9B,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,EAAA,CACA2C,OAAA,GACGC,KAAA,KAGH,IAAAP,CAAA,IAGA,OAAAA,CAAA,UAFIA,CAAA,IASJ,SAAA6B,EAAApD,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,EAAArD,EAAAd,GACA,OAAAqC,CAAA,IAOA,SAAA8B,EAAArD,CAAA,CAAAd,CAAA,CAAA0C,CAAA,EACA,SAAAA,GACAA,CAAAA,EAAA,IAGA,IAAA0B,EAAA3B,EAAA3B,EAAAd,EAAA0C,GAAA2B,EAAAtC,EAAAqC,GAGA,GAAAC,CAAA,KACA,IAAAC,EAAA,IAAAnE,EAAAkE,CAAA,gBACA,QAAAd,KAAAa,EACAb,CAAA,KACA,OAAAA,CAAA,IAGA,GACI,OAAAe,EAAAnC,KAAAA,EAAA,CAIJ,CAFA,IAAAgB,EAAAkB,CAAA,IACA,OAAAlC,KAAAA,EAAAgB,EAAA,CAEA,CAKA,SAAAoB,EAAAlD,CAAA,CAAA4B,CAAA,EACA,WAAAY,EAAA,CACA7C,KAAAK,EACAyB,OAAA,KACGG,UAAAA,CACH,GAOA,SAAAuB,GAAA,CACA,OAAAD,EAAA,aACA,CACA,SAAAvF,EAAAyF,CAAA,EACA,WAAAZ,EAAA,CACA7C,KAAA,QAAA8B,OAAA2B,EAGA,CAAApB,QAAAvC,CAAA,EACA,GAAA2D,GAAAvF,MAAA6D,OAAA,CAAAjC,GACA,QAAA4D,EAAAvB,EAAA,GAAArC,EAAAuC,OAAA,GACA,MAAAqB,EAAAvB,EAAAsB,EAAA,EAKA5B,QAAAA,GACK3D,MAAA6D,OAAA,CAAAjC,GAAAA,EAAApB,KAAA,GAAAoB,CAAA,CAGLmC,UAAAA,GACA/D,MAAA6D,OAAA,CAAAjC,IAAA,0CAAAc,EAAAd,EAGA,EACA,CAKA,SAAA6D,GAAA,CACA,OAAAJ,EAAA,UAAAzD,GACG,kBAAAA,EAEH,CACA,SAAA8D,EAAAC,CAAA,EACA,IAAAC,EAAAlD,EAAAiD,GACAtB,EAAA,OAAAsB,EACA,WAAAhB,EAAA,CACA7C,KAAA,UAAA8B,OAAAS,WAAAA,GAAAA,WAAAA,GAAAA,YAAAA,EAAAsB,EAAA,KAGA5B,UAAAA,GACAnC,IAAA+D,GAAA,yBAAAC,EAAA,oBAAAlD,EAAAd,EAGA,EACA,CAKA,SAAAiE,GAAA/E,CAAsB,EACtB,WAAA6D,EAAA,IAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACGqF,QAAA,CAAA9C,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACH,EACA,CAKA,SAAAyG,IAAA,CACA,OAAAT,EAAA,SAAAzD,GACG,iBAAAA,GAAA,CAAAmE,MAAAnE,IAAA,oCAAAc,EAAAd,GAEH,CAKA,SAAAoE,GAAAlF,CAAsB,EACtB,WAAA6D,EAAA,IAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACGqF,QAAA,CAAA9C,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACH,EACA,CAKA,SAAA4G,IAAA,CACA,OAAAZ,EAAA,SAAAzD,GACG,iBAAAA,GAAA,oCAAAc,EAAAd,GAEH,CAQA,SAAAE,GAAA8B,CAAA,EACA,IAAAsC,EAAAjE,OAAAiE,IAAA,CAAAtC,GACA,WAAAe,EAAA,CACA7C,KAAA,OAAA8B,OAAAA,EAGA,CAAAO,QAAAvC,CAAA,EACA,GAAAW,EAAAX,GACA,QAAAoC,KAAAkC,EACA,MAAAlC,EAAApC,CAAA,CAAAoC,EAAA,CAAAJ,CAAA,CAAAI,EAAA,GAKAD,UAAAA,GACAxB,EAAAX,IAAA,qCAAAc,EAAAd,EAGA,EACA,CAKA,SAAAuE,GAAAC,CAAA,EACA,IAAAR,EAAAQ,EAAA/F,GAAA,CAAA6D,GAAAA,EAAApC,IAAA,EAAAH,IAAA,QACA,WAAAgD,EAAA,CACA7C,KAAA,QAAA8B,OAAA,KAGAD,QAAA/B,CAAA,CAAAvC,CAAA,EACA,IAAAgH,EAAAD,EAAAE,IAAA,CAAApC,GAAA,CACA,IAAAqC,EAAA,CAAArC,EAAAe,QAAA,CAAArD,EAAA,CACS6B,OAAA,EACT,GACO,OAAA8C,CACP,IAAAC,KACK,OAAAH,EAAA1C,OAAA,CAAA/B,EAAAvC,EAAA,EAGL0E,UAAAnC,CAAA,CAAAvC,CAAA,MAAAgC,EAAA,GAGA,QAAAoF,KAAAL,EAAA,CACA,OAAAlB,EAAA,CAAA3B,EAAA3B,EAAA6E,EAAApH,GAAA,CAAAqH,EAAA,CAAAxB,EAGA,IAAAwB,CAAA,IACU,SAEV,QAAAtF,EAAA,GAAA8D,EACA9D,GACAC,EAAA3C,IAAA,CAAA0C,EAGA,CAGA,oDAAAwE,EAAA,oBAAAlD,EAAAd,MAAAP,EAAA,CAGA,EACA,CAKA,SAAAmF,IAAA,CACA,OAAAnB,EAAA,kBAcA,SAAA5B,GAAA3C,CAAsB,CAAA6F,CAAA,CAAAhD,CAAA,EACtB,WAAAgB,EAAA,IAAA7D,CAAA,CACA6C,QAAA,CAAA/B,EAAAvC,IACA2F,EAAApD,EAAA+E,GAAA7F,EAAA6C,OAAA,CAAAA,EAAA/B,EAAAvC,GAAAA,GAAAyB,EAAA6C,OAAA,CAAA/B,EAAAvC,EAAA,EAEA,CAOA,eAAAkzD,GAAAtU,CAAA,CAAA72C,CAAA,CAAAxG,CAAA,CAAAqrD,CAAA,EACAhO,EAAAyE,EAAAzE,GACAgO,GACAA,CAAAA,EAAAkjB,IAAA,EAEA,IAAAzuE,EAAe,IAAApB,EAAAosD,WAAA,CAMf,GALAhrD,EAAA+D,GAAA,KAAAnF,EAAA2mD,sBAAA,EACAhI,UAAAA,EACA/3C,KAAAkB,MAAAA,EAAAA,EAAA,GACKxG,KAAAA,CACL,IACAqrD,KAAAhpD,IAAAgpD,EAAAvhD,cAAA,CACA,mFAEA,aAAAuhD,EAAAvhD,cAAA,CAAAhK,EAAA,GACA,CACA,IAAAkG,GAAA,GACA,eAAAs/C,GAAAp/C,CAAA,CAAAC,CAAA,CAAAE,CAAA,EACA,IAAAw/C,EAAA,MAAA8pB,GAAAzpE,EAAAC,EAAAE,GACA,OAAAw/C,EAAApmD,GAAA,IACA8C,EACA,CAAApC,UAAAoC,EAAApC,SAAA,CAAAsG,QAAAlE,EAAAkE,OAAA,EACK,KAEL,CACA,eAAAkpE,GAAAzpE,CAAA,CAAAC,CAAA,CAAAE,CAAA,EACA,GAAAF,EAAA3G,MAAA,EAAAwG,GACA,aAAAC,GAAAC,EAAAC,EAAAE,EAMA,EAHA,IAAAupE,EAAA3wE,EAAAkH,EAAAH,IACA6/C,EAAA,MAAArmC,QAAAqkC,GAAA,CAAA+rB,EAAAnwE,GAAA,IAAAwG,GAAAC,EAAA2pE,EAAAxpE,KACA,OAAAw/C,EAAAK,IAAA,EACA,CACA,CACA,eAAAjgD,GAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAYD,MAAAA,EAA+BA,EAAAF,EAAAG,UAAA,CAC3C,CAAArF,MAAAsF,CAAA,CAAA9D,QAAAA,CAAA,QAAA0D,EAAAK,iCAAA,CAAAJ,EAAAE,GACAG,EAAAF,EAAA7G,GAAA,EAAAgH,EAAAC,IACA,OAAAD,EACA,KAEA,CACAtG,UAAAgG,CAAA,CAAAO,EAAA,CACAD,QAAAA,EACAjE,QAAAA,CACK,CALL,EAOA,OAAAgE,CACA,CAEA,eAAAG,GAAAT,CAAA,CAAAU,CAAA,CAAAC,CAAA,CAAAR,CAAA,CAAAS,CAAA,EACA,IAAAC,EACAF,GAAAA,EAAArH,MAAA,IACAoH,EAAAI,IAAA,IAAAH,GAGA,IAAAlG,EAAAiG,EAAAK,QAAA,GACAC,EAAAvG,EAAAwG,SAAA,GAEAC,EAAAR,EAAAS,UAAA,CAAAH,GACAI,EAAAF,EAAAG,QAAA,WACAC,EAAA,CACAC,SAAA,SACApB,WAAAA,MAAAA,EAAAA,EAAAH,EAAAG,UAAA,EAEA,GAAAS,EAAA,CACA,IAAAY,EAAA,CAAAtI,MAAA6D,OAAA,CAAA6D,GAAAA,EAAAnG,EAAAgH,aAAA,IAAAlI,GAAA,IAAAwB,EAAA2G,QAAA,GACAJ,CAAAA,EAAA,UACAC,SAAA,SACAC,UAAAA,CACA,CACA,IAEAF,CAAAA,EAAAK,SAAA,KAEA,IAAAC,EAAA,CAAAR,EAAAE,EAAA,CAEAO,EAAA,MAAA7B,EAAA8B,WAAA,uBAAAF,GACAG,EAAA9D,EAAA4D,EAAAG,IACA,aAAAD,EAAA,CACA,IAAAE,EACA,YAAAF,EAAAzD,KAAA,EACA2D,CAAAA,EAAA,OAAApB,CAAAA,EAAAkB,EAAAzD,KAAA,CAAAxE,IAAA,GAAA+G,KAAA,IAAAA,EAAA,OAAAA,EAAAoB,IAAA,GACA/I,MAAA6D,OAAA,CAAAkF,GAAA,CACA,IAAAC,EAAA,SACAC,EAAAD,EAAAD,EAAApH,IAAA,CAAAqH,GACAE,QAAA9D,KAAA,CAAAyD,EAAAzD,KAAA,CAAA7D,OAAA,CAAA0H,EACA,CACA,MACA,IAAA3J,EAAA6J,oBAAA,oCAAAN,EAAAzD,KAAA,CAAA7D,OAAA,CAAAwH,EAAA,CACA,OACAF,EAAA1F,MAAA,CAGA,SAAAiG,GAAAxF,CAAA,EACA,OAAAH,GAAA4F,GAAAzF,GAAA0F,GAAA,GACA,UAAA1H,EACAA,EAGA,CACA,GAAAA,CAAA,CACAuB,OAAA4B,EAAAnD,EAAAuB,MAAA,CAAAS,EACA,CACK,CAEL,CAEA,IAAA0F,GAAAD,GAAA7C,MAEA,SAAA6C,GAAAlG,CAAA,EACA,OAAAgD,GAAA,CACArE,GAAA,CACAyH,QAAA7D,EAAA,OACA8D,GAAAvD,KACS9C,OAAAA,CACT,GACArB,GAAA,CACAyH,QAAA7D,EAAA,OACA8D,GAAAvD,KACAb,MAAAtD,GAAA,CACA2H,KAAAjD,KACAjF,QAAA0E,KACarF,KAAAoF,GAAAV,IACJ,EACT,GACA,CACA,CAEA,SAAAoE,GAAA9H,CAAA,EACA,OAAAwH,GAAAtH,GAAA,CACAsB,QAAAtB,GAAA,CACS6H,KAAA7D,IACT,GACKlE,MAAAA,CACL,GACA,CAEA,IAAAkH,GAAkCY,GAAA5H,GAAA,CAClC8H,IAAA/D,GAAAM,GAAA,CAAArE,GAAA,IAAAmE,KAAA,GACA8C,KAAAlD,GAAA/F,EAAAmG,OACAmB,SAAApB,GAAAH,GAAA/F,EAAA+F,GAAA/D,GAAA,CACA+H,WAAApE,IACAqE,MAAA7D,KACA8D,SAAAjE,KACAlF,KAAAd,EAAAmG,MACK+D,UAAAhE,GAAAF,KACL,OACCmE,cAAAjE,GAAAF,KAAA,IAGD,IAAAo4D,GAAAj8D,OAAAquD,MAAA,EACAC,UAAA,KACAgC,OAAAA,GACArM,oBAAAA,GACAqqB,8BAAAA,GACChpE,oBAAAA,EAAA,EAOD,OAAA2C,GAMA/I,YAAA2F,CAAA,CAAAqD,CAAA,CAAAC,CAAA,EACA,KAAAtD,UAAA,CAAAA,EACA,KAAAqD,MAAA,CAAAA,EACA,KAAAC,IAAA,CAAAA,EACA,KAAArJ,SAAA,CAAAoJ,MAAAA,EAAA,OAAAA,EAAApJ,SAAA,CAEA,OAAAsJ,gBAAA,CACA,OACAC,oBAAA,YACArD,WAAA,WACA,CACA,CASA,OAAAsD,MAAAC,CAAA,CAAAJ,CAAA,EAEA,2DASA,OAAAK,KAAA,CAEA,yDAUA,MAAAC,eAAAhK,CAAA,CAAA+G,CAAA,CAAA2C,CAAA,EACA,IAAAzC,EAAAgD,EAAAC,EAAAC,EAIA,GAHA5H,KAAAA,IAAAmH,GACAA,CAAAA,EAAA,KAAAA,IAAA,EAEA3J,EAAAC,GACA+G,GACA/G,EAAAkH,IAAA,CAAAH,QAMA,GAFA/G,EAAAoK,QAAA,QAAAnD,CAAAA,EAAAjH,EAAAoK,QAAA,GAAAnD,KAAA,IAAAA,EAAAA,EAAA,KAAAwC,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,aAAAjE,UAAA,CAAAkE,kBAAA,CAAAZ,EAAAE,mBAAA,GAAAW,SAAA,CACAxD,EACA,QAAAyD,KAAAzD,EACA/G,EAAAyK,WAAA,CAAAD,EAEA,CAEAxK,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,GACA,IAAA2K,EAAA3K,EAAAqH,SAAA,GACA,IACA,aAAAuD,GAAA,KAAAxE,UAAA,CAAAuE,EAAAjB,EACA,CACA,MAAAR,EAAA,CAGA,GAAAA,aAAA2B,GAAA,CAKA,IAAAC,EAAA7K,EAAAF,EAAAC,GACA,QAAAiK,CAAAA,EAAAjK,EAAA+K,UAAA,GAAAd,KAAA,IAAAA,EAAA,OAAAA,CAAA,UAAAe,WACA,OAAAd,CAAAA,EAAAlK,EAAAiL,SAAA,GAAAf,KAAA,IAAAA,EAAAA,EAAA,IAAAc,UAAA,EACAG,EAAA,WAAA/E,UAAA,CAAAgF,cAAA,CAAAN,EAAA,CACiBvE,WAAA,WACjB,GACA,GAAA4E,EAGA,CACA,IAAA9C,EAAA,IAA4C,GAA5C8B,CAAAA,EAAAgB,EAA4CG,IAAA,GAAAnB,KAAA,IAAAA,EAAA,OAAAA,EAAAoB,WAAA,OAC5C,MAAA3M,EAAA6J,oBAAA,CAAAS,EAAArI,OAAA,CAAAwH,GAAAa,CAAA,CACA,CAIA,MADAA,CAAA,CAGA,CAQA,MAAAsC,QAAAC,CAAA,CAAA/B,CAAA,EACA,IAAAzC,EAAAgD,EAAAC,CACA3H,MAAAA,IAAAmH,GACAA,CAAAA,EAAA,KAAAA,IAAA,EAEA,IAAAW,EAAA,YAAAjE,UAAA,CAAAkE,kBAAA,CAAAZ,EAAAE,mBAAA,GAAAW,SAAA,CACAmB,EAAAD,EAAA9L,GAAA,KACA,IAAAsH,EAAAgD,EACA,GAAAlK,EAAA6C,EAAA5C,EAAA,GACA,IAAAA,EAAA4C,EAAA5C,EAAA,CAIA,OAHA4C,EAAAmE,OAAA,EACA/G,EAAAkH,IAAA,CAAAtE,EAAAmE,OAAA,EAEA/G,CACA,CAUS,CART,IAAAA,EAAA4C,EAAA5C,EAAA,CACA+G,EAAA,OAAAE,CAAAA,EAAArE,EAAAmE,OAAA,GAAAE,KAAA,IAAAA,EAAAA,EAAA,GAMA,OALAjH,EAAAoK,QAAA,QAAAH,CAAAA,EAAAjK,EAAAoK,QAAA,GAAAH,KAAA,IAAAA,EAAAA,EAAA,KAAAR,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,CAAAA,EACAtD,EAAA4E,OAAA,KACiB3L,EAAAyK,WAAA,CAAAmB,EACjB,GACA5L,CACS,CACT,GACA6L,EAAA,WAAApC,MAAA,CAAAqC,mBAAA,CAAAJ,GACAK,EAAA,GACA,QAAAzI,EAAA,EAAAA,EAAAoI,EAAAhM,MAAA,CAAA4D,GAAA,GACA,IAAAtD,EAAA6L,CAAA,CAAAvI,EAAA,CACAqH,EAAA3K,EAAAqH,SAAA,GACA,IACA0E,EAAA/N,IAAA,OAAA4M,GAAA,KAAAxE,UAAA,CAAAuE,EAAAjB,GACA,CACA,MAAAR,EAAA,CAGA,GAAAA,aAAA2B,GAAA,CAKA,IAAAC,EAAA7K,EAAAF,EAAAC,GACA,QAAAiH,CAAAA,EAAAjH,EAAA+K,UAAA,GAAA9D,KAAA,IAAAA,EAAA,OAAAA,CAAA,UAAA+D,WACA,OAAAf,CAAAA,EAAAjK,EAAAiL,SAAA,GAAAhB,KAAA,IAAAA,EAAAA,EAAA,IAAAe,UAAA,EACAG,EAAA,WAAA/E,UAAA,CAAAgF,cAAA,CAAAN,EAAA,CACqBvE,WAAA,WACrB,GACA,GAAA4E,EAGA,CACA,IAAA9C,EAAA,IAAgD,GAAhD6B,CAAAA,EAAAiB,EAAgDG,IAAA,GAAApB,KAAA,IAAAA,EAAA,OAAAA,EAAAqB,WAAA,OAChD,MAAA3M,EAAA6J,oBAAA,CAAAS,EAAArI,OAAA,CAAAwH,GAAAa,CAAA,CACA,CAIA,MADAA,CAAA,CAGA,CACA,OAAA6C,CACA,CAWA,MAAAC,SAAAhM,CAAA,CAAA+G,CAAA,CAAAR,CAAA,CAAAS,CAAA,EACA,IACAvE,EADA4H,EAAA,YAAAjE,UAAA,CAAAkE,kBAAA,CAAA/D,MAAAA,EAAAA,EAAA,KAAAH,UAAA,CAAAG,UAAA,GAAAgE,SAAA,CAmBA,GAjBAxK,EAAAC,IACA+G,IACA/G,EAAAkH,IAAA,CAAAH,GACA/G,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,IAIAyC,EAAA,WAAA2D,UAAA,CAAAS,mBAAA,CAAA7G,EAAA,CAAAuG,WAAAA,CAAA,KAGAvG,EAAAoK,QAAA,CAAApK,EAAAoK,QAAA,OAAAX,MAAA,CAAApJ,SAAA,CACAL,EAAAqK,eAAA,CAAAA,EACAtD,GACA/G,CAAAA,EAAA,WAAAyJ,MAAA,CAAAiB,eAAA,CAAA1K,EAAA,EAEAyC,EAAA,MAAAoE,GAAA,KAAAT,UAAA,CAAApG,EAAA+G,EAAAR,EAAAS,IAEAvE,EAAAvB,KAAA,CAAAgI,GAAA,CACA,UAAA+C,GAAAxJ,EAAAvB,KAAA,EAEA,OAAAuB,EAAAvB,KAAA,CAEA,CACA,MAAA+K,WAAAC,MACAzL,YAAA0L,CAAA,CAAAtL,CAAA,EACA,MAAAA,GACA,KAAAsL,kBAAA,CAAAA,CACA,CACA,CAGA,eAAAvB,GAAAxE,CAAA,CAAAgG,CAAA,CAAAtJ,CAAA,EACA,IAAAuJ,EAAAvJ,GAAA,CACAwJ,cAAAxJ,EAAAwJ,aAAA,CACA1C,oBAAA9G,EAAA8G,mBAAA,EAAA9G,EAAAyD,UAAA,EAEA0E,EAAA,MAAA7E,EAAAmG,kBAAA,CAAAH,EAAAC,GACAG,EAAA,OAAApG,EAAAqG,kBAAA,CAAAxB,EAAAnI,GAAAA,EAAAyD,UAAA,GAAArF,KAAA,CACA,GAAAsL,EAAAtD,GAAA,CACA,UAAA2B,GAAA,mBAAAI,EAAA,WAAAhJ,KAAAC,SAAA,CAAAsK,GAAA,IAEA,OAAAvB,CACA,CACA,MAAAJ,WAAAqB,MACAzL,YAAAI,CAAA,EACA,MAAAA,EACA,CACA,CAIA,SAAA8tE,GAAApjB,CAAA,EACA7+C,GAAA6+C,CACA,CAIA,SAAAkjB,IAAA,QACA,OAAA/hE,GACAlD,GAAAK,KAAA,GAEA6C,EADA,CAGA,IAAAA,GAAA,KAGAsjE,GAAA,IAAAlsE,IAAA,0CACAmsE,GAAA,IAAArsE,IAOA,SAAAyuD,GAAAlxD,CAAA,EACA,OAAA8uE,KAAA1tE,IAAA0tE,GAAA1uD,GAAA,CAAApgB,EAAA,CAGA,IAAAs8D,GAAAl8D,OAAAquD,MAAA,EACAC,UAAA,KACAhsD,IAZA,SAAA1C,CAAA,EACA,IAAA6uE,GAAAluD,GAAA,CAAA3gB,GACA,+BAEA8uE,GAAApsE,GAAA,CAAA1C,EAAA,GACA,EAQCkxD,MAAAA,EAAA,EAGD,OAAA4b,WAAA/hE,MACAzL,YAAAI,CAAA,EACA,MAAAA,GACA,KAAAY,IAAA,WACA,CACA,CACA,MAAA6sE,GACA7tE,YAAAqjB,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CACA,OAAAlC,MAAAvZ,CAAA,EACA,IAAApB,EACA,IAAAipE,EAAA,wBACAC,EAAA,uBACAC,EAAwB,GACxB,QAAAtrE,EAAA,EAAAA,EAAAuD,EAAA3I,MAAA,CAAAoF,IAAA,CACA,GAAAqrE,EAAArhD,IAAA,CAAAzmB,CAAA,CAAAvD,EAAA,GACAsrE,EAAA9d,GAAA,GACA,SACA,IACA+d,EAAA,OAAAppE,CAAAA,EAAAipE,EAAAphD,IAAA,CAAAzmB,CAAA,CAAAvD,EAAA,IAAAmC,KAAA,IAAAA,EAAA,OAAAA,CAAA,IACAopE,GAGAD,EAAApyE,IAAA,KAAAY,EAAA0e,SAAA,CAAA+yD,GACA,CACA,WAAA/B,GAAA8B,EACA,CACA,CACA,MAAA1C,WAAAxhE,MACAzL,YAAA+xD,CAAA,CAAAC,CAAA,CAAAF,CAAA,CAAAlqD,CAAA,CAAAsqD,CAAA,CAAAD,CAAA,EACA,MAAAH,EAAAtxD,IAAA,OAAA6hB,OAAA,sBACA,KAAAyvC,SAAA,CAAAA,EACA,KAAAlqD,IAAA,CAAAA,EACA,KAAA3D,KAAA,EAAA8tD,UAAAA,EAAAC,aAAAA,EAAAC,eAAAA,EAAAC,OAAAA,CAAA,EACA,KAAAC,kBAAA,CAAA0b,GAAA1sD,KAAA,CAAAvZ,EACA,CACA,OAAAuZ,MAAAvZ,CAAA,MAUAqqD,EATA,IAAArqD,EACA,YAEA,IAAAioE,EAAAjoE,EAAAwqD,SAAA,IAAAM,EAAAL,UAAA,8BACA,GAAAwd,KAAAA,EACA,YAEA,IAAAC,EAAAloE,CAAA,CAAAioE,EAAA,CACA/d,EAAA,CAAAge,EAAA,CAEA,GAAAD,EAAA,EAAAjoE,EAAA3I,MAAA,EAOA,GAAA2I,uBAAAA,CAAA,CAAAioE,EAAA,IACA,IAAAE,EAAA,sBACAC,EAAAD,EAAA1hD,IAAA,CAAAzmB,CAAA,CAAAioE,EAAA,OACAI,EAAAF,EAAA1hD,IAAA,CAAAzmB,CAAA,CAAAioE,EAAA,OACA5d,EAAwB,CACxB,IAAwB9zD,EAAA0e,SAAS,CAAAmzD,GACjC,IAAA7xE,EAAA0e,SAAA,CAAAozD,GACA,CACAne,EAAAv0D,IAAA,IAAAqK,EAAAvI,KAAA,CAAAwwE,EAAA,EAAAA,EAAA,GACA,MAKA,GAAAjoE,CAAA,CAAAioE,EAAA,GAAAxd,UAAA,wBACA,IAAA6d,EAAA,oCACAC,EAAAD,EAAA7hD,IAAA,CAAAzmB,CAAA,CAAAioE,EAAA,OACAO,EAAAF,EAAA7hD,IAAA,CAAAzmB,CAAA,CAAAioE,EAAA,OACA/d,EAAAv0D,IAAA,IAAAqK,EAAAvI,KAAA,CAAAwwE,EAAA,EAAAA,EAAA,IACA5d,EAAA,CAAAke,EAAAC,EAAA,CACA,CACA,IACAC,EAAA,sGACAC,EAAAD,EAAAhiD,IAAA,CAAAyhD,GACAS,EAAA,kHACAC,EAAAD,EAAAliD,IAAA,CAAAyhD,GACAW,EAAA,qHACAC,EAAAD,EAAApiD,IAAA,CAAAyhD,GACA,GAAAQ,EAAA,CACA,IAAAK,EAAAC,EAAA5e,EAAA,CAAAse,EAAAjxE,KAAA,MACA0yD,EAAA,CACAzpD,KAAAqoE,EACAhsE,OAAA6lC,SAAAomC,EACA,EACA,WAAA3D,GAAAlb,EAAAC,EAAAF,EAAAlqD,EAAA9F,KAAAA,EAAAmwD,EACA,CAqBA,GApBAue,EAAA,CACA,IAAAle,EAAA5vC,EAAAiuD,EAAAC,EAAA5e,EAAA,CAAAwe,EAAAnxE,KAAA,MACA0yD,EAAA,CACAzpD,KAAAqoE,EACAhsE,OAAA6lC,SAAAomC,EACA,EACAC,EAAA,CAAAve,KAAAA,EAAA5vC,KAAA8nB,SAAA9nB,EAAA,EACA,WAAAuqD,GAAAlb,EAAAC,EAAAF,EAAAlqD,EAAAipE,EAAA5e,EACA,CAYA,IAXAye,EAUA,aATA,IAAAvH,EAAAwH,EAAAC,EAAA5e,EAAA,CAAA0e,EAAArxE,KAAA,MACA6yD,EAAAiX,EACApX,EAAA,CACAzpD,KAAAqoE,EACAhsE,OAAA6lC,SAAAomC,EACA,EACA,WAAA3D,GAAAlb,EAAAC,EAAAF,EAAAlqD,EAAAsqD,EAAAD,EACA,CAIA,CACA,IAAAM,SAAA,CACA,YAAAJ,kBAAA,CAAA9uC,KAAA,MAAA8uC,kBAAA,CAAA9uC,KAAA,CAAApkB,MAAA,IAEA,IAAAuzD,mBAAA,CACA,YAAAL,kBAAA,CAAA9uC,KAAA,CAEArc,UAAA,CACA,YAAA5G,OAAA,CAEA,CAEA,MAAAwtE,WAAAniE,MACAzL,YAAAsI,CAAA,CAAA/H,CAAA,CAAAqH,CAAA,EACA,QACA,KAAAU,IAAA,CAAAA,EACA,KAAA/H,GAAA,CAAAA,EACA,KAAAqH,IAAA,CAAAA,EACAA,GACA,MAAAuqD,kBAAA,CAAA0b,GAAA1sD,KAAA,CAAAvZ,EAAA,CAEA,CACA,OAAAuZ,MAAA1Y,CAAA,CAAAqoE,CAAA,MAIAC,EAiBAhf,EApBA,IAAAif,EAAAvoE,EAAAzB,QAAA,GAIA,GAAAgqE,EAAAve,QAAA,2BACA,IAAA3mB,EAAAklC,EAAAp4D,KAAA,2BACA,GAAAkzB,IAAAA,EAAA7sC,MAAA,CACA,YAGA8xE,EAAAjlC,CAAA,QAGA,CACA,IAAAmlC,EAAAD,EAAA71C,KAAA,wBACA,IAAA81C,GAAAA,EAAAhyE,MAAA,GACA,YAEA8xE,EAAAE,CAAA,IAAA91C,KAAA,iBACA,GAEA,CACA42B,EAAAvnB,SAAAumC,EACA,CACA,MAAAG,EAAA,CACA,YAGA,IAAAC,EAAAL,EAAAhwD,GAAA,CAAAixC,UACA,KAAAjwD,IAAAqvE,GAKAA,KAAArvE,IADAqvE,CAAAA,EAAA1D,GAAA3sD,GAAA,CAAAixC,EAAA,EAHA,IAAA6b,GAAA7b,EAAAof,EAAA1oE,EAAAb,IAAA,EAQA,KAEA,IAAA2qD,SAAA,CACA,IAAA/rD,EACA,cAAAA,CAAAA,EAAA,KAAA2rD,kBAAA,GAAA3rD,KAAA,IAAAA,EAAA,OAAAA,EAAA6c,KAAA,MAAA8uC,kBAAA,CAAA9uC,KAAA,CAAApkB,MAAA,IAEA,IAAAuzD,mBAAA,CACA,IAAAhsD,EACA,cAAAA,CAAAA,EAAA,KAAA2rD,kBAAA,GAAA3rD,KAAA,IAAAA,EAAA,OAAAA,EAAA6c,KAAA,CAEArc,UAAA,CACA,YAAAzG,GAAA,CAEA,CACA,SAAA8tE,GAAA5lE,CAAA,CAAAqoE,CAAA,EACAlf,GAAA,eACA7pD,QAAA2qD,GAAA,sBAAAjqD,GAEA,IAAA2oE,EAAAnE,GAAA9rD,KAAA,CAAA1Y,EAAAb,IAAA,EACA,GAAAwpE,EACA,OAAAA,CACA,CACA,IAAAC,EAAAzD,GAAAzsD,KAAA,CAAA1Y,EAAAqoE,GACA,GAAAO,EACA,OAAAA,CACA,CACA,GAAA5oE,EAAAb,IAAA,EACA,IAAA0pE,EAAA,CACAxwD,IAAA,SAAA46B,CAAA,CAAAnK,CAAA,QACA,sBAAAA,EACAmK,EAAA8W,iBAAA,CAAAnvC,KAAA,CAEAkuB,YAAAA,EACAmK,EAAA8W,iBAAA,CAAAnvC,KAAA,CAAA5a,EAAA+pD,iBAAA,CAAAnvC,KAAA,CAAApkB,MAAA,IAMA8mD,QAAAjlC,GAAA,IAAAqW,UACa,CAEb,EAEA,OADA1uB,EAAA+pD,iBAAA,CAAAqb,GAAA1sD,KAAA,CAAA1Y,EAAAb,IAAA,EACA,IAAA+qD,MAAAlqD,EAAA6oE,EACA,QACA7oE,CACA,CACA,IAAAiJ,GAAA,CAEAC,mBAAA,IACAC,4BAAA,IACAC,6BAAA,IACAC,2BAAA,IAEAC,mBAAA,IACAC,6BAAA,KAEAG,cAAA,IACAC,iBAAA,KACAC,iBAAA,KACAC,cAAA,KACAC,gBAAA,KACAC,qBAAA,KACAC,gBAAA,KACAC,qBAAA,KACAC,gBAAA,KACAC,qBAAA,KACAC,yBAAA,KACAC,gBAAA,KACAC,kBAAA,KACAC,eAAA,KACAC,oBAAA,KACAC,qBAAA,KACAC,4BAAA,KACAC,8BAAA,KACAC,uBAAA,KACAC,gBAAA,KACAC,wBAAA,KAEAoB,gBAAA,KACAC,kBAAA,KACAC,sBAAA,KACAC,mBAAA,KACAC,uBAAA,KACAC,kBAAA,KACAC,mBAAA,KAEAC,+BAAA,IACAC,6BAAA,KACAC,6BAAA,KACAC,yBAAA,KACAC,uBAAA,KACAC,qBAAA,KACAC,kBAAA,KACAC,2BAAA,KACAC,iBAAA,KACAC,yBAAA,KACAC,iBAAA,KACAC,sBAAA,KACAC,sBAAA,KACAC,sBAAA,KACAC,iCAAA,KACAC,sBAAA,KACAC,2BAAA,KACAC,yBAAA,KAEAC,0BAAA,KAEAG,WAAA,GACA,EACAk3D,GAAA,IAAAtqE,IAAA,CAEA,CACAuO,GAAAC,kBAAA,CACA,6CACA,CACA,CACAD,GAAAE,2BAAA,CACA,uCACA,CACA,CACAF,GAAAG,4BAAA,CACA,0DACA,CACA,CACAH,GAAAI,0BAAA,CACA,wDACA,CAEA,CACAJ,GAAAK,kBAAA,CACA,oDACA,CACA,CACAL,GAAAM,4BAAA,CACA,uEACA,CAEA,CAAAN,GAAAS,aAAA,kCACA,CAAAT,GAAAU,gBAAA,sCACA,CAAAV,GAAAW,gBAAA,qCACA,CAAAX,GAAAY,aAAA,kCACA,CAAAZ,GAAAa,eAAA,qCACA,CACAb,GAAAc,oBAAA,CACA,2CACA,CACA,CAAAd,GAAAe,eAAA,oCACA,CAAAf,GAAAgB,oBAAA,0CACA,CACAhB,GAAAiB,eAAA,CACA,6DACA,CACA,CAAAjB,GAAAkB,oBAAA,0CACA,CACAlB,GAAAmB,wBAAA,CACA,6CACA,CACA,CAAAnB,GAAAoB,eAAA,oCACA,CAAApB,GAAAqB,iBAAA,uCACA,CAAArB,GAAAsB,cAAA,uCACA,CAAAtB,GAAAuB,mBAAA,yCACA,CAAAvB,GAAAwB,oBAAA,0CACA,CACAxB,GAAAyB,2BAAA,CACA,gDACA,CACA,CACAzB,GAAA0B,6BAAA,CACA,kDACA,CACA,CACA1B,GAAA2B,sBAAA,CACA,0CACA,CACA,CAAA3B,GAAA4B,eAAA,oCACA,CACA5B,GAAA6B,uBAAA,CACA,gDACA,CAEA,CAAA7B,GAAAiD,eAAA,sCACA,CAAAjD,GAAAkD,iBAAA,yCACA,CACAlD,GAAAmD,qBAAA,CACA,4CACA,CACA,CAAAnD,GAAAoD,kBAAA,0CACA,CACApD,GAAAqD,sBAAA,CACA,6CACA,CACA,CAAArD,GAAAsD,iBAAA,yCACA,CAAAtD,GAAAuD,kBAAA,0CAEA,CACAvD,GAAAwD,8BAAA,CACA,4DACA,CACA,CACAxD,GAAAyD,4BAAA,CACA,mDACA,CACA,CACAzD,GAAA0D,4BAAA,CACA,uDACA,CACA,CAAA1D,GAAA2D,wBAAA,sCACA,CAAA3D,GAAA4D,sBAAA,oCACA,CACA5D,GAAA6D,oBAAA,CACA,mDACA,CACA,CAAA7D,GAAA8D,iBAAA,qCACA,CACA9D,GAAA+D,0BAAA,CACA,kEACA,CACA,CAAA/D,GAAAgE,gBAAA,mCACA,CAAAhE,GAAAiE,wBAAA,sCACA,CAAAjE,GAAAkE,gBAAA,mCACA,CACAlE,GAAAmE,qBAAA,CACA,uDACA,CACA,CACAnE,GAAAoE,qBAAA,CACA,8DACA,CACA,CACApE,GAAAqE,qBAAA,CACA,kDACA,CACA,CACArE,GAAAsE,gCAAA,CACA,wDACA,CACA,CACAtE,GAAAuE,qBAAA,CACA,0DACA,CACA,CACAvE,GAAAwE,0BAAA,CACA,yEACA,CACA,CACAxE,GAAAyE,wBAAA,CACA,4DACA,CAEA,CACAzE,GAAA0E,yBAAA,CACA,+DACA,CAEA,CACA1E,GAAA6E,UAAA,CACA,gEACA,GAkBA,IAAAg7D,GAAA,WAQA,MAAAA,CAPAA,GAAAzwE,OAAAC,MAAA,WAAiDmC,CAAA,EACjD,QAAAH,EAAAsB,EAAA,EAAAhG,EAAA84B,UAAAl4B,MAAA,CAAAoF,EAAAhG,EAAAgG,IAEA,QAAAyhB,KADA/iB,EAAAo0B,SAAA,CAAA9yB,EAAA,CACAvD,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EAEA,OAAA5iB,CACA,GACApE,KAAA,MAAAq4B,UAAA,EAkBAq6C,GAAA,WAQA,MAAAA,CAPAA,GAAA1wE,OAAAC,MAAA,WAAiDmC,CAAA,EACjD,QAAAH,EAAAsB,EAAA,EAAAhG,EAAA84B,UAAAl4B,MAAA,CAAAoF,EAAAhG,EAAAgG,IAEA,QAAAyhB,KADA/iB,EAAAo0B,SAAA,CAAA9yB,EAAA,CACAvD,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EAEA,OAAA5iB,CACA,GACApE,KAAA,MAAAq4B,UAAA,EASA,SAAAs6C,GAAA5oD,CAAA,EACA,OAAAA,EAAAxK,WAAA,GAIA,IAAAqzD,GAAA,8CAEAC,GAAA,eAIA,SAAAC,GAAAjwE,CAAA,CAAAU,CAA8B,EAC9B,SAAAA,GAAAA,CAAAA,EAAA,IAMA,IALA,IAAAmE,EAAAnE,EAAA+wD,WAAA,CAAAA,EAAA5sD,KAAA,IAAAA,EAAAkrE,GAAAlrE,CAAA,CAAAgD,EAAAnH,EAAAgxD,WAAA,CAAAA,EAAA7pD,KAAA,IAAAA,EAAAmoE,GAAAnoE,CAAA,CAAAC,EAAApH,EAAA+tC,SAAA,CAAAA,EAAA3mC,KAAA,IAAAA,EAAAgoE,GAAAhoE,CAAA,CAAAC,EAAArH,EAAA8tB,SAAA,CAAAA,EAAAzmB,KAAA,IAAAA,EAAA,IAAAA,CAAA,CACA1H,EAAAqgB,GAAAA,GAAA1gB,EAAAyxD,EAAA,UAAAC,EAAA,MACA9jB,EAAA,EACA1gB,EAAA7sB,EAAA/C,MAAA,CAEA+C,OAAAA,EAAA0mB,MAAA,CAAA6mB,IACAA,IACA,KAAAvtC,OAAAA,EAAA0mB,MAAA,CAAAmG,EAAA,IACAA,IAEA,OAAA7sB,EAAA3C,KAAA,CAAAkwC,EAAA1gB,GAAAjW,KAAA,OAAA1Z,GAAA,CAAAkxC,GAAA5vC,IAAA,CAAA2vB,EACA,CAIA,SAAA9N,GAAA1gB,CAAA,CAAA2oC,CAAA,CAAA7pC,CAAA,SACA,aAAAyyD,OACAvxD,EAAA0gB,OAAA,CAAAioB,EAAA7pC,GACA6pC,EAAAlxB,MAAA,UAAAzX,CAAA,CAAA2oC,CAAA,SAAA3oC,EAAA0gB,OAAA,CAAAioB,EAAA7pC,EAAA,EAAAkB,EADA,CAIA,SAAAkwE,GAAAlwE,CAAA,CAAAU,CAA8B,EAE9B,OADA,SAAAA,GAAAA,CAAAA,EAAoC,IACpCuvE,GAAAjwE,EAAA6vE,GAAA,CAAArhD,UAAA,KAAA9tB,GAAA,CAGA,SAAAyvE,GAAAnwE,CAAA,CAAAU,CAA8B,EAE9B,OADA,SAAAA,GAAAA,CAAAA,EAAuC,IACvCwvE,GAAAlwE,EAAA4vE,GAAA,CAAAphD,UAAA,KAAA9tB,GAAA,CAGA,MAAA0vE,GACA,OAAAxe,YAAAye,CAAA,CAAA9d,CAAA,EACA,IAAA+d,EAAAD,KAAAlwE,IAAAkwE,EAAAhxE,IAAA,CAAAwtE,IAAAwD,EAAAhxE,IAAA,EAAAc,KAAAA,CAAA,CACA,OAAAkwE,EAAArxE,IAAA,EACA,WACA,OAAAnC,EAAAwqB,IAAA,CAAAipD,EAEA,UACA,OAAAzzE,EAAAqd,EAAA,CAAAo2D,EAEA,UACA,OAAAzzE,EAAAmrB,EAAA,CAAAsoD,EAEA,WACA,OAAAzzE,EAAAkrB,GAAA,CAAAuoD,EAEA,WACA,OAAAzzE,EAAAirB,GAAA,CAAAwoD,EAEA,WACA,OAAAzzE,EAAAsd,GAAA,CAAAm2D,EAEA,WACA,OAAAzzE,EAAAgrB,GAAA,CAAAyoD,EAEA,WACA,OAAAzzE,EAAA+qB,GAAA,CAAA0oD,EAEA,WACA,OAAAzzE,EAAAymB,GAAA,CAAAgtD,EAEA,WACA,OAAAzzE,EAAA6qB,GAAA,CAAA4oD,EAEA,WACA,OAAAzzE,EAAA8qB,GAAA,CAAA2oD,EAEA,YACA,OAAAzzE,EAAA4qB,IAAA,CAAA6oD,EAEA,YACA,OAAAzzE,EAAA2qB,IAAA,CAAA8oD,EAEA,YACA,OAAAzzE,EAAA0qB,IAAA,CAAA+oD,EAEA,YACA,OAAAzzE,EAAAyqB,IAAA,CAAAgpD,EAEA,aACA,OAAAzzE,EAAAqB,KAAA,CAAAoyE,EAEA,cACA,OAAAzzE,EAAAqqB,GAAA,CAAAopD,EAEA,iBACA,OAAAzzE,EAAAoB,SAAA,CAAAqyE,EAEA,SACA,WAA2BD,EAAArxE,IAAA,CAC3B,OAAAnC,EAAAuqB,GAAA,CAAAgpD,GAAAxe,WAAA,EACAvyD,KAAAc,KAAAA,EACqBnB,KAAAqxE,EAAArxE,IAAA,CAAAooB,GAAA,EACrBmrC,GAAA+d,EA+BA,CA7BA,cAA2BD,EAAArxE,IAAA,CAC3B,OAAAnC,EAAAwmB,MAAA,CAAA+sD,GAAAxe,WAAA,EACAvyD,KAAAc,KAAAA,EACqBnB,KAAAqxE,EAAArxE,IAAA,CAAAqkB,MAAA,EACrBkvC,GAAA+d,EAyBA,CAvBA,eAAAD,EAAArxE,IAAA,EAEA,IAAAuzD,EACA,UAAAsZ,GAAA,mCAEA,IAAAha,EAAAwe,EAAArxE,IAAA,CAAA6yD,OAAA,CACA0e,EAAAhe,EAAA7rC,MAAA,IAAAnlB,EAAAlC,IAAA,GAAAwyD,GACA,GAAA0e,IAAAA,EAAAjzE,MAAA,CACA,UAAAuuE,GAAA,mBAAAhsE,KAAAC,SAAA,CAAAuwE,GAAA,GAEA,OAAAD,GAAAte,aAAA,CAAAye,CAAA,IAAAhe,EAAA+d,EACA,CAYA,GAXA,UAAAD,EAAArxE,IAAA,EACA,IAAAwxE,EAAAH,EAAArxE,IAAA,CAAAhC,KAAA,IACAyzE,EAAAJ,EAAArxE,IAAA,CAAAhC,KAAA,IACA0zE,EAAAN,GAAAxe,WAAA,EACAvyD,KAAAc,KAAAA,EACqBnB,KAAAwxE,CACrB,EAAAje,GACA,OAAA11D,EAAAG,KAAA,CAAA0zE,EAAAD,EAAAH,EACA,MAEA,oCAAAD,EAAA,GAIA,CACA,OAAAve,cAAA6e,CAAA,CAAApe,EAAA,GAAAlzD,CAAA,EACA,OAAAsxE,EAAA3xE,IAAA,CAAA+yD,IAAA,EACA,cACA,IAAA6e,EAAAD,EAAA3xE,IAAA,CAAAuY,MAAA,CAAAha,GAAA,IACiB6yE,GAAAxe,WAAA,CAAAye,EAAA9d,IAEjB,OAAA11D,EAAAmB,MAAA,CAAA4yE,EAAAvxE,EACA,CACA,YACA,IAAAkqB,EAAAonD,EAAiC3xE,IAAA,CAAAuqB,QAAA,CAAAhsB,GAAA,KACjC,IAAA8B,EAAAwtE,IAAAlzD,EAAAta,IAAA,EACA,IAAAsa,EAA+BpC,MAAA,CAC/B,OAAA1a,EAAAmB,MAAA,IAAAqB,EACA,CACA,IAAAuxE,EAAAj3D,EAAApC,MAAA,CAAAha,GAAA,EAAA+rC,EAAA5mC,IACA,CAAA4mC,MAAAA,EAAA,OAAAA,EAAAjqC,IAAA,EACA+wE,GAAAxe,WAAA,CAAAtoB,EAAAipB,GAEqB6d,GAAAxe,WAAA,EAAA5yD,KAAAsqC,EAAAjqC,KAAAqD,EAAA2C,QAAA,IAAAktD,EADrB,EAGiB,OAAA11D,EAAAmB,MAAA,CAAA4yE,EAAAvxE,EACjB,GACA,GAAAA,KAAAc,IAAAd,EAGA,OAAAxC,EAAAumB,QAAA,CAAAmG,GAAA/T,SAAA,CAAAnW,EACA,CACA,OAAAxC,EAAAumB,QAAA,CAAAmG,EAAAlqB,EACA,CACA,YACA,OAAA+wE,GAAAxe,WAAA,EAAA5yD,KAAA2xE,EAAA3xE,IAAA,CAAAF,KAAA,CAAAO,KAAAsxE,EAAAtxE,IAAA,EAAAkzD,EAEA,CACA,EAOA,IAAAse,GAAA,QAIA,OAAApF,GACAptE,YAAA2zD,CAAA,EACA,KAAAA,GAAA,CAAAA,EACA,KAAAC,QAAA,CAAAwZ,GAAAvZ,aAAA,CAAAF,GACA,IAAAI,EAAA,IAAA5wD,IACAwwD,EAAApW,YAAA,CAAAryC,OAAA,KACA,IAAAunE,EAAAC,GAA+BF,GAAAhoB,EAAAxpD,IAAA,EAC/B+yD,EAAA3wD,GAAA,CAAA7E,IAAAmB,MAAA,CAAA+yE,GAAA,CACA56D,OAAA,KAAA+7C,QAAA,CAAA9yC,GAAA,CAAA0pC,EAAAxpD,IAAA,EACaA,KAAAwpD,EAAAxpD,IAAA,EAEb,GACA,KAAA+yD,cAAA,CAAAA,CACA,CAIAr0D,OAAAizE,CAAA,CAAAnoB,CAAA,EACA,YAAAwJ,OAAA,CAAAwe,GAAAG,EAAAnoB,EACA,CACAwJ,QAAA4e,CAAA,CAAuBD,CAAA,CAAAnoB,CAAA,EACvB,IAAApqC,EAAAiuC,EAA2B5vD,MAAA,CAAAknB,KAAA,MAC3BktD,EAAArE,IAAAmE,GACA96D,EAAA,KAAA+7C,QAAA,CAAA9yC,GAAA,CAAA+xD,GACA,IAAAh7D,EACA,+BAAAg7D,EAAA,GAEA,IAAAp7C,EAAA5f,EAAAnY,MAAA,CAAA8qD,EAAApqC,GACA3gB,EAAe2gB,EAAA/gB,KAAA,GAAAo4B,GACf,OAAA42B,EAAA5vD,MAAA,CAAA01B,MAAA,EAAAu+C,GAAAE,EAAAD,GAAAlzE,EAAA,CACA,CACA,OAAAo0D,cAAAF,CAAA,EACA,IAAAmf,EAAAnf,EAAApW,YAAA,CAAAr+C,GAAA,KACA,IAAAqzE,EAAA/nB,EAAAjjD,IAAA,CAAArI,GAAA,KACA,IAAAsH,EAAAgD,EACa,OAAAuoE,GAAAxe,WAAA,CAAA1+B,EAAAh2B,MAAAud,IAAA,YAAA5V,CAAAA,EAAAmtD,EAAA1tD,QAAA,GAAAO,KAAA,IAAAA,EAAAA,EAAA,aAAAgD,CAAAA,EAAAmqD,EAAAO,KAAA,GAAA1qD,KAAA,IAAAA,EAAAA,EAAA,KACb,GACAxI,EAAAwtE,IAA0BhkB,EAAAxpD,IAAY,EAC7B,OAAAA,EAAAxC,EAAAmB,MAAA,CAAA4yE,EAAAvxE,GAAA,GAET,WAAAmC,IAAA2vE,EACA,CAIAh8D,OAAA0zC,CAAA,CAAAtjD,EAAA,OACA,iBAAAsjD,GACAA,CAAAA,EAAAtjD,QAAAA,EAAAmnD,EAAA5vD,MAAA,CAAA2d,IAAA,CAAAouC,EAAA,OAAAjsD,IAAAuY,MAAA,CAAA0zC,EAAA,EAEA,IAAAkoB,EAAAn0E,IAAAmB,MAAA,CAAA8qD,EAAAnrD,KAAA,OACAI,EAAA+qD,EAAAnrD,KAAA,IACAqd,EAAA,KAAAq3C,cAAA,CAAAjzC,GAAA,CAAA4xD,UACA,EAGA,CACAjzE,KAAAid,EAAA7E,MAAA,CAAAf,MAAA,CAAArX,GACAuB,KAAA0b,EAAA1b,IAAA,EAJA,KAUAmzD,OAAA3J,CAAA,CAAAuoB,CAAA,EACA,OAAAC,GAAA7e,MAAA,CAAA3J,EAAAuoB,EAAA,KAAApf,GAAA,CACA,CACA,CACA,MAAAqf,GACA,OAAA7e,OAAA3J,CAAA,CAAAuoB,CAAA,CAAApf,CAAA,EACA,IAAAsb,EAAAtb,EAAApW,YAAA,CAAAl1B,MAAA,IAAAmiC,EAAAxpD,IAAA,GAAAqD,EAAArD,IAAA,KACA,GAAAiuE,KAAAntE,IAAAmtE,EAEA,OADAlnE,QAAA9D,KAAA,8BACA,KAEA,IAAAsD,EAAA0nE,EAAA1nE,IAAA,CAAArI,GAAA,IACA,EACA8B,KAAAiyE,EAAAjyE,IAAA,CACAL,KAAAqyE,GAAA3e,aAAA,CAAA4e,EAAAtyE,IAAA,EACAlB,KAAAuzE,GAAA1e,aAAA,CAAA2e,EAAAzoB,EAAA/qD,IAAA,CAAAwzE,EAAAjyE,IAAA,EAAA2yD,EAAAO,KAAA,CACS,IAETgf,EAAAF,GAAAze,kBAAA,CAAA0a,EAAAhpE,QAAA,EACAA,EAAA8sE,EAAA7zE,GAAA,EAAA2L,EAAA1E,IACA,EAAA+sE,EAAAj0E,MAAA,CACA,CACA+B,KAAAkyE,CAAA,CAAA/sE,EAAA,CAAAnF,IAAA,CACA,GAAA6J,CAAA,EAKA,CACA7J,KAAAc,KAAAA,EACA,GAAA+I,CAAA,CAES,EAET,OACAtD,KAAAA,EACAtB,SAAAA,CACA,CACA,CACA,OAAAouD,cAAA8e,CAAA,EACA,oBAAAA,EACA,OAAAA,CACA,CACA,WAAAA,EACA,kBAAA9e,aAAA,CAAA8e,EAAApqD,GAAA,KAEA,cAAAoqD,EACA,qBAAA9e,aAAA,CAAA8e,EAAAnuD,MAAA,KAEA,eAAAmuD,EACA,OAAAA,EAAA3f,OAAA,CAEA,aAAA2f,EACA,eAAAA,EAAAx0E,KAAA,QAAAw0E,EAAAx0E,KAAA,aAEA,2BAAAw0E,EAAA,GAEA,OAAA7e,cAAA2e,CAAA,CAAAxzE,CAAA,CAAAy0D,CAAA,EACA,oBAAA+e,EAAAtyE,IAAA,CACA,OAAAlB,EAAAuH,QAAA,EACA,CACA,GAAAisE,EAAAtyE,IAAA,CAAA8L,cAAA,QACA,UACAhN,EACAP,GAAA,SAAAo1D,aAAA,EAAAtzD,KAAA,GAAAL,KAAAsyE,EAAAtyE,IAAA,CAAAooB,GAAA,EAAAprB,IACA6C,IAAA,OACA,GACA,CACA,GAAAyyE,EAAAtyE,IAAA,CAAA8L,cAAA,WACA,OAAAhN,IAAA,GAAAA,EACA,OACA,KAAA60D,aAAA,EAAAtzD,KAAA,GAAAL,KAAAsyE,EAAAtyE,IAAA,CAAAqkB,MAAA,EAAAvlB,EAAAy0D,EAAA,CAEA,GAAA+e,EAAAtyE,IAAA,CAAA8L,cAAA,aACA,GAAAynD,KAAApyD,IAAAoyD,EACA,+CAEA,IAAAge,EAAAhe,EAAA7rC,MAAA,IAAAnlB,EAAAlC,IAAA,GAAAiyE,EAAAtyE,IAAA,CAAA6yD,OAAA,EACA,GAAA0e,IAAAA,EAAAjzE,MAAA,CACA,+BAAAg0E,EAAAtyE,IAAA,CAAA6yD,OAAA,IAEA,OAAAwf,GAAAxe,oBAAA,CAAA0d,CAAA,IAAAzyE,EAAAy0D,EACA,OACA,SACA,CACA,OAAAM,qBAAA8d,CAAA,CAAA7yE,CAAA,CAAAy0D,CAAA,EACA,OAAAoe,EAAA3xE,IAAA,CAAA+yD,IAAA,EACA,cACA,IAAA/zD,EAAA2yE,EAAA3xE,IAAA,CACAuY,EAAApY,OAAAiE,IAAA,CAAAtF,GACAP,GAAA,KACA,IAAA8yE,EAAAryE,EAAAuZ,MAAA,CAAA/T,IAAA,IAAA8lC,EAAAjqC,IAAA,GAAA6B,GACA,IAAAmvE,EACA,mCAEA,OAAAnvE,EACA,KACiBmwE,GAAA1e,aAAA,CAAA0d,EAAAvyE,CAAA,CAAAoD,EAAA,CAAAqxD,EACjB,GACA1zD,IAAA,CAA0B,MAC1B,WAAA0Y,EAAA,IACA,CACA,WACA,GAAAo5D,IAAAA,EAAA3xE,IAA8B,CAAAuqB,QAAA,CAAAjsB,MAAA,CAC9B,UACA,CAEA,IAAAqzE,EAAA3xE,IAAA,CAAAuqB,QAAA,IAAAlqB,IAAA,CA0BA,4CACA,EA1BA,IAAAkqB,EAAAonD,EAAA3xE,IAAA,CAAAuqB,QAAA,CACA5P,EAAAxa,OAAAiE,IAAA,CAAAtF,EAAA,IACA2zE,EAAA3zE,CAAA,CAAA6b,EAAA,CACA+3D,EAAAvyE,OAAAiE,IAAA,CAAAquE,GACAl0E,GAAA,KACA,IAAAsH,EACA,IAAA8sE,EAAAF,CAAA,CAAAnoC,EAAA,CACAgoC,EAAA,OAAAzsE,CAAAA,EAAA0kB,CAAA,CAAA5P,EAAA,GAAA9U,KAAA,IAAAA,EAAA,OAAAA,EAAArB,IAAA,IAAArC,EAAA9B,IAAA,GAAAiqC,EAAA,CACA,IAAAgoC,EACA,sCAEA,OAAAhoC,EACA,KACqB+nC,GAAA1e,aAAA,CAAA2e,EAAAK,EAAApf,EACrB,GACA1zD,IAAA,OACA+yE,EAAA/E,IAAAlzD,EAAA,CAAA8M,WAAA,KACA,GAAAirD,IAAAA,EAAAp0E,MAAA,CACA,OAAAs0E,CACA,CACA,SAAAA,EAAA,KAAAF,EAAA,IAQA,YACA,OAAAL,GAAA3e,aAAA,CAAAie,EAAA3xE,IAAA,CAAAF,KAAA,CAEA,CACA,CACA,OAAA8zD,mBAAAtuD,CAAA,CAAAutE,CAAA,EACA,OAAAvtE,EACA/G,GAAA,KACA,IAAAu0E,EAAAC,GAAAxtE,EAAAlF,IAAA,EACA,IAAAkF,EAAAuG,cAAA,aAKA,OACA,GAAAvG,CAAA,CACAlF,KAAAwyE,EAAA,GAAAA,EAAA,KAAAC,EAAA,EAAAA,CAAA,CAES,EART,IAAAE,EAAAH,EAAA,GAAAA,EAAA,KAAAC,EAAA,EAAAA,CAAA,CACA,OAAAT,GAAAze,kBAAA,CAAAruD,EAAAD,QAAA,CAAA0tE,EACA,CAOA,GACAhuB,IAAA,EACA,CACA,CACA,SAAA+tB,GAAA1B,CAAA,EACA,IAAAhwE,EAAAgwE,EAAA3vD,OAAA,mBACA,OAAArgB,EAAA0mB,MAAA,IAAA9G,WAAA,GAAA5f,EAAA3C,KAAA,GACA,CAGA,SAAAqzE,GAAAE,CAAA,CAAAD,CAAA,EAEA,IAAAiB,EAAW,GAAAhB,EAAA,GADXd,GAAsBa,GACX,EACX,OAAAtkB,EAAA5vD,MAAA,CAAA2d,IAAA,IAAAqyD,EAAA/d,CAAA,EAAAkjB,GAAAv0E,KAAA,OAGA,SAAAw0E,GAAAlgB,CAAA,CAAAmgB,CAAA,EACA,OAAAA,EAAAnzE,IAAA,CAAA+yD,IAAA,EACA,aACA,OAAAogB,EAAAnzE,IAAA,CAAAuY,MAAA,CACAha,GAAA,IAAA60E,GAAApgB,EAAA1oB,EAAAtqC,IAAA,GACAyY,MAAA,EAAAC,EAAAza,IAAAya,EAAAza,EAAA,EAEA,aACA,IAAAo1E,EAAAF,EAAAnzE,IAAA,CAAAuqB,QAAA,CAAAhsB,GAAA,IACA,EAAAga,MAAA,CAGAoC,EAAApC,MAAA,CACAha,GAAA,IAEA,iBAAA+rC,GAAA,SAAAA,EAIiB8oC,GAAApgB,EAAA1oB,EAAAtqC,IAAA,EAHjBozE,GAAApgB,EAAA1oB,EACA,EAIa7xB,MAAA,EAAAC,EAAAza,IAAAya,EAAAza,EAAA,GAXb,CACA,EAYA,OAAAG,KAAAqrC,GAAA,IAAA4pC,GAAA,CACA,CACA,YACA,OAAAD,GAAApgB,EAAAmgB,EAAAnzE,IAAA,CAAAF,KAAA,CAEA,CACA,CAGA,SAAAszE,GAAApgB,CAAA,CAAAsgB,CAAA,EACA,IAAAztE,EAAAgD,EACA,OAAAyqE,GACA,WAEA,SAEA,SA0BA,YAEA,aA/BA,QAKA,WAEA,UADA,QAGA,WAEA,UAEA,UAHA,QAKA,WAEA,UAEA,UAHA,QAKA,YAEA,WADA,SAGA,YAEA,WAMA,gBAPA,SASA,SACA,WAAAA,EACA,QACA,CACA,cAAAA,EACA,SAAAF,GAAApgB,EAAAsgB,EAAAjvD,MAAA,CACA,CACA,eAAAivD,EACA,SAAAF,GAAApgB,EAAAsgB,EAAA3uD,OAAA,CACA,CACA,eAAA2uD,EAAA,CACA,IAAA/B,EAAA,OAAA1oE,CAAAA,EAAA,OAAAhD,CAAAA,EAAAmtD,EAAAO,KAAA,GAAA1tD,KAAA,IAAAA,EAAA,OAAAA,EAAA6hB,MAAA,IAAAnlB,EAAAlC,IAAA,GAAAizE,EAAAzgB,OAAA,IAAAhqD,KAAA,IAAAA,EAAAA,EAAA,GACA,GAAA0oE,IAAAA,EAAAjzE,MAAA,CACA,UAAAuuE,GAAA,mBAAAhsE,KAAAC,SAAA,CAAAwyE,GAAA,GAGA,OAAAJ,GAAAlgB,EADAue,CAAA,IAEA,IACA,UAAA+B,EAAA,CACA,IAAA9B,EAAA8B,EAAAt1E,KAAA,IACAu1E,EAAAD,EAAAt1E,KAAA,IACA,OAAAo1E,GAAApgB,EAAAwe,GAAA+B,CACA,OACA,sBAAA1yE,KAAAC,SAAA,CAAAwyE,GAAA,GACA,CAMA,IAAA5G,GAAA,EACA,SAAA/yD,GAAuBs5D,CAAA,EACvB,OAAAn1E,EAAA2d,IAAA,IAAAqyD,EAAA/d,CAAA,EAAAkjB,GAAAv0E,KAAA,GAAAguE,IAAA,CAMA,MAAAjE,GACAppE,YAAA2zD,CAAA,EACA,GAAAA,KAAA7xD,IAAA6xD,EAAA1tD,QAAA,EACA,KAAA4uD,cAAA,KAAA1xD,IACA,MACA,KACAgyD,EAAAxB,EAAA1tD,QAAA,CAAA/G,GAAA,IACS,CAAAma,EAAArY,IAAA,CAAA+wE,GAAAte,aAAA,CAAAp6C,EAAAs6C,EAAAO,KAAA,GAET,MAAAW,cAAA,KAAA1xD,IAAAgyD,GACA,KAAAxB,GAAA,CAAAA,CACA,CACA,MAAAj0D,OAAAypE,CAAuB,CAAAjjE,CAAA,EACvB,IAAAka,EAAAiuC,EAAA5vD,MAAA,CAAAknB,KAAA,MACA9N,EAAA,KAAAg9C,cAAA,CAAA/zC,GAAA,CAAAqoD,GACA,IAAAtxD,EACA,gCAAAsxD,EAAA,GAEA,IAAA1xC,EAAA5f,EAAAnY,MAAA,CAAAwG,EAAAka,GACAooD,EAAApoD,EAAA/gB,KAAA,GAAAo4B,GACAnd,EAAe8uD,GAAAtU,oBAAe,CAAAqU,GAC9B,OAAA9a,EAAA5vD,MAAA,CAAA01B,MAAA,EAAA7Z,EAAAkuD,EAAA,CACA,CACA1xD,OAAAqyD,CAAA,CAAA1pE,CAAA,EAEA,IAAA6a,EAAA8uD,GAAAtU,oBAAA,CAAAqU,GACA,GAAA7uD,EAAAy6C,OAAA,CAAAt1D,EAAAJ,KAAA,OACA,6CAEA,YAAA21D,eAAA,CAAAmU,EAAA1pE,EACA,CACA00E,UAAA10E,CAAA,EACA,IAAA20E,EAAA30E,EAAAJ,KAAA,MACA8pE,EAAAtqE,MAAAud,IAAA,MAAAy4C,cAAA,CAAA9vD,IAAA,IAAAI,IAAA,IAAAikE,GAAAtU,oBAAA,CAAAp0D,GAAAwiD,MAAA,CAAAkxB,IACA,IAAAjL,EACA,+CAEA,YAAAnU,eAAA,CAAAmU,EAAA1pE,EACA,CACAu1D,gBAAAmU,CAAA,CAAA3e,CAAA,EAEA,IAAA/qD,EAAA+qD,EAAA6e,QAAA,CAAAgE,IACAx1D,EAAA,KAAAg9C,cAAA,CAAA/zC,GAAA,CAAAqoD,GACA,IAAAtxD,EACA,gCAAAsxD,EAAA,GAEA,OAAAtxD,EAAAf,MAAA,CAAArX,EACA,CACAw1D,OAAAkU,CAAA,CAAAkL,CAAA,EACA,IAAA/5D,EAAA8uD,GAAAtU,oBAAA,CAAAqU,GACA,OACAnyD,OAAmB,EACnBoL,MAAA7jB,IAAAmB,MAAA,CAAA20E,EAAAhmB,EAAA5vD,MAAA,CAAA01B,MAAA,EAAA7Z,EAAA+5D,EAAA,EAAA/5D,CAAA,CACA,CACA,CACA1b,KAAAk1E,CAAA,EACA,IAAAttE,EACA,OAAA6mE,GAAA,QAAA7mE,CAAAA,EAAAqtE,GAAA,KAAAlgB,GAAA,CAAAmgB,EAAA,GAAAttE,KAAA,IAAAA,EAAAA,EAAA,EACA,CAMA,OAAAsuD,qBAAA9zD,CAAA,EACA,IAAAszE,EAAA,WAAA9F,IAAAxtE,EAAA,CACAonB,WAAA,GACWP,6BAAA,EACX,KACA,OAAAvN,GAAAg6D,EACA,EAGA,MAAAnH,GACAntE,YAAA2zD,CAAA,EACA,GAAAA,KAAA7xD,IAAA6xD,EAAAuB,MAAA,EACA,KAAAC,OAAA,KAAAhyD,IACA,MACA,KACAgyD,EAAAxB,EAAAuB,MAAA,CAAAh2D,GAAA,KACA,IAAAq1E,EAAA,CACAvzE,KAAAwzE,EAAAxzE,IAAA,CACAL,KAAA,CACA+yD,KAAA,SACAx6C,OAAAs7D,EAAiCt7D,MAAA,CAAAha,GAAA,IACZ,EAAA8B,KAAAiqC,EAAAjqC,IAAA,CAAAL,KAAAsqC,EAAAtqC,IAAA,GAErB,CACA,EACS,OAAA6zE,EAAAxzE,IAAA,CAAA+wE,GAAAte,aAAA,CAAA8gB,EAAA5gB,EAAAO,KAAA,IAET,MAAAiB,OAAA,KAAAhyD,IAAAgyD,GACA,KAAAC,cAAA,KAAAjyD,IAAAwwD,KAAA7xD,IAAA6xD,EAAAuB,MAAA,CACA,GACAvB,EAAAuB,MAAA,CAAAh2D,GAAA,KACAQ,EAAAquE,GAAA3oE,EAAApE,IAAA,GACAoE,EAAApE,IAAA,CACA,EACA,CACA8V,OAAA47C,CAAA,MACA+hB,EAEA,IACAA,EAAA39D,EAAA47C,EACA,CACA,MAAAttD,EAAA,CACA,YAEA,IAAAsvE,EAAAh1E,EAAA+0E,EAAAp1E,KAAA,OAEAs1E,EAAA,KAAAvf,cAAA,CAAAt0C,GAAA,CAAA4zD,GACA,GAAAC,KAAA7yE,IAAA6yE,EACA,YAEA,IAAA98D,EAAA,KAAAs9C,OAAA,CAAAr0C,GAAA,CAAA6zD,GACA,IAAA98D,EACA,8BAAA88D,EAAA,GAEA,IAAAl1E,EAAiBoY,EAAAf,MAAA,CAAA29D,EAAAp1E,KAAA,KACjB,OAAAI,KAAAA,EAAAuB,KAAA2zE,CAAA,CACA,CACA,CACA,SAAA5G,GAAA/sE,CAAA,CAAkC,CAClC,OAAAsZ,GAAA,SAAAtZ,EAAA,GAMA,MAAA4zE,GACA50E,YAAA2zD,CAAA,EACA,GAAAA,KAAA7xD,IAAA6xD,EAAAO,KAAA,EACA,KAAAoB,WAAA,KAAAnyD,IACA,MACA,KACAgyD,EAAAxB,EAAAO,KAAA,CAAAh1D,GAAA,IACS,CAAAma,EAAArY,IAAA,CAAA+wE,GAAAte,aAAA,CAAAp6C,EAAAs6C,EAAAO,KAAA,GAET,MAAAoB,WAAA,KAAAnyD,IAAAgyD,GACA,KAAAxB,GAAA,CAAAA,CACA,CACAj0D,OAAAm1E,CAAA,CAAAl0E,CAAuB,EACvB,IAAAyf,EAAAiuC,EAAA5vD,MAAA,CAAAknB,KAAA,MACA9N,EAAA,KAAAy9C,WAAA,CAAAx0C,GAAA,CAAA+zD,GACA,IAAAh9D,EACA,6BAAAg9D,EAAA,GAEA,IAAAp9C,EAAA5f,EAAAnY,MAAA,CAAAiB,EAAAyf,GACA,OAAAA,EAAA/gB,KAAA,GAAAo4B,EACA,CACA3gB,OAAA+9D,CAAA,CAAAC,CAAA,EACA,IAAAj9D,EAAA,KAAAy9C,WAAA,CAAAx0C,GAAA,CAAA+zD,GACA,IAAAh9D,EACA,6BAAAg9D,EAAA,GAEA,OAAAh9D,EAAAf,MAAA,CAAAg+D,EACA,EAOA,MAAA5H,GACAltE,YAAA2zD,CAAA,EACA,KAAAjK,WAAA,KAAA0jB,GAAAzZ,GACA,KAAA1tD,QAAA,KAAAmjE,GAAAzV,GACA,KAAAuB,MAAA,KAAAiY,GAAAxZ,GACA,KAAAO,KAAA,KAAA0gB,GAAAjhB,EACA,EAEqJ,IAAAznD,GAAA,oBAAAC,WAAAA,WAAA,oBAAAC,OAAAA,OAAA,SAAA1O,EAAA2O,CAAA,CAAA3O,EAAA2O,CAAA,qBAAA/O,KAAAA,KAAA,GAGrJ,SAAAgP,GAAAnL,CAAA,EACA,OAAAA,GAAAA,EAAAoL,UAAA,EAAAzL,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAvL,EAAA,WAAAA,EAAA,QAAAA,CAAA,CA0CA,MAAAqV,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAAH,GACA,2CAWA,KAAAA,IAAA,CAAAA,EAWA,KAAAC,QAAA,CAAAA,CAAA,CAkBAG,uBAAA,CACA,SAeAC,OAAAC,CAAA,CAAAC,CAAA,EACA,kCAyBAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,kCAmBAE,QAAAH,CAAA,CAAAC,CAAA,EACA,UAAAP,IAAA,CACA,uCAEA,YAAAA,IAAA,CAmBAU,UAAAT,CAAA,EACA,IAAAU,EAAAtW,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,EAGA,OAFA1L,OAAAC,MAAA,CAAAqW,EAAA,MACAA,EAAAV,QAAA,CAAAA,EACAU,CAAA,CAuBAC,UAAAC,CAAA,EAEA,CACA,KAAAC,GAAAf,GAQA,SAAAgB,GAAAxW,CAAA,CAAAyW,CAAA,SACA,EAAAf,QAAA,CACA1V,EAAA,IAAAyW,EAAAf,QAAA,KAEA1V,CADA,CAyBA,MAAA0W,WAAAlB,GAYAmB,SAAA,CACA,0CACA,CAuBA,MAAAC,WAAAF,GACA1X,YAAA6X,CAAA,CAAAb,CAAA,CAAAN,CAAA,EACA,IAAAmB,CAAAA,aAAArB,EAAA,EACA,2CAGA,GAAA1U,KAAAA,IAAAkV,EACMA,EAAA,OACN,IAAAL,OAAAC,SAAA,CAAAI,GACA,uDAEA,MAAAa,EAAApB,IAAA,CAAAC,GAAAmB,EAAAnB,QAAA,EAGA,KAAAmB,MAAA,CAAAA,EASA,KAAAb,MAAA,CAAAA,CAAA,CAIAW,SAAA,CACA,YAAAE,MAAA,YAAAC,IACA,KAAAD,MAAA,YAAAE,EAAA,CAIAjB,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,KAAAA,MAAA,EAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAAAA,MAAA,CACA,EAmBA,MAAAc,WAAAtB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAiB,UAAA,CAAAhB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAkB,WAAA,CAAAhB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAAsB,WAAAvB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAmB,UAAA,CAAAlB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAoB,WAAA,CAAAlB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAEA,IAAA2B,GAAArZ,WAKA,SAAAsZ,GAAApB,CAAA,EACA,IAAAqB,EAAAvZ,KAAAwZ,KAAA,CAAAtB,EAAAmB,IACAI,EAAUvB,EAAAqB,EAAAF,GACV,OAAAE,KAAAA,EAAAE,KAAAA,CAAA,CACA,CAEA,SAAAC,GAAAH,CAAA,CAAAE,CAAA,EACA,OAAAF,EAAAF,GAAAI,CAAA,CAcA,MAAAE,WAAAlC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAA4B,YAAA,CAAA3B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAA8B,aAAA,CAAAD,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAA8B,WAAAtC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAAgC,WAAA,CAAA/B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAAiC,YAAA,CAAAJ,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAmCA,MAAAiC,WAAAzC,GACAxW,YAAAkZ,CAAA,CAAAxC,CAAA,CAAAyC,CAAA,EACA,IAAAta,CAAAA,MAAA6D,OAAA,CAAAwW,IACAA,EAAAE,MAAA,EAAAC,EAAAvW,IAAAuW,GAAAvW,aAAA0T,GAAA,KACA,4DASA,QAAA8C,KAPA,kBAAA5C,GACA5U,KAAAA,IAAAqX,IACAA,EAAAzC,EACAA,EAAA5U,KAAAA,GAIAoX,GACA,KAAAI,EAAA7C,IAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,CACA,oEAIA,IAAAD,EAAA,GACA,IACMA,EAAAyC,EAAAE,MAAA,EAAA3C,EAAA6C,IAAA7C,EAAA6C,EAAApC,OAAA,KACN,OAAA9R,EAAA,CACA,OAAAqR,EAAAC,GAYA,KAAAwC,MAAA,CAAAA,EAYA,KAAAC,cAAA,GAAAA,CAAA,CAIAjC,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA,IACAA,EAAA,KAAAyC,MAAA,CAAAE,MAAA,EAAA3C,EAAA6C,IAAA,CACA,IAAAC,EAAAD,EAAApC,OAAA,CAAAH,EAAAC,GAEO,OADPA,GAAAuC,EACO9C,EAAA8C,CACD,IACN,OAAAnU,EAAA,CACA,uCAEA,OAAAqR,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CAKA,GAJApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAAC,EAAA,EAEAA,GAAAsC,EAAApC,OAAA,CAAAH,EAAAC,GACA,KAAAmC,cAAA,EACApC,EAAA9X,MAAA,GAAA+X,EACA,MAGA,OAAAwC,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAyC,EAAAzC,EACA0C,EAAA,EACAC,EAAA,EACA,QAAAL,KAAA,KAAAJ,MAAA,EACA,IAAAzC,EAAA6C,EAAA7C,IAAA,CAEA,GADAkD,EAAA,EAAAlD,EAAAA,EAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,IACAD,EAAAL,EAAA5Z,MAAA,CAAAka,EAAA7C,EAAAC,GACA,EAAAP,GAGAA,CAAAA,EAAA6C,EAAApC,OAAA,CAAAH,EAAAC,EAAA,EAGA,GACAA,EACAA,GAAAP,CACA,CAKA,SAAAkD,EAAAF,CAAA,CAIApC,UAAAC,CAAA,EACA,IAAAkC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,EAAAY,EAAArY,MAAA,EACAua,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAAY,EAAAuC,KAAA,IAGA,OAAAL,CAAA,CAWAM,UAAApD,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAeAS,SAAArD,CAAA,EACA,oBAAAA,EACA,2CAEA,IAAAM,EAAA,EACA,QAAAsC,KAAA,KAAAJ,MAAA,EACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAAM,CACA,CACA,EAAAsC,EAAA7C,IAAA,CACQO,EAAA,GACR,GAAAA,GACAA,CAAAA,GAAAsC,EAAA7C,IAAA,CAEA,CACA,EAiBA,MAAAuD,GACAha,YAAa0W,CAAA,EAKb,KAAAA,QAAA,CAAAA,CAAA,CAOAI,QAAA,CACA,8CAOApX,QAAA,CACA,8CACA,CAoBA,MAAAua,WAAAD,GACAha,YAAA6X,CAAA,CAAAnB,CAAA,EACA,kBAAAgB,IACAG,EAAAF,OAAA,IACA,qEAEA,MAAAjB,GAAAmB,EAAAnB,QAAA,aAKA,KAAAmB,MAAA,CAAAA,CAAA,CAIAf,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EACA,EA8DA,MAAAkD,WAAA1D,GACAxW,YAAAma,CAAA,CAAAC,CAAA,CAAA1D,CAAA,EACA,IAAA2D,EAAA,aAAAvC,IACAqC,aAAApC,GACA,GAAAsC,EACMF,EAAA,IAAAF,GAAA,IAAArC,GAAAuC,SACN,gBAAAzC,IACAyC,EAAAxC,OAAA,GACMwC,EAAA,IAAAF,GAAAE,QACN,IAAAA,CAAAA,aAAAH,EAAA,EACA,mFACA,CAKA,GAHAlY,KAAAA,IAAAsY,GACAA,CAAAA,EAAA,MAEA,SAAAA,GACAA,aAAA5D,EAAA,EACA,0DAEA,UAAA4D,EAAA,CACA,KAAAA,EAAA3D,IAAA,CACA,0DAEA3U,IAAAsY,EAAA1D,QAAA,EACA0D,CAAAA,EAAAA,EAAAjD,SAAA,YACA,KAOAV,EAAA,GACA2D,GAEA,GADA3D,CAAAA,EAAA2D,EAAA3D,IAAA,GACA4D,GACA5D,CAAAA,GAAA0D,EAAAtC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAUA,KAAA4D,aAAA,CAAAH,EAOA,KAAAI,uBAAA,CAAAF,EASA,KAAAD,aAAA,CAAAA,EAYA,KAAAI,QAAA,IAGA,IAAAC,EAAA,KAAAC,uBAAA,CAAAC,IAAA,MAgBA,MAAAC,gBAAA,UAAA3D,CAAA,EACA,OAAAwD,EAAAxD,EAAA,EAgBA,KAAA4D,sBAAA,UAAAC,CAAA,EACAL,EAAAK,EAAAH,IAAA,MACA,EAIAzD,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAKA,IAAA+D,EAAA,KAAAC,UAAA,CAAAjE,EAAAC,GACA,IAAA+D,EACA,iEAEA,OAAAA,EAAA7D,OAAA,CAAAH,EAAAC,EAAA,CAgCA0D,wBAAAzD,CAAA,EACA,GAAAA,EAAAxK,cAAA,MAAA6N,aAAA,CAAA5D,QAAA,GACA,QAAA0D,aAAA,EACAnD,EAAAxK,cAAA,MAAA2N,aAAA,CAAA1D,QAAA,EACA,MACA,CACA,IAAAqE,EAAA,KAAAP,QAAA,CAAAvD,CAAA,MAAAqD,aAAA,CAAA5D,QAAA,GACA,GAAAqE,GACA,EAAAA,EAAAlD,MAAA,EACAZ,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,GACA,OAAAqE,CACM,MAEN,QAAAE,KAAA,KAAAT,QAAA,EACA,IAAAO,EAAA,KAAAP,QAAA,CAAAS,EAAA,CACA,GAAAhE,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,EACA,OAAAqE,CACA,CAEA,MACA,qCASAjE,OAAAC,CAAA,CAAAC,CAAA,MAIAwC,CAHA1X,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAGA,IAAAkE,EAAA,KAAAZ,aAAA,CACAH,EAAAe,EAAApE,MAAA,CAAAC,EAAAC,GACAmE,EAAA,KAAAX,QAAA,CAAAL,EAAA,CACA,GAAArY,KAAAA,IAAAqZ,EAAA,CACA,IAAAC,EAAA,EACAD,EAAA,KAAAf,aAAA,CACA,KAAAG,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAGA+C,CADAA,EAAA,KAAA3C,qBAAA,GACA,CAAAqE,EAAAxE,QAAA,EAAAyD,EACMX,CAAA,CAAA2B,EAAAzE,QAAA,OAAA0D,aAAA,CAAAtD,MAAA,CAAAC,EAAAC,EAAAoE,EACN,MACA5B,EAAA2B,EAAArE,MAAA,CAAAC,EAAAC,EACA,CACA,OAAAwC,CAAA,CASA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA+D,EAAA,KAAAH,gBAAA,CAAA3D,GACA,GAAAnV,KAAAA,IAAAiZ,EAAA,CACA,IAAAG,EAAA,KAAAZ,aAAA,CACAa,EAAA,KAAAf,aAAA,CACAgB,EAAA,EAKA,OAJA,KAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAEAyE,EAAAxb,MAAA,CAAAuX,CAAA,CAAAiE,EAAAxE,QAAA,EAAAK,EAAAC,GACAoE,EAAAD,EAAAzb,MAAA,CAAAuX,CAAA,CAAAkE,EAAAzE,QAAA,EAAAK,EACAC,EAAAoE,EACA,QACAL,EAAArb,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,CAgBAqE,WAAAC,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAU,EAAA,IAAAmE,GAAA,KAAAD,EAAAzD,EAAAnB,GAEA,OADA,KAAA8D,QAAA,CAAAc,EAAA,CAAAlE,EACAA,CAAA,CAiBA4D,WAAAQ,CAAA,CAAAxE,CAAA,EACA,IAAQsE,EAAME,EAOd,OANA/c,EAAAgd,QAAA,CAAAD,KACA1Z,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAsE,EAAA,KAAAhB,aAAA,CAAAxD,MAAA,CAAA0E,EAAAxE,IAEA,KAAAwD,QAAA,CAAAc,EAAA,CACA,CAgCA,MAAAC,WAAA/E,GACAxW,YAAA0b,CAAA,CAAAJ,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAgF,CAAAA,aAAAxB,EAAA,EACA,yCAEA,IAAAvD,OAAAC,SAAA,CAAA0E,IAAA,EAAAA,EACA,4DAOA,GALA,iBAAAzD,GACA/V,KAAAA,IAAA4U,IACAA,EAAAmB,EACAA,EAAA,MAEAA,EAAA,CACA,IAAAA,CAAAA,aAAArB,EAAA,EACA,2CAEA,UAAAkF,EAAAtB,aAAA,EACA,GAAAvC,EAAApB,IAAA,EACAoB,EAAApB,IAAA,CAAAiF,EAAAtB,aAAA,CAAA3D,IAAA,CACA,6DAEA,oBAAAC,EACA,uDAEA,IACAD,EAAAiF,EAAAjF,IAAA,CACA,EAAAiF,EAAAjF,IAAA,EAEA,GADAA,CAAAA,EAAAoB,EAAAA,EAAApB,IAAA,KACAiF,EAAAnB,uBAAA,EACA9D,CAAAA,GAAAiF,EAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAgF,KAAA,CAAAA,EAKA,KAAAJ,OAAA,CAAAA,EAOA,KAAAzD,MAAA,CAAAA,GAAA,KAIAX,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CAGA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAKA,OAJA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA2E,EAAA,KAAAvD,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,EAAA,CAIAtE,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,GAIA,GAHA/U,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,YAAA0E,KAAA,CAAAV,UAAA,CAAAjE,EAAAC,GACA,gCAEA,IAAAoE,EAAA,EAWA,OAVA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,CACM2B,CAAA,MAAA9C,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAAoE,GACN,KAAA1E,QAAA,CACM8C,CAAA,MAAA9C,QAAA,KACN,KAAAgF,KAAA,CAAAnB,uBAAA,EACAf,CAAAA,CAAA,MAAAkC,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAEA9B,CAAA,CAIA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAIA,GAHA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,EACA,CAAAZ,EAAAxK,cAAA,MAAAiK,QAAA,EACA,+CAAAA,QAAA,EAEA,KAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAvE,EAAAC,GACA,IAAAP,EAAA2E,EACA,QAAAvD,MAAA,GACA,KAAAA,MAAA,CAAAnY,MAAA,CAAAuX,CAAA,MAAAP,QAAA,EAAAK,EAAAC,EAAAoE,GACA3E,GAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,GACA,QAAAM,KAAA,CAAAjF,IAAA,EACAA,EAAA,KAAAiF,KAAA,CAAAjF,IAAA,EACA,yDAGA,OAAAA,CAAA,CAKAY,UAAAC,CAAA,EACA,QAAAO,MAAA,CACA,YAAAA,MAAA,CAAAR,SAAA,CAAAC,EACA,CAEA,CAiBA,MAAAqE,WAAAnF,GACAxW,YAAAf,CAAA,CAAAyX,CAAA,EACA,kBAAAgB,IAAAzY,EAAA0Y,OAAA,IACAhB,OAAAC,SAAA,CAAA3X,IAAA,GAAAA,CAAA,EACA,wFACA,CAGA,IAAAwX,EAAA,GACAxX,aAAAyY,IACAjB,CAAAA,EAAAxX,CAAA,EACA,MAAAwX,EAAAC,GAQA,KAAAzX,MAAA,CAAAA,CAAA,CAIAiY,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAP,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,CAQA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAxX,MAAA,CAIA,GAHA,KAAAA,MAAA,YAAAyY,IACAjB,CAAAA,EAAAQ,EAAAhY,MAAA,EAEA,CAAAR,CAAAA,EAAAgd,QAAA,CAAAxE,IACAR,IAAAQ,EAAAhY,MAAA,EACA,gBAAAuY,GAAA,oBACA,qBAAAf,EAAA,mBAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAMA,OAJA8X,EAAA6E,KAAA,CAAA3E,EAAAjQ,QAAA,QAAAgQ,EAAAP,EAAA,OACA,KAAAxX,MAAA,YAAAyY,IACA,KAAAzY,MAAA,CAAAS,MAAA,CAAA+W,EAAAM,EAAAC,GAEAP,CACA,EAGA,IAAAO,GAAA,CAAAa,EAAAb,EAAAN,IAAA,IAAAkB,GAAAC,EAAAb,EAAAN,GAIAmF,GAAAnF,GAAA,IAAAoB,GAAA,EAAApB,GAIAoF,GAAApF,GAAA,IAAAoB,GAAA,EAAApB,GAIAqF,GAAArF,GAAA,IAAAgC,GAAAhC,GAIAsF,GAAAtF,GAAA,IAAAoC,GAAApC,GAGA/W,GAAA,CAAAuZ,EAAAxC,EAAAyC,IAAA,IAAAF,GAAAC,EAAAxC,EAAAyC,GAGAuC,GAAA,CAAAvB,EAAAC,EAAA1D,IAAA,IAAAwD,GAAAC,EAAAC,EAAA1D,GAGAuF,GAAA,CAAAhd,EAAAyX,IAAA,IAAAiF,GAAA1c,EAAAyX,EAGA,OAAAq+D,GAEA/0E,YAAAb,CAAA,GACAO,OAAAizE,CAAgB,CAAAnoB,CAAA,EAChB,OAAAgkB,IAAAmE,IACA,oBACA,OAAAqC,GAAAxqB,EAEA,cACA,OAAAyqB,GAAAzqB,EAEA,gBACA,OAAA0qB,GAAA1qB,EAEA,6BACA,OAAA2qB,GAAA3qB,EAEA,2BACA,OAAA4qB,GAAA5qB,EAEA,4BACA,OAAA6qB,GAAA7qB,EAEA,8BACA,OAAA8qB,GAAA9qB,EAEA,6BACA,OAAA+qB,GAAA/qB,EAEA,gBACA,OAAAgrB,GAAAhrB,EAEA,wBACA,OAAAirB,GAAAjrB,EAEA,sBACA,OAAAkrB,GAAAlrB,EAEA,wBACA,OAAAmrB,GAAAnrB,EAEA,SACA,oCAAAmoB,EAAA,GAGA,CACA1e,YAAA2hB,CAAA,CAAAC,CAAA,EACA,0CAEA,CACA,MAAA35D,WAAA3E,GACAvX,YAAA0W,CAAA,EACA,SAAAA,GACA,KAAAA,QAAA,CAAAA,EACA,KAAAmB,MAAA,CAAAlY,GAAA,CACAmc,GAAA,UACAA,GAAA,iBACAG,GAAAjF,GAAA8E,KAAA,aACA,MAAApF,QAAA,CACA,CACAhX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,GAAAC,MAAAA,EACA,YAAAY,MAAA,CAAApB,IAAA,CAEA,IAAAhX,EAAmB,CACnB0c,MAAA1d,EAAA2d,IAAA,CAAAnF,EAAA,OACA,EACA,YAAAY,MAAA,CAAAnY,MAAA,CAAAD,EAAAsX,EAAAC,EACA,CACAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAvX,EAAA,KAAAoY,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,OAAAvX,EAAA,MAAAuH,QAAA,EACA,CACAkQ,QAAAH,CAAA,CAAAC,EAAA,GACA,OAAA8E,KAAArF,IAAA,CACAqF,KAAgBrF,IAAA,CAChB,GAAA7Y,CAAAA,GAAA,MAAA2M,WAAAwM,GAAA1X,KAAA,CAAA2X,EAAAA,EAAA,YAAAqF,QAAA,EACA,CACA,CACA,SAAAC,GAAA5F,CAAA,EACA,WAAAwF,GAAAxF,EACA,CACA,SAAA6F,GAAA7F,CAAA,EACA,OAAAuF,GAAA,GAAAvF,EACA,CACA,SAAAs+D,GAAA,CAAApsE,SAAAA,CAAA,CAAAg0C,MAAAA,CAAA,CAAAj0C,MAAAA,CAAA,GACA,OAAAmtE,GAAA,CACKr5B,cAAA,CAAA7zC,SAAAA,EAAAg0C,MAAAA,EAAAj0C,MAAAA,EAAAmU,QAAA,GACL,EACA,CACA,SAAAm4D,GAAA,CAAAtsE,MAAAA,CAAA,GACA,OAAAmtE,GAAkB,CACb/0E,OAAA,CAAA4H,MAAAA,EAAAmU,QAAA,GACL,EACA,CACA,SAAAo4D,GAAA,CAAAtsE,SAAAA,CAAA,GACA,OAAAktE,GAAoB,CACf1tB,SAAA,CAAAx/C,SAAAA,CAAA,CACL,EACA,CACA,SAAAusE,GAAA,CAAA9mC,KAAAA,CAAA,CAAAyrB,KAAAA,CAAA,CAAAlxD,SAAAA,CAAA,CAAAg0C,MAAAA,CAAA,CAAAj0C,MAAAA,CAAA,GACA,OAAAmtE,GAAA,CACA/b,sBAAA,CACA1rB,KAAAA,EAAAvxB,QAAA,GACAg9C,KAAAA,EACAlxD,SAAAA,EACAg0C,MAAAA,EACSj0C,MAAAA,EAAAmU,QAAA,EACJ,CACL,EAAAN,GAAAxB,UAAA,IAAAvE,IAAA,CAAAqjD,EAAA76D,MAAA,CACA,CACA,SAAAq2E,GAAA,CAAArb,WAAAA,CAAA,GACA,OAAA6b,GAAA,CACK1b,uBAAA,CAAAH,WAAAA,EAAAn9C,QAAA,GACL,EACA,CACA,SAAAs4D,GAAA,CAAAnb,WAAAA,CAAA,GACA,OAAA6b,GAAA,CACK5b,oBAAA,CAAAD,WAAAA,EAAAn9C,QAAA,GACL,EACA,CACA,SAAAu4D,GAAA,CAAAzsE,SAAAA,CAAA,GACA,OAAAktE,GAAA,CACK3b,qBAAA,CAAAvxD,SAAAA,CAAA,CACL,EACA,CACA,SAAA2sE,GAAA,CAAAtb,WAAAA,CAAA,GACA,OAAA6b,GAAA,CACKzb,sBAAA,CAAAJ,WAAAA,EAAAn9C,QAAA,GACL,EACA,CACA,SAAA04D,GAAA,CAAA54B,MAAAA,CAAA,GACA,OAAAk5B,GAAoB,CACfxb,SAAA,CAAA1d,MAAAA,CAAA,CACL,EACA,CACA,SAAA64B,GAAA,CAAApnC,KAAAA,CAAA,CAAAyrB,KAAAA,CAAA,CAAAld,MAAAA,CAAA,CAAAj0C,MAAAA,CAAA,GACA,OAAAmtE,GAAA,CACAvb,iBAAA,CACAlsB,KAAAA,EAAAvxB,QAAA,GACAg9C,KAAAA,EACAld,MAAAA,EACSj0C,MAAAA,EAAAmU,QAAA,EACJ,CACL,EAAAN,GAAAxB,UAAA,IAAAvE,IAAA,CAAAqjD,EAAA76D,MAAA,CACA,CACA,SAAAy2E,GAAA,CAAArnC,KAAAA,CAAA,CAAAyrB,KAAAA,CAAA,CAAAnxD,MAAAA,CAAA,GACA,OAAAmtE,GAAA,CACAtb,eAAA,CACAnsB,KAAAA,EAAAvxB,QAAA,GACAg9C,KAAAA,EACSnxD,MAAAA,EAAAmU,QAAA,EACJ,CACL,EAAAN,GAAAxB,UAAA,KAAAvE,IAAA,CAAAqjD,EAAA76D,MAAA,CACA,CACA,SAAA02E,GAAA,CAAA/sE,SAAAA,CAAA,CAAAkxD,KAAAA,CAAA,CAAAnxD,MAAAA,CAAA,GACA,OAAAmtE,GAAA,CACArb,iBAAA,CACA7xD,SAAAA,EACAkxD,KAAAA,EACSnxD,MAAAA,EAAAmU,QAAA,EACJ,CACL,EAAAN,GAAAxB,UAAA,KAAAvE,IAAA,CAAAqjD,EAAA76D,MAAA,CACA,CACA,IAAAud,GAAAd,GAAAI,GAAA,gBAoCA,SAAAg6D,GAAoBpsB,CAAA,CAAAqsB,CAAA,EACpB,IAAAh/D,EAAAtY,EAAAknB,KAAA,CAAAowD,MAAAA,EAAAA,EAAAC,EAAA,EACAv/D,EAAA+F,GAAA9c,MAAA,CAAAgqD,EAAA3yC,UACA,KAAAjV,IAAAi0E,EACAh/D,EAAA1X,KAAA,GAAAoX,GAEAM,CADA,CAxCAyF,GAAAnB,UAAA,GAAA1b,GAAA,CACAqc,GAAA,YACAA,GAAA,SACAO,GAAA,SACA,mBACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,qBACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,0BACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAN,GAAA,YACAA,GAAA,SACAO,GAAA,SACA,2BACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,uCACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,sCACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,0CACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAA4c,GAAA,yCACAC,GAAAnB,UAAA,GAAA1b,GAAA,CAAAqc,GAAA,uBACAQ,GAAAnB,UAAA,GAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAN,GAAA,SACAO,GAAA,SACA,sBACAC,GAAAnB,UAAA,IAAA1b,GAAA,CACA4c,GAAA,QACAD,GAAA,QACAC,GAAA,SACA,oBACAC,GAAAnB,UAAA,IAAA1b,GAAA,CACAqc,GAAA,YACAM,GAAA,QACAC,GAAA,SACA,sBAQA,IAAAy5D,GAAAj3E,KAAAqrC,GAAA,IAAAtpC,OAAAwW,MAAA,CAAAkF,GAAAhC,QAAA,EAAAtb,GAAA,IAAAiD,EAAAsU,IAAA,EAGA,OAAAw/D,GACAj2E,YAAA2zD,CAAA,EACA,KAAAA,GAAA,CAAAA,CACA,CACA,MAAAj0D,OAAAypE,CAAA,CAAAjjE,CAAA,EACA,GACA,UADAijE,EACA,CACA,IAAA/oD,EAAA3hB,EAAAknB,KAAA,CAAAxnB,EAAA68D,oBAAA,EACAvjC,EAAAy+C,GAAAx2E,MAAA,CAAAwG,EAAAka,GACA,OAAAA,EAAA/gB,KAAA,GAAAo4B,EACA,CAIA,MAFA,+BAAA0xC,EAAA,GAIAryD,OAAAqyD,CAAA,CAAA3e,CAAA,EACA,YAAAwK,eAAA,CAAAmU,EAAA3e,EACA,CACAwK,gBAAAmU,CAAA,CAAA3e,CAAA,EACA,GACA,UADA2e,EAEA,OAAAgN,GAAA3rB,EAKA,OAFA,+BAAA2e,EAAA,GAKAlU,OAAAkU,CAAA,CAAAiN,CAAA,EACA,GACA,UADAjN,EAEA,OACA1P,SAAAt7D,EAAA68D,oBAAA,CAMA,OAFA,+BAAAmO,EAAA,GAIAvqE,KAAAk1E,CAAA,EACA,IAAAttE,EACA,cAAAA,CAAAA,EAAAqtE,GAAA,KAAAlgB,GAAA,CAAAmgB,EAAA,GAAAttE,KAAA,IAAAA,EAAAA,EAAA,EAEA,CACA,SAAA2vE,GAAA3rB,CAAA,EACA,OAAA0rB,GAAAp/D,MAAA,CAAA0zC,EACA,CACA,MAAA/tC,WAAAlF,GACAvX,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAA4F,GAAAlG,CAAA,EACA,WAAA+F,GAAAR,GAAA,WAAA9d,EAAA0e,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA,IAAAw/D,GAAAv2E,GAAA,CACAmc,GAAA,WACAA,GAAA,SACAc,GAAA,oBACAA,GAAA,SACAjd,GAAA,CAAAoc,GAAA,2CAGA,OAAAs6D,GACAr2E,YAAA+9D,CAAA,GACAjnD,OAAAw/D,CAAA,EACA,mDACA,CAGA,MAAAC,GACAv2E,YAAA+9D,CAAA,GACAr+D,OAAA82E,CAAA,CAAAC,CAAA,EACA,uDAEA3/D,OAAA0/D,CAAA,CAAAE,CAAA,EACA,uDACA,CAMA,MAAA5I,GACA9tE,YAAA2zD,CAAA,EACA,KAAAjK,WAAA,KAAAqrB,GAAAphB,GACA,KAAA1tD,QAAA,KAAAgwE,GAAAtiB,GACA,KAAAuB,MAAA,KAAAmhB,GAAA1iB,GACA,KAAAO,KAAA,KAAAqiB,GAAA5iB,EACA,EAOA,IAAAc,GAAA3zD,OAAAquD,MAAA,EACAC,UAAA,KACCnhC,KAND,SAAAxuB,CAAA,EACA,WAAAsvD,cAAAj4C,MAAA,IAAA23D,EAAA/d,CAAA,EAAAjxD,GAAA,CAKC,GAYD,SAAAw8D,GAAiBnf,CAAA,IAAAv1C,CAAA,EACjB,IAAAo6C,EAAA,CAAA0M,EAAA5vD,MAAA,CAAA2d,IAAA,2BACA7U,EAAA2D,OAAA,KACKy2C,EAAApkD,IAAA,CAAAs3B,aAAAw5B,EAAA5vD,MAAA,CAAAo2B,EAAA0sB,EAAA1sB,GAAA/X,QAAA,GACL,GACA,IAAA65D,EAAA,CAAAx4E,EAAA0e,SAAA,CAAAilC,sBAAA,CAAAH,EAAAJ,EAAAzE,IACA,OAAA65B,CAAA,CAGA,IAAAjyB,GAAA5jD,OAAAquD,MAAA,EACAC,UAAA,KACA2M,mBAnBA,SAAmB6a,CAAA,CAAA9c,CAAA,CAAAhd,CAAA,EACnB,IAAA18B,EAAAiuC,EAAA5vD,MAAA,CAAA01B,MAAA,EACQyiD,EAAA95D,QAAA,GACRuxC,EAAA5vD,MAAA,CAAA2d,IAAA,CAAA09C,GACAhd,EAAAhgC,QAAA,GACA,EACA,WAAA3e,EAAA0e,SAAA,IAAA4xD,EAAA/d,CAAA,EAAAtwC,GACA,EAaC67C,WAAAA,EAAA,GAGD,IAAAlf,GAAA,IAAA5+C,EAAkC0e,SAAA,gDAClCw/C,GAA6B,IAAAl+D,EAAc0e,SAAA,iDAC3C,SAAAy/C,GAAW,CAAA9X,KAAAA,CAAA,CAAA77C,MAAAA,CAAA,GACX,OAAAxK,EAAA0e,SAAA,CAAAilC,sBAAA,EAAAn5C,EAAAmU,QAAA,GAAAigC,GAAAjgC,QAAA,GAAA0nC,EAAA1nC,QAAA,IAAAu/C,GAAA,IAGA,IAAArsC,GAAAlvB,OAAAquD,MAAA,EACAC,UAAA,KACArS,iBAAAA,GACAsf,sBAAAA,GACCC,kBAAAA,EAAA,GAEsBv/C,GAAA,CAAAhf,QAAA,IAGvBD,EA0iBCif,GA1iBDhf,EA0iBCgf,GAAAhf,OAAA,CAziBDC,EAAA,oBAAAV,KAAAA,KAAA4O,EAAA,CAQA5O,EAPAW,EAAA,WACA,SAAA+e,GAAA,CACA,KAAAC,KAAA,IACA,KAAAC,YAAA,CAAAlf,EAAAkf,YAAA,CAGA,OADAF,EAAAxQ,SAAA,CAAAxO,EACC,IAAAgf,CACD,IAEA,SAAAjf,CAAA,EAGA,IAAAof,EAAA,CACAC,aAAA,oBAAA9f,EACA+f,SAAA,WAAA/f,GAAA,aAAA+D,OACA4a,KACA,eAAA3e,GACA,SAAAA,GACA,WACA,IAEU,OADV,IAAAggB,KACU,EACV,OAAAlY,EAAA,CACA,QACO,CACP,IACAmY,SAAA,aAAAjgB,EACAkgB,YAAA,gBAAAlgB,CAAA,EAGA,SAAAmgB,EAAAC,CAAA,EACA,OAAAA,GAAAC,SAAAnR,SAAA,CAAAoR,aAAA,CAAAF,EAAA,CAGA,GAAAP,EAAAK,WAAA,CACA,IAAAK,EAAA,CACA,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,yBAGAC,EACAC,YAAAC,MAAA,EACA,SAAAN,CAAA,EACA,OAAAA,GAAAG,EAAAI,OAAA,CAAAnd,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,IAAA,EACA,EAGA,SAAAQ,EAAAld,CAAA,EAIA,GAHA,iBAAAA,GACAA,CAAAA,EAAAmd,OAAAnd,EAAA,EAEA,4BAAAod,IAAA,CAAApd,GACA,0DAEA,OAAAA,EAAAqd,WAAA,GAGA,SAAAC,EAAA7d,CAAA,EAIA,MAHA,iBAAAA,GACAA,CAAAA,EAAA0d,OAAA1d,EAAA,EAEAA,CAAA,CAIA,SAAA8d,EAAAC,CAAA,EACA,IAAAld,EAAA,CACAO,KAAA,WACA,IAAApB,EAAgB+d,EAAA3E,KAAA,GAChB,OAAAjY,KAAAnB,KAAAqB,IAAArB,EAAAA,MAAAA,CAAA,CACA,GASA,OANA0c,EAAAE,QAAA,EACA/b,CAAAA,CAAA,CAAAD,OAAAC,QAAA,aACA,OAAAA,CACA,GAGAA,CAAA,CAGA,SAAAmd,EAAAC,CAAA,OAAAxf,GAAA,IAGAwf,aAAAD,EACAC,EAAAxT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACO,KAAA2d,MAAA,CAAA3d,EAAAP,EACD,QACN5B,MAAA6D,OAAA,CAAAgc,GACAA,EAAAxT,OAAA,UAAA0T,CAAA,EACO,KAAAD,MAAA,CAAAC,CAAA,IAAAA,CAAA,IACD,QACNF,GACA5d,OAAA+d,mBAAA,CAAAH,GAAAxT,OAAA,UAAAlK,CAAA,EACO,KAAA2d,MAAA,CAAA3d,EAAA0d,CAAA,CAAA1d,EAAA,CACP,OACA,CA+DA,SAAA8d,EAAAC,CAAA,EACA,GAAAA,EAAAC,QAAA,CACA,OAAAC,QAAAC,MAAA,2BACA,CACAH,EAAAC,QAAA,IAGA,SAAAG,EAAAC,CAAA,EACA,WAAAH,QAAA,SAAAI,CAAA,CAAAH,CAAA,EACAE,EAAAE,MAAA,YACAD,EAAAD,EAAApd,MAAA,CACA,EACAod,EAAAG,OAAA,YACAL,EAAAE,EAAAnb,KAAA,CACK,CACL,GAGA,SAAAub,EAAAvD,CAAA,EACA,IAAAmD,EAAA,IAAAK,WACAC,EAAAP,EAAAC,GAEA,OADAA,EAAAO,iBAAA,CAAA1D,GACAyD,CAAA,CAGA,SAAAE,EAAA3D,CAAA,EACA,IAAAmD,EAAA,IAAAK,WACAC,EAAAP,EAAAC,GAEA,OADAA,EAAAS,UAAA,CAAA5D,GACAyD,CAAA,CAGA,SAAAI,EAAAC,CAAA,EAIA,QAHAC,EAAA,IAAAzV,WAAAwV,GAAA5D,EAAA,MAAA6D,EAAA/gB,MAAA,EAGAoF,EAAA,EAAAA,EAAA2b,EAAA/gB,MAAA,CAAAoF,IACA8X,CAAA,CAAA9X,EAAA,CAAA8Z,OAAA8B,YAAA,CAAAD,CAAA,CAAA3b,EAAA,EAEA,OAAA8X,EAAA3b,IAAA,KAGA,SAAA0f,EAAAH,CAAA,EACA,GAAAA,EAAA1gB,KAAA,CACM,OAAA0gB,EAAA1gB,KAAA,GAKN,CAHA,IAAA2gB,EAAA,IAAAzV,WAAAwV,EAAAI,UAAA,EAEA,OADAH,EAAA5c,GAAA,KAAAmH,WAAAwV,IACAC,EAAAI,MAAA,CAIA,SAAAC,GAAA,CA0FA,OA1FA,KAAArB,QAAA,IAGA,KAAAsB,SAAA,UAAAvB,CAAA,EACA,KAAAwB,SAAA,CAAAxB,EACAA,EAEA,iBAAAA,EACQ,KAAAyB,SAAA,CAAAzB,EACR5B,EAAAlB,IAAA,EAAAqB,KAAA9Q,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAA0B,SAAA,CAAA1B,EACR5B,EAAAI,QAAA,EAAAmD,SAAAlU,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAA4B,aAAA,CAAA5B,EACR5B,EAAAC,YAAA,EAAAwD,gBAAApU,SAAA,CAAAoR,aAAA,CAAAmB,GACQ,KAAAyB,SAAA,CAAAzB,EAAA/X,QAAA,GACRmW,EAAAK,WAAA,EAAAL,EAAAlB,IAAA,EAAAwB,EAAAsB,IACA,KAAA8B,gBAAA,CAAAX,EAAAnB,EAAAqB,MAAA,EAEQ,KAAAG,SAAA,KAAAjD,KAAA,MAAAuD,gBAAA,IACR1D,EAAAK,WAAA,EAAAO,CAAAA,YAAAvR,SAAA,CAAAoR,aAAA,CAAAmB,IAAAjB,EAAAiB,EAAA,EACQ,KAAA8B,gBAAA,CAAAX,EAAAnB,GAER,KAAAyB,SAAA,CAAAzB,EAAAje,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAqS,GAhBQ,KAAAyB,SAAA,IAmBR,MAAA9B,OAAA,CAAAoC,GAAA,mBACA,iBAAA/B,EACU,KAAAL,OAAA,CAAAtb,GAAA,4CACV,KAAAqd,SAAA,OAAAA,SAAA,CAAA9f,IAAA,CACU,KAAA+d,OAAA,CAAAtb,GAAA,qBAAAqd,SAAA,CAAA9f,IAAA,EACVwc,EAAAC,YAAA,EAAAwD,gBAAApU,SAAA,CAAAoR,aAA8E,CAAAmB,IAC9E,KAAAL,OAAA,CAAAtb,GAAA,mEAEA,EAGA+Z,EAAAlB,IAAA,GACA,KAAAA,IAAA,YACA,IAAA8E,EAAAjC,EAAA,MACA,GAAAiC,EACA,OAAAA,CAAA,CAGA,QAAAN,SAAA,CACU,OAAAxB,QAAAI,OAAA,MAAAoB,SAAA,CAOV,CANA,QAAAI,gBAAA,CACU,OAAA5B,QAAAI,OAAA,KAAA/B,KAAA,MAAAuD,gBAAA,GAKV,CAJA,SAAAF,aAAA,CAGA,OAAA1B,QAAAI,OAAA,KAAA/B,KAAA,MAAAkD,SAAA,GACA,OAHU,+CAMV,KAAAhD,WAAA,mBACA,KAAAqD,gBAAA,CACU/B,EAAA,OAAAG,QAAAI,OAAA,MAAAwB,gBAAA,EAEV,KAAA5E,IAAA,GAAA+E,IAAA,CAAAxB,EACA,GAIA,KAAAyB,IAAA,YACA,IAAAF,EAAAjC,EAAA,MACA,GAAAiC,EACA,OAAAA,CAAA,CAGA,QAAAN,SAAA,CACQ,OAAAb,EAAA,KAAAa,SAAA,CAOR,CANA,QAAAI,gBAAA,CACQ,OAAA5B,QAAAI,OAAA,CAAAS,EAAA,KAAAe,gBAAA,EAKR,CAJA,SAAAF,aAAA,CAGA,OAAA1B,QAAAI,OAAA,MAAAmB,SAAA,CACA,OAHQ,+CAMRrD,EAAAI,QAAA,EACA,MAAAA,QAAA,YACA,YAAA0D,IAAA,GAAAD,IAAA,CAAAlK,EACA,GAGA,KAAAoK,IAAA,YACA,YAAAD,IAAA,GAAAD,IAAA,CAAAxf,KAAA2f,KAAA,GAGA,KA1MA1C,EAAAjS,SAAA,CAAAmS,MAAA,UAAA3d,CAAA,CAAAP,CAAA,EACAO,EAAAkd,EAAAld,GACAP,EAAA6d,EAAA7d,GACA,IAAA2gB,EAAA,KAAAliB,GAAA,CAAA8B,EAAA,CACA,KAAA9B,GAAA,CAAA8B,EAAA,CAAAogB,EAAAA,EAAA,KAAA3gB,EAAAA,CAAA,EAGAge,EAAAjS,SAAA,iBAAAxL,CAAA,EACA,YAAA9B,GAAA,CAAAgf,EAAAld,GAAA,EAGAyd,EAAAjS,SAAA,CAAAsU,GAAA,UAAA9f,CAAA,EAEA,OADAA,EAAAkd,EAAAld,GACA,KAAAqgB,GAAA,CAAArgB,GAAA,KAAA9B,GAAA,CAAA8B,EAAA,OAGAyd,EAAAjS,SAAA,CAAA6U,GAAA,UAAArgB,CAAA,EACA,YAAA9B,GAAA,CAAAuN,cAAA,CAAAyR,EAAAld,GAAA,EAGAyd,EAAAjS,SAAA,CAAApJ,GAAA,UAAApC,CAAA,CAAAP,CAAA,EACA,KAAAvB,GAAA,CAAAgf,EAAAld,GAAA,CAAAsd,EAAA7d,EAAA,EAGAge,EAAAjS,SAAA,CAAAtB,OAAA,UAAAoW,CAAA,CAAAC,CAAA,EACA,QAAAvgB,KAAA,KAAA9B,GAAA,CACA,KAAAA,GAAA,CAAAuN,cAAA,CAAAzL,IACAsgB,EAAA5U,IAAA,CAAA6U,EAAA,KAAAriB,GAAA,CAAA8B,EAAA,CAAAA,EAAA,KAEA,EAGAyd,EAAAjS,SAAA,CAAAzH,IAAA,YACA,IAAAyZ,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACKwd,EAAAjhB,IAAA,CAAAyD,EACL,GACAud,EAAAC,EAAA,EAGAC,EAAAjS,SAAA,CAAA8K,MAAA,YACA,IAAAkH,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,EACK+d,EAAAjhB,IAAA,CAAAkD,EACL,GACA8d,EAAAC,EAAA,EAGAC,EAAAjS,SAAA,CAAAxJ,OAAA,YACA,IAAAwb,EAAA,GAIA,OAHA,KAAAtT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACKwd,EAAAjhB,IAAA,EAAAyD,EAAAP,EAAA,CACL,GACA8d,EAAAC,EAAA,EAGArB,EAAAE,QAAA,EACAoB,CAAAA,EAAAjS,SAAA,CAAAnL,OAAAC,QAAA,EAAAmd,EAAAjS,SAAA,CAAAxJ,OAAA,EAoJA,IAAAwe,EAAA,+CAGA,SAAAC,EAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAE,WAAA,GACA,OAAAJ,EAAAvD,OAAA,CAAA0D,GAAA,GAAAA,EAAAD,CAAA,CAGA,SAAAG,EAAAlgB,CAAA,CAAAU,CAAA,EACA,IAAA0c,EAAA1c,CAAAA,EAAAA,GAAA,IAAA0c,IAAA,CAGA,GAAApd,aAAAkgB,EAAA,CACA,GAAAlgB,EAAAqd,QAAA,CACA,gCAEA,KAAA3V,GAAA,CAAA1H,EAAA0H,GAAA,CACA,KAAAyY,WAAA,CAAAngB,EAAAmgB,WAAA,CACAzf,EAAAqc,OAAA,EACA,MAAAA,OAAA,KAAAD,EAAA9c,EAAA+c,OAAA,GAEA,KAAAgD,MAAA,CAAA/f,EAAA+f,MAAA,CACA,KAAAK,IAAA,CAAApgB,EAAAogB,IAAA,CACA,KAAAC,MAAA,CAAArgB,EAAAqgB,MAAA,CACAjD,GAAApd,IAAA,EAAAA,EAAA4e,SAAA,GACAxB,EAAApd,EAAA4e,SAAA,CACA5e,EAAAqd,QAAA,IAEA,MACA,KAAA3V,GAAA,CAAA8U,OAAAxc,EAAA,CAYA,GATA,KAAAmgB,WAAA,CAAAzf,EAAAyf,WAAA,OAAAA,WAAA,gBACAzf,CAAAA,EAAAqc,OAAA,QAAAA,OAAA,GACA,MAAAA,OAAA,KAAAD,EAAApc,EAAAqc,OAAA,GAEA,KAAAgD,MAAA,CAAAD,EAAApf,EAAAqf,MAAA,OAAAA,MAAA,SACA,KAAAK,IAAA,CAAA1f,EAAA0f,IAAA,OAAAA,IAAA,OACA,KAAAC,MAAA,CAAA3f,EAAA2f,MAAA,OAAAA,MAAA,MAAAC,QAAA,MAGA,cAAAP,MAAA,gBAAAA,MAAA,GAAA3C,EACA,6DAEA,KAAAuB,SAAA,CAAAvB,EAAA,CAOA,SAAAjI,EAAAiI,CAAA,EACA,IAAAmD,EAAA,IAAAxB,SAYA,OAXA3B,EACAoD,IAAA,GACAvJ,KAAA,MACA1N,OAAA,UAAAkX,CAAA,EACA,GAAAA,EAAA,CACA,IAAAxJ,EAAAwJ,EAAAxJ,KAAA,MACA5X,EAAA4X,EAAAiB,KAAA,GAAAwI,OAAA,YACA5hB,EAAAmY,EAAApY,IAAA,MAAA6hB,OAAA,YACAH,EAAAvD,MAAA,CAAA2D,mBAAAthB,GAAAshB,mBAAA7hB,GACO,IAEPyhB,CAAA,CAGA,SAAAK,EAAAC,CAAA,EACA,IAAA9D,EAAA,IAAAD,EAYA,OARAgE,EADAJ,OAAA,qBACAzJ,KAAA,UAAA1N,OAAA,UAAAwX,CAAA,EACA,IAAAC,EAAAD,EAAA9J,KAAA,MACAlY,EAAAiiB,EAAA9I,KAAA,GAAAsI,IAAA,GACA,GAAAzhB,EAAA,CACA,IAAAD,EAAAkiB,EAAAniB,IAAA,MAAA2hB,IAAA,GACAzD,EAAAC,MAAA,CAAAje,EAAAD,EACK,IAELie,CAAA,CAKA,SAAAkE,EAAAC,CAAA,CAAAxgB,CAAA,EACAA,GACAA,CAAAA,EAAA,IAGA,KAAA1B,IAAA,WACA,KAAAoL,MAAA,CAAA1J,KAAAP,IAAAO,EAAA0J,MAAA,KAAA1J,EAAA0J,MAAA,CACA,KAAA+W,EAAA,MAAA/W,MAAA,YAAAA,MAAA,KACA,KAAAgX,UAAA,gBAAA1gB,EAAAA,EAAA0gB,UAAA,MACA,KAAArE,OAAA,KAAAD,EAAApc,EAAAqc,OAAA,EACA,KAAArV,GAAA,CAAAhH,EAAAgH,GAAA,KACA,KAAAiX,SAAA,CAAAuC,EAAA,CAjDAhB,EAAArV,SAAA,CAAAwW,KAAA,WAA8B,CAC9B,WAAAnB,EAAA,MAAA9C,KAAA,KAAAwB,SAAA,IAkCAF,EAAA3T,IAAA,CAAAmV,EAAArV,SAAA,EAgBA6T,EAAA3T,IAAA,CAAAkW,EAAApW,SAAA,EAGAoW,EAAApW,SAAA,CAAAwW,KAAA,YACA,WAAAJ,EAAA,KAAArC,SAAA,EACAxU,OAAA,KAAAA,MAAA,CACAgX,WAAA,KAAAA,UAAA,CACArE,QAAA,IAAAD,EAAA,KAAAC,OAAA,EACKrV,IAAA,KAAAA,GAAA,EACL,EAGAuZ,EAAA3e,KAAA,YACA,IAAAgf,EAAA,IAAAL,EAAA,MAAA7W,OAAA,EAAAgX,WAAA,KAEA,OADAE,EAAAtiB,IAAA,SACAsiB,CAAA,EAEA,IAAAC,EAAA,sBAGAN,EAAAO,QAAA,UAAA9Z,CAAA,CAAA0C,CAAA,EACA,GAAAmX,KAAAA,EAAAjF,OAAA,CAAAlS,GACA,wCAGA,WAAA6W,EAAA,MAAA7W,OAAAA,EAAA2S,QAAA,CAAA0E,SAAA/Z,CAAA,KAGAtL,EAAAmf,YAAA,CAAA5f,EAAA4f,YAAA,CACA,IACI,IAAAnf,EAAAmf,YAAA,CACJ,MAAAzU,EAAA,CACA1K,EAAAmf,YAAA,UAAA9c,CAAA,CAAAY,CAAA,EACA,KAAAZ,OAAA,CAAAA,EACA,KAAAY,IAAA,CAAAA,EACA,IAAAiD,EAAAwH,MAAArL,EACA,MAAAijB,KAAA,CAAApf,EAAAof,KAAA,EAEAtlB,EAAAmf,YAAA,CAAA1Q,SAAA,CAAA1L,OAAA8C,MAAA,CAAA6H,MAAAe,SAAA,EACAzO,EAAAmf,YAAA,CAAA1Q,SAAA,CAAAxM,WAAA,CAAAjC,EAAAmf,YAAA,CAGA,SAAAD,EAAAtb,CAAA,CAAA2hB,CAAA,EACA,WAAArE,QAAA,SAAAI,CAAA,CAAAH,CAAA,MAAAqE,EAAA,IAAA1B,EAAAlgB,EAAA2hB,GAGA,GAAAC,EAAAvB,MAAA,EAAAuB,EAAAvB,MAAA,CAAAwB,OAAA,CACA,OAAAtE,EAAA,IAAAnhB,EAAAmf,YAAA,0BAEA,IAAAuG,EAAA,IAAAC,eAGA,SAAAC,GAAA,CACAF,EAAAG,KAAA,GAGAH,EAAAnE,MAAA,YACA,IAAAjd,EAAA,CACA0J,OAAA0X,EAAA1X,MAAA,CACAgX,WAAAU,EAAAV,UAAA,CACArE,QAAA6D,EAAAkB,EAAAI,qBAAA,OACA,CACAxhB,CAAAA,EAAAgH,GAAA,iBAAAoa,EAAAA,EAAAK,WAAA,CAAAzhB,EAAAqc,OAAA,CAAAoC,GAAA,kBACA,IAAA/B,EAAA,aAAA0E,EAAAA,EAAAR,QAAA,CAAAQ,EAAAM,YAAA,CACA1E,EAAA,IAAAuD,EAAA7D,EAAA1c,GAAA,EAGAohB,EAAAlE,OAAA,YACAL,EAAA,sCAGAuE,EAAAO,SAAA,YACA9E,EAAA,sCAGAuE,EAAAQ,OAAA,YACA/E,EAAA,IAAAnhB,EAAAmf,YAAA,2BAEAuG,EAAAS,IAAA,CAAAX,EAAA7B,MAAA,CAAA6B,EAAAla,GAAA,KAGAka,YAAAA,EAAAzB,WAAA,CACQ2B,EAAAU,eAAA,IACR,SAAAZ,EAAAzB,WAAA,EACA2B,CAAAA,EAAAU,eAAA,KAGA,iBAAAV,GAAAtG,EAAAlB,IAAA,EACAwH,CAAAA,EAAAW,YAAA,SAGAb,EAAA7E,OAAA,CAAAxT,OAAA,UAAAzK,CAAA,CAAAO,CAAA,EACOyiB,EAAAY,gBAAA,CAAArjB,EAAAP,EAAA,GAGP8iB,EAAAvB,MAAA,GAAAuB,EAAAvB,MAAA,CAAAsC,gBAAA,SAAAX,GAGAF,EAAAc,kBAAA,YAEA,IAAAd,EAAAe,UAAA,EACAjB,EAAAvB,MAAA,CAAAyC,mBAAA,SAAAd,EAEA,GAGKF,EAAAiB,IAAA,UAAAnB,EAAAhD,SAAA,MAAAgD,EAAAhD,SAAA,CACL,GAEAtD,EAAA0H,QAAA,IAGArnB,EAAA2f,KAAA,GACA3f,EAAA2f,KAAA,CAAAA,EACA3f,EAAAmhB,OAAA,CAAAA,EACAnhB,EAAAukB,OAAA,CAAAA,EACAvkB,EAAAslB,QAAA,CAAAA,GAGA7kB,EAAA0gB,OAAA,CAAAA,EACA1gB,EAAA8jB,OAAA,CAAAA,EACA9jB,EAAA6kB,QAAA,CAAAA,EAAA7kB,EAAAkf,KAAA,CAAAA,EAE8Dnc,OAAA8L,cAAA,CAAA7O,EAAA,cAAA0C,MAAA,IAK9D,EAAC,IAEDxC,EAAAgf,KAAA,CAAA2H,QAAA,IAEA,OAAA3mB,EAAAgf,KAAA,CAAA0H,QAAA,CAKA5mB,CADAA,EAAAG,CADAA,EAAAD,GACAgf,KAAA,EACA4H,OAAA,CAAA3mB,EAAA+e,KAA2B,CAC3Blf,EAAAkf,KAAA,CAAA/e,EAAA+e,KAAA,CACAlf,EAAA0gB,OAAA,CAAAvgB,EAAAugB,OAAA,CACA1gB,EAAA8jB,OAAA,CAAA3jB,EAAA2jB,OAAA,CACA9jB,EAAA6kB,QAAA,CAAA1kB,EAAA0kB,QAAA,CACA9kB,EAACC,OAAA,CAAAA,EAED,IAAAkf,GAAA3Q,GAAAyQ,GAAAhf,OAAA,EAQA,eAAAk/D,GAAAt3D,CAAA,CAAAm3C,CAAA,CAAA+5B,EAAsD,GACtD,IAAAxtE,EAAA,sCAAAyzC,EAAA91C,QAAA,mBAAA6vE,EAAA,EACA,CAAAha,EAAAia,EAAA,OAAA73D,QAAAqkC,GAAA,EACA8Z,GAAAz3D,EAAAm3C,GACA7/B,GAAA5T,GACA,EAEA0tE,EAAA,OAAAD,EAAA51D,IAAA,IAAAmH,MAAA,KAAAtR,EAAAyM,OAAA,EAAAzM,UAAAA,EAAAiyC,KAAA,EAAAjyC,aAAAA,EAAAmmD,QAAA,EACA,GAAA6Z,IAAAA,EAAA93E,MAAA,CACA,YAGA,IAAAorD,EAAA0sB,CAAA,WAEA,EAAAvuE,IAAA,CAAA6T,QAAA,KAAAguC,EAAA8S,aAAA,CACA,KAGA9S,CAFA,CAQA,eAAA+S,GAAAz3D,CAAA,CAAAm3C,CAAA,EACA,IAAA8L,EAAA,MAAAjjD,EAAA0/C,cAAA,CAAAvI,GACA,GAAA8L,IAAA,GAAAA,EACA,yCAEA,IAAA2J,QAAAA,CAAA,EAAArtC,GAAA0jC,EAAAnpD,IAAA,EACAu3E,EAAA,MAAArxE,EAAA0/C,cAAA,CAAAkN,EAAAqK,kBAAA,EACA,GAAAoa,IAAA,GAAAA,EACA,8CAEA,IAAAna,YAAAA,CAAA,EAAA33C,GAAA8xD,EAAAv3E,IAAA,EACA,OAAAo9D,CACA,CACA,IAAI/3C,GAAAtmB,EAAYumB,QAAA,EACZvmB,EAAAmB,MAAY,GAAE,kBACdnB,EAAAmB,MAAY,EAAEnB,EAAAwmB,MAAA,CAAAxmB,EAAeoB,SAAA,kCAC7BpB,EAAAmB,MAAY,EAAAnB,EAAAoB,SAAA,mCAChBpB,EAAQmB,MAAA,CAAS,CACTnB,EAAAymB,GAAA,SACRzmB,EAAAwmB,MAAA,CAAAxmB,EAAAoB,SAAA,8BACA,gBACA,CAAAkC,KAAAA,EAAAtD,EAAAsd,GAAA,IACA,SAAAoJ,GAAAzlB,CAAA,EACA,OAAAqlB,GAAAhO,MAAA,CAAArX,EAAA,CAUA,IAAAL,GAAA0B,OAAAquD,MAAA,EACAC,UAAA,KACAqF,OAAAA,GACAsI,IAAAA,GACAn9D,UAAA8kD,GACAtiC,MAAA2sD,EACA/+C,MAAAA,GACAgtC,SAAAA,GACCxiD,SAfD1Z,OAAAquD,MAAA,EACAC,UAAA,KACA6N,cAAAA,GACAG,UAAAA,GACCl4C,6BAAAA,EAAA,EAWA,GAGD,SAAA+xD,GAAAC,CAAA,EACA,mBAAAA,CACA,CAEA,eAAAC,GAAwBr6B,CAAA,EACxB,IAAAzO,EAAiB,OAAAlwC,EAAA0e,SAAA,CAAA6kC,kBAAwB,IAAA5E,EAAA,KACzC,aAAA3+C,EAAA0e,SAAA,CAAAwmD,cAAA,CAAAh1B,EAAAyrB,KAAAhd,EACA,CAEA,SAAAgd,IAAA,CACA,kBACA,CACA,IAAIsd,GAAA54E,EAAemB,MAAA,EACfnB,EAAAoB,SAAW,cACfpB,EAAAqB,KAAA,SACA,EACA,SAAAw3E,GAAA53E,CAAA,EACA,OAAA23E,GAAAtgE,MAAA,CAAArX,EAAA,CAGA,SAAA0uE,GAAAc,CAAA,CAAA1nE,CAAA,EACA,IAAAf,EAAAgD,EACA,IAAAnH,EAAA,GACAi1E,EAAArI,EAAA1nE,IAAA,CAAA0nE,EAAA1nE,IAAA,CAAAtI,MAAA,GACA,GAAAsI,EAAAtI,MAAA,CAAAq4E,EAAA,CACA,GAAA/vE,EAAAtI,MAAA,GAAAq4E,EAAA,EACA,2CAAA/vE,EAAA,kBAAA0nE,MAAAA,EAAA,OAAAA,EAAAjuE,IAAA,sBAAAwI,CAAAA,EAAA,OAAAhD,CAAAA,EAAAyoE,EAAA1nE,IAAA,GAAAf,KAAA,IAAAA,EAAA,OAAAA,EAAAtH,GAAA,IAAArB,EAAAmD,IAAA,IAAAwI,KAAA,IAAAA,EAAAA,EAAA,MAEAnH,EAAAkF,EAAAsqD,GAAA,EACA,OACA,CAAAtqD,EAAAlF,EAAA,CAGA,MAAAk1E,GACA,OAAAltB,MAAA4kB,CAAA,CAAAuI,CAAA,CAAA16B,CAAA,EACA,GAAAmyB,WAAAA,EAAAjuE,IAAA,CACA,UAAAwsE,GAAA,+BAEA,IAAAhjB,EAAA,IAAAjjD,IAAA,CACA,IAAAkwE,EAAAv5E,EAAA,CAAAiwE,GAAAc,EAAA,IAAA1nE,EAAA,EACA+mE,EAAAW,EAAAhpE,QAAA,CAAA/H,EAAA+H,QAAA,EACAyxE,IAAAnwE,EAAA,CACA,IAAAxC,EAAAylD,EAAAvkD,QAAA,CAAA/H,EAAA+H,QAAA,EAOA,OANAnE,KAAAA,IAAA5D,EAAAq/D,iBAAA,EACAx4D,EAAAxH,IAAA,IAAAW,EAAAq/D,iBAAA,EAEA3L,GAAA,eACA7pD,QAAA2qD,GAAA,2BAAA3tD,GAEA,IAAA5G,EAAA2mD,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACar9C,KAAA+3E,EAAAvI,EAAAjuE,IAAA,CAAAotE,EAAAa,KAAAwI,GACb,EACA,EAKA,OAHAjtB,EAAA,YACA+sB,GAAA/Z,aAAA,CAAAma,EAAA1I,EAAAhpE,QAAA,CAAA62C,EAAAmyB,EAAAjuE,IAAA,EAEAwpD,CACA,CACA,OAAAgT,cAAAt/D,CAAA,CAAA+H,CAAA,CAAA62C,CAAA,CAAA61B,CAAA,SACA,EAGA1sE,EACA/G,GAAA,KAEA,IAAA04E,EAAA,aAAAv+D,EAAAA,EAAApT,QAAA,CAAAnE,KAAAA,CAAA,CACA,GAAA81E,KAAA91E,IAAA81E,EAAA,CACA,IAAAC,EAAA35E,CAAA,CAAAmb,EAAArY,IAAA,EACA,OAAAu2E,GAAA/Z,aAAA,CAAAqa,EAAAx+D,EAAApT,QAAA,CAAA62C,EAAA61B,GAAAhtB,IAAA,EACA,CAkBS,KAfTjB,EADA,IAAAx+C,EAAAmT,EAEA,IACAqrC,EAAAnD,EAAArjD,CAAA,CAAAmb,EAAArY,IAAA,EACA,CACA,MAAAyH,EAAA,CACA,6CAAA4Q,EAAArY,IAAA,uCAAA2xE,KAAA7wE,IAAA6wE,EAAA,qBAAAA,EAAA,yCAEA,IAAA9tE,EAAAqB,EAAA4xE,UAAA,EAAApzB,EAAAxB,MAAA,CAAApG,GACA8H,EAAA1+C,EAAAu3D,KAAA,GAAA54D,EACA8/C,EAAAz+C,EAAAy+C,QAAA,GAAA9/C,EACA,OACA6/C,OAAAA,EACAE,WAAAA,EACAD,SAAAA,CACA,CACS,CACT,GACAgB,IAAA,GA7BA,GA+BA,CAMA,MAAAoyB,GACA,OAAA1tB,MAAA4kB,CAAA,CAAA+I,CAAA,EACA,IAAAC,EAAA,IAAA1wE,IAAA,CACA,IAAAf,EAAAgD,EAAAC,EACA,KAAAvL,EAAA,CAA2BiwE,GAAAc,EAAA,IAAA1nE,EAAA,EAC3BhI,EAAA,IAAApB,EAAAosD,WAAA,CACA,GAAArsD,EAAA0/D,eAAA,EAAA1/D,EAAAq/C,YAAA,CACA,+DAMA,OAJA,OAAA/2C,CAAAA,EAAAtI,EAAA0/D,eAAA,GAAAp3D,KAAA,IAAAA,GAAAA,EAAA0E,OAAA,IAAA3L,EAAA+D,GAAA,CAAAknD,IACA,OAAAhhD,CAAAA,EAAAtL,EAAAq/C,YAAA,GAAA/zC,KAAA,IAAAA,GAAAA,EAAA0B,OAAA,IAAA3L,EAAA+D,GAAA,CAAAknD,IACAjrD,EAAA+D,GAAA,CAAA00E,KAAAzwE,IACA,OAAAkC,CAAAA,EAAAvL,EAAA2/D,gBAAA,GAAAp0D,KAAA,IAAAA,GAAAA,EAAAyB,OAAA,IAAA3L,EAAA+D,GAAA,CAAAknD,IACAjrD,CACA,EACA,OAAA04E,CACA,EAGA,MAAAC,GACA,OAAA7tB,MAAA4kB,CAAA,CAAAgJ,CAAA,CAAAnH,CAAA,CAAAhmB,CAAA,EACA,IAAAiS,EAAA,SAAAx1D,IAAA,CACA,IAAAf,EACA,IAAAjH,EAAA04E,KAAA1wE,GACA,EAAArJ,EAAA,CAAAiwE,GAAAc,EAAA,IAAA1nE,EAAA,EACA,GAAAujD,KAAAhpD,IAAAgpD,EAAAvhD,cAAA,CACA,mFAEA,IACA,aAAAuhD,EAAAvhD,cAAA,CAAAhK,EAAA,OAAAiH,CAAAA,EAAAtI,EAAAoI,OAAA,GAAAE,KAAA,IAAAA,EAAAA,EAAA,GAAAtI,EAAAmE,OAAA,CACA,CACA,MAAAoG,EAAA,CACA,MAAA4lE,GAAA5lE,EAAAqoE,EAAA,CAEA,EACA,OAAA/T,CACA,EAGA,MAAAob,GACA,OAAA9tB,MAAAsJ,CAAA,CAAAmK,CAAA,CAAAhhB,CAAA,CAAAgO,CAAA,EACA,IAAAtkD,EACA,IAAA4xE,EAAA,GAKA,OAJA,IAAyB,GAAzB5xE,CAAAA,EAAAmtD,EAAA1tD,QAAyB,GAAAO,KAAA,IAAAA,GAAAA,EAAA0E,OAAS,KAClC,IAAAlK,EAAAwtE,IAAAsF,EAAA9yE,IAAA,CACSo3E,CAAAA,CAAA,CAAAp3E,EAAA,KAAAgsE,GAAArZ,EAAAmgB,EAAAh3B,EAAAgO,EAAAgT,EACT,GACAsa,CACA,CACA,CACA,MAAApL,GAIA,IAAApuE,MAAA,CACA,YAAAigE,KAAA,CAKA,IAAA/hB,WAAA,CACA,YAAAkhB,UAAA,CAKA,IAAAlT,UAAA,CACA,YAAA7+C,SAAA,CAKA,IAAA6xD,OAAA,CACA,YAAAc,MAAA,CAKA,IAAAkV,YAAA,CACA,YAAAnV,WAAA,CAEA3+D,YAAA2zD,CAAA,CAAAmgB,CAAA,CAAAh3B,CAAA,CAAAgO,CAAA,CAAAgT,CAAA,EACA,KAAAa,WAAA,CAAAmV,EACA,KAAA9V,UAAA,CAAAlhB,EACA,KAAA7wC,SAAA,CAAA6+C,MAAAA,EAAAA,EAAAkjB,IAAA,CACA,KAAApP,MAAA,CAAAd,MAAAA,EAAAA,EAAA,IAAAoP,GAAAvZ,EAAA,CACA,KAAAkL,KAAA,MAAAD,MAAA,CAAA34D,QAAA,CAAArH,IAAA,CAAAk1E,EACA,CAMA,MAAAhV,cAAuBxhB,CAAA,CAAAx3C,CAAA,EACvB,IAAArG,KAAAA,CAAA,aAAA44E,uBAAA,CAAA/6B,EAAAx3C,GACA,OAAArG,CACA,CAMA,MAAA44E,wBAAA/6B,CAAA,CAAAx3C,CAAA,EACA,IAAA8iD,EAAgB,MAAiB,KAAA0vB,wBAAA,CAAAh7B,EAAAx3C,GACjC,CAAArF,MAAAA,CAAA,CAAAwB,QAAAA,CAAA,EAAA2mD,EACA,OACAnpD,KAAAgB,GAAAA,IAAAA,EAAAhB,IAAA,CAAAR,MAAA,CACA,KAAA2/D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAP,EAAAhB,IAAA,EACA,KACAwC,QAAAA,CACA,CACA,CAMA,MAAAgb,MAAgBqgC,CAAO,CAAAx3C,CAAA,EACvB,IAAArG,KAAAA,CAAA,aAAA44E,uBAAA,CAAA/6B,EAAAx3C,GACA,GAAArG,IAAA,GAAAA,EACA,qDAAA69C,EAAAt2C,QAAA,MAEA,OAAAvH,CACA,CAMA,MAAA84E,gBAAgBj7B,CAAgB,CAAAx3C,CAAA,EAChC,IAAArG,KAAAA,CAAA,CAAAwC,QAAAA,CAAA,aAAAo2E,uBAAA,CAAA/6B,EAAAx3C,GACA,GAAArG,IAAA,GAAAA,EACA,sCAAA69C,EAAAt2C,QAAA,MAEA,OAAAvH,KAAAA,EAAAwC,QAAAA,CAAA,CACA,CAOA,MAAA88D,cAAA53D,CAAA,CAAArB,CAAA,EACA,IAAAG,EAAA,WAAAuyE,uBAAA,CAAArxE,EAAArB,GACA,OAAAG,EAAA/G,GAAA,IAAAgH,EAAAA,EAAAzG,IAAA,MACA,CAOA,MAAA+4E,wBAAArxE,CAAA,CAAArB,CAAA,EACA,IAAAG,EAAA,MAAAmpE,GAAA,KAAAnjE,SAAA,CAAAtG,UAAA,CAAAwB,EAAAjI,GAAA,IAAAqiD,EAAAjE,IAAAx3C,GAEA,OAAAG,EAAA/G,GAAA,KACA,GAAA8C,IAAA,EAAAA,EACA,YAEA,IAAAkE,QAAAA,CAAA,CAAAjE,QAAAA,CAAA,EAAAD,EACA,OACAvC,KAAA,KAAAm/D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAkF,EAAAzG,IAAA,EACAwC,QAAAA,CACS,CACT,EACA,CAeA,MAAAqhD,IAAA2b,CAAA,EACA,IAAA52C,EAAA,KAAAy1C,KAAA,CAAA73D,QAAA,CAAAgvD,MAAA,MAAA0J,WAAA,CAAA39D,IAAA,CAAAi+D,aAAAxgE,EAAAwgE,EAAAn9D,KAAAA,CAAA,EACA22E,EAAA,GAaA,MAZApwD,CAAAA,MAAAA,EAAA,OAAAA,EAAArR,MAAA,GAAAlV,KAAAA,GAAA,CAAAumB,MAAAA,EAAA,OAAAA,EAAAjG,KAAA,GAAAtgB,KAAAA,GACA22E,EAAAl7E,IAA0B,EACb03D,OAAA,CAAAj+C,OAAAqR,EAAArR,MAAA,CAAAoL,MAAAiG,EAAAjG,KAAA,CACb,GAEAiG,CAAAA,MAAAA,EAAgC,OAA2BA,EAAAoxC,QAAA,GAAA33D,KAAAA,GAC3D22E,EAAAl7E,IAAA,EAAAk8D,SAAApxC,EAAAoxC,QAAA,GAMAif,CAJA,WAAAzsE,SAAA,CAAAtG,UAAA,CAAAq5D,kBAAA,MAAAhB,UAAA,EACAl4D,WAAA,KAAAmG,SAAA,CAAAtG,UAAA,CAAAG,UAAA,CACSm5D,QAAA,IAAAwZ,KAAA55E,MAAA6D,OAAA,CAAAu8D,GAAAA,EAAA,KACT,EACA//D,GAAA,GAAAwlD,OAAAA,CAAA,CAAAx+C,QAAAA,CAAA,IACA,EACAtG,UAAA8kD,EACAx+C,QAAA,KAAA04D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAkF,EAAAzG,IAAA,CACS,GAET,CAKA2+D,UAAA9gB,CAAA,CAAAx3C,CAAA,EACA,IAAAw5C,EAAAq5B,GAAA73D,GAAA,CAAAw8B,EAAAt2C,QAAA,IACA,GAAAs4C,EACA,OAAAA,EAAA4W,EAAA,CAEA,IAAAA,EAAA,GAAA0Y,CAAAA,GAAA,EACAtxB,EAAAiE,EAAAjE,GACA,IAAAihB,EAAA,KAAAtyD,SAAA,CAAAtG,UAAA,CAAA04D,eAAA,CAAA/gB,EAAA,IACA,IAAAp3C,EAAA,KAAA04D,MAAA,CAAA34D,QAAA,CAAA6Q,MAAA,MAAA6nD,WAAA,CAAA39D,IAAA,CAAAqY,EAAA5Z,IAAA,EACSy2D,EAAAoI,IAAA,UAAAp4D,EACT,EAAAJ,GAKA,OAJA6yE,GAAAv1E,GAAA,CAAAk6C,EAAAt2C,QAAA,IACAkvD,GAAAA,EACSqI,SAAAA,CACT,GACArI,CACA,CAIA,MAAAsI,YAAAlhB,CAAA,EACA,IAAAgC,EAAAq5B,GAAA73D,GAAA,CAAAw8B,EAAAt2C,QAAA,IACA,IAAAs4C,EAAA,CACAv3C,QAAAo3D,IAAA,8BACA,MACA,KAEA,WAAAlzD,SAAA,CAAAtG,UAAA,CACA84D,2BAAA,CAAAnf,EAAAif,QAAA,EACAv9C,IAAA,MACa23D,GAAAnc,MAAA,CAAAlf,EAAAt2C,QAAA,GACb,GACA03D,KAAA,CAAA32D,QAAA9D,KAAA,CAEA,CAIA,MAAAm7D,kBAAAr1D,CAAA,CAAA6uE,CAAA,EACA,IAAAh6E,EAAA,KAAAA,IAAA,CACA,QAAAkD,IAAA,KAAAmK,SAAA,CAAArM,SAAA,CACA,sGAEA,OAAAzB,EAAAq+C,aAAA,CAAAC,aAAA,EACAC,WAAA,KAAAzwC,SAAA,CAAArM,SAAA,CACA+8C,iBAAA5yC,EAAAnK,SAAA,CACAg9C,MAAAg8B,MAAAA,EAAAA,EAAAh6E,CAAA,CACAgK,SAAA,WAAAqD,SAAA,CAAAtG,UAAA,CAAA05D,iCAAA,CAAAuZ,MAAAA,EAAAA,EAAAh6E,CAAA,EACSk+C,UAAA,KAAAkhB,UAAA,EAET,CAOA,MAAA/B,WAAA,GAAA10D,CAAA,EACA,IAAAsxE,EAAA,WAAAvc,iBAAA,IAAA/0D,GACA,kBAAA0V,KAAA,CAAA47D,EACA,CAOA,MAAAvc,kBAAA,GAAA/0D,CAAA,EACA,aAAA00D,GAAA,KAAA+B,UAAA,IAAAz2D,EACA,CACA,MAAA89C,eAAA/H,CAAA,CAAAx3C,CAAA,EACA,kBAAAmG,SAAA,CAAAtG,UAAA,CAAA0/C,cAAA,CAAA9D,EAAAjE,GAAAx3C,EACA,CACA,MAAAwyE,yBAAAh7B,CAAA,CAAAx3C,CAAA,EACA,kBAAAmG,SAAA,CAAAtG,UAAA,CAAA2yE,wBAAA,CAAA/2B,EAAAjE,GAAAx3C,EACA,CACA,CACA,IAAA6yE,GAAA,IAAAx1E,IAGA21E,GAAA,gBACAC,GAAA,iBACAC,GAAAF,GAAA75E,MAAA,CACAg6E,GAAAF,GAAA95E,MAAA,OACAquE,GACAttE,YAAA88C,CAAA,CAAAgO,CAAA,CAAAgT,CAAA,EACA,KAAAE,UAAA,CAAAlhB,EACA,KAAA7wC,SAAA,CAAA6+C,EACA,KAAA0U,YAAA,KAAA+N,GAAAzwB,EAAAghB,GACA,KAAA2B,eAAA,KAAAt8D,IACA,KAAAu8D,eAAA,KAAAv8D,IACA,KAAAw8D,gBAAA,EACA,CACAr7C,iBAAAqwD,CAAA,CAAArzD,CAAA,EACA,IAAA9a,EACA,IAAA+3D,EAAA,KAAAoB,gBAAA,QACA,KAAAA,gBAAA,IAEA,KAAAD,eAAA,CAAAr+C,GAAA,CAAAszD,IACA,KAAAjV,eAAA,CAAAt8D,GAAA,CAAAuxE,EAAA,IAEA,KAAAjV,eAAA,CAAAt8D,GAAA,CAAAuxE,EAAA,QAAAnuE,CAAAA,EAAA,KAAAk5D,eAAA,CAAA5+C,GAAA,CAAA6zD,EAAA,GAAAnuE,KAAA,IAAAA,EAAAA,EAAA,IAAA2tB,MAAA,CAAAoqC,IAEA,KAAAkB,eAAA,CAAAr8D,GAAA,CAAAm7D,EAAA,CAAAoW,EAAArzD,EAAA,EAEAxf,KAAAA,IAAA,KAAA89D,qBAAA,EAGA,MAAAA,qBAAA,MAAA3zD,SAAA,CAAAtG,UAAA,CAAAk6D,MAAA,MAAA7B,UAAA,EAAAp2D,EAAA1J,IAAA,CACA,IAAA0J,EAAAa,GAAA,CAGA,QAAA+rE,KAAA,KAAAhV,YAAA,CAAAM,SAAA,CAAAl4D,EAAAA,IAAA,GACA,IAAAsxE,EAAA,KAAAxZ,eAAA,CAAA5+C,GAAA,CAAA0zD,EAAAxzE,IAAA,EACAk4E,GACAA,EAAAhuE,OAAA,KACA,IAAAiuE,EAAA,KAAA1Z,eAAA,CAAA3+C,GAAA,CAAAy9C,GACA,GAAA4a,EAAA,CACA,KAAA73D,EAAA,CAAA63D,EACA73D,EAAAkzD,EAAA/0E,IAAA,CAAAvB,EAAAsK,IAAA,CAAAZ,EAAA4C,SAAA,CACqB,GAGZ,CAZT,EAaA,EAlBA+zD,CAoBA,CACA,MAAA95C,oBAAA85C,CAAA,EAEA,IAAAj9C,EAAA,KAAAm+C,eAAA,CAAA3+C,GAAA,CAAAy9C,GACA,IAAAj9C,EACA,8BAAAi9C,EAAA,kBAEA,IAAAoW,EAAA,CAAArzD,EAEA83D,EAAA,KAAA1Z,eAAA,CAAA5+C,GAAA,CAAA6zD,GACA,IAAAyE,EACA,+CAAAzE,EAAA,IAUA,GAPA,KAAAlV,eAAA,CAAAjD,MAAA,CAAA+B,GACA6a,EAAAA,EAAA/wD,MAAA,IAAA2iB,IAAAuzB,GACA,KAAAmB,eAAA,CAAAt8D,GAAA,CAAAuxE,EAAAyE,GACA,IAAAA,EAAAn6E,MAAA,EACA,KAAAygE,eAAA,CAAAlD,MAAA,CAAAmY,GAGA,SAAAlV,eAAA,CAAA7gE,IAAA,EACA,YAAA8gE,eAAA,CAAA9gE,IAAA,CACA,kEAAA8gE,eAAA,CAAA9gE,IAAA,SAEAkD,IAAA,KAAA89D,qBAAA,GACA,WAAA3zD,SAAA,CAAAtG,UAAA,CAAAo6D,oBAAA,MAAAH,qBAAA,EACA,KAAAA,qBAAA,CAAA99D,KAAAA,EAEA,EAEA,CACA,MAAAyrE,GACAvtE,YAAA88C,CAAA,CAAAghB,CAAA,EACA,KAAAA,KAAA,CAAAA,EACA,KAAAhhB,SAAA,CAAAA,CACA,CAYA,CAAAgjB,UAAAl4D,CAAA,CAAAyxE,EAAA,IACA,IAAAC,EAAA,IAAAC,GAAA3xE,GACA4xE,EAAA,IAAAC,GACA/mB,EAAA4mB,EAAAz3E,IAAA,GACA,KAAA6wD,IAAA,GAAAA,GAAA,CACA,IAAA8hB,EAAAkF,EAAAC,EAAA,MAAAzZ,SAAA,CAAAsZ,EAAA9mB,EAAA2mB,GACA7E,GACA,OAAAA,CAAA,EAEAkF,GACAF,EAAAj8E,IAAA,CAAAm8E,GAEAC,GACAH,EAAA3nB,GAAA,GAEAa,EAAA4mB,EAAAz3E,IAAA,EACA,CACA,CAKAq+D,UAAAsZ,CAAA,CAAA9mB,CAAA,CAAA2mB,CAAA,SAEA,EAAAh2D,KAAA,CAAApkB,MAAA,IACAu6E,EAAAjnB,OAAA,UAAAzV,SAAA,CAAA91C,QAAA,GACA,KAAAm5D,gBAAA,CAAAzN,EAAA2mB,GAIA,cAAAjZ,eAAA,CAAA1N,GAAA,CAIAyN,iBAAAzN,CAAA,CAAA2mB,CAAA,EAEA,IAAA3mB,CAAAA,EAAAL,UAAA,CAAAymB,KAAApmB,EAAAL,UAAA,CAAA0mB,GAAA,EAYA,oBAAA3Y,eAAA,CAAA1N,GAAA,EAXA,IAAAknB,EAAAlnB,EAAAL,UAAA,CAAAymB,IACApmB,EAAArzD,KAAA,CAAA25E,IACAtmB,EAAArzD,KAAA,CAAA45E,GAAA,CACAzE,EAAA,KAAA1W,KAAA,CAAA5I,MAAA,CAAAp+C,MAAA,CAAA8iE,GACA,GAAAP,GAAA7E,IAAA,GAAAA,EACA,sCAAAoF,EAAA,GAEA,OAAApF,EAAA,SAMA,CAEApU,gBAAA1N,CAAA,EAEA,IAAAmnB,EAAAnnB,EAAA95C,KAAA,gBAEA,OAAAihE,EAAA1+C,KAAA,2BACA,UAGA0+C,EAAAxnB,UAAA,iBAAAvV,SAAA,CAAA91C,QAAA,aACA,MAAA81C,SAAA,CAAA91C,QAAA,OAGA6yE,EAAApnB,QAAA,CAAmC,UACnC,WAGA,UAGA,CAGA,MAAAgnB,GACAz5E,aAAA,CACA,KAAAqjB,KAAA,IAEAkvC,SAAA,CACA,SAAAlvC,KAAA,CAAApkB,MAAA,CACA,mDAEA,YAAAokB,KAAA,MAAAA,KAAA,CAAApkB,MAAA,IAEA1B,KAAAm8E,CAAA,EACA,KAAAr2D,KAAA,CAAA9lB,IAAA,CAAAm8E,EACA,CACA7nB,KAAA,CACA,SAAAxuC,KAAA,CAAApkB,MAAA,CACA,mDAEA,KAAAokB,KAAA,CAAAwuC,GAAA,EACA,CACA,CACA,MAAA0nB,GACAv5E,YAAA4H,CAAA,EACA,KAAAA,IAAA,CAAAA,CACA,CACA/F,MAAA,CACA,YAAA+F,IAAA,CAAA3I,MAAA,CACA,YAEA,IAAA+rC,EAAA,KAAApjC,IAAA,IAEA,OADA,KAAAA,IAAA,MAAAA,IAAA,CAAAvI,KAAA,IACA2rC,CACA,EAGA,MAAA8uC,GACA,OAAAzvB,MAAA4kB,CAAA,CAAAgJ,CAAA,CAAAnH,CAAA,CAAAhmB,CAAA,CAAAgT,CAAA,CAAAhhB,CAAA,CAAA6W,CAAA,EACA,IAAApoD,EAAA,SAAAhE,IAAA,KACAf,MAGAkyE,EAFA,IAAAn5E,EAAA04E,KAAA1wE,GACA,EAAArJ,EAAA,CAAAiwE,GAAAc,EAAA,IAAA1nE,EAAA,EAEA,GAAAujD,KAAAhpD,IAAAgpD,EAAAv/C,QAAA,CACA,6EAEA,IACAmtE,EAAA,MAAA5tB,EAAAv/C,QAAA,CAAAhM,EAAArB,EAAAoI,OAAA,QAAAE,CAAAA,EAAAtI,EAAAmE,OAAA,GAAAmE,KAAA,IAAAA,EAAA,OAAAA,EAAAV,UAAA,CACA,CACA,MAAA2C,EAAA,CACA,MAAA4lE,GAAA5lE,EAAAqoE,EAAA,CAEA,GAAA4H,KAAA52E,IAAA42E,EACA,8CAEA,IAAA9wE,EAAA8wE,EAAA9wE,IAAA,CACA,IAAAA,EACA,wCAEA,IAAAstD,EAAA,GACA,GAAAvB,EAAAuB,MAAA,CAEA,QAAAsf,KAAApvB,IADAmoB,GAAAzwB,EAAAghB,GACAgC,SAAA,CAAAl4D,GACAstD,EAAA33D,IAAA,CAAAi3E,EAEA,CACA,OAAAtf,OAAAA,EAAAj5B,IAAAr0B,CAAA,CACA,EACA,OAAA2D,CACA,EAGA,SAAA4Z,GAAAzO,CAAA,EACA,WAAA0O,GAAAnJ,GAAA,MAAAgJ,GAAAI,UAAA,CAAAtO,GAAA,GAAA1Y,EAAAye,QAAA,GAAApG,EACA,CACA,SAAA9W,GAAA8W,CAAA,EACA,WAAA0O,GAAAnJ,GAAA,WAAA9d,EAAA0e,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA,SAAA4O,GAAAzN,CAAA,CAAAnB,CAAA,EACA,WAAA6O,GAAA1N,EAAAnB,EACA,CACA,MAAA0O,WAAA7N,GACAvX,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,MAAAuO,WAAAhO,GACAvX,YAAA6X,CAAA,CAAAnB,CAAA,EACA,SAAAA,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAAyC,aAAA,CAAAwB,IACA,CACApc,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,UACA,MAAAC,EACA,KAAAY,MAAA,CAAApB,IAAA,MAAA6D,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,IAEA,KAAAsD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,GACA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAFA,CAIAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,YAEA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,EACA,OACA,8BAAAa,MAAA,CAAAnB,QAAA,EAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAA,IACA,CACA,CACA,MAAAiO,WAAArnB,IAIAkf,UAAA,CACA,IAAAjf,EAAkB,MAAM2nB,OAAA,GAAAC,OAAA,GACxB1O,EAAAtY,EAAA2d,IAAA,CAAAve,GACA,GAAAkZ,IAAAA,EAAA9X,MAAA,CACA,OAAA8X,CACA,CACA,GAAAA,EAAA9X,MAAA,IACA,6BAEA,IAAAymB,EAAAjnB,EAAAknB,KAAA,IAEA,OADA5O,EAAA6O,IAAA,CAAAF,GACAA,CACA,CAIA,OAAAL,WAAAjF,CAAA,EACA,GAAAA,IAAAA,EAAAnhB,MAAA,CACA,sCAAAmhB,EAAAnhB,MAAA,IAEA,WAAAgmB,GAAA,IAAA7E,EAAA,CACAqF,OAAA,GACAvmB,GAAA,SAAAmF,EAAA2C,QAAA,OAAA3H,KAAA,MACAmB,IAAA,QACA,CACA,CACA,IAAAu5E,GAAAp6E,GAAA,CACAC,GAAA,QACAA,GAAA,SACAulB,GAAA,UACAG,GAAA1lB,KAAA,YACA,KACA,IAAAimB,EAAAnK,GAAAG,GAAA,sBAAAiK,GAIK,OAHLD,EAAAxK,UAAA,GAAA1b,GAAA,qBACAkmB,EAAAxK,UAAA,GAAA1b,GAAA,mBACAkmB,EAAAxK,UAAA,GAAA1b,GAAA,cACKkmB,CACL,YACAP,GAAAH,KAAA,YACAA,GAAA,mBACAG,GAAA1lB,KAAA,kBACA,EACA,SAAAo6E,GAAAjjE,CAAA,EACA,OAAAgjE,GAAAjjE,MAAA,CAAAC,EAAA,CAIA,MAAAkjE,GACAj6E,YAAA0gE,CAAA,CAAAC,CAAA,CAAA10D,CAAA,CAAA+xD,CAAA,CAAA4C,CAAA,CAAAsZ,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,KAAAzZ,SAAA,CAAAA,EACA,KAAA10D,SAAA,CAAAA,EACA,KAAA+xD,UAAA,CAAAA,EACA,KAAA4C,MAAA,CAAAA,EACA,KAAAuZ,SAAA,CAAAA,EACA,KAAAC,eAAA,CAAAA,EACA,KAAA1Z,KAAA,CAAAA,EACA,KAAAG,aAAA,KAAAwZ,GAAApuE,EAAAiuE,EAAA,KAAAlc,UAAA,CACA,CACAz2D,KAAAm5D,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CAIA,MAAArhD,SAAA,CAIA,IAHA,WAAAi7D,YAAA,MAAA1Z,MAAA,CAAA36D,QAAA,EACA,KAAAs0E,gBAAA,MAAA3Z,MAAA,CAAA36D,QAAA,EAEA,WAAAu0E,WAAA,MAAA5Z,MAAA,CAAA36D,QAAA,EACA,WAAAw0E,gBAAA,MAAA7Z,MAAA,CAAA36D,QAAA,EACA,WAAAy0E,aAAA,GACA,IACA,CACA,MAAAA,eAAA,CACA,QAAAN,eAAoB,EACpB,IAAAn0E,SAAAA,CAAA,CAAA00E,SAAAA,CAAA,aAAAP,eAAA,EACA7yE,KAAA,KAAAm5D,KAAA,CACAz6D,SAAA,KAAA06D,SAAA,CACA7V,SAAA,KAAA7+C,SAAA,CACA6wC,UAAA,KAAAkhB,UAAA,CACaiR,MAAA,KAAArO,MAAA,GAGb,OADA,KAAAD,SAAA,CAAA16D,EACA00E,CACA,QACA,CACA,CACAC,uBAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,GAGA,QAAA7D,KAAA4D,EAAA,CACA,IAAA3R,EAAA+N,EAAAl2E,IAAA,CACAg6E,EAAAH,CAAA,CAAA1R,EAAA,MAEArnE,IAAAk5E,IAEAC,GAAAD,GAEA/D,GAAAC,GACA6D,CAAA,CAAA5R,EAAA,MAAAyR,sBAAA,CAAAI,EAAA9D,EAAA,UAIA6D,CAAA,CAAA5R,EAAA,CAAA+R,GAAAF,EAAA,IAKAA,IAAA,GAAAA,EACAD,CAAA,CAAA5R,EAAA,CAAA5nB,EAAAy5B,GAEA9D,EAAA,YACA6D,CAAAA,CAAA,CAAA5R,EAAA,MAAAnL,UAAA,EAGA,CACA,OAAA+c,CACA,CACAI,iBAAAl1E,CAAA,EACAnF,OAAAC,MAAA,MAAA4/D,SAAA,MAAAia,sBAAA,CAAA30E,EAAA,KAAA26D,MAAA,CAAA36D,QAAA,EACA,CACA6a,IAAAxgB,CAAA,EAEA,IAAA86E,EAAA96E,EAAA8Y,MAAA,EAAAC,EAAAgiE,IAAAhiE,GAAAA,CAAA,CAAAgiE,EAAA,MAAA1a,SAAA,EACA,GAAAya,GAAAA,EAAA/zE,QAAA,CACA,OAAA+zE,CACA,CAEAh4E,IAAA9C,CAAA,CAAAG,CAAA,EACA,IAAAypD,EAAA,KAAAyW,SAAA,CACArgE,EAAA4K,OAAA,EAAA4a,EAAA3f,IAAA,CACA,IAAAm1E,EAAAn1E,GAAA7F,EAAArB,MAAA,GACAq8E,GACApxB,CAAAA,CAAA,CAAApkC,EAAA,CAAArlB,CAAA,EAEAypD,CAAA,CAAApkC,EAAA,CAAAokC,CAAA,CAAApkC,EAAA,KACSokC,EAAAA,CAAA,CAAApkC,EAAA,EAET,CACA,MAAAw0D,aAAAr0E,CAAwB,CAAA3F,EAAA,IACxB,QAAAuC,EAAA,EAAAA,EAAAoD,EAAAhH,MAAA,CAAA4D,GAAA,GACA,IAAA04E,EAAAt1E,CAAA,CAAApD,EAAA,CACA24E,EAAAD,EAAAt1E,QAAA,CACAu1E,GACA,WAAAlB,YAAA,CAAAkB,EAAA,IACoBl7E,EACpBkuE,IAAA+M,EAAAv6E,IAAA,EACA,EAEA,IAAAy6E,EAAAF,EACAG,EAAAlN,IAAA+M,EAAAv6E,IAAA,EAEA,GAAAy6E,EAAA92B,QAAA,QAAA7jC,GAAA,KAAAxgB,EAAAo7E,EAAA,GAEA,QAAA55E,IAAA,KAAAmK,SAAA,CAAAjD,MAAA,CACA,mGAGA,KAAA5F,GAAA,KAAA9C,EAAAo7E,EAAA,MAAAzvE,SAAA,CAAAjD,MAAA,CAAApJ,SAAA,CACA,SAEAyhB,GAAA,CAAA44D,GAAAlZ,cAAA,CAAA2a,IACA,MAAA56D,GAAA,KAAAxgB,EAAAo7E,EAAA,GACA,KAAAt4E,GAAA,KAAA9C,EAAAo7E,EAAA,CAAAzB,GAAAlZ,cAAA,CAAA2a,EAAA,CAEA,CACA,CAOAnB,iBAAAt0E,CAAA,CAAA3F,EAAA,IACA,QAAA+D,KAAA4B,EAAA,CACA,IAAAs1E,EAAAt1E,CAAA,CAAA5B,EAAA,CACAm3E,EAAAD,EAAAt1E,QAAA,CACAu1E,GACA,KAAAjB,gBAAA,CAAAiB,EAAA,IACoBl7E,EACpBkuE,IAAA+M,EAAAv6E,IAAA,EACA,EAGA,IAAA26E,EAAA,CAAAt3E,EAAA,EACA,GAAAs3E,IAAA11E,EAAAhH,MAAA,CACA,OACA,IAAA28E,EAA6BpN,IAASvoE,CAAA,CAAA5B,EAAA,CAAArD,IAAA,EACtC66E,EAAArN,IAAAvoE,CAAA,CAAA01E,EAAA,CAAA36E,IAAA,EAEA,GAAA46E,mBAAAA,GAAAC,YAAAA,EAAA,CACA,IAAAC,EAAA,IAAAx7E,EAAAs7E,EAAA,CACAG,EAAA,IAAAz7E,EAAAu7E,EAAA,CACA,KAAA/6D,GAAA,CAAAg7D,IACA,KAAA14E,GAAA,CAAA04E,EAAA39E,EAAA0e,SAAA,CAAAilC,sBAAA,EAAArjD,EAAA2d,IAAA,4BAAA4hD,UAAA,MAEA,KAAAl9C,GAAA,CAAAi7D,IACA,KAAA34E,GAAA,CAAA24E,EAAA,KAAA/d,UAAA,EAEA,MACA,EAEA,CACA,MAAAwc,YAAAv0E,CAAA,CAAA3F,EAAA,IACA,IAAA07E,EAAA,EACA,QAAAn5E,EAAA,EAAAA,EAAAoD,EAAAhH,MAAA,CAAA4D,GAAA,GACA,IAAA44E,EAAAx1E,CAAA,CAAApD,EAAA,CACA24E,EAAAC,EAAAx1E,QAAA,CACAu1E,GACAQ,CAAAA,GAAA,WAAAxB,WAAA,CAAAgB,EAAA,IACoBl7E,EACpBkuE,IAAAiN,EAAAz6E,IAAA,EACA,GAEA,IAAAi7E,EAAoCR,EACpCC,EAAAlN,IAAAiN,EAAAz6E,IAAA,CAEAi7E,CAAAA,EAAAjb,GAAA,EACAib,EAAAjb,GAAA,CAAArf,KAAA,CAAA1iD,MAAA,IACA,MAAA6hB,GAAA,KAAAxgB,EAAAo7E,EAAA,GACAQ,QAAA,WAAAjb,eAAA,CAAAgb,EAAA37E,KACA07E,CAAAA,GAAA,EAGA,CACA,OAAAA,CACA,CACA,MAAAvB,iBAAAx0E,CAAA,CAAA3F,EAAA,IACA,IAAA07E,EAAA,EACA,QAAAn5E,EAAA,EAAAA,EAAAoD,EAAAhH,MAAA,CAAA4D,GAAA,GACA,IAAA44E,EAAAx1E,CAAA,CAAApD,EAAA,CACA24E,EAAAC,EAAAx1E,QAAA,CACAu1E,GACAQ,CAAAA,GAAA,WAAAvB,gBAAA,CAAAe,EAAA,IACoBl7E,EACpBkuE,IAAAiN,EAAAz6E,IAAA,EACA,GAEA,IAAAm7E,EAAAV,EAAoCU,SAAA,KACpCT,EAAAlN,IAAAiN,EAAAz6E,IAAA,EACAo7E,EAAA,IAAA97E,EAAAo7E,EAAA,CAEAW,EAAA,KAAAv7D,GAAA,CAAAs7D,GACA,GAAAC,EAAA,CACA,IAAAC,EAAAH,EAAA9zD,MAAA,UAAAvH,GAAA,KAAAxgB,EAAAkuE,IAAA+N,GAAA,GAEA,GADAP,GAAAM,EAAAr9E,MAAA,CACAq9E,EAAAr9E,MAAA,IACA,IAAAiH,EAAA,WAAA26D,aAAA,CAAAY,YAAA,EACqB7hE,UAAAy8E,CACrB,EACA,OAAAp9D,QAAAqkC,GAAA,CAAAg5B,EAAwCp9E,GAAA,OAAAq9E,GAAA,CACxC,IAAAC,EAAAhO,IAAA+N,GAEqB,OADrB,KAAAn5E,GAAA,KAAA9C,EAAAk8E,EAAA,CAAAt2E,CAAA,CAAAs2E,EAAA,EACqBt2E,CAAA,CAAAs2E,EAAA,GAErB,EACA,CAEA,OAAAR,CACA,CACA,MAAA/a,gBAAAwa,CAAA,CAAAn7E,EAAA,IACA,IAAAm7E,EAAAza,GAAA,GAAAya,EAAAza,GAAA,CAAArf,KAAA,CACA,+BACA,IAAAA,EAAA,MAAA1iC,QAAAqkC,GAAA,CAAAm4B,EAAAza,GAAA,CAAArf,KAAA,CAAAziD,GAAA,SAAA4d,QAAA,CAAA2/D,EAAAn8E,KACA,GAAAqhD,EAAAmqB,IAAA,aAAAhS,GACA,MACA,CACA,IAAAhd,EAAA,WAAAokB,cAAA,CAAAua,EAAAn7E,GACA,IAAAw8C,EACA,MACA,CACA,IAAA4H,EAAA,OAA2BvmD,EAAS0e,SAAA,CAAA6kC,kBAAA,CAAAC,EAAA7E,GACpC,KAAA15C,GAAA,KAAA9C,EAAAkuE,IAAAiN,EAAAz6E,IAAA,GAAA0jD,EACA,CACA,MAAAwc,eAAAua,CAAA,CAAAn7E,EAAA,IACA,IAAAkG,EACA,YAAAA,CAAAA,EAAAi1E,EAAAza,GAAA,GAAAx6D,KAAA,IAAAA,EAAA,OAAAA,EAAAs2C,SAAA,EACA,YAAAkhB,UAAA,CAEA,OAAAyd,EAAAza,GAAA,CAAAlkB,SAAA,CAAA4W,IAAA,EACA,YACA,WAAAv1D,EAAA0e,SAAA,MAAAskD,aAAA,CAAAsa,EAAAza,GAAA,CAAAlkB,SAAA,CAAAr8C,KAAA,EACA,WACA,YAAA2gE,QAAA,CAAAqa,EAAAza,GAAA,CAAAlkB,SAAA,CACA,eACA,kBAAAukB,YAAA,CAAAoa,EAAAza,GAAA,CAAAlkB,SAAA,CAAAx8C,EACA,SACA,6CAAAm7E,EAAAza,GAAA,CAAAlkB,SAAA,CAAA4W,IAAA,IAEA,CACA,MAAA52C,SAAA2/D,CAAA,CAAAn8E,EAAA,IACA,OAAAm8E,EAAA/oB,IAAA,EACA,YACA,YAAAyN,aAAA,CAAAsb,EACA,WACA,kBAAAnb,WAAA,CAAAmb,EACA,eACA,kBAAAlb,eAAA,CAAAkb,EAAAn8E,EACA,SACA,qCAAAm8E,EAAA/oB,IAAA,IAEA,CAIAgpB,QAAA/7E,CAAA,CAAAL,EAAA,IACA,GAAAA,EAAArB,MAAA,IAAA0B,EAAA6yD,OAAA,EACA,IAAAmpB,EAAA,KAAAxC,SAAA,CAAAh1E,IAAA,IAAAjC,EAAAlC,IAAA,GAAAL,EAAA6yD,OAAA,EACA,IAAAmpB,EACA,gCAAAh8E,EAAA6yD,OAAA,IAEA,IAAAopB,EAAAD,EAAAh8E,IAAA,CACAqxE,EAAA4K,EAAA1jE,MAAA,CAAA/T,IAAA,IAAA6sE,EAAAhxE,IAAA,GAAAV,CAAA,KACA,YAAAo8E,OAAA,CAAA1K,EAAArxE,IAAA,CAAAL,EAAAjB,KAAA,IACA,QACAsB,CACA,CACAwgE,cAAAsb,CAAA,EACA,YAAAjb,aAAA,MAAAkb,OAAA,CAAAD,EAAA97E,IAAA,EAAA87E,EAAAn8E,IAAA,MAAAsY,KAAA,MAAAvZ,KAAA,KAAAo9E,EAAAh8E,KAAA,CACA,CACA,MAAA6gE,YAAAmb,CAAA,EACA,IAAArb,EAAA,KAAAA,QAAA,CAAAqb,GACA,YAAArb,EAGA,YAAAI,aAAA,MAAAkb,OAAA,CAAAD,EAAA97E,IAAA,EAAA87E,EAAAn8E,IAAA,MAAAsY,KAAA,MAAAvZ,KAAA,KAAA+hE,EADA,CAGAA,SAAAqb,CAAA,EACA,IAAA7jE,EAAA6jE,EAA4Bn8E,IAAA,CAAAsY,KAAA,MAC5BikE,EAAArO,IAAA51D,CAAA,KACAkkE,EAAA,KAAAlc,MAAA,CAAAr5D,IAAA,CAAA6qD,SAAA,IAAA2qB,EAAA/7E,IAAA,GAAA67E,GACA,GAAAC,KAAAA,EACA,iDAAAD,EAAA,GAEA,OAAAjkE,EACAvZ,KAAA,IACA+Z,MAAA,EAAA8wC,EAAA5pD,IAAA,CAAA4pD,GAAA,IAAA5pD,EAAA,MAAAogE,KAAA,CAAAoc,EAAA,CACA,CACA,MAAAvb,gBAAAkb,CAAA,CAAAn8E,EAAA,IACA,IAAA+gE,EAAA,WAAAA,YAAA,CAAAob,EAAAn8E,GACA,GAAA+gE,EAGA,YAAAG,aAAA,CAAAib,EAAA97E,IAAA,CAAA0gE,EADA,CAGA,MAAAA,aAAAob,CAAA,CAAAn8E,EAAA,IACA,IAAA08E,EAAAP,EAAAn8E,IAAA,CAAAsY,KAAA,MACAq5D,EAAA+K,CAAA,IACAC,EAAA,KAAAn8D,GAAA,KAAAxgB,EAAAkuE,IAAAyD,GAAA,EACA,GAAAgL,IAAA,GAAAA,EACA,mCAGA,GAAAD,IAAAA,EAAA/9E,MAAA,CACA,OAAAg+E,CACA,CAIA,IAAA/2E,EAAA,WAAA26D,aAAA,CAAAY,YAAA,EACA7hE,UAAAq9E,EACSj8E,KAAAy7E,EAAAv2E,OAAA,GAITg3E,EAAA,KAAAxb,iBAAA,CAAAx7D,EAAA82E,EAAA39E,KAAA,KACA,OAAA69E,CACA,CACAxb,kBAAAx7D,CAAA,CAAA5F,CAAA,EACA,IAAA68E,EACA,KAAA78E,EAAArB,MAAA,IACAk+E,EAAAj3E,CAAA,CAAAsoE,IAAAluE,CAAA,MACAA,EAAAA,EAAAjB,KAAA,IAEA,OAAA89E,CACA,CAKA3b,cAAA7gE,CAAA,CAAAF,CAAA,EACA,OAAAE,GACA,SACA,OAAAlC,EAAA2d,IAAA,EAAA3b,EAAA,CACA,WACA,IAAAsW,EAAAtY,EAAAknB,KAAA,IAEA,OADA5O,EAAA4qD,aAAA,CAAAlhE,GACAsW,CACA,WACA,IAAAgJ,EAAAthB,EAAAknB,KAAA,IAEA,OADA5F,EAAAlH,aAAA,CAAApY,GACAsf,CACA,WACA,IAAAq9D,EAAA3+E,EAAAknB,KAAA,IAEA,OADAy3D,EAAAxb,gBAAA,CAAAtZ,OAAA7nD,IACA28E,CACA,cACA,OAAA3+E,EAAA2d,IAAA,CAAA0yD,EAAAruE,GACA,iBACA,OAAAA,EAAAqc,QAAA,EACA,SACA,GAAAnc,EAAAhC,KAA2B,CAC3B,OAAAF,EAAA2d,IAAA,CAAA3b,EACA,OACA,+BAAAE,EAAA,GAEA,CACA,CACAs5E,GAAAlZ,cAAA,EACAc,uBAAUxF,GACVyF,KAAA3jE,EAAmB4jE,kBAAA,CACnBC,cAAA7jE,EAAAq+C,aAAA,CAAAM,SAAA,CACAmlB,aAAWllB,GACXsgC,MAAAl/E,EAAAm/E,mBAAA,CAGA,OAAAjD,GAEAr6E,YAAAiM,CAAA,CAAA00D,CAAA,CAAA3C,CAAA,EACA,KAAA/xD,SAAA,CAAAA,EACA,KAAA+xD,UAAA,CAAAA,EACA,KAAAkE,MAAA,KAAA/+D,IACA,KAAAo6E,KAAA,IACA,KAAAA,KAAA,CAAAvf,EAAA32D,QAAA,IAAAs5D,CACA,CACA,MAAA6c,UAAA1gC,CAAA,EACA,SAAAygC,KAAA,CAAAzgC,EAAAz1C,QAAA,KACA,IAAAssD,EAAA,MAAAiU,GAAAxE,QAAA,CAAAtmB,EAAA,KAAA7wC,SAAA,EACA,GAAA0nD,EAAA,CACA,IAAApB,EAAA,IAAAqV,GAAAjU,EAAA7W,EAAA,KAAA7wC,SAAA,CACA,MAAAsxE,KAAA,CAAAzgC,EAAAz1C,QAAA,IAAAkrD,EAAArsD,OAAA,CACA,CACA,OACA,KAAAq3E,KAAA,CAAAzgC,EAAAz1C,QAAA,IAEA,MAAAo6D,aAAA,CAAA7hE,UAAAA,CAAA,CAAAoB,KAAAA,CAAA,CAAA87C,UAAAA,EAAA,KAAAkhB,UAAA,GACA,IAAA1gB,EAAA19C,EAAAoH,QAAA,GACA,SAAAk7D,MAAA,CAAA7gD,GAAA,CAAAi8B,IACA,GAAAt8C,iBAAAA,EAAA,CACA,IAAA4nD,EAAA,WAAA38C,SAAA,CAAAtG,UAAA,CAAA0/C,cAAA,CAAAzlD,GACA,GAAAgpD,IAAA,GAAAA,EACA,wCAAAtL,EAAA,GAEA,IAAA79C,EAAAu6E,GAAApxB,EAAAnpD,IAAA,EACA,KAAAyiE,MAAA,CAAA9+D,GAAA,CAAAk6C,EAAA79C,EACA,MACA,GAAAuB,EAAA,CACA,IAAAiF,EAAA,WAAAu3E,SAAA,CAAA1gC,GACA,GAAA72C,EAAA,CACA,IAAAw3E,EAAAx3E,CAAA,CAAAuoE,IAAAxtE,GAAA,CACA,GAAAy8E,EAAA,CACA,IAAAv3E,EAAA,MAAAu3E,EAAAxgE,KAAA,CAAArd,GACA,KAAAsiE,MAAA,CAAA9+D,GAAA,CAAAk6C,EAAAp3C,EACA,EACA,KAEA,CACA,IAAAA,EAAA,WAAA+F,SAAA,CAAAtG,UAAA,CAAA0/C,cAAA,CAAAzlD,GACA,GAAAsG,IAAA,GAAAA,EACA,wCAAAo3C,EAAA,GAEA,IAAA79C,EAAAyG,EAAAzG,IAAA,CACAwG,EAAA,WAAAu3E,SAAA,CAAAt3E,EAAAyC,KAAA,EACA,GAAA1C,EAAA,CACA,IAAAy3E,EAAA58E,OAAAwW,MAAA,CAAArR,EAAA,IACA,IAAAy3E,EACA,4CAEA,IAAA17E,EAAA07E,EAAA5f,KAAA,CAAA73D,QAAA,CAAAkuE,SAAA,CAAA10E,GACA,KAAAyiE,MAAA,CAAA9+D,GAAA,CAAAk6C,EAAAt7C,EACA,EACA,CACA,OACA,KAAAkgE,MAAA,CAAAphD,GAAA,CAAAw8B,EACA,EAGA,MAAAowB,GACA,OAAArjB,MAAAS,CAAA,CAAAhO,CAAA,CAAAmyB,CAAA,CAAA+I,CAAA,CAAAC,CAAA,CAAA0F,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,UAAAz2E,IAAA,IAAA02E,GAAA12E,EAAAywE,EAAAC,EAAA0F,EAAAC,EAAAC,EAAA/yB,EAAAhO,EAAAmyB,EAAA6O,EAAAC,EAAAC,EACA,CACA,CACA,SAAA/C,GAAAD,CAAA,EACA,uBAAAA,GACAA,IAAA,GAAAA,GACA,UAAAA,CAAA,CAEA,CACA,SAAAE,GAAAL,CAAA,CAAAqD,CAAA,EACA,IAAAC,EAAA,GACA,QAAAhV,KAAA0R,EAAA,CACA,IAAA30E,EAAA20E,CAAA,CAAA1R,EAAA,CACA,GAAAjjE,IAAA,GAAAA,EAAA,CACA,GAAAg4E,EACA,yFACA,SACA,CACA,CAAA/U,EAAA,CAAA8R,GAAA/0E,GACAg1E,GAAAh1E,EAAA,IACAq7C,EAAAr7C,EAAA,CAEA,OAAAi4E,CACA,CACA,MAAAF,GACAj+E,YAAA0gE,CAAA,CAAA0B,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAv2D,CAAA,CAAA+xD,CAAA,CAAA4C,CAAA,CAAAsZ,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,KAAAhY,KAAA,CAAAA,EACA,KAAAC,KAAA,CAAAA,EACA,KAAAC,MAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,EACA,KAAAxE,UAAA,CAAAA,EACA,KAAA2C,SAAA,IACA,KAAA8B,kBAAA,IACA,KAAAC,QAAA,IACA,KAAAC,gBAAA,IACA,KAAAC,iBAAA,IACA,KAAAC,oBAAA,IACA,KAAAnC,KAAA,CAAAA,EACA,KAAAoC,iBAAA,KAAAmX,GAAAvZ,EAAA,KAAAC,SAAA,CAAA10D,EAAA+xD,EAAA4C,EAAAsZ,EAAAC,EAAAC,EACA,CACA7yE,KAAAm5D,CAAA,EACA,KAAAA,KAAA,CAAAA,EACA,KAAAoC,iBAAA,CAAAv7D,IAAA,CAAAm5D,EACA,CACA,MAAAqC,SAAA,CAIA,OAHA,KAAAF,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAEA,KAAAshD,SAAA,CAEA16D,SAAAA,CAAA,EAGA,OAFA,KAAA48D,oBAAA,IACA,KAAAC,iBAAA,CAAAqY,gBAAA,CAAAl1E,GACA,KAEA+8D,eAAA/8D,CAAA,EAGA,OAFA,KAAA48D,oBAAA,IACA,KAAAC,iBAAA,CAAAqY,gBAAA,CAAAl1E,GACA,KAEAK,QAAAA,CAAA,EAEA,OADA,KAAAo8D,QAAA,MAAAA,QAAA,CAAAvuC,MAAA,CAAA7tB,GACA,KAEAi3D,kBAAAt3D,CAAA,EAEA,OADA,KAAAw8D,kBAAA,MAAAA,kBAAA,CAAAtuC,MAAA,CAAAluB,GACA,KAEA23D,gBAAAgM,CAAA,EAEA,OADA,KAAAjH,gBAAA,MAAAA,gBAAA,CAAAxuC,MAAA,CAAAy1C,GACA,KAEA/L,iBAAA+L,CAAA,EAEA,OADA,KAAAhH,iBAAA,MAAAA,iBAAA,CAAAzuC,MAAA,CAAAy1C,GACA,KAEA,MAAA7M,IAAA16D,CAAA,EAKA,OAJA,KAAAwgE,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAGA,KAAAijD,MAAA,SAAA5B,KAAA,EACAz6D,SAAA,KAAA06D,SAAA,CACAr6D,QAAA,KAAAo8D,QAAA,CACAnF,kBAAA,KAAAkF,kBAAA,CACA7E,gBAAA,KAAA+E,gBAAA,CACA9E,iBAAA,KAAA+E,iBAAA,CACSvgE,QAAAA,CACT,EACA,CACA,MAAA+7E,WAAA/7E,CAAA,EACA,IAAA0gE,EAAA,WAAAA,OAAA,GACA,OACAA,QAAAA,EACAv4D,UAAA,WAAAuyD,GAAA,CAAA16D,EACA,CACA,CACA,MAAA2d,KAAA3d,CAAA,EAIA,GAHA,KAAAwgE,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAEA,MAAAmjD,OAAA,CACA,6CAGA,YAAAA,OAAA,SAAA9B,KAAA,EACAz6D,SAAA,KAAA06D,SAAA,CACAr6D,QAAA,KAAAo8D,QAAA,CACAnF,kBAAA,KAAAkF,kBAAA,CACA7E,gBAAA,KAAA+E,gBAAA,CACA9E,iBAAA,KAAA+E,iBAAA,CACSvgE,QAAAA,CACT,EACA,CACA,MAAAkJ,SAAAlJ,CAAA,EAKA,OAJA,KAAAwgE,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAGA,KAAAkjD,WAAA,SAAA7B,KAAA,EACAz6D,SAAA,KAAA06D,SAAA,CACAr6D,QAAA,KAAAo8D,QAAA,CACAnF,kBAAA,KAAAkF,kBAAA,CACA7E,gBAAA,KAAA+E,gBAAA,CACA9E,iBAAA,KAAA+E,iBAAA,CACSvgE,QAAAA,CACT,EACA,CACA,MAAAqnD,aAAA,CAKA,OAJA,KAAAmZ,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAGA,KAAA+iD,KAAA,SAAA1B,KAAA,EACAz6D,SAAA,KAAA06D,SAAA,CACAr6D,QAAA,KAAAo8D,QAAA,CACAnF,kBAAA,KAAAkF,kBAAA,CACA7E,gBAAA,KAAA+E,gBAAA,CACS9E,iBAAA,KAAA+E,iBAAA,EAET,CAKA,MAAAyb,SAAA,CACA,OACA30B,YAAA,WAAAA,WAAA,GACAqZ,QAAA,WAAAA,OAAA,GACAz8D,QAAA,WAAAo8D,QAAA,CAEA,CACA,MAAAr8D,aAAA,CAKA,OAJA,KAAAw8D,oBAAA,EACA,WAAAC,iBAAA,CAAAzjD,OAAA,GAGA,KAAAgjD,KAAA,SAAA3B,KAAA,EACAz6D,SAAA,KAAA06D,SAAA,CACAr6D,QAAA,KAAAo8D,QAAA,CACAnF,kBAAA,KAAAkF,kBAAA,CACA7E,gBAAA,KAAA+E,gBAAA,CACS9E,iBAAA,KAAA+E,iBAAA,EAET,EAGA,MAAA0b,GACA,OAAAj0B,MAAAvN,CAAA,CAAAmyB,CAAA,CAAA2O,CAAA,CAAAjqB,CAAA,EACA,IAAA8J,EAAAwR,EAAAhpE,QAAA,CAAAd,IAAA,IAAAtH,EAAA4/D,KAAA,EACA8gB,EAAA,EAAAtP,EAAA/L,OAAA,CACA,GAAAzF,GAAA,CAAA8gB,EACA,OACA,IAAAv+D,EAAA,SAAAzY,IAAA,CACA,IAAAf,EAAAgD,EACA,IAAAg1E,EAAA,MAAAZ,KAAoDr2E,GACpDk3E,EAAA,mBAAA3hC,EAAA,GACA4hC,EAAAF,EAAAviD,GAAA,CAAA92B,IAAA,IAAA6lC,EAAAqnB,UAAA,CAAAosB,IACA,IAAAC,EACA,wCAEA,IAAAC,EAAA7nE,EAAA4nE,EAAAr/E,KAAA,CAAAo/E,EAAAx/E,MAAA,GACA2/E,EAAA3P,EAAA/L,OAAA,CACA,IAAA0b,EACA,yCAEA,IAAA9gB,EAAAiU,GAAAxe,WAAA,EAAA5yD,KAAAi+E,CAAA,EAAA//E,MAAAud,IAAA,YAAA5V,CAAAA,EAAAmtD,EAAA1tD,QAAA,GAAAO,KAAA,IAAAA,EAAAA,EAAA,aAAAgD,CAAAA,EAAAmqD,EAAAO,KAAA,GAAA1qD,KAAA,IAAAA,EAAAA,EAAA,MACA,OAAAs0D,EAAAhnD,MAAA,CAAA6nE,EACA,EACA,OAAA3+D,CACA,EAGA,MAAA6+D,GAIA,OAAAx0B,MAAAsJ,CAAA,CAAAmK,CAAA,CAAAhhB,CAAA,CAAAgO,CAAA,CAAAg0B,CAAA,EACA,IAAA/hB,EAAA,GACArT,EAAA,GACArjD,EAAA,GACAkF,EAAA,GACAiW,EAAA,GACAxB,EAAA,GACA8wD,EAAA7C,EAAAta,GACAztD,EAAAytD,EAAA1tD,QAAA,CACAkyE,GAAA9tB,KAAA,CAAAsJ,EAAAmK,EAAAhhB,EAAAgO,GACA,GAkBA,OAjBA6I,EAAApW,YAAA,CAAAryC,OAAA,KACA,IAAA6zE,EAAAxH,GAAAltB,KAAA,CAAA4kB,EAAA,CAAA0D,EAAAnoB,IAAAsT,EAAApU,WAAA,CAAAhqD,MAAA,CAAAizE,EAAAnoB,GAAA1N,GACAkiC,EAAAjH,GAAA1tB,KAAA,CAAA4kB,EAAA8P,GACAE,EAAA/G,GAAA7tB,KAAA,CAAA4kB,EAAA+P,EAAAlO,EAAAhmB,GACAo0B,EAAApF,GAAAzvB,KAAA,CAAA4kB,EAAA+P,EAAAlO,EAAAhmB,EAAAgT,EAAAhhB,EAAA6W,GACAwrB,EAAAb,GAAAj0B,KAAA,CAAAvN,EAAAmyB,EAAAiQ,EAAAvrB,GACAyrB,EAAyB1R,GAAArjB,KAAA,CAAAS,EAAAhO,EAASmyB,EAAA8P,EAAAC,EAAAC,EAAAC,EAAAC,EAAAj5E,EAAAytD,EAAAO,KAAA,KAAA4qB,GAAAA,EAAA7P,IAClCjuE,EAAAwtE,IAAAS,EAAAjuE,IAAA,CACA0oD,CAAAA,CAAA,CAAA1oD,EAAA,CAAA+9E,EACA14E,CAAA,CAAArF,EAAA,CAAAg+E,EACAjiB,CAAA,CAAA/7D,EAAA,CAAAi+E,EACA1zE,CAAA,CAAAvK,EAAA,CAAAk+E,EACA19D,CAAA,CAAAxgB,EAAA,CAAAo+E,EACAD,GACAn/D,CAAAA,CAAA,CAAAhf,EAAA,CAAAm+E,CAAA,CAEA,GACA,CACApiB,EACArT,EACArjD,EACAH,EACAqF,EACAiW,EACAxB,EACA,CACA,CA6BA,MAAA4nD,GAIA,IAAA9qB,WAAA,CACA,YAAAkhB,UAAA,CAKA,IAAArK,KAAA,CACA,YAAAoK,IAAA,CAKA,IAAAD,OAAA,CACA,YAAAc,MAAA,CAKA,IAAA9T,UAAA,CACA,YAAA7+C,SAAA,CAWAjM,YAAA2zD,CAAA,CAAA7W,CAAA,CAAAgO,CAAA,CAAAgT,CAAA,CAAAghB,CAAA,EACAhiC,EAAAyE,EAAAzE,GACAgO,GACAA,CAAAA,EAAAkjB,IAAA,EAGA,KAAAjQ,IAAA,CAAApK,EACA,KAAA1nD,SAAA,CAAA6+C,EACA,KAAAkT,UAAA,CAAAlhB,EACA,KAAA8hB,MAAA,CAAAd,MAAAA,EAAAA,EAAA,IAAAoP,GAAAvZ,EAAA,CACA,KAAAsP,OAAA,KAAAqK,GAAA,KAAAtP,UAAA,CAAAlT,EAAA,KAAA8T,MAAA,EAEA,IAAA7B,EAAArT,EAAArjD,EAAAH,EAAAqF,EAAAiW,EAAA2hD,EAAA,CAAA0b,GAAAx0B,KAAA,CAAAsJ,EAAA,KAAAiL,MAAA,CAAA9hB,EAAAgO,EAAAg0B,MAAAA,EAAAA,EAAA,IAAAh9E,KAAAA,CAAA,CACA,MAAAi7D,GAAA,CAAAA,EACA,KAAArT,WAAA,CAAAA,EACA,KAAArjD,WAAA,CAAAA,EACA,KAAAH,OAAA,CAAAA,EACA,KAAAqF,QAAA,CAAAA,EACA,KAAAiW,OAAA,CAAAA,EACA,KAAA2hD,KAAA,CAAAA,CACA,CAUA,aAAA3R,GAAAlU,CAAA,CAAAwN,CAAA,EACA,IAAAhO,EAAAyE,EAAAjE,GACAqW,EAAA,MAAAiU,GAAAxE,QAAA,CAAAtmB,EAAAgO,GACA,IAAA6I,EACA,0CAAArW,EAAAt2C,QAAA,MAEA,WAAA4gE,GAAAjU,EAAA7W,EAAAgO,EACA,CAUA,aAAAsY,SAAA9lB,CAAA,CAAAwN,CAAA,EACAA,EAAAA,MAAAA,EAAAA,EAAAkjB,IAAA,CACA,IAAAlxB,EAAAyE,EAAAjE,GACA+hC,EAAA,MAAAlI,GAAAr6B,GACA8L,EAAA,MAAAkC,EAAAnlD,UAAA,CAAA0/C,cAAA,CAAAg6B,GACA,IAAAz2B,EACA,YAGA,IAAAkrB,EAAAuD,GAA4BzuB,EAAAnpD,IAAA,CAAAJ,KAAA,KAC5BigF,EAAA,GAAA5Q,EAAApL,EAAA,EAAAwQ,EAAAr0E,IAAA,EACA,OAAA+B,KAAA2f,KAAA,CAAA0tD,EAAAyQ,GACA,CAQAh7D,iBAAAqwD,CAAA,CAAArzD,CAAA,EACA,YAAA2hD,OAAA,CAAA3+C,gBAAA,CAAAqwD,EAAArzD,EACA,CAIA,MAAAmD,oBAAA85C,CAAA,EACA,kBAAA0E,OAAA,CAAAx+C,mBAAA,CAAA85C,EACA,EAGA,IAAAghB,GAAA,IAAAphF,EAAA0e,SAAA,qCACA,SAAA01C,GAAAzH,CAAA,EACA,WAAA8c,GAAAxD,GAAAmb,GAAAz0B,EAAAgT,KACA,CACA,SAAAA,IAAA,CACA,WAAAgQ,GAAA1J,GACA,CACA,IAAAA,GAAA,CACA5D,QAAA,QACAx/D,KAAA,iBACAu8C,aAAA,CACA,CACAv8C,KAAA,gBACAiF,SAAA,CACA,CACAjF,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,KACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,WACiBL,KAAA,KACjB,EACA,CACAK,KAAA,QACiBL,KAAA,KACjB,EACA,CACAK,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,SACAiF,SAAA,CACA,CACAjF,KAAA,SACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,WACAiF,SAAA,CACA,CACAjF,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,KACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,WACiBL,KAAA,KACjB,EACS,EAET,CACAK,KAAA,wBACAiF,SAAA,CACA,CACAjF,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,KACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,OACiBL,KAAA,WACjB,EACA,CACAK,KAAA,OACiBL,KAAA,QACjB,EACA,CACAK,KAAA,WACiBL,KAAA,KACjB,EACA,CACAK,KAAA,QACiBL,KAAA,KACjB,EACA,CACAK,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,sBACAiF,SAAA,CACA,CACAjF,KAAA,QACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,oBACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,aACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,aACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,uBACAiF,SAAA,CACA,CACAjF,KAAA,QACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,KACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,oBACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,aACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,WACiBL,KAAA,KACjB,EACS,EAET,CACAK,KAAA,yBACAiF,SAAA,CACA,CACAjF,KAAA,QACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,oBACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,aACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,wBACAiF,SAAA,CACA,CACAjF,KAAA,QACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,aACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,aACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,WACAiF,SAAA,CACA,CACAjF,KAAA,SACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,QACiBL,KAAA,KACjB,EACS,EAET,CACAK,KAAA,mBACAiF,SAAA,CACA,CACAjF,KAAA,UACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,OACiBL,KAAA,WACjB,EACA,CACAK,KAAA,OACiBL,KAAA,QACjB,EACA,CACAK,KAAA,QACiBL,KAAA,KACjB,EACA,CACAK,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,iBACAiF,SAAA,CACA,CACAjF,KAAA,UACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,OACiBL,KAAA,WACjB,EACA,CACAK,KAAA,OACiBL,KAAA,QACjB,EACA,CACAK,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAK,KAAA,mBACAiF,SAAA,CACA,CACAjF,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,OACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACA3jD,KAAA,KACAy8D,MAAA,GACiB9Y,SAAA,EACjB,EACA,CACAp9C,KAAA,CACA,CACAvG,KAAA,WACiBL,KAAA,KACjB,EACA,CACAK,KAAA,OACiBL,KAAA,QACjB,EACA,CACAK,KAAA,QACiBL,KAAA,WACjB,EACS,EAET,CACAsF,SAAA,CACA,CACAjF,KAAA,QACAL,KAAA,CACA+yD,KAAA,SACAx6C,OAAA,CACA,CACAlY,KAAA,UACqBL,KAAA,KACrB,EACA,CACAK,KAAA,QACqBL,KAAA,KACrB,EACA,CACAK,KAAA,mBACqBL,KAAA,WACrB,EACA,CACAK,KAAA,QACqBL,KAAA,WACrB,EACA,CACAK,KAAA,gBACAL,KAAA,CACyB6yD,QAAA,eACJ,CACrB,EACa,CAEb,EACA,CACAU,MAAA,CACA,CACAlzD,KAAA,gBACAL,KAAA,CACA+yD,KAAA,SACAx6C,OAAA,CACA,CACAlY,KAAA,uBACqBL,KAAA,KACrB,EACa,CAEb,EACA,CAGA,OAAAgtE,GACA,OAAAxJ,OAAArZ,CAAA,EACA,OAAAyH,GAAAzH,EACA,EAGA,gBAAAttD,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCjjNa,IAAAe,EAAAf,EAAA,aAEbirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAc,CAAA7O,EAAgB,aAAgB,CAAA0C,MAAG,EAAW,GAC5D1C,EAAAmB,GAAA,CAAAnB,EAAAY,KAAwB,CAAAZ,EAAAgnB,QAAQ,CAAehnB,EAAA8qB,GAAA,CAAA9qB,EAAA8B,KAAA,CAAA9B,EAAA+qB,MAAA,CAAA/qB,EAAAgrB,GAAA,CAAAhrB,EAAAirB,IAAA,CAAAjrB,EAAAinB,MAAA,CAAAjnB,EAAA6B,SAAA,CAAA7B,EAAAkrB,IAAA,CAAAlrB,EAAAmrB,IAAA,CAAAnrB,EAAAorB,IAAA,CAAAprB,EAAAqrB,IAAA,CAAArrB,EAAAsrB,GAAA,CAAAtrB,EAAAknB,GAAA,CAAAlnB,EAAA4B,MAAA,CAAA5B,EAAAurB,GAAA,CAAAvrB,EAAAwrB,GAAA,CAAAxrB,EAAAyrB,GAAA,CAAAzrB,EAAA+d,GAAA,CAAA/d,EAAA0rB,GAAA,CAAA1rB,EAAA2rB,GAAA,CAAA3rB,EAAA4rB,EAAA,CAAA5rB,EAAA8d,EAAA,QAC/C,IAAA+N,EAAkBlsB,EAAyB,KAC3CsoB,EAAAtoB,EAAgC,MAChCmsB,EAAAlB,EAAsBjrB,EAAuB,OAC7C,IAAAosB,EAAApsB,EAAuC,KACvCoD,OAAA8L,cAAA,CAAA7O,EAAA,KAAqC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAjO,EAAA,IAC5E/a,OAAA8L,cAAA,CAAA7O,EAAA,MAAsCgsB,WAAE,GAAAjJ,IAAA,kBAAqCgJ,EAAAE,EAAA,IAC7ElpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAJ,GAAA,IAC7E5oB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAG,GAAA,IAC7EnpB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAhO,GAAA,IAC7Ehb,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAI,GAAA,IAC7EppB,OAAA8L,cAAA,CAAA7O,EAAA,MAAsC,CAAEgsB,WAAA,GAAAjJ,IAAA,WAAqC,OAAAgJ,EAAAP,GAAA,IAC7EzoB,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAA2C,GAAAjJ,IAAA,kBAAqCgJ,EAAAR,GAAA,IAChFxoB,OAAA8L,cAAA,CAAA7O,EAAA,UAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAgJ,EAAAnqB,MAAA,GACA,OAAAwqB,UAAAP,EAAApT,MAAA,CACAxW,YAAAyW,CAAA,CAAA2T,CAAA,CAAA1T,CAAA,EACA,MAAAD,EAAAC,GACA,KAAAuF,IAAA,IAAA2N,EAAA3N,IAAA,EAAAxF,GACA,KAAA2T,MAAA,CAAAA,CACA,CACAtT,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAqT,EAAA,IAAAR,EAAAhF,OAAA,MAAA5I,IAAA,CAAAnF,MAAA,CAAAC,EAAAC,GAAA,gBACA,KAAAoT,MAAA,CACAC,EAAAC,QAAA,QAAA7T,IAAA,EAAAuM,KAAA,GAEAqH,CADA,CAGA3qB,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAIA,OAHA,KAAAoT,MAAA,EACAnT,CAAAA,EAAAA,EAAAsT,MAAA,QAAA9T,IAAA,GAEA,KAAAwF,IAAA,CAAAvc,MAAA,CAAAuX,EAAAuT,WAAA,CAAA/rB,EAAA,UAAAgY,IAAA,EAAAM,EAAAC,EACA,CACA,CACA,SAAAiO,EAAAvO,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA2S,EAAA3S,CAAA,EACA,WAAAyT,EAAA,KAAAzT,EACA,CAEA,SAAA0S,EAAA1S,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAyS,EAAAzS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAwS,EAAAxS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAEA,SAAAuS,EAAAvS,CAAA,EACA,WAAAyT,EAAA,MAAAzT,EACA,CAnBA3Y,EAAAknB,GAAA,CAAAA,EAIAlnB,EAAAsrB,GAAA,CAAAA,EAIAtrB,EAAAqrB,IAAA,CAAAA,EAIArrB,EAAAorB,IAAA,CAAAA,EAIAprB,EAAAmrB,IAAA,CAAAA,EAIAnrB,EAAAkrB,IAAA,CAAAA,CACA,OAAA7D,UAAAwE,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAA6E,CAAA,CAAAC,CAAA,CAAAjG,CAAA,EACA,MAAAmB,EAAApB,IAAA,CAAAC,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAA6E,OAAA,CAAAA,EACA,KAAAC,OAAA,CAAAA,CACA,CACA7F,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAA0F,OAAA,MAAA7E,MAAA,CAAAf,MAAA,CAAAC,EAAAC,GACA,CACAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,MAAAid,OAAA,CAAA1F,GAAAF,EAAAC,EACA,CACAE,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAApX,EAAA8W,CAAA,EACA,WAAA0O,EAAA,GAAAwE,EAAA3N,IAAA,aAAA+J,EAAAnJ,SAAA,CAAA9F,GAAA,GAAArW,EAAAoc,QAAA,GAAApG,EACA,CACA3Y,EAAA6B,SAAA,CAAAA,CACA,OAAA6qB,UAAAb,EAAApT,MAAA,CACAxW,YAAA6X,CAAA,CAAAnB,CAAA,EACA,SAAAA,GACA,KAAAmB,MAAA,CAAAA,EACA,KAAAyC,aAAA,IAAAsP,EAAA/N,EAAA,GACA,CACAnc,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,UACA,MAAAC,EACA,KAAAqD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,IAEA,KAAAsD,aAAA,CAAA5a,MAAA,GAAAqX,EAAAC,GACA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAFA,CAIAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,YAEA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,EACA,OACA,6BAAAN,QAAA,EAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACA,IAAAsD,EAAA,KAAAA,aAAA,CAAAxD,MAAA,CAAAC,EAAAC,GACA,GAAAsD,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,YAAAzC,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAA,IACA,OACA,6BAAAN,QAAA,EAEA,CACA,SAAAsO,EAAAnN,CAAA,CAAAnB,CAAA,EACA,WAAA+T,EAAA5S,EAAAnB,EACA,CAEA,SAAAsS,EAAAtS,CAAA,EACA,WAAA0O,EAAA,GAAAwE,EAAA/N,EAAA,IAAA6O,EAAAC,EAAAjU,EACA,CAEA,SAAAgU,EAAAjqB,CAAA,EACA,GAAAA,IAAAA,EACA,QAIA,CAFA,GAAAA,IAAAA,EACA,QACA,OACA,uBAAAA,EAAA,CAEA,SAAAkqB,EAAAlqB,CAAA,EACA,OAAAA,EAAA,IAEA,SAAAsoB,EAAA6B,CAAA,CAAAlU,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAAiB,GAAA,EAAAD,EAAA,GAAAhB,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAA,KAAAA,OAAAA,CAAA,GAAAZ,EACA,CAEA,SAAAoS,EAAA7N,CAAA,CAAApD,CAAA,CAAAnB,CAAA,EACA,IAAAoU,EAAA,GAAAlB,EAAAjqB,MAAA,GACAslB,EAAA,OACApN,EAAAV,SAAA,SACA,EACA,SAAA4T,EAAA,CAAA9P,IAAA+P,CAAA,CAAAvrB,KAAAA,CAAA,GACA,IAAAurB,EAAAC,EAAA,CAAAhQ,GACA,sCACAA,EAAAjU,QAAA,QACA,UACAgkB,EAAAhkB,QAAA,SAEA,OAAAvH,CACA,CACA,WAAA2lB,EAAA0F,EAAAC,EAAA,KAAA9P,IAAAA,EAAAxb,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAA7W,EAAA6W,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAA3N,IAAA,KAAA2N,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,UACA,EACA,WAAA2O,EAAAvN,EAAA,EAAApY,KAAAA,CAAA,IAAAA,EAAA,KAAAA,KAAAA,CAAA,GAAAiX,EACA,CAEA,SAAAmS,EAAAnS,CAAA,EACA,WAAA0O,EAAAvlB,IAAA,GAAAJ,EAAAuH,QAAA,aAAAvI,EAAA2d,IAAA,CAAArZ,EAAA,SAAA2T,EACA,CAEA,SAAAqO,EAAAmG,CAAA,CAAAxU,CAAA,CAAAyU,CAAA,EACA,IAAAC,EAAA,GAAAxB,EAAAlO,KAAA,EAAAyP,MAAAA,EAAAA,EAAA,GAAAvB,EAAA/N,EAAA,IAAAnF,GAEA,OADAwU,EAAAhgB,OAAA,EAAAoQ,EAAAlc,IAAAgsB,EAAA/P,UAAA,CAAAjc,EAAAkc,EAAAA,EAAA5E,QAAA,GACA0U,CACA,CAEA,SAAAzsB,EAAAisB,CAAA,CAAA3rB,CAAA,CAAAyX,CAAA,EACA,IAAAmB,EAAA,GAAA+R,EAAAjqB,MAAA,GACA,GAAAiqB,EAAAiB,GAAA,EAAAD,EAAA3rB,EAAA,UACA,EACA,WAAAmmB,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,IAAAA,EAAA,KAAAA,OAAAA,CAAA,GAAAZ,EACA,CAnEA3Y,EAAAinB,MAAA,CAAAA,EAIAjnB,EAAAirB,IAAA,CAAAA,EAqBAjrB,EAAAgrB,GAAA,CAAAA,EAiBAhrB,EAAA+qB,MAAA,CAAAA,EASA/qB,EAAA8B,KAAA,CAAAA,EAIA9B,EAAA8qB,GAAA,CAAAA,EAMA9qB,EAAAgnB,QAAA,CAAAA,EAOAhnB,EAAAY,KAAA,CAAAA,CACA,OAAA0sB,UAAAzB,EAAApT,MAAA,CACAxW,YAAAsrB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,MAAA4U,EAAA7U,IAAA,CAAA8U,EAAA9U,IAAA,CAAAC,GACA,KAAA4U,SAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,CACA,CACAzU,OAAAC,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAtW,EAAA,KAAA4qB,SAAA,CAAAxU,MAAA,CAAAC,EAAAC,GACAvW,EAAA,KAAA8qB,WAAA,CAAAzU,MAAA,CAAAC,EAAAC,EAAA,KAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,IACA,OAAAtW,EAAAD,EAAA,CAEAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAA,EAAAA,GAAA,EACA,IAAAwU,EAAA,KAAAF,SAAA,CAAA5rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,GACAyU,EAAA,KAAAF,WAAA,CAAA7rB,MAAA,CAAAuX,CAAA,IAAAF,EAAAC,EAAAwU,GACA,OAAAA,EAAAC,CACA,CACAvU,QAAAH,CAAA,CAAAC,CAAA,EACA,YAAAsU,SAAA,CAAApU,OAAA,CAAAH,EAAAC,GAAA,KAAAuU,WAAA,CAAArU,OAAA,CAAAH,EAAAC,EACA,CACA,CACA,SAAA9X,EAAAosB,CAAA,CAAAC,CAAA,CAAA7U,CAAA,EACA,IAAAzX,EAAA,GAAA2qB,EAAA9N,GAAA,YACAjE,EAAA,GAAA+R,EAAAjqB,MAAA,GACAV,EACA,GAAA2qB,EAAAiB,GAAA,MAAAQ,EAAAC,EAAAC,GAAA,GAAA3B,EAAA5S,MAAA,EAAA/X,EAAA,CAAAA,EAAAwX,IAAA,YACA,EACA,WAAA2O,EAAAvN,EAAA,EAAAP,OAAAA,CAAA,QAAAnU,IAAAmU,GAAA,KAAAA,OAAAzY,MAAAud,IAAA,CAAA9E,EAAAtU,OAAA,MAAA0T,EACA,CACA3Y,EAAAmB,GAAA,CAAAA,CAAA,gBAAApB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC5NA,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAhpB,CAAA,ECHa,aAGb,IAAAipB,EAAA,YACAC,EAAA,YACAC,EAAA,0BACAC,EAAA,yBAAAC,EAAA,WAGAC,EAAA,WAAAD,EAAAE,MAAA,EACAC,EAAA,OAAAH,EAAAE,MAAA,CAAAH,EAAAG,MAAA,OAAAE,EAAA,cAAAL,EAAAG,MAAA,OAGAG,EAAA,CAAA1iB,EAAAuZ,EAAAuD,IAAA,CACA,IAAA6F,EAAA,GACAC,EAAA,GAAAC,EAAA,GAGA,QAAAtjB,EAAA,EAAAA,EAAAS,EAAA7F,MAAA,CAAAoF,IAAA,KAAAujB,EAAA9iB,CAAA,CAAAT,EAAA,CAGAojB,GAAAV,EAAA3I,IAAA,CAAAwJ,IACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,GAAA,IAAAS,EAAAzF,KAAA,CAAAgF,GACAojB,EAAA,GACAE,EAAAD,EACAA,EAAA,GACArjB,KACAqjB,GAAAC,GAAAX,EAAA5I,IAAA,CAAAwJ,IACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,EAAA,OAAAS,EAAAzF,KAAA,CAAAgF,EAAA,GACAsjB,EAAAD,EACAA,EAAA,GACAD,EAAI,KAEJA,EAAApJ,EAAAuJ,KAAAA,GAAAhG,EAAAgG,KAAAA,EACAD,EAAAD,EACAA,EAAA9F,EAAAgG,KAAAA,GAAAvJ,EAAAuJ,KAAAA,EACA,CAGA,OAAA9iB,CAAA,EAGA+iB,EAAA,CAAAlmB,EAAA0c,KAAA4I,EAAAa,SAAA,GAGAnmB,EAAA0gB,OAAA,CAAA4E,EAAAc,GAAA1J,EAAA0J,KAGAC,EAAA,CAAArmB,EAAAigB,KACA0F,EAAAQ,SAAA,GAAAP,EAAAO,SAAA,GAGAnmB,EAAA0gB,OAAA,CAAAiF,EAAA,CAAAnoB,EAAA8oB,IAAArG,EAAAqG,IACA5F,OAAA,CAAAkF,EAAAW,GAAAtG,EAAAsG,KAGAC,EAAA,CAAAxmB,EAAAU,IAAA,CACA,sBAAAV,GAAA9C,MAAA6D,OAAA,CAAAf,EAAA,EACA,gEAiBA,GAdAU,EAAA,CACA+lB,WAAA,GACAP,6BAAA,GACA,GAAAxlB,CAAA,EAWAV,IAAAA,CAPAA,EADA9C,MAAA6D,OAAA,CAAAf,GACAA,EAAAzC,GAAA,CAAAiC,GAAAA,EAAAghB,IAAA,IACAkG,MAAA,CAAAlnB,GAAAA,EAAAlC,MAAA,EACGuB,IAAA,MAEHmB,EAAAwgB,IAAA,IAGAljB,MAAA,CACA,SAGA,IAAAof,EAAAhc,CAAA,IAAAA,EAAAimB,MAAA,CACAxjB,GAAAA,EAAAuZ,WAAA,GACAvZ,GAAAA,EAAAyjB,iBAAA,CAAAlmB,EAAAimB,MAAA,EACA1G,EAAAvf,CAAA,IAAAA,EAAAimB,MAAA,CACAxjB,GAAAA,EAAA8c,WAAA,GAAA9c,GAAAA,EAAA0jB,iBAAA,CAAAnmB,EAAAimB,MAAA,EAGA,GAAA3mB,IAAAA,EAAA1C,MAAA,CACA,OAAAoD,EAAA+lB,UAAA,CAAAxG,EAAAjgB,GAAA0c,EAAA1c,EAAA,CAEA,IAAA8mB,EAAA9mB,IAAA0c,EAAA1c,GAmBA,OAhBA8mB,GACA9mB,CAAAA,EAAA6lB,EAAA7lB,EAAA0c,EAAAuD,EAAA,EAEAjgB,EAAAA,EAAA0gB,OAAA,CAAA+E,EAAA,IAIAzlB,EADAU,EAAAwlB,4BAAA,CACGA,EAAAlmB,EAAA0c,GAEHA,EAAA1c,GAGAU,EAAA+lB,UAAA,EACAzmB,CAAAA,EAAAigB,EAAAjgB,EAAA+mB,MAAA,KAAA/mB,EAAAtC,KAAA,KAGA2oB,EAAArmB,EAAAigB,EAAA,CAGA9jB,CAAAA,EAAAC,OAAA,CAAAoqB,EACsBrqB,EAAAC,OAAA,SAAAoqB,CAAA,cAAA3qB,CAAA,CAAAO,CAAA,CAAAL,CAAA,EChHT,aAEboD,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAuB,EAAG,GACxD1C,EAAAyhF,mBAAyB,CAAAzhF,EAAA0hF,eAAiC,CAAA1hF,EAAAmnE,iBAAA,CAAAnnE,EAAA2hF,aAAA,QAC1D,IAAAC,EAAoBjiF,EAA2B,MAC/Cw+C,EAAAx+C,EAAA,MAMAgiF,EAAA,OAAAl7B,KAAAA,CAAA,CAAA77C,MAAAA,CAAA,IACAsW,QAAAI,OAAA,IAAAthB,EAAAmnE,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAA,CAAA,GAEA5K,CAAAA,EAAA2hF,aAAA,CAAAA,EAIA,IAAAxa,EAAA,EAAA1gB,KAAAA,CAAA,CAAA77C,MAAAA,CAAA,IACA,GAAAg3E,EAAAC,iBAAA,GAAAj3E,EAAAmU,QAAA,GAAAo/B,EAAAa,gBAAA,CAAAjgC,QAAA,GAAA0nC,EAAA1nC,QAAA,IAAAo/B,EAAAiI,2BAAA,CAEApmD,CAAAA,EAAAmnE,iBAAA,CAAAA,EAMA,IAAAua,EAAA,EAAAI,MAAAA,CAAA,CAAAl3E,MAAAA,CAAA,IACAsW,QAAAI,OAAA,IAAAthB,EAAAyhF,mBAAA,GAAAK,MAAAA,EAAAl3E,MAAAA,CAAA,GAEA5K,CAAAA,EAAA0hF,eAAA,CAAAA,EAIA,IAAAD,EAAA,EAAAK,MAAAA,CAAA,CAAAl3E,MAAAA,CAAA,KACA,IAAA3G,EAAAlB,OAAAkC,OAAA,CAAA68E,GAAA3gF,GAAA,KACA,IAAA8B,EAAAwjD,EAAA,CAAAj9C,EACAvF,EAAA,GAAAjE,EAAAmnE,iBAAA,GACA1gB,KAAAA,EACS77C,MAAAA,CACT,GACA,OACA20C,QAAAt7C,EACAhB,KAAAA,EACAwjD,KAAAA,CACK,CACL,GACAs7B,EAAA99E,EAAAoX,MAAA,EAAAC,EAAA,CAAAikC,QAAAA,CAAA,CAAAt8C,KAAAA,CAAA,CAAAwjD,KAAAA,CAAA,IACA,EACAv+C,SAAA,CACA,GAAAoT,EAAApT,QAA0B,CACb,CAAAjF,EAAA,EAAAs8C,QAAAA,EAAAkH,KAAAA,CAAA,CACb,CACK,GACL,CAAAv+C,SAAA,KACA,OACAA,SAAA65E,EAAA75E,QAAA,CAEA,CACAlI,CAAAA,EAAAyhF,mBAAA,CAAAA,CAAA,gBAAAhiF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC3Da,aAKboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAA0B,CAAA0C,MAAA,KAC1C1C,EAAAgiF,KAAA,CAAgBhiF,EAAAiiF,eAAQ,CAAOjiF,EAAAkiF,WAAA,CAAAliF,EAAAmiF,uBAAA,CAAAniF,EAAAoiF,wBAAA,CAAApiF,EAAAqiF,kBAAA,CAAAriF,EAAAsiF,sBAAA,CAAAtiF,EAAAuiF,WAAA,CAAAviF,EAAAwiF,UAAA,CAAAxiF,EAAAyiF,oBAAA,CAAAziF,EAAA0iF,sBAAA,CAAA1iF,EAAAiyB,KAAA,QAC/B,IAAA0wD,EAAAhjF,EAAoB,MACpBw+C,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAA0B,MAC1BijF,EAAajjF,EAAwB,MAOrC,eAAA6iF,EAAAz1B,CAAA,CAAAsN,CAAA,CAAA3R,CAAA,EACA3kD,KAAAA,IAAAs2D,GACAA,CAAAA,EAAAtN,EAAA9hD,MAAA,CAAApJ,SAAA,EAEA,IAAA4kD,EAAAx+B,EAAAM,OAAA,CAAAs6D,QAAA,GACArjC,EAAA,MAAA8iC,EAAAv1B,EAAAsN,EAAA5T,EAAA5kD,SAAA,CAAA6mD,GACAlnD,EAAA,IAAAymB,EAAAukC,WAAA,CAGA,OAFAhrD,EAAA+D,GAAA,IAAAi6C,GACA,MAAAuN,EAAApmC,IAAA,CAAAnlB,EAAA,CAAAilD,EAAA,EACAA,EAAA5kD,SAAA,CAWA,eAAA0gF,EAAAx1B,CAAA,CAAAsN,CAAA,CAAA3R,EAAA,GACA,OAAAk6B,EAAA1jC,KAAA,CAAA4jC,QAAA,OAAAN,EAAAz1B,EAAAsN,EAAA3R,GAAAA,EACA,CAEA,eAAA45B,EAAAv1B,CAAA,CAAAsN,CAAA,CAAA5T,CAAA,CAAAiC,EAAA,GACA,IAAAlJ,EAAA,CACAv3B,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAoO,EAAA9hD,MAAA,CAAApJ,SAAA,CACA+8C,iBAAA6H,EACA5H,MAAA+jC,EAAAv6B,UAAA,CAAA3vC,IAAA,CACA7N,SAAA,MAAAkiD,EAAAnlD,UAAA,CAAA05D,iCAAA,CAAAshB,EAAAv6B,UAAA,CAAA3vC,IAAA,EACSqmC,UAAAZ,EAAAa,gBAAA,GAETb,EAAAe,KAAA,CAAA6jC,yBAAA,CAAA5kC,EAAAa,gBAAA,CAAAyH,EAAAiC,EAAA2R,EAAA,MACA,CACA,OAAA7a,CACA,CAEA,eAAA6iC,EAAAt1B,CAAA,CAAA5C,CAAA,CAAAv/C,CAAA,CAAA89C,CAAA,EACA3kD,KAAAA,IAAA6G,GACAA,CAAAA,EAAAmiD,EAAA9hD,MAAA,CAAApJ,SAAA,EAEA,IAAA4kD,EAAAx+B,EAAAM,OAAA,CAAAs6D,QAAA,GACAG,EAAA/6D,EAAAM,OAAA,CAAAs6D,QAAA,GACArhF,EAAA,IAAAymB,EAAAukC,WAAA,CASA,OARAhrD,EAAA+D,GAAA,UAAA+8E,EAAAv1B,EAAAA,EAAA9hD,MAAA,CAAApJ,SAAA,CAAA4kD,EAAA5kD,SAAA,CAAA6mD,GAAAzgC,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAoO,EAAA9hD,MAAA,CAAApJ,SAAA,CACA+8C,iBAAAokC,EAAAnhF,SAAA,CACAg9C,MAAA,IACAh0C,SAAA,MAAAkiD,EAAAnlD,UAAA,CAAA05D,iCAAA,MACKviB,UAAAZ,EAAAa,gBAAA,GACLb,EAAAe,KAAA,CAAAC,4BAAA,CAAAhB,EAAAa,gBAAA,CAAAyH,EAAA5kD,SAAA,CAAAmhF,EAAAnhF,SAAA,CAAA+I,GAAAuzC,EAAAe,KAAA,CAAA+jC,uBAAA,CAAA9kC,EAAAa,gBAAA,CAAAyH,EAAA5kD,SAAA,CAAAmhF,EAAAnhF,SAAA,CAAAkrD,EAAA9hD,MAAA,CAAApJ,SAAA,IAAAsoD,IACA,MAAA4C,EAAApmC,IAAA,CAAAnlB,EAAA,CAAAilD,EAAAu8B,EAAA,EACA,CAAAv8B,EAAA5kD,SAAA,CAAAmhF,EAAAnhF,SAAA,EAGA,eAAAugF,EAAAr1B,CAAA,CAAAnO,CAAA,CAAA6H,CAAA,CAAA77C,CAAA,CAAAC,CAAA,EAIA,OAHA9G,KAAAA,IAAA8G,GACAA,CAAAA,EAAA,MAAAkiD,EAAAnlD,UAAA,CAAA05D,iCAAA,OAEA,CACAr5C,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAoO,EAAA9hD,MAAA,CAAApJ,SAAA,CACA+8C,iBAAAA,EACAC,MAAA,IACAh0C,SAAAA,EACSk0C,UAAAZ,EAAAa,gBAAA,GAETb,EAAAe,KAAA,CAAAC,4BAAA,CAAAhB,EAAAa,gBAAA,CAAAyH,EAAA7H,EAAAh0C,GACA,CAGA,eAAAu3E,EAAAp1B,CAAA,CAAAhO,CAAA,CAAAl+C,CAAA,EACA,IAAAya,EAAA2M,EAAAM,OAAA,CAAAs6D,QAAA,GACArhF,EAAA,IAAAymB,EAAAukC,WAAA,CASA,OARAhrD,EAAA+D,GAAA,CAAA0iB,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAoO,EAAA9hD,MAAA,CAAApJ,SAAA,CACA+8C,iBAAAtjC,EAAAzZ,SAAA,CACAg9C,MAAAh+C,EACAgK,SAAA,MAAAkiD,EAAAnlD,UAAA,CAAA05D,iCAAA,CAAAzgE,GACKk+C,UAAAA,CACL,IACA,MAAAgO,EAAApmC,IAAA,CAAAnlB,EAAA,CAAA8Z,EAAA,EACAA,CACA,CAEA,eAAA4mE,EAAAn1B,CAAA,CAAA+tB,CAAA,EACA,IAAAoI,EAAA,MAAAn2B,EAAAzF,cAAA,CAAAwzB,GACA,GAAAoI,IAAA,GAAAA,EACA,iDAEA,SAAAN,EAAAO,eAAA,EAAAD,EAAAr4B,WAAA,CAAAnpD,IAAA,CACA,CAEA,eAAAugF,EAAAl1B,CAAA,CAAA+tB,CAAA,EACA,IAAAoI,EAAA,MAAAn2B,EAAAzF,cAAA,CAAAwzB,GACA,GAAAoI,IAAA,GAAAA,EACA,4CAEA,SAAAN,EAAAQ,kBAAA,EAAAF,EAAAr4B,WAAA,CAAAnpD,IAAA,CACA,CAEA,SAAAsgF,EAAAqB,CAAA,EACA,WAAAniE,QAAA,GAAAoiE,WAAAhiE,EAAA+hE,GACA,CA9GArjF,EAAAiyB,KAAA,CAAA0wD,EAAA/W,YAAA,CAAAjsE,EAAA,OAIAK,EAAA0iF,sBAA4B,GAC5B1iF,EAAAyiF,oBAAA,KAAAx6D,EAAAnJ,SAAA,gDAYA9e,EAAAwiF,UAAA,CAAAA,EAYAxiF,EAAAuiF,WAAA,CAAAA,EAcAviF,EAAAsiF,sBAAA,CAAAA,EAkBAtiF,EAAAqiF,kBAAA,CAAAA,EAgBAriF,EAAAoiF,wBAAA,CAAAA,EAcApiF,EAAAmiF,uBAAA,CAAAA,EAQAniF,EAAAkiF,WAAA,CAAAA,EAQAliF,EAAAiiF,eAAA,CAAAA,EAIAjiF,EAAAgiF,KAAA,CAAAA,CAAA,gBAAAviF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC1Ha,aAMboD,OAAA8L,cAAc,CAAA7O,EAAA,aAA2B,CAAA0C,MAAA,EAAmB,GAC5D1C,EAAAknB,GAAA,CAAAlnB,EAAgBg/C,gBAAQ,CAAOh/C,EAAAujF,QAAA,CAAAvjF,EAAAo/C,WAAA,CAAAp/C,EAAAomD,2BAAA,CAAApmD,EAAAohD,IAAA,CAAAphD,EAAAwjF,YAAA,CAAAxjF,EAAAyjF,WAAA,CAAAzjF,EAAA0jF,GAAA,CAAA1jF,EAAA2jF,QAAA,CAAA3jF,EAAA4jF,OAAA,CAAA5jF,EAAA6jF,cAAA,CAAA7jF,EAAAmhD,GAAA,CAAAnhD,EAAA8jF,QAAA,CAAA9jF,EAAA+jF,OAAA,CAAA/jF,EAAAgkF,qBAAA,CAAAhkF,EAAAikF,QAAA,QAC/B,IAAAtB,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,IAAyBK,GACtD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,KAAaK,GAC1C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAuBK,GACpD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAkBK,GAC/C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAgBK,GAC7C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAiBK,GAC9C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAoBK,GACjD2iF,EAAA1iC,YAAmB,CAAAtgD,EAAQ,MAAqBK,GAChD,IAAAkkF,EAAAvkF,EAAA,MACAoD,OAAA8L,cAAA,CAAA7O,EAAA,YAAAgsB,WAAwD,GAAEjJ,IAAA,kBAAAmhE,EAAqCD,QAAA,IAC/FlhF,OAAA8L,cAAA,CAAA7O,EAAA,wBAA4C,CAAAgsB,WAAA,GAAAjJ,IAAqC,kBAAAmhE,EAAiCF,qBAAA,IAClHjhF,OAAA8L,cAAA,CAAA7O,EAAA,WAA2CgsB,WAAE,GAAAjJ,IAAA,kBAAqCmhE,EAAAH,OAAA,IAClFhhF,OAAA8L,cAAA,CAAA7O,EAAA,WAAwC,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAmhE,EAAAJ,QAA6B,IAC1G/gF,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAAmD,GAAAjJ,IAAA,kBAAAmhE,EAAqC/iC,GAAA,IACxFp+C,OAAA8L,cAAA,CAAA7O,EAAA,iBAA4C,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAmhE,EAAAL,cAAiC,IAClH9gF,OAAA8L,cAAA,CAAA7O,EAAA,WAA2CgsB,WAAE,GAAAjJ,IAAA,kBAAqCmhE,EAAAN,OAAA,IAClF7gF,OAAA8L,cAAA,CAAA7O,EAAA,WAAwC,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAmhE,EAAAP,QAA6B,IAC1G5gF,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAAgD,GAAAjJ,IAAA,kBAAAmhE,EAAqCR,GAAA,IACrF3gF,OAAA8L,cAAA,CAAA7O,EAAA,eAA+CgsB,WAAE,GAAAjJ,IAAA,kBAAqCmhE,EAAAT,WAAA,IACtF1gF,OAAA8L,cAAA,CAAA7O,EAAA,eAAyC,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAmhE,EAAAV,YAA8B,IAC5GzgF,OAAA8L,cAAA,CAAA7O,EAAA,QAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAmhE,EAAA9iC,IAAA,IAEAuhC,EAAA1iC,YAAkB,CAAAtgD,EAAQ,MAAmBK,GAC7C,IAAAm+C,EAAAx+C,EAAA,MACAoD,OAAA8L,cAAA,CAAA7O,EAAA,8BAAgD,CAAAgsB,WAAA,GAAAjJ,IAAqC,kBAAAo7B,EAAmCiI,2BAAC,IACzHrjD,OAAA8L,cAAA,CAAA7O,EAAA,cAA6C,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAo7B,EAAAiB,WAA8B,IAChHr8C,OAAA8L,cAAA,CAAA7O,EAAA,YAAAgsB,WAAqD,GAAAjJ,IAAA,kBAAAo7B,EAAqCe,KAAA,IAC1Fn8C,OAAA8L,cAAA,CAAA7O,EAAA,mBAAwC,CAAAgsB,WAAA,GAAAjJ,IAAA,UAAqC,QAAAo7B,EAA4Ba,gBAAA,IACzGj8C,OAAA8L,cAAA,CAAA7O,EAAA,OAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAo7B,EAAAj3B,GAAA,mBAAAznB,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECvCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAoC,CAAA0C,MAAA,KACpC1C,EAAAmkF,yBAAyB,CAAAnkF,EAAOokF,kBAA0B,QAC1D,IAAAxC,EAAoBjiF,EAA2B,MAC/Cw+C,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAAoB,MACpB0kF,EAAA1kF,EAAoC,MACpCykF,EAAA,OAAAr3B,SAAAA,CAAA,CAAAtG,KAAAA,CAAA,CAAA77C,MAAAA,EAAAmiD,EAAA9hD,MAAA,CAAApJ,SAAA,CAAAumB,MAAAA,EAAA2kC,EAAA9hD,MAAA,CAAApJ,SAAA,CAAAyiF,cAAAA,EAAAr8D,EAAAM,OAAA,CAAAs6D,QAAA,OAEA,IAAA0B,EAAA,MAAApmC,EAAAe,KAAA,CAAAslC,iCAAA,CAAAz3B,EAAAnlD,UAAA,EACA,SAAA5H,EAAAmkF,yBAAA,GACAp3B,SAAAA,EACAtG,KAAAA,EACA89B,yBAAAA,EACA35E,MAAAA,EACAwd,MAAAA,EACKk8D,cAAAA,CACL,EACA,CACAtkF,CAAAA,EAAAokF,kBAAA,CAAAA,EACA,IAAAD,EAAA,EAAAp3B,SAAAA,CAAA,CAAAtG,KAAAA,CAAA,CAAA89B,yBAAAA,CAAA,CAAA35E,MAAAA,EAAAmiD,EAAA9hD,MAAA,CAAApJ,SAAA,CAAAumB,MAAAA,EAAA2kC,EAAA9hD,MAAA,CAAApJ,SAAA,CAAAyiF,cAAAA,EAAAr8D,EAAAM,OAAA,CAAAs6D,QAAA,OACA,IAAA/8B,EAAAw+B,EAAAziF,SAAA,CACA,OACAc,IAAAmjD,EACAtkD,GAAA,IAAAogF,EAAA6C,mBAAA,CAAA13B,EAAA,CACA9kC,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAv2B,EACAw2B,iBAAA0lC,EAAAziF,SAAA,CACAgJ,SAAA05E,EACA1lC,MAAAwlC,EAAAK,kBAAA,CAAAhsE,IAAA,CACaqmC,UAAAZ,EAAAa,gBAAA,GAEbb,EAAAe,KAAA,CAAAC,4BAAA,CAAAhB,EAAAa,gBAAA,CAAAyH,EAAAX,EAAAl7C,GACA,EAAA05E,EAAA,CACA,CACA,CACAtkF,CAAAA,EAAAmkF,yBAAA,CAAAA,CAAA,gBAAA1kF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECrCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA+B,cAAA0C,MAAuB,EAAG,GACzD1C,EAAAkpE,oBAAoB,CAAAlpE,EAAO2kF,eAAoB,CAAA3kF,EAAA4kF,cAAA,QAC/C,IAAAzmC,EAAkBx+C,EAAQ,MAC1BsoB,EAAiBtoB,EAAQ,MACzBklF,EAAAllF,EAAA,IAMAilF,EAAA,OAAA73B,SAAAA,CAAA,CAAAtG,KAAAA,CAAA,CAAA77C,MAAAA,EAAsDmiD,EAAA9hD,MAAa,CAAApJ,SAAA,CAAAumB,MAAAA,EAAA2kC,EAAA9hD,MAAA,CAAApJ,SAAA,KACnE,IAAA09C,EAAA,GAAAslC,EAAA1d,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAAA,CAAA,UACA,MAAAmiD,EAAiBzF,cAAA,CAAA/H,GACjB,CAAAA,QAAAA,EAAAoM,YAAA,MAGA,CACApM,QAAAA,EACAoM,YAAA,GAAA3rD,EAAAkpE,oBAAA,GACAziB,KAAAA,EACAlH,QAAAA,EACA30C,MAAAA,EACawd,MAAAA,CACb,EACA,CACA,CAEApoB,CAAAA,EAAA4kF,cAAA,CAAAA,EAMA,IAAAD,EAAA,OAAA53B,SAAAA,CAAA,CAAA+0B,MAAAA,CAAA,CAAAl3E,MAAAA,EAAAmiD,EAAA9hD,MAAA,CAAApJ,SAAA,KACA,IAAAoC,EAAA,MAAAid,QAAAqkC,GAAA,CAAAxiD,OAAAkC,OAAA,CAAA68E,GAAA3gF,GAAA,QAAA8B,EAAAwjD,EAAA,IACA,IAAAq+B,EAAA,IAAA78D,EAAAnJ,SAAA,CAAA2nC,GACAxiD,EAAA,SAAAjE,EAAA4kF,cAAA,GACA73B,SAAAA,EACAtG,KAAAq+B,EACAl6E,MAAAA,EACSwd,MAAA2kC,EAAA9hD,MAAA,CAAApJ,SAAA,GAET,OACA09C,QAAAt7C,EAAAs7C,OAAA,CACAoM,YAAA1nD,EAAA0nD,WAAA,CACA1oD,KAAAA,EACA6hF,QAAAA,CACK,CACL,IACA/C,EAAA99E,EAAAoX,MAAA,EAAAC,EAAA,CAAAikC,QAAAA,CAAA,CAAAt8C,KAAAA,CAAA,CAAA0oD,YAAAA,CAAA,IACA,EACAzjD,SAAA,CACA,GAAAoT,EAAApT,QAAA,CACa,CAAAjF,EAAA,CAAAs8C,CACb,EACAwlC,0BAAA,CACA,GAAAzpE,EAAAypE,yBAAA,CACa,CAAA9hF,EAAA,CAAA0oD,CACb,EACAnM,aAAAmM,EACA,CACA,GAAArwC,EAAAkkC,YAAA,CACA,CAAAD,EAAAt2C,QAAA,IAAA0iD,CACA,EACArwC,EAAAkkC,YAAA,CACK,EACL,CAAAt3C,SAAA,GAAAs3C,aAAA,GAAAulC,0BAAA,KACA,OACA78E,SAAA65E,EAAA75E,QAAA,CACA68E,0BAAAhD,EAAAgD,yBAAA,CACAvlC,aAAAz8C,OAAAwW,MAAA,CAAAwoE,EAAAviC,YAAA,CACA,CACA,CACAx/C,CAAAA,EAAA2kF,eAAA,CAAAA,EAKA,IAAAzb,EAA4B,EAAA3pB,QAAAA,CAAA,CAAAkH,KAAAA,CAAA,CAAA77C,MAAAA,CAAA,CAAAwd,MAAAA,CAAA,IAAA+1B,EAAAe,KAAA,CAAAiH,uCAAA,CAAAhI,EAAAiI,2BAAA,CAAAjI,EAAAa,gBAAA,CAAAyH,EAAAlH,EAAA30C,EAAAwd,EAC5BpoB,CAAAA,EAAAkpE,oBAAA,CAAAA,CAAA,eAAAzpE,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjFa,aAEboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAAe,CAAA0C,MAAA,KAC/B,IAAAigF,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAUK,GACvC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAWK,GACxC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAUK,GACvC2iF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECPa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA+B,aAAG,CAAA0C,MAAA,EAAwB,GAC1D1C,EAAAijF,uBAAyB,CAAAjjF,EAAAglF,gBAAiC,CAAAhlF,EAAAilF,0BAAA,QAC1D,IAAArD,EAAoBjiF,EAA2B,MAC/Cw+C,EAAkBx+C,EAAQ,MAC1BsoB,EAAAtoB,EAAoB,MACpB0kF,EAAA1kF,EAAA,MAMAslF,EAAA,OAAAl4B,SAAAA,CAAA,CAAAm4B,OAAAA,CAAA,CAAAx8B,SAAAA,CAAA,CAAAH,cAAAA,EAAAwE,EAAA9hD,MAAA,CAAApJ,SAAA,CAAA+mD,gBAAAA,EAAA,QACA,GAAA5oD,EAAAglF,gBAAA,GACAj4B,SAAAA,EACAm4B,OAAAA,EACAx8B,SAAAA,EACAy8B,sBAAA,MAAAhnC,EAAAe,KAAA,CAAAkmC,8BAAA,CAAAr4B,EAAAnlD,UAAA,EACA2gD,cAAAA,EACKK,gBAAAA,CACL,EAEA5oD,CAAAA,EAAAilF,0BAAA,CAAAA,EAMA,IAAAD,EAAA,EAAAj4B,SAAAA,CAAA,CAAAm4B,OAAAA,CAAA,CAAAx8B,SAAAA,CAAA,CAAAy8B,sBAAAA,CAAA,CAAA58B,cAAAA,EAAAwE,EAAA9hD,MAAA,CAAApJ,SAAA,CAAA+mD,gBAAAA,EAAA,SACA,IAAAvqC,EAAA0uC,EAAA9hD,MAAA,CAAApJ,SAAA,CACA,WAAA+/E,EAAA6C,mBAAA,CAAA13B,EAAA,CACA9kC,EAAAw2B,aAAA,CAAAC,aAAA,EACAC,WAAAtgC,EACAugC,iBAAAsmC,EAAArjF,SAAA,CACAg9C,MAAAwlC,EAAAh8B,UAAA,CAAA3vC,IAAA,CACA7N,SAAAs6E,EACSpmC,UAAAZ,EAAAa,gBAAA,GAETb,EAAAe,KAAA,CAAA6jC,yBAAA,CAAA5kC,EAAAa,gBAAA,CAAAkmC,EAAArjF,SAAA,CAAA6mD,EAAAH,EAAAK,GACA,EAAAs8B,EAAA,CACA,CACAllF,CAAAA,EAAAglF,gBAAA,CAAAA,EACA,IAAA/B,EAAA,EAAAl2B,SAAAA,CAAA,CAAAtG,KAAAA,CAAA,CAAA4+B,gBAAAA,CAAA,CAAArc,GAAAA,CAAA,CAAA7e,OAAAA,CAAA,IACA,IAAAy3B,EAAA6C,mBAAA,CAAA13B,EAAA,CACA5O,EAAAe,KAAA,CAAA+jC,uBAAA,CAAA9kC,EAAAa,gBAAA,CAAAyH,EAAAuiB,EAAAqc,EAAAxjF,SAAA,IAAAsoD,GACA,EAAAk7B,EAAA,CAEArlF,CAAAA,EAAAijF,uBAAA,CAAAA,CAAA,gBAAAxjF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EChDa,aAEboD,OAAA8L,cAAe,CAAA7O,EAAA,cAAA0C,MAAA,KACf1C,EAAAslF,OAAA,MAAoB,EACpB,IAAAnnC,EAAiBx+C,EAAQ,MACzBklF,EAAAllF,EAAyB,MACzB4lF,EAAA5lF,EAAA,MACA2lF,EAAA,MAAAv4B,EAAAm4B,EAAAt6E,EAAAmiD,EAAA9hD,MAAA,CAAApJ,SAAA,IAEA,IAAA2jF,EAAAz4B,EAAA9hD,MAAA,CAAApJ,SAAA,CAEAL,EAAA,SAAA+jF,EAAAN,0BAAA,GACAl4B,SAAAA,EACAm4B,OAAAA,EACAx8B,SAAA,EACKH,cAAAi9B,CACL,GAEA,CAAAjmC,QAAAA,CAAA,CAAAoM,YAAAA,CAAA,WAAAk5B,EAAAD,cAAA,GACA73B,SAAAA,EACAtG,KAAAy+B,EAAArjF,SAAA,CACA+I,MAAAA,EACKwd,MAAA2kC,EAAA9hD,MAAA,CAAApJ,SAAA,GASL,OAPA8pD,GACAnqD,EAAAg+C,YAAA,CAAAhgD,IAAA,CAAAmsD,GAGAnqD,EAAAg+C,YAAA,CAAAhgD,IAAA,CAAA2+C,EAAAe,KAAA,CAAA+jC,uBAAA,CAAA9kC,EAAAa,gBAAA,CAAAkmC,EAAArjF,SAAA,CAAA09C,EAAAimC,EAAA,OAAArnC,EAAAj3B,GAAA,MAEA1lB,EAAAg+C,YAAA,CAAAhgD,IAAA,CAAA2+C,EAAAe,KAAA,CAAAumC,6BAAA,CAAAtnC,EAAAa,gBAAA,CAAAkmC,EAAArjF,SAAA,mBAAA2jF,EAAA,KACAhkF,CACA,CACAxB,CAAAA,EAAAslF,OAAA,CAAAA,CAAA,gBAAA7lF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA0B,cAAA0C,MAA6B,KACvD1C,EAAAmjF,eAAgB,CAAAnjF,EAAAojF,kBAAe,CAAApjF,EAAAqoD,UAAA,CAAAroD,EAAA0kF,kBAAA,CAAA1kF,EAAA0lF,YAAA,CAAA1lF,EAAA2lF,eAAA,CAAA3lF,EAAA4lF,YAAA,CAAA5lF,EAAA6lF,cAAA,CAAA7lF,EAAA8lF,WAAA,QAC/B,IAAAnD,EAAAhjF,EAAyB,MACzBiiF,EAAAjiF,EAA0C,MAC1ComF,EAAoBpD,EAAA/W,YAAQ,CAAAjsE,EAAmB,OAC/Cw+C,EAAAx+C,EAAsB,MACtB,IAAAksB,EAAAlsB,EAAA,MACAoD,OAAA8L,cAAA,CAAA7O,EAAA,eAAAgsB,WAAmD,GAAAjJ,IAAA,kBAAqC8I,EAAApT,MAAA,IACxF1V,OAAA8L,cAAA,CAAA7O,EAAA,kBAAAgsB,WAAA,GAAAjJ,IAAA,kBAAA8I,EAAA3Q,SAAA,IAQA,IAAA0qE,EAAoB,CAAAzqE,EAAAxC,EAAAyC,IAAA2qE,EAAAnkF,MAAA,CAAAuZ,EAAAxC,EAAAyC,EACpBpb,CAAAA,EAAA4lF,YAAA,CAAAA,EAIA,IAAAD,EAAA,CAAAhtE,EAAA,cACAotE,EAAA7nE,IAAA,IAAAvF,EAEA3Y,CAAAA,EAAA2lF,eAAA,CAAAA,EAIA,IAAAD,EAAA,CAAA/sE,EAAA,WACAotE,EAAA7nE,IAAA,GAAAvF,EAEA3Y,CAAAA,EAAA0lF,YAAA,CAAAA,EAIA1lF,EAAA0kF,kBAAA,CAAAvmC,EAAAW,aAAA,CAIA9+C,EAAAqoD,UAAA,CAAAlK,EAAAkK,UAAA,CAOA,IAAA+6B,EAAA,QAKAr4B,EACAC,EAWAI,EACAC,EASAE,EA1BA,IAAAV,EAAA7qD,EAAA0kF,kBAAA,CAAA3rE,MAAA,CAAArX,GACA+kD,EAAA,IAAAm7B,EAAA9iE,SAAA,CAAA+rC,EAAApE,IAAA,EACA77C,EAAA,IAAAg3E,EAAA9iE,SAAA,CAAA+rC,EAAAjgD,KAAA,EACAu/C,EAAAhM,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAV,MAAA,CAGAU,CAAA,IAAAA,EAAAC,cAAA,EACAC,EAAA,KACAC,EAAA,IAAA7M,EAAAj3B,GAAA,MAGA6jC,EAAA,IAAA62B,EAAA9iE,SAAA,CAAA+rC,EAAAE,QAAA,EACAC,EAAA7M,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAG,eAAA,GAEA,IAAArC,EAAAkC,IAAAA,EAAAI,KAAA,CACAC,EAAAL,IAAAA,EAAAI,KAAA,CAkBA,OAfAJ,IAAAA,EAAAM,cAAA,EACAC,EAAAjN,EAAAj3B,GAAA,CAAAI,UAAA,CAAAujC,EAAAQ,QAAA,EACAA,EAAA,KAGAD,EAAA,KACAC,EAAA,IAIAE,EADAV,IAAAA,EAAAS,oBAAA,CACA,KAGA,IAAAs2B,EAAA9iE,SAAA,CAAA+rC,EAAAU,cAAA,EAEA,CACA9E,KAAAA,EACA77C,MAAAA,EACAu/C,OAAAA,EACAY,SAAAA,EACAC,gBAAAA,EACArC,cAAAA,EACAuC,SAAAA,EACAE,kBAAAA,EACAC,SAAAA,EACAE,eAAAA,CACA,CACA,CACAvrD,CAAAA,EAAAojF,kBAAA,CAAAA,EAMA,IAAAD,EAAA,QAKA56B,EASAK,EAbA,GAAAlnD,EAAAR,MAAA,GAAAlB,EAAAqoD,UAAA,CAAA3vC,IAAA,CACA,gCAEA,IAAA4vC,EAAAtoD,EAAAqoD,UAAA,CAAAtvC,MAAA,CAAArX,GAGA6mD,EADAD,IAAAA,EAAAE,mBAAA,CACA,KAGA,IAAAo5B,EAAA9iE,SAAA,CAAAwpC,EAAAC,aAAA,EAEA,IAAAE,EAAAtK,EAAAj3B,GAAA,CAAAI,UAAA,CAAAghC,EAAAG,MAAA,EACAE,EAAAL,IAAAA,EAAAK,aAAA,CAQA,OALAC,EADAN,IAAAA,EAAAO,qBAAA,CACA,KAGA,IAAA+4B,EAAA9iE,SAAA,CAAAwpC,EAAAM,eAAA,EAEA,CACAL,cAAAA,EACAE,OAAAA,EACAC,SAAAJ,EAAAI,QAAA,CACAC,cAAAA,EACAC,gBAAAA,CACA,CACA,CACA5oD,CAAAA,EAAAmjF,eAAA,CAAAA,CAAA,gBAAA1jF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClIa,aAEboD,OAAA8L,cAAa,CAAA7O,EAAA,cAAA0C,MAAA,KACb1C,EAAAgmF,KAAA,MAAqB,EACrB,IAAA9B,EAAAvkF,EAAA,KAIA,OAAAqmF,UAAA9B,EAAA8B,KAAA,CAQA/jF,YAAAgkF,CAAA,CAAAC,CAAA,CAAA1jC,CAAA,CAAAD,CAAA,EACA,MAAA0jC,EAAAC,EAAA1jC,EAAAD,EACA,CACA4jC,IAAAF,CAAA,CAAAC,CAAA,CAAA1jC,CAAA,CAAAD,CAAA,EACA,WAAAyjC,EAAAC,EAAAC,EAAA1jC,EAAAD,EACA,CACA,OAAA6jC,WAAAC,CAAA,EACA,WAAAL,EAAAK,EAAAJ,YAAA,CAAAI,EAAAH,aAAA,CAAAG,EAAA7jC,WAAA,CAAA6jC,EAAA9jC,SAAA,CACA,CACA,CACAviD,EAAAgmF,KAAA,CAAAA,CAAA,gBAAAvmF,CAAA,CAAAO,CAAA,EC1Ba,iBAabsmF,EACAA,EANAvjF,OAAA8L,cAAW,CAAA7O,EAAA,cAAA0C,MAAA,KACX1C,EAAAsmF,GAAA,QAMAA,CADAA,EAIAA,GAAAtmF,CAAAA,EAAAsmF,GAAA,CAAAA,EAAA,IAHA,CAAAA,EAAA,+BACAA,CAAA,CAAAA,EAAA,uBACCA,CAAA,CAAAA,EAAU,OAAW,aACtB,gBAAA7mF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClBa,iBAEb8I,EA0KA89E,EACAA,EA1KAxjF,OAAA8L,cAAmB,CAAG7O,EAAA,aAAkB,CAAA0C,MAAA,KACxC1C,EAAAwmF,WAAA,CAAAxmF,EAAyBymF,OAAA,CAAAzmF,EAAQ0mF,gBAAyB,CAAA1mF,EAAA2mF,gBAAA,CAAA3mF,EAAA4mF,mBAAA,CAAA5mF,EAAA6mF,mBAAA,CAAA7mF,EAAAumF,OAAA,CAAAvmF,EAAA8mF,uBAAA,CAAA9mF,EAAA+mF,WAAA,CAAA/mF,EAAAk/C,KAAA,CAAAl/C,EAAAgnF,YAAA,QAC1D,IAAApF,EAAoBjiF,EAA2B,MAC/Cw+C,EAAoBx+C,EAAQ,MAC5B0kF,EAAA1kF,EAAA,KAIAK,CAAAA,EAAAgnF,YAAA,KAAApF,EAAA9iE,SAAA,+CAIA,OAAAogC,EACAj9C,YAAA4iC,CAAA,EACA,IAAAp5B,CACA,MAAAo5B,IAAA,CAAAA,EACA,KAAAoiD,YAAA,MACA,KAAAC,OAAA,QAAAz7E,CAAAA,EAAA,GAAAzL,EAAA0mF,gBAAA,EAAA7hD,EAAAsiD,OAAA,IAAA17E,KAAA,IAAAA,EAAAA,EAAA,WASA,IAAA27E,aAAA,QACA,KAAAH,YAAA,EAGA,MAAAA,YAAA,KAAArF,EAAA9iE,SAAA,MAAA+lB,IAAA,CAAA0a,OAAA,GAFA,KAAA0nC,YAAA,CAQA,IAAAI,UAAA,CACA,YAAAD,WAAA,CAAAjiC,MAAA,CAAAnlD,EAAAgnF,YAAA,CACA,CAIA,IAAAznC,SAAA,CACA,YAAA1a,IAAA,CAAA0a,OAAA,CAKA,IAAA4nC,SAAA,CACA,YAAAtiD,IAAA,CAAAsiD,OAAA,CAKA,IAAAz+B,UAAA,CACA,YAAA7jB,IAAA,CAAA6jB,QAAA,CAKA,IAAAzlD,MAAA,CACA,YAAA4hC,IAAA,CAAA5hC,IAAA,CAKA,IAAAqkF,QAAA,CACA,YAAAziD,IAAA,CAAAyiD,MAAA,CAKA,IAAA9jD,MAAA,CACA,YAAAqB,IAAA,CAAA0iD,OAAA,CAEApiC,OAAAvgB,CAAA,EACA,SAAA5kC,EAAA+mF,WAAA,OAAAniD,EACA,CACA37B,UAAA,CACA,yBAAAs2C,OAAA,mBAAAmJ,QAAA,kBAAAw+B,OAAA,IAEAM,QAAA,CACA,YAAA3iD,IAAA,CAOA4iD,OAAAvqE,CAAA,EACA,IAAAzR,EACA,gBAAAA,CAAAA,EAAA,KAAAo5B,IAAA,CAAAlW,IAAA,GAAAljB,KAAA,IAAAA,EAAA,OAAAA,EAAAipD,QAAA,CAAAx3C,EAAA,CACA,CACA,CACAld,EAAAk/C,KAAA,CAAAA,EACAz2C,EAAAy2C,EAOAA,EAAA4jC,QAAA,EAAAr8B,EAAAiC,EAAAx9C,EAAA,MACA,IAAAO,EAAAC,EAAAC,EACA,WAAAlD,EAAA,CACA,GAAAyC,CAAA,CAEAq0C,QAAAkH,EAAAx9C,QAAA,GACAy/C,SAAAA,EAEAzlD,KAAA,OAAAwI,CAAAA,EAAAP,EAAAjI,IAAA,GAAAwI,KAAA,IAAAA,EAAAA,EAAA,SAAAg7C,EAAAx9C,QAAA,GAAA3H,KAAA,QACAgmF,OAAA,OAAA57E,CAAAA,EAAAR,EAAAo8E,MAAA,GAAA57E,KAAA,IAAAA,EAAAA,EAAA+6C,EAAAx9C,QAAA,GAAA3H,KAAA,MACK6lF,QAAA,OAAAx7E,CAAAA,EAAAT,EAAAi8E,OAAA,GAAAx7E,KAAA,IAAAA,EAAAA,EAAA46E,EAAAmB,QAAA,EAEL,EAQAxoC,EAAAyoC,IAAA,OAAA//E,EAAA6+C,EAAA5hB,EAAA,MACA,oBAAAA,EAAA6jB,QAAA,CACA,OAAAjgD,EAAAq6E,QAAA,CAAAr8B,EAAA5hB,EAAA6jB,QAAA,CAAA7jB,EACA,CACA,IAAA+iD,EAAA,MAAAhgF,EAAA0/C,cAAA,CAAAb,GACA,IAAAmhC,EACA,YAEA,IAAAt/B,EAAA,GAAA+7B,EAAAlB,eAAA,EAAAyE,EAAAlmF,IAAA,EACA,OAAA+G,EAAAq6E,QAAA,CAAAr8B,EAAA6B,EAAAI,QAAA,CAAA7jB,EACA,EAOA,IAAAkiD,EAAA,CAAAjnF,EAAAkZ,IAAAlZ,KAAAiE,IAAAjE,GACAkZ,KAAAjV,IAAAiV,GACAlZ,EAAAy/C,OAAA,GAAAvmC,EAAAumC,OAAA,EACAz/C,EAAAonF,OAAA,GAAAluE,EAAmBkuE,OAAA,CACnBlnF,EAAA+mF,WAAA,CAAAA,EACA,IAAAc,EAAA,CACAtoC,QAAAv/C,EAAAgnF,YAAA,CAAA/9E,QAAA,GACAhG,KAAA,SACAqkF,OAAA,MACA5+B,SAAA,EACA6+B,QAAA,mIACA,EACAO,EAAA,CACAvoC,QAAApB,EAAAiB,WAAA,CAAAn2C,QAAA,GACAhG,KAAA,cACAqkF,OAAA,MACA5+B,SAAA,EACA6+B,QAAA,mIACA,EAIAT,EAAgC,KAChC,mBAAwB5nC,EAAA,IAAAjtB,CAAA,CAAAk1D,QAAAZ,EAAmCwB,WAAA,GAC3DC,OAAA,IAAA9oC,EAAA,IAAyBjtB,CAAA,CAAAk1D,QAAAZ,EAAA0B,MAAA,GACzBC,QAAA,IAAAhpC,EAAA,IAA0BjtB,CAAA,CAAAk1D,QAAAZ,EAAA4B,OAAA,GACzBC,SAAA,IAAAlpC,EAAA,IAAAjtB,CAAA,CAAAk1D,QAAAZ,EAAAmB,QAAA,EACD,EACA1nF,CAAAA,EAAA8mF,uBAAA,CAAAA,EAIAP,CADAA,EAKAA,GAAAvmF,CAAAA,EAAAumF,OAA2B,CAAAA,EAAA,IAJ3B,CAAAA,EAAA,+BACAA,CAAA,CAAAA,EAAA,uBACAA,CAAA,CAAAA,EAAA,qBACCA,CAAA,CAAAA,EAAc,QAAe,iBAE9BvmF,EAAA6mF,mBAAA,EACA,eAAAN,EAAAwB,WAAA,CACAC,OAAAzB,EAAA0B,MAAA,CACAC,QAAA3B,EAAA4B,OAAA,CACAC,SAAA,GACA,EACApoF,EAAA4mF,mBAAA,CAAA7jF,OAAAkC,OAAA,CAAAjF,EAAA6mF,mBAAA,EAAAxrE,MAAA,EAAAC,EAAA,CAAA4rE,EAAA37E,EAAA,QAAA+P,CAAA,EAAA/P,EAAA,CAAA27E,CAAA,OAMA,IAAAP,EAAwB,GAAA3mF,EAAA6mF,mBAAA,CAAAK,EAAA,CACxBlnF,EAAA2mF,gBAAA,CAAAA,EAMA,IAAAD,EAAwB,GAAA1mF,EAAA4mF,mBAAA,CAAAr7E,EAAA,CACxBvL,EAAA0mF,gBAAA,CAAAA,EAMA1mF,EAAAymF,OAAA,IAAAzmF,EAAA8mF,uBAAA,EAAAe,GAIA7nF,EAAAwmF,WAAA,IAAAxmF,EAAA8mF,uBAAA,EAAAgB,EAAA,gBAAAroF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjNa,aAEboD,OAAA8L,cAAmB,CAAA7O,EAAA,cAAA0C,MAAA,KACnB1C,EAAAqoF,WAAgB,QAChB,IAAA1F,EAAAhjF,EAAoB,MACpBw+C,EAAAx+C,EAA4B,MAC5BukF,EAAAvkF,EAAwC,MACxCmsB,EAAA62D,EAAA/3D,eAAA,CAAAjrB,EAAA,MACA,OAAA0oF,UAAAnE,EAAAmE,WAAA,CAEApmF,YAAAgwB,CAAA,CAAAk4B,CAAA,EACA,MAAAl4B,EAAAk4B,EAAA+5B,EAAAT,WAAA,CACA,CACA0C,IAAAl0D,CAAA,CAAAk4B,CAAA,EAEA,WAAAk+B,EAAAp2D,EAAAk4B,EACA,CAOA,OAAA/mC,MAAA6O,CAAA,CAAAq2D,CAAA,EACA,IAAAx2D,EAAA,GAAAoyD,EAAAqE,qBAAA,EAAAt2D,EAAAq2D,EAAA,SACA,WAAAD,EAAAp2D,EAAAH,EACA,CAMA02D,gBAAA5jD,CAAA,EACA,WAAAyjD,EAAA,KAAAp2D,KAAA,MAAAwuB,KAAA,GAAAJ,GAAA,KAAAv0B,EAAAhF,OAAA,IAAAo9D,EAAAL,cAAA,EAAAj/C,GAAA37B,QAAA,KACA,CAIAA,UAAA,CACA,iCAAAgpB,KAAA,CAAAhpB,QAAA,oBAAAw/E,OAAA,KAKAjB,QAAA,CACA,OACA,SAAAA,MAAA,GACAkB,MAAA,GACAjiC,KAAA,KAAAx0B,KAAA,CAAAstB,OAAA,CACA+oC,SAAA,KAAAG,OAAA,EACA,CACA,CAKAhoC,OAAA,CACA,WAAAtC,EAAAj3B,GAAA,MAAAgX,GAAA,CAAAj1B,QAAA,GACA,CACA,CACAjJ,EAAAqoF,WAAA,CAAAA,CAAA,gBAAA5oF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC5Da,aAEboD,OAAA8L,cAAoB,CAAA7O,EAAG,aAAuB,CAAA0C,MAAA,KAC9C1C,EAAA2oF,YAAmB,CAAA3oF,EAAA4oF,YAAoB,CAAA5oF,EAAA6oF,aAAA,QACvC,IAAAC,EAAAnpF,EAAA,KAIAK,CAAAA,EAAA6oF,aAAA,EACA,UACA,WACA,QACA,YACA,UACA,OACA,UACA,SACA,UACA,OACA,CAMA,IAAAD,EAAA,IACA,IAAAvL,EAAA,GAIA,OAHA0L,EAAAC,MAAA,CAAA77E,OAAA,KACKkwE,CAAA,CAAA/tC,EAAAiQ,OAAA,MAAAupC,EAAA5pC,KAAA,CAAA5P,EACL,GACA+tC,CACA,CACAr9E,CAAAA,EAAA4oF,YAAA,CAAAA,EAMA,IAAAD,EAAA,IACA,IAAAM,EAAA,IAAA3jF,IACA,OAAA0jF,EAAA1+D,MAAA,IAA2B,CAC3B,IAAA4+D,EAAA,GAAAj3D,EAAAstB,OAAA,IAAAttB,EAAAk1D,OAAA,SACA,CAAA8B,EAAA3lE,GAAA,CAAA4lE,KAIAD,EAAA1jF,GAAA,CAAA2jF,GACA,GAEA,EACA,CACAlpF,CAAAA,EAAA2oF,YAAA,CAAAA,CAAA,gBAAAlpF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECnDa,aAEboD,OAAA8L,cAAkB,CAAA7O,EAAA,cAAA0C,MAAA,KAClB1C,EAAAmpF,UAAA,CAAmB,OACnB,IAAAvG,EAAAjjF,EAAA,KAIA,OAAAwpF,EACAlnF,YAAA2I,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CAMA,MAAAw+E,OAAA3iC,CAAA,EACA,gBAAAm8B,EAAAjB,aAAA,GAAAl7B,KAAAA,EAAA77C,MAAA,KAAAA,KAAA,EACA,CAMAy+E,WAAA5iC,CAAA,EACA,SAAAm8B,EAAAzb,iBAAA,GAAA1gB,KAAAA,EAAA77C,MAAA,KAAAA,KAAA,EACA,CAOA,MAAAy/C,SAAAF,CAAA,CAAA6e,CAAA,EACA,OAAA4Z,EAAAW,QAAA,CAAA+F,yBAAA,CAAA1G,EAAA5jC,gBAAA,YAAAoqC,MAAA,CAAAj/B,EAAAl4B,KAAA,CAAAm1D,WAAA,EAAApe,EAAA,KAAAp+D,KAAA,IAAAu/C,EAAA1J,KAAA,GACA,CAOA,MAAAwZ,gBAAA9P,CAAA,CAAA6e,CAAA,EACA,OAAA4Z,EAAAW,QAAA,CAAA34B,gCAAA,CAAAg4B,EAAA5jC,gBAAA,YAAAoqC,MAAA,CAAAj/B,EAAAl4B,KAAA,CAAAm1D,WAAA,EAAAj9B,EAAAl4B,KAAA,CAAAm1D,WAAA,CAAApe,EAAA,KAAAp+D,KAAA,IAAAu/C,EAAA1J,KAAA,GAAA0J,EAAAl4B,KAAA,CAAAy2B,QAAA,CACA,CAOAkR,OAAAzP,CAAA,CAAA6e,CAAA,EACA,OAAA4Z,EAAAW,QAAA,CAAAN,uBAAA,CAAAL,EAAA5jC,gBAAA,CAAAmL,EAAAl4B,KAAA,CAAAm1D,WAAA,CAAApe,EAAA,KAAAp+D,KAAA,IAAAu/C,EAAA1J,KAAA,GACA,CAOA,MAAA8oC,UAAA9iC,CAAA,CAAAr+B,EAAA,KAAAxd,KAAA,EACA,OAAAg4E,EAAAW,QAAA,CAAAp9B,uCAAA,CAAAy8B,EAAAx8B,2BAAA,CAAAw8B,EAAA5jC,gBAAA,CAAAyH,EAAA,WAAA2iC,MAAA,CAAA3iC,GAAA,KAAA77C,KAAA,CAAAwd,EACA,CACA,CACApoB,EAAAmpF,UAAA,CAAAA,CAAA,gBAAA1pF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjEa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAA,KAC9B1C,EAAAwpF,sBAAyB,QACzB,IAAA5H,EAAoBjiF,EAA2B,MAC/Cw+C,EAAkBx+C,EAAQ,MAC1BsoB,EAAiBtoB,EAAQ,MACzBklF,EAAAllF,EAAoB,IACpBuoB,EAAmBvoB,EAAQ,MAC3BijF,EAAiBjjF,EAAQ,MACzB8pF,EAAA9pF,EAAoB,MACpB0kF,EAAmB1kF,EAAQ,MAC3BmpF,EAAAnpF,EAAA,KAIA,OAAA6pF,UAAA5H,EAAA8H,uBAAA,CACAznF,YAAA8qD,CAAA,EACA,MAAAA,EACA,CAIA,MAAA48B,cAAA,CAAAzE,OAAAA,EAAAj9D,EAAAM,OAAA,CAAAs6D,QAAA,GAAAxoB,UAAAA,EAAA,KAAAuvB,SAAA,CAAAlhC,SAAAA,EAAAxgC,EAAAw6D,sBAAA,MACA,IAAAljC,EAAA,SAAAt3B,EAAAo6D,sBAAA,OAAAv1B,QAAA,CAAAsN,EAAA6qB,EAAArjF,SAAA,CAAA6mD,GACA,OACAz2B,MAAA62D,EAAA5pC,KAAA,CAAA4jC,QAAA,CAAAoC,EAAArjF,SAAA,CAAA6mD,GACAlnD,GAAA,KAAAqoF,KAAA,CAAArqC,EAAA,CAAA0lC,EAAA,CACA,CACA,CAIA,MAAA4E,WAAA,CAAA3/B,OAAAA,CAAA,CAAA7gC,OAAAA,CAAA,CAAAygE,YAAAA,CAAA,GACA,IAAAC,EAAA,KAAAH,KAAA,GACA,IAAAvgE,EAAA,CACA,IAAA2gE,EAAA,WAAArF,cAAA,EACan+B,KAAA0D,EAAAl4B,KAAA,CAAAm1D,WAAA,GAEb4C,EAAAppE,MAAA,CAAAqpE,EAAAt+B,WAAA,EACAriC,EAAA2gE,EAAA1qC,OAAA,CACA,OACAyqC,EAAAppE,MAAA,CAAAgiE,EAAAW,QAAA,CAAA+F,yBAAA,CAAAnrC,EAAAa,gBAAA,CAAA11B,EAAAygE,EAAA,KAAAH,SAAA,IAAAz/B,EAAA1J,KAAA,KACAupC,CACA,CAIA,MAAA3/B,SAAA,CAAAF,OAAAA,CAAA,CAAA7gC,OAAAA,CAAA,CAAA0/C,GAAAA,CAAA,GACA,IAAAkhB,EAAA,WAAAtF,cAAA,EACAn+B,KAAA0D,EAAAl4B,KAAA,CAAAm1D,WAAA,CACSx8E,MAAAo+D,CACT,GACAghB,EAAA,WAAAF,UAAA,EACA3/B,OAAAA,EACA7gC,OAAAA,EACSygE,YAAAG,EAAA3qC,OAAA,GAGT,OADAyqC,EAAAl7D,OAAA,CAAAo7D,EAAAv+B,WAAA,EACAq+B,CACA,CAIA,MAAAzH,YAAgB,CAAA2C,OAAAA,EAAYj9D,EAAAM,OAAA,CAAAs6D,QAAA,GAAAxoB,UAAAA,EAAA,KAAAuvB,SAAA,CAAAlhC,SAAAA,EAAAxgC,EAAAw6D,sBAAA,MAC5B,IAAAzwD,MAAAA,CAAA,CAAAzwB,GAAAA,CAAA,aAAAmoF,aAAA,EACAzE,OAAAA,EACA7qB,UAAAA,EACS3R,SAAAA,CACT,GAEA,OADA,MAAAlnD,EAAA2oF,OAAA,GACAl4D,CACA,CAKA,MAAA0vD,cAAA,CAAAl7B,KAAAA,CAAA,CAAA77C,MAAAA,EAAA,KAAAg/E,SAAmD,GACnD,gBAAA/E,EAAAlD,aAAA,GAAAl7B,KAAAA,EAAA77C,MAAAA,CAAA,EACA,CAKA,MAAA82E,gBAAA,CAAAI,MAAAA,CAAA,CAAAl3E,MAAAA,EAAA,KAAAg/E,SAAqD,GACrD,gBAAA/E,EAAAnD,eAAA,GAAAI,MAAAA,EAAAl3E,MAAAA,CAAA,EACA,CAKA,MAAAg6E,eAAA,CAAAn+B,KAAAA,CAAA,CAAA77C,MAAAA,EAAA,KAAAg/E,SAAoD,GACpD,gBAAAH,EAAA7E,cAAA,GAAA73B,SAAA,KAAAA,QAAA,CAAAtG,KAAAA,EAAA77C,MAAAA,CAAA,EACA,CAKA,MAAA+5E,gBAAA,CAAA7C,MAAAA,CAAA,CAAAl3E,MAAAA,EAAA,KAAAg/E,SAAqD,GACrD,gBAAAH,EAAA9E,eAAA,GAAA53B,SAAA,KAAAA,QAAA,CAAA+0B,MAAAA,EAAAl3E,MAAAA,CAAA,EACA,CAMA,MAAAw/E,UAAA3jC,CAAA,CAAA5hB,EAAA,IACA,OAAAikD,EAAA5pC,KAAA,CAAAyoC,IAAA,MAAA56B,QAAA,CAAAnlD,UAAA,CAAA6+C,EAAA5hB,EACA,CAMAwlD,cAAA,CAAAlgC,OAAAA,CAAA,CAAA4/B,YAAAA,CAAA,GACA,YAAAF,KAAA,EACAjH,EAAAW,QAAA,CAAAN,uBAAA,CAAA9kC,EAAAa,gBAAA,CAAAmL,EAAAl4B,KAAA,CAAAm1D,WAAA,CAAA2C,EAAA,KAAAH,SAAA,IAAAz/B,EAAA1J,KAAA,IACA,CACA,CAOA,MAAAmZ,OAAA,CAAAzP,OAAAA,CAAA,CAAA6e,GAAAA,EAAA,KAAA4gB,SAAA,GACA,IAAAM,EAAA,WAAAtF,cAAA,EACAn+B,KAAA0D,EAAAl4B,KAAA,CAAAm1D,WAAA,CACSx8E,MAAAo+D,CACT,GACAghB,EAAA,KAAAK,aAAA,EACAlgC,OAAAA,EACS4/B,YAAAG,EAAA3qC,OAAA,GAGT,OADAyqC,EAAAl7D,OAAA,CAAAo7D,EAAAv+B,WAAA,EACAq+B,CACA,CAMA,MAAAM,UAAA/qC,CAAA,EACA,IAAAsL,EAAA,WAAAvD,cAAA,CAAA/H,UACA,OAAAsL,EACA,KAEA,GAAAw5B,EAAAlB,eAAA,EAAAt4B,EAAAA,WAAA,CAAAnpD,IAAA,CADA,CAQA,MAAA6oF,kBAAAhrC,CAAA,EACA,IAAAirC,EAAA,WAAAljC,cAAA,CAAA/H,UACA,OAAAirC,EACA,KAEA,GAAAnG,EAAAjB,kBAAA,EAAAoH,EAAA3/B,WAAA,CAAAnpD,IAAA,CADA,CASA,MAAA+oF,SAAAhkC,CAAA,CAAA77C,EAAA,KAAAg/E,SAAA,EACA,IAAAc,EAAA,SAAA7F,EAAAlD,aAAA,GAAAl7B,KAAAA,EAAA77C,MAAAA,CAAA,GACA,kBAAA2/E,iBAAA,CAAAG,EACA,CACA,CACA1qF,EAAAwpF,sBAAA,CAAAA,CAAA,gBAAA/pF,CAAA,CAAAO,CAAA,EC5Ka,aAMb+C,OAAA8L,cAAiB,CAAA7O,EAAA,aAAyB,CAAA0C,MAAA,EAAiB,GAC3D1C,EAAA2qF,MAAA,CAAA3qF,EAAA4qF,cAAA,CAAA5qF,EAAA6qF,SAAA,CAAA7qF,EAAA8qF,OAAA,CAAA9qF,EAAA+qF,IAAA,QAIA,IAAAA,EAAA,CAAAl0D,EAAA,GAAArtB,IACA,EAAAwyC,KAAA,IAAAllB,KAAA/yB,IAAA+yB,GAGAttB,EAAAwyC,KAAA,IAAAllB,IAAA,GAAAA,GAGAD,KAAArtB,GAFA,KAHA,MACA,CAMAxJ,EAAA+qF,IAAA,CAAAA,EAYA,IAAAD,EAAe,CAAAnrE,EAAAkX,IAAA,GAAA72B,EAAA2qF,MAAA,EAAAhrE,GAAAkX,EAAAlX,GAAAA,CAAA,CACf3f,EAAA8qF,OAAA,CAAAA,EASA,IAAAD,EAAA,GACAnoF,IAAA,GAAAA,CAEA1C,CAAAA,EAAA6qF,SAAA,CAAAA,EAOA,IAAAD,EAAA,GACAloF,KAAAqB,IAAArB,CAEA1C,CAAAA,EAAA4qF,cAAA,CAAAA,EAOA,IAAAD,EAAA,GACAjoF,MAAAA,CAEA1C,CAAAA,EAAA2qF,MAAA,CAAAA,CAAA,gBAAAlrF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjEa,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAwC,CAAA0C,MAAA,KACxC1C,EAAAgrF,6BAAwB,CAAOhrF,EAAAirF,2BAAA,CAAAjrF,EAAAkrF,8BAAA,CAAAlrF,EAAAmrF,qBAAA,QAC/B,IAAAxI,EAAAhjF,EAAmB,MACnByrF,EAAAzrF,EAAsB,MACtB0rF,EAAmB1rF,EAAQ,MAC3BijF,EAAmBjjF,EAAQ,MAC3B2rF,EAAA3rF,EAAA,MACA4rF,EAA8B5rF,EAA+B,MAC7D6rF,EAAqB7rF,EAAqB,MAC1CgjF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,GAIAA,EAAAmrF,qBAAA,EACAM,WAAA,EACAC,cAAA,GACA,EAIA1rF,EAAAkrF,8BAAA,EACAO,WAAA,GACAC,cAAA,GACA,CAIA,OAAAT,EACAhpF,YAAA0pF,CAAA,CAAAzgF,EAAAmgF,EAAAO,wBAAA,EACA,KAAAD,cAAA,CAAAA,EACA,KAAAzgF,IAAA,CAAAA,CACA,CAIA,MAAAY,mBAAA/D,CAAA,EACA,IAAAU,EAEA,OADA,SAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAnD,UAAA,GAAAU,KAAA,IAAAA,EAAAA,EAAA,aACA,WAAAkjF,cAAA,CAAA7/E,kBAAA,CAAA/D,EACA,CAIA,MAAAurD,mBAAAvrD,CAAA,EACA,IAAAU,CACA,UAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAnD,UAAA,GAAAU,KAAA,IAAAA,EAAAA,EAAA,aACA,IAAAxE,EAAA,WAAA0nF,cAAA,CAAA7/E,kBAAA,CAAA/D,GACA,OAAA9D,EAAA8H,SAAA,CAKA,MAAA8/E,UAAArqF,CAAA,EAAAsqF,UAAAA,EAAA,MAAA5gF,EAAA,MAAAA,IAAA,EACA,GAAA1J,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,+DAEA,IAAAiL,EAAA3K,EAAAqH,SAAA,UACA,EACA,IAAA+5E,EAAAmJ,kBAAA,MAAAJ,cAAA,UAAAH,EAAAQ,gBAAA,OAAAL,cAAA,CAAAx/E,EAAAjB,EAAAA,IAEA,SAAAogF,EAAAW,yBAAA,WAES,IAAArJ,EAAAmJ,kBAAA,MAAAJ,cAAA,UAAAH,EAAAQ,gBAAA,OAAAL,cAAA,CAAAx/E,EAAAjB,EAAAA,IAHT,CASA,MAAAsC,SAAAhM,CAAA,CAAAiH,CAAA,EAEA,IADAgD,EAAcC,EACd,CAAA3D,WAAAA,EAAA,OAAA0D,CAAAA,EAAA,KAAAP,IAAA,CAAAE,mBAAA,GAAAK,KAAA,IAAAA,EAAAA,EAAA,YAAAygF,cAAAA,EAAA,IAAAzjF,KAAA,IAAAA,EAAA,CACAV,WAAA,OAAA2D,CAAAA,EAAA,KAAAR,IAAA,CAAAE,mBAAA,GAAAM,KAAA,IAAAA,EAAAA,EAAA,YACUwgF,cAAA,EACV,EAAAzjF,CAAA,CACA,GAAAyjF,GAAA1qF,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,6DAEA,gBAAAqqF,EAAAY,iCAAA,OAAAR,cAAA,CAAAnqF,EAAAuG,EACA,CACA,CACA/H,EAAAirF,2BAAA,CAAAA,CAIA,OAAAD,EACA/oF,YAAAmqF,CAAA,CAAAlhF,EAAAmgF,EAAAO,wBAAA,EACA,KAAAQ,WAAA,CAAAA,EACA,KAAAlhF,IAAA,CAAAA,CACA,CACA,MAAAY,mBAAA/D,CAAA,EACA,IAAAU,CACA,UAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAE,mBAAA,GAAA3C,KAAA,IAAAA,EAAAA,EAAA,aACA,IACA,IAAAxE,EAAA,MAAAid,QAAA9a,GAAA,MAAAgmF,WAAA,CAAAjrF,GAAA,IAAAkrF,EAAAvgF,kBAAA,CAAA/D,KACA,OAAA9D,CACA,CACA,MAAAoD,EAAA,CACA,GAAAA,aAAAilF,eACA,QAAAlB,EAAAmB,mBAAA,EAAAllF,EAAA,OAGAA,CAAA,CAGA,CACA,MAAAisD,mBAAAvrD,CAAA,EACA,IAAAU,CACA,UAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAE,mBAAA,GAAA3C,KAAA,IAAAA,EAAAA,EAAA,aACA,IACA,IAAAxE,EAAA,MAAAid,QAAA9a,GAAA,MAAAgmF,WAAA,CAAAjrF,GAAA,IAAAkrF,EAAAvgF,kBAAA,CAAA/D,KACA,OAAA9D,EAAA8H,SAAA,CAEA,MAAA1E,EAAA,CACA,GAAAA,aAAAilF,eACA,QAAAlB,EAAAmB,mBAAA,EAAAllF,EAAA,OAGAA,CAAA,CAGA,CACA,MAAAmlF,oBAAAC,CAAA,CAAAnoF,CAAA,EACA,IACA,aAAA4c,QAAA9a,GAAA,MAAAgmF,WAAA,CAAAjrF,GAAA,OAAAyG,GACa,IAAAg7E,EAAAmJ,kBAAA,CAAAnkF,EAAA,SAAA4jF,EAAAQ,gBAAA,EAAApkF,EAAA6kF,EAAAnoF,MAAAA,EAAAA,EAAA,KAAA4G,IAAA,IAEb,CACA,MAAA7D,EAAA,CACA,GAAAA,aAAAilF,eACA,QAAAlB,EAAAmB,mBAAA,EAAAllF,EAAA,OAGAA,CAAA,CAGA,CASA,MAAAwkF,UAAArqF,CAAA,EAAAsqF,UAAAA,EAAA,MAAA5gF,EAAA,MAAAA,IAAA,EACA,GAAA1J,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,+DAEA,IAAAiL,EAAA3K,EAAAqH,SAAA,UACA,EACA,WAAA2jF,mBAAA,CAAArgF,EAAAjB,GAEA,SAAAogF,EAAAW,yBAAA,WAES,WAAAO,mBAAA,CAAArgF,EAAAjB,GAHT,CAYA,MAAAsC,SAAAhM,CAAA,CAAAiH,CAAA,EAEA,IADAgD,EAAcC,EAAAC,EAAAmvD,EACd,CAAA/yD,WAAAA,EAAA,OAAA2D,CAAAA,EAAA,OAAAD,CAAAA,EAAA,KAAAP,IAAA,CAAAE,mBAAA,GAAAK,KAAA,IAAAA,EAAAA,EAAA,KAAAP,IAAA,CAAAnD,UAAA,GAAA2D,KAAA,IAAAA,EAAAA,EAAA,YAAAwgF,cAAAA,EAAA,IAAAzjF,KAAA,IAAAA,EAAA,CACAV,WAAA,OAAA+yD,CAAAA,EAAA,OAAAnvD,CAAAA,EAAA,KAAAT,IAAA,CAAAE,mBAAA,GAAAO,KAAA,IAAAA,EAAAA,EAAA,KAAAT,IAAA,CAAAnD,UAAA,GAAA+yD,KAAA,IAAAA,EAAAA,EAAA,YACUoxB,cAAA,EACV,EAAAzjF,CAAA,CACA,GAAAyjF,GAAA1qF,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,6DAEA,IACA,aAAAggB,QAAA9a,GAAA,MAAAgmF,WAAA,CAAAjrF,GAAA,OAAAyG,GACa,SAAA2jF,EAAAY,iCAAA,EAAAvkF,EAAApG,EAAAuG,IAEb,CACA,MAAAV,EAAA,CACA,GAAAA,aAAAilF,eACA,QAAAlB,EAAAmB,mBAAA,EAAAllF,EAAA,OAGAA,CAAA,CAGA,CACA,CACArH,EAAAgrF,6BAAA,CAAAA,CAAA,gBAAAvrF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7La,aAEboD,OAAA8L,cAAA,CAAA7O,EAAwB,cAAA0C,MAAA,KACxB1C,EAAAgsF,gBAAmB,QACnB,IAAApJ,EAAmBjjF,EAAQ,MAC3B2rF,EAAA3rF,EAAA,MAOAqsF,EAAA,MAAApkF,EAAAuE,EAAA0B,EAAA,CAAA49E,WAAAA,EAAAH,EAAAH,qBAAA,CAAAM,UAAA,CAAAC,cAAAA,EAAAJ,EAAAH,qBAAA,CAAAO,aAAA,EAAAJ,EAAAH,qBAAA,IACA,IAAAlnF,EAAA,MAAA2D,EAAAmG,kBAAA,CAAA5B,EAAA0B,GAiBA,MAfA,WAEA,QAAAvH,EAAA,EAAAA,EAAAmlF,EAAAnlF,IACA,IACA,SAAAs8E,EAAAZ,KAAA,EAAA0J,GACA,MAAA9jF,EAAAmG,kBAAA,CAAA5B,EAAA,CACA,GAAA0B,CAAA,CACiBC,cAAA,EACjB,EACA,CACA,MAAAzG,EAAA,CACA2C,QAAAo3D,IAAA,wCAAA/5D,EACA,CAEA,KACApD,CACA,CACAjE,CAAAA,EAAAgsF,gBAAA,CAAAA,CAAA,gBAAAvsF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EChCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAAyB,cAAA0C,MAAA,KACzB1C,EAAA0sF,iBAAsB,QACtB,IAAArB,EAAmB1rF,EAAQ,MAC3BijF,EAAmBjjF,EAAQ,MAC3B2rF,EAAmB3rF,EAAQ,MAC3BgtF,EAAAhtF,EAA8B,MAC9B6rF,EAAA7rF,EAAA,KAIA,OAAA+sF,EACAzqF,YAAA2qF,CAAA,CAIAC,CAAA,CAAA3hF,EAAAmgF,EAAAO,wBAAA,EACA,KAAAgB,iBAAA,CAAAA,EACA,KAAAC,mBAAA,CAAAA,EACA,KAAA3hF,IAAA,CAAAA,EACA,KAAA4hF,kBAAA,KAAAH,EAAA1B,2BAAA,CAAA2B,EAAA1hF,EACA,CACA,MAAAY,mBAAA/D,CAAA,EACA,IAAAU,EAEA,OADA,SAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAE,mBAAA,GAAA3C,KAAA,IAAAA,EAAAA,EAAA,aACA,WAAAqkF,kBAAA,CAAAhhF,kBAAA,CAAA/D,EACA,CACA,MAAAurD,mBAAAvrD,CAAA,EACA,IAAAU,EAEA,OADA,SAAAV,GAAAA,CAAAA,EAAA,OAAAU,CAAAA,EAAA,KAAAyC,IAAA,CAAAE,mBAAA,GAAA3C,KAAA,IAAAA,EAAAA,EAAA,aACA,WAAAqkF,kBAAA,CAAAx5B,kBAAA,CAAAvrD,EACA,CACA,MAAAykF,oBAAAC,CAAA,CAAAnoF,CAAA,EACA,IAAAyoF,EAAA,IAAAnK,EAAAmJ,kBAAA,MAAAa,iBAAA,UAAApB,EAAAQ,gBAAA,OAAAY,iBAAA,CAAAH,EAAAnoF,MAAAA,EAAAA,EAAA,KAAA4G,IAAA,CAAA5G,MAAAA,EAAAA,EAAAqoF,EAAAxB,qBAAA,GAYA,MAXA,WACA,MAAAjqE,QAAAqkC,GAAA,MAAAsnC,mBAAA,CAAA1rF,GAAA,OAAA6rF,GAAA,CACA,IAAAvkF,EACA,IACA,SAAA+iF,EAAAQ,gBAAA,EAAAgB,EAAAP,EAAAnoF,MAAAA,EAAAA,EAAA,KAAA4G,IAAA,QAAAzC,CAAAA,EAAAnE,MAAAA,EAAA,OAAAA,EAAA2oF,oBAAA,GAAAxkF,KAAA,IAAAA,EAAAA,EAAAkkF,EAAAzB,8BAAA,CACA,CACA,MAAA7jF,EAAA,CACA2C,QAAAo3D,IAAA,2CAAA/5D,EACa,CACJ,GACT,KACA0lF,CACA,CASA,MAAAlB,UAAArqF,CAAA,EAAAsqF,UAAAA,EAAA,MAAA5gF,EAAA,MAAAA,IAAA,EACA,GAAA1J,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,+DAEA,IAAAiL,EAAA3K,EAAAqH,SAAA,UACA,EACA,WAAA2jF,mBAAA,CAAArgF,EAAAjB,GAEA,SAAAogF,EAAAW,yBAAA,WAES,WAAAO,mBAAA,CAAArgF,EAAAjB,GAHT,CAYA,MAAAsC,SAAAhM,CAAA,CAAAiH,CAAA,EAEA,IADAgD,EAAcC,EACd,CAAA3D,WAAAA,EAAA,OAAA0D,CAAAA,EAAA,KAAAP,IAAA,CAAAE,mBAAA,GAAAK,KAAA,IAAAA,EAAAA,EAAA,YAAAygF,cAAAA,EAAA,IAAAzjF,KAAA,IAAAA,EAAA,CACAV,WAAA,OAAA2D,CAAAA,EAAA,KAAAR,IAAA,CAAAE,mBAAA,GAAAM,KAAA,IAAAA,EAAAA,EAAA,YACUwgF,cAAA,EACV,EAAAzjF,CAAA,CACA,GAAAyjF,GAAA1qF,IAAAA,EAAA+K,UAAA,CAAArL,MAAA,CACA,6DAEA,YAAA4rF,kBAAA,CAAAt/E,QAAA,CAAAhM,EAAA,CACAuG,WAAAA,EACSmkF,cAAAA,CACT,EACA,CACA,CACAlsF,EAAA0sF,iBAAA,CAAAA,CAAA,gBAAAjtF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC1Fa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAA,KAC9B1C,EAAAktF,sBAAgB,MAAQ,EACxB,IAAAvK,EAAAhjF,EAAkB,MAClBsoB,EAAAtoB,EAAA,KAKAK,CAAAA,EAAAktF,sBAAqB,KAAAjlE,EAA2BnJ,SAAA,gDAChD6jE,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCXa,IAAAe,EAAAf,EAAA,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAsC,CAAA0C,MAAA,KACtC1C,EAAAmtF,2BAAkB,CAAQntF,EAAiBotF,8BAAA,QAC3C,IAAAnlE,EAAAtoB,EAA0B,MAC1BijF,EAAAjjF,EAAqB,MACrB0tF,EAAA1tF,EAAA,MAKAytF,EAAuB,CAAAE,EAAAC,IAAA,CACvB,IAAA7rF,EAAAhB,EAAAknB,KAAA,CAAAylE,EAAAG,kBAA6C,CAAA90E,IAAA,EAE7C,OADA20E,EAAAG,kBAAA,CAAA7rF,MAAA,EAAAgqD,YAAA,EAAA2hC,MAAAA,EAAAC,cAAAA,CAAA,EAAA7rF,GACA,IAAAumB,EAAA8+B,sBAAA,EACArlD,KAAAA,EACAsF,KAAA,GACK+3C,UAAA6jC,EAAAsK,sBAAA,EAEL,CACAltF,CAAAA,EAAAotF,8BAAA,CAAAA,EAMA,IAAAD,EAAuB,IACvB,IAAAzrF,EAAAhB,EAAAknB,KAAA,CAAAylE,EAAAI,sBAAiD,CAAA/0E,IAAA,EAEjD,OADA20E,EAAAI,sBAAA,CAAA9rF,MAAA,EAAAgqD,YAAA,EAAAtnC,MAAAA,CAAA,EAAA3iB,GACA,IAAAumB,EAAA8+B,sBAAA,EACArlD,KAAAA,EACAsF,KAAA,GACK+3C,UAAA6jC,EAAAsK,sBAAA,EAEL,CACAltF,CAAAA,EAAAmtF,2BAAA,CAAAA,CAAA,gBAAA1tF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECnCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA8B,aAAG,CAAA0C,MAAA,EAA0B,GAC3D1C,EAAAytF,sBAAgB,CAAAztF,EAAewtF,kBAAA,QAC/B,IAAA7K,EAAAhjF,EAAA,MACAomF,EAAApD,EAA0B/W,YAAA,CAAAjsE,EAAA,MAC1BK,CAAAA,EAAAwtF,kBAAA,CAAAzH,EAAAnkF,MAAA,EACAmkF,EAAAjoE,EAAA,gBACAioE,EAAAhoE,GAAA,UACAgoE,EAAAhoE,GAAA,kBACA,EACA/d,EAAAytF,sBAAA,CAAA1H,EAAAnkF,MAAA,EAAAmkF,EAAAjoE,EAAA,gBAAAioE,EAAAhoE,GAAA,2BAAAte,CAAA,CAAAO,CAAA,ECXa,aAEb+C,OAAA8L,cAAA,CAAA7O,EAAA,aAAqC,CAAA0C,MAAA,EAAqB,GAC1D1C,EAAA0tF,0BAAA,CAAA1tF,EAAA2tF,aAAA,QAMA,IAAAA,EAAA,GACA,iBAAAzG,EACA,UAEAA,CADA,CAGAlnF,EAAA2tF,aAAA,CAAAA,EAIA3tF,EAAA0tF,0BAAA,EACA,gBACAzqF,KAAA,eACK2qF,SAAA,sCACL,EACA5F,OAAA,CACA/kF,KAAA,SACK2qF,SAAA,gCACL,EACA1F,QAAA,CACAjlF,KAAA,UACK2qF,SAAA,iCACL,EACAxF,SAAA,CACAnlF,KAAA,WACK2qF,SAAA,uBACL,CACA,iBAAAnuF,CAAA,CAAAO,CAAA,ECpCa,aAEb+C,OAAA8L,cAAA,CAAA7O,EAA2B,cAAA0C,MAAA,KAC3B1C,EAAAusF,mBAAA,QACA,IAAAA,EAAA,IACA,IAAA16B,EAAAnnD,EAAAmnD,MAAA,CACA,CAAAg8B,EAAA,GAAAC,EAAA,EAAAj8B,EAAAiC,GAAA,MAAAjC,EAAA,CAIA,OAHAi8B,EAAA5sF,MAAA,IACA8I,QAAA9D,KAAA,CAAA4nF,GAEAD,CACA,CACA7tF,CAAAA,EAAAusF,mBAAA,CAAAA,CAAA,gBAAA9sF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECZa,aAMboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAAe,CAAA0C,MAAA,KAC/B,IAAAigF,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAgBK,GAC7C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAiBK,GAC9C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAeK,GAC5C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAwBK,GACrD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAkBK,GAC/C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAaK,GAC1C2iF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,ECda,aAEb+C,OAAA8L,cAAA,CAAA7O,EAAA,cAAA0C,MAAA,oBAAAjD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECFa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA+B,aAAG,CAAA0C,MAAA,EAAyB,GAC3D1C,EAAA0pF,uBAAgB,CAAA1pF,EAAe+tF,cAAA,CAAA/tF,EAAAguF,uBAAA,CAAAhuF,EAAAiuF,6BAAA,CAAAjuF,EAAAkuF,sBAAA,CAAAluF,EAAAmuF,2BAAA,CAAAnuF,EAAA4rF,wBAAA,QAC/B,IAAAjJ,EAAAhjF,EAAkB,MAClBsoB,EAAAtoB,EAAA,MACAwnD,EAAmBw7B,EAAA/3D,eAAgC,CAAAjrB,EAAA,OACnDijF,EAAmBjjF,EAAQ,MAC3B2rF,EAAA3rF,EAAiC,MACjCyuF,EAAgCzuF,EAAA,IAChCK,CAAAA,EAAA4rF,wBAAA,EACAxgF,oBAAA,YACArD,WAAA,WACA,EACA/H,EAAAmuF,2BAAA,CAAAlmE,EAAAw2B,aAAA,CAAAM,SAAA,OAIAmvC,EAMAjsF,YAAA2F,CAAA,CAAAsD,EAAAlL,EAAA4rF,wBAAA,CAAA/pF,EAAA7B,EAAAmuF,2BAAA,EACA,KAAAvmF,UAAA,CAAAA,EACA,KAAAsD,IAAA,CAAAA,EACA,KAAArJ,SAAA,CAAAA,EACA,KAAAoJ,MAAA,EACAiB,gBAAAgV,QAAAI,OAAA,CAAA1E,IAAA,CAAAsE,SACA5T,oBAAA4T,QAAAI,OAAA,CAAA1E,IAAA,CAAAsE,SACArf,UAAA7B,EAAAmuF,2BAAA,EAEA,KAAAljF,MAAA,EACA,QAAAA,MAAA,CACApJ,UAAAA,CACA,CACA,CAMA,MAAAylD,eAAA+mC,CAAA,EACA,IAAAxjC,EAAA,WAAAjjD,UAAA,CAAA0/C,cAAA,CAAA+mC,EAAA,KAAAnjF,IAAA,CAAAnD,UAAA,SACA,EAGA,CACAsmF,UAAAA,EACAxjC,YAAAA,CACA,EALA,KAOA,CACA7qD,EAAAkuF,sBAAA,CAAAA,EACA,IAAAD,EAAA,MAAAhjF,EAAA3C,EAAAgmF,EAAApjF,IAAA,CACA,IAAA1J,EAAA,MAAAyJ,EAAAiB,eAAA,CAAA5D,GAIA,MAHA4C,CAAAA,MAAAA,EAAA,OAAAA,EAAA3C,OAAA,GAAA2C,EAAA3C,OAAA,CAAArH,MAAA,IACAM,EAAAkH,IAAA,IAAAwC,EAAA3C,OAAA,EAEA,MAAA+lF,EAAAzC,SAAA,CAAArqF,EAAA0J,EACA,CACAlL,CAAAA,EAAAiuF,6BAAA,CAAAA,CAIA,OAAAD,EACA/rF,YAAAgJ,CAAA,CAAAqjF,CAAA,CAAAljF,EAAA,aACA,KAAAH,MAAA,CAAAA,EACA,KAAAqjF,WAAA,CAAAA,EACA,KAAAljF,mBAAA,CAAAA,CACA,CACA,IAAAvJ,WAAA,CACA,YAAAoJ,MAAA,CAAApJ,SAAA,CAEA,MAAA0sF,4BAAAjmF,CAAA,CAAA4C,CAAA,EACA,gBAAAlL,EAAAiuF,6BAAA,OAAAhjF,MAAA,CAAA3C,EAAA,KAAAgmF,WAAA,CAAApjF,EACA,CASA,MAAAxC,KAAAlH,CAAA,CAAA+G,EAAA,GAAA2C,EAAA,CACKE,oBAAA,KAAAA,mBAAA,CACL,EACA,IAAAW,UAAAA,CAAA,CAAAqhD,qBAAAA,CAAA,aAAAkhC,WAAA,CAAAxiF,kBAAA,CAAAZ,EAAAE,mBAAA,EAUA,OATA5J,EAAAoK,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CACAL,EAAA4rD,oBAAA,CAAAA,EACA5rD,EAAAqK,eAAA,CAAAE,EACA,WAAAd,MAAA,CAAAiB,eAAA,CAAA1K,GACA+G,EACA+hB,MAAA,IAAAtlB,KAAAjB,IAAAiB,GACAmI,OAAA,KACS3L,EAAAyK,WAAA,CAAAmB,EACT,GACA5L,CACA,CAIA,MAAAgtF,QAAAC,CAAA,CAAAvjF,EAAA,CACKE,oBAAA,KAAAA,mBAAA,CACL,EACA,IAAAW,UAAAA,CAAA,CAAAqhD,qBAAAA,CAAgC,EAAkB,WAAAkhC,WAAA,CAAAxiF,kBAAA,CAAAZ,EAAAE,mBAAA,EAClD8B,EAAAuhF,EAAAttF,GAAA,GAAAK,GAAAA,CAAA,CAAA+G,QAAAA,EAAA,OACA/G,EAAAoK,QAAA,MAAAX,MAAA,CAAApJ,SAAA,CACAL,EAAA4rD,oBAAA,CAAAA,EACA5rD,EAAAqK,eAAA,CAAAE,EACAxD,EACA+hB,MAAA,IAAAtlB,KAAAjB,IAAAiB,GACAmI,OAAA,KACa3L,EAAAyK,WAAA,CAAAmB,EACb,GACS5L,IAET6L,EAAA,WAAApC,MAAA,CAAAqC,mBAAA,CAAAJ,GACA,OAAAG,CACA,CACA,CACArN,EAAAguF,uBAAA,CAAAA,CAOA,OAAAD,UAAAG,EAOAjsF,YAAA2F,CAAA,CAAA0mF,CAAA,CAAArjF,CAAA,CAAAC,EAAAlL,EAAA4rF,wBAAA,CAAA5/E,EAAA,IAAAgiF,EAAA/iF,EAAAqjF,EAAApjF,EAAAE,mBAAA,GACA,MAAAxD,EAAAsD,GACA,KAAAtD,UAAA,CAAAA,EACA,KAAA0mF,WAAA,CAAAA,EACA,KAAArjF,MAAA,CAAAA,EACA,KAAAC,IAAA,CAAAA,EACA,KAAAc,MAAA,CAAAA,CACA,CACA,MAAAuiF,4BAAAjmF,CAAA,CAAA4C,CAAA,EACA,kBAAAc,MAAA,CAAAuiF,2BAAA,CAAAjmF,EAAA4C,EACA,CAKA,OAAAy8E,KAAA,CAAA//E,WAAAA,CAAA,CAAA+jF,eAAAA,EAAA/jF,CAAA,CAAAqD,OAAAA,CAAA,CAAAC,KAAAA,CAAA,GACA,WAAA6iF,EAAAnmF,EAAA,IAAAg7E,EAAAqI,2BAAA,CAAAU,EAAAzgF,GAAAD,EAAAC,EACA,CAIA,OAAAqa,KAAA,CAAA3d,WAAAA,CAAA,CAAA8mF,qBAAAA,EAAA,CAAA9mF,EAAA,CAAAqD,OAAAA,CAAA,CAAAC,KAAAA,EAAAlL,EAAA4rF,wBAAA,GACA,IAAA+C,EAAAD,CAAA,IAEA,MADA,GAAAvnC,EAAArgC,OAAA,EAAA6nE,EAAA,+CACA,IAAAZ,EAAAnmF,EAAA8mF,EAAAxtF,MAAA,GACA,IAAAoqF,EAAAoB,iBAAA,CAAA9kF,EAAA8mF,EAAAxjF,GACA,IAAA03E,EAAAqI,2BAAA,CAAA0D,EAAAzjF,EAAA,CAAAD,EAAAC,EACA,CASA,MAAAyb,KAAAnlB,CAAA,CAAA+G,EAAA,GAAA2C,EAAA,KAAAA,IAAA,EACA,IAAA0jF,EAAA,WAAA5iF,MAAA,CAAAtD,IAAA,CAAAlH,EAAA+G,EAAA2C,GACA6hF,EAAA,WAAAuB,WAAA,CAAAzC,SAAA,CAAA+C,EAAA1jF,GAEA,OADA,MAAA6hF,EAAA8B,IAAA,GACA9B,CACA,CAIA,MAAA//E,QAAAyhF,CAAA,CAAAvjF,EAAA,KAAAA,IAAA,EACA,IAAAgC,EAAA,WAAAlB,MAAA,CAAAwiF,OAAA,CAAAC,EAAAvjF,GACA,aAAAgW,QAAAqkC,GAAA,CAAAr4C,EAAA/L,GAAA,OAAAK,GAAA,CACA,IAAAurF,EAAA,WAAAuB,WAAA,CAAAzC,SAAA,CAAArqF,EAAA0J,GAES,OADT,MAAA6hF,EAAA8B,IAAA,GACS9B,CACT,GACA,CAUA,MAAAv/E,SAAAhM,CAAA,CAAA+G,CAAA,CAAA2C,EAAA,KAAAA,IAAA,EACA,IAAA4jF,EAAAttF,EAIA,OAHAuC,KAAAA,IAAAwE,GACAumF,CAAAA,EAAA,WAAA9iF,MAAA,CAAAtD,IAAA,CAAAlH,EAAA+G,EAAA2C,EAAA,EAEA,WAAAojF,WAAA,CAAA9gF,QAAA,CAAAshF,EAAA,CACA5C,cAAA3jF,KAAAxE,IAAAwE,EACSR,WAAAmD,EAAAnD,UAAA,EAET,CACA,CACA/H,EAAA+tF,cAAA,CAAAA,CAIA,OAAArE,EACAznF,YAAA8qD,CAAA,EACA,KAAAA,QAAA,CAAAA,CACA,CACA,IAAA68B,WAAA,CACA,YAAA78B,QAAA,CAAA9hD,MAAA,CAAApJ,SAAA,CAEA,IAAA+F,YAAA,CACA,YAAAmlD,QAAA,CAAAnlD,UAAA,CAEA,IAAAoE,QAAA,CACA,YAAA+gD,QAAA,CAAA/gD,MAAA,CAEA,IAAAsiF,aAAA,CACA,YAAAvhC,QAAA,CAAAuhC,WAAA,CAEA,IAAApjF,MAAA,CACA,YAAA6hD,QAAA,CAAA7hD,IAAA,CAEA,IAAAD,QAAA,CACA,YAAA8hD,QAAA,CAAA9hD,MAAA,CAEAsjF,4BAAAjmF,CAAA,CAAA4C,CAAA,EACA,YAAA6hD,QAAA,CAAAwhC,2BAAA,CAAAjmF,EAAA4C,EACA,CACAyb,KAAAnlB,CAAA,CAAA+G,CAAA,CAAA2C,CAAA,EACA,YAAA6hD,QAAA,CAAApmC,IAAA,CAAAnlB,EAAA+G,EAAA2C,EACA,CACA8B,QAAAyhF,CAAA,CAAAvjF,CAAA,EACA,YAAA6hD,QAAA,CAAA//C,OAAA,CAAAyhF,EAAAvjF,EACA,CACAsC,SAAAhM,CAAA,CAAA+G,CAAA,CAAA2C,CAAA,EACA,YAAA6hD,QAAA,CAAAv/C,QAAA,CAAAhM,EAAA+G,EAAA2C,EACA,CACAo8C,eAAA+mC,CAAA,EACA,YAAAthC,QAAA,CAAAzF,cAAA,CAAA+mC,EACA,CAOAxE,MAAArqC,EAAA,GAAAj3C,EAAA,IACA,OAAA6lF,EAAA3J,mBAAA,CAAA5+E,MAAA,MAAA25C,EAAAj3C,EACA,CAMA,MAAAwmF,eAAAlkF,CAAA,CAAAm+D,EAAA,KAAA/9D,MAAA,CAAApJ,SAAA,EACA,WAAAypF,EAAAS,kBAAA,MAAAnkF,UAAA,YAAAA,UAAA,CAAAmnF,cAAA,CAAA/lB,EAAAn+D,GACA,CAMAmkF,WAAAhjF,CAAA,EACA,WAAA09E,EAAA,IAAAqE,EAAA,KAAAnmF,UAAA,MAAA0mF,WAAA,KAAAhD,EAAA2D,YAAA,CAAAjjF,GAAA,KAAAd,IAAA,EACA,CACA,CACAlL,EAAA0pF,uBAAA,CAAAA,CAAA,gBAAAjqF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECrRa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA0B,cAAA0C,MAAA,KAC1B1C,EAAA+rF,kBAAgB,QAChB,IAAApJ,EAAAhjF,EAAA,MACAuvF,EAAoBvM,EAAA/3D,eAA4B,CAAAjrB,EAAA,OAChDwvF,EAAAxvF,EAAgC,MAChCyvF,EAAAzvF,EAAA,KAIA,OAAAosF,EACA9pF,YAAA2F,CAAA,CAAA6E,CAAA,EACA,KAAA7E,UAAA,CAAAA,EACA,KAAA6E,SAAA,CAAAA,EACA,KAAA4iF,QAAA,MAOA,IAAAC,SAAA,CACA,YAAAD,QAAA,CAMA,MAAAR,KAAA,CAAA9mF,WAAAA,EAAA,YAAA8E,+BAAAA,EAAA,EAAA0iF,aAAAA,EAAA,MAAAC,EAAA,YACA,KAAAH,QAAA,CACA,KAAAA,QAAA,CAEAE,GACA,WAAApF,OAAA,EAAApiF,WAAAA,EAAA,GAAAynF,CAAA,GACA,WAAAC,cAAA,EACA1nF,WAAAA,EACa8E,+BAAAA,CACb,IAEA,WAAA4iF,cAAA,EACA1nF,WAAAA,EACA8E,+BAAAA,EACS,GAAA2iF,CAAA,EAXT,CAkBA,MAAAC,eAAA,CAAA1nF,WAAAA,EAAA,YAAA8E,+BAAAA,EAAA,KAAA2iF,EAAA,KACA,IAAAF,EAAA,SAAAJ,EAAApoE,OAAA,QAAA4oE,GAAA,CACA,IAAAzrF,EAAA,WAAA2D,UAAA,CAAAgF,cAAA,MAAAH,SAAA,EACA1E,WAAAA,EACa8E,+BAAAA,CACb,GACA,IAAA5I,EAAA,CACAyrF,EAAA,qCACA,MACA,QACS,IAAAN,EAAAO,kBAAA,MAAAljF,SAAA,CAAAxI,EACT,GACA2rF,QAAA,EACAC,WAAA,IACS,GAAAL,CAAA,GAET,IAAAF,EACA,kDAGA,OADA,KAAAD,QAAA,CAAAC,EACAA,CACA,CAOA,MAAAQ,2BAAwB/nF,EAAA,aACxB,IAAArF,MAAAA,CAAA,aAAAkF,UAAA,CAAAqG,kBAAA,MAAAxB,SAAA,CAAA1E,GACA,GAAArF,EAAAgI,GAAA,CACA,MAAAhI,EAAAgI,GAAA,CAEA,YAAA+B,SAAA,CAMA,MAAA09E,QAAA,CAAApiF,WAAAA,EAAA,YAAAgE,UAAAA,CAAA,CAAAqhD,qBAAAA,CAAA,GACA,IAAA1qD,EAWA,GAAAA,CATAA,EADAqJ,GAAAqhD,EACA,YAAAxlD,UAAA,CAAAqG,kBAAA,EACAxB,UAAA,KAAAA,SAAA,CACAV,UAAAA,EACaqhD,qBAAAA,CACb,EAAArlD,EAAA,EAAArF,KAAA,CAGA,YAAAkF,UAAA,CAAAqG,kBAAA,MAAAxB,SAAA,CAAA1E,EAAA,EAAArF,KAAA,EAEAgI,GAAA,CACA,gCAAA+B,SAAA,YAAAhJ,KAAAC,SAAA,CAAAhB,GAAA,IAEA,YAAA+J,SAAA,CAOAsjF,2BAAAC,EAAA,gBACA,SAAAb,EAAAc,cAAA,OAAAxjF,SAAA,CAAAujF,EACA,CACA,CACAhwF,EAAA+rF,kBAAA,CAAAA,CAAA,eAAAtsF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECnHa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA8B,cAAA0C,MAAwB,KACtD1C,EAAAykF,mBAAgB,CAAAzkF,EAAQkwF,gBAAO,QAC/B,IAAAvN,EAAAhjF,EAAkB,MAClBsoB,EAAAtoB,EAAA,MACAwnD,EAAmBw7B,EAAA/3D,eAAmC,CAAAjrB,EAAA,OACtDijF,EAAmBjjF,EAAQ,MAC3B2rF,EAAA3rF,EAAqB,MACrBwwF,EAAmBxwF,EAAQ,MAC3BywF,EAAAzwF,EAAwB,KACxBK,CAAAA,EAAAkwF,gBAAA,MACA,IAAA9pC,EAAA,IAAAn+B,EAAAnJ,SAAA,iDAMAuxE,EAAA,CAAAxkB,EAAAtjE,IAAA,CAEA,IAAA+nF,EAAAzkB,EAAA0kB,OAAA,IAAA9jC,EAAAzlD,IAAA,CAAAsjB,MAAA,IAAAxlB,EAAA8hD,QAAA,EAAAzlD,GAAA,IAAA2D,EAAA6hD,MAAA,GACA,OAAAp+C,EAAA+hB,MAAA,IAAAgmE,EAAAlpF,IAAA,IAAAopF,EAAArrC,MAAA,CAAAngD,EAAAnD,SAAA,GACA,CAIA,OAAA4iF,EACAxiF,YAIA8qD,CAAA,CAIAvN,CAAA,CAIAj3C,EAAA,IACA,KAAAwkD,QAAA,CAAAA,EACA,KAAAvN,YAAA,CAAAA,EACA,KAAAj3C,OAAA,CAAAA,CACA,CAMAumB,QAAA,GAAA0wB,CAAA,EAEA,OADA,KAAAA,YAAA,CAAAsM,OAAA,IAAAtM,EAAAl1B,MAAA,MAAAmiC,IACA,KAOA7rC,OAAA,GAAA4+B,CAAA,EAEA,OADA,KAAAA,YAAA,CAAAhgD,IAAA,IAAAggD,EAAAl1B,MAAA,MAAAmiC,IACA,KAQAb,gBAAA,GAAApM,CAAA,EACA,YAAA5+B,MAAA,IAAA4+B,EACA,CAMAgpB,WAAA,GAAAjgE,CAAA,EAEA,OADA,KAAAA,OAAA,CAAA/I,IAAA,IAAA+I,GACA,KAMA+jD,MAAA1gD,EAAA,KAAAmhD,QAAA,CAAA9hD,MAAA,CAAApJ,SAAA,EACA,IAAAL,EAAA,IAAAymB,EAAAukC,WAAA,GAAAjnD,GAAA,SAAAi6C,YAAA,EAEA,OADAh+C,EAAAoK,QAAA,CAAAA,EACApK,CACA,CAOAivF,oBAAA,CACA,IAAAC,EAAA,KAAApkC,KAAA,GAGA,OADAokC,EAAA7kF,eAAA,+CACA,GAAAskF,EAAAQ,qBAAA,EAAAD,EACA,CAYAE,cAAA,CACA,SAAAtF,EAAAuF,oBAAA,OACA,IACA,IAAAH,EAAA,KAAApkC,KAAA,EAEAokC,CAAAA,EAAA7kF,eAAA,+CACA,IAAAhL,EAAA,GAAAsvF,EAAAQ,qBAAA,EAAAD,GACA,GAAA7vF,EAAAb,EAA6BkwF,gBAAA,CAC7B,OAAAhqF,MAAA,IAAAolF,EAAAwF,sBAAA,CAAAJ,EAAA7vF,EAAA,CACA,CACA,OAAAA,KAAAA,CAAA,CACA,CACA,MAAAwG,EAAA,CACA,OAAAnB,MAAA,IAAAolF,EAAAyF,qBAAA,CAAA1pF,EAAA,CACS,CACT,EACA,CAQA2pF,eAAAplF,EAAA,KAAAmhD,QAAA,CAAA9hD,MAAA,CAAApJ,SAAA,EACA,IAAAovF,EAAA,KAAAA,SAAA,GACA,OAAAA,EAAA9vF,GAAA,IAAAoK,EAAA+gD,KAAA,CAAA1gD,GACA,CAOAqlF,WAAA,CACA,IAAAC,EAAA,KAAAN,YAAA,GACA,YAAAM,EACA,aAGA,YAAA1xC,YAAA,CAAAt+C,MAAA,CACA,SAEA,IAAAiwF,EAAA,IAAA1M,EAAA,KAAA13B,QAAA,MAAAvN,YAAA,CAAAl+C,KAAA,WAAA8vF,sBAAA,MAAA5xC,YAAA,CAAAl+C,KAAA,QACA+vF,EAAAF,EAAAV,kBAAA,GACAvjF,EAAA,GAsBA,OArBA,KAAAsyC,YAAA,CAAAl+C,KAAA,IAAA6L,OAAA,EAAAs/C,EAAAnmD,IAAA,CACA,GAAA+qF,EAAArxF,EAAAkwF,gBAAA,CACA,+DAAA5pF,EAAA,iBAAA+qF,EAAA,KAAArxF,EAAAkwF,gBAAA,KAEA,IAAAoB,EAAA,IAAAH,EAAA3xC,YAAA,CAAAiN,EAAA,CACA8kC,EAAA,KAAAH,sBAAA,CAAAE,GACAE,EAAA,IAAA/M,EAAA,KAAA13B,QAAA,CAAAukC,EAAAC,GACAE,EAAAD,EAAAf,kBAAA,GAEA,GAAAgB,EAAAzxF,EAAAkwF,gBAAA,EACAhjF,EAAA1N,IAAA,CAAA2xF,GACA,IAAAG,EAAA,CAAA7kC,EAAA,CAEA4kC,EAAAF,CADAA,EAAA,IAAA1M,EAAA,KAAA13B,QAAA,CAAAukC,EAAA,KAAAF,sBAAA,CAAAE,GAAA,EACAb,kBAAA,EACA,MAEAU,EAAAK,EACAH,EAAAI,CACS,GAETvkF,EAAA1N,IAAA,CAAA2xF,GACAjkF,CACA,CAMAkkF,uBAAAvlB,CAAA,EACA,OAAAwkB,EAAAxkB,EAAA,KAAAtjE,OAAA,CACA,CAMAmpF,oBAAA1B,EAAA,gBACA,IAAA7qF,EAAA,KAAAmnD,KAAA,EACAnnD,CAAAA,EAAA0G,eAAA,CAAAukF,EAAAuB,qBAAA,CACA,IAAA7mE,EAAA3lB,EAAAysF,gBAAA,GAAA3oF,QAAA,WACA,SAAAmnF,EAAAyB,6BAAA,EAAA7B,EAAAllE,EACA,CAMAtd,SAAAtC,EAAA,CACKghF,cAAA,EACL,GACA,YAAAn/B,QAAA,CAAAv/C,QAAA,MAAA8+C,KAAA,GAAAphD,EAAAghF,aAAA,MAAA3jF,OAAA,CAAAxE,KAAAA,CAAA,CAAAmH,EACA,CAQA4mF,kBAAA5mF,CAAA,EACA,YAAAsC,QAAA,KAAAtC,CAAA,CAAAghF,cAAA,IACA,CAyBA6F,cAAA7mF,CAAA,EACA,YAAAsC,QAAA,CAAAtC,GAAA+X,IAAA,KACA,IAAAxa,EAIS,MAHT,QAAAA,CAAAA,EAAAupF,MAAAA,EAAA,OAAAA,EAAAtvF,KAAA,GAAA+F,KAAA,IAAAA,EAAA,OAAAA,EAAAoB,IAAA,GACA,GAAAyhF,EAAA2G,YAAA,OAAAD,EAAAtvF,KAAA,CAAAmH,IAAA,KAESmoF,CACT,EACA,CAMA,MAAArrE,KAAAzb,CAAA,EACA,IAAAmhB,EAAA,WAAA0gC,QAAA,CAAA/gD,MAAA,CAAAtD,IAAA,MAAA4jD,KAAA,QAAA/jD,OAAA,CAAA2C,GACA,YAAA6hD,QAAA,CAAAuhC,WAAA,CAAAzC,SAAA,CAAAx/D,EAAAnhB,EACA,CAKA,MAAAi/E,QAAAj/E,CAAA,EACA,kBAAAyb,IAAA,CAAAzb,EAAA,EAAA2jF,IAAA,EACA,CAIAqD,QAAAttD,CAAA,EACA,WAAA6/C,EAAA,KAAA13B,QAAA,UAAAvN,YAAA,IAAA5a,EAAA4a,YAAA,WAAAj3C,OAAA,IAAAq8B,EAAAr8B,OAAA,EACA,CAKA,IAAA4pF,cAAA,CACA,UACA,IAAA7sF,IAAA,IACA,KAAAk6C,YAAA,CACAr+C,GAAA,IAAAixF,EAAAprF,IAAA,CAAAsjB,MAAA,IAAA3nB,EAAAkkD,UAAA,EAAA1lD,GAAA,IAAA2D,EAAA6hD,MAAA,GACAtrC,MAAA,EAAAC,EAAAsyD,IAAAtyD,EAAA8a,MAAA,CAAAw3C,IACA,EAAAr0D,MAAA,GACA,CAKA,IAAA84E,kBAAA,CACA,YAAA7yC,YAAA,CAAAr+C,GAAA,MACA49C,UAAA4M,EAAA5M,SAAA,CAAA91C,QAAA,GACAjC,KAAA2kD,EAAA3kD,IAAA,CAAA7F,GAAA,MACAylD,SAAAz8B,EAAAy8B,QAAA,CACAC,WAAA18B,EAAA08B,UAAA,CACahlD,UAAAsoB,EAAAw8B,MAAA,CAAA19C,QAAA,EACb,IACSvH,KAAAiqD,EAAAjqD,IAAA,CAAAuH,QAAA,UACT,GACA,CAIA,IAAAqpF,UAAA,CACA,OACA,kBACA,KAAA9yC,YAAA,CACAr+C,GAAA,EAAAoxF,EAAAjsF,IACA,CACA,eAAAA,EAAA,IAAAisF,EAAAxzC,SAAsD,CAAA91C,QAAI,QAC1DspF,EAAAvrF,IAAA,CAAA7F,GAAA,EAAA2D,EAAwCwB,IAAA,MAAAA,EAAA,IAAAxB,EAAA6hD,MAAA,CAAA19C,QAA4B,MAAAnE,EAAA+hD,UAAA,eAAA/hD,EAAA8hD,QAAA,kBACpE,oBAAA2rC,EAAA7wF,IAAA,CAAAuH,QAAA,aACa,CAAAxG,IAAA,QAEbA,IAAA,OACA,aACA,KAAA8F,OAAA,CAAApH,GAAA,IAAAqxF,EAAA3wF,SAAA,CAAAoH,QAAA,IAAAxG,IAAA,OACA,CAAAA,IAAA,MACA,CAQA,OAAAoD,OAAAknD,CAAA,CAAAvN,CAAA,CAAAj3C,EAAA,IACA,IAAAsjE,EAAArsB,EAAAl1B,MAAA,MAAAmiC,GACA,WAAAg4B,EAAA13B,EAAA8e,EAAAtjE,EACA,CAIA,OAAAkqF,SAAArkB,CAAA,IAAAlhE,CAAA,EACA,OAAAA,EAAA/L,GAAA,IAAAK,EAAAkxF,OAAA,CAAAtkB,GACA,CAIA,OAAAukB,WAAA,GAAAzlF,CAAA,EACA,OAAAA,EAAAmO,MAAA,EAAAC,EAAA9Z,IAAA8Z,EAAA42E,OAAA,CAAA1wF,GACA,CAQA,OAAAoxF,KAAA,GAAA1lF,CAAA,EACA,GAAAA,IAAAA,EAAAhM,MAAA,CACA,SAEA,IAAAsG,EAAA,GAAAlF,EAAA,CAAA4K,EACA,GAAAi6C,EAA2BrgC,OAAA,EAAAtf,GAC3B,IAAAulD,SAAAA,CAAA,EAAAvlD,EACA2pF,EAAA3pF,EACA6pF,EAAAF,EAAAV,kBAAA,GACAQ,EAAA,GAwBA,OAvBA3uF,EAAA6K,OAAA,EAAA0lF,EAAAvsF,IAAA,CACA,GAAA+qF,EAAArxF,EAAAkwF,gBAAA,CACA,+DAAA5pF,EAAA,iBAAA+qF,EAAA,KAAArxF,EAAAkwF,gBAAA,KAEA,IAAAoB,EAAA,IAAAH,EAAA3xC,YAAA,IAAAqzC,EAAArzC,YAAA,EACA+xC,EAAAlB,EAAAiB,EAAA,IACAH,EAAA5oF,OAAA,IACAsqF,EAAAtqF,OAAA,CACA,EACAipF,EAAA,IAAA/M,EAAA13B,EAAAukC,EAAAC,GACAE,EAAAD,EAAAf,kBAAA,EAEAgB,CAAAA,EAAAzxF,EAAAkwF,gBAAA,EACAe,EAAAzxF,IAAA,CAAA2xF,GAEAE,EAAAF,CADAA,EAAA0B,CAAA,EACApC,kBAAA,KAGAU,EAAAK,EACAH,EAAAI,EAEA,GACAR,EAAAzxF,IAAA,CAAA2xF,GACAF,CACA,CAIA,aAAA6B,gBAAAC,CAAA,IAAA7lF,CAAA,EACA,IAAAoO,EAAA,MAAAy3E,EACA,QAAAvxF,KAAA0L,EACAoO,EAAAA,EAAA42E,OAAA,OAAA1wF,GAEA,OAAA8Z,CACA,CAKA,aAAAtO,QAAAE,CAAA,CAAAhC,CAAA,EACA,IAAA6nF,EAAA7lF,CAAA,IACA,IAAA6lF,EACA,SAEA,IAAAhmC,EAAAgmC,EAAAhmC,QAAA,CACA,aAAAA,EAAA//C,OAAA,CAAAE,EAAA/L,GAAA,MAAAK,GAAAA,EAAA8qD,KAAA,GAAA/jD,QAAA/G,EAAA+G,OAAA,IAAA2C,EACA,CAIA8nF,cAAA,CACA,YAAAxzC,YAAA,CAAAt+C,MAAA,CACA,YAEA,IAAA+xF,EAAA,IAAA3tF,IACAk6C,EAAA,KAAAA,YAAA,CACAr+C,GAAA,KACA,IAAAsH,EACA,IAAAs2C,EAAA0N,EAAA1N,SAAA,CACA,GAAAA,EAAAoG,MAAA,CAAAiB,GAAA,CACA,IAAA8sC,EAAA,OAAAzqF,CAAAA,EAAAgkD,EAAAzlD,IAAA,MAAAyB,KAAA,IAAAA,EAAA,OAAAA,EAAAk+C,MAAA,CAAA19C,QAAA,GACA,IAAAiqF,EACA,yDAEA,GAAAD,EAAA3vE,GAAA,CAAA4vE,GACA,YAEAD,EAAA1tF,GAAA,CAAA2tF,EACA,QACSzmC,CACT,GACAniC,MAAA,MAAAmiC,GACA,WAAAg4B,EAAA,KAAA13B,QAAA,CAAAvN,EAAA,KAAAj3C,OAAA,CACA,CAIA4qF,aAAA,CACA,IAAAC,EAAA,IAAA3O,EAAA,KAAA13B,QAAA,SAAAxkD,OAAA,EACA8qF,EAAA,IAAA5O,EAAA,KAAA13B,QAAA,SAAAxkD,OAAA,EACA,QAAAkkD,KAAA,KAAAjN,YAAA,CACAiN,EAAA1N,SAAA,CAAAoG,MAAA,CAAAiB,GACAgtC,EAAA5zC,YAAA,CAAAhgD,IAAA,CAAAitD,GAGA4mC,EAAA7zC,YAAA,CAAAhgD,IAAA,CAAAitD,GAGA,OACA2mC,OAAAA,EAAAJ,YAAA,GACAxxF,GAAA6xF,CACA,CACA,CAIAC,eAAAjyF,CAAA,EACA,IAAAorD,EAAA,KAAAjN,YAAA,CAAAn+C,EAAA,CACA,IAAAorD,EACA,6CAAAprD,EAAA,GAEA,OAAAorD,CACA,CAIAimC,QAAAtkB,CAAA,EAEA,OADA,KAAA5uB,YAAA,CAAAhgD,IAAA,IAAA8rF,EAAAiI,qBAAA,EAAAnlB,IACA,KAKAolB,2BAAAlG,CAAA,CAAAC,CAAA,EAEA,OADA,KAAA/tC,YAAA,CAAAsM,OAAA,IAAA82B,EAAAwK,8BAAA,EAAAE,EAAAC,IACA,KAKAkG,uBAAApvE,CAAA,EAEA,OADA,KAAAm7B,YAAA,CAAAsM,OAAA,IAAA82B,EAAAuK,2BAAA,EAAA9oE,IACA,KAEA,CACArkB,EAAAykF,mBAAA,CAAAA,CAAA,gBAAAhlF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECtea,aAEboD,OAAA8L,cAAA,CAAA7O,EAA6B,cAAA0C,MAAA,EAA8B,GAC3D1C,EAAA2vF,kBAAgB,CAAA3vF,EAAQ0zF,sBAAO,QAC/B,IAAA/Q,EAAAhjF,EAAA,MACAwnD,EAAkBw7B,EAAA/3D,eAA0B,CAAAjrB,EAAA,OAC5Cg0F,EAAAh0F,EAAoB,MACpBwvF,EAAAxvF,EAAgC,MAChCi0F,EAAAj0F,EAAA,MAOA+zF,EAAA,MAAAlyF,GAAA,KAKAurF,EAJA,IAAA8G,EAAA,SAAAF,EAAAG,cAAA,EAAAtyF,UACA,aAAAmuF,EACAkE,EAWA,MAAA9G,CAPAA,EADA8G,aAAAD,EAAA7H,kBAAA,CACA8H,EAGA,MAAAA,EAAAltE,IAAA,EACSmlE,UAAA,EACT,IAEA+C,IAAA,EAVA,CAYA7uF,CAAAA,EAAA0zF,sBAAA,CAAAA,CAIA,OAAA/D,EACA1tF,YAIAwK,CAAA,CAIAyY,CAAA,EACA,KAAAzY,SAAA,CAAAA,EACA,KAAAyY,QAAA,CAAAA,CACA,CAIA6uE,UAAAC,CAAA,EACA,IAAAvrF,EACA,IAAAoB,EAAA,OAAApB,CAAAA,EAAA,KAAAyc,QAAA,CAAApY,IAAA,GAAArE,KAAA,IAAAA,EAAA,OAAAA,EAAAsE,WAAA,QACA,GAAAlD,EAAA3I,MAAA,GACA8yF,EAAAnqF,GAEA,GAKAiiF,WAAA,CACA,IAAArjF,EAAAgD,EACAzB,QAAA2qD,GAAA,QAAAlpD,CAAAA,EAAA,OAAAhD,CAAAA,EAAA,KAAAyc,QAAA,CAAApY,IAAA,GAAArE,KAAA,IAAAA,EAAA,OAAAA,EAAAsE,WAAA,GAAAtB,KAAA,IAAAA,EAAA,OAAAA,EAAAhJ,IAAA,OACA,CAKA,IAAAwxF,cAAA,CACA,IAAAxrF,EACA,IAAAoB,EAAA,OAAApB,CAAAA,EAAA,KAAAyc,QAAA,CAAApY,IAAA,GAAArE,KAAA,IAAAA,EAAA,OAAAA,EAAAsE,WAAA,CACA,GAAAo6C,EAAArgC,OAAA,EAAAjd,EAAA,WACA,IAAAqqF,EAAArqF,CAAA,CAAAA,EAAA3I,MAAA,IACA,GAAAimD,EAAArgC,OAAA,EAAAotE,EAAA,kBACA,IAAAC,EAAAD,EAAAr5E,KAAA,SAEA,MADA,GAAAssC,EAAArgC,OAAA,EAAAqtE,EAAA,aACA1nD,SAAA0nD,EACA,CAMApE,2BAAAC,EAAA,gBACA,SAAAb,EAAAc,cAAA,OAAAxjF,SAAA,CAAAujF,EACA,CACA,CACAhwF,EAAA2vF,kBAAA,CAAAA,CAAA,gBAAAlwF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECzFa,aAEboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAAe,CAAA0C,MAAA,KAC/B,IAAAigF,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,KAAyBK,GACtD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAiBK,GAC9C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAA0BK,GACvD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,KAAyBK,GACtD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,eAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECTa,aAKboD,OAAA8L,cAAA,CAAA7O,EAA6B,aAAG,CAAA0C,MAAsB,EAAG,GACzD1C,EAAAo0F,qBAAgB,CAAAp0F,EAAeq0F,cAAA,CAAAr0F,EAAAs0F,oBAAA,QAC/B,IAAA3R,EAAAhjF,EAAA,MACAwnD,EAAwBw7B,EAAA/3D,eAAyB,CAAAjrB,EAAA,OACjD40F,EAAA50F,EAAA,MAOA20F,EAAA,CAAAzqF,EAAA3D,IAAA,CACA,IAEAsuF,EAFAC,EAAA,EACAC,EAAA,GAEA,GAAA7qF,EAKA3D,GACAsuF,CAAAA,EAAA,GAAAD,EAAAI,8BAAA,EAAAzuF,EAAA,MANA,CACA,GAAAA,EACA,YAAAzC,KAAAC,SAAA,CAAAwC,GAAA,OACA,0BAIA,GACA2D,EAAAsD,OAAA,KACA,IAAA1E,EAAAgD,EAAAC,EAAAC,EAAAmvD,EACA,GAAAnG,EAAAL,UAAA,iBACA,OAAA7rD,CAAAA,EAAAisF,CAAA,CAAAA,EAAAxzF,MAAA,MAAAuH,KAAA,IAAAA,GAAAA,EAAAoB,IAAA,CAAArK,IAAA,EACAoD,KAAA,OACA6xF,MAAAA,EACavxE,KAAAyxC,CACb,OAEA,CACA,IAAAigC,EAAA,iCACA1hB,EAAA,IAAAve,EAAAkgC,QAAA,CAAAD,GAAA,CACA,GAAA1hB,EAAAhyE,MAAA,IACA,IAAA4zF,EAAA,OAAArpF,CAAAA,EAAAynE,CAAA,MAAAznE,KAAA,IAAAA,EAAA,OAAAA,CAAA,IACA,GAAA07C,EAAArgC,OAAA,EAAAguE,EAAA,mBACAL,IAAAA,EACAC,EAAAl1F,IAAA,EACAs1F,eAAAA,EACAjrF,KAAA,GACqBkrF,OAAA,EACrB,GAGA,OAAArpF,CAAAA,EAAAgpF,CAAA,CAAAA,EAAAxzF,MAAA,MAAAwK,KAAA,IAAAA,GAAAA,EAAA7B,IAAA,CAAArK,IAAA,EACAoD,KAAA,MACA6xF,MAAAA,EACqBK,eAAAA,MAAAA,EAAAA,EAAA,OAGrBL,GACA,MACA,GAAA9/B,EAAAD,QAAA,YACA,OAAA/oD,CAAAA,EAAA+oF,CAAA,CAAAA,EAAAxzF,MAAA,MAAAyK,KAAA,IAAAA,GAAAA,EAAA9B,IAAA,CAAArK,IAAA,EACAoD,KAAA,UACiB6xF,MAAAA,CACjB,GACAA,SAEA,GAAA9/B,EAAAD,QAAA,YACA,IAAAsgC,EAAAN,CAAA,CAAAA,EAAAxzF,MAAA,IACA8zF,GAAA,CAAAA,EAAAD,MAAA,GACAC,EAAAD,MAAA,IACAC,EAAAnrF,IAAA,CAAArK,IAAA,EACAoD,KAAA,eACA6xF,MAAAA,EACqBvxE,KAAAyxC,EAAArzD,KAAA,CAAAqzD,EAAAz0C,OAAA,SACrB,IAEAu0E,GACA,MAEA,IAAAA,IACAC,EAAAl1F,IAAA,EACAqK,KAAA,GACqBkrF,OAAA,EACrB,GACAN,KAGA,OAAA35B,CAAAA,EAAA45B,CAAA,CAAAA,EAAAxzF,MAAA,MAAA45D,KAAA,IAAAA,GAAAA,EAAAjxD,IAAA,CAAArK,IAAA,EACAoD,KAAA,SACA6xF,MAAAA,EACiBvxE,KAAAyxC,CACjB,EACA,CACK,GAIL6/B,GAAAE,IAAAA,EAAAxzF,MAAA,EACAwzF,EAAAl1F,IAAA,EACAqK,KAAA,GACSkrF,OAAA,EACT,GAEAP,GAAAA,EAAAnzF,KAAA,GAAAqzF,EAAAxzF,MAAA,IACA,IAAA+zF,EAAAP,CAAA,CAAAF,EAAAnzF,KAAA,EACA4zF,IACAA,EAAAF,MAAA,IACAE,EAAAprF,IAAA,CAAArK,IAAA,EACAoD,KAAA,eACA6xF,MAAA,EACavxE,KAAAsxE,EAAAnyF,OAAA,GAGb,QACAqyF,CACA,CACA10F,CAAAA,EAAAs0F,oBAAA,CAAAA,EACA,IAAAY,EAAA,IACA,IAAAzf,EAAA,MAAAgf,EAAA,GAAAU,IAAA,aAAA1yF,IAAA,KACA,OAAAgzE,EAAA,IACA,EACA2f,EAAA,IACA,OAAAC,EAAAzyF,IAAA,EACA,cACA,gCACA,oBACA,iCAAAyyF,EAAAnyE,IAAA,OACA,eACA,wBAAAmyE,EAAAnyE,IAAA,OACA,SAEA,WADA,OAAAmyE,EAAAnyE,IAAA,KAGA,MACA,0BAAAmyE,EAAAP,cAAA,KAAAO,EAAAP,cAAA,iBAEA,EAOAT,EAAA,CAAAgB,EAAA5f,EAAA,MACA,IAAA6f,EAAc7f,EAAeyf,EAAAG,EAAAZ,KAA4B,KACzD,SAAAa,EAAA,EAAAF,EAAAC,GAAA,EAEAr1F,CAAAA,EAAAq0F,cAAA,CAAAA,EAKA,IAAAD,EAAA,GAAAvqF,EACA1I,GAAA,EAAAwzD,EAAAruD,IACA,CACA,mBAAAA,EAAA,IAAAquD,EAAAmgC,cAAA,YAAAngC,EAAAmgC,cAAA,iBACAngC,EAAA9qD,IAAA,CAAA1I,GAAA,OAAAnB,EAAAq0F,cAAA,EAAAgB,EAAA,KACC,CAAA5yF,IAAA,QAEDA,IAAA,MACAzC,CAAAA,EAAAo0F,qBAAA,CAAAA,CAAA,gBAAA30F,CAAA,CAAAO,CAAA,EChKa,aAwGb,SAAA20F,EAAAzuF,CAAA,EACA,GAAAA,GAGA,iBAAAA,GAAA,qBAAAA,EAAA,CACA,IAAAqvF,EAAArvF,EAAA,iBACA7E,EAAAk0F,CAAA,IACAC,EAAAD,CAAA,IACA,OACAl0F,MAAAA,EACAgB,QAAAozF,EAAAD,EACA,CACA,CATA,CAYA,SAAAC,EAAAvvF,CAAA,MACAwvF,EACA,IAAAhzF,EAAA,KACA,oBAAAwD,EAAA,CACA,IAAA7D,EAAArC,EAAA21F,6BAAA,CAAA5yE,GAAA,CAAA7c,GACA,GAAA7D,EACA,OAAAA,CACA,KAEA,WAAA6D,GACAwvF,EAAA11F,EAAA21F,6BAAA,CAAA5yE,GAAA,WACArgB,EAAAwD,EAAA,QAEA,iBAAAA,IACAwvF,EAAA11F,EAAA21F,6BAAA,CAAA5yE,GAAA,iBACArgB,EAAAwD,EAAA,aACA,QACA,GAAAxD,EACAgzF,EAAApxE,OAAA,OAAA5hB,GAEA,2BADA,CArIAK,OAAA8L,cAAA,CAAA7O,EAAA,aAAyC,CAAA0C,MAAA,KACzC1C,EAAA20F,8BAAA,CAAA30F,EAAA21F,6BAAA,QAIA31F,EAAA21F,6BAAA,KAAAvwF,IAAA,CACA,6CACA,+CACA,sDACA,8DACA,iEACA,2DACA,8DACA,0EACA,CACA,4BACA,gDACA,CACA,uEACA,CACA,wBACA,oEACA,CACA,0EACA,CACA,8BACA,mEACA,CACA,CACA,8BACA,0DACA,CACA,CACA,wBACA,yDACA,CACA,4EACA,oEACA,0EACA,sEACA,qEACA,yEACA,sEACA,CACA,sBACA,iFACA,CACA,CACA,2BACA,kEACA,CACA,CACA,4BACA,8DACA,CACA,uCACA,uDACA,0EACA,CACA,0BACA,0DACA,CACA,6EACA,kDACA,6DACA,uEACA,CACA,uBACA,uEACA,CACA,CACA,wBACA,wDACA,CACA,mEACA,uDACA,gEACA,CACA,sBACA,wEACA,CACA,CACA,iCACA,iDACA,CACA,yDACA,uDACA,qCACA,sDACA,wEACA,CACA,uBACA,6DACA,CACA,gDACA,uDACA,2CACA,iDACA,EAeApF,EAAA20F,8BAAA,CAAAA,CAsBA,gBAAAl1F,CAAA,CAAAO,CAAA,EC5Ia,aAIb,SAAA41F,EAAAvxE,CAAA,CAAAqV,CAAA,EACA,IAAAm8D,EAAWn8D,EACX,QACA,IAAAo8D,EAAAD,IAAAA,EAEA,GAAAA,GADAA,CAAAA,IAAA,GACA,CACAxxE,EAAA7kB,IAAA,CAAAs2F,GACA,MAKA,GAFA,IACAzxE,EAAA7kB,IAAA,CAAAs2F,EAEA,CACA,CAhBA/yF,OAAA8L,cAAA,CAAA7O,EAA6B,cAAA0C,MAAA,KAC7B1C,EAAA2wF,qBAAA,QAqBA,IAAAA,EAAA,IAEA,IAAA/kF,SAAAA,CAAA,EAAApK,EACAu0F,EAAAnqF,GAAApK,EAAA+K,UAAA,CAAAnF,IAAA,IAAApC,EAAAnD,SAAA,CAAAsjD,MAAA,CAAAv5C,IACAhD,EAAApH,EAAAowF,gBAAA,GACAoE,EAAAx0F,EAAA+K,UAAA,CAAArL,MAAA,CAAA60F,CAAAA,EAAA,KACAE,EAAA,GAEA,OADAL,EAAAK,EAAAD,GACAC,EAAA/0F,MAAA,CAAA80F,GAAAA,EAAAptF,EAAA1H,MAAA,CAEAlB,CAAAA,EAAA2wF,qBAAA,CAAAA,CAAA,gBAAAlxF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClCa,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAuC,CAAA0C,MAAA,KACvC1C,EAAAk2F,4BAAkB,CAAQl2F,EAAiB6xF,6BAAA,CAAA7xF,EAAAm2F,0BAAA,CAAAn2F,EAAAo2F,uBAAA,CAAAp2F,EAAA2xF,qBAAA,QAC3C,IAAA1pE,EAAAtoB,EAAA,KAIAK,CAAAA,EAAA2xF,qBAAA,gDASA,IAAAyE,EAAA,CAAApG,EAAAnkB,IAAA,CACA,IAAArqE,EAAA,IAAAymB,EAAAukC,WAAA,CAQA,OAPAhrD,EAAAqK,eAAA,CAAA7L,EAAA2xF,qBAAA,CAEAnwF,EAAAoK,QAAA,KAEAqc,EAAAnJ,SAAA,CADAkxE,WAAAA,EACA,+CACA,gDACAxuF,EAAAg+C,YAAA,CAAAqsB,EACArqE,CACA,CACAxB,CAAAA,EAAAo2F,uBAAA,CAAAA,EAMA,IAAAD,EAAA,GAAA30F,EACAqH,SAAA,EACA0jD,qBAAA,GACC8pC,iBAAA,EACD,GACAptF,QAAA,UACAjJ,CAAAA,EAAAm2F,0BAAA,CAAAA,EAMA,IAAAtE,EAAsB,CAAA7B,EAAAsG,IACtB,WAAAtG,iBAAAA,EAAA,MAAAA,EAAA,oCAAApyC,mBAAA04C,GAAA,EAEAt2F,EAAA6xF,6BAAA,CAAAA,EAOA,IAAAqE,EAAA,CAAAlG,EAAAxuF,IACA,GAAAxB,EAAA6xF,6BAAA,EAAA7B,EAAA,GAAAhwF,EAAAm2F,0BAAA,EAAA30F,GAEAxB,CAAAA,EAAAk2F,4BAAA,CAAAA,CAAA,gBAAAz2F,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC3Da,aAEboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAAe,CAAA0C,MAAA,KAC/B,IAAAigF,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAWK,GACxC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAyBK,GACtD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAmBK,GAChD2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAkBK,GAC/C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAgBK,GAC7C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAwCK,GACrE2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAWK,GACxC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAaK,GAC1C2iF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCZa,IAAAe,EAAAf,EAAA,aAEboD,OAAA8L,cAAA,CAAA7O,EAA6B,aAAG,CAAA0C,MAAuB,KACvD1C,EAAAuzF,qBAAkB,CAAAvzF,EAAQu2F,eAAiB,QAC3C,IAAAtuE,EAAAtoB,EAAA,KAIAK,CAAAA,EAAAu2F,eAAA,KAAAtuE,EAAAnJ,SAAA,gDAUA,IAAAy0E,EAAA,CAAArwE,EAAA3a,EAAA,KACA,IAAA0f,EAAA8+B,sBAAA,EACAhI,UAAA/+C,EAAAu2F,eAAA,CACAvvF,KAAAuB,EAAApH,GAAA,MACAwlD,OAAA3hD,EACA4hD,SAAA,GACSC,WAAA,EACT,IACKnlD,KAAAhB,EAAA2d,IAAA,CAAA6E,EAAA,OACL,EAEAljB,CAAAA,EAAAuzF,qBAAA,CAAAA,CAAA,gBAAA9zF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7Ba,aAEboD,OAAA8L,cAAA,CAAA7O,EAA4B,cAAA0C,MAAyB,KACrD1C,EAAAw2F,iBAAgB,CAAAx2F,EAAQ8zF,cAAO,CAAA9zF,EAAAgiF,KAAA,CAAAhiF,EAAA6wF,oBAAA,CAAA7wF,EAAAisF,yBAAA,QAC/B,IAAAtJ,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,GACA,IAAAy2F,EAAA,KAEA,EAKAxK,EAAA,MAAAp1D,GAAA,CACA,IAAA6/D,EAAA1sF,QAAA9D,KAAA,CACA8D,QAAA9D,KAAA,CAAAuwF,EACA,IACA,IAAAxyF,EAAA,MAAA4yB,IAEA,OADA7sB,QAAA9D,KAAA,CAAAwwF,EACAzyF,CACA,CACA,MAAAoD,EAAA,CAEA,MADA2C,QAAA9D,KAAA,CAAAwwF,EACArvF,CAAA,CAEA,CACArH,CAAAA,EAAAisF,yBAAA,CAAAA,EAKA,IAAA4E,EAAA,IACA,IAAA6F,EAAA1sF,QAAA9D,KAAA,CACA8D,QAAA9D,KAAA,CAAAuwF,EACA,IACA,IAAAxyF,EAAA4yB,IAEA,OADA7sB,QAAA9D,KAAA,CAAAwwF,EACAzyF,CACA,CACA,MAAAoD,EAAA,CAEA,MADA2C,QAAA9D,KAAA,CAAAwwF,EACArvF,CAAA,CAEA,EAEA,SAAA26E,EAAAqB,CAAA,EACA,WAAAniE,QAAA,GAAAoiE,WAAAhiE,EAAA+hE,GACA,CAHArjF,EAAA6wF,oBAAA,CAAAA,EAIA7wF,EAAAgiF,KAAA,CAAAA,EAIA,IAAA8R,EAAA,MAAA6C,GACA,SAAAA,EACA,MAAAA,EAEAA,CADA,CAGA32F,EAAA8zF,cAAA,CAAAA,EAMA,IAAA0C,EAAA,CAAA7vC,EAAAiwC,EAAA,EAAAC,EAAA,KACA,IAAA/rE,EAAA67B,EAAA19C,QAAA,GACA,OAAA6hB,EAAa5pB,MAAA,IACb,GAAA4pB,EAAA+hB,SAAA,GAAA+pD,GAAA,OAAA9rE,EAAA+hB,SAAA,CAAA/hB,EAAA5pB,MAAA,CAAA21F,EAAA/rE,EAAA5pB,MAAA,IACA4pB,CAAA,CAEA9qB,CAAAA,EAAAw2F,iBAAA,CAAAA,CAAA,gBAAA/2F,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCtEa,IAAA0oB,EAAA1oB,EAAA,MAEboD,OAAA8L,cAAA,CAAA7O,EAA0B,cAAA0C,MAAA,KAC1B1C,EAAA82F,kBAAkB,QAClB,IAAA7uE,EAAAtoB,EAAA,MAkCA,eAAAm3F,EAAAlvF,CAAA,CAAAmvF,CAAA,EACA,IAAAtuF,EAAAgD,EACA,IACA,oBAAAsrF,EACA,6DAGAC,EACA,IAAAC,EAAA,OAAAxuF,CAAAA,EAAA,QAAA6c,KAAA,GAAA7c,KAAA,IAAAA,EAAA,OAAAA,EAAAoS,KAAA,OACA,GAAAo8E,EAAA,CACA,IAAAC,EAAAD,EAAA5iC,SAAA,IAAApnB,EAAAynB,QAAA,OAAAoiC,EAAA7zF,IAAA,KAGAk0F,EAAAF,EAAA5iC,SAAA,IAAApnB,EAAAynB,QAAA,2BAKA,GAJAyiC,EAAAD,GACAA,CAAAA,EAAAC,CAAA,EAGAD,EAAkC,GACd,KAAO,IAAA7uE,GACPA,KAAOtkB,IAAPskB,EAAO+uE,QAAA,EAC3B/uE,KAAAtkB,IAAAskB,EAAA+uE,QAAA,CAAA7lE,IAAA,EAEA,IAAA8lE,EAAAJ,CAAA,CAAAC,EAAA,GACA,GAAAG,EAAA,CACA,IAAAC,EAAA,QAAA7rF,CAAAA,EAAA4c,EAAAivE,GAAA,GAAA7rF,KAAA,IAAAA,EAAA,OAAAA,EAAAkD,IAAA,CAAA0Z,EAAA,OAEAkvE,EAAAF,EAAAxqD,SAAA,CAAAwqD,EAAAn3E,OAAA,CAAAo3E,GAAAA,EAAAp2F,MAAA,CACAq2F,CAAAA,EAAAr2F,MAAA,IACA81F,CAAAA,EAAAO,EAAA1qD,SAAA,IAAAvoB,OAAA,WAEA,EACA,CACA,GACA,CAAA1c,EACA,MACA,CACAovF,EACAhtF,QAAA2qD,GAAA,CAAAqiC,EAAA,MAAAQ,EAAAT,EAAAnvF,IAGAoC,QAAA2qD,GAAA,OAAA6iC,EAAAT,EAAAnvF,GAEA,CACA,CACA,MAAAP,EAAA,CACA2C,QAAA9D,KAAA,gCAAAmB,EACA,CACA,CAWA,eAAAowF,EAAA7vF,CAAA,CAAAC,CAAA,EACA,IAAAY,EACA,IAGA,IAAAivF,EAAA9vF,EACA+vF,EAAAD,EAAAhuF,WAAA,CACA,sBAAAiuF,EAEA,OADA3tF,QAAA9D,KAAA,uDACA,GAEA,IAAAuD,EAAA,MAAAkuF,EAAA,uBACA9vF,EAAc1G,GAAA,IAAAwB,EAAA2G,QAAA,IACd,CAAAH,SAAA,SAAApB,WAAA,aACA,EACArF,EAAA,OAAA+F,CAAAA,EAAAgB,MAAAA,EAAA,OAAAA,EAAAxF,MAAA,GAAAwE,KAAA,IAAAA,EAAA,OAAAA,EAAA/F,KAAA,CACA,GAAAA,EACA,OAAAA,CACA,CACA,SAEA,MAAA2E,EAAA,CAEA,OADA2C,QAAA9D,KAAA,6CAAAmB,GACA,GAEA,CAnCArH,EAAA82F,kBAAA,CAAAA,EAyCA,IAAAU,EAAA,MAAAI,EAAAhwF,IAAA,CAEA,IAAA3D,EAAA,GACA,IAAA2zF,GACA,iBAAAA,EACA,OAAAA,CACA,CACA,IAAAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACA,QAAAr1F,EAAAD,EAAA,GAAAK,OAAAkC,OAAA,CAAA2yF,GACA,GAAAl1F,GAAAA,EAAA4G,QAAA,qBAAA5G,EAAA4G,QAAA,EACA,IAAA2uF,EAAAv1F,EAAA4G,QAAA,EACAuuF,CAAAA,CAAA,CAAAI,EAAA,CAAAt1F,EACA,IAAAu1F,EAAA,IAAAjwE,EAAAnJ,SAAA,CAAAm5E,GACAH,EAAApjC,QAAA,CAAAwjC,IACAJ,EAAAt4F,IAAA,CAAA04F,EAEA,MACAx1F,GACAA,EAAA4b,QAAA,EACA,mBAAA5b,EAAA4b,QAAA,CACAra,CAAA,CAAAtB,EAAA,CAAAD,EAAA4b,QAAA,GAEAi/B,EAAA76C,IAAAA,GACAq1F,EAAAv4F,IAAA,CAAAmD,GACAq1F,EAAAx4F,IAAA,CAAAg4F,EAAA90F,EAAAkF,KAGA3D,CAAA,CAAAtB,EAAA,CAAAD,CACA,CAEA,GAAAK,OAAAiE,IAAA,CAAA6wF,GAAA32F,MAAA,IACA,IAAA8G,EAAA,MAAAyvF,EAAA7vF,EAAAkwF,GACA,QAAAG,EAAAE,EAAA,GAAAp1F,OAAAkC,OAAA,CAAA4yF,GAAA,CACA,IAAAO,EAAAN,EAAAzjC,SAAA,IAAAtsC,EAAAze,QAAA,KAAA2uF,GACA,GAAAG,GAAA,GACA,IAAAvtC,EAAA7iD,CAAA,CAAAowF,EAAA,CACAxtF,EAAAigD,MAAAA,EAAA,OAAAA,EAAAjgD,KAAA,CACAA,EACA3G,CAAA,CAAAk0F,EAAA,IAAAF,EAAA,IAAArtF,EAAA,GAgBA3G,CAAA,CAAAk0F,EAAA,IAAAF,EAAA,OAIAh0F,CAAA,CAAAk0F,EAAA,IAAAF,EAAA,EAGA,KACAI,EAAoB,MAAAn3E,QAAAqkC,GAAA,CAAsByyC,GAC1C,QAAA1xF,EAAA,EAAAA,EAAAyxF,EAAA72F,MAAA,CAAAoF,IACArC,CAAA,CAAA8zF,CAAA,CAAAzxF,EAAA,EAAA+xF,CAAA,CAAA/xF,EAAA,CAEA,OAAArC,CACA,EACA,SAAAs5C,EAAA59B,CAAA,EAEA,uBAAAA,GACAA,IAAA,GAAAA,GACAA,EAAA1d,WAAA,GAAAc,QACAA,oBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,EACA,iBAAAlgB,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7Ma,iBAmJb24F,EAjJAv1F,OAAA8L,cAAA,CAAA7O,EAA+B,aAAG,CAAA0C,MAAA,KAClC1C,EAAAu4F,uBAAkB,CAAAv4F,EAAyB8wF,sBAAA,CAAA9wF,EAAA+wF,qBAAA,CAAA/wF,EAAAiyF,YAAA,QAC3C,IAAAhqE,EAAAtoB,EAA0B,MAC1BijF,EAAAjjF,EAAA,MAwBAsyF,EAAA,CAAAzwF,EAAAg3F,EAAAn2F,IAAA,CACAA,GAAAA,KAAAA,EACA2H,QAAA2qD,GAAA,IAAA30D,EAAAu4F,uBAAA,EAAA/2F,GAAAa,GAGA2H,QAAA2qD,GAAA,wBAAA30D,EAAAu4F,uBAAA,EAAA/2F,IAEA,IAAAi3F,EAAA,GACAC,EAAA,GACAC,EAAA,GACAH,EAAArrF,OAAA,KACAwX,EAAA+vC,QAAA,iBAEAgkC,CAAAA,CAAA,GAAAC,EAAA,IAEA,IAAAC,EAAAj0E,EAAAyY,KAAA,qBACA,GAAAw7D,GAAAA,CAAA,KACA,IAAAC,EAAAH,CAAA,CAAAC,EAAA,CACAD,CAAA,CAAAC,EAAA,CACAE,KAAA90F,IAAA80F,EACAjgF,OAAAggF,CAAA,OACA53F,KAAAqrC,GAAA,CAAAzzB,OAAAggF,CAAA,OAAAC,EAAA,CACA,IACAC,EAAAn0E,EAAAyY,KAAA,sCACA07D,GAAAA,CAAA,KACAL,CAAAA,CAAA,CAAAE,EAAA,CAAAG,CAAA,IAEA,GACA,IAAAC,EAAA,GACAv3F,EAAAg+C,YAAA,CAAAryC,OAAA,EAAAw+C,EAAArlD,IAAA,CACA,IAAA0yF,EAAAP,CAAA,CAAAnyF,EAAA,CACA2yF,EAAAD,MAAAA,EAAA,OAAAA,EAAA57D,KAAA,4BACA,CAAArc,EAAAm4E,EAAA,EAAAD,MAAAA,EAAA,OAAAA,EAAA33F,KAAA,MAAAH,GAAA,IAAAsrC,SAAAngB,EAAA,QAAAvoB,KAAAA,EAAAA,KAAAA,EAAA,CACAg1F,EAAAv5F,IAAA,EACA25F,IAAAC,EAAA53F,EAAAurD,QAAA,CAAApB,GACA0tC,IAAAC,EAAA93F,EAAAurD,QAAA,CAAAvrD,EAAAg+C,YAAA,CAAAl+C,KAAA,GAAAgF,GAAAqlD,GACA4tC,IAAAC,EAAAh4F,EAAAurD,QAAA,CAAAvrD,EAAAg+C,YAAA,CAAAl+C,KAAA,GAAAgF,EAAA,IACAy4C,UAAA4M,EAAA5M,SAAA,CAAAz1C,QAAA,GACA4vF,MAAAA,GAAA5yF,CAAAA,IAAAA,EAAA,IAAAvC,KAAAA,CAAA,EACA01F,KAAA14E,EACAm6B,KAAAg+C,GAAAn4E,EAAAm4E,EAAAn4E,EAAAhd,KAAAA,CAAA,CACS21F,IAAAhB,CAAA,CAAApyF,EAAA,EAET,GACA0D,QAAA2vF,KAAA,CAAAZ,EACA,CACA/4F,CAAAA,EAAAiyF,YAAA,CAAAA,CACA,OAAAlB,UAAArjF,MACAzL,YAAA23F,CAAA,EACA,6CACA,KAAAA,eAAA,CAAAA,EACA,KAAA32F,IAAA,wBACA,CACA,CACAjD,EAAA+wF,qBAAA,CAAAA,CACA,OAAAD,UAAApjF,MACAzL,YAAAT,CAAA,CAAAX,CAAA,EACA,+BACA,KAAAW,EAAA,CAAAA,EACA,KAAAX,IAAA,CAAAA,EACA,KAAAoC,IAAA,yBACA,CACA,CACAjD,EAAA8wF,sBAAA,CAAAA,EAeA,IAAAyH,EAAA,IACA,IAAAt0F,EAAA41F,EAAAjJ,YAAA,SACA,SAAA3sF,EACAA,EAAApD,IAAA,CAEAoD,EAAAiC,KAAA,YAAA6qF,GACA/mF,QAAA9D,KAAA,6CAAAjC,EAAAiC,KAAA,CAAA0zF,eAAA,EACA,MAEA,IALA,CAOA55F,CAAAA,EAAAu4F,uBAAA,CAAAA,EAIA,IAAAuB,EAAA,KACA,IAAAC,EAAAC,IACA,OAAA/xE,EAAAw2B,aAAA,CAAA4L,QAAA,EACA1L,WAAAo7C,EAAAl4F,SAAA,CACAyoD,SAAAyvC,EAAAl4F,SAAA,CACKgJ,SAAA,CACL,EACA,EACAuuF,EAAA,CAAAa,EAAAtuC,IACA2tC,EAAAW,EAAA,CAAAH,IAAA,CAAAnuC,GAEA2tC,EAAA,CAAAW,EAAAC,EAAAvuC,IAAA,CACA,IAAAwuC,EAAAX,EAAAS,EAAAC,EAAAh5F,MAAA,CAAAg5F,EAAA,CAAAJ,IAAA,EACAM,EAAAZ,EAAAS,EAAA,IACAC,EACAvuC,EACA,EACA,OAAAyuC,EAAAD,CACA,EACAX,EAAA,CAAAS,EAAAz6C,IAAA,CACA,IAAA66C,EAAA,IAAAzX,EAAA6B,mBAAA,CAAAwV,EAAA,IACAz6C,EACA,EACA,SAAAx/C,EAAAu4F,uBAAA,EAAA8B,EACA,EAEAL,EAAA,KACA1B,GACAA,CAAAA,EAAArwE,EAAAM,OAAA,CAAAs6D,QAAA,IAEAyV,EACA,gBAAA74F,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECzJa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA4B,cAAoB0C,MAAG,KACnD1C,EAAA6hF,iBAAkB,CAAA7hF,EAAAs6F,YAAyB,CAAAt6F,EAAAu6F,eAAA,QAC3C,IAAAtyE,EAAAtoB,EAAA,MACA66F,EAAA,EAIA,OAAAD,UAAAtyE,EAAAnJ,SAAA,CACA7c,YAAAS,CAAA,EACA,MAAAA,GACA,KAAA+3F,OAAA,OAAAnxF,QAAA,EACA,CACA67C,OAAAvgB,CAAA,SACA,aAAA21D,EACA31D,EAAA61D,OAAA,QAAAA,OAAA,CAEA,MAAAt1C,MAAA,CAAAvgB,EADA,CAGA37B,UAAA,CACA,YAAAwxF,OAAA,CAEAnxF,UAAA,CACA,YAAAmxF,OAAA,CAEA,CACAz6F,EAAAu6F,eAAA,CAAAA,EACA,IAAAG,EAAA,IACA,IAAAt4F,EAAAo4F,CAAA,CAAAG,EAAA,QACA,GACAH,CAAAA,CAAA,CAAAG,EAAA,KAAAJ,EAAAI,EAAA,CAGA,EAMAL,EAAA,GACA,iBAAAK,EACAD,EAAAC,GAEAA,aAAA1yE,EAAAnJ,SAAA,CACA47E,EAAAC,EAAA1xF,QAAA,IAGAyxF,EAAA,IAAAzyE,EAAAnJ,SAAA,CAAA67E,GAAA1xF,QAAA,GACA,CAEAjJ,EAAAs6F,YAAA,CAAAA,EACA,IAAAM,EAAA,GAMAC,EAAA,GACAruF,WAAA6R,IAAA,CAAAulC,EAAAvoC,MAAA,EAAAC,EAAAygD,IAAA,IAAAzgD,KAAAygD,EAAA,MAQA8lB,EAAA,CAAAj+B,EAAA7E,IAAA,CACA,IAAA+7C,EAAwBD,EAAAj3C,GACxBm3C,EAAA,GAAAD,EAAA7xF,QAAA,MAAA81C,EAAA91C,QAAA,KACA7G,EAAAw4F,CAAA,CAAAG,EAAA,CACA,GAAA34F,EACA,OAAAA,CACA,CACA,IAAAO,EAAA,CAAAslB,EAAAnJ,SAAA,CAAAilC,sBAAA,CAAAH,EAAA7E,GACA,OAAA67C,CAAA,CAAAG,EAAA,IAAA/6F,EAAAs6F,YAAA,EAAA33F,EACA,CACA3C,CAAAA,EAAA6hF,iBAAA,CAAAA,CAAA,gBAAApiF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7Ea,aAEboD,OAAA8L,cAAmB,CAAG7O,EAAA,aAAsB,CAAG0C,MAAA,KAC/C1C,EAAAg7F,WAAgB,CAAAh7F,EAAAi7F,cAAe,CAAAj7F,EAAA8e,SAAA,QAC/B,IAAA6jE,EAAAhjF,EAAkB,MAClBsoB,EAAAtoB,EAAA,MACAmsB,EAAgB62D,EAAA/3D,eAAQ,CAAiBjrB,EAAA,OACzC,IAAAu7F,EAAAv7F,EAAA,MACAoD,OAAA8L,cAAA,CAAA7O,EAAA,aAAAgsB,WAAA,GAAAjJ,IAAA,kBAAAm4E,EAAAp8E,SAAA,IAMA,IAAAm8E,EAAA,IACA,IAAAN,EACA,YAEA,GAAAA,aAAA1yE,EAAAnJ,SAAA,CACA,OAAA67E,CACA,CACA,oBAAAA,GACA75F,MAAA6D,OAAA,CAAAg2F,IACA,gBAAAA,GAAA7uE,EAAAhF,OAAA,CAAAq0E,IAAA,CAAAR,GACA,YAEA,IACA,WAAA1yE,EAAAnJ,SAAA,CAAA67E,EACA,CACA,MAAAtzF,EAAA,CACA,YAEA,CACArH,CAAAA,EAAAi7F,cAAA,CAAAA,EAMA,IAAAD,EAAA,GACA,KAAAh7F,EAAAi7F,cAAA,EAAAN,EAEA36F,CAAAA,EAAAg7F,WAAA,CAAAA,CAAA,gBAAAv7F,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC1Ca,aAEboD,OAAA8L,cAAA,CAAA7O,EAAA,aAAyC,CAAA0C,MAAA,KACzC1C,EAAAmsF,iCAA0B,CAAiB,OAC3C,IAAAlkE,EAAAtoB,EAAA,MAIA,eAAAwsF,EAAAvkF,CAAA,CAAAU,CAAA,CAAAP,EAAA,aACA,IAAAU,EACA,IAAA2yF,EAAAxzF,EAEA,IAAAU,EAAgBuD,eAAY,EAC5B,IAAAE,UAAAA,CAAA,QAAAnE,EAAAkE,kBAAA,CAAA/D,EACAO,CAAAA,EAAAuD,eAAA,CAAAE,CACA,KACAjD,EAAAR,EAAAO,SAAA,EACK0jD,qBAAA,EACL,GACAvjD,EAAqBF,EAAAG,QAAA,WACrBC,EAAA,CAAAC,SAAA,SAAApB,WAAAA,CAAA,EACA4B,EAAA,MAAAyxF,EAAA1xF,WAAA,wBACAV,EACAE,EACA,EACA,GAAAS,EAAAzD,KAAA,CACA,UAAA+hB,EAAAhe,oBAAA,oCAAAN,EAAAzD,KAAA,CAAA7D,OAAA,QAAAoG,CAAAA,EAAAkB,EAAA1F,MAAA,CAAAvB,KAAA,CAAAmH,IAAA,GAAApB,KAAA,IAAAA,EAAAA,EAAA1E,KAAAA,CAAA,EAEA,OAAA4F,EAAA1F,MAAA,CAEAjE,EAAAmsF,iCAAA,CAAAA,CAAA,gBAAA1sF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC9Ba,aAEboD,OAAA8L,cAAmB,CAAA7O,EAAA,aAAgB,CAAA0C,MAAA,KACnC1C,EAAAq7F,QAAgB,CAAAr7F,EAAAs7F,QAAO,CAAC,KAAO,EAC/B,IAAA3Y,EAAAhjF,EAAA,MACAmsB,EAAA62D,EAAA/3D,eAAA,CAAAjrB,EAAA,OAMA27F,EAAgB,OAAAxvE,EAAAhF,OAAA,CAAA9lB,KAAAwZ,KAAA,CAAA+gF,EAAAC,OAAA,QAChBx7F,CAAAA,EAAAs7F,QAAA,CAAAA,EAMA,IAAAD,EAAgB,OAAAI,KAAAv2F,IAAAA,EAAAoZ,QAAA,GAChBte,CAAAA,EAAAq7F,QAAA,CAAAA,CAAA,gBAAA57F,CAAA,CAAAO,CAAA,ECnBa,iBAIb07F,EACAA,EAIA,SAAAzL,EAAAxjF,CAAA,CAAAujF,EAAA,eAAA2L,EAAAD,EAAAE,eAAA,EACA,OAAAD,GACA,KAAAD,EAAAE,eAAA,CACA,wCAAAnvF,EAAA,WAAAujF,EAAA,OACA0L,EAAAG,OAAA,CACA,+BAAApvF,EAAA,WAAAujF,EAAA,UAEA,6BAAA2L,EAAA,qBAEA,CAhBA54F,OAAA8L,cAAA,CAAsB7O,EAAG,aAAoB,CAAA0C,MAAA,KAC7C1C,EAAAiwF,cAAA,CAAAjwF,EAAA07F,YAAA,QAGAA,CADAA,EAGAA,GAAA17F,CAAAA,EAAA07F,YAAA,CAAAA,EAAA,KAFA,kCACCA,EAAA,OAAmB,WAYpB17F,EAAAiwF,cAAA,CAAAA,CAAA,gBAAAxwF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECnBa,aAEboD,OAAA8L,cAAoB,CAAA7O,EAAA,cAAA0C,MAAA,KACpB1C,EAAAivF,YAAA,CAAsB,OACtB,IAAA5D,EAAA1rF,EAAA,KAIA,OAAAsvF,EACAhtF,YAAA+J,CAAA,EACA,KAAAA,MAAA,CAAAA,CACA,CACA,IAAAnK,WAAA,CACA,YAAAmK,MAAA,CAAAnK,SAAA,CAEAyL,oBAAA6/C,CAAA,EACA,OAAAjsC,QAAAI,OAAA,CAAA6rC,EAAAhsD,GAAA,KACAK,EAAAyK,WAAA,MAAAD,MAAA,EACSxK,IAET,CACA0K,gBAAA5D,CAAA,EAEA,OADAA,EAAA2D,WAAA,MAAAD,MAAA,EACAkV,QAAAI,OAAA,CAAAhZ,EACA,CAMAwzF,eAAAl0F,CAAA,CAAA+jF,CAAA,CAAAzgF,CAAA,EACA,OAAAmgF,EAAA0C,cAAA,CAAApG,IAAA,EACA//E,WAAAA,EACA+jF,eAAAA,EACA1gF,OAAA,KACSC,KAAAA,CACT,EACA,CACA,CACAlL,EAAAivF,YAAA,CAAAA,CAAA,gBAAAxvF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECvCA,aAuBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2Ga,GAEboD,OAAA8L,cAAc,CAAA7O,EAAa,aAAiB,CAAA0C,MAAA,EAAgB,GAC5D1C,EAAAksB,GAAA,CAAAlsB,EAAmBisB,EAAA,CAAAjsB,EAAe+7F,MAAA,CAAA/7F,EAAeg8F,KAAA,CAAAh8F,EAAei8F,KAAA,CAAAj8F,EAAAk8F,KAAA,CAAAl8F,EAAmCm8F,KAAA,CAAAn8F,EAAgBo8F,KAAA,CAAAp8F,EAAcge,IAAA,CAAAhe,EAAeq8F,GAAA,CAAAr8F,EAAiBs8F,GAAA,CAAAt8F,EAAa+d,GAAG,CAAA/d,EAAWu8F,GAAG,CAAAv8F,EAAA2rB,GAAa,CAAG3rB,EAAA8d,EAAW,CAAG9d,EAAAiZ,MAAc,CAAGjZ,EAAAw8F,MAAa,CAAGx8F,EAAAy8F,QAAgB,CAAAz8F,EAAa08F,IAAG,CAAA18F,EAAA28F,OAAgB,CAAA38F,EAAauf,IAAG,CAAAvf,EAAYm+E,OAAG,CAAAn+E,EAAc48F,QAAA,CAAW58F,EAAG68F,YAAc,CAAA78F,EAAWwd,aAAA,CAAAxd,EAAAmc,KAAA,CAAAnc,EAAAkc,wBAAA,CAAAlc,EAAAic,kBAAA,CAAAjc,EAAAkb,SAAA,CAAAlb,EAAA88F,QAAA,CAAA98F,EAAA+8F,QAAA,CAAA/8F,EAAAg9F,MAAA,CAAAh9F,EAAAi9F,OAAA,CAAAj9F,EAAAk9F,KAAA,CAAAl9F,EAAAm9F,WAAA,CAAAn9F,EAAA+a,SAAA,CAAA/a,EAAAo9F,YAAA,CAAAp9F,EAAA2a,UAAA,CAAA3a,EAAAq9F,KAAA,CAAAr9F,EAAAs9F,GAAA,CAAAt9F,EAAAga,MAAA,CAAAha,EAAA+Z,IAAA,CAAA/Z,EAAA6Z,YAAA,CAAA7Z,EAAAu9F,WAAA,CAAAv9F,EAAA2Z,cAAA,CAAA3Z,EAAAw9F,qBAAA,CAAAx9F,EAAAyZ,gBAAA,CAAAzZ,EAAAyY,MAAA,CAAAzY,EAAAy9F,kBAAA,CAAAz9F,EAAA09F,eAAA,QAClY19F,EAAAyG,QAAA,CAAiBzG,EAAAyxD,IAAA,CAAAzxD,EAAgB29F,IAAA,CAAA39F,EAAAke,IAAA,CAAAle,EAAA49F,wBAAA,CAAA59F,EAAA2d,KAAA,CAAA3d,EAAA8sB,GAAA,CAAA9sB,EAAA69F,IAAA,CAAA79F,EAAA4B,MAAA,CAAA5B,EAAA89F,KAAA,CAAA99F,EAAAurB,GAAA,CAAAvrB,EAAA+9F,KAAA,CAAA/9F,EAAAwrB,GAAA,CAAAxrB,EAAAg+F,MAAA,CAAAh+F,EAAAi+F,KAAA,CAAAj+F,EAAAk+F,KAAA,CAAAl+F,EAAAm+F,KAAA,CAAAn+F,EAAAo+F,KAAA,CAAAp+F,EAAAq+F,KAAA,CAAAr+F,EAAAie,IAAA,CAAAje,EAAAs+F,GAAA,CAAAt+F,EAAAu+F,GAAA,CAAAv+F,EAAAmsB,GAAA,CAAAnsB,EAAAw+F,GAAA,QACjC,IAAAx2E,EAAAroB,EAAA,MAIA,SAAA+9F,EAAA1kF,CAAA,EACA,IAAAA,CAAAA,aAAAxM,UAAA,EACA,0CAOA,SAAAixF,EAAAzkF,CAAA,EAEA,OADA0kF,EAAA1kF,GACAgP,EAAAtnB,MAAA,CAAA2d,IAAA,CAAArF,EAAAqJ,MAAA,CAAArJ,EAAA6kD,UAAA,CAAA7kD,EAAA9X,MAAA,CACA,CAPAlB,EAAA09F,eAAA,CAAAA,EAQA19F,EAAAy9F,kBAAA,CAAAA,CAiBA,OAAAhlF,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAAH,GACA,2CAWA,KAAAA,IAAA,CAAAA,EASA,KAAAC,QAAA,CAAAA,CACA,CAgBAG,uBAAA,CACA,QACA,CAiBAK,QAAAH,CAAA,CAAAC,CAAA,EACA,UAAAP,IAAA,CACA,uCAEA,YAAAA,IAAA,CAkBAU,UAAAT,CAAA,EACA,IAAAU,EAAAtW,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,EAGA,OAFA1L,OAAAC,MAAA,CAAAqW,EAAA,MACAA,EAAAV,QAAA,CAAAA,EACAU,CACA,CAqBAC,UAAAC,CAAA,EAEA,CACA,CAOA,SAAAE,EAAAxW,CAAA,CAAAyW,CAAA,SACA,EAAAf,QAAA,CACA1V,EAAA,IAAAyW,EAAAf,QAAA,KAEA1V,CADA,CAiCA,SAAAu6F,EAAAiB,CAAA,CAAA3kF,CAAA,EACA,sBAAA2kF,EACA,6CAEA,GAAA17F,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA8vF,EAAA,WACA,kDAEA,IAAA3kF,CAAAA,GAAAA,aAAArB,CAAA,EACA,2CAEA,GAAA1V,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAmL,EAAA,qBACA,wDAEA2kF,EAAAC,OAAA,CAAA5kF,EACAA,EAAA6kF,iBAAA,CAAAF,EACA3kF,EAAAhB,qBAAA,SAAA2lF,EACA17F,OAAA8L,cAAA,CAAA4vF,EAAAhwF,SAAA,WACA/L,MAAAsW,CAAA,CAAAC,CAAA,EACS,OAAAa,EAAAnY,MAAA,MAAAqX,EAAAC,EACT,EACK8mC,SAAA,EACL,GACAh9C,OAAA8L,cAAA,CAAA4vF,EAAA,UACA/7F,MAAAA,CAAAsW,EAAAC,IACSa,EAAAf,MAAA,CAAAC,EAAAC,GAEJ8mC,SAAA,EACL,EACA,CAtEA//C,EAAAyY,MAAA,CAAAA,EAYAzY,EAAAyZ,gBAAA,CAAAA,EA2DAzZ,EAAAw9F,qBAAA,CAAAA,CAsBA,OAAA7jF,UAAAlB,EAYAmB,SAAA,CACA,0CAEA,CACA5Z,EAAA2Z,cAAA,CAAAA,CAgBA,OAAA4jF,UAAA5jF,EACA1X,YAAA28F,EAAA,EAAAjmF,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAA+lF,IAAA,GAAAA,EACA,4DAEA,SAAAjmF,GAIA,KAAAimF,WAAA,CAAAA,CACA,CAEAhlF,SAAA,CACA,QACA,CAEAb,OAAAC,CAAA,CAAAC,EAAA,GACAykF,EAAA1kF,GACA,IAAA6lF,EAAA7lF,EAAA9X,MAAA,CAAA+X,EACA,OAAAjY,KAAAwZ,KAAA,CAAAqkF,EAAA,KAAAD,WAAA,CACA,CAEAj9F,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,QACA,CACA,CACAjZ,EAAAu9F,WAAA,CAAAA,CAqBA,OAAA1jF,UAAAF,EACA1X,YAAA6X,CAAA,CAAAb,EAAA,EAAAN,CAAA,EACA,IAAAmB,CAAAA,aAAArB,CAAA,EACA,2CAEA,IAAAG,OAAAC,SAAA,CAAAI,GACA,uDAEA,MAAAa,EAAApB,IAAA,CAAAC,GAAAmB,EAAAnB,QAAA,EAEA,KAAAmB,MAAA,CAAAA,EAOA,KAAAb,MAAA,CAAAA,CACA,CAEAW,SAAA,CACA,YAAAE,MAAA,YAAAC,GACA,KAAAD,MAAA,YAAAE,CACA,CAEAjB,OAAAC,CAAA,CAAAC,EAAA,GACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,KAAAA,MAAA,CACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAAAA,MAAA,CACA,CACA,CACAjZ,EAAA6Z,YAAA,CAAAA,CAiBA,OAAAE,UAAAtB,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAIAK,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAAiB,UAAA,CAAAhB,EAAA,KAAAP,IAAA,CACA,CAEA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAAkB,WAAA,CAAAhB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CAEA,CACA1Y,EAAA+Z,IAAA,CAAAA,CAiBA,OAAAC,UAAAvB,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAIAK,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAAmB,UAAA,CAAAlB,EAAA,KAAAP,IAAA,CACA,CAEA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAAoB,WAAA,CAAAlB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CAEA,CACA1Y,EAAAga,MAAA,CAAAA,CAiBA,OAAAsjF,UAAA7kF,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAIAK,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAA8lF,SAAA,CAAA7lF,EAAA,KAAAP,IAAA,CACA,CAEA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAA+lF,UAAA,CAAA7lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CAEA,CACA1Y,EAAAs9F,GAAA,CAAAA,CAiBA,OAAAD,UAAA5kF,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAIAK,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAAgmF,SAAA,CAAA/lF,EAAA,KAAAP,IAAA,CACA,CAEA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAAimF,UAAA,CAAA/lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CAEA,CACA1Y,EAAAq9F,KAAA,CAAAA,EACA,IAAAhjF,EAAArZ,WAGA,SAAAsZ,EAAApB,CAAA,EACA,IAAAqB,EAAAvZ,KAAAwZ,KAAA,CAAAtB,EAAAmB,GACAI,EAAavB,EAAAqB,EAAAF,EACb,OAAAE,KAAAA,EAAAE,KAAAA,CAAA,CACA,CAEA,SAAAC,EAAAH,CAAA,CAAAE,CAAA,EACA,OAAAF,EAAAF,EAAAI,CACA,CAYA,MAAAE,UAAAlC,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAoJ,EAAAo7E,EAAAzkF,GACAyB,EAAA4H,EAAAzH,YAAA,CAAA3B,GACAsB,EAAA8H,EAAAzH,YAAA,CAAA3B,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EACA,CAEA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA4B,EAAAP,EAAApB,GACAmJ,EAAAo7E,EAAAzkF,GAGA,OAFAqJ,EAAAvH,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAoJ,EAAAvH,aAAA,CAAAD,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,CACA,CACAjZ,EAAA2a,UAAA,CAAAA,CAYA,OAAAyiF,UAAA3kF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAoJ,EAAAo7E,EAAAzkF,GACAuB,EAAA8H,EAAA68E,YAAA,CAAAjmF,GACAwB,EAAA4H,EAAA68E,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EACA,CAEA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA4B,EAAAP,EAAApB,GACAmJ,EAAAo7E,EAAAzkF,GAGA,OAFAqJ,EAAA88E,aAAA,CAAAtkF,EAAAN,IAAA,CAAAtB,GACAoJ,EAAA88E,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,CACA,CACAjZ,EAAAo9F,YAAA,CAAAA,CAYA,OAAAriF,UAAAtC,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAoJ,EAAAo7E,EAAAzkF,GACAyB,EAAA4H,EAAAzH,YAAA,CAAA3B,GACAsB,EAAA8H,EAAArH,WAAA,CAAA/B,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EACA,CAEA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA4B,EAAAP,EAAApB,GACAmJ,EAAAo7E,EAAAzkF,GAGA,OAFAqJ,EAAAvH,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAoJ,EAAApH,YAAA,CAAAJ,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,CACA,CACAjZ,EAAA+a,SAAA,CAAAA,CAYA,OAAAoiF,UAAA1kF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAoJ,EAAAo7E,EAAAzkF,GACAuB,EAAA8H,EAAA+8E,WAAA,CAAAnmF,GACAwB,EAAA4H,EAAA68E,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EACA,CAEA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA4B,EAAAP,EAAApB,GACAmJ,EAAAo7E,EAAAzkF,GAGA,OAFAqJ,EAAAg9E,YAAA,CAAAxkF,EAAAN,IAAA,CAAAtB,GACAoJ,EAAA88E,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,CACA,CACAjZ,EAAAm9F,WAAA,CAAAA,CAWA,OAAAD,UAAAzkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAAsmF,WAAA,CAAArmF,EACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAAumF,YAAA,CAAArmF,EAAAD,GACA,CACA,CACA,CACAjZ,EAAAk9F,KAAA,CAAAA,CAWA,OAAAD,UAAAxkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAAwmF,WAAA,CAAAvmF,EACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAAymF,YAAA,CAAAvmF,EAAAD,GACA,CACA,CACA,CACAjZ,EAAAi9F,OAAA,CAAAA,CAWA,OAAAD,UAAAvkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAA0mF,YAAA,CAAAzmF,EACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAA2mF,aAAA,CAAAzmF,EAAAD,GACA,CACA,CACA,CACAjZ,EAAAg9F,MAAA,CAAAA,CAWA,OAAAD,UAAAtkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EACA,CAEAI,OAAAC,CAAA,CAAAC,EAAA,GACA,OAAAwkF,EAAAzkF,GAAA4mF,YAAA,CAAA3mF,EACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAEA,OADAwkF,EAAAzkF,GAAA6mF,aAAA,CAAA3mF,EAAAD,GACA,CACA,CACA,CACAjZ,EAAA+8F,QAAA,CAAAA,CAkBA,OAAAD,UAAArkF,EACAxW,YAAA4qB,CAAA,CAAA0F,CAAA,CAAA5Z,CAAA,EACA,IAAAkU,CAAAA,aAAApU,CAAA,EACA,kDAEA,kBAAAkB,GAAA4Y,EAAA3Y,OAAA,IACAhB,OAAAC,SAAA,CAAA0Z,IAAA,GAAAA,CAAA,EACA,2FACA,CAEA,IAAA7Z,EAAA,GACA6Z,aAAA5Y,IACA,GAAAkT,EAAAnU,IAAA,GACAA,CAAAA,EAAA6Z,EAAA1F,EAAAnU,IAAA,EAEA,MAAAA,EAAAC,GAEA,KAAAkU,aAAA,CAAAA,EAMA,KAAA0F,KAAA,CAAAA,CACA,CAEApZ,QAAAH,CAAA,CAAAC,EAAA,GACA,WAAAP,IAAA,CACA,YAAAA,IAAA,CAEA,IAAAA,EAAA,EACA6Z,EAAA,KAAAA,KAAA,CAIA,GAHAA,aAAA5Y,GACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA,OAAA4T,aAAA,CAAAnU,IAAA,CACAA,EAAA6Z,EAAA,KAAA1F,aAAA,CAAAnU,IAAA,KAEA,CACA,IAAAtQ,EAAA,EACA,KAAAA,EAAAmqB,GACA7Z,GAAA,KAAAmU,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,EAAAP,GACA,EAAAtQ,CAEA,QACAsQ,CACA,CAEAK,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAI,EAAA,GACA/S,EAAA,EACAisB,EAAA,KAAAA,KAAA,CAIA,IAHAA,aAAA5Y,GACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA3S,EAAAisB,GACAlZ,EAAA7Z,IAAA,MAAAqtB,aAAA,CAAA9T,MAAA,CAAAC,EAAAC,IACAA,GAAA,KAAA4T,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,GACA3S,GAAA,EAEA,OAAA+S,CACA,CAWA1X,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA6mF,EAAA,KAAAjzE,aAAA,CACAnU,EAAAQ,EAAAmC,MAAA,EAAA3C,EAAA3T,IACS2T,EAAAonF,EAAAn+F,MAAA,CAAAoD,EAAAiU,EAAAC,EAAAP,GACT,GAIA,OAHA,KAAA6Z,KAAA,YAAA5Y,GACA,KAAA4Y,KAAA,CAAA5wB,MAAA,CAAAuX,EAAAhY,MAAA,CAAA8X,EAAAC,GAEAP,CACA,CACA,CACA1Y,EAAA88F,QAAA,CAAAA,CAiCA,OAAA5hF,UAAAzC,EACAxW,YAAAkZ,CAAA,CAAAxC,CAAA,CAAAyC,CAAA,EACA,IAAAta,CAAAA,MAAA6D,OAAA,CAAAwW,IACAA,EAAAE,MAAA,EAAAC,EAAAvW,IAAAuW,GAAAvW,aAAA0T,EAAA,KACA,4DAQA,QAAA8C,KANA,kBAAA5C,GACA5U,KAAAA,IAAAqX,IACAA,EAAAzC,EACAA,EAAA5U,KAAAA,GAGAoX,GACA,KAAAI,EAAA7C,IAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,CACA,oEAGA,IAAAD,EAAA,GACA,IACAA,EAAAyC,EAAAE,MAAA,EAAA3C,EAAA6C,IAAA7C,EAAA6C,EAAApC,OAAA,KACA,CACA,MAAA9R,EAAA,CAEA,CACA,MAAAqR,EAAAC,GAWA,KAAAwC,MAAA,CAAAA,EAUA,KAAAC,cAAA,GAAAA,CACA,CAEAjC,QAAAH,CAAA,CAAAC,EAAA,GACA,WAAAP,IAAA,CACA,YAAAA,IAAA,CAEA,IAAAA,EAAA,EACA,IACAA,EAAA,KAAAyC,MAAA,CAAAE,MAAA,EAAA3C,EAAA6C,IAAA,CACA,IAAAC,EAAAD,EAAApC,OAAA,CAAAH,EAAAC,GAEa,OADbA,GAAAuC,EACa9C,EAAA8C,CACb,IACA,CACA,MAAAnU,EAAA,CACA,uCAEA,OAAAqR,CACA,CAEAK,OAAAC,CAAA,CAAAC,EAAA,GACAykF,EAAA1kF,GACA,IAAAyC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CAKA,GAJApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAAC,EAAA,EAEAA,GAAAsC,EAAApC,OAAA,CAAAH,EAAAC,GACA,KAAAmC,cAAA,EACApC,EAAA9X,MAAA,GAAA+X,EACA,MAGA,OAAAwC,CACA,CAMA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAAyC,EAAAzC,EACA0C,EAAA,EACAC,EAAA,EACA,QAAAL,KAAA,KAAAJ,MAAA,EACA,IAAAzC,EAAA6C,EAAA7C,IAAA,CAEA,GADAkD,EAAA,EAAAlD,EAAAA,EAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,IACAD,EAAAL,EAAA5Z,MAAA,CAAAka,EAAA7C,EAAAC,GACA,EAAAP,GAGAA,CAAAA,EAAA6C,EAAApC,OAAA,CAAAH,EAAAC,EAAA,EAGA,GACAA,EACAA,GAAAP,CACA,CAKA,SAAAkD,EAAAF,CACA,CAEApC,UAAAC,CAAA,EACA,IAAAkC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,EAAAY,EAAArY,MAAA,EACAua,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAAY,EAAAuC,KAAA,IAGA,OAAAL,CACA,CASAM,UAAApD,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAeAS,SAAArD,CAAA,EACA,oBAAAA,EACA,2CAEA,IAAAM,EAAA,EACA,QAAAsC,KAAA,KAAAJ,MAAA,EACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAAM,CACA,CACA,EAAAsC,EAAA7C,IAAA,CACAO,EAAA,GAEA,GAAAA,GACAA,CAAAA,GAAAsC,EAAA7C,IAAA,CAEA,CAEA,CACA,CACA1Y,EAAAkb,SAAA,CAAAA,CAeA,OAAAe,EACAha,YAAA0W,CAAiB,EAKjB,KAAAA,QAAA,CAAAA,CACA,CAKAI,OAAAC,CAAA,CAAAC,CAAA,EACA,8CAMAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,8CAEA,CACAjZ,EAAAic,kBAAA,CAAAA,CAkBA,OAAAC,UAAAD,EACAha,YAAA6X,CAAA,CAAAnB,CAAA,EACA,kBAAAgB,GACAG,EAAAF,OAAA,IACA,qEAEA,MAAAjB,GAAiBmB,EAAAnB,QAAsB,aAGvC,KAAAmB,MAAA,CAAAA,CACA,CAEAf,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EACA,CAEAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EACA,CACA,CACAjZ,EAAAkc,wBAAA,CAAAA,CA4DA,OAAAC,UAAA1D,EACAxW,YAAAma,CAAA,CAAAC,CAAA,CAAA1D,CAAA,MACA4D,EACA,gBAAAxC,GACAqC,aAAApC,EACAuC,EAAA,IAAAL,EAAA,IAAArC,EAAAuC,SAEA,gBAAAzC,GACAyC,EAAAxC,OAAA,GACA2C,EAAA,IAAAL,EAAAE,QAEA,GAAAA,aAAAH,EAKAM,EAAAH,OAJA,mFACA,CAQA,GAHArY,KAAAA,IAAAsY,GACAA,CAAAA,EAAA,MAEA,SAAAA,GACAA,aAAA5D,CAAA,EACA,0DAEA,UAAA4D,EAAA,CACA,KAAAA,EAAA3D,IAAA,CACA,0DAEA3U,IAAAsY,EAAA1D,QAAA,EACA0D,CAAAA,EAAAA,EAAAjD,SAAA,YAEA,KAKAV,EAAA,GACA2D,GAEA,GADA3D,CAAAA,EAAA2D,EAAA3D,IAAA,GACA,cAAAqB,GACAqC,aAAApC,CAAA,GACAtB,CAAAA,GAAA6D,EAAAzC,MAAA,CAAApB,IAAA,EAGA,MAAAA,EAAAC,GASA,KAAA4D,aAAA,CAA2BA,EAM3B,KAAAC,uBAAA,cAAAzC,GACAqC,aAAApC,EAQA,KAAAqC,aAAA,CAAAA,EAWA,KAAAI,QAAA,IAEA,IAAAC,EAAA,KAAAC,uBAAA,CAAAC,IAAA,MAcA,MAAAC,gBAAA,UAAA3D,CAAA,EACA,OAAAwD,EAAAxD,EACA,EAcA,KAAA4D,sBAAA,UAAAC,CAAA,EACAL,EAAAK,EAAAH,IAAA,MACA,CACA,CAEAzD,QAAAH,CAAA,CAAAC,EAAA,GACA,WAAAP,IAAA,CACA,YAAAA,IAAA,CAKA,IAAAsE,EAAA,KAAAC,UAAA,CAAAjE,EAAAC,GACA,IAAA+D,EACA,iEAEA,OAAAA,EAAA7D,OAAA,CAAAH,EAAAC,EACA,CA8BA0D,wBAAAzD,CAAA,EACA,GAAAnW,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAuK,EAAA,KAAAqD,aAAA,CAAA5D,QAAA,GACA,QAAA0D,aAAA,OAAAA,aAAA,CAAA1D,QAAA,EACA5V,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAuK,EAAA,KAAAmD,aAAA,CAAA1D,QAAA,EACA,MACA,CACA,IAAAqE,EAAA,KAAAP,QAAA,CAAAvD,CAAA,MAAAqD,aAAA,CAAA5D,QAAA,GACA,GAAAqE,GACA,EAAAA,EAAAlD,MAAA,EACAkD,EAAArE,QAAA,EAAA5V,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAuK,EAAA8D,EAAArE,QAAA,GACA,OAAAqE,CACA,MAGA,QAAAE,KAAA,KAAAT,QAAA,EACA,IAAAO,EAAA,KAAAP,QAAA,CAAAS,EAAA,CACA,GAAAF,EAAArE,QAAA,EAAA5V,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAuK,EAAA8D,EAAArE,QAAA,EACA,OAAAqE,CACA,CAEA,MACA,qCAQAjE,OAAAC,CAAA,CAAAC,EAAA,OACAwC,EACA,IAAA0B,EAAA,KAAAZ,aAAA,CACAH,EAAAe,EAAApE,MAAA,CAAAC,EAAAC,GACAmE,EAAA,KAAAX,QAAA,CAAAL,EAAA,CACA,GAAArY,KAAAA,IAAAqZ,EAAA,CACA,IAAAf,EAAA,KAAAA,aAAA,CACAgB,EAAA,CACA,MAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAGA+C,CADAA,EAAA,KAAA3C,qBAAA,GACA,CAAAqE,EAAAxE,QAAA,EAAAyD,EAGAX,CAAA,CAAAY,EAAA1D,QAAA,EAAA0D,EAAAtD,MAAA,CAAAC,EAAAC,EAAAoE,EACA,MAEA5B,EAAA2B,EAAArE,MAAA,CAAAC,EAAAC,EACA,CACA,OAAAwC,CACA,CAOA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAA+D,EAAA,KAAAH,gBAAA,CAAA3D,GACA,GAAAnV,KAAAA,IAAAiZ,EAAA,CACA,IAAAG,EAAA,KAAAZ,aAAA,CAGAa,EAAA,KAAAf,aAAA,CACAgB,EAAA,EAOA,OANA,KAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAEAyE,EAAAxb,MAAA,CAAAuX,CAAA,CAAAiE,EAAAxE,QAAA,EAAAK,EAAAC,GAGAoE,EAAAD,EAAAzb,MAAA,CAAAuX,CAAA,CAAAkE,EAAAzE,QAAA,EAAAK,EAAAC,EAAAoE,EACA,QACAL,EAAArb,MAAA,CAAAuX,EAAAF,EAAAC,EACA,CAcAqE,WAAAC,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAU,EAAA,IAAAmE,EAAA,KAAAD,EAAAzD,EAAAnB,GAEA,OADA,KAAA8D,QAAA,CAAAc,EAAA,CAAAlE,EACAA,CACA,CAeA4D,WAAAQ,CAAA,CAAAxE,EAAA,GACA,IAAAsE,EAOA,OALAA,EADAE,aAAAjR,WACA,KAAA+P,aAAA,CAAAxD,MAAA,CAAA0E,EAAAxE,GAGAwE,EAEA,KAAAhB,QAAA,CAAAc,EAAA,CAEA,CACAvd,EAAAmc,KAAA,CAAAA,CA8BA,OAAAqB,UAAA/E,EACAxW,YAAA0b,CAAA,CAAAJ,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAgF,CAAAA,aAAAxB,CAAA,EACA,yCAEA,IAAAvD,OAAAC,SAAA,CAAA0E,IAAA,EAAAA,EACA,4DAOA,GALA,iBAAAzD,GACA/V,KAAAA,IAAA4U,IACAA,EAAAmB,EACAA,EAAA,MAEAA,EAAA,CACA,IAAAA,CAAAA,aAAArB,CAAA,EACA,2CAEA,UAAAkF,EAAAtB,aAAA,EACA,GAAAvC,EAAApB,IAAA,EACAoB,EAAApB,IAAA,CAAAiF,EAAAtB,aAAA,CAAA3D,IAAA,CACA,6DAEA,oBAAAC,EACA,uDAEA,IACAD,EAAAiF,EAAAjF,IAAA,CACA,EAAAiF,EAAAjF,IAAA,EAEA,GADAA,CAAAA,EAAAoB,EAAAA,EAAApB,IAAA,KACAiF,EAAAnB,uBAAA,EACA9D,CAAAA,GAAAiF,EAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA,MAAAA,EAAiBC,GAEjB,KAAAgF,KAAA,CAAAA,EAIA,KAAAJ,OAAiB,CAAAA,EAKjB,KAAAzD,MAAA,CAAAA,GAAA,KAGAX,QAAAH,CAAA,CAAAC,EAAA,GACA,WAAAP,IAAA,CAGA,YAAAA,IAAA,CAEA,IAAA2E,EAAA,CACA,MAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA,IAAAA,EAAA,EAIA,OAHA,KAAAoB,MAAA,EACApB,CAAAA,EAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,EAAA,EAEAA,EAAA3E,CACA,CAEAK,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAwC,EAAA,KAAA3C,qBAAA,GACA,eAAA6E,KAAA,CAAAV,UAAA,CAAAjE,EAAAC,GACA,gCAEA,IAAAoE,EAAA,EAaA,OAZA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,CACA2B,CAAA,MAAA9C,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAAoE,GAEA,KAAA1E,QAAA,CACA8C,CAAA,MAAA9C,QAAA,KAEA,KAAAgF,KAAA,CAAAnB,uBAAA,EACAf,CAAAA,CAAA,MAAAkC,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAEA9B,CACA,CAEA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAAoE,EAAA,EAIA,GAHA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,EACA,CAAA/W,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAuK,EAAA,KAAAP,QAAA,EACA,+CAAAA,QAAA,EAEA,KAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAvE,EAAAC,GACA,IAAAP,EAAA2E,EACA,QAAAvD,MAAA,GACA,KAAAA,MAAA,CAAAnY,MAAA,CAAAuX,CAAA,MAAAP,QAAA,EAAAK,EAAAC,EAAAoE,GACA3E,GAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,GACA,QAAAM,KAAA,CAAAjF,IAAA,EACAA,EAAA,KAAAiF,KAAA,CAAAjF,IAAA,EACA,yDAGA,OAAAA,CACA,CAGAY,UAAAC,CAAA,EACA,QAAAO,MAAA,CACA,YAAAA,MAAA,CAAAR,SAAA,CAAAC,EACA,CAGA,CAQA,SAAAwmF,EAAAh7F,CAAA,EAIA,OAHA,EAAAA,GACAA,CAAAA,GAAA,YAEAA,CACA,CAZA/E,EAAAwd,aAAA,CAAAA,CA4CA,OAAAq/E,UAAApkF,EACAxW,YAAA+9F,CAAA,CAAAC,CAAA,CAAAtnF,CAAA,EACA,kBAAAoB,GACAimF,aAAAhmF,CAAA,EACA,wDAOA,GALA,iBAAAimF,GACAl8F,KAAAA,IAAA4U,IACAA,EAAAsnF,EACAA,EAAA,IAEA,EAAAD,EAAAtnF,IAAA,CACA,+CAEA,MAAAsnF,EAAAtnF,IAAA,CAAAC,GAIA,KAAAqnF,IAAA,CAAAA,EAQA,KAAAC,GAAA,GAAAA,EAOA,KAAA9kF,MAAA,IAIA,IAAAzY,EAAA,CACA,MAAAw9F,eAAA,UAAAn7F,CAAA,EAEA,OADArC,EAAAq9F,EAAAh7F,GACA,MAEA,KAAAo7F,eAAA,YACA,OAAAz9F,CACA,CACA,CAEAqW,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAwC,EAAA,KAAA3C,qBAAA,GACApW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAA,EAGA,OAAAyC,CACA,CAMA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GACA,IAAAvW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACA,GAAApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,GACAN,EAAA5Z,MAAA,CAAAka,EAEA,QAEA,KAAAmkF,IAAA,CAAAr+F,MAAA,MAAAw+F,eAAA,GAAAnnF,EAAAC,EACA,CAUAmnF,SAAAvC,CAAA,CAAAllF,CAAA,EACA,IAAA0nF,EAAA,IAAAzD,EAAA,KAAAiB,EAAAllF,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CACA,CAUAC,WAAA3nF,CAAA,EAEA,IAAA0nF,EAAA,IAAAliB,EAAA,KAAAxlE,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CACA,CASAE,SAAA5nF,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAIA,CACAvb,EAAA68F,YAAA,CAAAA,CAqBA,OAAAD,EACA36F,YAAA8sB,CAAA,CAAA8uE,CAAA,CAAAllF,CAAA,EACA,IAAAoW,CAAAA,aAAA8tE,CAAA,EACA,oDAEA,IAAAjkF,OAAAC,SAAA,CAAAglF,IAAA,GAAAA,EACA,iDAEA,IAAA2C,EAAA,EAAAzxE,EAAArW,IAAA,CACA+nF,EAAA1xE,EAAA5T,MAAA,CAAAE,MAAA,EAAAqlF,EAAAnlF,IAAAmlF,EAAAnlF,EAAAsiF,IAAA,IACA,KAAA4C,EAAAD,EACA,iDACAA,CAAAA,EAAAC,CAAA,SACAD,EAAA,YAIA,KAAAzxE,SAAA,CAAAA,EAEA,KAAA8uE,IAAA,CAAAA,EAMA,KAAA8C,SAAA,KAA2B9C,CAAA,IAC3B,KAAAA,GACA,MAAA8C,SAAA,aAKA,KAAAnvD,KAAA,CAAAivD,EACA,KAAA1xE,SAAA,CAAAkxE,GAAA,EACA,MAAAzuD,KAAA,CAAAgvD,EAAAC,EAAA5C,CAAA,EAIA,KAAA+C,QAAA,CAAAb,EAAA,KAAAY,SAAA,OAAAnvD,KAAA,EAWA,KAAA74B,QAAA,CAAAA,CACA,CAGAI,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAA+mF,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,EAAAC,EAAA,KAAAY,QAAA,EACAl+F,EAAAm+F,IAAA,KAAArvD,KAAA,CACA,OAAA9uC,CACA,CAMAf,OAAAe,CAAA,EACA,oBAAAA,GACA,CAAAkW,OAAAC,SAAA,CAAAnW,IACAA,IAAAq9F,EAAAr9F,EAAA,KAAAi+F,SAAA,EACA,gBAAAlnF,EAAA,wBACA,6CAAAknF,SAAA,EAEA,IAAAX,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,EAAAr9F,GAAA,KAAA8uC,KAAA,EACA,KAAAziB,SAAA,CAAAmxE,eAAA,CAAAH,EAAAC,EAAA,MAAAY,QAAA,EACAC,EACA,CACA,CACA7gG,EAAA48F,QAAA,CAAAA,CAkBA,OAAAze,UAAAye,EACA36F,YAAA8sB,CAAA,CAAApW,CAAA,EACA,MAAAoW,EAAA,EAAApW,EACA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACA,cAAAF,MAAA,CAAAC,EAAAC,EACA,CAEAtX,OAAAe,CAAA,EACA,kBAAAA,GAEAA,CAAAA,EAAA,CAAAA,CAAA,EAEA,MAAAf,MAAA,CAAAe,EACA,CACA,CACA1C,EAAAm+E,OAAA,CAAAA,CAgBA,OAAA5+D,UAAA9G,EACAxW,YAAAf,CAAA,CAAAyX,CAAA,EACA,kBAAAgB,GAAAzY,EAAA0Y,OAAA,IACAhB,OAAAC,SAAA,CAAA3X,IAAA,GAAAA,CAAA,EACA,wFACA,CAEA,IAAAwX,EAAA,GACAxX,aAAAyY,GACAjB,CAAAA,EAAAxX,CAAA,EAEA,MAAAwX,EAAAC,GAMA,KAAAzX,MAAA,CAAAA,CACA,CAEAiY,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAP,CACA,CAEAK,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAwkF,EAAAzkF,GAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EACA,CAMA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAxX,MAAA,CAIA,GAHA,KAAAA,MAAA,YAAAyY,GACAjB,CAAAA,EAAAQ,EAAAhY,MAAA,EAEA,CAAAgY,CAAAA,aAAA1M,YAAAkM,IAAAQ,EAAAhY,MAAA,EACA,gBAAAuY,EAAA,oBACA,qBAAAf,EAAA,uBAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,iDAEA,IAAA4/F,EAAArD,EAAAvkF,GAKA,OAJAukF,EAAAzkF,GAAA6E,KAAA,CAAAijF,EAAA73F,QAAA,QAAAgQ,EAAAP,EAAA,OACA,KAAAxX,MAAA,YAAAyY,GACA,KAAAzY,MAAA,CAAAS,MAAA,CAAA+W,EAAAM,EAAAC,GAEAP,CACA,CACA,CACA1Y,EAAAuf,IAAA,CAAAA,CAcA,OAAAo9E,UAAAlkF,EACAxW,YAAA0W,CAAA,EACA,SAAAA,EACA,CAEAQ,QAAAH,CAAA,CAAAC,EAAA,GACAykF,EAAA1kF,GACA,IAAA5Q,EAAA6Q,EACA,OAAAD,EAAA9X,MAAA,MAAA8X,CAAA,CAAA5Q,EAAA,EACAA,GAAA,EAEA,SAAAA,EAAA6Q,CACA,CAEAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,OAAAwkF,EAAAzkF,GAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,GAAAzP,QAAA,SACA,CAEAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAIA,iBAAAC,GACAA,CAAAA,EAAAkH,OAAAlH,EAAA,EAEA,IAAA6nF,EAAA/4E,EAAAtnB,MAAA,CAAA2d,IAAA,CAAAnF,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,KAAAwX,EAAAM,EAAA9X,MAAA,CACA,6CAEA,IAAAmhB,EAAAo7E,EAAAzkF,GAGA,OAFA+nF,EAAAl5E,IAAA,CAAAxF,EAAApJ,GACAoJ,CAAA,CAAApJ,EAAAP,EAAA,GACAA,EAAA,CACA,CACA,CACA1Y,EAAA28F,OAAA,CAAAA,CAoBA,OAAAD,UAAAjkF,EACAxW,YAAA+1E,CAAA,CAAAr/D,CAAA,EAKA,GAJA,iBAAAq/D,GAAAj0E,KAAAA,IAAA4U,IACAA,EAAAq/D,EACAA,EAAAj0E,KAAAA,GAEAA,KAAAA,IAAAi0E,EACAA,EAAA,QAEA,IAAAp/D,OAAAC,SAAA,CAAAm/D,GACA,8CAEA,SAAAr/D,GASA,KAAAq/D,OAAA,CAAAA,CACA,CAEA7+D,QAAAH,CAAA,CAAAC,EAAA,GAEA,OADAykF,EAAA1kF,GACAA,EAAA9X,MAAA,CAAA+X,CACA,CAEAF,OAAAC,CAAA,CAAAC,EAAA,GACA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,WAAA++D,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,OAAA+kF,EAAAzkF,GAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,GAAAzP,QAAA,SACA,CAEAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,EAAA,GAIA,iBAAAC,GACAA,CAAAA,EAAAkH,OAAAlH,EAAA,EAEA,IAAA6nF,EAAA/4E,EAAAtnB,MAAA,CAAA2d,IAAA,CAAAnF,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,WAAA82E,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAGA,OADA6/F,EAAAl5E,IAAA,CAAA41E,EAAAzkF,GAAAC,GACAP,CACA,CACA,CACA1Y,EAAA08F,IAAA,CAAAA,CAoBA,OAAAD,UAAAhkF,EACAxW,YAAAS,CAAA,CAAAiW,CAAA,EACA,QAAAA,GAUA,KAAAjW,KAAA,CAAAA,CACA,CAEAqW,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAvW,KAAA,CAGAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAEA,QACA,CACA,CACAjZ,EAAAy8F,QAAA,CAAiBA,EAEjBz8F,EAAAw8F,MAAA,CAAiB,CAAAoC,EAAAjmF,IAAmB,IAAA4kF,EAAAqB,EAAAjmF,GAEpC3Y,EAAAiZ,MAAA,CAAiB,CAAAa,EAAAb,EAAAN,IAAA,IAAiCkB,EAAAC,EAAAb,EAAAN,GAGlD3Y,EAAA8d,EAAA,IAAiB,IAAA/D,EAAA,EAAApB,GAGjB3Y,EAAA2rB,GAAA,IAAiB,IAAA5R,EAAA,EAAApB,GAGjB3Y,EAAAu8F,GAAA,IAAiB,IAAAxiF,EAAA,EAAApB,GAGjB3Y,EAAA+d,GAAA,IAAiB,IAAAhE,EAAA,EAAApB,GAGjB3Y,EAAAs8F,GAAA,IAAiB,IAAAviF,EAAA,EAAApB,GAGjB3Y,EAAAq8F,GAAA,IAAiB,IAAAtiF,EAAA,EAAApB,GAGjB3Y,EAAAge,IAAA,IAAiB,IAAArD,EAAAhC,GAGjB3Y,EAAAo8F,KAAA,CAAiB,OAAApiF,EAAA,EAAArB,GAGjB3Y,EAAAm8F,KAAA,CAAiB,OAAAniF,EAAA,EAAArB,GAGjB3Y,EAAAk8F,KAAA,CAAiB,OAAAliF,EAAA,EAAArB,GAGjB3Y,EAAAi8F,KAAA,CAAiB,OAAAjiF,EAAA,EAAArB,GAGjB3Y,EAAAg8F,KAAA,CAAiB,OAAAhiF,EAAA,EAAArB,GAGjB3Y,EAAA+7F,MAAA,CAAiB,OAAAqB,EAA8BzkF,GAG/C3Y,EAAAisB,EAAA,IAAiB,IAAAqxE,EAAA,EAAA3kF,GAGjB3Y,EAAAksB,GAAA,IAAiB,IAAAoxE,EAAA,EAAA3kF,GAGjB3Y,EAAAw+F,GAAA,IAAiB,IAAAlB,EAAA,EAAA3kF,GAGjB3Y,EAAAmsB,GAAA,IAAiB,IAAAmxE,EAAA,EAAA3kF,GAGjB3Y,EAAAu+F,GAAA,IAAiB,IAAAjB,EAAA,EAAA3kF,GAGjB3Y,EAAAs+F,GAAA,IAAiB,IAAAhB,EAAA,EAAA3kF,GAGjB3Y,EAAAie,IAAA,IAAiB,IAAAlD,EAAApC,GAGjB3Y,EAAAq+F,KAAA,CAAiB,OAAAhB,EAAA,EAAA1kF,GAGjB3Y,EAAAo+F,KAAA,CAAiB,OAAAf,EAAA,EAAA1kF,GAGjB3Y,EAAAm+F,KAAA,CAAiB,OAAAd,EAAA,EAAA1kF,GAGjB3Y,EAAAk+F,KAAA,CAAiB,OAAAb,EAAA,EAAA1kF,GAGjB3Y,EAAAi+F,KAAA,CAAiB,OAAAZ,EAAA,EAAA1kF,GAGjB3Y,EAAAg+F,MAAA,CAAiB,OAAAb,EAAAxkF,GAEjB3Y,EAAAwrB,GAAA,IAAiB,IAAA0xE,EAAAvkF,GAEjB3Y,EAAA+9F,KAAA,CAAiB,OAAAd,EAAAtkF,GAEjB3Y,EAAAurB,GAAA,IAAiB,IAAAyxE,EAAArkF,GAEjB3Y,EAAA89F,KAAA,CAAiB,OAAiBf,EAAApkF,GAElC3Y,EAAA4B,MAAA,CAAiB,CAAAuZ,EAAAxC,EAAoByC,IAAA,IAAAF,EAAAC,EAAAxC,EAAAyC,GAErCpb,EAAA69F,IAAA,EAAiBmC,EAAAC,EAAAtnF,IAAgB,IAAAkkF,EAAAmD,EAAAC,EAAAtnF,GAEjC3Y,EAAA8sB,GAAA,EAAAD,EAA8B0F,EAAA5Z,IAAA,IAAAmkF,EAAAjwE,EAAA0F,EAAA5Z,GAE9B3Y,EAAA2d,KAAA,CAAiB,CAAAvB,EAAAC,EAAA1D,IAAgC,IAAAwD,EAAAC,EAAAC,EAAA1D,GAEjD3Y,EAAA49F,wBAA6B,EAAA9jF,EAAAnB,IAAA,IAAAuD,EAAApC,EAAAnB,GAE7B3Y,EAAAke,IAAA,EAAiBhd,EAAAyX,IAAe,IAAA4G,EAAAre,EAAAyX,GAEhC3Y,EAAA29F,IAAA,IAA6B,IAAAhB,EAAAhkF,GAE7B3Y,EAAAyxD,IAAA,EAAiBumB,EAAAr/D,IAAgB,IAAA+jF,EAAA1kB,EAAAr/D,GAEjC3Y,EAAAyG,QAAA,EAAA/D,EAAAiW,IAAA,IAAA8jF,EAAA/5F,EAAAiW,EAAA,gBAAAlZ,CAAA,CAAAC,CAAA,CAAAC,CAAA,eCp1EA,SAAAqhG,EAAArhD,CAAA,EAGA,MAIAqhD,CAJAA,EAAA,mBAAA19F,QAAA,iBAAAA,OAAAC,QAAA,UAAAo8C,CAAA,EACI,cAAAA,CACJ,WAAAA,CAAA,EACG,OAAAA,GAAA,mBAAAr8C,QAAAq8C,EAAA19C,WAAA,GAAAqB,QAAAq8C,IAAAr8C,OAAAmL,SAAA,iBAAAkxC,CAAA,CACH,EAAAA,EAAA,CCNA,SAAAshD,EAAkB97F,CAAA,CAAAf,CAAO,EACzB,aAAA48F,EAAA77F,IAAA,CAAAA,EAAA,OAAAA,CAAA,CACA,IAAAkC,EAAAlC,CAAA,CAAA7B,OAAA29F,WAAA,EACA,YAAA55F,EAAA,CACA,IAAAf,EAAAe,EAAAsH,IAAA,CAAAxJ,EAAoBf,GAAO,WAC3B,aAAA48F,EAAA16F,GAAA,OAAAA,CAAA,OACA,0DACA,MACA,YAAAlC,EAAAgc,OAAAxH,MAAA,EAAAzT,EAAA,CCPA,SAAA+7F,EAAqB/7F,CAAA,EACrB,IAAAmB,EAAA26F,EAAqB97F,EAAA,UACrB,gBAAA67F,EAAA16F,GAAAA,EAAAA,EAAA,GCHA,SAAA66F,EAAc95F,CAAA,CAAajD,CAAA,CAAAe,CAAA,EAC3B,OAAAf,EAAA88F,EAAA98F,EAAA,IAAAiD,EAAAtE,OAAA8L,cAAA,CAAAxH,EAAAjD,EAAA,CACA1B,MAAAyC,EACA6mB,WAAA,GACAg0B,aAAA,GACGD,SAAA,EACH,GAAA14C,CAAA,CAAAjD,EAAA,CAAAe,CAAA,CAAAkC,CAAA,CJ60EA1H,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,+CAAA0mD,EAAA,kCAAAtH,EAAA,+BAAAuJ,EAAA,gCAAAjJ,EAAA,qCAAAJ,EAAA,0BAAAE,EAAA,wBAAAh4B,EAAA,II70EA,IC8yEAk6E,EA6cAC,ED3vFA1hC,EAAAhgE,EAAA,MAAA2hG,EAAA3hG,EAAAW,CAAA,CAAAq/D,GAAA4hC,EAAA5hG,EAAA,MCJA0iB,EAAA,GAEAm/E,EAAA,EAGAA,CAAAA,EAAAp/E,UAAA,CAAAA,EACAo/E,EAAArwC,WAAA,CAAAA,EAAAqwC,EAAA5vC,aAAA,CAAAA,EAQA,QALA6vC,EAAA,GACAC,EAAA,GAAAC,EAAA,oBAAAn1F,WAAAA,WAAA1L,KAAA,CAGAyJ,EAAA,mEACAjE,EAAA,EAAAozB,EAAAnvB,EAAArJ,MAAA,CAAAoF,EAAAozB,EAAA,EAAApzB,EACAm7F,CAAA,CAAAn7F,EAAA,CAAAiE,CAAA,CAAAjE,EAAA,CACAo7F,CAAA,CAAAn3F,EAAAomB,UAAA,CAAArqB,GAAA,CAAAA,EAQA,SAAAs7F,EAAAC,CAAA,MAAAnoE,EAAAmoE,EAAA3gG,MAAA,CAGA,GAAAw4B,EAAA,IACA,8DAKA,IAAAooE,EAAAD,EAAA3hF,OAAA,WAAA4hF,GAAAA,CAAAA,EAAApoE,CAAA,EAGA,IAAAqoE,EAAAD,IAAApoE,EACA,IAAAooE,EAAA,EAGA,OAAAA,EAAAC,EAAA,CAIA,SAAA3/E,EAAAy/E,CAAA,EACA,IAAAG,EAAAJ,EAAAC,GACAC,EAAAE,CAAA,IACAD,EAAAC,CAAA,IACA,OAAAF,EAAAC,CAAA,MAAAA,CAAA,CAGA,SAAAE,EAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,OAAAD,EAAAC,CAAA,MAAAA,CAAA,CAGA,SAAA5wC,EAAA0wC,CAAA,EAEA,IADAK,EAcA57F,EAbA07F,EAAAJ,EAAAC,GACAC,EAAAE,CAAA,IAAAD,EAAAC,CAAA,IAEAl0B,EAAA,IAAA6zB,EAAAM,EAAAJ,EAAAC,EAAAC,IAEAI,EAAA,EAIAzoE,EAAAqoE,EAAA,EACAD,EAAA,EAAAA,CAAA,CAIA,IAAAx7F,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACA47F,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,KACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,QACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,IACAwnE,CAAA,CAAAq0B,IAAA,WACAr0B,CAAA,CAAAq0B,IAAA,UACAr0B,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,EAmBA,OAhBA,IAAAH,IACAG,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,IACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAwnE,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,GAGA,IAAAH,IACAG,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,KACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAwnE,CAAA,CAAAq0B,IAAA,UACAr0B,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,GAGAp0B,CAAA,CAGA,SAAAs0B,EAAA91E,CAAA,EACA,OAAAm1E,CAAA,CAAAn1E,GAAA,OACAm1E,CAAA,CAAAn1E,GAAA,OACAm1E,CAAA,CAAAn1E,GAAA,MACAm1E,CAAA,CAAAn1E,GAAAA,EAAA,CAGA,SAAA+1E,EAAAC,CAAA,CAAA9wD,CAAA,CAAA1gB,CAAA,EAGA,QADAqC,EAAA,GACA7sB,EAAAkrC,EAAAlrC,EAAAwqB,EAAAxqB,GAAA,EAKA6sB,EAAA3zB,IAAA,CAAA4iG,EAHA,GAAA97F,EAAA,eACA,GAAAA,EAAA,aACAg8F,CAAAA,IAAAA,CAAA,CAAAh8F,EAAA,MAGA,OAAA6sB,EAAA1wB,IAAA,KAGA,SAAAmvD,EAAA0wC,CAAA,EAQA,QAPAJ,EACAxoE,EAAA4oE,EAAAphG,MAAA,CACAqhG,EAAA7oE,EAAA,EACA9U,EAAA,GAA8B49E,EAAA,MAI9Bl8F,EAAA,EAAAm8F,EAAA/oE,EAAA6oE,EAAAj8F,EAAAm8F,EAAAn8F,GAAAk8F,EACA59E,EAAAplB,IAAA,CAAA6iG,EAAAC,EAAAh8F,EAAA,EAAAk8F,EAAAC,EAAAA,EAAAn8F,EAAAk8F,CAAA,GAqBA,OAjBAD,IAAAA,EAEA39E,EAAAplB,IAAA,CACAiiG,CAAA,CAAAS,CAFAA,EAAAI,CAAA,CAAA5oE,EAAA,KAEA,GACA+nE,CAAA,UACA,MAEA,IAAAc,GAEA39E,EAAAplB,IAAA,CACAiiG,CAAA,CAAAS,CAFAA,EAAA,CAAAI,CAAA,CAAA5oE,EAAA,OAAA4oE,CAAA,CAAA5oE,EAAA,KAEA,IACA+nE,CAAA,UACAA,CAAA,UACA,KAIA78E,EAAAniB,IAAA,KAlIAi/F,CAAA,KAAA/wE,UAAA,QAAA+wE,CAAA,KAAA/wE,UAAA,QAoIA,IAAA+xE,EAAA,EAEA,2FAGAA,EAAAC,IAAA,UAAAtgF,CAAA,CAAApJ,CAAA,CAAA2pF,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAEA,IADAz7F,EAAA8iB,EACA44E,EAAA,EAAAD,EAAAD,EAAA,EACAG,EAAA,IAAAD,CAAA,IACAE,EAAAD,GAAA,EACAE,EAAA,GACA58F,EAAAs8F,EAAAE,EAAA,IACAljG,EAAAgjG,EAAA,KAAA59F,EAAAqd,CAAA,CAAApJ,EAAA3S,EAAA,CAOoB,IALpBA,GAAA1G,EAGAyH,EAAArC,EAAA,KAAAk+F,CAAA,IACAl+F,IAAA,CAAAk+F,EACAA,GAASH,EAAWG,EAAA,EAAA77F,EAAA,IAAAA,EAAAgb,CAAA,CAAApJ,EAAA3S,EAAA,CAAAA,GAAA1G,EAAAsjG,GAAA,GAKA,IAFpB/4E,EAAA9iB,EAAA,KAAA67F,CAAA,IACA77F,IAAA,CAAA67F,EACAA,GAASL,EAAWK,EAAA,EAAA/4E,EAAA,IAAAA,EAAA9H,CAAA,CAAApJ,EAAA3S,EAAA,CAAAA,GAAA1G,EAAAsjG,GAAA,GAGpB,GAAA77F,IAAAA,EACIA,EAAA,EAAA47F,OACJ,GAAA57F,IAAA27F,EACI,OAAA74E,EAAAg5E,IAAA,CAAAn+F,EAAA,MAAAo+F,CAAAA,GAAA,EAEJj5E,GAAAnpB,KAAAs/C,GAAA,GAAAuiD,GACAx7F,GAAA47F,EACA,MACA,CAAAj+F,EAAA,MAAAmlB,EAAAnpB,KAAAs/C,GAAA,GAAAj5C,EAAAw7F,EAAA,EAGAH,EAAA7kF,KAAA,UAAAwE,CAAA,CAAA3f,CAAA,CAAAuW,CAAA,CAAA2pF,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAEA,IADAz7F,EAAA8iB,EAAA49B,EACAg7C,EAAA,EAAAD,EAAAD,EAAA,EACAG,EAAA,IAAAD,CAAA,IACAE,EAAAD,GAAA,EACAjwC,EAAA8vC,KAAAA,EAAA7hG,qBAAA,EACAsF,EAAAs8F,EAAA,EAAAE,EAAA,EACAljG,EAAAgjG,EAAA,KAAA59F,EAAAtC,EAAA,GAAAA,IAAAA,GAAA,EAAAA,EAAA,MAmCoB,IA9BpBmE,MAHAnE,EAAA1B,KAAA+uB,GAAA,CAAArtB,KAGAA,IAAA0gG,KACAj5E,EAAAtjB,MAAAnE,GAAA,IACI2E,EAAA27F,IAEJ37F,EAAArG,KAAAwZ,KAAA,CAAAxZ,KAAA2zD,GAAA,CAAAjyD,GAAA1B,KAAAqiG,GAAA,EACA3gG,EAAAqlD,CAAAA,EAAA/mD,KAAAs/C,GAAA,IAAAj5C,EAAA,MACAA,IACA0gD,GAAA,GAEA1gD,EAAA47F,GAAA,EACMvgG,GAAAqwD,EAAAhL,EAENrlD,GAAAqwD,EAAA/xD,KAAAs/C,GAAA,KAAA2iD,GAEAvgG,EAAAqlD,GAAA,IACA1gD,IACA0gD,GAAA,GAGA1gD,EAAA47F,GAAAD,GACA74E,EAAA,EACM9iB,EAAA27F,GACN37F,EAAA47F,GAAA,GACA94E,EAAA,GAAA49B,EAAA,GAAA/mD,KAAAs/C,GAAA,GAAAuiD,GACMx7F,GAAA47F,IAEN94E,EAAAznB,EAAA1B,KAAAs/C,GAAA,GAAA2iD,EAAA,GAAAjiG,KAAAs/C,GAAA,GAAAuiD,GACAx7F,EAAA,IAGoBw7F,GAAA,EAAAxgF,CAAA,CAAApJ,EAAA3S,EAAA,CAAA6jB,IAAAA,EAAA7jB,GAAA1G,EAAAuqB,GAAA,IAAA04E,GAAA,GAID,IADnBx7F,EAAA,GAAAw7F,EAAA14E,EACA44E,GAASF,EAAUE,EAAA,EAAA1gF,CAAA,CAAApJ,EAAA3S,EAAA,CAAAe,IAAAA,EAAAf,GAAA1G,EAAAyH,GAAA,IAAA07F,GAAA,GAGnB1gF,CAAA,CAAApJ,EAAA3S,EAAA1G,EAAA,EAAAoF,IAAAA,CAAA,EASA,SAAAhF,CAAA,EAGA,IAAA2xD,EAAA6vC,EACA8B,EAAAZ,EACAa,EACA,mBAAAjgG,QAAA,mBAAAA,OAAA,IACAA,OAAA,uCAGAtD,EAAAU,MAAA,CAAAA,EACAV,EAAAwjG,UAAA,CAAAA,EAAAxjG,EAAAyjG,iBAAA,IAGA,IAAAC,EAAA,WA2BA,SAAAC,GAAA,CAEA,IACA,IAAA71B,EAAA,IAAoBthE,WAAA,GACpBo3F,EAAA,CAAAC,IAAA,uBAGI,OAFJ9gG,OAAA+gG,cAAA,CAAAF,EAAAp3F,WAAAiC,SAAA,EACA1L,OAAA+gG,cAAA,CAAAh2B,EAAA81B,GACI91B,KAAAA,EAAA+1B,GAAA,EACJ,OAAAx8F,EAAA,CACA,QACA,EAmBA,SAAA08F,EAAA7iG,CAAA,EACA,GAAAA,EAAAwiG,EACA,+BAAAxiG,EAAA,kCAGA,IAAA8gB,EAAA,IAAAxV,WAAAtL,GAEA,OADA6B,OAAA+gG,cAAA,CAAA9hF,EAAAthB,EAAA+N,SAAA,EACAuT,CAAA,CAaA,SAAAthB,EAAAo2B,CAAA,CAAAktE,CAAA,CAAA9iG,CAAA,EAEA,oBAAA41B,EAAA,CACA,oBAAAktE,EACA,gBACA,qEACA,CAEA,OAAAC,EAAAntE,EACA,QACAzY,EAAAyY,EAAAktE,EAAA9iG,EAAA,CAKA,SAAAmd,EAAA3b,CAAA,CAAAshG,CAAA,CAAA9iG,CAAA,EACA,oBAAAwB,EACA,OAAAwhG,EAAAxhG,EAAAshG,EAAA,CAGA,GAAAhkF,YAAAC,MAAA,CAAAvd,GACA,OAAAyhG,EAAAzhG,EAAA,CAGA,GAAAA,IAAA,EAAAA,EACA,gBACA,kHACA,OAAAA,EACA,CAGA,GAAA0hG,GAAA1hG,EAAAsd,cACAtd,GAAA0hG,GAAA1hG,EAAA2f,MAAA,CAAArC,cAIA,oBAAAqkF,mBACAD,CAAAA,GAAA1hG,EAAA2hG,oBACA3hG,GAAA0hG,GAAA1hG,EAAA2f,MAAA,CAAAgiF,kBAAA,EALA,OAAAC,EAAA5hG,EAAAshG,EAAA9iG,EAAA,CASA,oBAAAwB,EACA,gBACA,wEACA,CAGA,IAAA6hG,EAAA7hG,EAAA6hG,OAAA,EAAA7hG,EAAA6hG,OAAA,GACA,GAAAA,IAAA,EAAAA,GAAAA,IAAA7hG,EACA,OAAAhC,EAAA2d,IAAA,CAAAkmF,EAAAP,EAAA9iG,EAAA,CAGA,IAAA8X,EAAAwrF,EAAA9hG,GAAA,GAAAsW,EAAA,OAAAA,CAAA,CAGA,uBAAA1V,QAAAA,IAAA,EAAAA,OAAA29F,WAAA,EACA,mBAAAv+F,CAAA,CAAAY,OAAA29F,WAAA,EACA,OAAAvgG,EAAA2d,IAAA,CAAA3b,CAAA,CAAAY,OAAA29F,WAAA,YAAA+C,EAAA9iG,EAAA,OAGA,UACA,kHACA,OAAAwB,EACA,CAoBA,SAAA+hG,EAAA5jG,CAAA,EACA,oBAAAA,EACI,0DACJ,GAAAA,EAAA,EACA,+BAAAA,EAAA,kCAIA,SAAA+mB,EAAA/mB,CAAA,CAAAs0F,CAAA,CAAAhsF,CAAA,QAEA,CADAs7F,EAAA5jG,GACAA,GAAA,GACAkjG,EAAAljG,GAEAs0F,KAAApxF,IAAAoxF,EAIA,iBAAAhsF,EACA46F,EAAAljG,GAAAs0F,IAAA,CAAAA,EAAAhsF,GACA46F,EAAAljG,GAAAs0F,IAAA,CAAAA,EAAA,CAEA4O,EAAAljG,EATA,CAoBA,SAAAojG,EAAApjG,CAAA,EAEA,OADA4jG,EAAA5jG,GACAkjG,EAAAljG,EAAA,IAAA6jG,EAAAA,EAAA7jG,EAAA,EAgBA,SAAAqjG,EAAAn9F,CAAA,CAAAoC,CAAA,EAKA,GAJA,kBAAAA,GAAAA,KAAAA,CAAA,GACAA,CAAAA,EAAA,QAGA,CAAAzI,EAAAikG,UAAA,CAAAx7F,GACA,qCAAAA,EAAA,CAGA,IAAAjI,EAAAkhB,EAAAA,EAAArb,EAAAoC,GAAA6Y,EAAA+hF,EAAA7iG,GAEA0jG,EAAA5iF,EAAAnE,KAAA,CAAA9W,EAAAoC,GAUA,OAPAy7F,IAAA1jG,GAIA8gB,CAAAA,EAAAA,EAAA1gB,KAAA,GAAAsjG,EAAA,EAGA5iF,CAAA,CAGA,SAAA6iF,EAAAjkG,CAAA,EACA,IAAAM,EAAAN,EAAAM,MAAA,KAAAwjG,EAAAA,EAAA9jG,EAAAM,MAAA,EACA8gB,EAAA+hF,EAAkB7iG,GAClB,QAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,GAAA,EACA0b,CAAA,CAAA1b,EAAA,CAAA1F,IAAAA,CAAA,CAAA0F,EAAA,CAEA,OAAA0b,CAAA,CAGA,SAAAmiF,EAAAW,CAAA,EACA,GAAAV,GAAAU,EAAAt4F,YAAA,CACA,IAAAqb,EAAA,IAAArb,WAAAs4F,GACA,OAAAR,EAAAz8E,EAAAxF,MAAA,CAAAwF,EAAAg2C,UAAA,CAAAh2C,EAAAzF,UAAA,CACA,QACAyiF,EAAAC,EAAA,CAGA,SAAAR,EAAA1jG,CAAA,CAAAi9D,CAAA,CAAA38D,CAAA,MASA8gB,EARA,GAAA67C,EAAA,GAAAj9D,EAAAwhB,UAAA,CAAAy7C,EACA,yDAGA,GAAAj9D,EAAAwhB,UAAA,CAAAy7C,EAAA38D,CAAAA,GAAA,GACA,yDAeA,OAHA6B,OAAA+gG,cAAA,CAPI9hF,EADJ67C,KAAA95D,IAAA85D,GAAA38D,KAAA6C,IAAA7C,EACI,IAAAsL,WAAA5L,GACJM,KAAA6C,IAAA7C,EACI,IAAAsL,WAAA5L,EAAAi9D,GAEJ,IAAArxD,WAAA5L,EAAAi9D,EAAA38D,GAGAR,EAAA+N,SAAA,EAGAuT,CAAA,CAGA,SAAAwiF,EAAA7kF,CAAA,EACA,GAAAjf,EAAAgd,QAAA,CAAAiC,GAAA,CACA,IAAA+Z,EAAAgrE,EAAAA,EAAA/kF,EAAAze,MAAA,EAAA8gB,EAAA+hF,EAAArqE,UAGA,IAAA1X,EAAA9gB,MAAA,EAIAye,EAAAkI,IAAA,CAAA7F,EAAA,IAAA0X,GAHA1X,CAIA,QAGA,KAAAje,IAAA4b,EAAAze,MAAA,CACA,iBAAAye,EAAAze,MAAA,EAAA6jG,GAAAplF,EAAAze,MAAA,EACA6iG,EAAA,GAEAc,EAAAllF,EADA,CAIAA,WAAAA,EAAA/c,IAAA,EAAA9B,MAAA6D,OAAA,CAAAgb,EAAAje,IAAA,EACAmjG,EAAAllF,EAAAje,IAAA,QAJA,CAQA,SAAAgjG,EAAAxjG,CAAA,EAGA,GAAAA,GAAAwiG,EACA,2EACAA,EAAAz6F,QAAA,eAEA,OAAA/H,EAAAA,CAAA,CAGA,SAAAsiG,EAAAtiG,CAA2B,EAI3B,MAHA,CAAAA,GAAAA,GACAA,CAAAA,EAAA,GAEAR,EAAAknB,KAAA,EAAA1mB,EAAA,CAgGA,SAAAkhB,EAAArb,CAAA,CAAAoC,CAAA,EACA,GAAAzI,EAAAgd,QAAA,CAAA3W,GACA,OAAAA,EAAA7F,MAAA,CAEA,GAAA8e,YAAAC,MAAA,CAAAlZ,IAAAq9F,GAAAr9F,EAAAiZ,aACA,OAAAjZ,EAAAqb,UAAA,CAEA,oBAAArb,EACA,gBACA,2FACA,OAAAA,EACA,CAGA,IAAA2yB,EAAA3yB,EAAA7F,MAAA,CACA8jG,EAAA5rE,UAAAl4B,MAAA,IAAAk4B,CAAA,IAAAA,SAAA,QAAA4rE,GAAAtrE,IAAAA,EAAA,SAIA,IAAAurE,EAAS,GACT,OACA,OAAA97F,GACA,YACA,aACA,aACA,OAAAuwB,CACA,YACA,YACA,OAAAwrE,GAAAn+F,GAAA7F,MAAA,KACA,OACA,YACA,cACA,eACA,OAAAw4B,EAAAA,CACA,WACA,OAAAA,IAAA,CACA,cACA,OAAAyrE,GAAAp+F,GAAA7F,MAAA,SAEA,GAAA+jG,EACA,OAAAD,EAAA,GAAAE,GAAAn+F,GAAA7F,MAAA,CAEAiI,EAAA,IAAAA,CAAA,EAAAmX,WAAA,GACA2kF,EAAA,EACA,CAEA,CAGA,SAAAG,EAAAj8F,CAAA,CAAAqoC,CAAA,CAAA1gB,CAAA,MAAAm0E,EAAA,GAeA,GALAzzD,CAAAA,KAAAztC,IAAAytC,GAAAA,EAAA,IACAA,CAAAA,EAAA,GAIAA,EAAA,KAAAtwC,MAAA,GAIA4vB,CAAAA,KAAA/sB,IAAA+sB,GAAAA,EAAA,KAAA5vB,MAAA,GACA4vB,CAAAA,EAAA,KAAA5vB,MAAA,EAGA4vB,GAAA,GAQAA,CAHAA,KAAA,IAAA0gB,CAAAA,KAAA,IAZA,SAqBA,IAHAroC,GAAAA,CAAAA,EAAA,UAIA,OAAAA,GACA,iBAAAk8F,EAAA,KAAA7zD,EAAA1gB,EAGA,YACA,mBAAAw0E,EAAA,KAAA9zD,EAAA1gB,EAGA,oBAAAy0E,EAAA,KAAA/zD,EAAA1gB,EAGA,cACA,oBAAA00E,EAAA,KAAAh0D,EAAA1gB,EAGA,qBAAA20E,EAAA,KAAAj0D,EAAA1gB,EAGA,YACA,YACA,cACA,sBAAA40E,EAAA,KAAAl0D,EAAA1gB,EAGA,SACA,GAAAm0E,EAAA,qCAAA97F,EAAA,CACAA,EAAA,CAAAA,EAAA,IAAAmX,WAAA,GACA2kF,EAAA,EACA,CACA,CAWA,SAAAU,EAAA3sF,CAAA,CAAA1Y,CAAA,CAAA6pB,CAAA,EACA,IAAA7jB,EAAA0S,CAAA,CAAA1Y,EAAA,CACA0Y,CAAA,CAAA1Y,EAAA,CAAA0Y,CAAA,CAAAmR,EAAA,CACAnR,CAAA,CAAAmR,EAAA,CAAA7jB,CAAA,CA4IA,SAAAs/F,EAAAvjF,CAAA,CAAAgrB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,CAAAsqC,CAAA,EACA,GAAApxB,IAAAA,EAAAnhB,MAAA,WAoBA,GAhBA,iBAAA28D,GACA10D,EAAA00D,EACIA,EAAA,GACJA,EAAA,WACIA,EAAA,WACJA,EAAA,aACAA,CAAAA,EAAA,aAGAknC,GADAlnC,EAAA,CAAAA,IAGAA,CAAAA,EAAApqB,EAAA,EAAApxB,EAAAnhB,MAAA,IAIA28D,EAAA,GAAAA,CAAAA,EAAAx7C,EAAAnhB,MAAA,CAAA28D,CAAA,EACAA,GAAAx7C,EAAAnhB,MAAA,EACA,GAAAuyC,EAAA,SACI,CAAAoqB,EAAAx7C,EAAAnhB,MAAA,EACJ,SAAA28D,EAAA,GACA,IAAApqB,EACA,UADAoqB,EAAA,CACA,IAIA,iBAAAxwB,GACAA,CAAAA,EAAA3sC,EAAA2d,IAAA,CAAAgvB,EAAAlkC,EAAA,EAIAzI,EAAAgd,QAAA,CAAA2vB,UAEA,IAAAA,EAAAnsC,MAAA,CACA,GAEI2kG,EAAAxjF,EAAAgrB,EAAAwwB,EAAA10D,EAAAsqC,EADJ,CAEA,oBAAApG,QAEA,CADAA,GAAA,IACA,mBAAA7gC,WAAAiC,SAAA,CAAAyR,OAAA,EACA,EACQ1T,WAAAiC,SAAA,CAAAyR,OAAA,CAAAvR,IAAA,CAAA0T,EAAAgrB,EAAAwwB,GAERrxD,WAAAiC,SAAA,CAAAq3F,WAAA,CAAAn3F,IAAA,CAAA0T,EAAAgrB,EAAAwwB,EACA,CAEAgoC,EAAAxjF,EAAA,CAAAgrB,EAAA,CAAAwwB,EAAA10D,EAAAsqC,EADA,OAIA,kDAGA,SAAAoyD,EAAA/3B,CAAA,CAAAzgC,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,CAAAsqC,CAAA,EACA,IA0BAntC,EA1BAy/F,EAAA,EACAC,EAAAl4B,EAAA5sE,MAAA,CAAA+kG,EAAA54D,EAAAnsC,MAAA,CAGA,GAAAiI,KAAApF,IAAAoF,GAEAA,CAAAA,SADAA,CAAAA,EAAAiX,OAAAjX,GAAAmX,WAAA,KACAnX,UAAAA,GACAA,YAAAA,GAAAA,aAAAA,CAAA,GACA,GAAA2kE,EAAA5sE,MAAA,IAAAmsC,EAAAnsC,MAAA,GACA,SACA,CACA6kG,EAAA,EACAC,GAAA,EACAC,GAAA,EACApoC,GAAA,CACA,UAGA8kC,EAAA3gF,CAAA,CAAA1b,CAAA,SACA,IAAAy/F,EACM/jF,CAAA,CAAA1b,EAAA,CAEN0b,EAAAkkF,YAAA,CAAA5/F,EAAAy/F,EACA,CAIA,GAAAtyD,EAAA,CACA,IAAA0yD,EAAA,GACA,IAAA7/F,EAAAu3D,EAAAv3D,EAAA0/F,EAAA1/F,IACA,GAAAq8F,EAAA70B,EAAAxnE,KAAAq8F,EAAAt1D,EAAA84D,KAAAA,EAAA,EAAA7/F,EAAA6/F,CAAA,EAEQ,IADR,KAAAA,GAAAA,CAAAA,EAAA7/F,CAAAA,EACQA,EAAA6/F,EAAA,IAAAF,EAAA,OAAAE,EAAAJ,CAAA,MAER,KAAAI,GAAA7/F,CAAAA,GAAAA,EAAA6/F,CAAA,EACAA,EAAA,EACA,MAIA,IADAtoC,EAAAooC,EAAiCD,GAAAnoC,CAAAA,EAAAmoC,EAAAC,CAAA,EACjC3/F,EAAAu3D,EAAAv3D,GAAA,EAAAA,IAAA,CACA,IAAA23E,EAAA,GACA,QAAAzpD,EAAA,EAAAA,EAAAyxE,EAAAzxE,IACA,GAAAmuE,EAAA70B,EAAAxnE,EAAAkuB,KAAAmuE,EAAAt1D,EAAA7Y,GAAA,CACAypD,EAAA,GACA,MACA,GAEAA,EAAA,OAAA33E,CAAA,CACA,OAGA,GAeA,SAAA8/F,EAAApkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,MAiBAoF,EAhBA2S,EAAAL,OAAAK,IAAA,EACA,IAAAotF,EAAArkF,EAAA9gB,MAAA,CAAA+X,EACA/X,EAGAA,CAAAA,EAAA0X,OAAA1X,EAAA,EACAmlG,GACAnlG,CAAAA,EAAAmlG,CAAA,EAJInlG,EAAAmlG,EAOJ,IAAAC,EAAAv/F,EAAA7F,MAAA,CAOA,IAJAA,EAAAolG,EAAA,GACAplG,CAAAA,EAAAolG,EAAA,GAGAhgG,EAAA,EAAAA,EAAApF,EAAA,EAAAoF,EAAA,CACA,IAAAuuB,EAAA4X,SAAA1lC,EAAAyqD,MAAA,CAAAlrD,EAAAA,EAAA,OACA,GAAAy+F,GAAAlwE,GAAA,MACA7S,CAAA,CAAA/I,EAAA3S,EAAA,CAAAuuB,CACA,CACA,OAAAvuB,CAAA,CAGA,SAAAigG,EAAAvkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAtB,GAAAn+F,EAAAib,EAAA9gB,MAAA,CAAA+X,GAAA+I,EAAA/I,EAAA/X,EAAA,CAGA,SAAAulG,EAAAzkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAE,GAAA3/F,GAAAib,EAAA/I,EAAA/X,EAAA,CAGA,SAAAylG,EAAA3kF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAArB,GAAAp+F,GAAAib,EAAA/I,EAAA/X,EAAA,CAGA,SAAA0lG,EAAA5kF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAK,GAAA9/F,EAAAib,EAAA9gB,MAAA,CAAA+X,GAAA+I,EAAA/I,EAAA/X,EAAA,CA+EA,SAAAukG,EAAAzjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,SACA,IAAA0gB,GAAA1gB,IAAA9O,EAAA9gB,MAAA,CACIywD,EAAAC,aAAA,CAAA5vC,GAEJ2vC,EAAAC,aAAA,CAAA5vC,EAAA1gB,KAAA,CAAAkwC,EAAA1gB,GACA,CAGA,SAAAw0E,EAAAtjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACAA,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAAA,IAAAnnB,EAAA,GAGArD,EAAAkrC,EACA,KAAAlrC,EAAAwqB,GAAA,CACA,IAAAg2E,EAAA9kF,CAAA,CAAA1b,EAAA,CACAygG,EAAA,KACAC,EAAA,MACA,EACA,MACA,EACA,MACA,IAGA,GAAA1gG,EAAA0gG,GAAAl2E,EAAA,KAAAm2E,EAAAC,EAAAC,EAAAC,EAGA,OAAAJ,GACA,OACAF,EAAA,KACAC,CAAAA,EAAAD,CAAA,EAEA,WACA,EAEAG,CAAAA,IADAA,CAAAA,EAAAjlF,CAAA,CAAA1b,EAAA,GACA,QAEA8gG,CADAA,EAAA,CAAAN,GAAAA,CAAA,KAAAG,GAAAA,CAAA,EACA,KACAF,CAAAA,EAAAK,CAAA,EAGA,WACA,EACAH,EAAAjlF,CAAA,CAAA1b,EAAA,GACA4gG,EAAAllF,CAAA,CAAA1b,EAAA,GACA2gG,CAAAA,IAAAA,CAAA,SAAAC,IAAAA,CAAA,QAEAE,CADAA,EAAA,CAAAN,GAAAA,CAAA,OAAAG,GAAAA,CAAA,KAAAC,GAAAA,CAAA,EACA,MAAAE,CAAAA,EAAA,OAAAA,EAAA,QACAL,CAAAA,EAAAK,CAAA,EAGA,WACA,EACAH,EAAAjlF,CAAA,CAAA1b,EAAA,GACA4gG,EAAAllF,CAAA,CAAA1b,EAAA,GACA6gG,EAAAnlF,CAAA,CAAA1b,EAAA,GACA2gG,CAAAA,IAAAA,CAAA,SAAAC,IAAAA,CAAA,SAAAC,IAAAA,CAAA,QAEAC,CADAA,EAAA,CAAAN,GAAAA,CAAA,OAAAG,GAAAA,CAAA,OAAAC,GAAAA,CAAA,KAAAC,GAAAA,CAAA,EACA,OAAAC,EAAA,SACAL,CAAAA,EAAAK,CAAA,CAGA,MAGA,GAAAL,GAGAA,EAAA,MACMC,EAAA,GACND,EAAA,QAEAA,GAAA,MACAp9F,EAAAnK,IAAA,CAAAunG,IAAA,eACAA,EAAA,MAAAA,KAAAA,GAGAp9F,EAAAnK,IAAA,CAAAunG,GACAzgG,GAAA0gG,CAAA,CAGA,OAAAK,EAAA19F,EAAA,CA3+BA3J,EAAAsnG,UAAA,CAAA5D,EAgBAhjG,EAAA6mG,mBAAA,CAAA5D,IAGAjjG,EAAA6mG,mBAAA,sBAAAv9F,SACA,mBAAAA,QAAA9D,KAAA,EACA8D,QAAA9D,KAAA,CACA,iJAkBAnD,OAAA8L,cAAA,CAAAnO,EAAA+N,SAAA,WACAud,WAAA,GACAjJ,IAAA,WACA,GAAAriB,EAAAgd,QAAA,OACA,YAAA2E,MAAA,CACC,GAGDtf,OAAA8L,cAAA,CAAAnO,EAAA+N,SAAA,WACAud,WAAA,GACAjJ,IAAA,WACA,GAAAriB,EAAAgd,QAAA,OACA,YAAAmgD,UAAA,CACC,GAmCuBn9D,EAAA8mG,QAAA,MA+DxB9mG,EAAA2d,IAAA,UAAA3b,CAAA,CAAAshG,CAAA,CAAA9iG,CAAA,EACA,OAAAmd,EAAA3b,EAAAshG,EAAA9iG,EAAA,EAKA6B,OAAA+gG,cAAA,CAAApjG,EAAA+N,SAAA,CAAAjC,WAAAiC,SAAA,EAAA1L,OAAA+gG,cAAA,CAAApjG,EAAA8L,YA+BA9L,EAAAknB,KAAA,UAAA/mB,CAAA,CAAAs0F,CAAA,CAAAhsF,CAAA,EACA,OAAAye,EAAA/mB,EAAAs0F,EAAAhsF,EAAA,EAWAzI,EAAAujG,WAAA,UAAApjG,CAAA,EACA,OAAAojG,EAAApjG,EACA,EAIAH,EAAA+mG,eAAA,UAAA5mG,CAAA,EACA,OAAAojG,EAAApjG,EAAA,EA8GAH,EAAAgd,QAAA,UAAA1E,CAAA,EACA,OAAAA,IAAA,EAAAA,GAAAA,CAAA,IAAAA,EAAA0uF,SAAA,EACA1uF,IAAAtY,EAAA+N,SAAA,EAGA/N,EAAAs2D,OAAA,UAAAl3D,CAAA,CAAAkZ,CAAA,EAGA,GAFAorF,GAAAtkG,EAAA0M,aAAA1M,CAAAA,EAAAY,EAAA2d,IAAA,CAAAve,EAAAA,EAAAmZ,MAAA,CAAAnZ,EAAAsiB,UAAA,GACAgiF,GAAAprF,EAAAxM,aAAAwM,CAAAA,EAAAtY,EAAA2d,IAAA,CAAArF,EAAAA,EAAAC,MAAA,CAAAD,EAAAoJ,UAAA,GACA,CAAA1hB,EAAAgd,QAAA,CAAA5d,IAAA,CAAAY,EAAAgd,QAAA,CAAA1E,GACA,gBACA,wEACA,CAEA,GAAAlZ,IAAAkZ,EAAA,SAGA,IAAA5V,EAAAtD,EAAAoB,MAAA,CAAAuzB,EAAAzb,EAAA9X,MAAA,CAGA,QAAAoF,EAAA,EAAAozB,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAAAnuB,EAAAozB,EAAA,EAAApzB,EACA,GAAAxG,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,CAAA1S,EAAA,EACAlD,EAAAtD,CAAA,CAAAwG,EAAA,CACAmuB,EAAAzb,CAAA,CAAA1S,EAAA,CACA,MACA,OAGA,EAAAmuB,EAAA,GACAA,EAAArxB,EAAA,EACA,CAFA,EAKA1C,EAAAikG,UAAA,UAAAx7F,CAAA,EACA,OAAAiX,OAAAjX,GAAAmX,WAAA,IACA,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,eACA,QACA,SACA,QACA,GAGA5f,EAAA01B,MAAA,UAAAs0C,CAAA,CAAAxpE,CAAA,MASAoF,EARA,IAAAxF,MAAA6D,OAAA,CAAA+lE,GACA,+DAGA,GAAAA,IAAAA,EAAAxpE,MAAA,CACA,OAAAR,EAAAknB,KAAA,IAIA,GAAA1mB,KAAA6C,IAAA7C,EAEA,IAAAoF,EAAA,EADApF,EAAA,EACAoF,EAAAokE,EAAAxpE,MAAA,GAAAoF,EACApF,GAAAwpE,CAAA,CAAApkE,EAAA,CAAApF,MAAA,CAIA,IAAAmhB,EAAA3hB,EAAAujG,WAAA,CAAA/iG,GACAymG,EAAA,EACA,IAAArhG,EAAA,EAAAA,EAAAokE,EAAAxpE,MAAA,GAAAoF,EAAA,CACA,IAAA0b,EAAA0oD,CAAA,CAAApkE,EAAA,CACA,GAAA89F,GAAApiF,EAAAxV,YACAm7F,EAAA3lF,EAAA9gB,MAAA,CAAAmhB,EAAAnhB,MAAA,EACAR,EAAAgd,QAAA,CAAAsE,IAAAA,CAAAA,EAAAthB,EAAA2d,IAAA,CAAA2D,EAAA,EACQA,EAAA6F,IAAA,CAAAxF,EAAAslF,IAERn7F,WAAAiC,SAAA,CAAApJ,GAAA,CAAAsJ,IAAA,CACA0T,EACAL,EACA2lF,QAGA,GAAAjnG,EAAAgd,QAAA,CAAAsE,GAGAA,EAAA6F,IAAA,CAAAxF,EAAAslF,QAFM,+DAINA,GAAA3lF,EAAA9gB,MAAA,CAEA,OAAAmhB,CAAA,EAiDA3hB,EAAA0hB,UAAA,CAAAA,EA8EA1hB,EAAA+N,SAAA,CAAAi5F,SAAA,IASAhnG,EAAA+N,SAAA,CAAAm5F,MAAA,YACA,IAAAluE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAo5F,MAAA,YACA,IAAAnuE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAq5F,MAAA,YACA,IAAApuE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAxF,QAAA,YACA,IAAA/H,EAAA,KAAAA,MAAA,QACA,IAAAA,EAAA,GACAk4B,GAAAA,UAAAl4B,MAAA,CAAAokG,EAAA,OAAApkG,GACAkkG,EAAArkG,KAAA,MAAAq4B,UAFA,EAIA14B,EAAA+N,SAAA,CAAAs5F,cAAA,CAAArnG,EAAA+N,SAAA,CAAAxF,QAAA,CAGAvI,EAAA+N,SAAA,CAAA02C,MAAA,UAAAnsC,CAAA,EACA,IAAAtY,EAAAgd,QAAA,CAAA1E,GAAA,oDACA,OAAAA,GACAtY,IAAAA,EAAAs2D,OAAA,MAAAh+C,EAAA,EAGAtY,EAAA+N,SAAA,CAAAu5F,OAAA,YACA,IAAAl9E,EAAA,GACAuhB,EAAArsC,EAAAyjG,iBAAA,CAGA,OAFA34E,EAAA,KAAA7hB,QAAA,SAAAojC,GAAA/nB,OAAA,kBAAAF,IAAA,GACA,KAAAljB,MAAA,CAAAmrC,GAAAvhB,CAAAA,GAAA,SACA,WAAAA,EAAA,GACA,EACAy4E,GACA7iG,CAAAA,EAAA+N,SAAA,CAAA80F,EAAA,CAAA7iG,EAAA+N,SAAA,CAAAu5F,OAAA,EAGAtnG,EAAA+N,SAAA,CAAAuoD,OAAA,UAAArZ,CAAA,CAAAnM,CAAA,CAAA1gB,CAAA,CAAAm3E,CAAA,CAAAC,CAAA,EAIA,GAHA9D,GAAAzmD,EAAAnxC,aACAmxC,CAAAA,EAAAj9C,EAAA2d,IAAA,CAAAs/B,EAAAA,EAAA1kC,MAAA,CAAA0kC,EAAAv7B,UAAA,GAEA,CAAA1hB,EAAAgd,QAAA,CAAAigC,GACA,gBACA,iFACA,OAAAA,EACA,CAgBA,GAbA55C,KAAAA,IAAAytC,GACAA,CAAAA,EAAA,GAEAztC,KAAAA,IAAA+sB,GACAA,CAAAA,EAAA6sB,EAAAA,EAAAz8C,MAAA,IAEA6C,KAAAA,IAAAkkG,GACAA,CAAAA,EAAA,GAEAlkG,KAAAA,IAAAmkG,GACAA,CAAAA,EAAA,KAAAhnG,MAAA,EAGAswC,EAAA,GAAA1gB,EAAA6sB,EAAAz8C,MAAA,EAAA+mG,EAAA,GAAAC,EAAA,KAAAhnG,MAAA,CACA,uCAGA,GAAA+mG,GAAAC,GAAA12D,GAAA1gB,EACA,QACA,CACA,GAAAm3E,GAAAC,EACA,SACA,CACA,GAAA12D,GAAA1gB,EACA,SAOA,GAJA0gB,KAAA,EACA1gB,KAAA,EACAm3E,KAAA,EAAAC,KAAA,EAEA,OAAAvqD,EAAA,SAGA,IAAAv6C,EAAA8kG,EAAAD,EACAxzE,EAAA3D,EAAA0gB,EAAA9X,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAGA0zE,EAAA,KAAA7mG,KAAA,CAAA2mG,EAAAC,GAAAE,EAAAzqD,EAAAr8C,KAAA,CAAAkwC,EAAA1gB,GAGA,QAAAxqB,EAAA,EAAAA,EAAAozB,EAAA,EAAApzB,EACA,GAAA6hG,CAAA,CAAA7hG,EAAA,GAAA8hG,CAAA,CAAA9hG,EAAA,EACAlD,EAAA+kG,CAAA,CAAA7hG,EAAA,CACAmuB,EAAA2zE,CAAA,CAAA9hG,EAAA,CACA,MACA,OAGA,EAAAmuB,EAAA,GACAA,EAAArxB,EAAA,EACA,CAFA,EA8HA1C,EAAA+N,SAAA,CAAAimD,QAAA,UAAArnB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,iBAAA+W,OAAA,CAAAmtB,EAAAwwB,EAAA10D,EAAA,EAGAzI,EAAA+N,SAAA,CAAAyR,OAAA,UAAAmtB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,OAAAy8F,EAAA,KAAAv4D,EAAAwwB,EAAA10D,EAAA,KAGAzI,EAAA+N,SAAA,CAAAq3F,WAAA,UAAAz4D,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,OAAAy8F,EAAA,KAAAv4D,EAAAwwB,EAAA10D,EAAA,KA6CAzI,EAAA+N,SAAA,CAAAoP,KAAA,UAAA9W,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,CAAAiI,CAAA,EAEA,GAAA8P,KAAAlV,IAAAkV,EACA9P,EAAA,OACAjI,EAAA,KAAAA,MAAA,CACA+X,EAAA,OAEA,GAAA/X,KAAA6C,IAAA7C,GAAA,iBAAA+X,EACA9P,EAAA8P,EACA/X,EAAA,KAAAA,MAAA,CACA+X,EAAA,OAEA,GAAAovF,SAAApvF,GACAA,KAAA,EACAovF,SAAAnnG,IACAA,KAAA,EACM6C,KAAAA,IAAAoF,GAAAA,CAAAA,EAAA,UAENA,EAAAjI,EACAA,EAAA6C,KAAAA,QAGA,YACA,0EACA,CAGA,IAAAsiG,EAAA,KAAAnlG,MAAA,CAAA+X,EAGA,GAHA/X,CAAAA,KAAA6C,IAAA7C,GAAAA,EAAAmlG,CAAA,GAAAnlG,CAAAA,EAAAmlG,CAAA,EAGA,EAAAnlG,MAAA,IAAAA,CAAAA,EAAA,GAAA+X,EAAA,IAAAA,EAAA,KAAA/X,MAAA,CACA,2DAEAiI,GAAAA,CAAAA,EAAA,QAGA,IAAA87F,EAAS,GACT,OACA,OAAA97F,GACA,iBAAAi9F,EAAA,KAAAr/F,EAAAkS,EAAA/X,EAGA,YACA,mBAAAqlG,EAAA,KAAAx/F,EAAAkS,EAAA/X,EAGA,aACA,aACA,oBAAAulG,EAAA,KAAA1/F,EAAAkS,EAAA/X,EAGA,cACA,OAAAylG,EAAA,KAAA5/F,EAAAkS,EAAA/X,EAGA,YACA,YACA,cACA,sBAAA0lG,EAAA,KAAA7/F,EAAAkS,EAAA/X,EAGA,SACA,GAAA+jG,EAAA,qCAAA97F,EAAA,CACAA,EAAA,IAAAA,CAAA,EAAAmX,WAAA,GACA2kF,EAAA,EACA,CACA,EAGAvkG,EAAA+N,SAAA,CAAA+4E,MAAA,YACA,OACA5kF,KAAA,SACAlB,KAAAZ,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,MAAA25F,IAAA,SACA,GAyFA,IAAAC,EAAA,KAGA,SAAAlB,EAAAmB,CAAA,EACA,IAAA9uE,EAAA8uE,EAAAtnG,MAAA,CACA,GAAAw4B,GAAA6uE,EACA,OAAAnoF,OAAA8B,YAAA,CAAAnhB,KAAA,CAAAqf,OAAAooF,EAAA,CAIA,IAAA7+F,EAAA,GACArD,EAAA,EACA,KAAAA,EAAAozB,GACA/vB,GAAAyW,OAAA8B,YAAA,CAAAnhB,KAAA,CACAqf,OACAooF,EAAAlnG,KAAA,CAAAgF,EAAAA,GAAAiiG,IAGA,OAAA5+F,CAAA,CAGA,SAAA47F,EAAAvjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAusD,EAAA,GAAAvsD,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAGA,QAAAxqB,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA+2E,GAAAj9D,OAAA8B,YAAA,CAAAF,IAAAA,CAAA,CAAA1b,EAAA,EAEA,OAAA+2E,CAAA,CAGA,SAAAmoB,EAAAxjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAusD,EAAA,GAAAvsD,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAGA,QAAAxqB,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA+2E,GAAAj9D,OAAA8B,YAAA,CAAAF,CAAA,CAAA1b,EAAA,EAEA,OAAA+2E,CAAA,CAGA,SAAAgoB,EAAArjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,MAAA4I,EAAA1X,EAAA9gB,MAAA,CAGA,EAAAswC,GAAAA,EAAA,IAAAA,CAAAA,EAAA,KAAA1gB,GAAAA,EAAA,GAAAA,EAAA4I,CAAA,GAAA5I,CAAAA,EAAA4I,CAAA,EAGA,IAAAg8D,EAAA,GACA,QAAApvF,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACAovF,GAAA+S,EAAA,CAAAzmF,CAAA,CAAA1b,EAAA,EAEA,OAAAovF,CAAA,CAGA,SAAAgQ,EAAA1jF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAzM,EAAArC,EAAA1gB,KAAA,CAAAkwC,EAAA1gB,GACAnnB,EAAA,GAEA,QAAArD,EAAA,EAAAA,EAAA+d,EAAAnjB,MAAA,GAAAoF,GAAA,EACAqD,GAAAyW,OAAA8B,YAAA,CAAAmC,CAAA,CAAA/d,EAAA,CAAA+d,IAAAA,CAAA,CAAA/d,EAAA,IAEA,OAAAqD,CAAA,CAkCA,SAAA++F,EAAAzvF,CAAA,CAAA0vF,CAAA,CAAAznG,CAAA,EACA,WAAA+X,EAAA,yCACA,GAAAA,EAAA0vF,EAAAznG,EAAA,0DA0QA,SAAA0nG,EAAA5mF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAA0vF,CAAA,CAAAt8D,CAAA,CAAAD,CAAA,EACA,IAAA1rC,EAAAgd,QAAA,CAAAsE,GAAA,+DACA,GAAAtf,EAAA2pC,GAAA3pC,EAAA0pC,EAAA,sDACA,GAAAnzB,EAAA0vF,EAAA3mF,EAAA9gB,MAAA,wCAgGA,SAAA2nG,EAAA7mF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAmzB,CAAA,CAAAC,CAAA,EAAAy8D,EAAApmG,EAAA0pC,EAAAC,EAAArqB,EAAA/I,EAAA,GAGA,IAAAS,EAAAd,OAAAlW,EAAA6nD,OAAA,YACAvoC,CAAAA,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACA,IAAAqvF,EAAAnwF,OAAAlW,GAAA6nD,OAAA,IAAAA,OAAA,aAQA,OAPAvoC,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACA9vF,CAAA,CAGA,SAAA+vF,EAAAhnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAmzB,CAAA,CAAAC,CAAA,EAAAy8D,EAAApmG,EAAA0pC,EAAAC,EAAArqB,EAAA/I,EAAA,GAGA,IAAAS,EAAAd,OAAAlW,EAAA6nD,OAAA,YACAvoC,CAAAA,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACA,IAAAqvF,EAAAnwF,OAAAlW,GAAA6nD,OAAA,IAAAA,OAAA,aAQA,OAPAvoC,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,CAAA8vF,EACA9vF,EAAA,EAmHA,SAAAgwF,EAAAjnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAA0vF,CAAA,CAAAt8D,CAAA,CAAAD,CAAA,EACA,GAAAnzB,EAAA0vF,EAAA3mF,EAAA9gB,MAAA,EACA+X,EAAA,EADA,uCAIA,SAAAiwF,EAAAlnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAkwF,CAAA,CAAAC,CAAA,EAOA,OANA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GACAH,EAAAjnF,EAAAtf,EAAAuW,EAAA,GAEAqqF,EAAAzlF,KAAA,CAAAmE,EAAAtf,EAAAuW,EAAAkwF,EAAA,MACAlwF,EAAA,EAWA,SAAAowF,EAAArnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAkwF,CAAA,CAAAC,CAAA,EAOA,OANA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GACAH,EAAAjnF,EAAAtf,EAAAuW,EAAA,GAEAqqF,EAAAzlF,KAAA,CAAAmE,EAAAtf,EAAAuW,EAAAkwF,EAAA,MACAlwF,EAAA,EAxkBAvY,EAAA+N,SAAA,CAAAnN,KAAA,UAAAkwC,CAAA,CAAA1gB,CAAA,EACA,IAAA4I,EAAA,KAAAx4B,MAAA,CACAswC,EAAA,EAAAA,EAAA1gB,EAAAA,KAAA/sB,IAAA+sB,EAAA4I,EAAA,EAAA5I,CAAA,CAGA0gB,EAAA,EACAA,CAAAA,GAAA9X,CAAA,EACI,GAAA8X,CAAAA,EAAA,GACJA,EAAA9X,GACA8X,CAAAA,EAAA9X,CAAA,EAGA5I,EAAA,EACAA,CAAAA,GAAA4I,CAAA,EACI,GAAA5I,CAAAA,EAAA,GACJA,EAAA4I,GACA5I,CAAAA,EAAA4I,CAAA,EAEA5I,EAAA0gB,GAAA1gB,CAAAA,EAAA0gB,CAAA,EAGA,IAAA83D,EAAA,KAAAh+B,QAAA,CAAA95B,EAAA1gB,GAIA,OAHA/tB,OAAA+gG,cAAA,CAAAwF,EAAA5oG,EAAA+N,SAAA,EAGA66F,CAAA,EAWA5oG,EAAA+N,SAAA,CAAA86F,UAAA,CACA7oG,EAAA+N,SAAA,CAAAwL,UAAA,UAAAhB,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,CACA2nC,EAAA,EACAt6C,EAAA,EACA,OAAAA,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA3S,EAAA,CAAAs6C,EAGA,OAAAvT,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA+6F,UAAA,CACA9oG,EAAA+N,SAAA,CAAA0L,UAAA,UAAAlB,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EACAgnF,GACAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,EAAAmJ,EAAA,CACAw+B,EAAA,EACA,KAAAx+B,EAAA,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA,EAAAmJ,EAAA,CAAAw+B,EAGA,OAAAvT,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAg7F,SAAA,CACA/oG,EAAA+N,SAAA,CAAAi7F,SAAA,UAAAzwF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,EAGAvY,EAAA+N,SAAA,CAAAk7F,YAAA,CACAjpG,EAAA+N,SAAA,CAAAm7F,YAAA,UAAA3wF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,MAAAA,EAAA,OAGAvY,EAAA+N,SAAA,CAAAo7F,YAAA,CACAnpG,EAAA+N,SAAA,CAAAy3F,YAAA,UAAAjtF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,SAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAq7F,YAAA,CACAppG,EAAA+N,SAAA,CAAAmM,YAAA,UAAA3B,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,MAAA+X,EAAA,CACA,KAAAA,EAAA,MACA,KAAAA,EAAA,QACA,cAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAs7F,YAAA,CACArpG,EAAA+N,SAAA,CAAAywF,YAAA,UAAAjmF,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,cAAA+X,EAAA,CACA,MAAAA,EAAA,OACA,KAAAA,EAAA,MACA,KAAAA,EAAA,KAGAvY,EAAA+N,SAAA,CAAAu7F,eAAA,CAAAC,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAwY,EAAAlS,EACA,WAAAyR,EAAA,CACA,aAAAA,EAAA,iBAAAA,EAAA,CAGA8vF,EAAA,OAAA9vF,EAAA,CACA,WAAAA,EAAA,CACA,aAAAA,EAAA,CAAAkxF,SAAAA,EAGC,OAAA5/C,OAAA7wC,GAAA6wC,CAAAA,OAAAw+C,IAAAx+C,OAAA,OAGD7pD,EAAA+N,SAAA,CAAA47F,eAAA,CAAAJ,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAA6nG,EAAAvhG,SAAAA,EACA,aAAAyR,EAAA,CACA,WAAAA,EAAA,QAAAA,EAAA,CAGAS,EAAA,gBAAAT,EAAA,CACA,aAAAA,EAAA,CACA,WAAAA,EAAA,CAAAkxF,EAGC,OAAA5/C,OAAAw+C,IAAAx+C,OAAA,KAAAA,OAAA7wC,EAAA,GAGDhZ,EAAA+N,SAAA,CAAAqwF,SAAA,UAAA7lF,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,CACA2nC,EAAA,EACAt6C,EAAA,EACA,OAAAA,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA3S,EAAA,CAAAs6C,EAMA,OAHAvT,GAFAuT,CAAAA,GAAA,MAEAvT,CAAAA,GAAArsC,KAAAs/C,GAAA,KAAAl+B,EAAA,EAGAirB,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAuwF,SAAA,UAAA/lF,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAoF,EAAA8b,EACAw+B,EAAA,EACAvT,EAAA,KAAAp0B,EAAA,EAAA3S,EAAA,CACA,KAAAA,EAAA,GAAAs6C,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA,EAAA3S,EAAA,CAAAs6C,EAMA,OAHAvT,GAFAuT,CAAAA,GAAA,MAEAvT,CAAAA,GAAArsC,KAAAs/C,GAAA,KAAAl+B,EAAA,EAGAirB,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA67F,QAAA,UAAArxF,CAAA,CAAAmwF,CAAA,QAGA,CAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,SAAA+X,EAAA,EACA,YAAAA,EAAA,OADA,KAAAA,EAAA,EAIAvY,EAAA+N,SAAA,CAAA87F,WAAA,UAAAtxF,CAAA,CAAAmwF,CAAA,EACAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,IAAAmsC,EAAA,KAAAp0B,EAAA,MAAAA,EAAA,MACA,aAAAo0B,EAAAA,WAAAA,EAAAA,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA+7F,WAAA,UAAAvxF,CAAA,CAAAmwF,CAAA,EACAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,IAAAmsC,EAAA,KAAAp0B,EAAA,QAAAA,EAAA,IACA,aAAAo0B,EAAAA,WAAAA,EAAAA,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAuM,WAAA,UAAA/B,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,KAAA+X,EAAA,CACA,KAAAA,EAAA,MACA,KAAAA,EAAA,OACA,KAAAA,EAAA,QAGAvY,EAAA+N,SAAA,CAAA2wF,WAAA,UAAAnmF,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,KAAA+X,EAAA,KACA,KAAAA,EAAA,OACA,KAAAA,EAAA,MACA,KAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAg8F,cAAA,CAAAR,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,GACA,SAAAA,EAAA,GACA,WAAAA,EAAkB,GAAAkxF,CAAAA,GAAA,IAGlB,OAAA5/C,OAAAld,IAAAkd,OAAA,KACAA,OAAA/iD,EACA,WAAAyR,EAAA,CACA,aAAAA,EAAA,CACC,gBAAAA,EAAA,IAGDvY,EAAA+N,SAAA,CAAAi8F,cAAA,CAAAT,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAmsC,EAAA,CAAA7lC,GAAA,IACA,aAAAyR,EAAA,CACA,WAAAA,EAAA,QAAAA,EAAA,CAGA,OAAAsxC,OAAAld,IAAAkd,OAAA,KACAA,OAAA,gBAAAtxC,EAAA,CACA,aAAAA,EAAA,CACA,WAAAA,EAAA,CACCkxF,EAAA,GAGDzpG,EAAA+N,SAAA,CAAA6wF,WAAA,UAAArmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAoiG,EAAAX,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAA+wF,WAAA,UAAAvmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAoiG,EAAAX,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAAixF,YAAA,UAAAzmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAoiG,EAAAX,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAAmxF,YAAA,UAAA3mF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAoiG,EAAAX,IAAA,MAAA1pF,EAAA,UASAvY,EAAA+N,SAAA,CAAAk8F,WAAA,CACAjqG,EAAA+N,SAAA,CAAAyL,WAAA,UAAAxX,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAIA,GAHA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmJ,KAAA,EACA,CAAAgnF,EAAA,CACA,IAAAwB,EAAA5pG,KAAAs/C,GAAA,KAAAl+B,GAAA,EACAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAAwoF,EAAA,OAGAhqD,EAAA,EACAt6C,EAAA,EAEA,IADA,KAAA2S,EAAA,CAAAvW,IAAAA,EACA,EAAA4D,EAAA8b,GAAAw+B,CAAAA,GAAA,MACA,KAAA3nC,EAAA3S,EAAA,GAAAs6C,EAAA,IAGA,OAAA3nC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAo8F,WAAA,CACAnqG,EAAA+N,SAAA,CAAA2L,WAAA,UAAA1X,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAIA,GAHA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmJ,KAAA,EACA,CAAAgnF,EAAA,CACA,IAAAwB,EAAA5pG,KAAAs/C,GAAA,KAAAl+B,GAAA,EACAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAAwoF,EAAA,OAGAtkG,EAAA8b,EAAA,EACAw+B,EAAA,EAEA,IADA,KAAA3nC,EAAA3S,EAAA,CAAA5D,IAAAA,EACA,EAAA4D,GAAA,GAAAs6C,CAAAA,GAAA,MACA,KAAA3nC,EAAA3S,EAAA,GAAAs6C,EAAA,IAGA,OAAA3nC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAq8F,UAAA,CACApqG,EAAA+N,SAAA,CAAAs8F,UAAA,UAAAroG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAKA,OAJA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,SACA,KAAAA,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAu8F,aAAA,CACAtqG,EAAA+N,SAAA,CAAAm1D,aAAA,UAAAlhE,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,WACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAw8F,aAAA,CACAvqG,EAAA+N,SAAA,CAAAy8F,aAAA,UAAAxoG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,WACA,KAAAA,EAAA,CAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA08F,aAAA,CACAzqG,EAAA+N,SAAA,CAAAqM,aAAA,UAAApY,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA28F,aAAA,CACA1qG,EAAA+N,SAAA,CAAA0wF,aAAA,UAAAz8F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GA+CAvY,EAAA+N,SAAA,CAAAo1D,gBAAA,CAAAomC,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA4vF,EAAA,KAAAnmG,EAAAuW,EAAAsxC,OAAA,GAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAA48F,gBAAA,CAAApB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA+vF,EAAA,KAAAtmG,EAAAuW,EAAAsxC,OAAA,GAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAAswF,UAAA,UAAAr8F,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAGA,GAFA1mG,EAAA,CAAAA,EACAuW,KAAA,EACA,CAAAmwF,EAAA,KAAAtwB,EAAA93E,KAAAs/C,GAAA,KAAAl+B,EAAA,GAGAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAA02D,EAAA,GAAAA,EAAA,KAGAxyE,EAAA,EACAs6C,EAAA,EACAW,EAAA,EAEA,IADA,KAAAtoC,EAAA,CAAAvW,IAAAA,EACA,EAAA4D,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAl+C,EAAA,GAAA6+C,IAAAA,GAAA,SAAAtoC,EAAA3S,EAAA,IACAi7C,CAAAA,EAAA,GAEA,KAAAtoC,EAAA3S,EAAA,IAAAs6C,GAAA,GAAAW,EAAA,IAGA,OAAAtoC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAwwF,UAAA,UAAAv8F,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAGA,GAFA1mG,EAAA,CAAAA,EACAuW,KAAA,EACA,CAAAmwF,EAAA,KAAAtwB,EAAA93E,KAAAs/C,GAAA,KAAAl+B,EAAA,GAGAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAA02D,EAAA,GAAAA,EAAA,KAGAxyE,EAAA8b,EAAA,EACAw+B,EAAA,EACAW,EAAA,EAEA,IADA,KAAAtoC,EAAA3S,EAAA,CAAA5D,IAAAA,EACA,EAAA4D,GAAA,GAAAs6C,CAAAA,GAAA,MACAl+C,EAAA,GAAA6+C,IAAAA,GAAA,SAAAtoC,EAAA3S,EAAA,IACAi7C,CAAAA,EAAA,GAEA,KAAAtoC,EAAA3S,EAAA,IAAAs6C,GAAA,GAAAW,EAAA,IAGA,OAAAtoC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAA68F,SAAA,UAAA5oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,YACAvW,EAAA,GAAAA,CAAAA,EAAA,IAAAA,EAAA,GACA,KAAAuW,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA88F,YAAA,UAAA7oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA+8F,YAAA,UAAA9oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAwM,YAAA,UAAAvY,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,0BACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA4wF,YAAA,UAAA38F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EASA,OARA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,0BACAvW,EAAA,GAAAA,CAAAA,EAAA,WAAAA,EAAA,GACA,KAAAuW,EAAA,CAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAg9F,eAAA,CAAAxB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA4vF,EAAA,KAAAnmG,EAAAuW,EAAA,CAAAsxC,OAAA,sBAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAAi9F,eAAA,CAAAzB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA+vF,EAAA,KAAAtmG,EAAAuW,EAAA,CAAAsxC,OAAA,sBAAAA,OAAA,yBAkBD7pD,EAAA+N,SAAA,CAAA8wF,YAAA,UAAA78F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAF,EAAA,KAAAxmG,EAAAuW,EAAA,GAAAmwF,EAAA,EAGA1oG,EAAA+N,SAAA,CAAAgxF,YAAA,UAAA/8F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAF,EAAA,KAAAxmG,EAAAuW,EAAA,GAAAmwF,EAAA,EAaA1oG,EAAA+N,SAAA,CAAAkxF,aAAA,UAAAj9F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAC,EAAA,KAAA3mG,EAAAuW,EAAA,GAAAmwF,EAAA,EAGA1oG,EAAA+N,SAAA,CAAAoxF,aAAA,UAAAn9F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAC,EAAA,KAAA3mG,EAAAuW,EAAA,GAAAmwF,EAAA,EAIA1oG,EAAA+N,SAAA,CAAAoZ,IAAA,UAAA81B,CAAA,CAAAguD,CAAA,CAAAn6D,CAAA,CAAA1gB,CAAA,EACA,IAAApwB,EAAAgd,QAAA,CAAAigC,GAAA,+CAQA,GAPAnM,GAAAA,CAAAA,EAAA,GACA1gB,GAAAA,IAAAA,GAAAA,CAAAA,EAAA,KAAA5vB,MAAA,EACAyqG,GAAAhuD,EAAAz8C,MAAA,EAAAyqG,CAAAA,EAAAhuD,EAAAz8C,MAAA,EACAyqG,GAAAA,CAAAA,EAAA,GAAA76E,EAAA,GAAAA,EAAA0gB,GAAA1gB,CAAAA,EAAA0gB,CAAA,EAIA1gB,IAAA0gB,GAAAmM,IAAAA,EAAAz8C,MAAA,WAAAA,MAAA,UAIA,GAAAyqG,EAAA,EACA,8CAEA,GAAAn6D,EAAA,GAAAA,GAAA,KAAAtwC,MAAA,2CAAA4vB,EAAA,8CAIAA,EAAA,KAAA5vB,MAAA,EAAA4vB,CAAAA,EAAA,KAAA5vB,MAAA,EACAy8C,EAAAz8C,MAAA,CAAAyqG,EAAA76E,EAAA0gB,GACA1gB,CAAAA,EAAA6sB,EAAAz8C,MAAA,CAAAyqG,EAAAn6D,CAAA,EAEA,IAAA9X,EAAA5I,EAAA0gB,EAcA,OAXA,OAAAmM,GAAA,mBAAAnxC,WAAAiC,SAAA,CAAAm9F,UAAA,CAEI,KAAAA,UAAA,CAAAD,EAAAn6D,EAAA1gB,GAEJtkB,WAAAiC,SAAA,CAAApJ,GAAA,CAAAsJ,IAAA,CACAgvC,EACA,KAAA2tB,QAAA,CAAA95B,EAAA1gB,GACA66E,GAIAjyE,CAAA,EAOAh5B,EAAA+N,SAAA,CAAA0mF,IAAA,UAAA9nD,CAAA,CAAAmE,CAAA,CAAA1gB,CAAA,CAAA3nB,CAAA,MA6CA7C,EA3CA,oBAAA+mC,EAAA,CASA,GARA,iBAAAmE,GACAroC,EAAAqoC,EACAA,EAAA,EACM1gB,EAAA,KAAA5vB,MAAA,EACN,iBAAA4vB,IACA3nB,EAAA2nB,EACAA,EAAA,KAAA5vB,MAAA,EAEAiI,KAAApF,IAAAoF,GAAA,iBAAAA,EACA,6CAEA,oBAAAA,GAAA,CAAAzI,EAAAikG,UAAA,CAAAx7F,GACA,qCAAAA,EAAA,CAEA,GAAAkkC,IAAAA,EAAAnsC,MAAA,EACA,IAAAqJ,EAAA8iC,EAAA1c,UAAA,IACA,UAAAxnB,GAAAoB,EAAA,KACApB,WAAAA,CAAA,GAEAkkC,CAAAA,EAAA9iC,CAAA,CAEI,MACJ,iBAAA8iC,EACIA,GAAA,IACJ,kBAAAA,GACAA,CAAAA,EAAAz0B,OAAAy0B,EAAA,EAIA,GAAAmE,EAAA,QAAAtwC,MAAA,CAAAswC,GAAA,KAAAtwC,MAAA,CAAA4vB,EACA,uCAGA,GAAAA,GAAA0gB,EACA,YASA,GANAA,KAAA,EAAA1gB,EAAAA,KAAA/sB,IAAA+sB,EAAA,KAAA5vB,MAAA,CAAA4vB,IAAA,EAEAuc,GAAAA,CAAAA,EAAA,GAIA,iBAAAA,EACA,IAAA/mC,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA,KAAAA,EAAA,CAAA+mC,MAEA,CACA,IAAAhpB,EAAA3jB,EAAAgd,QAAA,CAAA2vB,GACAA,EACA3sC,EAAA2d,IAAA,CAAAgvB,EAAAlkC,EAAA,CACAuwB,EAAArV,EAAAnjB,MAAA,CACA,GAAAw4B,IAAAA,EACA,8BAAA2T,EACA,qCAEA,IAAA/mC,EAAA,EAAAA,EAAAwqB,EAAA0gB,EAAA,EAAAlrC,EACA,KAAAA,EAAAkrC,EAAA,CAAAntB,CAAA,CAAA/d,EAAAozB,EAAA,CACA,OAGA,MAOA,IAAAm4B,EAAA,GACA,SAAAX,EAAA26C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACAl6C,CAAA,CAAAg6C,EAAA,eAAAE,EACA9pG,aAAA,SAGAc,OAAA8L,cAAA,iBACAnM,MAAAopG,EAAA/qG,KAAA,MAAAq4B,WACA2mB,SAAA,GACOC,aAAA,KAIP,KAAA/8C,IAAA,SAAAA,IAAA,KAAA4oG,EAAA,GAGA,KAAAvmF,KAAA,CAEA,YAAAriB,IAAA,CAGA,IAAAsH,MAAA,CACA,OAAAshG,CAAA,CAGA,IAAAthG,KAAA7H,CAAA,EACAK,OAAA8L,cAAA,cACAmxC,aAAA,GACAh0B,WAAA,GACAtpB,MAAAA,EACOq9C,SAAA,EACP,GAGA92C,UAAgB,CAChB,cAAAhG,IAAA,KAAA4oG,EAAA,UAAAxpG,OAAA,GAEA,EAgCA,SAAA2pG,EAAA3+D,CAAA,EACA,IAAA1jC,EAAA,GACArD,EAAA+mC,EAAAnsC,MAAA,CACAswC,EAASnE,MAAAA,CAAA,IAAgB,IACzB,KAAA/mC,GAAckrC,EAAA,EAAAlrC,GAAA,EACdqD,EAAA,IAAA0jC,EAAA/rC,KAAA,CAAAgF,EAAA,EAAAA,GAAA,EAAAqD,EAAA,EAEA,SAAA0jC,EAAA/rC,KAAA,GAAAgF,GAAA,EAAAqD,EAAA,EAMA,SAAAsiG,EAAAjqF,CAAA,CAAA/I,CAAA,CAAAmJ,CAAA,EACA8nF,EAAAjxF,EAAA,UACA+I,CAAAA,KAAAje,IAAAie,CAAA,CAAA/I,EAAA,EAAA+I,KAAAje,IAAAie,CAAA,CAAA/I,EAAAmJ,EAAA,GACAgoF,EAAAnxF,EAAA+I,EAAA9gB,MAAA,CAAAkhB,CAAAA,EAAA,GACA,CAGA,SAAA0mF,EAAApmG,CAAA,CAAA0pC,CAAA,CAAAC,CAAA,CAAArqB,CAAA,CAAA/I,CAAA,CAAAmJ,CAAA,EACA,GAAA1f,EAAA2pC,GAAA3pC,EAAA0pC,EAAA,KAEA8/D,EADA,IAAA5rG,EAAA,iBAAA8rC,EAAA,aAIQ8/D,EAFR9pF,EAAA,EACAgqB,IAAAA,GAAuBA,IAAGme,OAAY,GAC9B,OAAAjqD,EAAA,UAAAA,EAAA,OAAA8hB,EAAA,OAAA9hB,EAAA,EAER,OAAmB,EAAAA,EAAA,OAAA8hB,EAA2B,GAAE,MAAA9hB,EAChD,gBAAA8hB,EAAA,SAAA9hB,EAAA,CADgD,CAIhD,MAAA8rC,EAAA,EAAA9rC,EAAA,UAAA+rC,EAAA,EAAA/rC,EAAA,EAEA,IAAAuxD,EAAAs6C,gBAAA,SAAAD,EAAAxpG,EAAA,CACA,EACAsf,EAAA/I,EAAAmJ,EAAA,CAGA,SAAA8nF,EAAAxnG,CAAA,CAAAO,CAAA,EACA,oBAAAP,EACA,UAAAmvD,EAAAu6C,oBAAA,CAAAnpG,EAAA,SAAAP,EAAA,CAIA,SAAA0nG,EAAA1nG,CAAA,CAAAxB,CAAA,CAAA0B,CAAA,EACA,GAAA5B,KAAAwZ,KAAA,CAAA9X,KAAAA,EAEA,MADAwnG,EAAAxnG,EAAAE,GACA,IAAAivD,EAAAs6C,gBAAA,CAAAvpG,GAAA,sBAAAF,EAAA,CAGA,GAAAxB,EAAA,EACA,UAAA2wD,EAAAw6C,wBAAA,OAGA,IAAAx6C,EAAAs6C,gBAAA,CAAAvpG,GAA0C,SAC1C,MAAAA,EAAA,cAAA1B,EAAA,EACAwB,EAAA,CAtFAwuD,EAAA,2BACA,SAAAjuD,CAAA,SACA,EACA,GAAAA,EAAA,8BAGG,gDAHH,EAIAqpG,YACAp7C,EAAA,uBACA,SAAAjuD,CAAA,CAAA2hG,CAAwB,EACrB,cAAA3hG,EAAA,0DAAA2hG,EAAA,GACH5iG,WACAkvD,EAAA,mBACA,SAAApmC,CAAA,CAAAohF,CAAA,CAAAtoG,CAAA,CAA+B,CAC/B,IAAApB,EAAA,iBAAAsoB,EAAA,oBACAyhF,EAAA3oG,EAWG,OAVHgV,OAAAC,SAAA,CAAAjV,IAAA5C,KAAA+uB,GAAA,CAAAnsB,GAAA,WACM2oG,EAAAP,EAAA5rF,OAAAxc,IACN,iBAAAA,IACA2oG,EAAAnsF,OAAAxc,GACAA,CAAAA,EAAA2mD,OAAA,IAAAA,OAAA,KAAA3mD,EAAA,CAAA2mD,CAAAA,OAAA,IAAAA,OAAA,OACAgiD,CAAAA,EAAAP,EAAAO,EAAA,EAEAA,GAAA,KAEA/pG,GAAA,eAAA0pG,EAAA,aAAAK,EAAA,GACGD,YAiEH,IAAAE,EAAA,oBAGA,SAAAC,GAAA3hF,CAAA,EAMA,GAAAA,CAFAA,EAAAA,CAFAA,EAAAA,EAAAjQ,KAAA,UAEAuJ,IAAA,GAAAE,OAAA,CAAAkoF,EAAA,KAEAtrG,MAAA,YAEA,KAAA4pB,EAAA5pB,MAAA,OACA4pB,GAAA,IAEA,OAAAA,CAAA,CAGA,SAAAo6E,GAAAn+F,CAAA,CAAAumF,CAAA,MAEAyZ,EADAzZ,EAAAA,GAAA8V,IAEA,IAAAliG,EAAA6F,EAAA7F,MAAA,CACAwrG,EAAA,KAAAroF,EAAA,GAGA,QAAA/d,EAAA,EAAAA,EAAApF,EAAA,EAAAoF,EAAA,CAIA,GAAAygG,CAJAA,EAAAhgG,EAAA4pB,UAAA,CAAArqB,EAAA,EAIA,OAAAygG,EAAA,OAEA,IAAA2F,EAAA,CAEA,GAAA3F,EAAA,OAIAzgG,EAAA,IAAApF,EAJA,CAEAosF,CAAAA,GAAA,OAAAjpE,EAAA7kB,IAAA,cACU,SAIV,EAGAunG,EAGA,YAIAA,EAAA,OACAzZ,CAAAA,GAAA,OAAAjpE,EAAA7kB,IAAA,cACAktG,EAAA3F,EACA,WAIM,CAAA2F,EAAA,UAAA3F,EAAA,YACN,MAAA2F,GAEA,CAAApf,GAAA,OAAAjpE,EAAA7kB,IAAA,cAMA,GAJAktG,EAAA,KAIA3F,EAAA,KACA,IAAAzZ,GAAA,WACMjpE,EAAA7kB,IAAA,CAAAunG,EACN,SAAAA,EAAA,MACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,MACAA,GAAAA,EAAA,IAEA,SAAAA,EAAA,OACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,OACAA,GAAA,SACAA,GAAAA,EAAA,IAEA,SAAAA,EAAA,SACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,OACAA,GAAA,UACAA,GAAA,SACAA,GAAAA,EAAA,IAEA,MACA,kCAIA,OAAA1iF,CAAA,CAGA,SAAAqiF,GAAA57E,CAAA,EACA,IAAA6hF,EAAkB,GAClB,QAAArmG,EAAA,EAAAA,EAAAwkB,EAAA5pB,MAAA,GAAAoF,EAEAqmG,EAAAntG,IAAA,CAAAsrB,IAAAA,EAAA6F,UAAA,CAAArqB,IAEA,OAAAqmG,CAAA,CAGA,SAAA9F,GAAA/7E,CAAA,CAAAwiE,CAAA,MACAvlC,EAAAghD,EACA,IAAA4D,EAAkB,GAClB,QAAArmG,EAAA,IAAAwkB,EAAA5pB,MAAA,KAAAosF,GAAA,QAAAhnF,EAIAyiG,EAAAhhD,CADAA,EAAAj9B,EAAA6F,UAAA,CAAArqB,EAAA,GACA,EAEAqmG,EAAAntG,IAAA,CADAuoD,EAAA,KAEA4kD,EAAAntG,IAAA,CAAAupG,GAGA,OAAA4D,CAAA,CAGA,SAAAxH,GAAAr6E,CAAA,EACA,OAAA6mC,EAAAR,WAAA,CAAAs7C,GAAA3hF,GAAA,CAGA,SAAA07E,GAAAttF,CAAA,CAAA0zF,CAAA,CAAA3zF,CAAA,CAAA/X,CAAA,EACA,IAAAoF,EACA,IAAAA,EAAA,EACA,EADApF,IACAoF,CAAAA,EAAA2S,GAAA2zF,EAAA1rG,MAAA,IAAAoF,CAAAA,GAAA4S,EAAAhY,MAAA,EADA,EAAAoF,EAEAsmG,CAAA,CAAAtmG,EAAA2S,EAAA,CAAAC,CAAA,CAAA5S,EAAA,CAEA,OAAAA,CAAA,CAMA,SAAA89F,GAAAzkF,CAAA,CAAA/c,CAAA,EACA,OAAA+c,aAAA/c,GACA+c,IAAA,EAAAA,GAAAA,IAAA,EAAAA,EAAA1d,WAAA,EAAA0d,IAAA,EAAAA,EAAA1d,WAAA,CAAAgB,IAAA,EACA0c,EAAA1d,WAAA,CAAAgB,IAAA,GAAAL,EAAAK,IAAA,CAEA,SAAA8hG,GAAAplF,CAAA,EAEA,OAAAA,GAAAA,CAAA,CAKA,IAAA8oF,GAAA,WACA,IAAAoE,EAAA,mBACAlT,EAAA,MAA0B,KAC1B,QAAArzF,EAAA,EAAAA,EAAA,KAAAA,EAAA,CACA,IAAAolB,EAAAplB,GAAAA,EACA,QAAAkuB,EAAA,EAAAA,EAAA,KAAAA,EACAmlE,CAAA,CAAAjuE,EAAA8I,EAAA,CAAAq4E,CAAA,CAAAvmG,EAAA,CAAAumG,CAAA,CAAAr4E,EAAA,CAGC,OAAAmlE,CAAA,IAID,SAAAsQ,GAAApzE,CAAA,EACA,0BAAA0zB,OAAAuiD,GAAAj2E,CAAA,CAGA,SAAAi2E,IAAA,CACA,oCACC,EAAAzqF,GAGD,IAAA0qF,EAAA,SAAAptG,EAAA2O,CAAA,CAAA3O,EAAA2O,CAAA,CACA,oBAAA/O,KAAAA,KAA6C,oBAAA8O,OAAAA,OAAA,GAyB7C2+F,EApBA5L,EADA,mBAAAr+F,OAAA8C,MAAA,CACA,SAAAonG,CAAA,CAAAC,CAAA,EAEAD,EAAAE,MAAA,CAAAD,EACAD,EAAAx+F,SAAA,CAAA1L,OAAA8C,MAAA,CAAAqnG,EAAAz+F,SAAA,EACAxM,YAAA,CACAS,MAAAuqG,EACAjhF,WAAA,GACA+zB,SAAA,GACAC,aAAA,EACK,CACL,EACE,EAEF,SAAAitD,CAAA,CAAAC,CAAA,EACAD,EAAAE,MAAA,CAAAD,EACA,IAAAE,EAAA,YACAA,CAAAA,EAAA3+F,SAAA,CAAAy+F,EAAAz+F,SAAA,CACAw+F,EAAAx+F,SAAA,KAAA2+F,EACAH,EAAAx+F,SAAA,CAAAxM,WAAA,CAAAgrG,CACA,EAYA,SAAAI,EAAA1tF,CAAA,CAAAzU,CAAA,EAEA,IAAA/K,EAAA,CACA8oF,KAAA,GACAqkB,QAAAC,CACA,EAiBA,OAfAn0E,UAAAl4B,MAAA,KAAAf,CAAAA,EAAAs0F,KAAA,CAAAr7D,SAAA,KACAA,UAAAl4B,MAAA,KAAAf,CAAAA,EAAAqsC,MAAA,CAAApT,SAAA,KACAo0E,EAAAtiG,GAEI/K,EAAAstG,UAAA,CAAAviG,EACJA,GAEAwiG,EAAAvtG,EAAA+K,GAGAyiG,EAAAxtG,EAAAstG,UAAA,GAAAttG,CAAAA,EAAAstG,UAAA,KACAE,EAAAxtG,EAAAs0F,KAAA,GAAAt0F,CAAAA,EAAAs0F,KAAA,IACAkZ,EAAAxtG,EAAAqsC,MAAA,GAAArsC,CAAAA,EAAAqsC,MAAA,KACAmhE,EAAAxtG,EAAAytG,aAAA,GAAAztG,CAAAA,EAAAytG,aAAA,KACAztG,EAAAqsC,MAAA,EAAArsC,CAAAA,EAAAmtG,OAAA,CAAAO,CAAA,EACAC,EAAA3tG,EAAAwf,EAAAxf,EAAAs0F,KAAA,EAkCA,SAAAoZ,EAAA/iF,CAAA,CAAAijF,CAAA,MAAAh+D,EAAAs9D,EAAA/2E,MAAA,CAAAy3E,EAAA,QAGA,EACA,QAAAV,EAAA7gE,MAAA,CAAAuD,EAAA,QAAAjlB,EACI,QAAAuiF,EAAA7gE,MAAA,CAAAuD,EAAA,QAEJjlB,CACA,CAIA,SAAAyiF,EAAAziF,CAAA,CAAAijF,CAAA,EACA,OAAAjjF,CAAA,CAIA,SAAAkjF,EAAAptG,CAAA,MAAAsvB,EAAA,GAOA,OAJAtvB,EAAAuM,OAAA,UAAAkgC,CAAA,CAAAjlC,CAAA,EACG8nB,CAAA,CAAAmd,EAAA,MAGHnd,CAAA,CAIA,SAAA49E,EAAA3tG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,EAGA,GAAA9tG,EAAAytG,aAAA,EACAlrG,GACAwrG,EAAAxrG,EAAAslG,OAAA,GAEAtlG,EAAAslG,OAAA,GAAAqF,GAEA,CAAA3qG,CAAAA,EAAAT,WAAA,EAAAS,EAAAT,WAAA,CAAAwM,SAAA,GAAA/L,CAAA,GACA,IAwFAywB,EAxFAkqD,EAAA36E,EAAAslG,OAAA,CAAAiG,EAAA9tG,GAIA,OAHAguG,EAAA9wB,IACAA,CAAAA,EAAAywB,EAAA3tG,EAAAk9E,EAAA4wB,EAAA,EAEA5wB,CAAA,KAIA+wB,EAAAC,EAAAluG,EAAAuC,GACA,GAAA0rG,EACA,OAAAA,CAAA,CAIA,IAAApnG,EAAAjE,OAAAiE,IAAA,CAAAtE,GAAA4rG,EAAAN,EAAAhnG,GASA,GANA7G,EAAAstG,UAAA,EACAzmG,CAAAA,EAAAjE,OAAA+d,mBAAA,CAAApe,EAAA,EAKA6rG,EAAA7rG,IACAsE,CAAAA,EAAAkZ,OAAA,gBAAAlZ,EAAAkZ,OAAA,oBACA,OAAAsuF,EAAA9rG,EAAA,CAIA,GAAAsE,IAAAA,EAAA9F,MAAA,EACA,GAAAgtG,EAAAxrG,GAAA,CACA,IAAAO,EAAAP,EAAAO,IAAA,MAAAP,EAAAO,IAAA,IACA,OAAA9C,EAAAmtG,OAAA,aAAArqG,EAAA,cACA,IACAwrG,EAAA/rG,GACA,OAAAvC,EAAAmtG,OAAA,CAAAn4C,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,SACA,CACA,GAAAgsG,EAAAhsG,GACA,OAAAvC,EAAAmtG,OAAA,CAAA7R,KAAAhtF,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,OACA,CACA,GAAA6rG,EAAA7rG,GACA,OAAA8rG,EAAA9rG,EACA,KAEiD4tC,EAAA,GAAA1vC,EAAA,GAAA+tG,EAAA,gBA8BjD,CA1BAhqG,EAAAjC,KACA9B,EAAA,GACA+tG,EAAA,WAIAT,EAAAxrG,IAEA4tC,CAAAA,EAAA,aADA5tC,CAAAA,EAAAO,IAAA,MAAAP,EAAAO,IAAA,KACA,KAIAwrG,EAAA/rG,IACA4tC,CAAAA,EAAA,IAAA6kB,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,EAAA,EAIAgsG,EAAAhsG,IACA4tC,CAAAA,EAAA,IAAAmrD,KAAAhtF,SAAA,CAAAmgG,WAAA,CAAAjgG,IAAA,CAAAjM,EAAA,EAIA6rG,EAAA7rG,IACA4tC,CAAAA,EAAA,IAAAk+D,EAAA9rG,EAAA,EAGAsE,IAAAA,EAAA9F,MAAA,KAAAwB,GAAAA,EAAAxB,MAAA,EAIA+sG,EAAA,EACA,EAAAvrG,GACMvC,EAAAmtG,OAAA,CAAAn4C,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,UAENvC,EAAAmtG,OAAA,sBACA,EAEAntG,EAAA8oF,IAAA,CAAAzpF,IAAA,CAAAkD,GAKIywB,EADJvyB,EACIiuG,EAAA1uG,EAAAuC,EAAAurG,EAAAK,EAAAtnG,GAEJA,EAAA7F,GAAA,UAAAwB,CAAA,EACK,OAAAmsG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EAAA3rG,EAAA/B,EACL,GAEAT,EAAA8oF,IAAA,CAAAn1B,GAAA,GAGAi7C,EAAA57E,EAAAmd,EAAAq+D,IAxBAA,CAAA,IAAAr+D,EAAAq+D,CAAA,IA4BA,SAAAN,EAAAluG,CAAA,CAAAuC,CAAA,EACA,GAAAirG,EAAAjrG,GACA,OAAAvC,EAAAmtG,OAAA,0BACA,GAAAa,EAAAzrG,GAAA,CACA,IAAAssG,EAAA,IAAAvrG,KAAAC,SAAA,CAAAhB,GAAA4hB,OAAA,cACAA,OAAA,aACAA,OAAA,iBACA,OAAAnkB,EAAAmtG,OAAA,CAAA0B,EAAA,SACA,QACA,EAAAtsG,GACAvC,EAAAmtG,OAAA,IAAA5qG,EAAA,UACA8qG,EAAA9qG,GACAvC,EAAAmtG,OAAA,IAAA5qG,EAAA,WAEAusG,EAAAvsG,GACAvC,EAAAmtG,OAAA,sBALA,CASA,SAAAkB,EAAA9rG,CAAA,EACA,UAAAgL,MAAAe,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,IAIA,SAAAmsG,EAAA1uG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,CAAAK,CAAA,CAAAtnG,CAAA,EAEA,QADAmsB,EAAA,GACQ7sB,EAAA,EAAA2mC,EAAAvqC,EAAAxB,MAAA,CAAAoF,EAAc2mC,EAAA,EAAA3mC,EACtB4oG,GAAAxsG,EAAA0d,OAAA9Z,IACA6sB,EAAA3zB,IAAA,CAAAsvG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EACMluF,OAAA9Z,GAAA,KAEN6sB,EAAA3zB,IAAA,KASA,OANAwH,EAAAmG,OAAA,UAAAxK,CAAA,EACAA,EAAAy6B,KAAA,WACAjK,EAAA3zB,IAAA,CAAAsvG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EACA3rG,EAAA,IAEA,GACAwwB,CAAA,CAIA,SAAA27E,EAAA3uG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,CAAAK,CAAA,CAAA3rG,CAAA,CAAA/B,CAAA,EACA,IAAAqC,EAAA6nB,EAAA+0B,EAsCA,GApCAA,CADAA,EAAA98C,OAAA+8C,wBAAA,CAAAp9C,EAAAC,IAAA,CAAAD,MAAAA,CAAA,CAAAC,EAAA,GACAogB,GAAA,CAEM+H,EADN+0B,EAAAx6C,GAAA,CACMlF,EAAAmtG,OAAA,8BAENntG,EAAAmtG,OAAA,uBAGAztD,EAAAx6C,GAAA,EACAylB,CAAAA,EAAA3qB,EAAAmtG,OAAA,wBAGA4B,GAAAZ,EAAA3rG,IACAM,CAAAA,EAAA,IAAAN,EAAA,KAEA,CAAAmoB,IACA3qB,EAAAA,EAAA8oF,IAAA,CAAA/oE,OAAA,CAAA2/B,EAAAn9C,KAAA,EAMAooB,CAJQA,EADRmkF,EAAAhB,GACQH,EAAA3tG,EAAA0/C,EAAAn9C,KAAA,OAERorG,EAAA3tG,EAAA0/C,EAAAn9C,KAAA,CAAAurG,EAAA,IAEA/tF,OAAA,YAEA4K,EADAlqB,EACAkqB,EAAAjQ,KAAA,OAAA1Z,GAAA,UAAAwjB,CAAA,EACW,WAAAA,CACD,GAAAliB,IAAA,OAAA+uD,MAAA,IAEV,KAAA1mC,EAAAjQ,KAAA,OAAA1Z,GAAA,UAAAwjB,CAAA,EACW,YAAAA,CACX,GAAAliB,IAAA,QAIAqoB,EAAA3qB,EAAAmtG,OAAA,0BAGAK,EAAA1qG,GAAA,CACA,GAAArC,GAAA+B,EAAAy6B,KAAA,UACA,OAAAtS,CACA,CAEA7nB,CADAA,EAAAQ,KAAAC,SAAA,IAAAf,EAAA,EACAy6B,KAAA,kCACAn6B,EAAAA,EAAAuuD,MAAA,GAAAvuD,EAAA/B,MAAA,IACM+B,EAAA9C,EAAAmtG,OAAA,CAAArqG,EAAA,UAENA,EAAAA,EAAAqhB,OAAA,aACAA,OAAA,aACAA,OAAA,iBACArhB,EAAA9C,EAAAmtG,OAAA,CAAArqG,EAAA,UACA,QAGAA,EAAA,KAAA6nB,CAAA,CAIA,SAAAikF,EAAA57E,CAAA,CAAAmd,CAAA,CAAAq+D,CAAA,SAMA,EALAtzF,MAAA,UAAAyW,CAAA,CAAA+mE,CAAA,EAEG,OADHA,EAAA34E,OAAA,OACG4R,EAAA+mE,EAAAv0E,OAAA,uBAAApjB,MAAA,OAGH,GACAytG,CAAA,IACAr+D,CAAAA,KAAAA,EAAA,GAAAA,EAAA,OACA,IACAnd,EAAA1wB,IAAA,UACA,IACAksG,CAAA,IAGAA,CAAA,IAAAr+D,EAAA,IAAAnd,EAAA1wB,IAAA,WAAAksG,CAAA,IAMA,SAAAhqG,EAAAwqG,CAAA,EACA,OAAAruG,MAAA6D,OAAA,CAAAwqG,EAAA,CAGA,SAAA3B,EAAA12E,CAAA,EACA,wBAAAA,CAAA,CAGA,SAAAm4E,EAAAn4E,CAAA,EACA,OAAAA,IAAA,GAAAA,CAAA,CAGA,SAAAs4E,EAAAt4E,CAAA,EACA,uBAAAA,CAAA,CAGA,SAAAq3E,EAAAr3E,CAAA,EACA,uBAAAA,CAAA,CAGA,SAAA62E,EAAA72E,CAAA,EACA,OAAAA,KAAA,IAAAA,CAAA,CAGA,SAAA23E,EAAAliE,CAAA,EACA,OAAAlpC,EAAAkpC,IAAA8iE,oBAAAA,EAAA9iE,EAAA,CAGA,SAAAlpC,EAAAyzB,CAAA,EACA,uBAAAA,GAAAA,IAAA,GAAAA,CAAA,CAGA,SAAA43E,EAAA9uG,CAAA,EACA,OAAAyD,EAAAzD,IAAAyvG,kBAAAA,EAAAzvG,EAAA,CAGA,SAAA2uG,EAAAlnG,CAAA,EACA,OAAAhE,EAAAgE,IACAgoG,CAAAA,mBAAAA,EAAAhoG,IAAAA,aAAAqG,KAAA,EAGA,SAAAwgG,EAAAp3E,CAAA,EACA,yBAAAA,CAAA,CAGA,SAAAw4E,EAAAx4E,CAAA,EACA,OAAAA,IAAA,GAAAA,GACA,kBAAAA,GACA,iBAAAA,GACA,iBAAAA,GACA,iBAAAA,GACA,SAAAA,CAAA,CAGA,SAAAu4E,EAAA1vD,CAAA,EACA,OAAA58C,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgxC,EAAA,CAGA,SAAA+tD,EAAAv5C,CAAA,CAAA5uD,CAAA,EACA,IAAAA,GAAA,CAAAlC,EAAAkC,GAAA,OAAA4uD,CAAA,CAKA,IAFA,IAAAntD,EAAAjE,OAAAiE,IAAA,CAAAzB,GACAe,EAAAU,EAAA9F,MAAA,CACAoF,KACA6tD,CAAA,CAAAntD,CAAA,CAAAV,EAAA,EAAAf,CAAA,CAAAyB,CAAA,CAAAV,EAAA,EAEA,OAAA6tD,CACA,CACA,SAAA+6C,GAAAvvF,CAAA,CAAA6zB,CAAA,EACA,OAAAzwC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAgR,EAAA6zB,EAAA,CAGA,SAAAwjB,GAAAl3D,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,IAAAkZ,EACA,SAMA,QAHA5V,EAAAtD,EAAAoB,MAAA,CAAAuzB,EAAAzb,EAAA9X,MAAA,CAGAoF,EAAA,EAAAozB,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAAAnuB,EAAAozB,EAAA,EAAApzB,EACA,GAAAxG,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,CAAA1S,EAAA,EACAlD,EAAAtD,CAAA,CAAAwG,EAAA,CACAmuB,EAAAzb,CAAA,CAAA1S,EAAA,CACA,MACA,OAGA,EAAAmuB,EACA,GAEAA,EAAArxB,EACA,EAEA,CAJA,CAlYAiqG,EAAA7gE,MAAA,EACA,YACA,cACA,iBACA,eACA,cACA,aACA,cACA,aACA,aACA,cACA,gBACA,YACA,gBAIA6gE,EAAA/2E,MAAA,EACA,eACA,gBACA,iBACA,iBACA,YACA,eACA,eAEA,cA6WA,IAAAi5E,GAAAxsG,OAAA0L,SAAA,CAAAC,cAAA,CAGA8gG,GAAAzsG,OAAAiE,IAAA,WAAA2Y,CAAA,EACA,IAAA3Y,EAAA,GACA,QAAArE,KAAAgd,EACA4vF,GAAA5gG,IAAA,CAAAgR,EAAAhd,IAAAqE,EAAAxH,IAAA,CAAAmD,GAEA,OAAAqE,CACA,EACAyoG,GAAA3uG,MAAA2N,SAAA,CAAAnN,KAAA,CAEA,SAAAouG,IAAA,QACA,SAAArO,EACAA,EAEAA,EACG,uBAAAp+F,IAAA,CAGH,SAAA0sG,GAAAhwF,CAAA,EACA,OAAA5c,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,EACA,CACA,SAAAM,GAAA2vF,CAAA,QACA,CAAAvtF,EAAA3E,QAAA,CAAAkyF,IAGA,mBAAA7C,EAAA/sF,WAAA,GAGA,mBAAAA,YAAAC,MAAA,CACAD,YAAAC,MAAA,CAAA2vF,KAEAA,MAGAA,aAAAhwF,UAGAgwF,EAAAvtF,MAAA,EAAAutF,EAAAvtF,MAAA,YAAArC,aAIA,CAKA,SAAApa,GAAAlD,CAAA,CAAAL,CAAA,EACAK,GAAAmtG,GAAAntG,EAAA,GAAAL,EAAA,KAAA0iB,GAAA,CAQA,IAAA6vE,GAAA,8BAEA,SAAAkb,GAAAt4E,CAAA,EACA,GAAA02E,EAAA12E,IAGA,GAAAk4E,KACA,OAAAl4E,EAAAv0B,IAAA,CAGA,IAAAm6B,EAAAtS,EADA7hB,QAAA,GACAm0B,KAAA,CAAAw3D,IACA,OAAAx3D,GAAAA,CAAA,IANA,CASA,SAAA2yE,GAAAzrG,CAAA,EACA,KAAArB,IAAA,kBACA,KAAA2hG,MAAA,CAAAtgG,EAAAsgG,MAAA,CACA,KAAAoL,QAAA,CAAA1rG,EAAA0rG,QAAA,CACA,KAAAC,QAAA,CAAA3rG,EAAA2rG,QAAA,CACA3rG,EAAAjC,OAAA,EACA,KAAAA,OAAA,CAAAiC,EAAAjC,OAAA,CACI,KAAA6tG,gBAAA,MAEJ,KAAA7tG,OAAA,CAAAypG,GAAA,MACA,KAAAoE,gBAAA,KAEA,IAAAC,EAAA7rG,EAAA6rG,kBAAA,EAAAN,GACA,GAAAniG,MAAA0iG,iBAAA,CACI1iG,MAAA0iG,iBAAA,MAAAD,OACJ,CAEA,IAAAzlG,EAAA,QACA,GAAAA,EAAA4a,KAAA,MAAAowE,EAAAhrF,EAAA4a,KAAA,CAIA+qF,EAAAP,GAAAK,GACA/nG,EAAAstF,EAAAx1E,OAAA,MAAAmwF,GACA,GAAAjoG,GAAA,GAGA,IAAAkoG,EAAA5a,EAAAx1E,OAAA,MAAA9X,EAAA,GACAstF,EAAAA,EAAA7oD,SAAA,CAAAyjE,EAAA,OAGA,CAAAhrF,KAAA,CAAAowE,CACA,EACA,CAMA,SAAA6a,GAAAvrG,CAAA,CAAA1E,CAAA,QACA,iBAAA0E,EACIA,EAAA9D,MAAA,CAAAZ,EAAA0E,EAAAA,EAAA1D,KAAA,GAAAhB,EAAA,CAEJ0E,CACA,CAEA,SAAAgjG,GAAAwI,CAAA,EACA,GAAAd,MAAA,CAAAxB,EAAAsC,GACA,OAAAnD,EAAAmD,EACA,CACA,IAAAC,EAAAX,GAAAU,GAEA,kBADAC,CAAAA,EAAA,KAAAA,EAAA,IACA,GACA,CACA,SAAA3E,GAAAvsG,CAAA,EACA,OAAAgxG,GAAAvI,GAAAzoG,EAAAqlG,MAAA,WACArlG,EAAA0wG,QAAA,KACAM,GAAAvI,GAAAzoG,EAAAywG,QAAA,OAcA,SAAAH,GAAAjL,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,CAAA4tG,CAAA,CAAAE,CAAA,EACA,UAAAJ,GAAA,CACA1tG,QAAAA,EACAuiG,OAAAA,EACAoL,SAAAA,EACAC,SAAAA,EACGE,mBAAAA,CACH,GAaA,SAAAprF,GAAAriB,CAAA,CAAAL,CAAA,EACAK,GAAAmtG,GAAAntG,EAAA,GAAAL,EAAA,KAAA0iB,GACA,CAOA,SAAA2rF,GAAA9L,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAuiG,GAAAoL,GAAAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,KAAAquG,GAAA,CAMA,SAAAC,GAAA/L,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAuiG,GAAAoL,GACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,KAAAsuG,GACA,CAMA,SAAAC,GAAAhM,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAwuG,GAAAjM,EAAAoL,EAAA,KACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,YAAAuuG,GAEA,CAEA,SAAAE,GAAAlM,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAwuG,GAAAjM,EAAAoL,EAAA,KACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,kBAAAyuG,GACA,CAGA,SAAAD,GAAAjM,CAAA,CAAAoL,CAAA,CAAAe,CAAA,CAAAC,CAAA,EAEA,GAAApM,IAAAoL,EACI,QA4DJ,CA3DA,GAAA3tF,EAAA3E,QAAA,CAAAknF,IAAAviF,EAAA3E,QAAA,CAAAsyF,GAAA,OAAAh5C,IAAAA,GAAA4tC,EAAAoL,EA2DA,CAtDA,GAAAtB,EAAA9J,IAAA8J,EAAAsB,GAAA,OAAApL,EAAApJ,OAAA,KAAAwU,EAAAxU,OAAA,EAsDA,CAhDA,GAAAiT,EAAA7J,IAAA6J,EAAAuB,GACA,OAAApL,EAAAt7E,MAAA,GAAA0mF,EAAA1mF,MAAA,EACAs7E,EAAA3kG,MAAA,GAAA+vG,EAAA/vG,MAAA,EACA2kG,EAAAqM,SAAA,GAAAjB,EAAAiB,SAAA,EACArM,EAAA76E,SAAA,GAAAimF,EAAAjmF,SAAA,EAAA66E,EAAAsM,UAAA,GAAAlB,EAAAkB,UAAA,CAKA,IAAAtM,IAAA,GAAAA,GAAA,iBAAAA,CAAA,GACAoL,CAAAA,IAAA,GAAAA,GAAA,iBAAAA,CAAA,SAAAe,EAAAnM,IAAAoL,EAAApL,GAAAoL,CAAA,CASA,GAAA/vF,GAAA2kF,IAAA3kF,GAAA+vF,IACAL,GAAA/K,KAAA+K,GAAAK,IACA,CAAApL,CAAAA,aAAAuM,cACAvM,aAAAwM,YAAA,EACA,OAAAp6C,IAAAA,GAAA,IAAAxqD,WAAAo4F,EAAAviF,MAAA,MAAA7V,WAAAwjG,EAAA3tF,MAAA,EAyBA,CAhBA,GAAAA,EAAA3E,QAAA,CAAAknF,KAAAviF,EAAA3E,QAAA,CAAAsyF,GACI,QAeJ,CAXA,IAAAqB,EAAAL,CAHsBA,EAAAA,GAAA,CAAApM,OAAA,GAAAoL,SAAA,KAGtBpL,MAAA,CAAA1kF,OAAA,CAAA0kF,UACA,KAAAyM,GACAA,IAAAL,EAAAhB,QAAA,CAAA9vF,OAAA,CAAA8vF,KAKAgB,EAAApM,MAAA,CAAAplG,IAAA,CAAAolG,GAAAoM,EAAAhB,QAAA,CAAAxwG,IAAA,CAAAwwG,GAGAsB,GAAA1M,EAAAoL,EAAAe,EAAAC,GACA,CAGA,SAAAO,GAAAx1D,CAAA,EACA,MAAAh5C,sBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAotC,EAAA,CAGA,SAAAu1D,GAAAxxG,CAAA,CAAAkZ,CAAA,CAAA+3F,CAAA,CAAAS,CAAA,EACA,GAAA1xG,MAAAA,GAAAkZ,MAAAA,EACA,SAEA,GAAAs2F,EAAAxvG,IAAAwvG,EAAAt2F,GACA,OAAAlZ,IAAAkZ,CAAA,CACA,GAAA+3F,GAAAhuG,OAAAy6C,cAAA,CAAA19C,KAAAiD,OAAAy6C,cAAA,CAAAxkC,GACA,SACA,IAWArW,EAAA2D,EAXAmrG,EAAAF,GAAAzxG,GACA4xG,EAAAH,GAAAv4F,GACA,OAAA04F,GAAA,CAAAD,GAAAC,EACA,SACA,GAAAD,EAGA,OAAAZ,GAFA/wG,EAAA2vG,GAAA9gG,IAAA,CAAA7O,GACAkZ,EAAAy2F,GAAA9gG,IAAA,CAAAqK,GACA+3F,EACA,CACA,IAAAY,EAAAnC,GAAA1vG,GACA8xG,EAAApC,GAAAx2F,GAIA,GAAA24F,EAAAzwG,MAAA,GAAA0wG,EAAA1wG,MAAA,CACA,SAKA,IAHAywG,EAAA3gE,IAAA,GACA4gE,EAAA5gE,IAAA,GAEA1qC,EAAAqrG,EAAAzwG,MAAA,GAAAoF,GAAA,EAAAA,IACA,GAAAqrG,CAAA,CAAArrG,EAAA,GAAAsrG,CAAA,CAAAtrG,EAAA,CACA,SAIA,IAAAA,EAAAqrG,EAAAzwG,MAAA,GAAAoF,GAAA,EAAAA,IAEA,IAAAuqG,GAAA/wG,CAAA,CADA6C,EAAAgvG,CAAA,CAAArrG,EAAA,CACA,CAAA0S,CAAA,CAAArW,EAAA,CAAAouG,EAAAS,GACA,SAEA,SAMA,SAAAK,GAAAjN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAwuG,GAAAjM,EAAAoL,EAAA,KACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,eAAAwvG,GACA,CAIA,SAAAC,GAAAlN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAwuG,GAAAjM,EAAAoL,EAAA,KACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,qBAAAyvG,GACA,CAOA,SAAAC,GAAAnN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAuiG,IAAAoL,GACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,MAAA0vG,GACA,CAMA,SAAAC,GAAApN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACAuiG,IAAAoL,GACAH,GAAAjL,EAAAoL,EAAA3tG,EAAA,MAAA2vG,GACA,CAGA,SAAAC,GAAArN,CAAA,CAAAoL,CAAA,EACA,IAAApL,GAAA,CAAAoL,EACA,SAGA,GAAAjtG,mBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAqhG,GACA,OAAAA,EAAA3vF,IAAA,CAAAukF,EAAA,CAGA,IACA,GAAAA,aAAAoL,EACA,QACI,CACJ,MAAA3oG,EAAA,CACA,OAGA,CAAAqG,MAAAmS,aAAA,CAAAmwF,IAIAA,CAAA,IAAAA,EAAArhG,IAAA,IAAAi2F,EAAA,CAGA,SAAAsN,GAAAC,CAAA,EACA,IAAAjsG,EACA,IACIisG,GACJ,OAAA9qG,EAAA,CACAnB,EAAAmB,CACA,CACA,OAAAnB,CAAA,CAGA,SAAAksG,GAAAC,CAAA,CAAAF,CAAA,CAAAnC,CAAA,CAAA3tG,CAAA,EAGA,sBAAA8vG,EACA,uDAGA,iBAAAnC,IACA3tG,EAAA2tG,EACAA,EAAA,MAEApL,EAAAsN,GAAAC,GAGA9vG,EAAA,CAAA2tG,GAAAA,EAAA/sG,IAAA,MAAA+sG,EAAA/sG,IAAA,WAAAZ,CAAAA,EAAA,IAAAA,EAAA,KAGAgwG,GAAA,CAAAzN,GACAiL,GAAAjL,EAAAoL,EAAA,6BAAA3tG,GAGA,IArBAuiG,EAqBA0N,EAAA,iBAAAjwG,EACAkwG,EAAA,CAAAF,GAAA9D,EAAA3J,GAAA4N,EAAA,CAAAH,GAAAzN,GAAA,CAAAoL,EAUA,GAPA,IACAsC,GACAL,GAAArN,EAAAoL,IACAwC,CAAA,GACA3C,GAAAjL,EAAAoL,EAAA,yBAAA3tG,GAGA,GAAAuiG,GAAAoL,GACA,CAAAiC,GAAArN,EAAAoL,IAAA,CAAAqC,GAAAzN,EACA,MAAAA,CAAA,CAOA,SAAA6N,GAAAN,CAAA,CAAAjsG,CAAA,CAAA7D,CAAA,EACA+vG,GAAA,GAAAD,EAAAjsG,EAAA7D,EAAA,CAKA,SAAAqwG,GAAAP,CAAA,CAAAjsG,CAAA,CAAA7D,CAAA,EACA+vG,GAAA,GAAAD,EAAAjsG,EAAA7D,EAAA,CAIA,SAAAswG,GAAAjoG,CAAA,EACA,GAAAA,EAAA,MAAAA,CAAA,CA3WA9E,GAAAmqG,cAAA,CAAAA,GAqCA/C,EAAA+C,GAAAriG,OA6CA9H,GAAAiqG,IAAA,CAAAA,GAYAjqG,GAAAmf,EAAA,CAAAA,GAMAnf,GAAA8qG,KAAA,CAAAA,GAOA9qG,GAAA+qG,QAAA,CAAAA,GASA/qG,GAAAgrG,SAAA,CAAAA,GAMAhrG,GAAAkrG,eAAA,CAAAA,GAyHAlrG,GAAAisG,YAAA,CAAAA,GAOAjsG,GAAAksG,kBAAA,CAAAA,GAUAlsG,GAAAmsG,WAAA,CAAAA,GASAnsG,GAAAosG,cAAA,CAAAA,GAiFApsG,GAAAgtG,MAAS,CAAAH,GAMT7sG,GAAA8sG,YAAA,CAAAA,GAKA9sG,GAAA+sG,OAAA,CAAAA,GAIA,IAAAE,GAAA,EAmBA,OAAAp6F,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAAH,GACA,2CAWA,KAAAA,IAAA,CAAAA,EAWA,KAAAC,QAAA,CAAAA,CAAA,CAkBAG,uBAAA,CACA,SAeAC,OAAAC,CAAA,CAAAC,CAAA,EACA,kCAyBAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,kCAmBAE,QAAAH,CAAA,CAAAC,CAAA,EACA,UAAAP,IAAA,CACA,uCAEA,YAAAA,IAAA,CAmBAU,UAAAT,CAAA,EACA,IAAAU,EAAAtW,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,EAGA,OAFA1L,OAAAC,MAAA,CAAAqW,EAAA,MACAA,EAAAV,QAAA,CAAAA,EACAU,CAAA,CAuBAC,UAAAC,CAAA,EAEA,CACA,CAQA,SAAAE,GAAAxW,CAAA,CAAAyW,CAAA,SACA,EAAAf,QAAA,CACA1V,EAAA,IAAAyW,EAAAf,QAAA,KAEA1V,CADA,CAgCA,SAAAu6F,GAAAiB,CAAA,CAAA3kF,CAAA,EACA,sBAAA2kF,EACA,6CAEA,GAAAA,EAAA/vF,cAAA,YACA,kDAEA,IAAAoL,CAAAA,GAAAA,aAAArB,EAAA,EACA,2CAEA,GAAAqB,EAAApL,cAAA,sBACA,wDAEA+vF,EAAAC,OAAA,CAAA5kF,EACAA,EAAA6kF,iBAAA,CAAAF,EACA3kF,EAAAhB,qBAAA,SAAA2lF,EACA17F,OAAA8L,cAAA,CAAA4vF,EAAAhwF,SAAA,WACA/L,MAAA,SAAAsW,CAAA,CAAAC,CAAA,EACK,OAAAa,EAAAnY,MAAA,MAAAqX,EAAAC,EACL,EACG8mC,SAAA,EACH,GACAh9C,OAAA8L,cAAA,CAAA4vF,EAAA,UACA/7F,MAAA,SAAAsW,CAAA,CAAAC,CAAA,EACK,OAAAa,EAAAf,MAAA,CAAAC,EAAAC,EACL,EACG8mC,SAAA,EACH,EACA,CAvEA8yD,GAAAp6F,MAAA,CAAAA,GAaAo6F,GAAAp5F,gBAAA,CAAAA,GA0DAo5F,GAAArV,qBAAA,CAAAA,EAwBA,OAAA7jF,WAAAlB,GAYAmB,SAAA,CACA,0CACA,CAkBA,MAAA2jF,WAAA5jF,GACA1X,YAAA28F,CAAA,CAAAjmF,CAAA,EAIA,GAHA5U,KAAAA,IAAA66F,GACAA,CAAAA,EAAA,GAEA,CAAAhmF,OAAAC,SAAA,CAAA+lF,IAAA,GAAAA,EACA,4DACA,SAAAjmF,GAMA,KAAAimF,WAAA,CAAAA,CAAA,CAIAhlF,SAAA,CACA,SAIAb,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4lF,EAAA7lF,EAAA9X,MAAA,CAAA+X,EACA,OAAAjY,KAAAwZ,KAAA,CAAAqkF,EAAA,KAAAD,WAAA,EAIAj9F,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,QACA,EAuBA,MAAAY,WAAAF,GACA1X,YAAA6X,CAAA,CAAAb,CAAA,CAAAN,CAAA,EACA,IAAAmB,CAAAA,aAAArB,EAAA,EACA,2CAGA,GAAA1U,KAAAA,IAAAkV,EACMA,EAAA,OACN,IAAAL,OAAAC,SAAA,CAAAI,GACA,uDAEA,MAAAa,EAAApB,IAAA,CAAAC,GAAAmB,EAAAnB,QAAA,EAGA,KAAAmB,MAAA,CAAAA,EASA,KAAAb,MAAA,CAAAA,CAAA,CAIAW,SAAA,CACA,YAAAE,MAAA,YAAAC,IACA,KAAAD,MAAA,YAAAE,EAAA,CAIAjB,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,KAAAA,MAAA,EAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAAAA,MAAA,CACA,EAmBA,MAAAc,WAAAtB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAiB,UAAA,CAAAhB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAkB,WAAA,CAAAhB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAAsB,WAAAvB,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAmB,UAAA,CAAAlB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAoB,WAAA,CAAAlB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAA4kF,WAAA7kF,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA8lF,SAAA,CAAA7lF,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA+lF,UAAA,CAAA7lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAA2kF,WAAA5kF,GACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAgmF,SAAA,CAAA/lF,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAimF,UAAA,CAAA/lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAEA,IAAA2B,GAAArZ,WAKA,SAAAsZ,GAAApB,CAAA,EACA,IAAAqB,EAAAvZ,KAAAwZ,KAAA,CAAAtB,EAAAmB,IACAI,EAAUvB,EAAAqB,EAAAF,GACV,OAAAE,KAAAA,EAAAE,KAAAA,CAAA,CACA,CAEA,SAAAC,GAAAH,CAAA,CAAAE,CAAA,EACA,OAAAF,EAAAF,GAAAI,CAAA,CAcA,MAAAE,WAAAlC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAA4B,YAAA,CAAA3B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAA8B,aAAA,CAAAD,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAAmkF,WAAA3kF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAsB,EAAAvB,EAAAkmF,YAAA,CAAAjmF,GACAwB,EAAAzB,EAAAkmF,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAAmmF,aAAA,CAAAtkF,EAAAN,IAAA,CAAAtB,GACAD,EAAAmmF,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,EAcA,MAAA8B,WAAAtC,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAAgC,WAAA,CAAA/B,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAAiC,YAAA,CAAAJ,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAAkkF,WAAA1kF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAsB,EAAAvB,EAAAomF,WAAA,CAAAnmF,GACAwB,EAAAzB,EAAAkmF,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,GAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,GAAApB,GAGA,OAFAF,EAAAqmF,YAAA,CAAAxkF,EAAAN,IAAA,CAAAtB,GACAD,EAAAmmF,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,EAaA,MAAAikF,WAAAzkF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAsmF,WAAA,CAAArmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAumF,YAAA,CAAArmF,EAAAD,GACA,CACA,EAaA,MAAAgkF,WAAAxkF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAwmF,WAAA,CAAAvmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAymF,YAAA,CAAAvmF,EAAAD,GACA,CACA,EAaA,MAAA+jF,WAAAvkF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA0mF,YAAA,CAAAzmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA2mF,aAAA,CAAAzmF,EAAAD,GACA,CACA,EAaA,MAAA8jF,WAAAtkF,GACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA4mF,YAAA,CAAA3mF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA6mF,aAAA,CAAA3mF,EAAAD,GACA,CACA,EAoBA,MAAA6jF,WAAArkF,GACAxW,YAAA4qB,CAAA,CAAA0F,CAAA,CAAA5Z,CAAA,EACA,IAAAkU,CAAAA,aAAApU,EAAA,EACA,kDAEA,kBAAAkB,IAAA4Y,EAAA3Y,OAAA,IACAhB,OAAAC,SAAA,CAAA0Z,IAAA,GAAAA,CAAA,EACA,2FACA,CAEA,IAAA7Z,EAAA,GACA6Z,aAAA5Y,KACA,GAAAkT,EAAAnU,IAAA,GACAA,CAAAA,EAAA6Z,EAAA1F,EAAAnU,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAkU,aAAA,CAAAA,EAQA,KAAA0F,KAAA,CAAAA,CAAA,CAIApZ,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA6Z,EAAA,KAAAA,KAAA,CAIA,GAHAA,aAAA5Y,IACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA,OAAA4T,aAAA,CAAAnU,IAAA,CACMA,EAAA6Z,EAAA,KAAA1F,aAAA,CAAAnU,IAAA,KACN,CACA,IAAAtQ,EAAA,EACA,KAAAA,EAAAmqB,GACA7Z,GAAA,KAAAmU,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,EAAAP,GACA,EAAAtQ,CAEA,QACAsQ,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAI,EAAA,GACA/S,EAAA,EACAisB,EAAA,KAAAA,KAAA,CAIA,IAHAA,aAAA5Y,IACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA3S,EAAAisB,GACAlZ,EAAA7Z,IAAA,MAAAqtB,aAAA,CAAA9T,MAAA,CAAAC,EAAAC,IACAA,GAAA,KAAA4T,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,GACA3S,GAAA,EAEA,OAAA+S,CAAA,CAaA1X,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA6mF,EAAA,KAAAjzE,aAAA,CACAnU,EAAAQ,EAAAmC,MAAA,EAAA3C,EAAA3T,IACK2T,EAAAonF,EAAAn+F,MAAA,CAAAoD,EAAAiU,EAAAC,EAAAP,GACL,GAIA,OAHA,KAAA6Z,KAAA,YAAA5Y,IACA,KAAA4Y,KAAA,CAAA5wB,MAAA,CAAAuX,EAAAhY,MAAA,CAAA8X,EAAAC,GAEAP,CACA,EAmCA,MAAAwC,WAAAzC,GACAxW,YAAAkZ,CAAA,CAAAxC,CAAA,CAAAyC,CAAA,EACA,IAAAta,CAAAA,MAAA6D,OAAA,CAAAwW,IACAA,EAAAE,MAAA,EAAAC,EAAAvW,IAAAuW,GAAAvW,aAAA0T,GAAA,KACA,4DASA,QAAA8C,KAPA,kBAAA5C,GACA5U,KAAAA,IAAAqX,IACAA,EAAAzC,EACAA,EAAA5U,KAAAA,GAIAoX,GACA,KAAAI,EAAA7C,IAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,CACA,oEAIA,IAAAD,EAAA,GACA,IACMA,EAAAyC,EAAAE,MAAA,EAAA3C,EAAA6C,IAAA7C,EAAA6C,EAAApC,OAAA,KACN,OAAA9R,EAAA,CACA,OAAAqR,EAAAC,GAYA,KAAAwC,MAAA,CAAAA,EAYA,KAAAC,cAAA,GAAAA,CAAA,CAIAjC,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA,IACAA,EAAA,KAAAyC,MAAA,CAAAE,MAAA,EAAA3C,EAAA6C,IAAA,CACA,IAAAC,EAAAD,EAAApC,OAAA,CAAAH,EAAAC,GAEO,OADPA,GAAAuC,EACO9C,EAAA8C,CACD,IACN,OAAAnU,EAAA,CACA,uCAEA,OAAAqR,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CAKA,GAJApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAAC,EAAA,EAEAA,GAAAsC,EAAApC,OAAA,CAAAH,EAAAC,GACA,KAAAmC,cAAA,EACApC,EAAA9X,MAAA,GAAA+X,EACA,MAGA,OAAAwC,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAyC,EAAAzC,EACA0C,EAAA,EACAC,EAAA,EACA,QAAAL,KAAA,KAAAJ,MAAA,EACA,IAAAzC,EAAA6C,EAAA7C,IAAA,CAEA,GADAkD,EAAA,EAAAlD,EAAAA,EAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,IACAD,EAAAL,EAAA5Z,MAAA,CAAAka,EAAA7C,EAAAC,GACA,EAAAP,GAGAA,CAAAA,EAAA6C,EAAApC,OAAA,CAAAH,EAAAC,EAAA,EAGA,GACAA,EACAA,GAAAP,CACA,CAKA,SAAAkD,EAAAF,CAAA,CAIApC,UAAAC,CAAA,EACA,IAAAkC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,EAAAY,EAAArY,MAAA,EACAua,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAAY,EAAAuC,KAAA,IAGA,OAAAL,CAAA,CAWAM,UAAApD,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAeAS,SAAArD,CAAA,EACA,oBAAAA,EACA,2CAEA,IAAAM,EAAA,EACA,QAAAsC,KAAA,KAAAJ,MAAA,EACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAAM,CACA,CACA,EAAAsC,EAAA7C,IAAA,CACQO,EAAA,GACR,GAAAA,GACAA,CAAAA,GAAAsC,EAAA7C,IAAA,CAEA,CACA,EAiBA,MAAAuD,GACAha,YAAa0W,CAAA,EAKb,KAAAA,QAAA,CAAAA,CAAA,CAOAI,QAAA,CACA,8CAOApX,QAAA,CACA,8CACA,CAoBA,MAAAua,WAAAD,GACAha,YAAA6X,CAAA,CAAAnB,CAAA,EACA,kBAAAgB,IACAG,EAAAF,OAAA,IACA,qEAEA,MAAAjB,GAAAmB,EAAAnB,QAAA,aAKA,KAAAmB,MAAA,CAAAA,CAAA,CAIAf,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EACA,EA8DA,MAAAkD,WAAA1D,GACAxW,YAAAma,CAAA,CAAAC,CAAA,CAAA1D,CAAA,EACA,IAAA2D,EAAA,aAAAvC,IACAqC,aAAApC,GACA,GAAAsC,EACMF,EAAA,IAAAF,GAAA,IAAArC,GAAAuC,SACN,gBAAAzC,IACAyC,EAAAxC,OAAA,GACMwC,EAAA,IAAAF,GAAAE,QACN,IAAAA,CAAAA,aAAAH,EAAA,EACA,mFACA,CAKA,GAHAlY,KAAAA,IAAAsY,GACAA,CAAAA,EAAA,MAEA,SAAAA,GACAA,aAAA5D,EAAA,EACA,0DAEA,UAAA4D,EAAA,CACA,KAAAA,EAAA3D,IAAA,CACA,0DAEA3U,IAAAsY,EAAA1D,QAAA,EACA0D,CAAAA,EAAAA,EAAAjD,SAAA,YACA,KAOAV,EAAA,GACA2D,GAEA,GADA3D,CAAAA,EAAA2D,EAAA3D,IAAA,GACA4D,GACA5D,CAAAA,GAAA0D,EAAAtC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAUA,KAAA4D,aAAA,CAAAH,EAOA,KAAAI,uBAAA,CAAAF,EASA,KAAAD,aAAA,CAAAA,EAYA,KAAAI,QAAA,IAGA,IAAAC,EAAA,KAAAC,uBAAA,CAAAC,IAAA,MAgBA,MAAAC,gBAAA,UAAA3D,CAAA,EACA,OAAAwD,EAAAxD,EAAA,EAgBA,KAAA4D,sBAAA,UAAAC,CAAA,EACAL,EAAAK,EAAAH,IAAA,MACA,EAIAzD,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAKA,IAAA+D,EAAA,KAAAC,UAAA,CAAAjE,EAAAC,GACA,IAAA+D,EACA,iEAEA,OAAAA,EAAA7D,OAAA,CAAAH,EAAAC,EAAA,CAgCA0D,wBAAAzD,CAAA,EACA,GAAAA,EAAAxK,cAAA,MAAA6N,aAAA,CAAA5D,QAAA,GACA,QAAA0D,aAAA,EACAnD,EAAAxK,cAAA,MAAA2N,aAAA,CAAA1D,QAAA,EACA,MACA,CACA,IAAAqE,EAAA,KAAAP,QAAA,CAAAvD,CAAA,MAAAqD,aAAA,CAAA5D,QAAA,GACA,GAAAqE,GACA,EAAAA,EAAAlD,MAAA,EACAZ,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,GACA,OAAAqE,CACM,MAEN,QAAAE,KAAA,KAAAT,QAAA,EACA,IAAAO,EAAA,KAAAP,QAAA,CAAAS,EAAA,CACA,GAAAhE,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,EACA,OAAAqE,CACA,CAEA,MACA,qCASAjE,OAAAC,CAAA,CAAAC,CAAA,MAIAwC,CAHA1X,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAGA,IAAAkE,EAAA,KAAAZ,aAAA,CACAH,EAAAe,EAAApE,MAAA,CAAAC,EAAAC,GACAmE,EAAA,KAAAX,QAAA,CAAAL,EAAA,CACA,GAAArY,KAAAA,IAAAqZ,EAAA,CACA,IAAAC,EAAA,EACAD,EAAA,KAAAf,aAAA,CACA,KAAAG,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAGA+C,CADAA,EAAA,KAAA3C,qBAAA,GACA,CAAAqE,EAAAxE,QAAA,EAAAyD,EACMX,CAAA,CAAA2B,EAAAzE,QAAA,OAAA0D,aAAA,CAAAtD,MAAA,CAAAC,EAAAC,EAAAoE,EACN,MACA5B,EAAA2B,EAAArE,MAAA,CAAAC,EAAAC,EACA,CACA,OAAAwC,CAAA,CASA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA+D,EAAA,KAAAH,gBAAA,CAAA3D,GACA,GAAAnV,KAAAA,IAAAiZ,EAAA,CACA,IAAAG,EAAA,KAAAZ,aAAA,CACAa,EAAA,KAAAf,aAAA,CACAgB,EAAA,EAKA,OAJA,KAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAEAyE,EAAAxb,MAAA,CAAAuX,CAAA,CAAAiE,EAAAxE,QAAA,EAAAK,EAAAC,GACAoE,EAAAD,EAAAzb,MAAA,CAAAuX,CAAA,CAAAkE,EAAAzE,QAAA,EAAAK,EACAC,EAAAoE,EACA,QACAL,EAAArb,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,CAgBAqE,WAAAC,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAU,EAAA,IAAAmE,GAAA,KAAAD,EAAAzD,EAAAnB,GAEA,OADA,KAAA8D,QAAA,CAAAc,EAAA,CAAAlE,EACAA,CAAA,CAiBA4D,WAAAQ,CAAA,CAAAxE,CAAA,EACA,IAAAsE,EAAAE,EAOA,OANA4E,EAAA3hB,MAAA,CAAAgd,QAAA,CAAAD,KACA1Z,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAsE,EAAA,KAAAhB,aAAA,CAAAxD,MAAA,CAAA0E,EAAAxE,IAEA,KAAAwD,QAAA,CAAAc,EAAA,CACA,CAgCA,MAAAC,WAAA/E,GACAxW,YAAA0b,CAAA,CAAAJ,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAgF,CAAAA,aAAAxB,EAAA,EACA,yCAEA,IAAAvD,OAAAC,SAAA,CAAA0E,IAAA,EAAAA,EACA,4DAOA,GALA,iBAAAzD,GACA/V,KAAAA,IAAA4U,IACAA,EAAAmB,EACAA,EAAA,MAEAA,EAAA,CACA,IAAAA,CAAAA,aAAArB,EAAA,EACA,2CAEA,UAAAkF,EAAAtB,aAAA,EACA,GAAAvC,EAAApB,IAAA,EACAoB,EAAApB,IAAA,CAAAiF,EAAAtB,aAAA,CAAA3D,IAAA,CACA,6DAEA,oBAAAC,EACA,uDAEA,IACAD,EAAAiF,EAAAjF,IAAA,CACA,EAAAiF,EAAAjF,IAAA,EAEA,GADAA,CAAAA,EAAAoB,EAAAA,EAAApB,IAAA,KACAiF,EAAAnB,uBAAA,EACA9D,CAAAA,GAAAiF,EAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAgF,KAAA,CAAAA,EAKA,KAAAJ,OAAA,CAAAA,EAOA,KAAAzD,MAAA,CAAAA,GAAA,KAIAX,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CAGA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAKA,OAJA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA2E,EAAA,KAAAvD,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,EAAA,CAIAtE,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,GAIA,GAHA/U,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,YAAA0E,KAAA,CAAAV,UAAA,CAAAjE,EAAAC,GACA,gCAEA,IAAAoE,EAAA,EAWA,OAVA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,CACM2B,CAAA,MAAA9C,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAAoE,GACN,KAAA1E,QAAA,CACM8C,CAAA,MAAA9C,QAAA,KACN,KAAAgF,KAAA,CAAAnB,uBAAA,EACAf,CAAAA,CAAA,MAAAkC,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAEA9B,CAAA,CAIA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAIA,GAHA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,EACA,CAAAZ,EAAAxK,cAAA,MAAAiK,QAAA,EACA,+CAAAA,QAAA,EAEA,KAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAvE,EAAAC,GACA,IAAAP,EAAA2E,EACA,QAAAvD,MAAA,GACA,KAAAA,MAAA,CAAAnY,MAAA,CAAAuX,CAAA,MAAAP,QAAA,EAAAK,EAAAC,EAAAoE,GACA3E,GAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,GACA,QAAAM,KAAA,CAAAjF,IAAA,EACAA,EAAA,KAAAiF,KAAA,CAAAjF,IAAA,EACA,yDAGA,OAAAA,CAAA,CAKAY,UAAAC,CAAA,EACA,QAAAO,MAAA,CACA,YAAAA,MAAA,CAAAR,SAAA,CAAAC,EACA,CACA,CASA,SAAAwmF,GAAAh7F,CAAA,EAIA,OAHA,EAAAA,GACAA,CAAAA,GAAA,YAEAA,CAAA,CAkCA,MAAA83F,WAAApkF,GACAxW,YAAA+9F,CAAA,CAAAC,CAAA,CAAAtnF,CAAA,EACA,kBAAAoB,IACAimF,aAAAhmF,EAAA,EACA,wDAOA,GALA,iBAAAimF,GACAl8F,KAAAA,IAAA4U,IACAA,EAAAsnF,EACAA,EAAAl8F,KAAAA,GAEA,EAAAi8F,EAAAtnF,IAAA,CACA,+CACA,MAAAsnF,EAAAtnF,IAAA,CAAAC,GAKA,KAAAqnF,IAAA,CAAAA,EASA,KAAAC,GAAA,GAAAA,EAQA,KAAA9kF,MAAA,IAMA,IAAAzY,EAAA,CACA,MAAAw9F,eAAA,UAAAn7F,CAAA,EAEA,OADArC,EAAAq9F,GAAAh7F,GACA,MAEA,KAAAo7F,eAAA,YACA,OAAAz9F,CACA,EAIAqW,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,EACA/U,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAvW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAArW,EAAA,EAGA,OAAA+Y,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAvW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACA,GAAApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,GACAN,EAAA5Z,MAAA,CAAAka,EAEA,QAEA,KAAAmkF,IAAA,CAAAr+F,MAAA,MAAAw+F,eAAA,GAAAnnF,EAAAC,EAAA,CAYAmnF,SAAAvC,CAAA,CAAAllF,CAAA,EACA,IAAA0nF,EAAA,IAAAzD,GAAA,KAAAiB,EAAAllF,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CAAA,CAUAC,WAAA3nF,CAAA,EAGA,IAAA0nF,EAAA,IAAAliB,GAAA,KAAAxlE,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CAAA,CAWAE,SAAA5nF,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAEA,CAuBA,MAAAqhF,GACA36F,YAAA8sB,CAAA,CAAA8uE,CAAA,CAAAllF,CAAA,EACA,IAAAoW,CAAAA,aAAA8tE,EAAA,EACA,oDAEA,IAAAjkF,OAAAC,SAAA,CAAAglF,IAAA,GAAAA,EACA,iDAEA,IAAA2C,EAAA,EAAAzxE,EAAArW,IAAA,CACA+nF,EAAA1xE,EAAA5T,MAAA,CAAAE,MAAA,EAAAqlF,EAAAnlF,IAAAmlF,EAAAnlF,EAAAsiF,IAAA,IACA,KAAA4C,EAAAD,EACA,iDACAA,CAAAA,EAAAC,CAAA,SACAD,EAAA,YAIA,KAAAzxE,SAAA,CAAAA,EAGA,KAAA8uE,IAAA,CAAAA,EAQA,KAAA8C,SAAA,KAAuB9C,CAAA,IACvB,KAAAA,GACA,MAAA8C,SAAA,aAMA,KAAAnvD,KAAA,CAAAivD,EACA,KAAA1xE,SAAA,CAAAkxE,GAAA,EACA,MAAAzuD,KAAA,CAAAgvD,EAAAC,EAAA5C,CAAA,EAIA,KAAA+C,QAAA,CAAAb,GAAA,KAAAY,SAAA,OAAAnvD,KAAA,EAaA,KAAA74B,QAAA,CAAAA,CAAA,CAKAI,QAAA,CACA,IAAAinF,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,GAAAC,EAAA,KAAAY,QAAA,EACAl+F,EAAAm+F,IAAA,KAAArvD,KAAA,CACA,OAAA9uC,CAAA,CAQAf,OAAAe,CAAA,EACA,IAAAkW,OAAAC,SAAA,CAAAnW,IACAA,IAAAq9F,GAAAr9F,EAAA,KAAAi+F,SAAA,EACA,gBAAAlnF,GAAA,wBACA,6CAAAknF,SAAA,EAEA,IAAAX,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,GAAAr9F,GAAA,KAAA8uC,KAAA,EACA,KAAAziB,SAAA,CAAAmxE,eAAA,CAAAH,GAAAC,EAAA,MAAAY,QAAA,EACAC,EACA,EAoBA,MAAA1iB,WAAAye,GACA36F,YAAA8sB,CAAA,CAAApW,CAAA,EACA,MAAAoW,EAAA,EAAApW,EAAA,CAMAI,OAAAC,CAAA,CAAAC,CAAA,EACA,QAAA2jF,GAAAnuF,SAAA,CAAAsK,MAAA,CAAApK,IAAA,MAAAqK,EAAAC,EAAA,CAIAtX,OAAAe,CAAA,EAKA,MAJA,kBAAAA,GAEAA,CAAAA,EAAA,CAAAA,CAAA,EAEAk6F,GAAAnuF,SAAA,CAAA9M,MAAA,CAAAgN,IAAA,MAAAjM,EACA,CACA,CAiBA,MAAA6c,WAAA9G,GACAxW,YAAAf,CAAA,CAAAyX,CAAA,EACA,kBAAAgB,IAAAzY,EAAA0Y,OAAA,IACAhB,OAAAC,SAAA,CAAA3X,IAAA,GAAAA,CAAA,EACA,wFACA,CAGA,IAAAwX,EAAA,GACAxX,aAAAyY,IACAjB,CAAAA,EAAAxX,CAAA,EACA,MAAAwX,EAAAC,GAQA,KAAAzX,MAAA,CAAAA,CAAA,CAIAiY,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAP,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,CAQA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAxX,MAAA,CAIA,GAHA,KAAAA,MAAA,YAAAyY,IACAjB,CAAAA,EAAAQ,EAAAhY,MAAA,EAEA,CAAAmhB,CAAAA,EAAA3hB,MAAA,CAAAgd,QAAA,CAAAxE,IACAR,IAAAQ,EAAAhY,MAAA,EACA,gBAAAuY,GAAA,oBACA,qBAAAf,EAAA,mBAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAMA,OAJA8X,EAAA6E,KAAA,CAAA3E,EAAAjQ,QAAA,QAAAgQ,EAAAP,EAAA,OACA,KAAAxX,MAAA,YAAAyY,IACA,KAAAzY,MAAA,CAAAS,MAAA,CAAA+W,EAAAM,EAAAC,GAEAP,CACA,EAgBA,MAAAikF,WAAAlkF,GACAxW,YAAA0W,CAAA,EACA,SAAAA,EAAA,CAIAQ,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAoJ,EAAA3hB,MAAA,CAAAgd,QAAA,CAAA1E,GACA,2CAEAjV,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA7Q,EAAA6Q,EACA,OAAAD,EAAA9X,MAAA,MAAA8X,CAAA,CAAA5Q,EAAA,EACAA,GAAA,EAEA,SAAAA,EAAA6Q,CAAA,CAIAF,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA1X,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,OAAAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,GAAAzP,QAAA,UAIAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAKA,iBAAAC,GACAA,CAAAA,EAAAA,EAAAjQ,QAAA,IAEA,IAAA83F,EAAA,IAAA1+E,EAAA3hB,MAAA,CAAAwY,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,KAAAwX,EAAAM,EAAA9X,MAAA,CACA,6CAIA,OAFA6/F,EAAAl5E,IAAA,CAAA7O,EAAAC,GACAD,CAAA,CAAAC,EAAAP,EAAA,GACAA,EAAA,CACA,EAsBA,MAAAgkF,WAAAjkF,GACAxW,YAAA+1E,CAAA,CAAAr/D,CAAA,EAMA,GALA,iBAAAq/D,GACAj0E,KAAAA,IAAA4U,IACAA,EAAAq/D,EACAA,EAAAj0E,KAAAA,GAEAA,KAAAA,IAAAi0E,EACMA,EAAA,QACN,IAAAp/D,OAAAC,SAAA,CAAAm/D,GACA,8CAEA,SAAAr/D,GAWA,KAAAq/D,OAAA,CAAAA,CAAA,CAIA7+D,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAoJ,EAAA3hB,MAAA,CAAAgd,QAAA,CAAA1E,GACA,sCAKA,OAHAjV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA9X,MAAA,CAAA+X,CAAA,CAIAF,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA1X,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,WAAA++D,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,OAAAM,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,GAAAzP,QAAA,UAIAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAKA,iBAAAC,GACAA,CAAAA,EAAAA,EAAAjQ,QAAA,IAEA,IAAA83F,EAAA,IAAA1+E,EAAA3hB,MAAA,CAAAwY,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,WAAA82E,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAGA,OADA6/F,EAAAl5E,IAAA,CAAA7O,EAAAC,GACAP,CACA,EAsBA,MAAA+jF,WAAAhkF,GACAxW,YAAAS,CAAA,CAAAiW,CAAA,UAAAA,GAYA,KAAAjW,KAAA,CAAAA,CAAA,CAIAqW,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA,YAAA/Y,KAAA,CAIAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAEA,QACA,EAGA45F,GAAAl5F,cAAA,CAAAA,GACAk5F,GAAAtV,WAAA,CAAAA,GACAsV,GAAAh5F,YAAA,CAAAA,GACAg5F,GAAA94F,IAAA,CAAAA,GACA84F,GAAA74F,MAAA,CAAAA,GACA64F,GAAAvV,GAAA,CAAAA,GACAuV,GAAAxV,KAAA,CAAAA,GACAwV,GAAA3V,KAAA,CAAAA,GACA2V,GAAA5V,OAAA,CAAAA,GACA4V,GAAA7V,MAAA,CAAAA,GACA6V,GAAA9V,QAAA,CAAAA,GACA8V,GAAA/V,QAAA,CAAAA,GACA+V,GAAA33F,SAAA,CAAAA,GACA23F,GAAA52F,kBAAA,CAAAA,GACA42F,GAAA32F,wBAAA,CAAAA,GACA22F,GAAA12F,KAAA,CAAAA,GACA02F,GAAAr1F,aAAA,CAAAA,GACAq1F,GAAAhW,YAAA,CAAAA,GACAgW,GAAAjW,QAAA,CAAAA,GACAiW,GAAA10B,OAAA,CAAAA,GACA00B,GAAAtzF,IAAA,CAAAA,GACAszF,GAAAlW,OAAA,CAAAA,GACAkW,GAAAnW,IAAA,CAAAA,GAAAmW,GAAApW,QAAA,CAAAA,GAGAoW,GAAArW,MAAA,EAAAoC,EAAAjmF,IAAA,IAAA4kF,GAAAqB,EAAAjmF,GAGAk6F,GAAA55F,MAAA,EAAAa,EAAAb,EAAAN,IAAA,IAAAkB,GAAAC,EAAAb,EAAAN,GAIA,IAAAmF,GAAA+0F,GAAA/0F,EAAA,CAAAnF,GAAA,IAAAoB,GAAA,EAAApB,EAIAk6F,CAAAA,GAAAlnF,GAAA,CAAAhT,GAAA,IAAAoB,GAAA,EAAApB,GAIAk6F,GAAAtW,GAAA,CAAA5jF,GAAA,IAAAoB,GAAA,EAAApB,GAIA,IAAAoF,GAAA80F,GAAA90F,GAAA,CAAApF,GAAA,IAAAoB,GAAA,EAAApB,EAIAk6F,CAAAA,GAAAvW,GAAA,CAAA3jF,GAAA,IAAAoB,GAAA,EAAApB,GAIAk6F,GAAAxW,GAAA,CAAA1jF,GAAA,IAAAoB,GAAA,EAAApB,GAIAk6F,GAAA70F,IAAA,CAAArF,GAAA,IAAAgC,GAAAhC,GAIAk6F,GAAAzW,KAAA,CAAAzjF,GAAA,IAAAqB,GAAA,EAAArB,GAIAk6F,GAAA1W,KAAA,CAAAxjF,GAAA,IAAAqB,GAAA,EAAArB,GAIAk6F,GAAA3W,KAAA,CAAAvjF,GAAA,IAAAqB,GAAA,EAAArB,GAIAk6F,GAAA5W,KAAA,CAAAtjF,GAAA,IAAAqB,GAAA,EAAArB,GAIAk6F,GAAA7W,KAAA,CAAArjF,GAAA,IAAAqB,GAAA,EAAArB,GAIAk6F,GAAA9W,MAAA,CAAApjF,GAAA,IAAAykF,GAAAzkF,GAIAk6F,GAAA5mF,EAAA,CAAAtT,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAA3mF,GAAA,CAAAvT,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAArU,GAAA,CAAA7lF,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAA1mF,GAAA,CAAAxT,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAAtU,GAAA,CAAA5lF,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAAvU,GAAA,CAAA3lF,GAAA,IAAA2kF,GAAA,EAAA3kF,GAIAk6F,GAAA50F,IAAA,CAAAtF,GAAA,IAAAoC,GAAApC,GAIAk6F,GAAAxU,KAAA,CAAA1lF,GAAA,IAAA0kF,GAAA,EAAA1kF,GAIAk6F,GAAAzU,KAAA,CAAAzlF,GAAA,IAAA0kF,GAAA,EAAA1kF,GAIAk6F,GAAA1U,KAAA,CAAAxlF,GAAA,IAAA0kF,GAAA,EAAA1kF,GAIAk6F,GAAA3U,KAAA,CAAAvlF,GAAA,IAAA0kF,GAAA,EAAA1kF,GAIAk6F,GAAA5U,KAAA,CAAAtlF,GAAA,IAAA0kF,GAAA,EAAA1kF,GAIAk6F,GAAA7U,MAAA,CAAArlF,GAAA,IAAAwkF,GAAAxkF,GAGAk6F,GAAArnF,GAAA,CAAA7S,GAAA,IAAAukF,GAAAvkF,GAGAk6F,GAAA9U,KAAA,CAAAplF,GAAA,IAAAskF,GAAAtkF,GAGAk6F,GAAAtnF,GAAA,CAAA5S,GAAA,IAAAqkF,GAAArkF,GAGAk6F,GAAA/U,KAAA,CAAAnlF,GAAA,IAAAokF,GAAApkF,GAGA,IAAA/W,GAAAixG,GAAAjxG,MAAA,EAAAuZ,EAAAxC,EAAAyC,IAAA,IAAAF,GAAAC,EAAAxC,EAAAyC,EAGAy3F,CAAAA,GAAAhV,IAAA,EAAAmC,EAAAC,EAAAtnF,IAAA,IAAAkkF,GAAAmD,EAAAC,EAAAtnF,GAGAk6F,GAAA/lF,GAAA,EAAAD,EAAA0F,EAAA5Z,IAAA,IAAAmkF,GAAAjwE,EAAA0F,EAAA5Z,GAGAk6F,GAAAl1F,KAAA,EAAAvB,EAAAC,EAAA1D,IAAA,IAAAwD,GAAAC,EAAAC,EAAA1D,GAGAk6F,GAAAjV,wBAAA,EAAA9jF,EAAAnB,IAAA,IAAAuD,GAAApC,EAAAnB,GAGA,IAAAuF,GAAA20F,GAAA30F,IAAA,EAAAhd,EAAAyX,IAAA,IAAA4G,GAAAre,EAAAyX,EAGAk6F,CAAAA,GAAAlV,IAAA,CAAAhlF,GAAA,IAAAgkF,GAAAhkF,GAGAk6F,GAAAphD,IAAA,EAAAumB,EAAAr/D,IAAA,IAAA+jF,GAAA1kB,EAAAr/D,GAGAk6F,GAAAC,KAAA,EAAApwG,EAAAiW,IAAA,IAAA8jF,GAAA/5F,EAAAiW,GAQA,IAAA9W,GAAA,CAAA8W,EAAA,cACAuF,GAAA,GAAAvF,GAMAyO,GAAA,CAAAzO,EAAA,WACAuF,GAAA,EAAAvF,GAIA,SAASo6F,GAAAC,CAAA,CAAAprG,CAAA,CAAAU,CAA2B,IAAAC,CAAA,EACpC,SAAAg5F,EAAAwR,yBAAA,EAAAnrG,EAAAU,EAAAC,EAAA,CACGuF,cAAA,EACH,GAGA,IAAAkxC,GAAA,IAAAuiD,EAAwCziF,SAAA,gDACxCsnC,GAAA,IAAAm7C,EAAAziF,SAAA,iDACAm0F,GAAA,yBACAC,GAAA,wBAOA,SAAAC,GAAAtxG,CAAA,EACA,OAAAwgB,EAAA3hB,MAAA,CAAA2d,IAAA,CAAAxc,EAAAkd,QAAA,GACA,CAMA,MAAAmI,WAAAo6E,IAIAviF,UAAA,CACA,IAAAjf,EAAA,MAAA2nB,OAAA,GAAAC,OAAA,GAAA1O,EAAAqJ,EAAA3hB,MAAA,CAAA2d,IAAA,CAAAve,GAGA,GAAAkZ,IAAAA,EAAA9X,MAAA,CACA,OAAA8X,CAAA,CAGApT,GAAAoT,EAAA9X,MAAA,oBACA,IAAAymB,EAAAtF,EAAA3hB,MAAA,CAAAknB,KAAA,IAEA,OADA5O,EAAA6O,IAAA,CAAAF,GACAA,CACA,CAMA,OAAAL,WAAAjF,CAAA,EAEA,OADAzc,GAAAyc,IAAAA,EAAAnhB,MAAA,yBAAuD,EAAAmhB,EAAAnhB,MAAe,IACtE,IAAAgmB,GAAA,IAAA7E,EAAA,CAAAqF,OAAA,GAAAvmB,GAAA,CAAAmF,GAAA,KAAAA,EAAA2C,QAAA,OAAA3H,KAAA,MAAAmB,IAAA,SAEA,CAGA,SAAA2wG,GAAAC,CAAA,EACA,oBAAAA,CAAA,CAGA,IAAAC,GAAA,CACAC,WAAA,EACAC,cAAA,EACAC,aAAA,EACAC,aAAG,GAGHt0D,GAAA,IAAAmiD,EAAAziF,SAAA,gDAKAupC,GAAAzmD,GAAA,CAAAmc,GAAA,uBAAAlc,GAAA,iBAAAulB,GAAA,UAAAtJ,GAAA,YAAAA,GAAA,iBAAAC,GAAA,yBAAAlc,GAAA,qBASAi9C,GAAAl9C,GAAA,CAAAC,GAAA,QAAAA,GAAA,SAAAulB,GAAA,UAAArJ,GAAA,kBAAAlc,GAAA,YAAAic,GAAA,SAAAC,GAAA,kBAAAqJ,GAAA,YAAAA,GAAA,mBAAArJ,GAAA,wBAAAlc,GAAA,oBASA8xG,GAAA/xG,GAAA,CAAAkc,GAAA,KAAAA,GAAA,KAAAA,GAAA,kBAAAjc,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,WAAAA,GAAA,YAAAA,GAAA,aAKA,OAAAq9C,GA6BAj9C,YAAI2F,CAAe,CAAA/F,CAAA,CAAAk9C,CAAA,CAAA32B,CAAA,EAAA+4E,EAAA,0BAEAA,EAAA,yBAEAA,EAAA,yBAEAA,EAAA,mCAEAA,EAAA,qBAGnBp+F,OAAAC,MAAA,OACA4E,WAAAA,EACA/F,UAAAA,EACAk9C,UAAAA,EACA32B,MAAAA,EAEKwrF,oBAAAxtD,EACL,EACA,CAQA,aAAAg/B,+BAAAx9E,CAAA,EACA,aAAAA,EAAA05D,iCAAA,CAAAjZ,GAAA3vC,IAAA,CACA,CAQA,aAAA8rE,kCAAA58E,CAAA,EACA,aAAAA,EAAA05D,iCAAA,CAAAxiB,GAAApmC,IAAA,CACA,CAQA,aAAAm7F,mCAAAjsG,CAAA,EACA,aAAAA,EAAA05D,iCAAA,CAAAqyC,GAAAj7F,IAAA,CACA,CAcA,aAAA8pE,WAAwB56E,CAAA,CAAAwgB,CAAA,CAAAmgC,CAAgB,CAAAK,CAAA,CAAAF,CAAA,CAAA3J,CAAA,EACxC,IAAAqoC,EAAAma,EAAAh5E,OAAA,CAAAs6D,QAAA,GAAkF5wD,EAAA,IAAAitB,GAAAt3C,EAAAw/E,EAAAvlF,SAAA,CAAAk9C,EAAA32B,GAGlF0rF,EAAA,MAA4B50D,GAAAkmC,8BAAW,CAAAx9E,GACvCU,EAAoB,IAAAi5F,EAAA/0C,WAAA,CAWpB,OAVAlkD,EAAA/C,GAAA,CAAAg8F,EAAA9iD,aAAA,CAAAC,aAAA,EACAC,WAAAv2B,EAAAvmB,SAAA,CACA+8C,iBAAAwoC,EAAAvlF,SAAA,CACAgJ,SAAAipG,EACAj1D,MAAAwJ,GAAA3vC,IAAA,CACKqmC,UAAAA,CACL,IAAkIz2C,EAAA/C,GAAA,CAAA25C,GAAA6jC,yBAAA,CAAAhkC,EAAAqoC,EAAAvlF,SAAA,CAAA6mD,EAAAH,EAAAK,IAGlI,MAAAmqD,GAAA,mCAAAnrG,EAAAU,EAAA8f,EAAAg/D,GACAn1D,CACA,CAWA,MAAAysB,cAAA9zC,CAAA,EAEA,IAAAkpG,EAAuB,MAAA50D,GAAAslC,iCAAgB,MAAA58E,UAAA,EACvCmsG,EAAAxS,EAA4Bh5E,OAAA,CAAAs6D,QAAW,GACvCv6E,EAAoB,IAAAi5F,EAAA/0C,WAAA,CACpBlkD,EAAA/C,GAAA,CAAAg8F,EAAA9iD,aAAA,CAAAC,aAAA,EACAC,WAAA,KAAAv2B,KAAA,CAAAvmB,SAAA,CACA+8C,iBAAAm1D,EAAAlyG,SAAA,CACAgJ,SAAAipG,EACAj1D,MAAAC,GAAApmC,IAAA,CACKqmC,UAAA,KAAAA,SAAA,IAEL,IAAAi1D,EAAA,KAAAnyG,SAAA,CAIA,OAJqHyG,EAAA/C,GAAA,CAAA25C,GAAAC,4BAAA,MAAAJ,SAAA,CAAAi1D,EAAAD,EAAAlyG,SAAA,CAAA+I,IAGrH,MAAAmoG,GAAA,2CAAAnrG,UAAA,CAAAU,EAAA,KAAA8f,KAAA,CAAA2rF,GACAA,EAAAlyG,SAAA,CAYA,MAAAoyG,6BAAArpG,CAAA,EACA,IAAA2zD,EAAA,MAAArf,GAAAoH,yBAAA,MAAAstD,mBAAA,MAAA70D,SAAA,MAAAl9C,SAAA,CAAA+I,GACA,YAAAspG,oCAAA,CAAAtpG,EAAA2zD,EAAA,CAGA,MAAA21C,qCAAAtpG,CAAA,CAAA2zD,CAAA,EAEA,OADA,MAAAw0C,GAAA,oCAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAiH,uCAAA,MAAAytD,mBAAA,MAAA70D,SAAA,MAAAl9C,SAAA,CAAA08D,EAAA3zD,EAAA,KAAAwd,KAAA,CAAAvmB,SAAA,QAAAumB,KAAA,EACAm2C,CACA,CAWA,MAAA41C,iCAAAvpG,CAAA,EACA,IAAA2zD,EAAA,MAAArf,GAAAoH,yBAAA,MAAAstD,mBAAA,MAAA70D,SAAA,MAAAl9C,SAAA,CAAA+I,GAIA,IACM,kBAAA08C,cAAA,CAAAiX,EACN,OAAA7zD,EAAA,CAKA,GAAAA,EAAArI,OAAA,GAAA4wG,IAAAvoG,EAAArI,OAAA,GAAA6wG,GAAA,CAGA,IACU,WAAAgB,oCAAmC,CAAAtpG,EAAA2zD,EAC7C,OAAA7zD,EAAA,CAEU,CAIF,kBAAA48C,cAAA,CAAAiX,EACR,CAEA,MADA7zD,CAAA,CAGA,CAkBA,aAAA0pG,2BAAAxsG,CAAA,CAAAm3C,CAAA,CAAAn0C,CAAA,CAAAwd,CAAA,CAAA+hC,CAAA,EACqF,IAAA2pD,EAAA,MAAA50D,GAAAslC,iCAAA,CAAA58E,GAGrFmsG,EAAAxS,EAA4Bh5E,OAAA,CAAAs6D,QAAW,GACvCv6E,EAAoB,IAAAi5F,EAAA/0C,WAAA,CAoBpB,OAnBAlkD,EAAA/C,GAAA,CAAAg8F,EAAA9iD,aAAA,CAAAC,aAAA,EACAC,WAAAv2B,EAAAvmB,SAAA,CACA+8C,iBAAAm1D,EAAAlyG,SAAA,CACAgJ,SAAAipG,EACAj1D,MAAAC,GAAApmC,IAAA,CACKqmC,UAAAA,CAAI,IAGTz2C,EAAA/C,GAAA,CAAAg8F,EAAA9iD,aAAA,CAAA4L,QAAA,EACA1L,WAAAv2B,EAAAvmB,SAAA,CACAyoD,SAAAypD,EAAAlyG,SAAA,CACKgJ,SAAIs/C,CACT,IAG8G7hD,EAAA/C,GAAA,CAAA25C,GAAAC,4BAAA,CAAAJ,EAAAK,GAAA20D,EAAAlyG,SAAA,CAAA+I,IAG9G,MAAAmoG,GAAA,iDAAAnrG,EAAAU,EAAA8f,EAAA2rF,GACAA,EAAAlyG,SAAA,CAaA,MAAAwyG,eAAAlqF,CAAA,CAAA5hB,CAA4B,EAAoB,IAAA+rG,EAAA/S,EAAAh5E,OAAA,CAAAs6D,QAAA,GAGhDixB,EAAA,MAA4B50D,GAAA20D,kCAAW,MAAAjsG,UAAA,EACvCU,EAAoB,IAAAi5F,EAAA/0C,WAAA,CACpBlkD,EAAA/C,GAAA,CAAAg8F,EAAA9iD,aAAA,CAAAC,aAAA,EACAC,WAAA,KAAAv2B,KAAA,CAAAvmB,SAAA,CACA+8C,iBAAA01D,EAAAzyG,SAAA,CACAgJ,SAAAipG,EACAj1D,MAAA80D,GAAAj7F,IAAA,CACKqmC,UAAI,KAAAA,SAAA,IAGT,IAAA/3C,EAAA,EACA2/C,OAAA2tD,EAAAzyG,SAAA,CACA+kD,SAAA,GACKC,WAAA,EACL,GACAF,OAAA46C,EAAAv9B,kBAAA,CACApd,SAAA,GACKC,WAAA,EACL,GACAt+C,EAAA4E,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EACA46C,SAAA,GACKC,WAAA,EACL,IACA,IAAA0tD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAA,GAAA,OACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EAaA,OAZA67F,EAAA5yG,MAAA,EACAgqD,YAAA,EAEKxhC,EAAAA,CACL,EAAAzoB,GACA4G,EAAA/C,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CAAG,GAGR,MAAAqxG,GAAA,4CAAAnrG,UAAA,CAAAU,EAAA,KAAA8f,KAAA,CAAAksF,GACAA,EAAAzyG,SAAA,CAOA,MAAAqgF,aAAA,KAAAr9C,EAAA,WAAAj9B,UAAA,CAAA0/C,cAAA,MAAAzlD,SAAA,EAGA,GAAAgjC,IAAA,GAAAA,EACA,2CAGA,IAAAA,EAAAj6B,KAAA,CAAAu6C,MAAA,MAAApG,SAAA,EACA,mCAAAt7C,KAAAC,SAAA,CAAAmhC,EAAAj6B,KAAA,KAGA,GAAAi6B,EAAAnjC,IAAA,CAAAR,MAAA,EAAAmnD,GAAA3vC,IAAA,CACA,iCAGA,IAAAhX,EAAA2gB,EAAA3hB,MAAA,CAAA2d,IAAA,CAAAwmB,EAAAnjC,IAAA,EAAA4mD,EAAAD,GAAAtvC,MAAA,CAAArX,GAkBA,OAfA4mD,IAAAA,EAAAE,mBAAA,CACMF,EAAAC,aAAA,MAEND,EAAAC,aAAA,KAAAg5C,EAAAziF,SAAA,CAAAwpC,EAAAC,aAAA,EAGAD,EAAAG,MAAA,CAAAvhC,GAAAI,UAAA,CAAAghC,EAAAG,MAAA,EAAAH,EAAAK,aAAA,CAAAL,GAAAA,EAAAK,aAAA,CAGAL,IAAAA,EAAAO,qBAAA,CACMP,EAAAM,eAAA,MAENN,EAAAM,eAAA,KAAA24C,EAAAziF,SAAA,CAAAwpC,EAAAM,eAAA,EAGAN,CACA,CAQA,MAAAhB,eAAAn/C,CAAA,CAAAJ,CAAA,MAAA88B,EAAA,WAAAj9B,UAAA,CAAA0/C,cAAA,CAAAn/C,EAAAJ,GAGA,GAAA88B,IAAA,GAAAA,EACA,YAAAouE,GAAA,CAGA,IAAApuE,EAAAj6B,KAAA,CAAAu6C,MAAA,MAAApG,SAAA,EACA,YAAAm0D,GAAA,CAGA,GAAAruE,EAAAnjC,IAAA,CAAAR,MAAA,EAAA49C,GAAApmC,IAAA,CACA,oCAGA,IAAAhX,EAAA2gB,EAAA3hB,MAAA,CAAA2d,IAAA,CAAAwmB,EAAAnjC,IAAA,EACAmpD,EAAA/L,GAAA/lC,MAAA,CAAArX,GA+BA,GA9BAmpD,EAAAtL,OAAA,CAAAp3C,EACA0iD,EAAApE,IAAA,KAAA86C,EAA4BziF,SAAA,CAAS+rC,EAAApE,IAAA,EACrCoE,EAAAjgD,KAAA,KAAA22F,EAAAziF,SAAA,CAAA+rC,EAAAjgD,KAAA,EAAAigD,EAAAV,MAAA,CAAAjjC,GAAAI,UAAA,CAAAujC,EAAAV,MAAA,EAGAU,IAAAA,EAAAC,cAAA,EACAD,EAAAE,QAAA,MACMF,EAAAG,eAAA,KAAA9jC,KAEN2jC,EAAAE,QAAA,KAAAw2C,EAAAziF,SAAA,CAAA+rC,EAAAE,QAAA,EACAF,EAAAG,eAAA,CAAA9jC,GAAAI,UAAA,CAAAujC,EAAAG,eAAA,GAGAH,EAAAlC,aAAA,CAAAkC,IAAAA,EAAAI,KAAA,CAAAJ,EAAAK,QAAA,CAAAL,IAAAA,EAAAI,KAAA,CAGAJ,IAAAA,EAAAM,cAAA,EACAN,EAAAO,iBAAA,CAAAlkC,GAAAI,UAAA,CAAAujC,EAAAQ,QAAA,EACMR,EAAAQ,QAAA,MAENR,EAAAO,iBAAA,MACAP,EAAAQ,QAAA,KAGAR,IAAAA,EAAAS,oBAAA,CACMT,EAAAU,cAAA,MAENV,EAAAU,cAAA,KAAAg2C,EAAAziF,SAAA,CAAA+rC,EAAAU,cAAA,EAGA,CAAAV,EAAApE,IAAA,CAAAtB,MAAA,MAAAtjD,SAA+C,EAC/C,qCAAA4B,KAAAC,SAAA,CAAAmnD,EAAApE,IAAA,SAAAhjD,KAAAC,SAAA,MAAA7B,SAAA,KAGA,OAAAgpD,CACA,CAQA,MAAA2pD,gBAAAC,CAAA,MAAA5vE,EAAA,WAAAj9B,UAAA,CAAA0/C,cAAA,CAAAmtD,GAGA,GAAA5vE,IAAA,GAAAA,EACA,uCAGA,IAAAA,EAAAj6B,KAAA,CAAAu6C,MAAA,MAAApG,SAAA,EACA,sCAGA,GAAAla,EAAAnjC,IAAA,CAAAR,MAAA,EAAAyyG,GAAAj7F,IAAA,CACA,qCAGA,IAAAhX,EAAA2gB,EAAA3hB,MAAA,CAAA2d,IAAA,CAAAwmB,EAAAnjC,IAAA,EACAgzG,EAAAf,GAA+B56F,MAAA,CAAArX,GAY/B,OAXAgzG,EAAAC,OAAA,KAA+BpT,EAAAziF,SAAS,CAAA41F,EAAAC,OAAA,EACxCD,EAAAE,OAAA,KAA+BrT,EAAAziF,SAAS,CAAA41F,EAAAE,OAAA,EACxCF,EAAAG,OAAA,KAA+BtT,EAAAziF,SAAS,CAAA41F,EAAAG,OAAA,EACxCH,EAAAI,OAAA,KAA+BvT,EAAAziF,SAAS,CAAA41F,EAAAI,OAAA,EACxCJ,EAAAK,OAAA,KAA+BxT,EAAAziF,SAAS,CAAA41F,EAAAK,OAAA,EACxCL,EAAAM,OAAA,KAA+BzT,EAAAziF,SAAS,CAAA41F,EAAAM,OAAA,EACxCN,EAAAO,OAAA,KAA+B1T,EAAAziF,SAAS,CAAA41F,EAAAO,OAAA,EACxCP,EAAAQ,OAAA,KAA+B3T,EAAAziF,SAAS,CAAA41F,EAAAQ,OAAA,EACxCR,EAAAS,OAAA,KAAA5T,EAAgCziF,SAAA,CAAS41F,EAAAS,OAAA,EACzCT,EAAAU,QAAA,KAAgC7T,EAAAziF,SAAS,CAAA41F,EAAAU,QAAA,EACzCV,EAAAW,QAAA,KAAA9T,EAAAziF,SAAA,CAAA41F,EAAAW,QAAA,EACAX,CACA,CAYA,MAAArqD,SAAA/gC,CAAA,CAAAygE,CAAA,CAAAn/E,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAmrD,EAAA/sG,EAWA,OARA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,gBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAoqC,yBAAA,MAAAvqC,SAAA,CAAAz1B,EAAAygE,EAAAurB,EAAAtmC,EAAA7kB,IAAA,KAAA/hC,KAAA,IAAA7f,EACA,CAYA,MAAAgxD,QAAApxD,CAAA,CAAA4iD,CAAA,CAAAngD,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAmrD,EAAA/sG,EAGA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,eAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAq2D,wBAAA,MAAAx2D,SAAA,CAAA52C,EAAA4iD,EAAAuqD,EAAAtmC,EAAA7kB,IAAA,KAAA/hC,KAAA,IAAA7f,EACA,CAUA,MAAAixD,OAAArxD,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,EACA,IAAAsmC,EAAA/sG,EAGA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,cAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAs2D,uBAAA,MAAAz2D,SAAA,CAAA52C,EAAAmtG,EAAAtmC,IAAA,KAAA5mD,KAAA,IAAA7f,EACA,CAYA,MAAAoxD,aAAAxxD,CAAA,CAAAuxD,CAAA,CAAAD,CAAA,CAAAg8C,CAAA,CAAAzmC,CAAA,EACA,IAAA0mC,EAAAntG,EAGA6qG,GAAAqC,IACAC,EAAAD,EAAA5zG,SAAA,CACM0G,EAAA,CAAAktG,EAAA,GAENC,EAAAD,EACAltG,EAAAymE,GAGA,MAAA+jC,GAAA,oBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAumC,6BAAA,MAAA1mC,SAAA,CAAA52C,EAAAuxD,EAAAD,EAAAi8C,EAAA1mC,IAAA,KAAA5mD,KAAA,IAAA7f,EACA,CAWA,MAAAqxD,OAAAn+C,CAAA,CAAA4+C,CAAA,CAAA2U,CAAA,CAAA7kB,CAAA,EACA,IAAAmrD,EAAA/sG,EAGA6qG,GAAA/4C,IACAi7C,EAAAj7C,EAAAx4D,SAAA,CACM0G,EAAA,CAAA8xD,EAAA,GAENi7C,EAAAj7C,EACA9xD,EAAAymE,GAGA,MAAA+jC,GAAA,cAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA+jC,uBAAA,MAAAlkC,SAAA,MAAAl9C,SAAA,CAAA4Z,EAAA65F,EAAAtmC,EAAA7kB,IAAA,KAAA/hC,KAAA,IAAA7f,EACA,CAWA,MAAAsxD,KAAA1xD,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAmrD,EAAA/sG,EAGA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,YAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAy2D,qBAAA,MAAA52D,SAAA,MAAAl9C,SAAA,CAAAsG,EAAAmtG,EAAAtmC,EAAA7kB,IAAA,KAAA/hC,KAAA,IAAA7f,EACA,CAWA,MAAAuxD,aAAA3xD,CAAA,CAAAsT,CAAA,CAAA4+C,CAAA,CAAA2U,CAAA,EACA,IAAA4mC,EAAArtG,EAGA6qG,GAAA/4C,IACAu7C,EAAAv7C,EAAAx4D,SAAA,CACM0G,EAAA,CAAA8xD,EAAA,GAENu7C,EAAAv7C,EACA9xD,EAAAymE,GAGA,MAAA+jC,GAAA,oBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAI,6BAAA,MAAAP,SAAA,CAAA52C,EAAAsT,EAAAm6F,EAAA5mC,IAAA,KAAA5mD,KAAA,IAAA7f,EACA,CAUA,MAAAwxD,cAAA5xD,CAAA,CAAAkyD,CAAA,CAAA2U,CAAA,EACA,IAAA4mC,EAAArtG,EAGA6qG,GAAA/4C,IACAu7C,EAAAv7C,EAAAx4D,SAAA,CACM0G,EAAA,CAAA8xD,EAAA,GAENu7C,EAAAv7C,EACA9xD,EAAAymE,GAGA,MAAA+jC,GAAA,qBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA22D,8BAAA,MAAA92D,SAAA,CAAA52C,EAAA,KAAAtG,SAAA,CAAA+zG,EAAA5mC,IAAA,KAAA5mD,KAAA,IAAA7f,EACA,CAUA,MAAAyxD,YAAA7xD,CAAA,CAAAkyD,CAAA,CAAA2U,CAAA,EACA,IAAA4mC,EAAArtG,EAGA6qG,GAAA/4C,IACAu7C,EAAAv7C,EAAAx4D,SAAA,CACM0G,EAAA,CAAA8xD,EAAA,GAENu7C,EAAAv7C,EACA9xD,EAAAymE,GAGA,MAAA+jC,GAAA,mBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA42D,4BAAA,MAAA/2D,SAAA,CAAA52C,EAAA,KAAAtG,SAAA,CAAA+zG,EAAA5mC,IAAA,KAAA5mD,KAAA,IAAA7f,EACA,CAaA,MAAA0xD,gBAAA3wC,CAAA,CAAAygE,CAAA,CAAAn/E,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA4sD,EAAA/sG,EAWA,OARA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,uBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA0L,gCAAA,MAAA7L,SAAA,CAAAz1B,EAAA,KAAAznB,SAAA,CAAAkoF,EAAAurB,EAAAtmC,EAAA7kB,EAAAzB,IAAA,KAAAtgC,KAAA,IAAA7f,EACA,CAcA,MAAA2xD,eAAA/xD,CAAA,CAAA4iD,CAAA,CAAAngD,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA4sD,EAAA/sG,EAGA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,sBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA62D,+BAAA,MAAAh3D,SAAA,CAAA52C,EAAA,KAAAtG,SAAA,CAAAkpD,EAAAuqD,EAAAtmC,EAAA7kB,EAAAzB,IAAA,KAAAtgC,KAAA,IAAA7f,EACA,CAYA,MAAA4xD,cAAA1+C,CAAA,CAAA4+C,CAAA,CAAA2U,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA4sD,EAAA/sG,EAGA6qG,GAAA/4C,IACAi7C,EAAAj7C,EAAAx4D,SAAA,CACM0G,EAAA,CAAA8xD,EAAA,GAENi7C,EAAAj7C,EACA9xD,EAAAymE,GAGA,MAAA+jC,GAAA,qBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA82D,8BAAA,MAAAj3D,SAAA,MAAAl9C,SAAA,CAAA4Z,EAAA65F,EAAAtmC,EAAA7kB,EAAAzB,IAAA,KAAAtgC,KAAA,IAAA7f,EACA,CAYA,MAAA6xD,YAAAjyD,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA4sD,EAAA/sG,EAGA6qG,GAAAxoG,IACA0qG,EAAA1qG,EAAA/I,SAAA,CACM0G,EAAA,CAAAqC,EAAA,GAEN0qG,EAAA1qG,EACArC,EAAAymE,GAGA,MAAA+jC,GAAA,mBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAA+2D,4BAAA,MAAAl3D,SAAA,MAAAl9C,SAAA,CAAAsG,EAAAmtG,EAAAtmC,EAAA7kB,EAAAzB,IAAA,KAAAtgC,KAAA,IAAA7f,EACA,CAQA,MAAAgyD,WAAA27C,CAAA,EACA,MAAAnD,GAAA,kBAAAnrG,UAAA,KAAA25F,EAAA/0C,WAAA,GAAAjnD,GAAA,CAAA25C,GAAAi3D,2BAAA,MAAAp3D,SAAA,CAAAm3D,IAAA,KAAA9tF,KAAA,CACA,CAYA,OAAA26D,0BAAAhkC,CAAA,CAAA0H,CAAA,CAAAiC,CAAA,CAAAH,CAAA,CAAAK,CAAA,EACA,IAAA5hD,EAAA,EACA2/C,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA46C,EAAAv9B,kBAAA,CACApd,SAAA,GACKC,WAAA,EACL,GACAuvD,EAAAx0G,GAAA,CAAAkc,GAAA,eAAAA,GAAA,YAAAjc,GAAA,iBAAAic,GAAA,UAAAjc,GAAA,qBACAH,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,MACA,EACA,IAAAyuF,EAAAD,EAAAz0G,MAAA,EACAgqD,YAAA,EAEAjD,SAAAA,EACAH,cAAA4qD,GAAA5qD,GACAthC,OAAA2hC,IAAA,GAAAA,EAAA,IACOA,gBAAAuqD,GAAAvqD,GAAA,IAAA24C,EAAAziF,SAAA,IACP,EAAApd,GACAA,EAAAA,EAAAJ,KAAA,GAAA+0G,EACA,CACA,WAAA9U,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAWA,OAAAy9C,6BAAAJ,CAAA,CAAA0H,CAAA,CAAAt+C,CAAA,CAAAyC,CAAA,EACA,IAAA5D,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA/7C,EACAg8C,SAAA,GACKC,WAAA,EACL,GACAF,OAAA46C,EAAAv9B,kBAAA,CACApd,SAAA,GACKC,WAAA,EACL,GACA0tD,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EAKA,OAJA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,CAGA,EAAAjqD,GACA,IAAA6/F,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAA4nF,0BAAAvqC,CAAA,CAAAz1B,CAAA,CAAAygE,CAAA,CAAAn/E,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAoqD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,YACA1lB,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,EAEKxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,EACL,EAAArd,GACA,IAAAsF,EAAA,EACA2/C,OAAAr9B,EACAs9B,SAAA,GACKC,WAAA,EACL,GACAF,OAAAojC,EACAnjC,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAA6zG,yBAAAx2D,CAAA,CAAA52C,CAAA,CAAA4iD,CAAA,CAAAngD,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAoqD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,YACA1lB,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,EAEKxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,EACL,EAAArd,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAoE,EACAnE,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAWA,OAAA8zG,wBAAAz2D,CAAA,CAAA52C,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,EACA,IAAAulC,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,CAGA,EAAAjqD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAA+jF,8BAAA1mC,CAAA,CAAA52C,CAAA,CAAAuxD,CAAA,CAAAD,CAAA,CAAAg8C,CAAA,CAAAzmC,CAAA,EACA,IAAAonC,EAAAx0G,GAAA,CAAAkc,GAAA,eAAAA,GAAA,iBAAAA,GAAA,UAAAjc,GAAA,kBACAH,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,MACA,EACA,IAAAyuF,EAAAD,EAAAz0G,MAAA,EACAgqD,YAAA,EAEA8N,cAAA65C,EAAA,CAAA75C,EAAA,CACAxyC,OAAAyyC,IAAA,GAAAA,EAAA,IACOA,aAAAy5C,GAAAz5C,GAAA,IAAA6nC,EAAAziF,SAAA,IACP,EAAApd,GACAA,EAAAA,EAAAJ,KAAA,GAAA+0G,EACA,CACA,IAAArvG,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA8uD,EACA7uD,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA8uD,EACA7uD,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAAuhF,wBAAAlkC,CAAA,CAAA0H,CAAA,CAAAhrC,CAAA,CAAA4+C,CAAA,CAAA2U,CAAA,CAAA7kB,CAAA,EACA,IAAAoqD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,YACA1lB,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,EAEKxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,EACL,EAAArd,GACA,IAAAsF,EAAA,EACA2/C,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAAlrC,EACAmrC,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAAi0G,sBAAA52D,CAAA,CAAA0H,CAAA,CAAAt+C,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,EACA,IAAAoqD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,YACA1lB,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,EAEKxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,EACL,EAAArd,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAYA,OAAA49C,8BAAAP,CAAA,CAAA52C,CAAA,CAAAsT,CAAA,CAAA7Q,CAAA,CAAAokE,CAAA,EACA,IAAAulC,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,CAGA,EAAAjqD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAlrC,EACAmrC,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAYA,OAAAm0G,+BAAA92D,CAAA,CAAA52C,CAAA,CAAAs+C,CAAA,CAAA4T,CAAA,CAAA2U,CAAA,EACA,IAAAulC,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,EAGA,EAAAjqD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAYA,OAAAo0G,6BAAA/2D,CAAA,CAAA52C,CAAA,CAAAs+C,CAAA,CAAA4T,CAAA,CAAA2U,CAAA,EACA,IAAAulC,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,EAGA,EAAAjqD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAeA,OAAAkpD,iCAAA7L,CAAA,CAAAz1B,CAAA,CAAAm9B,CAAA,CAAAsjC,CAAA,CAAAn/E,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA6rD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,UAAAtJ,GAAA,cACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,GAEAxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,GACK2pC,SAAAA,CACL,EAAAhnD,GACA,IAAAsF,EAAA,EACA2/C,OAAAr9B,EACAs9B,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAAojC,EACAnjC,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAeA,OAAAq0G,gCAAAh3D,CAAA,CAAA52C,CAAA,CAAAs+C,CAAA,CAAAsE,CAAA,CAAAngD,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA6rD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,UAAAtJ,GAAA,cACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,GAEAxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,GACK2pC,SAAAA,CACL,EAAAhnD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAAoE,EACAnE,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAcA,OAAAs0G,+BAAAj3D,CAAA,CAAA0H,CAAA,CAAAhrC,CAAA,CAAA4+C,CAAA,CAAA2U,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA6rD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,UAAAtJ,GAAA,cACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,GAEAxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,GACK2pC,SAAAA,CACL,EAAAhnD,GACA,IAAAsF,EAAA,EACA2/C,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAAlrC,EACAmrC,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA0T,EACAzT,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAaA,OAAAu0G,6BAAAl3D,CAAA,CAAA0H,CAAA,CAAAt+C,CAAA,CAAAyC,CAAA,CAAAokE,CAAA,CAAA7kB,CAAA,CAAAzB,CAAA,EACA,IAAA6rD,EAAA3yG,GAAA,CAAAkc,GAAA,eAAAsJ,GAAA,UAAAtJ,GAAA,cACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACAgqD,YAAA,GAEAxB,OAAA,IAAAjjC,GAAAijC,GAAAprC,QAAA,GACK2pC,SAAAA,CACL,EAAAhnD,GACA,IAAAsF,EAAA,EACA2/C,OAAAx+C,EACAy+C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,KAsBL,OAnBAmoB,IAAAA,EAAA9tE,MAAA,CACA8F,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACD,IAEN7/C,EAAAxH,IAAA,EACAmnD,OAAA/7C,EACAg8C,SAAA,GACOC,WAAA,EACP,GACAmoB,EAAA7hE,OAAA,CAAAnB,GAAAhF,EAAAxH,IAAA,EACAmnD,OAAA36C,EAAAnK,SAAA,CACA+kD,SAAA,GACOC,WAAA,EACP,KAGA,IAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CASA,OAAAy0G,4BAAAp3D,CAAA,CAAAm3D,CAAA,EACA,IAAA3B,EAAA3yG,GAAA,CAAAkc,GAAA,iBACApc,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EAAAgqD,YAAA,EAGA,EAAAjqD,GACA,IAAAsF,EAAA,EACA2/C,OAAAuvD,EACAtvD,SAAA,GACKC,WAAA,EACL,GACA,WAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAAA,EACKr9C,KAAAA,CACL,EACA,CAYA,aAAA4kD,0BAAgCstD,CAAA,CAAA70D,CAAmB,CAAA0H,CAAA,CAAA77C,CAAA,CAAAuiE,EAAA,IACnD,IAAAA,GAAA,CAAAo0B,EAA4CziF,SAAA,CAAA6+C,SAAiB,CAAA/yD,EAAAmU,QAAA,IAC7D,kCAAAnU,EAAA3B,QAAA,MAGA,aAAAs4F,EAAAziF,SAAA,CAAA6kC,kBAAA,EAAA/4C,EAAAmU,QAAA,GAAAggC,EAAAhgC,QAAA,GAAA0nC,EAAA1nC,QAAA,IAAA60F,EAAA,KAeA,OAAAztD,wCAAAytD,CAAA,CAAA70D,CAAA,CAAA0H,CAAA,CAAAC,CAAA,CAAA97C,CAAA,CAAAwd,CAAA,EACA,IAAA1mB,EAAA2gB,EAAA3hB,MAAA,CAAAknB,KAAA,IACA5gB,EAAA,EACA2/C,OAAAv+B,EACAw+B,SAAA,GACKC,WAAA,EACL,GACAF,OAAAD,EACAE,SAAA,GACKC,WAAA,EACL,GACAF,OAAA/7C,EACAg8C,SAAA,GACKC,WAAA,EACL,GACAF,OAAAF,EACAG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA46C,EAAA9iD,aAAA,CAAAM,SAAA,CACA6H,SAAA,GACKC,WAAA,EACL,GACAF,OAAA5H,EACA6H,SAAA,GACKC,WAAA,EACL,GACAF,OAAA46C,EAAAv9B,kBAAA,CACApd,SAAA,GACKC,WAAA,EACL,GACA,WAAA06C,EAAAx6C,sBAAA,EACA//C,KAAAA,EACA+3C,UAAA60D,EACKlyG,KAAAA,CACL,GAEA,CAGA,gBAAAjC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,2BAAA42G,EAAA,8CAAAC,EAAA,kDAAAC,EAAA,8CAAAC,EAAA,+BAAAC,EAAA,+CAAAC,EAAA,qDAAAC,EAAA,0CAAAC,EAAA,8BAAAC,EAAA,uDAAAC,EAAA,6CAAAC,EAAA,yCAAAC,EAAA,+BAAAC,EAAA,mCAAAC,EAAA,yBAAAC,EAAA,kCAAAC,EAAA,wCAAAC,EAAA,4BAAA/uF,EAAA,qCAAAgvF,EAAA,qDAAAC,EAAA,2BAAAC,EAAA,2BAAAC,EAAA,oCAAAC,EAAA,4BAAAC,EAAA,uCAAAC,EAAA,8BAAAC,EAAA,yCAAA76C,EAAA,iCAAA86C,EAAA,qCAAA7nB,EAAA,sCAAA8nB,EAAA,8BAAAl5F,EAAA,8CAAAm5F,EAAA,kCAAAC,EAAA,oCAAAC,EAAA,8CAAAC,EAAA,+CAAAC,EAAA,wCAAA94B,EAAA,iDAAA+4B,EAAA,+CAAAC,EAAA,qDAAAC,EAAA,uCAAAx0C,EAAA,0CAAAy0C,EAAA,8CAAAC,EAAA,+CAAAC,EAAA,gDAAAC,EAAA,qCAAAC,EAAA,yCAAA5uG,EAAA,uCAAA6uG,EAAA,2CAAAC,EAAA,6CAAAC,EAAA,qCAAAC,EAAA,iCAAAC,EAAA,2BAAAC,EAAA,sCAAAC,EAAA,kCAAA36D,EAAA,gCAAA+N,EAAA,+DAAA6sD,EAAA,wDAAAC,EAAA,mDAAAC,EAAA,2CAAAxyD,EAAA,uCAAAyyD,EAAA,sCAAAC,EAAA,uCAAAC,EAAA,wCAAAC,EAAA,oCAAAC,EAAA,kCAAAC,EAAA,qCAAAC,EAAA,yCAAAC,EAAA,gCAAAC,EAAA,4CAAAC,EAAA,6BAAAC,EAAA,oCAAAC,EAAA,gCAAAC,EAAA,kCAAAC,EAAA,iDAAAjuG,EAAA,8CAAA2mG,EAAA,QgBxyMA0G,EApiCAa,EAioRAC,EhBrzCAC,EAAA,GAAA76G,EAAAyE,CAAA,CAAAo2G,GAAA76G,EAAAC,CAAA,CAAA46G,EAAA,0BAAAC,CAAA,2BAAAC,EAAA,2BAAAC,EAAA,4BAAAC,EAAA,2BAAAC,EAAA,+BAAAC,CAAA,oCAAAC,EAAA,oCAAAC,EAAA,gCAAAC,EAAA,mCAAAC,EAAA,gCAAAC,EAAA,+BAAAC,EAAA,+BAAAC,CAAA,gCAAAC,CAAA,4BAAAC,CAAA,oCAAAC,EAAA,oCAAAC,EAAA,wCAAAC,CAAA,uCAAAC,EAAA,gCAAAC,EAAA,mCAAAC,EAAA,QAAAC,EAAAn8G,EAAA,MAAAo8G,EAAAp8G,EAAA,MCt6OA,IAAAq8G,EAAAzxD,OAAA,cACA0xD,EAAA1xD,OAAA,IAEA,SAAA2xD,EAAA57G,CAAA,CAAAs4D,EAAA,WACA,EACa,CAAAn/B,EAAA7gB,OAAAtY,EAAA07G,GAAA/uE,EAAAr0B,OAAA,GAAAqjG,EAAAD,EAAA,EACb,CAAAviF,EAAA7gB,EAAAA,OAAA,GAAAqjG,EAAAD,GAAA/uE,EAAAr0B,EAAAA,OAAAtY,EAAA07G,EAAA,CADa,CAGb,SAAAnhG,EAAAshG,CAAA,CAAAvjD,EAAA,IACA,IAAAwjD,EAAA,IAAAC,YAAAF,EAAAj7G,MAAA,EACAo7G,EAAA,IAAAD,YAAoBF,EAAAj7G,MAAgB,EACpC,QAAAoF,EAAgB,EAAAA,EAAO61G,EAAAj7G,MAAA,CAAAoF,IAAA,CACvB,IAAAmzB,EAAAA,CAAA,CAAAwT,EAAAA,CAAA,EAAAivE,EAAAC,CAAA,CAAA71G,EAAA,CAAAsyD,EACA,EAAAwjD,CAAA,CAAA91G,EAAA,CAAAg2G,CAAA,CAAAh2G,EAAA,GAAAmzB,EAAAwT,EAAA,CAEA,OAAAmvE,EAAAE,EAAA,CAEA,IAAAC,EAAA,CAAA9iF,EAAAwT,IAAA,OAAAxT,IAAA,IAAAwiF,EAAA1xD,OAAAtd,IAAA,GAEAuvE,EAAA,CAAA/iF,EAAAgjF,EAAAz3G,IAAAy0B,IAAAz0B,EACA03G,EAAA,CAAAjjF,EAAAwT,EAAAjoC,IAAA,MAAAA,EAAAioC,IAAAjoC,EAEA23G,EAAA,CAAAljF,EAAAwT,EAAAjoC,IAAA,IAAAA,EAAAioC,GAAA,GAAAjoC,EACA43G,EAAA,CAAAnjF,EAAAwT,EAAAjoC,IAAA,MAAAA,EAAAioC,IAAAjoC,EAEA63G,EAAA,CAAApjF,EAAAwT,EAAAjoC,IAAA,MAAAA,EAAAioC,IAAAjoC,EAAA,GACA83G,EAAA,CAAArjF,EAAAwT,EAAAjoC,IAAA,IAAAA,EAAA,GAAAioC,GAAA,GAAAjoC,EAEA+3G,EAAA,CAAAC,EAAA/vE,IAAAA,EACAgwE,EAAA,CAAAxjF,EAAAgjF,IAAAhjF,EAEAyjF,EAAA,CAAAzjF,EAAAwT,EAAAjoC,IAAA,GAAAA,EAAAioC,IAAA,GAAAjoC,EACAm4G,EAAA,CAAA1jF,EAAAwT,EAAAjoC,IAAA,GAAAA,EAAAy0B,IAAA,GAAAz0B,EAEAo4G,EAAA,CAAA3jF,EAAAwT,EAAAjoC,IAAA,GAAAA,EAAA,GAAAy0B,IAAA,GAAAz0B,EACAq4G,EAAA,CAAA5jF,EAAAwT,EAAAjoC,IAAA,GAAAA,EAAA,GAAAioC,IAAA,GAAAjoC,EAGA,SAAAO,EAAA62G,CAAA,CAAAE,CAAA,CAAAgB,CAAA,CAAAC,CAAA,EACA,IAAAtwE,EAAa,CAAAqvE,IAAA,GAAAiB,CAAAA,IAAA,GACb,OAAA9jF,EAAA,EAAA6jF,EAAA,mBAAArwE,EAAAA,EAAAA,CAAA,CACA,CAEA,IAAAuwE,EAAA,CAAAlB,EAAAiB,EAAAE,IAAA,CAAAnB,IAAA,GAAAiB,CAAAA,IAAA,GAAAE,CAAAA,IAAA,GACAC,EAAA,CAAAC,EAAAvB,EAAAkB,EAAAM,IAAA,EAAAN,EAAAM,EAAA,mBACAC,EAAA,CAAAvB,EAAAiB,EAAAE,EAAAK,IAAA,CAAAxB,IAAA,GAAAiB,CAAAA,IAAA,GAAAE,CAAAA,IAAA,GAAAK,CAAAA,IAAA,GACAC,EAAA,CAAAJ,EAAAvB,EAAAkB,EAAAM,EAAAI,IAAA,EAAAV,EAAAM,EAAAI,EAAA,mBACAC,EAAA,CAAA3B,EAAAiB,EAAAE,EAAAK,EAAAI,IAAA,CAAA5B,IAAA,GAAAiB,CAAAA,IAAA,GAAAE,CAAAA,IAAA,GAAAK,CAAAA,IAAA,GAAAI,CAAAA,IAAA,GACAC,EAAA,CAAAR,EAAAvB,EAAAkB,EAAAM,EAAAI,EAAAI,IAAA,EAAAd,EAAAM,EAAAI,EAAAI,EAAA,mBAIAl3F,EAAA,CACAg1F,QAAAA,EAAArhG,MAAAA,EAAA0hG,MAAAA,EACAC,MAAAA,EAAAE,MAAAA,EACAC,OAAAA,EAAAC,OAAAA,EAAAC,OAAAA,EAAAC,OAAAA,EACAC,QAAAA,EAAAE,QAAAA,EACAC,OAAAA,EAAAC,OAAAA,EAAAC,OAAAA,EAAAC,OAAAA,EACA93G,IAAAA,EAAAi4G,MAAAA,EAAAE,MAAAA,EAAAG,MAAAA,EAAAE,MAAAA,EAAAI,MAAAA,EAAAF,MAAAA,CACA,EACA,IAAAI,EAAAn3F,EAAA48B,EAAAnkD,EAAA,MCvDA,IAAA2+G,EAAAC,EAAA,CAAAF,EAAAxjG,KAAA,EACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,CAAA1Z,GAAA,CAAAb,GAAAiqD,OAAAjqD,KAEAk+G,EAAA,IAAAnC,YAAA,IACOoC,EAAqB,IAAMpC,YAAA,GAClC,OAAAqC,UAAA3C,EAAA4C,EAAA,CACA18G,aAAA,CACA,oBAKA,KAAAm6G,EAAA,YACA,KAAAE,EAAA,YACA,KAAAgB,EAAA,aACA,KAAAC,EAAA,aACA,KAAAK,EAAA,YACA,KAAAH,EAAA,WACA,KAAAO,EAAA,aACA,KAAAF,EAAA,YACA,KAAAM,EAAA,YACA,KAAAF,EAAA,aACA,KAAAU,EAAA,aACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,YACA,KAAAC,EAAA,UACA,CAEAl8F,KAAA,CACA,IAAAq5F,GAAAA,CAAA,CAAAE,GAAAA,CAAA,CAAAgB,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAK,GAAAA,CAAA,CAAAH,GAAAA,CAAA,CAAAO,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAM,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAU,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,OACA,OAAA7C,EAAAE,EAAAgB,EAAAC,EAAAK,EAAAH,EAAAO,EAAAF,EAAAM,EAAAF,EAAAU,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,CAGA55G,IAAA+2G,CAAA,CAAAE,CAAA,CAAAgB,CAAA,CAAAC,CAAA,CAAAK,CAAA,CAAAH,CAAA,CAAAO,CAAA,CAAAF,CAAA,CAAAM,CAAA,CAAAF,CAAA,CAAAU,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,KAAA7C,EAAA,CAAAA,EAAAA,EACA,KAAAE,EAAA,CAAAA,EAAAA,EACA,KAAAgB,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAK,EAAA,CAAAA,EAAAA,EACA,KAAAH,EAAA,CAAAA,EAAAA,EACA,KAAAO,EAAA,CAAAA,EAAAA,EACA,KAAAF,EAAA,CAAAA,EAAAA,EACA,KAAAM,EAAA,CAAAA,EAAAA,EACA,KAAAF,EAAA,CAAAA,EAAAA,EACA,KAAAU,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,CACA,CACA52F,QAAApG,CAAA,CAAAhJ,CAAA,EAEA,QAAA3S,EAAA,EAAAA,EAAA,GAAAA,IAAA2S,GAAA,EACAulG,CAAA,CAAAl4G,EAAA,CAAA2b,EAAAi9F,SAAA,CAAAjmG,GACAwlG,CAAA,CAAAn4G,EAAA,CAAA2b,EAAAi9F,SAAA,CAAAjmG,GAAA,GAEA,QAAA3S,EAAA,GAAAA,EAAA,GAAAA,IAAA,CAEA,IAAA64G,EAAAX,EAAAA,CAAA,CAAAl4G,EAAA,IACA84G,EAAwBX,EAAAA,CAAU,CAAAn4G,EAAA,IAClC+4G,EAAwBhB,EAAA1B,MAAU,CAAAwC,EAAAC,EAAA,GAAkBf,EAAA1B,MAAU,CAAAwC,EAAAC,EAAA,GAAkBf,EAAA7B,KAAS,CAAA2C,EAAAC,EAAA,GACzFE,EAAAjB,EAAAzB,MAAA,CAAAuC,EAAAC,EAAA,GAAAf,EAAAzB,MAAA,CAAAuC,EAAAC,EAAA,GAAAf,EAAA3B,KAAA,CAAAyC,EAAAC,EAAA,GAEAG,EAAAf,EAAAA,CAAA,CAAAl4G,EAAA,GACAk5G,EAAwBf,EAAAA,CAAA,CAAUn4G,EAAA,GAClCm5G,EAAwBpB,EAAA1B,MAAU,CAAA4C,EAAAC,EAAA,IAAiBnB,EAAAxB,MAAU,CAAA0C,EAAAC,EAAA,IAAiBnB,EAAA7B,KAAS,CAAA+C,EAAAC,EAAA,GACvFE,EAAArB,EAAAzB,MAAA,CAAA2C,EAAAC,EAAA,IAAAnB,EAAAvB,MAAA,CAAAyC,EAAAC,EAAA,IAAAnB,EAAA3B,KAAA,CAAA6C,EAAAC,EAAA,GAEAG,EAAyBtB,EAAAR,KAAS,CAAAyB,EAAAI,EAAAjB,CAAA,CAAAn4G,EAAA,GAAAm4G,CAAA,CAAAn4G,EAAA,KAClCs5G,EAAAvB,EAAAN,KAAA,CAAA4B,EAAAN,EAAAI,EAAAjB,CAAA,CAAAl4G,EAAA,GAAAk4G,CAAA,CAAAl4G,EAAA,IACAk4G,CAAAA,CAAA,CAAAl4G,EAAA,CAAAs5G,EAAAA,EACAnB,CAAA,CAAAn4G,EAAA,CAAAq5G,EAAAA,CACA,CACA,IAAAvD,GAAAA,CAAA,CAAAE,GAAAA,CAAA,CAAAgB,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAK,GAAAA,CAAA,CAAAH,GAAAA,CAAA,CAAAO,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAM,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAU,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,OAEA,QAAA34G,EAAA,EAAAA,EAAA,GAAAA,IAAA,CAEA,IAAAu5G,EAA4BxB,EAAA1B,MAAU,CAAAyB,EAAAF,EAAA,IAAeG,EAAA1B,MAAU,CAAAyB,EAAAF,EAAA,IAAeG,EAAAxB,MAAU,CAAAuB,EAAAF,EAAA,IACxF4B,EAAAzB,EAAAzB,MAAA,CAAAwB,EAAAF,EAAA,IAAAG,EAAAzB,MAAA,CAAAwB,EAAAF,EAAA,IAAAG,EAAAvB,MAAA,CAAAsB,EAAAF,EAAA,IAEA6B,EAAA,EAAAnB,EAAA,CAAAR,EAAAU,EACAkB,EAAA,EAAAnB,EAAA,CAAAX,EAAAa,EAGAkB,EAAwB5B,EAAAJ,KAAS,CAAAgB,EAAAa,EAAAE,EAAAzB,CAAA,CAAAj4G,EAAA,CAAAm4G,CAAA,CAAAn4G,EAAA,EACjC45G,EAAA7B,EAAAF,KAAA,CAAA8B,EAAAjB,EAAAa,EAAAE,EAAAzB,CAAA,CAAAh4G,EAAA,CAAAk4G,CAAA,CAAAl4G,EAAA,EACA65G,EAAAF,EAAAA,EAEAG,EAA4B/B,EAAA1B,MAAU,CAAAP,EAAAE,EAAA,IAAe+B,EAAAxB,MAAU,CAAAT,EAAAE,EAAA,IAAe+B,EAAAxB,MAAU,CAAAT,EAAAE,EAAA,IACxF+D,EAAAhC,EAAAzB,MAAA,CAAAR,EAAAE,EAAA,IAAA+B,EAAAvB,MAAA,CAAAV,EAAAE,EAAA,IAAA+B,EAAAvB,MAAA,CAAAV,EAAAE,EAAA,IACAgE,EAAA,EAAAhD,EAAAlB,EAAAwB,EAAAN,EAAAM,EACA2C,EAAA,EAAAhD,EAAAjB,EAAAmB,EAAAF,EAAAE,EACAuB,EAAAF,EAAAA,EACAG,EAAAF,EAAAA,EACAD,EAAAF,EAAAA,EACAG,EAAAF,EAAAA,EACAD,EAAAR,EAAAA,EACAS,EAAeX,EAAAA,EACf,EAAAzkF,EAAA2kF,CAAA,CAAAnxE,EAAAixE,CAAA,EAAAG,EAAA94G,GAAA,CAAAy4G,EAAAA,EAAAF,EAAAA,EAAAoC,EAAAA,EAAAC,EAAAA,EAAA,EACAnC,EAAAJ,EAAAA,EACAE,EAAAL,EAAAA,EACAG,EAAAN,EAAAA,EACAG,EAAAF,EAAAA,EACAD,EAAAlB,EAAAA,EACAmB,EAAAjB,EAAAA,EACA,IAAiBkE,EAAAnC,EAASb,KAAA,CAAA2C,EAAAE,EAAAE,GAC1BnE,EAAAiC,EAAAX,KAAA,CAAA8C,EAAAN,EAAAE,EAAAE,GACAhE,EAAAkE,EAAAA,CACA,CAEA,EAAW/mF,EAAA2iF,CAAA,CAAAnvE,EAAAqvE,CAAA,EAAiB+B,EAAA94G,GAAO,QAAA62G,EAAA,QAAAE,EAAA,CAAAF,EAAAA,EAAAE,EAAAA,EAAA,EACnC,EAAW7iF,EAAA6jF,CAAA,CAAArwE,EAAAswE,CAAA,EAAiBc,EAAA94G,GAAO,QAAA+3G,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EACnC,EAAW9jF,EAAAmkF,CAAA,CAAA3wE,EAAAwwE,CAAA,EAAiBY,EAAA94G,GAAO,QAAAq4G,EAAA,QAAAH,EAAA,CAAAG,EAAAA,EAAAH,EAAAA,EAAA,EACnC,EAAWhkF,EAAAukF,CAAA,CAAA/wE,EAAA6wE,CAAA,EAAiBO,EAAA94G,GAAO,QAAAy4G,EAAA,QAAAF,EAAA,CAAAE,EAAAA,EAAAF,EAAAA,EAAA,EACnC,EAAWrkF,EAAA2kF,CAAA,CAAAnxE,EAAAixE,CAAA,EAAiBG,EAAA94G,GAAO,QAAA64G,EAAA,QAAAF,EAAA,CAAAE,EAAAA,EAAAF,EAAAA,EAAA,EACnC,EAAWzkF,EAAAmlF,CAAA,CAAA3xE,EAAA4xE,CAAA,EAAiBR,EAAA94G,GAAO,QAAAq5G,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EACnC,EAAWplF,EAAAqlF,CAAA,CAAA7xE,EAAA8xE,CAAA,EAAiBV,EAAA94G,GAAO,QAAAu5G,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EACnC,EAAAtlF,EAAAulF,CAAA,CAAA/xE,EAAAgyE,CAAA,EAAAZ,EAAA94G,GAAA,QAAAy5G,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EACA,KAAA55G,GAAA,CAAA+2G,EAAAE,EAAAgB,EAAAC,EAAAK,EAAAH,EAAAO,EAAAF,EAAAM,EAAAF,EAAAU,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,CACAwB,YAAA,CACAjC,EAAArpB,IAAA,IACAspB,EAAAtpB,IAAA,GACA,CACAurB,SAAA,CACA,KAAAr+F,MAAA,CAAA8yE,IAAA,IACA,KAAA9vF,GAAA,iCACA,CACA,CAsEO,IAAAs7G,EAAmC,GAAA78D,EAAA88D,EAAA,UAAAlC,GC7N1CmC,EAAAt2D,OAAA,GACAu2D,EAAAv2D,OAAA,GACOw2D,EAAAx2D,OAAA,GACP,SAAAgxD,EAAAz7G,CAAA,EACA,OAAAA,aAAA0M,YACA1M,IAAA,EAAAA,GAAA,iBAAAA,GAAAA,eAAAA,EAAAmC,WAAA,CAAAgB,IAAA,CAEA,SAAAw3G,EAAAnrE,CAAA,EACA,IAAAisE,EAAAjsE,GACA,mCAGA,IAAA0xE,EAAAlgH,MAAAud,IAAA,EAAAnd,OAAA,MAAAE,EAAAkF,IAAAA,EAAA2C,QAAA,KAAAsoD,QAAA,SAIA,SAAAupD,EAAAz2F,CAAA,EACAo2F,EAAAp2F,GAEA,IAAAitC,EAAA,GACA,QAAAhrD,EAAA,EAAAA,EAAA+d,EAAAnjB,MAAA,CAAAoF,IACAgrD,GAAA0vD,CAAA,CAAA38F,CAAA,CAAA/d,EAAA,EAEA,OAAAgrD,CACO,CACP,SAAAoqD,EAAApvF,CAAA,EACA,IAAAglC,EAAAhlC,EAAArjB,QAAA,KACA,OAAAqoD,EAAAA,EAAApwD,MAAA,KAAAowD,EAAA,EAAAA,CAAA,CAEA,SAAAgqD,EAAAhqD,CAAA,EACA,oBAAAA,EACA,+CAAAA,EAAA,CAEA,OAAA/G,OAAA+G,KAAAA,EAAA,SAAAA,EAAA,EACA,CAEA,IAAA2vD,EAAA,CAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAA54G,GAAA,GAAA64G,GAAA,KACA,SAAAC,EAAAC,CAAA,SACA,GAAAP,EAAAC,EAAA,EAAAM,GAAAP,EAAAE,EAAA,CACAK,EAAAP,EAAAC,EAAA,CACAM,GAAAP,EAAAG,EAAA,EAAAI,GAAAP,EAAAI,EAAA,CACAG,EAAAP,CAAAA,EAAAG,EAAA,KACAI,GAAAP,EAAAx4G,EAAA,EAAA+4G,GAAAP,EAAAK,EAAA,CACAE,EAAAP,CAAAA,EAAAx4G,EAAA,WAJA,CAUA,SAAA4yG,EAAA/pD,CAAA,EACA,oBAAAA,EACA,+CAAAA,EAAA,CACA,IAAAmwD,EAAAnwD,EAAApwD,MAAA,CACAwgH,EAAAD,EAAA,EACA,GAAAA,EAAA,EACA,sEAAAA,EAAA,CACA,IAAA7gH,EAAA,IAAA4L,WAA6Bk1G,GAC7B,QAAAC,EAAA,EAAA5Y,EAAA,EAAA4Y,EAAAD,EAAAC,IAAA5Y,GAAA,GACA,IAAA5mD,EAAAo/D,EAAAjwD,EAAA3gC,UAAA,CAAAo4E,IACA6Y,EAAAL,EAAAjwD,EAAA3gC,UAAA,CAAAo4E,EAAA,IACA,GAAA5mD,KAAAp+C,IAAAo+C,GAAAy/D,KAAA79G,IAAA69G,EAAA,CACA,IAAAJ,EAAAlwD,CAAA,CAAAy3C,EAAA,CAAAz3C,CAAA,CAAAy3C,EAAA,SACA,qDAAAyY,EAAA,cAAAzY,EAAA,CACA,CACA,CAAA4Y,EAAA,CAAAx/D,GAAAA,EAAAy/D,CACA,CACA,OAAAhhH,CACA,CAEA,SAAAm6G,GAAuB12F,CAAA,EACvB,OAAAi3F,EAAAR,EAAAz2F,GACO,CACP,SAAA22F,GAAA32F,CAAA,EAEA,OADAo2F,EAAAp2F,GACAi3F,EAAAR,EAAAtuG,WAAA6R,IAAA,CAAAgG,GAAAqD,OAAA,IACO,CACP,SAAA8zF,GAAAl7G,CAAA,CAAAo5B,CAAA,EACA,OAAA2hF,EAAA/6G,EAAA2I,QAAA,KAAAsoD,QAAA,CAAA73B,EAAAA,EAAA,KACO,CACP,SAAA+hF,GAAWn7G,CAAe,CAAAo5B,CAAA,EAC1B,OAAA8hF,GAAAl7G,EAAAo5B,GAAAhS,OAAA,EACA,CAEA,SAAAi0F,GAAAr7G,CAAA,EACA,OAAA+6G,EAAAK,EAAAp7G,GACA,CAUA,SAAA66G,GAAAnI,CAAA,CAAA1hD,CAAA,CAAAuwD,CAAA,MACAl4G,EACA,oBAAA2nD,EACA,IACA3nD,EAAA0xG,EAAA/pD,EACA,CACA,MAAAjqD,EAAA,CACA,eAAA2rG,EAAA,kCAAA1hD,EAAA,YAAAjqD,EAAA,QAGA,GAAAk0G,EAAAjqD,GAGA3nD,EAAA6C,WAAA6R,IAAA,CAAAizC,QAGA,eAAA0hD,EAAA,oCAEA,IAAAt5E,EAAA/vB,EAAAzI,MAAA,CACA,oBAAA2gH,GAA6CnoF,IAAAmoF,EAC7C,eAAA7O,EAAA,YAAA6O,EAAA,cAAAnoF,EAAA,GACA,OAAA/vB,CACA,CAIA,SAAAsxG,GAAA,GAAA6G,CAAA,EACA,IAAAphB,EAAA,EACA,QAAAp6F,EAAA,EAAAA,EAAAw7G,EAAA5gH,MAAA,CAAAoF,IAAA,CACA,IAAAxG,EAAAgiH,CAAA,CAAAx7G,EAAA,CACAm0G,EAAA36G,GACA4gG,GAAA5gG,EAAAoB,MAAA,CAEA,IAAAyI,EAAA,IAAA6C,WAA6Bk0F,GAC7B,QAAAp6F,EAAA,EAAAy7G,EAAA,EAAAz7G,EAAAw7G,EAAA5gH,MAAA,CAAAoF,IAAA,CACA,IAAAxG,EAAAgiH,CAAA,CAAAx7G,EAAA,CACAqD,EAAAtE,GAAA,CAAAvF,EAAAiiH,GACAA,GAAAjiH,EAAAoB,MAAA,CAEA,OAAAyI,CACA,CAEA,SAAAyxG,GAAAt7G,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,EAAAoB,MAAA,GAAA8X,EAAA9X,MAAA,CACA,SACA,IAAA8gH,EAAA,EACA,QAAA17G,EAAA,EAAAA,EAAAxG,EAAAoB,MAAA,CAAAoF,IACA07G,GAAAliH,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,CAAA1S,EAAA,CACA,OAAA07G,IAAAA,CACA,CAIA,SAAApG,GAAA9wF,CAAA,EACA,oBAAAA,EACA,8CAA0D,SAAAA,EAAA,GAC1D,WAAAte,WAAA,IAAAykD,cAAAtvD,MAAA,CAAAmpB,GACA,CAMA,SAAA6vF,GAAAr6G,CAAA,EACA,IAAAo5B,EACA,IAAAA,EAAA,EAAAp5B,EAAAugH,EAAAvgH,IAAAwgH,EAAApnF,GAAA,GAEA,OAAAA,CACA,CAMA,SAAAghF,GAAAp6G,CAAA,CAAAqnG,CAAA,EACA,UAAAp9C,OAAAo9C,GAAAmZ,CACA,CAIA,SAAAjG,GAAAv6G,CAAA,CAAAqnG,CAAA,CAAAjlG,CAAA,EACA,OAAApC,EAAA,CAAAoC,EAAAo+G,EAAAD,CAAA,GAAAt2D,OAAAo9C,EACA,CAKA,IAAAiT,GAAA,IAAAmG,GAAAx2D,OAAAjqD,EAAA,IAAAwgH,EAEAmB,GAAA,OAAAz1G,WAAA9K,GACAwgH,GAAA,GAAA11G,WAAA6R,IAAA,CAAAyvD,GAQA,SAAAotC,GAAAiH,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,oBAAAF,GAAAA,EAAA,EACA,wCACA,oBAAAC,GAAAA,EAAA,EACA,yCACA,sBAAAC,EACA,yCAEA,IAAAt9G,EAAAk9G,GAAAE,GACAr9G,EAAAm9G,GAAeE,GACf77G,EAAA,EACAg8G,EAAA,KACAv9G,EAAAowF,IAAA,IACArwF,EAAAqwF,IAAA,IACA7uF,EAAA,CACA,EACAmzB,EAAA,IAAAzgB,IAAAqpG,EAAAv9G,EAAAC,KAAAiU,GACAupG,EAAA,CAAAxmD,EAAAkmD,IAAA,IAEAn9G,EAAA20B,EAAAyoF,GAAiB,KAAAnmD,GACjBh3D,EAAA00B,IACA,IAAAsiC,EAAA76D,MAAA,GAEA4D,EAAA20B,EAAAyoF,GAAiB,KAAAnmD,GACjBh3D,EAAA00B,IACA,EACA+oF,EAAA,KAEA,GAAAl8G,KAAA,IACA,uCACA,IAAAozB,EAAA,EACAg8D,EAAA,GACA,KAAAh8D,EAAA0oF,GAAA,CACAr9G,EAAA00B,IACA,IAAAgpF,EAAA19G,EAAAzD,KAAA,GACAo0F,EAAAl2F,IAAA,CAAAijH,GACA/oF,GAAA30B,EAAA7D,MAAA,CAEA,OAAA+5G,MAAAvlB,EACA,EACAgtB,EAAA,CAAA3mD,EAAA4mD,IAAA,KAGAh5G,EACA,IAHA24G,IACAC,EAAAxmD,GAEA,CAAApyD,CAAAA,EAAAg5G,EAAAH,IAAA,GACAD,IAEA,OADAD,IACA34G,CACA,EACA,OAAA+4G,CACA,CAEA,IAAAE,GAAA,CACAC,OAAA,oBAAAx1E,EACAy1E,SAAA,sBAAAz1E,EACA9mC,QAAA,qBAAA8mC,EACAtmC,OAAA,oBAAAsmC,EACA01E,mBAAA,oBAAA11E,GAAAkuE,EAAAluE,GACA21E,cAAA,GAAApqG,OAAAoqG,aAAA,CAAA31E,GACAzsC,MAAA,GAAAE,MAAA6D,OAAA,CAAA0oC,GACA4mC,MAAA,CAAA5mC,EAAA0O,IAAAA,EAAAknE,EAAA,CAAAC,OAAA,CAAA71E,GACAnd,KAAA,sBAAAmd,GAAAz0B,OAAAoqG,aAAA,CAAA31E,EAAA81E,SAAA,CACA,EAEA,SAAAtH,GAAA9/D,CAAA,CAAAqnE,CAAA,CAAAC,EAAA,IACA,IAAAC,EAAA,CAAApvC,EAAAtxE,EAAAm3E,IAAA,CACA,IAAAwpC,EAAAX,EAAA,CAAAhgH,EAAA,CACA,sBAAA2gH,EACA,kCAAA3gH,EAAA,uBACA,IAAAyqC,EAAA0O,CAAA,CAAAm4B,EAAA,CACA,GAAA6F,CAAAA,CAAAA,GAAA1sC,KAAAtpC,IAAAspC,CAAA,GAEA,CAAAk2E,EAAAl2E,EAAA0O,GACA,6BAAA37B,OAAA8zD,GAAA,GAAA7mC,EAAA,WAAAA,EAAA,cAAAzqC,EAAA,IAGA,QAAAsxE,EAAAtxE,EAAA,GAAAG,OAAAkC,OAAA,CAAAm+G,GACAE,EAAApvC,EAAAtxE,EAAA,IACA,QAAAsxE,EAAAtxE,EAAA,GAAAG,OAAAkC,OAAA,CAAAo+G,GACAC,EAAApvC,EAAAtxE,EAAA,IACA,OAAAm5C,CACA,CCvRA,uEAIA,IAAAynE,GAAAj5D,OAAA,GAAAk5D,GAAAl5D,OAAA,GAAAm5D,GAAAn5D,OAAA,GAAAo5D,GAAAp5D,OAAA,GAEAq5D,GAAAr5D,OAAA,GAAAs5D,GAAAt5D,OAAA,GAAAu5D,GAAAv5D,OAAA,GAIA,SAAAw5D,GAAAjkH,CAAA,CAAAkZ,CAAA,EACA,IAAA/U,EAAAnE,EAAqBkZ,EACrB,OAAA/U,GAAAu/G,GAAAv/G,EAAA+U,EAAA/U,CAAA,CASA,SAAAq8C,GAAAh0B,CAAA,CAAkB03F,CAAA,CAAAC,CAAG,EACrB,GAAAA,GAAAT,IAAAQ,EAAAR,GACA,YAAmB,4BAAG,CACtB,GAAAS,IAAeR,GACf,OAAcD,EAAG,CACjB,IAAA75G,EAAA85G,GACA,KAAAO,EAAAR,IACAQ,EAAAP,IACA95G,CAAAA,EAAA,EAAA2iB,EAAA23F,CAAA,EACA33F,EAAA,EAAkBA,EAAG23F,EACrBD,IAAAP,GAEA,OAAA95G,CACA,CAEA,SAAAu6G,GAAA9gH,CAAA,CAAA4gH,CAAA,CAAAC,CAAA,EACA,IAAAt6G,EAAAvG,EACA,KAAA4gH,KAAAR,IACA75G,GAAAA,EACAA,GAAAs6G,EAEA,OAAAt6G,CACA,CAEA,SAAAw6G,GAAAv9G,CAAmB,CAAAq9G,CAAG,EACtB,GAAAr9G,IAAA48G,IAAAS,GAAAT,GACA,yDAAA58G,EAAA,OAAAq9G,EAAA,GAIA,IAAAnkH,EAAAikH,GAAAn9G,EAAAq9G,GACAjrG,EAAAirG,EAEA7gH,EAAAogH,GAAiB/uF,EAAGgvF,GAAAxxD,EAAAwxD,GAAA1+G,EAAAy+G,GACpB,KAAA1jH,IAAA0jH,IAAA,CAEA,IAAAjxD,EAAAv5C,EAAAlZ,EACAsE,EAAA4U,EAAAlZ,EACAqqB,EAAA/mB,EAAA6uD,EAAAM,EACAjyD,EAAAm0B,EAAA1vB,EAAAwtD,CAEAv5C,CAAAA,EAAAlZ,EAAAA,EAAAsE,EAAAhB,EAAA6uD,EAAAx9B,EAAA1vB,EAAAktD,EAAA9nC,EAAAplB,EAAAzE,CAAA,CAEA,IAAAyiD,EAAgB/pC,EAChB,GAAA+pC,IAAA0gE,GACA,MAAW,MAAG,0BACd,OAAAM,GAAA3gH,EAAA6gH,EACA,CASA,SAAAG,GAAAlgE,CAAA,MAOA2O,EAAAtrD,EAAAmhB,EADA,IAAA27F,EAAA,CAAAngE,EAAAu/D,EAAA,EAAAC,GAIA,IAAA7wD,EAAA3O,EAAAu/D,GAAAl8G,EAAA,EAAAsrD,EAAA6wD,KAAAF,GAAA3wD,GAAA6wD,GAAAn8G,GAAA,EAGA,IAAAmhB,EAAAg7F,GAAAh7F,EAAAw7B,GAAA5D,GAAA53B,EAAA27F,EAAAngE,KAAAA,EAAAu/D,GAAA/6F,KAGA,GAAAnhB,IAAAA,EAAA,CACA,IAAA+8G,EAAA,CAAApgE,EAAAu/D,EAAA,EAAAG,GACA,gBAAAX,CAAA,CAAA3iH,CAAA,EACA,IAAAkxB,EAAAyxF,EAAA3iE,GAAA,CAAAhgD,EAAAgkH,GACA,IAAArB,EAAAsB,GAAA,CAAAtB,EAAAuB,GAAA,CAAAhzF,GAAAlxB,GACA,uCACA,OAAAkxB,CACA,CACA,KAEAizF,EAAA,CAAA5xD,EAAA4wD,EAAA,EAAAC,GACA,gBAAAT,CAAA,CAAA3iH,CAAA,EAEA,GAAA2iH,EAAA3iE,GAAA,CAAAhgD,EAAA+jH,KAAApB,EAAAyB,GAAA,CAAAzB,EAAA9hE,GAAA,EACA,uCACA,IAAA/8C,EAAAmD,EAEA+G,EAAA20G,EAAA3iE,GAAA,CAAA2iE,EAAAriE,GAAA,CAAAqiE,EAAA9hE,GAAmC,CAAAz4B,GAAAmqC,GACnCzvD,EAAA6/G,EAAA3iE,GAAA,CAAAhgD,EAAAmkH,GACAzrG,EAAAiqG,EAAA3iE,GAAA,CAAAhgD,EAAAuyD,GACA,MAAAowD,EAAAsB,GAAA,CAAAvrG,EAAAiqG,EAAA9hE,GAAA,IACA,GAAA8hE,EAAAsB,GAAA,CAAAvrG,EAAAiqG,EAAA7hE,IAAgC,EAChC,OAAA6hE,EAAA7hE,IAAA,CAEA,IAAAj3B,EAAA,EACA,QAAAw6F,EAAA1B,EAAAuB,GAAA,CAAAxrG,GACA,EADA5U,IACA6+G,EAAAsB,GAAA,CAAAI,EAAA1B,EAAA9hE,GAAA,EADAh3B,IAGAw6F,EAAA1B,EAAAuB,GAAA,CAAAG,GAGA,IAAAzrD,EAAA+pD,EAAA3iE,GAA4B,CAAAhyC,EAAAm1G,IAAAl5D,OAAAnmD,EAAA+lB,EAAA,IAC5B7b,EAAA20G,EAAAuB,GAAA,CAAAtrD,GACA91D,EAAA6/G,EAAAriE,GAAA,CAAAx9C,EAAA81D,GACAlgD,EAAAiqG,EAAAriE,GAAA,CAAA5nC,EAAA1K,GACAlK,EAAA+lB,CACA,CACA,OAAA/mB,CACA,CACO,CACP,SAAAwhH,GAAA1gE,CAAA,EAKA,GAAAA,EAAA0/D,KAAAD,GAAA,CAKA,IAAAW,EAAA,CAAApgE,EAAAu/D,EAAA,EAAAG,GACA,gBAAAX,CAAA,CAAA3iH,CAAA,EACA,IAAAkxB,EAAAyxF,EAAA3iE,GAAA,CAAAhgD,EAAAgkH,GAEA,IAAArB,EAAAsB,GAAA,CAAAtB,EAAAuB,GAAA,CAAAhzF,GAAAlxB,GACA,uCACA,OAAAkxB,CACA,CACA,IAEA0yB,EAAA4/D,KAAAD,GAAA,CACA,IAAAgB,EAAA,CAAA3gE,EAAA2/D,EAAA,EAAAC,GACA,gBAAiCb,CAAA,CAAA3iH,CAAA,EACjC,IAAAshH,EAAAqB,EAAAriE,GAAA,CAAAtgD,EAAAojH,IACA3+G,EAAAk+G,EAAA3iE,GAAA,CAAAshE,EAAAiD,GACAC,EAAA7B,EAAAriE,GAAA,CAAAtgD,EAAAyE,GACAuB,EAAA28G,EAAAriE,GAAA,CAAAqiE,EAAAriE,GAAA,CAAAkkE,EAAApB,IAAA3+G,GACAysB,EAAAyxF,EAAAriE,GAAA,CAAAkkE,EAAA7B,EAAA1hE,GAAA,CAAAj7C,EAAA28G,EAAA9hE,GAAA,GACA,IAAA8hE,EAAAsB,GAAA,CAAAtB,EAAAuB,GAAA,CAAAhzF,GAAAlxB,GACA,uCACA,OAAAkxB,CACA,CACA,QAwBA4yF,GAAAlgE,EACA,CAtLAqG,OAAA,GAAAA,OAAA,IAwLA,IAAAw6D,GAAA,CAAAz4F,EAAA23F,IAAA,CAAAF,GAAAz3F,EAAA23F,GAAAR,EAAA,IAAAA,GAEAuB,GAAA,CACA,kDACA,oCACA,4BACO,CACP,SAAAC,GAAAhxC,CAAA,EACA,IAAAixC,EAAA,CACAC,MAAA,SACAC,KAAA,SACAC,MAAA,gBACAC,KAAA,eACA,EACAp6G,EAAA85G,GAAA3pG,MAAA,EAAAla,EAAAksC,KACAlsC,CAAA,CAAAksC,EAAA,YACKlsC,GACL+jH,GACA,OAAArJ,GAAA5nC,EAAA/oE,EACA,CAMA,SAAAq6G,GAAAr4E,CAAA,CAAA5gB,CAAA,CAAA03F,CAAA,EAGA,GAAAA,EAAAR,GACA,YAAkB,qBAAG,CACrB,GAAAQ,IAAAR,GACA,OAAAt2E,EAAAiU,GAAkB,CAClB,GAAA6iE,IAAAP,GACA,OAAAn3F,CAAA,CACA,IAAAvE,EAAAmlB,EAAAiU,GAAA,CACAvhD,EAAA0sB,EACA,KAAA03F,EAAAR,IACAQ,EAAAP,IACA17F,CAAAA,EAAAmlB,EAAA0T,GAAA,CAAA74B,EAAAnoB,EAAA,EACAA,EAAAstC,EAAAs3E,GAAA,CAAkB5kH,GAClBokH,IAAAP,GAEA,OAAA17F,CACA,CAKA,SAAAy9F,GAAAt4E,CAAA,CAAAu4E,CAAA,EACA,IAAAvjB,EAAA,MAAAujB,EAAAvkH,MAAA,EAEAwkH,EAAAD,EAAApqG,MAAA,EAAAC,EAAAgR,EAAAhmB,IACA,EAAAq/G,GAAA,CAAAr5F,GACAhR,GACA4mF,CAAA,CAAA57F,EAAA,CAAAgV,EACK4xB,EAAA0T,GAAA,CAAAtlC,EAAAgR,GAFL,CAGA4gB,EAAAiU,GAAA,EAEAykE,EAAA14E,EAAA24E,GAAA,CAAAH,GAQA,OANAD,EAAAK,WAAA,EAAAxqG,EAAAgR,EAAAhmB,IACA,EAAAq/G,GAAA,CAAAr5F,GACAhR,GACA4mF,CAAA,CAAA57F,EAAA,CAAA4mC,EAAA0T,GAAA,CAAAtlC,EAAA4mF,CAAA,CAAA57F,EAAA,EACK4mC,EAAA0T,GAAA,CAAAtlC,EAAAgR,GAFL,CAGAs5F,GACA1jB,CACO,CAaP,SAAA6jB,GAAAzlH,CAAA,CAAA0lH,CAAA,EAEA,IAAAC,EAAAD,KAAAjiH,IAAAiiH,EAAAA,EAAA1lH,EAAA2I,QAAA,IAAA/H,MAAA,CACAglH,EAAallH,KAAAC,IAAA,CAAAglH,EAAA,GACb,OAAAD,WAAAC,EAAAC,YAAAA,CAAA,CACA,CAaA,SAAAC,GAAAhB,CAAiB,CAAAxK,CAAG,CAAA/X,EAAA,GAAAwjB,EAAA,IACpB,GAAAjB,GAAA3B,GACA,MAAY,qCAAuC,EAAA2B,EAAA,GACnD,IAAAa,WAAAV,CAAA,CAAAY,YAAAb,CAAA,EAAAU,GAAAZ,EAAAxK,GACA,GAAA0K,EAAA,KACA,+DACA,IAAAgB,EAAAzB,GAAAO,GACAj4E,EAAAnqC,OAAAquD,MAAA,EACA+zD,MAAAA,EACAG,KAAAA,EACAD,MAAAA,EACAD,KAAcxK,GAAA0K,GACdlkE,KAAaoiE,GACbriE,IAAAsiE,GACA59G,OAAA,GAAAk+G,GAAAz3F,EAAA64F,GACA,QAAA74F,EAAA,CACA,oBAAAA,EACA,MAAmB,MAAG,6CAAwB,SAAAA,EAAA,GACrC,OAAAk3F,IAAAl3F,GAAAA,EAAA64F,CACT,EACAQ,IAAA,GAAAr5F,IAAAk3F,GACA8C,MAAA,GAAsB,CAAAh6F,EAAAm3F,EAAG,IAAAA,GACzBiB,IAAA,GAAAX,GAAA,CAAAz3F,EAAA64F,GACAZ,IAAA,CAAAgC,EAAAC,IAAsBD,IAAGC,EACzBhC,IAAA,GAAAT,GAA2Bz3F,EAAGA,EAAA64F,GAC9B5/G,IAAA,CAAAghH,EAAAC,IAA2BzC,GAAGwC,EAAAC,EAAArB,GAC9B5jE,IAAA,CAAAglE,EAAAC,IAA2BzC,GAAGwC,EAAAC,EAAArB,GAC9BvkE,IAAA,CAAA2lE,EAAAC,IAAAzC,GAAAwC,EAAAC,EAAArB,GACA7kE,IAAA,CAAAh0B,EAAA03F,IAA2BuB,GAAAr4E,EAAG5gB,EAAA03F,GAC9B3jE,IAAA,CAAAkmE,EAAAC,IAAAzC,GAAAwC,EAAApC,GAAAqC,EAAArB,GAAAA,GAEAsB,KAAA,GAAAn6F,EAAAA,EACAo6F,KAAA,CAAAH,EAAAC,IAAAD,EAAAC,EACAG,KAAA,CAAAJ,EAAAC,IAAAD,EAAAC,EACAI,KAAA,CAAAL,EAAAC,IAAAD,EAAAC,EACAX,IAAA,GAAA1B,GAAA73F,EAAA64F,GACA0B,KAAAT,EAAAS,IAAA,MAAAR,EAAAn5E,EAAA5sC,EAAA,EACAwmH,YAAA,GAAAtB,GAAAt4E,EAAAivE,GAGA4K,KAAA,CAAAjnH,EAAAkZ,EAAA+uC,IAAAA,EAAA/uC,EAAkClZ,CAAA,CAClCupD,QAAA,GAAAu5C,EAAA6Y,GAAAnvF,EAAA+4F,GAAA7J,GAAAlvF,EAAA+4F,EAAA,CACA,UAAAhhG,EAAA,CACA,GAAAA,EAAAnjB,MAAA,GAAAmkH,EACA,YAA0B,wBAAe,EAAUA,EAAA,QAAAhhG,EAAenjB,MAAA,IACzD,OAAA0hG,EAAAoY,GAAA32F,GAAA02F,GAAA12F,EAAA,CAET,GACA,OAAAthB,OAAAquD,MAAA,CAAAlkB,EACO,CAkCP,SAAA85E,GAAAC,CAAA,EACA,oBAAAA,EACA,0CACA,IAAAC,EAAAD,EAAAh+G,QAAA,IAAA/H,MAAA,CACA,OAAAF,KAAAC,IAAA,CAAAimH,EAAA,EACA,CAQA,SAAAC,GAAAF,CAAA,EACA,IAAA/lH,EAAA8lH,GAAAC,GACA,OAAA/lH,EAAAF,KAAAC,IAAA,CAAAC,EAAA,EACA,CAcA,SAAAkmH,GAAAzkH,CAAA,CAAAskH,CAAA,CAAArkB,EAAA,IACA,IAAAlpE,EAAA/2B,EAAAzB,MAAA,CACAmmH,EAAAL,GAAAC,GACAK,EAAAH,GAAAF,GAEA,GAAAvtF,EAAA,IAAAA,EAAA4tF,GAAoC5tF,EAAA,KACpC,YAAuB,YAAA4tF,EAAA,0BAAuB,EAAA5tF,EAAe,GAC7D,IAAApN,EAAAs2E,EAAAmY,GAAAp4G,GAAAq4G,GAAAr4G,EAAA,CAEA4kH,EAAkBxD,GAAAz3F,EAAA26F,EAAexD,IAAsBA,GACvD,OAAA7gB,EAAA6Y,GAAA8L,EAAAF,GAAA7L,GAAA+L,EAAAF,EAAA,CC7ZA,uEAIA,IAAMG,GAAGj9D,OAAA,GACTk9D,GAAAl9D,OAAA,GAYA,SAAAm9D,GAAA3/D,CAAA,CAAA81C,CAAA,EACA,IAAA8pB,EAAA,CAAAlgH,EAAA6nC,IAAA,CACA,IAAAo1E,EAAAp1E,EAAAs4E,MAAA,GACA,OAAAngH,EAAAi9G,EAAAp1E,CAAA,EAEApkC,EAAA,IACA,IAAA28G,EAAA7mH,KAAAC,IAAA,CAAA48F,EAAyCrrC,GAAA,EACzCs1D,EAAiB,GAAAt1D,CAAAA,EAAA,GACjB,OAAAq1D,QAAAA,EAAAC,WAAAA,CAAA,CACA,EACA,OACAH,gBAAAA,EAEAI,aAAAC,CAAA,CAAA1nH,CAAA,EACA,IAAAynB,EAAAggC,EAAA3G,IAAA,CACAxhD,EAAAooH,EACA,KAAA1nH,EAAAknH,IACAlnH,EAAAmnH,IACA1/F,CAAAA,EAAAA,EAAAxiB,GAAA,CAAA3F,EAAA,EACAA,EAAAA,EAAsBqoH,MAAA,GACtB3nH,IAAAmnH,GAES,OAAA1/F,CACT,EAWAmgG,iBAAoBF,CAAA,CAAAx1D,CAAA,EACpB,IAAAq1D,QAAAA,CAAA,CAAAC,WAAAA,CAAA,EAAA58G,EAAAsnD,GACA5+B,EAAA,GACA7L,EAAAigG,EACA13E,EAAAvoB,EACA,QAAA1Z,EAAA,EAAAA,EAAAw5G,EAAAx5G,IAAA,CACAiiC,EAAAvoB,EACA6L,EAAAp0B,IAAA,CAAA8wC,GAEA,QAAAhqC,EAAA,EAAAA,EAAAwhH,EAAAxhH,IACAgqC,EAAAA,EAAA/qC,GAAA,CAAAwiB,GACA6L,EAAAp0B,IAAA,CAAA8wC,GAEAvoB,EAAAuoB,EAAA23E,MAAA,EACA,CACS,OAAAr0F,CACT,EAQA8zF,KAAAl1D,CAAA,CAAA21D,CAAA,CAAA7nH,CAAA,EAGA,IAAAunH,QAAAA,CAAA,CAAAC,WAAAA,CAAA,EAAA58G,EAAAsnD,GACAzqC,EAAAggC,EAAA3G,IAAA,CACAlU,EAAA6a,EAAAqgE,IAAA,CACA5jH,EAAA+lD,OAAA,GAAAiI,EAAA,GACA61D,EAAA,GAAA71D,EACA81D,EAAA/9D,OAAiCiI,GACjC,QAAAnkD,EAAA,EAAAA,EAAAw5G,EAAAx5G,IAAA,CACA,IAAA4K,EAAA5K,EAAAy5G,EAEAS,EAAA3vG,OAAAtY,EAAAkE,GAEAlE,IAAAgoH,EAGAC,EAAAT,IACAS,GAAyBF,EACzB/nH,GAAAmnH,IASA,IAAAe,EAAAvvG,EACAwvG,EAAAxvG,EAAAjY,KAAA+uB,GAAA,CAAAw4F,GAAA,EACAG,EAAAr6G,EAAA,KACAs6G,EAAAJ,EAAA,CACAA,CAAA,IAAAA,EAEAr7E,EAAAA,EAAA3nC,GAAA,CAAAoiH,EAAAe,EAAAP,CAAA,CAAAK,EAAA,GAGAzgG,EAAAA,EAAAxiB,GAAA,CAAAoiH,EAAAgB,EAAAR,CAAA,CAAAM,EAAA,EAEA,CAMS,OAAA1gG,EAAAA,EAAAmlB,EAAAA,CAAA,CACT,EACA07E,WAAA1kE,CAAA,CAAA2kE,CAAA,CAAAvoH,CAAA,CAAA+xC,CAAA,EAEA,IAAAmgB,EAAAtO,EAAA4kE,YAAA,IAEAC,EAAAF,EAAA9lG,GAAA,CAAAmhC,GAOS,OANT6kE,IACAA,EAAA,KAAAb,gBAAA,CAAAhkE,EAAAsO,GACA,IAAAA,GACAq2D,EAAAxjH,GAAA,CAAA6+C,EAAA7R,EAAA02E,KAGS,KAAArB,IAAA,CAAAl1D,EAAAu2D,EAAAzoH,EACT,CACA,CACO,CACP,SAAI0oH,GAAaC,CAAA,EAYjB,OAXIhE,GAAcgE,EAAAhG,EAAA,EAClBpH,GAAAoN,EAAA,CACA3oH,EAAA,SACAm5B,EAAA,SACAyvF,GAAA,QACKC,GAAA,OACL,GACAnD,WAAA,gBACKE,YAAA,eACL,GAEWnjH,OAAOquD,MAAA,EAClB,GAAA20D,GAAAkD,EAAA3oH,CAAA,CAAA2oH,EAAAjD,UAAA,EACA,GAAAiD,CAAa,CACRlhG,EAAAkhG,EAAAhG,EAAA,CAAAkC,KAAA,EAEL,CC1JA,uEAQA,IAAAiE,GAAA7+D,OAAA,GAAA8+D,GAAA9+D,OAAA,GAAA++D,GAAA/+D,OAAA,GAAAg/D,GAAAh/D,OAAA,GAEAi/D,GAAA,CAAAC,OAAA,IACA,SAAAC,GAAiBT,CAAA,EACb,IAAA/9G,EAAA89G,GAAiBC,GAarB,OAZApN,GAAAoN,EAAA,CACA/4F,KAAA,WACApwB,EAAA,SACAF,EAAA,SACK+pH,YAAA,UACL,GACAC,kBAAA,WACAC,OAAA,WACAC,QAAA,WACKC,WAAA,UACL,GAEAhnH,OAAAquD,MAAA,KAAAlmD,CAAA,EACA,CAEA,SAAA8+G,GAAAC,CAAA,EACA,IAAAC,EAAYR,GAAAO,GACZ,CAAAhH,GAAAA,CAAA,CAAA3iH,EAAiB6pH,CAAG,CAAAC,QAAAA,CAAA,CAAAl6F,KAAAm6F,CAA+B,CAAAV,YAAAA,CAAG,CAAAzD,YAAAA,CAAA,CAAAzsF,EAAA6wF,CAAA,EAAAJ,EACtD9E,EAAAkE,IAA4B/+D,OAAA27D,EAAAA,GAAAmD,GAC5BkB,EAAAtH,EAAAp9G,MAAA,CAEAikH,EAAAI,EAAAJ,OAAA,EACA,EAAA73D,EAAAltD,IAAA,CACA,IACA,OAAAm+G,QAAA,GAAAxgH,MAAAugH,EAAA4D,IAAA,CAAA50D,EAAAgxD,EAAA4C,GAAA,CAAA9gH,GAAA,CACA,CACA,MAAAsC,EAAA,CACA,OAAA67G,QAAA,GAAAxgH,MAAA0mH,EAAA,CACS,CACT,GACAQ,EAAAM,EAAAN,iBAAA,MAAAvlG,CAAA,EACAwlG,EAAAK,EAAAL,MAAA,EACA,EAAAnoH,EAAAvB,EAAAqqH,IAAA,CACA,GAAArqH,EAAAe,MAAA,EAAAspH,EACA,mDACY,OAAA9oH,CACZ,GACA+oH,EAAA,oBAAAnqH,GAAA8oH,GAAA9oH,EACAoqH,EAAA,CAAApqH,EAAA+rC,IAAAo+E,EAAsCnqH,IAAAmqH,EAAGp+E,IAAA/rC,EAAA+rC,EACzCs+E,EAAA,GAAArqH,IAAA8oH,IAAAsB,EAAApqH,EAAA8kH,GACA,SAAAwF,EAAAtqH,CAAA,CAAA+rC,CAAA,EAEA,GAAAq+E,EAAApqH,EAAA+rC,GACA,OAAA/rC,CAAA,OACA,iCAAA+rC,EAAA,eAAA/rC,EAAA,GAAAA,EAAA,GAEA,SAAAuqH,EAAAvqH,CAAA,EAEA,OAAAA,IAAA8oH,GAAA9oH,EAAAsqH,EAAAtqH,EAAA6pH,EAAA,CAEA,IAAAW,EAAA,IAAA1lH,IACA,SAAA2lH,EAAAnmF,CAAA,EACA,IAAAA,CAAAA,aAAAomF,CAAA,EACA,sCAIA,MAAAA,EACA/oH,YAAA0rD,CAAA,CAAAs9D,CAAA,CAAAC,CAAA,CAAAh4D,CAAA,EAKA,GAJA,KAAAvF,EAAA,CAAAA,EACA,KAAAs9D,EAAA,CAAAA,EACA,KAAAC,EAAA,CAAAA,EACA,KAAAh4D,EAAA,CAAAA,EACA,CAAAy3D,EAAAh9D,GACA,0BACA,IAAAg9D,EAAAM,GACA,0BACA,IAAAN,EAAAO,GACA,0BACA,IAAAP,EAAAz3D,GACA,0BAEA,IAAA9vD,GAAA,CACA,YAAA+nH,QAAA,GAAA/nH,CAAA,CAEA,IAAAqxB,GAAA,CACA,YAAA02F,QAAA,GAAA12F,CAAA,CAEA,OAAA22F,WAAArjG,CAAA,EACA,GAAAA,aAAAijG,EACA,MAAoB,MAAO,8BAC3B,IAAA5nH,EAAAA,CAAA,CAAAqxB,EAAAA,CAAA,EAAA1M,GAAA,GACA,IAAA4iG,EAAAvnH,IAAA,CAAAunH,EAAAl2F,GACA,mCAAsC,CACtC,WAAAu2F,EAAA5nH,EAAAqxB,EAAA40F,GAAAkB,EAAAnnH,EAAAqxB,GACA,CACA,OAAA42F,WAAAz3F,CAAA,EACA,IAAA03F,EAAArI,EAAA6D,WAAA,CAAAlzF,EAAAzyB,GAAA,IAAA4mB,EAAAmjG,EAAA,GACA,OAAAt3F,EAAAzyB,GAAA,EAAA4mB,EAAAzhB,IAAAyhB,EAAAojG,QAAA,CAAAG,CAAA,CAAAhlH,EAAA,GAAAnF,GAAA,CAAA6pH,EAAAI,UAAA,CACA,CAEAG,eAAAzD,CAAA,EACA,KAAAgB,YAAA,CAAAhB,EACAgD,EAAArsD,MAAA,MACA,CAGA+sD,gBAAoB,CACpB,IAAA1rH,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAAsqH,EACA,QAAAvE,GAAA,GACA,+BAGA,IAAAh4D,GAAAiF,CAAA,CAAAq4D,GAAAn4D,CAAA,CAAAo4D,GAAoCxiG,CAAA,CAAAwqC,GAAA76B,CAAA,OACpCozF,EAAAlB,EAAA33D,EAAAA,GACA84D,EAAAnB,EAAAz3D,EAAAA,GACA64D,EAAApB,EAAA7hG,EAAAA,GACAkjG,EAAArB,EAAAoB,EAAAA,GACAE,EAAAtB,EAAAkB,EAAA3rH,GACAo7C,EAAAqvE,EAAAoB,EAAApB,EAAAsB,EAAAH,IACA1wE,EAAAuvE,EAAAqB,EAAArB,EAAA3qH,EAAA2qH,EAAAkB,EAAAC,KACA,GAAAxwE,IAAAF,EACA,qDAEA,IAAA8wE,EAAAvB,EAAA33D,EAAAE,GACAi5D,EAAAxB,EAAA7hG,EAAA2P,GACA,GAAAyzF,IAAAC,EACA,qDAGA5mE,OAAAvgB,CAAA,EACAmmF,EAAoBnmF,GACpB,IAAoB+oB,GAAAq+D,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,EAAyB,KAC7C,CAAAv+D,GAAA89D,CAAA,CAAAR,GAAAS,CAAA,CAAAR,GAAAS,CAAA,EAAA/mF,EACAunF,EAAA5B,EAAAyB,EAAAL,GACAS,EAAA7B,EAAAkB,EAAAS,GACAG,EAAA9B,EAAA0B,EAAAN,GACAW,EAAA/B,EAAAmB,EAAAQ,GACA,OAAAC,IAAAC,GAAAC,IAAAC,CACA,CACA3G,KAAA,CACA,YAAAxgE,MAAA,CAAA6lE,EAAA5pE,IAAA,CACA,CACAwmE,QAAA,CAEA,WAAAoD,EAAAT,EAAA,MAAA58D,EAAA,OAAAs9D,EAAA,MAAAC,EAAA,CAAAX,EAAA,MAAAr3D,EAAA,EACA,CAIA+0D,QAAA,CACA,IAAoBnoH,EAAAA,CAAA,EAAAoqH,EACpB,CAAAv8D,GAAAq+D,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAqCgB,CAAA,OACrCxtD,EAAA6rD,EAAAyB,EAAAA,GACAj6D,EAAAw4D,EAA2B0B,EAAAA,GAC3Bn6D,EAAAy4D,EAAAjB,GAAmCiB,EAAA2B,EAAAA,IACnCl6D,EAAAu4D,EAAAzqH,EAAA4+D,GACA6tD,EAAAP,EAAAC,EACA/6D,EAAAq5D,EAAAA,EAA6BgC,EAAAA,GAAA7tD,EAAA3M,GAC7BU,EAAAT,EAAAD,EACA9yC,EAAAwzC,EAAAX,EACAY,EAAAV,EAAAD,EACAy6D,EAAAjC,EAAAr5D,EAAAjyC,GACAwtG,EAAAlC,EAAA93D,EAAAC,GACAg6D,EAAAnC,EAAAr5D,EAAAwB,GACAi6D,EAAApC,EAAAtrG,EAAAwzC,GACA,WAAAu4D,EAAAwB,EAAAC,EAAAE,EAAAD,EACA,CAIAnnH,IAAAq/B,CAAA,EACAmmF,EAAoBnmF,GACpB,IAAoB9kC,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAAsqH,EACpB,CAAoBv8D,GAAAq+D,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,CAAAh5D,GAAA05D,CAAA,EAAiC,KACrD,CAAAj/D,GAAA89D,CAAA,CAAAR,GAAAS,CAAA,CAAAR,GAAAS,CAAA,CAAAz4D,GAAA25D,CAAA,EAAAjoF,EAKA,GAAA9kC,IAAAyqD,OAAA,KACA,IAAAmU,EAAA6rD,EAAA,CAAA0B,EAAAD,CAAA,EAAAN,CAAAA,EAAAD,CAAA,GACA15D,EAAAw4D,EAAA,CAAA0B,EAAAD,CAAA,EAAAN,CAAAA,EAAAD,CAAA,GACAxsG,EAA0BsrG,EAAAx4D,EAAA2M,GAC1B,GAAAz/C,IAAAmqG,GACA,YAAAnB,MAAoC,GACpC,IAAAn2D,EAAAy4D,EAAA2B,EAAoC5C,GAAGuD,GACvC76D,EAAAu4D,EAAAqC,EAAAtD,GAAAqC,GACAz6D,EAAAc,EAAAF,EACAW,EAAAV,EAAA2M,EACAhM,EAAAV,EAAAF,EACA06D,EAAAjC,EAAAr5D,EAAAjyC,GACAwtG,EAAAlC,EAAA93D,EAAAC,GACAg6D,EAAAnC,EAAAr5D,EAAAwB,GACAi6D,EAAApC,EAAAtrG,EAAAwzC,GACA,WAAAu4D,EAAAwB,EAAAC,EAAAE,EAAAD,EACA,KACAhuD,EAAA6rD,EAAAyB,EAAAP,GACA15D,EAAAw4D,EAAA0B,EAAAP,GACA55D,EAAAy4D,EAAAqC,EAAAhtH,EAAAitH,GACA76D,EAAAu4D,EAAA2B,EAAAP,GACAz6D,EAAAq5D,EAAA,CAAAyB,EAA6BC,CAAA,EAAAR,CAAAA,EAAAC,CAAA,EAAAhtD,EAAA3M,GAC7B9yC,EAAA+yC,EAAAF,EACAW,EAAAT,EAAAF,EACAY,EAAA63D,EAAAx4D,EAAAjyD,EAAA4+D,GACA8tD,EAAAjC,EAAAr5D,EAAAjyC,GACAwtG,EAAAlC,EAAA93D,EAAAC,GACAg6D,EAAAnC,EAAAr5D,EAAAwB,GACAi6D,EAAApC,EAAAtrG,EAAAwzC,GACA,WAAAu4D,EAAAwB,EAAAC,EAAAE,EAAAD,EACA,CACAI,SAAAloF,CAAA,EACA,YAAAr/B,GAAA,CAAAq/B,EAAAgjF,MAAA,GACA,CACAF,KAAApnH,CAAA,EACA,OAAAysH,EAAAnE,UAAA,MAAAkC,EAAAxqH,EAAA0qH,EAAAK,UAAA,CACA,CAEA2B,SAAAC,CAAoB,EACpB,IAAAllG,EAAAA,CAAA,CAAAmlB,EAAAA,CAAA,OAAAw6E,IAAA,CAAAkD,EAAAqC,EAAA9C,IACA,OAAAa,EAAAK,UAAA,EAAAtjG,EAAAmlB,EAAA,KAMAggF,eAAAD,CAAA,EACA,IAAA3sH,EAAAuqH,EAAsBoC,UACtB,IAAA7D,GACA+D,EACA,KAAAhoE,MAAA,CAAAgoE,IAAA7sH,IAAA+oH,GACA,KACA,KAAAlkE,MAAA,CAAAsN,GACA,KAAAi1D,IAAA,CAAApnH,GAAAynB,CAAA,CACAglG,EAAAhF,YAAA,MAAAznH,EALA,CAWA8sH,cAAA,CACA,YAAAF,cAAA,CAAA5C,GAAA3E,GAAA,EACA,CAGA0H,eAAA,CACA,OAAAN,EAAAhF,YAAA,MAAAoC,GAAAxE,GAAA,EACA,CAGAwF,SAAAmC,CAAA,CAAoB,CACpB,IAAA3/D,GAAAvqD,CAAA,CAAA6nH,GAAAx2F,CAAA,CAAAy2F,GAAAx2F,CAAA,OACAixF,EAAA,KAAAA,GAAA,GACA,MAAA2H,GACAA,CAAAA,EAAA3H,EAAA4D,GAAAtG,EAAA4C,GAAA,CAAAnxF,EAAA,EACA,IAAA64F,EAAAhD,EAAAnnH,EAAAkqH,GACAE,EAAAjD,EAAA91F,EAAA64F,GACAG,EAAAlD,EAAA71F,EAAA44F,GACA,GAAA3H,EACA,MAAuB,CAAAviH,EAAAgmH,GAAG30F,EAAA40F,EAAA,EAC1B,GAAAoE,IAAApE,GACA,MAAqB,0BACrB,OAAAjmH,EAAAmqH,EAAA94F,EAAA+4F,CAAA,CACA,CACAE,eAAoB,CACpB,IAAAj0F,EAAA6wF,CAA6B,EAAAJ,SAC7B,IAAAb,GACA,KACA,KAAA6D,cAAA,CAAA5C,EADA,CAKA,OAAAqD,QAAoBr8D,CAAA,CAAOm4D,EAAA,IAC3B,IAAA7pH,EAAAA,CAAA,CAAAE,EAAAA,CAAA,EAAAoqH,EACkBxwF,EAAAupF,EAAAoC,KAAA,CAClB/zD,EAAA6pD,GAAA,WAAwC7pD,EAAA53B,GACxC,IAAAk0F,EAAAt8D,EAAAhwD,KAAA,GACAusH,EAAAv8D,CAAA,CAAA53B,EAAA,GACAk0F,CAAA,CAAAl0F,EAAsB,GAAAm0F,KAAAA,EACtB,IAAAp5F,EAAsBumF,GAAG4S,GACzBn5F,IAAA20F,KAKAK,EACAmB,EAAAn2F,EAAA2wF,GAEAwF,EAAAn2F,EAAAwuF,EAAAkC,KAAA,GAIA,IAAA2I,EAAAvD,EAAA91F,EAAgCA,GAChCw9B,EAAAs4D,EAAAuD,EAAAzE,IACkBtkH,EAAAwlH,EAAA3qH,EAAAkuH,EAAAhuH,GAClB,CAAAojH,QAAAA,CAAA,CAAAxgH,MAAAU,CAAA,EAAA0mH,EAAA73D,EAAAltD,GACA,IAAAm+G,EACA,YAAgC,sCAAc,CAC9C,IAAA6K,EAAA,CAAA3qH,EAAAimH,EAAA,IAAAA,GACA2E,EAAiC,CAAAH,IAAAA,CAAG,KACpC,IAAApE,GAAArmH,IAAAgmH,IAAA4E,EAEA,4CAGA,OAFAA,IAA8BD,GAC9B3qH,CAAAA,EAAAmnH,EAAA,CAAAnnH,EAAA,EACA4nH,EAAAI,UAAA,EAAAhoH,EAAAA,EAAAqxB,EAAAA,CAAA,EACA,CACA,OAAAw5F,eAAAC,CAAA,EACA,OAAAC,EAAAD,GAAAE,KAAA,CAEAC,YAAoB,CACpB,IAAAjrH,EAAAA,CAAA,CAAAqxB,EAAAA,CAAA,CAA0B,MAAA02F,QAAA,GAC1B9mG,EAAAo3F,GAA2ChnF,EAAAwuF,EAAGoC,KAAA,EAE9C,OADAhhG,CAAA,CAAAA,EAAAnjB,MAA0B,KAAAkC,EAAAimH,GAAA,MAC1BhlG,CACA,CACAiqG,OAAA,CACA,OAAAxT,EAAA,KAAAuT,UAAA,GACA,CACA,CACArD,EAAA5C,IAAA,KAAA4C,EAA2Bd,EAAAhB,EAAA,CAAGgB,EAAEf,EAAA,CAAAE,GAAKkB,EAAKL,EAAAhB,EAAA,CAAGgB,EAAGf,EAAA,GAChD6B,EAAA5pE,IAAY,KAAA4pE,EAAA5B,GAAmBC,GAAAA,GAAAD,IAC/B,IAAAhB,KAAiB31D,CAAA,CAAIrR,KAAA+rE,CAAA,EAAAnC,EACrB+B,EAAArF,GAAAsD,EAAA9E,EAAAA,GACA,SAAAqI,EAAezuH,CAAA,EACf,OAAAikH,GAAAjkH,EAAAqqH,EACA,CAEA,SAAAqE,EAAoBt+F,CAAA,EACpB,OAAAq+F,EAAAvT,GAAA9qF,GACA,CAEA,SAAAi+F,EAAAxrH,CAAA,EACA,IAAc+2B,EAAAwsF,EACdvjH,EAAAw4G,GAAA,cAAAx4G,EAAA+2B,GAGA,IAAA+0F,EAAAtT,GAAA,qBAA8DkP,EAAA1nH,GAAA,EAAA+2B,GAC9D7D,EAAA+zF,EAAA6E,EAAAntH,KAAmD,GAAAo4B,IACnD+7C,EAAAg5C,EAAAntH,KAAA,CAAAo4B,EAAsC,EAAAA,GACtCuzF,EAAAuB,EAAA34F,GACAu4F,EAAA37D,EAAAu6D,QAAA,CAAAC,GACAyB,EAAiBN,EAAAC,UAAA,GACjB,OAAAx4F,KAAAA,EAAA4/C,OAAAA,EAAAw3C,OAAAA,EAAAmB,MAAAA,EAAAM,WAAAA,CAAA,CACA,CAEA,SAAAp0B,EAAA4zB,CAAA,EACA,OAAAC,EAAAD,GAAAQ,UAAA,CAGA,SAAAC,EAAoBzqH,EAAc,IAAAsI,UAAA,IAAAoiH,CAAA,EAClC,IAAApsH,EAAAy4G,MAAyC2T,GACzC,OAAAJ,EAAAnE,EAAAR,EAAArnH,EAAA24G,GAAA,UAAAj3G,GAAA,EAAAkmH,IACA,CAEA,SAAA1hH,EAAclG,CAAA,CAAA0rH,CAAA,CAAW5pH,EAAA,IACzB9B,EAAA24G,GAAA,UAAA34G,GACA4nH,GACA5nH,CAAAA,EAAgB4nH,EAAA5nH,EAAA,EAChB,IAAAizE,OAAAA,CAAA,CAAAw3C,OAAAA,CAAA,CAAAyB,WAAAA,CAAA,EAAAP,EAAoED,GACpE9pH,EAAAuqH,EAAArqH,EAAAJ,OAA8C,CAAAuxE,EAAAjzE,GAC9C2vD,EAAAM,EAAAu6D,QAAA,CAAA5oH,GAAAiqH,UAAA,GACAvpH,EAAA6pH,EAAArqH,EAAwCJ,OAAA,CAAAiuD,EAAAu8D,EAAAlsH,GACxCwC,EAAAupH,EAAsBnqH,EAAAU,EAAAmoH,GACtBpC,EAAA7lH,GACA,IAAA2E,EAAesxG,GAAW9oD,EAAAspD,GAAAz2G,EAAkCi+G,EAAAoC,KAAA,GAC5D,OAAAlK,GAAA,SAAAxxG,EAAAu8G,EAAAA,EACA,CACA,IAAA2I,EAAArF,GACA,SAAAsF,EAAgBC,CAAA,CAAAvsH,CAAA,CAAAX,CAAkB,CAAAyC,EAAAuqH,CAAA,MAUlCnwD,EAAAvM,EAAA68D,EATA,IAAA9qH,QAAAA,CAAA,CAAAulH,OAAAA,CAA8B,EAAAnlH,EAChBo1B,EAAAupF,EAAAoC,KAAA,CACd0J,EAAc5T,GAAW,YAAA4T,EAAA,EAAAr1F,GACzBl3B,EAAA24G,GAAA,UAAA34G,GACA4nH,GACA5nH,CAAAA,EAAkB4nH,EAAA5nH,EAAA,EAClB,IAAAwC,EAAAg2G,GAAA+T,EAAAztH,KAAA,CAAAo4B,EAAA,EAAAA,IAIA,IACAglC,EAAAssD,EAAA2C,OAAA,CAAA9rH,EAAA4nH,GACAt3D,EAAA64D,EAAA2C,OAAA,CAAAoB,EAAAztH,KAAsC,GAAAo4B,GAAA+vF,GACtCuF,EAAAv8D,EAAAy6D,cAAA,CAAAloH,EACA,CACA,MAAAkB,EAAA,CACA,QACA,CACA,IAAAujH,GAAA/qD,EAAA0uD,YAAA,GACA,SACA,IAAAtoH,EAAA6pH,EAAAzqH,EAAAiuD,EAAAk8D,UAAA,GAAA3vD,EAAA2vD,UAAA,GAAA7rH,GACAysH,EAAA98D,EAAA5sD,GAAA,CAAAm5D,EAAAwuD,cAAA,CAAApoH,IAEA,OAAAmqH,EAAAnC,QAAA,CAAAkC,GAAAtB,aAAA,GAAAvoE,MAAA,CAAA6lE,EAAA5pE,IAAA,CACA,CACAqR,EAAA84D,cAAA,IACA,IAAAznE,EAAA,CACAqqE,qBAAAA,EAEAe,iBAAA,IAAAvF,EAAA1G,EAAAoC,KAAA,EAOA8J,WAAAA,CAAArH,EAAA,EAAAsG,EAAApD,EAAA5C,IAAA,IACAgG,EAAA7C,cAAA,CAAAzD,GACAsG,EAAApB,QAAA,CAAAziE,OAAA,IACS6jE,EAET,EACA,OACAlE,MAAAA,EACA5vB,aAAAA,EACA5xF,KAAAA,EACAomH,OAAAA,EACAM,cAAApE,EACAlnE,MAAAA,CACA,CACA,CCva8C,uEAc9C,IAAAurE,GAAA9kE,OAAA,iFAEA+kE,GAAA/kE,OAAA,iFAEAglE,GAAAhlE,OAAA,GAAAilE,GAAAjlE,OAAA,GAAAklE,GAAAllE,OAAA,GAAAA,OAAA,GAEA,IAAAmlE,GAAAnlE,OAAA,GAAAolE,GAAAplE,OAAA,GACA,SAAAqlE,GAAAxsH,CAAA,EAEA,IAAAysH,EAAAtlE,OAAA,IAAAulE,EAAAvlE,OAAA,IAAAwlE,EAAAxlE,OAAA,IAAAylE,EAAAzlE,OAAA,IACArG,EAAAmrE,GACAY,EAAA,EAAA7sH,EAAA8gD,EACAgsE,EAAA,EAAgB9sH,EAAA8gD,EAChBisE,EAAA,GAAoBD,EAAKT,GAAGvrE,GAAAgsE,EAAAhsE,EAC5BksE,EAAA,GAAqBD,EAAAX,GAAQtrE,GAAA9gD,EAAA8gD,EAC7BmsE,EAAA,GAAqBD,EAAAV,GAAAxrE,GAAAksE,EAAAlsE,EACrBosE,EAAA,GAAqBD,EAAAR,EAAA3rE,GAAAmsE,EAAAnsE,EACrBqsE,EAAA,GAAqBD,EAAAR,EAAA5rE,GAAAosE,EAAApsE,EACrBssE,EAAA,GAAsBD,EAAAR,EAAA7rE,GAAAqsE,EAAArsE,EACtBusE,EAAA,GAAsBD,EAAAR,EAAA9rE,GAAAssE,EAAAtsE,EACtBwsE,EAAA,GAAsBD,EAAAT,EAAA9rE,GAAAssE,EAAAtsE,EACtBysE,EAAA,GAAuBD,EAAIb,EAAO3rE,GAAAmsE,EAAGnsE,EACrC0sE,EAAA,GAAAD,EAAAlB,GAAAvrE,GAAA9gD,EAAA8gD,EAEA,OAAA0sE,UAAAA,EAAAV,GAAAA,CAAA,CACA,CACA,SAAAtG,GAAAvlG,CAAA,EAQA,OALAA,CAAA,SAEAA,CAAA,UAEAA,CAAA,SACAA,CACA,CAEA,SAAAylG,GAAA73D,CAAA,CAAAltD,CAAA,EACA,IAAAm/C,EAAAmrE,GACAwB,EAAe9M,GAAGh/G,EAAAA,EAAAA,EAAAm/C,GAClB4sE,EAAA/M,GAAA8M,EAAAA,EAAA9rH,EAAAm/C,GAEA5D,EAAYsvE,GAAG39D,EAAA6+D,GAAmBF,SAAA,CAClCxtH,EAAA2gH,GAAgB9xD,EAAG4+D,EAAAvwE,EAAA4D,GACnB6sE,EAAAhN,GAAqBh/G,EAAA3B,EAAAA,EAAA8gD,GACrB8sE,EAAkB5tH,EAClB6tH,EAAAlN,GAAA3gH,EAAgCksH,GAAAprE,GAChCgtE,EAAAH,IAA6B9+D,EAC7Bk/D,EAAAJ,IAA2BhN,GAAG,CAAA9xD,EAAA/N,GAC9BktE,EAAAL,IAAAhN,GAAA,CAAA9xD,EAAAq9D,GAAAprE,GAOA,OANAgtE,GACA9tH,CAAAA,EAAA4tH,CAAA,EACAG,CAAAA,GAAmBC,CAAA,GACXhuH,CAAAA,EAAA6tH,CAAA,EACRlM,GAAe3hH,EAAA8gD,IACf9gD,CAAAA,EAAA2gH,GAAa,CAAA3gH,EAAA8gD,EAAA,EACb,CAAAg/D,QAAAgO,GAAAC,EAAAzuH,MAAAU,CAAA,CACA,CAYA,IAAA6/G,GAAAkD,GAAAkJ,GAAAtrH,KAAAA,EAAA,IACAstH,GAAA,CAEAvxH,EAAAyqD,OAAA,IAGA3qD,EAAA2qD,OAAA,iFAEA04D,GAAAA,GAGA3iH,EAAAiqD,OAAA,gFAEA9wB,EAAAk2F,GAEAzG,GAAA3+D,OAAA,iFACA4+D,GAAA5+D,OAAU,iFACVr6B,KAAAywF,EACAgJ,YAAA7lE,EAAAwtE,EAAA,CACA1H,kBAAAA,GAICE,QAAAA,EACM,EACPyH,GAAAvH,GAAAqH,IAsIA,SAAAG,GAAA5sF,CAAA,EACA,IAAAA,CAAAA,aAAA6sF,EAAA,EACA,uCAGA,IAAAC,GAAA,KAEAC,GAAA,KAEAC,GAAA,KAEAC,GAAA,KAEAC,GAAA,KAEAC,GAAA,GAAAjI,GAAiC0F,GAAA5oH,GACjCorH,GAAA,KACAC,GAAA,GAAAV,GAAArH,KAAA,CAAAjH,EAAA,CAAAp9G,MAAA,CAAAqsH,gBAAA7tG,GAAA2tG,IAGA,SAAAG,GAAgBC,CAAA,EAChB,IAAAxyH,EAAAA,CAAA,EAAA2xH,GAAArH,KAAA,CACAhmE,EAAAqtE,GAAArH,KAAA,CAAAjH,EAAA,CAAAkC,KAAA,CACAt6F,EAAA0mG,GAAArH,KAAA,CAAAjH,EAAA,CAAAp9G,MAAsC,CACtCzB,EAAAymB,EAAA6mG,GAAwBU,EAAAA,GACxBC,EAAAxnG,EAAA,CAAAzmB,EAAwBorH,EAAA,EAAAqC,IACxB9pE,EAAAwC,OAAA,IACUyH,EAAAnnC,EAAA,CAAAk9B,EAAAnoD,EAAAwE,CAAAA,EAAAymB,EAAAzmB,EAAAxE,IACV,CAAAsjH,QAAAoP,CAA0B,CAAA5vH,MAAAsC,CAAA,EAAA8kH,GAAAuI,EAAArgE,GAC1BugE,EAAA1nG,EAAA7lB,EAAAotH,GACAI,aAAAD,EAAAruE,IACAquE,CAAAA,EAAA1nG,EAAA,CAAA0nG,EAAA,EACAD,GACAttH,CAAAA,EAAAutH,CAAA,EACAD,GACAvqE,CAAAA,EAAA3jD,CAAAA,EACA,IAAAsqD,EAAA7jC,EAAAk9B,EAAA3jD,CAAAA,EAAAorH,EAAA,EAAAsC,GAAA9/D,GACAygE,EAAAztH,EAAAA,EACA0tH,EAAA7nG,EAAA,CAAA7lB,EAAAA,CAAAA,EAAAgtD,GACA2gE,EAAA9nG,EAAmB6jC,EAAAijE,IACnBiB,EAAA/nG,EAAmB2kG,GAAGiD,GACtBI,EAAAhoG,EAAA2kG,GAAAiD,GACA,WAAAlB,GAAAnC,aAAA,CAAAvkG,EAAA6nG,EAAAG,GAAAhoG,EAAA+nG,EAAAD,GAAA9nG,EAAA8nG,EAAAE,GAAAhoG,EAAA6nG,EAAAE,GACA,CAQA,MAAAnB,GAGAxvH,YAAA6wH,CAAA,EACA,KAAAA,EAAA,CAAAA,CACA,CACA,OAAA1H,WAAA2H,CAAA,EACA,WAAAtB,GAAAF,GAAAnC,aAAA,CAAAhE,UAAA,CAAA2H,GACA,CAQA,OAAAC,YAAA1hE,CAAA,EACAA,EAAA2hE,YAAA,gBAAA3hE,EAAA,IACA,IAAA4hE,EAAAjB,GAAA3gE,EAAAhwD,KAAA,QACA6xH,EAAAhB,GAAAe,GACAE,EAAAnB,GAAA3gE,EAAAhwD,KAAA,SACA+xH,EAAAlB,GAAAiB,GACA,WAAA3B,GAAA0B,EAAA5tH,GAAA,CAAA8tH,GACA,CAMA,OAAA1F,QAAAr8D,CAAA,EACAA,EAAA2hE,YAAuB,eAAA3hE,EAAA,IACvB,IAAAxxD,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAA2xH,GAAArH,KAAA,CACAhmE,EAAAqtE,GAAArH,KAAA,CAAAjH,EAAA,CAAAkC,KAAA,CACAt6F,EAAA0mG,GAAArH,KAAA,CAAAjH,EAAA,CAAAp9G,MAAA,CACAytH,EAAA,0EACAtuH,EAAAitH,GAAA3gE,GAGA,IAAAiiE,WAAAC,gBAAAxuH,EAAA,IAAAssD,IAAAkhE,aAAAxtH,EAAAk/C,GACA,YAAAovE,EAAA,CACA,IAAAb,EAAA5nG,EAAuB7lB,EAAAA,GACvByuH,EAAA5oG,EAAuB2kG,GAAG1vH,EAAA2yH,GAC1BiB,EAAA7oG,EAAA2kG,GAAA1vH,EAAA2yH,GACAkB,EAAA9oG,EAAA4oG,EAAAA,GACAG,EAAA/oG,EAAA6oG,EAAAA,GACA3uH,EAAgB8lB,EAAA/qB,EAAAF,EAAA+zH,EAAoBC,GACpC,CAAA1Q,QAAAA,CAAA,CAAAxgH,MAAgCyqH,CAAA,EAAA4E,GAAAlnG,EAAA9lB,EAAA6uH,IAChCC,EAAAhpG,EAAAsiG,EAAAuG,GACAI,EAAAjpG,EAAAsiG,EAAA0G,EAAA9uH,GACA3B,EAAAynB,EAAA,CAAA7lB,EAAAA,CAAAA,EAAA6uH,GACArB,aAAyBpvH,EAAA8gD,IACzB9gD,CAAAA,EAAAynB,EAAA,CAAAznB,EAAA,EACA,IAAAqxB,EAAA5J,EAAA4oG,EAAAK,GACA3uH,EAAA0lB,EAAAznB,EAAAqxB,GACA,IAAAyuF,GAAAsP,aAAArtH,EAAA++C,IAAAzvB,IAAA86F,GACA,YAAA+D,EAAA,CACA,WAAA7B,GAAA,IAAAF,GAAAnC,aAAA,CAAAhsH,EAAAqxB,EAAA+6F,GAAArqH,GACA,CAKAkpH,YAAc,CACd,IAWAr8D,EAXA,CAAArE,GAAAvqD,CAAA,CAAA6nH,GAAAx2F,CAAA,CAAAy2F,GAAAx2F,CAAA,CAAAw+B,GAAA/tD,CAAA,OAAA2tH,EAAA,CACA5uE,EAAAqtE,GAAArH,KAAA,CAAAjH,EAAA,CAAAkC,KAAA,CACAt6F,EAAA0mG,GAAArH,KAAA,CAAAjH,EAAA,CAAAp9G,MAAA,CACA4tH,EAAA5oG,EAAAA,EAAA6J,EAA+BD,GAAA5J,EAAA6J,EAAAD,IAC/Bi/F,EAAA7oG,EAAAznB,EAAAqxB,GAEAs/F,EAAgBlpG,EAAA6oG,EAAAA,GAChB,CAAAhxH,MAAAsxH,CAAA,EAAAjC,GAAsClnG,EAAA4oG,EAAAM,IACtCE,EAAAppG,EAAAmpG,EAAAP,GACAS,EAAArpG,EAAAmpG,EAAAN,GACAS,EAAetpG,EAAAopG,EAAAC,EAAA/uH,GAEf,GAAAqtH,aAAArtH,EAAAgvH,EAAAjwE,GAAA,CACA,IAAAkwE,EAAAvpG,EAAA4J,EAAAi9F,IACA2C,EAAAxpG,EAAAznB,EAAAsuH,IACAtuH,EAAAgxH,EACA3/F,EAAA4/F,EACAriE,EAAAnnC,EAAAopG,EAAArC,GACA,MAEA5/D,EAAAkiE,CACA,CACA1B,aAAyBpvH,EAAA+wH,EAAAjwE,IACzBzvB,CAAAA,EAAA5J,EAAA,CAAA4J,EAAA,EACA,IAAAzvB,EAAA6lB,EAAA,CAAA6J,EAAAD,CAAAA,EAAAu9B,GAGA,OAFAwgE,aAAAxtH,EAAAk/C,IACAl/C,CAAAA,EAAA6lB,EAAA,CAAA7lB,EAAA,EACAwuH,gBAAAxuH,EAAA,GACA,CACAspH,OAAA,CACA,OAAAgG,WAAA,KAAAjG,UAAA,GACA,CACAplH,UAAA,CACA,YAAAqlH,KAAA,EACA,CAEAnpE,OAAAvgB,CAAA,EACA4sF,GAAgB5sF,GAChB,IAAgB+oB,GAAAq+D,CAAA,CAAAf,GAAAgB,CAAA,EAAiB,KAAA6G,EAAA,CACjC,CAAAnlE,GAAA89D,CAAA,CAAAR,GAAAS,CAAA,EAAA9mF,EAAAkuF,EAAA,CACAjoG,EAAA0mG,GAAArH,KAAA,CAAAjH,EAAA,CAAAp9G,MAAA,CAEA0uH,EAAA1pG,EAAAmhG,EAAAN,KAAA7gG,EAAAohG,EAAAR,GACA+I,EAAA3pG,EAAAohG,EAAAP,KAAA7gG,EAAAmhG,EAAAP,GACA,OAAA8I,GAAAC,CACA,CACAjvH,IAAAq/B,CAAA,EAEA,OADA4sF,GAAA5sF,GACA,IAAA6sF,GAAA,KAAAqB,EAAA,CAAAvtH,GAAA,CAAAq/B,EAAAkuF,EAAA,EACA,CACAhG,SAAAloF,CAAA,EAEA,OADA4sF,GAAA5sF,GACA,IAAA6sF,GAAA,KAAAqB,EAAA,CAAAhG,QAAA,CAAAloF,EAAAkuF,EAAA,EACA,CACA9F,SAAAC,CAAA,EACA,WAAAwE,GAAA,KAAAqB,EAAA,CAAA9F,QAAA,CAAAC,GACA,CACAC,eAAAD,CAAA,EACA,WAAAwE,GAAA,KAAAqB,EAAA,CAAA5F,cAAA,CAAAD,GACA,CACAhF,QAAA,CACA,WAAAwJ,GAAA,KAAAqB,EAAA,CAAA7K,MAAA,GACA,CACAL,QAAA,CACA,WAAA6J,GAAA,KAAAqB,EAAA,CAAAlL,MAAA,GACA,CACO,CAgBP,IAAAjoD,GAAAhgE,EAAA,MAAA2hG,GAAA3hG,EAAAW,CAAA,CAAAq/D,IAAAjO,GAAA/xD,EAAA,IAAA80H,GAAA90H,EAAAW,CAAA,CAAAoxD,IAAAgjE,GAAA/0H,EAAA,MAAAg1H,GAAAh1H,EAAA,MAAA8Y,GAAA9Y,EAAA,MAAAi1H,GAAAj1H,EAAA,IC3aA,OAAAoC,WAAAC,UACAC,YAAAC,CAAA,CAAAC,CAAA,MACAC,EACA,IAAgBC,QAAAA,CAAO,CAAAwyH,YAAAA,CAAA,IAAAvyH,EAAA,CAAAJ,EACvB,CAAAK,KAAAA,CAAA,EAAAL,EACAM,EAAAD,IAAAA,EAAArB,MAAA,CAAAmB,EAAA,YAAAE,EAAAE,IAAA,YAAAJ,EAAA,EACA,MAAAwyH,GAAAryH,GACA,MAAAqyH,GACA,MAAAC,KAAA,CAAAtyH,CAAA,EACAO,OAAAC,MAAA,MAAAV,GACA,KAAAW,IAAA,MAAAhB,WAAA,CAAAgB,IAAA,CACA,KAAAd,QAAA,KACAC,GAAAA,CAAAA,EAAA,CAAAF,KAAAC,IAAA,CAEA,EAMA,SAAAgB,GAAAC,CAAA,EACA,OAAAC,GAAAD,IAAA,mBAAAA,CAAA,CAAAE,OAAAC,QAAA,EAKA,SAAAF,GAAAD,CAAA,EACA,uBAAAA,GAAAA,IAAA,EAAAA,CACA,CAIA,SAAA2xH,GAAA3xH,CAAA,EACA,OAAAC,GAAAD,IAAA,CAAAtC,MAAA6D,OAAA,CAAAvB,EACA,CAcA,SAAAI,GAAAd,CAAA,QACA,iBAAAA,EACAA,EAAAuG,QAAA,GAEA,iBAAAvG,EAAAe,KAAAC,SAAA,CAAAhB,GAAA,GAAAA,EAAA,EAMA,SAAAiB,GAAYC,CAAc,EAC1B,IAAAC,KAAAA,CAAA,CAAAnB,MAAAA,CAAA,EAAAkB,EAAAE,IAAA,GACA,OAAAD,EAAAE,KAAAA,EAAArB,CAAA,CAKA,SAAAsB,GAAAC,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EACA,GAAAuB,CAAA,IAAAA,EACA,MAOA,EALA,IAAAA,EACAA,EAAA,GAEmB,UAAnB,OAAmBA,GACnBA,CAAAA,EAAA,CAAA5B,QAAA4B,CAAA,GAEA,IAAY1B,KAAAA,CAAA,CAAAO,OAAAA,CAAO,EAAAoB,EACnB,CAAYtB,KAAAA,CAAA,EAAAhB,EACZ,CAAAiB,WAAAA,CAAA,CAAAR,QAAAA,EAAA,8BAAAO,EAAA,IAAAC,EAAA,sBAAAA,EAAA,2BAAAW,GAAAd,GAAA,KAAAuB,EACA,OACAvB,MAAAA,EACAE,KAAAA,EACAC,WAAAA,EACAF,IAAAJ,CAAA,CAAAA,EAAArB,MAAA,IACAqB,KAAAA,EACAO,OAAAA,EACA,GAAAmB,CAAA,CACA5B,QAAAA,CACA,CACA,CAIA,SAAA8B,GAAAF,CAAA,CAAAC,CAAA,CAAAtC,CAAA,CAAAc,CAAA,EAIA,QAAA0B,KAHAjB,GAAAc,IACAA,CAAAA,EAAA,CAAAA,EAAA,EAEAA,GAAA,CACA,IAAA/B,EAAA8B,GAAAI,EAAAF,EAAAtC,EAAAc,GACAR,GACA,OAAAA,CAAA,CAEA,CACA,CAKA,SAAAmC,GAAY3B,CAAA,CAAAd,CAAA,CAAA0C,EAAA,IACZ,IAAA/B,KAAAA,EAAkB,GAAAO,OAAAA,EAAA,CAAAJ,EAAA,CAAA6B,OAAAA,EAAA,GAAAC,KAAAA,EAAA,IAAAF,EAClBnE,EAAA,CAAAoC,KAAAA,EAAAO,OAAAA,EAAA0B,KAAAA,CAAA,EACAD,GACA7B,CAAAA,EAAAd,EAAA6C,OAAA,CAAA/B,EAAAvC,EAAA,EAEA,IAAA6N,EAAA,QACA,QAAA9L,KAAAN,EAAAiD,SAAA,CAAAnC,EAAAvC,GACA+B,EAAA2yH,WAAA,CAAAvwH,EAAAjC,OAAA,CACA2L,EAAA,YACA,MAAA9L,EAAA6B,KAAAA,EAAA,CAEA,QAAAe,EAAAC,EAAAC,EAAA,GAAApD,EAAAqD,OAAA,CAAAvC,EAAAvC,GAAA,CACA,IAAA+E,EAAAb,GAAAU,EAAAC,EAAA,CACAzC,KAAAuC,KAAAf,IAAAe,EAAAvC,EAAA,IAAAA,EAAAuC,EAAA,CACAhC,OAAAgC,KAAAf,IAAAe,EAAAhC,EAAA,IAAAA,EAAAiC,EAAA,CACAR,OAAAA,EACAC,KAAAA,EACSnC,QAAAiC,EAAAjC,OAAA,GAET,QAAA8C,KAAAD,EACAC,CAAA,KACA6I,EAAA7I,IAAA,EAAAA,CAAA,IAAAtC,UAAA,2BACA,MAAAsC,CAAA,IAAApB,KAAAA,EAAA,EAEAQ,IACAQ,EAAAI,CAAA,IACAL,KAAAf,IAAAe,EACApC,EAAAqC,EAEArC,aAAA0C,IACA1C,EAAA2C,GAAA,CAAAP,EAAAC,GAEArC,aAAA4C,IACA5C,EAAA6C,GAAA,CAAAR,GAEA1B,GAAAX,IACAqC,CAAAA,KAAAhB,IAAAgB,GAAAD,KAAApC,CAAA,GACAA,CAAAA,CAAA,CAAAoC,EAAA,CAAAC,CAAAA,EAIA,CACA,GAAAiJ,cAAAA,EACA,QAAA9L,KAAAN,EAAA4D,OAAA,CAAA9C,EAAAvC,GACA+B,EAAA2yH,WAAA,CAAAvwH,EAAAjC,OAAA,CACA2L,EAAA,cACA,MAAA9L,EAAA6B,KAAAA,EAAA,CAGA,UAAAiK,GACA,OAAAjK,KAAAA,EAAArB,EAAA,CACA,CAQA,MAAA+C,GACAxD,YAAgByD,CAAA,EAChB,IAAA9C,KAAAA,CAAA,CAAA8B,OAAAA,CAAA,CAAAG,UAAAA,CAAA,CAAAW,QAAAA,CAAA,CAAAf,QAAAA,EAAA,GAAA/B,CAAA,CAAAuC,QAAAA,EAAA,eAAAS,CACA,MAAA9C,IAAA,CAAAA,EACA,KAAA8B,MAAA,CAAAA,EACA,KAAAO,OAAA,CAAAA,EACA,KAAAR,OAAA,CAAAA,EACAI,EACA,KAAAA,SAAA,EAAAnC,EAAAwB,IAAA,CACA,IAAAD,EAAAY,EAAAnC,EAAAwB,GACA,OAAAC,GAAAF,EAAAC,EAAA,KAAAxB,EACA,EAGA,KAAAmC,SAAA,QAEAW,EACA,KAAAA,OAAA,EAAA9C,EAAAwB,IAAA,CACA,IAAAD,EAAAuB,EAAA9C,EAAAwB,GACA,OAAAC,GAAAF,EAAAC,EAAA,KAAAxB,EACA,EAGA,KAAA8C,OAAA,QAMAI,OAAAlD,CAAA,CAAAL,CAAA,EACA,OAAAuD,GAAAlD,EAAA,KAAAL,EACA,CAIAwD,OAAAnD,CAAA,CAAAL,CAAA,EACA,OAAAwD,GAAAnD,EAAA,KAAAL,EACA,CAIAyD,GAAApD,CAAA,EACA,OAAAoD,GAAApD,EAAA,KACA,CAMA8B,KAAA9B,CAAA,CAAAL,CAAA,EACA,OAAAmC,GAAA9B,EAAA,KAAAL,EACA,CAUA0D,SAAArD,CAAA,CAAA4B,EAAA,IACA,OAAAyB,GAAArD,EAAA,KAAA4B,EACA,CACA,CAIA,SAAAsB,GAAAlD,CAAA,CAAAd,CAAA,CAAAS,CAAA,EACA,IAAA4B,EAAA8B,GAAArD,EAAAd,EAAA,CAAAS,QAAAA,CAAA,GACA,GAAA4B,CAAA,IACA,MAAAA,CAAA,IAMA,SAAA4B,GAAAnD,CAAA,CAAAd,CAAA,CAAAS,CAAA,EACA,IAAA4B,EAAA8B,GAAArD,EAAAd,EAAA,CAAA2C,OAAA,GAAAlC,QAAAA,CAAA,GACA,IAAA4B,CAAA,IAIA,OAAAA,CAAA,UAHAA,CAAA,IASA,SAAAO,GAAA9B,CAAA,CAAAd,CAAA,CAAAS,CAAA,EACA,IAAA4B,EAAA8B,GAAArD,EAAAd,EAAA,CAAA2C,OAAA,GAAAC,KAAA,GAAAnC,QAAAA,CAAA,GACA,IAAA4B,CAAA,IAIA,OAAAA,CAAA,UAHAA,CAAA,IASA,SAAA6B,GAAApD,CAAA,CAAAd,CAAA,EACA,IAAAqC,EAAA8B,GAAArD,EAAAd,GACA,OAAAqC,CAAA,IAMA,SAAA8B,GAAArD,CAAA,CAAAd,CAAA,CAAA0C,EAAA,IACA,IAAA0B,EAAA3B,GAAA3B,EAAAd,EAAA0C,GACA2B,EAAAtC,GAAAqC,GACA,GAAAC,CAAA,KACA,IAAAC,EAAA,IAAAnE,GAAAkE,CAAA,gBACA,QAAAd,KAAAa,EACAb,CAAA,KACA,OAAAA,CAAA,IAGA,GACA,OAAAe,EAAAnC,KAAAA,EAAA,CAKA,CAFA,IAAAgB,EAAAkB,CAAA,IACA,OAAAlC,KAAAA,EAAAgB,EAAA,CACA,CAYA,SAAAiwH,GAAA/xH,CAAwB,CAAA4B,CAAA,EACxB,WAAAY,GAAA,CAAA7C,KAAAK,EAAAyB,OAAA,KAAAG,UAAAA,CAAA,EACA,CAoJA,SAAAuB,IAAW,CACX,OAAA4uH,GAAA,aACA,CACA,SAAAp0H,GAAAyF,CAAA,EACA,WAAAZ,GAAA,CACA7C,KAAA,QACA8B,OAAA2B,EACA,CAAApB,QAAAvC,CAAA,EACA,GAAA2D,GAAAvF,MAAA6D,OAAA,CAAAjC,GACA,QAAA4D,EAAAvB,EAAA,GAAArC,EAAAuC,OAAA,GACA,MAAAqB,EAAAvB,EAAAsB,EAAA,EAIA5B,QAAAA,GACS3D,MAAA6D,OAAA,CAAAjC,GAAAA,EAAApB,KAAA,GAAAoB,CAAA,CAETmC,UAAAA,GACA/D,MAAA6D,OAAA,CAAAjC,IACS,0CAAAc,GAAAd,GAAA,GAGT,CAYA,SAAAuyH,IAAiB,CACjB,OAAAD,GAAA,aACK,kBAAAtyH,EAEL,CAwCA,SAAAwyH,GAAWz2B,CAAM,EACjB,OAAAu2B,GAAA,cACAtyH,aAA4B+7F,GACvB,gBAAAA,EAAAx7F,IAAA,8BAAAO,GAAAd,GAAA,EAEL,CAkCA,SAAA8D,GAAAC,CAAA,EACA,IAAAC,EAAAlD,GAAAiD,GACAtB,EAAA,OAAAsB,EACA,WAAAhB,GAAA,CACA7C,KAAA,UACA8B,OAAAS,WAAAA,GAAAA,WAAAA,GAAAA,YAAAA,EAAAsB,EAAA,KACA5B,UAAAA,GACAnC,IAAA+D,GACS,0BAAAC,EAAA,oBAAAlD,GAAAd,GAAA,GAGT,CAyBA,SAAAyyH,IAAW,CACX,OAAAH,GAAA,eACA,CAIA,SAAAruH,GAAA/E,CAAA,EACA,WAAA6D,GAAA,CACA,GAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACKqF,QAAA,CAAA9C,EAAAvC,IAAAuC,IAAA,GAAAA,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACL,EACA,CAIA,SAAAyG,IAAW,CACX,OAAAouH,GAAA,YACA,iBAAAtyH,GAAA,CAAAmE,MAAgDnE,IAC3C,oCAAAc,GAAAd,GAAA,EAEL,CA6CA,SAAAoE,GAAAlF,CAAA,EACA,WAAA6D,GAAA,CACA,GAAA7D,CAAA,CACAiD,UAAA,CAAAnC,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAAiD,SAAA,CAAAnC,EAAAvC,GACKqF,QAAA,CAAA9C,EAAAvC,IAAAuC,KAAAqB,IAAArB,GAAAd,EAAA4D,OAAA,CAAA9C,EAAAvC,EACL,EACA,CAOA,SAAAi1H,GAAAC,CAAA,CAAAC,CAAA,EACA,WAAA7vH,GAAA,CACA7C,KAAA,SACA8B,OAAA,KACA,CAAAO,QAAAvC,CAAA,EACA,GAAAW,GAAAX,GACA,QAAAoC,KAAApC,EAAA,CACA,IAAAqC,EAAArC,CAAA,CAAAoC,EAAA,MACA,CAAAA,EAAAA,EAAAuwH,EAAA,CACA,MAAAvwH,EAAAC,EAAAuwH,EAAA,CAES,EAETzwH,UAAAA,GACAkwH,GAAAryH,IACS,qCAAAc,GAAAd,GAAA,EAET+B,QAAAA,GACSswH,GAAAryH,GAAA,IAAAA,CAAA,EAAAA,CAAA,EAGT,CAmCA,SAAAqE,IAAW,CACX,OAAAiuH,GAAA,YACA,iBAAAtyH,GACK,oCAAAc,GAAAd,GAAA,EAEL,CAKA,SAAAuD,GAAAiB,CAAA,EACA,IAAAquH,EAAAJ,KACA,WAAA1vH,GAAA,CACA7C,KAAA,QACA8B,OAAA,KACA,CAAAO,QAAAvC,CAAA,EACA,GAAA5B,MAAA6D,OAAA,CAAAjC,GAAA,CACA,IAAAxB,EAAAF,KAAgCqrC,GAAA,CAAAnlC,EAAYhG,MAAA,CAAAwB,EAAAxB,MAAA,EAC5C,QAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,IACA,MAAAA,EAAA5D,CAAA,CAAA4D,EAAA,CAAAY,CAAA,CAAAZ,EAAA,EAAAivH,EAAA,CAES,EAET1wH,UAAAA,GACA/D,MAAA6D,OAAA,CAAAjC,IACS,oCAAAc,GAAAd,GAAA,EAET+B,QAAAA,GACS3D,MAAA6D,OAAA,CAAAjC,GAAAA,EAAApB,KAAA,GAAAoB,CAAA,EAGT,CAOA,SAAAE,GAAA8B,CAAA,EACA,IAAAsC,EAAAjE,OAAAiE,IAAA,CAAAtC,GACA,WAAAe,GAAA,CACA7C,KAAA,OACA8B,OAAAA,EACA,CAAAO,QAAAvC,CAAA,EACA,GAAAW,GAAAX,GACA,QAAAoC,KAAAkC,EACA,MAAAlC,EAAApC,CAAA,CAAAoC,EAAA,CAAAJ,CAAA,CAAAI,EAAA,GAIAD,UAAAA,GACAkwH,GAAAryH,IACS,qCAAAc,GAAAd,GAAA,EAET+B,QAAAA,GACSswH,GAAAryH,GAAA,IAAAA,CAAA,EAAAA,CAAA,EAGT,CAIA,SAAAib,GAAAzW,CAAA,EACA,IAAAR,EAAAQ,EAAA/F,GAAA,IAAA6D,EAAApC,IAAA,EAAAH,IAAA,QACA,WAAAgD,GAAA,CACA7C,KAAA,QACA8B,OAAA,KACAD,QAAA/B,CAAA,CAAAvC,CAAA,EACA,QAAAoH,KAAAL,EAAA,CACA,IAAAhB,EAAAsvH,EAAA,CAAAjuH,EAAAxB,QAAA,CAAArD,EAAA,CACA6B,OAAA,GACiBC,KAAArE,EAAAqE,IAAA,GAEjB,IAAA0B,EACA,OAAAsvH,CACA,CAES,OAAA9yH,CACT,EACAmC,UAAAnC,CAAA,CAAAvC,CAAA,EACA,IAAAgC,EAAA,GACA,QAAAoF,KAAAL,EAAA,CACA,OAAAlB,EAAA,CAAA3B,GAAA3B,EAAA6E,EAAApH,GACA,CAAAqH,EAAA,CAAAxB,EACA,IAAAwB,CAAA,IACA,SAGA,QAAAtF,EAAA,GAAA8D,EACA9D,GACAC,EAAA3C,IAAA,CAAA0C,EAIA,CACA,OACA,8CAAAwE,EAAA,oBAAAlD,GAAAd,GAAA,KACAP,EACS,CAET,EACA,CAIA,SAAAmF,IAAW,CACX,OAAA0tH,GAAA,kBAaA,SAAAzwH,GAAA3C,CAAA,CAAA6F,CAAA,CAAAhD,CAAA,EACA,WAAAgB,GAAA,CACA,GAAA7D,CAAA,CACA6C,QAAA,CAAA/B,EAAAvC,IACA2F,GAAApD,EAAA+E,GACA7F,EAAA6C,OAAA,CAAAA,EAAA/B,EAAAvC,GAAAA,GACSyB,EAAA6C,OAAA,CAAA/B,EAAAvC,EAAA,EAGT,CA+IA,IAAAs1H,GAAA91H,EAAA,MAAA+1H,GAAA/1H,EAAAW,CAAA,CAAAm1H,IAAAE,GAAAh2H,EAAA,ME5/BAi2H,GAAA,cAAAD,GACAE,MAAA,aAQAt2E,CAAA,CAAAj7C,CAAA,CAAAwxH,CAAA,EACA,QACA,KAAAD,MAAA,KAAAxnH,OAAA0nH,SAAA,CAAAx2E,EAAAu2E,GACA,KAAAD,MAAA,CAAAG,MAAA,UAAAz1D,IAAA,SACA,KAAAs1D,MAAA,CAAAI,SAAA,SAAA11D,IAAA,WAAAkW,EAAA/0E,IAAA,EACA,KAAAm0H,MAAA,CAAAr0G,OAAA,SAAA++C,IAAA,SAAAr6D,GACA,KAAA2vH,MAAA,CAAAK,OAAA,KACA,KAAA31D,IAAA,SAAAkW,EAAAlsE,IAAA,CAAAksE,EAAA7oB,MAAA,CACA,CACA,CASAjnC,KAAAjlB,CAAA,CAAAy0H,CAAA,CAAA5yG,CAAA,EACA,IAAA6yG,EAAA7yG,GAAA4yG,EACA,IACA,KAAAN,MAAA,CAAAlvG,IAAA,CAAAjlB,GACM00H,GACN,OAAAlwH,EAAA,CACAkwH,EAAAlwH,EACA,CACA,CASAmwH,MAAA9rH,CAAA,CAAAqjD,CAAA,EACA,KAAAioE,MAAA,CAAAQ,KAAA,CAAA9rH,EAAAqjD,EACA,CACArnC,iBAAA3jB,CAAA,CAAA49D,CAAA,CAAAl8D,CAAA,EACA,KAAAuxH,MAAA,CAAAtvG,gBAAA,CAAA3jB,EAAA49D,EAAAl8D,EACA,CACA,EACA,SAAAyxH,GAAAx2E,CAAA,CAAAj7C,CAAA,EACA,WAAAsxH,GAAAr2E,EAAAj7C,EAAA,CAIA,IAAAgyH,GAAA,MACA30H,OAAAe,CAAA,EACA,OAAAe,KAAAC,SAAA,CAAAhB,EACA,CACAqW,OAAArW,CAAA,EACA,OAAAe,KAAA2f,KAAA,CAAA1gB,EACA,GAIA6zH,GAAA,cAAAZ,GACAp2E,OAAA,CACAi3E,MAAA,CACAC,KAAA,CACAnyH,OAAA,CACAoyH,WAAA,CACAC,KAAA,CACAC,SAAA,CACAC,kBAAA,CACAC,kBAAA,CACAC,cAAA,CACAC,YAAA,CACAC,kBAAA,CACAC,mBAAA,CACArB,MAAA,CACAsB,gBAAA,CACAC,QAAA,aAWAD,CAAA,CAAA53E,EAAA,uBACAm3E,YAAAA,EAAA,GACAE,UAAAA,EAAA,GACAE,mBAAAA,EAAA,IACAC,eAAAA,EAAA,EACI,GAAAC,EACJ,IAAAE,CAAA,CAAAE,CAAA,EACA,QACA,KAAAD,gBAAA,CAAAA,EACA,KAAAV,KAAA,IACA,KAAAD,MAAA,GACA,KAAAj3E,OAAA,CAAAA,EACA,KAAAm3E,WAAA,CAAAA,EACA,KAAAC,KAAA,IACA,KAAAC,SAAA,CAAAA,EACA,KAAAC,kBAAA,QACA,KAAAC,kBAAA,CAAAA,EACA,KAAAC,cAAA,CAAAA,EACA,KAAAC,YAAA,CAAAA,EACA,KAAAC,kBAAA,GACA,KAAAC,mBAAA,CAAAA,GAAA,YAAAV,MAAA,EACAY,EACA,KAAAA,QAAA,CAAAA,EADA,KAAAA,QAAA,KAAAd,GAEA,KAAAI,WAAA,EACA,KAAAW,QAAA,MAAA93E,OAAA,EACAm3E,YAAA,KAAAA,WAAA,CACAE,UAAA,KAAAA,SAAA,CACAE,mBAAA,KAAAA,kBAAA,CACAC,eAAA,KAAAA,cAAA,CACO,QAAAC,YAAA,EAEP,CAMAM,SAAA,CACA,KAAAzB,MAAA,EACA,KAAAwB,QAAA,MAAA93E,OAAA,EACAm3E,YAAA,KAAAA,WAAA,CACAE,UAAA,KAAAA,SAAA,CACAE,mBAAA,KAAAA,kBAAA,CACAC,eAAA,KAAAA,cAAA,CACK,QAAAC,YAAA,EAEL,CAUAroH,KAAAgV,CAAA,CAAAyb,CAAA,CAAAm4F,CAAA,CAAAC,CAAA,EAKA,OAJAA,GAAA,iBAAAD,IACAC,EAAAD,EACAA,EAAA,MAEA,IAAAr2G,QAAA,CAAAI,EAAAH,IAAA,CACA,SAAAw1G,KAAA,QAAAx1G,EAAA,2BACA,IAAAq1G,EAAA,KAAAU,mBAAA,CAAAvzG,EAAAyb,GACA/8B,EAAA,CACAgI,QAAA,MACAsZ,OAAAA,EACAyb,OAAAA,GAAA,OACA90B,GAAAksH,CACA,EACA,KAAAX,MAAA,CAAAlvG,IAAA,MAAAywG,QAAA,CAAAz1H,MAAA,CAAAU,GAAAm1H,EAAA,IACA,GAAAtxH,EAAA,OAAAib,EAA+Bjb,EAAA,CAC/B,KAAAuwH,KAAA,CAAAD,EAAA,EAAA70G,QAAA,CAAAL,EAAAH,EAAA,EACAo2G,GACA,MAAAd,KAAA,CAAAD,EAAA,CAAAe,OAAA,CAAAj0C,WAAA,KACA,YAAAmzC,KAAA,CAAAD,EAAA,CACWr1G,EAAA,uBACX,EAAAo2G,EAAA,CAEK,EACL,EACA,CAOA,MAAAE,MAAAr4F,CAAA,EACA,IAAAu7C,EAAA,WAAAhsE,IAAA,aAAAywB,GACA,IAAAu7C,EAAA,qCACA,OAAAA,CACA,CAMA,MAAA+8C,aAAA,CACA,kBAAA/oH,IAAA,iBACA,CAQAgpH,OAAAh0G,CAAA,CAAAyb,CAAA,EACA,WAAAle,QAAA,CAAAI,EAAAH,IAAA,CACA,SAAAw1G,KAAA,QAAAx1G,EAAA,2BACA,IAAA9e,EAAA,CACAgI,QAAA,MACAsZ,OAAAA,EACAyb,OAAAA,CACA,EACA,KAAAy2F,MAAA,CAAAlvG,IAAA,MAAAywG,QAAA,CAAAz1H,MAAA,CAAAU,GAAA,IACA,GAAA6D,EAAA,OAAAib,EAAAjb,EAAA,CACOob,GACF,EACL,EACA,CAQA,MAAA++C,UAAAoW,CAAA,EACA,iBAAAA,GAAAA,CAAAA,EAAA,CAAAA,EAAA,EACA,IAAAxyE,EAAA,WAAA0K,IAAA,UAAA8nE,GACA,oBAAAA,GAAAxyE,OAAAA,CAAA,CAAAwyE,EAAA,CACA,YACA,mCAAAA,EAAA,WAAAxyE,CAAA,CAAAwyE,EAAA,CACA,CACA,OAAAxyE,CACA,CAQA,MAAAw8D,YAAAgW,CAAA,EACA,iBAAAA,GAAAA,CAAAA,EAAA,CAAAA,EAAA,EACA,IAAAxyE,EAAA,WAAA0K,IAAA,WAAA8nE,GACA,oBAAAA,GAAAxyE,OAAAA,CAAA,CAAAwyE,EAAA,CACA,wDAAAxyE,EAAA,CACA,OAAAA,CACA,CAQAoyH,MAAA9rH,CAAA,CAAA7I,CAAA,EACA,KAAAm0H,MAAA,CAAAQ,KAAA,CAAA9rH,GAAA,IAAA7I,EACA,CAOAk2H,iBAAAhB,CAAA,EACA,KAAAA,SAAA,CAAAA,CACA,CAOAiB,qBAAAC,CAAA,EACA,KAAAhB,kBAAA,CAAAgB,CACA,CAOAC,iBAAAhB,CAAA,EACA,KAAAA,cAAA,CAAAA,CACA,CASAM,SAAA93E,CAAA,CAAAj7C,CAAA,EACA0zH,aAAA,KAAAnB,kBAAA,EACA,KAAAhB,MAAA,MAAAsB,gBAAA,CAAA53E,EAAAj7C,GACA,KAAAuxH,MAAA,CAAAtvG,gBAAA,aACA,KAAAowG,KAAA,IACA,KAAAp2D,IAAA,SACK,KAAA02D,kBAAA,EACL,GACA,KAAApB,MAAA,CAAAtvG,gBAAA,aAAA7kB,KAAAW,CAAA,KACAA,aAAkB2d,aAClB3d,CAAAA,EAAAy5G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAhc,GAAA4G,QAAA,IACA,IACQ5G,EAAA,KAAA+0H,QAAA,CAAAr+G,MAAA,CAAA1W,EACR,OAAA6D,EAAA,CACA,MACA,CACA,GAAA7D,EAAA41H,YAAA,OAAA58C,SAAA,CAAAh5E,EAAA41H,YAAA,EAAA/2H,MAAA,EACA,IAAA6B,OAAAiE,IAAA,CAAA3E,EAAA+8B,MAAA,EAAAl+B,MAAA,CACA,YAAAq/D,IAAA,CAAAl+D,EAAA41H,YAAA,EACA,IAAAzuH,EAAA,CAAAnH,EAAA41H,YAAA,EACA,GAAA51H,EAAA+8B,MAAA,CAAAn9B,WAAA,GAAAc,OAAAyG,EAAAhK,IAAA,CAAA6C,EAAA+8B,MAAA,OAEA,QAAA94B,EAAA,EAAAA,EAAAjE,EAAA+8B,MAAA,CAAAl+B,MAAA,CAAAoF,IACAkD,EAAAhK,IAAA,CAAA6C,EAAA+8B,MAAA,CAAA94B,EAAA,EACA,OAAA4a,QAAAI,OAAA,GAAA2B,IAAA,MACS,KAAAs9C,IAAA,CAAAx/D,KAAA,MAAAyI,EACT,EACA,IACA,MAAAitH,KAAA,CAAAp0H,EAAAiI,EAAA,SACA,EAAAqZ,MAAA,CACAzC,QAAAI,OAAA,GAAA2B,IAAA,MACW,KAAAs9C,IAAA,CAAAl+D,EAAAshB,MAAA,CAAAthB,GAAA+8B,OACX,GAEA,MADA,CAGA,UAAA/8B,GAAA,WAAAA,GACA,KAAAo0H,KAAA,CAAAp0H,EAAAiI,EAAA,EAAAqX,OAAA,IACA,MACA,+FAGA,KAAA80G,KAAA,CAAAp0H,EAAAiI,EAAA,EAAAitH,OAAA,EACAS,aAAA,KAAAvB,KAAA,CAAAp0H,EAAAiI,EAAA,EAAAitH,OAAA,EACAl1H,EAAA6D,KAAA,MAAAuwH,KAAA,CAAAp0H,EAAAiI,EAAA,EAAAqX,OAAA,IAAAtf,EAAA6D,KAAA,EACA,KAAAuwH,KAAA,CAAAp0H,EAAAiI,EAAA,EAAAqX,OAAA,IAAAtf,EAAA4B,MAAA,EACK,YAAAwyH,KAAA,CAAAp0H,EAAAiI,EAAA,IAEL,KAAAurH,MAAA,CAAAtvG,gBAAA,YAA6C,KAAAg6C,IAAc,SAAAr6D,IAC3D,KAAA2vH,MAAA,CAAAtvG,gBAAA,WAAAhc,KAAAA,CAAA,CAAAqjD,OAAAA,CAAA,KACA,KAAA+oE,KAAA,EACArzC,WAAA,SAAA/iB,IAAA,SAAAh2D,EAAAqjD,GAAA,GACA,KAAA+oE,KAAA,IACA,KAAAd,MAAA,QACA,MAAAtrH,IACA,KAAA0sH,kBAAA,GACA,KAAAL,SAAA,QAAAG,cAAA,MAAAE,kBAAA,WAAAF,cAAA,GACA,MAAAF,kBAAA,CAAAvzC,WACA,SAAA+zC,QAAA,CAAA93E,EAAAj7C,GACA,KAAAwyH,kBAAA,CACK,EACL,EACA,GA0BAoB,GAAAv4H,EAAA,MCxXA,IAAAw4H,GAAA,GACAC,GAAA,GACMC,GAAG,GACHC,GAAG/tE,OAAA,GACHguE,GAAGhuE,OAAA,GACTiuE,GAAAjuE,OAAA,GACAkuE,GAAAluE,OAAA,GACAmuE,GAAAnuE,OAAA,KACAouE,GAA2BpuE,OAAA,KAC3B,QAAA5kB,GAAA,EAAAwsB,GAAAomE,GAAAn1H,GAAA,EAAAqxB,GAAA,EAAAkR,GAAA,GAAAA,KAAA,CAEA,CAAAviC,GAAAqxB,GAAA,EAAAA,GAAA,GAAArxB,GAAA,EAAAqxB,EAAAA,EAAA,GACA0jG,GAAA34H,IAAA,MAAAi1B,GAAArxB,EAAAA,GAEAg1H,GAAA54H,IAAA,EAAAmmC,GAAA,GAAAA,CAAAA,GAAA,SAEA,IAAAxgC,GAAAmzH,GACA,QAAA9jG,GAAA,EAAmBA,GAAA,EAAGA,KACtB29B,CAAAA,GAAA,KAAgBomE,GAAG,CAAApmE,IAAAsmE,EAAA,EAAAE,EAAA,EAAAD,EAAA,EACnBF,IACArzH,CAAAA,IAAAozH,IAAA,CAAAA,IAAAhuE,OAAA/1B,GAAA,EAAA+jG,EAAA,EAEAF,GAAA74H,IAAA,CAAA2F,GACA,CACA,IAAAyzH,GAAAC,GAAA,CAAAh+G,EAAAw9G,GAAA,IAEAS,GAAA,CAAAr/F,EAAAwT,EAAAjoC,IAAAA,EAAA,GAAqCo4G,EAAM3jF,EAAAwT,EAAAjoC,GAAYk4G,EAAMzjF,EAAAwT,EAAAjoC,EAAA,CAC7D+zH,GAAA,CAAAt/F,EAAAwT,EAAAjoC,IAAAA,EAAA,GAAAq4G,EAAA5jF,EAAAwT,EAAAjoC,GAAAm4G,EAAA1jF,EAAAwT,EAAAjoC,EAAA,CAEA,SAAAg0H,GAAAh0H,CAAA,CAAAi0H,EAAA,IACA,IAAAlnE,EAAA,IAAAsqD,YAAA,IAEA,QAAA12E,EAAA,GAAAszF,EAAAtzF,EAAA,GAAAA,IAAA,CAEA,QAAAviC,EAAA,EAAAA,EAAA,GAAAA,IACA2uD,CAAA,CAAA3uD,EAAA,CAAA4B,CAAA,CAAA5B,EAAA,CAAwB4B,CAAA,CAAA5B,EAAQ,IAAA4B,CAAA,CAAA5B,EAAA,IAAA4B,CAAA,CAAA5B,EAAA,IAAA4B,CAAA,CAAA5B,EAAA,IAChC,QAAAA,EAAA,EAAAA,EAAA,GAAAA,GAAA,GACA,IAAA81H,EAAA,CAAA91H,EAAA,MACA+1H,EAAA,CAAA/1H,EAAA,MACAg2H,EAAArnE,CAAA,CAAAonE,EAAA,CACAE,EAAAtnE,CAAA,CAAAonE,EAAA,GACAG,EAAAR,GAAAM,EAAAC,EAAA,GAAAtnE,CAAA,CAAAmnE,EAAA,CACAK,EAAAR,GAA4BK,EAAAC,EAAQ,GAAAtnE,CAAA,CAAAmnE,EAAA,GACpC,QAAAzkG,EAAA,EAAAA,EAAA,GAAAA,GAAA,GACAzvB,CAAA,CAAA5B,EAAAqxB,EAAA,EAAA6kG,EACAt0H,CAAA,CAAA5B,EAAAqxB,EAAA,IAAA8kG,CAEA,CAEA,IAAAC,EAAAx0H,CAAA,IACAy0H,EAAAz0H,CAAA,IACA,QAAAG,EAAA,EAAAA,EAAA,GAAAA,IAAA,CACA,IAAA2W,EAAAs8G,EAAA,CAAAjzH,EAAA,CACAm0H,EAAAR,GAAAU,EAAAC,EAAA39G,GACAy9G,EAAAR,GAAAS,EAAAC,EAAA39G,GACA49G,EAAAvB,EAAA,CAAAhzH,EAAA,CACAq0H,EAAAx0H,CAAA,CAAA00H,EAAA,CACAD,EAAAz0H,CAAA,CAAA00H,EAAA,GACA10H,CAAA,CAAA00H,EAAA,CAAAJ,EACAt0H,CAAA,CAAA00H,EAAA,GAAAH,CACA,CAEA,QAAA9kG,EAAA,EAAAA,EAA4B,GAAAA,GAAQ,IACpC,QAAArxB,EAAA,EAAAA,EAAA,GAAAA,IACA2uD,CAAA,CAAA3uD,EAAA,CAAA4B,CAAA,CAAAyvB,EAA4BrxB,EAAA,CAC5B,QAAAA,EAAA,EAAAA,EAAA,GAAAA,IACA4B,CAAA,CAAAyvB,EAAArxB,EAAA,GAAA2uD,CAAA,EAAA3uD,EAAA,OAAA2uD,CAAA,EAAA3uD,EAAA,OAGA4B,CAAA,KAAA4zH,EAAA,CAAAjzF,EAAA,CACA3gC,CAAA,KAAA6zH,EAAA,CAAAlzF,EAAA,CAEAosB,EAAAojC,IAAA,GACO,CACP,MAAAwkC,WAAA71E,EAAA8tD,EAAA,CAEA3vG,YAAA23H,CAAA,CAAAC,CAAA,CAAA1W,CAAA,CAAA2W,EAAA,GAAAb,EAAA,IAcA,GAbA,QACA,KAAAW,QAAA,CAAAA,EACA,KAAAC,MAAA,CAAAA,EACA,KAAA1W,SAAA,CAAAA,EACA,KAAA2W,SAAA,CAAAA,EACA,KAAAb,MAAA,CAAAA,EACA,KAAAtxB,GAAA,GACA,KAAAoyB,MAAA,GACA,KAAAC,QAAA,IACA,KAAAC,SAAA,IAEA,GAAA/B,GAAAgC,EAAA,EAAA/W,GAEA,QAAAyW,QAAA,OAAAA,QAAA,MACA,wDACA,KAAA3uE,KAAA,KAAuBz+C,WAAA,KACvB,KAAA2tH,OAAA,IAAAr2E,EAAA1H,EAAA,OAAA6O,KAAA,CACA,CACAmvE,QAAa,CACDt2E,EAAAu2E,EAAA,EACZ,GAAAv2E,EAAAw2E,EAAA,OAAAH,OAAA,EACAnB,GAAa,KAAAmB,OAAA,KAAI,CAAAlB,MAAA,EACLn1E,EAAAu2E,EAAA,EACZ,GAAAv2E,EAAAw2E,EAAA,OAAAH,OAAA,EACA,KAAAJ,MAAA,GACA,KAAApyB,GAAA,EACA,CACA4yB,OAAQ74H,CAAA,EACR,GAAAw2H,GAAgBsC,EAAA,EAAkB,MAClC,IAAeZ,SAAAA,CAAA,CAAA3uE,MAAAA,CAAA,MAAO,CACtBvpD,EAAA,GAAAoiD,EAAA22E,EAAA,EAAA/4H,GACA,IAAAg4B,EAAAh4B,EAAAR,MAA0B,CAC1B,QAAAymG,EAAA,EAAAA,EAAAjuE,GAAA,CACA,IAAAghG,EAAA15H,KAA4BorC,GAAA,CAAAwtF,EAAU,KAAAjyB,GAAA,CAAAjuE,EAAAiuE,GACtC,QAAArhG,EAAA,EAAAA,EAAAo0H,EAAAp0H,IACA2kD,CAAA,MAAA08C,GAAA,KAAAjmG,CAAA,CAAAimG,IAAA,CACA,KAAAA,GAAA,GAAAiyB,GACA,KAAAQ,MAAA,EACA,CACA,YAEAO,QAAA,CACA,QAAAX,QAAA,CACA,OACA,KAAAA,QAAgB,IAChB,IAAA/uE,MAAAA,CAAA,CAAA4uE,OAAAA,CAAA,CAAAlyB,IAAAA,CAAA,CAAAiyB,SAAAA,CAAA,OAEA3uE,CAAA,CAAA08C,EAAA,EAAAkyB,EACAA,CAAAA,IAAAA,CAAA,MAAAlyB,IAAAiyB,EAAA,GACA,KAAAQ,MAAA,GACAnvE,CAAA,CAAA2uE,EAAA,QACA,KAAAQ,MAAA,EACA,CACAQ,UAAQllC,CAAA,EACA,GAAAwiC,GAAAsC,EAAK,WACb,GAAAtC,GAAA2C,EAAA,EAAAnlC,GACA,KAAAilC,MAAA,GACA,IAAAG,EAAgB,IAAW,CAAA7vE,KAAA,CAC3B,CAAA2uE,SAAAA,CAAA,OACA,QAAAjyB,EAAA,EAAAjuE,EAAAg8D,EAAAx0F,MAAA,CAAAymG,EAAAjuE,GAAA,CACA,KAAAqgG,MAAA,EAAAH,GACA,KAAAQ,MAAA,GACA,IAAAM,EAAA15H,KAAAorC,GAAA,CAAAwtF,EAAA,KAAAG,MAAA,CAAArgG,EAAAiuE,GACAjS,EAAArwF,GAAA,CAAAy1H,EAAAxvD,QAAA,MAAAyuD,MAAA,MAAAA,MAAA,CAAAW,GAAA/yB,GACA,KAAAoyB,MAAA,EAAAW,EACA/yB,GAAA+yB,CACA,CACA,OAAAhlC,CACA,CACAqlC,QAAArlC,CAAA,EAEA,SAAAokC,SAAA,CACA,qDACA,YAAAc,SAAA,CAAAllC,EACA,CACAslC,IAAQ32G,CAAA,EAER,MADA,GAAA6zG,GAAAgC,EAAA,EAAA71G,GACA,KAAA02G,OAAA,KAAAvuH,WAAA6X,GACA,CACA42G,WAAQvlC,CAAA,EAER,GADA,GAAAwiC,GAAAgD,EAAA,EAAAxlC,EAAA,MACA,KAAAskC,QAAA,CACA,2CAGA,OAFA,KAAAY,SAAA,CAAAllC,GACA,KAAAgrB,OAAA,GACAhrB,CACA,CACA/+B,QAAA,CACA,YAAAskE,UAAA,KAAAzuH,WAAA,KAAA22G,SAAA,EACA,CACAzC,SAAA,CACA,KAAAuZ,SAAA,IACA,KAAAhvE,KAAA,CAAAkqC,IAAA,GACA,CACAgmC,WAAAnyD,CAAgB,EAChB,IAAA4wD,SAAAA,CAAA,CAAAC,OAAAA,CAAA,CAAA1W,UAAAA,CAAA,CAAA8V,OAAAA,CAAA,CAAAa,UAAAA,CAAA,OAYA,OAXA9wD,GAAAA,CAAAA,EAAA,IAAA2wD,GAAAC,EAAAC,EAAA1W,EAAA2W,EAAAb,EAAA,EACAjwD,EAAAmxD,OAAA,CAAA90H,GAAA,MAAA80H,OAAA,EACAnxD,EAAA2+B,GAAA,MAAAA,GAAA,CACA3+B,EAAA+wD,MAAA,MAAAA,MAAA,CACA/wD,EAAAgxD,QAAA,MAAAA,QAAA,CACAhxD,EAAAiwD,MAAA,CAAAA,EAEAjwD,EAAA6wD,MAAA,CAAAA,EACA7wD,EAAAm6C,SAAA,CAAAA,EACAn6C,EAAA8wD,SAAA,CAAAA,EACA9wD,EAAAixD,SAAA,MAAAA,SAAA,CACAjxD,CACA,CACA,CACO,IAAAw5C,GAAA,CAAAqX,EAAAD,EAAAzW,IAAiC,GAAAr/D,EAAA88D,EAAA,UAAA+Y,GAAAC,EAAuBC,EAAA1W,IAcxDz2C,GAAmC81C,GAAA,SC5M1C,OAAA4Y,WAAAt3E,EAAA8tD,EAAA,CACA3vG,YAAAiuB,CAAA,CAAAmJ,CAAA,EACA,QACA,KAAA2gG,QAAA,IACQ,KAAAC,SAAA,IACR,GAAA/B,GAAoBmD,EAAA,EAAAnrG,GACpB,IAAAvtB,EAAA,GAAAmhD,EAAA22E,EAAA,EAAAphG,GAEA,GADA,KAAAiiG,KAAA,CAAAprG,EAAArqB,MAAA,GACA,wBAAAy1H,KAAA,CAAAf,MAAA,CACA,mEACA,KAAAX,QAAA,MAAA0B,KAAA,CAAA1B,QAAA,CACA,KAAAzW,SAAA,MAAAmY,KAAA,CAAAnY,SAAA,CACA,IAAAyW,EAAA,KAAAA,QAAA,CACA7X,EAAA,IAAAv1G,WAAAotH,GAEA7X,EAAA18G,GAAA,CAAA1C,EAAAzB,MAAwB,CAAA04H,EAAgB1pG,EAAArqB,MAAA,GAAA00H,MAAA,CAAA53H,GAAAg0D,MAAA,GAAAh0D,CAAA,EACxC,QAAA2D,EAAA,EAAAA,EAAAy7G,EAAA7gH,MAAA,CAAAoF,IACAy7G,CAAA,CAAAz7G,EAAA,KACA,KAAAg1H,KAAA,CAAAf,MAAA,CAAAxY,GAEA,KAAAwZ,KAAA,CAAArrG,EAAArqB,MAAA,GAEA,QAAAS,EAAA,EAAAA,EAAAy7G,EAAA7gH,MAAA,CAAAoF,IACAy7G,CAAA,CAAAz7G,EAAA,MACA,KAAAi1H,KAAA,CAAAhB,MAAA,CAAAxY,GACAA,EAAA5sB,IAAA,GACA,CACAolC,OAAQv4G,CAAA,EAGR,MAFA,GAAAk2G,GAAAsC,EAAA,QACA,KAAAc,KAAA,CAAAf,MAAA,CAAAv4G,GACA,KAEAi5G,WAAQvlC,CAAA,EACA,GAAAwiC,GAAAsC,EAAW,QACnB,GAAAtC,GAAA2C,EAAA,EAAAnlC,EAAA,KAAAytB,SAAA,EACA,KAAA6W,QAAA,IACA,KAAAsB,KAAA,CAAAL,UAAA,CAAAvlC,GACA,KAAA6lC,KAAA,CAAAhB,MAAA,CAAA7kC,GACA,KAAA6lC,KAAA,CAAAN,UAAA,CAAAvlC,GACA,KAAAgrB,OAAA,EACA,CACA/pD,QAAA,CACA,IAAA++B,EAAA,IAAAlpF,WAAA,KAAA+uH,KAAA,CAAApY,SAAA,EAEA,OADA,KAAA8X,UAAA,CAAAvlC,GACAA,CACA,CACAylC,WAAAnyD,CAAA,EAEAA,GAAAA,CAAAA,EAAgBjmE,OAAA8C,MAAA,CAAA9C,OAAAy6C,cAAA,YAChB,IAAA+9E,MAAAA,CAAA,CAAAD,MAAAA,CAAA,CAAAtB,SAAAA,CAAA,CAAAC,UAAAA,CAAA,CAAAL,SAAAA,CAAA,CAAAzW,UAAAA,CAAA,OAQA,OANAn6C,EAAAgxD,QAAA,CAAAA,EACAhxD,EAAAixD,SAAA,CAAAA,EACAjxD,EAAA4wD,QAAA,CAAAA,EACA5wD,EAAAm6C,SAAA,CAAAA,EACAn6C,EAAAuyD,KAAA,CAAAA,EAAAJ,UAAA,CAAAnyD,EAAAuyD,KAAA,EACAvyD,EAAAsyD,KAAA,CAAAA,EAAAH,UAAA,CAAAnyD,EAAAsyD,KAAA,EACAtyD,CACA,CACA03C,SAAA,CACA,KAAAuZ,SAAA,IACA,KAAAsB,KAAA,CAAA7a,OAAA,GACA,KAAA4a,KAAA,CAAA5a,OAAA,EACA,CACA,CAOA,IAAA8a,GAAA,CAAAtrG,EAAAvtB,EAAAN,IAAA,IAAA+4H,GAAAlrG,EAAAvtB,GAAA43H,MAAA,CAAAl4H,GAAAs0D,MAAA,EC1EA,wEAMA,SAAA8kE,GAAiBxS,CAAa,EAC1B,IAAA/9G,EAAA89G,GAAiBC,GACrBpN,GAAA3wG,EAAA,CACApL,EAAA,QACKkZ,EAAA,OACL,GACA0iH,yBAAA,QACAC,eAAA,UACAtO,cAAA,WACAK,cAAA,WACAkO,mBAAA,UACAC,UAAA,WACKxyE,QAAA,UACL,GACA,IAAAyyE,KAAAA,CAAA,CAAA7Y,GAAAA,CAAA,CAAAnjH,EAAAA,CAAA,EAAAoL,EACA,GAAA4wH,EAAA,CACA,IAAA7Y,EAAAsB,GAAA,CAAAzkH,EAAAmjH,EAAA7hE,IAAA,EACA,iFAEA,oBAAA06E,GACA,iBAAAA,EAAAC,IAAA,EACA,mBAAAD,EAAAE,WAAA,CACA,iFAEA,OACAj5H,OAAAquD,MAAA,KAAAlmD,CAAA,EACA,CD2CAswH,GAAA31H,MAAA,EAAAqqB,EAAAvtB,IAAA,IAAAy4H,GAAAlrG,EAAAvtB,GCzCO,IAAAs5H,gBAAAC,EAAA,CAAA7gB,WAAA8gB,EAAA,EAAA3hB,EACP4hB,GAAA,CAEAC,IAAA,cAAA3uH,MACAzL,YAAAkoB,EAAA,IACA,MAAAA,EACK,CACL,EACAmyG,UAAA56H,CAAgB,EAChB,IAAA26H,IAAAnrE,CAAA,EAAAkrE,GACA,GAAA16H,EAAAR,MAAA,IAAAQ,IAAAA,CAAA,IACA,UAAAwvD,EAAA,iCACA,IAAAx3B,EAAAh4B,CAAA,IACAiI,EAAAjI,EAAA4pE,QAAA,GAAA5xC,EAAA,GACA,IAAAA,GAAA/vB,EAAAzI,MAAA,GAAAw4B,EACA,UAAAw3B,EAAA,2CAKA,GAAAvnD,IAAAA,CAAA,IACA,UAAAunD,EAAA,uCACA,GAAAvnD,IAAAA,CAAA,MAAAA,CAAAA,IAAAA,CAAA,KACA,MAAiB,IAAAunD,EAAA,sDAA0C,CACtD,OAAAtxD,EAAAs8H,GAAAvyH,GAAAsjC,EAAAvrC,EAAA4pE,QAAA,CAAA5xC,EAAA,GACL,EACA6iG,MAAAjrE,CAAA,EAEA,IAAA+qE,IAAAnrE,CAAA,EAAAkrE,GACiB16H,EAAA,iBAAA4vD,EAAA6qE,GAAA7qE,GAAAA,CAAA,CACjBmpD,EAAA/4G,GACA,IAAAurC,EAAAvrC,EAAAR,MAAA,CACA,GAAA+rC,EAAA,GAAAvrC,IAAAA,CAAA,IACA,UAAAwvD,EAAA,yBACA,GAAAxvD,CAAA,MAAAurC,EAAA,EACA,MAAgB,IAAAikB,EAAA,sCAAkB,CAClC,IAAgBtxD,EAAAwE,CAAA,CAAA6oC,EAAAuvF,CAAA,EAAAJ,GAAsBE,SAAA,CAAA56H,EAAA4pE,QAAA,KACtC,CAAA1rE,EAAAoF,CAAA,CAAAioC,EAAAwvF,CAAA,EAAAL,GAAAE,SAAA,CAAAE,GACA,GAAAC,EAAAv7H,MAAA,CACA,MAAiB,IAAAgwD,EAAA,+CACZ,OAAA9sD,EAAAA,EAAAY,CAAA,CACL,EACA03H,WAAA3N,CAAA,EAEA,IAAAztH,EAAA,GAAAsX,EAAAA,OAAA6zB,QAAA,CAAAznC,CAAA,aAAAA,EAAAA,CAAA,CACAy0B,EAAA,IACA,IAAA63B,EAAAhlC,EAAArjB,QAAA,KACA,OAAAqoD,EAAAA,EAAApwD,MAAA,KAAAowD,EAAA,EAAAA,CAAA,EAEAtsD,EAAA1D,EAAAm4B,EAAAs1F,EAAA/pH,CAAA,GACAZ,EAAA9C,EAAAm4B,EAAAs1F,EAAA3qH,CAAA,GACAu4H,EAAA33H,EAAA9D,MAAA,GACA07H,EAAAx4H,EAAAlD,MAAA,GACAuhH,EAAAhpF,EAAAkjG,GACAE,EAAApjG,EAAoBmjG,GACf,WAAAnjG,EAAAmjG,EAAAD,EAAA,OAAAE,EAAA,EAAAz4H,EAAA,IAAAq+G,EAAA,EAAAz9G,EAAA,EAEL,EAGO83H,GAAAvyE,OAAA,GAAAwyE,GAAAxyE,OAAA,GAAAyyE,IAAAzyE,OAAA,GAAAA,OAAA,IACP,SAAA0yE,GAAA/xH,CAAA,EACA,IAAAg/G,EAAiBuR,GAASvwH,GAC1B,CAAA+3G,GAAAA,CAAA,EAAAiH,EACA7gE,EAAA6gE,EAAA7gE,OAAA,EACA,EAAA39C,EAAA0iH,EAAA8O,IAAA,CACA,IAAAp9H,EAAmBsuH,EAAAjD,QAAc,GACxB,OAAAlQ,GAAAzuG,WAAA6R,IAAA,MAAA4kG,EAAA55D,OAAA,CAAAvpD,EAAAsD,CAAA,EAAA6/G,EAAA55D,OAAA,CAAAvpD,EAAA20B,CAAA,EACT,GACAonG,EAAA3R,EAAA2R,SAAA,EACA,KAEA,IAAAsB,EAAA94G,EAAAinD,QAAA,IAEAloE,EAAA6/G,EAAA4Y,SAAA,CAAAsB,EAAA7xD,QAAA,GAAA23C,EAAAoC,KAAA,GACA5wF,EAAqBwuF,EAAA4Y,SAAA,CAAAsB,EAAA7xD,QAAA,CAAA23C,EAAAoC,KAAA,GAAApC,EAAAoC,KAAA,GACZ,OAAAjiH,EAAAA,EAAAqxB,EAAAA,CAAA,CACT,GAKA,SAAA2oG,EAAuBh6H,CAAA,EACvB,IAAAtD,EAAAA,CAAA,CAAAkZ,EAAAA,CAAA,EAAAkxG,EACA+F,EAAAhN,EAAAuB,GAAA,CAAAphH,GACAi6H,EAAApa,EAAAriE,GAAA,CAAAqvE,EAAA7sH,GACA,OAAA6/G,EAAA19G,GAAA,CAAA09G,EAAA19G,GAAA,CAAA83H,EAAApa,EAAAriE,GAAA,CAAAx9C,EAAAtD,IAAAkZ,EACA,CAKA,IAAAiqG,EAAAsB,GAAA,CAAAtB,EAAAuB,GAAA,CAAA0F,EAAAf,EAAA,EAAAiU,EAAAlT,EAAAhB,EAAA,GACA,2DAEA,SAAAoU,EAAAhxG,CAAA,EACA,uBAAAA,GAAAwwG,GAAAxwG,GAAAA,EAAA49F,EAAA5pH,CAAA,CAEA,SAAAi9H,EAAAjxG,CAAA,EACA,IAAAgxG,EAAAhxG,GACA,2DAIA,SAAAkxG,EAAgB76H,CAAA,MAUhB2pB,EATA,IAAAovG,yBAAA+B,CAAA,CAAAvX,YAAAA,CAAA,CAAAyV,eAAAA,CAAA,CAAAr7H,EAAAA,CAAA,EAAA4pH,EACA,GAAAuT,GAA0B,iBAAA96H,EAAA,CAI1B,GAHA44G,EAAsB54G,IACtBA,CAAAA,EAAAm4G,EAAAn4G,EAAA,EAEA,iBAAAA,GAAA,CAAA86H,EAAA/oE,QAAA,CAAA/xD,EAAAzB,MAAA,EACA,2BACAyB,EAAAA,EAAA4uD,QAAA,CAAA20D,EAAAA,EAAA,IACA,IAEA,CACA55F,EACA,iBAAA3pB,EACsBA,EACtBo4G,GAAAI,GAAA,cAAAx4G,EAAAujH,GAAA,CAEA,MAAAhgH,EAAA,CACA,mCAAAggH,EAAA,oCAAAvjH,EAAA,GAKA,OAHAg5H,GACArvG,CAAAA,EAAAy3F,GAAuBz3F,EAAAhsB,EAAA,EACvBi9H,EAAAjxG,GACAA,CACA,CACA,IAAAw+F,EAAA,IAAA1lH,IACA,SAAAs4H,EAAA94F,CAAA,EACA,IAAAA,CAAAA,aAAAomF,CAAA,EACA,wCAOA,MAAAA,EACA/oH,YAAAgmC,CAAA,CAAAmQ,CAAA,CAAAulF,CAAA,EAIA,GAHA,KAAA11F,EAAA,CAAAA,EACA,KAAAmQ,EAAA,CAAAA,EACA,KAAAulF,EAAA,CAAAA,EACA11F,IAAA,EAAAA,GAAA,CAAAg7E,EAAAC,OAAA,CAAAj7E,GACA,0BACA,GAAAmQ,IAAA,EAAAA,GAAA,CAAA6qE,EAAAC,OAAA,CAAA9qE,GACA,0BACA,GAAAulF,IAAA,EAAAA,GAAA,CAAA1a,EAAAC,OAAA,CAAAya,GACA,0BAIA,OAAAvS,WAAoBrjG,CAAO,EAC3B,IAAA3kB,EAAAA,CAAA,CAAAqxB,EAAAA,CAAA,EAAA1M,GAAA,GACA,IAAAA,GAAA,CAAAk7F,EAAAC,OAAA,CAAA9/G,IAAA,CAAA6/G,EAAAC,OAAA,CAAAzuF,GACA,oCACA,GAAA1M,aAAAijG,EACA,4CACA,IAAArF,EAAA,GAAA1C,EAAAsB,GAAA,CAAAj+G,EAAA28G,EAAA7hE,IAAA,SAEA,EAAAh+C,IAAAuiH,EAAAlxF,GACAu2F,EAAA5pE,IAAA,CACA,IAAA4pE,EAAA5nH,EAAAqxB,EAAAwuF,EAAA9hE,GAAA,CADA,CAGA,IAAA/9C,GAAA,CACA,YAAA+nH,QAAA,GAAA/nH,CAAA,CAEA,IAAAqxB,GAAA,CACA,YAAA02F,QAAA,GAAA12F,CAAA,CAQA,OAAA42F,WAAAz3F,CAAA,EACA,IAAA03F,EAAArI,EAAA6D,WAAA,CAAAlzF,EAAAzyB,GAAA,IAAA4mB,EAAA41G,EAAA,GACA,OAAA/pG,EAAAzyB,GAAA,EAAA4mB,EAAAzhB,IAAAyhB,EAAAojG,QAAA,CAAAG,CAAA,CAAAhlH,EAAA,GAAAnF,GAAA,CAAA6pH,EAAAI,UAAA,CACA,CAKA,OAAAuC,QAAAr8D,CAAA,EACA,IAAApN,EAAA8mE,EAAAI,UAAA,CAAAyQ,EAAA1gB,GAAA,WAAA7pD,KAEA,OADApN,EAAAsnE,cAAA,GACAtnE,CACA,CAEA,OAAA+pE,eAAA2P,CAAA,EACA,OAAA5S,EAAA5C,IAAA,CAAA4E,QAAA,CAAAwQ,EAAAI,GACA,CAEArS,eAAAzD,CAAA,EACA,KAAAgB,YAAA,CAAAhB,EACAgD,EAAArsD,MAAA,MACA,CAEA+sD,gBAAA,CACA,QAAA7F,GAAA,IAIA,GAAAuE,EAAA0R,kBAAA,GAAA3Y,EAAA0C,GAAA,MAAAvtE,EAAA,EACA,aACA,yBACA,GAEA,CAAAh1C,EAAAA,CAAA,CAAAqxB,EAAAA,CAAA,OAAA02F,QAAA,GAEA,IAAAlI,EAAAC,OAAA,CAAA9/G,IAAA,CAAA6/G,EAAAC,OAAA,CAAAzuF,GACA,uCAAoC,CACpC,IAAAymB,EAAA+nE,EAAAuB,GAAA,CAAA/vF,GACAumB,EAAAoiF,EAAAh6H,GACA,IAAA6/G,EAAAsB,GAAA,CAAArpE,EAAAF,GACA,iDACA,SAAAqyE,aAAA,GACA,sDAEAwQ,UAAA,CACA,IAAAppG,EAAAA,CAAA,OAAA02F,QAAA,GACA,GAAAlI,EAAAqD,KAAA,CACA,OAAArD,EAAAqD,KAAA,CAAA7xF,EAAA,OACA,qCAKA0wB,OAAAvgB,CAAA,EACA84F,EAAoB94F,GACpB,IAAoBqD,GAAA+jF,CAAA,CAAA5zE,GAAA6zE,CAAA,CAAA0R,GAAAzR,CAAA,EAAyB,KAC7C,CAAAjkF,GAAAwjF,CAAA,CAAArzE,GAAAszE,CAAA,CAAAiS,GAAAhS,CAAA,EAAA/mF,EACAk5F,EAAA7a,EAAAsB,GAAA,CAAAtB,EAAAriE,GAAA,CAAAorE,EAAAL,GAAA1I,EAAAriE,GAAA,CAAA6qE,EAAAS,IACA6R,EAAA9a,EAAAsB,GAAA,CAAAtB,EAAAriE,GAAA,CAAAqrE,EAAAN,GAAA1I,EAAAriE,GAAA,CAAA8qE,EAAAQ,IACA,OAAA4R,GAAAC,CACA,CAIAnW,QAAA,CACA,WAAAoD,EAAA,KAAA/iF,EAAA,CAAAg7E,EAAAyB,GAAA,MAAAtsE,EAAA,OAAAulF,EAAA,CACA,CAKA1V,QAAA,CACA,IAAAnoH,EAAAA,CAAA,CAAAkZ,EAAAA,CAAA,EAAAkxG,EACA8T,EAAoB/a,EAAAriE,GAAA,CAAA5nC,EAAAgkH,IACpB,CAAA/0F,GAAA+jF,CAAA,CAAA5zE,GAAA6zE,CAAA,CAAA0R,GAAAzR,CAAA,OACAM,EAAAvJ,EAAA7hE,IAAA,CAAAqrE,EAAAxJ,EAAqC7hE,IAAA,CAAAurE,EAAA1J,EAAA7hE,IAAA,CACrC68E,EAAAhb,EAAAriE,GAAA,CAAAorE,EAAAA,GACAkS,EAAAjb,EAAAriE,GAAA,CAAAqrE,EAAAA,GACAtH,EAAA1B,EAAAriE,GAAA,CAAAsrE,EAAAA,GACAiS,EAAAlb,EAAAriE,GAAA,CAAAorE,EAAAC,GA4BA,OA3BAkS,EAAAlb,EAAA19G,GAAA,CAAA44H,EAAAA,GACAxR,EAAA1J,EAAAriE,GAAA,CAAAorE,EAAAE,GACAS,EAAA1J,EAAA19G,GAAA,CAAAonH,EAAAA,GACAH,EAAAvJ,EAAAriE,GAAA,CAAA9gD,EAAA6sH,GACAF,EAAAxJ,EAAAriE,GAAA,CAAAo9E,EAAArZ,GACA8H,EAAAxJ,EAAA19G,GAAA,CAAAinH,EAAAC,GACAD,EAAAvJ,EAAA1hE,GAAA,CAAA28E,EAAAzR,GACAA,EAAAxJ,EAAA19G,GAAA,CAAA24H,EAAAzR,GACAA,EAAAxJ,EAAAriE,GAAA,CAAA4rE,EAAAC,GACAD,EAAAvJ,EAAAriE,GAAA,CAAAu9E,EAAA3R,GACAG,EAAA1J,EAAAriE,GAAA,CAAAo9E,EAAArR,GACAhI,EAAA1B,EAAAriE,GAAA,CAAA9gD,EAAA6kH,GACAwZ,EAAAlb,EAAA1hE,GAAA,CAAA08E,EAAAtZ,GACAwZ,EAAAlb,EAAAriE,GAAA,CAAA9gD,EAAAq+H,GACAA,EAAAlb,EAAA19G,GAAA,CAAA44H,EAAAxR,GACAA,EAAA1J,EAAA19G,GAAA,CAAA04H,EAAAA,GACAA,EAAAhb,EAAA19G,GAAA,CAAAonH,EAAAsR,GACAA,EAAAhb,EAAA19G,GAAA,CAAA04H,EAAAtZ,GACAsZ,EAAAhb,EAAAriE,GAAA,CAAAq9E,EAAAE,GACA1R,EAAAxJ,EAAA19G,GAAA,CAAAknH,EAAAwR,GACAtZ,EAAA1B,EAAAriE,GAAA,CAAAqrE,EAAAC,GACAvH,EAAA1B,EAAA19G,GAAA,CAAAo/G,EAAAA,GACAsZ,EAAAhb,EAAAriE,GAAA,CAAA+jE,EAAAwZ,GACA3R,EAAAvJ,EAAA1hE,GAAA,CAAAirE,EAAAyR,GACAtR,EAAA1J,EAAAriE,GAAA,CAAA+jE,EAAAuZ,GACAvR,EAAA1J,EAAA19G,GAAA,CAAAonH,EAAAA,GACAA,EAAA1J,EAAA19G,GAAA,CAAAonH,EAAAA,GACA,IAAA3B,EAAAwB,EAAAC,EAAAE,EACA,CAKApnH,IAAAq/B,CAAA,EACA84F,EAAoB94F,GACpB,IAAoBqD,GAAA+jF,CAAA,CAAA5zE,GAAA6zE,CAAA,CAAA0R,GAAAzR,CAAA,EAAyB,KAC7C,CAAAjkF,GAAAwjF,CAAA,CAAArzE,GAAAszE,CAAA,CAAAiS,GAAAhS,CAAA,EAAA/mF,EACA4nF,EAAAvJ,EAAA7hE,IAAA,CAAAqrE,EAAAxJ,EAAA7hE,IAAA,CAAAurE,EAAA1J,EAAA7hE,IAAA,CACAthD,EAAAoqH,EAAApqH,CAAA,CACAk+H,EAAA/a,EAAAriE,GAAA,CAAAspE,EAAAlxG,CAAqC,CAAAgkH,IACrCiB,EAAAhb,EAAAriE,GAAA,CAAAorE,EAAAP,GACAyS,EAAAjb,EAAAriE,GAAA,CAAAqrE,EAAAP,GACA/G,EAAA1B,EAAAriE,GAAA,CAAAsrE,EAAAP,GACAwS,EAAAlb,EAAA19G,GAAA,CAAAymH,EAAAC,GACAmS,EAAAnb,EAAA19G,GAAA,CAAAkmH,EAAAC,GACAyS,EAAAlb,EAAAriE,GAAA,CAAAu9E,EAAAC,GACAA,EAAAnb,EAAA19G,GAAA,CAAA04H,EAAAC,GACAC,EAAAlb,EAAA1hE,GAAA,CAAA48E,EAAAC,GACAA,EAAAnb,EAAA19G,GAAA,CAAAymH,EAAAE,GACA,IAAAmS,EAAApb,EAAA19G,GAAA,CAAAkmH,EAAAE,GA+BA,OA9BAyS,EAAAnb,EAAAriE,GAAA,CAAAw9E,EAAAC,GACAA,EAAApb,EAAA19G,GAAA,CAAA04H,EAAAtZ,GACAyZ,EAAAnb,EAAA1hE,GAAA,CAAA68E,EAAAC,GACAA,EAAApb,EAAA19G,GAAA,CAAA0mH,EAAAC,GACAM,EAAAvJ,EAAA19G,GAAA,CAAAmmH,EAAAC,GACA0S,EAAApb,EAAAriE,GAAA,CAAAy9E,EAAA7R,GACAA,EAAAvJ,EAAA19G,GAAA,CAAA24H,EAAAvZ,GACA0Z,EAAApb,EAAA1hE,GAAA,CAAA88E,EAAA7R,GACAG,EAAA1J,EAAAriE,GAAA,CAAA9gD,EAAAs+H,GACA5R,EAAAvJ,EAAAriE,GAAA,CAAAo9E,EAAArZ,GACAgI,EAAA1J,EAAA19G,GAAA,CAAAinH,EAAAG,GACAH,EAAAvJ,EAAA1hE,GAAA,CAAA28E,EAAAvR,GACAA,EAAA1J,EAAA19G,GAAA,CAAA24H,EAAAvR,GACAF,EAAAxJ,EAAAriE,GAAA,CAAA4rE,EAAAG,GACAuR,EAAAjb,EAAA19G,GAAA,CAAA04H,EAAAA,GACAC,EAAAjb,EAAA19G,GAAA,CAAA24H,EAAAD,GACAtZ,EAAA1B,EAAAriE,GAAA,CAAA9gD,EAAA6kH,GACAyZ,EAAAnb,EAAAriE,GAAA,CAAAo9E,EAAAI,GACAF,EAAAjb,EAAA19G,GAAA,CAAA24H,EAAAvZ,GACAA,EAAA1B,EAAA1hE,GAAA,CAAA08E,EAAAtZ,GACAA,EAAA1B,EAAAriE,GAAA,CAAA9gD,EAAA6kH,GACAyZ,EAAAnb,EAAA19G,GAAA,CAAA64H,EAAAzZ,GACAsZ,EAAAhb,EAAAriE,GAAA,CAAAs9E,EAAAE,GACA3R,EAAAxJ,EAAA19G,GAAA,CAAAknH,EAAAwR,GACAA,EAAAhb,EAAAriE,GAAA,CAAAy9E,EAAAD,GACA5R,EAAAvJ,EAAAriE,GAAA,CAAAu9E,EAAA3R,GACAA,EAAAvJ,EAAA1hE,GAAA,CAAAirE,EAAAyR,GACAA,EAAAhb,EAAAriE,GAAA,CAAAu9E,EAAAD,GACAvR,EAAA1J,EAAAriE,GAAA,CAAAy9E,EAAA1R,GACAA,EAAA1J,EAAA19G,GAAA,CAAAonH,EAAAsR,GACA,IAAAjT,EAAAwB,EAAAC,EAAAE,EACA,CACAG,SAAAloF,CAAA,EACA,YAAAr/B,GAAA,CAAAq/B,EAAAgjF,MAAA,GACA,CACAjC,KAAA,CACA,YAAAxgE,MAAA,CAAA6lE,EAAA5pE,IAAA,CACA,CACAsmE,KAAApnH,CAAA,EACA,OAAAysH,EAAAnE,UAAA,MAAAkC,EAAAxqH,EAAA,IACA,IAAAgrH,EAAArI,EAAA6D,WAAA,CAAAiC,EAAA5nH,GAAA,IAAA4mB,EAAA41G,EAAA,GACa,OAAA5U,EAAA5nH,GAAA,EAAA4mB,EAAAzhB,IAAAyhB,EAAAojG,QAAA,CAAAG,CAAA,CAAAhlH,EAAA,GAAAnF,GAAA,CAAA6pH,EAAAI,UAAA,CACb,EACA,CAMA8B,eAAA5sH,CAAA,EACA,IAAA6sH,EAAsBnC,EAAA5pE,IAAA,CACtB,GAAA9gD,IAAAw8H,GACA,OAAA3P,CAAyB,CAEzB,GADAoQ,EAAAj9H,GACAA,IAAAy8H,GACA,OAAoB,IAAO,CAC3B,IAAAjB,KAAAA,CAAA,EAAA5R,EACA,IAAA4R,EACA,OAAA/O,EAAAhF,YAAA,MAAAznH,EAAA,CAEA,IAAAg+H,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAA,CAAA5+E,GAAAA,CAAA,EAAAk8E,EAAAE,WAAA,CAAA17H,GACAm+H,EAAAtR,EACAuR,EAAAvR,EACAvtH,EAAA,IAAwB,CACxB,KAAA2+H,EAAAzB,IAA4Bl9E,EAAAk9E,IAC5ByB,EAAAxB,IACA0B,CAAAA,EAAyBA,EAAAl5H,GAAA,CAAA3F,EAAA,EACzBggD,EAAAm9E,IACA2B,CAAAA,EAAAA,EAAAn5H,GAAA,CAAA3F,EAAA,EACAA,EAAAA,EAAAqoH,MAAuB,GACvBsW,IAAuBxB,GACvBn9E,IAAAm9E,GAOA,OALAuB,GACAG,CAAAA,EAAAA,EAAA7W,MAAA,IACA4W,GACAE,CAAAA,EAAAA,EAAA9W,MAAA,IACA8W,EAAA,IAAA1T,EAAA/H,EAAAriE,GAAA,CAAA89E,EAAAz2F,EAAA,CAAA6zF,EAAAC,IAAA,EAAA2C,EAAAtmF,EAAA,CAAAsmF,EAAAf,EAAA,EACAc,EAAAl5H,GAAA,CAAAm5H,EACA,CAUA1R,SAAAC,CAAA,MAGAmB,EAAoBuQ,EAFpBpB,EAAAtQ,GACA,IAAA3sH,EAAA2sH,EAEA,CAAA6O,KAAAA,CAAA,EAAA5R,EACA,GAAA4R,EAAA,CACA,GAAsB,CAAAwC,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAiB,CAAA5+E,GAAAA,CAAA,EAAAk8E,EAAAE,WAAA,CAAA17H,GACvC,CAAsBynB,EAAA02G,CAAA,CAAAvxF,EAAA0xF,CAAA,EAAiB,KAAAlX,IAAA,CAAA6W,GACvC,CAAAx2G,EAAA22G,CAAA,CAAAxxF,EAAA2xF,CAAA,OAAAnX,IAAA,CAAA9nE,GACA6+E,EAAA1R,EAAApF,eAAA,CAAA2W,EAAAG,GACAC,EAAA3R,EAAApF,eAAA,CAAA6W,EAAAE,GACAA,EAAA,IAAA1T,EAAA/H,EAAAriE,GAAA,CAAA89E,EAAAz2F,EAAA,CAAA6zF,EAAAC,IAAA,EAAA2C,EAAAtmF,EAAA,CAAAsmF,EAAAf,EAAA,EACAvP,EAAAqQ,EAAAl5H,GAAA,CAAAm5H,GACAC,EAAAC,EAAAr5H,GAAA,CAAAs5H,EACA,KACA,CACA,IAAA92G,EAAAA,CAAA,CAAAmlB,EAAAA,CAAA,OAAAw6E,IAAA,CAAApnH,GACA8tH,EAAArmG,EACA42G,EAAAzxF,CACA,QAEA89E,EAAAK,UAAA,EAAA+C,EAAAuQ,EAAA,KAQAG,qBAAAjsE,CAAA,CAAA/yD,CAAA,CAAkCkZ,CAAA,EAClC,IAAAy5C,EAAAu4D,EAAA5C,IAAA,CACAxnE,EAAwB,CAAAsD,EAAApkD,IACxBA,IAAAg9H,IAAAh9H,IAAAi9H,IAAA74E,EAAAiB,MAAA,CAAAsN,GAAAvO,EAAA8oE,QAAA,CAAAltH,GAAAokD,EAAAgpE,cAAA,CAAAptH,EAAA,CACA4gG,EAAA9/C,EAAA,KAAA9gD,GAAAyF,GAAA,CAAAq7C,EAAAiS,EAAA75C,IACA,OAAA0nF,EAAAilB,GAAA,GAAA5hH,KAAAA,EAAA28F,CAAA,CAKAyqB,SAAAmC,CAAA,CAAoB,CACpB,IAAArlF,GAAA7kC,CAAA,CAAAg1C,GAAA3jB,CAAA,CAAAkpG,GAAAjpG,CAAA,OACAixF,EAAA,KAAAA,GAAA,GAGA,MAAA2H,GACAA,CAAAA,EAAA3H,EAAA1C,EAAA9hE,GAAA,CAAA8hE,EAAA4C,GAAA,CAAAnxF,EAAA,EACA,IAAA64F,EAAAtK,EAAAriE,GAAA,CAAAx9C,EAAAkqH,GACAE,EAAAvK,EAAAriE,GAAA,CAAAnsB,EAAA64F,GACAG,EAAAxK,EAAAriE,GAAA,CAAAlsB,EAAA44F,GACA,GAAA3H,EACA,OAAAviH,EAAA6/G,EAAA7hE,IAAA,CAAA3sB,EAAAwuF,EAAA7hE,IAAA,EACA,IAAA6hE,EAAAsB,GAAA,CAAAkJ,EAAAxK,EAAA9hE,GAAA,EACA,MAAqB,0BACrB,OAAA/9C,EAAAmqH,EAAA94F,EAAA+4F,CAAA,CACA,CACAH,eAAoB,CACpB,IAAA5zF,EAAA6wF,CAA6B,CAAA+C,cAAAA,CAAG,EAAAnD,EAChC,GAAAI,IAA6ByS,GAC7B,SACA,GAAA1P,EACA,OAAAA,EAAArC,EAAA,YACA,sEAEA0C,eAAoB,CACpB,IAAAj0F,EAAA6wF,CAA6B,CAAAoD,cAAAA,CAAG,EAAAxD,SAChC,IAA6B6S,GAC7B,KACArP,EACAA,EAAA1C,EAAA,MACA,KAAAkC,cAAA,CAAAhD,EAAAzwF,CAAA,CAHA,CAKA40F,WAAA0Q,EAAA,IAEA,OADA,KAAAvT,cAAA,GACAniE,EAAA2hE,EAAA,KAAA+T,EACA,CACAzQ,MAAAyQ,EAAmB,GAAa,CAChC,OAAAjkB,EAAA,KAAAuT,UAAA,CAAA0Q,GACA,CACA,CACA/T,EAAA5C,IAAA,KAAA4C,EAAAd,EAAAhB,EAAA,CAAAgB,EAAAf,EAAA,CAAAlG,EAAA9hE,GAAA,EACA6pE,EAAA5pE,IAAA,KAAA4pE,EAAA/H,EAAA7hE,IAAA,CAAA6hE,EAAA9hE,GAAA,CAAA8hE,EAAA7hE,IAAA,EACA,IAAA49E,EAAiB9U,EAAIlE,UAAA,CACrB+G,EAAArF,GAAAsD,EAAAd,EAAA4R,IAAA,CAAA96H,KAAAC,IAAA,CAAA+9H,EAAA,GAAAA,CAAA,EAEA,OACA9U,MAAAA,EACA+U,gBAAAjU,EACAwS,uBAAAA,EACAJ,oBAAAA,EACAE,mBAAAA,CACA,CACA,CACA,SAAA4B,GAA8BjW,CAAA,EAC1B,IAAA/9G,EAAA89G,GAAiBC,GAUrB,OATApN,GAAA3wG,EAAA,CACAglB,KAAA,OACAsrG,KAAA,WACK7R,YAAA,UACL,GACAwV,SAAA,WACAC,cAAA,WACKC,KAAA,SACL,GACAt8H,OAAAquD,MAAA,EAAAiuE,KAAA,MAAAn0H,CAAA,EACO,CACP,SAAAo0H,GAAkBrV,CAAA,EAClB,IAAAC,EAAYgV,GAAqBjV,GACjC,CAAAhH,GAAAA,CAAA,CAAA3iH,EAAA6pH,CAAA,EAAAD,EACAqV,EAAAtc,EAAAoC,KAAA,GACAma,EAAA,EAAAvc,EAAAoC,KAAA,GACA,SAAAoa,EAAkBnzG,CAAA,EAClB,OAAAwwG,GAAAxwG,GAAAA,EAAA22F,EAAAkC,KAAA,CAEA,SAAAoJ,EAAezuH,CAAA,EACf,OAAAikH,GAAAjkH,EAAAqqH,EACA,CACA,SAAAuV,EAAe5/H,CAAA,CAAU,CACzB,OAAAqkH,GAAArkH,EAAAqqH,EACA,CACA,IAAA8U,gBAAAjU,CAAA,CAAAwS,uBAAAA,CAAA,CAAAJ,oBAAAA,CAAA,CAAAE,mBAAAA,CAAA,EAAAL,GAAA,CACA,GAAA/S,CAAA,CACA7gE,QAAA39C,CAAA,CAAA0iH,CAAA,CAAA2Q,CAAA,EACA,IAAAj/H,EAAAsuH,EAAAjD,QAAA,GACA/nH,EAAA6/G,EAAwB55D,OAAA,CAAAvpD,EAAAsD,CAAA,EACxBu8H,EAAA1kB,UACA,EACA0kB,EAAAnzH,WAAA6R,IAAA,EAAA+vG,EAAAyP,QAAA,SAAAz6H,GAGAu8H,EAAAnzH,WAAA6R,IAAA,MAAAjb,EAAA6/G,EAAA55D,OAAA,CAAAvpD,EAAA20B,CAAA,EACS,EAETonG,UAAAx3G,CAAA,EACA,IAAAqV,EAAArV,EAAAnjB,MAAA,CACA20B,EAAAxR,CAAA,IACA84G,EAAA94G,EAAAinD,QAAA,IAEA,GAAA5xC,IAAA6lG,GAA0B1pG,CAAAA,IAAAA,GAAkBA,IAAAA,CAAA,OAK5CpB,EAJA,IAAArxB,EAAA23G,GAAAoiB,GACA,IAAAsC,EAAAr8H,GACA,oCAAmD,CACnD,IAAA0qH,EAAAsP,EAAAh6H,GAEA,IACAqxB,EAAAwuF,EAAA4D,IAAA,CAAAiH,EACA,CACA,MAAA8R,EAAA,CACA,IAAA/F,EAAA+F,aAAAlyH,MAAA,KAAAkyH,EAAAv9H,OAAA,UACA,8BAAAw3H,EAAA,CAEA,IAAAgG,EAAA,CAAAprG,EAAAsoG,EAAA,IAAAA,GAEA+C,EAAA,CAAAjqG,EAAAA,CAAA,KAGA,OAFAiqG,IAAAD,GACAprG,CAAAA,EAAAwuF,EAAyByB,GAAA,CAAAjwF,EAAA,EACzB,CAAArxB,EAAAA,EAAAqxB,EAAAA,CAAA,CACA,CAQS,GAPTiF,IAAA8lG,GAAA3pG,IAAAA,EAAA,CACA,IAAAzyB,EAAA6/G,EAAA4Y,SAAA,CAAAsB,EAAA7xD,QAAA,GAAA23C,EAAAoC,KAAA,GACA5wF,EAAyBwuF,EAAA4Y,SAAA,CAAAsB,EAAA7xD,QAAA,CAAA23C,EAAAoC,KAAA,GAAApC,EAAAoC,KAAA,GACzB,OAAAjiH,EAAAA,EAAAqxB,EAAAA,CAAA,CACA,CAGS,MADT,yBAAAiF,EAAA,yBAAA6lG,EAAA,uBAAAC,EAAA,sBAGA,GACAO,EAAA,GAAAjlB,EAAAU,GAAAlvF,EAAA49F,EAAAhE,WAAA,GACA,SAAA8Z,EAAAp5H,CAAoC,EACpC,IAAAq5H,EAAA9V,GAAA4S,GACA,OAAAn2H,EAAAq5H,CACA,CACA,SAAAC,EAAAl7H,CAAA,EACA,OAAAg7H,EAAAh7H,GAAAupH,EAAA,CAAAvpH,GAAAA,CAAA,CAGA,IAAAm7H,EAAA,CAAAnnH,EAAAqF,EAAA2qD,IAAA+xC,GAAA/hG,EAAA1X,KAAA,CAAA+c,EAAA2qD,GAIA,OAAAo3D,EACAn+H,YAAAmC,CAAA,CAAAY,CAAA,CAAAq7H,CAAA,EACA,KAAAj8H,CAAA,CAAAA,EACA,KAAAY,CAAA,CAAAA,EACA,KAAAq7H,QAAA,CAAAA,EACA,KAAA7U,cAAA,EACA,CAEA,OAAA8U,YAAAhvE,CAAA,EACA,IAAkBrkB,EAAAi9E,EAAAhE,WAAW,CAE7B,OADA50D,EAAA6pD,GAAA,mBAAA7pD,EAAArkB,EAAAA,GACA,IAAAmzF,EAAAD,EAAA7uE,EAAA,EAAArkB,GAAAkzF,EAAA7uE,EAAArkB,EAAA,EAAAA,GACA,CAGA,OAAAszF,QAAoBjvE,CAAA,CAAO,CAC3B,IAAAltD,EAAAA,CAAA,CAAAY,EAAAA,CAAA,EAAAo3H,GAAAG,KAAA,CAAAphB,GAAA,MAAA7pD,IACA,WAAA8uE,EAAAh8H,EAAAY,EACA,CACAwmH,gBAAA,CAEA,IAAA8R,EAAA,KAAAl5H,CAAA,EACA,yCACA,IAAAk5H,EAAA,KAAAt4H,CAAA,EACA,yCAEAw7H,eAAAH,CAAA,EACA,WAAAD,EAAA,KAAAh8H,CAAA,MAAAY,CAAA,CAAAq7H,EACA,CACAI,iBAAoBC,CAAA,EACpB,IAAAt8H,EAAAA,CAAA,CAAAY,EAAAA,CAAA,CAAAq7H,SAAoCM,CAAA,OACpClnG,EAAA2lG,EAAAjkB,GAAA,UAAAulB,IACA,GAAAC,IAAA,EAAAA,GAAA,WAAAjsE,QAAA,CAAAisE,GACA,mCACA,IAAAC,EAAAD,IAAAA,GAAAA,IAAAA,EAAAv8H,EAAA8lH,EAAA5pH,CAAA,CAAA8D,CAAA,CACA,GAAAw8H,GAAA3d,EAAAkC,KAAA,CACA,0CACA,IAAA1vC,EAAA,CAAAkrD,EAAAA,CAAA,eACAxuE,EAAA64D,EAAA2C,OAAmC,CAAAl4C,EAAAsqD,EAAAa,IACnCC,EAAAnB,EAAAkB,GACAnN,EAAAlF,EAAA,CAAA90F,EAAAonG,GACAnN,EAAAnF,EAAAvpH,EAAA67H,GACAhuE,EAAAm4D,EAAA5C,IAAA,CAAA0W,oBAAA,CAAA3sE,EAAAshE,EAAAC,GACA,IAAA7gE,EACA,iCAEA,OADAA,EAAA24D,cAAA,GACA34D,CACA,CAEAiuE,UAAA,CACA,OAAAd,EAAA,KAAAh7H,CAAA,CACA,CACAk7H,YAAA,CACA,YAAAY,QAAA,OAAAV,EAAA,KAAAh8H,CAAA,CAAAmqH,EAAA,MAAAvpH,CAAA,OAAAq7H,QAAA,OAGAU,eAAmB,CACnB,OAAA1lB,EAAA,KAAA2lB,QAAA,GACA,CACAA,UAAA,CACA,OAAA5E,GAAAM,UAAA,EAAAt4H,EAAA,KAAAA,CAAA,CAAAY,EAAA,KAAAA,CAAA,EACA,CAEAi8H,mBAAmB,CACnB,OAAA5lB,EAAA,KAAA6lB,YAAA,GACA,CACAA,cAAA,CACA,OAAAnB,EAAA,KAAA37H,CAAA,EAAA27H,EAAA,KAAA/6H,CAAA,CACA,CACA,CACA,IAAA8+C,EAAA,CACAq9E,kBAAAvD,CAAA,EACA,IAEA,OADAJ,EAAAI,GACA,EACA,CACA,MAAA13H,EAAA,CACA,QACS,CACT,EACAs3H,uBAAAA,EAKA,kBAA2B,CAC3B,IAAAt8H,EAAmBimH,GAAkB+C,EAAA5pH,CAAA,EAC5B,OAAA8mH,GAAA8C,EAAAP,WAAA,CAAAzoH,GAAAgpH,EAAA5pH,CAAA,CACT,EASA6uH,WAAAA,CAAArH,EAAA,EAAAsG,EAAApD,EAAA5C,IAAA,IACAgG,EAAA7C,cAAA,CAAAzD,GACAsG,EAAApB,QAAA,CAAAziE,OAAA,IACS6jE,EAET,EAOA,SAAA9zB,EAAAsjC,CAAA,CAAAmB,EAAA,IACA,OAAA/T,EAAAiD,cAAA,CAAA2P,GAAAvP,UAAA,CAAA0Q,EACA,CAIA,SAAAqC,EAAoB9xF,CAAU,EAC9B,IAAAw+B,EAAAytC,EAAAjsE,GACAxkB,EAAA,iBAAAwkB,EACA5V,EAAA,CAAAo0C,GAAAhjD,CAAA,GAAAwkB,EAAApuC,MAAA,QACA,EACAw4B,IAAA6lG,GAAA7lG,IAAA8lG,EACA10G,EACA4O,IAAA,EAAA6lG,GAAA7lG,IAAA,EAAA8lG,EACAlwF,aAAA07E,CAHA,CAiBA,SAAAqW,EAAAC,CAAA,CAAAC,CAAA,CAAAxC,EAAA,IACA,GAAAqC,EAAAE,GACA,6CACA,IAAAF,EAAAG,GACA,4CAA0C,CAC1C,IAAAvoH,EAAAgyG,EAAA2C,OAAA,CAAA4T,GACA,OAAAvoH,EAAAg0G,QAAA,CAAAwQ,EAAA8D,IAAAjT,UAAA,CAAA0Q,EACA,CAKA,IAAAI,EAAAjV,EAAAiV,QAAA,EACA,SAAA96G,CAAA,EAGA,IAAAiI,EAAAyuF,GAAA12F,GACAm9G,EAAAn9G,EAAAA,EAAAnjB,MAAA,CAAAgpH,EAAAlE,UAAA,CACA,OAAAwb,EAAA,EAAAl1G,GAAAi+B,OAAAi3E,GAAAl1G,CAAA,EAEA8yG,EAAAlV,EAAAkV,aAAA,EACA,SAAA/6G,CAAA,EACA,OAAAkqG,EAAA4Q,EAAA96G,GACA,EAEAo9G,EAAA7mB,GAAAsP,EAAAlE,UAAA,EAIA,SAAA0b,EAAAp1G,CAAA,EACA,oBAAAA,EACA,MAAc,MAAG,mBACjB,IAAAwwG,CAAAA,IAAAxwG,GAAAA,EAAAm1G,CAAmD,EACnD,mCAAAvX,EAAAlE,UAAA,IAEA,OAAAxK,GAAAlvF,EAAA49F,EAAAhE,WAAA,CACA,CAMA,SAAAyb,EAAAjB,CAAA,CAAA9C,CAAA,CAAA1yH,EAAA02H,CAAA,EACA,6BAAA7zD,IAAA,IAAAjpE,KAAAoG,GACA,MAAgB,4CAAoB,CACpC,GAAc,CAAAglB,KAAAA,CAAA,CAAAy5F,YAAAA,CAAA,EAAAO,EACd,CAAAmV,KAAAA,CAAA,CAAAjV,QAAAA,CAAA,CAAAyX,aAAAC,CAAA,EAAA52H,EACA,MAAAm0H,GACAA,CAAAA,EAAkB,IAClBqB,EAAAvlB,GAAA,UAAAulB,GACAtW,GACAsW,CAAAA,EAAAvlB,GAAA,oBAAAjrF,EAAAwwG,GAAA,EAIA,IAAAqB,EAAA3C,EAAAsB,GACA9gI,EAAA49H,EAAAI,GACAoE,EAAA,CAAAN,EAAA9hI,GAAA8hI,EAAAK,GAAA,CAEA,GAAAD,IAAA,EAAAA,GAAAA,CAAA,IAAAA,EAAA,CAEA,IAAAz6H,EAAAy6H,CAA0B,IAA1BA,EAA0BnY,EAAW1G,EAAAoC,KAAA,EAAAyc,CAAA,CACrCE,EAAAxiI,IAAA,CAAA27G,GAAA,eAAA9zG,GACA,KACA00D,EAAAk/C,MAAyB+mB,GACzB73G,EAAA43G,EAEA,SAAAE,EAAAC,CAAA,EAEA,IAAAp9H,EAAAq6H,EAAA+C,GACA,IAAA5E,EAAwBx4H,GACxB,OACA,IAAAq9H,EAAAzC,EAAA56H,GACAytD,EAAAy4D,EAAA5C,IAAA,CAAiC4E,QAAA,CAAAloH,GAAAqmH,QAAA,GACjC/mH,EAAsBmqH,EAAAh8D,EAAAnvD,CAAA,EACtB,GAAAgB,IAAA04H,GACA,OAIA,IAAA93H,EAAsBupH,EAAA4T,EAAA5T,EAAGpkG,EAAA/lB,EAAAxE,IACzB,GAAAoF,IAAA83H,GACA,OACA,IAAAuD,EAAA,CAAA9tE,EAAAnvD,CAAA,GAAAgB,EAAA,KAAAwU,OAAA25C,EAAA99B,CAAA,CAAAsoG,IACAqF,EAAAp9H,EAKA,OAJAq6H,GAAAW,EAAuCh7H,KACvCo9H,EAAAlC,EAA+Bl7H,GAC/Bq7H,GAAA,GAEA,IAAAD,EAAAh8H,EAAAg+H,EAAA/B,EACA,CACA,OAAAtkE,KAAAA,EAAAkmE,MAAAA,CAAA,CACA,CACA,IAAAL,EAAA,CAA6BvC,KAAAnV,EAAAmV,IAAA,CAAAjV,QAAA,IAC7BiY,EAAA,CAAAhD,KAAAnV,EAAAmV,IAAA,CAAAjV,QAAA,IAcA,SAAA1hH,EAAgBg4H,CAAA,CAAAxS,CAAc,CAAAhjH,EAAA02H,CAAA,EAC9B,IAAA7lE,KAAAA,CAAA,CAAAkmE,MAAAA,CAAA,EAAAN,EAAAjB,EAAAxS,EAAAhjH,GACA4mD,EAAAo4D,EACAoY,EAAApnB,GAAkCppD,EAAA5hC,IAAA,CAAAizF,SAAA,CAAArxD,EAAAo0D,WAAA,CAAAp0D,EAAA0pE,IAAA,EAClC,OAAA8G,EAAAvmE,EAAAkmE,EACA,CAiBA,SAAAnT,EAAAriH,CAAA,CAAAi0H,CAAA,CAAA7+H,CAAA,CAAAqJ,EAAAm3H,CAAA,MAQAn+E,EADAq+E,EANA,IAAA/vC,EAAkB/lF,EAGlB,GAFAi0H,EAAAvlB,GAAoB,UAAWulB,GAC/B7+H,EAAAs5G,GAAA,YAAAt5G,GACA,WAAAqJ,EACA,MAAgB,2CAAgB,CAChC,IAAAm0H,KAAAA,CAAA,CAAAjV,QAAAA,CAAA,EAAAl/G,EAGA,IACA,oBAAAsnF,GAAA+oB,EAAA/oB,GAGA,IACA+vC,EAAAnC,EAAAG,OAAA,CAAA/tC,EACA,CACA,MAAAgwC,EAAA,CACA,IAAAA,CAAAA,aAAApG,GAAAC,GAAA,EACA,MAAAmG,CAAA,CACAD,EAAAnC,EAAAE,WAAA,CAAA9tC,EACA,MAEA,oBAAwBA,GAAO,iBAAAA,EAAApuF,CAAA,mBAAAouF,EAAAxtF,CAAA,EAC/B,IAAAZ,EAAAA,CAAA,CAAAY,EAAAA,CAAA,EAAAwtF,EACA+vC,EAAA,IAAAnC,EAAAh8H,EAAAY,EACA,MAEA,qBAEAk/C,EAAA8mE,EAAA2C,OAAA,CAAA9rH,EACA,CACA,MAAAqE,EAAA,CACA,GAAAA,UAAAA,EAAA7D,OAAA,CACA,8EACA,QACA,CACA,GAAAg9H,GAAAkD,EAAAzB,QAAA,GACA,SACA1W,GACAsW,CAAAA,EAAgBxW,EAAOh6F,IAAA,CAAAwwG,EAAA,EACvB,IAAAt8H,EAAAA,CAAA,CAAAY,EAAAA,CAAA,EAAAu9H,EACA9oG,EAAA2lG,EAA4BsB,GAC5B56H,EAAA45H,EAAA16H,GACAyuH,EAAAlF,EAAA90F,EAAA3zB,GACA4tH,EAAAnF,EAAAnqH,EAAA0B,GACAqsD,EAAA64D,EAAA5C,IAAA,CAAA0W,oBAAA,CAAA56E,EAAAuvE,EAAAC,IAAAvI,WACA,IAAAh5D,EACA,SACA,IAAAptD,EAAAwpH,EAAAp8D,EAAA/uD,CAAA,EACA,OAAA2B,IAAAX,CACA,CACA,OAlEA4mH,EAAA5C,IAAA,CAAAmD,cAAA,IAkEA,CACArB,MAAAA,EACA5vB,aAAAA,EACA+mC,gBAAAA,EACA34H,KAAAA,EACAomH,OAAAA,EACAmQ,gBAAAjU,EACAoV,UAAAA,EACAt8E,MAAAA,CACA,CACA,CC16B0C,uEAK1C,SAAA2+E,GAAAvyG,CAAA,EACA,OACAA,KAAAA,EACAsrG,KAAA,CAAA74H,EAAmB,GAAAisH,IAAA4M,GAAAtrG,EAAAvtB,EAAA,GAAAmhD,EAAA4+E,EAAA,KAAA9T,IACnBjF,YAAA7lE,EAAAwtE,EAAA,CAEO,CACP,SAAAqR,GAAA1Y,CAA6B,CAAA2Y,CAAA,CAAW,CACxC,IAAA/8H,EAAA,GAA2By5H,GAAA,IAAArV,CAAA,CAA4B,GAAAwY,GAAAvyG,EAAA,GACvD,OAAAntB,OAAAquD,MAAA,KAAAvrD,EAAA+8H,EAAA,CAAA/8H,OAAAA,CAAA,EACA,CD+EO0kD,OAAA,EE9FuC,wEAQ9C,IAAAs4E,GAAAt4E,OAAA,sEACMu4E,GAAGv4E,OAAA,sEACHw4E,GAAGx4E,OAAA,GACTy4E,GAAAz4E,OAAA,GACA04E,GAAA,CAAAnjI,EAAAkZ,IAAA,CAAAlZ,EAAAkZ,EAAAgqH,EAAA,EAAAhqH,EAKA,SAAAkqH,GAAAzuG,CAAA,EACA,IAAAyvB,EAAA2+E,GAEAlf,EAAAp5D,OAAA,GAAA44E,EAAA54E,OAAA,GAAA64E,EAAA74E,OAAA,IAAA84E,EAAA94E,OAAA,IAEA+4E,EAAA/4E,OAAA,IAAAg5E,EAAgCh5E,OAAA,IAAAi5E,EAAAj5E,OAAA,IAChC2lE,EAAA,EAAAz7F,EAAAA,EAAAyvB,EACA85E,EAAA,EAAgB9N,EAAAz7F,EAAIyvB,EACpBu/E,EAAA,GAAoBzF,EAAAra,EAAAz/D,GAAA85E,EAAA95E,EACpBw/E,EAAA,GAAqBD,EAAA9f,EAAKz/D,GAAA85E,EAAG95E,EAC7By/E,EAAA,GAAqBD,EAAAV,GAAA9+E,GAAAgsE,EAAAhsE,EACrB0/E,EAAA,GAAqBD,EAAAP,EAAAl/E,GAAAy/E,EAAAz/E,EACrB2/E,EAAA,GAAqBD,EAAAP,EAAAn/E,GAAA0/E,EAAA1/E,EACrB4/E,EAAA,GAAsBD,EAAAN,EAAAr/E,GAAA2/E,EAAA3/E,EACtB6/E,EAAA,GAAsBD,EAAAN,EAAAt/E,GAAA4/E,EAAA5/E,EACtB8/E,EAAA,GAAsBD,EAAAR,EAAAr/E,GAAA2/E,EAAA3/E,EACtB+/E,EAAgB,GAAID,EAAArgB,EAAAz/D,GAAA85E,EAAA95E,EACpBg6E,EAAA,GAAoB+F,EAAAX,EAAAp/E,GAAA0/E,EAAA1/E,EACpBygE,EAAA,GAAqBuZ,EAAAiF,EAAKj/E,GAAAgsE,EAAGhsE,EACpB1yB,EAAA0yF,GAAOS,EAAAqe,GAAE9+E,GAClB,IAAAggF,GAAA3f,GAAA,CAAA2f,GAAA1f,GAAA,CAAAhzF,GAAAiD,GACA,uCACA,OAAAjD,CACA,CACO,IAAA0yG,GAAkB/d,GAAA0c,GAAW9+H,KAAAA,EAAAA,KAAAA,EAAA,CAAA8iH,KAAAqc,EAAA,GACpCiB,GAAAxB,GAAA,CACA7iI,EAAAyqD,OAAA,GACAvxC,EAAMuxC,OAAA,GACN04D,GAAAihB,GACA5jI,EAAAwiI,GAEA5Z,GAAA3+D,OAAA,iFACA4+D,GAAA5+D,OAAA,iFACA9wB,EAAA8wB,OAAA,GACA80E,KAAA,GAOAvD,KAAA,CACAC,KAAAxxE,OAAA,sEACA,YAAAzlD,EAAA,CACA,IAAAxE,EAAAwiI,GACAsB,EAAA75E,OAAwB,sCACxB85E,EAAA,CAAAtB,GAAAx4E,OAAA,sCACA+5E,EAAA/5E,OAAA,uCACA2lE,EAAAkU,EACAG,EAAAh6E,OAAA,uCACAs6D,EAAAoe,GAAA/S,EAAAprH,EAAAxE,GACAkkI,EAAqBvB,GAAG,CAAAoB,EAAAv/H,EAAAxE,GACxBi+H,EAAqBxa,GAAGj/G,EAAA+/G,EAAAuf,EAAAI,EAAAF,EAAAhkI,GACxBs/C,EAAAmkE,GAAA,CAAAc,EAAAwf,EAAAG,EAAAtU,EAAA5vH,GACAg+H,EAAAC,EAAAgG,EACA/F,EAAA5+E,EAAA2kF,EAKA,GAJAjG,GACAC,CAAAA,EAAAj+H,EAAAi+H,CAAA,EACAC,GACA5+E,CAAAA,EAAAt/C,EAAAs/C,CAAA,EACA2+E,EAAAgG,GAAA3kF,EAAA2kF,EACA,mDAAAz/H,EAAA,CAES,OAAAw5H,MAAAA,EAAAC,GAAAA,EAAAC,MAAAA,EAAA5+E,GAAAA,CAAA,CACJ,CACF,CACH,EAAA80E,GAAA/hE,CAAA,EAGA8xE,GAAAl6E,OAAA,GACAwO,GAAA,oBAAA31D,GAA2CqhI,GAAGrhI,GAAAA,EAAAy/H,GAG9C6B,GAAA,GACA,SAAAC,GAAAznH,CAAA,IAAA0nH,CAAA,EACA,IAAAC,EAAAH,EAAA,CAAAxnH,EAAA,CACA,GAAA2nH,KAAA9gI,IAAA8gI,EAAA,CACA,IAAAC,EAAApuE,OAAAlqD,WAAA6R,IAAA,CAAAnB,EAAA,GAAA6qC,EAAAp3B,UAAA,MACAk0G,EAAAE,YAAAD,EAAAA,GACAJ,EAAA,CAAAxnH,EAAA,CAAA2nH,CACA,QACAnuE,OAAAquE,YAAAF,KAAAD,GACA,CAEA,IAEAra,GAAA,GAAA1/F,IAAAznB,EAAAy/H,IACAtU,GAAA,GAAA1jG,IAAAznB,EAAA0/H,IACA9X,GAAAmZ,GAAAlF,eAAA,CChFA+F,GAAAzT,GAAAztE,KAAA,CAAAorE,gBAAA,CACA+V,GAAwB,KACxB,IAAAC,EAAA3T,GAAAztE,KAAA,CAAAorE,gBAAA,GACArtH,EAAAy4F,GAAA4qC,GACAC,EAAA,IAAA34H,WAAA,IAGA,OAFA24H,EAAA9/H,GAAA,CAAA6/H,GACAC,EAAA9/H,GAAA,CAAAxD,EAAA,IACA,CACAA,UAAAA,EACAsjI,UAAAA,CACA,CACA,EACA7qC,GAAAi3B,GAAAj3B,YAAA,CACA,SAAA38B,GAAA97D,CAAA,EACA,GAAI,CAEA,OADJ0vH,GAAAnC,aAAA,CAAAzB,OAAA,CAAA9rH,GACI,EACJ,OACA,QACA,CACA,CACA,IAAA6G,GAAA,CAAArG,EAAe8iI,IAAc5T,GAAA7oH,IAAA,CAAArG,EAAA8iI,EAAA7jI,KAAA,QAAAwtH,GAAAyC,GAAAzC,MAAA,CAGvB/vG,GAAA+uD,GACN,EAAAptE,MAAA,CAAAgd,QAAA,CAAAowD,GACIA,EACOA,aAAAthE,WACPsvG,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAyvD,EAAAzrD,MAAA,CAAAyrD,EAAAjQ,UAAA,CAAAiQ,EAAA1rD,UAAA,EAEJ05F,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAyvD,EACA,OAIAqrC,GACAl3G,YAAA+wC,CAAA,EACAjwC,OAAAC,MAAA,MAAAgwC,EACA,CACArxC,QAAW,CACX,OAAAm6G,EAAAp7G,MAAA,CAAA2d,IAAA,IAAAs2G,GAAA9rH,SAAA,EAAAqvG,GAAA,MACA,CACA,OAAAn/F,OAAWrX,CAAA,EACX,SAAAizH,GAAAyQ,WAAA,EAAAltB,GAAA,KAAAx2G,EACA,CACA,OAAAu1D,gBAAWv1D,CAAA,EACX,SAAAizH,GAAA0Q,oBAAA,EAAAntB,GAAA,KAAAx2G,EACA,EAKA,MAAA01G,WAAA+B,GACAl3G,YAAA+wC,CAAA,EAGA,GAFA,MAAAA,GACA,KAAAsyF,IAAA,IACAviI,IAAAA,OAAAiE,IAAA,CAAAgsC,GAAA9xC,MAAA,CACA,+CAEA6B,OAAAiE,IAAA,CAAAgsC,GAAA7xC,GAAA,CAAAwB,GAAA,CACK,KAAA2iI,IAAA,CAAA3iI,CACL,EACA,CACA,KAAAu1G,GAAA,IAAA9yG,IAOAuyG,GAAA,GAKAK,GAAA,GAWA,SAAAutB,GAAA7iI,CAAA,EACA,OAAAA,KAAAqB,IAAArB,EAAA8iI,GAAA,CAGA,IAAAC,GAAA,CAMA,OAAA3mH,WAAAq6F,GAKAl3G,YAAYS,CAAA,EAIZ,GAHA,UAEA,KAAA8iI,GAAA,QACAD,GAAA7iI,GACM,KAAA8iI,GAAA,CAAA9iI,EAAA8iI,GAAA,KACN,CACA,oBAAA9iI,EAAA,CAEA,IAAAgjI,EAAAjR,KAAA17G,MAAA,CAAArW,GACA,GAAAgjI,EAAAxkI,MAAA,EAAA82G,GACA,wCAEQ,KAAAwtB,GAAA,IAAAlkC,CAAAA,IAAA,EAAAokC,EACR,MACA,KAAAF,GAAA,IAAAlkC,CAAAA,IAAA,EAAA5+F,EACA,CACA,QAAA8iI,GAAA,CAAApjH,UAAA,GAAA41F,GACA,wCAEA,CAMA,OAAA2tB,QAAA,CACA,IAAAhjI,EAAA,IAAAmc,GAAA2mH,IAEA,OADAA,IAAA,EACA,IAAA3mH,GAAAnc,EAAAoc,QAAA,IAWAomC,OAAAtjD,CAAA,EACA,YAAA2jI,GAAA,CAAAt4G,EAAA,CAAArrB,EAAA2jI,GAAA,EAMAl8H,UAAW,CACX,OAAAmrH,KAAA9yH,MAAA,MAAA0nD,OAAA,GACA,CACAm+B,QAAA,CACA,YAAAl+E,QAAA,GAMA+/C,SAAA,CACA,IAAArnC,EAAA,KAAAjD,QAAA,GACA,WAAAvS,WAAAwV,EAAAK,MAAA,CAAAL,EAAA67C,UAAA,CAAA77C,EAAAI,UAAA,EAMArD,UAAA,CACA,IAAA/F,EAAA,KAAAwsH,GAAA,CAAA/4G,WAAA,CAAAqvF,EAAAp7G,MAAA,EACA,GAAAsY,EAAA9X,MAAA,GAAA82G,GACA,OAAAh/F,CACA,CACA,IAAA2O,EAAAm0F,EAAAp7G,MAAA,CAAAknB,KAAA,KAEA,OADA5O,EAAA6O,IAAA,CAAAF,EAAA,GAAA3O,EAAA9X,MAAA,EACAymB,CACA,CACA,IAAArkB,OAAAm6C,WAAwB,IACxB,wBAAAx0C,QAAA,MAMAA,UAAA,CACA,YAAAK,QAAA,GASA,aAAAg8D,eAAmBuT,CAAA,CAAA9c,CAAA,CAAAhd,CAAa,EAChC,IAAA18B,EAAAy5F,EAA2Bp7G,MAAA,CAAA01B,MAAA,EAAAyiD,EAAM95D,QAAA,GAAA+8F,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA09C,GAAAhd,EAAAhgC,QAAA,KACjC6mH,EAAA,GAAAlR,GAAA/hE,CAAA,EAAAtwC,GACA,WAAAvD,GAAA8mH,EAAA,CAOA,OAAA3nE,yBAAiBra,CAAA,CAAA7E,CAAY,EAC7B,IAAA18B,EAAAy5F,EAAAp7G,MAAA,CAAAknB,KAAA,IACAg8B,EAAAz2C,OAAA,UAAA4uD,CAAA,EACA,GAAAA,EAAA76D,MAAA,CAAAy2G,GACA,4CAEKt1F,EAAAy5F,EAAAp7G,MAAA,CAAA01B,MAAA,EAAA/T,EAAAtD,GAAAg9C,GAAA,CACL,GACA15C,EAAAy5F,EAA2Bp7G,MAAA,CAAA01B,MAAA,EAAA/T,EAAM08B,EAAAhgC,QAAA,GAAA+8F,EAAAp7G,MAAA,CAAA2d,IAAA,4BACjC,IAAAunH,EAAA,GAAAlR,GAAA/hE,CAAA,EAAAtwC,GACA,GAAAs7C,GAAAioE,GACA,8DAEA,WAAA9mH,GAAA8mH,EAAA,CAUA,aAAAC,qBAAAjiF,CAAA,CAAA7E,CAAA,EACA,YAAAkf,wBAAA,CAAAra,EAAA7E,EAAA,CAUA,OAAAgF,uBAAAH,CAAA,CAAA7E,CAAA,EACA,IACAQ,EADApxB,EAAA,IAEA,KAAAA,GAAAA,GAAA,CACA,IACA,IAAA23G,EAAAliF,EAAAxtB,MAAA,CAAA0lF,EAAAp7G,MAAA,CAAA2d,IAAA,EAAA8P,EAAA,GACQoxB,EAAA,KAAA0e,wBAAA,CAAA6nE,EAAA/mF,EACR,OAAAr0C,EAAA,CACA,GAAAA,aAAA1I,UACA,MAAA0I,CAAA,CAEAyjB,IACA,SAEA,OAAAoxB,EAAApxB,EAAA,CAEA,6DASA,aAAAw1B,mBAAAC,CAAA,CAAA7E,CAAA,EACA,YAAAgF,sBAAA,CAAAH,EAAA7E,EAAA,CAMA,OAAA4e,UAAAooE,CAAA,EACA,IAAAp/E,EAAA,IAAA7nC,GAAAinH,GACA,OAAApoE,GAAAhX,EAAA0C,OAAA,GACA,CACA,CACAixD,EAAAx7F,GACAA,GAAAgI,OAAA,KAAAwzF,EAAA,oCACApC,GAAA7yG,GAAA,CAAAyZ,GAAA,CACA62C,KAAA,SACCx6C,OAAA,kBAQD,OAAAm7F,GASAr0G,YAAAkjI,CAAA,EAKA,GAHA,KAAAa,UAAA,QAEA,KAAAC,UAAA,QACAd,EAAA,CACA,IAAAe,EAAAnnH,GAAAomH,GACA,GAAAA,KAAAA,EAAAjkI,MAAA,CACA,mCAEA,KAAA8kI,UAAA,CAAAE,EAAA5kI,KAAA,QACM,KAAA2kI,UAAA,CAAAC,EAAA5kI,KAAA,MACN,MACA,KAAA2kI,UAAA,CAAAlnH,GAAAimH,MACA,KAAAgB,UAAA,CAAAjnH,GAAAu7E,GAAA,KAAA2rC,UAAA,EACA,CAMA,IAAApkI,WAAA,CACA,WAAAid,GAAA,KAAAknH,UAAA,EAQA,IAAAb,WAAW,CACX,OAAArpB,EAAAp7G,MAAA,CAAA01B,MAAA,OAAA6vG,UAAA,MAAAD,UAAA,KACA,EAEA,IAAApvB,GAAA,IAAA93F,GAAA,+CAUAoxE,GAAA,KACAypB,GAAA,IAAA1B,GAAA,EAGA,OAAAoB,WAAA3rG,MACAzL,YAAAwK,CAAuB,EACvB,mBAAAA,EAAA,uCACA,KAAAA,SAAA,QACA,KAAAA,SAAA,CAAAA,CACA,CACA,CACA1J,OAAA8L,cAAA,CAAAwqG,GAAA5qG,SAAA,SACC/L,MAAA,4CACD,EACA,OAAA62G,WAAA7rG,MACAzL,YAAAwK,CAAA,CAAA05H,CAAA,EACA,0CAAAA,EAAA74F,OAAA,yEAAA7gC,EAAA,2CACA,KAAAA,SAAA,QACA,KAAAA,SAAA,CAAAA,CACA,CACA,CACA1J,OAAA8L,cAAA,CAAA0qG,GAAA9qG,SAAA,SACC/L,MAAA,gCACD,EACA,OAAA42G,WAAA5rG,MACAzL,YAAAwK,CAAuB,EACvB,mBAAAA,EAAA,8CACA,KAAAA,SAAA,QACA,KAAAA,SAAA,CAAAA,CACA,CACA,CACA1J,OAAA8L,cAAA,CAAAyqG,GAAA7qG,SAAA,SACC/L,MAAA,uCAGD,OAAAm1G,GACA51G,YAAAmkI,CAAA,CAAAC,CAAA,EACA,KAAAD,iBAAA,QACA,KAAAC,sBAAA,QACA,KAAAD,iBAAA,CAAAA,EACA,KAAAC,sBAAA,CAAAA,CACA,CACAC,aAAA,CACA,IAAAA,EAAA,MAAAF,iBAAA,EAKA,OAJA,KAAAC,sBAAA,GACAC,EAAA9mI,IAAA,MAAA6mI,sBAAA,CAAAtmF,QAAA,EACAumF,EAAA9mI,IAAA,MAAA6mI,sBAAA,CAAAE,QAAA,GAEAD,CACA,CACAvjH,IAAA1hB,CAAA,EACA,QAAAmlI,KAAA,KAAAF,WAAA,IACA,GAAAjlI,EAAAmlI,EAAAtlI,MAAA,CACQ,OAAAslI,CAAA,CAAAnlI,EAAA,CAERA,GAAAmlI,EAAAtlI,MAAA,CAIA,CACA,IAAAA,QAAA,CACA,YAAAolI,WAAA,GAAA1+E,IAAA,GAAA1mD,MAAA,CAEAulI,oBAAAjnF,CAAA,EAEA,IAAAknF,EAAA,IACA,QAAAxlI,MAAA,CAAAwlI,EAAA,EACA,qEAEA,IAAAC,EAAA,IAAAvhI,IACA,KAAAkhI,WAAA,GAAA1+E,IAAA,GAAAz6C,OAAA,EAAAxK,EAAAtB,IAAA,CACKslI,EAAAthI,GAAA,CAAA1C,EAAA2G,QAAA,GAAAjI,EACL,GACA,IAAAulI,EAAAjkI,GAAA,CACA,IAAAivC,EAAA+0F,EAAA5jH,GAAA,CAAApgB,EAAA2G,QAAA,IACA,GAAAsoC,KAAA7tC,IAAA6tC,EAAA,iFACA,OAAAA,CACA,EACA,OAAA4N,EAAAr+C,GAAA,CAAAwqD,GACA,EACAk7E,eAAAD,EAAAj7E,EAAA5M,SAAA,EACA+nF,kBAAAn7E,EAAA3kD,IAAA,CAAA7F,GAAA,CAAA2L,GAAA85H,EAAA95H,EAAA65C,MAAA,GACAjlD,KAAAiqD,EAAAjqD,IAAA,CACK,EAEL,EAMA,IAAAG,GAAS,CAAA8W,EAAiB,cAC1BF,GAAAyF,IAAA,IAAAvF,GAMAlM,GAAS,CAAAkM,EAAiB,cAC1BF,GAAAyF,IAAA,IAAAvF,GAKAouH,GAAc,CAAApuH,EAAqB,QAAgB,IACnD,IAAAquH,EAAAvuH,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,WAAAtF,GAAAsF,GAAA,kBAAAtF,GAAAyF,IAAA,CAAAzF,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,iBAAApF,GACAsuH,EAAAD,EAAAjuH,MAAA,CAAA6D,IAAA,CAAAoqH,GACA/wE,EAAA+wE,EAAArlI,MAAA,CAAAib,IAAA,CAAAoqH,GACAE,EAAAF,EAcA,OAbAE,EAAAnuH,MAAA,EAAAC,EAAAC,IAAA,CACA,IAAAvX,EAAAulI,EAAAjuH,EAAAC,GACA,OAAAvX,EAAA,MAAAuH,QAAA,EACA,EACAi+H,EAAAvlI,MAAA,EAAAmpB,EAAA9R,EAAAC,IAAA,CACA,IAAAvX,EAAa,CACb0c,MAAA09F,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAyM,EAAA,OACA,EACA,OAAAmrC,EAAAv0D,EAAAsX,EAAAC,EACA,EACAiuH,EAAAt/G,KAAW,CAAAkD,GACXrS,GAAAsF,GAAA,GAAArF,IAAA,CAAAD,GAAAsF,GAAA,GAAArF,IAAA,CAAAojG,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAyM,EAAA,QAAA5pB,MAAA,CAEAgmI,CAAA,EAMAhrE,GAAS,CAAAvjD,EAAmB,eAC5BF,GAAA7W,MAAA,EAAAC,GAAA,UAAAA,GAAA,eAAA8W,GAMAwuH,GAAS,CAAAxuH,EAAqB,QAAiB,GAC/CF,GAAA7W,MAAA,EAAA6W,GAAAwF,IAAA,kBAAAxF,GAAAwF,IAAA,UAAApc,GAAA,cAAA8W,GAMAyuH,GAAS,CAAAzuH,EAAmB,aAC5BF,GAAA7W,MAAA,EAAAC,GAAA,cAAAA,GAAA,mBAAAA,GAAA,wBAAA4W,GAAAqF,EAAA,gBAAAnF,GAMA0uH,GAA8C,CAAA1uH,EAAA,8BAC9CF,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,0BAAAlc,GAAA,yCAAAklI,GAAA,kCAAAllI,GAAA,kBAAA8W,GAEA,SAAA2uH,GAAA1kI,CAAA,CAAAuY,CAAA,EACA,IAAAosH,EAAAj4F,GAAA,CACA,GAAAA,EAAA52B,IAAA,IACM,OAAA42B,EAAA52B,IAAA,CACN,sBAAA42B,EAAA1nB,KAAA,CACM,OAAA0nB,EAAA1nB,KAAA,CAAAzM,CAAA,CAAAm0B,EAAA32B,QAAA,EAWN,CAVA,aAAA22B,GAAA,kBAAAA,EAAA,CACA,IAAA2kC,EAAA94D,CAAA,CAAAm0B,EAAA32B,QAAA,EACA,GAAA7X,MAAA6D,OAAA,CAAAsvE,GACA,OAAAA,EAAA/yE,MAAA,CAAAqmI,EAAAj4F,EAAAziB,aAAA,CACM,MACN,cAAAyiB,EAEA,OAAAg4F,GAAA,CACOxtH,OAAAw1B,CACP,EAAAn0B,CAAA,CAAAm0B,EAAA32B,QAAA,EACA,CAEA,QACA,EACAiP,EAAA,EAIA,OAHAhlB,EAAAkX,MAAA,CAAAqB,MAAA,CAAAhO,OAAA,CAAAmiC,GAAA,CACG1nB,GAAA2/G,EAAAj4F,EACH,GACA1nB,CAAA,CAGA,SAAA4/G,GAAAnjH,CAAA,EACA,IAAAqV,EAAA,EACA74B,EAAS,EACT,QACA,IAAAi1F,EAAAzxE,EAAAvI,KAAA,GAGA,GAFA4d,GAAA,CAAAo8D,IAAAA,CAAA,GAAAj1F,EAAAA,EACAA,GAAA,EACA,CAAAi1F,IAAAA,CAAA,KACA,MAGA,OAAAp8D,CACA,CACA,SAAA28E,GAAAhyF,CAAA,CAAAqV,CAAA,EACA,IAAAm8D,EAASn8D,EACT,QACA,IAAAo8D,EAAAD,IAAAA,EAEA,GAAAA,GADAA,CAAAA,IAAA,GACA,CACAxxE,EAAA7kB,IAAA,CAAAs2F,GACM,MAIN,GAFA,IACAzxE,EAAA7kB,IAAA,CAAAs2F,EAEA,EAGA,SAAA2xC,GAAAhgI,CAAA,CAAApF,CAAA,EACA,IAAAoF,EACA,YAAApF,GAAA,oBAIA,MAAAqlI,GACAzlI,YAAAmmB,CAAA,CAAAu/G,CAAA,EACA,KAAAv/G,KAAA,QACA,KAAAu/G,UAAA,QACA,KAAAv/G,KAAA,CAAAA,EACA,KAAAu/G,UAAA,CAAAA,CACA,CACA,OAAAn0G,QAAAgsB,CAAA,CAAAp3B,CAAA,EACA,IAAAu/G,EAAA,IAAAviI,IACAwiI,EAAAjhF,GAAA,CACA,IAAApH,EAAAoH,EAAAr9C,QAAA,GACAu+H,EAAAF,EAAA5kH,GAAA,CAAAw8B,GASA,OARAx7C,KAAAA,IAAA8jI,IACAA,EAAA,CACAjhF,SAAA,GACAC,WAAA,GACAihF,UAAA,EACA,EACAH,EAAAtiI,GAAA,CAAAk6C,EAAAsoF,IAEAA,CACA,EACAE,EAAAH,EAAAx/G,GAGA,QAAAqkC,KAFAs7E,EAAAnhF,QAAA,IACAmhF,EAAAlhF,UAAA,IACArH,GAEA,QAAAwoF,KADAJ,EAAAn7E,EAAA1N,SAAA,EAAA+oF,SAAA,IACAr7E,EAAAzlD,IAAA,GACA,IAAA6gI,EAAAD,EAAAI,EAAArhF,MAAA,CACAkhF,CAAAA,EAAAjhF,QAAA,GAAAohF,EAAAphF,QAAA,CACAihF,EAAAhhF,UAAA,GAAAmhF,EAAAnhF,UAAA,CAGA,WAAA6gF,GAAAt/G,EAAAu/G,EACA,CACAM,sBAAA,CACI,IAAAC,EAAA,QAAM,CAAAP,UAAA,CAAA1iI,OAAA,IACVwiI,GAAAS,EAAAhnI,MAAA,iDACA,IAAAinI,EAAAD,EAAA59G,MAAA,IAAAxd,EAAA,GAAAA,EAAA85C,QAAA,EAAA95C,EAAA+5C,UAAA,EACAuhF,EAAAF,EAAA59G,MAAA,IAAAxd,EAAA,GAAAA,EAAA85C,QAAA,GAAA95C,EAAA+5C,UAAA,EACAwhF,EAAAH,EAAA59G,MAAA,IAAAxd,EAAA,IAAAA,EAAA85C,QAAA,EAAA95C,EAAA+5C,UAAA,EACAyhF,EAAAJ,EAAA59G,MAAA,IAAAxd,EAAA,IAAAA,EAAA85C,QAAA,GAAA95C,EAAA+5C,UAAA,EACAhmC,EAAA,CACA0nH,sBAAAJ,EAAAjnI,MAAA,CAAAknI,EAAAlnI,MAAA,CACAsnI,0BAAAJ,EAAAlnI,MAAA,CACAunI,4BAAAH,EAAApnI,MAAA,CAIA,EACAumI,GAAAU,EAAAjnI,MAAA,gDACM,IAAAwnI,EAAA,CAAAP,CAAM,IACZV,GAAAiB,IAAA,KAAAtgH,KAAA,CAAA9e,QAAA,4DACA,CACA,IAAA88H,EAAA,IAAA+B,EAAAhnI,GAAA,GAAAo+C,EAAA,OAAAzgC,GAAAygC,OAAA6oF,EAAAjnI,GAAA,GAAAo+C,EAAA,OAAAzgC,GAAAygC,OAAA8oF,EAAAlnI,GAAA,GAAAo+C,EAAA,OAAAzgC,GAAAygC,OAAA+oF,EAAAnnI,GAAA,GAAAo+C,EAAA,OAAAzgC,GAAAygC,IAAA,CACA,OAAA1+B,EAAAulH,EAAA,CAEAuC,mBAAAC,CAAA,EACA,IAAAC,EAAAC,EAAA,MAAAC,2BAAA,CAAAH,EAAA39E,KAAA,CAAA7hD,SAAA,CAAAy+H,GAAA,CAAAA,EAAAjhF,QAAA,GAAAihF,EAAAC,SAAA,EAAAD,EAAAhhF,UAAA,GAAAmiF,EAAAC,EAAA,MAAAF,2BAAA,CAAAH,EAAA39E,KAAA,CAAA7hD,SAAA,CAAAy+H,GAAA,CAAAA,EAAAjhF,QAAA,GAAAihF,EAAAC,SAAA,GAAAD,EAAAhhF,UAAA,EAIA,GAAAgiF,IAAAA,EAAA3nI,MAAA,EAAA8nI,IAAAA,EAAA9nI,MAAA,CAGA,QACAo9E,WAAAsqD,EAAAjmI,GAAA,CACAkmI,gBAAAA,EACKG,gBAAAA,CACL,GACAjpF,SAAA+oF,EACKvC,SAAA0C,CACL,GAIAF,4BAAAG,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,GACAC,EAAA,GACA,QAAA9pF,EAAAsoF,EAAA,QAAAF,UAAA,CAAA1iI,OAAA,GACA,GAAAkkI,EAAAtB,GAAA,CACA,IAAAllI,EAAA,IAAAmc,GAAAygC,GACA+pF,EAAAJ,EAAA70E,SAAA,CAAAghC,GAAAA,EAAAlwC,MAAA,CAAAxiD,IACU2mI,GAAA,IACV7B,GAAA6B,EAAA,uCACAF,EAAA5pI,IAAA,CAAA8pI,GACAD,EAAA7pI,IAAA,CAAAmD,GACA,KAAAglI,UAAA,CAAAlpE,MAAA,CAAAlf,GAEA,OAEA,CAAA6pF,EAAAC,EAAA,CACA,CAEA,IAAAE,GAAA,qCAMA,SAAAC,GAAA78B,CAAA,EACA,GAAAA,IAAAA,EAAAzrG,MAAA,CACA,YAAAqoI,GAAA,CAEA,OAAA58B,EAAA7wF,KAAA,GAOA,SAAA2tH,GAAA98B,CAAA,IAAAnjG,CAAA,EACA,IAAAgoC,EAAA,CAAAhoC,EACA,GAAAA,IAAAA,EAAAtI,MAAA,CACAswC,EAAAhoC,CAAAA,CAAA,QAAAmjG,EAAAzrG,MAAA,CAAAswC,GAAAm7D,EAAAzrG,MAAA,CACA,YAAAqoI,GAAA,CAEA,OAAA58B,EAAA+8B,MAAA,IAAAlgI,EAAA,CAkBA,MAAAouG,GACA31G,YAAAuH,CAAA,EACA,KAAAqX,MAAA,QACA,KAAA8oH,WAAA,QACA,KAAA99H,eAAA,QACA,KAAA2zC,YAAA,QACA,KAAAoqF,iBAAA,KAAAxkI,IACA,KAAAyb,MAAA,CAAArX,EAAAqX,MAAA,CACA,KAAA8oH,WAAA,CAAAngI,EAAAmgI,WAAA,CAAAxoI,GAAA,CAAAgH,GAAA,IAAA2W,GAAA3W,IACA,KAAA0D,eAAA,CAAArC,EAAAqC,eAAA,CACA,KAAA2zC,YAAA,CAAAh2C,EAAAg2C,YAAA,CACA,KAAAA,YAAA,CAAAryC,OAAA,CAAAs/C,GAAA,KAAAm9E,iBAAA,CAAAvkI,GAAA,CAAAonD,EAAAo6E,cAAA,MAAA8C,WAAA,CAAAl9E,EAAAo6E,cAAA,GACA,CACA,IAAApkE,SAAA,CACA,cACA,CACA,IAAA2jE,mBAAA,CACA,YAAAuD,WAAA,CAEA,IAAAE,sBAAA,CACA,YAAArqF,YAAA,CAAAr+C,GAAA,CAAAsrD,GAAA,EACAo6E,eAAAp6E,EAAAo6E,cAAA,CACAC,kBAAYr6E,EAAAvkD,QAAW,CAClBxG,KAAA+yH,KAAA17G,MAAA,CAAA0zC,EAAA/qD,IAAA,CACL,GACA,CACA,IAAAooI,qBAAA,CACA,SAEAC,gBAAA,CACA,WAAAlyB,GAAA,KAAAuuB,iBAAA,CACA,CACA,OAAA5yG,QAAAhqB,CAAA,EACA,IAAAwgI,EAAAtC,GAAAl0G,OAAA,CAAAhqB,EAAAg2C,YAAA,CAAAh2C,EAAAygI,QAAA,EACA,CAAAppH,EAAAulH,EAAA,CAAA4D,EAAA/B,oBAAA,GACA0B,EAAA,IAAA9xB,GAAAuuB,GACA5mF,EAAAmqF,EAAAlD,mBAAA,CAAAj9H,EAAAg2C,YAAA,EAAAr+C,GAAA,CAAAsrD,GAAA,EACAo6E,eAAAp6E,EAAAo6E,cAAA,CACA3+H,SAAYukD,EAAAq6E,iBAAW,CAClBplI,KAAA+yH,KAAA9yH,MAAA,CAAA8qD,EAAA/qD,IAAA,CACL,IACA,WAAAk2G,GAAA,CACA/2F,OAAAA,EACA8oH,YAAAvD,EACAv6H,gBAAArC,EAAAqC,eAAA,CACK2zC,aAAAA,CACL,EACA,CACA0qF,gBAAA7oI,CAAA,EACA,OAAAA,EAAA,KAAAwf,MAAA,CAAA0nH,qBAAA,CAEA4B,kBAAA9oI,CAAA,EACA,IAAA+oI,EAAA,KAAAvpH,MAAA,CAAA0nH,qBAAA,CACA,GAAAlnI,GAAA,KAAAwf,MAAA,CAAA0nH,qBAAA,EACA,IAAA8B,EAAAhpI,EAAA+oI,EACAE,EAAA,KAAAX,WAAA,CAAAzoI,MAAA,CAAAkpI,EACAG,EAAAD,EAAA,KAAAzpH,MAAA,CAAA4nH,2BAAA,CACM,OAAA4B,EAAAE,CACN,CAGA,CAFA,IAAAC,EAAAJ,EAAA,KAAAvpH,MAAA,CAAA2nH,yBAAA,CACA,OAAAnnI,EAAAmpI,CACA,CACA,CACAC,YAAAppI,CAAA,EACA,YAAAuoI,iBAAA,CAAAtmH,GAAA,CAAAjiB,EACA,CACAqpI,YAAA,CACA,eAAAd,iBAAA,CAAArwH,MAAA,IAEAlQ,eAAA,CACA,YAAAsgI,WAAA,CAAAr/G,MAAA,EAAAlpB,EAAAC,IAAA,MAAAopI,WAAA,CAAAppI,GACA,CACAwH,WAAA,CACA,IAAA8hI,EAAA,KAAAhB,WAAA,CAAAzoI,MAAA,CACA0pI,EAAA,GACAv0B,GAAAu0B,EAAAD,GACA,IAAAnrF,EAAA,KAAAA,YAAA,CAAAr+C,GAAA,CAAAwqD,GAAA,CACA,IACAzjD,SAAAA,CAAA,CACQ2+H,eAAAA,CAAA,CACR,CAAAl7E,EACAjqD,EAAAZ,MAAAud,IAAA,CAAAo2G,KAAA17G,MAAA,CAAA4yC,EAAAjqD,IAAA,GACAmpI,EAAA,GACAx0B,GAAAw0B,EAAA3iI,EAAAhH,MAAA,EACA,IAAA4pI,EAAA,GAEA,OADAz0B,GAAAy0B,EAAAppI,EAAAR,MAAA,EACA,CACA2lI,eAAAA,EACAgE,gBAAA/uB,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAwsH,GACAE,WAAoB7iI,EACpB8iI,WAAAlvB,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAysH,GACAppI,KAAAA,CACK,CACL,GACAupI,EAAA,GACA50B,GAAA40B,EAA4BzrF,EAAAt+C,MAAA,EACxB,IAAAgqI,EAAApvB,EAAWp7G,MAAA,CAAAknB,KAAA,CAAAsoE,IACf4rB,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA4sH,GAAApjH,IAAA,CAAAqjH,GACA,IAAAC,EAAAF,EAAA/pI,MAAA,CACAs+C,EAAAryC,OAAA,CAAAw+C,GAAgC,CAChC,IAAAy/E,EAAA3yH,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,mBAAArF,GAAAyF,IAAA,CAAAytC,EAAAk/E,eAAA,CAAA3pI,MAAA,oBAAAuX,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,aAAA6tC,EAAAo/E,UAAA,CAAA7pI,MAAA,eAAAuX,GAAAyF,IAAA,CAAAytC,EAAAq/E,UAAA,CAAA9pI,MAAA,eAAAuX,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,cAAA6tC,EAAAjqD,IAAA,CAAAR,MAAA,WACAA,EAAAkqI,EAAAzpI,MAAA,CAAAgqD,EAAAu/E,EAAAC,GACKA,GAAAjqI,CACL,GACAgqI,EAAAA,EAAgD5pI,KAAA,GAAA6pI,GAChD,IAAAE,EAAA5yH,GAAA7W,MAAA,EAAA6W,GAAAyF,IAAA,4BAAAzF,GAAAyF,IAAA,gCAAAzF,GAAAyF,IAAA,kCAAAzF,GAAAyF,IAAA,CAAA0sH,EAAA1pI,MAAA,aAAAuX,GAAAqU,GAAA,CAAAjrB,GAAA,OAAA8oI,EAAA,QAAA9oI,GAAA,qBACAyG,EAAA,CACAigI,sBAAAzsB,EAAiCp7G,MAAA,CAAA2d,IAAA,MAAW,CAAAwC,MAAA,CAAA0nH,qBAAA,GAC5CC,0BAAA1sB,EAAmCp7G,MAAA,CAAA2d,IAAA,EAAW,KAAAwC,MAAA,CAAA2nH,yBAAA,GAC9CC,4BAAgB3sB,EAAWp7G,MAAA,CAAA2d,IAAA,OAAAwC,MAAA,CAAA4nH,2BAAA,GAC3BmC,SAAA9uB,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAusH,GACA5jI,KAAA,KAAA2iI,WAAuB,CAAAxoI,GAAA,CAAAwB,GAAAoc,GAAWpc,EAAA0mD,OAAA,KAClCx9C,gBAAA4oH,KAAA17G,MAAA,MAAAlN,eAAA,CACA,EACAjD,EAAAkzG,EAAAp7G,MAAA,CAAAknB,KAAA,OACA1mB,EAAAmqI,EAAA1pI,MAAA,CAAA2G,EAAAM,GAEA,OADAsiI,EAAArjH,IAAA,CAAAjf,EAAA1H,GACA0H,EAAAtH,KAAA,GAAAJ,EAAAgqI,EAAAhqI,MAAA,EAMA,OAAAmd,KAAAgE,CAAA,EAEA,IAAAsqF,EAAA,IAAAtqF,EAAA,CACAkmH,EAAAiB,GAAA78B,GACA,GAAA47B,IAAAA,CAAAA,EAAA5uB,EAAA,EACA,2FAEA,IAAA6uB,EAAAgB,GAAA78B,GACA87B,EAAAe,GAAA78B,GACA2+B,EAAA9D,GAAA76B,GACAg9B,EAAoB,GACpB,QAAArjI,EAAA,EAAAA,EAAAglI,EAAAhlI,IAAA,CACA,IAAA6B,EAAAshI,GAAA98B,EAAqC,EAAAqL,IACrC2xB,EAAAnqI,IAAA,KAAAsf,GAAAg9F,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAlW,IACA,CACA,IAAA0D,EAAA49H,GAAA98B,EAAA,EAAAqL,IACAizB,EAAAzD,GAAA76B,GACAntD,EAAoB,GACpB,QAAAl5C,EAAA,EAAAA,EAAA2kI,EAAA3kI,IAAA,CACA,IAAAugI,EAAA2C,GAAA78B,GACA2+B,EAAA9D,GAAA76B,GACAzkG,EAAAuhI,GAAA98B,EAAA,EAAA2+B,GACAN,EAAAxD,GAAA76B,GACA4+B,EAAmB9B,GAAA98B,EAAY,EAAAq+B,GAC/BtpI,EAAA+yH,KAAA9yH,MAAA,CAAAm6G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAktH,IACA/rF,EAAAhgD,IAAA,EACAqnI,eAAAA,EACA3+H,SAAAA,EACOxG,KAAAA,CACP,EACA,CACA,IAAA8pI,EAAA,CACA3qH,OAAA,CACA0nH,sBAAAA,EACAC,0BAAAA,EACOC,4BAAAA,CACP,EACA58H,gBAAA4oH,KAAA9yH,MAAA,CAAAm6G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAxS,IACA89H,YAAAA,EACAnqF,aAAAA,CACA,EACA,WAAAo4D,GAAA4zB,EACA,EAOA,MAAA1zB,GACA71G,YAAAuH,CAAA,EACA,KAAAqX,MAAA,QACA,KAAAulH,iBAAA,QACA,KAAAv6H,eAAA,QACA,KAAAg+H,oBAAA,QACA,KAAAC,mBAAA,QACA,KAAAjpH,MAAA,CAAArX,EAAAqX,MAAA,CACA,KAAAulH,iBAAA,CAAA58H,EAAA48H,iBAAA,CACA,KAAAv6H,eAAA,CAAArC,EAAAqC,eAAA,CACA,KAAAg+H,oBAAA,CAAArgI,EAAAqgI,oBAAA,CACA,KAAAC,mBAAA,CAAAtgI,EAAAsgI,mBAAA,CAEA,IAAArnE,SAAA,CACA,QACA,CACA,IAAAgpE,2BAAA,CACA,IAAAl5G,EAAA,EACA,QAAAkvE,KAAA,KAAAqoC,mBAAA,CACAv3G,GAAAkvE,EAAAunC,eAAA,CAAA9nI,MAAA,CAAAugG,EAAAonC,eAAA,CAAA3nI,MAAA,CAEA,OAAAqxB,CACA,CACAw3G,eAAAvgI,CAAA,EACA,IAAA68H,EACA,GAAA78H,GAAA,2BAAAA,GAAAA,EAAA68H,sBAAA,EACA,QAAAoF,yBAAA,EAAAjiI,EAAA68H,sBAAA,CAAAtmF,QAAA,CAAA7+C,MAAA,CAAAsI,EAAA68H,sBAAA,CAAAE,QAAA,CAAArlI,MAAA,CACA,2GAEMmlI,EAAA78H,EAAA68H,sBAAA,MACN,GAAA78H,GAAA,+BAAAA,GAAAA,EAAAkiI,0BAAA,CACMrF,EAAA,KAAAsF,0BAAA,CAAAniI,EAAAkiI,0BAAA,OACN,QAAA5B,mBAAA,CAAA5oI,MAAA,GACA,0FAEA,WAAA22G,GAAA,KAAAuuB,iBAAA,CAAAC,EACA,CACA6D,gBAAA7oI,CAAA,EACA,OAAAA,EAAA,KAAAwf,MAAA,CAAA0nH,qBAAA,CAEA4B,kBAAA9oI,CAAA,EACA,IAAA+oI,EAAA,KAAAvpH,MAAA,CAAA0nH,qBAAA,CACAqD,EAAA,KAAAxF,iBAAA,CAAAllI,MAAA,CACA,GAAAG,GAAAuqI,EAAA,CACA,IAAAC,EAAAxqI,EAAAuqI,EACAE,EAAA,KAAAhC,mBAAA,CAAAzuH,MAAA,EAAAkX,EAAAkvE,IAAAlvE,EAAAkvE,EAAAonC,eAAA,CAAA3nI,MAAA,IACM,OAAA2qI,EAAAC,CACN,CAQA,GARAzqI,GAAA,KAAAwf,MAAA,CAAA0nH,qBAAA,EACA,IAAA8B,EAAAhpI,EAAA+oI,EACAE,EAAAsB,EAAAxB,EACAG,EAAAD,EAAA,KAAAzpH,MAAA,CAAA4nH,2BAAA,CACM,OAAA4B,EAAAE,CACN,CAGA,CAFA,IAAAC,EAAAJ,EAAA,KAAAvpH,MAAA,CAAA2nH,yBAAA,CACA,OAAAnnI,EAAAmpI,CACA,CACA,CACAmB,2BAAAD,CAAA,EACA,IAAArF,EAAA,CACAtmF,SAAA,GACAwmF,SAAA,IAEA,QAAAwF,KAAA,KAAAjC,mBAAA,EACA,IAAAkC,EAAAN,EAAAtkI,IAAA,CAAAe,GAAAA,EAAAxF,GAAA,CAAAwiD,MAAA,CAAA4mF,EAAAztD,UAAA,GACA,IAAA0tD,EACA,yEAAAD,EAAAztD,UAAA,CAAAh1E,QAAA,MAEA,QAAAjI,KAAA0qI,EAAAlD,eAAA,CACA,GAAAxnI,EAAA2qI,EAAA/gF,KAAA,CAAA7hD,SAAA,CAAAlI,MAAA,CACUmlI,EAAAtmF,QAAA,CAAAvgD,IAAA,CAAAwsI,EAAA/gF,KAAA,CAAA7hD,SAAA,CAAA/H,EAAA,OAEV,gDAAAA,EAAA,2BAAA0qI,EAAAztD,UAAA,CAAAh1E,QAAA,MAGA,QAAAjI,KAAA0qI,EAAA/C,eAAA,CACA,GAAA3nI,EAAA2qI,EAAA/gF,KAAA,CAAA7hD,SAAA,CAAAlI,MAAA,CACUmlI,EAAAE,QAAA,CAAA/mI,IAAA,CAAAwsI,EAAA/gF,KAAA,CAAA7hD,SAAA,CAAA/H,EAAA,OAEV,gDAAAA,EAAA,2BAAA0qI,EAAAztD,UAAA,CAAAh1E,QAAA,MAIA,OAAA+8H,CACA,CACA,OAAA7yG,QAAAhqB,CAAA,EACA,IAAAwgI,EAAAtC,GAAAl0G,OAAA,CAAAhqB,EAAAg2C,YAAA,CAAAh2C,EAAAygI,QAAA,EACAH,EAAA,GACAzD,EAAA,CACAtmF,SAAA,GACAwmF,SAAA,IAEA0F,EAAAziI,EAAAkiI,0BAAA,KACA,QAAA9C,KAAAqD,EAAA,CACA,IAAAC,EAAAlC,EAAArB,kBAAA,CAAAC,GACA,GAAAsD,KAAAnoI,IAAAmoI,EAAA,CACA,IAAAC,EAAA,CACApsF,SAAAA,CAAA,CACSwmF,SAAAA,CAAA,CACT,EAAA2F,EACApC,EAAAtqI,IAAA,CAAA2sI,GACA9F,EAAAtmF,QAAA,CAAAvgD,IAAA,IAAAugD,GACAsmF,EAAAE,QAAA,CAAA/mI,IAAA,IAAA+mI,EACA,EAEA,IAAA1lH,EAAAulH,EAAA,CAAA4D,EAAA/B,oBAAA,GACA0B,EAAA,IAAA9xB,GAAAuuB,EAAAC,GACAwD,EAAAF,EAAAlD,mBAAA,CAAAj9H,EAAAg2C,YAAA,EACA,WAAAs4D,GAAA,CACAj3F,OAAAA,EACAulH,kBAAAA,EACAv6H,gBAAArC,EAAAqC,eAAA,CACAg+H,qBAAAA,EACKC,oBAAAA,CACL,EACA,CACAjhI,WAAA,CACA,IAAAujI,EAAAtrI,EAAA,CACAu1G,GAAA+1B,EAAA,KAAAhG,iBAAA,CAAAllI,MAAA,EACA,IAAAmrI,EAAA,KAAAC,qBAAA,GACAC,EAAAzrI,EAAA,CACAu1G,GAAAk2B,EAAA,KAAA1C,oBAAA,CAAA3oI,MAAA,EACA,IAAAsrI,EAAA,KAAAC,4BAAA,GACAC,EAAA5rI,EAAA,CACAu1G,GAAAq2B,EAA8D,KAAA5C,mBAA+B,CAAA5oI,MAAE,EAC/F,IAAAyrI,EAAAl0H,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,WAAArF,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,0BAAArF,GAAAqF,EAAA,8BAAArF,GAAAqF,EAAA,2CAAArF,GAAAyF,IAAA,CAAAkuH,EAAAlrI,MAAA,4BAAAuX,GAAAqU,GAAA,CAAAjrB,KAAA,KAAAukI,iBAAA,CAAAllI,MAAA,sBAAAW,GAAA,mBAAA4W,GAAAyF,IAAA,CAAAquH,EAAArrI,MAAA,uBAAAuX,GAAAyF,IAAA,CAAAmuH,EAAAnrI,MAAA,2BAAAuX,GAAAyF,IAAA,CAAAwuH,EAAAxrI,MAAA,8BAAAuX,GAAAyF,IAAA,CAAAsuH,EAAAtrI,MAAA,oCACA0rI,EAAA,IAAApgI,WAAA0jF,IACA28C,EAAA,IACAC,EAAAH,EAAAhrI,MAAA,EACA8zE,OAAAo3D,EACAhsH,OAAA,KAAAA,MAAA,CACAksH,wBAAA,IAAAvgI,WAAA4/H,GACAhG,kBAAuB,KAAAA,iBAAW,CAAAjlI,GAAA,CAAAwB,GAAAA,EAAA0mD,OAAA,IAClCx9C,gBAAA4oH,KAAA17G,MAAA,MAAAlN,eAAA,EACAmhI,mBAAA,IAAAxgI,WAAA+/H,GACAF,uBAAAA,EACAY,0BAAA,IAAAzgI,WAAAkgI,GACKF,8BAAAA,CACL,EAAAI,GACA,OAAAA,EAAAtrI,KAAA,GAAAwrI,EACA,CACAR,uBAAA,CACA,IAAAY,EAAA,EACAb,EAAA,IAAA7/H,WAAA0jF,IACA,QAAAvkC,KAAA,KAAAk+E,oBAAA,EACA,IAAAsD,EAAArsI,EAAA,CACAu1G,GAAA82B,EAAAxhF,EAAAm7E,iBAAA,CAAA5lI,MAAA,EACA,IAAAksI,EAAAtsI,EAAA,CACAu1G,GAAA+2B,EAAgCzhF,EAAqBjqD,IAAA,CAAAR,MAAe,EACpE,IAAAkqI,EAAA3yH,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,mBAAArF,GAAAyF,IAAA,CAAAivH,EAAAjsI,MAAA,mCAAAuX,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,GAAA6tC,EAAAm7E,iBAAA,CAAA5lI,MAAA,sBAAAuX,GAAAyF,IAAA,CAAAkvH,EAAAlsI,MAAA,sBAAAuX,GAAAyF,IAAA,CAAAytC,EAAAjqD,IAAA,CAAAR,MAAA,WACAgsI,GAAA9B,EAAAzpI,MAAA,EACAklI,eAAAl7E,EAAAk7E,cAAA,CACAsG,+BAAA,IAAA3gI,WAAA2gI,GACArG,kBAAAn7E,EAAAm7E,iBAAA,CACAsG,kBAAA,IAAA5gI,WAAA4gI,GACO1rI,KAAAiqD,EAAAjqD,IAAA,EACP2qI,EAAAa,EACA,CACA,OAAAb,EAAA/qI,KAAA,GAAA4rI,EACA,CACAT,8BAAA,CACA,IAAAS,EAAA,EACAV,EAAA,IAAAhgI,WAAA0jF,IACA,QAAAuR,KAAA,KAAAqoC,mBAAA,EACA,IAAAuD,EAAAvsI,EAAA,CACAu1G,GAAAg3B,EAAA5rC,EAAAonC,eAAA,CAAA3nI,MAAA,EACA,IAAAosI,EAAAxsI,EAAA,CACAu1G,GAAAi3B,EAAuC7rC,EAAmBunC,eAAA,CAAA9nI,MAAA,EAC1D,IAAAqsI,EAAA90H,GAAA7W,MAAA,EAAAC,GAAA,cAAA4W,GAAAyF,IAAA,CAAAmvH,EAAAnsI,MAAA,iCAAAuX,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,GAAA2jF,EAAAonC,eAAA,CAAA3nI,MAAA,oBAAAuX,GAAAyF,IAAA,CAAAovH,EAAApsI,MAAA,iCAAAuX,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,GAAA2jF,EAAAunC,eAAA,CAAA9nI,MAAA,sBACAgsI,GAAAK,EAAA5rI,MAAA,EACA28E,WAAAmjB,EAAAnjB,UAAA,CAAAj1B,OAAA,GACAgkF,6BAAA,IAAA7gI,WAAA6gI,GACAxE,gBAAApnC,EAAAonC,eAAA,CACAyE,6BAAA,IAAA9gI,WAAA8gI,GACOtE,gBAAAvnC,EAAAunC,eAAA,EACPwD,EAAAU,EACA,CACA,OAAAV,EAAAlrI,KAAA,GAAA4rI,EACA,CACA,OAAA9H,YAAAwH,CAAA,EACA,IAAAjgC,EAAA,IAAAigC,EAAA,CACAn3D,EAAA+zD,GAAA78B,GACI6gC,EAAA/3D,EAAMkkC,GACV8tB,GAAAhyD,IAAA+3D,EAAA,0DACI,IAAA/qE,EAAA+qE,EACJ/F,GAAAhlE,IAAAA,EAAA,+DAAAA,EAAA,GACA,IAAA5hD,EAAA,CACA0nH,sBAAAiB,GAAA78B,GACA67B,0BAAAgB,GAAA78B,GACA87B,4BAAAe,GAAA78B,EACA,EACAy5B,EAAA,GACA2G,EAAoBvF,GAA6B76B,GACjD,QAAArmG,EAAA,EAAAA,EAAAymI,EAAAzmI,IACA8/H,EAAA5mI,IAAA,KAAAsf,GAAA2qH,GAAA98B,EAAA,EAAAqL,MAEA,IAAAnsG,EAAA4oH,KAAA9yH,MAAA,CAAA8nI,GAAA98B,EAAA,EAAAqL,KACAizB,EAAAzD,GAAA76B,GACAk9B,EAAoB,GACpB,QAAAvjI,EAAA,EAAAA,EAAA2kI,EAAA3kI,IAAA,CACA,IAAAugI,EAAA2C,GAAA78B,GACA8gC,EAAAjG,GAAA76B,GACAm6B,EAAA2C,GAAA98B,EAAA,EAAA8gC,GACAzC,EAAAxD,GAAA76B,GACAjrG,EAAA,IAAA8K,WAAAi9H,GAAA98B,EAAA,EAAAq+B,IACAnB,EAAArqI,IAAA,EACAqnI,eAAAA,EACAC,kBAAAA,EACOplI,KAAAA,CACP,EACA,CACA,IAAAgsI,EAAAlG,GAAA76B,GACAm9B,EAAoB,GACpB,QAAAxjI,EAAA,EAAAA,EAAAonI,EAAApnI,IAAA,CACA,IAAAg4E,EAAA,IAAAx/D,GAAA2qH,GAAA98B,EAAA,EAAAqL,KACA21B,EAAAnG,GAAA76B,GACAk8B,EAAAY,GAAA98B,EAAA,EAAAghC,GACAC,EAAApG,GAAA76B,GACAq8B,EAAAS,GAAA98B,EAAA,EAAAihC,GACA9D,EAAAtqI,IAAA,EACA8+E,WAAAA,EACAuqD,gBAAAA,EACOG,gBAAAA,CACP,EACA,CACA,WAAAlxB,GAAA,CACAj3F,OAAAA,EACAulH,kBAAAA,EACAv6H,gBAAAA,EACAg+H,qBAAAA,EACKC,oBAAAA,CACL,EACA,EAIA,IAAAhwB,GAAA,CACA+zB,0BAAAjB,CAAA,EACA,IAAAn3D,EAAAm3D,CAAA,IAAAY,EAAA/3D,EAAAkkC,UAIA,IAAAlkC,EACA,SAIG+3D,CAJH,EAMAZ,YAAAA,EAAA,CACA,IAAAnqE,EAAAq3C,GAAA+zB,yBAAA,CAAAjB,GACA,GAAAnqE,WAAAA,EACA,OAAAm1C,GAAAv5F,IAAA,CAAAuuH,EACA,CACA,GAAAnqE,IAAAA,EACM,OAAAq1C,GAAAstB,WAAA,CAAAwH,EAGN,OADA,qCAAAnqE,EAAA,oCAEA,EASAg3C,IACAA,CADAA,EAKI,GAJJ,CAAAA,EAAA,+CACAA,CAAA,CAAAA,EAAA,yBACAA,CAAA,CAAAA,EAAA,yBACAA,CAAA,CAAAA,EAAA,iCACIA,GAKkCq0B,GAAAhyB,EAAAp7G,MAAA,CAAAknB,KAAA,CAAAqwF,IAAA9iB,IAAA,GAsBtC,OAAApuC,GACA9kD,YAAAiJ,CAAA,EAKA,KAAAlE,IAAA,QAIA,KAAA+3C,SAAA,QAIA,KAAAr9C,IAAA,CAAAo6G,EAAAp7G,MAAA,CAAAknB,KAAA,IACA,KAAAm3B,SAAA,CAAA7zC,EAAA6zC,SAAA,CACA,KAAA/3C,IAAA,CAAAkE,EAAAlE,IAAA,CACAkE,EAAAxJ,IAAA,EACA,MAAAA,IAAA,CAAAwJ,EAAAxJ,IAAA,CACA,CAMA8lF,QAAA,CACA,OACAxgF,KAAA,KAAAA,IAAA,CAAA7F,GAAA,GACAwlD,OAAAA,CAAA,CACAC,SAAAA,CAAA,CACOC,WAAAA,CAAA,CACP,KACAF,OAAAA,EAAA6gC,MAAA,GACA5gC,SAAAA,EACOC,WAAAA,CACP,IACA9H,UAAA,KAAAA,SAAA,CAAAyoC,MAAA,GACA9lF,KAAA,SAAAA,IAAA,EAEA,EAoCA,MAAA8qD,GAMA,IAAA//C,WAAA,QACA,KAAAF,UAAA,CAAArL,MAAA,GACA,KAAAqL,UAAA,IAAAE,SAAA,CAEA,KAmBAxK,YAAAiJ,CAAA,EAwCA,GAnCA,KAAAqB,UAAA,IACA,KAAAX,QAAA,QAIA,KAAA4zC,YAAA,IAIA,KAAA3zC,eAAA,QAIA,KAAAuhD,oBAAA,QAKA,KAAA2gF,SAAA,QAQA,KAAAC,mBAAA,QAIA,KAAAC,QAAA,QAIA,KAAAC,KAAA,QACA,CAAAhjI,EACA,MACA,CAOA,GANAA,EAAAU,QAAA,EACA,MAAAA,QAAA,CAAAV,EAAAU,QAAA,EAEAV,EAAAqB,UAAA,EACA,MAAAA,UAAA,CAAArB,EAAAqB,UAAA,EAEAxJ,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAzD,EAAA,cACA,IACAijI,eAAAA,CAAA,CACQJ,UAAAA,CAAA,CACR,CAAA7iI,CACA,MAAA8iI,mBAAA,CAAAG,EACM,KAAAJ,SAAA,CAAAA,CACN,SAAAhrI,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAzD,EAAA,yBACA,IACAa,UAAAA,CAAA,CACQqhD,qBAAAA,CAAA,CACR,CAAAliD,CACA,MAAAW,eAAA,CAAAE,EACM,KAAAqhD,oBAAA,CAAAA,CACN,MACA,IACAvhD,gBAAAA,CAAA,CACQkiI,UAAAA,CAAA,CACR,CAAA7iI,EACA6iI,GACA,MAAAA,SAAA,CAAAA,CAAA,EAEA,KAAAliI,eAAA,CAAAA,CACA,EAMA27E,QAAA,CACA,OACA37E,gBAAA,KAAAA,eAAA,OACAD,SAAA,KAAAA,QAAA,MAAAA,QAAA,CAAA47E,MAAA,QACAumD,UAAA,KAAAA,SAAA,EACA5/G,MAAA,KAAA4/G,SAAA,CAAA5/G,KAAA,CACQigH,iBAAA,KAAAL,SAAA,CAAAK,gBAAA,CAAA5mD,MAAA,EACR,OACAhoC,aAAA,KAAAA,YAAA,CAAAr+C,GAAA,CAAAwqD,GAAAA,EAAA67B,MAAA,IACAj/E,QAAA,KAAAgE,UAAA,CAAApL,GAAA,GACOU,UAAAA,CAAA,CACP,GACOA,EAAA2lF,MAAA,GAEP,EAQAjiF,IAAA,GAAAkb,CAAA,EACA,GAAAA,IAAAA,EAAAvf,MAAA,CACA,+BAWA,OATAuf,EAAAtT,OAAA,CAAAmiC,GAAA,CACA,iBAAAA,EACQ,KAAAkQ,YAAA,MAAAA,YAAA,CAAAppB,MAAA,CAAAkZ,EAAAkQ,YAAA,EACR,SAAAlQ,GAAA,cAAAA,GAAA,SAAAA,EACQ,KAAAkQ,YAAA,CAAAhgD,IAAA,CAAA8vC,GAER,KAAAkQ,YAAA,CAAAhgD,IAAA,KAAAunD,GAAAzX,GAEA,GACA,KAMA++F,gBAAA,KAIAxiI,EACA2zC,EAkBA5zC,EAtBA,QAAAqiI,QAAA,EAAAxqI,KAAAC,SAAA,MAAA8jF,MAAA,MAAA/jF,KAAAC,SAAA,MAAAwqI,KAAA,EACA,YAAAD,QAAA,CAeA,GAXA,KAAAF,SAAA,EACAliI,EAAA,KAAAkiI,SAAA,CAAA5/G,KAAA,CAEQqxB,EADR,KAAAA,YAAA,UAAAuuF,SAAA,CAAAK,gBAAA,CACQ,MAAAL,SAAA,CAAAK,gBAAA,SAAA5uF,YAAA,EAER,KAAAA,YAAA,GAGA3zC,EAAA,KAAAA,eAAA,CACA2zC,EAAA,KAAAA,YAAA,EAEA,CAAA3zC,EACA,oDAMA,GAJA2zC,EAAAt+C,MAAA,IACA8I,QAAAo3D,IAAA,6BAGA,KAAAx1D,QAAA,CACMA,EAAA,KAAAA,QAAA,MACN,QAAAW,UAAA,CAAArL,MAAA,SAAAqL,UAAA,IAAA1K,SAAA,CAEM+J,EAAA,KAAAW,UAAA,IAAA1K,SAAA,MAEN,8CAEA,QAAAyE,EAAA,EAAAA,EAAAk5C,EAAAt+C,MAAA,CAAAoF,IACA,GAAAk5C,KAAAz7C,IAAAy7C,CAAA,CAAAl5C,EAAA,CAAAy4C,SAAA,CACA,6CAAAz4C,EAAA,4BAGA,IAAAokI,EAAA,GACA11D,EAAA,GACAx1B,EAAAryC,OAAA,CAAAw+C,GAAA,CACAA,EAAA3kD,IAAA,CAAAmG,OAAA,CAAA66H,GAAA,CACAhzD,EAAAx1E,IAAA,EACS,GAAAwoI,CAAA,EAET,GACA,IAAAjpF,EAAA4M,EAAA5M,SAAA,CAAA91C,QAAA,GACAyhI,EAAAh2E,QAAA,CAAA3V,IACA2rF,EAAAlrI,IAAA,CAAAu/C,EACK,GAIL2rF,EAAAv9H,OAAA,CAAA4xC,GAAA,CACAi2B,EAAAx1E,IAAA,EACAmnD,OAAA,IAAA7nC,GAAAigC,GACA6H,SAAA,GACOC,WAAA,EACF,KAIL,IAAAynF,EAAA,GACAt5D,EAAA7nE,OAAA,CAAA66H,GAAA,CACA,IAAAuG,EAAAvG,EAAArhF,MAAA,CAAA19C,QAAA,GACAulI,EAAAF,EAAAj6E,SAAA,CAAAjxD,GACOA,EAAAujD,MAAA,CAAA19C,QAAA,KAAAslI,EAEPC,CAAAA,EAAA,IACAF,CAAA,CAAAE,EAAA,CAAA3nF,UAAA,CAAAynF,CAAA,CAAAE,EAAA,CAAA3nF,UAAA,EAAAmhF,EAAAnhF,UAAA,CACQynF,CAAA,CAAAE,EAAA,CAAA5nF,QAAA,CAAA0nF,CAAA,CAAAE,EAAA,CAAA5nF,QAAA,EAAAohF,EAAAphF,QAAA,EAER0nF,EAAA9uI,IAAA,CAAAwoI,EACK,GAILsG,EAAAt9F,IAAA,UAAA5tC,CAAA,CAAAqxB,CAAA,EACA,GAAArxB,EAAAwjD,QAAA,GAAAnyB,EAAAmyB,QAAA,CAEA,OAAAxjD,EAAAwjD,QAAA,MAEA,GAAAxjD,EAAAyjD,UAAA,GAAApyB,EAAAoyB,UAAA,CAEA,OAAAzjD,EAAAyjD,UAAA,MAGA,IAAAviD,EAAA,CACAmqI,cAAA,WACAC,MAAA,OACAC,YAAA,UACAC,kBAAA,GACAC,QAAA,GACAC,UAAA,OACA,EACK,OAAA1rI,EAAAujD,MAAA,CAAAr9C,QAAA,GAAAylI,aAAA,CAAAt6G,EAAAkyB,MAAA,CAAAr9C,QAAA,QAAAhF,EAAA,GAIL,IAAA0qI,EAAAV,EAAAj6E,SAAA,CAAAjxD,GACKA,EAAAujD,MAAA,CAAAxB,MAAA,CAAAv5C,IAEL,GAAAojI,EAAA,IACA,IAAAC,EAAA,CAAAX,EAAA5E,MAAA,CAAAsF,EAAA,EACAC,CAAAA,EAAAroF,QAAA,IACAqoF,EAAApoF,UAAA,IACMynF,EAAAxiF,OAAA,CAAAmjF,EACN,MACAX,EAAAxiF,OAAA,EACAnF,OAAA/6C,EACAg7C,SAAA,GACOC,WAAA,EACP,GAIA,QAAAp6C,KAAA,KAAAF,UAAA,EACA,IAAAiiI,EAAAF,EAAAj6E,SAAA,CAAAjxD,GACOA,EAAAujD,MAAA,CAAAxB,MAAA,CAAA14C,EAAA5K,SAAA,GAEP,GAAA2sI,EAAA,GACAF,CAAA,CAAAE,EAAA,CAAA5nF,QAAA,GACA0nF,CAAA,CAAAE,EAAA,CAAA5nF,QAAA,IACA58C,QAAAo3D,IAAA,uOAGA,+BAAA30D,EAAA5K,SAAA,CAAAoH,QAAA,MAGA,IAAAs/H,EAAA,EACAC,EAAA,EAAAC,EAAA,EAIAyG,EAAA,GACAC,EAAA,GACAb,EAAAnhI,OAAA,GACAw5C,OAAAA,CAAA,CACAC,SAAAA,CAAA,CACKC,WAAAA,CAAA,CACL,IACAD,GACAsoF,EAAA1vI,IAAA,CAAAmnD,EAAA19C,QAAA,IACAs/H,GAAA,EACA1hF,GACA2hF,CAAAA,GAAA,KAGA2G,EAAA3vI,IAAA,CAAAmnD,EAAA19C,QAAA,IACA49C,GACA4hF,CAAAA,GAAA,GAGA,GACA,IAAAkB,EAAAuF,EAAA94G,MAAA,CAAA+4G,GACAtF,EAAArqF,EAAAr+C,GAAA,CAAAwqD,GAAA,CACA,IACAjqD,KAAAA,CAAA,CACQq9C,UAAAA,CAAA,CACR,CAAA4M,EACA,OACAk7E,eAAA8C,EAAAzpH,OAAA,CAAA6+B,EAAA91C,QAAA,IACAf,SAAcyjD,EAAA3kD,IAAA,CAAW7F,GAAA,CAAA2L,GAAA68H,EAAAzpH,OAAA,CAAApT,EAAA65C,MAAA,CAAA19C,QAAA,KACzBvH,KAAA+yH,KAAA9yH,MAAA,CAAAD,EACK,CACL,GAKA,OAJAmoI,EAAM18H,OAAM,CAAAw+C,GAAA,CACZ87E,GAAA97E,EAAAk7E,cAA+C,KAC1Cl7E,EAAAzjD,QAAA,CAAAiF,OAAA,CAAAykC,GAAA61F,GAAA71F,GAAA,GACL,GACA,IAAAgmE,GAAA,CACA/2F,OAAA,CACA0nH,sBAAAA,EACAC,0BAAAA,EACOC,4BAAAA,CACP,EACAkB,YAAAA,EACA99H,gBAAAA,EACK2zC,aAAAqqF,CACL,GAMAlhI,UAAA,CACA,IAAAtG,EAAA,KAAAgsI,cAAA,GACAa,EAAA7sI,EAAAsnI,WAAA,CAAAroI,KAAA,GAAAe,EAAAwe,MAAA,CAAA0nH,qBAAA,EACA,QAAAh8H,UAAA,CAAArL,MAAA,GAAAguI,EAAAhuI,MAAA,EACA,IAAA0D,EAAA,KAAA2H,UAAA,CAAAyvC,KAAA,EAAAwwB,EAAAnrE,IACO6tI,CAAA,CAAA7tI,EAAA,CAAA8jD,MAAA,CAAAqnB,EAAA3qE,SAAA,GAEP,GAAA+C,EAAA,OAAAvC,CAAA,CACA,OACA,KAAAkK,UAAA,CAAA2iI,EAAA/tI,GAAA,CAAAU,GAAA,EACA4K,UAAA,KACK5K,UAAAA,CACL,IACAQ,CAAA,CAMAuvF,kBAAA,CACA,YAAAjpF,QAAA,GAAAE,SAAA,GAUA,MAAAumI,gBAAAxnI,CAAA,EACA,aAAAA,EAAAynI,gBAAA,MAAAhB,cAAA,KAAA3rI,KAAA,CAaA4sI,WAAA,GAAA/mI,CAAA,EACA,GAAAA,IAAAA,EAAArH,MAAA,CACA,0BAEA,IAAA+nF,EAAA,IAAA3jF,GACA,MAAAiH,UAAA,CAAAhE,EAAA+hB,MAAA,CAAAzoB,GAAA,CACA,IAAAc,EAAAd,EAAAoH,QAAA,SACA,CAAAggF,EAAA3lE,GAAA,CAAA3gB,KAGAsmF,EAAA1jF,GAAA,CAAA5C,GACA,GAEA,GAAAxB,GAAA,CAAAU,GAAA,EACA4K,UAAA,KACK5K,UAAAA,CACL,IAmBA6G,KAAA,GAAAH,CAAA,EACA,GAAAA,IAAAA,EAAArH,MAAA,CACA,0BAIA,IAAA+nF,EAAA,IAAA3jF,IACAiqI,EAAA,GACA,QAAAvjI,KAAAzD,EAAA,CACA,IAAA5F,EAAAqJ,EAAAnK,SAAA,CAAAoH,QAAA,GACAggF,EAAA3lE,GAAA,CAAA3gB,KAGAsmF,EAAA1jF,GAAA,CAAA5C,GACA4sI,EAAA/vI,IAAA,CAAAwM,GAEA,CACA,KAAAO,UAAA,CAAAgjI,EAAApuI,GAAA,CAAA6K,GAAA,EACAS,UAAA,KACK5K,UAAAmK,EAAAnK,SAAA,CACL,GACA,IAAAQ,EAAA,KAAAsG,QAAA,GACA,KAAA6mI,YAAA,CAAAntI,KAAAktI,EAAA,CAYAtjI,YAAA,GAAA1D,CAAA,EACA,GAAAA,IAAAA,EAAArH,MAAA,CACA,0BAIA,IAAA+nF,EAAA,IAAA3jF,IACAiqI,EAAA,GACA,QAAAvjI,KAAAzD,EAAA,CACA,IAAA5F,EAAAqJ,EAAAnK,SAAA,CAAAoH,QAAA,GACAggF,EAAA3lE,GAAA,CAAA3gB,KAGAsmF,EAAA1jF,GAAA,CAAA5C,GACA4sI,EAAA/vI,IAAA,CAAAwM,GAEA,CACA,IAAA3J,EAAA,KAAAsG,QAAA,GACA,KAAA6mI,YAAA,CAAAntI,KAAAktI,EAAA,CAMAC,aAAAntI,CAAA,IAAAkG,CAAA,EACA,IAAAK,EAAAvG,EAAAwG,SAAA,GACAN,EAAA4E,OAAA,CAAAnB,GAAA,CACA,IAAAS,EAAA/D,GAAAE,EAAAoD,EAAAm5H,SAAA,EACK,KAAAsK,aAAA,CAAAzjI,EAAAnK,SAAA,CAAAkd,GAAAtS,GACL,GAWAijI,aAAA/oF,CAAqB,CAAAl6C,CAAA,EACrB,KAAA9D,QAAA,GACA,KAAA8mI,aAAA,CAAA9oF,EAAAl6C,EAAA,CAMAgjI,cAAI9oF,CAAA,CAAAl6C,CAAM,EACVg7H,GAAAh7H,KAAAA,EAAAvL,MAAA,EACA,IAAAG,EAAA,KAAAkL,UAAA,CAAA8nD,SAAA,CAAAs7E,GAAAhpF,EAAAxB,MAAA,CAAAwqF,EAAA9tI,SAAA,GACA,GAAAR,EAAA,EACA,+BAAAslD,EAAA19C,QAAA,MAEA,KAAAsD,UAAA,CAAAlL,EAAA,CAAAoL,SAAA,CAAAqvG,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA5R,EAAA,CAUA4pF,iBAAA9pC,EAAA,IACA,IAAAqjF,EAAA,KAAAC,2BAAA,MAAAj+C,gBAAA,GAAArlC,GACA,OAAAqjF,CAAA,CAMAC,4BAAAxtI,CAAA,CAAAkqD,CAAA,EACA,IAAAsF,EAAA,GACA,QACAplD,UAAAA,CAAA,CACM5K,UAAAA,CAAA,CACN,QAAA0K,UAAA,CACAE,IAAA,GAAAA,EACA8/C,GACA,CAAAsF,EAAAi+E,OAAA,OAAAtwI,IAAA,CAAAqC,GAGAitH,GAAAriH,EAAApK,EAAAR,EAAAwnD,OAAA,KACA,CAAAwI,EAAAk+E,OAAA,OAAAvwI,IAAA,CAAAqC,GAIA,OAAAgwD,EAAAk+E,OAAA,EAAAl+E,EAAAi+E,OAAA,CAAAj+E,EAAA9tD,KAAAA,CAAA,CAUA8E,UAAAK,CAAA,EACA,IACAqjD,qBAAAA,CAAA,CACM8pC,iBAAAA,CAAA,CACN,CAAAtzF,OAAAC,MAAA,EACAupD,qBAAA,GACK8pC,iBAAA,EACL,EAAAntF,GACAN,EAAA,KAAAgpF,gBAAA,GACA,GAAAyE,EAAA,CACA,IAAA25C,EAAA,KAAAH,2BAAA,CAAAjnI,EAAA2jD,GACA,GAAAyjF,EAAA,CACA,IAAA/7E,EAAA,gCAOA,OANA+7E,EAAAD,OAAA,EACA97E,CAAAA,GAAA;gCAAA,EAAA+7E,IAAAA,EAAAD,OAAA,CAAA7uI,MAAA,gBAAA8uI,EAAAD,OAAA,CAAA5uI,GAAA,CAAA4mB,GAAAA,EAAAze,QAAA,IAAA7G,IAAA,gBAEAutI,EAAAF,OAAA,EACA77E,CAAAA,GAAA;gCAAA,EAAA+7E,IAAAA,EAAAF,OAAA,CAAA5uI,MAAA,gBAAA8uI,EAAAF,OAAA,CAAA3uI,GAAA,CAAA4mB,GAAAA,EAAAze,QAAA,IAAA7G,IAAA,gBAEA,MAAAwxD,EAAA,CACA,CACA,OACA,KAAAlrD,UAAA,CAAAH,EAAA,CAMAG,WAAAH,CAAA,EACA,IACM2D,WAAAA,CAAA,CACN,MACA0pF,EAAA,GACAogB,GAAApgB,EAAA1pF,EAAArL,MAAA,EACA,IAAA+uI,EAA4Bh6C,EAAA/0F,MAAA,CAAAqL,GAAAA,EAAYrL,MAAA,CAAA0H,EAAA1H,MAAA,CACpC4H,EAAMgzG,EAAAp7G,MAAA,CAAAknB,KAAA,CAAAqoH,GAaV,OAZIxI,GAAAl7H,EAAWrL,MAAA,MACf46G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA43E,GAAApuE,IAAA,CAAA/e,EAAA,GACAyD,EAAAY,OAAA,GACKV,UAAAA,CAAA,CACL,CAAApL,IAAA,CACQ,OAAAoL,IACAg7H,GAAAh7H,KAAAA,EAAWvL,MAAA,iCACnB46G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA5R,GAAAob,IAAA,CAAA/e,EAAAmtF,EAAA/0F,MAAA,CAAAG,GAAAA,GAEA,GACIuH,EAAAif,IAAA,CAAA/e,EAAMmtF,EAAA/0F,MAAA,CAAAqL,GAAAA,EAAArL,MAAA,EACVumI,GAAA3+H,EAAA5H,MAAA,EAAAgvF,GAAA,0BAAApnF,EAAA5H,MAAA,MAAAgvF,GAAA,GACApnF,CAAA,CAOA,IAAI9B,MAAA,CAEJ,OADAygI,GAAA,SAAAjoF,YAAA,CAAAt+C,MAAA,EACA,KAAAs+C,YAAA,IAAAx4C,IAAA,CAAA7F,GAAA,CAAA+uI,GAAAA,EAAAvpF,MAAA,EAOA,IAAI5H,WAAA,CAEJ,OADA0oF,GAAA,SAAAjoF,YAAA,CAAAt+C,MAAA,EACA,KAAAs+C,YAAA,IAAAT,SAAA,CAOA,IAAIr9C,MAAA,CAEJ,OADA+lI,GAAA,SAAAjoF,YAAA,CAAAt+C,MAAA,EACA,KAAAs+C,YAAA,IAAA99C,IAAA,CAUA,OAAA2c,KAAAgE,CAAA,EAEA,IAAAsqF,EAAA,IAAAtqF,EAAA,CACA4zE,EAAAuxC,GAAA76B,GACApgG,EAAoB,GACpB,QAAAjG,EAAA,EAAAA,EAAA2vF,EAAA3vF,IAAA,CACA,IAAAmG,EAAsBg9H,GAAA98B,EAAY,EAAAsL,IAClC1rG,EAAA/M,IAAA,CAAAi1H,KAAA9yH,MAAA,CAAAm6G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA5R,IACA,CACA,OAAA+/C,GAAA2jF,QAAA,CAAAv4B,GAAAv5F,IAAA,CAAAsuF,GAAApgG,EAAA,CAWA,OAAA4jI,SAAA9tI,CAAA,CAAAkK,EAAA,IACA,IAAAjE,EAAA,IAAAkkD,GA6BA,OA5BAlkD,EAAAuD,eAAA,CAAAxJ,EAAAwJ,eAAA,CACAxJ,EAAAwe,MAAA,CAAA0nH,qBAAA,IACAjgI,CAAAA,EAAAsD,QAAA,CAAAvJ,EAAAsnI,WAAA,KAEAp9H,EAAAY,OAAA,EAAAV,EAAApL,IAAA,CACA,IAAA+uI,EAAA,CACA3jI,UAAAA,GAAAgoH,KAAA9yH,MAAA,CAAAmsI,IAAA,KAAArZ,KAAA17G,MAAA,CAAAtM,EAAA,CACA5K,UAAAQ,EAAAsnI,WAAA,CAAAtoI,EAAA,EAEKiH,EAAAiE,UAAA,CAAA/M,IAAA,CAAA4wI,EACL,GACA/tI,EAAAm9C,YAAA,CAAAryC,OAAA,CAAAw+C,GAAA,CACA,IAAA3kD,EAAA2kD,EAAAzjD,QAAA,CAAA/G,GAAA,CAAAgH,GAAA,CACA,IAAAw+C,EAAAtkD,EAAAsnI,WAAA,CAAAxhI,EAAA,CACA,OACAw+C,OAAAA,EACAC,SAAAt+C,EAAAiE,UAAA,CAAAwhE,IAAA,CAAAmiE,GAAAA,EAAAruI,SAAA,CAAAoH,QAAA,KAAA09C,EAAA19C,QAAA,KAAA5G,EAAA6nI,eAAA,CAAA/hI,GACA0+C,WAAAxkD,EAAA8nI,iBAAA,CAAAhiI,EACO,CACP,GACAG,EAAAk3C,YAAA,CAAAhgD,IAAA,KAAAunD,GAAA,CACA//C,KAAAA,EACA+3C,UAAc18C,EAAAsnI,WAAW,CAAAh+E,EAAAk7E,cAAA,EAClBnlI,KAAA+yH,KAAA17G,MAAA,CAAA4yC,EAAAjqD,IAAA,CACF,GACL,GACA4G,EAAA2lI,QAAA,CAAA5rI,EACAiG,EAAA4lI,KAAA,CAAA5lI,EAAAk/E,MAAA,GACAl/E,CACA,EAGA,MAAAkxG,GACAv3G,YAAAuH,CAAA,EACA,KAAAygI,QAAA,QACA,KAAAzqF,YAAA,QACA,KAAA3zC,eAAA,QACA,KAAAo+H,QAAA,CAAAzgI,EAAAygI,QAAA,CACA,KAAAzqF,YAAA,CAAAh2C,EAAAg2C,YAAA,CACA,KAAA3zC,eAAA,CAAArC,EAAAqC,eAAA,CAEA,OAAAwkI,UAAAhuI,CAAA,CAAAmH,CAAA,EACA,IACAqX,OAAAA,CAAA,CACAgpH,qBAAAA,CAAA,CACMh+H,gBAAAA,CAAA,CACN,CAAAxJ,EACA,CACAkmI,sBAAAA,CAAA,CACAC,0BAAAA,CAAA,CACMC,4BAAAA,CAAA,CACN,CAAA5nH,EACI2pH,EAAMjC,EAAAC,EACVf,GAAA+C,EAAA,+BACI,IAAAD,EAAMloI,EAAA+jI,iBAAA,CAAAllI,MAAA,CAAAqnI,EAAAE,EACVhB,GAAA8C,GAAA,+BACA,IAAAZ,EAAAtnI,EAAA0nI,cAAA,CAAAvgI,GACAygI,EAAAN,EAAA5mH,GAAA,IACA,GAAAknH,KAAAlmI,IAAAkmI,EACA,8EAEA,IAAAzqF,EAAA,GACA,QAAA8wF,KAAAzG,EAAA,CACA,IAAA7iI,EAAA,GACA,QAAA4qC,KAAA0+F,EAAAxJ,iBAAA,MAMAjgF,EALA,IAAAF,EAAAgjF,EAAA5mH,GAAA,CAAA6uB,GACA,GAAA+U,KAAA5iD,IAAA4iD,EACA,wDAAA/U,EAAA,GAEA,IAAAgV,EAAAhV,EAAA22F,EAGU1hF,EADVD,EACUhV,EAAA44F,EACV54F,EAAA+3F,EAAAvD,iBAAA,CAAAllI,MAAA,CACU0wC,EAAA22F,EAAAgC,EAEV34F,EAAA+3F,EAAAvD,iBAAA,CAAAllI,MAAA,CAEAyoI,EAAAtD,sBAAA,CAAAtmF,QAAA,CAAA7+C,MAAA,CAEA8F,EAAAxH,IAAA,EACAmnD,OAAAA,EACAC,SAAAhV,EAAA/wB,EAAA0nH,qBAAA,CACS1hF,WAAAA,CACT,EACA,CACA,IAAA9H,EAAA4qF,EAAA5mH,GAAA,CAAAutH,EAAAzJ,cAAA,EACA,GAAA9nF,KAAAh7C,IAAAg7C,EACA,8DAAAuxF,EAAAzJ,cAAA,IAEArnF,EAAAhgD,IAAA,KAAAunD,GAAA,CACAhI,UAAAA,EACAr9C,KAAAqd,GAAAuxH,EAAA5uI,IAAA,EACOsF,KAAAA,CACP,GACA,CACA,WAAAwyG,GAAA,CACAywB,SAAAA,EACAzqF,aAAAA,EACK3zC,gBAAAA,CACL,EACA,CACA0kI,wBAAA,CACA,OAAA34B,GAAApkF,OAAA,EACAy2G,SAAA,KAAAA,QAAA,CACAp+H,gBAAA,KAAAA,eAAA,CACK2zC,aAAA,KAAAA,YAAA,EAEL,CACAgxF,mBAAA9E,CAAA,EACA,OAAA5zB,GAAAtkF,OAAA,EACAy2G,SAAA,KAAAA,QAAA,CACAp+H,gBAAA,KAAAA,eAAA,CACA2zC,aAAA,KAAAA,YAAA,CACKksF,2BAAAA,CACL,EACA,EAMA,MAAA3xB,GACA,IAAAt3C,SAAA,CACA,YAAApgE,OAAA,CAAAogE,OAAA,CAEAxgE,YAAAI,CAAA,CAAAkK,CAAA,EAGA,GAFA,KAAAA,UAAA,QACA,KAAAlK,OAAA,QACMkK,KAAAxI,IAAAwI,EACNk7H,GAAAl7H,EAAArL,MAAA,GAAAmB,EAAAwe,MAAA,CAAA0nH,qBAAA,gFACM,KAAAh8H,UAAA,CAAAA,MACN,CACA,IAAAkkI,EAAsB,GACtB,QAAAnqI,EAAA,EAAAA,EAAAjE,EAAAwe,MAAA,CAAA0nH,qBAAA,CAAAjiI,IACAmqI,EAAAjxI,IAAA,KAAAgN,WAAAyrG,IAEA,MAAA1rG,UAAA,CAAAkkI,CACA,KACA,CAAApuI,OAAA,CAAAA,CACA,CACAwG,WAAA,CACA,IAAA+jI,EAAA,KAAAvqI,OAAA,CAAAwG,SAAA,GACA6nI,EAAA5vI,EAAA,CACAu1G,GAAAq6B,EAA8B,IAAqB,CAAAnkI,UAAiB,CAAArL,MAAA,EACpE,IAAAyvI,EAAAl4H,GAAA7W,MAAA,EAAA6W,GAAAyF,IAAA,CAAAwyH,EAAAxvI,MAAA,4BAAAuX,GAAAqU,GAAA,CAAArgB,KAAA,KAAAF,UAAA,CAAArL,MAAA,eAAAuX,GAAAyF,IAAA,CAAA0uH,EAAA1rI,MAAA,wBACA0vI,EAAA,IAAApkI,WAAA,MACAqkI,EAAAF,EAAAhvI,MAAA,EACA+uI,wBAAA,IAAAlkI,WAAAkkI,GACAnkI,WAAA,KAAAA,UAAA,CACKqgI,kBAAAA,CACL,EAAAgE,GACA,OAAAA,EAAAtvI,KAAA,GAAAuvI,EACA,CACA,OAAAzL,YAAAwL,CAAA,EACA,IAAAjkC,EAAA,IAAAikC,EAAA,CACArkI,EAAA,GACAukI,EAAoBtJ,GAAsB76B,GAC1C,QAAArmG,EAAA,EAAAA,EAAAwqI,EAAAxqI,IACAiG,EAAA/M,IAAA,KAAAgN,WAAAi9H,GAAA98B,EAAA,EAAAsL,MAEA,IAAA51G,EAAAy3G,GAAAsrB,WAAA,KAAA54H,WAAAmgG,IACA,WAAAoN,GAAA13G,EAAAkK,EACA,CACA7D,KAAAH,CAAA,EACA,IAAAwoI,EAAA,KAAA1uI,OAAA,CAAAwG,SAAA,GACAmoI,EAAA,KAAA3uI,OAAA,CAAA+jI,iBAAA,CAAA9kI,KAAA,QAAAe,OAAA,CAAAwe,MAAA,CAAA0nH,qBAAA,EACA,QAAAv8H,KAAAzD,EAAA,CACM,IAAA0oI,EAAAD,EAAM38E,SAAA,CAAA1N,GAAAA,EAAAxB,MAAA,CAAAn5C,EAAAnK,SAAsD,GAClE4lI,GAAAwJ,GAAA,qCAAAjlI,EAAAnK,SAAA,CAAAyH,QAAA,MACA,KAAAiD,UAAA,CAAA0kI,EAAA,CAAAvoI,GAAAqoI,EAAA/kI,EAAAm5H,SAAA,CACA,CACA,CACAuK,aAAI7tI,CAAA,CAAA4K,CAAM,EACVg7H,GAAAh7H,KAAAA,EAAA2V,UAAA,oCACA,IAAA4uH,EAAA,KAAA3uI,OAAA,CAAA+jI,iBAAA,CAAA9kI,KAAA,QAAAe,OAAA,CAAAwe,MAAA,CAAA0nH,qBAAA,EACI0I,EAAAD,EAAM38E,SAAA,CAAA1N,GAAAA,EAAAxB,MAA2C,CAAAtjD,IACrD4lI,GAAAwJ,GAAA,8BAAApvI,EAAAyH,QAAA,iDACA,KAAAiD,UAAA,CAAA0kI,EAAA,CAAAxkI,CACA,EAQA,IAAAykI,GAAA,IAKAC,GAAA,GAKAC,GAAAF,GAAAC,GAKAE,GAAA,IAAAD,GAGA7xD,GAAA,IAAAzgE,GAAA,+CACAw5F,GAAA,IAAAx5F,GAAA,+CACAy5F,GAAA,IAAAz5F,GAAA,+CACA05F,GAAA,IAAA15F,GAAA,+CACAklD,GAAA,IAAAllD,GAAA,+CACA25F,GAAA,IAAA35F,GAAA,+CACA45F,GAAA,IAAA55F,GAAA,+CACA65F,GAAA,IAAA75F,GAAA,+CAAA85F,GAAA,IAAA95F,GAAA,8CAGA,OAAA7U,WAAAyD,MACAzL,YAAA,CACA2gC,OAAAA,CAAA,CACAn2B,UAAAA,CAAA,CACA6kI,mBAAAA,CAAA,CACGznI,KAAAA,CAAA,CACH,MAGAxH,EAFA,IAAAkvI,EAAA1nI,EAAA;AAAA,EAAApG,KAAAC,SAAA,CAAAmG,EAAAvI,KAAA,qBACAkwI,EAAA,kFAEA,OAAA5uG,GACA,WACAvgC,EAAA,eAAAoK,EAAA;AAAA,EAAA6kI,EAAA,IAAAC,EAAAC,EACA,UACA,WACAnvI,EAAA;SAAA,EAAAivI,EAAA;AAAA,EAAAC,EAAAC,EACA,kBAGA1xI,EAAAuC,EAAA,mBAAAvC,EAAA8iC,EAAA,GAGA,MAAAvgC,GACA,KAAAoK,SAAA,QACA,KAAA6kI,kBAAA,QACA,KAAA94C,eAAA,QACA,KAAA/rF,SAAA,CAAAA,EACA,KAAA6kI,kBAAA,CAAAA,EACA,KAAA94C,eAAA,CAAA3uF,GAAA9F,KAAAA,CACA,CACA,IAAA0tI,kBAAA,CACA,OACApvI,QAAA,KAAAivI,kBAAA,CACAznI,KAAA/I,MAAA6D,OAAA,MAAA6zF,eAAA,OAAAA,eAAA,CAAAz0F,KAAAA,CAAA,CACA,CAIA,IAAA8F,MAAA,CACA,IAAA6nI,EAAA,KAAAl5C,eAAA,CACA,GAAAk5C,IAAA,EAAAA,GAAA,iBAAAA,IAAA,UAAAA,CAAA,EAGA,OAAAA,CADA,CAGA,MAAAC,QAAA/pI,CAAA,EAcA,OAbA9G,MAAA6D,OAAA,MAAA6zF,eAAA,GACA,MAAAA,eAAA,KAAAt3E,QAAA,CAAAI,EAAAH,IAAA,CACAvZ,EAAAgF,cAAA,MAAAH,SAAA,EAAAwW,IAAA,CAAAzhB,GAAA,CACA,GAAAA,GAAAA,EAAAsL,IAAA,EAAAtL,EAAAsL,IAAA,CAAAC,WAAA,EACA,IAAAlD,EAAArI,EAAAsL,IAAA,CAAAC,WAAA,CACA,KAAAyrF,eAAA,CAAA3uF,EACYyX,EAAAzX,EACZ,MACAsX,EAAA,gCACS,GACFw/C,KAAA,CAAAx/C,EACP,IAEA,WAAAq3E,eAAA,CACA,CAKA,IAAAugB,GAAA,CACA64B,uCAAA,OACAC,yDAAA,OACAC,iEAAA,OACAC,0CAAA,OACAC,qCAAA,OACAC,kEAAA,OACAC,mCAAA,OACAC,kCAAA,OACAC,qDAAA,OACAC,wDAAA,OACAC,wDAAA,OACAC,oBAAA,OACAC,yDAAA,OACAC,qDAAA,OACAC,sDAAA,OACAC,mDAAA,MACA,CACA,OAAA75B,WAAAprG,MACAzL,YAAA,CACAsI,KAAAA,CAAA,CACAlI,QAAAA,CAAA,CACGX,KAAAA,CAAA,CACH,CAAAkxI,CAAA,EACA,MAAAA,IAAA,EAAAA,EAAA,GAAAA,EAAA,IAAAvwI,EAAA,EAAAA,CAAA,EACA,KAAAkI,IAAA,QACA,KAAA7I,IAAA,QACA,KAAA6I,IAAA,CAAAA,EACA,KAAA7I,IAAA,CAAAA,EACA,KAAAuB,IAAA,qBACA,EAcA,eAAA8vG,GAAAnrG,CAAA,CAAAU,CAAA,CAAAC,CAAA,CAAAjE,CAAA,MAQA0J,EAPA,IAAAH,EAAAvJ,GAAA,CACAwJ,cAAAxJ,EAAAwJ,aAAA,CACA1C,oBAAA9G,EAAA8G,mBAAA,EAAA9G,EAAAyD,UAAA,CACA8qI,WAAAvuI,EAAAuuI,UAAA,CACA1E,eAAA7pI,EAAA6pI,cAAA,EAEA1hI,EAAA,MAAA7E,EAAA6lD,eAAA,CAAAnlD,EAAAC,EAAAsF,GAEA,GAAAvF,IAAA,EAAAA,EAAAuD,eAAA,EAAAvD,IAAA,EAAAA,EAAA8kD,oBAAA,CACAp/C,EAAA,OAAApG,EAAAqG,kBAAA,EACA6kI,YAAAxuI,GAAAwuI,YACArmI,UAAAA,EACAV,UAAAzD,EAAAuD,eAAA,CACKuhD,qBAAA9kD,EAAA8kD,oBAAA,EACD9oD,GAAAA,EAAAyD,UAAA,GAAArF,KAAA,MACJ,GAAA4F,IAAA,EAAAA,EAAA0lI,mBAAA,EAAA1lI,IAAA,EAAAA,EAAAylI,SAAA,EACA,IACMK,iBAAAA,CAAA,CACN,CAAA9lI,EAAAylI,SAAA,CACAgF,EAAA3E,EAAApnI,IAAA,IAAA2/C,MAAA,CACA34C,EAAA,OAAApG,EAAAqG,kBAAA,EACA6kI,YAAAxuI,GAAAwuI,YACA3E,eAAA7lI,EAAA0lI,mBAAA,CACA+E,mBAAAA,EACAC,WAAA1qI,EAAAylI,SAAA,CAAA5/G,KAAA,CACK1hB,UAAAA,CACD,EAAAnI,GAAAA,EAAAyD,UAAA,GAAArF,KAAA,MAEJ4B,GAAAwuI,aAAA,MACA9oI,QAAAo3D,IAAA,0PAEApzD,EAAA,OAAApG,EAAAqG,kBAAA,CAAAxB,EAAAnI,GAAAA,EAAAyD,UAAA,GAAArF,KAAA,CAEA,GAAAsL,EAAAtD,GAAA,EACA,GAAA+B,IAAA,EAAAA,EACA,UAAAxC,GAAA,CACA24B,OAAA,OACAn2B,UAAAA,EACO6kI,mBAAA,YAAA7tI,KAAAC,SAAA,CAAAsK,GAAA,IACP,OAEA,qBAAAvB,EAAA,WAAAhJ,KAAAC,SAAA,CAAAsK,GAAA,IACA,OACAvB,CAAA,CAIA,SAAAu1E,GAAAqB,CAAA,EACA,WAAAniE,QAAAI,GAAAgiE,WAAAhiE,EAAA+hE,GAAA,CAWA,SAAAtL,GAAAn1E,CAAA,CAAAuY,CAAA,EACA,IAAA83H,EAAerwI,EAAAkX,MAAA,CAAApB,IAAA,IAAA9V,EAAYkX,MAAA,CAAApB,IAAA,CAAA4uH,GAAA1kI,EAAAuY,EAAA,CAC3BzZ,EAAAo6G,EAAAp7G,MAAA,CAAAknB,KAAA,CAAAqrH,GACAC,EAAAnwI,OAAAC,MAAA,EACG2oD,YAAA/oD,EAAAvB,KAAA,EACH8Z,GAEA,OADAvY,EAAAkX,MAAA,CAAAnY,MAAA,CAAAuxI,EAAAxxI,GACAA,CAAA,CAOA,SAAAyxI,GAAAvwI,CAAA,CAAAyf,CAAA,EACA,IAAA3gB,EACA,IACIA,EAAAkB,EAAAkX,MAAA,CAAAf,MAAA,CAAAsJ,EACJ,OAAA3X,EAAA,CACA,oCAAAA,EAAA,CAEA,GAAAhJ,EAAAiqD,WAAA,GAAA/oD,EAAAvB,KAAA,CACA,+DAAAK,EAAAiqD,WAAA,OAAA/oD,EAAAvB,KAAA,IAEA,OAAAK,CAAA,CAO6C,IAAA41G,GAAA7+F,GAAAuF,IAAA,yBAc7Co1H,GAAA36H,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,YAAAtF,GAAAsF,GAAA,UAAAlc,GAAA,oBAAAA,GAAA,SAAA4W,GAAA7W,MAAA,EAAA01G,GAAA,oBAAAr6C,GAAAm2E,GAAA16H,IAAA,OAUAq/F,GAIA91G,YAAAuH,CAAA,EACA,KAAA6pI,gBAAA,QACA,KAAAllH,KAAA,QACA,KAAAmlH,aAAA,QACA,KAAAD,gBAAA,CAAA7pI,EAAA6pI,gBAAA,CACA,KAAAllH,KAAA,CAAA3kB,EAAA2kB,KAAA,CACA,KAAAmlH,aAAA,CAAA9pI,EAAA8pI,aAAA,CASA,OAAAC,gBAAAlxH,CAAA,EACA,IAAAmxH,EAAAJ,GAAAr6H,MAAA,CAAAgG,GAAAsD,GAAA,GACA,WAAA01F,GAAA,CACAs7B,iBAAA,IAAAv0H,GAAA00H,EAAAH,gBAAA,EACAllH,MAAA,IAAArP,GAAA00H,EAAArlH,KAAA,EAAAllB,QAAA,GACKqqI,cAAAE,EAAAF,aAAA,EAEL,EAGA,IAAAG,GAAA35H,GAAA,CACA,IAAAf,EAAAe,EAAAf,MAAA,CAAA6D,IAAA,CAAA9C,GACAnY,EAAAmY,EAAAnY,MAAA,CAAAib,IAAA,CAAA9C,GACA,OACAf,OAAAA,EACApX,OAAAA,CACA,CACA,EACA+xI,GAAAxyI,GAAiByX,GAAI,CACrB,IAAAmB,EAAA,GAAArB,GAAAyF,IAAA,EAAAhd,EAAAyX,GACA,CACAhX,OAAAA,CAAA,CACIoX,OAAAA,CAAA,CACJ,CAAA06H,GAAA35H,GACA65H,EAAA75H,EASA,OARA65H,EAAA56H,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAWH,EAAAsJ,EAAApJ,GACX,SAAA27G,GAAAgf,UAAA,EAAA93B,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAnF,GACA,EACAy6H,EAAAhyI,MAAgB,EAAA+xI,EAAArxH,EAAUpJ,IAAA,CAC1B,IAAAC,EAAA,GAAA07G,GAAAif,UAAA,EAAAH,EAAAxyI,GACA,OAAAS,EAAAuX,EAAAmJ,EAAApJ,EACA,EACA06H,CACA,EAASG,GAAAJ,GAAA,EAkET,OAAAt6B,GAGAn3G,aAAA,EAMA,OAAA8xI,sBAAApoF,CAAA,MAIA/oD,EAHA,KAAAoxI,cAAA,CAAAroF,EAAkC5M,SAAgB,EAClD,IAAAk1F,EAAAx7H,GAAAsF,GAAA,gBACAm2H,EAAAD,EAAAl7H,MAAA,CAAA4yC,EAAAjqD,IAAA,EAEA,QAAAyyI,EAAAr6H,EAAA,GAAA/W,OAAAkC,OAAA,CAAAozG,IACA,GAAAv+F,EAAAzY,KAAA,EAAA6yI,EAAA,CACAtxI,EAAAuxI,EACA,MACA,GAEA,CAAAvxI,EACA,mEAEA,OAAAA,CAAA,CAMA,OAAAwxI,oBAAAzoF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACA6D,SAAAA,CAAA,CACAg0C,MAAAA,CAAA,CACME,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAAi8B,MAAA,CAAA3oF,EAAAjqD,IAAA,EACA,OACAi9C,WAAAgN,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA/H,iBAAA+M,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,EACAg0C,MAAAA,EACAE,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAAw1F,eAAA5oF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM6D,SAAAA,CAAA,CACN,CAAAsoI,GAAA96B,GAAA1vC,QAAA,CAAAhd,EAAAjqD,IAAA,EACA,OACAi9C,WAAAgN,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA2D,SAAAqB,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,CACA,EAMA,OAAA2pI,uBAAA7oF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACA6D,SAAAA,CAAA,CACAkxD,KAAAA,CAAA,CACMhd,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAAo8B,gBAAA,CAAA9oF,EAAAjqD,IAAA,EACA,OACAi9C,WAAAgN,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA+tF,WAAA/oF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA2D,SAAAqB,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,EACAkxD,KAAAA,EACAhd,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAA41F,eAAAhpF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM63C,MAAAA,CAAA,CACN,CAAAs0F,GAAA96B,GAAAu8B,QAAA,CAAAjpF,EAAAjqD,IAAA,EACA,OACAmzI,cAAAlpF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA9H,MAAAA,CACA,EAMA,OAAAi2F,uBAAAnpF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAspC,KAAAA,CAAA,CACAyrB,KAAAA,CAAA,CACAld,MAAAA,CAAA,CACME,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAA08B,gBAAA,CAAAppF,EAAAjqD,IAAA,EACA,OACAmzI,cAAAlpF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA+tF,WAAA,IAAA51H,GAAAwxB,GACAyrB,KAAAA,EACAld,MAAAA,EACAE,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAAi2F,aAAArpF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM+3C,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAA48B,MAAA,CAAAtpF,EAAAjqD,IAAA,EACA,OACAmzI,cAAAlpF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA5H,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAAm2F,qBAAAvpF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAspC,KAAAA,CAAA,CACAyrB,KAAAA,CAAA,CACMhd,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAA88B,cAAA,CAAAxpF,EAAAjqD,IAAA,EACA,OACAmzI,cAAAlpF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA+tF,WAAA,IAAA51H,GAAAwxB,GACAyrB,KAAAA,EACAhd,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAAq2F,qBAAAzpF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAspC,KAAAA,CAAA,CACAyrB,KAAAA,CAAA,CACAlxD,SAAAA,CAAA,CACAg0C,MAAAA,CAAA,CACME,UAAAA,CAAA,CACN,CAAAo0F,GAAA96B,GAAAg9B,cAAA,CAAA1pF,EAAAjqD,IAAA,EACA,OACAi9C,WAAAgN,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA/H,iBAAA+M,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA+tF,WAAA,IAAA51H,GAAAwxB,GACAyrB,KAAAA,EACAlxD,SAAAA,EACAg0C,MAAAA,EACAE,UAAA,IAAAjgC,GAAAigC,EACA,EAMA,OAAAu2F,sBAAA3pF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACMk1D,WAAAA,CAAA,CACN,CAAAi3E,GAAA96B,GAAAk9B,sBAAA,CAAA5pF,EAAAjqD,IAAA,EACA,OACA8zI,YAAA7pF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA,IAAAv0H,GAAAo9C,EACA,EAMA,OAAAu5E,mBAAA9pF,CAAA,EAIA,OAHA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACAmsI,GAAA96B,GAAAq9B,mBAAA,CAAA/pF,EAAAjqD,IAAA,EACA,CACA8zI,YAAA7pF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAgvF,oBAAAhqF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM6D,SAAAA,CAAA,CACN,CAAAsoI,GAAA96B,GAAAu9B,oBAAA,CAAAjqF,EAAAjqD,IAAA,EACA,OACA8zI,YAAA7pF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA2D,SAAAqB,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,CACA,EAMA,OAAAgrI,qBAAAlqF,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACMk1D,WAAAA,CAAA,CACN,CAAAi3E,GAAA96B,GAAAy9B,qBAAA,CAAAnqF,EAAAjqD,IAAA,EACA,OACA8zI,YAAA7pF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAovF,oBAAA,IAAAj3H,GAAAo9C,EACA,EAMA,OAAA83E,eAAAj1F,CAAA,EACA,IAAAA,EAAAoG,MAAA,CAAA1G,GAAAM,SAA4C,EAC5C,mEAOA,OAAAs1F,eAAArtI,CAAA,CAAA66G,CAAA,EACA,GAAA76G,EAAA9F,MAAA,CAAA2gH,EACA,0CAAA76G,EAAA9F,MAAA,4BAAA2gH,EAAA,GAEA,CAWA,IAAAxJ,GAAAt1G,OAAAquD,MAAA,EACAkjF,OAAA,CACAjzI,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,aAAAxF,GAAAwF,IAAA,UAAApc,GAAA,cACH,EACAozI,OAAA,CACA5zI,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,cACH,EACA8mE,SAAA,CACAtnE,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAA+1H,GAAA,aACH,EACAuB,eAAA,CACAh0I,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,QAAAklI,GAAA,QAAAtuH,GAAAwF,IAAA,aAAAxF,GAAAwF,IAAA,UAAApc,GAAA,cACH,EACA6zI,oBAAA,CACAr0I,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACA63H,qBAAA,CACAv0I,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,cACH,EACAs3H,uBAAA,CACAl0I,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,eACH,EACAi0I,sBAAA,CACAz0I,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,eACH,EACA+yI,SAAA,CACAvzI,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,WACH,EACA82H,iBAAA,CACA1zI,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,QAAAklI,GAAA,QAAAtuH,GAAAwF,IAAA,UAAApc,GAAA,cACH,EACAszI,eAAA,CACA9zI,MAAA,GACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,QAAAklI,GAAA,QAAAllI,GAAA,cACH,EACA4yI,iBAAA,CACApzI,MAAA,GACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAA+1H,GAAA,YAAA/M,GAAA,QAAAllI,GAAA,cACH,EACAm0I,oBAAA,CACA30I,MAAA,GACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACC,GAMD,OAAA0gC,GAGAx8C,aAAA,EAUA,OAAAy8C,cAAAtf,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAi8B,MAAA,CACA5yI,EAAAq2E,GAAAn1E,EAAA,CACAiI,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAAzf,EAAAyf,KAAA,CACKE,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACL,GACA,WAAAgoC,GAAA,CACA//C,KAAA,EACA2/C,OAAAvnB,EAAAuf,UAAA,CACAiI,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAwf,gBAAA,CACAgI,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAA2oD,SAAAjrB,CAAA,EACA,IAAA19B,EACAsF,EACA,kBAAAo4B,EAAA,CACA,IAAAx8B,EAAAy1G,GAAAo8B,gBAAA,CACA/yI,EAAAq2E,GAAAn1E,EAAA,CACAiI,SAAA0/C,OAAAnrB,EAAAv0B,QAAA,EACAkxD,KAAA38B,EAAA28B,IAAA,CACOhd,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACP,GACA/X,EAAA,EACA2/C,OAAAvnB,EAAAuf,UAAA,CACAiI,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAs1G,UAAA,CACA9tF,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAkrB,QAAA,CACA1D,SAAA,GACOC,WAAA,EACD,OACN,CACA,IAAAjkD,EAAAy1G,GAAA1vC,QAAA,CACAjnE,EAAAq2E,GAAAn1E,EAAA,CACOiI,SAAA0/C,OAAAnrB,EAAAv0B,QAAA,CACP,GACA7D,EAAA,EACA2/C,OAAAvnB,EAAAuf,UAAA,CACAiI,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAkrB,QAAA,CACA1D,SAAA,GACOC,WAAA,EACP,GACA,OACA,IAAAE,GAAA,CACA//C,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAsB,OAAAo8B,CAAA,EACA,IAAA19B,EACAsF,EACA,kBAAAo4B,EAAA,CACA,IAAAx8B,EAAAy1G,GAAA88B,cAAA,CACAzzI,EAAAq2E,GAAAn1E,EAAA,CACA0tC,KAAAvxB,GAAAqgB,EAAAs1G,UAAA,CAAA31H,QAAA,IACAg9C,KAAA38B,EAAA28B,IAAA,CACOhd,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACP,GACA/X,EAAA,EACA2/C,OAAAvnB,EAAAy1G,aAAA,CACAjuF,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAs1G,UAAA,CACA9tF,SAAA,GACOC,WAAA,EACD,OACN,CACA,IAAAjkD,EAAAy1G,GAAA48B,MAAA,CACAvzI,EAAAq2E,GAAAn1E,EAAA,CACOm8C,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACP,GACA/X,EAAA,EACA2/C,OAAAvnB,EAAAy1G,aAAA,CACAjuF,SAAA,GACOC,WAAA,EACP,GACA,OACA,IAAAE,GAAA,CACA//C,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAOA,OAAAs6D,sBAAA58B,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAg9B,cAAA,CACA3zI,EAAAq2E,GAAAn1E,EAAA,CACA0tC,KAAAvxB,GAAAqgB,EAAAs1G,UAAA,CAAA31H,QAAA,IACAg9C,KAAA38B,EAAA28B,IAAA,CACAlxD,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAAzf,EAAAyf,KAAA,CACKE,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACL,GACA/X,EAAA,EACA2/C,OAAAvnB,EAAAuf,UAAA,CACAiI,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAwf,gBAAA,CACAgI,SAAA,GACKC,WAAA,EACL,GAQA,OAPAznB,EAAAs1G,UAAA,EAAAt1G,EAAAuf,UAAA,EACA33C,EAAAxH,IAAA,EACAmnD,OAAAvnB,EAAAs1G,UAAA,CACA9tF,SAAA,GACOC,WAAA,EACP,GAEA,IAAAE,GAAA,CACA//C,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAu0I,mBAAA72G,CAAA,EACA,IAAA92B,EAAA,IAAAkkD,EACA,gBAAAptB,GAAA,SAAAA,EACA92B,EAAA/C,GAAA,CAAAk5C,GAAAud,qBAAA,EACArd,WAAAvf,EAAAuf,UAAA,CACAC,iBAAAxf,EAAAo2G,WAAA,CACAd,WAAAt1G,EAAAs1G,UAAA,CACA34E,KAAA38B,EAAA28B,IAAA,CACAlxD,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAAoe,GACOle,UAAA,KAAAA,SAAA,IAGPz2C,EAAA/C,GAAA,CAAAk5C,GAAAC,aAAA,EACAC,WAAAvf,EAAAuf,UAAA,CACAC,iBAAAxf,EAAAo2G,WAAA,CACA3qI,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAAoe,GACOle,UAAA,KAAAA,SAAA,IAGP,IAAAm3F,EAAA,CACAV,YAAAp2G,EAAAo2G,WAAA,CACAnC,iBAAAj0G,EAAAi0G,gBAAA,EAGA,OADA/qI,EAAA/C,GAAA,MAAA4wI,eAAA,CAAAD,IACA5tI,CAAA,CAMA,OAAA6tI,gBAAA/2G,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAk9B,sBAAA,CACA7zI,EAAAq2E,GAAAn1E,EAAA,CACKs5D,WAAAn9C,GAAAqgB,EAAAi0G,gBAAA,CAAAt0H,QAAA,GACL,GACA+nC,EAAA,CACA9/C,KAAA,EACA2/C,OAAAvnB,EAAAo2G,WAAA,CACA5uF,SAAA,GACOC,WAAA,EACP,GACAF,OAAA6xD,GACA5xD,SAAA,GACOC,WAAA,EACP,GACAF,OAAAqd,GACApd,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACAr9C,KAAAA,CACA,EACA,WAAAqlD,GAAAD,EAAA,CAMA,OAAAsvF,aAAAh3G,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAq9B,mBAAA,CACAh0I,EAAAq2E,GAAAn1E,GACAkkD,EAAA,CACA9/C,KAAA,EACA2/C,OAAAvnB,EAAAo2G,WAAA,CACA5uF,SAAA,GACOC,WAAA,EACP,GACAF,OAAA6xD,GACA5xD,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAi0G,gBAAA,CACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACAr9C,KAAAA,CACA,EACA,WAAAqlD,GAAAD,EAAA,CAMA,OAAAuvF,cAAAj3G,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAu9B,oBAAA,CACAl0I,EAAAq2E,GAAAn1E,EAAA,CACKiI,SAAAu0B,EAAAv0B,QAAA,GAEL,WAAAk8C,GAAA,CACA//C,KAAA,EACA2/C,OAAAvnB,EAAAo2G,WAAA,CACA5uF,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAkrB,QAAA,CACA1D,SAAA,GACOC,WAAA,EACP,GACAF,OAAA6xD,GACA5xD,SAAA,GACOC,WAAA,EACP,GACAF,OAAAqd,GACApd,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAi0G,gBAAA,CACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAOA,OAAA40I,eAAAl3G,CAAA,EACA,IAAAx8B,EAAAy1G,GAAAy9B,qBAAA,CACAp0I,EAAAq2E,GAAAn1E,EAAA,CACKs5D,WAAAn9C,GAAAqgB,EAAA22G,mBAAA,CAAAh3H,QAAA,GACL,GACA,WAAAgoC,GAAA,CACA//C,KAAA,EACA2/C,OAAAvnB,EAAAo2G,WAAA,CACA5uF,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAi0G,gBAAA,CACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAA66D,SAAAn9B,CAAA,EACA,IAAA19B,EACAsF,EACA,kBAAAo4B,EAAA,CACA,IAAAx8B,EAAAy1G,GAAA08B,gBAAA,CACArzI,EAAAq2E,GAAAn1E,EAAA,CACA0tC,KAAAvxB,GAAAqgB,EAAAs1G,UAAA,CAAA31H,QAAA,IACAg9C,KAAA38B,EAAA28B,IAAA,CACAld,MAAAzf,EAAAyf,KAAA,CACOE,UAAAhgC,GAAAqgB,EAAA2f,SAAA,CAAAhgC,QAAA,GACP,GACA/X,EAAA,EACA2/C,OAAAvnB,EAAAy1G,aAAA,CACAjuF,SAAA,GACOC,WAAA,EACP,GACAF,OAAAvnB,EAAAs1G,UAAA,CACA9tF,SAAA,GACOC,WAAA,EACD,OACN,CACA,IAAAjkD,EAAAy1G,GAAAu8B,QAAA,CACAlzI,EAAAq2E,GAAAn1E,EAAA,CACOi8C,MAAAzf,EAAAyf,KAAA,GAEP73C,EAAA,EACA2/C,OAAAvnB,EAAAy1G,aAAA,CACAjuF,SAAA,GACOC,WAAA,EACP,GACA,OACA,IAAAE,GAAA,CACA//C,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,CAAA+8C,GAAAM,SAAA,KAAAjgC,GAAA,oCAOA,IAAAy3H,GAAArmD,GAAA,GAMA,OAAAunB,GAGAx1G,aAAA,EAaA,OAAAu0I,oBAAAxL,CAAA,EACA,SAEAhqI,CAAAA,KAAAC,IAAA,CAAA+pI,EAAAvzB,GAAAg/B,SAAA,IAEA,EACA,CAaA,aAAA9uD,KAAA//E,CAAA,CAAAwgB,CAAA,CAAAosC,CAAA,CAAAzV,CAAA,CAAAr9C,CAAA,EACA,KAAAoyG,EAAA,MAAAlsG,EAAA05D,iCAAA,CAAA5/D,EAAAR,MAAA,EAIAw1I,EAAA,MAAA9uI,EAAA0/C,cAAA,CAAAkN,EAAA3yD,SAAA,cACAyG,EAAA,KACA,GAAAouI,IAAA,GAAAA,EAAA,CACA,GAAAA,EAAA/rI,UAAA,CAEA,OADAX,QAAA9D,KAAA,uDACA,EACA,CACAwwI,EAAAh1I,IAAA,CAAAR,MAAA,GAAAQ,EAAAR,MAAA,EAEAoH,CADAA,EAAAA,GAAA,IAAAkkD,EAAA,EACAjnD,GAAA,CAAAk5C,GAAA8d,QAAA,EACAs4E,cAAArgF,EAAA3yD,SAAA,CACWg9C,MAAAn9C,EAAAR,MAAA,IAGXw1I,EAAA9rI,KAAA,CAAAu6C,MAAA,CAAApG,IAEAz2C,CADAA,EAAAA,GAAA,IAAAkkD,EAAA,EACAjnD,GAAA,CAAAk5C,GAAAz7C,MAAA,EACA6xI,cAAArgF,EAAA3yD,SAAA,CACWk9C,UAAAA,CACX,IAEA23F,EAAA7rI,QAAA,CAAAipG,GAEAxrG,CADAA,EAAAA,GAAA,IAAAkkD,EAAA,EACAjnD,GAAA,CAAAk5C,GAAA4L,QAAA,EACA1L,WAAAv2B,EAAAvmB,SAAA,CACAyoD,SAAAkK,EAAA3yD,SAAA,CACWgJ,SAAAipG,EAAA4iC,EAAA7rI,QAAA,GAGX,MACAvC,EAAA,IAAAkkD,KAAAjnD,GAAA,CAAAk5C,GAAAC,aAAA,EACAC,WAAAv2B,EAAAvmB,SAAA,CACA+8C,iBAAA4V,EAAA3yD,SAAA,CACAgJ,SAAAipG,EAAA,EAAAA,EAAA,EACAj1D,MAAAn9C,EAAAR,MAAA,CACS69C,UAAAA,CACT,IAKA,OAAAz2C,GACA,MAAAyqG,GAAAnrG,EAAAU,EAAA,CAAA8f,EAAAosC,EAAA,EACSzsD,WAAA,WACT,EAEA,CACA,IAAAwsG,EAAA97F,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAsF,GAAA,WAAAtF,GAAAsF,GAAA,gBAAAtF,GAAAsF,GAAA,uBAAAtF,GAAAqU,GAAA,CAAArU,GAAAqF,EAAA,SAAArF,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,kBACA04H,EAAAh/B,GAAAg/B,SAAA,CACAx9H,EAAA,EACArY,EAAAc,EACAyrD,EAAA,GACA,KAAAvsD,EAAAM,MAAA,KACA,IAAAmjB,EAAmBzjB,EAAAU,KAAA,GAAAm1I,GACnB/0I,EAAAo6G,EAAAp7G,MAAA,CAAAknB,KAAA,CAAA6uH,EAAA,IACAliC,EAAA5yG,MAAA,EACAgqD,YAAA,EAEA1yC,OAAAA,EACAoL,MAAAA,EACAsyH,YAAA,EACOC,mBAAA,CACP,EAAAl1I,GACA,IAAA4G,EAAA,IAAAkkD,KAAAjnD,GAAA,EACAyB,KAAA,EACA2/C,OAAA6N,EAAA3yD,SAAA,CACA+kD,SAAA,GACSC,WAAA,EACT,GACA9H,UAAAA,EACOr9C,KAAAA,CACP,GAMA,GALAyrD,EAAA3tD,IAAA,CAAAuzG,GAAAnrG,EAAAU,EAAA,CAAA8f,EAAAosC,EAAA,EACOzsD,WAAA,eAIPH,EAAAivI,YAAA,CAAAniF,QAAA,gBACA,IAAAoiF,EAAA,CACA,OAAA90D,GAAA,IAAA80D,EACA,IACAL,EACA71I,EAAAA,EAAAU,KAAA,CAAAm1I,EACA,OAAAv1H,QAAAqkC,GAAA,CAAA4H,EAIA,EACA,IAAAonD,EAAmB97F,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,CAAY,iBAC/Brc,EAAAo6G,EAAAp7G,MAAA,CAAAknB,KAAA,CAAA2sF,EAAA77F,IAAA,EACA67F,EAAA5yG,MAAA,EACOgqD,YAAA,CACP,EAAAjqD,GACA,IAAA4G,EAAA,IAAAkkD,KAAAjnD,GAAA,EACAyB,KAAA,EACA2/C,OAAA6N,EAAA3yD,SAAA,CACA+kD,SAAA,GACSC,WAAA,EACT,GACAF,OAAAqd,GACApd,SAAA,GACSC,WAAA,EACT,GACA9H,UAAAA,EACOr9C,KAAAA,CACP,GACAq1I,EAAA,YACAC,EAAA,MAAApvI,EAAA6lD,eAAA,CAAAnlD,EAAA,CAAA8f,EAAAosC,EAAA,EACOppD,oBAAA2rI,CACP,GACA,CACA7yI,QAAAA,CAAA,CACQxB,MAAAA,CAAA,CACR,OAAAkF,EAAAqG,kBAAA,EACAxB,UAAAuqI,EACA5pF,qBAAA9kD,EAAA8kD,oBAAA,CACOrhD,UAAAzD,EAAAuD,eAAA,EACPkrI,GACA,GAAAr0I,EAAAgI,GAAA,CACA,2BAAAssI,EAAA,WAAAvzI,KAAAC,SAAA,CAAAhB,GAAA,IAIA,OACA,CACA,IACA,IAAAu0I,EAAA,MAAArvI,EAAAsvI,OAAA,EACWnvI,WAAAgvI,CACX,GACA,GAAAE,EAAA/yI,EAAAuG,IAAA,CACA,MAEA,MAEA,CACA,UAAAyW,QAAAI,GAAAgiE,WAAAhiE,EAAAtgB,KAAA2kC,KAAA,CAAA0rG,GAAA,IACA,EAIA,QACA,CACA,CAAA55B,GAAAg/B,SAAA,CAAAF,GAKA,IAAA1/B,GAAA,IAAA/3F,GAAA,8CAQA,OAAAg4F,GAOA,OAAA0/B,oBAAAxL,CAAA,EACA,OAAAvzB,GAAA++B,mBAAA,CAAAxL,EAAA,CAaA,OAAArjD,KAAA//E,CAAA,CAAAwgB,CAAA,CAAAosC,CAAA,CAAA2iF,CAAA,CAAAC,CAAA,EACA,OAAA3/B,GAAA9vB,IAAA,CAAA//E,EAAAwgB,EAAAosC,EAAA4iF,EAAAD,EACA,EAGA,SAAA5oI,GAAAnL,CAAA,EACA,OAAAA,GAAAA,EAAAoL,UAAA,EAAAzL,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAvL,EAAA,WAAAA,EAAA,QAAAA,CAAA,CAGA,IAAAi0I,GAAAt0I,OAAA0L,SAAA,CAAAxF,QAAA,CACAquI,GAAAv0I,OAAAiE,IAAA,WAAA2Y,CAAA,EACA,IAAA3Y,EAAA,GACA,QAAA/D,KAAA0c,EACA3Y,EAAAxH,IAAA,CAAAyD,GAEA,OAAA+D,CAAA,EAGA,SAAAtD,GAAA2pC,CAAA,CAAAkqG,CAAA,EACA,IAAAjxI,EAAA+lC,EAAAvhB,EAAA9jB,EAAArE,EAAA60I,EAAAC,EACA,GAAApqG,CAAA,IAAAA,EACA,YACA,CACA,GAAAA,CAAA,IAAAA,EACA,aACA,CACA,cAAAA,GACA,aACA,GAAAA,IAAA,GAAAA,EACA,OAAK,KACL,GAAAA,EAAAm6C,MAAA,qBAAAn6C,EAAAm6C,MAAA,CACA,OAAK9jF,GAAA2pC,EAAAm6C,MAAA,GAAA+vD,EAkCL,CA/BA,GAAAE,mBADAA,CAAAA,EAAAJ,GAAA1oI,IAAA,CAAA0+B,EAAA,EACA,CAGA,IAAA/mC,EAAA,EAFAwkB,EAAA,IACAuhB,EAAAgB,EAAAnsC,MAAgB,GAChBoF,EAAA+lC,EAAA/lC,IACAwkB,GAAApnB,GAAA2pC,CAAA,CAAA/mC,EAAA,SAKA,OAHA+lC,EAAA,IACAvhB,CAAAA,GAAApnB,GAAA2pC,CAAA,CAAA/mC,EAAA,MAEMwkB,EAAA,GACN,CAoBA,GApBA2sH,oBAAAA,EAmBA,OAAAh0I,KAAAC,SAAA,CAAA2pC,EACA,CAdA,IAHAhB,EAAArlC,CADAA,EAAAswI,GAAAjqG,GAAA2D,IAAA,IACA9vC,MAAA,CACA4pB,EAAA,GACAxkB,EAAA,EACAA,EAAA+lC,GAGAtoC,KAAAA,IADAyzI,CAAAA,EAAA9zI,GAAA2pC,CAAA,CADA1qC,EAAAqE,CAAA,CAAAV,EAAA,CACA,QAEAwkB,GACAA,CAAAA,GAAA,KAEAA,GAAArnB,KAAAC,SAAA,CAAAf,GAAA,IAAA60I,GAEAlxI,IAEA,MAAM,IAAAwkB,EAAA,GAKN,gBACA,gBACA,OAAAysH,EAAA,KAAAxzI,KAAAA,CAAA,KACA,SACA,OAAAN,KAAAC,SAAA,CAAA2pC,EACA,SACA,OAAAg7D,SAAAh7D,GAAAA,EAAA,KACA,CASA,IAAAqqG,GAAAnpI,GANA,SAAA8+B,CAAA,EACA,IAAAsqG,EAAAj0I,GAAA2pC,EAAA,IACA,GAAAsqG,KAAA5zI,IAAA4zI,EACA,SAAAA,CACA,GAIA,IAAAC,GAAA,GAIA,SAAAC,GAAAv3I,CAAA,EACA,IAAAu3I,EAAA,EACA,KAAAv3I,EAAA,GACAA,GAAA,EACAu3I,IAEA,OAAAA,CAAA,CAIA,SAAAC,GAAAx3I,CAAA,SACA,IAAAA,EAAA,GACAA,IACAA,GAAAA,GAAA,EACAA,GAAAA,GAAA,EACAA,GAAAA,GAAA,EACAA,GAAAA,GAAA,EACAA,GAAAA,GAAA,GAEAA,CADAA,GAAAA,GAAA,IACA,EARA,CAgBA,MAAA+2G,GACAp1G,YAAA81I,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAEA,KAAAJ,aAAA,QAEA,KAAAC,wBAAA,QAEA,KAAAC,MAAA,QAEA,KAAAC,gBAAA,QAEA,KAAAC,eAAA,QACA,KAAAJ,aAAA,CAAAA,EACA,KAAAC,wBAAA,CAAAA,EACA,KAAAC,MAAA,CAAAA,EACA,KAAAC,gBAAA,CAAAA,EACA,KAAAC,eAAA,CAAAA,CACA,CACAC,SAAA3tI,CAAA,EACA,YAAA4tI,oBAAA,CAAA5tI,EAAA,IAEA4tI,qBAAA5tI,CAAA,EACA,GAAAA,EAAA,KAAA0tI,eAAA,EACA,IAAAG,EAAAT,GAAAC,GAAArtI,EAAAmtI,GAAA,IAAAC,GAAAD,IAAA,EACAW,EAAA,KAAAC,eAAA,CAAAF,GACAG,EAAAhuI,EAAA8tI,CAAAA,EAAAX,EAAA,EACM,OAAAU,EAAAG,EAAA,CAON,CALA,IAAAC,EAAAjuI,EAAA,KAAA0tI,eAAA,CACAQ,EAAA33I,KAAAwZ,KAAA,CAAAk+H,EAAA,KAAAX,aAAA,EACAO,EAAA,KAAAJ,gBAAA,CAAAS,EACAF,EAAAC,EAAA,KAAAX,aAAA,CACA,OAAAO,EAAAG,EAAA,CAEA,CACAG,oBAAAN,CAAA,SACA,QAAAJ,gBAAA,CACM,CAAAl3I,KAAAs/C,GAAA,GAAAg4F,GAAA,GAAAV,GAEN,CAAAU,EAAA,KAAAJ,gBAAA,OAAAH,aAAA,MAAAI,eAAA,CAGAU,mBAAAP,CAAA,EACA,YAAAM,mBAAA,CAAAN,GAAA,KAAAE,eAAA,CAAAF,GAAA,CACA,CACAE,gBAAAF,CAAA,SACA,OAAAJ,gBAAA,CACMl3I,KAAAs/C,GAAA,GAAAg4F,EAAAT,GAAAD,KAEN,KAAAG,aAAA,CAEA,CAEA,IAAAe,GAAA1qI,WAAA8Q,KAAA,OAGA65H,WAAAxiB,GACAt0H,YAAAs9C,CAAA,CAAAj7C,CAAA,CAAA4yH,CAAA,EACA,IAAAC,EAA2B7rH,GAAA,CAC3B,IAAA0zD,EAAA+2D,GAAAzqH,EAAA,CACAorH,YAAA,GACAK,eAAA,EACAH,UAAA,GACAE,mBAAA,IACO,GAAAxyH,CAAA,GAOP,MALA,WAAA06D,EACQ,KAAAg6E,gBAAA,CAAAh6E,EAAA62D,MAAA,CAER,KAAAmjB,gBAAA,CAAAh6E,EAEAA,CACA,EACA,MAAAm4D,EAAA53E,EAAAj7C,EAAA4yH,GACA,KAAA8hB,gBAAA,OACA,CACArqI,KAAA,GAAAnF,CAAA,EACA,IAAAid,EAAA,KAAAuyH,gBAAA,EAAAvyH,kBACA,IAAAA,EACA,MAAA9X,IAAA,IAAAnF,GAEA0X,QAAAC,MAAA,2CAAA3X,CAAA,yEAAAid,EAAA,KADA,CAGAkxG,OAAA,GAAAnuH,CAAA,EACA,IAAAid,EAAA,KAAAuyH,gBAAA,EAAAvyH,kBACA,IAAAA,EACA,MAAAkxG,MAAA,IAAAnuH,GAEA0X,QAAAC,MAAA,iDAAA3X,CAAA,yEAAAid,EAAA,KADA,CAEA,CAWA,SAAAwyH,GAAAr2I,CAAA,CAAAlB,CAAA,EACA,IAAAgkI,EACA,IACIA,EAAA9iI,EAAAkX,MAAA,CAAAf,MAAA,CAAArX,EACJ,OAAAgJ,EAAA,CACA,oCAAAA,EAAA,CAEA,GAAAg7H,EAAAwO,SAAA,GAAAtxI,EAAAvB,KAAA,CACA,2DAAAqkI,EAAAwO,SAAA,OAAAtxI,EAAAvB,KAAA,IAEA,OAAAqkI,CAAA,CAIA,IAAAwT,GAAA,EACA,OAAA3iC,GACAt0G,YAAAuH,CAAA,EACA,KAAA7G,GAAA,QACA,KAAAsoD,KAAA,QACA,KAAAtoD,GAAA,CAAA6G,EAAA7G,GAAA,CACA,KAAAsoD,KAAA,CAAAzhD,EAAAyhD,KAAA,CAEAkuF,UAAA,CACA,IAAAn4F,EAAAuJ,OAAA,sBACA,YAAAU,KAAA,CAAAmuF,gBAAA,GAAAp4F,CACA,CACA,OAAAokF,YAAA36D,CAAA,EACA,IAAA39D,EAAAmsI,GAAAI,GAAA5uE,GACI6uE,EAAM7uE,EAAAvpE,MAAA,CAAAg4I,GACNzR,GAAM6R,GAAA,6BACV7R,GAAA6R,EAAA,iCACA,IAAAC,EAAAD,EAAA,GACA,CACMlwI,UAAAA,CAAE,CACR,CAAAqP,GAAA7W,MAAA,EAAA6W,GAAAqU,GAAA,CAAAjrB,KAAA03I,EAAA,eAAAxgI,MAAA,CAAA0xD,EAAAnpE,KAAA,CAAA43I,KACA,OACAE,iBAAAtsI,EAAAssI,gBAAA,CACAI,iBAAA1sI,EAAA0sI,gBAAA,CACAC,2BAAA3sI,EAAA4sI,sBAAA,CACAr/E,UAAAvtD,IAAAA,EAAAutD,SAAA,CAAAn5D,MAAA,KAAA4d,GAAAhS,EAAAutD,SAAA,KAAAt2D,KAAAA,CAAA,CACAqF,UAAAA,EAAAjI,GAAA,CAAAo+C,GAAA,IAAAzgC,GAAAygC,GACA,CACA,CACA,CACA,IAAA85F,GAAA,CACAh4I,MAAA,EACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,cAAA+1H,GAAA,oBAAAr7H,GAAAuF,IAAA,qBAAAvF,GAAAqF,EAAA,2BAAArF,GAAAqF,EAAA,GAEArF,GAAAqU,GAAA,CAAAjrB,KAAA4W,GAAAQ,MAAA,CAAAR,GAAAqF,EAAA,uBAGA67H,GAAA,6CACA,SAAAC,GAAAhsD,CAAA,EACA,IAAA1a,EAAA0a,EAAAxwD,KAAA,CAAAu8G,IACA,GAAAzmE,IAAA,EAAAA,EACA,MAAAlxE,UAAA,qCAAA4rF,EAAA,KAEA,IAAAxsF,EAEAy4I,EAAAC,EAAAx3I,EAAA,CAAA4wE,EACA6mE,EAAAnsD,EAAAt5B,UAAA,wBACA0lF,EAAAF,IAAA,EAAAA,EAAA,KAAArtG,SAAAqtG,EAAAx4I,KAAA,QACA24I,EAOAD,IAAY,EAAZA,EAAqB,GAAI,IAAAA,EAAU,IACnC,SAAAD,EAAA,IAAAF,EAAA,EAAAI,EAAA,EAAA33I,EAAA,EAGA,IAAA43I,GAAA31I,GAAkC2wH,GAAQp2G,IAAW/X,KAAArE,GAAA,IAAAoc,GAAApc,IACrDy3I,GAAAl0I,GAAiC,CAAAc,KAAOP,GAAS,YAAmD4zI,GAAA71I,GAAA2wH,GAAApZ,EAAAp7G,MAAA,EAAAy5I,GAAAz3I,GAAAo5G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA3b,CAAA,eAMpGi0G,GAAA,IAiGA,SAAA0jC,GAAAC,CAAA,EACA,mBAAAj6H,IAAA,CAAAi6H,GACA,qEAEA,OAAAA,CAAA,CAIA,SAAAC,GAAAC,CAAA,EACA,IAAAzyI,EACAmB,EACA,oBAAAsxI,EACIzyI,EAAAyyI,OACJ,GAAAA,EAAA,CACA,IACAzyI,WAAA0yI,CAAA,CACM,GAAAC,EACN,CAAAF,EACAzyI,EAAA0yI,EACAvxI,EAAAwxI,CACA,OACA,CACA3yI,WAAAA,EACAmB,OAAAA,CACA,EAMA,SAASiB,GAAWlG,CAAA,EACpB,OAAA0Z,GAAa,CAAA/a,GAAO,CACpByH,QAAQ7D,GAAM,OACd8D,GAAAvD,KACG9C,OAAAA,CACH,GAAArB,GAAA,CACAyH,QAAQ7D,GAAM,OACd8D,GAAAvD,KACAb,MAAAtD,GAAY,CACZ2H,KAAAjD,KACAjF,QAAY0E,KACPrF,KAAAoF,GAAAV,KACF,EACH,IACA,CAAgD,IAAAgE,GAAAD,GAAA7C,MAMhD,SAAS4C,GAAMxF,CAAA,EACf,OAAAH,GAAA4F,GAAAzF,GAAA0F,GAAA1H,GACA,UAAAA,EACMA,EAEN,CACA,GAAAA,CAAgB,CAChBuB,OAAA4B,GAAAnD,EAAAuB,MAAA,CAAAS,EACA,CACG,CACH,CAMA,SAAA8F,GAA2B9H,CAAA,EAC3B,OAAAwH,GAAiBtH,GAAA,CACjBsB,QAAYtB,GAAM,CACb6H,KAAA7D,IACL,GACGlE,MAAAA,CACH,IAMA,SAASi4I,GAAIj4I,CAAA,EACb,OAAAE,GAAa,CACbsB,QAAYtB,GAAM,CACb6H,KAAA7D,IACL,GACGlE,MAAAA,CACH,GAMA,SAAAk4I,GAAAn4E,CAAA,CAAAv9C,CAAA,SACA,IAAAu9C,EACA,IAAAq1C,GAAA,CACAj3F,OAAAqE,EAAArE,MAAA,CACAulH,kBAAAlhH,EAAAykH,WAAA,CAAAxoI,GAAA,CAAAm9E,GAAA,IAAAx/D,GAAAw/D,IACAzyE,gBAAAqZ,EAAArZ,eAAA,CACAg+H,qBAAA3kH,EAAAs6B,YAAA,CAAAr+C,GAAA,CAAAsrD,GAAA,EACAo6E,eAAAp6E,EAAAo6E,cAAA,CACAC,kBAAcr6E,EAAAvkD,QAAW,CAClBxG,KAAA+yH,KAAA17G,MAAA,CAAA0zC,EAAA/qD,IAAA,CACP,IACKooI,oBAAA5kH,EAAA4kH,mBAAA,GAGL,IAAAlyB,GAAA1yF,EACA,CAmHA,IAAA21H,GAAoBj4I,GAAA,CACpBk4I,WAAAl0I,KACAm0I,eAAiBn0I,KACjBs+G,QAASt+G,KACTo0I,MAAAp0I,KACCq0I,SAAAr0I,IAAA,GAUDs0I,GAAehxI,GAAAtJ,GAAA+F,GAAA/D,GAAA,CACf01I,MAAA1xI,KACAu0I,cAAgBv0I,KAChBujD,OAAAvjD,KACAw0I,YAAcx0I,KACby0I,WAAAv0I,GAAAH,GAAAC,MAAA,MAUD00I,GAAc16I,GAAAgC,GAAA,CACd6H,KAAA7D,KACC20I,kBAAA30I,IACD,IAIA40I,GAAe54I,GAAA,CACf64I,MAAA70I,KACA/B,UAAA+B,KACAk0I,WAASl0I,KACR0xI,MAAA1xI,IAAA,GAOD80I,GAAe94I,GAAA,CACf01I,MAAA1xI,KACA6xI,UAAA7xI,KACA+0I,aAAgB/0I,KAChBg1I,aAAeh1I,KACfi1I,YAAA/0I,GAAoBF,MACnBk1I,iBAAAh1I,GAAAF,KACD,GACAm1I,GAAuBn5I,GAAA,CACvBm1I,cAAAnxI,KACAoxI,yBAAiBpxI,KACjBqxI,OAAAhjB,KACAijB,iBAAmBtxI,KAClBuxI,gBAAAvxI,IAAA,GAO4Do1I,GAAA5mB,GAAAruH,KAAAnG,GAAAgG,OAKEq1I,GAAAt1I,GAAAgX,GAAA,CAAA/a,GAAA,IAAAmE,KAAA,GAM/Dm1I,GAAAt5I,GAAA,CACC8H,IAAAuxI,EAAA,GAKsCE,GAAA31I,GAAA,qBAOvC41I,GAAiBx5I,GAAM,CACvB,cAAiBmE,KAChB,cAAAD,GAAAF,KACD,GACAy1I,GAAiBz5I,GAAA,CACjB4xD,QAAAztD,KACAg4C,UAAUm7F,GACTrlH,OAAAvtB,IACD,GACAg1I,GAAA15I,GAAA,CACAm8C,UAAYm7F,GACZhyI,SAAQtH,GAAMs5I,IACbx4I,KAAAqF,IACD,GACA6C,GAAuCY,GAAA5H,GAAA,CACvC8H,IAAA/D,GAAgBgX,GAAM,CAAC/a,GAAA,CAAM,GAAAmE,KAAA,GAC7B8C,KAAAlD,GAAY/F,GAASmG,OACrBmB,SAAApB,GAAgBH,GAAO/F,GAAA+F,GAAA/D,GAAA,CACvB+H,WAAWsqH,KACXrqH,MAAA7D,KACA8D,SAAUjE,KACVlF,KAAAd,GAAemG,MACZ+D,UAAAhE,GAAAF,KACH,OACAmE,cAAcjE,GAASF,MACvBg6E,WAAA95E,GAAqBH,GAAA/D,GAAA,CACrBm8C,UAAeh4C,KACZrF,KAAAuE,GAAA,CAAAc,KAAAP,GAAA,WACH,KACA+1I,kBAAiBz1I,GAAAH,GAAA/F,GAAAgC,GAAA,CACjBvB,MAAAuF,KACG44C,aAAA5+C,GAAA+c,GAAA,CAAA0+H,GAAAC,GAAA,EACF,SA8HDE,GAAqChyI,GAAM5H,GAAA,CAC3C65I,WAAarnB,GAAAruH,KAAAnG,GAAAgG,OACbslG,MAAAtpG,GAAA,CACA85I,UAAc91I,KACX+1I,SAAA/1I,IACF,MAOD,SAAAg2I,GAAAtxI,CAAA,CAAAuxI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,MAEAC,EAMAC,EAPA,IAAAj+H,EAAA49H,GAAAhE,GAGA,MAAAmE,GACAjzI,QAAAo3D,IAAA,+JAIA27E,GACAI,CAAAA,EAAA,MAAAt4G,EAAAtf,IAAA,CACA,IAAA63H,EAAA,UAAAl8H,QAAA,CAAAI,EAAAH,IAAA,CACA,IACU47H,EAAAl4G,EAAAtf,EAAA,CAAA83H,EAAAC,IAAAh8H,EAAA,CAAA+7H,EAAAC,EAAA,EACV,OAAAp3I,EAAA,CACAib,EAAAjb,EACO,CACP,GACA,aAAAgZ,KAAAk+H,EACA,GAEA,IAAAG,EAAA,GAAA7nB,CAAAA,IAAA,QAAAlwG,EAAAjC,IAAA,CACA,IAAAjf,EAAA,CACAqf,OAAA,OACA3C,KAAAwE,EACA03H,MAAAA,EACAv8H,QAAA5d,OAAAC,MAAA,EACO,iCACP,EAAA65I,GAAA,GAAAW,GACA,EACA,IACA,IACA7zI,EADA8zI,EAAA,EAEAC,EAAa,IACb,KAaA,EAZAP,EACU,MAAAA,EAAA7xI,EAAAhH,GAEV,MAAA4a,EAAA5T,EAAAhH,GAEA,MAAAqF,EAAAqE,MAAA,EAGAgvI,CAAA,IAAAA,IAGAS,GAAA,EACAA,IAAAA,EAEA,EACAzzI,QAAA9D,KAAA,0BAAAyD,EAAAqE,MAAA,IAAArE,EAAAqb,UAAA,qBAAA04H,EAAA,cACA,MAAA17D,GAAA07D,GACAA,GAAA,EAEA,IAAAx6H,EAAA,MAAAvZ,EAAAuZ,IAAA,EACAvZ,CAAAA,EAAAob,EAAA,CACQxB,EAAA,KAAAL,GAERK,EAAA,SAAA5Z,EAAAqE,MAAA,IAAArE,EAAAqb,UAAA,KAAA9B,EAAA,GAEA,OAAAxY,EAAA,CACAA,aAAAgD,OAAA6V,EAAA7Y,EACG,CACH,MACA,OAAA6yI,CACA,CACA,SAAAI,GAAAC,CAAA,EACA,OAAAj6H,EAAAna,IACA,IAAA0X,QAAA,CAAAI,EAAAH,IAAA,CACAy8H,EAAAp4H,OAAA,CAAA7B,EAAAna,EAAA,CAAAkB,EAAAwa,IAAA,CACA,GAAAxa,EAAA,CACAyW,EAAAzW,GACA,MACA,GACOwa,EACF,EACL,EAEA,CACA,SAAA24H,GAAAD,CAAA,EACA,OAAA34F,GACA,IAAA/jC,QAAA,CAAAI,EAAAH,IAAA,CAEA,IAAA8jC,EAAA/jD,MAAA,EAAAogB,EAAA,IACA,IAAAiwD,EAAAtsB,EAAA9jD,GAAA,CAAAi+B,GACOw+G,EAAAp4H,OAAA,CAAA4Z,EAAA01C,UAAA,CAAA11C,EAAA51B,IAAA,GAEPo0I,EAAAp4H,OAAA,CAAA+rD,EAAA,CAAA7mE,EAAAwa,IAAA,CACA,GAAAxa,EAAA,CACAyW,EAAAzW,GACA,MACA,GACOwa,EACF,EACL,EACA,CAKA,IAAA44H,GAAA5zI,GAAA2wI,IAKAkD,GAAA7zI,GAAAsxI,IAKAwC,GAAA9zI,GAAAoxI,IAKA2C,GAAA/zI,GAAAwxI,IAKAwC,GAAAh0I,GAAA6xI,IAKAoC,GAAAj0I,GAAA8xI,IAK0CoC,GAAAl0I,GAAAtD,MAU1Cy3I,GAAe7zI,GAAA5H,GAAA,CACf64I,MAAA70I,KACA03I,YAAA13I,KACA23I,eAAA33I,KACC43I,uBAAA59I,GAAAs5I,GAAA,IAWDuE,GAAgB77I,GAAA,CAChBunD,OAAApjD,KACAuhF,SAAY3hF,GAAMC,MAClB8hD,SAAA9hD,KACC83I,eAAA53I,GAAAC,KAAA,GAUD43I,GAAAn0I,GAAA5J,GAAAgC,GAAA,CACA28C,QAAU26F,GACV/vF,OAAApjD,KACAuhF,SAAY3hF,GAAMC,MAClB8hD,SAAA9hD,KACC83I,eAAA53I,GAAAC,KAAA,KAMD63I,GAAAp0I,GAAA5J,GAAAgC,GAAA,CACA+jD,OAAAuzF,GACA/xI,QAAAvF,GAAgB,CAChB+H,WAAAsqH,KACArqH,MAAAsvI,GACArvI,SAAAjE,KACAlF,KAAA04I,GACGtvI,UAAAlE,IACF,EACD,KACAi4I,GAAiBj8I,GAAA,CACjB4xD,QAAUztD,KACV8tB,OAASvtB,KACRu3C,MAAAj4C,IAAA,GAMDk4I,GAAAt0I,GAAA5J,GAAAgC,GAAA,CACA+jD,OAAAuzF,GACA/xI,QAAAvF,GAAgB,CAChB+H,WAAAsqH,KACArqH,MAAAsvI,GACArvI,SAAAjE,KACAlF,KAAAm9I,GACG/zI,UAAAlE,IACF,OAUDm4I,GAAkBv0I,GAAA5J,GAAAgC,GAAA,CAClBiI,SAAAjE,KACC24C,QAAA26F,EAAA,KAMD8E,GAAqBp8I,GAAA,CACrB+H,WAAAsqH,KACArqH,MAAAsvI,GACArvI,SAAAjE,KACAlF,KAAA04I,GACCtvI,UAAAlE,IAAA,GAMDq4I,GAAAr8I,GAAA,CACA+jD,OAAAuzF,GACC/xI,QAAA62I,EACD,GACAE,GAAA36I,GAAAoZ,GAAA,CAAAu3G,GAAApZ,EAAAp7G,MAAA,EAAAm+I,GAAA,EAAAlhI,GAAA,CAAAw8H,GAAA0E,GAAA,EAAAn8I,GACA,MAAWiC,OAAM,CAAAjC,GACbmD,GAAAnD,EAAA03I,IAEJ13I,CACC,EAMDy8I,GAAqBv8I,GAAA,CACrB+H,WAAAsqH,KACArqH,MAAAsvI,GACArvI,SAAAjE,KACAlF,KAAAw9I,GACCp0I,UAAAlE,IACD,GACAw4I,GAAAx8I,GAAA,CACA+jD,OAAAuzF,GACC/xI,QAAAg3I,EAAA,GAMDE,GAAuBz8I,GAAY,CACnCqoD,MAAAttC,GAAU,CAAMnX,GAAA,UAAAA,GAAA,YAAAA,GAAA,cAAAA,GAAA,kBAChBq8B,OAAAj8B,KACC04I,SAAA14I,IAAA,GAOD24I,GAAmBr1I,GAAAtJ,GAAAgC,GAAA,CACnB6J,UAAQ1F,KACR0D,KAAA7D,KACA8D,IAAAuxI,GACA7tE,KAAAznE,GAAaI,MACZy4I,UAAA14I,GAAAH,GAAAC,MAAA,KAMD64I,GAAmBv1I,GAAAtJ,GAAAgC,GAAA,CACnB6J,UAAQ1F,KACR0D,KAAA7D,KACA8D,IAAAuxI,GACA7tE,KAAAznE,GAAaI,MACZy4I,UAAA14I,GAAAH,GAAAC,MAAA,KAMD84I,GAAsB98I,GAAA,CACtB+8I,aAAA/4I,KACC3C,OAAA02I,GAAAqE,GAAA,GAMDY,GAAAh9I,GAAA,CACA+jD,OAAAuzF,GACC/xI,QAAA62I,EAAA,GAMDa,GAAsBj9I,GAAA,CACtB+8I,aAAA/4I,KACC3C,OAAA02I,GAAAiF,GAAA,GAMDE,GAAgBl9I,GAAA,CAChB6uB,OAAQ7qB,KACR6D,KAAQ7D,KACP4qB,KAAA5qB,IAAA,GAMDm5I,GAAsBn9I,GAAA,CACtB+8I,aAAA/4I,KACC3C,OAAA67I,EAAA,GAqBDE,GAAsBriI,GAAA,CAAA/a,GAAA,CACtBA,KAAQ+a,GAAM,CAAAnX,GAAA,sBAAAA,GAAA,aAAAA,GAAA,0BAAAA,GAAA,UACdiE,KAAA7D,KACCq5I,UAAOr5I,IACR,GAAAhE,GAAQ,CACRA,KAAA4D,GAAgB,eAChBirB,OAAQ7qB,KACR6D,KAAA7D,KACCq5I,UAAOr5I,IACR,GAAAhE,GAAQ,CACRA,KAAQ4D,GAAM,UACdiE,KAAA7D,KACAq5I,UAAar5I,KACbs5I,MAAAt9I,GAAA,CACAu9I,sBAAAv5I,KACAw5I,0BAA2Bx5I,KAC3By5I,sBAAAz5I,KACG05I,wBAAA15I,IACF,EACD,GAAAhE,GAAQ,CACRA,KAAQ4D,GAAM,QACdiE,KAAA7D,KACAq5I,UAAar5I,KACZ8D,IAAA3D,IAAA,KAMDw5I,GAAsB39I,GAAA,CACtB+8I,aAAA/4I,KACC3C,OAAA+7I,EAAA,GAMDQ,GAAsB59I,GAAA,CACtB+8I,aAAA/4I,KACC3C,OAAA02I,GAAAh9H,GAAA,CAAAu+H,GAAAC,GAAA,KAMDsE,GAAsB79I,GAAA,CACtB+8I,aAAgB/4I,KACf3C,OAAA2C,IACD,GACA85I,GAAgB99I,GAAA,CAChB+jD,OAAU5/C,KACV45I,OAAOh6I,GAASI,MAChB65I,IAAOj6I,GAASI,MAChBi4D,IAAAr4D,GAAWI,MACV07D,QAAA97D,GAAAI,KACD,GACA85I,GAAoBj+I,GAAA,CACpBk+I,WAAc/5I,KACdg6I,WAAAh6I,KACAi6I,eAAAp6I,KACAq6I,iBAAgBhsB,KAChBisB,aAActgJ,GAAMqF,GAAA,CAAAW,KAAAA,KAAAA,KAAA,GACpBy0I,WAAYz0I,KACZu6I,SAAYv6I,KACXw6I,SAAAz6I,GAAAC,KAAA,GAMDy6I,GAAgBn3I,GAAAtH,GAAA,CAChBm2B,QAAAn4B,GAAcigJ,IACbS,WAAA1gJ,GAAAigJ,GACD,IACAU,GAAA5jI,GAAgC,CAAAnX,GAAI,aAAAA,GAAA,aAAAA,GAAA,eACpCg7I,GAAc5+I,GAAA,CACd6H,KAAA7D,KACA66I,cAAA96I,GAAAC,MACA8D,IAAAuxI,GACCyF,mBAAA56I,GAAAy6I,GAAA,GAK2EI,GAAAn3I,GAAA5J,GAAA+F,GAAA66I,MAM5EI,GAAqC13I,GAAAtD,MACrCi7I,GAAAj/I,GAAA,CACA07E,WAAA47D,GACArR,gBAAmBjoI,GAAMgG,MACxBoiI,gBAAApoI,GAAAgG,KACD,GACAk7I,GAA0Bl/I,GAAA,CAC1B2J,WAAW3L,GAAImG,MACf1E,QAAAO,GAAA,CACA+mI,YAAgB/oI,GAAAmG,MAChB8Z,OAAAje,GAAA,CACA2lI,sBAAA3hI,KACA4hI,0BAAA5hI,KACK6hI,4BAAA7hI,IACL,GACA44C,aAAgB5+C,GAAMgC,GAAM,CAC5BsF,SAAYtH,GAAMgG,MAClBlF,KAAAqF,KACK8/H,eAAAjgI,IACL,IACAiF,gBAAA9E,KACG+iI,oBAAAhjI,GAAAlG,GAAAihJ,IACF,EACD,GACAE,GAAAn/I,GAAA,CACA+jD,OAAUuzF,GACVluI,OAAAipH,KACAl1E,SAAUk1E,KACT3rG,OAAAxiB,GAAA6W,GAAA,CAAAnX,GAAA,eAAAA,GAAA,iBACD,GACAw7I,GAAoBp/I,GAAA,CACpB+mI,YAAc/oI,GAAMmhJ,IACnBx1I,WAAA3L,GAAAmG,KACD,GACAk7I,GAAiBr/I,GAAA,CACjBiyB,OAAAvtB,KACAktD,QAAAztD,KACCg4C,UAAAm7F,EACD,GACAgI,GAAiBt/I,GAAA,CACjBsF,SAAQtH,GAAMs5I,IACdx4I,KAAAqF,KACCg4C,UAAAm7F,EACD,GACAiI,GAAAxkI,GAAA,CAAiCukI,GAAWD,GAAA,EAC5CG,GAAiBzkI,GAAA,CAAA/a,GAAA,CACjBiyB,OAAAvtB,KACAktD,QAAAztD,KACCg4C,UAAOh4C,IACR,GAAAnE,GAAA,CACAsF,SAAQtH,GAAMmG,MACdrF,KAAAqF,KACCg4C,UAAAh4C,IACD,KACAs7I,GAAA99I,GAAA49I,GAAAC,GAAA1/I,GACA,aAAiBA,EACbmD,GAAAnD,EAAAw/I,IAEJr8I,GAAAnD,EAAAu/I,GACC,EAMDK,GAA0B1/I,GAAA,CAC1B2J,WAAW3L,GAAImG,MACf1E,QAAAO,GAAA,CACA+mI,YAAA/oI,GAAuBmhJ,IACvBviG,aAAA5+C,GAAqByhJ,IACrBx2I,gBAAA9E,KACG+iI,oBAAAhjI,GAAAH,GAAA/F,GAAAihJ,KACF,EACD,GACAU,GAAsB3/I,GAAA,CACtB4/I,aAAc57I,KACd6/C,KAAA1/C,KACA6D,MAAA9D,GAAAC,MACC07I,cAAAhE,EACD,GACAiE,GAAiB9/I,GAAA,CACjBm9C,SAAYn/C,GAAKs5I,IAChB3T,SAAA3lI,GAAAs5I,GAAA,GAMDyI,GAAA//I,GAAA,CACA8H,IAAOuxI,GACP2G,IAAAh8I,KACA21I,kBAAiBz1I,GAAAH,GAAA/F,GAAAgC,GAAA,CACjBvB,MAAAuF,KACA44C,aAAgB5+C,GAAMgC,GAAM,CAC5BsF,SAAYtH,GAAMgG,MAClBlF,KAAAqF,KACK8/H,eAAAjgI,IACF,GACH,MACAi8I,YAAAjiJ,GAAqBgG,MACrBk8I,aAAeliJ,GAAAgG,MACfmG,YAAAjG,GAAoBH,GAAS/F,GAASmG,QACtCg8I,iBAAAj8I,GAA6BH,GAAS/F,GAAM2hJ,MAC5CS,kBAAmBl8I,GAAQH,GAAA/F,GAAA2hJ,MAC3BU,gBAAAn8I,GAAwB47I,IACvBQ,qBAAAp8I,GAAAF,KAAA,GAMDu8I,GAAAvgJ,GAAA,CACA8H,IAAOuxI,GACP2G,IAAAh8I,KACA21I,kBAAiBz1I,GAAAH,GAAA/F,GAAAgC,GAAA,CACjBvB,MAAAuF,KACG44C,aAAA5+C,GAAAyhJ,GACH,MACAQ,YAAAjiJ,GAAqBgG,MACrBk8I,aAAeliJ,GAAAgG,MACfmG,YAAAjG,GAAoBH,GAAS/F,GAASmG,QACtCg8I,iBAAAj8I,GAA6BH,GAAS/F,GAAM2hJ,MAC5CS,kBAAmBl8I,GAAQH,GAAA/F,GAAA2hJ,MAC3BU,gBAAAn8I,GAAwB47I,IACvBQ,qBAAAp8I,GAAAF,KACD,GAA2Dw8I,GAAAzlI,GAAA,CAAAnX,GAAA,GAAAA,GAAA,YAI3D68I,GAAgBzgJ,GAAA,CAChB+jD,OAAA5/C,KACA8D,SAAAjE,KACAw0I,YAAcz0I,GAASC,MACvB08I,WAAc38I,GAASI,MACtBs0I,WAAAv0I,GAAAH,GAAAC,MAAA,GAMD28I,GAAmBr5I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAA78I,KACAumD,aAAAvsD,GAAAgC,GAAA,CACA0F,YAAUw5I,GACVh1I,KAAAnG,GAAag8I,IACVlgF,QAAA37D,GAAAs8I,GACH,IACAM,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAMD+8I,GAAmBz5I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAW78I,KACX88I,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAMDg9I,GAAmB15I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAA78I,KACAumD,aAAAvsD,GAAAgC,GAAA,CACA0F,YAAU05I,GACVl1I,KAAAnG,GAAag8I,IACVlgF,QAAA37D,GAAAs8I,GACH,IACAM,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAMDi9I,GAAmB35I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAA78I,KACAumD,aAAAvsD,GAAAgC,GAAA,CACA0F,YAAUg6I,GACVx1I,KAAAnG,GAAaw8I,IACV1gF,QAAA37D,GAAAs8I,GACH,IACAM,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAMDk9I,GAAmB55I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAA78I,KACAumD,aAAAvsD,GAAAgC,GAAA,CACA0F,YAAU05I,GACVl1I,KAAAnG,GAAaw8I,IACV1gF,QAAA37D,GAAAs8I,GACH,IACAM,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAMDm9I,GAAmB75I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAW78I,KACX88I,QAAA58I,GAAalG,GAASyiJ,KACtB7D,UAAA74I,GAAeC,MACdi1I,YAAAl1I,GAAAC,KAAA,KAQDo9I,GAAmB95I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAA78I,KACAumD,aAAAvsD,GAAAgC,GAAA,CACA0F,YAAUw5I,GACPh1I,KAAAnG,GAAAg8I,GACH,IACAe,QAAA58I,GAAalG,GAASyiJ,KACrB7D,UAAA74I,GAAAC,KAAA,KAMDq9I,GAAmB/5I,GAAAvD,GAAA/D,GAAA,CACnBmJ,UAAAhF,KACAy8I,kBAAoBz8I,KACpB08I,WAAc78I,KACd2F,WAAa3L,GAAAmG,MACZy4I,UAAA74I,GAAAC,KAAA,KAMDs9I,GAAch6I,GAAAvD,GAAA/D,GAAA,CACd6H,KAAQ7D,KACRkG,KAAAnG,GAAag8I,IACbnD,UAAA14I,GAAAH,GAAAC,OACA0B,YAAWw5I,GACVr/E,QAAA37D,GAAAs8I,GAAA,KAMDe,GAAcj6I,GAAAvD,GAAA/D,GAAA,CACd6H,KAAA7D,KACA0B,YAAQg6I,GACRx1I,KAAAnG,GAAaw8I,IACb3D,UAAW14I,GAAQH,GAAAC,OAClB67D,QAAA37D,GAAAs8I,GAAA,KAQDgB,GAAmB55I,GAAA5H,GAAA,CACnBmJ,UAAAhF,KACAusI,cAAA1wI,GAAA,CACGyhJ,qBAAAz9I,IACF,MAMD09I,GAAmB95I,GAAA5H,GAAA,CACnBmJ,UAAAhF,KACCqmD,qBAAAxmD,IAAA,IAMD29I,GAA6B/5I,GAAAyqH,MAC7BuvB,GAAc5hJ,GAAA,CACd6H,KAAA7D,KACA69I,gBAAkB79I,KAClB89I,SAAA99I,KACC+9I,iBAAA/9I,IAAA,GAK+Dg+I,GAAA16I,GAAAtJ,GAAA4jJ,KAMhEK,GAAqBr6I,GAAA7D,GAAA/D,GAAA,CACrB0wI,cAAA1wI,GAAA,CACGyhJ,qBAAAz9I,IACF,OAKmDk+I,GAAA56I,GAAAnD,MAKCg+I,GAAA76I,GAAAnD,MAkHrDi+I,GAAApiJ,GAAA,CACA8H,IAAAuxI,GACApyI,KAAAjJ,GAAamG,MACZ0F,UAAA1F,IAAA,GAUDk+I,GAAAriJ,GAAA,CACAqB,OAAA02I,GAAsBqK,IACrBrF,aAAA/4I,IAAA,GAqDD42I,GAAyB,CACzB,uCAMA,OAAAtmC,GAOAj1G,YAAA2rF,CAAA,CAAAs3D,CAAA,MAgGAC,EACAtI,EACA39H,EACA69H,EACAC,EACAC,CAnGA,MAAAmI,WAAA,QAEA,KAAAC,iCAAA,QAEA,KAAAxO,YAAA,QAEA,KAAAyO,cAAA,QAEA,KAAAC,UAAA,QAEA,KAAA77I,WAAA,QAEA,KAAA87I,gBAAA,QAEA,KAAAC,aAAA,QAEA,KAAAC,sBAAA,IAEA,KAAAC,sBAAA,MAEA,KAAAC,wBAAA,MAQA,KAAAC,uBAAA,GAEA,KAAAC,wBAAA,IAEA,KAAAC,iBAAA,IAEA,KAAAC,cAAA,EACA35F,gBAAA,KACA45F,UAAA,EACAC,sBAAA,GACAC,oBAAA,IAGA,KAAAC,yBAAA,GAEA,KAAAC,mDAAA,IAEA,KAAAC,uCAAA,IAEA,KAAAC,uCAAA,IAEA,KAAAC,4CAAA,IAEA,KAAAC,oBAAA,IAeA,KAAAC,+BAAA,KAAAphJ,IAIA,KAAAqhJ,cAAA,OACA,IAAAC,EAAA,GACA,aAAApM,GAAA,CACA,IACAzyI,WAAAA,CAAA,CACUmB,OAAAA,CAAA,CACV,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACA49I,EAAApP,GAAAluI,GAaA,OAZAo9I,CAAA,CAAAE,EAAA,CAAAF,CAAA,CAAAE,EAAA,aACA,IACA,IAAAr9I,EAA8B,WAAAC,WAAA,kBAAgCF,GAC9DG,EAAA9D,GAAA4D,EAAAS,GAAAtD,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,2CAEY,OAAAyD,EAAA1F,MAAA,QACZ,CACA,OAAA2iJ,CAAA,CAAAE,EAAA,CAEA,KACA,MAAAF,CAAA,CAAAE,EAAA,CAEA,KAOA5B,GAAA,iBAAAA,EACM,KAAAE,WAAA,CAAAF,EACNA,IACA,KAAAE,WAAA,CAAAF,EAAAn9I,UAAA,CACA,KAAAs9I,iCAAA,CAAAH,EAAA6B,gCAAA,CACA5B,EAAAD,EAAAC,UAAA,CACAtI,EAAAqI,EAAArI,WAAA,CACA39H,EAAAgmI,EAAAhmI,KAAA,CACA69H,EAAAmI,EAAAnI,eAAA,CACAC,EAAAkI,EAAAlI,uBAAA,CACAC,EAAAiI,EAAAjI,SAAA,EAEA,KAAApG,YAAA,CAAAwD,GAAAzsD,GACA,KAAA03D,cAAA,CAAAH,GAAAvL,GAAAhsD,GACA,KAAA23D,UAAA,CAAA3I,GAAAhvD,EAAAivD,EAAA39H,EAAA69H,EAAAC,EAAAC,GACA,KAAAvzI,WAAA,CAAAi0I,GAAA,KAAA4H,UAAA,EACA,KAAAC,gBAAA,CAAA3H,GAAA,KAAA0H,UAAA,EACA,KAAAE,aAAA,KAAA1M,GAAA,KAAAuM,cAAA,EACA5uB,YAAA,GACKK,eAAA3zB,GACL,GACA,KAAAqiD,aAAA,CAAA3nF,EAAA,aAAAkpF,SAAA,CAAApqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,cAAAmpF,UAAA,CAAArqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,cAAAopF,UAAA,CAAAtqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,4BAAAqpF,wBAAA,CAAAvqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,4BAAAspF,+BAAA,CAAAxqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,yBAAAupF,qBAAA,CAAAzqI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,iCAAAwpF,4BAAA,CAAA1qI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,8BAAAypF,0BAAA,CAAA3qI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,yBAAA0pF,qBAAA,CAAA5qI,IAAA,QACA,KAAA6oI,aAAA,CAAA3nF,EAAA,yBAAA2pF,qBAAA,CAAA7qI,IAAA,QAMA,IAAA7U,YAAA,CACA,YAAAq9I,WAAA,CAMA,IAAAsC,aAAA,CACA,YAAA7Q,YAAA,CAMA,MAAA8Q,qBAAA9lJ,CAAA,CAAA24I,CAAA,EAEA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAhlJ,EAAAyH,QAAA,IAAAvB,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,cAAoCF,GAC1DG,EAAA9D,GAAA4D,EAAAe,GAAA5D,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,8BAAArE,EAAAyH,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAMA,MAAA2jJ,WAAA/lJ,CAAA,CAAA24I,CAAA,EACA,kBAAAmN,oBAAA,CAAA9lJ,EAAA24I,GAAAv3H,IAAA,CAAA7f,GAAAA,EAAAV,KAAA,EAAAi+D,KAAA,CAAAt5D,GAAA,CACK,gDAAAxF,EAAAyH,QAAA,QAAAjC,EAAA,EACL,CAMA,MAAAwgJ,aAAAp9I,CAAA,EACA,IAAAhB,EAAsB,WAAAC,WAAA,gBAAmC,CAAAe,EAAM,EAC/Dd,EAAA9D,GAAA4D,EAAAS,GAAAvD,GAAAC,QACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,sCAAAuE,EAAA,GAEA,OAAAd,EAAA1F,MAAA,CAOA,MAAA6jJ,sBAAA,CACA,IAAAr+I,EAAsB,WAAAC,WAAA,qBAAgC,IACtDC,EAAA9D,GAAA4D,EAAAS,GAAAtD,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,sCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA8jJ,wBAAA,CACA,IAAAt+I,EAAsB,WAAAC,WAAA,8BACtBC,EAAA9D,GAAA4D,EAAA20I,IACA,aAAAz0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,wCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA+jJ,UAAA9+I,CAAA,EACA,IAAA++I,EAAA,GAEAA,EADA,iBAAA/+I,EACA,CACAnB,WAAAmB,CACM,EACNA,EACA,CACA,GAAAA,CAAA,CACAnB,WAAAmB,GAAAA,EAAAnB,UAAA,OAAAA,UAAA,EAGA,CACAA,WAAA,KAAAA,UAAA,EAGA,IAAA0B,EAAsB,WAAAC,WAAA,cAAAu+I,EAAA,EACtBt+I,EAAA9D,GAAA4D,EAAA40I,IACA,aAAA10I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,yBAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAikJ,eAAAC,CAAA,CAAApgJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAAsB,EAAA7+I,QAAA,IAAAvB,GACA0B,EAAsB,WAAAC,WAAA,kBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAe,GAAAi0I,KACA,aAAA90I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAmkJ,uBAAAC,CAAA,CAAAtgJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAAwB,EAAA/+I,QAAA,IAAAvB,GACA0B,EAAsB,WAAAC,WAAA,0BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAe,GAAAi0I,KACA,aAAA90I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,wCAEA,OAAAyD,EAAA1F,MAAA,CAQA,MAAAqkJ,wBAAA1jG,CAAA,CAAAt6B,CAAA,CAAAkwH,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACA73E,EAAA,CAAA/d,EAAAt7C,QAAA,IACA,SAAAghB,EACAq4C,EAAAnjE,IAAA,EACOinD,KAAAn8B,EAAAm8B,IAAA,CAAAn9C,QAAA,EACD,GAENq5D,EAAAnjE,IAAA,EACOu/C,UAAAz0B,EAAAy0B,SAAA,CAAAz1C,QAAA,EACP,GAEA,IAAAE,EAAA,KAAAq9I,UAAA,CAAAlkF,EAAA56D,EAAA,SAAAmB,GACAO,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAm1I,IACA,aAAAj1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kDAAA0+C,EAAAt7C,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAQA,MAAAskJ,8BAAA3jG,CAAA,CAAAt6B,CAAA,CAAAviB,CAAA,EACA,IAAA46D,EAAA,CAAA/d,EAAAt7C,QAAA,IACA,SAAAghB,EACAq4C,EAAAnjE,IAAA,EACOinD,KAAAn8B,EAAAm8B,IAAA,CAAAn9C,QAAA,EACD,GAENq5D,EAAAnjE,IAAA,EACOu/C,UAAAz0B,EAAAy0B,SAAA,CAAAz1C,QAAA,EACP,GAEA,IAAAE,EAAA,KAAAq9I,UAAA,CAAAlkF,EAAA56D,EAAA,cACA0B,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAq1I,IACA,aAAAn1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kDAAA0+C,EAAAt7C,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAMA,MAAAukJ,mBAAAt/I,CAAA,EACA,IAAA4tB,EAAA,CACA,GAAA5tB,CAAA,CACAnB,WAAAmB,GAAAA,EAAAnB,UAAA,OAAAA,UAAA,EAEAyB,EAAAstB,EAAAxM,MAAA,EAAAwM,EAAA/uB,UAAA,EAAA+uB,EAAA,IACArtB,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAs1I,IACA,aAAAp1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAEA,OAAAyD,EAAA1F,MAAA,CAOA,MAAAwkJ,wBAAAC,CAAA,CAAA3gJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAA6B,EAAAp/I,QAAA,IAAAvB,GACA0B,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAk1I,IACA,aAAAh1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,yCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAs2E,yBAAA14E,CAAA,CAAA24I,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAhlJ,EAAAyH,QAAA,IAAAvB,EAAA,SAAAmB,GACAO,EAAsB,WAAAC,WAAA,kBAAoCF,GAC1DG,EAAA9D,GAAA4D,EAAAe,GAAA7D,GAAAq4I,MACA,aAAAr1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,qCAAArE,EAAAyH,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAMA,MAAA0kJ,qBAAA9mJ,CAAA,CAAA24I,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAhlJ,EAAAyH,QAAA,IAAAvB,EAAA,aAAAmB,GACAO,EAAsB,WAAAC,WAAA,kBAAoCF,GAC1DG,EAAA9D,GAAA4D,EAAAe,GAAA7D,GAAAw4I,MACA,aAAAx1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,qCAAArE,EAAAyH,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAMA,MAAAqjD,eAAAzlD,CAAA,CAAA24I,CAAA,EACA,IACA,IAAA7wI,EAAA,WAAA4wE,wBAAA,CAAA14E,EAAA24I,GACM,OAAA7wI,EAAAjH,KAAA,CACN,MAAA2E,EAAA,CACA,gDAAAxF,EAAAyH,QAAA,QAAAjC,EAAA,CACA,CAMA,MAAA4/C,0BAAAp/C,CAAA,CAAA+gJ,CAAA,EACA,IACA7gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAqO,GACA5hJ,EAAAa,EAAA1G,GAAA,CAAAwB,GAAAA,EAAA2G,QAAA,IACAE,EAAA,KAAAq9I,UAAA,EAAA7/I,EAAA,CAAAe,EAAA,aAAAmB,GACAO,EAAsB,WAAAC,WAAA,uBAA0CF,GAChEG,EAAA9D,GAAA4D,EAAAe,GAAA5J,GAAA+F,GAAAw4I,OACA,aAAAx1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,oCAAAc,EAAA,GAEA,OAAA2C,EAAA1F,MAAA,CAMA,MAAAgE,kCAAAJ,CAAA,CAAA2yI,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAxzI,EAAAa,EAAA1G,GAAA,CAAAwB,GAAAA,EAAA2G,QAAA,IACAE,EAAA,KAAAq9I,UAAA,EAAA7/I,EAAA,CAAAe,EAAA,SAAAmB,GACAO,EAAsB,WAAAC,WAAA,uBAA0CF,GAChEG,EAAA9D,GAAA4D,EAAAe,GAAA5J,GAAA+F,GAAAq4I,OACA,aAAAr1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,oCAAAc,EAAA,GAEA,OAAA2C,EAAA1F,MAAA,CAMA,MAAAwhD,wBAAA59C,CAAA,CAAA2yI,CAAA,EACA,IAAA7wI,EAAA,WAAA1B,iCAAA,CAAAJ,EAAA2yI,GACA,OAAA7wI,EAAAjH,KAAA,CAQA,MAAAmmJ,mBAAAhnJ,CAAA,CAAA24I,CAAA,CAAAlC,CAAA,EACA,IACAvwI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAhlJ,EAAAyH,QAAA,IAAAvB,EAAAhE,KAAAA,EAAA,CACA,GAAAmF,CAAA,CACKovI,MAAAA,IAAA,EAAAA,EAAAA,EAAApvI,GAAAovI,KAAA,GAEL7uI,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAS,GAAAm1I,KACA,aAAA11I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAAArE,EAAAyH,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAYA,MAAAg9D,mBAAAliB,CAAA,CAAA+pG,CAAA,EACA,IACA/gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAuO,GACA,CACA3/I,SAAAA,CAAA,CACM,GAAA4/I,EACN,CAAA7/I,GAAA,GACAM,EAAA,KAAAq9I,UAAA,EAAA9nG,EAAAz1C,QAAA,IAAAvB,EAAAoB,GAAA,SAAA4/I,GACAt/I,EAAA,MAA4B,KAAAC,WAAA,sBAAAF,GAC5Bw/I,EAAApoJ,GAAAq+I,IACAt1I,EAAAo/I,CAAA,IAAAA,EAAAE,WAAA,CAAApjJ,GAAA4D,EAAAe,GAAAw+I,IAAAnjJ,GAAA4D,EAAAS,GAAA8+I,GAAA,CACA,aAAAr/I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,4CAAA64C,EAAAz1C,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAQA,MAAAilJ,yBAAAnqG,CAAA,CAAA+pG,CAAA,EACA,IACA/gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAuO,GACAt/I,EAAA,KAAAq9I,UAAA,EAAA9nG,EAAAz1C,QAAA,IAAAvB,EAAA,aAAAmB,GACAO,EAAsB,WAAAC,WAAA,sBAA+BF,GACrDG,EAAA9D,GAAA4D,EAAAS,GAAAtJ,GAAAw+I,MACA,aAAAz1I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,4CAAA64C,EAAAz1C,QAAA,MAEA,OAAAK,EAAA1F,MAAA,CAOA,MAAAgK,mBAAAk7I,CAAA,CAAAphJ,CAAA,MACAqhJ,EAUAC,EATA,oBAAAF,EACMC,EAAAD,MACN,CACA,IAAAjgJ,EAAAigJ,EACA,GAAAjgJ,EAAA4pI,WAAA,EAAArtH,QACA,OAAAvE,QAAAC,MAAA,CAAAjY,EAAA4pI,WAAA,CAAAllF,MAAA,CACA,CACAw7F,EAAAlgJ,EAAAuD,SAAA,CACA,GAEA,CACM48I,EAAA50B,KAAA17G,MAAA,CAAAqwI,EACN,OAAA1+I,EAAA,CACA,iDAAA0+I,EAAA,OAGA,CADA3hB,GAAA4hB,KAAAA,EAAAnoJ,MAAA,iCACA,iBAAAioJ,GACA,WAAAG,4CAAA,EACAvhJ,WAAAA,GAAA,KAAAA,UAAA,CACO0E,UAAA28I,CACD,GACN,yBAAAD,EACA,WAAAI,oDAAA,EACAxhJ,WAAAA,GAAA,KAAAA,UAAA,CACOohJ,SAAAA,CACD,GAEN,WAAAK,2CAAA,EACAzhJ,WAAAA,GAAA,KAAAA,UAAA,CACOohJ,SAAAA,CACP,EACA,CAEAM,uBAAAxlI,CAAA,EACA,WAAA/C,QAAA,CAAA9f,EAAA+f,IAAA,CACA,MAAA8C,IAGAA,EAAAwB,OAAA,CACQtE,EAAA8C,EAAA2pC,MAAA,EAER3pC,EAAAsC,gBAAA,cACSpF,EAAA8C,EAAA2pC,MAAA,CACT,GAEA,EACA,CACA87F,kCAAA,CACA3hJ,WAAAA,CAAA,CACG0E,UAAAA,CAAA,CACH,MACAk9I,EACAC,EACA,IAAA/lJ,EAAA,GACAgmJ,EAAA,IAAA3oI,QAAA,CAAAI,EAAAH,IAAA,CACA,IACAwoI,EAAA,KAAAG,WAAA,CAAAr9I,EAAA,CAAAxI,EAAAC,IAAA,CACAylJ,EAAA5lJ,KAAAA,EACA,IAAAmhB,EAAA,CACAhhB,QAAAA,EACAxB,MAAAuB,CACA,EACAqd,EAAA,CACAyoI,OAAAtwC,GAAAuwC,SAAA,CACW9kI,SAAAA,CACF,EACT,EAAAnd,GACA,IAAAkiJ,EAAA,IAAA/oI,QAAAgpI,GAAA,CACAP,IAAA,EAAAA,EACYO,IAEZN,EAAA,KAAAO,0BAAA,CAAAR,EAAAS,GAAA,CACA,eAAAA,GACAF,GAEA,EAEA,GACA,WAEA,GADA,MAAAD,EACApmJ,EAAA,OACA,IAAAqhB,EAAA,WAAAmlI,kBAAA,CAAA59I,GACA,GAAA5I,GACAqhB,IAAA,EAAAA,EADA,OAIA,IACAhhB,QAAAA,CAAA,CACYxB,MAAAA,CAAA,CACZ,CAAAwiB,EACA,GAAAxiB,IAAA,EAAAA,GAGA,GAAAA,GAAAgI,IACYyW,EAAAze,EAAAgI,GAAA,MACZ,CACA,OAAA3C,GACA,gBACA,aACA,mBAEA,GAAArF,cAAAA,EAAAg/I,kBAAA,CACA,MACA,CACA,UAEA,YACA,UACA,WAEA,GAAAh/I,cAAAA,EAAAg/I,kBAAA,EAAAh/I,cAAAA,EAAAg/I,kBAAA,CACA,MACA,CAOA79I,EAAA,GACAyd,EAAA,CACAyoI,OAAAtwC,GAAAuwC,SAAA,CACA9kI,SAAA,CACAhhB,QAAAA,EACAxB,MAAAA,CACa,CACb,EACS,EAnCT,CAoCQ,GACR,OAAAgI,EAAA,CACAyW,EAAAzW,EACK,CACL,GACA4/I,EAAA,KACAV,IACAA,IACAA,EAAA7lJ,KAAAA,GAEA,MAAA4lJ,IACA,KAAAY,uBAAA,CAAAZ,GACAA,EAAA5lJ,KAAAA,EAEA,EACA,OACAumJ,kBAAAA,EACAT,oBAAAA,CACA,CACA,CACA,MAAAN,qDAAA,CACAxhJ,WAAAA,CAAA,CACAohJ,SAAA,CACArW,YAAAA,CAAA,CACA1lF,qBAAAA,CAAA,CACA3gD,UAAAA,CAAA,CACG,CACH,EACA,IAgCAxI,EAhCAJ,EAAA,GACA2mJ,EAAA,IAAAtpI,QAAAI,GAAA,CACA,IAAAmpI,EAAA,UACA,IACA,IAAA5O,EAAA,WAAA8K,cAAA,CAAA5+I,GACU,OAAA8zI,CACV,OAAA/gF,EAAA,CACA,SACA,CACA,EACA,WACA,IAAA4vF,EAAA,MAAAD,IACA,IAAA5mJ,GACA,KAAA6mJ,GAAAt9F,GAEA,GADA,MAAA40B,GAAA,KACAn+E,IACA6mJ,EAAA,MAAAD,IACA5mJ,GAFA,OAIAyd,EAAA,CACSyoI,OAAAtwC,GAAAkxC,oBAAA,GART,CAUK,GACL,GACA,CACAL,kBAAAA,CAAA,CACMT,oBAAAA,CAAA,CACN,MAAAH,iCAAA,EACA3hJ,WAAAA,EACK0E,UAAAA,CACL,GACAm+I,EAAA,KAAAnB,sBAAA,CAAA3W,GAEA,IACA,IAAA+X,EAAA,MAAA3pI,QAAA4pI,IAAA,EAAAF,EAAAf,EAAAW,EAAA,EACA,GAAAK,EAAAd,MAAA,GAAAtwC,GAAAuwC,SAAA,CACQ/lJ,EAAA4mJ,EAAA3lI,QAAA,MAER,UAAAm0F,GAAA5sG,EAAA,QAEA,CACA5I,EAAA,GACAymJ,GACA,CACA,OAAArmJ,CACA,CACA,MAAAulJ,4CAAA,CACAzhJ,WAAAA,CAAA,CACAohJ,SAAA,CACArW,YAAAA,CAAA,CACA3E,eAAAA,CAAA,CACA4E,mBAAAA,CAAA,CACAC,WAAAA,CAAA,CACAvmI,UAAAA,CAAA,CACG,CACH,EACA,IAgDAxI,EAhDAJ,EAAA,GACA2mJ,EAAA,IAAAtpI,QAAAI,GAAA,CACA,IAAAypI,EAAA/X,EACAgY,EAAA,KACAC,EAAA,UACA,IACA,IACA/mJ,QAAAA,CAAA,CACYxB,MAAA8wI,CAAA,CACZ,YAAA0X,kBAAA,CAAAnY,EAAA,CACAhrI,WAAAA,EACWomI,eAAAA,CACX,GAEU,OADV6c,EAAA9mJ,EAAAuG,IAAA,CACU+oI,GAAArlH,KACV,OAAA9mB,EAAA,CAGA,OAAA0jJ,CACA,CACA,EACA,WAEA,GADAA,EAAA,MAAAE,KACApnJ,EACA,OACA,CACA,GAAAmvI,IAAA+X,EAAA,CACAzpI,EAAA,CACAyoI,OAAAtwC,GAAA0xC,aAAA,CACaC,2BAAAJ,CACb,GACA,MACA,IACA,MAAAhpE,GAAA,KACAn+E,IACAknJ,EAAA,MAAAE,IACApnJ,GAFA,OAXA,CAeK,GACL,GACA,CACAymJ,kBAAAA,CAAA,CACMT,oBAAAA,CAAA,CACN,MAAAH,iCAAA,EACA3hJ,WAAAA,EACK0E,UAAAA,CACL,GACAm+I,EAAA,KAAAnB,sBAAA,CAAA3W,GAEA,IACA,IAAA+X,EAAA,MAAA3pI,QAAA4pI,IAAA,EAAAF,EAAAf,EAAAW,EAAA,EACA,GAAAK,EAAAd,MAAA,GAAAtwC,GAAAuwC,SAAA,CACQ/lJ,EAAA4mJ,EAAA3lI,QAAA,KACR,CAEA,IAAAmmI,EACA,OACA,CACA,IAAAr9I,EAAA,WAAAq8I,kBAAA,CAAA59I,GACA,GAAAuB,IAAA,EAAAA,EACA,MAEA,GAAAA,EAAA9J,OAAA,CAAAuG,IAAA,CAAAogJ,CAAAA,EAAAO,0BAAA,EAAAjd,CAAA,GACA,MAAAnsD,GAAA,KACA,SACA,EACAh0E,EACA,MAEA,GAAAq9I,GAAA3oJ,MAAA,CACA,IAAA4oJ,EAAAvjJ,GAAA,YACA,CACY25I,mBAAAA,CAAA,CACZ,CAAA2J,EAAA3oJ,KAAA,CACA,OAAA4oJ,GACA,gBACA,aACA,GAAA5J,cAAAA,GAAAA,cAAAA,GAAAA,cAAAA,EACA,UAAApoC,GAAA7sG,EAAA,CAEA,UACA,YACA,aACA,mBACA,GAAAi1I,cAAAA,GAAAA,cAAAA,EACA,UAAApoC,GAAA7sG,EAAA,CAEA,UACA,YACA,UACA,WACA,GAAAi1I,cAAAA,EACA,UAAApoC,GAAA7sG,EAAA,CAEA,kBAIArL,EAAAA,EAAAkqJ,CACA,CACArnJ,EAAA,CACAC,QAAAmnJ,EAAAnnJ,OAAA,CACAxB,MAAA,CACAgI,IAAA2gJ,EAAA3oJ,KAAA,CAAAgI,GAAA,CAEU,CACV,MACA,UAAA4uG,GAAA7sG,EAAA,CAEM,QACN,CACA5I,EAAA,GACAymJ,GACA,CACA,OAAArmJ,CACA,CACA,MAAAqlJ,6CAAA,CACAvhJ,WAAAA,CAAA,CACG0E,UAAAA,CAAA,CACH,MACA8+I,EA0BAtnJ,EAzBA,IAAAumJ,EAAA,IAAAtpI,QAAAI,GAAA,CACA,IAAAkqI,EAAA,KAAAnG,iCAAA,MACA,OAAAt9I,GACA,gBACA,aACA,aACA,gBACA,mBAEAyjJ,EAAA,KAAAnG,iCAAA,KAGA,CACAkG,EAAAjoE,WAAA,IAAAhiE,EAAA,CACAyoI,OAAAtwC,GAAAgyC,SAAA,CACOD,UAAAA,CACF,GAAAA,EACL,GACA,CACAlB,kBAAAA,CAAA,CACMT,oBAAAA,CAAA,CACN,MAAAH,iCAAA,EACA3hJ,WAAAA,EACK0E,UAAAA,CACL,GAEA,IACA,IAAAo+I,EAAA,MAAA3pI,QAAA4pI,IAAA,EAAAjB,EAAAW,EAAA,EACA,GAAAK,EAAAd,MAAA,GAAAtwC,GAAAuwC,SAAA,CACQ/lJ,EAAA4mJ,EAAA3lI,QAAA,MAER,UAAAq0F,GAAA9sG,EAAAo+I,EAAAW,SAAA,aAEA,CACAxzB,aAAAuzB,GACAjB,GACA,CACA,OAAArmJ,CAAA,CAMA,MAAAynJ,iBAAA,CACA,IAAAjiJ,EAAsB,WAAAC,WAAA,mBAA+B,IACrDC,EAAA9D,GAAA4D,EAAAS,GAAAtJ,GAAA8/I,MACA,aAAA/2I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,gCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA0nJ,gBAAA5jJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,IAAA9+I,GACA0B,EAAsB,WAAAC,WAAA,mBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA43I,IACA,aAAA13I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,gCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAizI,QAAAsD,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,WAAgCF,GACtDG,EAAA9D,GAAA4D,EAAAS,GAAAtD,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,uBAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA2nJ,cAAApR,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,iBAAgCF,GACtDG,EAAA9D,GAAA4D,EAAAS,GAAAnD,OACA,aAAA4C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,8BAEA,OAAAyD,EAAA1F,MAAA,CASA,MAAA4nJ,eAAAC,CAAA,CAAAhzE,CAAA,EACA,IAAAtvE,EAAA,CAAAsiJ,EAAAhzE,EAAA,CACArvE,EAAsB,WAAAC,WAAA,kBAA+BF,GACrDG,EAAA9D,GAAA4D,EAAAS,GAAAtJ,GAAAs5I,MACA,aAAAvwI,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAomJ,mBAAA59I,CAAA,CAAAvD,CAAA,EACA,IACAhF,QAAAA,CAAA,CACMxB,MAAA6W,CAAA,CACF,YAAAwyI,oBAAM,EAAAt/I,EAAA,CAAAvD,GACVu+H,GAAAluH,IAAAA,EAAArY,MAAA,EACA,IAAAwB,EAAA6W,CAAA,IACA,OACArV,QAAAA,EACAxB,MAAAA,CACA,EAMA,MAAAqpJ,qBAAAx/I,CAAA,CAAArD,CAAA,EACA,IAAAk2B,EAAA,CAAA7yB,EAAA,CACArD,GACAk2B,EAAA5/B,IAAA,CAAA0J,GAEA,IAAAO,EAAsB,WAAAC,WAAA,wBAAA01B,GACtBz1B,EAAA9D,GAAA4D,EAAAk4I,IACA,aAAAh4I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA+nJ,oBAAAxR,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,uBAAgCF,GACtDG,EAAA9D,GAAA4D,EAAAS,GAAAtD,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,oCAEA,OAAAyD,EAAA1F,MAAA,CAQA,MAAAgoJ,eAAAlkJ,CAAA,EACA,IAAA9D,EAAA,WAAA+jJ,SAAA,EACAjgJ,WAAAA,EACKmkJ,kCAAA,EACL,GACA,OAAAjoJ,EAAAvB,KAAA,CAAA+4I,KAAA,CAMA,MAAA0Q,qBAAApkJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,IAAA9+I,GACA0B,EAAsB,WAAAC,WAAA,wBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAq0I,IACA,aAAAn0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,4BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAmoJ,mBAAAhjJ,CAAA,CAAAkvI,CAAA,CAAAkC,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAz9I,EAAAjI,GAAA,CAAAwlD,GAAAA,EAAAr9C,QAAA,KAAAvB,EAAAhE,KAAAA,EAAA,CACA,GAAAmF,CAAA,CACKovI,MAAAA,IAAA,EAAAA,EAAAA,EAAApvI,GAAAovI,KAAA,GAEL7uI,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAyxI,IACA,aAAAvxI,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAooJ,kBAAA,CACA,IAAA5iJ,EAAsB,WAAAC,WAAA,wBACtBC,EAAA9D,GAAA4D,EAAAs0I,IACA,aAAAp0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,iCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAqoJ,aAAA9R,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,gBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAw0I,IACA,aAAAt0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,6BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAsoJ,kBAAA,CACA,IAAA9iJ,EAAsB,WAAAC,WAAA,wBACtBC,EAAA9D,GAAA4D,EAAAy0I,IACA,aAAAv0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,iCAEA,IAAAsmJ,EAAA7iJ,EAAA1F,MAAA,CACA,WAAAozG,GAAAm1C,EAAAzU,aAAA,CAAAyU,EAAAxU,wBAAA,CAAAwU,EAAAvU,MAAA,CAAAuU,EAAAtU,gBAAA,CAAAsU,EAAArU,eAAA,EAOA,MAAAsU,mBAAA,CACA,IAAAhjJ,EAAsB,WAAAC,WAAA,yBACtBC,EAAA9D,GAAA4D,EAAA00I,IACA,aAAAx0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kCAEA,OAAAyD,EAAA1F,MAAA,CAOA,MAAAq9D,kCAAA0pE,CAAA,CAAAjjI,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAA7b,EAAA,CAAAjjI,GACA0B,EAAsB,WAAAC,WAAA,qCAAAF,GACtBG,EAAA9D,GAAA4D,EAAAm4I,UACA,UAAAj4I,GACAK,QAAAo3D,IAAA,uDACA,GAEAz3D,EAAA1F,MAAA,CASA,MAAAyoJ,6BAAA3kJ,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,IAAA9+I,GACA0B,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA26I,IACA,aAAAz6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAEA,OAAAyD,EAAA1F,MAAA,CAOA,MAAA0oJ,4BAAA7zE,CAAA,EACA,IAAArvE,EAAsB,WAAAC,WAAA,+BAAAovE,EAAA,CAAAA,EAAA,KACtBnvE,EAAA9D,GAAA4D,EAAAm7I,IACA,aAAAj7I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,6CAEA,OAAAyD,EAAA1F,MAAA,CAQA,MAAA2oJ,6BAAA7gJ,CAAA,CAAAhE,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAA96I,EAAA,CAAAhE,GACA0B,EAAsB,WAAAC,WAAA,gCAAAF,GACtBG,EAAA9D,GAAA4D,EAAAo7I,IACA,aAAAl7I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,iCAEA,IACAhC,QAAAA,CAAA,CACMxB,MAAAA,CAAA,CACN,CAAAiH,EAAA1F,MAAA,CACA,OACAC,QAAAA,EACAxB,MAAAA,IAAA,GAAAA,EAAAA,EAAA4wI,aAAA,MACA,CAMA,MAAAjE,iBAAAhtI,CAAA,CAAA0F,CAAA,EACA,IAAA8kJ,EAAA9tI,GAAA1c,EAAAwG,SAAA,IAAAI,QAAA,WACAO,EAAA,KAAAq9I,UAAA,EAAAgG,EAAA,CAAA9kJ,GACA0B,EAAsB,WAAAC,WAAA,oBAAoCF,GAC1DG,EAAA9D,GAAA4D,EAAAe,GAAA7D,GAAAC,QACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kCAEA,GAAAyD,IAAA,GAAAA,EAAA1F,MAAA,CACA,iCAEA,OAAA0F,EAAA1F,MAAA,CAMA,MAAA6oJ,4BAAA5jJ,CAAA,EACA,IAAAhB,EAAAgB,GAAA6jJ,wBAAA5rJ,IAAAwB,GAAAA,EAAA2G,QAAA,IACAE,EAAAtB,GAAAhH,OAAA,CAAAgH,EAAA,IACAuB,EAAsB,WAAAC,WAAA,+BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAu0I,IACA,aAAAr0I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,6CAEA,OAAAyD,EAAA1F,MAAA,CAQA,MAAAqvD,mBAAAvrD,CAAA,EACA,IACA,IAAA4B,EAAA,WAAA+iJ,4BAAA,CAAA3kJ,GACM,OAAA4B,EAAAjH,KAAA,CACN,MAAA2E,EAAA,CACA,+CAAAA,EAAA,CACA,CAOA,MAAAyE,mBAAA0uI,CAAA,EACA,IACA,IAAA7wI,EAAA,WAAAqjJ,4BAAA,CAAAxS,GACM,OAAA7wI,EAAAjH,KAAA,CACN,MAAA2E,EAAA,CACA,+CAAAA,EAAA,CACA,CAOA,MAAA2lJ,6BAAAxS,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA66I,IACA,aAAA36I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mCAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAgpJ,iBAAAlhJ,CAAA,CAAA68I,CAAA,EACA,IACA7gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAqO,GACAp/I,EAAA,KAAAq9I,UAAA,EAAA96I,EAAA,CAAAhE,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,oBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA86I,IACA,aAAA56I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,0CAAA6F,EAAA,aAEA,OAAApC,EAAA1F,MAAA,CAMA,MAAAipJ,YAAA,CACA,IAAAzjJ,EAAsB,WAAAC,WAAA,kBACtBC,EAAA9D,GAAA4D,EAAAS,GAAAkyI,KACA,aAAAzyI,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,0BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAAkpJ,gBAAA,CACA,IAAA1jJ,EAAsB,WAAAC,WAAA,kBAAgC,IACtDC,EAAA9D,GAAA4D,EAAAS,GAAAnD,OACA,aAAA4C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+BAEA,OAAAyD,EAAA1F,MAAA,CAmCA,MAAAmpJ,SAAA3iJ,CAAA,CAAAm+I,CAAA,EACA,IACA7gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAqO,GACAp/I,EAAA,KAAA6jJ,0BAAA,EAAA5iJ,EAAA,CAAA1C,EAAAhE,KAAAA,EAAAmF,GACAO,EAAA,WAAAC,WAAA,YAAAF,GACA,IACA,OAAAN,GAAAokJ,oBACA,eACA,CACA,IAAA3jJ,EAAA9D,GAAA4D,EAAAm6I,IACA,aAAAj6I,EACA,MAAAA,EAAAzD,KAAA,CAEA,OAAAyD,EAAA1F,MAAA,CAEA,WACA,CACA,IAAA0F,EAAA9D,GAAA4D,EAAAk6I,IACA,aAAAh6I,EACA,MAAAA,EAAAzD,KAAA,CAEA,OAAAyD,EAAA1F,MAAA,CAEA,QACA,CACA,IAAA0F,EAAA9D,GAAA4D,EAAA85I,IACA,aAAA55I,EACA,MAAAA,EAAAzD,KAAA,CAEA,IACcjC,OAAAA,CAAA,CACd,CAAA0F,EACA,OAAA1F,EAAA,CACA,GAAAA,CAAA,CACAkpD,aAAAlpD,EAAAkpD,YAAA,CAAAhsD,GAAA,GACAmH,YAAAA,CAAA,CACAwE,KAAAA,CAAA,CACe21D,QAAAA,CAAA,CACf,KACA31D,KAAAA,EACAxE,YAAA,CACA,GAAAA,CAAA,CACiBjG,QAAAu4I,GAAAn4E,EAAAn6D,EAAAjG,OAAA,CACjB,EACeogE,QAAAA,CACD,GACd,OAEM,CACN,OAAAp7D,EAAA,CACA,UAAAyxG,GAAAzxG,EAAA,iCACA,CAYA,MAAAkmJ,eAAA9iJ,CAAA,CAAAm+I,CAAA,EACA,IACA7gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAqO,GACAp/I,EAAA,KAAA6jJ,0BAAA,EAAA5iJ,EAAA,CAAA1C,EAAA,aAAAmB,GACAO,EAAA,WAAAC,WAAA,YAAAF,GACA,IACA,OAAAN,GAAAokJ,oBACA,eACA,CACA,IAAA3jJ,EAAA9D,GAAA4D,EAAAq6I,IACA,aAAAn6I,EACA,MAAAA,EAAAzD,KAAA,CAEA,OAAAyD,EAAA1F,MAAA,CAEA,WACA,CACA,IAAA0F,EAAA9D,GAAA4D,EAAAs6I,IACA,aAAAp6I,EACA,MAAAA,EAAAzD,KAAA,CAEA,OAAAyD,EAAA1F,MAAA,CAEA,QACA,CACA,IAAA0F,EAAA9D,GAAA4D,EAAAo6I,IACA,aAAAl6I,EACA,MAAAA,EAAAzD,KAAA,CAEA,OAAAyD,EAAA1F,MAAA,CAEM,CACN,OAAAoD,EAAA,CACA,UAAAyxG,GAAAzxG,EAAA,uBAEA,CAIA,MAAAmmJ,mBAAA1E,CAAA,MACA2E,EACA1lJ,EACA,oBAAA+gJ,EACM/gJ,EAAA+gJ,OACN,GAAAA,EAAA,CACA,IACA/gJ,WAAAggD,CAAA,CACQ,GAAAzlD,EACR,CAAAwmJ,EACA/gJ,EAAAggD,EACA0lG,EAAAnrJ,CACA,KACAkH,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAA,SAAA0lJ,GACAhkJ,EAAsB,WAAAC,WAAA,sBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA+yI,IACA,aAAA7yI,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+CAEA,OAAAyD,EAAA1F,MAAA,CAoBA,MAAA2I,eAAAH,CAAA,CAAAm8I,CAAA,EACA,IACA7gJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAqO,GACAp/I,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAAhE,KAAAA,EAAAmF,GACAO,EAAsB,WAAAC,WAAA,kBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAy6I,IACA,aAAAv6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,8BAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,QACA,EACA,CACA,GAAAA,CAAA,CACAqE,YAAA,CACA,GAAArE,EAAAqE,WAAA,CACAjG,QAAAu4I,GAAA32I,EAAAw+D,OAAA,CAAAx+D,EAAAqE,WAAA,CAAAjG,OAAA,CACA,CACA,EAPA4B,CAAA,CAaA,MAAAypJ,qBAAAjhJ,CAAA,CAAA+tI,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAA,aAAAmB,GACAO,EAAsB,WAAAC,WAAA,kBAAAF,GACtBG,EAAA9D,GAAA4D,EAAA06I,IACA,aAAAx6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,8BAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA0pJ,sBAAAphJ,CAAA,CAAAiuI,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAjpE,EAAAhlE,EAAApL,GAAA,CAAAsL,GAAA,CACA,IAAAjD,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAA,aAAAmB,GACA,OACA4rE,WAAA,iBACAtrE,KAAAA,CACK,CACL,GACAC,EAAA,WAAA+7I,gBAAA,CAAAj0E,GACA5nE,EAAAF,EAAwBtI,GAAA,CAAAsI,GAAA,CACxB,IAAAE,EAAA9D,GAAA4D,EAAA06I,IACA,aAAAx6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+BAEK,OAAAyD,EAAA1F,MAAA,GAEL,OAAA0F,CAAA,CAyBA,MAAAikJ,gBAAArhJ,CAAA,CAAAiuI,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAjpE,EAAAhlE,EAAApL,GAAA,CAAAsL,GAAA,CACA,IAAAjD,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAAhE,KAAAA,EAAAmF,GACA,OACA4rE,WAAA,iBACAtrE,KAAAA,CACK,CACL,GACAC,EAAA,WAAA+7I,gBAAA,CAAAj0E,GACA5nE,EAAAF,EAAwBtI,GAAA,CAAAsI,GAAA,CACxB,IAAAE,EAAA9D,GAAA4D,EAAAy6I,IACA,aAAAv6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,+BAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,QACA,EACA,CACA,GAAAA,CAAA,CACAqE,YAAA,CACA,GAAArE,EAAAqE,WAAA,CACAjG,QAAAu4I,GAAA32I,EAAAw+D,OAAA,CAAAx+D,EAAAqE,WAAA,CAAAjG,OAAA,CACA,CACK,EAPL4B,CAAA,GASA,OAAA0F,CAAA,CASA,MAAAkkJ,kBAAApjJ,CAAA,CAAA1C,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA5iJ,EAAA,CAAA1C,GACA0B,EAAsB,WAAAC,WAAA,qBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAu6I,IACA,aAAAr6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kCAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,CACA,IAAAA,EACA,+BAAAwG,EAAA,cAEA,IAAA0nG,EAAA,CACA,GAAAluG,CAAA,CACAkpD,aAAAlpD,EAAAkpD,YAAA,CAAAhsD,GAAA,GACAmH,YAAAA,CAAA,CACOwE,KAAAA,CAAA,CACP,IACA,IAAAzK,EAAA,IAAAu1G,GAAAtvG,EAAAjG,OAAA,EACA,OACAyK,KAAAA,EACAxE,YAAA,CACA,GAAAA,CAAA,CACAjG,QAAAA,CACA,CACO,CACP,EACA,EACA,OACA,GAAA8vG,CAAA,CACAhlD,aAAAglD,EAAAhlD,YAAA,CAAAhsD,GAAA,GACAmH,YAAAA,CAAA,CACOwE,KAAAA,CAAA,CACP,GACA,EACAA,KAAAA,EACAxE,YAAAkkD,GAAA2jF,QAAA,CAAA7nI,EAAAjG,OAAA,CAAAiG,EAAAiE,UAAA,CACO,GAEP,EAMA,MAAAuhJ,UAAAhC,CAAA,CAAAiC,CAAA,CAAAhmJ,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,CAAAU,KAAAhqJ,IAAAgqJ,EAAA,CAAAjC,EAAAiC,EAAA,EAAAjC,EAAA,CAAA/jJ,GACA0B,EAAsB,WAAAC,WAAA,aAAgCF,GACtDG,EAAA9D,GAAA4D,EAAAS,GAAAtJ,GAAAgG,QACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,yBAEA,OAAAyD,EAAA1F,MAAA,CAMA,MAAA+pJ,mBAAAvjJ,CAAA,CAAA1C,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA5iJ,EAAA,CAAA1C,EAAAhE,KAAAA,EAAA,CACAupJ,mBAAA,aACK5J,QAAA,EACL,GACAj6I,EAAsB,WAAAC,WAAA,YAAAF,GACtBG,EAAA9D,GAAA4D,EAAAw6I,IACA,aAAAt6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,wBAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,CACA,IAAAA,EACA,qBAAAwG,EAAA,cAEA,OAAAxG,CAAA,CAQA,MAAAgqJ,4BAAAxjJ,CAAA,CAAA1C,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA5iJ,EAAA,CAAA1C,EAAAhE,KAAAA,EAAA,CACAupJ,mBAAA,aACK5J,QAAA,EACL,GACAj6I,EAAsB,WAAAC,WAAA,qBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAw6I,IACA,aAAAt6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,kCAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,CACA,IAAAA,EACA,+BAAAwG,EAAA,cAEA,OAAAxG,CAAA,CAQA,MAAAiqJ,wBAAAzhJ,CAAA,CAAA1E,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,GACA0B,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAy6I,IACA,aAAAv6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,8BAEA,IAAAjC,EAAA0F,EAAA1F,MAAA,CACA,IAAAA,EAAA,OAAAA,CAAA,CACA,IAAA5B,EAAA,IAAAu1G,GAAA3zG,EAAAqE,WAAA,CAAAjG,OAAA,EACAkK,EAAAtI,EAAAqE,WAAA,CAAAiE,UAAA,CACA,OACA,GAAAtI,CAAA,CACAqE,YAAAkkD,GAAA2jF,QAAA,CAAA9tI,EAAAkK,EACA,EAQA,MAAA4hJ,8BAAA1hJ,CAAA,CAAA1E,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAA,cACA0B,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAA06I,IACA,aAAAx6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,wCAEA,OAAAyD,EAAA1F,MAAA,CAQA,MAAAmqJ,+BAAA7hJ,CAAA,CAAAxE,CAAA,EACA,IAAAwpE,EAAAhlE,EAAApL,GAAA,CAAAsL,GAAA,CACA,IAAAjD,EAAA,KAAA6jJ,0BAAA,EAAA5gJ,EAAA,CAAA1E,EAAA,cACA,OACA+sE,WAAA,0BACAtrE,KAAAA,CACK,CACL,GACAC,EAAA,WAAA+7I,gBAAA,CAAAj0E,GACA5nE,EAAAF,EAAwBtI,GAAA,CAAAsI,GAAA,CACxB,IAAAE,EAAA9D,GAAA4D,EAAA06I,IACA,aAAAx6I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,yCAEK,OAAAyD,EAAA1F,MAAA,GAEL,OAAA0F,CAAA,CAaA,MAAA0kJ,iCAAA9uG,CAAA,CAAAusG,CAAA,CAAAiC,CAAA,EACA,IAAAzpJ,EAAA,GACAgqJ,EAAA,WAAAvG,sBAAA,GACA,KAEA,CAFA,WAAAzjJ,CAAA,IAEAwnJ,CAAAA,EAAAA,GAAA,KAAAA,CAAAA,EAAAwC,CAAA,GAGA,IACA,IAAAn8C,EAAA,WAAA87C,2BAAA,CAAAnC,EAAA,YACA35C,CAAAA,EAAA5lG,UAAA,CAAArL,MAAA,IACAoD,CAAAA,EAAAiqJ,KAAA,CAAAp8C,EAAA5lG,UAAA,CAAA4lG,EAAA5lG,UAAA,CAAArL,MAAA,IAAA+H,QAAA,GAEA,OAAAyB,EAAA,CACA,GAAAA,aAAAgD,OAAAhD,EAAArI,OAAA,CAAAqyD,QAAA,YACU,eAEVhqD,CAAA,CAIA,IAAA8jJ,EAAA,WAAAtX,OAAA,cACA,KAEA,CAFA,YAAA5yI,CAAA,IAEAypJ,CAAAA,EAAAA,EAAAS,CAAA,GAGA,IACA,IAAAr8C,EAAA,WAAA87C,2BAAA,CAAAF,EACA57C,CAAAA,EAAA5lG,UAAA,CAAArL,MAAA,IACAoD,CAAAA,EAAAoqB,MAAA,CAAAyjF,EAAA5lG,UAAA,CAAA4lG,EAAA5lG,UAAA,CAAArL,MAAA,IAAA+H,QAAA,GAEA,OAAAyB,EAAA,CACA,GAAAA,aAAAgD,OAAAhD,EAAArI,OAAA,CAAAqyD,QAAA,YACU,eAEVhqD,CAAA,CAIA,IAAA+jJ,EAAA,WAAAC,iCAAA,CAAAnvG,EAAAj7C,GACA,OAAAmqJ,EAAAttJ,GAAA,CAAA0jC,GAAAA,EAAAp4B,SAAA,EASA,MAAAiiJ,kCAAAnvG,CAAA,CAAAj7C,CAAA,CAAAyD,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA9tG,EAAAj2C,QAAA,IAAAvB,EAAAhE,KAAAA,EAAAO,GACAmF,EAAsB,WAAAC,WAAA,qCAAAF,GACtBG,EAAA9D,GAAA4D,EAAA81I,IACA,aAAA51I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,mDAEA,OAAAyD,EAAA1F,MAAA,CAWA,MAAA0qJ,wBAAApvG,CAAA,CAAAj7C,CAAA,CAAAyD,CAAA,EACA,IAAAyB,EAAA,KAAA6jJ,0BAAA,EAAA9tG,EAAAj2C,QAAA,IAAAvB,EAAAhE,KAAAA,EAAAO,GACAmF,EAAsB,WAAAC,WAAA,2BAAAF,GACtBG,EAAA9D,GAAA4D,EAAAg2I,IACA,aAAA91I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,yCAEA,OAAAyD,EAAA1F,MAAA,CAEA,MAAA2qJ,sBAAAtwE,CAAA,CAAAp1E,CAAA,EACA,IACAhF,QAAAA,CAAA,CACMxB,MAAAmoD,CAAA,CACN,YAAA0vB,wBAAA,CAAA+D,EAAAp1E,GACAxG,EAAA,KAOA,OANA,OAAAmoD,GACAnoD,CAAAA,EAAA,IAAA6zG,GAAA,CACA5zG,IAAA27E,EACOrzB,MAAAsrD,GAAA6uB,WAAA,CAAAv6E,EAAAnpD,IAAA,CACP,IAEA,CACAwC,QAAAA,EACAxB,MAAAA,CACA,EAMA,MAAAwoJ,mBAAA1X,CAAA,CAAAgH,CAAA,EACA,IACAt2I,QAAAA,CAAA,CACMxB,MAAAmoD,CAAA,CACN,YAAA0vB,wBAAA,CAAAi5D,EAAAgH,GACA93I,EAAA,KAIA,OAHA,OAAAmoD,GACAnoD,CAAAA,EAAAq1G,GAAAw7B,eAAA,CAAA1oF,EAAAnpD,IAAA,GAEA,CACAwC,QAAAA,EACAxB,MAAAA,CACA,EAMA,MAAAmsJ,SAAArb,CAAA,CAAAgH,CAAA,EACA,kBAAA0Q,kBAAA,CAAA1X,EAAAgH,GAAAv3H,IAAA,CAAA7f,GAAAA,EAAAV,KAAA,EAAAi+D,KAAA,CAAAt5D,GAAA,CACK,+CAAAmsI,EAAAlqI,QAAA,QAAAjC,EAAA,EACL,CAiBA,MAAA0nF,eAAA/lB,CAAA,CAAAn+D,CAAA,EACA,IAAApB,EAAsB,WAAAC,WAAA,mBAAAs/D,EAAA1/D,QAAA,GAAAuB,EAAA,EACtBlB,EAAA9D,GAAA4D,EAAAq7I,IACA,aAAAn7I,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,eAAA8iE,EAAA1/D,QAAA,aAEA,OAAAK,EAAA1F,MAAA,CAMA,MAAA6qJ,gCAAAC,CAAA,EACA,IAAAA,EAAA,CAEA,UAAAhJ,iBAAA,EACA,MAAA/jE,GAAA,KAEA,IAAAgtE,EAAAvzD,KAAAwzD,GAAA,QAAAjJ,cAAA,CAAAC,SAAA,CACAiJ,EAAAF,GAAAr4C,GACA,eAAAqvC,cAAA,CAAA35F,eAAA,GAAA6iG,EACA,YAAAlJ,cAAA,CAAA35F,eAAA,CAEA,OACA,WAAA8iG,iBAAA,GAMA,MAAAA,mBAAA,CACA,KAAApJ,iBAAA,IACA,IACA,IAAAqJ,EAAA3zD,KAAAwzD,GAAA,GACAI,EAAA,KAAArJ,cAAA,CAAA35F,eAAA,CACAijG,EAA8BD,EAAAA,EAAAtjJ,SAAA,MAC9B,QAAAzF,EAAA,EAAAA,EAAA,GAAAA,IAAA,CACA,IAAA+lD,EAAA,WAAAvgD,kBAAA,cACA,GAAAwjJ,IAAAjjG,EAAAtgD,SAAA,CAOA,OANA,KAAAi6I,cAAA,EACA35F,gBAAAA,EACA45F,UAAAxqD,KAAAwzD,GAAA,GACA/I,sBAAA,GACAC,oBAAA,IAEA95F,CAAA,OAIA21B,GAAAqvD,GAAA,EACA,CACM,sDAAA51C,KAAAwzD,GAAA,GAAAG,EAAA,YACN,CACA,KAAArJ,iBAAA,GACA,EAMA,MAAAwJ,0BAAArmJ,CAAA,EACA,IACAnB,WAAAA,CAAA,CACMmB,OAAA++I,CAAA,CACN,CAAA1N,GAAArxI,GACAM,EAAA,KAAAq9I,UAAA,IAAA9+I,EAAA,SAAAkgJ,GACAx+I,EAAsB,WAAAC,WAAA,6BAA0CF,GAChEG,EAAA9D,GAAA4D,EAAAe,GAAA5D,OACA,aAAA+C,EACA,UAAAmvG,GAAAnvG,EAAAzD,KAAA,2CAEA,OAAAyD,EAAA1F,MAAA,CAmBA,MAAAoE,oBAAAmnJ,CAAA,CAAAC,CAAA,CAAAjnJ,CAAA,MAwBAF,EAvBA,eAAAknJ,EAAA,CACA,IAAAE,EAAAF,EACA1mJ,EAAA4mJ,EAAiC7mJ,SAAA,GACjCG,EAAA8yG,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAvV,GAAAG,QAAA,WACA,GAAAnI,MAAA6D,OAAA,CAAA8qJ,IAAAjnJ,KAAAzE,IAAAyE,EACA,iCAEA,IAAAU,EAAAumJ,GAAA,EACAvmJ,CAAAA,EAAAC,QAAA,UACA,eAAAD,GACAA,CAAAA,EAAAnB,UAAA,MAAAA,UAAA,EAEA0nJ,GAAA,iBAAAA,GAAA,sBAAAA,GACAvmJ,CAAAA,EAAAqzI,iBAAA,CAAAkT,EAAAlT,iBAAA,EAEA,IAAA/yI,EAAA,CAAAR,EAAAE,EAAA,CACAO,EAAwB,WAAAC,WAAA,uBAAAF,GACxBG,EAAA9D,GAAA4D,EAAAG,IACA,aAAAD,EACA,+CAAAA,EAAAzD,KAAA,CAAA7D,OAAA,EAEA,OAAAsH,EAAA1F,MAAA,CACA,GAEAurJ,aAAAhjG,GAAA,CACA,IAAAmjG,EAAAH,CAEAlnJ,CADAA,CAAAA,EAAA,IAAAkkD,EAAA,EACA5gD,QAAA,CAAA+jJ,EAAA/jJ,QAAA,CACAtD,EAAAk3C,YAAA,CAAAgwG,EAAAhwG,YAAA,CACAl3C,EAAAylI,SAAA,CAAA4hB,EAAA5hB,SAAA,CACMzlI,EAAAiE,UAAA,CAAAojJ,EAAApjJ,UAAA,KAINjE,CAFAA,EAAAkkD,GAAA2jF,QAAA,CAAAqf,EAAA,EAEAvhB,QAAA,CAAA3lI,EAAA4lI,KAAA,CAAAnqI,KAAAA,CACA,CACA,GAAA0rJ,KAAA1rJ,IAAA0rJ,GAAA,CAAA3uJ,MAAA6D,OAAA,CAAA8qJ,GACA,iCAEA,IAAAlnJ,EAAAknJ,EACA,GAAAnnJ,EAAAylI,SAAA,EAAAxlI,EACMD,EAAAI,IAAA,IAAAH,OACN,CACA,IAAAwmJ,EAAa,KAAAjJ,wBAAA,CACb,QACA,IAAAz5F,EAAA,WAAAyiG,+BAAA,CAAAC,GAGA,GAFAzmJ,EAAA8kD,oBAAA,CAAAf,EAAAe,oBAAA,CACA9kD,EAAAuD,eAAA,CAAAwgD,EAAAtgD,SAAA,CACA,CAAAxD,EAAA,MAEA,GADAD,EAAAI,IAAA,IAAAH,GACA,CAAAD,EAAAmE,SAAA,CACA,0BAEA,IAAAA,EAAAnE,EAAAmE,SAAA,CAAAxD,QAAA,WACA,QAAA+8I,cAAA,CAAAG,mBAAA,CAAAzxF,QAAA,CAAAjoD,IAAA,KAAAu5I,cAAA,CAAAE,qBAAA,CAAAxxF,QAAA,CAAAjoD,GAUAsiJ,EAAA,OAVA,CAGA,KAAA/I,cAAA,CAAAG,mBAAA,CAAA3mJ,IAAA,CAAAiN,GACU,MAOV,CAEA,KACApK,EAAAiG,EAAAK,QAAA,GACAC,EAAAvG,EAAAwG,SAAA,GACAC,EAAAR,EAAAS,UAAA,CAAAH,GACAI,EAAAF,EAAAG,QAAA,WACAC,EAAA,CACAC,SAAA,SACApB,WAAA,KAAAA,UAAA,EAEA,GAAAS,EAAA,CACA,IAAAY,EAAA,CAAAtI,MAAA6D,OAAA,CAAA6D,GAAAA,EAAAnG,EAAAgH,aAAA,IAAAlI,GAAA,CAAAwB,GAAAA,EAAA2G,QAAA,GACAJ,CAAAA,EAAA,UACAC,SAAA,SACAC,UAAAA,CACA,CACA,IAEAF,CAAAA,EAAAK,SAAA,KAEAkmJ,GAAA,iBAAAA,GAAA,sBAAAA,GACAvmJ,CAAAA,EAAAqzI,iBAAA,CAAAkT,EAAAlT,iBAAA,EAEA,IAAA/yI,EAAA,CAAAR,EAAAE,EAAA,CACAO,EAAsB,WAAAC,WAAA,uBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAG,IACA,aAAAD,EAAA,CACA,IAAAE,EACA,YAAAF,EAAAzD,KAAA,EACA2D,CAAAA,EAAAF,EAAAzD,KAAA,CAAAxE,IAAA,CAAAmI,IAAA,GACA/I,MAAA6D,OAAA,CAAAkF,GAAA,CACA,IAAAC,EAAA,SACAC,EAAAD,EAAAD,EAAApH,IAAA,CAAAqH,GACAE,QAAA9D,KAAA,CAAAyD,EAAAzD,KAAA,CAAA7D,OAAA,CAAA0H,EACA,CACA,MACA,IAAAE,GAAA,CACA24B,OAAA,WACAn2B,UAAA,GACA6kI,mBAAA3nI,EAAAzD,KAAA,CAAA7D,OAAA,CACOwH,KAAAA,CACP,GACA,OACAF,EAAA1F,MAAA,CAmBA,MAAAwpD,gBAAAnlD,CAAA,CAAAsnJ,CAAA,CAAAtrJ,CAAA,EACA,eAAAgE,EAAA,CACA,GAAAsnJ,GAAA9uJ,MAAA6D,OAAA,CAAAirJ,GACA,iCAEA,IAAA9mJ,EAAAR,EAAAO,SAAA,GACA,kBAAAkF,kBAAA,CAAAjF,EAAA8mJ,EACA,IACAA,KAAA7rJ,IAAA6rJ,GAAA,CAAA9uJ,MAAA6D,OAAA,CAAAirJ,GACA,iCAEA,IAAArnJ,EAAAqnJ,EACA,GAAAtnJ,EAAAylI,SAAA,CACMzlI,EAAAI,IAAA,IAAAH,OACN,CACA,IAAAwmJ,EAAa,KAAAjJ,wBAAA,CACb,QACA,IAAAz5F,EAAA,WAAAyiG,+BAAA,CAAAC,GAIA,GAHAzmJ,EAAA8kD,oBAAA,CAAAf,EAAAe,oBAAA,CACA9kD,EAAAuD,eAAA,CAAAwgD,EAAAtgD,SAAA,CACAzD,EAAAI,IAAA,IAAAH,GACA,CAAAD,EAAAmE,SAAA,CACA,0BAEA,IAAAA,EAAAnE,EAAAmE,SAAA,CAAAxD,QAAA,WACA,QAAA+8I,cAAA,CAAAE,qBAAA,CAAAxxF,QAAA,CAAAjoD,GAUAsiJ,EAAA,OAVA,CAGA,KAAA/I,cAAA,CAAAE,qBAAA,CAAA1mJ,IAAA,CAAAiN,GACU,MAOV,CAEA,KACA3D,EAAAR,EAAAO,SAAA,GACA,kBAAAkF,kBAAA,CAAAjF,EAAAxE,EAAA,CAOA,MAAAyJ,mBAAAH,CAAA,CAAAtJ,CAAA,EACA,IAAA0E,EAAA+V,GAAAnR,GAAA3E,QAAA,WACAhF,EAAA,WAAA4rJ,sBAAA,CAAA7mJ,EAAA1E,GACA,OAAAL,CAAA,CAOA,MAAA4rJ,uBAAA7mJ,CAAA,CAAA1E,CAAA,EACA,IAAA4E,EAAA,CACAC,SAAA,QACA,EACA2E,EAAAxJ,GAAAA,EAAAwJ,aAAA,CACA1C,EAAA0C,CAAA,IAAAA,EAAA,YACAxJ,GAAAA,EAAA8G,mBAAA,OAAArD,UAAA,CACAzD,GAAAA,IAAA,EAAAA,EAAAuuI,UAAA,EACA3pI,CAAAA,EAAA2pI,UAAA,CAAAvuI,EAAAuuI,UAAA,EAEAvuI,GAAAA,IAAA,EAAAA,EAAA6pI,cAAA,EACAjlI,CAAAA,EAAAilI,cAAA,CAAA7pI,EAAA6pI,cAAA,EAEArgI,GACA5E,CAAAA,EAAA4E,aAAA,CAAAA,CAAA,EAEA1C,GACAlC,CAAAA,EAAAkC,mBAAA,CAAAA,CAAA,EAEA,IAAA5B,EAAA,CAAAR,EAAAE,EAAA,CACAO,EAAsB,WAAAC,WAAA,mBAAAF,GACtBG,EAAA9D,GAAA4D,EAAAs7I,IACA,aAAAp7I,EAAA,CACA,IAAAE,CAIA,MAHA,SAAAF,EAAAzD,KAAA,EACA2D,CAAAA,EAAAF,EAAAzD,KAAA,CAAAxE,IAAA,CAAAmI,IAAA,EAEA,IAAAI,GAAA,CACA24B,OAAA90B,EAAA,kBACArB,UAAA,GACA6kI,mBAAA3nI,EAAAzD,KAAA,CAAA7D,OAAA,CACOwH,KAAAA,CACP,GACA,OACAF,EAAA1F,MAAA,CAMA+iJ,WAAA,CACA,KAAAtB,sBAAA,IACA,KAAAC,sBAAA,CAAAmK,YAAA,KAEA,WACA,IACA,WAAArK,aAAA,CAAA9tB,MAAA,QAEO,QACF,IACL,OACA,KAAAo4B,oBAAA,GAMA9I,WAAAv8I,CAAA,EACA,KAAAg7I,sBAAA,IACA17I,QAAA9D,KAAA,aAAAwE,EAAArI,OAAA,EAMA6kJ,WAAA38I,CAAA,EAWA,GAVA,KAAAm7I,sBAAA,IACA,KAAAG,uBAAA,OAAAA,uBAAA,IAAAjtI,OAAA0kC,gBAAA,CACA,KAAAsoG,wBAAA,GACA5tB,aAAA,KAAA4tB,wBAAA,EACA,KAAAA,wBAAA,OAEA,KAAAD,sBAAA,GACAqK,cAAA,KAAArK,sBAAA,EACA,KAAAA,sBAAA,OAEAp7I,MAAAA,EAAA,CAEA,KAAAwlJ,oBAAA,GACA,WAIA,CAAAvJ,4CAAA,IACAzjJ,OAAAkC,OAAA,MAAAwhJ,oBAAA,EAAAt5I,OAAA,GAAA+iB,EAAAyvH,EAAA,IACA,KAAAsQ,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACO10F,MAAA,SACF,EACL,GAMAglG,iBAAA//H,CAAA,CAAAggI,CAAA,EACA,IAAAC,EAAA,KAAA1J,oBAAA,CAAAv2H,EAAA,EAAA+6B,MAEA,GADA,KAAAw7F,oBAAA,CAAAv2H,EAAA,CAAAggI,EACAC,IAAAD,EAAAjlG,KAAA,EACA,IAAAmlG,EAAA,KAAA7J,uCAAA,CAAAr2H,EAAA,CACAkgI,GACAA,EAAAjjJ,OAAA,CAAAipH,GAAA,CACA,IACAA,EAAA85B,EAAAjlG,KAAA,CAES,QACT,EAEA,EAMAk/F,2BAAAkG,CAAA,CAAA9sI,CAAA,EACA,IAAA2M,EAAA,KAAAo2H,uCAAA,CAAA+J,EAAA,CACA,GAAAngI,IAAA,EAAAA,EACA,YACA,CACA,IAAAkgI,EAAA,KAAA7J,uCAAA,CAAAr2H,EAAA,OAAA5qB,IAEA,OADA8qJ,EAAA7qJ,GAAA,CAAAge,GACA,KACA6sI,EAAA3xF,MAAA,CAAAl7C,GACA,IAAA6sI,EAAAvvJ,IAAA,EACA,YAAA0lJ,uCAAA,CAAAr2H,EAAA,CAEA,CAMA,MAAA6/H,sBAAA,CACA,GAAAhtJ,IAAAA,OAAAiE,IAAA,MAAAy/I,oBAAA,EAAAvlJ,MAAA,EACA,KAAAwkJ,sBAAA,GACA,KAAAA,sBAAA,IACA,KAAAE,wBAAA,CAAAtiE,WAAA,KACA,KAAAsiE,wBAAA,MACA,IACY,KAAAH,aAAA,CAAApvB,KAAA,EACZ,OAAA3rH,EAAA,CAEAA,aAAAgD,OACA1D,QAAA2qD,GAAA,0CAAAjqD,EAAArI,OAAA,GAES,CACT,QAEA,MACA,IACA,YAAAujJ,wBAAA,GACA5tB,aAAA,KAAA4tB,wBAAA,EACA,KAAAA,wBAAA,MACA,KAAAF,sBAAA,KAEA,MAAAA,sBAAA,EACA,KAAAD,aAAA,CAAAnuB,OAAA,GACA,MACA,KACAg5B,EAAA,KAAAzK,uBAAA,CACA0K,EAAA,IACAD,IAAA,KAAAzK,uBAAA,OAEA3kI,QAAAqkC,GAAA,CAKAxiD,OAAAiE,IAAA,MAAAy/I,oBAAA,EAAAtlJ,GAAA,OAAA+uB,GAAA,CACA,IAAAyvH,EAAA,KAAA8G,oBAAA,CAAAv2H,EAAA,CACA,GAAAyvH,KAAA57I,IAAA47I,EAIA,OAAAA,EAAA10F,KAAA,EACA,cACA,mBACA,GAAA00F,IAAAA,EAAA6Q,SAAA,CAAA3vJ,IAAA,EAcA,YAAA4lJ,oBAAA,CAAAv2H,EAAA,CACA,iBAAAyvH,EAAA10F,KAAA,EACA,YAAAu7F,4CAAA,CAAA7G,EAAA8Q,oBAAA,EAEA,WAAAV,oBAAA,GACA,MACA,OACA,WACA,IACAvmJ,KAAAA,CAAA,CACcma,OAAAA,CAAA,CACd,CAAAg8H,EACA,IACA,KAAAsQ,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACe10F,MAAA,aACf,GACA,IAAAwlG,EAAA,WAAAhL,aAAA,CAAA92I,IAAA,CAAAgV,EAAAna,GACA,KAAAymJ,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACA8Q,qBAAAA,EACexlG,MAAA,YACf,GACA,KAAAu7F,4CAAA,CAAAiK,EAAA,CAAA9Q,EAAA6Q,SAAA,CACc,WAAAT,oBAAA,EACd,OAAA1oJ,EAAA,CAIA,GAHAA,aAAAqG,OACA1D,QAAA9D,KAAA,IAAAyd,EAAA,qBAAAna,EAAAnC,EAAAhF,OAAA,EAEA,CAAAkuJ,IACA,MACA,CAEA,KAAAN,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACe10F,MAAA,SACf,GACA,WAAA8kG,oBAAA,EACW,CACX,KACA,UACA,aACA,IAAApQ,EAAA6Q,SAAA,CAAA3vJ,IAAA,EAIA,iBACA,IACA4vJ,qBAAAA,CAAA,CACgBC,kBAAAA,CAAA,CAChB,CAAA/Q,EACA,QAAA+G,+BAAA,CAAApjI,GAAA,CAAAmtI,GAUgB,KAAA/J,+BAAA,CAAAjoF,MAAA,CAAAgyF,OAChB,CACA,KAAAR,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACiB10F,MAAA,eACjB,GACA,KAAAglG,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACiB10F,MAAA,eACjB,GACA,IACkB,WAAAw6F,aAAA,CAAA92I,IAAA,CAAA+hJ,EAAA,CAAAD,EAAA,CAClB,OAAAppJ,EAAA,CAIA,GAHAA,aAAAqG,OACA1D,QAAA9D,KAAA,IAAAwqJ,EAAA,SAAArpJ,EAAAhF,OAAA,EAEA,CAAAkuJ,IACA,MACA,CAEA,KAAAN,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACmB10F,MAAA,YACnB,GACA,WAAA8kG,oBAAA,GACA,MACA,CACA,KACA,CAAAE,gBAAA,CAAA//H,EAAA,CACA,GAAAyvH,CAAA,CACe10F,MAAA,cACf,GACa,WAAA8kG,oBAAA,EACb,IAGK,CAnHL,GAoHA,CAMAY,0BAAAF,CAAA,CAAAG,CAAA,EACA,IAAAJ,EAAA,KAAAhK,4CAAA,CAAAiK,EAAA,MACA1sJ,IAAAysJ,GAGAA,EAAArjJ,OAAA,CAAAipH,GAAA,CACA,IACAA,KAKQw6B,EACR,OAAAvpJ,EAAA,CACA2C,QAAA9D,KAAA,CAAAmB,EACK,CACL,GAMA8/I,yBAAAlvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAAynB,IACA,KAAAiR,yBAAA,CAAAhR,EAAA,CAAA17I,EAAAvB,KAAA,CAAAuB,EAAAC,OAAA,GAMA2sJ,kBAAAC,CAAA,CAyBAtnJ,CAAA,EACA,IAAA6mJ,EAAA,KAAAjK,yBAAA,GACAl2H,EAAAwnH,GAAA,CAAAoZ,EAAAntI,MAAA,CAAAna,EAAA,EACAunJ,EAAA,KAAAtK,oBAAA,CAAAv2H,EAAA,CAqBA,OApBA6gI,KAAAhtJ,IAAAgtJ,EACA,KAAAtK,oBAAA,CAAAv2H,EAAA,EACA,GAAA4gI,CAAA,CACAtnJ,KAAAA,EACAgnJ,UAAA,IAAAlrJ,IAAA,CAAAwrJ,EAAAvtI,QAAA,GACA0nC,MAAA,SACM,EAEN8lG,EAAAP,SAAA,CAAAjrJ,GAAA,CAAAurJ,EAAAvtI,QAAA,EAEA,KAAA+iI,uCAAA,CAAA+J,EAAA,CAAAngI,EACA,KAAAm2H,mDAAA,CAAAgK,EAAA,WACA,YAAAhK,mDAAA,CAAAgK,EAAA,CACA,YAAA/J,uCAAA,CAAA+J,EAAA,CACM,IAAA1Q,EAAA,IAAM,CAAA8G,oBAAA,CAAAv2H,EAAA,CACZu3G,GAAAkY,KAAA57I,IAAA47I,EAAA,4EAAA0Q,EAAA,GACA1Q,EAAA6Q,SAAA,CAAA/xF,MAAA,CAAAqyF,EAAAvtI,QAAA,EACA,WAAAwsI,oBAAA,EACA,EACA,KAAAA,oBAAA,GACAM,CAAA,CAgBA/vF,gBAAAz+D,CAAA,CAAA0hB,CAAA,CAAAi3H,CAAA,EACA,IACAzyI,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAAhlJ,EAAAyH,QAAA,IAAAvB,GAAA,KAAAq9I,WAAA,cAEA,SAAAl8I,GACA,YAAA2nJ,iBAAA,EACAttI,SAAAA,EACAI,OAAA,mBACK+sI,kBAAA,oBACL,EAAAlnJ,EAAA,CAQA,MAAAk3D,4BAAA2vF,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,kBAMAjJ,gCAAAnvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAA4nB,IACA,KAAA8Q,yBAAA,CAAAhR,EAAA,EACAtxD,UAAApqF,EAAAvB,KAAA,CAAAikD,MAAA,CACKkE,YAAA5mD,EAAAvB,KAAA,CAAAyF,OAAA,EACLlE,EAAAC,OAAA,GAiBA+sJ,uBAAAlyG,CAAA,CAAAx7B,CAAA,CAAAi3H,CAAA,CAAA0W,CAAA,EACA,IACAnpJ,WAAAA,CAAA,CACMmB,OAAAA,CAAA,CACN,CAAAqxI,GAAAC,GACAhxI,EAAA,KAAAq9I,UAAA,EAAA9nG,EAAAz1C,QAAA,IAAAvB,GAAA,KAAAq9I,WAAA,cAEA,SAAAl8I,GAAAgoJ,CAAAA,EAAA,CACMhwF,QAAAgwF,CACN,EAAAntJ,KAAAA,CAAA,GACA,YAAA8sJ,iBAAA,EACAttI,SAAAA,EACAI,OAAA,mBACK+sI,kBAAA,oBACL,EAAAlnJ,EAAA,CAQA,MAAA2nJ,mCAAAd,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,0BAMAvuF,OAAAx3C,CAAA,CAAA/G,CAAA,CAAAxb,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,mBAAAv8H,EAAA,CACM8mI,SAAA,CAAA9mI,EAAArhB,QAAA,KACNqhB,CAAA,EAAAviB,GAAA,KAAAq9I,WAAA,eAEA,YAAAyL,iBAAA,EACAttI,SAAAA,EACAI,OAAA,gBACK+sI,kBAAA,iBACL,EAAAlnJ,EAAA,CAQA,MAAAw4D,qBAAAquF,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,QAMA5I,sBAAAxvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAAgtB,IACA,KAAA0L,yBAAA,CAAAhR,EAAA,CAAA17I,EAAAvB,KAAA,CAAAuB,EAAAC,OAAA,GAMAmjJ,sBAAApvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAA8nB,IACA,KAAA4Q,yBAAA,CAAAhR,EAAA,CAAA17I,EAAA,EASAotJ,aAAA9tI,CAAA,EACA,YAAAstI,iBAAA,EACAttI,SAAAA,EACAI,OAAA,gBACK+sI,kBAAA,iBACL,MAQA,MAAAY,yBAAAjB,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,eAMA/I,6BAAArvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAAsoB,IACA,KAAAoQ,yBAAA,CAAAhR,EAAA,CAAA17I,EAAA,EAUAstJ,aAAAhuI,CAAA,EACA,YAAAstI,iBAAA,EACAttI,SAAAA,EACAI,OAAA,wBACK+sI,kBAAA,yBACL,MAQA,MAAAc,yBAAAnB,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,eAOA,MAAAW,+BAAAX,CAAA,CAAAoB,CAAA,EACA,IAAAC,EAAA,KAAArL,mDAAA,CAAAgK,EAAA,CACAqB,EACM,MAAAA,IAEN1nJ,QAAAo3D,IAAA,yEAAAivF,EAAA,UAAAoB,EAAA,8BAEA,CACA5K,WAAAr9I,CAAA,CAAAmoJ,CAAA,CAAAxoJ,CAAA,CAAAskJ,CAAA,EACA,IAAA1lJ,EAAA4pJ,GAAA,KAAAvM,WAAA,CACA,GAAAr9I,GAAAoB,GAAAskJ,EAAA,CACA,IAAAnpJ,EAAA,GACA6E,GACA7E,CAAAA,EAAA6E,QAAA,CAAAA,CAAA,EAEApB,GACAzD,CAAAA,EAAAyD,UAAA,CAAAA,CAAA,EAEA0lJ,GACAnpJ,CAAAA,EAAAvB,OAAAC,MAAA,CAAAsB,EAAAmpJ,EAAA,EAEAjkJ,EAAAhK,IAAA,CAAA8E,EACA,QACAkF,CAAA,CAMA6jJ,2BAAA7jJ,CAAA,CAAAmoJ,CAAA,CAAAxoJ,CAAA,CAAAskJ,CAAA,EACA,IAAA1lJ,EAAA4pJ,GAAA,KAAAvM,WAAA,CACA,GAAAr9I,GAAA,2BAAA2sD,QAAA,CAAA3sD,GACA,+DAAAq9I,WAAA,gDAEA,YAAAyB,UAAA,CAAAr9I,EAAAmoJ,EAAAxoJ,EAAAskJ,EAAA,CAMAlG,2BAAAtvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAAuoB,IACA,sBAAAv8I,EAAAvB,KAAA,EAcA,KAAAgkJ,+BAAA,CAAAnhJ,GAAA,CAAAo6I,GAEA,KAAAgR,yBAAA,CAAAhR,EAAA17I,sBAAAA,EAAAvB,KAAA,GACKE,KAAA,UACL,EAAAqB,EAAAC,OAAA,IACAtB,KAAA,SACKqB,OAAAA,EAAAvB,KAAA,EACLuB,EAAAC,OAAA,GAWA4lJ,YAAAr9I,CAAA,CAAA8W,CAAA,CAAAxb,CAAA,EACA,IAAAyB,EAAA,KAAAq9I,UAAA,EAAAp6I,EAAA,CAAA1E,GAAA,KAAAq9I,WAAA,eAEAiL,EAAA,KAAAQ,iBAAA,EACAttI,SAAA,CAAA00G,EAAA/zH,IAAA,CACA,GAAA+zH,WAAAA,EAAAr1H,IAAA,EACA2gB,EAAA00G,EAAAh0H,MAAA,CAAAC,GAGA,IACA,KAAAqmJ,uBAAA,CAAA8F,EAEA,OAAAuB,EAAA,CAEA,CACO,GAEPjuI,OAAA,qBACK+sI,kBAAA,sBACL,EAAAlnJ,GACA,OAAA6mJ,CAAA,CAaAwB,uBAAAplJ,CAAA,CAAA8W,CAAA,CAAAjf,CAAA,EACA,IACAyD,WAAAA,CAAA,CACM,GAAA0lJ,EACN,EACA,GAAAnpJ,CAAA,CACAyD,WAAAzD,GAAAA,EAAAyD,UAAA,OAAAq9I,WAAA,aACA,EACA57I,EAAA,KAAAq9I,UAAA,EAAAp6I,EAAA,CAAA1E,EAAAhE,KAAAA,EAAA0pJ,GACA4C,EAAA,KAAAQ,iBAAA,EACAttI,SAAA,CAAA00G,EAAA/zH,IAAA,CACAqf,EAAA00G,EAAA/zH,GAGA,IACA,KAAAqmJ,uBAAA,CAAA8F,EAEA,OAAAuB,EAAA,CAEO,CACP,EACAjuI,OAAA,qBACK+sI,kBAAA,sBACL,EAAAlnJ,GACA,OAAA6mJ,CAAA,CAQA,MAAA9F,wBAAA8F,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,oBAMA7I,sBAAAvvB,CAAA,EACA,IACAh0H,OAAAA,CAAA,CACM07I,aAAAA,CAAQ,CACd,CAAA95I,GAAAoyH,EAAAwoB,IACA,KAAAkQ,yBAAA,CAAAhR,EAAA,CAAA17I,EAAA,EASA6tJ,aAAAvuI,CAAA,EACA,YAAAstI,iBAAA,EACAttI,SAAAA,EACAI,OAAA,gBACK+sI,kBAAA,iBACL,MAQA,MAAAqB,yBAAA1B,CAAA,EACA,WAAAW,8BAAA,CAAAX,EAAA,cACA,EAUA,MAAA9nI,GAOAtmB,YAAAosD,CAAA,EACA,KAAA2jG,QAAA,QACA,KAAAA,QAAA,CAAA3jG,GAAA42E,IAAA,CAQA,OAAApiD,UAAA,CACA,WAAAt6D,GAAA08G,KAAA,CAiBA,OAAAz8G,cAAA28G,CAAA,CAAA7gI,CAAA,EACA,GAAA6gI,KAAAA,EAAA/iH,UAAA,CACA,mCAEA,IAAAvgB,EAAAsjI,EAAA7jI,KAAA,QACA,IAAAgD,GAAA,CAAAA,EAAA2tJ,cAAA,EACA,IAAA/sB,EAAAC,EAAA7jI,KAAA,OACA4wJ,EAAgC53D,GAAA4qC,GAChC,QAAAitB,EAAA,EAAAA,EAAA,GAAAA,IACA,GAAAtwJ,CAAA,CAAAswJ,EAAA,GAAAD,CAAA,CAAAC,EAAA,CACA,6CAGA,OACA,IAAA5pI,GAAA,CACA1mB,UAAAA,EACKsjI,UAAAA,CACL,GAUA,OAAAitB,SAAAr2F,CAAA,EACA,IAAAl6D,EAAAy4F,GAAAv+B,GACAopE,EAAA,IAAA34H,WAAA,IAGA,OAFA24H,EAAA9/H,GAAA,CAAA02D,GACAopE,EAAA9/H,GAAA,CAAAxD,EAAA,IACA,IAAA0mB,GAAA,CACA1mB,UAAAA,EACKsjI,UAAAA,CACL,GAQA,IAAAtjI,WAAA,CACA,WAAAid,GAAA,KAAAkzI,QAAA,CAAAnwJ,SAAA,EAOA,IAAAsjI,WAAA,CACA,WAAA34H,WAAA,KAAAwlJ,QAAA,CAAA7sB,SAAA,CACA,EAWA,IAAA3tB,GAAAz0G,OAAAquD,MAAA,EACAihG,kBAAA,CACAhxJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAA+1H,GAAA,cAAAr7H,GAAAqF,EAAA,cACH,EACAw0I,kBAAA,CACAjxJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACAw0I,kBAAA,CACAlxJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAA+1H,KAAAr7H,GAAAqU,GAAA,CAAAjrB,KAAA4W,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,qBACH,EACAy0I,sBAAA,CACAnxJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACA00I,iBAAA,CACApxJ,MAAA,EACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACC,CACD,EACA,OAAAy4F,GAIAv0G,aAAA,EACA,OAAA8xI,sBAAApoF,CAAA,MAIA/oD,EAHA,KAAAoxI,cAAA,CAAAroF,EAAkC5M,SAAgB,EAClD,IAAAk1F,EAAAx7H,GAAAsF,GAAA,gBACA1c,EAAA4yI,EAAAl7H,MAAA,CAAA4yC,EAAAjqD,IAAA,EAEA,QAAAgxJ,EAAA54I,EAAA,GAAA/W,OAAAkC,OAAA,CAAAuyG,IACA,GAAA19F,EAAAzY,KAAA,EAAAA,EAAA,CACAuB,EAAA8vJ,EACA,MACA,GAEA,CAAA9vJ,EACA,wEAEA,OAAAA,CACA,CACA,OAAA+vJ,wBAAAhnG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAA6zG,eAAA,CAAAjnG,EAAA3kD,IAAA,IACA,IACM6rJ,WAAAA,CAAA,CACN,CAAA1f,GAAA37B,GAAA66C,iBAAA,CAAA1mG,EAAAjqD,IAAA,EACA,OACA24D,UAAA1O,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAv+B,MAAAujC,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAksG,WAAAj6I,OAAAi6I,EACA,CACA,CACA,OAAAC,wBAAAnnG,CAAA,EAEA,GADA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA4M,EAAA3kD,IAAA,CAAA9F,MAAA,GACA,0CAAAyqD,EAAA3kD,IAAA,CAAA9F,MAAA,8BAEA,IACMkI,UAAAA,CAAA,CACN,CAAA+pI,GAAA37B,GAAA+6C,iBAAA,CAAA5mG,EAAAjqD,IAAA,EACA,OACAknI,YAAAj9E,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0T,UAAA1O,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAv+B,MAAAujC,EAAA3kD,IAAA,CAAA9F,MAAA,GAAAyqD,EAAA3kD,IAAA,IAAA2/C,MAAA,CAAA5iD,KAAAA,CAAA,CACAqF,UAAAA,EAAAjI,GAAA,CAAAkhB,GAAA,IAAAvD,GAAAuD,GACA,CACA,CACA,OAAA0wI,uBAAApnG,CAAA,EAGA,OAFA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAA6zG,eAAA,CAAAjnG,EAAA3kD,IAAA,IACA,CACA4hI,YAAAj9E,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0T,UAAA1O,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAqsG,UAAArnG,EAAA3kD,IAAA,IAAA2/C,MAAA,CAEA,CACA,OAAAssG,wBAAAtnG,CAAA,EAGA,OAFA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAA6zG,eAAA,CAAAjnG,EAAA3kD,IAAA,IACA,CACA4hI,YAAAj9E,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0T,UAAA1O,EAAA3kD,IAAA,IAAA2/C,MAAA,CAEA,CACA,OAAAusG,4BAAAvnG,CAAA,EAGA,OAFA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAA6zG,eAAA,CAAAjnG,EAAA3kD,IAAA,IACA,CACA4hI,YAAAj9E,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0T,UAAA1O,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqtF,eAAAj1F,CAAA,EACA,IAAAA,EAAAoG,MAAA,CAAAsxD,GAA4C13D,SAAA,EAC5C,gFAMA,OAAA6zG,gBAAA5rJ,CAAA,CAAA66G,CAAA,EACA,GAAA76G,EAAA9F,MAAA,CAAA2gH,EACA,0CAAA76G,EAAA9F,MAAA,4BAAA2gH,EAAA,GAGA,CACA,MAAApL,GAIAx0G,aAAA,EACA,OAAAkxJ,kBAAA/zH,CAAA,EACA,IAAAg0H,EAAAC,EAAA,CAAAv0I,GAAAilC,sBAAA,EAAA3kB,EAAAi7B,SAAA,CAAAt7C,QAAA,MAAA61G,GAAAif,UAAA,EAAAtpF,OAAAnrB,EAAAyzH,UAAA,WAAA9zG,SAAA,EACAn8C,EAAA40G,GAAA66C,iBAAA,CACA3wJ,EAAAq2E,GAAAn1E,EAAA,CACAiwJ,WAAAtoG,OAAAnrB,EAAAyzH,UAAA,EACKQ,SAAAA,CACL,GACArsJ,EAAA,EACA2/C,OAAAysG,EACAxsG,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAi7B,SAAA,CACAzT,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAhX,KAAA,CACAw+B,SAAA,GACKC,WAAA,EACL,GACAF,OAAAlI,GAAAM,SAAA,CACA6H,SAAA,GACKC,WAAA,EACL,GACA,WAAAE,GAAA,CACAhI,UAAA,KAAAA,SAAA,CACA/3C,KAAAA,EACKtF,KAAAA,CACL,GAAA0xJ,EAAA,CAEA,OAAAE,kBAAAl0H,CAAA,EACA,IAAAx8B,EAAA40G,GAAA86C,iBAAA,CACA5wJ,EAAAq2E,GAAAn1E,GACAoE,EAAA,EACA2/C,OAAAvnB,EAAAwpG,WAAA,CACAhiF,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAi7B,SAAA,CACAzT,SAAA,GACKC,WAAA,EACL,GACA,WAAAE,GAAA,CACAhI,UAAA,KAAAA,SAAA,CACA/3C,KAAAA,EACKtF,KAAAA,CACL,EACA,CACA,OAAA6xJ,kBAAAn0H,CAAA,EACA,IAAAx8B,EAAA40G,GAAA+6C,iBAAA,CACA7wJ,EAAAq2E,GAAAn1E,EAAA,CACKwG,UAAAg2B,EAAAh2B,SAAA,CAAAjI,GAAA,CAAA25E,GAAAA,EAAAzxB,OAAA,GACL,GACAriD,EAAA,EACA2/C,OAAAvnB,EAAAwpG,WAAA,CACAhiF,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAi7B,SAAA,CACAzT,SAAA,GACKC,WAAA,EACL,GAYA,OAXAznB,EAAAhX,KAAA,EACAphB,EAAAxH,IAAA,EACAmnD,OAAAvnB,EAAAhX,KAAA,CACAw+B,SAAA,GACOC,WAAA,EACP,GACAF,OAAAlI,GAAAM,SAAA,CACA6H,SAAA,GACOC,WAAA,EACP,GAEA,IAAAE,GAAA,CACAhI,UAAA,KAAAA,SAAA,CACA/3C,KAAAA,EACKtF,KAAAA,CACL,EACA,CACA,OAAA8xJ,sBAAAp0H,CAAA,EACA,IAAAx8B,EAAA40G,GAAAg7C,qBAAA,CACA9wJ,EAAAq2E,GAAAn1E,GACAoE,EAAA,EACA2/C,OAAAvnB,EAAAwpG,WAAA,CACAhiF,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAi7B,SAAA,CACAzT,SAAA,GACKC,WAAA,EACL,GACA,WAAAE,GAAA,CACAhI,UAAA,KAAAA,SAAA,CACA/3C,KAAAA,EACKtF,KAAAA,CACL,EACA,CACA,OAAA+xJ,iBAAAr0H,CAAA,EACA,IAAAx8B,EAAA40G,GAAAi7C,gBAAA,CACA/wJ,EAAAq2E,GAAAn1E,GACAoE,EAAA,EACA2/C,OAAAvnB,EAAAwpG,WAAA,CACAhiF,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAAi7B,SAAA,CACAzT,SAAA,GACKC,WAAA,EACL,GACAF,OAAAvnB,EAAA4zH,SAAA,CACApsG,SAAA,GACKC,WAAA,EACL,GACA,WAAAE,GAAA,CACAhI,UAAA,KAAAA,SAAA,CACA/3C,KAAAA,EACKtF,KAAAA,CACL,EACA,CACA,CAAA+0G,GAAA13D,SAAA,KAAAjgC,GAAA,8CAMA,OAAAk4F,GAGA/0G,aAAA,EAMA,OAAA8xI,sBAAApoF,CAAA,MAIA/oD,EAHA,KAAAoxI,cAAA,CAAAroF,EAAkC5M,SAAe,EACjD,IAAAk1F,EAAAx7H,GAAAqF,EAAA,gBACAo2H,EAAAD,EAAAl7H,MAAA,CAAA4yC,EAAAjqD,IAAA,EAEA,QAAAyyI,EAAAr6H,EAAA,GAAA/W,OAAAkC,OAAA,CAAA8xG,IACA,GAAAj9F,EAAAzY,KAAA,EAAA6yI,EAAA,CACAtxI,EAAAuxI,EACA,MACA,GAEA,CAAAvxI,EACA,0EAEA,OAAAA,CAAA,CAMA,OAAA8wJ,mBAAA/nG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,IACAuuC,MAAAA,CAAA,CACMC,cAAAA,CAAA,CACN,CAAA4lD,GAAAp8B,GAAA48C,YAAA,CAAAhoG,EAAAjqD,IAAA,EACA,OACA4rF,MAAAA,EACAC,cAAAA,CACA,EAMA,OAAAqmE,uBAAAjoG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,IACM16B,MAAAA,CAAA,CACN,CAAA8uH,GAAAp8B,GAAA88C,gBAAA,CAAAloG,EAAAjqD,IAAA,EACA,OACA2iB,MAAAA,CACA,EAMA,OAAAyvI,0BAAAnoG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,IACMuuC,MAAAA,CAAA,CACN,CAAA6lD,GAAAp8B,GAAAg9C,mBAAA,CAAApoG,EAAAjqD,IAAA,EACA,OACA4rF,MAAAA,CACA,EAMA,OAAA0mE,0BAAAroG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,IACMk1G,cAAAA,CAAA,CACN,CAAA9gB,GAAAp8B,GAAAm9C,mBAAA,CAAAvoG,EAAAjqD,IAAA,EACA,OACAuyJ,cAAAA,CACA,EAMA,OAAAjgB,eAAAj1F,CAAA,EACA,IAAAA,EAAAoG,MAAA,CAAA8xD,GAA4Cl4D,SAAA,EAC5C,0EAEA,CA2BA,IAAAg4D,GAAAh0G,OAAAquD,MAAA,EACAuiG,aAAA,CACAtyJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,gBAAArF,GAAAsF,GAAA,UAAAtF,GAAAsF,GAAA,mBACH,EACA81I,iBAAA,CACAxyJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,gBAAArF,GAAAsF,GAAA,WACH,EACAg2I,oBAAA,CACA1yJ,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,gBAAArF,GAAAsF,GAAA,WACH,EACAm2I,oBAAA,CACA7yJ,MAAA,EACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,gBAAAg2H,GAAA,kBACC,GAMD,OAAA78B,GAGAh1G,aAAA,EAUA,OAAAkyJ,aAAA/0H,CAAA,EACA,IAAAx8B,EAAAm0G,GAAA48C,YAAA,CACAjyJ,EAAAq2E,GAAAn1E,EAAAw8B,GACA,WAAA2nB,GAAA,CACA//C,KAAA,GACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,OAAA0yJ,iBAAAh1H,CAAA,EACA,IAAAx8B,EAAAm0G,GAAA88C,gBAAA,CACAnyJ,EAAAq2E,GAAAn1E,EAAAw8B,GACA,WAAA2nB,GAAA,CACA//C,KAAA,GACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,OAAA2yJ,oBAAAj1H,CAAA,EACA,IAAAx8B,EAAAm0G,GAAAg9C,mBAAA,CACAryJ,EAAAq2E,GAAAn1E,EAAAw8B,GACA,WAAA2nB,GAAA,CACA//C,KAAA,GACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,OAAA4yJ,oBAAAl1H,CAAA,EACA,IAAAx8B,EAAAm0G,GAAAm9C,mBAAA,CACAxyJ,EAAAq2E,GAAAn1E,EAAA,CACKqxJ,cAAA1pG,OAAAnrB,EAAA60H,aAAA,CACL,GACA,WAAAltG,GAAA,CACA//C,KAAA,GACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,CAAAu1G,GAAAl4D,SAAA,KAAAjgC,GAAA,+CAGA,IAAAy1I,GAAA,GACAC,GAAA,GAAAC,GAAA,GAWAC,GAAAj8I,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,kBAAArF,GAAAqF,EAAA,YAAArF,GAAAkT,GAAA,oBAAAlT,GAAAkT,GAAA,8BAAAlT,GAAAkT,GAAA,oBAAAlT,GAAAkT,GAAA,8BAAAlT,GAAAkT,GAAA,sBAAAlT,GAAAkT,GAAA,oBAAAlT,GAAAkT,GAAA,6BACA,OAAAwrF,GAGAl1G,aAAA,EAYA,OAAA0yJ,+BAAAv1H,CAAA,EACA,IACAv9B,UAAAA,CAAA,CACAQ,QAAAA,CAAA,CACAoK,UAAAA,CAAA,CACMmoJ,iBAAAA,CAAA,CACF,CAAAx1H,EACAqoG,GAAM5lI,EAAAX,MAAA,GAAAszJ,GAAA,oBAA4D,EAAAA,GAAiB,oBAAqB,EAAA3yJ,EAAAX,MAAkB,UAC9HumI,GAAAh7H,EAAAvL,MAAA,GAAAuzJ,GAAA,qBAAAA,GAAA,sBAAAhoJ,EAAAvL,MAAA,UACA,IAAA2zJ,EAAAH,GAAAh8I,IAAA,CACAo8I,EAAAD,EAAAhzJ,EAAAX,MAAA,CACA6zJ,EAAAD,EAAAroJ,EAAAvL,MAAA,CACA8zJ,EAAA,EACAluG,EAAAg1D,EAAAp7G,MAAA,CAAAknB,KAAA,CAAAmtI,EAAA1yJ,EAAAnB,MAAA,EACAG,EAAAuzJ,IAAA,EAAAA,EAAA,MACAA,CAAA,CAeA,OAdAF,GAAA/yJ,MAAA,EACAqzJ,cAAAA,EACAjiH,QAAA,EACA+hH,gBAAAA,EACAG,0BAAA5zJ,EACAwzJ,gBAAAA,EACAK,0BAAA7zJ,EACA0zJ,kBAAAA,EACAI,gBAAA9yJ,EAAAnB,MAAA,CACKk0J,wBAAA/zJ,CACL,EAAAylD,GACAA,EAAAquC,IAAA,CAAAtzF,EAAAgzJ,GACA/tG,EAAAquC,IAAA,CAAA1oF,EAAAqoJ,GACAhuG,EAAAquC,IAAA,CAAA9yF,EAAA0yJ,GACA,IAAAhuG,GAAA,CACA//C,KAAA,GACA+3C,UAAAo4D,GAAAp4D,SAAA,CACKr9C,KAAAolD,CACL,GAOA,OAAAuuG,gCAAAj2H,CAAA,EACA,IACAw+F,WAAAA,CAAA,CACAv7H,QAAAA,CAAA,CACMuyJ,iBAAAA,CAAA,CACF,CAAAx1H,EACJqoG,GAAA7J,EAAA18H,MAAA,GAAAqzJ,GAAA,uBAAAA,GAAA,sBAAA32B,EAAA18H,MAAA,UACA,IACA,IAAAmtD,EAAA9lC,GAAAC,aAAA,CAAAo1G,GACA/7H,EAAAwsD,EAAAxsD,SAAA,CAAAwnD,OAAA,GACA58C,EAAA/D,GAAArG,EAAAgsD,EAAA82E,SAAA,EACA,YAAAwvB,8BAAA,EACA9yJ,UAAAA,EACAQ,QAAAA,EACAoK,UAAAA,EACOmoJ,iBAAAA,CACD,EACN,OAAA1uJ,EAAA,CACA,2CAAAA,EAAA,GAEA,CACA,CAAAixG,GAAAp4D,SAAA,KAAAjgC,GAAA,+CAGA,IAAAw2I,GAAA,CAAA50B,EAAoBxS,IAAc,CAClC,IAAAzhH,EAAA03H,GAAAz7H,IAAA,CAAAg4H,EAAAxS,GACA,OAAAzhH,EAAAw0H,iBAAA,GAAAx0H,EAAA4zH,QAAA,EAEA8D,CAAAA,GAAArgF,KAAA,CAAAq9E,iBAAwB,CAAsB,IAAAo0B,GAAApxB,GAAA7pC,YAAA,CAG9Ck7D,GAAA,GACAC,GAAA,GACAC,GAAA,GAAAC,GAAA,GAeAC,GAAAn9I,GAAA7W,MAAA,EAAA6W,GAAAqF,EAAA,kBAAArF,GAAAkT,GAAA,oBAAAlT,GAAAqF,EAAA,8BAAArF,GAAAkT,GAAA,qBAAAlT,GAAAqF,EAAA,+BAAArF,GAAAkT,GAAA,sBAAAlT,GAAAkT,GAAA,oBAAAlT,GAAAqF,EAAA,4BAAArF,GAAAyF,IAAA,kBAAAzF,GAAAyF,IAAA,iBAAAzF,GAAAqF,EAAA,gBACA,OAAA+6F,GAGA52G,aAAA,EAWA,OAAI4zJ,sBAAMh0J,CAAA,EACV4lI,GAAA5lI,EAAAX,MAAA,GAAAw0J,GAAA,sBAAAA,GAAA,sBAAA7zJ,EAAAX,MAAA,UACA,IACM,OAAA46G,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAquD,GAAA3tD,GAAAld,KAAAP,KAAA,EAAAm0J,GACN,OAAAvvJ,EAAA,CACA,oDAAAA,EAAA,GACA,CAOA,OAAAyuJ,+BAAAv1H,CAAA,EACA,IACAv9B,UAAAA,CAAA,CACAQ,QAAAA,CAAA,CACAoK,UAAAA,CAAA,CACAqpJ,WAAAA,CAAA,CACMlB,iBAAAA,CAAA,CACN,CAAAx1H,EACA,OAAAy5E,GAAAk9C,+BAAA,EACAC,WAAAn9C,GAAAg9C,qBAAA,CAAAh0J,GACAQ,QAAAA,EACAoK,UAAAA,EACAqpJ,WAAAA,EACKlB,iBAAAA,CACL,GAOA,OAAAmB,gCAAA32H,CAAA,MAQA42H,EAPA,IACAA,WAAAC,CAAA,CACA5zJ,QAAAA,CAAA,CACAoK,UAAAA,CAAA,CACAqpJ,WAAAA,CAAA,CACMlB,iBAAAA,EAAA,EACN,CAAAx1H,EAWAqoG,GAAAuuB,CAPQA,EAFR,iBAAAC,EACAA,EAAqB3hG,UAAA,OACbwnD,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA43I,EAAAzkG,MAAA,WAERsqD,EAAAp7G,MAAA,CAAA2d,IAAA,CAAA43I,EAAA,OAGAA,GAEA/0J,MAAA,GAAAu0J,GAAA,mBAAAA,GAAA,sBAAAO,EAAA90J,MAAA,UACA,IAAAg1J,EAAA,EAAAP,GACAQ,EAAAD,EACApB,EAAAoB,EAAAF,EAAA90J,MAAA,CACA6zJ,EAAAD,EAAAroJ,EAAAvL,MAAA,GACA8zJ,EAAA,EACAluG,EAAAg1D,EAAAp7G,MAAA,CAAAknB,KAAA,CAAAguI,GAAAl9I,IAAA,CAAArW,EAAAnB,MAAA,EAeA,OAdA00J,GAAAj0J,MAAA,EACAqzJ,cAAAA,EACAF,gBAAAA,EACAG,0BAAAL,EACAuB,iBAAAA,EACAC,2BAAAxB,EACAG,kBAAAA,EACAI,gBAAA9yJ,EAAAnB,MAAA,CACAk0J,wBAAAR,EACAnoJ,UAAAsS,GAAAtS,GACAupJ,WAAAj3I,GAAAi3I,GACKF,WAAAA,CACL,EAAAhvG,GACAA,EAAAquC,IAAA,CAAAp2E,GAAA1c,GAAAuzJ,GAAAl9I,IAAA,EACA,IAAAquC,GAAA,CACA//C,KAAA,GACA+3C,UAAA85D,GAAA95D,SAAA,CACKr9C,KAAAolD,CACL,GAOA,OAAAuuG,gCAAAj2H,CAAA,EACA,IACAw+F,WAAAy4B,CAAA,CACAh0J,QAAAA,CAAA,CACMuyJ,iBAAAA,CAAA,CACF,CAAAx1H,EACJqoG,GAAA4uB,EAAAn1J,MAAA,GAAAs0J,GAAA,uBAAAA,GAAA,sBAAAa,EAAAn1J,MAAA,UACA,IACA,IAAA08H,EAAA7+G,GAAAs3I,GACAx0J,EAAA0zJ,GAA0B33B,EAAA,IAAsBt8H,KAAA,IAChDg1J,EAAAx6C,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAquD,GAAA3tD,GAAA1c,KACA,CAAAoK,EAAAqpJ,EAAA,CAAAR,GAAAgB,EAAA14B,GACA,YAAA+2B,8BAAA,EACA9yJ,UAAAA,EACAQ,QAAAA,EACAoK,UAAAA,EACAqpJ,WAAAA,EACOlB,iBAAAA,CACD,EACN,OAAA1uJ,EAAA,CACA,2CAAAA,EAAA,GAEA,CACA,CAAA2yG,GAAA95D,SAAA,KAAAjgC,GAAA,+CAQA,IAAAq5F,GAAA,IAAAr5F,GAAA,8CAMA,OAAA43F,GAMAz0G,YAAAs0J,CAAA,CAAAC,CAAA,EAEA,KAAAD,MAAA,QAEA,KAAAC,UAAA,QACA,KAAAD,MAAA,CAAAA,EACA,KAAAC,UAAA,CAAAA,CACA,CACA,CAIA,MAAA9+C,GAIAz1G,YAAAw0J,CAAA,CAAAne,CAAA,CAAAoe,CAAA,EAEA,KAAAD,aAAA,QAEA,KAAAne,KAAA,QAEA,KAAAoe,SAAA,QACA,KAAAD,aAAA,CAAAA,EACA,KAAAne,KAAA,CAAAA,EACA,KAAAoe,SAAA,CAAAA,CAAA,CAMA,CACAn8C,EAAA7C,GACAA,GAAA5wF,OAAA,KAAAyzF,EAAA,IAAAz7F,GAAAgI,OAAA,CAqCA,OAAAmyF,GAGAh3G,aAAA,EAMA,OAAA8xI,sBAAApoF,CAAA,MAIA/oD,EAHA,KAAAoxI,cAAA,CAAAroF,EAAkC5M,SAAgB,EAClD,IAAAk1F,EAAAx7H,GAAAsF,GAAA,gBACAm2H,EAAAD,EAAAl7H,MAAA,CAAA4yC,EAAAjqD,IAAA,EAEA,QAAAyyI,EAAAr6H,EAAA,GAAA/W,OAAAkC,OAAA,CAAAmzG,IACA,GAAAt+F,EAAAzY,KAAA,EAAA6yI,EAAA,CACAtxI,EAAAuxI,EACA,MACA,GAEA,CAAAvxI,EACA,kEAEA,OAAAA,CAAA,CAMA,OAAA+zJ,iBAAAhrG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAk1D,WAAAA,CAAA,CACMirE,OAAAA,CAAA,CACN,CAAAgM,GAAA/6B,GAAAw+C,UAAA,CAAAjrG,EAAAjqD,IAAA,EACA,OACAm1J,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAuV,WAAA,IAAAw6C,GAAA,IAAA53F,GAAAo9C,EAAAq6F,MAAA,MAAAz3I,GAAAo9C,EAAAs6F,UAAA,GACArvB,OAAA,IAAAzvB,GAAAyvB,EAAAsvB,aAAA,CAAAtvB,EAAAmR,KAAA,KAAAx5H,GAAAqoH,EAAAuvB,SAAA,EACA,EAMA,OAAAI,eAAAnrG,CAAA,EAIA,OAHA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACAmsI,GAAA/6B,GAAA2+C,QAAA,CAAAprG,EAAAjqD,IAAA,EACA,CACAm1J,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAm6F,WAAAn1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqwG,gBAAArrG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAiwJ,cAAAA,CAAA,CACMC,uBAAAA,CAAA,CACN,CAAA/jB,GAAA/6B,GAAA++C,SAAA,CAAAxrG,EAAAjqD,IAAA,EACAi+C,EAAA,CACAk3G,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAovF,oBAAA,IAAAj3H,GAAAm4I,GACAC,uBAAA,CACA71J,MAAA61J,CACA,CACA,EAIA,OAHAvrG,EAAA3kD,IAAA,CAAA9F,MAAA,IACAy+C,CAAAA,EAAAy3G,eAAA,CAAAzrG,EAAA3kD,IAAA,IAAA2/C,MAAA,EAEAhH,CAAA,CAMA,OAAA03G,wBAAA1rG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAiwJ,cAAAA,CAAA,CACAC,uBAAAA,CAAA,CACAI,cAAAA,CAAA,CACMC,eAAAA,CAAA,CACN,CAAApkB,GAAA/6B,GAAAo/C,iBAAA,CAAA7rG,EAAAjqD,IAAA,EACAi+C,EAAA,CACAk3G,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA8wG,cAAA9rG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA2wG,cAAAA,EACAC,eAAA,IAAAz4I,GAAAy4I,GACAxhB,oBAAA,IAAAj3H,GAAAm4I,GACAC,uBAAA,CACA71J,MAAA61J,CACA,CACA,EAIA,OAHAvrG,EAAA3kD,IAAA,CAAA9F,MAAA,IACAy+C,CAAAA,EAAAy3G,eAAA,CAAAzrG,EAAA3kD,IAAA,IAAA2/C,MAAA,EAEAhH,CAAA,CAMA,OAAA+3G,YAAA/rG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM6D,SAAAA,CAAA,CACN,CAAAsoI,GAAA/6B,GAAAu/C,KAAA,CAAAhsG,EAAAjqD,IAAA,EACA,OACAm1J,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAixG,iBAAAjsG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,CACA,EAMA,OAAAgtJ,YAAAlsG,CAAA,EAIA,OAHA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACAmsI,GAAA/6B,GAAA0/C,KAAA,CAAAnsG,EAAAjqD,IAAA,EACA,CACAm1J,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAoxG,kBAAApsG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqxG,eAAArsG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM6D,SAAAA,CAAA,CACN,CAAAsoI,GAAA/6B,GAAA6/C,QAAA,CAAAtsG,EAAAjqD,IAAA,EACAi+C,EAAA,CACAk3G,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA2D,SAAAqB,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,CACA,EAIA,OAHA8gD,EAAA3kD,IAAA,CAAA9F,MAAA,IACAy+C,CAAAA,EAAAy3G,eAAA,CAAAzrG,EAAA3kD,IAAA,IAAA2/C,MAAA,EAEAhH,CAAA,CAMA,OAAAu4G,iBAAAvsG,CAAA,EAIA,OAHA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACAmsI,GAAA/6B,GAAA+/C,UAAA,CAAAxsG,EAAAjqD,IAAA,EACA,CACAm1J,YAAAlrG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqtF,eAAAj1F,CAAA,EACA,IAAAA,EAAAoG,MAAA,CAAA+zD,GAAAn6D,SAA4C,EAC5C,kEAOA,OAAAs1F,eAAArtI,CAAA,CAAA66G,CAAA,EACA,GAAA76G,EAAA9F,MAAA,CAAA2gH,EACA,0CAAA76G,EAAA9F,MAAA,4BAAA2gH,EAAA,GAEA,CAWA,IAAAzJ,GAAAr1G,OAAAquD,MAAA,EACAwlG,WAAA,CACAv1J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAm+C,KAAAirE,KAAA,CACH,EACAgwB,UAAA,CACA91J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,iBAAA4W,GAAAsF,GAAA,4BACH,EACAg5I,SAAA,CACA11J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACA45I,MAAA,CACAt2J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,cACH,EACAg6I,SAAA,CACA52J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,cACH,EACAk6I,WAAA,CACA92J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACA+5I,MAAA,CACAz2J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACAy5I,kBAAA,CACAn2J,MAAA,EACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,iBAAA4W,GAAAsF,GAAA,2BAAAgpH,GAAA,iBAAAllI,GAAA,mBACC,IAUDm3G,GAAAj2G,OAAAquD,MAAA,EACAgnG,OAAA,CACG/2J,MAAA,CACH,EACAg3J,WAAA,CACAh3J,MAAA,CACC,GAMD,OAAA63G,GAGAj3G,aAAA,EAUA,OAAAq2J,WAAAl5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACA36F,WAAAA,CAAA,CACMirE,OAAAoxB,CAAA,CACN,CAAAn5H,EACA+nG,EAAAoxB,GAAA7gD,GAAA5wF,OAAA,CACAlkB,EAAAw1G,GAAAw+C,UAAA,CACAl1J,EAAAq2E,GAAAn1E,EAAA,CACAs5D,WAAA,CACAq6F,OAAAx3I,GAAAm9C,EAAAq6F,MAAA,CAAAx3I,QAAA,IACOy3I,WAAAz3I,GAAAm9C,EAAAs6F,UAAA,CAAAz3I,QAAA,GACP,EACAooH,OAAA,CACAsvB,cAAAtvB,EAAAsvB,aAAA,CACAne,MAAAnR,EAAAmR,KAAA,CACAoe,UAAA33I,GAAAooH,EAAAuvB,SAAA,CAAA33I,QAAA,GACK,CACL,GACA+nC,EAAA,CACA9/C,KAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACOC,WAAA,EACP,GACAF,OAAAqd,GACApd,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACAr9C,KAAAA,CACA,EACA,WAAAqlD,GAAAD,EAAA,CAOA,OAAAkV,sBAAA58B,CAAA,EACA,IAAA92B,EAAA,IAAAkkD,GACAlkD,EAAA/C,GAAA,CAAAk5C,GAAAud,qBAAA,EACArd,WAAAvf,EAAAuf,UAAA,CACAC,iBAAAxf,EAAAy3H,WAAA,CACAniB,WAAAt1G,EAAAs1G,UAAA,CACA34E,KAAA38B,EAAA28B,IAAA,CACAlxD,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAA,KAAAA,KAAA,CACKE,UAAA,KAAAA,SAAA,IAEL,IACA83G,YAAAA,CAAA,CACA36F,WAAAA,CAAA,CACMirE,OAAAA,CAAA,CACN,CAAA/nG,EACA,OAAA92B,EAAA/C,GAAA,MAAA+yJ,UAAA,EACAzB,YAAAA,EACA36F,WAAAA,EACKirE,OAAAA,CACL,IAMA,OAAAzoF,cAAAtf,CAAA,EACA,IAAA92B,EAAA,IAAAkkD,GACAlkD,EAAA/C,GAAA,CAAAk5C,GAAAC,aAAA,EACAC,WAAAvf,EAAAuf,UAAA,CACAC,iBAAAxf,EAAAy3H,WAAA,CACAhsJ,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAA,KAAAA,KAAA,CACKE,UAAA,KAAAA,SAAA,IAEL,IACA83G,YAAAA,CAAA,CACA36F,WAAAA,CAAA,CACMirE,OAAAA,CAAA,CACN,CAAA/nG,EACA,OAAA92B,EAAA/C,GAAA,MAAA+yJ,UAAA,EACAzB,YAAAA,EACA36F,WAAAA,EACKirE,OAAAA,CACL,IAQA,OAAAp8E,SAAA3rB,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAxjB,iBAAAA,CAAA,CACMyN,WAAAA,CAAA,CACN,CAAA1hH,EACAx8B,EAAAw1G,GAAA2+C,QAAA,CACAr1J,EAAAq2E,GAAAn1E,GACA,WAAA4pD,KAAAjnD,GAAA,EACAyB,KAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACOC,WAAA,EACP,GACAF,OAAAm6F,EACAl6F,SAAA,GACOC,WAAA,EACP,GACAF,OAAA44B,GACA34B,SAAA,GACOC,WAAA,EACP,GACAF,OAAAiyD,GACAhyD,SAAA,GACOC,WAAA,EACP,GACAF,OAAAwxD,GACAvxD,SAAA,GACOC,WAAA,EACP,GACAF,OAAA0sF,EACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAOA,OAAA82J,UAAAp5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAxjB,iBAAAA,CAAA,CACA0C,oBAAAA,CAAA,CACAmhB,uBAAAA,CAAA,CACME,gBAAAA,CAAA,CACN,CAAAh4H,EACAx8B,EAAAw1G,GAAA++C,SAAA,CACAz1J,EAAAq2E,GAAAn1E,EAAA,CACAq0J,cAAAl4I,GAAAg3H,EAAAh3H,QAAA,IACKm4I,uBAAAA,EAAA71J,KAAA,GAEL2F,EAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA44B,GACA34B,SAAA,GACKC,WAAA,EACL,GACAF,OAAA0sF,EACAzsF,SAAA,GACKC,WAAA,EACL,GAQA,OAPAuwG,GACApwJ,EAAAxH,IAAA,EACAmnD,OAAAywG,EACAxwG,SAAA,GACOC,WAAA,EACP,GAEA,IAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAOA,OAAA+2J,kBAAAr5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAY,cAAAA,CAAA,CACAH,cAAAA,CAAA,CACAC,eAAAA,CAAA,CACAxhB,oBAAAA,CAAA,CACAmhB,uBAAAA,CAAA,CACME,gBAAAA,CAAA,CACN,CAAAh4H,EACAx8B,EAAAw1G,GAAAo/C,iBAAA,CACA91J,EAAAq2E,GAAAn1E,EAAA,CACAq0J,cAAAl4I,GAAAg3H,EAAAh3H,QAAA,IACAm4I,uBAAAA,EAAA71J,KAAA,CACAi2J,cAAAA,EACKC,eAAAx4I,GAAAw4I,EAAAx4I,QAAA,GACL,GACA/X,EAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA8wG,EACA7wG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA44B,GACA34B,SAAA,GACKC,WAAA,EACL,GAQA,OAPAuwG,GACApwJ,EAAAxH,IAAA,EACAmnD,OAAAywG,EACAxwG,SAAA,GACOC,WAAA,EACP,GAEA,IAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAg3J,iBAAAt5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAxjB,iBAAAA,CAAA,CACAukB,iBAAAA,CAAA,CACM/sJ,SAAAA,CAAA,CACN,CAAAu0B,EACAx8B,EAAAw1G,GAAAu/C,KAAA,CACAj2J,EAAAq2E,GAAAn1E,EAAA,CACKiI,SAAAA,CACL,GACA,WAAAk8C,GAAA,CACA//C,KAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACOC,WAAA,EACP,GACAF,OAAAixG,EACAhxG,SAAA,GACOC,WAAA,EACP,GACAF,OAAA0sF,EACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAmZ,MAAAukB,CAAA,CAEAgsB,CAAA,EACA,IAAA9iD,EAAA,IAAAkkD,GAQA,OAPAlkD,EAAA/C,GAAA,CAAAk5C,GAAAC,aAAA,EACAC,WAAAvf,EAAAi0G,gBAAA,CACAz0F,iBAAAxf,EAAAw4H,gBAAA,CACA/sJ,SAAAugD,EACAvM,MAAA,KAAAA,KAAA,CACKE,UAAA,KAAAA,SAAA,IAELz2C,EAAA/C,GAAA,MAAAmzJ,gBAAA,CAAAt5H,GAAA,CAOA,OAAAu5H,cAAAv5H,CAAA,CAEAgsB,CAAA,EACA,IACAyrG,YAAAA,CAAA,CACAxjB,iBAAAA,CAAA,CACAukB,iBAAAA,CAAA,CACAljB,WAAAA,CAAA,CACA34E,KAAAA,CAAA,CACMlxD,SAAAA,CAAA,CACN,CAAAu0B,EACA92B,EAAA,IAAAkkD,GAeA,OAdAlkD,EAAA/C,GAAA,CAAAk5C,GAAA8d,QAAA,EACAs4E,cAAA+iB,EACAljB,WAAAA,EACA34E,KAAAA,EACAld,MAAA,KAAAA,KAAA,CACKE,UAAA,KAAAA,SAAA,IAELqM,GAAAA,EAAA,GACA9iD,EAAA/C,GAAA,CAAAk5C,GAAA4L,QAAA,EACA1L,WAAAvf,EAAAi0G,gBAAA,CACA/oF,SAAAstG,EACO/sJ,SAAAugD,CACP,IAEA9iD,EAAA/C,GAAA,MAAAmzJ,gBAAA,EACA7B,YAAAA,EACAxjB,iBAAAA,EACAukB,iBAAAA,EACK/sJ,SAAAA,CACL,IAMA,OAAA6nC,MAAAtT,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAkB,kBAAAA,CAAA,CACM1kB,iBAAAA,CAAA,CACN,CAAAj0G,EACAx8B,EAAAw1G,GAAA0/C,KAAA,CACAp2J,EAAAq2E,GAAAn1E,GACA,WAAA4pD,KAAAjnD,GAAA,EACAyB,KAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACOC,WAAA,EACP,GACAF,OAAAoxG,EACAnxG,SAAA,GACOC,WAAA,EACP,GACAF,OAAA44B,GACA34B,SAAA,GACOC,WAAA,EACP,GACAF,OAAAiyD,GACAhyD,SAAA,GACOC,WAAA,EACP,GACAF,OAAA0sF,EACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAk3J,SAAAx5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACAxjB,iBAAAA,CAAA,CACA/oF,SAAAA,CAAA,CACAz/C,SAAAA,CAAA,CACMusJ,gBAAAA,CAAA,CACN,CAAAh4H,EACAx8B,EAAAw1G,GAAA6/C,QAAA,CACAv2J,EAAAq2E,GAAAn1E,EAAA,CACKiI,SAAAA,CACL,GACA7D,EAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACKC,WAAA,EACL,GACAF,OAAA2D,EACA1D,SAAA,GACKC,WAAA,EACL,GACAF,OAAA44B,GACA34B,SAAA,GACKC,WAAA,EACL,GACAF,OAAAiyD,GACAhyD,SAAA,GACKC,WAAA,EACL,GACAF,OAAA0sF,EACAzsF,SAAA,GACKC,WAAA,EACL,GAQA,OAPAuwG,GACApwJ,EAAAxH,IAAA,EACAmnD,OAAAywG,EACAxwG,SAAA,GACOC,WAAA,EACP,GAEA,IAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAm3J,WAAAz5H,CAAA,EACA,IACAy3H,YAAAA,CAAA,CACMxjB,iBAAAA,CAAA,CACN,CAAAj0G,EACAx8B,EAAAw1G,GAAA+/C,UAAA,CACAz2J,EAAAq2E,GAAAn1E,GACA,WAAA4pD,KAAAjnD,GAAA,EACAyB,KAAA,EACA2/C,OAAAkwG,EACAjwG,SAAA,GACOC,WAAA,EACP,GACAF,OAAA44B,GACA34B,SAAA,GACOC,WAAA,EACP,GACAF,OAAA0sF,EACAzsF,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,CACAw3G,GAAAn6D,SAAA,KAAAjgC,GAAA,+CAOAo6F,GAAAr6D,KAAA,IAMA,OAAAq7D,GAGAj4G,YAAA8+I,CAAA,CAAA+X,CAAA,CAAAC,CAAA,CAAA1d,CAAA,EACA,KAAA0F,UAAA,QACA,KAAA+X,eAAA,QACA,KAAAC,oBAAA,QACA,KAAA1d,UAAA,QACA,KAAA0F,UAAA,CAAAA,EACA,KAAA+X,eAAA,CAAAA,EACA,KAAAC,oBAAA,CAAAA,EACA,KAAA1d,UAAA,CAAAA,CACA,EA8BA,MAAAlhC,GAGAl4G,aAAA,EAMA,OAAA8xI,sBAAApoF,CAAA,MAIA/oD,EAHA,KAAAoxI,cAAA,CAAAroF,EAAkC5M,SAAgB,EAClD,IAAAk1F,EAAAx7H,GAAAsF,GAAA,gBACAm2H,EAAAD,EAAAl7H,MAAA,CAAA4yC,EAAAjqD,IAAA,EAEA,QAAAyyI,EAAAr6H,EAAA,GAAA/W,OAAAkC,OAAA,CAAA+zJ,IACA,GAAAl/I,EAAAzY,KAAA,EAAA6yI,EAAA,CACAtxI,EAAAuxI,EACA,MACA,GAEA,CAAAvxI,EACA,iEAEA,OAAAA,CAAA,CAMA,OAAAq2J,wBAAAttG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACMogI,SAAAA,CAAA,CACN,CAAA+L,GAAA6lB,GAAAE,iBAAA,CAAAvtG,EAAAjqD,IAAA,EACA,OACAo/I,WAAAn1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAo6F,WAAAp1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAygF,SAAA,IAAAltB,GAAA,IAAAp7F,GAAAsoH,EAAA2Z,UAAA,MAAAjiI,GAAAsoH,EAAA0xB,eAAA,MAAAh6I,GAAAsoH,EAAA2xB,oBAAA,EAAA3xB,EAAAiU,UAAA,CACA,EAMA,OAAA2b,gBAAArrG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAiwJ,cAAAA,CAAA,CACMkC,sBAAAA,CAAA,CACN,CAAAhmB,GAAA6lB,GAAA7B,SAAA,CAAAxrG,EAAAjqD,IAAA,EACA,OACAo/I,WAAAn1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA0sF,iBAAA1nF,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAovF,oBAAA,IAAAj3H,GAAAm4I,GACAkC,sBAAA,CACA93J,MAAA83J,CACA,CACA,EAMA,OAAA9B,wBAAA1rG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACAqgI,0BAAA,CACA+xB,sCAAAA,CAAA,CACAC,+BAAAA,CAAA,CACApC,cAAAA,CAAA,CACAkC,sBAAAA,CAAA,CACM,CACN,CAAAhmB,GAAA6lB,GAAAxB,iBAAA,CAAA7rG,EAAAjqD,IAAA,EACA,OACA43J,qCAAA3tG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACAyyG,sCAAA,IAAAt6I,GAAAs6I,GACAC,+BAAAA,EACAtjB,oBAAA,IAAAj3H,GAAAm4I,GACAkC,sBAAA,CACO93J,MAAA83J,CACP,EACArY,WAAAn1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqxG,eAAArsG,CAAA,EACA,KAAAqoF,cAAA,CAAAroF,EAAA5M,SAAA,EACA,KAAAs1F,cAAA,CAAA1oF,EAAA3kD,IAAA,IACA,IACM6D,SAAAA,CAAA,CACN,CAAAsoI,GAAA6lB,GAAAf,QAAA,CAAAtsG,EAAAjqD,IAAA,EACA,OACAo/I,WAAAn1F,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA4yG,2BAAA5tG,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA97C,SAAAA,EACAy/C,SAAAqB,EAAA3kD,IAAA,IAAA2/C,MAAA,CACA,CAMA,OAAAqtF,eAAAj1F,CAAA,EACA,IAAAA,EAAAoG,MAAA,CAAAi1D,GAAAr7D,SAA4C,EAC5C,iEAOA,OAAAs1F,eAAArtI,CAAA,CAAA66G,CAAA,EACA,GAAA76G,EAAA9F,MAAA,CAAA2gH,EACA,0CAAA76G,EAAA9F,MAAA,4BAAA2gH,EAAA,GAEA,CASA,IAAAm3C,GAAAj2J,OAAAquD,MAAA,EACA8nG,kBAAA,CACA73J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAqpH,KAAA,CACH,EACA+vB,UAAA,CACA91J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAlc,GAAA,iBAAA4W,GAAAsF,GAAA,2BACH,EACAk6I,SAAA,CACA52J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAtF,GAAAwF,IAAA,cACH,EACAu7I,wBAAA,CACAn4J,MAAA,EACGyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,iBACH,EACAy5I,kBAAA,CACAn2J,MAAA,GACAyY,OAAArB,GAAA7W,MAAA,EAAA6W,GAAAsF,GAAA,gBAAAspH,KAAA,CACC,IAUDptB,GAAAl3G,OAAAquD,MAAA,EACAqoG,MAAA,CACGp4J,MAAA,CACH,EACAg3J,WAAA,CACAh3J,MAAA,CACC,GAMD,OAAA+4G,GAGAn4G,aAAA,EAUA,OAAAo3D,kBAAAj6B,CAAA,EACA,IACA0hH,WAAAA,CAAA,CACAC,WAAAA,CAAA,CACM3Z,SAAAA,CAAA,CACN,CAAAhoG,EACAx8B,EAAAo2J,GAAAE,iBAAA,CACAx3J,EAAAq2E,GAAAn1E,EAAA,CACAwkI,SAAA,CACA2Z,WAAAhiI,GAAAqoH,EAAA2Z,UAAA,CAAAhiI,QAAA,IACA+5I,gBAAA/5I,GAAAqoH,EAAA0xB,eAAA,CAAA/5I,QAAA,IACAg6I,qBAAAh6I,GAAAqoH,EAAA2xB,oBAAA,CAAAh6I,QAAA,IACAs8H,WAAAjU,EAAAiU,UAAA,CAEA,GACAv0F,EAAA,CACA9/C,KAAA,EACA2/C,OAAAm6F,EACAl6F,SAAA,GACOC,WAAA,EACP,GACAF,OAAAqd,GACApd,SAAA,GACOC,WAAA,EACP,GACAF,OAAA44B,GACA34B,SAAA,GACOC,WAAA,EACP,GACAF,OAAAo6F,EACAn6F,SAAA,GACOC,WAAA,EACP,GACA9H,UAAA,KAAAA,SAAA,CACAr9C,KAAAA,CACA,EACA,WAAAqlD,GAAAD,EAAA,CAMA,OAAApI,cAAAtf,CAAA,EACA,IAAA92B,EAAA,IAAAkkD,GAQA,OAPAlkD,EAAA/C,GAAA,CAAAk5C,GAAAC,aAAA,EACAC,WAAAvf,EAAAuf,UAAA,CACAC,iBAAAxf,EAAA0hH,UAAA,CACAj2I,SAAAu0B,EAAAv0B,QAAA,CACAg0C,MAAA,KAAAA,KAAA,CACKE,UAAA,KAAAA,SAAA,IAELz2C,EAAA/C,GAAA,MAAA8zD,iBAAA,EACAynF,WAAA1hH,EAAA0hH,UAAA,CACAC,WAAA3hH,EAAAgoG,QAAA,CAAA2Z,UAAA,CACK3Z,SAAAhoG,EAAAgoG,QAAA,GACL,CAMA,OAAAoxB,UAAAp5H,CAAA,EACA,IACA0hH,WAAAA,CAAA,CACAzN,iBAAAA,CAAA,CACA0C,oBAAAA,CAAA,CACMojB,sBAAAA,CAAA,CACN,CAAA/5H,EACAx8B,EAAAo2J,GAAA7B,SAAA,CACAz1J,EAAAq2E,GAAAn1E,EAAA,CACAq0J,cAAAl4I,GAAAg3H,EAAAh3H,QAAA,IACKo6I,sBAAAA,EAAA93J,KAAA,GAEL2F,EAAA,EACA2/C,OAAAm6F,EACAl6F,SAAA,GACKC,WAAA,EACL,GACAF,OAAA44B,GACA34B,SAAA,GACKC,WAAA,EACL,GACAF,OAAA0sF,EACAzsF,SAAA,GACKC,WAAA,EACL,GACA,WAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAOA,OAAA+2J,kBAAAr5H,CAAA,EACA,IACAk6H,qCAAAA,CAAA,CACAF,sCAAAA,CAAA,CACAC,+BAAAA,CAAA,CACAtjB,oBAAAA,CAAA,CACAojB,sBAAAA,CAAA,CACMrY,WAAAA,CAAA,CACN,CAAA1hH,EACAx8B,EAAAo2J,GAAAxB,iBAAA,CACA91J,EAAAq2E,GAAAn1E,EAAA,CACAykI,0BAAA,CACA+xB,sCAAAr6I,GAAAq6I,EAAAr6I,QAAA,IACAs6I,+BAAAA,EACApC,cAAAl4I,GAAAg3H,EAAAh3H,QAAA,IACAo6I,sBAAAA,EAAA93J,KAAA,CAEA,GACA2F,EAAA,EACA2/C,OAAAm6F,EACAl6F,SAAA,GACKC,WAAA,EACL,GACAF,OAAA44B,GACA34B,SAAA,GACKC,WAAA,EACL,GACAF,OAAA2yG,EACA1yG,SAAA,GACKC,WAAA,EACL,GACA,WAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAMA,OAAAk3J,SAAAx5H,CAAA,EACA,IACA0hH,WAAAA,CAAA,CACAyY,2BAAAA,CAAA,CACA1uJ,SAAAA,CAAA,CACMy/C,SAAAA,CAAA,CACN,CAAAlrB,EACAx8B,EAAAo2J,GAAAf,QAAA,CACAv2J,EAAAq2E,GAAAn1E,EAAA,CACKiI,SAAAA,CACL,GACA7D,EAAA,EACA2/C,OAAAm6F,EACAl6F,SAAA,GACKC,WAAA,EACL,GACAF,OAAA2D,EACA1D,SAAA,GACKC,WAAA,EACL,GACAF,OAAA4yG,EACA3yG,SAAA,GACKC,WAAA,EACL,GACA,WAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,GAWA,OAAAg4J,aAAAt6H,CAAA,CAAAu6H,CAAA,CAAAC,CAAA,EACA,GAAAx6H,EAAAv0B,QAAA,CAAA8uJ,EAAAC,EACA,yEAEA,OAAAx/C,GAAAw+C,QAAA,CAAAx5H,EAAA,CAMA,OAAAy6H,wBAAAz6H,CAAA,EACA,IACA0hH,WAAAA,CAAA,CACAyY,2BAAAA,CAAA,CACMxY,WAAAA,CAAA,CACN,CAAA3hH,EACAx8B,EAAAo2J,GAAAQ,uBAAA,CACA93J,EAAAq2E,GAAAn1E,GACAoE,EAAA,EACA2/C,OAAAm6F,EACAl6F,SAAA,GACKC,WAAA,EACL,GACAF,OAAAo6F,EACAn6F,SAAA,GACKC,WAAA,EACL,GACAF,OAAA4yG,EACA3yG,SAAA,GACKC,WAAA,EACL,GACA,WAAA2F,KAAAjnD,GAAA,EACAyB,KAAAA,EACA+3C,UAAA,KAAAA,SAAA,CACKr9C,KAAAA,CACL,EACA,CACA,CACA04G,GAAAr7D,SAAA,KAAAjgC,GAAA,+CASAs7F,GAAAv7D,KAAA,MAEA,IAAA66D,GAAA,IAAA56F,GAAA,+CAWAg7I,GAAcl3J,GAAA,CACdK,KAAA8D,KACAgzJ,QAAWjzJ,GAASC,MACpBizJ,QAAWlzJ,GAASC,MACpBkzJ,QAAAnzJ,GAAmBC,MAClBmzJ,gBAAApzJ,GAAAC,KAAA,EAMD,OAAA8yG,GAOA53G,YAAAU,CAAA,CAAAkiC,CAAA,EAIA,KAAAliC,GAAA,QAIA,KAAAkiC,IAAA,QACA,KAAAliC,GAAA,CAAAA,EACA,KAAAkiC,IAAA,CAAAA,CAAA,CAUA,OAAAs1H,eAAA93I,CAAA,EACA,IAAAsqF,EAAA,IAAAtqF,EAAA,CACA+3I,EAAA5yB,GAAA76B,GACA,GAAAytD,IAAAA,EAAA,YACA,IAAAC,EAAoB,GACpB,QAAA/zJ,EAAA,EAAAA,EAAA,EAAAA,IAAA,CACA,IAAAzE,EAAA,IAAAid,GAAA2qH,GAAA98B,EAAA,EAAAqL,KACApxD,EAAA4iF,IAAAA,GAAA78B,GACA0tD,EAAA76J,IAAA,EACAqC,UAAAA,EACO+kD,SAAAA,CACP,EACA,CACA,GAAAyzG,CAAA,IAAAx4J,SAAA,CAAAsjD,MAAA,CAAAu0D,KACA2gD,CAAA,IAAAzzG,QAAA,EACA,IAAA0zG,EAAAvzB,KAAAhuH,MAAA,CAAA+iG,EAAAp7G,MAAA,CAAA2d,IAAA,CAAAsuF,IACgB9nE,EAAAphC,KAAA2f,KAAA,CAAAk3I,GAEhB,OADA10J,GAAAi/B,EAAAi1H,IACA,IAAAjgD,GAAAwgD,CAAA,IAAAx4J,SAAA,CAAAgjC,EACA,CACA,OACA,KACA,CAEA,IAAA+0E,GAAA,IAAA96F,GAAA,+CAYAy7I,GAAA9hJ,GAAA7W,MAAA,EAAAC,GAAA,cAAAA,GAAA,wBAAA4W,GAAAqF,EAAA,eAAArF,GAAAuF,IAAA,GAEAvF,GAAAqU,GAAA,CAAArU,GAAA7W,MAAA,EAAA6W,GAAAuF,IAAA,SAAAvF,GAAAsF,GAAA,wBAAAtF,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,gBAAAtF,GAAAqF,EAAA,kBAAArF,GAAAuF,IAAA,aAAAvF,GAAAuF,IAAA,GAEAvF,GAAAqU,GAAA,CAAArU,GAAA7W,MAAA,EAAA6W,GAAAuF,IAAA,UAAAnc,GAAA,qBAAA4W,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,2BAAAtF,GAAA7W,MAAA,EAAA6W,GAAAqU,GAAA,CAAArU,GAAA7W,MAAA,EAAAC,GAAA,oBAAA4W,GAAAuF,IAAA,gCAAAvF,GAAAuF,IAAA,4BAAAvF,GAAAuF,IAAA,QAAAvF,GAAAqF,EAAA,4BAAArF,GAAAuF,IAAA,GAEAvF,GAAAqU,GAAA,CAAArU,GAAA7W,MAAA,EAAA6W,GAAAuF,IAAA,UAAAvF,GAAAuF,IAAA,YAAAvF,GAAAuF,IAAA,kBAAAvF,GAAAQ,MAAA,CAAAR,GAAAsF,GAAA,uBAAAtF,GAAA7W,MAAA,EAAA6W,GAAAuF,IAAA,SAAAvF,GAAAuF,IAAA,iCAIA,OAAAg8F,GAIA/3G,YAAAuH,CAAA,EACA,KAAAu3I,UAAA,QACA,KAAAgY,oBAAA,QACA,KAAA1d,UAAA,QACA,KAAA+F,QAAA,QACA,KAAAoZ,KAAA,QACA,KAAAC,gBAAA,QACA,KAAAC,WAAA,QACA,KAAAxZ,YAAA,QACA,KAAAyZ,aAAA,QACA,KAAA5Z,UAAA,CAAAv3I,EAAAu3I,UAAA,CACA,KAAAgY,oBAAA,CAAAvvJ,EAAAuvJ,oBAAA,CACA,KAAA1d,UAAA,CAAA7xI,EAAA6xI,UAAA,CACA,KAAA+F,QAAA,CAAA53I,EAAA43I,QAAA,CACA,KAAAoZ,KAAA,CAAAhxJ,EAAAgxJ,KAAA,CACA,KAAAC,gBAAA,CAAAjxJ,EAAAixJ,gBAAA,CACA,KAAAC,WAAA,CAAAlxJ,EAAAkxJ,WAAA,CACA,KAAAxZ,YAAA,CAAA13I,EAAA03I,YAAA,CACA,KAAAyZ,aAAA,CAAAnxJ,EAAAmxJ,aAAA,CASA,OAAApnB,gBAAAlxH,CAAA,EACA,IAAAu4I,EAAA,EACAC,EAAAN,GAAAxhJ,MAAA,CAAAgG,GAAAsD,GAAAu4I,GACAxZ,EAAAyZ,EAAAzZ,QAAA,CAIA,OAHAyZ,EAAAC,aAAA,EACA1Z,CAAAA,EAAA,MAEA,IAAApnC,GAAA,CACA+mC,WAAA,IAAAjiI,GAAA+7I,EAAA9Z,UAAA,EACAgY,qBAAA,IAAAj6I,GAAA+7I,EAAA9B,oBAAA,EACA1d,WAAAwf,EAAAxf,UAAA,CACAmf,MAAAK,EAAAL,KAAA,CACApZ,SAAAA,EACAqZ,iBAAAI,EAAAJ,gBAAA,CAAAt5J,GAAA,CAAA45J,IACAL,YAAAM,GAAAH,EAAAH,WAAA,EACAxZ,aAAA2Z,EAAA3Z,YAAA,CACKyZ,cAAAE,EAAAF,aAAA,EAEL,CACA,CACA,SAAAI,GAAA,CACAjC,gBAAAA,CAAA,CACCxgB,MAAAA,CAAA,CACD,EACA,OACAA,MAAAA,EACAwgB,gBAAA,IAAAh6I,GAAAg6I,EACA,CACA,CACA,SAAAmC,GAAA,CACA5nB,iBAAAA,CAAA,CACA6nB,4BAAAA,CAAA,CACCC,YAAAA,CAAA,CACD,EACA,OACA9nB,iBAAA,IAAAv0H,GAAAu0H,GACA6nB,4BAAAA,EACAC,YAAAA,CACA,CACA,CACA,SAAAH,GAAA,CACAh5I,IAAAA,CAAA,CACA5Z,IAAAA,CAAA,CACCojC,QAAAA,CAAA,CACD,SACA,EACA,GAEA,IAAAxpB,EAAA1gB,KAAA,CAAA8G,EAAA,GAAAjH,GAAA,CAAA85J,OAAAj5I,EAAA1gB,KAAA,GAAA8G,GAAAjH,GAAA,CAAA85J,IAAA,CAGA,IAAArtE,GAAA,CACAwtE,KAAA,CACApzE,OAAA,+BACAE,QAAA,gCACG,oDACH,EACAmzE,MAAA,CACArzE,OAAA,gCACAE,QAAA,iCACA,qDACA,CACA,EAQA,SAAAmyB,GAAArqB,CAAA,CAAAsrE,CAAA,EACA,IAAA34J,EAAA24J,CAAA,IAAAA,EAAA,eACA,IAAAtrE,EACA,OAAApC,EAAA,CAAAjrF,EAAA,QAEA,IAAA2I,EAAAsiF,EAAA,CAAAjrF,EAAA,CAAAqtF,EAAA,CACA,IAAA1kF,EACA,uBAAA3I,EAAA,YAAAqtF,EAAA,GAEA,OAAA1kF,CAAA,CAsBA,eAAAc,GAAAxE,CAAA,CAAAgG,CAAA,CAAA2tJ,CAAA,CAAAC,CAAA,MACAC,EACAn3J,CACAi3J,CAAAA,GAAAx4J,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA4sJ,EAAA,yBACAE,EAAAF,EACIj3J,EAAAk3J,GACJD,GAAAx4J,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA4sJ,EAAA,eACAE,EAAAF,EACIj3J,EAAAk3J,GAEJl3J,EAAAi3J,EAEA,IAAA1tJ,EAAAvJ,GAAA,CACAwJ,cAAAxJ,EAAAwJ,aAAA,CACA1C,oBAAA9G,EAAA8G,mBAAA,EAAA9G,EAAAyD,UAAA,CACAomI,eAAA7pI,EAAA6pI,cAAA,EAEA1hI,EAAA,MAAA7E,EAAAmG,kBAAA,CAAAH,EAAAC,GACA9F,EAAAzD,GAAAA,EAAAyD,UAAA,CACA8hJ,EAAA4R,EAAA7zJ,EAAAqG,kBAAA,CAAAwtJ,EAAA1zJ,GAAAH,EAAAqG,kBAAA,CAAAxB,EAAA1E,EAAA,CACAiG,EAAA,OAAA67I,CAAA,EAAAnnJ,KAAA,CACA,GAAAsL,EAAAtD,GAAA,EACA,GAAA+B,IAAA,EAAAA,EACA,UAAAxC,GAAA,CACA24B,OAAA/0B,GAAAC,cAAA,kBACArB,UAAAA,EACO6kI,mBAAA,YAAA7tI,KAAAC,SAAA,CAAAsK,GAAA,IACP,OAEA,yBAAAvB,EAAA,WAAAhJ,KAAAC,SAAA,CAAAsK,GAAA,IACA,OACAvB,CAAA,CAKA,IAAA8qG,GAAA,GAGA,cAAAx3G,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECtsUA,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAtpB,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECHa,iBAkBbgkF,EACAA,EAjBA5gF,OAAA8L,cAAmB,CAAA7O,EAAA,aAAkB,CAAA0C,MAAgB,EAAG,GACxD1C,EAAA8jF,QAAgB,CAAA9jF,EAAA+jF,OAAA,CAAQ/jF,EAAO2jF,QAAA,CAAA3jF,EAAA0jF,GAAA,CAAA1jF,EAAAmhD,GAAA,CAAAnhD,EAAAohD,IAAA,QAC/B,IAAAuhC,EAAAhjF,EAAA,MACA+7J,EAAA/4E,EAAA/3D,eAAA,CAAAjrB,EAAA,MAIAK,CAAAA,EAAAohD,IAAA,CAAAs6G,EAAA50I,OAAA,CAAAyjC,MAAA,IAIAvqD,EAAAmhD,GAAA,CAAAu6G,EAAA50I,OAAA,CAAAyjC,MAAA,IAIAvqD,EAAA0jF,GAAA,CAAAg4E,EAAA50I,OAAA,CAAAyjC,MAAA,KAGAo5B,CADAA,EAIAA,EAAA3jF,EAAe2jF,QAAA,EAAA3jF,CAAAA,EAAA2jF,QAAA,KAHf,CAAAA,EAAA,2BACAA,CAAA,CAAAA,EAAA,iCACCA,CAAA,CAAAA,EAAA,SAAkC,cAEnC3jF,EAAA+jF,OAAA,CAAgB23E,EAAA50I,OAAA,CAAAyjC,MAAA,uBAChBvqD,EAAA8jF,QAAA,CAAA43E,EAAA50I,OAAA,CAAAyjC,MAAA,sFAAA9qD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECzBa,aAQboD,OAAA8L,cAAoB,CAAA7O,EAAA,aAAwB,CAAA0C,MAAA,KAC5C1C,EAAA27J,SAAgB,CAAA37J,EAAA47J,aAAe,CAAA57J,EAAA67J,6BAAA,CAAA77J,EAAA87J,qBAAA,CAAA97J,EAAA+7J,qBAAA,QAC/B,IAAAp5E,EAAAhjF,EAAA,MACAq8J,EAAAr5E,EAAA/3D,eAAA,CAAAjrB,EAAmD,OACnDs8J,EAAAt5E,EAAA/3D,eAAiD,CAAAjrB,EAAQ,OACzDwnD,EAAuBw7B,EAAA/3D,eAAwB,CAAAjrB,EAAA,OAC/Cu8J,EAAAv8J,EAA6B,KAC7BK,CAAAA,EAAA+7J,qBAAA,EACA,CAAAG,EAAAv4E,QAAA,CAAAw4E,UAAA,EAAAF,EAAAn1I,OAAA,CAAAq1I,UAAA,CACA,CAAAD,EAAAv4E,QAAA,CAAAy4E,aAAA,EAAAH,EAAAn1I,OAAA,CAAAs1I,aAAA,CACA,CAAAF,EAAAv4E,QAAA,CAAA04E,QAAA,EAAAJ,EAAAn1I,OAAA,CAAAu1I,QAAA,EAEA,IAAAC,EAAA,CACA,CAAAJ,EAAAv4E,QAAA,CAAAw4E,UAAA,EAAAH,EAAAl1I,OAAA,CAAAy1I,SAAA,CACA,CAAAL,EAAAv4E,QAAA,CAAAy4E,aAAA,EAAAJ,EAAAl1I,OAAA,CAAA01I,WAAA,CACA,CAAAN,EAAAv4E,QAAA,CAAA04E,QAAA,EAAAL,EAAAl1I,OAAA,CAAA21I,OAAA,CAKAz8J,CAAAA,EAAA87J,qBAAA,EACAY,iBAAA,IACAC,eAAA,GACAC,UAAA,EACAC,SAAAX,EAAAv4E,QAAA,CAAAw4E,UAAA,EAKAn8J,EAAA67J,6BAAA,EACA,GAAA77J,EAAA87J,qBAAA,CACAa,eAAA,GACA,EACA,IAAAG,EAAA,CAAAxwI,EAAAywI,EAAAC,EAAAC,EAAA,CAAAP,iBAAAA,EAAA18J,EAAA87J,qBAAA,CAAAY,gBAAA,CAAAC,eAAAA,EAAA38J,EAAA87J,qBAAA,CAAAa,cAAA,CAAAC,UAAAA,EAAA58J,EAAA87J,qBAAA,CAAAc,SAAA,CAAAC,SAAAA,EAAA78J,EAAA87J,qBAAA,CAAAe,QAAA,EAAA78J,EAAA87J,qBAAA,IACA,IAAAoB,EAAA5wI,EACA,IAAA4wI,EAAA71J,CAAA,EAAA61J,IAAAA,EAA+B71J,CAAA,CAC/B,OAAAilB,EAAArjB,QAAA,EACA,CACA,IAAAk0J,EAAAC,EAAA,CAAA9wI,EACAghB,OAAA,CAAA2vH,EAAAD,UAAAA,EACAV,CAAA,CAAAO,EAAA,CACA78J,EAAA+7J,qBAAA,CAAAc,EAAA,EACAhiJ,KAAA,MACA,GAAAssC,EAAArgC,OAAA,EAAAq2I,GACA,IAAAE,EAAAF,EACA,GAAAR,EAAA,CAEA,IAAAW,EAAAP,EAAAI,EAAA77J,KAAA,IAAA67J,CAAA,CAEAI,EAAAD,EAAAp8J,MAAA,CACA,GAAA07J,EAAA,GAAAW,EAAA,GACA,IAAAj3J,EAAAi3J,EAAAX,GAAAA,EAEA,IADAS,EAA2BC,EAAAh8J,KAAA,GAAAgF,GAC3BA,EAAAi3J,EAAAj3J,GAAAs2J,EACAS,GAAAV,EAAAW,EAAAh8J,KAAA,CAAAgF,EAAAA,EAAAs2J,GAEAG,GACAM,CAAAA,EAAA,IAAAA,CAAA,CAEA,EACA,OACA,EACAA,EAAAX,CAAAA,MAAAA,EAAAA,EAAA,IAAAU,EAGAC,CACA,EAiDAzB,EAAA,CAAA4B,EAAAP,EAAAQ,EAAAz9J,EAAA87J,qBAAA,GACAgB,EAAAU,EAAAA,EAAAT,UAAA,iBAAAE,EAAAQ,EAEAz9J,CAAAA,EAAA47J,aAAA,CAAAA,EAgDA,IAAAD,EAAA,CAAA+B,EAAAT,EAAAQ,EAAAz9J,EAAA87J,qBAAA,GACAgB,EAAAY,EAAAA,KAAAA,EAAA14J,CAAA,SAAAi4J,EAAAQ,EAEAz9J,CAAAA,EAAA27J,SAAA,CAAAA,CAAA,gBAAAl8J,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjLa,aAEboD,OAAA8L,cAAmB,CAAA7O,EAAA,aAA0B,CAAA0C,MAAA,KAC7C1C,EAAAikF,QAAgB,CAAAjkF,EAAA29J,kBAAe,QAC/B,IAAAh7E,EAAAhjF,EAAA,MACAq8J,EAAAr5E,EAAA/3D,eAAA,CAAAjrB,EAAmD,OACnDs8J,EAAAt5E,EAAA/3D,eAAuC,CAAAjrB,EAAc,OACrD+7J,EAAA/4E,EAAA/3D,eAAA,CAAAjrB,EAAiD,OACjDwnD,EAAuBw7B,EAAA/3D,eAAwB,CAAAjrB,EAAA,OAC/Cu8J,EAAoBv8J,EAAQ,MAC5Bi+J,EAAmBj+J,EAAQ,MAC3BywF,EAAAzwF,EAAA,MAMAk+J,EAAA,IACA,GAAA55E,EAAA65E,UAAA,CAAAC,GACA,OAAAA,CACA,CACA,IACA,WAAA95E,EAAA,GAAAmM,EAAAvM,cAAA,EAAAk6E,GACA,CACA,MAAA12J,EAAA,CACA,GAAAA,aAAAqG,MACA,yCAAArG,EAAAhF,OAAA,UAEA,kCAEA,EAMAs7J,EAAA,EAAAK,aAAAA,CAAA,CAAAC,eAAAA,CAAA,IACA,IAAAh6E,EAAA+5E,EAAAC,EAEAj+J,CAAAA,EAAA29J,kBAAA,CAAAA,CAIA,OAAA15E,EACAhiF,YAAAsgD,CAAA,CAAAC,EAAA05G,EAAA/6G,GAAA,EACA,KAAA28G,UAAA,IACA,KAAAv7G,SAAA,IAAA6tC,EAAAvM,cAAA,EAAAthC,GACA,KAAAC,WAAA,IAAA4tC,EAAAvM,cAAA,EAAArhC,EACA,CACA,IAAAw7G,cAAA,CACA,YAAAz7G,SAAA,CAAAt5C,QAAA,EACA,CACA,IAAAg1J,gBAAA,CACA,YAAA17G,SAAA,CAAAt5C,QAAA,EACA,CAMA,OAAAu7F,WAAA5/D,CAAA,SACA,aAAAq/C,EACAr/C,EAEA,GAAA5kC,EAAA29J,kBAAA,EAAA/4H,EADA,CAMA4iD,QAAA,CACA,OACAs2E,WAAA,GACAE,aAAA,KAAAz7G,SAAA,CAAAt5C,QAAA,GACAg1J,eAAA,KAAAz7G,WAAA,CAAAv5C,QAAA,EACA,CACA,CAOA,OAAA60J,WAAAl5H,CAAA,EACA,uBAAAA,GACAA,IAAA,GAAAA,GACA,cAAAA,GACA,gBAAAA,CACA,CAIAs5H,UAAAt5H,CAAA,SACA,KAAAu5H,OAAA,CAAAv5H,GACA,EAEA,KAAAw5H,WAAA,CAAAx5H,GAAA,KAQA,OAAA4b,WAAA55C,CAAA,CAAA8hD,EAAA,IACA,IAAA21G,EAAAr9J,KAAAs/C,GAAA,IAAAoI,GACA,WAAAu7B,EAAAjjF,KAAAwZ,KAAA,CAAA5T,EAAAy3J,GAAAA,EACA,CAIA,IAAAC,UAAA,CACA,OAAA5C,EAAA50I,OAAA,CAAAy3I,MAAA,MAAAh8G,SAAA,MAAAC,WAAA,CACA,CAIA,IAAAg8G,WAAA,CACA,WAAAv6E,EAAAy3E,EAAA50I,OAAA,CAAA03I,SAAA,MAAAj8G,SAAA,MAAAC,WAAA,OAAAA,WAAA,CACA,CAKA2hE,QAAA,CACA,WAAAlgC,EAAA,KAAAzhC,WAAA,MAAAD,SAAA,CACA,CACAh9C,IAAAq/B,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,UACA,EAAA9d,OAAA,CAAA4pF,KAAA,MAAAluD,WAAA,CAAAi8G,EAAAj8G,WAAA,EACA,IAAAyhC,EAAAy3E,EAAA50I,OAAA,CAAAvhB,GAAA,MAAAg9C,SAAA,CAAAk8G,EAAAl8G,SAAA,OAAAC,WAAA,EAEA,IAAAyhC,EAAAy3E,EAAA50I,OAAA,CAAAvhB,GAAA,CAAAm2J,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAyxC,EAAAl8G,SAAA,MAAAC,WAAA,GAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAxqE,WAAA,CAAAi8G,EAAAj8G,WAAA,EADA,CAGAsqE,SAAAloF,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,UACA,EAAA9d,OAAA,CAAA4pF,KAAA,MAAAluD,WAAA,CAAAi8G,EAAAj8G,WAAA,EACA,IAAAyhC,EAAAy3E,EAAA50I,OAAA,CAAAgmG,QAAA,MAAAvqE,SAAA,CAAAk8G,EAAAl8G,SAAA,OAAAC,WAAA,EAEA,IAAAyhC,EAAAy3E,EAAA50I,OAAA,CAAAgmG,QAAA,CAAA4uC,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAyxC,EAAAl8G,SAAA,MAAAC,WAAA,GAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAxqE,WAAA,CAAAi8G,EAAAj8G,WAAA,EADA,CAGAk8G,SAAA95H,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,GACA,OAAA82H,EAAA50I,OAAA,CAAA43I,QAAA,CAAAhD,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAyxC,EAAAl8G,SAAA,MAAAC,WAAA,EACA,CACA27G,QAAAv5H,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,GACA,OAAA82H,EAAA50I,OAAA,CAAA4pF,KAAA,CAAAgrD,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAyxC,EAAAl8G,SAAA,MAAAC,WAAA,EACA,CACA47G,YAAAx5H,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,GACA,OAAA82H,EAAA50I,OAAA,CAAAs3I,WAAA,CAAA1C,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAyxC,EAAAl8G,SAAA,MAAAC,WAAA,EACA,CACAwqE,SAAApoF,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,GACA,WAAAq/C,EAAAy3E,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAl8G,SAAA,EAAAm5G,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAxqE,WAAA,CAAAi8G,EAAAj8G,WAAA,EACA,CAIA+7G,OAAA35H,CAAA,EACA,IAAA65H,EAAAZ,EAAAj5H,GACA,WAAAq/C,EAAAy3E,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAzqE,SAAA,CAAAk8G,EAAAj8G,WAAA,EAAAk5G,EAAA50I,OAAA,CAAAkmG,QAAA,MAAAxqE,WAAA,CAAAi8G,EAAAl8G,SAAA,EACA,CAQAo8G,cAAAC,CAAA,CAAAxoG,EAAA,CAAAumG,eAAA,IAAAE,EAA8EX,EAAAv4E,QAAmB,CAAAy4E,aAAA,EACjG,GAAAj1G,EAAArgC,OAAA,EAAAlO,OAAAC,SAAA,CAAA+lJ,GAAgE,GAAAA,EAAmB,sBACnF,GAAAz3G,EAAArgC,OAAA,EAAA83I,EAAA,KAAAA,EAAA,oBACA3C,EAAAn1I,OAAA,CAAAzhB,GAAA,EACAw5J,UAAAD,EAAA,EACS/B,SAAAe,EAAA7B,qBAAA,CAAAc,EAAA,GAET,IAAAyB,EAAA,IAAArC,EAAAn1I,OAAA,MAAAy7B,SAAA,CAAAt5C,QAAA,IACAo3C,GAAA,MAAAmC,WAAA,CAAAv5C,QAAA,IACA61J,mBAAA,CAAAF,GACA,SAAAhB,EAAAhC,aAAA,EAAA0C,EAAAA,EAAArB,aAAA,IACA,GAAA7mG,CAAA,CACSymG,SAAAA,CACT,EACA,CACAvvH,QAAA2vH,CAAA,CAAA7mG,EAAA,CAAAumG,eAAA,IAAAE,EAAAX,EAA0Ev4E,QAAe,CAAAy4E,aAAA,EAGzF,MAFA,GAAAj1G,EAAArgC,OAAA,EAAAlO,OAAAC,SAAA,CAAAokJ,GAA6D,GAAAA,EAAe,sBAC5E,GAAA91G,EAAArgC,OAAA,EAAAm2I,GAAA,KAAAA,EAAA,gBACA,GAAAW,EAAAjC,SAAA,MAAAK,EAAAl1I,OAAA,MAAAy7B,SAAA,CAAAt5C,QAAA,IAAAo3C,GAAA,MAAAmC,WAAA,CAAAv5C,QAAA,IAAAg0J,EAAA,IAAA7mG,CAAA,CAAAymG,SAAAA,CAAA,EACA,CAIA,IAAAkC,YAAA,CACA,WAAA96E,EAAA,KAAA1hC,SAAA,MAAAC,WAAA,CACA,CAIA,IAAAw8G,UAAA,CACA,GAAAtD,EAAA50I,OAAA,CAAA4pF,KAAA,MAAAluD,WAAA,CAAA05G,EAAA96G,IAAA,EACA,OAAAs6G,EAAA50I,OAAA,CAAAs3I,WAAA,MAAA77G,SAAA,CAAA25G,EAAA96G,IAAA,EACAxoC,OAAAqmJ,iBAAA,CACAvD,EAAA50I,OAAA,CAAA43I,QAAA,MAAAn8G,SAAA,CAAA25G,EAAA96G,IAAA,EACAxoC,OAAAsmJ,iBAAA,CACAtmJ,OAAAuqF,GAAA,CAEA,IAAAl/F,EAAAy3J,EAAA50I,OAAA,CAAAxI,QAAA,MAAAikC,SAAA,EAAAm5G,EAAA50I,OAAA,CAAAxI,QAAA,MAAAkkC,WAAA,SACA,OAAA37C,KAAA,CAAA5C,GAGA6oC,WAAA,KAAAQ,OAAA,MAFArpC,CACA,CAOAk7J,QAAA,CACA,OAAAzD,EAAA50I,OAAA,CAAAs4I,EAAA,MAAA78G,SAAA,CAAA25G,EAAA96G,IAAA,GAAAs6G,EAAA50I,OAAA,CAAAu4I,EAAA,MAAA78G,WAAA,CAAA05G,EAAA96G,IAAA,CACA,CAKAk+G,WAAA,CACA,YAAAH,MAAA,EACA,CACA,CACAn/J,EAAAikF,QAAA,CAAAA,EACAA,EAAA7iC,IAAA,KAAA6iC,EAAA,GACAA,EAAA9iC,GAAA,KAAA8iC,EAAA,kBAAAxkF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECtOa,aAEboD,OAAA8L,cAAgB,CAAA7O,EAAA,aAAe,CAAA0C,MAAA,KAC/B,IAAAigF,EAAAhjF,EAAqB,MACrBgjF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAeK,GAC5C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAcK,GAC3C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAkBK,GAC/C2iF,EAAA1iC,YAAA,CAAqBtgD,EAAQ,MAAYK,GACzC2iF,EAAA1iC,YAAA,CAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECVa,aAEboD,OAAA8L,cAAe,CAAA7O,EAAA,cAAA0C,MAAA,KACf1C,EAAA4jF,OAAA,MAAsB,EACtB,IAAA27E,EAAA5/J,EAAA,MACA6/J,EAAA,IAAAD,EAAAt7E,QAAA,MAKA,SAAAw7E,EAAAC,CAAA,EACA,WAAA97E,EAAA87E,EAAAn9G,SAAA,CAAAm9G,EAAAl9G,WAAA,CACA,CACA,MAAAohC,UAAA27E,EAAAt7E,QAAA,CACAhiF,aAAA,CACA,SAAAm3B,WAIA,KAAAumI,SAAA,GACA,CAOA,OAAAn/G,WAAA55C,CAAA,CAAA8hD,EAAA,IACA,IAAAk3G,EAAAL,EAAAt7E,QAAA,CAAAzjC,UAAA,CAAA55C,EAAA8hD,GACA,WAAAk7B,EAAAg8E,EAAAr9G,SAAA,CAAAq9G,EAAAp9G,WAAA,CACA,CAMA,OAAAgiD,WAAA5/D,CAAA,SACA,aAAAg/C,EACAh/C,EAEA66H,EAAAF,EAAAt7E,QAAA,CAAAugB,UAAA,CAAA5/D,GADA,CAMA4iD,QAAA,CACA,OACA,SAAAA,MAAA,GACAm4E,UAAA,EACA,CACA,CAIA,OAAAj9G,aAAAg9G,CAAA,EACA,OAAAD,EAAAC,EACA,CAKA,OAAAG,QAAAC,CAAA,EACA,WAAAl8E,EAAAk8E,EAAA,IACA,CACAv6J,IAAAq/B,CAAA,EACA,OAAA66H,EAAA,MAAAl6J,GAAA,CAAAq/B,GACA,CACAkoF,SAAAloF,CAAA,EACA,OAAA66H,EAAA,MAAA3yC,QAAA,CAAAloF,GACA,CACAooF,SAAApoF,CAAA,EACA,OAAA66H,EAAA,MAAAzyC,QAAA,CAAApoF,GACA,CACA25H,OAAA35H,CAAA,EACA,OAAA66H,EAAA,MAAAlB,MAAA,CAAA35H,GACA,CAKAu/E,QAAA,CACA,WAAAvgC,EAAA,KAAAphC,WAAA,MAAAD,SAAA,CACA,CACAo8G,cAAAC,EAAA,EAAAxoG,CAAA,CAAAymG,CAAA,EACA,aACA7vC,QAAA,CAAAwyC,GACAb,aAAA,CAAAC,EAAAxoG,EAAAymG,EACA,CACAvvH,QAAA2vH,EAAA,EAAA7mG,CAAA,CAAAymG,CAAA,EACA,aAAA7vC,QAAA,CAAAwyC,GAAAlyH,OAAA,CAAA2vH,EAAA7mG,EAAAymG,EACA,CAOA,OAAA8C,UAAA/6H,CAAA,EACA,OAAA26H,EAAAt7E,QAAA,CAAA65E,UAAA,CAAAl5H,IACA,CAAAA,MAAAA,EAAA,OAAAA,EAAA+6H,SAAA,MACA,CACA,CACA3/J,EAAA4jF,OAAA,CAAAA,EAIAA,EAAAxiC,IAAA,KAAAwiC,EAAA,GAIAA,EAAAziC,GAAA,KAAAyiC,EAAA,OAIAA,EAAA47E,WAAA,KAAA57E,EAAA,kBAAAnkF,CAAA,CAAAO,CAAA,CAAAL,CAAA,EClHa,aAEboD,OAAA8L,cAAa,CAAA7O,EAAA,cAAA0C,MAAA,KACb1C,EAAAgmF,KAAA,CAAgB,OAChB,IAAArD,EAAAhjF,EAAA,MACAwnD,EAAsBw7B,EAAA/3D,eAAuB,CAAAjrB,EAAA,OAC7C4/J,EAAmB5/J,EAAQ,MAC3BywF,EAAAzwF,EAAA,KACA,OAAAqmF,UAAAu5E,EAAAt7E,QAAA,CASAhiF,YAAAgkF,CAAA,CAAAC,CAAA,CAAA1jC,CAAA,CAAAD,CAAA,EACA,SAAA6tC,EAAAvM,cAAA,EAAAthC,GAAA,GAAA6tC,EAAAvM,cAAA,EAAArhC,IACA,KAAAyjC,YAAA,CAAAA,EACA,KAAAC,aAAA,CAAAA,EACA,KAAA+mC,MAAA,KAAAsyC,EAAAt7E,QAAA,IAAAmM,EAAApM,qBAAA,EAAAiC,EAAAv9B,QAAA,KAAA0nC,EAAApM,qBAAA,EAAAkC,EAAAx9B,QAAA,EACA,CACA,IAAAxqB,KAAA,CACA,WAAAqhI,EAAAt7E,QAAA,MAAA1hC,SAAA,MAAAC,WAAA,CACA,CACA,IAAAu9G,UAAA,CACA,aAAA/yC,QAAA,MAAAC,MAAA,CACA,CACA9I,QAAA,CACA,YAAAh+B,GAAA,MAAAD,aAAA,MAAAD,YAAA,MAAA1jC,SAAA,MAAAC,WAAA,CACA,CACAwqE,SAAApoF,CAAA,EACA,GAAAuiB,EAAArgC,OAAA,OAAAo/D,aAAA,CAAA/gC,MAAA,CAAAvgB,EAAAqhD,YAAA,mCAAAC,aAAA,CAAAj9E,QAAA,UAAA27B,EAAAqhD,YAAA,CAAAh9E,QAAA,MACA,IAAAy2J,EAAA,MAAA1yC,QAAA,CAAApoF,GACA,YAAAuhD,GAAA,MAAAF,YAAA,CAAArhD,EAAAshD,aAAA,CAAAw5E,EAAAl9G,WAAA,CAAAk9G,EAAAn9G,SAAA,CACA,CAEAy9G,MAAAC,CAAA,EAEA,MADA,GAAA94G,EAAArgC,OAAA,EAAAm5I,EAAAhuI,KAAA,CAAAkzB,MAAA,MAAA8gC,YAAA,2BAAAg6E,EAAAhuI,KAAA,CAAAhpB,QAAA,eAAAg9E,YAAA,CAAAh9E,QAAA,MACAg3J,EAAA95E,GAAA,MAAAD,aAAA,OAAA8mC,QAAA,CAAAizC,EAAA/hI,GAAA,EAAAogI,QAAA,CACA,CACAK,cAAAC,EAAA,EAAAxoG,CAAA,CAAAymG,CAAA,EACA,YAAAkD,QAAA,CAAApB,aAAA,CAAAC,EAAAxoG,EAAAymG,EACA,CACAvvH,QAAA2vH,EAAA,EAAA7mG,CAAA,CAAAymG,CAAA,EACA,YAAAkD,QAAA,CAAAzyH,OAAA,CAAA2vH,EAAA7mG,EAAAymG,EACA,CAOAqD,aAAA9pG,EAAA,CAAAumG,eAAA,IAAAE,CAAA,EACA,YAAAvvH,OAAA,MAAA44C,aAAA,CAAAx9B,QAAA,CAAA0N,EAAAymG,EACA,CACA,IAAAmC,UAAA,CACA,YAAAe,QAAA,CAAAf,QAAA,CAEA,CACAh/J,EAAAgmF,KAAA,CAAAA,CAAA,gBAAAvmF,CAAA,CAAAO,CAAA,EC7Da,aAEb+C,OAAA8L,cAAA,CAAA7O,EAAA,cAAA0C,MAAA,oBAAAjD,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECFa,aAEb,IAAA8I,EAAAgD,EACA1I,OAAA8L,cAAmB,CAAG7O,EAAA,cAAA0C,MAA8B,KACpD1C,EAAAqoF,WAAgB,CAAAroF,EAAAmgK,mBAAe,CAAAngK,EAAAwjF,YAAA,CAAAxjF,EAAAyjF,WAAA,CAAAzjF,EAAAogK,oBAAA,CAAApgK,EAAAqgK,mBAAA,CAAArgK,EAAAuoF,qBAAA,CAAAvoF,EAAAsgK,uBAAA,CAAAtgK,EAAAugK,yBAAA,CAAAvgK,EAAAwgK,8BAAA,CAAAxgK,EAAAygK,gCAAA,CAAAzgK,EAAA0gK,iBAAA,CAAA1gK,EAAA2gK,mBAAA,CAAA3gK,EAAA4gK,YAAA,QAC/B,IAAAj+E,EAAAhjF,EAAA,MACAq8J,EAAAr5E,EAAA/3D,eAAuC,CAAAjrB,EAAQ,OAC/C+7J,EAAA/4E,EAAA/3D,eAAA,CAAAjrB,EAAiD,OACjDwnD,EAAuBw7B,EAAA/3D,eAAwB,CAAAjrB,EAAA,OAC/Cu8J,EAAoBv8J,EAAQ,MAC5Bi+J,EAAAj+J,EAAsB,MACtB4/J,EAAqB5/J,EAAQ,MAC7BkhK,EAAmBlhK,EAAQ,MAC3BywF,EAAAzwF,EAAA,MAUAihK,EAAA,CAAAE,EAAAv2I,IAAA,CACA,IAAA9hB,EACA,IAAAs4J,EAAA,OACA,WAEA,GAFAt4J,CAAAA,EAAAu4J,KAAAC,YAAA,CAAA12I,GACA22I,aAAA,CAAAH,GACA35J,IAAA,IAAA+5J,EAAAv+J,IAAA,GAAAk+J,EAAA,GAAAr4J,KAAA,IAAAA,EAAA,OAAAA,EAAA/F,KAAA,CAEA1C,CAAAA,EAAA4gK,YAAA,CAAAA,EASA,IAAAD,EAAA,GACA,GAAA3gK,EAAA4gK,YAAA,YAAAr2I,EAEAvqB,CAAAA,EAAA2gK,mBAAA,CAAAA,EASA,IAAAD,EAAA,GACA,GAAA1gK,EAAA4gK,YAAA,UAAAr2I,EAEAvqB,CAAAA,EAAA0gK,iBAAA,CAAAA,EAIA1gK,EAAAygK,gCAAA,QAAAh4J,CAAAA,EAAA,GAAAzI,EAAA2gK,mBAAA,MAAAl4J,KAAA,IAAAA,EAAAA,EAAA,IAIAzI,EAAAwgK,8BAAA,QAAA/0J,CAAAA,EAAA,GAAAzL,EAAA0gK,iBAAA,MAAAj1J,KAAA,IAAAA,EAAAA,EAAA,IAIAzL,EAAAugK,yBAAA,KAIAvgK,EAAAsgK,uBAAA,KAOA,IAAA/3E,EAAA,CAAAt2D,EAAAq2D,EAAAo0E,EAAA18J,EAAAugK,yBAAA,CAAA5D,EAAA38J,EAAAsgK,uBAAA,IACA,IAAA17I,EAAA0jE,EAAAztE,KAAA,CAAA6hJ,GACA,GAAA93I,IAAAA,EAAA1jB,MAAA,CACA,4BAEA,IAAAkgK,EAAAC,EAAA,CAAAz8I,EACA08I,EAAAF,EACA1F,EAAA50I,OAAA,CAAAyjC,MAAA,CAAA62G,EAAAvmJ,KAAA,CAAA8hJ,GAAAl6J,IAAA,MACAy5J,EAAA96G,IAAA,CACAs+G,EAAA2B,EACA3F,EAAA50I,OAAA,CAAAyjC,MAAA,CAAA82G,EAAA//J,KAAA,GAAA2wB,EAAAy2B,QAAA,EACA5nD,MAAAmxB,EAAAy2B,QAAA,EAAAysC,IAAA,MAAA7zF,KAAA,CAAA+/J,EAAAngK,MAAA,EAAAuB,IAAA,MACAy5J,EAAA96G,IAAA,CACAmgH,EAAA7F,EAAA50I,OAAA,CAAAvhB,GAAA,CAAAm2J,EAAA50I,OAAA,CAAAkmG,QAAA,CAAAs0C,EAAA,GAAAlxE,EAAApM,qBAAA,EAAA/xD,EAAAy2B,QAAA,GAAAg3G,GACA,OAAA6B,CACA,CACAvhK,CAAAA,EAAAuoF,qBAAA,CAAAA,CAIA,OAAA83E,UAAA/zD,WACArqG,YAAAW,CAAA,CAAAunD,CAAA,EACA,gCAAAvnD,EAAA,IAAAunD,EAAAlhD,QAAA,KACA,CACA,CACAjJ,EAAAqgK,mBAAA,CAAAA,CAIA,OAAAD,UAAA9zD,WACArqG,YAAAkoD,CAAA,EACA,iDAAAA,EAAAlhD,QAAA,KACA,CACA,CAMA,SAAAw6E,EAAA/gF,CAAA,EACA,IAAAg5J,EAAA50I,OAAA,CAAA06I,kBAAA,CAAA9+J,EAAAw5J,EAAA96G,IAAA,EACA,UAAAg/G,EAAA19J,EAAA,CAEA,IAAAg5J,EAAA50I,OAAA,CAAA26I,eAAA,CAAA/+J,EAAAw5J,EAAAn4E,OAAA,EACA,UAAAs8E,EAAA,MAAA39J,EAAA,CAQA,SAAA8gF,EAAA9gF,CAAA,EACA,IAAAg5J,EAAA50I,OAAA,CAAA06I,kBAAA,CAAA9+J,EAAAw5J,EAAA96G,IAAA,EACA,UAAAg/G,EAAA19J,EAAA,CAEA,IAAAg5J,EAAA50I,OAAA,CAAA26I,eAAA,CAAA/+J,EAAAw5J,EAAAp4E,QAAA,EACA,UAAAu8E,EAAA,OAAA39J,EAAA,CAvBA1C,EAAAogK,oBAAA,CAAAA,EAaApgK,EAAAyjF,WAAA,CAAAA,EAaAzjF,EAAAwjF,YAAA,CAAAA,EACA,IAAA28E,EAAA,IACA,IAAAtqI,EAAAsnG,EAAA,GAAA76H,EAAA,CAAAgqB,EAAAzR,KAAA,MACA,GAAAvY,EAAApB,MAAA,KAAA20B,EAEA,OADA7rB,QAAAo3D,IAAA,kDAAA90C,EAAA,GACAA,CACA,CACA,IAAA6wG,EACA,OAAA7wG,CACA,CACA,IAAAo1I,EAAAvkC,EAAA74G,OAAA,OAAsC,IACtC,MAAAo9I,KAAAA,EAAA7rI,EAAA,GAAAA,EAAA,GAAA6rI,EAAA,EAEA1hK,CAAAA,EAAAmgK,mBAAA,CAAAA,CAIA,OAAA93E,UAAAk3E,EAAAt7E,QAAA,CAIAhiF,YAAAgwB,CAAA,CAAAk4B,CAAA,CAAApkD,CAAA,EACA,IAAA47J,EAAA,GAAAvxE,EAAAvM,cAAA,EAAA15B,EACApkD,OAAAA,GAAAA,EAAA47J,GACA,MAAAA,EAAA,GAAAvxE,EAAApM,qBAAA,EAAA/xD,EAAAy2B,QAAA,GACA,KAAAz2B,KAAA,CAAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CACA2vI,WAAAz3G,CAAA,EACA,YAAAg8B,GAAA,MAAAl0D,KAAA,CAAAk4B,EACA,CACA,IAAAjsB,KAAA,CACA,YAAAqkB,SAAA,CAEAo8G,cAAAC,EAAA,EAAAxoG,CAAA,CAAAymG,EAAAX,EAAAv4E,QAAA,CAAAw4E,UAAA,EACA,aAAAwC,aAAA,CAAAC,EAAAxoG,EAAAymG,EACA,CACAvvH,QAAA2vH,EAAA,KAAAhrI,KAAA,CAAAy2B,QAAA,CAAA0N,CAAA,CAAAymG,EAAAX,EAAAv4E,QAAA,CAAAw4E,UAAA,EAEA,MADA,GAAAh1G,EAAArgC,OAAA,EAAAm2I,GAAA,KAAAhrI,KAAA,CAAAy2B,QAAA,aACA,MAAApb,OAAA,CAAA2vH,EAAA7mG,EAAAymG,EACA,CACAp0E,QAAAryB,EAAA,CAAAumG,eAAA,KACA,SAAAiB,EAAAjC,SAAA,MAAAK,EAAAl1I,OAAA,MAAAy7B,SAAA,CAAAt5C,QAAA,IAAAo3C,GAAA,MAAAmC,WAAA,CAAAv5C,QAAA,SAAAgpB,KAAA,CAAAy2B,QAAA,CAAA0N,EACA,CACA7wD,IAAAq/B,CAAA,EAEA,MADA,GAAAuiB,EAAArgC,OAAA,OAAAmL,KAAA,CAAAkzB,MAAA,CAAAvgB,EAAA3S,KAAA,8BAAAA,KAAA,CAAAhpB,QAAA,UAAA27B,EAAA3S,KAAA,CAAAhpB,QAAA,MACA,KAAA24J,UAAA,CAAAlG,EAAA50I,OAAA,CAAAvhB,GAAA,MAAA24B,GAAA,CAAA0G,EAAA1G,GAAA,EACA,CACA4uF,SAAAloF,CAAA,EAEA,MADA,GAAAuiB,EAAArgC,OAAA,OAAAmL,KAAA,CAAAkzB,MAAA,CAAAvgB,EAAA3S,KAAA,mCAAAA,KAAA,CAAAhpB,QAAA,UAAA27B,EAAA3S,KAAA,CAAAhpB,QAAA,MACA,KAAA24J,UAAA,CAAAlG,EAAA50I,OAAA,CAAAgmG,QAAA,MAAA5uF,GAAA,CAAA0G,EAAA1G,GAAA,EACA,CAMA2jI,UAAAj9H,CAAA,EACA,GAAAuiB,EAAArgC,OAAA,OAAAmL,KAAA,CAAAkzB,MAAA,CAAAvgB,EAAA3S,KAAA,oCAAAA,KAAA,CAAAhpB,QAAA,UAAA27B,EAAA3S,KAAA,CAAAhpB,QAAA,MACA,IAAA22J,EAAA,KAAArB,MAAA,CAAA35H,GACA,WAAAi8H,EAAAj9E,OAAA,CAAAg8E,EAAAr9G,SAAA,CAAAq9G,EAAAp9G,WAAA,CACA,CAMAs/G,SAAAl9H,CAAA,EACA,IAAAg7H,EAAA,KAAArB,MAAA,CAAA35H,GACA,WAAAi8H,EAAAj9E,OAAA,CAAAg8E,EAAAr9G,SAAA,CAAAq9G,EAAAp9G,WAAA,CACA,CAOAu/G,MAAArC,CAAA,EACA,YAAAkC,UAAA,CAAAlC,EAAAX,UAAA,CAAA/xC,QAAA,MAAA9uF,GAAA,EAAAoP,OAAA,IACA,CAOA00H,SAAAC,CAAA,EACA,YAAAF,KAAA,CAAAlB,EAAAj9E,OAAA,CAAA47E,WAAA,CAAA1yC,QAAA,CAAAm1C,GACA,CAQAC,aAAkB,CAClB,YAAAliK,EAAAmgK,mBAAA,OAAA13E,OAAA,EACAk0E,eAAA38J,EAAAsgK,uBAAA,CACA1D,UAAA,EACSF,iBAAM18J,EAAkBugK,yBAAA,IACjC,QAAAtuI,KAAA,CAAAq1D,MAAA,GAOAlxB,OAAA,CAAA+rG,oBAAAA,CAAkB,CAAA53I,OAAAA,CAAA,MAClB,SAAA43I,KAAAp+J,IAAAo+J,EACA,KAAAnD,QAAA,CAAAj3D,cAAA,CAAAx9E,EAAA43I,GACA,GAAAniK,EAAAmgK,mBAAA,OAAA7yH,OAAA,MAAArb,KAAA,CAAAy2B,QAAA,KAKA,IAAAs2G,UAAA,CACA,OAAAlyH,WAAA,KAAA27C,OAAA,GACA,CAOA,OAAA25E,cAAAx9H,CAAA,EACA,OAAA26H,EAAAt7E,QAAA,CAAA65E,UAAA,CAAAl5H,IACA,EAAAA,CAAAA,MAAAA,EAAA,OAAAA,EAAA3S,KAAA,CACA,CAUAowI,eAAAz9H,CAAA,EACA,YAAAi9H,SAAA,CAAAj9H,EACA,CAQA09H,WAAA5C,CAAA,EACA,YAAAqC,KAAA,CAAArC,EACA,CACA,CACA1/J,EAAAqoF,WAAA,CAAAA,CAAA,gBAAA5oF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjSa,aAEboD,OAAA8L,cAAA,CAAA7O,EAA6B,aAAG,CAAA0C,MAAsB,EAAG,GACzD1C,EAAAgkF,qBAAgB,CAAAhkF,EAAe6jF,cAAA,CAAA7jF,EAAAm7F,IAAA,QAC/B,IAAAxY,EAAAhjF,EAAA,MACA+7J,EAAA/4E,EAAuB/3D,eAAA,CAAAjrB,EAAwB,OAC/Cu8J,EAAAv8J,EAAA,MACA4iK,EAAA,GAIApnE,EAAA,GACA7uE,IAAA,GAAAA,GACA,iBAAAA,GACAA,EAAArqB,WAAA,CAAAugK,QAAA,GAAAD,GACAzhK,MAAA6D,OAAA,CAAA2nB,EAAAm2I,KAAA,EAQA,SAAA5+E,EAAA6+E,CAAA,EACA,OAAAA,aAAAhH,EAAA50I,OAAA,CACA47I,EACA,iBAAAA,GAAA,iBAAAA,EACAhH,EAAA50I,OAAA,CAAAyjC,MAAA,CAAAm4G,GACA,iBAAAA,GAAA,GAAA1iK,EAAAm7F,IAAA,EAAAunE,GACAhH,EAAA50I,OAAA,CAAAyjC,MAAA,CAAAm4G,EAAAz5J,QAAA,IACAyyJ,EAAA50I,OAAA,CAAAyjC,MAAA,CAAAm4G,EAAA,CAbA1iK,EAAAm7F,IAAA,CAAAA,EAeAn7F,EAAA6jF,cAAA,CAAAA,EACA,IAAA8+E,EAAA,GAMA3+E,EAAA,IACA,IAAA5hF,EAAAugK,CAAA,CAAAj6G,EAAA,QACA,IAGAA,GAAA,GACAi6G,CAAA,CAAAj6G,EAAA,CAAAgzG,EAAA50I,OAAA,CAAAyjC,MAAA,KAAA7B,GAEAi6G,CAAA,CAAAj6G,EAAA,CAAAgzG,EAAA50I,OAAA,CAAA87I,YAAA,CAAA1G,EAAAx4E,GAAA,CAAAg4E,EAAA50I,OAAA,CAAAyjC,MAAA,CAAA7B,IACA,CACA1oD,CAAAA,EAAAgkF,qBAAA,CAAAA,CAAA,gBAAAjkF,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,eCjDA,IAiDAkjK,EACAC,EAlDAz6I,EAAA1oB,EAAA,MA0BA,SAAAqhG,EAAArhD,CAAA,EAA4C,MAAmNqhD,CAAnNA,EAAgB,YAAkB,OAAO19F,QAAA,iBAA2BA,OAAAC,QAAA,UAAAo8C,CAAA,gBAAAA,CAAA,EAAwD,SAAAA,CAAA,SAAAA,GAAA,YAAgC,OAAAr8C,QAAAq8C,EAAA19C,WAAA,GAAAqB,QAAuDq8C,IAAAr8C,OAAAmL,SAAA,iBAAAkxC,CAAA,GAAAA,EAAA,CAC/P,SAAAojH,EAAAplH,CAAA,CAAAj4C,CAAA,UAAAY,EAAA,EAAAA,EAA8DZ,EAAAxE,MAAA,CAAAoF,IAAA,KAAA08J,EAAAt9J,CAAA,CAAAY,EAAA,CAAA08J,EAAAh3I,UAAsE,CAAAg3I,EAAAh3I,UAAA,KAAAg3I,EAAAhjH,YAAA,CAA8D,aAAAgjH,GAAAA,CAAAA,EAAAjjH,QAAkD,KAAAh9C,OAAiB8L,cAAG,CAAA8uC,EAAAslH,EAAAD,EAAArgK,GAAA,EAAAqgK,EAAA,EACxQ,SAAAE,EAAAC,CAA+B,CAAAC,CAAA,CAAAC,CAAA,EAAuC,OAAvCD,GAAuCL,EAAAI,EAAA10J,SAAA,CAAA20J,GAAAC,GAAAN,EAAAI,EAAAE,GAAAtgK,OAAA8L,cAAA,CAAAs0J,EAAA,aAAApjH,SAAA,KAAAojH,CAAA,CACtE,SAAAF,EAAAnsI,CAAA,MAAAn0B,EAAqC2gK,EAAAxsI,EAAA,gBAAAkqE,WAAAA,EAAAr+F,GAAiEA,EAAAyd,OAAAzd,EAAA,CACtG,SAAA2gK,EAAA1/J,CAAA,CAAA2/J,CAAA,KAAAviE,WAAAA,EAAAp9F,IAAkDA,IAAA,GAAAA,EAAA,OAA0CA,CAAA,KAAA4/J,EAAA5/J,CAAA,CAAAN,OAAA29F,WAAA,KAAAuiE,KAAAz/J,IAAAy/J,EAAA,KAAA75J,EAAA65J,EAAA70J,IAAA,CAAA/K,EAAA2/J,GAAA,cAAAviE,WAAAA,EAAAr3F,GAAA,OAAAA,CAAA,wEAAA45J,WAAAA,EAAAnjJ,OAAAxH,MAAA,EAAAhV,EAAA,CAC5F,SAAA6/J,EAAevuC,CAAA,CAAQiuC,CAAmB,MAAAjuC,CAAAA,aAAAiuC,CAAA,uDAC1C,IACAO,EAAAC,EADA,MACAC,KAAA,CACAC,EAAAH,EAAAG,sBAAA,CACAz3D,EAAAs3D,EAAAt3D,oBAAA,CACA03D,EAAAJ,EAAAI,qBAAA,CACAC,EAAAL,EAAAK,wBAAA,CACAC,EAAqBN,EAAAM,gBAA2C,CAChEj0D,EAAgBpwG,EAAe,MAE/BqoG,EAAAi8D,EADA,MACqBj8D,OAAA,CACrBk8D,EAAAvkK,EAAA,MAAAw2D,KAAA,CACAguG,EAAAD,EAAAC,SAAA,CACA11D,EAAAy1D,EAAmBz1D,QAAA,CACnB21D,EAAezkK,EAA4B,QAC3C0kK,EAAA1kK,EAA0B,QAC1B2kK,EAAA3kK,EAAA,+BAOA,SAAA4kK,GAAmB,CACnB,IAAAC,EAAA7kK,EAAA,MACAkjK,EAAA2B,EAAA3B,WAAA,CACAC,EAAA0B,EAAA1B,iBAAA,CAUA,IAAA2B,EAAA,GAOA7+J,EAAA7F,EAAAC,OAAA,CAAA+kB,EAAA2/I,EAAA,GASA,SAAAC,EAAAhlJ,CAAA,EACA,GAAAA,EAAAtd,OAAA,YAAAqL,MAAA,MAAAiS,EAAAtd,OAAA,OACA,IAAA0tG,EAAApwF,EAAA,CAEA,SAAAkwF,EAAAjL,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,CAAA4tG,CAAA,CAAA20D,CAAA,EACA,IACAC,EADAC,EAAA1rI,UAAAl4B,MAAA,CAeA,GAbA4jK,IAAAA,EACID,EAAA,SACJC,IAAAA,GACAziK,EAAAuiG,EACIA,EAAA7gG,KAAAA,IAEJ,KAAA0gK,IACAA,EAAA,GAEArjG,CADA/4C,EAAA08I,WAAA,CAAA18I,EAAA08I,WAAA,CAAA/6J,QAAAo3D,IAAA,CAAAxkD,IAAA,CAAA5S,QAAA,EACA,4JAEA,IAAA86J,GAAA70D,CAAAA,EAAA,OAEA5tG,aAAAqL,MAAA,MAAArL,CAAA,CACA,IAAA2iK,EAAA,CACApgE,OAAAA,EACAoL,SAAAA,EACAC,SAAAA,KAAAlsG,IAAAksG,EAAA,OAAAA,CAAA,CACA20D,aAAAA,GAAA/0D,CACA,CACA9rG,MAAAA,IAAA1B,GACA2iK,CAAAA,EAAA3iK,OAAA,CAAAA,CAAA,EAEA,IAAAqI,EAAA,IAAAqlG,EAAAi1D,EAKA,OAJAH,IACAn6J,EAAArI,OAAA,CAAAwiK,EACAn6J,EAAAwlG,gBAAA,KAEAxlG,CAAA,CAMA,SAAAu6J,EAAApuI,CAAA,CAAAquI,CAAA,CAAAxiK,CAAA,CAAAL,CAAA,EACA,IAAAK,EAAA,CACA,IAAAwtG,EAAA,GACA,GAAAg1D,IAAAA,EACAh1D,EAAA,GACM7tG,EAAA,iDACN,GAAAA,aAAAqL,MACA,MAAArL,CAAA,CAEA,IAAAqI,EAAA,IAAAqlG,EAAA,CACAnL,OAAAliG,EACAstG,SAAA,GACA3tG,QAAAA,EACA4tG,SAAA,KACK20D,aAAA/tI,CACL,EAEA,OADAnsB,EAAAwlG,gBAAA,CAAAA,EACAxlG,CAAA,CACA,CAKA,SAAAqa,GAAA,CACA,QAAAoU,EAAAC,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA2vB,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IACA7vB,CAAA,CAAA6vB,EAAA,CAAAD,SAAA,CAAAC,EAAA,CAEA4rI,EAAAlkK,KAAA,SAAAgkB,EAAAvb,EAAAtI,MAAA,EAAAk1B,MAAA,CAAA5sB,GACA,CA0FA,SAAAsoG,EAAAlN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,0BAEAjgK,IAAA8+J,GAAA0B,IACAzB,EAAAl+D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,qBACK20D,aAAA9yD,CACL,EAEA,CAzIAlsG,EAAAiqG,IAAA,CAAAA,EAIAjqG,EAAAmqG,cAAA,CAAAA,EA6BAnqG,EAAAmf,EAAA,CAAAA,EAKAnf,EAAA8qG,KAAA,UAAAA,EAAA9L,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,qBAGAp/D,GAAAoL,GACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,KACK20D,aAAAl0D,CACL,EACA,EAKA9qG,EAAA+qG,QAAA,UAAAA,EAAA/L,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,qBAGAp/D,GAAAoL,GACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,KACK20D,aAAAj0D,CACL,EACA,EAIA/qG,EAAAgrG,SAAA,UAAAA,EAAAhM,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,0BAEAjgK,IAAA8+J,GAAA0B,IACA1B,EAAAj+D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,YACK20D,aAAAh0D,CACL,EACA,EAIAhrG,EAAAisG,YAAA,UAAAA,EAAAjN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,0BAEAjgK,IAAA8+J,GAAA0B,IACA1B,EAAAj+D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,eACK20D,aAAA/yD,CACL,EAEA,EAGAjsG,EAAAkrG,eAAA,UAAAA,EAAAlM,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,0BAEAjgK,IAAA8+J,GAAA0B,IACAzB,EAAAl+D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,kBACK20D,aAAA9zD,CACL,EAEA,EACAlrG,EAAAksG,kBAAA,CAAAA,EAgBAlsG,EAAAmsG,WAAA,UAAAA,EAAAnN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,qBAEAK,EAAAz/D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,cACK20D,aAAA7yD,CACL,EAEA,EACAnsG,EAAAosG,cAAA,UAAAA,EAAApN,CAAA,CAAAoL,CAAA,CAAA3tG,CAAA,EACA,GAAA+2B,UAAAl4B,MAAA,GACA,UAAA8iK,EAAA,qBAEAK,EAAAz/D,EAAAoL,IACA20D,EAAA,CACA//D,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAA,iBACK20D,aAAA5yD,CACL,EAEA,EACA,IAAAmzD,EAAAjC,EAAA,SAAAiC,EAAAxlJ,CAAA,CAAA3Y,CAAA,CAAA49F,CAAA,EACA,IAAAp2E,EAAA,KACAi1I,EAAA,KAAA0B,GACAn+J,EAAAmG,OAAA,UAAAxK,CAAA,EACAA,KAAAgd,IACAilF,KAAA7gG,IAAA6gG,GAAA,iBAAAA,CAAA,CAAAjiG,EAAA,EAAA8rG,EAAA9uF,CAAA,CAAAhd,EAAA,GAAA2hK,EAAA3kJ,CAAA,CAAAhd,EAAA,CAAAiiG,CAAA,CAAAjiG,EAAA,EACQ6rB,CAAA,CAAA7rB,EAAA,CAAAiiG,CAAA,CAAAjiG,EAAA,CAER6rB,CAAA,CAAA7rB,EAAA,CAAAgd,CAAA,CAAAhd,EAAA,CAGC,EACD,GACA,SAAAyiK,EAAAxgE,CAAA,CAAAoL,CAAA,CAAArtG,CAAA,CAAAN,CAAA,CAAA2E,CAAA,CAAA6vB,CAAA,EACA,IAAAl0B,CAAAA,KAAAiiG,CAAA,IAAAk+D,EAAAl+D,CAAA,CAAAjiG,EAAA,CAAAqtG,CAAA,CAAArtG,EAAA,GACA,IAAAN,EAAA,CAEA,IAAAvC,EAAA,IAAAqlK,EAAAvgE,EAAA59F,GACAgS,EAAA,IAAAmsJ,EAAAn1D,EAAAhpG,EAAA49F,GACAl6F,EAAA,IAAAqlG,EAAA,CACAnL,OAAA9kG,EACAkwG,SAAAh3F,EACAi3F,SAAA,kBACO20D,aAAA/tI,CACP,EAIA,OAHAnsB,EAAAk6F,MAAA,CAAAA,EACAl6F,EAAAslG,QAAA,CAAAA,EACAtlG,EAAAulG,QAAA,CAAAp5E,EAAA5zB,IAAA,CACAyH,CAAA,CACA,EACA,CACAk6F,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAA,EACA4tG,SAAAp5E,EAAA5zB,IAAA,CACK2hK,aAAA/tI,CACL,EACA,EAEA,SAAAo7E,EAAArN,CAAA,CAAAoL,CAAA,CAAAxtG,CAAA,CAAAq0B,CAAA,EACA,sBAAAm5E,EAAA,CACA,GAAAvB,EAAAuB,GAAA,OAAAs0D,EAAAt0D,EAAApL,EAAA,CAEA,GAAAxrE,GAAAA,UAAAl4B,MAAA,CACA,UAAAkrG,EAAA,iCAAA4D,EAAA,CAIA,GAAAhP,WAAAA,EAAA4D,IAAAA,IAAA,GAAAA,EAAA,CACA,IAAAl6F,EAAA,IAAAqlG,EAAA,CACAnL,OAAAA,EACAoL,SAAAA,EACA3tG,QAAAG,EACAytG,SAAA,kBACO20D,aAAA/tI,CACP,EAEA,OADAnsB,EAAAulG,QAAA,CAAAp5E,EAAA5zB,IAAA,CACAyH,CAAA,CACA,IACA1D,EAAAjE,OAAAiE,IAAA,CAAAgpG,GAGA,GAAAA,aAAAtiG,MACM1G,EAAAxH,IAAA,wBACN,GAAAwH,IAAAA,EAAA9F,MAAA,CACA,UAAA4iK,EAAA,QAAA9zD,EAAA,8BASA,OAPAjsG,KAAAA,IAAA8+J,GAAA0B,IACAv9J,EAAAmG,OAAA,UAAAxK,CAAA,EACA,iBAAAiiG,CAAA,CAAAjiG,EAAA,EAAA8rG,EAAAuB,CAAA,CAAArtG,EAAA,GAAA2hK,EAAAt0D,CAAA,CAAArtG,EAAA,CAAAiiG,CAAA,CAAAjiG,EAAA,GAGKyiK,EAAAxgE,EAAAoL,EAAArtG,EAAAH,EAAAwE,EAAA6vB,EACL,GACA,EACA,QAEA,KAAA9yB,IAAAisG,EAAAvhG,SAAA,EAAAm2F,aAAAoL,IAGAtiG,MAAAmS,aAAA,CAAAmwF,IAGAA,CAAA,IAAAA,EAAArhG,IAAA,IAAAi2F,EACA,CACA,SAAAygE,EAAAxuI,CAAA,EACA,sBAAAA,EACA,UAAAu1E,EAAA,gBAAAv1E,EAAA,CAEA,IACIA,GACJ,OAAAxvB,EAAA,CACA,OAAAA,CACA,CACA,OAAAq9J,CACA,CACA,SAAAY,EAAA3lJ,CAAA,EASA,OAAAwkJ,EAAAxkJ,IAAAA,IAAA,GAAAA,GAAAqhF,WAAAA,EAAArhF,IAAA,mBAAAA,EAAAsD,IAAA,qBAAAtD,EAAAghD,KAAA,CAEA,SAAA4kG,EAAAC,CAAA,EACA,OAAAtkJ,QAAAI,OAAA,GAAA2B,IAAA,YACA,IAAAwiJ,EACA,sBAAAD,EAIA,KAAAF,EAFAG,EAAAD,KAGA,UAAAzB,EAAA,kCAAA0B,EAAA,MAEA,GAAAH,EAAAE,GACMC,EAAAD,OAEN,UAAAp5D,EAAA,mCAAAo5D,EAAA,CAEA,OAAAtkJ,QAAAI,OAAA,GAAA2B,IAAA,YACK,OAAAwiJ,CACL,GAAAxiJ,IAAA,YACK,OAAAyhJ,CACL,GAAA/jG,KAAA,UAAAt5D,CAAA,EACK,OAAAA,CACF,EACH,EACA,CACA,SAAAq+J,EAAAd,CAAA,CAAAhgE,CAAA,CAAA1+F,CAAA,CAAA7D,CAAA,EACA,oBAAA6D,EAAA,CACA,GAAAkzB,GAAAA,UAAAl4B,MAAA,CACA,UAAAkrG,EAAA,+CAAAlmG,EAAA,CAEA,GAAA86F,WAAAA,EAAA4D,IAAAA,IAAA,GAAAA,EACA,IAAAA,EAAAviG,OAAA,GAAA6D,EACA,UAAA29J,EAAA,sCAAAztI,MAAA,CAAAwuE,EAAAviG,OAAA,yCAEA,GAAAuiG,IAAA1+F,EACA,UAAA29J,EAAA,8BAAAztI,MAAA,CAAAwuE,EAAA,mCAEAviG,EAAA6D,EACIA,EAAAnC,KAAAA,CACJ,SAAAmC,IAAA,EAAAA,GAAA86F,WAAAA,EAAA96F,IAAA,mBAAAA,EACA,UAAAkmG,EAAA,+CAAAlmG,EAAA,CAEA,GAAA0+F,IAAA8/D,EAAA,CACA,IAAA1K,EAAA,GACA9zJ,GAAAA,EAAAjD,IAAA,EACA+2J,CAAAA,GAAA,KAAA5jI,MAAA,CAAAlwB,EAAAjD,IAAA,OAEA+2J,GAAA33J,EAAA,KAAA+zB,MAAA,CAAA/zB,GAAA,IACA,IAAAsjK,EAAAf,YAAAA,EAAA3hK,IAAA,yBACA0hK,EAAA,CACA//D,OAAA7gG,KAAAA,EACAisG,SAAA9pG,EACA+pG,SAAA20D,EAAA3hK,IAAA,CACAZ,QAAA,oBAAA+zB,MAAA,CAAAuvI,GAAAvvI,MAAA,CAAA4jI,GACK4K,aAAAA,CACL,EACA,IACA1+J,GAAA,CAAA+rG,EAAArN,EAAA1+F,EAAA7D,EAAAuiK,GACA,MAAAhgE,CAAA,CAGA,SAAAghE,EAAAhB,CAAA,CAAAhgE,CAAA,CAAA1+F,CAAA,CAAA7D,CAAA,EACA,GAAAuiG,IAAA8/D,GAKA,GAJA,iBAAAx+J,IACA7D,EAAA6D,EACAA,EAAAnC,KAAAA,GAEA,CAAAmC,GAAA+rG,EAAArN,EAAA1+F,GAAA,CACA,IAAA8zJ,EAAA33J,EAAA,KAAA+zB,MAAA,CAAA/zB,GAAA,IACAsjK,EAAAf,kBAAAA,EAAA3hK,IAAA,yBACA0hK,EAAA,CACA//D,OAAAA,EACAoL,SAAA9pG,EACA+pG,SAAA20D,EAAA3hK,IAAA,CACAZ,QAAA,gBAAA+zB,MAAA,CAAAuvI,GAAAvvI,MAAA,CAAA4jI,EAAA,0BAAA5jI,MAAA,CAAAwuE,GAAAA,EAAAviG,OAAA,MACKuiK,aAAAA,CACL,EACA,OACAhgE,CAAA,CAhBA,CA6FA,SAAAihE,EAAA9+J,CAAA,CAAA++J,CAAA,CAAAzjK,CAAA,CAAAw0B,CAAA,CAAAkvI,CAAA,EACA,IAAAt3D,EAAAq3D,GACA,UAAA15D,EAAA,kBAAA05D,EAAA,CAEA,IAAA1oI,EAAA2oI,UAAAA,EACA,oBAAAh/J,GAAAu9J,EAAAwB,EAAA/+J,KAAAq2B,EAAA,CACA,GAAA/6B,aAAAqL,MACA,MAAArL,CAAA,CACA,IAAA6tG,EAAA,CAAA7tG,EAIAA,EAAAA,GAAA,kBAAA0E,EAAA,kEAAAqvB,MAAA,CAAA4qE,EAAAj6F,GAAA,MAAAqvB,MAAA,CAAA4xE,EAAAjhG,GAAA,MAAAq2B,EAAA,oHAAAhH,MAAA,CAAA4xE,EAAA89D,GAAA,gBAAA1vI,MAAA,CAAA4xE,EAAAjhG,GAAA,OACA,IAAA2D,EAAA,IAAAqlG,EAAA,CACAnL,OAAA79F,EACAipG,SAAA81D,EACAzjK,QAAAA,EACA4tG,SAAA81D,EACKnB,aAAA/tI,CACL,EAEA,OADAnsB,EAAAwlG,gBAAA,CAAAA,EACAxlG,CAAA,CACA,CAUA,SAAAqmG,GAAA,CACA,QAAAi1D,EAAA5sI,UAAAl4B,MAAA,CAAAsI,EAAA,MAAAw8J,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAz8J,CAAA,CAAAy8J,EAAA,CAAA7sI,SAAA,CAAA6sI,EAAA,CAEAhB,EAAAlkK,KAAA,SAAAgwG,EAAAvnG,EAAAtI,MAAA,EAAAk1B,MAAA,CAAA5sB,GACA,CAhHA5D,EAAAgtG,MAAA,UAAAA,EAAA4yD,CAAA,EACA,QAAAU,EAAA9sI,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA08J,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACA38J,CAAA,CAAA28J,EAAA,GAAA/sI,SAAA,CAAA+sI,EAAA,CAEAT,EAAA3kK,KAAA,SAAA6xG,EAAAyyD,EAAAG,GAAA,CAAApvI,MAAA,CAAA5sB,GACA,EACA5D,EAAAwgK,OAAA,UAAAA,EAAAZ,CAAA,EACA,QAAAa,EAAAjtI,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA68J,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACA98J,CAAA,CAAA88J,EAAA,GAAAltI,SAAA,CAAAktI,EAAA,CAEA,OAAAf,EAAAC,GAAAviJ,IAAA,UAAAhf,CAAA,EACG,OAAAyhK,EAAA3kK,KAAA,SAAAqlK,EAAAniK,EAAA,CAAAmyB,MAAA,CAAA5sB,GACH,EACA,EACA5D,EAAA8sG,YAAA,UAAAA,EAAA77E,CAAA,EACA,QAAA0vI,EAAAntI,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA+8J,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAh9J,CAAA,CAAAg9J,EAAA,GAAAptI,SAAA,CAAAotI,EAAA,CAEAZ,EAAA7kK,KAAA,SAAA2xG,EAAA2yD,EAAAxuI,GAAA,CAAAT,MAAA,CAAA5sB,GACA,EACA5D,EAAA6gK,aAAA,UAAAA,EAAA5vI,CAAA,EACA,QAAA6vI,EAAAttI,UAAAl4B,MAAA,CAAAsI,EAAA,MAAAk9J,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAn9J,CAAA,CAAAm9J,EAAA,GAAAvtI,SAAA,CAAAutI,EAAA,CAEA,OAAApB,EAAA1uI,GAAA5T,IAAA,UAAAhf,CAAA,EACG,OAAA2hK,EAAA7kK,KAAA,SAAA0lK,EAAAxiK,EAAA,CAAAmyB,MAAA,CAAA5sB,GACH,EACA,EACA5D,EAAA+sG,OAAA,UAAAA,EAAAjoG,CAAA,EACA,GAAAA,MAAAA,EAAA,CACA,IAAArI,EAAA,kCACA2+F,CAAA,WAAAA,EAAAt2F,IAAA,iBAAAA,EAAArI,OAAA,CACAqI,IAAAA,EAAArI,OAAA,CAAAnB,MAAA,EAAAwJ,EAAAzI,WAAA,CACQI,GAAAqI,EAAAzI,WAAA,CAAAgB,IAAA,CAERZ,GAAAqI,EAAArI,OAAA,CAGAA,GAAA2lG,EAAAt9F,GAEA,IAAAk8J,EAAA,IAAA72D,EAAA,CACAnL,OAAAl6F,EACAslG,SAAA,KACAC,SAAA,UACA5tG,QAAAA,EACKuiK,aAAAjyD,CAAA,GAILk0D,EAAAn8J,EAAA4a,KAAA,CACA,oBAAAuhJ,EAAA,CAIA,IAAAC,EAAAD,EAAAhsJ,KAAA,OACAisJ,EAAAhrJ,KAAA,GAGA,QADAirJ,EAAAH,EAAsBthJ,KAAA,CAAAzK,KAAA,OACtBvU,EAAA,EAAAA,EAAAwgK,EAAA5lK,MAAA,CAAAoF,IAAA,CAEA,IAAAqhG,EAAAo/D,EAAA7mJ,OAAA,CAAA4mJ,CAAA,CAAAxgK,EAAA,EACA,GAAAqhG,KAAAA,EAAA,CAEAo/D,EAAAA,EAAAzlK,KAAA,GAAAqmG,GACA,MACA,CAEAi/D,EAAAthJ,KAAA,IAAA8Q,MAAA,CAAA2wI,EAAAtkK,IAAA,aAAA2zB,MAAA,CAAA0wI,EAAArkK,IAAA,OACA,OACAmkK,CAAA,CACA,EA6BAhhK,EAAAw3B,KAAA,UAAAA,EAAAr2B,CAAA,CAAA++J,CAAA,CAAAzjK,CAAA,EACAwjK,EAAA9+J,EAAA++J,EAAAzjK,EAAA+6B,EAAA,QACA,EACAx3B,EAAAohK,YAAA,UAAAA,EAAAjgK,CAAA,CAAA++J,CAAA,CAAAzjK,CAAA,EACAwjK,EAAA9+J,EAAA++J,EAAAzjK,EAAA2kK,EAAA,iBAUAphK,EAAAmrG,MAAA,CAAAqzD,EAAArzD,EAAAnrG,EAAA,CACA8qG,MAAA9qG,EAAAmsG,WAAA,CACAnB,UAAAhrG,EAAAkrG,eAAA,CACAH,SAAA/qG,EAAAosG,cAAA,CACCH,aAAAjsG,EAAAksG,kBAAA,GACDlsG,EAAAmrG,MAAA,CAAAA,MAAA,CAAAnrG,EAAAmrG,MAAA,gBAAAhxG,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,eC7kBA,IAAA0oB,EAAA1oB,EAAA,MAMA,SAAAsnK,EAAA5/J,CAAA,CAAAjD,CAAA,MAA4Be,EAAApC,OAAAiE,IAAgB,CAAAK,GAAA,GAAAtE,OAAA2mD,qBAA6B,MAAA/J,EAAA58C,OAAA2mD,qBAAA,CAAAriD,EAAkDjD,CAAAA,GAAAu7C,CAAAA,EAAAA,EAAAr1B,MAAA,UAAAlmB,CAAA,SAAArB,OAAA+8C,wBAAsD,CAAAz4C,EAAAjD,GAAA4nB,UAA8B,IAAA7mB,EAAA3F,IAAA,CAAAuB,KAAA,CAAAoE,EAAAw6C,EAAA,QAAAx6C,CAAA,CAC/M,SAAA+hK,EAAA7/J,CAAA,UAAAjD,EAAA,EAA4CA,EAAAg1B,UAAAl4B,MAAA,CAAAkD,IAA2B,KAAAe,EAAA,MAAkBi0B,SAAA,CAAAh1B,EAAA,CAAAg1B,SAAA,CAAAh1B,EAAA,IAAkCA,EAAA,EAAA6iK,EAAAlkK,OAAAoC,GAAA,IAAAgI,OAAA,UAAA/I,CAAA,EAAA+8F,EAAoE95F,EAAKjD,EAAAe,CAAA,CAAAf,EAAO,IAAArB,OAAAokK,yBAAoB,CAAApkK,OAAAqkK,gBAAA,CAAA//J,EAAAtE,OAAAokK,yBAAA,CAAAhiK,IAAA8hK,EAAAlkK,OAAAoC,IAAAgI,OAAA,UAAA/I,CAAA,EAAArB,OAAA8L,cAAA,CAAAxH,EAAAjD,EAAArB,OAAA+8C,wBAAA,CAAA36C,EAAAf,GAAA,UAAAiD,CAAA,CAC/N,SAAA85F,EAAAxhF,CAAA,CAAAhd,CAAA,CAAAD,CAAA,EAA4F,MAA1CC,CAAlDA,EAAkDsgK,EAAAtgK,EAAA,IAAAgd,EAAA5c,OAA0C8L,cAAA,CAAA8Q,EAAAhd,EAAA,CAAAD,MAAAA,EAAAspB,WAAA,GAAAg0B,aAAA,GAAAD,SAAA,KAAApgC,CAAA,CAAAhd,EAAA,CAAAD,EAAAid,CAAA,CAC5F,SAAA8jJ,EAAAvuC,CAAA,CAAAiuC,CAA4C,MAAAjuC,CAAAA,aAAgBiuC,CAAyB,kBAA2B,qCAChH,SAAAJ,EAAAplH,CAAA,CAAAj4C,CAAA,UAAAY,EAAA,EAAAA,EAA8DZ,EAAAxE,MAAA,CAAAoF,IAAA,KAAA08J,EAAAt9J,CAAA,CAAAY,EAAA,CAAA08J,EAAAh3I,UAAsE,CAAAg3I,EAAAh3I,UAAA,KAAAg3I,EAAAhjH,YAAA,CAA8D,aAAAgjH,GAAAA,CAAAA,EAAAjjH,QAAkD,KAAAh9C,OAAiB8L,cAAG,CAAA8uC,EAAAslH,EAAAD,EAAArgK,GAAA,EAAAqgK,EAAA,EACxQ,SAAAE,EAAAC,CAA+B,CAAAC,CAAA,CAAAC,CAAA,EAAuC,OAAvCD,GAAuCL,EAAAI,EAAA10J,SAAA,CAAA20J,GAAAC,GAAAN,EAAAI,EAAAE,GAAAtgK,OAAA8L,cAAA,CAAAs0J,EAAA,aAAApjH,SAAA,KAAAojH,CAAA,CACtE,SAAAF,EAAAnsI,CAAA,MAAAn0B,EAAqC2gK,EAAAxsI,EAAA,gBAAAkqE,WAAAA,EAAAr+F,GAAiEA,EAAAyd,OAAAzd,EAAA,CACtG,SAAA2gK,EAAA1/J,CAAA,CAAA2/J,CAAA,KAAAviE,WAAAA,EAA2Cp9F,IAAAA,IAAA,GAAAA,EAAA,OAAAA,CAAA,KAA+D4/J,EAAA5/J,CAAA,CAAAN,OAAA29F,WAAA,KAAAuiE,KAAAz/J,IAAAy/J,EAAA,KAAA75J,EAAA65J,EAAA70J,IAA6E,CAAA/K,EAAA2/J,GAAA,cAAAviE,WAAAA,EAAAr3F,GAAA,OAAAA,CAAA,OAAyE,UAAe,gDAAuD,MAAG,CAAA45J,WAAAA,EAAAnjJ,OAAAxH,MAAA,EAAAhV,EAA+C,CACxX,SAAAyjK,EAAAC,CAAA,CAAAC,CAAiC,wBAAAA,GAAAA,IAA6D,GAA7DA,EAA6D,qEAAyC,CAA8CD,EAAA74J,SAAA,CAAA1L,OAAA8C,MAAiC,CAAA0hK,GAAAA,EAAA94J,SAAA,EAAAxM,YAAmD,CAAAS,MAAA4kK,EAAAvnH,SAAA,GAAAC,aAAA,GAA2D,GAAAj9C,OAAO8L,cAAA,CAAAy4J,EAAA,YAAyC,CAAAvnH,SAAA,KAAAwnH,GAAAC,EAAAF,EAAAC,EAAA,CACpX,SAAAE,EAAAC,CAAA,MAAAC,EAAkDC,IAAA,iBAA0E,KAA2C3jK,EAA5B4jK,EAAAC,EAAAJ,GAA4B,GAAAC,EAAA,KAAAI,EAAAD,EAAA,IAAmF,EAAA7lK,WAAA,CAAAgC,EAAA+jD,QAAAggH,SAAA,CAAAH,EAAAzuI,UAAA2uI,EAAA,MAAA9jK,EAAA4jK,EAAA9mK,KAAA,MAAAq4B,UAAA,QAAA6uI,EAAA,KAAAhkK,EAAA,EAC1P,SAAAgkK,EAAA1oK,CAAwC,CAAAoP,CAAA,KAAAA,GAAuBqyF,CAAAA,WAAAA,EAAAryF,IAAA,mBAAAA,CAAA,SAAAA,CAAyF,CAAzF,GAAAA,KAAyF,IAAzFA,EAAyF,mFAAAu5J,EAAA3oK,EAAA,CACxJ,SAAA2oK,EAAA3oK,CAAmC,KAAAA,KAAA,IAAAA,EAAA,iFAAgE,QAAsDA,CAAA,CACzJ,SAAA4oK,EAAA1pE,CAAA,MAAAt6B,EAA2C,mBAAA/+D,IAAA,IAAmCA,IAAArB,KAAAA,CAAA,CAAgT,MAAAokK,CAAhTA,EAAA,SAAgD1pE,CAAA,KAAAA,IAAA,GAAAA,GAAA,CAAA2pE,EAAwD3pE,GAAgB,OAAAA,CAAA,uBAAuBA,EAAA,gBAAkD,qDAAkC,aAAAt6B,EAAuD,IAAAA,EAAA7gD,GAAA,CAAAm7E,GAAsB,OAAAt6B,EAAAphD,GAAA,CAAA07E,EAAA,CAAAt6B,EAAA9+D,GAAA,CAAAo5F,EAAA4pE,EAAA,UAAAA,GAAA,QAAAC,EAAA7pE,EAAArlE,UAAA0uI,EAAA,MAAA7lK,WAAA,SAAAomK,EAAA55J,SAAA,CAAA1L,OAAA8C,MAAA,CAAA44F,EAAAhwF,SAAA,EAAAxM,YAAA,CAAAS,MAAA2lK,EAAAr8I,WAAA,GAAA+zB,SAAA,GAAAC,aAAA,MAAAwnH,EAAAa,EAAA5pE,EAAA,GAAAA,EAAA,CAC9X,SAAA6pE,EAAAC,CAAA,CAAA/+J,CAAA,CAAAi1F,CAAuC,EAAiR,MAAA6pE,CAAjRA,EAAAV,IAAA5/G,QAAAggH,SAAA,CAAAprJ,IAAwE,YAA0C2rJ,CAAA,CAAA/+J,CAAA,CAAAi1F,CAAA,MAAA3+F,EAAA,OAAAA,EAA8CN,IAAA,CAAMuB,KAAA,CAAAjB,EAAA0J,GAAA,IAAA0rH,EAAgF,GAAhFszC,CAAAA,SAAA5rJ,IAAA,CAAA7b,KAAA,CAAAwnK,EAAAzoK,EAAA,EAA2G,OAAZ2+F,GAAY+oE,EAAAtyC,EAAAz2B,EAAAhwF,SAAA,EAAAymH,CAAA,GAAAn0H,KAAA,MAAAq4B,UAAA,CACxT,SAAAwuI,GAAiC,wBAAA5/G,SAAA,CAAAA,QAAAggH,SAAA,EAAAhgH,QAAAggH,SAAA,CAAAS,IAAA,gCAAA7zG,MAAA,oBAAAupB,QAAA1vE,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAAq5C,QAAAggH,SAAA,CAAA7pF,QAAA,2BAAA92E,EAAA,WACjC,SAAA+gK,EAAAvxI,CAAA,EAAiC,OAAA2xI,KAAAA,SAAAv/J,QAAA,CAAA0F,IAAA,CAAAkoB,GAAA3W,OAAA,kBACjC,SAAAsnJ,EAAA7nH,CAAA,CAAA53B,CAAA,CAA8B,CAAuG,MAAAy/I,CAAvGA,EAAAzkK,OAAA+gG,cAAA,CAAA/gG,OAAA+gG,cAAA,CAAAlnF,IAAA,YAAA+iC,CAAA,CAAuG53B,CAAA,SAAA43B,EAAA0R,SAAA,CAAAtpC,EAAA43B,CAAA,GAAmDA,EAAA53B,EAAA,CACxL,SAAA+/I,EAAsBnoH,CAAA,EAAkJ,MAAiBmoH,CAAnKA,EAAA/kK,OAA2B+gG,cAAA,CAAA/gG,OAAAy6C,cAAA,CAAA5gC,IAAA,YAAA+iC,CAAA,SAAAA,EAAA0R,SAAoG,EAAAtuD,OAAAy6C,cAAmB,CAAAmC,EAAA,GAAiBA,EAAA,CACzL,SAAAqhD,EAAerhD,CAAA,EAAe,MAAAqhD,CAAAA,EAAA,mBAAA19F,QAAA,iBAAAA,OAAAC,QAAA,UAAAo8C,CAAA,gBAAAA,CAAA,WAAAA,CAAA,SAAAA,GAAA,mBAAAr8C,QAAAq8C,EAAA19C,WAAA,GAAAqB,QAAAq8C,IAAAr8C,OAAAmL,SAAA,iBAAAkxC,CAAA,GAAAA,EAAA,CAC9B,IACAqoD,EAAA27D,EADA,MACgB37D,OAAA,CAChBoE,EAAA63D,EAAA,MAAAL,KAAA,CAAAx3D,oBAAA,CAIA,SAAAs8D,EAAA59I,CAAA,CAAA4F,CAAA,CAAAi4I,CAAA,EAIA,MAHAA,CAAAA,KAAA5kK,IAAA4kK,GAAAA,EAAA79I,EAAA5pB,MAAA,GACAynK,CAAAA,EAAA79I,EAAA5pB,MAAA,EAEA4pB,EAAA+hB,SAAA,CAAA87H,EAAAj4I,EAAAxvB,MAAA,CAAAynK,KAAAj4I,CAAA,CAIA,SAAAk4I,EAAA99I,CAAA,CAAAyH,CAAA,EAEA,GADAA,EAAAvxB,KAAAwZ,KAAA,CAAA+X,GACAzH,GAAAA,EAAA5pB,MAAA,EAAAqxB,GAAAA,EAAA,SACA,IAAAs2I,EAAA/9I,EAAA5pB,MAAA,CAAAqxB,EAEA,IADAA,EAAAvxB,KAAAwZ,KAAA,CAAAxZ,KAAA2zD,GAAA,CAAApiC,GAAAvxB,KAAA2zD,GAAA,KACApiC,GACAzH,GAAAA,EACAyH,IAGA,OADAzH,EAAAA,EAAA+hB,SAAA,GAAAg8H,EAAA/9I,EAAA5pB,MAAA,CAEA,CACA,IAAA4gC,EAAA,GACAI,EAAA,GACAR,EAAA,GACAV,EAAA,GACA8nI,EAAA,CACAh4D,gBAAA,6CACAiB,YAAA,wCACAg3D,kBAAA,yDACAn4D,UAAA,4CACAF,MAAA,uCACAoB,mBAAA,sDACAE,eAAA,+CACAg3D,qBAAA,6DACAn3D,aAAA,qDACAlB,SAAA,8CACAs4D,aAAA,6CAKAC,EAAA,GACA,SAAAC,EAAA7/I,CAAA,EACA,IAAAtiB,EAAAjE,OAAAiE,IAAA,CAAAsiB,GACAq0B,EAAA56C,OAAA8C,MAAA,CAAA9C,OAAAy6C,cAAA,CAAAl0B,IAOA,OANAtiB,EAAAmG,OAAA,UAAAxK,CAAA,EACGg7C,CAAA,CAAAh7C,EAAA,CAAA2mB,CAAA,CAAA3mB,EAAA,GAEHI,OAAA8L,cAAA,CAAA8uC,EAAA,WACGj7C,MAAA4mB,EAAAjnB,OAAA,GAEHs7C,CACA,CACA,SAAAyrH,EAAA/7H,CAAA,EAGA,OAAA26D,EAAA36D,EAAA,CACAg8H,QAAA,GACAz7D,cAAA,GACAnZ,MAAA,IACA60E,eAAAlmE,IAEAqK,WAAA,GAMA87D,YAAAnmE,IAEAomE,UAAA,GACAv7F,OAAA,GAEGw7F,QAAA,EACH,EACA,CACA,SAAAC,EAAA9kE,CAAA,CAAAoL,CAAA,CAAAC,CAAA,EACA,IAAArrE,EAAA,GACAj7B,EAAA,GACAggK,EAAA,EACA74I,EAAA,GACA84I,EAAA,GACAC,EAAAT,EAAAxkE,GACAklE,EAAAD,EAAAhvJ,KAAA,OACAkvJ,EAAAX,EAAAp5D,GAAAn1F,KAAA,OACAvU,EAAA,EAAA0jK,EAAA,GAWA,GANA,gBAAA/5D,GAAAjP,WAAAA,EAAA4D,IAAA5D,WAAAA,EAAAgP,IAAApL,IAAA,GAAAA,GAAAoL,IAAA,GAAAA,GACAC,CAAAA,EAAA,qBAKA65D,IAAAA,EAAA5oK,MAAA,EAAA6oK,IAAAA,EAAA7oK,MAAA,EAAA4oK,CAAA,MAAAC,CAAA,KACA,IAAAE,EAAAH,CAAA,IAAA5oK,MAAA,CAAA6oK,CAAA,IAAA7oK,MAAA,CAIA,GAAA+oK,GAAAf,EACA,KAAAloE,WAAAA,EAAA4D,IAAAA,IAAA,GAAAA,CAAA,GAAA5D,CAAAA,WAAAA,EAAAgP,IAAAA,IAAA,GAAAA,CAAA,GAAApL,CAAAA,IAAAA,GAAAoL,IAAAA,CAAA,EAEA,SAAA55E,MAAA,CAAA0yI,CAAA,CAAA74D,EAAA,YAAA75E,MAAA,CAAA0zI,CAAA,aAAA1zI,MAAA,CAAA2zI,CAAA,SACM,MACN,GAAA95D,sBAAAA,GAKAg6D,EADA5hJ,CAAAA,EAAA6hJ,MAAA,EAAA7hJ,EAAA6hJ,MAAA,CAAAC,KAAA,CAAA9hJ,EAAA6hJ,MAAA,CAAA3vI,OAAA,KACA,CACA,KAAAuvI,CAAA,IAAAxjK,EAAA,GAAAyjK,CAAA,IAAAzjK,EAAA,EACAA,IAGAA,EAAA,IAGA0jK,EAAA,OAAA5zI,MAAA,CAAAwyI,EAAA,IAAAtiK,GAAA,KACAA,EAAA,EAEA,CACA,KAKA,IAAAxG,EAAAgqK,CAAA,CAAAA,EAAA5oK,MAAA,IACA8X,EAAA+wJ,CAAA,CAAAA,EAAA7oK,MAAA,IASA,IARA8X,IACA1S,IAAA,EACMwqB,EAAA,OAAAsF,MAAA,CAAAt2B,GAAAs2B,MAAA,CAAAtF,GAEN8T,EAAA9kC,EAEAgqK,EAAAh2G,GAAA,GACAi2G,EAAAj2G,GAAA,GACAg2G,IAAAA,EAAA5oK,MAAA,EAAA6oK,IAAAA,EAAA7oK,MAAA,GACApB,EAAAgqK,CAAA,CAAAA,EAAA5oK,MAAA,IACA8X,EAAA+wJ,CAAA,CAAAA,EAAA7oK,MAAA,IAEA,IAAAkpK,EAAAppK,KAAAqrC,GAAA,CAAAy9H,EAAA5oK,MAAA,CAAA6oK,EAAA7oK,MAAA,EAGA,GAAAkpK,IAAAA,EAAA,CACA,IAAAC,EAAAR,EAAAhvJ,KAAA,OAKA,GAAAwvJ,EAAAnpK,MAAA,IAEA,IADAmpK,CAAA,QAAAj0I,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GACAqpI,EAAAnpK,MAAA,KACAmpK,EAAAv2G,GAAA,EAEA,CACA,SAAA19B,MAAA,CAAA0yI,EAAAG,YAAA,SAAA7yI,MAAA,CAAAi0I,EAAA5nK,IAAA,YACA,GACA,IACAquB,EAAA,KAAAsF,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GAAA5K,MAAA,CAAAtF,GACA84I,EAAA,IAEA,KAAAhlI,IACA9T,EAAA,OAAAsF,MAAA,CAAAwO,GAAAxO,MAAA,CAAAtF,GACA8T,EAAA,IAEA,IAAA0lI,EAAA,EACA9nK,EAAAsmK,CAAA,CAAA74D,EAAA,MAAA75E,MAAA,CAAA8L,EAAA,YAAA9L,MAAA,CAAA4K,EAAA,KAAA5K,MAAA,CAAAsL,EAAA,cAAAtL,MAAA,CAAA4K,GACAupI,EAAc,IAAAn0I,MAAc,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,EAAA,kBAC5B,IAAA16B,EAAA,EAAAA,EAAA8jK,EAAA9jK,IAAA,CAEA,IAAAuyF,EAAAvyF,EAAAqjK,EACA,GAAAG,EAAA5oK,MAAA,CAAAoF,EAAA,EAIAuyF,EAAA,GAAAvyF,EAAA,IACAuyF,EAAA,GACAlvF,GAAA,KAAAysB,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GACU4oI,EAAA,IACV/wE,EAAA,IACAlvF,GAAA,OAAAysB,MAAA,CAAA2zI,CAAA,CAAAzjK,EAAA,IACAgkK,KAEA3gK,GAAA,OAAAysB,MAAA,CAAA2zI,CAAA,CAAAzjK,EAAA,IACAgkK,KAGAX,EAAArjK,EAEAs+B,GAAA,KAAAxO,MAAA,CAAAsL,EAAA,KAAAtL,MAAA,CAAA4K,EAAA,KAAA5K,MAAA,CAAA2zI,CAAA,CAAAzjK,EAAA,EACAgkK,SAEA,GAAAP,EAAA7oK,MAAA,CAAAoF,EAAA,EAIAuyF,EAAA,GAAAvyF,EAAA,IACAuyF,EAAA,GACAlvF,GAAA,KAAAysB,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GACU4oI,EAAA,IACV/wE,EAAA,IACAlvF,GAAA,OAAAysB,MAAA,CAAA0zI,CAAA,CAAAxjK,EAAA,IACAgkK,KAEA3gK,GAAA,OAAAysB,MAAA,CAAA0zI,CAAA,CAAAxjK,EAAA,IACAgkK,KAGAX,EAAArjK,EAEAqD,GAAA,KAAAysB,MAAA,CAAA8L,EAAA,KAAA9L,MAAA,CAAA4K,EAAA,KAAA5K,MAAA,CAAA0zI,CAAA,CAAAxjK,EAAA,EACAgkK,QAEA,CACA,IAAAE,EAAAT,CAAA,CAAAzjK,EAAA,CACAmkK,EAAAX,CAAA,CAAAxjK,EAAA,CAIAokK,EAAAD,IAAAD,GAAA,EAAA9B,EAAA+B,EAAA,MAAAA,EAAAnpK,KAAA,SAAAkpK,CAAA,EAUAE,GAAAhC,EAAA8B,EAAA,MAAAA,EAAAlpK,KAAA,SAAAmpK,IACAC,EAAA,GACAD,GAAA,KAEAC,GAIA7xE,EAAA,GAAAvyF,EAAA,IACAuyF,EAAA,GACAlvF,GAAA,KAAAysB,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GACY4oI,EAAA,IACZ/wE,EAAA,IACAlvF,GAAA,OAAAysB,MAAA,CAAA0zI,CAAA,CAAAxjK,EAAA,IACAgkK,KAEA3gK,GAAA,OAAAysB,MAAA,CAAA0zI,CAAA,CAAAxjK,EAAA,IACAgkK,KAGAX,EAAArjK,EAGAqD,GAAA,KAAAysB,MAAA,CAAA8L,EAAA,KAAA9L,MAAA,CAAA4K,EAAA,KAAA5K,MAAA,CAAAq0I,GACA7lI,GAAA,KAAAxO,MAAA,CAAAsL,EAAA,KAAAtL,MAAA,CAAA4K,EAAA,KAAA5K,MAAA,CAAAo0I,GACAF,GAAA,IAKA3gK,GAAAi7B,EACAA,EAAA,GAGAi0D,CAAAA,IAAAA,GAAAvyF,IAAAA,CAAA,IACAqD,GAAA,OAAAysB,MAAA,CAAAq0I,GACAH,KAGA,IAEAA,EAAA,IAAAhkK,EAAA8jK,EAAA,EACA,SAAAh0I,MAAA,CAAA5zB,GAAA4zB,MAAA,CAAAm0I,EAAA,MAAAn0I,MAAA,CAAAzsB,EAAA,MAAAysB,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GAAA5K,MAAA,CAAAwO,EAAA,SAAAxO,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,EACA,CAEA,SAAA5K,MAAA,CAAA5zB,GAAA4zB,MAAA,CAAAwzI,EAAAW,EAAA,SAAAn0I,MAAA,CAAAzsB,GAAAysB,MAAA,CAAAwO,GAAAxO,MAAA,CAAAtF,GAAAsF,MAAA,CAAA4zI,EACA,CACA,IAAAj6D,EAAA,SAAA46D,CAAA,CAAAC,CAAA,EACAvD,EAAAt3D,EAAA46D,GACA,IAAAE,EAAApD,EAAA13D,GACA,SAAAA,EAAAzrG,CAAA,EAGA,GADAm/J,EAAA,KAAA1zD,GACA/O,WAAAA,EAAA18F,IAAAA,IAAA,GAAAA,EACA,UAAA8nG,EAAA,mBAAA9nG,EAAA,CAEA,IALAkqB,EAKAnsB,EAAAiC,EAAAjC,OAAA,CACA4tG,EAAA3rG,EAAA2rG,QAAA,CACA20D,EAAAtgK,EAAAsgK,YAAA,CACAhgE,EAAAtgG,EAAAsgG,MAAA,CACAoL,EAAA1rG,EAAA0rG,QAAA,CACAl3B,EAAAprE,MAAAo9J,eAAA,CAEA,GADAp9J,MAAAo9J,eAAA,GACAzoK,IAAA,EAAAA,EACMmsB,EAAAq8I,EAAAl8J,IAAA,MAAAyR,OAAA/d,SAwBN,GAtBAgmB,EAAA6hJ,MAAA,EAAA7hJ,EAAA6hJ,MAAA,CAAAC,KAAA,GAGA9hJ,EAAA6hJ,MAAA,EAAA7hJ,EAAA6hJ,MAAA,CAAAa,aAAA,EAAA1iJ,IAAAA,EAAA6hJ,MAAA,CAAAa,aAAA,IACAjpI,EAAA,WACAI,EAAA,WACAlB,EAAA,WACUU,EAAA,aAEVI,EAAA,GACAI,EAAA,GACAlB,EAAA,GACAU,EAAA,KAMA,WAAAs/D,EAAA4D,IAAAA,IAAA,GAAAA,GAAA5D,WAAAA,EAAAgP,IAAAA,IAAA,GAAAA,GAAA,UAAApL,GAAAA,aAAAl3F,OAAA,UAAAsiG,GAAAA,aAAAtiG,QACAk3F,EAAAukE,EAAAvkE,GACAoL,EAAAm5D,EAAAn5D,IAEAC,oBAAAA,GAAAA,gBAAAA,EACQzhF,EAAAq8I,EAAAl8J,IAAA,MAAA+6J,EAAA9kE,EAAAoL,EAAAC,SACR,GAAAA,uBAAAA,GAAAA,mBAAAA,EAAA,CAGA,IAAA3/D,EAAAw4H,CAAA,CAAA74D,EAAA,CAAAtmG,EAAAy/J,EAAAxkE,GAAA/pF,KAAA,OAUA,GANA,mBAAAo1F,GAAAjP,WAAAA,EAAA4D,IAAAA,IAAA,GAAAA,GACAt0D,CAAAA,EAAAw4H,EAAAE,oBAAA,EAKAr/J,EAAAzI,MAAA,IAEA,IADAyI,CAAA,QAAAysB,MAAA,CAAA0L,EAAA,OAAA1L,MAAA,CAAA4K,GACAr3B,EAAAzI,MAAA,KACAyI,EAAAmqD,GAAA,EACA,CAKUtlC,EADV7kB,IAAAA,EAAAzI,MAAA,CACU2pK,EAAAl8J,IAAA,SAAAynB,MAAA,CAAAka,EAAA,KAAAla,MAAA,CAAAzsB,CAAA,MAEVkhK,EAAAl8J,IAAA,SAAAynB,MAAA,CAAAka,EAAA,QAAAla,MAAA,CAAAzsB,EAAAlH,IAAA,aAEA,MACA,IAAAuoK,EAAA5B,EAAAxkE,GACAhgE,EAAA,GACAqmI,EAAAnC,CAAA,CAAA74D,EAAA,CACA,iBAAAA,GAAAA,aAAAA,EAEA+6D,CADAA,EAAA,GAAA50I,MAAA,CAAA0yI,CAAA,CAAA74D,EAAA,SAAA75E,MAAA,CAAA40I,EAAA,EACA9pK,MAAA,OACA8pK,CAAAA,EAAA,GAAA50I,MAAA,CAAA40I,EAAA1pK,KAAA,kBAGAsjC,EAAA,GAAAxO,MAAA,CAAAgzI,EAAAp5D,IACAg7D,EAAA9pK,MAAA,MACA8pK,CAAAA,EAAA,GAAA50I,MAAA,CAAA40I,EAAA1pK,KAAA,gBAEAsjC,EAAA1jC,MAAA,MACA0jC,CAAAA,EAAA,GAAAxO,MAAA,CAAAwO,EAAAtjC,KAAA,gBAEA2uG,cAAAA,GAAAA,UAAAA,EACY+6D,EAAA,GAAA50I,MAAA,CAAA60I,EAAA,QAAA70I,MAAA,CAAA40I,EAAA,wBAEZpmI,EAAA,IAAAxO,MAAA,CAAA65E,EAAA,KAAA75E,MAAA,CAAAwO,IAGApW,EAAAq8I,EAAAl8J,IAAA,SAAAynB,MAAA,CAAA40I,GAAA50I,MAAA,CAAAwO,GACA,QAEAl3B,MAAAo9J,eAAA,CAAAhyF,EACAtqD,EAAA0hF,gBAAA,EAAA7tG,EACAU,OAAA8L,cAAA,CAAAq5J,EAAA15I,GAAA,QACA9rB,MAAA,iCACAspB,WAAA,GACA+zB,SAAA,GACKC,aAAA,EACL,GACAxxB,EAAAjkB,IAAA,iBACAikB,EAAAo2E,MAAA,CAAAA,EACAp2E,EAAAwhF,QAAA,CAAAA,EACAxhF,EAAAyhF,QAAA,CAAAA,EACAviG,MAAA0iG,iBAAA,EAEA1iG,MAAA0iG,iBAAA,CAAA83D,EAAA15I,GAAAo2I,GAGAp2I,EAAAlJ,KAAA,CAEAkJ,EAAAvrB,IAAA,kBACAglK,EAAAz5I,EACA,CAmBC,OAlBD00I,EAAAnzD,EAAA,EACAptG,IAAA,WACAD,MAAA,WACA,SAAA0zB,MAAA,MAAAnzB,IAAA,OAAAmzB,MAAA,MAAA7rB,IAAA,QAAA6rB,MAAA,MAAA/zB,OAAA,CACG,CACH,GACAM,IAAAioK,EACAloK,MAAA,SAAAurG,CAAA,CAAA9tG,CAAA,EAKA,OAAA6nG,EAAA,KAAAk/D,EAAAA,EAAA,GAAA/mK,GAAA,IACAytG,cAAA,GACOnZ,MAAA,CACP,GACG,CACH,IACCsb,CACD,EAAAo4D,EAAAz6J,OAAAs6F,EAAAkjE,MAAA,CAAAnrK,CAAAA,EAAAC,OAAA,CAAA+vG,CAAA,gBAAAhwG,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC5bA,aAeA,SAAAqhG,EAAArhD,CAAA,EAA4C,MAAmNqhD,CAAnNA,EAAgB,YAAkB,OAAO19F,QAAA,iBAA2BA,OAAAC,QAAA,UAAAo8C,CAAA,gBAAAA,CAAA,EAAwD,SAAAA,CAAA,SAAAA,GAAA,YAAgC,OAAAr8C,QAAAq8C,EAAA19C,WAAA,GAAAqB,QAAuDq8C,IAAAr8C,OAAAmL,SAAA,iBAAAkxC,CAAA,GAAAA,EAAA,CAC/P,SAAAojH,EAAAplH,CAAA,CAAAj4C,CAAA,UAAAY,EAAA,EAAAA,EAA8DZ,EAAAxE,MAAA,CAAAoF,IAAA,KAAA08J,EAAAt9J,CAAA,CAAAY,EAAA,CAAA08J,EAAAh3I,UAAsE,CAAAg3I,EAAAh3I,UAAA,KAAAg3I,EAAAhjH,YAAA,CAA8D,aAAAgjH,GAAAA,CAAAA,EAAAjjH,QAAkD,KAAAh9C,OAAiB8L,cAAG,CAAA8uC,EAAAslH,EAAAD,EAAArgK,GAAA,EAAAqgK,EAAA,EACxQ,SAAAE,EAAAC,CAA+B,CAAAC,CAAA,CAAAC,CAAA,EAAuC,OAAvCD,GAAuCL,EAAAI,EAAA10J,SAAA,CAAA20J,GAAAC,GAAAN,EAAAI,EAAAE,GAAAtgK,OAAA8L,cAAA,CAAAs0J,EAAA,aAAApjH,SAAA,KAAAojH,CAAA,CACtE,SAAAF,EAAAnsI,CAAA,MAAAn0B,EAAqC2gK,EAAAxsI,EAAA,gBAAAkqE,WAAAA,EAAAr+F,GAAiEA,EAAAyd,OAAAzd,EAAA,CACtG,SAAA2gK,EAAA1/J,CAAA,CAAA2/J,CAAA,KAAAviE,WAAAA,EAAAp9F,IAAkDA,IAAA,GAAAA,EAAA,OAA0CA,CAAA,KAAA4/J,EAAA5/J,CAAA,CAAAN,OAAA29F,WAAA,KAAAuiE,KAAAz/J,IAAAy/J,EAAA,KAAA75J,EAAA65J,EAAA70J,IAAA,CAAA/K,EAAA2/J,GAAA,cAAAviE,WAAAA,EAAAr3F,GAAA,OAAAA,CAAA,wEAAA45J,WAAAA,EAAAnjJ,OAAAxH,MAAA,EAAAhV,EAAA,CAC5F,SAAA6/J,EAAAvuC,CAAA,CAAAiuC,CAA2C,MAAAjuC,CAAAA,aAAAiuC,CAAA,kBAA+D,qCAC1G,SAAAkE,EAAAC,CAAA,CAAAC,CAAiC,wBAAAA,GAAAA,IAAA,GAAAA,EAAA,qEAAwI,CAAAD,EAAA74J,SAAA,CAAA1L,OAAA8C,MAAA,CAAA0hK,GAAAA,EAAA94J,SAAA,EAAAxM,YAAA,CAAAS,MAAA4kK,EAAAvnH,SAAA,GAAAC,aAAA,MAAAj9C,OAAA8L,cAAA,CAAAy4J,EAAA,aAAAvnH,SAAA,KAAAwnH,GAAAC,EAAAF,EAAAC,EAAA,CACzK,SAAAC,EAAA7nH,CAAA,CAAA53B,CAAA,EAAuI,MAAAy/I,CAAtGA,EAAAzkK,OAAA+gG,cAAA,CAAA/gG,OAAA+gG,cAA6D,CAAAlnF,IAAA,YAAA+iC,CAAA,CAAA53B,CAAyC,SAAA43B,EAAA0R,SAAA,CAAAtpC,EAAA43B,CAAA,GAA8CA,EAAA53B,EAAA,CACrL,SAAA0/I,EAAAC,CAAA,MAAAC,EAAkDC,IAAA,iBAA0E,KAA2C3jK,EAA5B4jK,EAAAC,EAAAJ,GAA4B,GAAAC,EAAA,KAAAI,EAAAD,EAAA,IAAmF,EAAA7lK,WAAA,CAAAgC,EAAA+jD,QAAAggH,SAAA,CAAAH,EAAAzuI,UAAA2uI,EAAA,MAAA9jK,EAAA4jK,EAAA9mK,KAAA,MAAAq4B,UAAA,QAAA6uI,EAAA,KAAAhkK,EAAA,EAC1P,SAAAgkK,EAAA1oK,CAAwC,CAAAoP,CAAA,KAAAA,GAAuBqyF,CAAAA,WAAAA,EAAAryF,IAAA,mBAAAA,CAAA,SAAAA,CAAyF,CAAzF,GAAAA,KAAyF,IAAzFA,EAAyF,mFAAAu5J,EAAA3oK,EAAA,CACxJ,SAAA2oK,EAAA3oK,CAAA,EAAuC,GAAAA,KAAA,IAAAA,EAAA,iFAAwE,QAA0CA,CAAA,CACzJ,SAAAqoK,GAA8B,wBAAA5/G,SAAA,CAAAA,QAAAggH,SAAA,EAAAhgH,QAAAggH,SAAA,CAAuGS,IAAA,CAAvG,SAAuG,sBAAA7zG,MAAmD,oBAAAupB,QAAA1vE,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAAq5C,QAAAggH,SAAA,CAAA7pF,QAAA,2BAAA92E,EAAA,WACxL,SAAAygK,EAAAnoH,CAAA,QAAAmoH,CAAAA,EAAA/kK,OAAA+gG,cAAA,CAAA/gG,OAAAy6C,cAAA,CAAA5gC,IAAA,YAAA+iC,CAAA,SAAAA,EAAA0R,SAAA,EAAAtuD,OAAAy6C,cAAA,CAAAmC,EAAA,GAAAA,EAAA,KAIA/5C,EACAulK,EALAvH,EAAA,GAMA,SAAAwH,EAAA7gK,CAAA,CAAAlI,CAAA,CAAA0pG,CAAA,EAIA,SAAAD,EAAAu/D,CAAA,CAAAC,CAAA,CAAAC,CAAA,QACA,iBAAAlpK,EACMA,EAENA,EAAAgpK,EAAAC,EAAAC,EACA,CARAx/D,GACAA,CAAAA,EAAAr+F,KAAA,EASA,IAAA89J,EAAA,SAAAC,CAAA,EACApE,EAAAmE,EAAAC,GACA,IAAAZ,EAAApD,EAAA+D,GACA,SAAAA,EAAAH,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAA/8I,EAIA,OAHAi1I,EAAA,KAAA+H,GAEAh9I,CADAA,EAAAq8I,EAAAl8J,IAAA,MAAAm9F,EAAAu/D,EAAAC,EAAAC,GAAA,EACAhhK,IAAA,CAAAA,EACAikB,CACA,CACG,OAAA00I,EAAAsI,EACH,EAAAz/D,EACA63D,CAAAA,CAAA,CAAAr5J,EAAA,CAAAihK,CAAA,CAIA,SAAAE,EAAA17D,CAAA,CAAA27D,CAAA,EACA,IAAA7qK,MAAA6D,OAAA,CAAAqrG,GAaA,YAAA55E,MAAA,CAAAu1I,EAAA,KAAAv1I,MAAA,CAAAhW,OAAA4vF,GACA,CAbA,IAAAt2E,EAAAs2E,EAAA9uG,MAAA,OAIA,CAHA8uG,EAAAA,EAAA7uG,GAAA,UAAAmF,CAAA,EACK,OAAA8Z,OAAA9Z,EACL,GACAozB,EAAA,GACM,UAAAtD,MAAA,CAAAu1I,EAAA,KAAAv1I,MAAA,CAAA45E,EAAA1uG,KAAA,GAAAo4B,EAAA,GAAAj3B,IAAA,gBAAAutG,CAAA,CAAAt2E,EAAA,GACNA,IAAAA,EACM,UAAAtD,MAAA,CAAAu1I,EAAA,KAAAv1I,MAAA,CAAA45E,CAAA,YAAA55E,MAAA,CAAA45E,CAAA,KAEN,MAAA55E,MAAA,CAAAu1I,EAAA,KAAAv1I,MAAA,CAAA45E,CAAA,IACI,CAOJ,SAAA17C,EAAAxpC,CAAA,CAAA4F,CAAA,CAAAi3E,CAAA,EACA,OAAA78E,EAAA0mC,MAAA,EAAAm2C,GAAAA,EAAA,KAAAA,CAAA,CAAAj3E,EAAAxvB,MAAA,IAAAwvB,CAAA,CAIA,SAAAg4I,EAAA59I,CAAA,CAAA4F,CAAA,CAAAi4I,CAAA,EAIA,MAHAA,CAAAA,KAAA5kK,IAAA4kK,GAAAA,EAAA79I,EAAA5pB,MAAA,GACAynK,CAAAA,EAAA79I,EAAA5pB,MAAA,EAEA4pB,EAAA+hB,SAAA,CAAA87H,EAAAj4I,EAAAxvB,MAAA,CAAAynK,KAAAj4I,CAAA,CAIA,SAAAgkC,EAAA5pC,CAAA,CAAA4F,CAAA,CAAA8gB,CAAA,QAIA,UAHA,OAAAA,GACAA,CAAAA,EAAA,IAEAA,CAAAA,EAAA9gB,EAAAxvB,MAAA,CAAA4pB,EAAA5pB,MAAA,GAGA4pB,KAAAA,EAAA5K,OAAA,CAAAwQ,EAAA8gB,EACA,CAEA45H,EAAA,8DAAAppK,WACAopK,EAAA,uBAAqC,SAAAnoK,CAAA,CAAO+sG,CAAY,CAAApL,CAAA,EAaxD,GAZA7gG,KAAAA,IAAA6B,GAAAA,CAAAA,EAAAjG,EAAA,OAAAiG,EAAA,iBAAA3C,EAAA,2BAKA,iBAAA+sG,GAAA17C,EAAA07C,EAAA,SACA47D,EAAA,cACI57D,EAAAA,EAAA1rF,OAAA,cAEJsnJ,EAAA,UAGAlD,EAAAzlK,EAAA,aAEIT,EAAA,OAAA4zB,MAAA,CAAAnzB,EAAA,KAAAmzB,MAAA,CAAAw1I,EAAA,KAAAx1I,MAAA,CAAAs1I,EAAA17D,EAAA,aACJ,CACA,IAZA47D,EAOAppK,EAKAI,EAAA8xD,EAAAzxD,EAAA,2BACAT,EAAA,QAAA4zB,MAAA,CAAAnzB,EAAA,MAAAmzB,MAAA,CAAAxzB,EAAA,KAAAwzB,MAAA,CAAAw1I,EAAA,KAAAx1I,MAAA,CAAAs1I,EAAA17D,EAAA,gBAIAxtG,EAAA,mBAAA4zB,MAAA,CAAA4qE,EAAA4D,GAEA,EAAA5iG,WACAopK,EAAA,iCAAAnoK,CAAA,CAAAP,CAAA,EACA,IAAAkrD,EAAAx0B,UAAAl4B,MAAA,CAAiC,GAAAk4B,KAAQr1B,IAARq1B,SAAA,IAAeA,SAAA,sBAChDr1B,IAAAonK,GAAAA,CAAAA,EAAAxrK,EAAA,OACA,IAAAksK,EAAAV,EAAAnjE,OAAA,CAAAtlG,GAIC,OAHDmpK,EAAA3qK,MAAA,MACA2qK,CAAAA,EAAA,GAAAz1I,MAAA,CAAAy1I,EAAAvqK,KAAA,gBAEC,iBAAA80B,MAAA,CAAAnzB,EAAA,MAAAmzB,MAAA,CAAAw3B,EAAA,eAAAx3B,MAAA,CAAAy1I,EACD,EAAA7pK,UAAAsqG,YACA8+D,EAAA,oCAAAxnK,CAAA,CAAAX,CAAA,CAAAP,CAAA,EACA,IAAAE,EAMC,OAJGA,EADJF,GAAAA,EAAAT,WAAA,EAAAS,EAAAT,WAAA,CAAAgB,IAAA,CACI,eAAAmzB,MAAA,CAAA1zB,EAAAT,WAAA,CAAAgB,IAAA,EAEJ,QAAAmzB,MAAA,CAAA4qE,EAAAt+F,IAEC,YAAA0zB,MAAA,CAAAxyB,EAAA,8BAAAwyB,MAAA,CAAAnzB,EAAA,0BAAAmzB,MAAA,CAAAxzB,EAAA,IACD,EAAAZ,WACAopK,EAAA,8BACA,QAAAjyI,EAAAC,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA2vB,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IACA7vB,CAAA,CAAA6vB,EAAA,CAAAD,SAAA,CAAAC,EAAA,MAEAt1B,IAAA6B,GAAAA,CAAAA,EAAAjG,EAAA,OACAiG,EAAA4D,EAAAtI,MAAA,6CACA,IAAAsB,EAAA,OACAk3B,EAAAlwB,EAAAtI,MAAA,CAIA,OAHAsI,EAAAA,EAAArI,GAAA,UAAArB,CAAA,EACG,UAAAs2B,MAAA,CAAAt2B,EAAA,IACH,GACA45B,GACA,OACAl3B,GAAA,GAAA4zB,MAAA,CAAA5sB,CAAA,iBACA,WACA,EACAhH,GAAA,GAAA4zB,MAAA,CAAA5sB,CAAA,aAAA4sB,MAAA,CAAA5sB,CAAA,kBACA,cAGAhH,GADAgH,EAAAlI,KAAA,GAAAo4B,EAAA,GAAAj3B,IAAA,OACA,SAAA2zB,MAAA,CAAA5sB,CAAA,CAAAkwB,EAAA,gBAEA,CACC,SAAAtD,MAAA,CAAA5zB,EAAA,qBACD,EAAAR,WAAoBjC,EAAAC,OAAA,CAAA4jK,KAAA,CAAAA,CAAA,gBAAA7jK,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC1KpB,aAMA,SAAAmsK,EAAAh+F,CAAA,CAAAxnE,CAA8B,SAAAylK,EAAAj+F,IAAAk+F,EAAAl+F,EAAAxnE,IAAA2lK,EAAAn+F,EAAAxnE,IAAA4lK,GAAA,CAC9B,SAAAA,GAAA,iBAAkD,4IAAwI,CAC1L,SAAAD,EAAAtsH,CAAA,CAAuC2nE,CAAA,KAAA3nE,GAAA,oBAAAA,EAAA,OAAuDwsH,EAAAxsH,EAAA2nE,EAAA,KAAuChnH,EAAAyC,OAAS0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAuB,CAAAgxC,GAAAr+C,KAAA,qBAAAhB,GAAAq/C,EAAA19C,WAAA,EAAA3B,CAAAA,EAAAq/C,EAAA19C,WAAA,CAAAgB,IAAA,EAAA3C,QAAAA,GAAAA,QAAAA,EAAA,OAAAQ,MAAAud,IAAA,CAAAshC,EAAA,IAAAr/C,cAAAA,GAAA,2CAAA+f,IAAA,CAAA/f,GAAA,OAAA6rK,EAAAxsH,EAAA2nE,EAAA,CAA9H,CACvC,SAAA6kD,EAAAr+F,CAAA,CAAAp0C,CAAA,EAAuCA,CAAAA,IAAA,EAAAA,GAAAA,EAAAo0C,EAAA5sE,MAAA,GAAAw4B,CAAAA,EAAAo0C,EAAA5sE,MAAA,UAAAoF,EAAA,EAAA8lK,EAAA,MAAA1yI,GAAApzB,EAAkGozB,EAAApzB,IAAA8lK,CAAA,CAAA9lK,EAAiB,CAAAwnE,CAAA,CAAAxnE,EAAA,QAAA8lK,CAAA,CAC1J,SAAAJ,EAAA5nK,CAAgC,CAAA6oC,CAAA,MAAA9nC,EAAA,MAAAf,EAAA,yBAAAd,QAAAc,CAAA,CAAAd,OAAAC,QAAA,GAAAa,CAAA,wBAAAe,EAAA,KAAAkC,EAAA/G,EAAAgG,EAAA2rD,EAAAnyD,EAAA,GAAAotC,EAAA,GAAAyS,EAAA,UAAAr5C,EAAA,CAAAnB,EAAAA,EAAAwJ,IAAA,CAAAvK,EAAA,EAAAN,IAAA,KAAAmpC,CAAA,KAAAlqC,OAAAoC,KAAAA,EAAA,OAAA+nC,EAAA,cAAAA,CAAAA,EAAA,CAAA7lC,EAAAf,EAAAqI,IAAA,CAAAxJ,EAAA,EAAAtB,IAAA,GAAA/D,CAAAA,EAAAN,IAAA,CAAA6H,EAAA3E,KAAA,EAAA5C,EAAAoB,MAAA,GAAA+rC,CAAA,EAAAC,EAAA,WAAA9oC,EAAA,CAAAu7C,EAAA,GAAAr/C,EAAA8D,CAAA,iBAAA8oC,GAAA,MAAA/nC,EAAAwsB,MAAA,EAAAsgC,CAAAA,EAAA9sD,EAAAwsB,MAAA,GAAA5uB,OAAAkvD,KAAAA,CAAA,oBAAAtS,EAAA,MAAAr/C,CAAA,SAAAR,CAAA,EAChC,SAAAisK,EAAsBj+F,CAAA,KAAAhtE,MAAA6D,OAA2B,CAAAmpE,GAAA,OAAAA,CAAA,CACjD,SAAAkzB,EAAArhD,CAAA,QAAAqhD,CAAAA,EAAA,mBAAA19F,QAAA,iBAAAA,OAAAC,QAAA,UAAAo8C,CAAA,gBAAAA,CAAA,WAAAA,CAAA,SAAAA,GAAA,mBAAAr8C,QAAAq8C,EAAA19C,WAAA,GAAAqB,QAAAq8C,IAAAr8C,OAAAmL,SAAA,iBAAAkxC,CAAA,GAAAA,EAAA,CACA,IAAA0sH,EAAA,KAAAtoK,IAAA,KAAAuoK,KAAA,CACAC,EAAA,SAAAlnK,CAAA,EACA,IAAAzE,EAAA,GAIA,OAHAyE,EAAA8H,OAAA,UAAAzK,CAAA,EACG,OAAA9B,EAAApB,IAAA,CAAAkD,EACH,GACA9B,CACA,EACA4rK,EAAA,SAAArrK,CAAA,EACA,IAAAP,EAAA,GAIA,OAHAO,EAAAgM,OAAA,UAAAzK,CAAA,CAAAC,CAAA,EACG,OAAA/B,EAAApB,IAAA,EAAAmD,EAAAD,EAAA,CACH,GACA9B,CACA,EACAyjK,EAAAthK,OAAA+C,EAAA,CAAA/C,OAAA+C,EAAA,CAAAnG,EAAA,KACA8sK,EAAA1pK,OAAA2mD,qBAAA,CAAA3mD,OAAA2mD,qBAAA,YACA,SACA,CACAq7C,EAAAnsF,OAAA/R,KAAA,CAAA+R,OAAA/R,KAAA,CAAAlH,EAAA,KACA,SAAA+sK,EAAAx/H,CAAA,EACA,OAAAA,EAAAv+B,IAAA,CAAAiO,IAAA,CAAAswB,EACA,CACA,IAAAx+B,EAAAg+J,EAAA3pK,OAAA0L,SAAA,CAAAC,cAAA,EACAi7C,EAAA+iH,EAAA3pK,OAAA0L,SAAA,CAAAk7C,oBAAA,EACA0lD,EAAqBq9D,EAAA3pK,OAAA0L,SAAA,CAAAxF,QAAsB,EAC3Ci7J,EAAAvkK,EAAA,MAAAw2D,KAAA,CACAw2G,EAAAzI,EAAAyI,gBAAA,CACA5sJ,EAAAmkJ,EAAAnkJ,iBAAA,CACA2uF,EAAAw1D,EAAAx1D,MAAA,CACAk+D,EAAA1I,EAAA0I,KAAA,CACAn+D,EAAAy1D,EAAAz1D,QAAA,CACA56C,EAAAqwG,EAAArwG,KAAA,CACAg5G,EAAA3I,EAAA2I,aAAA,CACAC,EAAA5I,EAAA4I,gBAAA,CACAC,EAAA7I,EAAA6I,cAAA,CACAC,EAAA9I,EAAA8I,cAAA,CACAC,EAAA/I,EAAA+I,eAAA,CACAC,EAAAhJ,EAAAgJ,cAAA,CACAC,EAAAjJ,EAAAiJ,cAAA,CACAC,EAAAlJ,EAAAkJ,cAAA,CACAC,EAAAnJ,EAAAmJ,cAAA,CACA,SAAAC,EAAA3qK,CAAA,EACA,GAAAA,IAAAA,EAAAzB,MAAA,EAAkByB,EAAAzB,MAAgB,aAClC,QAAAoF,EAAA,EAAAA,EAAA3D,EAAAzB,MAAA,CAAAoF,IAAA,CACA,IAAAiE,EAAA5H,EAAAguB,UAAA,CAAArqB,GACA,GAAAiE,EAAA,IAAAA,EAAA,YAGA,OAAA5H,KAAAA,EAAAzB,MAAA,EAAAyB,GAAA3B,UACA,CACA,SAAAusK,EAAA7qK,CAAA,EACA,OAAAK,OAAAiE,IAAA,CAAAtE,GAAA4nB,MAAA,CAAAgjJ,GAAAl3I,MAAA,CAAAq2I,EAAA/pK,GAAA4nB,MAAA,CAAAvnB,OAAA0L,SAAA,CAAAk7C,oBAAA,CAAA/sC,IAAA,CAAAla,IAAA,CAKA;;;;;CAKA,GACA,SAAAs0D,EAAAl3D,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,IAAAkZ,EACA,QACA,CAGA,QAFA5V,EAAAtD,EAAAoB,MAAA,CACAuzB,EAAAzb,EAAA9X,MAAA,CACAoF,EAAA,EAAAozB,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAAAnuB,EAAAozB,EAAA,EAAApzB,EACA,GAAAxG,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,CAAA1S,EAAA,EACAlD,EAAAtD,CAAA,CAAAwG,EAAA,CACAmuB,EAAAzb,CAAA,CAAA1S,EAAA,CACA,MACA,OAEA,EAAAmuB,EACA,GAEAA,EAAArxB,EACA,EAEA,CAJA,CAMA,IAAAoqK,EAAAzpK,KAAAA,EACA0pK,EAAA,GACAC,EAAA,GACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EAAAC,EAAA,EAIA,SAAAC,EAAAjuK,CAAA,CAAAkZ,CAAA,EACA,OAAAqzJ,EAAAvsK,EAAAwpB,MAAA,GAAAtQ,EAAAsQ,MAAA,EAAAxpB,EAAAwsK,KAAA,GAAAtzJ,EAAAszJ,KAAA,CAAAn3G,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAA7O,KAAAq1D,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAqK,EAAA,CAEA,SAAAg1J,EAAAluK,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,EAAAsiB,UAAA,GAAApJ,EAAAoJ,UAAA,CACA,QACA,CACA,QAAAnJ,EAAA,EAAAA,EAAAnZ,EAAAsiB,UAAA,CAAAnJ,IACA,GAAAnZ,CAAA,CAAAmZ,EAAA,GAAAD,CAAA,CAAAC,EAAA,CACA,QACA,CAEA,QACA,CACA,SAAAg1J,EAAAnuK,CAAA,CAAAkZ,CAAA,SACA,EAAAoJ,UAAA,GAAApJ,EAAAoJ,UAAA,EAGA40C,IAAAA,EAAA,IAAAxqD,WAAA1M,EAAAuiB,MAAA,CAAAviB,EAAA+9D,UAAA,CAAA/9D,EAAAsiB,UAAA,MAAA5V,WAAAwM,EAAAqJ,MAAA,CAAArJ,EAAA6kD,UAAA,CAAA7kD,EAAAoJ,UAAA,EACA,CACA,SAAA8rJ,EAAAC,CAAA,CAAAC,CAAA,EACA,OAAAD,EAAA/rJ,UAAA,GAAAgsJ,EAAAhsJ,UAAA,EAAA40C,IAAAA,EAAA,IAAAxqD,WAAA2hK,GAAA,IAAA3hK,WAAA4hK,GACA,CACA,SAAAC,EAAAC,CAAA,CAAAC,CAAA,SACA,EAAAD,GACAvB,EAAAwB,IAAAlK,EAAAzrJ,OAAAnK,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA2/J,GAAA11J,OAAAnK,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA4/J,IAEAvB,EAAAsB,GACAtB,EAAAuB,IAAAnuJ,OAAA3R,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA2/J,KAAAluJ,OAAA3R,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA4/J,GAEAtB,EAAAqB,GACArB,EAAAsB,IAAApwF,QAAA1vE,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA2/J,KAAAnwF,QAAA1vE,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA4/J,GAEArB,EAAAoB,GACApB,EAAAqB,IAAAhkH,OAAA97C,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA2/J,KAAA/jH,OAAA97C,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA4/J,GAEApB,EAAAoB,IAAAjrK,OAAAmL,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA2/J,KAAAhrK,OAAAmL,SAAA,CAAA81F,OAAA,CAAA51F,IAAA,CAAA4/J,EAVA,CAgCA,SAAAC,EAAAF,CAAA,CAAAC,CAAA,CAAAx9D,CAAA,CAAAC,CAAA,EAEA,GAAAs9D,IAAAC,SACA,IAAAD,IACAv9D,GAAAszD,EAAAiK,EAAAC,EAAA,CAIA,GAAAx9D,EAAA,CACA,GAAA/P,WAAAA,EAAAstE,GACA,uBAAAA,GAAAvpE,EAAAupE,IAAAvpE,EAAAwpE,EACA,CACA,cAAAvtE,EAAAutE,IAAAD,IAAA,GAAAA,GAAAC,IAAA,GAAAA,GAGAxrK,OAAAy6C,cAAA,CAAA8wH,KAAAvrK,OAAAy6C,cAAA,CAAA+wH,GAFA,QACA,KAIA,CACA,GAAAD,IAAA,GAAAA,GAAAttE,WAAAA,EAAAstE,SACA,CAAAC,IAAA,GAAAA,GAAAvtE,WAAAA,EAAAutE,EAAA,GAEAD,GAAAC,CAGA,CACA,GAAAA,IAAA,GAAAA,GAAAvtE,WAAAA,EAAAutE,GACA,QACA,CACA,IACAE,EAAAp/D,EAAAi/D,GAEA,GAAAG,IADAp/D,EAAAk/D,GAEA,QACA,CACA,GAAAztK,MAAA6D,OAAA,CAAA2pK,GAAA,CAEA,GAAAA,EAAAptK,MAAA,GAAAqtK,EAAArtK,MAAA,CACA,QACA,CACA,IAAAwtK,EAAAnB,EAAAe,EAAAd,GACAmB,EAAApB,EAAAgB,EAAAf,UACA,EAAAtsK,MAAA,GAAAytK,EAAAztK,MAAA,EAGA0tK,EAAAN,EAAAC,EAAAx9D,EAAAC,EAAA48D,EAAAc,EACA,IAIAD,oBAAAA,GAEA,EAAA7B,EAAA0B,IAAA1B,EAAA2B,IAAA,CAAA16G,EAAAy6G,IAAAz6G,EAAA06G,EAAA,EACA,QAEA,CACA,GAAA7/D,EAAA4/D,GACA,KAAA5/D,EAAA6/D,IAAA9yE,KAAAhtF,SAAA,CAAA+sF,OAAA,CAAA7sF,IAAA,CAAA2/J,KAAA7yE,KAAAhtF,SAAA,CAAA+sF,OAAA,CAAA7sF,IAAA,CAAA4/J,GACA,QACI,MACJ,GAAA9/D,EAAA6/D,GACA,KAAA7/D,EAAA8/D,IAAA,CAAAR,EAAAO,EAAAC,GACA,QACI,MACJ,GAAA1B,EAAAyB,IAAAA,aAAA5gK,MAGA,IAAA4gK,EAAAjsK,OAAA,GAAAksK,EAAAlsK,OAAA,EAAAisK,EAAArrK,IAAA,GAAAsrK,EAAAtrK,IAAA,CACA,QACI,MACJ,GAAA8c,EAAAuuJ,GAAA,CACA,IAAAv9D,GAAAq8D,CAAAA,EAAAkB,IAAAjB,EAAAiB,EAAA,EACA,KAAAN,EAAAM,EAAAC,GACA,QACM,MACN,IAAAN,EAAAK,EAAAC,GACA,QACA,CAIA,IAAAM,EAAAtB,EAAAe,EAAAd,GACAsB,EAAAvB,EAAAgB,EAAAf,UACA,EAAAtsK,MAAA,GAAA4tK,EAAA5tK,MAAA,EAGI0tK,EAAAN,EAAAC,EAAAx9D,EAAAC,EAAA28D,EAAAkB,EACJ,SAAAh7G,EAAAy6G,SACA,EAAAz6G,EAAA06G,IAAAD,EAAAztK,IAAA,GAAA0tK,EAAA1tK,IAAA,EAGI+tK,EAAAN,EAAAC,EAAAx9D,EAAAC,EAAA68D,QACJ,GAAAjB,EAAA0B,SACA,EAAA1B,EAAA2B,IAAAD,EAAAztK,IAAA,GAAA0tK,EAAA1tK,IAAA,EAGI+tK,EAAAN,EAAAC,EAAAx9D,EAAAC,EAAA88D,QACJ,GAAAnB,EAAA2B,GACA,KAAAJ,EAAAI,EAAAC,GACA,QACI,MACJ,GAAAzB,EAAAwB,IAAA,CAAAD,EAAAC,EAAAC,GACA,QACA,CACA,OAAAK,EAAAN,EAAAC,EAAAx9D,EAAAC,EAAA28D,EACA,CACA,SAAAoB,EAAA1hI,CAAA,CAAArmC,CAAA,EACA,OAAAA,EAAAsjB,MAAA,UAAAxlB,CAAA,EACG,OAAA6kD,EAAAtc,EAAAvoC,EACH,EACA,CACA,SAAA8pK,EAAAN,CAAA,CAAAC,CAAA,CAAAx9D,CAAA,CAAAC,CAAA,CAAAg+D,CAAA,CAAAC,CAAA,EAQA,GAAA71I,GAAAA,UAAAl4B,MAAA,EACA+tK,EAAAlsK,OAAAiE,IAAA,CAAAsnK,GAAA,IAAAY,EAAAnsK,OAAAiE,IAAA,CAAAunK,GAIA,GAAAU,EAAA/tK,MAAA,GAAAguK,EAAAhuK,MAAA,CACA,QACA,KAIA,IAAAoF,EAAS,EACTA,EAAA2oK,EAAA/tK,MAAA,CAAAoF,IACA,IAAAoI,EAAA6/J,EAAAU,CAAA,CAAA3oK,EAAA,EACA,QACA,CAEA,GAAAyqG,GAAA33E,GAAAA,UAAAl4B,MAAA,EACA,IAAAiuK,EAAA1C,EAAA6B,GACA,GAAAa,IAAAA,EAAAjuK,MAAA,EACA,IAAAqxB,EAAkB,EAClB,IAAAjsB,EAAA,EAAAA,EAAA6oK,EAAAjuK,MAAA,CAAAoF,IAAA,CACA,IAAA3D,EAAAwsK,CAAA,CAAA7oK,EAAA,CACA,GAAAqjD,EAAA2kH,EAAA3rK,GAAA,CACA,IAAAgnD,EAAA4kH,EAAA5rK,GACA,QACA,CACAssK,EAAAzvK,IAAA,CAAAmD,GACU4vB,GACV,SAAAo3B,EAAA4kH,EAAA5rK,GACA,QACA,CAEA,IAAAysK,EAAA3C,EAAA8B,GACA,GAAAY,EAAAjuK,MAAA,GAAAkuK,EAAAluK,MAAA,EAAA6tK,EAAAR,EAAAa,GAAAluK,MAAA,GAAAqxB,EACA,QACM,KACN,CACA,IAAA88I,EAAA5C,EAAA8B,GACA,GAAAc,IAAAA,EAAAnuK,MAAA,EAAA6tK,IAAAA,EAAAR,EAAAc,GAAAnuK,MAAA,CACA,QACA,CACA,CACA,GACA+tK,IAAAA,EAAA/tK,MAAA,EAAA8tK,CAAAA,IAAArB,GAAAqB,IAAApB,GAAAU,IAAAA,EAAAptK,MAAA,EAAAotK,IAAAA,EAAAztK,IAAA,EACA,SAIA,GAAAmwG,KAAAjtG,IAAAitG,EACAA,EAAA,CACAs9D,KAAA,IAAAlpK,IACAmpK,KAAA,IAAAnpK,IACAisB,SAAA,CACI,MACJ,CAIA,IAAAi+I,EAAAt+D,EAAAs9D,IAAA,CAAAvrJ,GAAA,CAAAurJ,GACA,GAAAgB,KAAAvrK,IAAAurK,EAAA,CACA,IAAAC,EAAAv+D,EAAAu9D,IAAA,CAAAxrJ,GAAA,CAAAwrJ,GACA,GAAAgB,KAAAxrK,IAAAwrK,EACA,OAAAD,IAAAC,CACA,CACA,EACAl+I,QAAA,EACA,GACAi9I,IAAA,CAAAjpK,GAAA,CAAAipK,EAAAt9D,EAAA3/E,QAAA,EACA2/E,EAAAu9D,IAAA,CAAAlpK,GAAA,CAAAkpK,EAAAv9D,EAAA3/E,QAAA,EACA,IAAAm+I,EAAAl+D,GAAAg9D,EAAAC,EAAAx9D,EAAAk+D,EAAAj+D,EAAAg+D,GAGA,OAFAh+D,EAAAs9D,IAAA,CAAA7vG,MAAA,CAAA6vG,GACAt9D,EAAAu9D,IAAA,CAAA9vG,MAAA,CAAA8vG,GACAiB,CACA,CACA,SAAAC,GAAApqK,CAAA,CAAAipK,CAAA,CAAAv9D,CAAA,CAAA3iC,CAAA,EAGA,QADAshG,EAAkBnD,EAAAlnK,GAClBiB,EAAA,EAAAA,EAAAopK,EAAAxuK,MAAA,CAAAoF,IAAA,CACA,IAAAioK,EAAAmB,CAAA,CAAAppK,EAAA,CACA,GAAAkoK,EAAAF,EAAAC,EAAAx9D,EAAA3iC,GAGA,OADA/oE,EAAAo5D,MAAA,CAAA8vG,GACA,EACA,CAEA,SAOA,SAAAoB,GAAAnM,CAAA,EACA,OAAAxiE,EAAAwiE,IACA,gBACA,gBACA,SAEA,MACA,cACA,QACA,cACAA,EAAA,CAAAA,CAIA,cACA,GAAAz+D,EAAAy+D,GACA,QACA,CAEA,QACA,CACA,SAAAoM,GAAA9vK,CAAA,CAAAkZ,CAAA,CAAAwqJ,CAAA,EACA,IAAAqM,EAAAF,GAAAnM,UACA,MAAAqM,EAAAA,EACA72J,EAAAsK,GAAA,CAAAusJ,IAAA,CAAA/vK,EAAAwjB,GAAA,CAAAusJ,EADA,CAGA,SAAAC,GAAAhwK,CAAA,CAAAkZ,CAAA,CAAAwqJ,CAAA,CAAAl0H,CAAA,CAAA8+B,CAAA,EACA,IAAAyhG,EAAAF,GAAAnM,GACA,GAAAqM,IAAA,EAAAA,EACA,OAAAA,CACA,CACA,IAAAE,EAAA/2J,EAAA+J,GAAA,CAAA8sJ,SACA,EAAAE,CAAAA,CAAAA,KAAAhsK,IAAAgsK,GAAA/2J,EAAAsK,GAAA,CAAAusJ,EAAA,GAAArB,EAAAl/H,EAAAygI,EAAA,GAAA3hG,EAAA,GAGA,CAAAtuE,EAAAwjB,GAAA,CAAAusJ,IAAArB,EAAAl/H,EAAAygI,EAAA,GAAA3hG,EACA,CACA,SAAA4hG,GAAAlwK,CAAA,CAAAkZ,CAAA,CAAA+3F,CAAA,CAAA3iC,CAAA,EAKA,QAFA/oE,EAAA,KACA4qK,EAAA1D,EAAkBzsK,GAClBwG,EAAA,EAAAA,EAAA2pK,EAAA/uK,MAAA,CAAAoF,IAAA,CACA,IAAA+mC,EAAA4iI,CAAA,CAAA3pK,EAAA,CAIA,GAAA06F,WAAAA,EAAA3zD,IAAAA,IAAA,GAAAA,EACA,OAAAhoC,GACAA,CAAAA,EAAA,IAAAC,GAAA,EAMMD,EAAAE,GAAA,CAAA8nC,QACN,IAAAr0B,EAAAsK,GAAA,CAAA+pB,GAAA,IAAA0jE,GAIA,CAAA6+D,GAAA9vK,EAAAkZ,EAAAq0B,GAJA,SAOA,OAAAhoC,GACAA,CAAAA,EAAA,IAAAC,GAAA,EAEAD,EAAAE,GAAA,CAAA8nC,EACA,EAEA,GAAAhoC,IAAA,GAAAA,EAAA,CAEA,QADA6qK,EAAA3D,EAAqBvzJ,GACrB6kB,EAAA,EAAAA,EAAAqyI,EAAAhvK,MAAA,CAAA28B,IAAA,CACA,IAAAsyI,EAAAD,CAAA,CAAAryI,EAAA,CAGA,GAAAmjE,WAAAA,EAAAmvE,IAAAA,IAAA,GAAAA,EACQ,KAAAV,GAAApqK,EAAA8qK,EAAAp/D,EAAA3iC,GAAA,cACR,IAAA2iC,GAAA,CAAAjxG,EAAAwjB,GAAA,CAAA6sJ,IAAA,CAAAV,GAAApqK,EAAA8qK,EAAAp/D,EAAA3iC,GACA,QACA,CAEA,OAAA/oE,IAAAA,EAAAxE,IAAA,CACA,MACA,EACA,CACA,SAAAuvK,GAAA/qK,CAAA,CAAAlE,CAAA,CAAA+nD,CAAA,CAAAmnH,CAAA,CAAAt/D,CAAA,CAAA3iC,CAAA,EAKA,QADAshG,EAAkBnD,EAAAlnK,GAClBiB,EAAA,EAAAA,EAAAopK,EAAAxuK,MAAA,CAAAoF,IAAA,CACA,IAAA6iD,EAAAumH,CAAA,CAAAppK,EAAA,CACA,GAAAkoK,EAAAtlH,EAAAC,EAAA4nD,EAAA3iC,IAAAogG,EAAA6B,EAAAlvK,EAAA4hB,GAAA,CAAAomC,GAAA4nD,EAAA3iC,GAEA,OADA/oE,EAAAo5D,MAAA,CAAAtV,GACA,EACA,CAEA,QACA,CACA,SAAAmnH,GAAAxwK,CAAA,CAAAkZ,CAAA,CAAA+3F,CAAA,CAAA3iC,CAAA,EAGA,QAFA/oE,EAAA,KACAkrK,EAAA/D,EAAkB1sK,GAClBwG,EAAA,EAAAA,EAAAiqK,EAAArvK,MAAA,CAAAoF,IAAA,CACA,IAAAkqK,EAAA1E,EAAAyE,CAAA,CAAAjqK,EAAA,IACA3D,EAAA6tK,CAAA,IACAH,EAAAG,CAAA,IACA,GAAAxvE,WAAAA,EAAAr+F,IAAAA,IAAA,GAAAA,EACA,OAAA0C,GACAA,CAAAA,EAAA,IAAAC,GAAA,EAEMD,EAAAE,GAAA,CAAA5C,OACN,CAGA,IAAA8tK,EAAAz3J,EAAA+J,GAAA,CAAApgB,GACA,GAAA8tK,KAAA1sK,IAAA0sK,GAAA,CAAAz3J,EAAAsK,GAAA,CAAA3gB,IAAA,CAAA6rK,EAAA6B,EAAAI,EAAA1/D,EAAA3iC,GAAA,CACA,GAAA2iC,GAGA,CAAA++D,GAAAhwK,EAAAkZ,EAAArW,EAAA0tK,EAAAjiG,GAHA,SAIA,OAAA/oE,GACAA,CAAAA,EAAA,IAAAC,GAAA,EAEAD,EAAAE,GAAA,CAAA5C,EACA,EACA,CAEA,GAAA0C,IAAA,GAAAA,EAAA,CAEA,QADAqrK,EAAAlE,EAAsBxzJ,GACtB23J,EAAA,EAAAA,EAAAD,EAAAxvK,MAAA,CAAAyvK,IAAA,CACA,IAAAC,EAAA9E,EAAA4E,CAAA,CAAAC,EAAA,IACAt3I,EAAAu3I,CAAA,IACAthI,EAAAshI,CAAA,IACA,GAAA5vE,WAAAA,EAAA3nE,IAAAA,IAAA,GAAAA,EACQ,KAAA+2I,GAAA/qK,EAAAvF,EAAAu5B,EAAAiW,EAAAyhE,EAAA3iC,GAAA,cACR,IAAA2iC,GAAA,EAAAjxG,EAAAwjB,GAAA,CAAA+V,IAAA,CAAAm1I,EAAA1uK,EAAAijB,GAAA,CAAAsW,GAAAiW,EAAA,GAAA8+B,EAAA,IAAAgiG,GAAA/qK,EAAAvF,EAAAu5B,EAAAiW,EAAA,GAAA8+B,GACA,QACA,CAEA,OAAA/oE,IAAAA,EAAAxE,IAAA,CACA,MACA,EACA,CACA,SAAAywG,GAAAxxG,CAAA,CAAAkZ,CAAA,CAAA+3F,CAAA,CAAA/pG,CAAA,CAAAgqG,CAAA,CAAAg+D,CAAA,EAGA,IAAA1oK,EAAA,EACA,GAAA0oK,IAAAnB,EACA,KAAAmC,GAAAlwK,EAAAkZ,EAAA+3F,EAAAC,GACA,QACI,MACJ,GAAAg+D,IAAAlB,EACA,KAAAwC,GAAAxwK,EAAAkZ,EAAA+3F,EAAAC,GACA,QACI,MACJ,GAAWg+D,IAAcpB,EACzB,KAAAtnK,EAAAxG,EAAAoB,MAAA,CAAAoF,IACA,GAAAoI,EAAA5O,EAAAwG,GACA,KAAAoI,EAAAsK,EAAA1S,IAAA,CAAAkoK,EAAA1uK,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,CAAA1S,EAAA,CAAAyqG,EAAAC,GACA,QACQ,KAGR,CAFA,GAAAtiG,EAAAsK,EAAA1S,GACQ,QAcR,CAVA,IADA,IAAAuqK,EAAe9tK,OAAAiE,IAAA,CAAAlH,GACfwG,EAAAuqK,EAAA3vK,MAAA,CAAAoF,IAAA,CACA,IAAA3D,EAAAkuK,CAAA,CAAAvqK,EAAA,CACA,IAAAoI,EAAAsK,EAAArW,IAAA,CAAA6rK,EAAA1uK,CAAA,CAAA6C,EAAA,CAAAqW,CAAA,CAAArW,EAAA,CAAAouG,EAAAC,GACA,QACA,CAEA,GAAA6/D,EAAA3vK,MAAA,GAAA6B,OAAAiE,IAAA,CAAAgS,GAAA9X,MAAA,CACA,QACA,CACA,QACA,KAMAoF,EAAA,EAAAA,EAAAU,EAAA9F,MAAA,CAAAoF,IAAA,CACA,IAAA6/J,EAAAn/J,CAAA,CAAAV,EAAA,CACA,IAAAkoK,EAAA1uK,CAAA,CAAAqmK,EAAA,CAAAntJ,CAAA,CAAAmtJ,EAAA,CAAAp1D,EAAAC,GACA,QACA,CAEA,QACA,CACA,SAAA6xD,GAAAyL,CAAA,CAAAC,CAAA,EACA,OAAAC,EAAAF,EAAAC,EAAAb,EACA,CACA,SAAA5K,GAAAwL,CAAA,CAAAC,CAAA,EACA,OAAAC,EAAAF,EAAAC,EAAAd,EACA,CACA1tK,EAAAC,OAAA,EACA6iK,YAAAA,GACAC,kBAAAA,EAAA,iBAAA/iK,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC9jBY,aAQZ,IAAAmxK,EAAAnxK,EAAA,MAAAe,MAAA,CACA,SAAA4vC,EAAAvnB,CAAA,EACA,GAAAA,EAAA7nB,MAAA,2CAEA,QADA6vK,EAAA,IAAkBvkK,WAAA,KAClBgoB,EAAA,EAAAA,EAAAu8I,EAAA7vK,MAAA,CAAAszB,IACAu8I,CAAA,CAAAv8I,EAAA,KAEA,QAAAluB,EAAA,EAAAA,EAAAyiB,EAAA7nB,MAAA,CAAAoF,IAAA,CACA,IAAAlD,EAAA2lB,EAAA4B,MAAA,CAAArkB,GACA0qK,EAAA5tK,EAAAutB,UAAA,IACA,GAAAogJ,MAAAA,CAAA,CAAAC,EAAA,iBAAA5tK,EAAA,iBACA2tK,CAAA,CAAAC,EAAA,CAAA1qK,CACA,CATA,IAUA8hH,EAAAr/F,EAAA7nB,MAAA,CACA+vK,EAAAloJ,EAAA4B,MAAA,IACAumJ,EAAAlwK,KAAA2zD,GAAA,CAAAyzD,GAAApnH,KAAA2zD,GAAA,MACAw8G,EAAAnwK,KAAA2zD,GAAA,MAAA3zD,KAAA2zD,GAAA,CAAAyzD,GAyCA,SAAAgpD,EAAA9nJ,CAAA,EACA,oBAAAA,EAA+B,mCAC/B,GAAAA,IAAAA,EAAApoB,MAAA,QAAA4vK,EAAAlpJ,KAAA,IAKA,IAJA,IAAAypJ,EAAA,EAEAC,EAAA,EACApwK,EAAA,EACAooB,CAAA,CAAA+nJ,EAAA,GAAAJ,GACAK,IACAD,IAMA,IAHA,IAAAxwK,EAAA,CAAAyoB,EAAApoB,MAAA,CAAAmwK,CAAA,EAAAH,EAAA,MACAK,EAAA,IAAA/kK,WAAA3L,GAEAwwK,EAAA/nJ,EAAApoB,MAAA,GAEA,IAAAswK,EAAAT,CAAA,CAAAznJ,EAAAqH,UAAA,CAAA0gJ,GAAA,CAEA,GAAAG,MAAAA,EAAA,OAEA,QADAlrK,EAAA,EACAmrK,EAAA5wK,EAAA,GAAA2wK,IAAAA,GAAAlrK,EAAApF,CAAA,GAAAuwK,KAAAA,EAAAA,IAAAnrK,GAAA,CACAkrK,GAAA,EAAAD,CAAA,CAAAE,EAAA,KACAF,CAAA,CAAAE,EAAA,WACAD,EAAA,UAEA,GAAAA,IAAAA,EAAA,8BACAtwK,EAAAoF,EACA+qK,GACA,CAGA,IADA,IAAAK,EAAA7wK,EAAAK,EACAwwK,IAAA7wK,GAAA0wK,IAAAA,CAAA,CAAAG,EAAA,EACAA,IAEA,IAAAC,EAAAb,EAAA7sE,WAAA,CAAAqtE,EAAAzwK,CAAAA,EAAA6wK,CAAA,GACAC,EAAAx8E,IAAA,KAAAm8E,GAEA,IADA,IAAA98I,EAAA88I,EACAI,IAAA7wK,GACA8wK,CAAA,CAAAn9I,IAAA,CAAA+8I,CAAA,CAAAG,IAAA,CAEA,OAAAC,CACA,CACA,SAAA54J,EAAAhS,CAAA,EACA,IAAAsb,EAAA+uJ,EAAkBrqK,GAClB,GAAAsb,EAAA,OAAAA,CAAA,OACA,iBAAA+lG,EAAA,cAEA,OACAzmH,OAzFA,SAAA2nB,CAAA,EAEA,GADAxoB,CAAAA,MAAA6D,OAAA,CAAA2kB,IAAAA,aAAqC9c,UAAA,GAAA8c,CAAAA,EAAAwnJ,EAAAzyJ,IAAA,CAAAiL,EAAA,EACrC,CAAAwnJ,EAAApzJ,QAAA,CAAA4L,GAA+B,mCAC/B,GAAAA,IAAAA,EAAApoB,MAAA,UAMA,IAJA,IAAAowK,EAAA,EACApwK,EAAA,EACA0wK,EAAA,EACAC,EAAAvoJ,EAAApoB,MAAA,CACA0wK,IAAAC,GAAAvoJ,IAAAA,CAAA,CAAAsoJ,EAAA,EACAA,IACAN,IAMA,IAHA,IAAAzwK,EAAA,CAAAgxK,EAAAD,CAAA,EAAAT,EAAA,MACAW,EAAA,IAAAtlK,WAAA3L,GAEA+wK,IAAAC,GAAA,CAIA,QAHAL,EAAAloJ,CAAA,CAAAsoJ,EAAA,CAEAtrK,EAAA,EACAyrK,EAAAlxK,EAAA,GAAA2wK,IAAAA,GAAAlrK,EAAApF,CAAA,GAAA6wK,KAAAA,EAAAA,IAAAzrK,GAAA,CACAkrK,GAAA,IAAAM,CAAA,CAAAC,EAAA,KACAD,CAAA,CAAAC,EAAA,GAAA3pD,IAAA,EACAopD,EAAA,EAAAppD,IAAA,EAEA,GAAAopD,IAAAA,EAAA,8BACAtwK,EAAAoF,EACAsrK,GACA,CAGA,IADA,IAAAI,EAAAnxK,EAAAK,EACA8wK,IAAAnxK,GAAAixK,IAAAA,CAAA,CAAAE,EAAA,EACAA,IAIA,IADA,IAAAlnJ,EAAWmmJ,EAAArI,MAAY,CAAA0I,GACvBU,EAAAnxK,EAAA,EAAAmxK,EAAAlnJ,GAAA/B,EAAA4B,MAAA,CAAAmnJ,CAAA,CAAAE,EAAA,EACA,OAAAlnJ,CACA,EAmDAsmJ,aAAAA,EACAr4J,OAAAA,CACA,CACA,CAAAhZ,EAAAC,OAAA,CAAAswC,CAAA,gBAAA7wC,CAAA,CAAAO,CAAA,ECtHY,YAGZA,CAAAA,EAAAoiB,UAAA,CAAmBA,EACnBpiB,EAAAmxD,WAAA,CAAqBA,EAAAnxD,EAAA4xD,aAAA,CAAAA,EAQrB,QALA6vC,EAAA,GACAC,EAAA,GAAAC,EAAA,oBAAAn1F,WAAAA,WAAA1L,KAAA,CAGAyJ,EAAA,mEACAjE,EAAA,EAAAozB,EAAAnvB,EAAArJ,MAAA,CAAAoF,EAAAozB,EAAA,EAAApzB,EACAm7F,CAAA,CAAAn7F,EAAA,CAAAiE,CAAA,CAAAjE,EAAA,CACAo7F,CAAA,CAAAn3F,EAAAomB,UAAA,CAAArqB,GAAA,CAAAA,EAQA,SAAAs7F,EAAAC,CAAA,MAAAnoE,EAAAmoE,EAAA3gG,MAAA,CAGA,GAAAw4B,EAAA,IACA,8DAKA,IAAAooE,EAAAD,EAAA3hF,OAAA,WAAA4hF,GAAAA,CAAAA,EAAApoE,CAAA,EAGA,IAAAqoE,EAAAD,IAAApoE,EACA,IAAAooE,EAAA,EAGA,OAAAA,EAAAC,EAAA,CAIA,SAAA3/E,EAAAy/E,CAAA,EACA,IAAAG,EAAAJ,EAAAC,GACAC,EAAAE,CAAA,IACAD,EAAAC,CAAA,IACA,OAAAF,EAAAC,CAAA,MAAAA,CAAA,CAGA,SAAAE,EAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,OAAAD,EAAAC,CAAA,MAAAA,CAAA,CAGA,SAAA5wC,EAAA0wC,CAAA,EAEA,IADAK,EAcA57F,EAbA07F,EAAAJ,EAAAC,GACAC,EAAAE,CAAA,IAAAD,EAAAC,CAAA,IAEAl0B,EAAA,IAAA6zB,EAAAM,EAAAJ,EAAAC,EAAAC,IAEAI,EAAA,EAIAzoE,EAAAqoE,EAAA,EACAD,EAAA,EAAAA,CAAA,CAIA,IAAAx7F,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACA47F,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,KACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,QACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,IACAwnE,CAAA,CAAAq0B,IAAA,WACAr0B,CAAA,CAAAq0B,IAAA,UACAr0B,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,EAmBA,OAhBA,IAAAH,IACAG,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,IACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAwnE,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,GAGA,IAAAH,IACAG,EACA,EAAAL,EAAAlxE,UAAA,CAAArqB,GAAA,KACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAo7F,CAAA,CAAAG,EAAAlxE,UAAA,CAAArqB,EAAA,OACAwnE,CAAA,CAAAq0B,IAAA,UACAr0B,CAAA,CAAAq0B,IAAA,CAAAD,IAAAA,GAGAp0B,CAAA,CAGA,SAAAs0B,EAAA91E,CAAA,EACA,OAAAm1E,CAAA,CAAAn1E,GAAA,OACAm1E,CAAA,CAAAn1E,GAAA,OACAm1E,CAAA,CAAAn1E,GAAA,MACAm1E,CAAA,CAAAn1E,GAAAA,EAAA,CAGA,SAAA+1E,EAAAC,CAAA,CAAA9wD,CAAA,CAAA1gB,CAAA,EAGA,QADAqC,EAAA,GACA7sB,EAAAkrC,EAAAlrC,EAAAwqB,EAAAxqB,GAAA,EAKA6sB,EAAA3zB,IAAA,CAAA4iG,EAHA,GAAA97F,EAAA,eACA,GAAAA,EAAA,aACAg8F,CAAAA,IAAAA,CAAA,CAAAh8F,EAAA,MAGA,OAAA6sB,EAAA1wB,IAAA,KAGA,SAAAmvD,EAAA0wC,CAAA,EAQA,QAPAJ,EACAxoE,EAAA4oE,EAAAphG,MAAA,CACAqhG,EAAA7oE,EAAA,EACA9U,EAAA,GAAA49E,EAAA,MAIAl8F,EAAA,EAAAm8F,EAAA/oE,EAAA6oE,EAAAj8F,EAAAm8F,EAAAn8F,GAAAk8F,EACA59E,EAAAplB,IAAA,CAAA6iG,EAAAC,EAAAh8F,EAAA,EAAAk8F,EAAAC,EAAAA,EAAAn8F,EAAAk8F,CAAA,GAqBA,OAjBAD,IAAAA,EAEA39E,EAAAplB,IAAA,CACAiiG,CAAA,CAAAS,CAFAA,EAAAI,CAAA,CAAA5oE,EAAA,KAEA,GACA+nE,CAAA,UACA,MAEA,IAAAc,GAEA39E,EAAAplB,IAAA,CACAiiG,CAAA,CAAAS,CAFAA,EAAA,CAAAI,CAAA,CAAA5oE,EAAA,OAAA4oE,CAAA,CAAA5oE,EAAA,KAEA,IACA+nE,CAAA,UACAA,CAAA,UACA,KAIA78E,EAAAniB,IAAA,KAlIAi/F,CAAA,KAAA/wE,UAAA,QAAA+wE,CAAA,KAAA/wE,UAAA,OAkIA,gBAAA5wB,CAAA,CAAAC,CAAA,CAAAL,CAAA,ECpJA,IAAAsyK,GAMA,SAAAC,CAAA,EACA,aACA,IAAAC,EAYAC,EAAA,GAUAC,EAAA,EAGAC,EAAA,IAGAC,EAAA,IAOAlT,EAAA,GAOAmT,EAAA,GAOAC,EAAA,GAOAC,EAAA,YACAC,EAAAD,EAAA,WACAE,EAAAD,EAAA,iBACAE,EAAAF,EAAA,gBACAG,EAAAJ,EAAA,mBAGAxuH,EAAA,GACA6uH,EAAA,OACAC,EAAA,uCAMA,SAAAC,GAAA,CAQA,SAAAd,EAAA7xK,CAAA,EACA,IAAA8C,EAAA,KAGA,IAAAA,CAAAA,aAAA+uK,CAAA,SAAA7xK,IAAAyyK,EAAAE,IAAA,IAAAd,EAAA7xK,EAAA,CAGA,GAAAA,aAAA6xK,EACA/uK,EAAA4B,CAAA,CAAA1E,EAAA0E,CAAA,CACA5B,EAAAiE,CAAA,CAAA/G,EAAA+G,CAAA,CACQjE,EAAA2kD,CAAA,CAAAznD,EAAAynD,CAAA,CAAAzmD,KAAA,OACR,CACA,oBAAAhB,EAAA,CACA,GAAA6xK,CAAA,IAAAA,EAAAphE,MAAA,mBAAAzwG,EACA,MAAA0B,UAAA2wK,EAAA,SAIAryK,EAAAA,IAAAA,GAAA,EAAAA,EAAA,OAAA8f,OAAA9f,EAAA,CACA,EAEA8C,EAAA9C,EACA,GAIA2B,WAAA,CAAAkwK,CACA,CAaA,OAXAA,EAAA1jK,SAAA,CAAAy1C,EACAiuH,EAAAC,EAAA,CAAAA,EACAD,EAAAE,EAAA,CAAAA,EACAF,EAAA9S,EAAA,CAAAA,EACA8S,EAAAK,EAAA,CAAAA,EACAL,EAAAphE,MAAA,CAAA0hE,EACAN,EAAA5V,SAAA,GACA4V,EAAA3V,WAAA,GACA2V,EAAAe,aAAA,GACAf,EAAA1V,OAAA,GAEA0V,CACA,CASA,SAAA/uJ,EAAAhgB,CAAA,CAAA9C,CAAA,EACA,IAAA+G,EAAAf,EAAA6sK,EAEA,IAAAH,EAAA3yJ,IAAA,CAAA/f,GACA,MAAAoN,MAAAilK,EAAA,UAyBA,IArBAvvK,EAAA4B,CAAA,CAAA1E,KAAAA,EAAAqqB,MAAA,IAAArqB,CAAAA,EAAAA,EAAAgB,KAAA,UAGA+F,CAAAA,EAAA/G,EAAA4f,OAAA,WAAA5f,CAAAA,EAAAA,EAAAgkB,OAAA,UAGA,CAAAhe,EAAAhG,EAAAowB,MAAA,WAGArpB,EAAA,GAAAA,CAAAA,EAAAf,CAAAA,EACAe,GAAA,CAAA/G,EAAAgB,KAAA,CAAAgF,EAAA,GACMhG,EAAAA,EAAAusC,SAAA,GAAAvmC,IACNe,EAAA,GAGAA,CAAAA,EAAA/G,EAAAY,MAAA,EAGAiyK,EAAA7yK,EAAAY,MAAA,CAGAoF,EAAA,EAAAA,EAAA6sK,GAAA7yK,KAAAA,EAAAqqB,MAAA,CAAArkB,IAAA,EAAAA,EAEA,GAAAA,GAAA6sK,EAGM/vK,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,QACN,CAGA,KAAA8rK,EAAA,GAAA7yK,KAAAA,EAAAqqB,MAAA,GAAAwoJ,KAKA,IAJA/vK,EAAAiE,CAAA,CAAAA,EAAAf,EAAA,EACAlD,EAAA2kD,CAAA,IAGA1gD,EAAA,EAAAf,GAAA6sK,GAAA/vK,EAAA2kD,CAAA,CAAA1gD,IAAA,EAAA/G,EAAAqqB,MAAA,CAAArkB,IACA,QAEAlD,CACA,CAWA,SAAAuiC,EAAAviC,CAAA,CAAAgwK,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAtC,EAAA5tK,EAAA2kD,CAAA,CAGA,GADAsrH,IAAAN,GAAAM,CAAAA,EAAAjwK,EAAAnB,WAAA,CAAAowK,EAAA,EACAgB,IAAAA,GAAAA,IAAAA,GAAAA,IAAAA,GAAAA,IAAAA,EACA,MAAA3lK,MAAAmlK,EAAA,CAGA,GAAAO,EAAA,EACAE,EACAD,IAAAA,GAAAC,CAAAA,GAAA,EAAAtC,CAAA,MAAAoC,IAAAA,GACAC,CAAAA,IAAAA,GAAArC,CAAA,QACAqC,IAAAA,GAAArC,CAAAA,CAAA,OAAAA,IAAAA,CAAA,KAAAsC,CAAAA,GAAAtC,CAAA,MAAA+B,CAAA,IAGA/B,EAAA9vK,MAAA,GAEAoyK,GAGAlwK,EAAAiE,CAAA,CAAAjE,EAAAiE,CAAA,CAAA+rK,EAAA,EACQpC,CAAA,OAIRA,CAAA,IAAA5tK,EAAAiE,CAAA,QAEA,GAAA+rK,EAAApC,EAAA9vK,MAAA,EAaA,GAVAoyK,EACAD,IAAAA,GAAArC,CAAA,CAAAoC,EAAA,KACAC,IAAAA,GAAArC,CAAAA,CAAA,CAAAoC,EAAA,IAAApC,IAAAA,CAAA,CAAAoC,EAAA,EACAE,CAAAA,GAAAtC,CAAA,CAAAoC,EAAA,KAAAL,GAAA/B,EAAAA,CAAA,CAAAoC,EAAA,MACAC,IAAAA,GAAAC,CAAAA,GAAA,EAAAtC,CAAA,KAGAA,EAAA9vK,MAAA,CAAAkyK,EAGAE,EAGA,QAAAtC,CAAA,GAAAoC,EAAA,IAEA,GADApC,CAAA,CAAAoC,EAAA,GACAA,IAAAA,EAAA,CACA,EAAAhwK,EAAAiE,CAAA,CACA2pK,EAAAllH,OAAA,IACA,MACA,CAEA,IAGAsnH,EAAApC,EAAA9vK,MAAA,EAAA8vK,CAAA,GAAAoC,EAAA,EAAApC,EAAAl9G,GAAA,EACA,QAEA1wD,CACA,CAOA,SAAAM,EAAAN,CAAA,CAAAmwK,CAAA,CAAAC,CAAA,EACA,IAAAnsK,EAAAjE,EAAAiE,CAAA,CACArC,EAAA5B,EAAA2kD,CAAA,CAAAtlD,IAAA,KACAnC,EAAA0E,EAAA9D,MAAA,CAGA,GAAAqyK,EACAvuK,EAAAA,EAAA2lB,MAAA,IAAArqB,CAAAA,EAAA,MAAA0E,EAAA1D,KAAA,QAAA+F,CAAAA,EAAA,YAAAA,OAGA,GAAaA,EAAI,GACjB,OAAAA,GAAArC,EAAA,IAAAA,EACMA,EAAA,KAAAA,CACN,SAAAqC,EAAA,GACA,KAAAA,EAAA/G,EACQ,IAAA+G,GAAA/G,EAAA+G,KAAArC,GAAA,SACRqC,EAAA/G,GACA0E,CAAAA,EAAAA,EAAA1D,KAAA,GAAA+F,GAAA,IAAArC,EAAA1D,KAAA,CAAA+F,EAAA,CACM,MACN/G,EAAA,GACA0E,CAAAA,EAAAA,EAAA2lB,MAAA,QAAA3lB,EAAA1D,KAAA,IACA,CAEA,OAAA8B,EAAA4B,CAAA,IAAAwuK,EAAA,IAAAxuK,EAAAA,CAAA,CAUAk/C,EAAAn0B,GAAA,YACA,IAAA3sB,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,GACA5B,CACA,EAQA8gD,EAAAuvH,GAAA,UAAAh/I,CAAA,EACA,IAAAi/I,EACAtwK,EAAA,KACA4tK,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAA,CAAAl/I,EAAA,IAAArxB,EAAAnB,WAAA,CAAAwyB,EAAA,EAAAszB,CAAA,CACAzhD,EAAAlD,EAAA4B,CAAA,CACAwvB,EAAAC,EAAAzvB,CAAA,CACAF,EAAA1B,EAAAiE,CAAA,CACA4lC,EAAAxY,EAAAptB,CAAA,CAGA,IAAA2pK,CAAA,MAAA2C,CAAA,gBAAArtK,EAAA,MAAAkuB,EAAA,EAGA,GAAAluB,GAAAkuB,EAAA,OAAAluB,CAAA,CAKA,GAHAotK,EAAAptK,EAAA,EAGAxB,GAAAmoC,EAAA,OAAAnoC,EAAAmoC,EAAAymI,EAAA,KAKA,IAAAptK,EAAA,GAHAkuB,EAAA,CAAA1vB,EAAAksK,EAAA9vK,MAAA,EAAA+rC,CAAAA,EAAA0mI,EAAAzyK,MAAA,EAAA4D,EAAAmoC,CAAA,CAGA,EAAA3mC,EAAAkuB,GACA,GAAAw8I,CAAA,CAAA1qK,EAAA,EAAAqtK,CAAA,CAAArtK,EAAA,QAAA0qK,CAAA,CAAA1qK,EAAA,CAAAqtK,CAAA,CAAArtK,EAAA,CAAAotK,EAAA,KAIA,OAAA5uK,GAAAmoC,EAAA,EAAAnoC,EAAAmoC,EAAAymI,EAAA,MAQAxvH,EAAA7D,GAAA,UAAA5rB,CAAA,EACA,IAAArxB,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACAnC,EAAAsD,EAAA2kD,CAAA,CACA/uC,EAAA,CAAAyb,EAAA,IAAA09I,EAAA19I,EAAA,EAAAszB,CAAA,CACAjjD,EAAA1B,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,MACA4uK,EAAAzB,EAAAC,EAAA,CAEA,GAAAwB,IAAA,EAAAA,GAAAA,EAAA,GAAAA,EAAAtB,EACA,MAAA5kK,MAAAklK,EAAA,CAIA,IAAA55J,CAAA,IACA,MAAAtL,MAAAolK,EAAA,CAIA,IAAAhzK,CAAA,IAGA,OAFA20B,EAAAzvB,CAAA,CAAAF,EACA2vB,EAAAszB,CAAA,EAAAtzB,EAAAptB,CAAA,IACAotB,CACA,CAEA,IAAAo/I,EAAAvkH,EAAAhvD,EAAAmzK,EAAAK,EACAC,EAAA/6J,EAAA1X,KAAA,GACAqgH,EAAAkyD,EAAA76J,EAAA9X,MAAA,CACAwgH,EAAA5hH,EAAAoB,MAAA,CACAkD,EAAAtE,EAAAwB,KAAA,GAAAuyK,GACAh3C,EAAAz4H,EAAAlD,MAAA,CACAqxD,EAAA99B,EACAu/I,EAAAzhH,EAAAxK,CAAA,IACAksH,EAAA,EACAlsJ,EAAA6rJ,EAAArhH,CAAAA,EAAAlrD,CAAA,CAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,IASA,IAPAkrD,EAAAvtD,CAAA,CAAAF,EACAA,EAAAijB,EAAA,IAAAA,CAAA,CAGAgsJ,EAAAjoH,OAAA,IAGA+wE,IAAAg3C,GAAAzvK,EAAA5E,IAAA,IAEA,GAGA,IAAAc,EAAA,EAAAA,EAAA,GAAAA,IAAA,CAGA,GAAAuzK,GAAAh3C,CAAAA,EAAAz4H,EAAAlD,MAAA,EACUuyK,EAAAI,EAAAh3C,EAAA,UAEV,IAAAi3C,EAAA,GAAAL,EAAA,IAAAK,EAAAD,GACA,GAAA76J,CAAA,CAAA86J,EAAA,EAAA1vK,CAAA,CAAA0vK,EAAA,EACAL,EAAAz6J,CAAA,CAAA86J,EAAA,CAAA1vK,CAAA,CAAA0vK,EAAA,MACA,MACA,GAKAL,EAAA,GAIA,IAAAnkH,EAAAutE,GAAAg3C,EAAA76J,EAAA+6J,CAAA,CAAAl3C,GAAA,CACA,GAAAz4H,CAAA,GAAAy4H,EAAA,CAAAvtE,CAAA,CAAAutE,EAAA,EAEA,IADAi3C,EAAAj3C,EACAi3C,GAAA,CAAA1vK,CAAA,GAAA0vK,EAAA,EAAA1vK,CAAA,CAAA0vK,EAAA,EACA,GAAA1vK,CAAA,CAAA0vK,EAAA,CACA1vK,CAAA,CAAAy4H,EAAA,IACA,EACA,CAAAA,EAAA,EAAAvtE,CAAA,CAAAutE,EAAA,CAGU,MAAAz4H,CAAA,KAAAA,EAAA0X,KAAA,EACV,MACA,MAKAk4J,CAAA,CAAAC,IAAA,CAAAR,EAAAnzK,EAAA,EAAAA,CAAA,CAGA8D,CAAA,KAAAqvK,EAAArvK,CAAA,CAAAy4H,EAAA,CAAA/8H,CAAA,CAAA6hH,EAAA,IACAv9G,EAAA,CAAAtE,CAAA,CAAA6hH,EAAA,QAEA,CAAAA,IAAAD,GAAAt9G,CAAA,MAAA2uK,CAAA,GAAAjuK,IAAA,CAcA,MAXA,CAAAkvK,CAAA,KAAAC,GAAAA,IAGAD,EAAAl4J,KAAA,GACAy2C,EAAAlrD,CAAA,GACA0gB,KAIAksJ,EAAAlsJ,GAAA4d,EAAA4sB,EAAAxqC,EAAAoqJ,EAAAE,EAAA,CAAAjuK,CAAA,MAAA2uK,GAEAxgH,CACA,EAMArO,EAAAh3B,EAAA,UAAAuH,CAAA,EACA,gBAAAg/I,GAAA,CAAAh/I,EACA,EAOAyvB,EAAAlC,EAAA,UAAAvtB,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,GAAA,CACA,EAOAyvB,EAAAgwH,GAAA,UAAAz/I,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,GAAA,EACA,EAMAyvB,EAAA2L,EAAA,UAAAp7B,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAOAyvB,EAAAiwH,GAAA,UAAA1/I,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAMAyvB,EAAAkwH,KAAA,CAAAlwH,EAAA3C,GAAA,UAAA9sB,CAAA,EACA,IAAAnuB,EAAAkuB,EAAArvB,EAAAkvK,EACAjxK,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACAnC,EAAAsD,EAAA4B,CAAA,CACAgU,EAAA,CAAAyb,EAAA,IAAA09I,EAAA19I,EAAA,EAAAzvB,CAAA,CAGA,GAAAlF,GAAAkZ,EAEA,OADAyb,EAAAzvB,CAAA,EAAAgU,EACA5V,EAAAkxK,IAAA,CAAA7/I,EACA,CAEA,IAAAu8I,EAAA5tK,EAAA2kD,CAAA,CAAAzmD,KAAA,GACA+5D,EAAAj4D,EAAAiE,CAAA,CACAssK,EAAAl/I,EAAAszB,CAAA,CACAkR,EAAAxkC,EAAAptB,CAAA,CAGA,IAAA2pK,CAAA,MAAA2C,CAAA,IAQA,OAPAA,CAAA,IACQl/I,EAAAzvB,CAAA,EAAAgU,EACRg4J,CAAA,IACQv8I,EAAA,IAAA09I,EAAA/uK,GAERqxB,EAAAzvB,CAAA,GAEAyvB,CACA,CAGA,GAAA30B,EAAAu7D,EAAApC,EAAA,CAWA,IATAo7G,CAAAA,EAAAv0K,EAAA,IACAA,EAAA,CAAAA,EACQqF,EAAA6rK,IAER/3G,EAAAoC,EACAl2D,EAAAwuK,GAGAxuK,EAAAuiB,OAAA,GACA1O,EAAAlZ,EAAAkZ,KAAA7T,EAAA3F,IAAA,IACM2F,EAAAuiB,OAAA,EACN,MAKA,IAFA8M,EAAA,EAAA6/I,EAAArD,EAAA9vK,MAAA,CAAAyyK,EAAAzyK,MAAA,EAAA8vK,EAAA2C,CAAA,EAAAzyK,MAAA,CAEApB,EAAAkZ,EAAA,EAAAA,EAAAwb,EAAAxb,IACA,GAAAg4J,CAAA,CAAAh4J,EAAA,EAAA26J,CAAA,CAAA36J,EAAA,EACAq7J,EAAArD,CAAA,CAAAh4J,EAAA,CAAA26J,CAAA,CAAA36J,EAAA,CACA,MACA,GAKAq7J,IACAlvK,EAAA6rK,EACAA,EAAA2C,EACAA,EAAAxuK,EACAsvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,EAOA,CAAAgU,EAAA,CAAAwb,EAAAm/I,EAAAzyK,MAAA,EAAAoF,CAAAA,EAAA0qK,EAAA9vK,MAAA,UAAA8X,KAAAg4J,CAAA,CAAA1qK,IAAA,GAGA,IAAA0S,EAAA1S,EAAAkuB,EAAA10B,GAAA,CACA,GAAAkxK,CAAA,GAAAx8I,EAAA,CAAoBm/I,CAAA,CAAAn/I,EAAA,EACpB,IAAAluB,EAAAkuB,EAAAluB,GAAA,CAAA0qK,CAAA,GAAA1qK,EAAA,EAAA0qK,CAAA,CAAA1qK,EAAA,EACA,GAAA0qK,CAAA,CAAA1qK,EAAA,CACA0qK,CAAA,CAAAx8I,EAAA,IACA,EAEA,CAAAA,EAAA,EAAAm/I,CAAA,CAAAn/I,EAAA,CAIA,KAAAw8I,IAAAA,CAAA,GAAAh4J,EAAA,EAAAg4J,EAAAl9G,GAAA,GAGA,KAAAk9G,IAAAA,CAAA,KACAA,EAAAl1J,KAAA,GACA,EAAAm9C,EAeA,OAZA+3G,CAAA,MAGAv8I,EAAAzvB,CAAA,GAGAgsK,EAAA,CAAA/3G,EAAA,IAGAxkC,EAAAszB,CAAA,CAAAipH,EACAv8I,EAAAptB,CAAA,CAAA4xD,EAEAxkC,CACA,EAMAyvB,EAAAr5B,GAAA,UAAA4J,CAAA,EACA,IAAA8/I,EACAnxK,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACAnC,EAAAsD,EAAA4B,CAAA,CACAgU,EAAA,CAAAyb,EAAA,IAAA09I,EAAA19I,EAAA,EAAAzvB,CAAA,CAEA,IAAAyvB,EAAAszB,CAAA,IACA,MAAAr6C,MAAAolK,EAAA,OAQA,CALA1vK,EAAA4B,CAAA,CAAAyvB,EAAAzvB,CAAA,GACAuvK,EAAA9/I,GAAAA,EAAAg/I,GAAA,CAAArwK,GACAA,EAAA4B,CAAA,CAAAlF,EACA20B,EAAAzvB,CAAA,CAAAgU,EAEAu7J,GAAA,IAAApC,EAAA/uK,IAEAtD,EAAAqyK,EAAAC,EAAA,CACAp5J,EAAAm5J,EAAAE,EAAA,CACAF,EAAAC,EAAA,CAAAD,EAAAE,EAAA,GACAjvK,EAAAA,EAAAi9C,GAAA,CAAA5rB,GACA09I,EAAAC,EAAA,CAAAtyK,EACAqyK,EAAAE,EAAA,CAAAr5J,EAEA,KAAAo7J,KAAA,CAAAhxK,EAAAoxK,KAAA,CAAA//I,IATA,EAgBAyvB,EAAAwgE,GAAA,YACA,IAAAthH,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,EAAA5B,EAAA4B,CAAA,CACA5B,CACA,EAMA8gD,EAAAowH,IAAA,CAAApwH,EAAA3+C,GAAA,UAAAkvB,CAAA,EACA,IAAAptB,EAAAvC,EAAAK,EACA/B,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CAKA,GAHAwyB,EAAA,IAAA09I,EAAA19I,GAGArxB,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,CAEA,OADAyvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CACA5B,EAAAgxK,KAAA,CAAA3/I,EACA,CAEA,IAAA4mC,EAAAj4D,EAAAiE,CAAA,CACA2pK,EAAA5tK,EAAA2kD,CAAA,CACAkR,EAAAxkC,EAAAptB,CAAA,CACAssK,EAAAl/I,EAAAszB,CAAA,CAGA,IAAAipH,CAAA,MAAA2C,CAAA,IAQA,OAPAA,CAAA,MACA3C,CAAA,IACUv8I,EAAA,IAAA09I,EAAA/uK,GAEVqxB,EAAAzvB,CAAA,CAAA5B,EAAA4B,CAAA,EAGAyvB,CACA,CAMA,GAJAu8I,EAAAA,EAAA1vK,KAAA,GAIA+F,EAAAg0D,EAAApC,EAAA,CAUA,IATA5xD,EAAA,GACA4xD,EAAAoC,EACQl2D,EAAAwuK,IAERtsK,EAAA,CAAAA,EACAlC,EAAA6rK,GAGA7rK,EAAAuiB,OAAa,GACbrgB,KAAAlC,EAAA3F,IAAA,IACA2F,EAAAuiB,OAAA,EACA,KAGAspJ,EAAA9vK,MAAA,CAAAyyK,EAAAzyK,MAAA,KACAiE,EAAAwuK,EACAA,EAAA3C,EACAA,EAAA7rK,GAGAkC,EAAAssK,EAAAzyK,MAAA,CAGA4D,EAAA,EAAAuC,EAAA2pK,CAAA,CAAA3pK,EAAA,KAAAvC,EAAA,CAAAksK,CAAA,GAAA3pK,EAAA,CAAA2pK,CAAA,CAAA3pK,EAAA,CAAAssK,CAAA,CAAAtsK,EAAA,CAAAvC,CAAAA,EAAA,KAUA,IANAA,IACAksK,EAAAllH,OAAA,CAAAhnD,GACA,EAAAm0D,GAIA5xD,EAAA2pK,EAAA9vK,MAAA,CAAA8vK,IAAAA,CAAA,GAAA3pK,EAAA,EAAA2pK,EAAAl9G,GAAA,GAKA,OAHAr/B,EAAAszB,CAAA,CAAAipH,EACAv8I,EAAAptB,CAAA,CAAA4xD,EAEAxkC,CACA,EAUAyvB,EAAA5D,GAAA,UAAAhgD,CAAA,EACA,IAAA8C,EAAA,KACAmxH,EAAA,IAAAnxH,EAAAnB,WAAA,MACAwyB,EAAA8/F,EACAm/C,EAAApzK,EAAA,EAEA,GAAAA,IAAA,EAAAA,GAAAA,EAAA,CAAAiyK,GAAAjyK,EAAAiyK,EACA,MAAA7kK,MAAAilK,EAAA,YAKA,IAFAe,GAAApzK,CAAAA,EAAA,CAAAA,CAAAA,EAGA,EAAAA,GAAAm0B,CAAAA,EAAAA,EAAA+/I,KAAA,CAAApxK,EAAA,EACA9C,IAAA,GAEA8C,EAAAA,EAAAoxK,KAAA,CAAApxK,GAGA,OAAAswK,EAAAn/C,EAAAl0E,GAAA,CAAA5rB,GAAAA,CAAA,EAWAyvB,EAAAuwH,IAAA,UAAArB,CAAA,CAAAC,CAAA,EACA,GAAAD,IAAA,EAAAA,GAAAA,EAAA,GAAAA,EAAAd,EACA,MAAA5kK,MAAAilK,EAAA,aAEA,OAAAhtI,EAAA,SAAA1jC,WAAA,OAAAmxK,EAAAC,EACA,EAYAnvH,EAAAve,KAAA,UAAAiuI,CAAA,CAAAP,CAAA,EACA,GAAAO,IAAAb,EAAAa,EAAA,OACA,GAAAA,IAAA,EAAAA,GAAAA,EAAA,CAAAtB,GAAAsB,EAAAtB,EACA,MAAA5kK,MAAAklK,EAAA,CAEA,OAAAjtI,EAAA,SAAA1jC,WAAA,OAAA2xK,EAAA,KAAAvsK,CAAA,GAAAgsK,EACA,EAOAnvH,EAAA2iE,IAAA,YACA,IAAAziH,EAAA2jD,EAAA5iD,EACA/B,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACA+C,EAAA5B,EAAA4B,CAAA,CACAqC,EAAAjE,EAAAiE,CAAA,CACAqtK,EAAA,IAAAvC,EAAA,OAGA,IAAA/uK,EAAA2kD,CAAA,eAAAoqH,EAAA/uK,EAAA,CAGA,GAAA4B,EAAA,EACA,MAAA0I,MAAAglK,EAAA,kBAQA,IAJA1tK,CAAAA,EAAAhE,KAAA6lH,IAAA,CAAAzjH,EAAA,MAIA4B,IAAA,KAEA+iD,CADAA,EAAA3kD,EAAA2kD,CAAA,CAAAtlD,IAAA,MACAvB,MAAA,CAAAmG,EAAA,GAAA0gD,CAAAA,GAAA,KACA/iD,EAAAhE,KAAA6lH,IAAA,CAAA9+D,GACA1gD,EAAA,EAAAA,EAAA,QAAAA,CAAAA,EAAA,GAAAA,EAAAA,CAAA,EACMjD,EAAA,IAAA+tK,EAAA,CAAAntK,GAAA,UAAAA,EAAAA,EAAA2vK,aAAA,IAAArzK,KAAA,GAAA0D,EAAAkb,OAAA,UAAA7Y,IAENjD,EAAA,IAAA+tK,EAAAntK,EAAA,IAGAqC,EAAAjD,EAAAiD,CAAA,CAAA8qK,CAAAA,EAAAC,EAAA,KAGA,GACAjtK,EAAAf,EACMA,EAAAswK,EAAAF,KAAA,CAAArvK,EAAAmvK,IAAA,CAAAlxK,EAAAi9C,GAAA,CAAAl7C,WACNA,EAAA4iD,CAAA,CAAAzmD,KAAA,GAAA+F,GAAA5E,IAAA,OAAA2B,EAAA2jD,CAAA,CAAAzmD,KAAA,GAAA+F,GAAA5E,IAAA,MAEA,OAAAkjC,EAAAvhC,EAAA,CAAA+tK,EAAAC,EAAA,KAAAhuK,EAAAiD,CAAA,GAAA8qK,EAAAE,EAAA,CACA,EAMAnuH,EAAAswH,KAAA,CAAAtwH,EAAAtD,GAAA,UAAAnsB,CAAA,EACA,IAAAszB,EACA3kD,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACA+uK,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAA,CAAAl/I,EAAA,IAAA09I,EAAA19I,EAAA,EAAAszB,CAAA,CACAjoD,EAAAkxK,EAAA9vK,MAAA,CACA8X,EAAA26J,EAAAzyK,MAAA,CACAoF,EAAAlD,EAAAiE,CAAA,CACAmtB,EAAAC,EAAAptB,CAAA,CAMA,GAHAotB,EAAAzvB,CAAA,CAAA5B,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,MAGA,CAAAgsK,CAAA,MAAA2C,CAAA,IAEA,OADAl/I,EAAAszB,CAAA,EAAAtzB,EAAAptB,CAAA,IACAotB,CACA,CAgBA,IAbAA,EAAAptB,CAAA,CAAAf,EAAAkuB,EAGA10B,EAAAkZ,IACA+uC,EAAAipH,EACAA,EAAA2C,EACAA,EAAA5rH,EACAvzB,EAAA10B,EACAA,EAAAkZ,EACAA,EAAAwb,GAIAuzB,EAAA,MAAAvzB,EAAA10B,EAAAkZ,GAAAwb,KAAAuzB,CAAA,CAAAvzB,EAAA,GAKA,IAAAluB,EAAA0S,EAAA1S,KAAA,CAIA,IAHA0S,EAAA,EAGAwb,EAAA10B,EAAAwG,EAAAkuB,EAAAluB,GAGA0S,EAAA+uC,CAAA,CAAAvzB,EAAA,CAAAm/I,CAAA,CAAArtK,EAAA,CAAA0qK,CAAA,CAAAx8I,EAAAluB,EAAA,GAAA0S,EACA+uC,CAAA,CAAAvzB,IAAA,CAAAxb,EAAA,GAGAA,EAAAA,EAAA,IAGA+uC,CAAAA,CAAA,CAAAvzB,EAAA,CAAAxb,CACA,CAOA,IAJAA,EAAA,EAAAyb,EAAAptB,CAAA,CACA0gD,EAAAjsC,KAAA,GAGAxV,EAAAyhD,EAAA7mD,MAAA,EAAA6mD,CAAA,GAAAzhD,EAAA,EAAAyhD,EAAA+L,GAAA,GAGA,OAFAr/B,EAAAszB,CAAA,CAAAA,EAEAtzB,CACA,EAUAyvB,EAAAywH,aAAA,UAAAf,CAAA,CAAAP,CAAA,EACA,IAAAjwK,EAAA,KACA9C,EAAA8C,EAAA2kD,CAAA,IAEA,GAAA6rH,IAAAb,EAAA,CACA,GAAAa,IAAA,EAAAA,GAAAA,EAAA,GAAAA,EAAAtB,EACA,MAAA5kK,MAAAklK,EAAA,CAGA,IADAxvK,EAAAuiC,EAAa,IAAAviC,EAAAnB,WAAgB,CAAAmB,GAAA,EAAAwwK,EAAAP,GAC7BjwK,EAAA2kD,CAAA,CAAA7mD,MAAA,CAAA0yK,GAAAxwK,EAAA2kD,CAAA,CAAAvoD,IAAA,GACA,QAEAkE,EAAAN,EAAA,KAAA9C,EACA,EAaA4jD,EAAA5W,OAAA,UAAAsmI,CAAA,CAAAP,CAAA,EACA,IAAAjwK,EAAA,KACA9C,EAAA8C,EAAA2kD,CAAA,IAEA,GAAA6rH,IAAAb,EAAA,CACA,GAAAa,IAAA,EAAAA,GAAAA,EAAA,GAAAA,EAAAtB,EACA,MAAA5kK,MAAAklK,EAAA,CAKA,IAHAxvK,EAAAuiC,EAAA,IAAAviC,EAAAnB,WAAA,CAAAmB,GAAAwwK,EAAAxwK,EAAAiE,CAAA,GAAAgsK,GAGAO,EAAAA,EAAAxwK,EAAAiE,CAAA,GAAAjE,EAAA2kD,CAAA,CAAA7mD,MAAA,CAAA0yK,GAAAxwK,EAAA2kD,CAAA,CAAAvoD,IAAA,GACA,QAEAkE,EAAAN,EAAA,KAAA9C,EACA,EASA4jD,EAAAsjC,MAAA,CAAAtjC,EAAAj7C,QAAA,YACA,IAAA7F,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACA,OAAAyB,EAAAN,EAAAA,EAAAiE,CAAA,EAAA8qK,EAAA9S,EAAA,EAAAj8J,EAAAiE,CAAA,EAAA8qK,EAAAK,EAAA,GAAApvK,EAAA2kD,CAAA,IACA,EAMA7D,EAAA5lC,QAAA,YACA,IAAAhe,EAAAsY,OAAAlV,EAAA,aACA,aAAAzB,WAAA,CAAA8uG,MAAA,QAAA7jF,EAAA,CAAA5sB,EAAA2I,QAAA,IACA,MAAAyE,MAAAglK,EAAA,wBAEA,OAAApyK,CACA,EAYA4jD,EAAA0wH,WAAA,UAAAxB,CAAA,CAAAC,CAAA,EACA,IAAAjwK,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACA3B,EAAA8C,EAAA2kD,CAAA,IAEA,GAAAqrH,IAAAL,EAAA,CACA,GAAAK,IAAA,EAAAA,GAAAA,EAAA,GAAAA,EAAAd,EACA,MAAA5kK,MAAAilK,EAAA,aAGA,IADAvvK,EAAAuiC,EAAa,IAAAwsI,EAAA/uK,GAAAgwK,EAAgBC,GAC7BjwK,EAAA2kD,CAAA,CAAA7mD,MAAA,CAAAkyK,GAAAhwK,EAAA2kD,CAAA,CAAAvoD,IAAA,GACA,QAEAkE,EAAAN,EAAAgwK,GAAAhwK,EAAAiE,CAAA,EAAAjE,EAAAiE,CAAA,EAAA8qK,EAAA9S,EAAA,EAAAj8J,EAAAiE,CAAA,EAAA8qK,EAAAK,EAAA,GAAAlyK,EACA,EASA4jD,EAAAqgD,OAAA,YACA,IAAAnhG,EAAA,KACA+uK,EAAA/uK,EAAAnB,WAAA,CACA,GAAAkwK,CAAA,IAAAA,EAAAphE,MAAA,CACA,MAAArjG,MAAAglK,EAAA,sBAEA,OAAAhvK,EAAAN,EAAAA,EAAAiE,CAAA,EAAA8qK,EAAA9S,EAAA,EAAAj8J,EAAAiE,CAAA,EAAA8qK,EAAAK,EAAA,IACA,EAQAL,CAFAA,EAAAc,GAAA,EAEA,QAAAd,EAAAA,GAAA,CAAAA,EAIAF,KAAAluK,IADsCkuK,CAAAA,EAAA,mBAAAE,CAAA,GAAAxjK,IAAA,CAAA3O,EAAAL,EAACK,EAAAD,EAAA,GACvCA,CAAAA,EAAAC,OAAA,CAAAiyK,CAAA,CASC,mBAAAxyK,CAAA,CAAAO,CAAA,CAAAL,CAAA,eClhCY,IAAAe,EAAAf,EAAA,aAUb,SAAAi0I,EAAA5xH,CAAA,EACA,CACA,IAAA6yJ,EAAAn0K,EAAA2d,IAAA,CAAA2D,GACA6yJ,EAAAntJ,OAAA,GACA,IAAA4pC,EAAAujH,EAAA5rK,QAAA,eACA,IAAAqoD,EAAApwD,MAAA,CACAqpD,OAAA,GAEAA,OAAA,KAAA+G,EAAA,EADA,CAIA,CAOA,SAAAwjH,EAAA9yJ,CAAA,EACA,CACA,IAAAsvC,EAAAtvC,EAAA/Y,QAAA,eACA,IAAAqoD,EAAApwD,MAAA,CACAqpD,OAAA,GAEAA,OAAA,KAAA+G,EAAA,EADA,CAIA,CAQA,SAAAuiF,EAAAvnH,CAAA,CAAAirB,CAAA,EACA,CACA,IAAA+Z,EAAAhlC,EAAuBrjB,QAAM,KAC7BoZ,EAAA3hB,EAAA2d,IAAA,CAAAizC,EAAAC,QAAA,CAAAha,EAAAA,EAAA,KAAAj2C,KAAA,GAAAi2C,EAAAA,GAAA,OAEA,OADAl1B,EAAAqF,OAAA,GACArF,CACA,CAGA,CAQA,SAAA0yJ,EAAAzoJ,CAAA,CAAAirB,CAAA,EACA,CACA,IAAA+Z,EAAehlC,EAAMrjB,QAAA,KACrB,OAAAvI,EAAA2d,IAAA,CAAAizC,EAAAC,QAAA,CAAAha,EAAAA,EAAA,KAAAj2C,KAAA,GAAAi2C,EAAAA,GAAA,MACA,CAEA,CAjEAx0C,OAAA8L,cAAA,CAAA7O,EAAA,cAAA0C,MAAA,KAmBA1C,EAAA4zI,UAAA,CAAAA,EAgBA5zI,EAAA80K,UAAA,CAAAA,EAiBA90K,EAAA6zI,UAAA,CAAAA,EAakB7zI,EAAA+0K,UAAA,CAAAA,CAAA,gBAAAh1K,CAAA,CAAAC,CAAA,CAAAL,CAAA,ECnElB,IAAAsyK,GAAA,SAAA+C,CAAA,EACA,aAkDA,IAAAC,EACAC,EAAA,6CACAC,EAAAn0K,KAAAC,IAAA,CACAm0K,EAAAp0K,KAAAwZ,KAAA,CAEA66J,EAAA,qBACAC,EAAAD,EAAA,yDAEAjtD,EAAA,KACAmtD,EAAA,GACAj4H,EAAA,iBAEAk4H,EAAA,2DACAC,EAAA,IAKAC,EAAA,IAMA,SAAAzwJ,EAAA0wJ,CAAA,EACA,IA4kBAC,EAMAC,EAoqBAC,EACAC,EACAC,EACAC,EACAC,EA1vCA71H,EAAA81H,EAAAC,EACAlyH,EAAA+wH,EAAAxmK,SAAA,EAAAxM,YAAAgzK,EAAAhsK,SAAA,KAAAs7F,QAAA,MACApjD,EAAA,IAAA8zH,EAAA,GAUAoB,EAAA,GAaAC,EAAA,EAMAC,EAAA,GAIAC,EAAA,GAMAC,EAAA,KAKAC,EAAA,IAGAC,EAAA,GAkBAC,EAAA,EAIAC,EAAA,EAGAC,EAAA,CACArhG,OAAA,GACAmnF,UAAA,EACAma,mBAAA,EACApa,eAAA,IACAD,iBAAA,IACAsa,kBAAA,EACAC,uBAAA,OACOp9C,OAAA,EACP,EAKA9wG,EAAA,uCACAmuJ,EAAA,GAgBA,SAAAjC,EAAAlwK,CAAA,CAAAiU,CAAA,EACA,IAAA6zF,EAAA9kD,EAAAovH,EAAA9vK,EAAAf,EAAA8wK,EAAA19I,EAAA5O,EACA1nB,EAAA,KAGA,IAAAA,CAAAA,aAAA6xK,CAAA,aAAAA,EAAAlwK,EAAAiU,EAAA,CAEA,GAAAA,IAAA,EAAAA,EAAA,CAEA,GAAAjU,GAAAA,CAAA,IAAAA,EAAAsyK,YAAA,EACAj0K,EAAA4B,CAAA,CAAAD,EAAAC,CAAA,CAEA,CAAAD,EAAAgjD,CAAA,EAAAhjD,EAAAsC,CAAA,CAAAqvK,EACYtzK,EAAA2kD,CAAA,CAAA3kD,EAAAiE,CAAA,MACZtC,EAAAsC,CAAA,CAAAovK,EACYrzK,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,KAEZjE,EAAAiE,CAAA,CAAAtC,EAAAsC,CAAA,CACAjE,EAAA2kD,CAAA,CAAAhjD,EAAAgjD,CAAA,CAAAzmD,KAAA,IAGA,MACA,IAEA,CAAA81K,EAAA,iBAAAryK,CAAA,GAAAA,EAAAA,GAAA,GAMA,GAHA3B,EAAA4B,CAAA,GAAAD,EAAA,EAAAA,CAAAA,EAAA,CAAAA,EAAA,MAGAA,IAAA,EAAAA,EAAA,CACA,IAAAsC,EAAA,EAAAf,EAAAvB,CAAA,CAAAuB,GAAA,GAAAA,GAAA,GAAAe,GAAA,EAEAA,EAAAqvK,EACctzK,EAAA2kD,CAAA,CAAA3kD,EAAAiE,CAAA,OAEdjE,EAAAiE,CAAA,CAAAA,EACAjE,EAAA2kD,CAAA,EAAAhjD,EAAA,EAGA,MACA,GAEUqb,OAAArb,EACV,MAEA,IAAAmwK,EAAA70J,IAAA,CAAAyK,EAAA1K,OAAArb,IAAA,OAAAqxK,EAAAhzK,EAAA0nB,EAAAssJ,EAAA,CAEAh0K,EAAA4B,CAAA,CAAA8lB,IAAAA,EAAA6F,UAAA,IAAA7F,CAAAA,EAAAA,EAAAxpB,KAAA,UACA,CAGA+F,EAAAyjB,EAAA5K,OAAA,WAAA4K,CAAAA,EAAAA,EAAAxG,OAAA,UAGA,CAAAhe,EAAAwkB,EAAA4F,MAAA,WAGArpB,EAAA,GAAAA,CAAAA,EAAAf,CAAAA,EACAe,GAAA,CAAAyjB,EAAAxpB,KAAA,CAAAgF,EAAA,GACUwkB,EAAAA,EAAA+hB,SAAA,GAAAvmC,IACVe,EAAA,GAGAA,CAAAA,EAAAyjB,EAAA5pB,MAAA,CAGA,MAOA,GAJAo2K,EAAAt+J,EAAA,EAAA+P,EAAA7nB,MAAA,SAIA8X,IAAAA,GAAAk+J,EAEA,OAAAvxI,EADAviC,EAAA,IAAA6xK,EAAAlwK,GACAsxK,EAAAjzK,EAAAiE,CAAA,GAAAivK,EACA,CAIA,GAFAxrJ,EAAA1K,OAAArb,GAEAqyK,EAAA,iBAAAryK,EAAA,CAGA,GAAAA,EAAAA,GAAA,SAAAqxK,EAAAhzK,EAAA0nB,EAAAssJ,EAAAp+J,EAAA,CAKA,GAHA5V,EAAA4B,CAAA,GAAAD,EAAA,EAAA+lB,CAAAA,EAAAA,EAAAxpB,KAAA,UAGA2zK,EAAAsC,KAAA,EAAAzsJ,EAAAxG,OAAA,iBAAApjB,MAAA,IACA,MAAAwM,MACA4nK,EAAAvwK,EAAA,MAGA3B,EAAA4B,CAAA,CAAA8lB,KAAAA,EAAA6F,UAAA,IAAA7F,CAAAA,EAAAA,EAAAxpB,KAAA,UAQA,IALAurG,EAAA9jF,EAAAznB,KAAA,GAAA0X,GACA3R,EAAAf,EAAA,EAIAozB,EAAA5O,EAAA5pB,MAAA,CAAAoF,EAAAozB,EAAApzB,IACA,GAAAumG,EAAAA,EAAA3sF,OAAA,CAAA6nC,EAAAj9B,EAAAH,MAAA,CAAArkB,IAAA,CACA,GAAAyhD,KAAAA,EAGA,IAAAzhD,EAAAe,EAAA,CACAA,EAAAqyB,EACA,SACc,MACd,IAAAy9I,GAGArsJ,CAAAA,GAAAA,EAAAjH,WAAA,IAAAiH,CAAAA,EAAAA,EAAAxK,WAAA,KACAwK,GAAAA,EAAAxK,WAAA,IAAAwK,CAAAA,EAAAA,EAAAjH,WAAA,MACAszJ,EAAA,GACA7wK,EAAA,GACAe,EAAA,EACA,SAEA,OAEA+uK,EAAAhzK,EAAAgd,OAAArb,GAAAqyK,EAAAp+J,EACA,GAIA,GAIA,CAAA3R,EAAAyjB,CAHAA,EAAAqrJ,EAAArrJ,EAAA9R,EAAA,GAAA5V,EAAA4B,CAAA,GAGAkb,OAAA,UAAA4K,EAAAA,EAAAxG,OAAA,SACAjd,EAAAyjB,EAAA5pB,MAAA,CACA,IAGAoF,EAAA,EAAAwkB,KAAAA,EAAA6F,UAAA,CAAArqB,GAAAA,KAGA,IAAAozB,EAAA5O,EAAA5pB,MAAA,CAAA4pB,KAAAA,EAAA6F,UAAA,GAAA+I,KAEA,GAAA5O,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAA,EAAAozB,GAAA,CAIA,GAHAA,GAAApzB,EAGA8wK,GAAAnC,EAAAsC,KAAA,EACA79I,EAAA,IAAA30B,CAAAA,EAAAu4C,GAAAv4C,IAAAqwK,EAAArwK,EAAA,EACA,MAAA2I,MACA4nK,EAAAlyK,EAAA4B,CAAA,CAAAD,EAAA,CAIA,IAAAsC,EAAAA,EAAAf,EAAA,GAAAowK,EAGAtzK,EAAA2kD,CAAA,CAAA3kD,EAAAiE,CAAA,WAGA,GAAAA,EAAAovK,EAGUrzK,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,QACV,CAWA,GAVAjE,EAAAiE,CAAA,CAAAA,EACAjE,EAAA2kD,CAAA,IAMAzhD,EAAA,CAAAe,EAAA,GAAAkuK,EACAluK,EAAA,GAAAf,CAAAA,GAAAivK,CAAA,EAEAjvK,EAAAozB,EAAA,CAGA,IAFApzB,GAAAlD,EAAA2kD,CAAA,CAAAvoD,IAAA,EAAAsrB,EAAAxpB,KAAA,GAAAgF,IAEAozB,GAAA67I,EAAAjvK,EAAAozB,GACAt2B,EAAA2kD,CAAA,CAAAvoD,IAAA,EAAAsrB,EAAAxpB,KAAA,CAAAgF,EAAAA,GAAAivK,IAGYjvK,EAAAivK,EAAA,CAAAzqJ,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAA,EAAApF,MAAA,MAEZoF,GAAAozB,CACA,CAEA,KAAApzB,IAAAwkB,GAAA,KACA1nB,EAAA2kD,CAAA,CAAAvoD,IAAA,EAAAsrB,EACQ,OAIR1nB,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,IA61BA,SAAA+uD,EAAA91D,CAAA,CAAAgG,CAAA,CAAA+sK,CAAA,CAAA/oK,CAAA,EACA,IAAAktK,EAAAnwK,EAAA+wD,EAAA1+B,EAAA5O,EAKA,GAHAuoJ,IAAA,EAAAA,EAAAA,EAAAiD,EACAgB,EAAAjE,EAAA,KAEA,CAAA/yK,EAAAynD,CAAA,QAAAznD,EAAA2I,QAAA,GAKA,GAHAuuK,EAAAl3K,EAAAynD,CAAA,IACAqQ,EAAA93D,EAAA+G,CAAA,CAEAf,IAAA,EAAAA,EACAwkB,EAAA2sJ,EAAAn3K,EAAAynD,CAAA,EACAj9B,EAAAxgB,GAAAA,GAAAA,GAAAA,GAAA8tD,CAAAA,GAAAm+G,GAAAn+G,GAAAo+G,CAAA,EACA7B,EAAA7pJ,EAAAstC,GACQs/G,EAAA5sJ,EAAAstC,EAAA,UAeR,GAVA/wD,EAAA/G,CAHAA,EAAAqlC,EAAA,IAAAsvI,EAAA30K,GAAAgG,EAAA+sK,EAAA,EAGAhsK,CAAA,CAGAqyB,EAAA5O,CADAA,EAAA2sJ,EAAAn3K,EAAAynD,CAAA,GACA7mD,MAAA,CAOAoJ,GAAAA,GAAAA,GAAAA,GAAAhE,CAAAA,GAAAe,GAAAA,GAAAkvK,CAAA,GAGA,KAAA78I,EAAApzB,EAAAwkB,GAAA,IAAA4O,GAAA,EACA5O,EAAA6pJ,EAAA7pJ,EAAAzjB,EAGA,MAKA,GAJAf,GAAA8xD,EACAttC,EAAA4sJ,EAAA5sJ,EAAAzjB,EAAA,KAGAA,EAAA,EAAAqyB,EACY,MAAApzB,EAAA,MAAAwkB,GAAA,IAAAxkB,IAAAwkB,GAAA,WAGZ,GAAAxkB,CADAA,GAAAe,EAAAqyB,CAAA,EACA,EAEA,IADAryB,EAAqB,GAAKqyB,GAAA5O,CAAAA,GAAA,KAC1BxkB,IAAAwkB,GAAA,KACA,OAKAxqB,EAAA0E,CAAA,IAAAwyK,EAAA,IAAA1sJ,EAAAA,CAAA,CAMA,SAAA6sJ,EAAAnuK,CAAA,CAAAlJ,CAAA,EAKA,IAJA,IAAAwE,EAAA2vB,EACAnuB,EAAA,EACAlD,EAAA,IAAA6xK,EAAAzrK,CAAA,KAEAlD,EAAAkD,EAAAtI,MAAA,CAAAoF,IAEAmuB,CADAA,EAAA,IAAAwgJ,EAAAzrK,CAAA,CAAAlD,EAAA,GACAtB,CAAA,GAAAF,EAAAkyD,EAAA5zD,EAAAqxB,EAAA,IAAAn0B,GAAAwE,CAAAA,IAAAA,GAAA1B,EAAA4B,CAAA,GAAA1E,CAAAA,GACA8C,CAAAA,EAAAqxB,CAAAA,EAIA,OAAArxB,CACA,CAOA,SAAAw0K,EAAAt3K,CAAA,CAAAynD,CAAA,CAAA1gD,CAAA,EAKA,IAJA,IAAAf,EAAA,EACAkuB,EAAAuzB,EAAA7mD,MAAA,CAGA,CAAA6mD,CAAA,GAAAvzB,EAAA,CAAAuzB,EAAA+L,GAAA,IAGA,IAAAt/B,EAAAuzB,CAAA,IAAAvzB,GAAA,GAAAA,GAAA,GAAAluB,GAAA,EAkBA,MAfA,CAAAe,EAAAf,EAAAe,EAAAkuK,EAAA,GAAAmB,EAGAp2K,EAAAynD,CAAA,CAAAznD,EAAA+G,CAAA,MAGAA,EAAAovK,EAGQn2K,EAAAynD,CAAA,EAAAznD,EAAA+G,CAAA,KAER/G,EAAA+G,CAAA,CAAAA,EACA/G,EAAAynD,CAAA,CAAAA,GAGAznD,CACA,CAyDA,SAAAqlC,EAAAviC,CAAA,CAAAgwK,CAAA,CAAAC,CAAA,CAAAjvK,CAAA,EACA,IAAAxE,EAAA0G,EAAAkuB,EAAA1vB,EAAAxE,EAAAu3K,EAAAC,EACA9G,EAAA5tK,EAAA2kD,CAAA,CACAgwH,EAAAvC,EAGA,GAAAxE,EAAA,CAQAt7E,EAAA,CAGA,IAAA91F,EAAA,EAAAkF,EAAAksK,CAAA,IAAAlsK,GAAA,GAAAA,GAAA,GAAAlF,GAAA,EAIA,GAAA0G,CAHAA,EAAA8sK,EAAAxzK,CAAAA,EAGA,EACA0G,GAAAivK,EACA/gJ,EAAA4+I,EAIY0E,EAAA1C,EAAA90K,CAHZA,EAAA0wK,CAAA,CAAA6G,EAAA,IAGYE,CAAA,CAAAn4K,EAAA40B,EAAA,YAIZ,GAAAqjJ,CAFAA,EAAA1C,EAAA,CAAA7uK,EAAA,GAAAivK,EAAA,GAEAvE,EAAA9vK,MAAA,EAEA,GAAAkD,EAAA,CAGA,KAAA4sK,EAAA9vK,MAAA,EAAA22K,EAAA7G,EAAAxxK,IAAA,KACAc,EAAAw3K,EAAA,EACAl4K,EAAA,EACA0G,GAAAivK,EACgB/gJ,EAAAluB,EAAAivK,EAAA,CAChB,MACA,MAAA7/E,CAAA,KAEA,CAIA,IAAA91F,EAAA,EAHAU,EAAAwE,EAAAksK,CAAA,CAAA6G,EAAA,CAGA/yK,GAAA,GAAAA,GAAA,GAAAlF,GAAA,EAGA0G,GAAAivK,EAOAuC,EAAAtjJ,CAHAA,EAAAluB,EAAAivK,EAAA31K,CAAAA,EAGA,IAAAw1K,EAAA90K,EAAAy3K,CAAA,CAAAn4K,EAAA40B,EAAA,OACA,GAGApwB,EAAAA,GAAAgvK,EAAA,GAKApC,IAAA,EAAAA,CAAA,CAAA6G,EAAA,IAAArjJ,CAAAA,EAAA,EAAAl0B,EAAAA,EAAAy3K,CAAA,CAAAn4K,EAAA40B,EAAA,IAEApwB,EAAAivK,EAAA,EACA,CAAAyE,GAAA1zK,CAAAA,GAAAivK,CAAAA,GAAAA,GAAAA,GAAAjwK,CAAAA,EAAA4B,CAAA,SACA8yK,EAAA,GAAAA,GAAAA,GAAAzE,CAAAA,GAAAA,GAAAjvK,GAAAivK,GAAAA,GAGA,CAAA/sK,EAAA,EAAAkuB,EAAA,EAAAl0B,EAAAy3K,CAAA,CAAAn4K,EAAA40B,EAAA,GAAAw8I,CAAA,CAAA6G,EAAA,UACAxE,GAAAjwK,CAAAA,EAAA4B,CAAA,SAEAouK,EAAA,IAAApC,CAAA,IAiBA,OAhBAA,EAAA9vK,MAAA,GAEAkD,GAGAgvK,GAAAhwK,EAAAiE,CAAA,GAGA2pK,CAAA,IAAA+G,CAAA,EAAAxC,EAAAnC,EAAAmC,CAAA,EAAAA,EAAA,CACcnyK,EAAAiE,CAAA,EAAA+rK,GAAA,GAIdpC,CAAA,IAAA5tK,EAAAiE,CAAA,GAGAjE,CACA,CAiBA,GAdAkD,GAAAA,GACA0qK,EAAA9vK,MAAA,CAAA22K,EACA/yK,EAAA,EACY+yK,MAEZ7G,EAAA9vK,MAAA,CAAA22K,EAAA,EACA/yK,EAAAizK,CAAA,CAAAxC,EAAAjvK,EAAA,CAIA0qK,CAAA,CAAA6G,EAAA,CAAArjJ,EAAA,EAAA4gJ,EAAA90K,EAAAy3K,CAAA,CAAAn4K,EAAA40B,EAAA,CAAAujJ,CAAA,CAAAvjJ,EAAA,EAAA1vB,EAAA,GAIAV,EAEA,QAGA,GAAAyzK,GAAAA,EAAA,CAGA,IAAAvxK,EAAA,EAAAkuB,EAAAw8I,CAAA,IAAAx8I,GAAA,GAAAA,GAAA,GAAAluB,GAAA,EAEA,IADAkuB,EAAAw8I,CAAA,KAA4BlsK,EAC5BA,EAAA,EAAA0vB,GAAA,GAAAA,GAAA,GAAA1vB,GAAA,EAGAwB,GAAAxB,IACA1B,EAAAiE,CAAA,GACA2pK,CAAA,KAAA5oD,GAAA4oD,CAAAA,CAAA,QAGgB,MAMhB,GAJAA,CAAA,CAAA6G,EAAA,EAAA/yK,EACAksK,CAAA,CAAA6G,EAAA,EAAAzvD,EAAA,MACA4oD,CAAA,CAAA6G,IAAA,GACA/yK,EAAA,CAEA,CACA,IAGAwB,EAAA0qK,EAAA9vK,MAAA,CAAA8vK,IAAAA,CAAA,GAAA1qK,EAAA,CAAA0qK,EAAAl9G,GAAA,IACA,CAGA1wD,EAAAiE,CAAA,CAAAqvK,EACAtzK,EAAA2kD,CAAA,CAAA3kD,EAAAiE,CAAA,MAGAjE,EAAAiE,CAAA,CAAAovK,GACArzK,CAAAA,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,IAEA,QAEAjE,CACA,CAGA,SAAAmhG,EAAAjkG,CAAA,EACA,IAAAwqB,EACAzjB,EAAA/G,EAAA+G,CAAA,QAEA,OAAAA,EAAA/G,EAAA2I,QAAA,IAEA6hB,EAAA2sJ,EAAAn3K,EAAAynD,CAAA,EAEAj9B,EAAAzjB,GAAAkvK,GAAAlvK,GAAAmvK,EACA7B,EAAA7pJ,EAAAzjB,GACAqwK,EAAA5sJ,EAAAzjB,EAAA,KAEA/G,EAAA0E,CAAA,OAAA8lB,EAAAA,CAAA,CARA,CAwrCA,OAn1EAmqJ,EAAAhwJ,KAAA,CAAAA,EAEAgwJ,EAAA5Y,QAAA,GACA4Y,EAAA9Y,UAAA,GACA8Y,EAAA+C,UAAA,GACA/C,EAAAgD,WAAA,GACAhD,EAAA7Y,aAAA,GACA6Y,EAAAiD,eAAA,GACAjD,EAAAkD,eAAA,GACAlD,EAAAmD,eAAA,GACAnD,EAAAoD,gBAAA,GACApD,EAAAqD,MAAA,GAqCArD,EAAA/rK,MAAA,CAAA+rK,EAAA5vK,GAAA,UAAAsa,CAAA,EACA,IAAAoI,EAAAhjB,EAEA,GAAA4a,IAAA,EAAAA,GAEA,oBAAAA,EAAA,CAsCA,GAlCAA,EAAAjR,cAAA,CAAAqZ,EAAA,oBAEAuvJ,EADAvyK,EAAA4a,CAAA,CAAAoI,EAAA,CACA,EAAA2tJ,EAAA3tJ,GACAsuJ,EAAAtxK,GAKA4a,EAAAjR,cAAA,CAAAqZ,EAAA,mBAEAuvJ,EADAvyK,EAAA4a,CAAA,CAAAoI,EAAA,CACA,IAAAA,GACAuuJ,EAAAvxK,GAOA4a,EAAAjR,cAAA,CAAAqZ,EAAA,oBAEAhjB,CADAA,EAAA4a,CAAA,CAAAoI,EAAA,GACAhjB,EAAA+uD,GAAA,EACAwjH,EAAAvyK,CAAA,KAAA2wK,EAAA,EAAA3tJ,GACAuvJ,EAAAvyK,CAAA,MAAA2wK,EAAA3tJ,GACAwuJ,EAAAxxK,CAAA,IACcyxK,EAAAzxK,CAAA,MAEduyK,EAAAvyK,EAAA,CAAA2wK,EAAAA,EAAA3tJ,GACAwuJ,EAAA,CAAAC,CAAAA,EAAAzxK,EAAA,GAAAA,EAAAA,CAAA,IAOA4a,EAAAjR,cAAA,CAAAqZ,EAAA,UAEA,GAAAhjB,CADAA,EAAA4a,CAAA,CAAAoI,EAAA,GACAhjB,EAAA+uD,GAAA,CACAwjH,EAAAvyK,CAAA,KAAA2wK,EAAA,GAAA3tJ,GACAuvJ,EAAAvyK,CAAA,MAAA2wK,EAAA3tJ,GACA0uJ,EAAA1xK,CAAA,IACc2xK,EAAA3xK,CAAA,SAGd,GADAuyK,EAAAvyK,EAAA,CAAA2wK,EAAAA,EAAA3tJ,GACAhjB,EACgB0xK,EAAA,CAAAC,CAAAA,EAAA3xK,EAAA,GAAAA,EAAAA,CAAA,OAEhB,MAAA2I,MACA2nK,EAAAttJ,EAAA,oBAAAhjB,EAAA,CAGA,GAKA4a,EAAAjR,cAAA,CAAAqZ,EAAA,WAEA,GAAAhjB,CAAA,CADAA,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,IACAhjB,GACA,GAAAA,GACA,uBAAAwzK,QAAAA,QACAA,CAAAA,OAAAC,eAAA,EAAAD,OAAA5uD,WAAA,EACkBgtD,EAAA5xK,OAGlB,MADA4xK,EAAA,CAAA5xK,EACA2I,MACA2nK,EAAA,2BAGAsB,EAAA5xK,CACc,MAEd,MAAA2I,MACA2nK,EAAAttJ,EAAA,uBAAAhjB,EAAA,CAEA,GAIA4a,EAAAjR,cAAA,CAAAqZ,EAAA,iBAEAuvJ,EADAvyK,EAAA4a,CAAA,CAAAoI,EAAA,CACA,IAAAA,GACA6uJ,EAAA7xK,GAKA4a,EAAAjR,cAAA,CAAAqZ,EAAA,mBAEAuvJ,EADAvyK,EAAA4a,CAAA,CAAAoI,EAAA,CACA,EAAA2tJ,EAAA3tJ,GACA8uJ,EAAA9xK,GAKA4a,EAAAjR,cAAA,CAAAqZ,EAAA,WAEA,mBADAhjB,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,EACA+uJ,EAAA/xK,OACA,MAAA2I,MACA2nK,EAAAttJ,EAAA,mBAAAhjB,EAAA,CACA,GAIA4a,EAAAjR,cAAA,CAAAqZ,EAAA,aAKA,mBAJAhjB,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,GAIA,wBAAA1H,IAAA,CAAAtb,GAIA,MAAA2I,MACA2nK,EAAAttJ,EAAA,aAAAhjB,EAAA,CAJAmyK,EAAAnyK,cAAAA,EAAAzD,KAAA,OACcynB,EAAAhkB,CAKd,OAKA,MAAA2I,MACA2nK,EAAA,oBAAA11J,EAAA,CAEA,MAEA,CACA02J,eAAAA,EACAC,cAAAA,EACAmC,eAAA,CAAAlC,EAAAC,EAAA,CACAkC,MAAA,CAAAjC,EAAAC,EAAA,CACAC,OAAAA,EACAC,YAAAA,EACAC,cAAAA,EACAC,OAAAA,EACA/tJ,SAAAA,CACA,CACA,EAYAksJ,EAAA0D,WAAA,UAAA5zK,CAAA,EACA,IAAAA,GAAAA,CAAA,IAAAA,EAAAsyK,YAAA,UACA,IAAApC,EAAAsC,KAAA,UAEA,IAAAjxK,EAAAhG,EACAynD,EAAAhjD,EAAAgjD,CAAA,CACA1gD,EAAAtC,EAAAsC,CAAA,CACArC,EAAAD,EAAAC,CAAA,CAEA0wF,EAAA,0BAAAzsF,QAAA,CAAA0F,IAAA,CAAAo5C,GAEA,KAAA/iD,IAAAA,GAAAA,KAAAA,CAAA,GAAAqC,GAAA,CAAAquK,GAAAruK,GAAAquK,GAAAruK,IAAA+tK,EAAA/tK,GAAA,CAGA,GAAA0gD,IAAAA,CAAA,KACA,GAAA1gD,IAAAA,GAAA0gD,IAAAA,EAAA7mD,MAAA,UACA,MAAAw0F,CAAA,CACA,GAGApvF,CAAAA,EAAA,CAAAe,EAAA,GAAAkuK,CAAA,EACA,GAAAjvK,CAAAA,GAAAivK,CAAA,EAIAn1J,OAAA2nC,CAAA,KAAA7mD,MAAA,EAAAoF,EAAA,CAEA,IAAAA,EAAA,EAAAA,EAAAyhD,EAAA7mD,MAAA,CAAAoF,IAEA,GAAAhG,CADAA,EAAAynD,CAAA,CAAAzhD,EAAA,EACA,GAAAhG,GAAA8nH,GAAA9nH,IAAA80K,EAAA90K,GAAA,MAAAo1F,CAAA,CAIA,GAAAp1F,IAAAA,EAAA,SACA,CACA,MAGA,GAAAynD,IAAA,GAAAA,GAAA1gD,IAAA,GAAAA,GAAArC,CAAAA,IAAA,GAAAA,GAAAA,IAAAA,GAAAA,KAAAA,CAAA,EACA,QACA,OAEA0I,MACA2nK,EAAA,sBAAAtwK,EAAA,EASAkwK,EAAA2D,OAAA,CAAA3D,EAAA5oI,GAAA,YACA,OAAAsrI,EAAAv+I,UAAA,GACA,EAQA67I,EAAA4D,OAAA,CAAA5D,EAAA7oI,GAAA,YACA,OAAAurI,EAAAv+I,UAAA,EACA,EAaA67I,EAAA6D,MAAA,EACAlD,EAAA,iBAMAC,EAAuB,iBAAA70K,KAAA83K,MAAA,WACvB,WAAuB,OAAA1D,EAAAp0K,KAAA83K,MAAA,GAAAlD,EAAA,EACvB,kBAAA50K,WAAAA,KAAA83K,MAAA,cACA93K,CAAAA,QAAAA,KAAA83K,MAAA,OAEA,SAAAlF,CAAA,EACA,IAAA9zK,EAAAkZ,EAAA3R,EAAAvC,EAAAC,EACAuB,EAAA,EACAyhD,EAAA,GACAgxH,EAAA,IAAA9D,EAAA9zH,GAOA,GALAyyH,IAAA,EAAAA,EAAAA,EAAAyC,EACAiB,EAAA1D,EAAA,EAAA8B,GAEA5wK,EAAAqwK,EAAAvB,EAAA2B,GAEAoB,GAGA,GAAA4B,OAAAC,eAAA,EAIA,IAFA14K,EAAAy4K,OAAAC,eAAA,KAAAn8D,YAAAv3G,GAAA,IAEAwB,EAAAxB,GAcAC,CANAA,EAAAjF,OAAAA,CAAA,CAAAwG,EAAA,CAAAxG,CAAAA,CAAA,CAAAwG,EAAA,WAMA,MACA0S,EAAAu/J,OAAAC,eAAA,KAAAn8D,YAAA,IACAv8G,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,IACgBlZ,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,MAKhB+uC,EAAAvoD,IAAA,CAAAuF,EAAA,MACAuB,GAAA,GAGAA,EAAAxB,EAAA,CAGA,SAAAyzK,OAAA5uD,WAAA,EAKA,IAFA7pH,EAAAy4K,OAAA5uD,WAAA,CAAA7kH,GAAA,GAEAwB,EAAAxB,GAUAC,CAJAA,EAAA,CAAAjF,GAAAA,CAAA,CAAAwG,EAAA,kBAAAxG,cAAAA,CAAA,CAAAwG,EAAA,GACAxG,WAAAA,CAAA,CAAAwG,EAAA,GAAAxG,SAAAA,CAAA,CAAAwG,EAAA,GACAxG,CAAAA,CAAA,CAAAwG,EAAA,QAAAxG,CAAAA,CAAA,CAAAwG,EAAA,OAAAxG,CAAA,CAAAwG,EAAA,KAEA,KACgBiyK,OAAA5uD,WAAA,IAAA9hG,IAAA,CAAA/nB,EAAAwG,IAIhByhD,EAAAvoD,IAAA,CAAAuF,EAAA,MACAuB,GAAA,GAGYA,EAAAxB,EAAA,CACZ,MAEA,MADA6xK,EAAA,GACAjpK,MACA2nK,EAAA,sBAEA,GAGA,CAAAsB,EAEA,KAAArwK,EAAAxB,GACAC,CAAAA,EAAA8wK,GAAA,EACA,MAAA9tH,CAAAA,CAAA,CAAAzhD,IAAA,CAAAvB,EAAA,KAEA,CAYA,IAVAD,EAAAijD,CAAA,GAAAzhD,EAAA,CACAstK,GAAA2B,EAGAzwK,GAAA8uK,IACA7uK,EAAAywK,CAAA,CAAAD,EAAA3B,EAAA,CACA7rH,CAAA,CAAAzhD,EAAA,CAAA8uK,EAAAtwK,EAAAC,GAAAA,GAIAgjD,IAAAA,CAAA,CAAAzhD,EAAA,CAAAyhD,EAAA+L,GAAA,GAAAxtD,GAAA,EAGA,GAAAA,EAAA,EACUyhD,EAAA,CAAA1gD,EAAA,OACV,CAGA,IAAAA,EAAA,GAAA0gD,IAAAA,CAAA,IAAAA,EAAA2hF,MAAA,MAAAriI,GAAAkuK,CAAA,EAGA,IAAAjvK,EAAA,EAAAvB,EAAAgjD,CAAA,IAAAhjD,GAAA,GAAAA,GAAA,GAAAuB,GAAA,EAGAA,EAAAivK,GAAAluK,CAAAA,GAAAkuK,EAAAjvK,CAAAA,CACA,QAEAyyK,EAAA1xK,CAAA,CAAAA,EACA0xK,EAAAhxH,CAAA,CAAAA,EACAgxH,CACK,GASL9D,EAAAv0E,GAAA,YAIA,IAHA,IAAAp6F,EAAA,EACAkD,EAAA4vB,UACAsnE,EAAa,IAAAu0E,EAAAzrK,CAAgB,KAC7BlD,EAAAkD,EAAAtI,MAAA,EAAAw/F,EAAAA,EAAA4zE,IAAA,CAAA9qK,CAAA,CAAAlD,IAAA,EACA,OAAAo6F,CACA,EAOAy1E,EAAA,WACA,IAAA6C,EAAA,aAOA,SAAAC,EAAAnuJ,CAAA,CAAAouJ,CAAA,CAAAC,CAAA,CAAAtsE,CAAA,EAOA,IANA,IAAAr4E,EAEA4kJ,EADAtrG,EAAA,IAEAxnE,EAAA,EACAozB,EAAA5O,EAAA5pB,MAAA,CAEAoF,EAAAozB,GAAA,CACA,IAAA0/I,EAAAtrG,EAAA5sE,MAAA,CAAAk4K,IAAAtrG,CAAA,CAAAsrG,EAAA,EAAAF,GAIA,IAFAprG,CAAA,KAAA++B,EAAA3sF,OAAA,CAAA4K,EAAAH,MAAA,CAAArkB,MAEAkuB,EAAA,EAAAA,EAAAs5C,EAAA5sE,MAAA,CAAAszB,IAEAs5C,CAAA,CAAAt5C,EAAA,CAAA2kJ,EAAA,IACA,MAAArrG,CAAA,CAAAt5C,EAAA,IAAAs5C,CAAAA,CAAA,CAAAt5C,EAAA,MACAs5C,CAAA,CAAAt5C,EAAA,IAAAs5C,CAAA,CAAAt5C,EAAA,CAAA2kJ,EAAA,EACArrG,CAAA,CAAAt5C,EAAA,EAAA2kJ,EAGA,CAEA,OAAArrG,EAAApmD,OAAA,EACA,CAKA,gBAAAoD,CAAA,CAAAouJ,CAAA,CAAAC,CAAA,CAAAzwK,CAAA,CAAA2wK,CAAA,EACA,IAAAxsE,EAAAjtG,EAAAyH,EAAAvC,EAAAV,EAAAhB,EAAA4tK,EAAAv8I,EACAnuB,EAAAwkB,EAAA5K,OAAA,MACA0zJ,EAAAyC,EACAhD,EAAAiD,EA+BA,IA5BAhwK,GAAA,IACAxB,EAAA+xK,EAGAA,EAAA,EACA/rJ,EAAAA,EAAAxG,OAAA,SAEAlhB,EAAAqxB,CADAA,EAAA,IAAAwgJ,EAAAiE,EAAA,EACA54H,GAAA,CAAAx1B,EAAA5pB,MAAA,CAAAoF,GACAuwK,EAAA/xK,EAKA2vB,EAAAszB,CAAA,CAAAkxH,EAAAvB,EAAAD,EAAAr0K,EAAA2kD,CAAA,EAAA3kD,EAAAiE,CAAA,MACA,GAAA8xK,EAAAH,GACAvkJ,EAAAptB,CAAA,CAAAotB,EAAAszB,CAAA,CAAA7mD,MAAA,EAUAmG,EAAAvC,EAAAksK,CALAA,EAAAiI,EAAAnuJ,EAAAouJ,EAAAC,EAAAE,EACAxsE,CAAAA,EAAA9jF,EAAAiwJ,CAAA,EACAnsE,CAAAA,EAAAmsE,EAAAjwJ,CAAA,IAGA7nB,MAAA,CAGA8vK,GAAAA,CAAA,GAAAlsK,EAAA,CAAAksK,EAAAl9G,GAAA,IAGA,IAAAk9G,CAAA,WAAAnkE,EAAAliF,MAAA,IAqCA,GAlCArkB,EAAA,EACU,EAAAe,GAEVjE,EAAA2kD,CAAA,CAAAipH,EACA5tK,EAAAiE,CAAA,CAAAA,EAGAjE,EAAA4B,CAAA,CAAA0D,EAEAsoK,EAAA5tK,CADAA,EAAAi9C,EAAAj9C,EAAAqxB,EAAAm/I,EAAAP,EAAA8F,EAAA,EACApxH,CAAA,CACA3jD,EAAAhB,EAAAgB,CAAA,CACAiD,EAAAjE,EAAAiE,CAAA,EASAf,EAAA0qK,CAAA,CAHApxK,EAAAyH,EAAAusK,EAAA,EAGA,CAIA9uK,EAAAq0K,EAAA,EACA/0K,EAAAA,GAAAxE,EAAA,GAAAoxK,IAAA,EAAAA,CAAA,CAAApxK,EAAA,GAEAwE,EAAAivK,EAAA,GAAA/sK,IAAA,EAAAA,GAAAlC,CAAAA,GAAAivK,CAAAA,GAAAA,GAAAA,GAAAjwK,CAAAA,EAAA4B,CAAA,SACAsB,EAAAxB,GAAAwB,GAAAxB,GAAAuuK,CAAAA,GAAAA,GAAAjvK,GAAAivK,GAAAA,GAAArC,EAAAA,CAAA,CAAApxK,EAAA,IACAyzK,GAAAjwK,CAAAA,EAAA4B,CAAA,SAKApF,EAAA,IAAAoxK,CAAA,IAGUlmJ,EAAA1mB,EAAAszK,EAAA7qE,EAAAliF,MAAA,KAAAipJ,EAAA/mE,EAAAliF,MAAA,KAAAkiF,EAAAliF,MAAA,QACV,CAMA,GAHAqmJ,EAAA9vK,MAAA,CAAAtB,EAGAwE,EAGA,MAAA+0K,EAAA,EAAAnI,CAAA,GAAApxK,EAAA,CAAAu5K,GACAnI,CAAA,CAAApxK,EAAA,GAEAA,IACA,EAAAyH,EACA2pK,EAAA,IAAA56I,MAAA,CAAA46I,GAGA,CAGA,IAAAlsK,EAAAksK,EAAA9vK,MAAA,EAAA8vK,CAAA,GAAAlsK,EAAA,GAGA,IAAAwB,EAAA,EAAAwkB,EAAA,GAAAxkB,GAAAxB,EAAAgmB,GAAA+hF,EAAAliF,MAAA,CAAAqmJ,CAAA,CAAA1qK,IAAA,GAGAwkB,EAAA4sJ,EAAA5sJ,EAAAzjB,EAAAwlG,EAAAliF,MAAA,IACA,QAGAG,CACK,CACL,IAIAu1B,EAAA,WAGA,SAAA2sE,EAAA5pH,CAAA,CAAA0B,CAAA,CAAAwrC,CAAA,EACA,IAAAnmB,EAAAmvJ,EAAAC,EAAAC,EACAhI,EAAA,EACAlrK,EAAAlD,EAAAlC,MAAA,CACAu4K,EAAA30K,EAAA2wK,EACAiE,EAAA50K,EAAA2wK,EAAA,EAEA,IAAAryK,EAAAA,EAAA9B,KAAA,GAAAgF,KAGA6jB,EAAAuvJ,EAFAH,CAAAA,EAAAn2K,CAAA,CAAAkD,EAAA,CAAAmvK,CAAA,EAEA+D,CADAA,EAAAp2K,CAAA,CAAAkD,EAAA,CAAAmvK,EAAA,GACAgE,EAEAjI,EAAA,CAAA8H,CADAA,EAAAG,EAAAF,EAAA,EAAA9D,EAAAA,EAAAjE,CAAA,EACAlhI,EAAA,GAAAnmB,CAAAA,EAAAsrJ,EAAA,GAAAiE,EAAAF,EACAp2K,CAAA,CAAAkD,EAAA,CAAAgzK,EAAAhpI,EAKA,OAFAkhI,GAAApuK,CAAAA,EAAA,CAAAouK,EAAA,CAAAp7I,MAAA,CAAAhzB,EAAA,EAEAA,CACA,CAEA,SAAA4zD,EAAAl3D,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,CAAAC,CAAA,EACA,IAAAtzK,EAAAmtK,EAEA,GAAAkG,GAAAC,EACUnG,EAAAkG,EAAAC,EAAA,UAGV,IAAAtzK,EAAAmtK,EAAA,EAAAntK,EAAAqzK,EAAArzK,IAEA,GAAAxG,CAAA,CAAAwG,EAAA,EAAA0S,CAAA,CAAA1S,EAAA,EACAmtK,EAAA3zK,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,CAAA1S,EAAA,MACA,MACA,OAIAmtK,CACA,CAEA,SAAA3mD,EAAAhtH,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,CAAArpI,CAAA,EAIA,IAHA,IAAAhqC,EAAA,EAGAqzK,KACA75K,CAAA,CAAA65K,EAAA,EAAArzK,EACAA,EAAAxG,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,KACA75K,CAAA,CAAA65K,EAAA,CAAArzK,EAAAgqC,EAAAxwC,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,CAIA,MAAA75K,CAAA,KAAAA,EAAAoB,MAAA,GAAApB,EAAA4pI,MAAA,OACA,CAGA,gBAAAtmI,CAAA,CAAAqxB,CAAA,CAAAm/I,CAAA,CAAAP,CAAA,CAAA/iI,CAAA,EACA,IAAAmjI,EAAApsK,EAAAf,EAAAgtK,EAAAhzK,EAAAu5K,EAAAC,EAAAvnH,EAAAyhH,EAAAn1E,EAAAk7E,EAAAC,EAAAC,EAAAC,EAAAC,EACAC,EAAAC,EACAr1K,EAAA5B,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,MACAgsK,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAAl/I,EAAAszB,CAAA,CAGA,IAAAipH,GAAA,CAAAA,CAAA,MAAA2C,GAAA,CAAAA,CAAA,IAEA,WAAAsB,EAGA,EAAAjwK,CAAA,EAAAyvB,EAAAzvB,CAAA,EAAAgsK,CAAAA,EAAA2C,CAAAA,GAAA3C,CAAA,KAAA2C,CAAA,IAAAA,CAAA,EAGA3C,GAAAA,GAAAA,CAAA,MAAA2C,EAAA3uK,EAAAA,EAAAA,EAAA,EAHAm+F,GAGA,CAEA,CAeA,IAZA6wE,EAAAzhH,CADAA,EAAA,IAAA0iH,EAAAjwK,EAAA,EACA+iD,CAAA,IAEA/iD,EAAA4uK,EADAvsK,CAAAA,EAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,EACA,EAEAipC,IACAA,EAAA83E,EACA/gH,EAAAizK,EAAAl3K,EAAAiE,CAAA,CAAAkuK,GAAA+E,EAAA7lJ,EAAAptB,CAAA,CAAAkuK,GACAvwK,EAAAA,EAAAuwK,EAAA,GAKAjvK,EAAA,EAAAqtK,CAAA,CAAArtK,EAAA,EAAA0qK,CAAAA,CAAA,CAAA1qK,EAAA,KAAAA,KAIA,GAFAqtK,CAAA,CAAArtK,EAAA,CAAA0qK,CAAAA,CAAA,CAAA1qK,EAAA,MAAAe,IAEArC,EAAA,EACAgvK,EAAAx0K,IAAA,IACU8zK,EAAA,OACV,CAwBA,IAvBA4G,EAAAlJ,EAAA9vK,MAAA,CACAk5K,EAAAzG,EAAAzyK,MAAA,CACAoF,EAAA,EACAtB,GAAA,EAIA1E,CAAAA,EAAA80K,EAAA9kI,EAAAqjI,CAAAA,CAAA,SAIA,IACAA,EAAA3mD,EAAA2mD,EAAArzK,EAAAgwC,GACA0gI,EAAAhkD,EAAAgkD,EAAA1wK,EAAAgwC,GACA8pI,EAAAzG,EAAAzyK,MAAA,CACAg5K,EAAAlJ,EAAA9vK,MAAA,EAGA+4K,EAAAG,EAEAL,EAAAl7E,CADAA,EAAAmyE,EAAA1vK,KAAA,GAAA84K,EAAA,EACAl5K,MAAA,CAGA64K,EAAAK,EAAAv7E,CAAA,CAAAk7E,IAAA,IAEAM,EAAA,IAAAjkJ,MAAA,CADAikJ,EAAA1G,EAAAryK,KAAA,IAEA64K,EAAAxG,CAAA,IACAA,CAAA,KAAArjI,EAAA,GAAA6pI,IAIA,GAOA,GANA75K,EAAA,EAMAmzK,CAHAA,EAAAz8G,EAAA28G,EAAA90E,EAAAu7E,EAAAL,EAAA,EAGA,GAqBA,GAjBAC,EAAAn7E,CAAA,IACAu7E,GAAAL,GAAAC,CAAAA,EAAAA,EAAA1pI,EAAAuuD,CAAAA,CAAA,SAgBAv+F,CAbAA,EAAA80K,EAAA4E,EAAAG,EAAA,EAaA,EAcA,IAXA75K,GAAAgwC,GAAAhwC,CAAAA,EAAAgwC,EAAA,GAIAwpI,EAAAD,CADAA,EAAA7sD,EAAA2mD,EAAArzK,EAAAgwC,EAAA,EACApvC,MAAA,CACA64K,EAAAl7E,EAAA39F,MAAA,CAMA81D,GAAAA,EAAA6iH,EAAAh7E,EAAAi7E,EAAAC,IACAz5K,IAGAwsH,EAAA+sD,EAAAO,EAAAN,EAAAO,EAAA1G,CAAA,CAAAmG,EAAAxpI,GACAwpI,EAAAD,EAAA34K,MAAA,CACAuyK,EAAA,OAQA,GAAAnzK,GAGAmzK,CAAAA,EAAAnzK,EAAA,GAKAw5K,EAAAD,CADAA,EAAAlG,EAAAryK,KAAA,IACAJ,MAAA,CAUA,GAPA44K,EAAAC,GAAAF,CAAAA,EAAA,IAAAzjJ,MAAA,CAAAyjJ,EAAA,EAGA/sD,EAAAjuB,EAAAg7E,EAAAE,EAAAzpI,GACAypI,EAAAl7E,EAAA39F,MAAA,CAGAuyK,IAAAA,EAMA,KAAAz8G,EAAAA,EAAA28G,EAAA90E,EAAAu7E,EAAAL,IACAz5K,IAGAwsH,EAAAjuB,EAAAu7E,EAAAL,EAAAM,EAAA1G,CAAA,CAAAoG,EAAAzpI,GACAypI,EAAAl7E,EAAA39F,MAAA,MAGA,IAAAuyK,IACAnzK,IACcu+F,EAAA,IACd,CAGAm1E,CAAA,CAAA1tK,IAAA,CAAAhG,EAGAu+F,CAAA,IACcA,CAAA,CAAAk7E,IAAA,CAAA/I,CAAA,CAAAiJ,EAAA,KAEdp7E,EAAA,CAAAmyE,CAAA,CAAAiJ,EAAA,EACAF,EAAA,EAEA,QAAAE,IAAAC,GAAAr7E,IAAA,EAAAA,CAAA,MAAA75F,IAAA,CAEAsuK,EAAAz0E,IAAA,EAAAA,CAAA,IAGAm1E,CAAA,KAAAA,EAAAtqC,MAAA,KACA,IAEAp5F,GAAA83E,EAAA,CAGA,IAAA9hH,EAAA,EAAAtB,EAAAgvK,CAAA,IAAAhvK,GAAA,GAAAA,GAAA,GAAAsB,GAAA,EAEAq/B,EAAA4sB,EAAAqhH,EAAArhH,CAAAA,EAAAlrD,CAAA,CAAAf,EAAAe,EAAAkuK,EAAA,KAAAlC,EAAAC,EAGA,MACA/gH,EAAAlrD,CAAA,CAAAA,EACAkrD,EAAAnuD,CAAA,EAAAkvK,CACA,CAEA,OAAA/gH,CACK,CACL,IA4HAujH,EAAA,8BACAC,EAAA,cACAC,EAAA,cACAC,EAAA,qBACAC,EAAA,6BALAE,EAOA,SAAAhzK,CAAA,CAAA0nB,CAAA,CAAAssJ,CAAA,CAAAp+J,CAAA,EACA,IAAAs3B,EACAtrC,EAAAoyK,EAAAtsJ,EAAAA,EAAAxG,OAAA,CAAA4xJ,EAAA,IAGA,GAAAD,EAAA51J,IAAA,CAAArb,GACU5B,EAAA4B,CAAA,CAAA6B,MAAA7B,GAAA,KAAAA,EAAA,WACV,CACA,IAAAoyK,IAGApyK,EAAAA,EAAAsf,OAAA,CAAAwxJ,EAAA,SAAA3rJ,CAAA,CAAAkT,CAAA,CAAAC,CAAA,EAEa,OADbgT,EAAA,KAAAhT,CAAAA,EAAAA,EAAAhd,WAAA,OAAAgd,KAAAA,EAAA,IACa,GAAAtkB,GAAAs3B,EAAAnmB,EAAAkT,CAAA,GAGbrkB,IACAs3B,EAAAt3B,EAGAhU,EAAAA,EAAAsf,OAAA,CAAAyxJ,EAAA,MAAAzxJ,OAAA,CAAA0xJ,EAAA,SAGAlrJ,GAAA9lB,GAAA,WAAAiwK,EAAAjwK,EAAAsrC,EACA,CAIA,GAAA2kI,EAAAsC,KAAA,CACA,MAAA7pK,MACA2nK,EAAA,QAAAr8J,CAAAA,EAAA,SAAAA,EAAA,gBAAA8R,EAAA,CAIA1nB,EAAA4B,CAAA,MACA,EAEA+iD,CAAA,CAAA3kD,EAAAiE,CAAA,OA6LA68C,EAAAq2H,aAAA,CAAAr2H,EAAAn0B,GAAA,YACA,IAAA3sB,EAAA,IAAA6xK,EAAA,MAEA,OADA7xK,EAAA4B,CAAA,IAAA5B,CAAAA,EAAA4B,CAAA,IACA5B,CACA,EAUA8gD,EAAAs2H,UAAA,UAAA/lJ,CAAA,CAAAzb,CAAA,EACA,OAAAg+C,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,GACA,EAgBAkrC,EAAA+4G,aAAA,CAAA/4G,EAAA0vH,EAAA,UAAAA,CAAA,CAAAP,CAAA,EACA,IAAAtrH,EAAAznD,EAAAyE,EACA3B,EAAA,KAEA,GAAAwwK,IAAA,EAAAA,EAKA,OAJA0D,EAAA1D,EAAA,EAAA8B,GACArC,IAAA,EAAAA,EAAAA,EAAAiD,EACAgB,EAAAjE,EAAA,KAEA1tI,EAAA,IAAAsvI,EAAA7xK,GAAAwwK,EAAAxwK,EAAAiE,CAAA,GAAAgsK,EACA,CAEA,IAAAtrH,CAAAA,EAAA3kD,EAAA2kD,CAAA,cAIA,GAHAznD,EAAA,EAAAyE,EAAAgjD,EAAA7mD,MAAA,IAAAo5K,EAAA,KAAAjzK,CAAA,CAAAkuK,EAAA,EAAAA,EAGAxwK,EAAAgjD,CAAA,CAAAhjD,EAAA,MAAAA,EAAA,MAAAA,GAAA,GAAAzE,GAAA,SACAA,EAAA,GAAAA,CAAAA,EAAA,GAEAA,CACA,EAuBA4jD,EAAAu2H,SAAA,CAAAv2H,EAAA7D,GAAA,UAAA5rB,CAAA,CAAAzb,CAAA,EACA,OAAAqnC,EAAA,SAAA40H,EAAAxgJ,EAAAzb,GAAAq9J,EAAAC,EACA,EAOApyH,EAAAw2H,kBAAA,CAAAx2H,EAAAy2H,IAAA,UAAAlmJ,CAAA,CAAAzb,CAAA,EACA,OAAAqnC,EAAA,SAAA40H,EAAAxgJ,EAAAzb,GAAA,IACA,EAkBAkrC,EAAA02H,eAAA,CAAA12H,EAAA5D,GAAA,UAAAhgD,CAAA,CAAA6pB,CAAA,EACA,IAAAuqJ,EAAAmG,EAAAv0K,EAAAxB,EAAAwuK,EAAAwH,EAAAC,EAAAC,EAAAvmJ,EACArxB,EAAA,KAKA,GAAA9C,CAHAA,EAAA,IAAA20K,EAAA30K,EAAA,EAGAynD,CAAA,GAAAznD,EAAAuY,SAAA,GACA,MAAAnL,MACA2nK,EAAA,4BAAA9wE,EAAAjkG,GAAA,CASA,GANA,MAAA6pB,GAAAA,CAAAA,EAAA,IAAA8qJ,EAAA9qJ,EAAA,EAGA2wJ,EAAAx6K,EAAA+G,CAAA,IAGA,CAAAjE,EAAA2kD,CAAA,GAAA3kD,EAAA2kD,CAAA,KAAA3kD,GAAAA,EAAA2kD,CAAA,MAAA3kD,EAAAiE,CAAA,EAAAjE,GAAAA,EAAA2kD,CAAA,CAAA7mD,MAAA,GAAAZ,EAAAynD,CAAA,GAAAznD,EAAAynD,CAAA,IAKA,OADAtzB,EAAA,IAAAwgJ,EAAAj0K,KAAAs/C,GAAA,EAAAikD,EAAAnhG,GAAA03K,EAAAx6K,EAAA0E,CAAA,IAAAshH,EAAAhmH,EAAA,GAAAikG,EAAAjkG,EAAA,GACA6pB,EAAAsK,EAAA5J,GAAA,CAAAV,GAAAsK,CAAA,CAKA,GAFAsmJ,EAAAz6K,EAAA0E,CAAA,GAEAmlB,EAAA,CAGA,GAAAA,EAAA49B,CAAA,EAAA59B,EAAA49B,CAAA,KAAA59B,EAAAnlB,CAAA,YAAAiwK,EAAA9xE,IAAA,CAEA03E,CAAAA,EAAA,CAAAE,GAAA33K,EAAAyV,SAAA,IAAAsR,EAAAtR,SAAA,KAEAzV,CAAAA,EAAAA,EAAAynB,GAAA,CAAAV,EAAA,CAIA,SAAA7pB,EAAA+G,CAAA,IAAAjE,CAAAA,EAAAiE,CAAA,IAAAjE,EAAAiE,CAAA,KAAAjE,CAAAA,GAAAA,EAAAiE,CAAA,CAEAjE,EAAA2kD,CAAA,OAAA+yH,GAAA13K,EAAA2kD,CAAA,UAEA3kD,EAAA2kD,CAAA,UAAA+yH,GAAA13K,EAAA2kD,CAAA,iBASA,OANA3kD,EAAA4B,CAAA,IAAAshH,EAAAhmH,GAAAwE,EAAA,GAGA1B,EAAAiE,CAAA,KAAAvC,CAAAA,EAAA,EAAAA,CAAAA,EAGA,IAAAmwK,EAAA8F,EAAA,EAAAj2K,EAAAA,CAAA,CAQA,CANA+xK,GAKA/xK,CAAAA,EAAAqwK,EAAA0B,EAAAtB,EAAA,IACA,IAEAuF,GACApG,EAAA,IAAAO,EAAA,IACA8F,GAAAz6K,CAAAA,EAAA0E,CAAA,IACQg2K,EAAA10D,EAAAhmH,IAGR06K,EAAA10K,CADAA,EAAAtF,KAAA+uB,GAAA,EAAAw0E,EAAAjkG,GAAA,EACA,EAGAm0B,EAAA,IAAAwgJ,EAAA9zH,KAGA,CAEA,GAAA65H,EAAA,CAEA,IAAAvmJ,CADAA,EAAAA,EAAA+/I,KAAA,CAAApxK,EAAA,EACA2kD,CAAA,OAEAjjD,EACY2vB,EAAAszB,CAAA,CAAA7mD,MAAA,CAAA4D,GAAA2vB,CAAAA,EAAAszB,CAAA,CAAA7mD,MAAA,CAAA4D,CAAAA,EACZ+1K,GACApmJ,CAAAA,EAAAA,EAAA5J,GAAA,CAAAV,EAAA,CAEA,IAEA7jB,EAAA,CAEA,GAAAA,IADAA,CAAAA,EAAA8uK,EAAA9uK,EAAA,IACA,MACU00K,EAAA10K,EAAA,CACV,MAIA,GAFAq/B,EADArlC,EAAAA,EAAAk0K,KAAA,CAAAE,GACAp0K,EAAA+G,CAAA,MAEA/G,EAAA+G,CAAA,IACY2zK,EAAA10D,EAAAhmH,OACZ,CAEA,GAAAgG,GADAA,CAAAA,EAAA,CAAAi+F,EAAAjkG,EAAA,EACA,MACA06K,EAAA10K,EAAA,CACA,GAGAlD,EAAAoxK,KAAA,CAAApxK,GAEA0B,EACU1B,EAAA2kD,CAAA,EAAA3kD,EAAA2kD,CAAA,CAAA7mD,MAAA,CAAA4D,GAAA1B,CAAAA,EAAA2kD,CAAA,CAAA7mD,MAAA,CAAA4D,CAAAA,EACV+1K,GACAz3K,CAAAA,EAAAA,EAAAynB,GAAA,CAAAV,EAAA,CAEA,QAEA,EAAAsK,GACAsmJ,GAAAtmJ,CAAAA,EAAA0sB,EAAAd,GAAA,CAAA5rB,EAAA,EAEAtK,EAAAsK,EAAA5J,GAAA,CAAAV,GAAArlB,EAAA6gC,EAAAlR,EAAAoiJ,EAAAP,EAAAhD,GAAA7+I,CAAA,CAHA,EAeAyvB,EAAA+2H,YAAA,UAAA5H,CAAA,EACA,IAAA/yK,EAAA,IAAA20K,EAAA,MAGA,OAFA5B,IAAA,EAAAA,EAAAA,EAAAiD,EACAgB,EAAAjE,EAAA,KACA1tI,EAAArlC,EAAAA,EAAA+G,CAAA,GAAAgsK,EACA,EAOAnvH,EAAAg3H,SAAA,CAAAh3H,EAAAh3B,EAAA,UAAAuH,CAAA,CAAAzb,CAAA,EACA,OAAAg+C,IAAAA,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,GACA,EAMAkrC,EAAAmkD,QAAA,YACA,aAAAtgD,CAAA,EAQA7D,EAAAi3H,aAAA,CAAAj3H,EAAAlC,EAAA,UAAAvtB,CAAA,CAAAzb,CAAA,EACA,OAAAg+C,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,IAAA,CACA,EAOAkrC,EAAAk3H,sBAAA,CAAAl3H,EAAAgwH,GAAA,UAAAz/I,CAAA,CAAAzb,CAAA,EACA,WAAAA,CAAAA,EAAAg+C,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,GAAA,GAAAA,IAAAA,CAEA,EAMAkrC,EAAArrC,SAAA,YACA,aAAAkvC,CAAA,EAAAuyH,EAAA,KAAAjzK,CAAA,CAAAkuK,GAAA,KAAAxtH,CAAA,CAAA7mD,MAAA,EACA,EAOAgjD,EAAAm3H,UAAA,CAAAn3H,EAAA2L,EAAA,UAAAp7B,CAAA,CAAAzb,CAAA,EACA,OAAAg+C,EAAAA,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,GACA,EAOAkrC,EAAAo3H,mBAAA,CAAAp3H,EAAAiwH,GAAA,UAAA1/I,CAAA,CAAAzb,CAAA,EACA,YAAAA,CAAAA,EAAAg+C,EAAA,SAAAi+G,EAAAxgJ,EAAAzb,GAAA,GAAAA,IAAAA,CACA,EAMAkrC,EAAAr9C,KAAA,YACA,YAAA7B,CAAA,EAOAk/C,EAAA64G,UAAA,YACA,YAAA/3J,CAAA,EACA,EAMAk/C,EAAAq3H,UAAA,YACA,YAAAv2K,CAAA,EACA,EAMAk/C,EAAAi7G,MAAA,YACA,aAAAp3G,CAAA,UAAAA,CAAA,KAwBA7D,EAAAkwH,KAAA,UAAA3/I,CAAA,CAAAzb,CAAA,EACA,IAAA1S,EAAAkuB,EAAArvB,EAAAq2K,EACAp4K,EAAA,KACAtD,EAAAsD,EAAA4B,CAAA,CAMA,GAHAgU,EAAAyb,CADAA,EAAA,IAAAwgJ,EAAAxgJ,EAAAzb,EAAA,EACAhU,CAAA,CAGA,CAAAlF,GAAA,CAAAkZ,EAAA,WAAAi8J,EAAA9xE,IAAA,CAGA,GAAArjG,GAAAkZ,EAEA,OADAyb,EAAAzvB,CAAA,EAAAgU,EACA5V,EAAAkxK,IAAA,CAAA7/I,EACA,CAEA,IAAA4mC,EAAAj4D,EAAAiE,CAAA,CAAAkuK,EACAt8G,EAAAxkC,EAAAptB,CAAA,CAAAkuK,EACAvE,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAAl/I,EAAAszB,CAAA,CAEA,IAAAsT,GAAA,CAAApC,EAAA,CAGA,IAAA+3G,GAAA,CAAA2C,EAAA,OAAA3C,EAAAv8I,CAAAA,EAAAzvB,CAAA,EAAAgU,EAAAyb,CAAA,MAAAwgJ,EAAAtB,EAAAvwK,EAAA+/F,GAAA,EAGA,IAAA6tE,CAAA,MAAA2C,CAAA,IAGA,OAAAA,CAAA,IAAAl/I,CAAAA,EAAAzvB,CAAA,EAAAgU,EAAAyb,CAAA,MAAAwgJ,EAAAjE,CAAA,IAAA5tK,EAGA,IAEA,GAEAi4D,EAAAi/G,EAAAj/G,GACApC,EAAAqhH,EAAArhH,GACA+3G,EAAAA,EAAA1vK,KAAA,GAGAxB,EAAAu7D,EAAApC,EAAA,CAaA,IAXAuiH,CAAAA,EAAA17K,EAAA,IACAA,EAAA,CAAAA,EACUqF,EAAA6rK,IAEV/3G,EAAAoC,EACAl2D,EAAAwuK,GAGAxuK,EAAAuiB,OAAA,GAGA1O,EAAAlZ,EAAAkZ,IAAA7T,EAAA3F,IAAA,KACQ2F,EAAAuiB,OAAA,EACR,MAKA,IAFA8M,EAAA,CAAAgnJ,EAAA,CAAA17K,EAAAkxK,EAAA9vK,MAAA,EAAA8X,CAAAA,EAAA26J,EAAAzyK,MAAA,GAAApB,EAAAkZ,CAAA,CAEAlZ,EAAAkZ,EAAA,EAAAA,EAAAwb,EAAAxb,IAEA,GAAAg4J,CAAA,CAAAh4J,EAAA,EAAA26J,CAAA,CAAA36J,EAAA,EACAwiK,EAAAxK,CAAA,CAAAh4J,EAAA,CAAA26J,CAAA,CAAA36J,EAAA,CACA,MACA,GAKAwiK,IACAr2K,EAAA6rK,EACAA,EAAA2C,EACAA,EAAAxuK,EACAsvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,EAOAgU,CAJAA,EAAA,CAAAwb,EAAAm/I,EAAAzyK,MAAA,EAAAoF,CAAAA,EAAA0qK,EAAA9vK,MAAA,GAIA,OAAA8X,IAAAg4J,CAAA,CAAA1qK,IAAA,QACA0S,EAAAovG,EAAA,EAGA5zF,EAAA10B,GAAA,CAEA,GAAAkxK,CAAA,GAAAx8I,EAAA,CAAsBm/I,CAAA,CAAAn/I,EAAA,EACtB,IAAAluB,EAAAkuB,EAAAluB,GAAA,CAAA0qK,CAAA,GAAA1qK,EAAA,CAAA0qK,CAAA,CAAA1qK,EAAA,CAAA0S,GACA,EAAAg4J,CAAA,CAAA1qK,EAAA,CACA0qK,CAAA,CAAAx8I,EAAA,EAAA4zF,CACA,EAEA,CAAA5zF,EAAA,EAAAm/I,CAAA,CAAAn/I,EAAA,CAIA,KAAAw8I,GAAAA,CAAA,IAAAA,EAAAtnC,MAAA,QAAAzwE,CAAA,SAGA,KAWA2+G,EAAAnjJ,EAAAu8I,EAAA/3G,IAPAxkC,EAAAzvB,CAAA,CAAAsxK,GAAAA,EAAA,KACA7hJ,EAAAszB,CAAA,EAAAtzB,EAAAptB,CAAA,IACAotB,EACA,EA6BAyvB,EAAA+/D,MAAA,CAAA//D,EAAAr5B,GAAA,UAAA4J,CAAA,CAAAzb,CAAA,EACA,IAAAu5C,EAAAvtD,EACA5B,EAAA,WAKA,CAHAqxB,EAAA,IAAAwgJ,EAAAxgJ,EAAAzb,GAGA,EAAA+uC,CAAA,EAAAtzB,EAAAzvB,CAAA,EAAAyvB,CAAAA,CAAAA,EAAAszB,CAAA,EAAAtzB,EAAAszB,CAAA,MAIA,EAAAA,CAAA,EAAA3kD,CAAAA,CAAAA,EAAA2kD,CAAA,EAAA3kD,EAAA2kD,CAAA,MAIA6uH,GAAAA,GAIA5xK,EAAAyvB,EAAAzvB,CAAA,CACAyvB,EAAAzvB,CAAA,GACAutD,EAAAlS,EAAAj9C,EAAAqxB,EAAA,KACAA,EAAAzvB,CAAA,CAAAA,EACQutD,EAAAvtD,CAAA,EAAAA,GAERutD,EAAAlS,EAAAj9C,EAAAqxB,EAAA,EAAAmiJ,GAMAniJ,CAHAA,EAAArxB,EAAAgxK,KAAA,CAAA7hH,EAAAiiH,KAAA,CAAA//I,GAAA,EAGAszB,CAAA,KAAA6uH,GAAAA,GAAAniJ,CAAAA,EAAAzvB,CAAA,CAAA5B,EAAA4B,CAAA,EAEAyvB,GArBA,IAAAwgJ,EAAA7xK,GAJA,IAAA6xK,EAAA9xE,IAKA,EA4CAj/C,EAAAu3H,YAAA,CAAAv3H,EAAAswH,KAAA,UAAA//I,CAAA,CAAAzb,CAAA,EACA,IAAA+uC,EAAA1gD,EAAAf,EAAAkuB,EAAA1vB,EAAAqlB,EAAAuxJ,EAAAnC,EAAAC,EAAAmC,EAAAC,EAAAC,EAAAC,EACAxrI,EAAAyrI,EACA34K,EAAA,KACA4tK,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAA,CAAAl/I,EAAA,IAAAwgJ,EAAAxgJ,EAAAzb,EAAA,EAAA+uC,CAAA,CAGA,IAAAipH,GAAA,CAAA2C,GAAA,CAAA3C,CAAA,MAAA2C,CAAA,IAmBA,OAhBA,EAAA3uK,CAAA,EAAAyvB,EAAAzvB,CAAA,EAAAgsK,CAAAA,CAAAA,GAAAA,CAAA,KAAA2C,CAAA,GAAAA,CAAAA,CAAAA,GAAAA,CAAA,KAAA3C,CAAA,GAGAv8I,EAAAzvB,CAAA,EAAA5B,EAAA4B,CAAA,CAGA,GAAA2uK,GAKAl/I,EAAAszB,CAAA,KACAtzB,EAAAptB,CAAA,IALAotB,EAAAszB,CAAA,CAAAtzB,EAAAptB,CAAA,OANUotB,EAAAszB,CAAA,CAAAtzB,EAAAptB,CAAA,CAAAotB,EAAAzvB,CAAA,MAeVyvB,CACA,CAkBA,IAAAnuB,EAhBAg0K,EAAAl3K,EAAAiE,CAAA,CAAAkuK,GAAA+E,EAAA7lJ,EAAAptB,CAAA,CAAAkuK,GACA9gJ,EAAAzvB,CAAA,EAAA5B,EAAA4B,CAAA,CACA02K,CAAAA,EAAA1K,EAAA9vK,MAAA,EACAy6K,CAAAA,EAAAhI,EAAAzyK,MAAA,IAIA46K,EAAA9K,EACAA,EAAA2C,EACAA,EAAAmI,EACAx1K,EAAAo1K,EACAA,EAAAC,EACAA,EAAAr1K,GAIAA,EAAAo1K,EAAAC,EAAAG,EAAA,GAAAx1K,IAAAw1K,EAAAt8K,IAAA,KAKA,IAHA8wC,EAAA83E,EACA2zD,EAAAtG,EAEAnvK,EAAAq1K,EAAA,EAAAr1K,GAAA,IAKA,IAAAxB,EAJA,EACA82K,EAAAjI,CAAA,CAAArtK,EAAA,CAAAy1K,EACAF,EAAAlI,CAAA,CAAArtK,EAAA,CAAAy1K,EAAA,EAEAj3K,EAAA42K,EAAAlnJ,EAAAluB,EAAAxB,CAAA,CAAA0vB,EAAAluB,GAGA6jB,EAAA0xJ,EAFAtC,CAAAA,EAAAvI,CAAA,GAAAlsK,EAAA,CAAAi3K,CAAA,EAEAvC,CADAA,EAAAxI,CAAA,CAAAlsK,EAAA,CAAAi3K,EAAA,GACAH,EAEA7zH,EAAA,CAAAwxH,CADAA,EAAAqC,EAAArC,EAAA,EAAAwC,EAAAA,EAAAD,CAAA,CAAAtnJ,EAAA,CAAAuzB,CAAAA,EACAzX,EAAA,GAAAnmB,CAAAA,EAAA4xJ,EAAA,GAAAF,EAAArC,EACAsC,CAAA,CAAAtnJ,IAAA,CAAA+kJ,EAAAjpI,CAGAwrI,CAAAA,CAAA,CAAAtnJ,EAAA,CAAAuzB,CACA,CAQA,OANAA,EACQ,EAAA1gD,EAERy0K,EAAApyC,MAAA,MAGAkuC,EAAAnjJ,EAAAqnJ,EAAAz0K,EACA,EAOA68C,EAAA83H,OAAA,YACA,IAAA54K,EAAA,IAAA6xK,EAAA,MAEA,OADA7xK,EAAA4B,CAAA,EAAA5B,EAAA4B,CAAA,OACA5B,CACA,EAuBA8gD,EAAAowH,IAAA,UAAA7/I,CAAA,CAAAzb,CAAA,EACA,IAAA7T,EACA/B,EAAA,KACAtD,EAAAsD,EAAA4B,CAAA,CAMA,GAHAgU,EAAAyb,CADAA,EAAA,IAAAwgJ,EAAAxgJ,EAAAzb,EAAA,EACAhU,CAAA,CAGA,CAAAlF,GAAA,CAAAkZ,EAAA,WAAAi8J,EAAA9xE,IAAA,CAGA,GAAArjG,GAAAkZ,EAEA,OADAyb,EAAAzvB,CAAA,EAAAgU,EACA5V,EAAAgxK,KAAA,CAAA3/I,EACA,CAEA,IAAA4mC,EAAAj4D,EAAAiE,CAAA,CAAAkuK,EACAt8G,EAAAxkC,EAAAptB,CAAA,CAAAkuK,EACAvE,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAAl/I,EAAAszB,CAAA,CAEA,IAAAsT,GAAA,CAAApC,EAAA,CAGA,IAAA+3G,GAAA,CAAA2C,EAAA,WAAAsB,EAAAn1K,EAAA,GAIA,IAAAkxK,CAAA,MAAA2C,CAAA,WAAAA,CAAA,IAAAl/I,EAAA,IAAAwgJ,EAAAjE,CAAA,IAAA5tK,EAAAtD,EAAAA,CAAA,EACA,GAEAu7D,EAAAi/G,EAAAj/G,GACApC,EAAAqhH,EAAArhH,GACA+3G,EAAAA,EAAA1vK,KAAA,GAGAxB,EAAAu7D,EAAApC,EAAA,CAUA,IATAn5D,EAAA,GACAm5D,EAAAoC,EACUl2D,EAAAwuK,IAEV7zK,EAAA,CAAAA,EACAqF,EAAA6rK,GAGA7rK,EAAAuiB,OAAe,GACf5nB,IAAAqF,EAAA3F,IAAA,KACA2F,EAAAuiB,OAAA,EACA,KAEA5nB,CAAAA,EAAAkxK,EAAA9vK,MAAA,EACA8X,CAAAA,EAAA26J,EAAAzyK,MAAA,EAGA,IACAiE,EAAAwuK,EACAA,EAAA3C,EACAA,EAAA7rK,EACA6T,EAAAlZ,GAIAA,EAAA,EAAAkZ,GACAlZ,EAAA,CAAAkxK,CAAA,GAAAh4J,EAAA,CAAAg4J,CAAA,CAAAh4J,EAAA,CAAA26J,CAAA,CAAA36J,EAAA,CAAAlZ,CAAAA,EAAAsoH,EAAA,EACA4oD,CAAA,CAAAh4J,EAAA,CAAAovG,IAAA4oD,CAAA,CAAAh4J,EAAA,GAAAg4J,CAAA,CAAAh4J,EAAA,CAAAovG,CAAA,CAUA,OAPAtoH,IACAkxK,EAAA,CAAAlxK,EAAA,CAAAs2B,MAAA,CAAA46I,GACA,EAAA/3G,GAKA2+G,EAAAnjJ,EAAAu8I,EAAA/3G,EACA,EAkBA/U,EAAA26G,SAAA,CAAA36G,EAAAkvH,EAAA,UAAAA,CAAA,CAAAC,CAAA,EACA,IAAAtrH,EAAAznD,EAAAyE,EACA3B,EAAA,KAEA,GAAAgwK,IAAA,EAAAA,GAAAA,CAAA,CAAAA,IAAAA,EAKA,OAJAkE,EAAAlE,EAAA,EAAAsC,GACArC,IAAA,EAAAA,EAAAA,EAAAiD,EACAgB,EAAAjE,EAAA,KAEA1tI,EAAA,IAAAsvI,EAAA7xK,GAAAgwK,EAAAC,EACA,CAEA,IAAAtrH,CAAAA,EAAA3kD,EAAA2kD,CAAA,cAIA,GAFAznD,EAAAyE,CADAA,EAAAgjD,EAAA7mD,MAAA,IACAq0K,EAAA,EAEAxwK,EAAAgjD,CAAA,CAAAhjD,EAAA,EAGA,KAAAA,EAAA,MAAAA,GAAA,GAAAzE,GAAA,EAGA,IAAAyE,EAAAgjD,CAAA,IAAAhjD,GAAA,GAAAA,GAAA,GAAAzE,GAAA,EACA,QAEA8yK,GAAAhwK,EAAAiE,CAAA,GAAA/G,GAAAA,CAAAA,EAAA8C,EAAAiE,CAAA,IAEA/G,CACA,EAWA4jD,EAAA+3H,SAAA,UAAAn3K,CAAA,EAEA,OADAwyK,EAAAxyK,EAAA,CAAAw4C,EAAAA,GACA,KAAAk3H,KAAA,MAAA1vK,EACA,EAcAo/C,EAAAg4H,UAAA,CAAAh4H,EAAA2iE,IAAA,YACA,IAAA18F,EAAA7pB,EAAA8D,EAAA+3K,EAAAh3K,EACA/B,EAAA,KACA2kD,EAAA3kD,EAAA2kD,CAAA,CACA/iD,EAAA5B,EAAA4B,CAAA,CACAqC,EAAAjE,EAAAiE,CAAA,CACAusK,EAAAyC,EAAA,EACA3B,EAAA,IAAAO,EAAA,OAGA,GAAAjwK,IAAAA,GAAA,CAAA+iD,GAAA,CAAAA,CAAA,IACA,WAAAktH,EAAA,CAAAjwK,GAAAA,EAAA,KAAA+iD,GAAAA,CAAA,KAAAo7C,IAAAp7C,EAAA3kD,EAAA,IACA,CA6BA,GAtBA4B,GAJAA,CAAAA,EAAAhE,KAAA6lH,IAAA,EAAAtiB,EAAAnhG,GAAA,GAIA4B,GAAA,KAEA1E,CAAAA,CADAA,EAAAm3K,EAAA1vH,EAAA,EACA7mD,MAAA,CAAAmG,CAAAA,EAAA,MAAA/G,CAAAA,GAAA,KACA0E,EAAAhE,KAAA6lH,IAAA,EAAAvmH,GACA+G,EAAAizK,EAAA,CAAAjzK,EAAA,MAAAA,CAAAA,EAAA,GAAAA,EAAA,GAGU/G,EADV0E,GAAA,IACU,KAAAqC,EAGV/G,CADAA,EAAA0E,EAAA2vK,aAAA,IACArzK,KAAA,GAAAhB,EAAA4f,OAAA,SAAA7Y,EAGQjD,EAAA,IAAA6wK,EAAA30K,IAER8D,EAAA,IAAA6wK,EAAAjwK,EAAA,IAOAZ,EAAA2jD,CAAA,IAMA,KAJA/iD,CAAAA,EAAAqC,CADAA,EAAAjD,EAAAiD,CAAA,EACAusK,CAAA,EACA,GAAA5uK,CAAAA,EAAA,KAOA,GAHAG,EAAAf,EACAA,EAAAswK,EAAAF,KAAA,CAAArvK,EAAAmvK,IAAA,CAAAj0H,EAAAj9C,EAAA+B,EAAAyuK,EAAA,KAEA6D,EAAAtyK,EAAA4iD,CAAA,EAAAzmD,KAAA,GAAA0D,KAAA,CAAA1E,EAAAm3K,EAAArzK,EAAA2jD,CAAA,GAAAzmD,KAAA,GAAA0D,GAAA,CAWA,GANAZ,EAAAiD,CAAA,CAAAA,GAAA,EAAArC,EAMA1E,QALAA,CAAAA,EAAAA,EAAAgB,KAAA,CAAA0D,EAAA,EAAAA,EAAA,KAKA,IAAA1E,QAAAA,CAAA,EAgBA,CAIA,CAAAA,GAAA,EAAAA,EAAAgB,KAAA,KAAAhB,KAAAA,EAAAqqB,MAAA,OAGAgb,EAAAvhC,EAAAA,EAAAiD,CAAA,CAAAgvK,EAAA,KACAlsJ,EAAA,CAAA/lB,EAAAowK,KAAA,CAAApwK,GAAA8oB,EAAA,CAAA9pB,IAGA,MACA,GAxBA,CAAA+4K,IACAx2I,EAAAxgC,EAAAA,EAAAkC,CAAA,CAAAgvK,EAAA,KAEAlxK,EAAAqvK,KAAA,CAAArvK,GAAA+nB,EAAA,CAAA9pB,IAAA,CACAgB,EAAAe,EACA,MAEA,GAEA,EACAH,GAAA,EACcm3K,EAAA,CAcd,EAEA,OAEAx2I,EAAAvhC,EAAAA,EAAAiD,CAAA,CAAAgvK,EAAA,EAAAC,EAAAnsJ,EACA,EAYA+5B,EAAAywH,aAAA,UAAAf,CAAA,CAAAP,CAAA,EAKA,OAJA,MAAAO,IACA0D,EAAA1D,EAAA,EAAA8B,GACA9B,KAEAx9G,EAAA,KAAAw9G,EAAAP,EAAA,EACA,EAeAnvH,EAAA5W,OAAA,UAAAsmI,CAAA,CAAAP,CAAA,EAKA,OAJA,MAAAO,IACA0D,EAAA1D,EAAA,EAAA8B,GACA9B,EAAAA,EAAA,KAAAvsK,CAAA,IAEA+uD,EAAA,KAAAw9G,EAAAP,EACA,EA4BAnvH,EAAAk4H,QAAA,UAAAxI,CAAA,CAAAP,CAAA,CAAAj9G,CAAA,EACA,IAAAtrC,EACA1nB,EAAA,KAEA,GAAAgzD,IAAA,EAAAA,EACAw9G,IAAA,EAAAA,GAAAP,GAAA,iBAAAA,GACAj9G,EAAAi9G,EACUA,EAAA,MACVO,GAAA,iBAAAA,GACAx9G,EAAAw9G,EACUA,EAAAP,EAAA,MAEVj9G,EAAA0gH,OAEA,oBAAA1gH,EACA,MAAA1oD,MACA2nK,EAAA,2BAAAj/G,EAAA,CAKA,GAFAtrC,EAAA1nB,EAAAkqC,OAAA,CAAAsmI,EAAAP,GAEAjwK,EAAA2kD,CAAA,EACA,IAAAzhD,EACAwnE,EAAAhjD,EAAAjQ,KAAA,MACAwhK,EAAA,CAAAjmH,EAAAwmG,SAAA,CACA0f,EAAA,CAAAlmH,EAAA2gH,kBAAA,CACApa,EAAAvmG,EAAAumG,cAAA,KACA4f,EAAAzuG,CAAA,IACAsvF,EAAAtvF,CAAA,IACAptB,EAAAt9C,EAAA4B,CAAA,GACAw3K,EAAA97H,EAAA67H,EAAAj7K,KAAA,IAAAi7K,CAAA,CACA7iJ,EAAA8iJ,EAAAt7K,MAAA,CASA,GAPAo7K,IACAh2K,EAAA+1K,EACAA,EAAAC,EACAA,EAAAh2K,EACAozB,GAAApzB,GAGA+1K,EAAA,GAAA3iJ,EAAA,GAGA,IAFApzB,EAAAozB,EAAA2iJ,GAAAA,EACAE,EAAiBC,EAAShrH,MAAA,GAAAlrD,GAC1BA,EAAAozB,EAAApzB,GAAA+1K,EAAAE,GAAA5f,EAAA6f,EAAAhrH,MAAA,CAAAlrD,EAAA+1K,GACAC,EAAA,GAAAC,CAAAA,GAAA5f,EAAA6f,EAAAl7K,KAAA,CAAAgF,EAAA,EACAo6C,GAAA67H,CAAAA,EAAA,IAAAA,CAAA,CACA,GAEAnf,EACAmf,EAAAnmH,CAAAA,EAAAsmG,gBAAA,EAAiD,MAAA4f,EAAW,CAAAlmH,EAAA4gH,iBAAA,EAC5D5Z,EAAA94I,OAAA,eAAAg4J,EAAA,YACA,KAAAlmH,CAAAA,EAAA6gH,sBAAA,OACA7Z,CAAA,EACAmf,CAAA,CACA,MAEA,CAAAnmH,EAAAqf,MAAA,MAAA3qD,EAAAsrC,CAAAA,EAAAyjE,MAAA,KACA,EAcA31E,EAAAu4H,UAAA,UAAA1tI,CAAA,EACA,IAAAnvC,EAAA88K,EAAAC,EAAAC,EAAAv1K,EAAAw1K,EAAAv8K,EAAA4hD,EAAAC,EAAAoQ,EAAAnuD,EAAAY,EACA5B,EAAA,KACA4tK,EAAA5tK,EAAA2kD,CAAA,CAEA,GAAAhZ,IAAA,EAAAA,GAIA,EAAAzuC,CAHAA,EAAA,IAAA20K,EAAAlmI,EAAA,EAGAl2B,SAAA,IAAAvY,CAAAA,EAAAynD,CAAA,EAAAznD,IAAAA,EAAA0E,CAAA,GAAA1E,EAAAuvD,EAAA,CAAA1O,EAAA,EACA,MAAAzzC,MACA2nK,EAAA,YACA/0K,CAAAA,EAAAuY,SAAA,wCAAA0rF,EAAAjkG,GAAA,CAIA,IAAA0wK,EAAA,WAAAiE,EAAA7xK,EAAA,CAoBA,IAlBAxD,EAAA,IAAAq1K,EAAA9zH,GACAgB,EAAAu6H,EAAA,IAAAzH,EAAA9zH,GACAw7H,EAAAz6H,EAAA,IAAA+yH,EAAA9zH,GACAn8C,EAAAyyK,EAAAzG,GAIA3pK,EAAAzH,EAAAyH,CAAA,CAAArC,EAAA9D,MAAA,CAAAkC,EAAAiE,CAAA,GACAzH,EAAAmoD,CAAA,IAAAytH,CAAA,EAAAqH,EAAAx1K,EAAAkuK,CAAA,IAAAA,EAAAsH,EAAAA,CAAA,EACA9tI,EAAA,CAAAA,GAAAzuC,EAAAk6K,UAAA,CAAA56K,GAAA,EAAAyH,EAAA,EAAAzH,EAAAuiD,CAAA,CAAA7hD,CAAA,CAEAu8K,EAAAnG,EACAA,EAAA,IACAp2K,EAAA,IAAA20K,EAAAjwK,GAGAk9C,EAAA6F,CAAA,MAGAwK,EAAAlS,EAAA//C,EAAAV,EAAA,KAEAg9K,GAAAA,CADAA,EAAAF,EAAApI,IAAA,CAAA/hH,EAAAiiH,KAAA,CAAAmI,GAAA,EACAnC,UAAA,CAAAzrI,IACA2tI,EAAAC,EACAA,EAAAC,EACAz6H,EAAAD,EAAAoyH,IAAA,CAAA/hH,EAAAiiH,KAAA,CAAAoI,EAAAz6H,IACAD,EAAA06H,EACAh9K,EAAAU,EAAA8zK,KAAA,CAAA7hH,EAAAiiH,KAAA,CAAAoI,EAAAh9K,IACAU,EAAAs8K,EAeA,OAZAA,EAAAv8H,EAAAtR,EAAAqlI,KAAA,CAAAsI,GAAAC,EAAA,KACAz6H,EAAAA,EAAAoyH,IAAA,CAAAsI,EAAApI,KAAA,CAAAryH,IACAu6H,EAAAA,EAAApI,IAAA,CAAAsI,EAAApI,KAAA,CAAAmI,IACAz6H,EAAAl9C,CAAA,CAAAm9C,EAAAn9C,CAAA,CAAA5B,EAAA4B,CAAA,CACAqC,GAAA,EAGAjD,EAAAi8C,EAAAA,EAAA8B,EAAAw6H,EAAAt1K,EAAAivK,GAAAlC,KAAA,CAAAhxK,GAAA2sB,GAAA,GAAAyqJ,UAAA,CACAn6H,EAAA6B,EAAAw6H,EAAAr1K,EAAAivK,GAAAlC,KAAA,CAAAhxK,GAAA2sB,GAAA,KAAAoyB,EAAAw6H,EAAA,EAAAz6H,EAAAw6H,EAAA,CAEAhG,EAAAmG,EAEAz4K,CACA,EAMA8/C,EAAA5lC,QAAA,YACA,OAAAimF,EAAA,KACA,EAcArgD,EAAA0wH,WAAA,UAAAxB,CAAA,CAAAC,CAAA,EAEA,OADA,MAAAD,GAAAkE,EAAAlE,EAAA,EAAAsC,GACAt/G,EAAA,KAAAg9G,EAAAC,EAAA,EACA,EAcAnvH,EAAAj7C,QAAA,UAAA+P,CAAA,EACA,IAAA8R,EACAxqB,EAAA,KACA0E,EAAA1E,EAAA0E,CAAA,CACAqC,EAAA/G,EAAA+G,CAAA,CA0BA,OAvBAA,IAAA,GAAAA,EACArC,GACA8lB,EAAA,WACU9lB,EAAA,GAAA8lB,CAAAA,EAAA,IAAAA,CAAA,GAEVA,EAAA,OAGA9R,IAAA,EAAAA,EACA8R,EAAAzjB,GAAAkvK,GAAAlvK,GAAAmvK,EACA7B,EAAA8C,EAAAn3K,EAAAynD,CAAA,EAAA1gD,GACUqwK,EAAAD,EAAAn3K,EAAAynD,CAAA,EAAA1gD,EAAA,KACV2R,KAAAA,GAAAk+J,EAEUpsJ,EAAA4sJ,EAAAD,EAAAn3K,CADVA,EAAAqlC,EAAA,IAAAsvI,EAAA30K,GAAA+1K,EAAAhvK,EAAA,EAAAivK,EAAA,EACUvuH,CAAA,EAAAznD,EAAA+G,CAAA,OAEViwK,EAAAt+J,EAAA,EAAA+P,EAAA7nB,MAAA,SACA4pB,EAAAqrJ,EAAAuB,EAAAD,EAAAn3K,EAAAynD,CAAA,EAAA1gD,EAAA,QAAA2R,EAAAhU,EAAA,KAGAA,EAAA,GAAA1E,EAAAynD,CAAA,KAAAj9B,CAAAA,EAAA,IAAAA,CAAA,GAGAA,CACA,EAOAo5B,EAAAqgD,OAAA,CAAArgD,EAAAsjC,MAAA,YACA,OAAA+c,EAAA,KACA,EAGArgD,EAAAmzH,YAAA,IAEA,MAAA1B,GAAAV,EAAA5vK,GAAA,CAAAswK,GAEAV,CACA,CASA,SAAAqF,EAAAh6K,CAAA,EACA,IAAAgG,EAAAhG,EAAAA,EACA,OAAAA,EAAA,GAAAA,IAAAgG,EAAAA,EAAAA,EAAA,EAKA,SAAAmxK,EAAA33K,CAAA,EAMA,IALA,IAAAkF,EAAA0vB,EACApuB,EAAA,EACAkuB,EAAA10B,EAAAoB,MAAA,CACAkD,EAAAtE,CAAA,OAEAwG,EAAAkuB,GAAA,CAGA,IADAE,EAAA6gJ,EAAkBvwK,CADlBA,EAAAlF,CAAA,CAAAwG,IAAA,KACkBpF,MAAA,CAClBwzB,IAAA1vB,EAAA,IAAAA,GACAZ,GAAAY,CACA,CAGA,IAAAwvB,EAAApwB,EAAAlD,MAAA,CAAAkD,KAAAA,EAAAusB,UAAA,GAAA6D,KAEA,OAAApwB,EAAA9C,KAAA,GAAAkzB,EAAA,KACA,CAIA,SAAAwiC,EAAA5zD,CAAA,CAAAqxB,CAAA,EACA,IAAA30B,EAAAkZ,EACAg4J,EAAA5tK,EAAA2kD,CAAA,CACA4rH,EAAAl/I,EAAAszB,CAAA,CACAzhD,EAAAlD,EAAA4B,CAAA,CACAwvB,EAAAC,EAAAzvB,CAAA,CACAF,EAAA1B,EAAAiE,CAAA,CACA4lC,EAAAxY,EAAAptB,CAAA,CAGA,IAAAf,GAAA,CAAAkuB,EAAA,YAMA,GAJA10B,EAAAkxK,GAAA,CAAAA,CAAA,IACAh4J,EAAA26J,GAAA,CAAAA,CAAA,IAGA7zK,GAAAkZ,EAAA,OAAAlZ,EAAAkZ,EAAA,GAAAwb,CAAA,CAAAluB,CAAA,CAGA,GAAAA,GAAAkuB,EAAA,OAAAluB,CAAA,CAMA,GAJAxG,EAAAwG,EAAA,EACA0S,EAAAlU,GAAAmoC,EAGA,CAAA+jI,GAAA,CAAA2C,EAAA,OAAA36J,EAAA,GAAAg4J,EAAAlxK,EAAA,KAGA,IAAAkZ,EAAA,OAAAlU,EAAAmoC,EAAAntC,EAAA,KAKA,IAAAwG,EAAA,EAHAkuB,EAAA,CAAA1vB,EAAAksK,EAAA9vK,MAAA,EAAA+rC,CAAAA,EAAA0mI,EAAAzyK,MAAA,EAAA4D,EAAAmoC,CAAA,CAGA3mC,EAAAkuB,EAAAluB,IAAA,GAAA0qK,CAAA,CAAA1qK,EAAA,EAAAqtK,CAAA,CAAArtK,EAAA,QAAA0qK,CAAA,CAAA1qK,EAAA,CAAAqtK,CAAA,CAAArtK,EAAA,CAAAxG,EAAA,KAGA,OAAAgF,GAAAmoC,EAAA,EAAAnoC,EAAAmoC,EAAAntC,EAAA,KAOA,SAAAw3K,EAAAh3K,CAAA,CAAA8rC,CAAA,CAAAC,CAAA,CAAAppC,CAAA,EACA,GAAA3C,EAAA8rC,GAAA9rC,EAAA+rC,GAAA/rC,IAAA80K,EAAA90K,GACA,MAAAoN,MACA2nK,EAAApyK,CAAAA,GAAA,8BAAA3C,EACAA,EAAA8rC,GAAA9rC,EAAA+rC,EAAA,sCACA,6BAAAjsB,OAAA9f,GAAA,CAMA,SAAAgmH,EAAAhmH,CAAA,EACA,IAAAwE,EAAAxE,EAAAynD,CAAA,CAAA7mD,MAAA,GACA,OAAAo5K,EAAAh6K,EAAA+G,CAAA,CAAAkuK,IAAAzwK,GAAAxE,EAAAynD,CAAA,CAAAjjD,EAAA,KACA,CAGA,SAAA6vK,EAAA7pJ,CAAA,CAAAzjB,CAAA,EACA,OAAAyjB,EAAA5pB,MAAA,GAAA4pB,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,IAAAwpB,CAAA,EACAzjB,CAAAA,EAAA,YAAAA,CACA,CAGA,SAAAqwK,EAAA5sJ,CAAA,CAAAzjB,CAAA,CAAAqtB,CAAA,EACA,IAAAgF,EAAAojJ,EAGA,GAAAz1K,EAAA,GAGA,IAAAy1K,EAAApoJ,EAAA,MAAArtB,EAAAy1K,GAAApoJ,GACA5J,EAAAgyJ,EAAAhyJ,CAGA,MAIA,GAHA4O,EAAA5O,EAAA5pB,MAAA,CAGA,EAAAmG,EAAAqyB,EAAA,CACA,IAAAojJ,EAAApoJ,EAAArtB,GAAAqyB,CAAA,GAAAryB,EAAAy1K,GAAApoJ,GACQ5J,GAAAgyJ,CACR,MAAAz1K,EAAAqyB,GACA5O,CAAAA,EAAAA,EAAAxpB,KAAA,GAAA+F,GAAA,IAAAyjB,EAAAxpB,KAAA,CAAA+F,EAAA,CACA,CAGA,OAAAyjB,CACA,CAOAmqJ,CADAA,EAAAhwJ,GAAA,EACA,QAAAgwJ,EAAAA,SAAA,CAAAA,EAIAhD,KAAAluK,IAD4CkuK,CAAAA,EAAA,mBAAAgD,CAAA,GAAAtmK,IAAA,CAAA3O,EAAAL,EAACK,EAAAD,EAAA,GAC7CA,CAAAA,EAAAC,OAAA,CAAAiyK,CAAA,CAaC,oBAAAlyK,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,GCx2FD,SAAAI,CAAA,CAAAC,CAAA,eAIA,SAAA4F,EAAAynC,CAAA,CAAA7qC,CAAA,EACA,IAAA6qC,EAAA,YAAA7qC,GAAA,oBAKA,SAAA4+F,EAAA6L,CAAA,CAAAC,CAAA,EACAD,EAAAE,MAAA,CAAAD,EACA,IAAAE,EAAA,YACAA,CAAAA,EAAA3+F,SAAA,CAAAy+F,EAAAz+F,SAAA,CACAw+F,EAAAx+F,SAAA,KAAA2+F,EACAH,EAAAx+F,SAAA,CAAAxM,WAAA,CAAAgrG,CAAA,CAKA,SAAA3rD,EAAA16C,CAAA,CAAA0pC,CAAA,CAAAysI,CAAA,EACA,GAAAz7H,EAAA65C,IAAA,CAAAv0F,GACA,OAAAA,CAAA,CAGA,KAAAo2K,QAAA,GACA,KAAAva,KAAA,WAAAvhK,MAAA,GAGA,KAAAwgC,GAAA,MAGA,OAAA96B,IACA0pC,CAAAA,OAAAA,GAAAA,OAAAA,CAAA,IACAysI,EAAAzsI,EACAA,EAAA,IAGA,KAAA2sI,KAAA,CAAAr2K,GAAA,EAAA0pC,GAAA,GAAAysI,GAAA,MAEA,CACA,iBAAAh9K,EACIA,EAAAC,OAAA,CAAAshD,EAEJthD,EAAAshD,EAAA,CAAAA,EAGAA,EAAAA,EAAA,CAAAA,EAAAA,EAAAkhH,QAAA,IAIA,IAEM9hK,EADN,oBAAA2N,QAAA,SAAAA,OAAA3N,MAAA,CACM2N,OAAA3N,MAAA,CAENf,EAAA,MAAAe,MAAA,CAEA,MAAA2G,EAAA,EAgIA,SAAA61K,EAAAn2K,CAAA,CAAA1F,CAAA,EACA,IAAA0mD,EAAAhhD,EAAA4pB,UAAA,CAAAtvB,UAEA,OAAA0mD,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,IACMA,EAAA,QAENniD,EAAA,2BAAAmB,EACA,CAGA,SAAAo2K,EAAAp2K,CAAA,CAAAq2K,CAAA,CAAA/7K,CAAA,EACA,IAAA+C,EAAA84K,EAAAn2K,EAAA1F,GAIA,OAHAA,EAAA,GAAA+7K,GACAh5K,CAAAA,GAAA84K,EAAAn2K,EAAA1F,EAAA,OAEA+C,CAAA,CA8CA,SAAAi5K,EAAAvyJ,CAAA,CAAA0mB,CAAA,CAAA1gB,CAAA,CAAA8vB,CAAA,EAIA,QAHAx8C,EAAA,EACA4U,EAAA,EACA0gB,EAAA14B,KAAAorC,GAAA,CAAAthB,EAAwB5pB,MAAS,CAAA4vB,GACjCxqB,EAAAkrC,EAAAlrC,EAAAozB,EAAApzB,IAAA,KAAAyhD,EAAAj9B,EAAA6F,UAAA,CAAArqB,GAAA,GAEAlC,GAAAw8C,EAIA5nC,EAAA+uC,GAAA,GAAAA,EAAA,MAIAA,GAAA,GAAAA,EAAA,MAKAA,EAEAniD,EAAAmiD,GAAA,GAAA/uC,EAAA4nC,EAAA,qBACAx8C,GAAA4U,CACA,CACA,OAAA5U,CAAA,CA4DA,SAAAk5K,EAAA7hK,CAAA,CAAAvC,CAAA,EACAuC,EAAAgnJ,KAAA,CAAAvpJ,EAAAupJ,KAAA,CACAhnJ,EAAAva,MAAA,CAAAgY,EAAAhY,MAAA,CACAua,EAAAuhK,QAAA,CAAA9jK,EAAA8jK,QAAA,CACAvhK,EAAAimB,GAAA,CAAAxoB,EAAAwoB,GAAA,CAsCA,GA9TA4f,EAAA65C,IAAA,UAAA7uE,CAAA,SACA,aAAAg1B,GAIAh1B,IAAA,GAAAA,GAAA,iBAAAA,GACAA,EAAArqB,WAAA,CAAAugK,QAAA,GAAAlhH,EAAAkhH,QAAA,EAAA1hK,MAAA6D,OAAA,CAAA2nB,EAAAm2I,KAAA,GAGAnhH,EAAAjV,GAAA,UAAA6O,CAAA,CAAAF,CAAA,SACA,EAAAy4H,GAAA,CAAAz4H,GAAA,EAAAE,EACAF,CADA,EAIAsG,EAAAlV,GAAA,UAAA8O,CAAA,CAAAF,CAAA,SACA,EAAAE,EAAAu4H,GAAA,CAAAz4H,GAAAE,EACAF,CADA,EAIAsG,EAAA7yC,SAAA,CAAAwuK,KAAA,UAAAr2K,CAAA,CAAA0pC,CAAA,CAAAysI,CAAA,EACA,oBAAAn2K,EACA,YAAA22K,WAAA,CAAA32K,EAAA0pC,EAAAysI,EAAA,CAGA,oBAAAn2K,EACA,YAAA42K,UAAA,CAAA52K,EAAA0pC,EAAAysI,EAAA,CAGA,QAAAzsI,GACAA,CAAAA,EAAA,IACA1qC,EAAA0qC,IAAAA,CAAAA,EAAAA,CAAA,GAAAA,GAAA,GAAAA,GAAA,IAIA,IAAAkB,EAAA,EACA,MAAA5qC,CAFAA,EAAAA,EAAAqC,QAAA,GAAAqb,OAAA,YAEA,MACAktB,IACA,KAAAwrI,QAAA,IAGAxrI,EAAA5qC,EAAA1F,MAAA,GACAovC,KAAAA,EACQ,KAAAmtI,SAAA,CAAA72K,EAAA4qC,EAAAurI,IAER,KAAAW,UAAA,CAAA92K,EAAA0pC,EAAAkB,GACA,OAAAurI,GACA,KAAAS,UAAA,MAAA/1J,OAAA,GAAA6oB,EAAAysI,IAGA,EAGAz7H,EAAA7yC,SAAA,CAAA8uK,WAAA,UAAA32K,CAAA,CAAA0pC,CAAA,CAAAysI,CAAA,EACAn2K,EAAA,IACA,KAAAo2K,QAAA,GACAp2K,EAAA,CAAAA,GAEAA,EAAA,UACA,KAAA67J,KAAA,EAAA77J,SAAAA,EAAA,CACM,KAAA1F,MAAA,IACN0F,EAAA,kBACA,KAAA67J,KAAA,EACA77J,SAAAA,EACA,oBACA,CACM,KAAA1F,MAAA,KAEN0E,EAAAgB,EAAA,kBACA,KAAA67J,KAAA,EACA77J,SAAAA,EACA,oBACA,EACA,CACA,KAAA1F,MAAA,IAEA,OAAA67K,GAIA,KAAAS,UAAA,MAAA/1J,OAAA,GAAA6oB,EAAAysI,EAAA,EAGAz7H,EAAA7yC,SAAA,CAAA+uK,UAAA,UAAA52K,CAAA,CAAA0pC,CAAA,CAAAysI,CAAA,EAGA,GADAn3K,EAAA,iBAAAgB,EAAA1F,MAAA,EACA0F,EAAA1F,MAAA,IAGA,OAFA,KAAAuhK,KAAA,KACA,KAAAvhK,MAAA,GACA,KAGA,KAAAA,MAAA,CAAAF,KAAAC,IAAA,CAAA2F,EAAA1F,MAAA,IACA,KAAAuhK,KAAA,OAAoB,KAAAvhK,MAAiB,EACrC,QAIAszB,EAAA2D,EAJA7xB,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,GAIA,IAAAq3K,EAAA,EACA,GAAAZ,OAAAA,EACA,IAAAz2K,EAAAM,EAAA1F,MAAA,GAAAszB,EAAA,EAAAluB,GAAA,EAAAA,GAAA,EACA6xB,EAAAvxB,CAAA,CAAAN,EAAA,CAAAM,CAAA,CAAAN,EAAA,MAAAM,CAAA,CAAAN,EAAA,OACA,KAAAm8J,KAAA,CAAAjuI,EAAA,KAAAmpJ,EAAA,SACA,KAAAlb,KAAA,CAAAjuI,EAAA,UAAAmpJ,EAAA,SACAA,CAAAA,GAAA,KACA,KACAA,GAAA,GACAnpJ,UAGA,GAAAuoJ,OAAAA,EACA,IAAAz2K,EAAA,EAAAkuB,EAAA,EAAAluB,EAAAM,EAAA1F,MAAA,CAAAoF,GAAA,EACA6xB,EAAAvxB,CAAA,CAAAN,EAAA,CAAAM,CAAA,CAAAN,EAAA,MAAAM,CAAA,CAAAN,EAAA,OACA,KAAAm8J,KAAA,CAAAjuI,EAAA,KAAAmpJ,EAAA,SACA,KAAAlb,KAAA,CAAAjuI,EAAA,UAAAmpJ,EAAA,SACAA,CAAAA,GAAA,KACA,KACAA,GAAA,GACAnpJ,IAGA,CACA,YAAAopJ,MAAA,IA2BAt8H,EAAA7yC,SAAA,CAAAgvK,SAAA,UAAA72K,CAAA,CAAA4qC,CAAA,CAAAurI,CAAA,EAEA,KAAA77K,MAAA,CAAAF,KAAAC,IAAA,EAAA2F,EAAA1F,MAAA,CAAAswC,CAAA,KACA,KAAAixH,KAAA,OAAoB,KAAAvhK,MAAiB,EACrC,QAQAi3B,EARA7xB,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,GAIA,IAAAq3K,EAAA,EAAAnpJ,EAAA,EAIA,GAAAuoJ,OAAAA,EACA,IAAAz2K,EAAAM,EAAA1F,MAAA,GAAAoF,GAAAkrC,EAAAlrC,GAAA,EACA6xB,EAAAglJ,EAAAv2K,EAAA4qC,EAAAlrC,IAAAq3K,EACA,KAAAlb,KAAA,CAAAjuI,EAAA,EAAA2D,SAAAA,EACAwlJ,GAAA,IACAA,GAAA,GACAnpJ,GAAA,EACU,KAAAiuI,KAAA,CAAAjuI,EAAA,EAAA2D,IAAA,IAEVwlJ,GAAA,OAKA,IAAAr3K,EAAAu3K,CADAj3K,EAAA1F,MAAA,CAAAswC,CAAA,EACA,KAAAA,EAAA,EAAAA,CAAA,CAAAlrC,EAAAM,EAAA1F,MAAA,CAAAoF,GAAA,EACA6xB,EAAAglJ,EAAAv2K,EAAA4qC,EAAAlrC,IAAAq3K,EACA,KAAAlb,KAAA,CAAAjuI,EAAA,EAAA2D,SAAAA,EACAwlJ,GAAA,IACAA,GAAA,GACAnpJ,GAAA,EACU,KAAAiuI,KAAA,CAAAjuI,EAAA,EAAA2D,IAAA,IAEVwlJ,GAAA,CAEA,CAGA,KAAAC,MAAA,IA8BAt8H,EAAA7yC,SAAA,CAAAivK,UAAA,UAAA92K,CAAA,CAAA0pC,CAAA,CAAAkB,CAAA,EAEA,KAAAixH,KAAA,UAAAvhK,MAAA,GAIA,QAAA48K,EAAA,EAAAC,EAAA,EAAAA,GAAA,SAAAA,GAAAztI,EACAwtI,GAEAA,CAAAA,IAAAC,EAAA,EAAAztI,EAAA,EAQA,QALAmrG,EAAA70I,EAAA1F,MAAA,CAAAswC,EACA3mB,EAAA4wH,EAAAqiC,EAAAhtJ,EAAA9vB,KAAAorC,GAAA,CAAAqvG,EAAAA,EAAA5wH,GAAA2mB,EAGAwuD,EAAA,EACA15F,EAAAkrC,EAAAlrC,EAAAwqB,EAAAxqB,GAAAw3K,EAAA99E,EAAAq9E,EAAAz2K,EAAAN,EAAAA,EAAAw3K,EAAAxtI,GAGA,KAAA0tI,KAAA,CAAAD,GACA,KAAAtb,KAAA,IAAAziE,EAAA,SACQ,KAAAyiE,KAAA,KAAAziE,EAER,KAAAi+E,MAAA,CAAAj+E,GAIA,GAAAn1E,IAAAA,EAAA,CACA,IAAAy1B,EAAA,EAGA,IAHA0/C,EAAAq9E,EAAAz2K,EAAAN,EAAAM,EAAA1F,MAAA,CAAAovC,GAGAhqC,EAAA,EAAAA,EAAAukB,EAAAvkB,IACAg6C,GAAAhQ,EAGA,KAAA0tI,KAAA,CAAA19H,GACA,KAAAmiH,KAAA,IAAAziE,EAAA,SACQ,KAAAyiE,KAAA,KAAAziE,EAER,KAAAi+E,MAAA,CAAAj+E,EACA,KAGA,CAAA49E,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAoZ,IAAA,UAAApM,CAAA,EACAA,EAAAgnJ,KAAA,OAAoB,KAAAvhK,MAAiB,EACrC,QAAAoF,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IACAmV,EAAAgnJ,KAAA,CAAAn8J,EAAA,MAAAm8J,KAAA,CAAAn8J,EAAA,CAEAmV,EAAAva,MAAA,MAAAA,MAAA,CACAua,EAAAuhK,QAAA,MAAAA,QAAA,CACAvhK,EAAAimB,GAAA,MAAAA,GAAA,EAUA4f,EAAA7yC,SAAA,CAAAyvK,KAAA,UAAAziK,CAAA,EACA6hK,EAAA7hK,EAAA,OAGA6lC,EAAA7yC,SAAA,CAAAwW,KAAA,YACA,IAAA7gB,EAAA,IAAAk9C,EAAA,MAEA,OADA,KAAAz5B,IAAA,CAAAzjB,GACAA,CAAA,EAGAk9C,EAAA7yC,SAAA,CAAA0vK,OAAA,UAAAt9K,CAAA,EACA,UAAAK,MAAA,CAAAL,GACA,KAAA4hK,KAAA,MAAAvhK,MAAA,MAEA,aAIAogD,EAAA7yC,SAAA,CAAAmvK,MAAA,YACA,UAAA18K,MAAA,aAAAuhK,KAAA,MAAAvhK,MAAA,KACA,KAAAA,MAAA,GAEA,YAAAk9K,SAAA,IAGA98H,EAAA7yC,SAAA,CAAA2vK,SAAA,YAKA,OAHA,SAAAl9K,MAAA,WAAAuhK,KAAA,KACA,MAAAua,QAAA,IAEA,MAKA,oBAAA15K,QAAA,mBAAAA,OAAA+6K,GAAA,CACA,IACM/8H,EAAA7yC,SAAA,CAAAnL,OAAA+6K,GAAA,gCAAAr2E,CACN,OAAA3gG,EAAA,CACAi6C,EAAA7yC,SAAA,CAAAu5F,OAAA,CAAAA,CACI,MAEJ1mD,EAAA7yC,SAAA,CAAAu5F,OAAA,CAAAA,CAAA,CAGA,SAAAA,GAAA,CACA,YAAAtmE,GAAA,yBAAAz4B,QAAA,SAiCA,IApXAvI,EAoXA49K,EAAA,CACA,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,6BAGAC,EAAA,CACA,IACA,mBACA,cACA,cACA,cACA,eAGAC,EAAA,CACA,IACA,+DACA,yDACA,yDACA,4DACA,6DAGAl9H,EAAA7yC,SAAA,CAAAxF,QAAA,UAAAqnC,CAAA,CAAAyC,CAAA,EAKA,GAJAA,EAAAA,EAAAA,GAAA,EAIAzC,KAJAA,CAAAA,EAAAA,GAAA,KAIAA,QAAAA,EAAA,CACAolD,EAAA,GAGA,QALAA,EAGAioF,EAAA,EACAnM,EAAA,EACAlrK,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IAAA,CACA,IAAA6xB,EAAA,KAAAsqI,KAAA,CAAAn8J,EAAA,CACA05F,EAAA,KAAA29E,EAAAnM,CAAA,YAAAvoK,QAAA,KACAuoK,EAAA,OAAAmM,EAAA,SACAA,CAAAA,GAAA,IACA,KACAA,GAAA,GACAr3K,KAGUovF,EADV87E,IAAAA,GAAAlrK,IAAA,KAAApF,MAAA,GACUo9K,CAAA,GAAAt+E,EAAA9+F,MAAA,EAAA8+F,EAAAtK,EAEVsK,EAAAtK,CAEA,CAIA,IAHA,IAAA87E,GACA97E,CAAAA,EAAA87E,EAAAvoK,QAAA,KAAAysF,CAAA,EAEAA,EAAAx0F,MAAA,CAAA6xC,GAAA,GACA2iD,EAAA,IAAAA,EAKA,OAHA,SAAAsnF,QAAA,EACAtnF,CAAAA,EAAA,IAAAA,CAAA,EAEAA,CAAA,IAGAplD,IAAAA,CAAAA,EAAAA,CAAA,GAAAA,GAAA,GAAAA,GAAA,IAEA,IAAAssH,EAAA2hB,CAAA,CAAAjuI,EAAA,CAEAmuI,EAAAD,CAAA,CAAAluI,EAAA,CACAolD,EAAA,GACA,IAAA3tC,EAAA,KAAA9iC,KAAA,GAEA,IADA8iC,EAAAi1H,QAAA,GACA,CAAAj1H,EAAAo3G,MAAA,KACA,IAAA/6J,EAAA2jD,EAAA22H,KAAA,CAAAD,GAAAx1K,QAAA,CAAAqnC,GAMAolD,EAHA3tC,CAHAA,EAAAA,EAAA42H,KAAA,CAAAF,EAAA,EAGAtf,MAAA,GAGA/6J,EAAAsxF,EAFU4oF,CAAA,CAAA1hB,EAAAx4J,EAAAlD,MAAA,EAAAkD,EAAAsxF,CAIV,CAIA,IAHA,KAAAypE,MAAA,IACAzpE,CAAAA,EAAA,IAAAA,CAAA,EAEAA,EAAAx0F,MAAA,CAAA6xC,GAAA,GACA2iD,EAAA,IAAAA,EAKA,OAHA,SAAAsnF,QAAA,EACAtnF,CAAAA,EAAA,IAAAA,CAAA,EAEAA,CAAA,GAGA,uCAGAp0C,EAAA7yC,SAAA,CAAA6P,QAAA,YACA,IAAA++D,EAAA,KAAAolF,KAAA,IASA,OARA,SAAAvhK,MAAA,CACMm8E,GAAA,cAAAolF,KAAA,IACN,SAAAvhK,MAAA,WAAAuhK,KAAA,IAEMplF,GAAA,+BAAAolF,KAAA,IACN,KAAAvhK,MAAA,IACA0E,EAAA,iDAEA,SAAAo3K,QAAA,EAAA3/F,EAAAA,CAAA,EAGA/7B,EAAA7yC,SAAA,CAAA+4E,MAAA,YACA,YAAAv+E,QAAA,QAGAvI,GACA4gD,CAAAA,EAAA7yC,SAAA,CAAAsQ,QAAA,UAAAg+J,CAAA,CAAA77K,CAAA,EACA,YAAAurB,WAAA,CAAA/rB,EAAAq8K,EAAA77K,EACA,GAGAogD,EAAA7yC,SAAA,CAAAgZ,OAAA,UAAAs1J,CAAA,CAAA77K,CAAA,EACA,YAAAurB,WAAA,CAAA3rB,MAAAi8K,EAAA77K,EAAA,EAGA,IAAAq7D,EAAA,SAAAqiH,CAAA,CAAA/9K,CAAA,SACA,EAAAojG,WAAA,CACA26E,EAAA36E,WAAA,CAAApjG,GAEA,IAAA+9K,EAAA/9K,EADA,EAyJA,SAAAg+K,EAAAvyJ,CAAA,EAGA,QAHA6L,EAAA,MAAA7L,EAAA46F,SAAA,IAGA43D,EAAA,EAAAA,EAAA3mJ,EAAAj3B,MAAA,CAAA49K,IAAA,CACA,IAAAnB,EAAA,OAAAoB,EAAAD,EAAA,EAGA3mJ,CAAAA,CAAA,CAAA2mJ,EAAA,GAAArc,KAAA,CAAAkb,EAAA,GAAAoB,EAAA,EAGA,OAAA5mJ,CAAA,CAmWA,SAAA6mJ,EAAAz/K,CAAA,CAAA+sB,CAAA,CAAAopE,CAAA,EACAA,EAAAsnF,QAAA,CAAA1wJ,EAAA0wJ,QAAA,CAAAz9K,EAAAy9K,QAAA,CACA,IAAAtjJ,EAAA,EAAAx4B,MAAA,CAAAorB,EAAAprB,MAAA,EACAw0F,CAAAA,EAAAx0F,MAAA,CAAAw4B,EAAAA,EAAA,MAIA,IAAA55B,EAAAP,EAAAA,EAAAkjK,KAAA,IACAzpJ,EAAAsT,EAAAA,EAAAm2I,KAAA,IAAAr+J,EAAAtE,EAAAkZ,EAGAU,EAAAtV,SAAAA,EACAotK,EAAA,YAAA97E,CAAAA,EAAA+sE,KAAA,IAAA/oJ,EAGA,QAAA5U,EAAA,EAAAA,EAAA40B,EAAA50B,IAAA,CAMA,QAHAm6K,EAAAzN,IAAA,GACA0N,EAAA1N,SAAAA,EACA2N,EAAAn+K,KAAAorC,GAAA,CAAAtnC,EAAAwnB,EAAAprB,MAAA,IACAszB,EAAAxzB,KAAAqrC,GAAA,GAAAvnC,EAAAvF,EAAA2B,MAAA,IAAAszB,GAAA2qJ,EAAA3qJ,IAAA,CACA,IAAAluB,EAAA,EAAAkuB,EAAA,EAIAyqJ,GAAA,CADA76K,EAAAtE,CAFAA,EAAAP,EAAAA,EAAAkjK,KAAA,CAAAn8J,EAAA,EACA0S,CAAAA,EAAAsT,EAAAA,EAAAm2I,KAAA,CAAAjuI,EAAA,EACA0qJ,CAAA,EACA,WACAA,EAAA96K,SAAAA,CACA,CACAsxF,EAAA+sE,KAAA,CAAA39J,EAAA,CAAAo6K,EAAAA,EACA1N,EAAAyN,EAAAA,CACA,CAOA,OANAzN,IAAAA,EACM97E,EAAA+sE,KAAA,CAAA39J,EAAA,CAAA0sK,EAAAA,EAEN97E,EAAAx0F,MAAA,GAGAw0F,EAAAkoF,MAAA,GAxiBAt8H,EAAA7yC,SAAA,CAAAge,WAAA,UAAAmyJ,CAAA,CAAA7B,CAAA,CAAA77K,CAAA,OAAA08K,MAAA,GAGA,IAAAx7J,EAAA,KAAAA,UAAA,GACAg9J,EAAAl+K,GAAAF,KAAAqrC,GAAA,GAAAjqB,GACAxc,EAAAwc,GAAAg9J,EAAA,yCAAAx5K,EAAAw5K,EAAA,iCAGA,IAAAz1K,EAAA4yD,EAAAqiH,EAAAQ,GAGA,OADA,oBADArC,CAAAA,OAAAA,EAAA,WACA,CAAApzK,EAAAyY,GACAzY,CAAA,EAGA23C,EAAA7yC,SAAA,CAAA4wK,cAAA,UAAA11K,CAAA,CAAAyY,CAAA,EAIA,QAHAiP,EAAA,EAAAmgJ,EAAA,EAGAlrK,EAAA,EAAAwV,EAAA,EAAAxV,EAAA,KAAApF,MAAA,CAAAoF,IAAA,KAAA05F,EAAA,KAAAyiE,KAAA,CAAAn8J,EAAA,EAAAwV,EAAA01J,CAGA7nK,CAAAA,CAAA,CAAA0nB,IAAA,CAAA2uE,IAAAA,EACA3uE,EAAA1nB,EAAAzI,MAAA,EACAyI,CAAAA,CAAA,CAAA0nB,IAAA,WAEAA,EAAA1nB,EAAAzI,MAAA,EACAyI,CAAAA,CAAA,CAAA0nB,IAAA,YAGAvV,IAAAA,GACAuV,EAAA1nB,EAAAzI,MAAA,EACAyI,CAAAA,CAAA,CAAA0nB,IAAA,YAEAmgJ,EAAA,EACQ11J,EAAA,IAER01J,EAAAxxE,IAAA,GACAlkF,GAAA,EACA,CAGA,GAAAuV,EAAA1nB,EAAAzI,MAAA,CAGA,IAHAyI,CAAA,CAAA0nB,IAAA,CAAAmgJ,EAGAngJ,EAAA1nB,EAAAzI,MAAA,EACAyI,CAAA,CAAA0nB,IAAA,EAEA,EAGAiwB,EAAA7yC,SAAA,CAAA6wK,cAAA,UAAA31K,CAAA,CAAAyY,CAAA,EAIA,QAHAiP,EAAA1nB,EAAAzI,MAAA,GAAAswK,EAAA,EAGAlrK,EAAA,EAAAwV,EAAA,EAAAxV,EAAA,KAAApF,MAAA,CAAAoF,IAAA,KAAA05F,EAAA,KAAAyiE,KAAA,CAAAn8J,EAAA,EAAAwV,EAAA01J,CAGA7nK,CAAAA,CAAA,CAAA0nB,IAAA,CAAA2uE,IAAAA,EACA3uE,GAAA,GACA1nB,CAAAA,CAAA,CAAA0nB,IAAA,WAEAA,GAAA,GACA1nB,CAAAA,CAAA,CAAA0nB,IAAA,YAGAvV,IAAAA,GACAuV,GAAA,GACA1nB,CAAAA,CAAA,CAAA0nB,IAAA,YAEAmgJ,EAAA,EACQ11J,EAAA,IAER01J,EAAAxxE,IAAA,GACAlkF,GAAA,EACA,CAGA,GAAAuV,GAAA,EAGA,IAHA1nB,CAAA,CAAA0nB,IAAA,CAAAmgJ,EAGAngJ,GAAA,GACA1nB,CAAA,CAAA0nB,IAAA,EAEA,EAGArwB,KAAAu+K,KAAA,CACAj+H,EAAA7yC,SAAA,CAAA+wK,UAAA,UAAArnJ,CAAA,EACA,UAAAn3B,KAAAu+K,KAAA,CAAApnJ,EACI,EAEJmpB,EAAA7yC,SAAA,CAAA+wK,UAAA,UAAArnJ,CAAA,EACA,IAAAhzB,EAAAgzB,EACA/zB,EAAA,EAiBA,OAhBAe,GAAA,OACAf,GAAA,GACAe,KAAA,IAEAA,GAAA,KACAf,GAAA,EACAe,KAAA,GAEAA,GAAA,IACAf,GAAA,EACAe,KAAA,GAEAA,GAAA,IACAf,GAAA,EACAe,KAAA,GAEAf,EAAAe,CACA,EAGAm8C,EAAA7yC,SAAA,CAAAgxK,SAAA,UAAAtnJ,CAAA,EACA,GAAAA,IAAAA,EAAA,UAGA,IAAAhzB,EAAAgzB,EACA/zB,EAAA,EAoBA,MAnBAe,CAAAA,KAAAA,CAAA,OACAf,GAAA,GACAe,KAAA,IAEAA,CAAAA,IAAAA,CAAA,OACAf,GAAA,EACAe,KAAA,GAEAA,CAAAA,GAAAA,CAAA,OACAf,GAAA,EACAe,KAAA,GAEAA,CAAAA,EAAAA,CAAA,OACAf,GAAA,EACAe,KAAA,GAEAA,CAAAA,EAAAA,CAAA,MACAf,IAEAA,CAAA,EAIAk9C,EAAA7yC,SAAA,CAAAy4G,SAAA,YACA,IAAA/uF,EAAA,KAAAsqI,KAAA,MAAAvhK,MAAA,IACA6nG,EAAA,KAAAy2E,UAAA,CAAArnJ,GACA,YAAAj3B,MAAA,OAAA6nG,CAAA,EAiBAznD,EAAA7yC,SAAA,CAAAixK,QAAA,oBAAAvgB,MAAA,YAIA,QADA/6J,EAAA,EACAkC,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IAAA,CACA,IAAA0S,EAAA,KAAAymK,SAAA,MAAAhd,KAAA,CAAAn8J,EAAA,EAEA,GADAlC,GAAA4U,EACAA,KAAAA,EAAA,MAEA,OAAA5U,CAAA,EAGAk9C,EAAA7yC,SAAA,CAAA2T,UAAA,YACA,OAAAphB,KAAAC,IAAA,MAAAimH,SAAA,OAGA5lE,EAAA7yC,SAAA,CAAA+d,MAAA,UAAA+qB,CAAA,SACA,SAAAylI,QAAA,CACA,KAAAjtJ,GAAA,GAAA4vJ,KAAA,CAAApoI,GAAAqoI,KAAA,IAEA,KAAA36J,KAAA,EADA,EAIAq8B,EAAA7yC,SAAA,CAAA8d,QAAA,UAAAgrB,CAAA,SACA,KAAAsoI,KAAA,CAAAtoI,EAAA,GACA,KAAAuoI,IAAA,CAAAvoI,GAAAqoI,KAAA,IAAAG,IAAA,GAEA,KAAA96J,KAAA,EADA,EAIAq8B,EAAA7yC,SAAA,CAAAiyC,KAAA,YACA,gBAAAs8H,QAAA,EAIA17H,EAAA7yC,SAAA,CAAAi2G,GAAA,YACA,YAAAz/F,KAAA,GAAA86J,IAAA,IAGAz+H,EAAA7yC,SAAA,CAAAsxK,IAAA,YAKA,OAJA,KAAA5gB,MAAA,IACA,MAAA6d,QAAA,KAGA,MAIA17H,EAAA7yC,SAAA,CAAAuxK,IAAA,UAAA1zJ,CAAA,EACA,UAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,EACA,KAAAuhK,KAAA,MAAAvhK,MAAA,MAGA,QAAAoF,EAAA,EAAAA,EAAAgmB,EAAAprB,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,MAAAm8J,KAAA,CAAAn8J,EAAA,CAAAgmB,EAAAm2I,KAAA,CAAAn8J,EAAA,CAGA,YAAAs3K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAwxK,GAAA,UAAA3zJ,CAAA,EAEA,OADA1mB,EAAA,MAAAo3K,QAAA,CAAA1wJ,EAAA0wJ,QAAA,MACA,KAAAgD,IAAA,CAAA1zJ,EAAA,EAIAg1B,EAAA7yC,SAAA,CAAAyxK,EAAA,UAAA5zJ,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAAg7J,GAAA,CAAA3zJ,GACAA,EAAArH,KAAA,GAAAg7J,GAAA,MADA,EAIA3+H,EAAA7yC,SAAA,CAAA0xK,GAAA,UAAA7zJ,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAA+6J,IAAA,CAAA1zJ,GACAA,EAAArH,KAAA,GAAA+6J,IAAA,MADA,EAKA1+H,EAAA7yC,SAAA,CAAA2xK,KAAA,UAAA9zJ,CAAA,EAEA,IAAAtT,EAEMA,EADN,KAAA9X,MAAA,CAAAorB,EAAAprB,MAAA,CACMorB,EAEN,KAGA,QAAAhmB,EAAA,EAAAA,EAAA0S,EAAA9X,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,MAAAm8J,KAAA,CAAAn8J,EAAA,CAAAgmB,EAAAm2I,KAAA,CAAAn8J,EAAA,CAKA,OAHA,KAAApF,MAAA,CAAA8X,EAAA9X,MAAA,CAGA,KAAA08K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAA4xK,IAAA,UAAA/zJ,CAAA,EAEA,OADA1mB,EAAA,MAAAo3K,QAAA,CAAA1wJ,EAAA0wJ,QAAA,MACA,KAAAoD,KAAA,CAAA9zJ,EAAA,EAIAg1B,EAAA7yC,SAAA,CAAA6xK,GAAA,UAAAh0J,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAAo7J,IAAA,CAAA/zJ,GACAA,EAAArH,KAAA,GAAAo7J,IAAA,MADA,EAIA/+H,EAAA7yC,SAAA,CAAA8xK,IAAA,UAAAj0J,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAAm7J,KAAA,CAAA9zJ,GACAA,EAAArH,KAAA,GAAAm7J,KAAA,MADA,EAKA9+H,EAAA7yC,SAAA,CAAA+xK,KAAA,UAAAl0J,CAAA,EAIA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,EACApB,EAAA,KACMkZ,EAAAsT,IAENxsB,EAAAwsB,EACAtT,EAAA,MAGA,QAVAlZ,EACAkZ,EASA1S,EAAA,EAAAA,EAAA0S,EAAA9X,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,CAAAxG,EAAA2iK,KAAA,CAAAn8J,EAAA,CAAA0S,EAAAypJ,KAAA,CAAAn8J,EAAA,CAGA,UAAaxG,EACb,KAAAwG,EAAAxG,EAAAoB,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,CAAAxG,EAAA2iK,KAAA,CAAAn8J,EAAA,CAMA,OAHA,KAAApF,MAAA,CAAApB,EAAAoB,MAAA,CAGA,KAAA08K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAgyK,IAAA,UAAAn0J,CAAA,EAEA,OADA1mB,EAAA,MAAAo3K,QAAA,CAAA1wJ,EAAA0wJ,QAAA,MACA,KAAAwD,KAAA,CAAAl0J,EAAA,EAIAg1B,EAAA7yC,SAAA,CAAAiyK,GAAA,UAAAp0J,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAAw7J,IAAA,CAAAn0J,GACAA,EAAArH,KAAA,GAAAw7J,IAAA,MADA,EAIAn/H,EAAA7yC,SAAA,CAAAkyK,IAAA,UAAAr0J,CAAA,SACA,KAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAAu7J,KAAA,CAAAl0J,GACAA,EAAArH,KAAA,GAAAu7J,KAAA,MADA,EAKAl/H,EAAA7yC,SAAA,CAAAkxK,KAAA,UAAApoI,CAAA,EAAA3xC,EAAA,iBAAA2xC,GAAAA,GAAA,GAGA,IAAAqpI,EAAA5/K,EAAAA,KAAAC,IAAA,CAAAs2C,EAAA,IAAAspI,EAAAtpI,EAAA,GAGA,KAAA4mI,OAAA,CAAAyC,GAGAC,EAAA,GACAD,IAIA,QAAAt6K,EAAA,EAAAA,EAAAs6K,EAAAt6K,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,gBAAAm8J,KAAA,CAAAn8J,EAAA,CASA,OALAu6K,EAAA,GACA,MAAApe,KAAA,CAAAn8J,EAAA,OAAAm8J,KAAA,CAAAn8J,EAAA,cAAAu6K,CAAA,EAIA,KAAAjD,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAqxK,IAAA,UAAAvoI,CAAA,EACA,YAAAtyB,KAAA,GAAA06J,KAAA,CAAApoI,EAAA,EAIA+J,EAAA7yC,SAAA,CAAAqyK,IAAA,UAAAhC,CAAA,CAAAzxI,CAAA,EAAAznC,EAAA,iBAAAk5K,GAAAA,GAAA,GAGA,IAAAnB,EAAA,OAAAoB,EAAAD,EAAA,GAWA,OATA,KAAAX,OAAA,CAAAR,EAAA,GAGAtwI,EACM,KAAAo1H,KAAA,CAAAkb,EAAA,MAAAlb,KAAA,CAAAkb,EAAA,IAAAoB,EAEN,KAAAtc,KAAA,CAAAkb,EAAA,MAAAlb,KAAA,CAAAkb,EAAA,MAAAoB,CAAA,EAGA,KAAAnB,MAAA,IAIAt8H,EAAA7yC,SAAA,CAAAsyK,IAAA,UAAAz0J,CAAA,EAIA,YAAA0wJ,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,CAGA,OAFA,KAAAA,QAAA,GACA54K,EAAA,KAAA48K,IAAA,CAAA10J,GACA,KAAA0wJ,QAAA,SAAAoB,SAAA,EAQA,CAJA,YAAApB,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,CAIA,OAHA1wJ,EAAA0wJ,QAAA,GACA54K,EAAA,KAAA48K,IAAA,CAAA10J,GACAA,EAAA0wJ,QAAA,GACA54K,EAAAg6K,SAAA,GAKA,KAAAl9K,MAAA,CAAAorB,EAAAprB,MAAA,EACApB,EAAA,KACMkZ,EAAAsT,IAENxsB,EAAAwsB,EACAtT,EAAA,MAIA,QA7BA5U,EAmBAtE,EAAAkZ,EASAw4J,EAAA,EACAlrK,EAAA,EAAAA,EAAA0S,EAAA9X,MAAA,CAAAoF,IACAlC,EAAA,CAAAtE,EAAAA,EAAA2iK,KAAA,CAAAn8J,EAAA,EAAA0S,CAAAA,EAAAA,EAAAypJ,KAAA,CAAAn8J,EAAA,EAAAkrK,EACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAlC,SAAAA,EACAotK,EAAAptK,IAAA,GAEA,KAAAotK,IAAAA,GAAAlrK,EAAAxG,EAAAoB,MAAA,CAAAoF,IACAlC,EAAA,CAAAtE,EAAAA,EAAA2iK,KAAA,CAAAn8J,EAAA,EAAAkrK,EACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAlC,SAAAA,EACAotK,EAAAptK,IAAA,GAIA,GADA,KAAAlD,MAAA,CAAApB,EAAAoB,MAAA,CACAswK,IAAAA,EACA,KAAA/O,KAAA,MAAAvhK,MAAA,EAAAswK,EACA,KAAAtwK,MAAA,QAEA,GAAapB,IAAA,KACb,KAAAwG,EAAAxG,EAAAoB,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,CAAAxG,EAAA2iK,KAAA,CAAAn8J,EAAA,CAIA,aAIAg7C,EAAA7yC,SAAA,CAAAlJ,GAAA,UAAA+mB,CAAA,EACA,IAAA3iB,SACA,IAAA2iB,EAAA0wJ,QAAA,WAAAA,QAAA,EACA1wJ,EAAA0wJ,QAAA,GACArzK,EAAA,KAAA43C,GAAA,CAAAj1B,GACAA,EAAA0wJ,QAAA,IACMrzK,GACN2iB,IAAAA,EAAA0wJ,QAAA,WAAAA,QAAA,EACA,KAAAA,QAAA,GACArzK,EAAA2iB,EAAAi1B,GAAA,OACA,KAAAy7H,QAAA,GACArzK,GAEA,KAAAzI,MAAA,CAAAorB,EAAAprB,MAAA,MAAA+jB,KAAA,GAAA87J,IAAA,CAAAz0J,GAGAA,EAAArH,KAAA,GAAA87J,IAAA,MALA,EASAz/H,EAAA7yC,SAAA,CAAAuyK,IAAA,UAAA10J,CAAA,EAEA,GAAAA,IAAAA,EAAA0wJ,QAAA,EACA1wJ,EAAA0wJ,QAAA,GACA,IAwBAl9K,EAAAkZ,EAxBA5U,EAAA,KAAA28K,IAAA,CAAAz0J,GACA,OAAAA,EAAA0wJ,QAAA,GAAA54K,EAAAg6K,SAAA,EAIA,CAIA,GAJA,SAAApB,QAAA,CAIA,OAHA,KAAAA,QAAA,GACA,KAAA+D,IAAA,CAAAz0J,GACA,KAAA0wJ,QAAA,GACA,KAAAoB,SAAA,GAGA,IAAA3K,EAAA,KAAAA,GAAA,CAAAnnJ,GAIA,GAAAmnJ,IAAAA,EAIA,OAHA,KAAAuJ,QAAA,GACA,KAAA97K,MAAA,GACA,KAAAuhK,KAAA,MACA,KAKAgR,EAAA,GACA3zK,EAAA,KACMkZ,EAAAsT,IAENxsB,EAAAwsB,EACAtT,EAAA,MAIA,QADAw4J,EAAA,EACAlrK,EAAA,EAAAA,EAAA0S,EAAA9X,MAAA,CAAAoF,IAEAkrK,EAAAptK,CADAA,EAAA,CAAAtE,EAAAA,EAAA2iK,KAAA,CAAAn8J,EAAA,EAAA0S,CAAAA,EAAAA,EAAAypJ,KAAA,CAAAn8J,EAAA,EAAAkrK,CAAA,GACA,GACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAlC,SAAAA,EAEA,KAAAotK,IAAAA,GAAAlrK,EAAAxG,EAAAoB,MAAA,CAAAoF,IAEAkrK,EAAAptK,CADAA,EAAA,CAAAtE,EAAAA,EAAA2iK,KAAA,CAAAn8J,EAAA,EAAAkrK,CAAA,GACA,GACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAlC,SAAAA,EAIA,GAAAotK,IAAAA,GAAalrK,EAAcxG,EAAAoB,MAAA,EAAApB,IAAA,KAC3B,KAAAwG,EAAAxG,EAAAoB,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,CAAAxG,EAAA2iK,KAAA,CAAAn8J,EAAA,CAUA,OAPA,KAAApF,MAAA,CAAAF,KAAAqrC,GAAA,MAAAnrC,MAAA,CAAAoF,GAGAxG,IAAA,MACA,MAAAk9K,QAAA,IAGA,KAAAY,MAAA,IAIAt8H,EAAA7yC,SAAA,CAAA8yC,GAAA,UAAAj1B,CAAA,EACA,YAAArH,KAAA,GAAA+7J,IAAA,CAAA10J,EAAA,EA+CA,IAAA20J,EAAA,SAAA1hL,CAAA,CAAA+sB,CAAA,CAAAopE,CAAA,EACA,IAIAh8E,EACAwnK,EACAn4E,EANAjpG,EAAAP,EAAAkjK,KAAA,CACAzpJ,EAAAsT,EAAAm2I,KAAA,CACA9iH,EAAA+1C,EAAA+sE,KAAA,CACA16G,EAAA,EAIAo5H,EAAArhL,EAAAA,CAAA,IACAshL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACA/8C,EAAAtkI,EAAAA,CAAA,IACAwhL,EAAAl9C,KAAAA,EACAm9C,EAAAn9C,IAAA,GACAE,EAAAxkI,EAAAA,CAAA,IACA0hL,EAAAl9C,KAAAA,EACAm9C,EAAAn9C,IAAA,GACAo9C,EAAA5hL,EAAAA,CAAA,IACA6hL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAA/hL,EAAAA,CAAA,IACAgiL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAAliL,EAAAA,CAAA,IACAmiL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAAriL,EAAAA,CAAA,IACAsiL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAAxiL,EAAAA,CAAA,IACAyiL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAA3iL,EAAAA,CAAA,IACA4iL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAA9iL,EAAAA,CAAA,IACA+iL,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACAG,EAAA/pK,EAAAA,CAAA,IACAgqK,EAAAD,KAAAA,EACAE,EAAAF,IAAA,GACA1+C,EAAArrH,EAAAA,CAAA,IACAkqK,EAAA7+C,KAAAA,EACA8+C,EAAA9+C,IAAA,GACAnU,EAAAl3G,EAAAA,CAAA,IACAoqK,EAAAlzD,KAAAA,EACAmzD,EAAAnzD,IAAA,GACA8N,EAAAhlH,EAAAA,CAAA,IACAsqK,EAAAtlD,KAAAA,EACAulD,EAAAvlD,IAAA,GACA7N,EAAAn3G,EAAAA,CAAA,IACAwqK,EAAArzD,KAAAA,EACAszD,GAAAtzD,IAAA,GACAC,GAAAp3G,EAAAA,CAAA,IACA0qK,GAAAtzD,KAAAA,GACAuzD,GAAAvzD,KAAA,GACAqT,GAAAzqH,EAAAA,CAAA,IACA4qK,GAAAngD,KAAAA,GACAogD,GAAApgD,KAAA,GACAqgD,GAAA9qK,EAAAA,CAAA,IACA+qK,GAAAD,KAAAA,GACAE,GAAAF,KAAA,GACAG,GAAAjrK,EAAAA,CAAA,IACAkrK,GAAAD,KAAAA,GACAE,GAAAF,KAAA,GACAvgD,GAAA1qH,EAAAA,CAAA,IACAorK,GAAA1gD,KAAAA,GAAA2gD,GAAA3gD,KAAA,EAGAhuC,CAAAA,EAAAsnF,QAAA,CAAAz9K,EAAAy9K,QAAA,CAAA1wJ,EAAA0wJ,QAAA,CACAtnF,EAAAx0F,MAAA,IAMA,IAAAojL,GAAA,GAJA5qK,CAAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAA4B,EAAA,EAIA,KAAA9B,KAFAA,CAAAA,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAA6B,EAAA,EACAjiL,KAAAujL,IAAA,CAAAlD,EAAA2B,GAAA,EAEA,SACAj7H,EAAA,EAFAghD,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAA4B,EAAA,EAEA/B,CAAAA,IAAA,OAAAoD,CAAAA,KAAA,MACAA,IAAA,SAEA5qK,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAA0B,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA2B,EAAA,EACAjiL,KAAAujL,IAAA,CAAAhD,EAAAyB,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAA0B,GAKA,IAAAuB,GAAA,GAJA9qK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAA8B,GAAA,GAIA,KAAAhC,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAA+B,GAAA,GACAniL,KAAAujL,IAAA,CAAAlD,EAAA6B,GAAA,EAEA,SACAn7H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAA8B,GAAA,GAEAjC,CAAAA,IAAA,OAAAsD,CAAAA,KAAA,MACAA,IAAA,SAEA9qK,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAAwB,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAAyB,EAAA,EACAjiL,KAAAujL,IAAA,CAAA9C,EAAAuB,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAAwB,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAA4B,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA6B,GAAA,GACAniL,KAAAujL,IAAA,CAAAhD,EAAA2B,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAA4B,GAAA,EAKA,IAAAsB,GAAA,GAJA/qK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAgC,GAAA,GAIA,KAAAlC,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAiC,GAAA,GACAriL,KAAAujL,IAAA,CAAAlD,EAAA+B,GAAA,EAEA,SACAr7H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAgC,GAAA,GAEAnC,CAAAA,IAAA,OAAAuD,CAAAA,KAAA,MACAA,IAAA,SAEA/qK,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAqB,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAsB,EAAA,EACAjiL,KAAAujL,IAAA,CAAA3C,EAAAoB,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAqB,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAA0B,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAA2B,GAAA,GACAniL,KAAAujL,IAAA,CAAA9C,EAAAyB,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAA0B,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAA8B,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA+B,GAAA,GACAriL,KAAAujL,IAAA,CAAAhD,EAAA6B,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAA8B,GAAA,EAKA,IAAAqB,GAAA,GAJAhrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAkC,GAAA,GAIA,KAAApC,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAmC,GAAA,GACAviL,KAAAujL,IAAA,CAAAlD,EAAAiC,GAAA,EAEA,SACAv7H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAkC,GAAA,GAEArC,CAAAA,IAAA,OAAAwD,CAAAA,KAAA,MACAA,IAAA,SAEAhrK,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAkB,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAmB,EAAA,EACAjiL,KAAAujL,IAAA,CAAAxC,EAAAiB,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAkB,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAuB,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAwB,GAAA,GACAniL,KAAAujL,IAAA,CAAA3C,EAAAsB,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAuB,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAA4B,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAA6B,GAAA,GACAriL,KAAAujL,IAAA,CAAA9C,EAAA2B,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAA4B,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAAgC,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAAiC,GAAA,GACAviL,KAAAujL,IAAA,CAAAhD,EAAA+B,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAAgC,GAAA,EAKA,IAAAoB,GAAA,GAJAjrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAoC,GAAA,GAIA,KAAAtC,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAqC,IAAA,GACAziL,KAAAujL,IAAA,CAAAlD,EAAAmC,GAAA,EAEA,SACAz7H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAoC,IAAA,GAEAvC,CAAAA,IAAA,OAAAyD,CAAAA,KAAA,MACAA,IAAA,SAEAjrK,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAe,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAgB,EAAA,EACAjiL,KAAAujL,IAAA,CAAArC,EAAAc,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAe,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAoB,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAqB,GAAA,GACAniL,KAAAujL,IAAA,CAAAxC,EAAAmB,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAoB,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAyB,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAA0B,GAAA,GACAriL,KAAAujL,IAAA,CAAA3C,EAAAwB,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAyB,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAA8B,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAA+B,GAAA,GACAviL,KAAAujL,IAAA,CAAA9C,EAAA6B,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAA8B,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAAkC,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAAmC,IAAA,GACAziL,KAAAujL,IAAA,CAAAhD,EAAAiC,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAAkC,IAAA,EAKA,IAAAmB,GAAA,GAJAlrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAsC,IAAA,GAIA,KAAAxC,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAuC,IAAA,GACA3iL,KAAAujL,IAAA,CAAAlD,EAAAqC,IAAA,EAEA,SACA37H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAsC,IAAA,GAEAzC,CAAAA,IAAA,OAAA0D,CAAAA,KAAA,MACAA,IAAA,SAEAlrK,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAY,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAa,EAAA,EACAjiL,KAAAujL,IAAA,CAAAlC,EAAAW,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAY,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAiB,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAkB,GAAA,GACAniL,KAAAujL,IAAA,CAAArC,EAAAgB,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAiB,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAsB,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAuB,GAAA,GACAriL,KAAAujL,IAAA,CAAAxC,EAAAqB,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAsB,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAA2B,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAA4B,GAAA,GACAviL,KAAAujL,IAAA,CAAA3C,EAAA0B,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAA2B,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAAgC,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAAiC,IAAA,GACAziL,KAAAujL,IAAA,CAAA9C,EAAA+B,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAAgC,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAAoC,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAAqC,IAAA,GACA3iL,KAAAujL,IAAA,CAAAhD,EAAAmC,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAAoC,IAAA,EAKA,IAAAkB,GAAA,GAJAnrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAwC,IAAA,GAIA,KAAA1C,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAyC,IAAA,GACA7iL,KAAAujL,IAAA,CAAAlD,EAAAuC,IAAA,EAEA,SACA77H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAwC,IAAA,GAEA3C,CAAAA,IAAA,OAAA2D,CAAAA,KAAA,MACAA,IAAA,SAEAnrK,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAS,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAU,EAAA,EACAjiL,KAAAujL,IAAA,CAAA/B,EAAAQ,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAS,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAc,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAe,GAAA,GACAniL,KAAAujL,IAAA,CAAAlC,EAAAa,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAc,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAmB,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAoB,GAAA,GACAriL,KAAAujL,IAAA,CAAArC,EAAAkB,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAmB,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAwB,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAyB,GAAA,GACAviL,KAAAujL,IAAA,CAAAxC,EAAAuB,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAwB,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAA6B,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAA8B,IAAA,GACAziL,KAAAujL,IAAA,CAAA3C,EAAA4B,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAA6B,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAAkC,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAAmC,IAAA,GACA3iL,KAAAujL,IAAA,CAAA9C,EAAAiC,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAAkC,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAAsC,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAAuC,IAAA,GACA7iL,KAAAujL,IAAA,CAAAhD,EAAAqC,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAAsC,IAAA,EAKA,IAAAiB,GAAA,GAJAprK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAA2C,IAAA,GAIA,KAAA7C,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAA4C,IAAA,GACAhjL,KAAAujL,IAAA,CAAAlD,EAAA0C,IAAA,EAEA,SACAh8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAA2C,IAAA,GAEA9C,CAAAA,IAAA,OAAA4D,CAAAA,KAAA,MACAA,IAAA,SAEAprK,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAM,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAO,EAAA,EACAjiL,KAAAujL,IAAA,CAAA5B,EAAAK,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAM,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAW,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAY,GAAA,GACAniL,KAAAujL,IAAA,CAAA/B,EAAAU,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAW,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAgB,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAiB,GAAA,GACAriL,KAAAujL,IAAA,CAAAlC,EAAAe,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAgB,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAqB,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAsB,GAAA,GACAviL,KAAAujL,IAAA,CAAArC,EAAAoB,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAqB,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAA0B,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAA2B,IAAA,GACAziL,KAAAujL,IAAA,CAAAxC,EAAAyB,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAA0B,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAA+B,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAgC,IAAA,GACA3iL,KAAAujL,IAAA,CAAA3C,EAAA8B,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAA+B,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAAoC,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAAqC,IAAA,GACA7iL,KAAAujL,IAAA,CAAA9C,EAAAmC,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAAoC,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAAyC,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA0C,IAAA,GACAhjL,KAAAujL,IAAA,CAAAhD,EAAAwC,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAAyC,IAAA,EAKA,IAAAe,GAAA,GAJArrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAA8C,IAAA,GAIA,KAAAhD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAA+C,IAAA,GACAnjL,KAAAujL,IAAA,CAAAlD,EAAA6C,IAAA,EAEA,SACAn8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAA8C,IAAA,GAEAjD,CAAAA,IAAA,OAAA6D,CAAAA,KAAA,MACAA,IAAA,SAEArrK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAG,GAEA9B,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAI,EAAA,EACAjiL,KAAAujL,IAAA,CAAAzB,EAAAE,GAAA,EACAj6E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAG,GACAvpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAQ,GAAA,EAEAhC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAS,GAAA,GACAniL,KAAAujL,IAAA,CAAA5B,EAAAO,GAAA,EACAn6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAQ,GAAA,EACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAa,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAc,GAAA,GACAriL,KAAAujL,IAAA,CAAA/B,EAAAY,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAa,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAkB,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAmB,GAAA,GACAviL,KAAAujL,IAAA,CAAAlC,EAAAiB,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAkB,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAuB,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAwB,IAAA,GACAziL,KAAAujL,IAAA,CAAArC,EAAAsB,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAuB,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAA4B,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAA6B,IAAA,GACA3iL,KAAAujL,IAAA,CAAAxC,EAAA2B,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAA4B,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAiC,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAkC,IAAA,GACA7iL,KAAAujL,IAAA,CAAA3C,EAAAgC,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAiC,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAAuC,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAAwC,IAAA,GACAhjL,KAAAujL,IAAA,CAAA9C,EAAAsC,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAAuC,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAA4C,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA6C,IAAA,GACAnjL,KAAAujL,IAAA,CAAAhD,EAAA2C,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAA4C,IAAA,EAKA,IAAAa,GAAA,GAJAtrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnD,EAAAgD,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnD,EAAAiD,IAAA,GACArjL,KAAAujL,IAAA,CAAAlD,EAAA+C,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlD,EAAAgD,IAAA,GAEAnD,CAAAA,IAAA,OAAA8D,CAAAA,KAAA,MACAA,IAAA,SAEAtrK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAK,GAEAhC,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAM,EAAA,EACAniL,KAAAujL,IAAA,CAAAzB,EAAAI,GAAA,EACAn6E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAK,GACAzpK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAU,GAAA,EAEAlC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAW,GAAA,GACAriL,KAAAujL,IAAA,CAAA5B,EAAAS,GAAA,EACAr6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAU,GAAA,EACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAe,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAgB,GAAA,GACAviL,KAAAujL,IAAA,CAAA/B,EAAAc,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAe,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAoB,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAqB,IAAA,GACAziL,KAAAujL,IAAA,CAAAlC,EAAAmB,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAoB,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAyB,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAA0B,IAAA,GACA3iL,KAAAujL,IAAA,CAAArC,EAAAwB,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAyB,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAA8B,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAA+B,IAAA,GACA7iL,KAAAujL,IAAA,CAAAxC,EAAA6B,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAA8B,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAoC,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAqC,IAAA,GACAhjL,KAAAujL,IAAA,CAAA3C,EAAAmC,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAoC,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAA0C,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAA2C,IAAA,GACAnjL,KAAAujL,IAAA,CAAA9C,EAAAyC,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAA0C,IAAA,EAKA,IAAAc,GAAA,GAJAvrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAjD,EAAA8C,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAjD,EAAA+C,IAAA,GACArjL,KAAAujL,IAAA,CAAAhD,EAAA6C,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAhD,EAAA8C,IAAA,GAEAnD,CAAAA,IAAA,OAAA+D,CAAAA,KAAA,MACAA,IAAA,SAEAvrK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAO,GAEAlC,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAQ,EAAA,EACAriL,KAAAujL,IAAA,CAAAzB,EAAAM,GAAA,EACAr6E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAO,GACA3pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAY,GAAA,EAEApC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAa,GAAA,GACAviL,KAAAujL,IAAA,CAAA5B,EAAAW,GAAA,EACAv6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAY,GAAA,EACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAiB,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAkB,IAAA,GACAziL,KAAAujL,IAAA,CAAA/B,EAAAgB,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAiB,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAsB,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAuB,IAAA,GACA3iL,KAAAujL,IAAA,CAAAlC,EAAAqB,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAsB,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAA2B,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAA4B,IAAA,GACA7iL,KAAAujL,IAAA,CAAArC,EAAA0B,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAA2B,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAiC,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAkC,IAAA,GACAhjL,KAAAujL,IAAA,CAAAxC,EAAAgC,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAiC,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAuC,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAAwC,IAAA,GACAnjL,KAAAujL,IAAA,CAAA3C,EAAAsC,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAuC,IAAA,EAKA,IAAAe,GAAA,GAJAxrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA/C,EAAA4C,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA/C,EAAA6C,IAAA,GACArjL,KAAAujL,IAAA,CAAA9C,EAAA2C,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA9C,EAAA4C,IAAA,GAEAnD,CAAAA,IAAA,OAAAgE,CAAAA,KAAA,MACAA,IAAA,SAEAxrK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAS,GAEApC,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAU,EAAA,EACAviL,KAAAujL,IAAA,CAAAzB,EAAAQ,GAAA,EACAv6E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAS,GACA7pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAc,GAAA,EAEAtC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAe,IAAA,GACAziL,KAAAujL,IAAA,CAAA5B,EAAAa,GAAA,EACAz6E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAc,IAAA,EACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAmB,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAoB,IAAA,GACA3iL,KAAAujL,IAAA,CAAA/B,EAAAkB,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAmB,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAwB,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAyB,IAAA,GACA7iL,KAAAujL,IAAA,CAAAlC,EAAAuB,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAwB,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAA8B,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAA+B,IAAA,GACAhjL,KAAAujL,IAAA,CAAArC,EAAA6B,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAA8B,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAoC,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAqC,IAAA,GACAnjL,KAAAujL,IAAA,CAAAxC,EAAAmC,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAoC,IAAA,EAKA,IAAAgB,GAAA,GAJAzrK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA5C,EAAAyC,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA5C,EAAA0C,IAAA,GACArjL,KAAAujL,IAAA,CAAA3C,EAAAwC,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA3C,EAAAyC,IAAA,GAEAnD,CAAAA,IAAA,OAAAiE,CAAAA,KAAA,MACAA,IAAA,SAEAzrK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAW,GAEAtC,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAY,GAAA,EACAziL,KAAAujL,IAAA,CAAAzB,EAAAU,GAAA,EACAz6E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAW,IACA/pK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAgB,IAAA,EAEAxC,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAiB,IAAA,GACA3iL,KAAAujL,IAAA,CAAA5B,EAAAe,IAAA,EACA36E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAgB,IAAA,EACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAqB,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAsB,IAAA,GACA7iL,KAAAujL,IAAA,CAAA/B,EAAAoB,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAqB,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAA2B,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAA4B,IAAA,GACAhjL,KAAAujL,IAAA,CAAAlC,EAAA0B,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAA2B,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAiC,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAkC,IAAA,GACAnjL,KAAAujL,IAAA,CAAArC,EAAAgC,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAiC,IAAA,EAKA,IAAAiB,GAAA,GAJA1rK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAzC,EAAAsC,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAzC,EAAAuC,IAAA,GACArjL,KAAAujL,IAAA,CAAAxC,EAAAqC,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAxC,EAAAsC,IAAA,GAEAnD,CAAAA,IAAA,OAAAkE,CAAAA,KAAA,MACAA,IAAA,SAEA1rK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAa,IAEAxC,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAc,GAAA,EACA3iL,KAAAujL,IAAA,CAAAzB,EAAAY,IAAA,EACA36E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAa,IACAjqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAkB,IAAA,EAEA1C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAmB,IAAA,GACA7iL,KAAAujL,IAAA,CAAA5B,EAAAiB,IAAA,EACA76E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAkB,IAAA,EACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAAwB,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAAyB,IAAA,GACAhjL,KAAAujL,IAAA,CAAA/B,EAAAuB,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAAwB,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAA8B,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAA+B,IAAA,GACAnjL,KAAAujL,IAAA,CAAAlC,EAAA6B,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAA8B,IAAA,EAKA,IAAAkB,GAAA,GAJA3rK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAtC,EAAAmC,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAtC,EAAAoC,IAAA,GACArjL,KAAAujL,IAAA,CAAArC,EAAAkC,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAArC,EAAAmC,IAAA,GAEAnD,CAAAA,IAAA,OAAAmE,CAAAA,KAAA,MACAA,IAAA,SAEA3rK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAe,IAEA1C,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAgB,GAAA,EACA7iL,KAAAujL,IAAA,CAAAzB,EAAAc,IAAA,EACA76E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAe,IACAnqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAqB,IAAA,EAEA7C,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAsB,IAAA,GACAhjL,KAAAujL,IAAA,CAAA5B,EAAAoB,IAAA,EACAh7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAqB,IAAA,EACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAA2B,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAA4B,IAAA,GACAnjL,KAAAujL,IAAA,CAAA/B,EAAA0B,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAA2B,IAAA,EAKA,IAAAmB,GAAA,GAJA5rK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAnC,EAAAgC,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAnC,EAAAiC,IAAA,GACArjL,KAAAujL,IAAA,CAAAlC,EAAA+B,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAAlC,EAAAgC,IAAA,GAEAnD,CAAAA,IAAA,OAAAoE,CAAAA,KAAA,MACAA,IAAA,SAEA5rK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAkB,IAEA7C,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAmB,GAAA,EACAhjL,KAAAujL,IAAA,CAAAzB,EAAAiB,IAAA,EACAh7E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAkB,IACAtqK,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAAwB,IAAA,EAEAhD,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAAyB,IAAA,GACAnjL,KAAAujL,IAAA,CAAA5B,EAAAuB,IAAA,EACAn7E,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAAwB,IAAA,EAKA,IAAAoB,GAAA,GAJA7rK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAAhC,EAAA6B,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAAhC,EAAA8B,IAAA,GACArjL,KAAAujL,IAAA,CAAA/B,EAAA4B,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA/B,EAAA6B,IAAA,GAEAnD,CAAAA,IAAA,OAAAqE,CAAAA,KAAA,MACAA,IAAA,SAEA7rK,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAqB,IAEAhD,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAsB,GAAA,EACAnjL,KAAAujL,IAAA,CAAAzB,EAAAoB,IAAA,EACAn7E,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAqB,IAKA,IAAAqB,GAAA,GAJA9rK,CAAAA,EAAA,EAAA1Y,KAAAujL,IAAA,CAAA7B,EAAA0B,IAAA,GAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAA,EAAAlgL,KAAAujL,IAAA,CAAA7B,EAAA2B,IAAA,GACArjL,KAAAujL,IAAA,CAAA5B,EAAAyB,IAAA,EAEA,SACAr8H,EAAA,EAFAghD,EAAA,EAAA/nG,KAAAujL,IAAA,CAAA5B,EAAA0B,IAAA,GAEAnD,CAAAA,IAAA,OAAAsE,CAAAA,KAAA,MACAA,IAAA,SAMA,IAAAC,GAAA,GAJA/rK,CAAAA,EAAA1Y,KAAAujL,IAAA,CAAA1B,EAAAuB,GAAA,EAIA,KAAAlD,KAFAA,CAAAA,EAAA,CADAA,EAAAlgL,KAAAujL,IAAA,CAAA1B,EAAAwB,GAAA,EACArjL,KAAAujL,IAAA,CAAAzB,EAAAsB,IAAA,EAEA,SA0BA,OAzBAr8H,EAAA,EAFAghD,EAAA/nG,KAAAujL,IAAA,CAAAzB,EAAAuB,GAAA,EAEAnD,CAAAA,IAAA,OAAAuE,CAAAA,KAAA,MACAA,IAAA,SACA9lI,CAAA,IAAA2kI,GACA3kI,CAAA,IAAA6kI,GACA7kI,CAAA,IAAA8kI,GACA9kI,CAAA,IAAA+kI,GACA/kI,CAAA,IAAAglI,GACAhlI,CAAA,IAAAilI,GACAjlI,CAAA,IAAAklI,GACAllI,CAAA,IAAAmlI,GACAnlI,CAAA,IAAAolI,GACAplI,CAAA,IAAAqlI,GACArlI,CAAA,KAAAslI,GACAtlI,CAAA,KAAAulI,GACAvlI,CAAA,KAAAwlI,GACAxlI,CAAA,KAAAylI,GACAzlI,CAAA,KAAA0lI,GACA1lI,CAAA,KAAA2lI,GACA3lI,CAAA,KAAA4lI,GACA5lI,CAAA,KAAA6lI,GACA7lI,CAAA,KAAA8lI,GACA,IAAA19H,IACApI,CAAA,KAAAoI,EACA2tC,EAAAx0F,MAAA,IAEAw0F,CAAA,EAQA,SAAAgwF,EAAAnmL,CAAA,CAAA+sB,CAAA,CAAAopE,CAAA,EACAA,EAAAsnF,QAAA,CAAA1wJ,EAAA0wJ,QAAA,CAAAz9K,EAAAy9K,QAAA,CAAAtnF,EAAAx0F,MAAA,CAAA3B,EAAA2B,MAAA,CAAAorB,EAAAprB,MAAA,CAKA,QAFAswK,EAAA,EACAmU,EAAA,EACA7gL,EAAA,EAAAA,EAAA4wF,EAAAx0F,MAAA,GAAA4D,IAAA,CAGA,IAAAm6K,EAAA0G,EACAA,EAAA,EAGA,QAFAzG,EAAA1N,SAAAA,EACA2N,EAAAn+K,KAAAorC,GAAA,CAAAtnC,EAAAwnB,EAAAprB,MAAA,IACAszB,EAAAxzB,KAAAqrC,GAAA,GAAAvnC,EAAAvF,EAAA2B,MAAA,IAAAszB,GAAA2qJ,EAAA3qJ,IAAA,CACA,IAAAluB,EAAAxB,EAAA0vB,EAEApwB,EAAAtE,CADAP,EAAAA,EAAAkjK,KAAA,CAAAn8J,EAAA,EACAgmB,CAAAA,EAAAA,EAAAm2I,KAAA,CAAAjuI,EAAA,EAGA9a,EAAAtV,SAAAA,EACA66K,EAAA,mBAEAC,EAAAxlK,SADAA,CAAAA,EAAA,EAAAwlK,EAAA,GAIAyG,GAAA1G,CAHAA,EAAA,EAAAvlK,CAAAA,IAAA,SAGA,GACAulK,GAAA,QACA,CACAvpF,EAAA+sE,KAAA,CAAA39J,EAAA,CAAAo6K,EACA1N,EAAAyN,EACAA,EAAA0G,CACA,CAOA,OANAnU,IAAAA,EACM97E,EAAA+sE,KAAA,CAAA39J,EAAA,CAAA0sK,EAEN97E,EAAAx0F,MAAA,GAGAw0F,EAAAkoF,MAAA,GAGA,SAAAgI,EAAArmL,CAAA,CAAA+sB,CAAA,CAAAopE,CAAA,EAIA,OAAAgwF,EAAAnmL,EAAA+sB,EAAAopE,EAAA,CAsBA,SAAAmwF,EAAAziL,CAAA,CAAAqxB,CAAA,EACA,KAAArxB,CAAA,CAAAA,EACA,KAAAqxB,CAAA,CAAAA,CAAA,CAzEAzzB,KAAAujL,IAAA,EACAtD,CAAAA,EAAAjC,CAAA,EAmDA19H,EAAA7yC,SAAA,CAAAq3K,KAAA,UAAAx5J,CAAA,CAAAopE,CAAA,EAEA,IAAAh8D,EAAA,KAAAx4B,MAAA,CAAAorB,EAAAprB,MAAA,CAWA,OAVA,UAAAA,MAAA,EAAAorB,KAAAA,EAAAprB,MAAA,CACM+/K,EAAA,KAAA30J,EAAAopE,GACNh8D,EAAA,GACMslJ,EAAA,KAAA1yJ,EAAAopE,GACNh8D,EAAA,KACMgsJ,EAAA,KAAAp5J,EAAAopE,GAENkwF,EAAA,KAAAt5J,EAAAopE,EAGA,EAWAmwF,EAAAp3K,SAAA,CAAAs3K,OAAA,UAAA7zH,CAAA,EAGA,QAFA/sD,EAAA,MAAA+sD,GACAjlB,EAAAqU,EAAA7yC,SAAoB,CAAA+wK,UAAO,CAAAttH,GAAA,EAC3B5rD,EAAA,EAAAA,EAAA4rD,EAAA5rD,IACAnB,CAAA,CAAAmB,EAAA,MAAA0/K,MAAA,CAAA1/K,EAAA2mC,EAAAilB,GAGA,OAAA/sD,CAAA,EAIA0gL,EAAAp3K,SAAA,CAAAu3K,MAAA,UAAA5iL,CAAA,CAAA6pC,CAAA,CAAAilB,CAAA,KAAA9uD,IAAAA,GAAAA,IAAA8uD,EAAA,SAAA9uD,CAAA,CAIA,QADA6iL,EAAA,EACA3/K,EAAA,EAAAA,EAAA2mC,EAAA3mC,IACA2/K,GAAA,CAAA7iL,EAAAA,CAAA,GAAA6pC,EAAA3mC,EAAA,EACAlD,IAAA,EAGA,OAAA6iL,CAAA,EAKAJ,EAAAp3K,SAAA,CAAAy3K,OAAoB,CAAO,SAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAr0H,CAAA,EAC3B,QAAA5rD,EAAA,EAAAA,EAAA4rD,EAAA5rD,IACAggL,CAAA,CAAAhgL,EAAA,CAAA8/K,CAAA,CAAAD,CAAA,CAAA7/K,EAAA,EACAigL,CAAA,CAAAjgL,EAAA,CAAA+/K,CAAA,CAAAF,CAAA,CAAA7/K,EAAA,GAIAu/K,EAAAp3K,SAAA,CAAA4jC,SAAA,UAAA+zI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAr0H,CAAA,CAAAi0H,CAAA,OAAAD,OAAA,CAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAr0H,GAGA,QAAAltD,EAAA,EAAAA,EAAAktD,EAAAltD,IAAA,EAMA,QANAioC,EAAAjoC,GAAA,EAGAwhL,EAAAxlL,KAAAylL,GAAA,GAAAzlL,KAAA04H,EAAA,CAAAzsF,GAAAy5I,EAAA1lL,KAAA2lL,GAAA,GAAA3lL,KAAA04H,EAAA,CAAAzsF,GAGAllB,EAAA,EAAAA,EAAAmqC,EAAAnqC,GAAAklB,EAIA,QAHA25I,EAAAJ,EAAAK,EAAAH,EAGAlyJ,EAAA,EAAAA,EAAAxvB,EAAAwvB,IAAA,CACA,IAAA+X,EAAA+5I,CAAA,CAAAv+J,EAAAyM,EAAA,CAAA8jC,EAAAiuH,CAAA,CAAAx+J,EAAAyM,EAAA,CAGAsyJ,EAAAR,CAAA,CAAAv+J,EAAAyM,EAAAxvB,EAAA,CAAA+hL,EAAAR,CAAA,CAAAx+J,EAAAyM,EAAAxvB,EAAA,CAEAgiL,EAAAJ,EAAAE,EAAAD,EAAAE,EAGAA,EAAAH,EAAAG,EAAAF,EAAAC,EAAAA,EAAAE,EAGAV,CAAA,CAAAv+J,EAAAyM,EAAA,CAAA+X,EAAAu6I,EAAAP,CAAA,CAAAx+J,EAAAyM,EAAA,CAAA8jC,EAAAyuH,EAGAT,CAAA,CAAAv+J,EAAAyM,EAAAxvB,EAAA,CAAAunC,EAAAu6I,EAAAP,CAAA,CAAAx+J,EAAAyM,EAAAxvB,EAAA,CAAAszD,EAAAyuH,EAIAvyJ,IAAAyY,IAAA+5I,EAAAR,EAAAI,EAAAF,EAAAG,EAGAA,EAAAL,EAAAK,EAAAH,EAAAE,EACAA,EAAAI,EAEA,CAEA,EAGAnB,EAAAp3K,SAAA,CAAAw4K,WAAA,UAAA3mL,CAAA,CAAA6pB,CAAA,EACA,IAAA+nC,EAAAlxD,EAAAA,KAAAqrC,GAAA,CAAAliB,EAAA7pB,GACA4mL,EAAAh1H,EAAAA,EACA5rD,EAAA,EACA,IAAA4rD,EAAAA,EAAA,IAAAA,EAAAA,KAAA,EACA5rD,IAGA,UAAAA,EAAA,EAAA4gL,CAAA,EAGArB,EAAAp3K,SAAA,CAAA04K,SAAA,UAAAf,CAAA,CAAAC,CAAA,CAAAn0H,CAAA,MAAAA,CAAAA,GAAA,GAGA,QAAA5rD,EAAA,EAAAA,EAAA4rD,EAAA,EAAA5rD,IAAA,KAAAnB,EAAAihL,CAAA,CAAA9/K,EAAA,CAGA8/K,CAAA,CAAA9/K,EAAA,CAAA8/K,CAAA,CAAAl0H,EAAA5rD,EAAA,GAAA8/K,CAAA,CAAAl0H,EAAA5rD,EAAA,GAAAnB,EAEAA,EAAAkhL,CAAA,CAAA//K,EAAA,CAGA+/K,CAAA,CAAA//K,EAAA,EAAA+/K,CAAA,CAAAn0H,EAAA5rD,EAAA,GACA+/K,CAAA,CAAAn0H,EAAA5rD,EAAA,IAAAnB,CACA,CAbA,EAgBA0gL,EAAAp3K,SAAA,CAAA24K,YAAA,UAAAC,CAAA,CAAAn1H,CAAA,EAEA,QADAs/G,EAAA,EACAlrK,EAAA,EAAAA,EAAA4rD,EAAA,EAAA5rD,IAAA,CACA,IAAA6xB,EAAAn3B,KAAAA,KAAA2kC,KAAA,CAAA0hJ,CAAA,GAAA/gL,EAAA,GAAA4rD,GACAlxD,KAAA2kC,KAAA,CAAA0hJ,CAAA,GAAA/gL,EAAA,CAAA4rD,GAAAs/G,CAEA6V,CAAAA,CAAA,CAAA/gL,EAAA,CAAA6xB,SAAAA,EAIQq5I,EADRr5I,EAAA,SACQ,EAERA,EAAA,UACA,CAGA,OAAAkvJ,CAAA,EAGAxB,EAAAp3K,SAAA,CAAA64K,UAAA,UAAAD,CAAA,CAAA3tJ,CAAA,CAAA0sJ,CAAA,CAAAl0H,CAAA,EAEA,QADAs/G,EAAA,EACAlrK,EAAA,EAAAA,EAAAozB,EAAApzB,IAAAkrK,GAAA6V,EAAAA,CAAA,CAAA/gL,EAAA,CAGA8/K,CAAA,GAAA9/K,EAAA,CAAAkrK,KAAAA,EAAAA,KAAuC,GACvC4U,CAAA,GAAA9/K,EAAA,GAAAkrK,KAAAA,EAAAA,KAAA,GAIA,IAAAlrK,EAAA,EAAAozB,EAAApzB,EAAA4rD,EAAA,EAAA5rD,EACA8/K,CAAA,CAAA9/K,EAAA,GAGAV,EAAA4rK,IAAAA,GACA5rK,EAAA,CAAA4rK,MAAAA,CAAA,OAGAqU,EAAAp3K,SAAA,CAAA84K,IAAA,UAAAr1H,CAAA,EAEA,QADAs1H,EAAA,MAAoBt1H,GACpB5rD,EAAA,EAAAA,EAAA4rD,EAAA5rD,IACAkhL,CAAA,CAAAlhL,EAAA,GAGA,OAAAkhL,CAAA,EAGA3B,EAAAp3K,SAAA,CAAAg5K,IAAA,UAAArkL,CAAA,CAAAqxB,CAAA,CAAAihE,CAAA,MAAAxjC,EAAA,OAAA+0H,WAAA,CAAA7jL,EAAAlC,MAAA,CAAAuzB,EAAAvzB,MAAA,EAEAilL,EAAA,KAAAJ,OAAA,CAAA7zH,GAEA9wD,EAAA,KAAAmmL,IAAA,CAAAr1H,GAGAk0H,EAAA,MAAAl0H,GACAw1H,EAAA,MAAAx1H,GAAAy1H,EAAA,MAAAz1H,GAGA01H,EAAA,MAAA11H,GACA21H,EAAA,MAAA31H,GAAA41H,EAAA,MAAA51H,GAGA61H,EAAAryF,EAAA+sE,KAAA,CAAAslB,EAAA7mL,MAAA,CAAAgxD,EAGA,KAAAo1H,UAAA,CAAAlkL,EAAAq/J,KAAA,CAAAr/J,EAAAlC,MAAA,CAAAklL,EAAAl0H,GAAA,KAAAo1H,UAAA,CAAA7yJ,EAAAguI,KAAA,CAAAhuI,EAAAvzB,MAAA,CAAA0mL,EAAA11H,GAGA,KAAA7f,SAAA,CAAA+zI,EAAAhlL,EAAAsmL,EAAAC,EAAAz1H,EAAAi0H,GAAA,KAAA9zI,SAAA,CAAAu1I,EAAAxmL,EAAAymL,EAAAC,EAAA51H,EAAAi0H,GAGA,QAAA7/K,EAAA,EAAAA,EAAA4rD,EAAA5rD,IAAA,CACA,IAAA0gL,EAAAU,CAAA,CAAAphL,EAAA,CAAAuhL,CAAA,CAAAvhL,EAAA,CAAAqhL,CAAA,CAAArhL,EAAA,CAAAwhL,CAAA,CAAAxhL,EAAA,CACAqhL,CAAA,CAAArhL,EAAA,CAAAohL,CAAA,CAAAphL,EAAA,CAAAwhL,CAAA,CAAAxhL,EAAA,CAAAqhL,CAAA,CAAArhL,EAAA,CAAAuhL,CAAA,CAAAvhL,EAAA,CACAohL,CAAA,CAAAphL,EAAA,CAAA0gL,CAAA,CAUA,OAPA,KAAAG,SAAA,CAAAO,EAAAC,EAAAz1H,GACA,KAAA7f,SAAA,CAAAq1I,EAAAC,EAAAI,EAAA3mL,EAAA8wD,EAAAi0H,GACA,KAAAgB,SAAA,CAAAY,EAAA3mL,EAAA8wD,GAAA,KAAAk1H,YAAA,CAAAW,EAAA71H,GAGAwjC,EAAAsnF,QAAA,CAAA55K,EAAA45K,QAAA,CAAAvoJ,EAAAuoJ,QAAA,CACAtnF,EAAAx0F,MAAA,CAAAkC,EAAAlC,MAAA,CAAAuzB,EAAAvzB,MAAA,CACAw0F,EAAAkoF,MAAA,IAIAt8H,EAAA7yC,SAAA,CAAAmyC,GAAA,UAAAt0B,CAAA,EACA,IAAAopE,EAAA,IAAAp0C,EAAA,MAEA,OADAo0C,EAAA+sE,KAAA,YAAAvhK,MAAA,CAAAorB,EAAAprB,MAAA,EACA,KAAA4kL,KAAA,CAAAx5J,EAAAopE,EAAA,EAIAp0C,EAAA7yC,SAAA,CAAAu5K,IAAA,UAAA17J,CAAA,EACA,IAAAopE,EAAA,IAAAp0C,EAAA,MAEA,OADAo0C,EAAA+sE,KAAA,YAAAvhK,MAAA,CAAAorB,EAAAprB,MAAA,EACA0kL,EAAA,KAAAt5J,EAAAopE,EAAA,EAIAp0C,EAAA7yC,SAAA,CAAA81K,IAAA,UAAAj4J,CAAA,EACA,YAAArH,KAAA,GAAA6gK,KAAA,CAAAx5J,EAAA,OAGAg1B,EAAA7yC,SAAA,CAAAuvK,KAAA,UAAA1xJ,CAAA,EACA,IAAA27J,EAAA37J,EAAA,EAAA27J,GAAA37J,CAAAA,EAAA,CAAAA,CAAA,EAGA1mB,EAAA,iBAAA0mB,GAAA1mB,EAAA0mB,EAAA,UAKA,QADAklJ,EAAA,EACAlrK,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IAAA,CACA,IAAA6xB,EAAA,QAAAsqI,KAAA,CAAAn8J,EAAA,EAAAgmB,EACA5S,EAAA,CAAAye,SAAAA,CAAA,EAAAq5I,CAAAA,SAAAA,CAAA,EACAA,IAAA,GAGAA,GAFA,eAEA93J,CAAAA,IAAA,IACA,KAAA+oJ,KAAA,CAAAn8J,EAAA,CAAAoT,SAAAA,CAAA,CAQA,OALA,IAAA83J,IACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAkrK,EACA,KAAAtwK,MAAA,IAGA+mL,EAAA,KAAAlI,IAAA,SAGAz+H,EAAA7yC,SAAA,CAAAy5K,IAAA,UAAA57J,CAAA,EACA,YAAArH,KAAA,GAAA+4J,KAAA,CAAA1xJ,EAAA,EAIAg1B,EAAA7yC,SAAA,CAAA+1G,GAAA,YACA,YAAA5jE,GAAA,QAIAU,EAAA7yC,SAAA,CAAA05K,IAAA,YACA,YAAA5D,IAAA,MAAAt/J,KAAA,KAIAq8B,EAAA7yC,SAAA,CAAA6xC,GAAA,UAAAh0B,CAAA,EACA,IAAA6L,EAAA0mJ,EAAAvyJ,GAAA,GAAA6L,IAAAA,EAAAj3B,MAAA,YAAAogD,EAAA,GAKA,QADA33C,EAAA,KACArD,EAAA,EACA,EADA6xB,EAAAj3B,MAAA,EACAi3B,IAAAA,CAAA,CAAA7xB,EAAA,CADAA,IAAAqD,EAAAA,EAAA66G,GAAA,IAIA,KAAAl+G,EAAA6xB,EAAAj3B,MAAA,CACA,QAAAqxD,EAAA5oD,EAAA66G,GAAA,GAAAl+G,EAAA6xB,EAAAj3B,MAAA,CAAAoF,IAAAisD,EAAAA,EAAAiyD,GAAA,OAAArsF,CAAA,CAAA7xB,EAAA,EAGAqD,CAAAA,EAAAA,EAAAi3C,GAAA,CAAA2R,EAAA,CACA,CAGA,OAAA5oD,CAAA,EAIA23C,EAAA7yC,SAAA,CAAA25K,MAAA,UAAAvqF,CAAA,EACAj4F,EAAA,iBAAAi4F,GAAAA,GAAA,GACA,IAEAv3F,EAFAlC,EAAAy5F,EAAA,GACA74F,EAAA,CAAA64F,EAAAz5F,CAAAA,EAAA,GACAikL,EAAA,cAAAjkL,GAAA,GAAAA,EAGA,GAAAA,IAAAA,EAAA,KAAAotK,EAAA,EAGA,IAAAlrK,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IAAA,CACA,IAAAgiL,EAAA,KAAA7lB,KAAA,CAAAn8J,EAAA,CAAA+hL,EACAtgI,EAAA,QAAA06G,KAAA,CAAAn8J,EAAA,EAAAgiL,GAAAlkL,CACA,MAAAq+J,KAAA,CAAAn8J,EAAA,CAAAyhD,EAAAypH,EACAA,EAAA8W,IAAA,GAAAlkL,CAAA,CAGAotK,IACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAkrK,EACA,KAAAtwK,MAAA,GACA,IAGA8D,IAAAA,EAAA,CACA,IAAAsB,EAAA,KAAApF,MAAA,GAAAoF,GAAA,EAAAA,IACA,KAAAm8J,KAAA,CAAAn8J,EAAAtB,EAAA,MAAAy9J,KAAA,CAAAn8J,EAAA,CAGA,IAAAA,EAAA,EAAAA,EAAAtB,EAAAsB,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,EAGA,MAAApF,MAAA,EAAA8D,CAAA,QAGA,KAAA44K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAA85K,KAAA,UAAA1qF,CAAA,EAGA,OADAj4F,EAAA,SAAAo3K,QAAA,EACA,KAAAoL,MAAA,CAAAvqF,EAAA,EAMAv8C,EAAA7yC,SAAA,CAAA+5K,MAAA,UAAA3qF,CAAA,CAAA0lE,CAAA,CAAAklB,CAAA,EACA7iL,EAAA,iBAAAi4F,GAAAA,GAAA,GAGMpkE,EADN8pI,EACM,CAAAA,EAAAA,EAAA,OAEN,EAGA,IAPA9pI,EAOAr1B,EAAAy5F,EAAA,GACA74F,EAAAhE,KAAAorC,GAAA,EAAAyxD,EAAAz5F,CAAAA,EAAA,QAAAlD,MAAA,EACAsD,EAAA,oBAAAJ,GAAAA,EAAAskL,EAAAD,EAOA,GAJAhvJ,GAAAz0B,EAAAy0B,EAAAz4B,KAAAqrC,GAAA,GAAA5S,GAIAivJ,EAAA,CACA,QAAApiL,EAAA,EAAAA,EAAAtB,EAAAsB,IACAoiL,EAAAjmB,KAAA,CAAAn8J,EAAA,MAAAm8J,KAAA,CAAAn8J,EAAA,CAEAoiL,EAAAxnL,MAAA,CAAA8D,CAAA,IAGAA,IAAAA,QAEA,QAAA9D,MAAA,CAAA8D,EAEA,IADA,KAAA9D,MAAA,EAAkB8D,EAClBsB,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,MAAAm8J,KAAA,CAAAn8J,EAAAtB,EAAA,MAGA,KAAAy9J,KAAA,MACA,KAAAvhK,MAAA,GAGA,IAAAswK,EAAA,EACA,IAAAlrK,EAAA,KAAApF,MAAA,GAAAoF,GAAA,GAAAkrK,CAAAA,IAAAA,GAAAlrK,GAAAmzB,CAAAA,EAAAnzB,IAAA,CACA,IAAA05F,EAAA,OAAAyiE,KAAA,CAAAn8J,EAAA,CACA,KAAAm8J,KAAA,CAAAn8J,EAAA,OAAAlC,EAAA47F,IAAA57F,EACAotK,EAAAxxE,EAAAx7F,CAAA,CAaA,OATAkkL,GAAAlX,IAAAA,GACAkX,CAAAA,EAAAjmB,KAAA,CAAAimB,EAAAxnL,MAAA,IAAAswK,CAAA,EAGA,SAAAtwK,MAAA,GACA,KAAAuhK,KAAA,MACA,KAAAvhK,MAAA,IAGA,KAAA08K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAk6K,KAAA,UAAA9qF,CAAA,CAAA0lE,CAAA,CAAAklB,CAAA,EAGA,OADA7iL,EAAA,SAAAo3K,QAAA,EACA,KAAAwL,MAAA,CAAA3qF,EAAA0lE,EAAAklB,EAAA,EAIAnnI,EAAA7yC,SAAA,CAAAm6K,IAAA,UAAA/qF,CAAA,EACA,YAAA54E,KAAA,GAAAsjK,KAAA,CAAA1qF,EAAA,EAGAv8C,EAAA7yC,SAAA,CAAAo6K,KAAA,UAAAhrF,CAAA,EACA,YAAA54E,KAAA,GAAAmjK,MAAA,CAAAvqF,EAAA,EAIAv8C,EAAA7yC,SAAA,CAAAszC,IAAA,UAAA87C,CAAA,EACA,YAAA54E,KAAA,GAAA0jK,KAAA,CAAA9qF,EAAA,EAGAv8C,EAAA7yC,SAAA,CAAAq6K,KAAA,UAAAjrF,CAAA,EACA,YAAA54E,KAAA,GAAAujK,MAAA,CAAA3qF,EAAA,EAIAv8C,EAAA7yC,SAAA,CAAAoxK,KAAA,UAAAf,CAAA,EACAl5K,EAAA,iBAAAk5K,GAAAA,GAAA,GACA,IAAA16K,EAAA06K,EAAA,GACA95K,EAAA,CAAA85K,EAAA16K,CAAAA,EAAA,GAAAmuD,EAAA,GAAAnuD,QAGA,OAAAlD,MAAA,EAAA8D,CAAAA,GAMA,EAAAmzB,CAAAA,IAHA,CAAAsqI,KAAA,CAAAz9J,EAAA,CAGAutD,CAAAA,CAAA,EAIAjR,EAAA7yC,SAAA,CAAAs6K,MAAA,UAAAlrF,CAAA,EACAj4F,EAAA,iBAAAi4F,GAAAA,GAAA,GACA,IAAAz5F,EAAAy5F,EAAA,GAAA74F,EAAA,CAAA64F,EAAAz5F,CAAAA,EAAA,GAKA,GAHAwB,EAAA,SAAAo3K,QAAA,4CAGA,KAAA97K,MAAA,EAAA8D,EACA,YAQA,GALA,IAAAZ,GACAY,IACA,KAAA9D,MAAA,CAAAF,KAAAorC,GAAA,CAAApnC,EAAA,KAAA9D,MAAA,EAGAkD,IAAAA,EAAA,CACA,IAAAI,EAAA,oBAAAJ,GAAAA,CACA,MAAAq+J,KAAA,MAAAvhK,MAAA,KAAAsD,CAAA,QAGA,KAAAo5K,MAAA,IAIAt8H,EAAA7yC,SAAA,CAAAu6K,KAAA,UAAAnrF,CAAA,EACA,YAAA54E,KAAA,GAAA8jK,MAAA,CAAAlrF,EAAA,EAIAv8C,EAAA7yC,SAAA,CAAAmxK,KAAA,UAAAtzJ,CAAA,QAEA,CADA1mB,EAAA,iBAAA0mB,GACA1mB,EAAA0mB,EAAA,UAAAA,EAAA,QAAA28J,KAAA,EAAA38J,GAIA,SAAA0wJ,QAAA,CACA,SAAA97K,MAAA,UAAAuhK,KAAA,MAAAn2I,GACA,KAAAm2I,KAAA,IAAAn2I,EAAA,QAAAm2I,KAAA,KACA,KAAAua,QAAA,GACA,OAGA,KAAAA,QAAA,GACA,KAAAiM,KAAA,CAAA38J,GACA,KAAA0wJ,QAAA,GACA,KANA,CAUA,KAAAiB,MAAA,CAAA3xJ,EAlBA,EAqBAg1B,EAAA7yC,SAAA,CAAAwvK,MAAA,UAAA3xJ,CAAA,OAAAm2I,KAAA,KAAAn2I,EAIA,QAAAhmB,EAAA,EAAAA,EAAA,KAAApF,MAAA,OAAAuhK,KAAA,CAAAn8J,EAAA,WAAAA,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,WACAA,IAAA,KAAApF,MAAA,GACQ,KAAAuhK,KAAA,CAAAn8J,EAAA,KAER,KAAAm8J,KAAA,CAAAn8J,EAAA,KAKA,OAHA,KAAApF,MAAA,CAAAF,KAAAqrC,GAAA,MAAAnrC,MAAA,CAAAoF,EAAA,GAGA,MAIAg7C,EAAA7yC,SAAA,CAAAw6K,KAAA,UAAA38J,CAAA,EAEA,GADA1mB,EAAA,iBAAA0mB,GACA1mB,EAAA0mB,EAAA,UAAAA,EAAA,cAAAszJ,KAAA,EAAAtzJ,EAAA,CAGA,YAAA0wJ,QAAA,CAIA,OAHA,KAAAA,QAAA,GACA,KAAA4C,KAAA,CAAAtzJ,GACA,KAAA0wJ,QAAA,GACA,KAKA,GAHA,KAAAva,KAAA,KAAAn2I,EAGA,SAAAprB,MAAA,OAAAuhK,KAAA,MACA,KAAAA,KAAA,UAAAA,KAAA,IACM,KAAAua,QAAA,QAGN,QAAA12K,EAAA,EAAAA,EAAA,KAAApF,MAAA,OAAAuhK,KAAA,CAAAn8J,EAAA,GAAAA,IACA,KAAAm8J,KAAA,CAAAn8J,EAAA,WACA,KAAAm8J,KAAA,CAAAn8J,EAAA,KACA,CAGA,YAAAs3K,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAAy6K,IAAA,UAAA58J,CAAA,EACA,YAAArH,KAAA,GAAA26J,KAAA,CAAAtzJ,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAA06K,IAAA,UAAA78J,CAAA,EACA,YAAArH,KAAA,GAAAgkK,KAAA,CAAA38J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAA26K,IAAA,YAGA,OAHA,KAAApM,QAAA,GAGA,MAGA17H,EAAA7yC,SAAA,CAAAshB,GAAA,YACA,YAAA9K,KAAA,GAAAmkK,IAAA,IAGA9nI,EAAA7yC,SAAA,CAAA46K,YAAA,UAAA/8J,CAAA,CAAAs0B,CAAA,CAAA9kC,CAAA,EACA,IAAAxV,EAKA6xB,EALAuB,EAAApN,EAAAprB,MAAA,CAAA4a,EAEA,KAAAqiK,OAAA,CAAAzkJ,GAIA,IAAA83I,EAAgB,EAChB,IAAAlrK,EAAA,EAAAA,EAAAgmB,EAAAprB,MAAA,CAAAoF,IAAA,CACA6xB,EAAA,QAAAsqI,KAAA,CAAAn8J,EAAAwV,EAAA,EAAA01J,EACA,IAAAx2H,EAAA,CAAA1uB,EAAAA,EAAAm2I,KAAA,CAAAn8J,EAAA,EAAAs6C,EACAzoB,GAAA6iB,SAAAA,EACAw2H,EAAA,CAAAr5I,GAAA,mBACA,KAAAsqI,KAAA,CAAAn8J,EAAAwV,EAAA,CAAAqc,SAAAA,CACA,CACA,KAAA7xB,EAAA,KAAApF,MAAA,CAAA4a,EAAAxV,IAEAkrK,EAAAr5I,CADAA,EAAA,QAAAsqI,KAAA,CAAAn8J,EAAAwV,EAAA,EAAA01J,CAAA,GACA,GACA,KAAA/O,KAAA,CAAAn8J,EAAAwV,EAAA,CAAAqc,SAAAA,EAEA,GAAAq5I,IAAAA,EAAA,YAAAoM,MAAA,GAMA,IAFAh4K,EAAA4rK,KAAAA,GACAA,EAAA,EACAlrK,EAAA,EAAAA,EAAA,KAAApF,MAAA,CAAAoF,IAEAkrK,EAAAr5I,CADAA,EAAA,SAAAsqI,KAAA,CAAAn8J,EAAA,EAAAkrK,CAAA,GACA,GACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAA6xB,SAAAA,EAIA,OAHA,KAAA6kJ,QAAA,GAGA,KAAAY,MAAA,IAGAt8H,EAAA7yC,SAAA,CAAA66K,QAAA,UAAAh9J,CAAA,CAAAtI,CAAA,MAiBAuuC,EAjBAz2C,EAAA,KAAA5a,MAAA,CAAAorB,EAAAprB,MAAA,CAGApB,EAAA,KAAAmlB,KAAA,GAAAjM,EAAAsT,EAIAi9J,EAAAvwK,EAAAA,EAAAypJ,KAAA,CAAAzpJ,EAAA9X,MAAA,IAGA,GADA4a,CAAAA,EAAA,GADA,KAAA0jK,UAAA,CAAA+J,EACA,IAEAvwK,EAAAA,EAAA6vK,KAAA,CAAA/sK,GACAhc,EAAAsoL,MAAA,CAAAtsK,GACAytK,EAAAvwK,EAAAA,EAAAypJ,KAAA,CAAAzpJ,EAAA9X,MAAA,KAIA,IAAAipB,EAAArqB,EAAAoB,MAAA,CAAA8X,EAAA9X,MAAA,CAGA,GAAA8iB,QAAAA,EAAA,CAEAuuC,CADAA,EAAA,IAAAjR,EAAA,OACApgD,MAAA,CAAAipB,EAAA,EACAooC,EAAAkwG,KAAA,OAAsBlwG,EAAArxD,MAAA,EACtB,QAAAoF,EAAA,EAAAA,EAAAisD,EAAArxD,MAAA,CAAAoF,IACAisD,EAAAkwG,KAAA,CAAAn8J,EAAA,EACA,KAGA07G,EAAAliH,EAAAmlB,KAAA,GAAAokK,YAAA,CAAArwK,EAAA,EAAAmR,GACA,IAAA63F,EAAAg7D,QAAA,GACAl9K,EAAAkiH,EACAzvD,GACAA,CAAAA,EAAAkwG,KAAA,CAAAt4I,EAAA,KAIA,QAAAqK,EAAArK,EAAA,EAAAqK,GAAA,EAAAA,IAAA,CACA,IAAAg1J,EAAA,CAAA1pL,EAAAA,EAAA2iK,KAAA,CAAAzpJ,EAAA9X,MAAA,CAAAszB,EAAA,WAAA10B,CAAAA,EAAAA,EAAA2iK,KAAA,CAAAzpJ,EAAA9X,MAAA,CAAAszB,EAAA,IAQA,IAJAg1J,EAAAxoL,KAAAorC,GAAA,GAAAm9I,EAAA,YAGAzpL,EAAAupL,YAAA,CAAArwK,EAAAwwK,EAAAh1J,GACA10B,IAAAA,EAAAk9K,QAAA,EACAwM,IACA1pL,EAAAk9K,QAAA,GACAl9K,EAAAupL,YAAA,CAAArwK,EAAA,EAAAwb,GACA10B,EAAAq/J,MAAA,IACAr/J,CAAAA,EAAAk9K,QAAA,KAGAzqH,GACAA,CAAAA,EAAAkwG,KAAA,CAAAjuI,EAAA,CAAAg1J,CAAA,CAEA,CAWA,OAVAj3H,GACAA,EAAAqrH,MAAA,GACA99K,EAAA89K,MAAA,GAIA,QAAA55J,GAAAlI,IAAAA,GACAhc,EAAA0oL,MAAA,CAAA1sK,GAGA,CACAukC,IAAAkS,GAAA,KACA1nC,IAAA/qB,CACA,GAOAwhD,EAAA7yC,SAAA,CAAAg7K,MAAA,UAAAn9J,CAAA,CAAAtI,CAAA,CAAA0lK,CAAA,MAUArpI,EAAAx1B,EAAAlhB,QAPA,CAHA/D,EAAA,CAAA0mB,EAAA6yI,MAAA,IAGA,KAAAA,MAAA,IACA,CACA9+G,IAAA,IAAAiB,EAAA,GACAz2B,IAAA,IAAAy2B,EAAA,EACA,EAIA,SAAA07H,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,EAAArzK,EAAA,KAAA+6G,GAAA,GAAA+kE,MAAA,CAAAn9J,EAAAtI,GAGA,QAAAA,GACAq8B,CAAAA,EAAA12C,EAAA02C,GAAA,CAAAqkE,GAAA,IAGA,QAAA1gG,IACA6G,EAAAlhB,EAAAkhB,GAAA,CAAA65F,GAAA,GACAglE,GAAA7+J,IAAAA,EAAAmyJ,QAAA,EACAnyJ,EAAAk2J,IAAA,CAAAz0J,IAIA,CACA+zB,IAAAA,EACAx1B,IAAAA,CACA,GAGA,SAAAmyJ,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,EAAArzK,EAAA,KAAA8/K,MAAA,CAAAn9J,EAAAo4F,GAAA,GAAA1gG,GAGA,QAAAA,GACAq8B,CAAAA,EAAA12C,EAAA02C,GAAA,CAAAqkE,GAAA,IAGA,CACArkE,IAAAA,EACAx1B,IAAAlhB,EAAAkhB,GAAA,GAIA,MAAAmyJ,QAAA,CAAA1wJ,EAAA0wJ,QAAA,MAAArzK,EAAA,KAAA+6G,GAAA,GAAA+kE,MAAA,CAAAn9J,EAAAo4F,GAAA,GAAA1gG,GAGA,QAAAA,IACA6G,EAAAlhB,EAAAkhB,GAAA,CAAA65F,GAAA,GACAglE,GAAA7+J,IAAAA,EAAAmyJ,QAAA,EACAnyJ,EAAAm2J,IAAA,CAAA10J,IAIA,CACA+zB,IAAA12C,EAAA02C,GAAA,CACAx1B,IAAAA,CACA,GAMAyB,EAAAprB,MAAA,MAAAA,MAAA,SAAAuyK,GAAA,CAAAnnJ,GACA,CACA+zB,IAAA,IAAAiB,EAAA,GACAz2B,IAAA,MAKAyB,IAAAA,EAAAprB,MAAA,CACA,QAAA8iB,EACA,CACAq8B,IAAA,KAAAspI,IAAA,CAAAr9J,EAAAm2I,KAAA,KACA53I,IAAA,MAIA7G,QAAAA,EACA,CACAq8B,IAAA,KACAx1B,IAAA,IAAAy2B,EAAA,KAAAo9H,KAAA,CAAApyJ,EAAAm2I,KAAA,KACA,EAGA,CACApiH,IAAA,KAAAspI,IAAA,CAAAr9J,EAAAm2I,KAAA,KACA53I,IAAA,IAAAy2B,EAAA,KAAAo9H,KAAA,CAAApyJ,EAAAm2I,KAAA,KACA,CAbA,CAgBA,KAAA6mB,QAAA,CAAAh9J,EAAAtI,EArFA,EAyFAs9B,EAAA7yC,SAAA,CAAA4xC,GAAA,UAAA/zB,CAAA,EACA,YAAAm9J,MAAA,CAAAn9J,EAAA,UAAA+zB,GAAA,EAIAiB,EAAA7yC,SAAA,CAAAoc,GAAA,UAAAyB,CAAA,EACA,YAAAm9J,MAAA,CAAAn9J,EAAA,UAAAzB,GAAA,EAGAy2B,EAAA7yC,SAAA,CAAAm7K,IAAA,UAAAt9J,CAAA,EACA,YAAAm9J,MAAA,CAAAn9J,EAAA,UAAAzB,GAAA,EAIAy2B,EAAA7yC,SAAA,CAAAo7K,QAAA,UAAAv9J,CAAA,MAAAw9J,EAAA,KAAAL,MAAA,CAAAn9J,GAGA,GAAAw9J,EAAAj/J,GAAA,CAAAs0I,MAAA,UAAA2qB,EAAAzpI,GAAA,CAEA,IAAAx1B,EAAAi/J,IAAAA,EAAAzpI,GAAA,CAAA28H,QAAA,CAAA8M,EAAAj/J,GAAA,CAAAm2J,IAAA,CAAA10J,GAAAw9J,EAAAj/J,GAAA,CAGA6pJ,EAAApoJ,EAAAw8J,KAAA,IACA11D,EAAA9mG,EAAAy9J,KAAA,IAAAtW,EAAA5oJ,EAAA4oJ,GAAA,CAAAiB,UAGA,KAAAthD,IAAAA,GAAAqgD,IAAAA,EAAAqW,EAAAzpI,GAAA,CAIAypI,IAAAA,EAAAzpI,GAAA,CAAA28H,QAAA,CAAA8M,EAAAzpI,GAAA,CAAA4oI,KAAA,IAAAa,EAAAzpI,GAAA,CAAAu/H,KAAA,KAGAt+H,EAAA7yC,SAAA,CAAAiwK,KAAA,UAAApyJ,CAAA,EACA,IAAA27J,EAAA37J,EAAA,EAAA27J,GAAA37J,CAAAA,EAAA,CAAAA,CAAA,EAGA1mB,EAAA0mB,GAAA,UAIA,QAJAvE,EAAA,SAAAuE,EAGAhR,EAAA,EACAhV,EAAA,KAAApF,MAAA,GAAAoF,GAAA,EAAAA,IACAgV,EAAA,CAAAyM,EAAAzM,EAAA,QAAAmnJ,KAAA,CAAAn8J,EAAA,GAAAgmB,EAGA,OAAA27J,EAAA,CAAA3sK,EAAAA,CAAA,EAIAgmC,EAAA7yC,SAAA,CAAAu7K,IAAA,UAAA19J,CAAA,EACA,YAAAoyJ,KAAA,CAAApyJ,EAAA,EAIAg1B,EAAA7yC,SAAA,CAAAkwK,KAAA,UAAAryJ,CAAA,EACA,IAAA27J,EAAA37J,EAAA,EAAA27J,GAAA37J,CAAAA,EAAA,CAAAA,CAAA,EAEA1mB,EAAA0mB,GAAA,UAIA,QADAklJ,EAAA,EACAlrK,EAAA,KAAApF,MAAA,GAAAoF,GAAA,EAAAA,IAAA,CACA,IAAA6xB,EAAA,QAAAsqI,KAAA,CAAAn8J,EAAA,EAAAkrK,SAAAA,CACA,MAAA/O,KAAA,CAAAn8J,EAAA,GAAAgmB,EAAA,EACAklJ,EAAAr5I,EAAA7L,CAAA,CAIA,OADA,KAAAsxJ,MAAA,GACAqK,EAAA,KAAAlI,IAAA,SAGAz+H,EAAA7yC,SAAA,CAAAk7K,IAAA,UAAAr9J,CAAA,EACA,YAAArH,KAAA,GAAA05J,KAAA,CAAAryJ,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAw7K,IAAA,UAAAliK,CAAA,EACAniB,EAAAmiB,IAAAA,EAAAi1J,QAAA,EAAAp3K,EAAA,CAAAmiB,EAAAo3I,MAAA,IAGA,IAAA/7J,EAAA,KAAAqxB,EAAA1M,EAAA9C,KAAA,GAIM7hB,EADNA,IAAAA,EAAA45K,QAAA,CACM55K,EAAAwmL,IAAA,CAAA7hK,GAEN3kB,EAAA6hB,KAAA,GAaA,IATA,IAAAy5C,EAAA,IAAApd,EAAA,GAAAyQ,EAAA,IAAAzQ,EAAA,GAIAwQ,EAAA,IAAAxQ,EAAA,GAAA0Q,EAAA,IAAA1Q,EAAA,GAEAhzC,EAAA,EAGAlL,EAAA8mL,MAAA,IAAAz1J,EAAAy1J,MAAA,IACA9mL,EAAAolL,MAAA,IACA/zJ,EAAA+zJ,MAAA,IACA,EAAAl6K,EAMA,IAHA,IAAA67K,EAAA11J,EAAAxP,KAAA,GAAAmlK,EAAAhnL,EAAA6hB,KAAA,GAGA,CAAA7hB,EAAA+7J,MAAA,KACA,QAAA74J,EAAA,EAAA+jL,EAAA,GAAAjnL,EAAAq/J,KAAA,IAAA4nB,CAAA,MAAA/jL,EAAA,KAAAA,EAAA+jL,IAAA,GACA,GAAA/jL,EAAA,EAEA,IADAlD,EAAAolL,MAAA,CAAAliL,GACAA,KAAA,GACAo4D,CAAAA,EAAA4nD,KAAA,IAAAv0D,EAAAu0D,KAAA,MACA5nD,EAAAqiH,IAAA,CAAAoJ,GACAp4H,EAAAivH,IAAA,CAAAoJ,IAGA1rH,EAAA8pH,MAAA,IACAz2H,EAAAy2H,MAAA,GACA,CAGA,QAAAh0J,EAAA,EAAA81J,EAAA,GAAA71J,EAAAguI,KAAA,IAAA6nB,CAAA,MAAA91J,EAAA,KAAAA,EAAA81J,IAAA,GACA,GAAA91J,EAAA,EAEA,IADAC,EAAA+zJ,MAAA,CAAAh0J,GACAA,KAAA,GACAs9B,CAAAA,EAAAw0D,KAAA,IAAAt0D,EAAAs0D,KAAA,MACAx0D,EAAAivH,IAAA,CAAAoJ,GACAn4H,EAAAgvH,IAAA,CAAAoJ,IAGAt4H,EAAA02H,MAAA,IACAx2H,EAAAw2H,MAAA,GACA,CAGAplL,EAAAqwK,GAAA,CAAAh/I,IAAA,GACArxB,EAAA49K,IAAA,CAAAvsJ,GACAiqC,EAAAsiH,IAAA,CAAAlvH,GACQC,EAAAivH,IAAA,CAAAhvH,KAERv9B,EAAAusJ,IAAA,CAAA59K,GACA0uD,EAAAkvH,IAAA,CAAAtiH,GACA1M,EAAAgvH,IAAA,CAAAjvH,GACA,CAGA,OACAjyD,EAAAgyD,EACA94C,EAAAg5C,EACAjP,IAAAtuB,EAAA2zJ,MAAA,CAAA95K,EACA,GAMAgzC,EAAA7yC,SAAA,CAAA87K,MAAA,UAAAxiK,CAAA,EACAniB,EAAAmiB,IAAAA,EAAAi1J,QAAA,EAAAp3K,EAAA,CAAAmiB,EAAAo3I,MAAA,IAGA,IAgDAx1J,EAhDA7J,EAAA,KAAAkZ,EAAA+O,EAAA9C,KAAA,GAIMnlB,EADNA,IAAAA,EAAAk9K,QAAA,CACMl9K,EAAA8pL,IAAA,CAAA7hK,GAENjoB,EAAAmlB,KAAA,GAQA,IALA,IAAAulK,EAAA,IAAAlpI,EAAA,GAAA2uE,EAAA,IAAA3uE,EAAA,GAEAkgF,EAAAxoH,EAAAiM,KAAA,GAGAnlB,EAAA2qL,IAAA,OAAAzxK,EAA8ByxK,IAAA,QAC9B,QAAAnkL,EAAA,EAAA+jL,EAAA,GAAAvqL,EAAA2iK,KAAA,IAAA4nB,CAAA,MAAA/jL,EAAA,KAAAA,EAAA+jL,IAAA,GACA,GAAA/jL,EAAA,EAEA,IADAxG,EAAA0oL,MAAA,CAAAliL,GACAA,KAAA,GACAkkL,EAAAlkE,KAAA,IACAkkE,EAAAzJ,IAAA,CAAAv/C,GAGAgpD,EAAAhC,MAAA,GACA,CAGA,QAAAh0J,EAAA,EAAA81J,EAAA,GAAAtxK,EAAAypJ,KAAA,IAAA6nB,CAAA,MAAA91J,EAAA,KAAAA,EAAA81J,IAAA,GACA,GAAA91J,EAAA,EAEA,IADAxb,EAAAwvK,MAAA,CAAAh0J,GACAA,KAAA,GACAy7F,EAAA3J,KAAA,IACA2J,EAAA8wD,IAAA,CAAAv/C,GAGAvR,EAAAu4D,MAAA,GACA,CAGA1oL,EAAA2zK,GAAA,CAAAz6J,IAAA,GACAlZ,EAAAkhL,IAAA,CAAAhoK,GACQwxK,EAAAxJ,IAAA,CAAA/wD,KAERj3G,EAAAgoK,IAAA,CAAAlhL,GACAmwH,EAAA+wD,IAAA,CAAAwJ,GACA,CAcA,OAJA,EAAA7gL,CALMA,EADN7J,IAAAA,EAAA2qL,IAAA,IACMD,EAENv6D,GAGAw6D,IAAA,KACA9gL,EAAAo3K,IAAA,CAAAh5J,GAGApe,CAAA,EAGA23C,EAAA7yC,SAAA,CAAAs0C,GAAA,UAAAz2B,CAAA,EACA,QAAA6yI,MAAA,UAAA7yI,EAAAyD,GAAA,MAAAzD,EAAA6yI,MAAA,eAAApvI,GAAA,GAGA,IAAAjwB,EAAA,KAAAmlB,KAAA,GACAjM,EAAAsT,EAAArH,KAAA,EACAnlB,CAAAA,EAAAk9K,QAAA,GAAAhkK,EAAAgkK,QAAA,GAIA,QAAAlhK,EAAA,EAAAhc,EAAAoqL,MAAA,IAAAlxK,EAAAkxK,MAAA,GAAApuK,IACAhc,EAAA0oL,MAAA,IACAxvK,EAAAwvK,MAAA,IAGA,QACA,KAAA1oL,EAAAoqL,MAAA,IACApqL,EAAA0oL,MAAA,IAEA,KAAAxvK,EAAAkxK,MAAA,IACAlxK,EAAAwvK,MAAA,IAGA,IAAApkL,EAAAtE,EAAA2zK,GAAA,CAAAz6J,GACA,GAAA5U,EAAA,GAEA,IAAAe,EAAArF,EACAA,EAAAkZ,EACQA,EAAA7T,CACR,SAAAf,IAAAA,GAAA4U,IAAAA,EAAAyxK,IAAA,IACA,MAGM3qL,EAAAkhL,IAAA,CAAAhoK,EAAA,CAGN,OAAAA,EAAAovK,MAAA,CAAAtsK,EAAA,EAIAwlC,EAAA7yC,SAAA,CAAAi8K,IAAA,UAAAp+J,CAAA,EACA,YAAA29J,IAAA,CAAA39J,GAAAxsB,CAAA,CAAA8pL,IAAA,CAAAt9J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAy7K,MAAA,YACA,cAAAznB,KAAA,SAGAnhH,EAAA7yC,SAAA,CAAA63G,KAAA,YACA,cAAAm8C,KAAA,SAIAnhH,EAAA7yC,SAAA,CAAAs7K,KAAA,UAAAz9J,CAAA,EACA,YAAAm2I,KAAA,IAAAn2I,CAAA,EAIAg1B,EAAA7yC,SAAA,CAAAk8K,KAAA,UAAA7L,CAAA,EACAl5K,EAAA,iBAAAk5K,GACA,IAAA16K,EAAA06K,EAAA,GACA95K,EAAA,CAAA85K,EAAA16K,CAAAA,EAAA,GAAAmuD,EAAA,GAAAnuD,EAIA,QAAAlD,MAAA,EAAA8D,EAGA,OAFA,KAAAm5K,OAAA,CAAAn5K,EAAA,GACA,KAAAy9J,KAAA,CAAAz9J,EAAA,EAAAutD,EACA,KAKA,QADAi/G,EAAAj/G,EACAjsD,EAAAtB,EAAAwsK,IAAAA,GAAAlrK,EAAA,KAAApF,MAAA,CAAAoF,IAAA,CACA,IAAA6xB,EAAA,OAAAsqI,KAAA,CAAAn8J,EAAA,CACA6xB,GAAAq5I,EACAA,EAAAr5I,IAAA,GACAA,GAAA,SACA,KAAAsqI,KAAA,CAAAn8J,EAAA,CAAA6xB,CACA,CAKA,OAJA,IAAAq5I,IACA,KAAA/O,KAAA,CAAAn8J,EAAA,CAAAkrK,EACA,KAAAtwK,MAAA,IAEA,MAGAogD,EAAA7yC,SAAA,CAAA0wJ,MAAA,YACA,gBAAAj+J,MAAA,WAAAuhK,KAAA,KAGAnhH,EAAA7yC,SAAA,CAAAg8K,IAAA,UAAAn+J,CAAA,MAQA3iB,EARAqzK,EAAA1wJ,EAAA,EAGA,YAAA0wJ,QAAA,GAAAA,EAAA,sBAAAA,QAAA,EAAAA,EAAA,SAMA,GAJA,KAAAY,MAAA,GAIA,KAAA18K,MAAA,GACMyI,EAAA,MACN,CACAqzK,GACA1wJ,CAAAA,EAAA,CAAAA,CAAA,EAEA1mB,EAAA0mB,GAAA,8BAGA,IAAA6L,EAAA,OAAAsqI,KAAA,IACA94J,EAAAwuB,IAAA7L,EAAA,EAAA6L,EAAA7L,EAAA,KACA,OACA,SAAA0wJ,QAAA,IAAArzK,EACAA,CADA,EAQA23C,EAAA7yC,SAAA,CAAAglK,GAAA,UAAAnnJ,CAAA,EACA,YAAA0wJ,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,uBAAAA,QAAA,EAAA1wJ,IAAAA,EAAA0wJ,QAAA,UAGA,IAAArzK,EAAA,KAAAihL,IAAA,CAAAt+J,UACA,SAAA0wJ,QAAA,IAAArzK,EACAA,CADA,EAKA23C,EAAA7yC,SAAA,CAAAm8K,IAAA,UAAAt+J,CAAA,EAEA,QAAAprB,MAAA,CAAAorB,EAAAprB,MAAA,kBAAAA,MAAA,CAAAorB,EAAAprB,MAAA,WAIA,QADAyI,EAAA,EACArD,EAAA,KAAApF,MAAA,GAAAoF,GAAA,EAAAA,IAAA,CACA,IAAAxG,EAAA,OAAA2iK,KAAA,CAAAn8J,EAAA,CAAA0S,EAAAsT,EAAAA,EAAAm2I,KAAA,CAAAn8J,EAAA,CAGA,GAAAxG,IAAAkZ,GACAlZ,EAAAkZ,EACQrP,EAAA,GACR7J,EAAAkZ,GACArP,CAAAA,EAAA,GAEA,MANA,CAQA,OAAAA,CAAA,EAGA23C,EAAA7yC,SAAA,CAAAo8K,GAAA,UAAAv+J,CAAA,EACA,gBAAAm+J,IAAA,CAAAn+J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAuzC,EAAA,UAAA11B,CAAA,EACA,gBAAAmnJ,GAAA,CAAAnnJ,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAq8K,IAAA,UAAAx+J,CAAA,EACA,YAAAm+J,IAAA,CAAAn+J,IAAA,GAGAg1B,EAAA7yC,SAAA,CAAAylK,GAAA,UAAA5nJ,CAAA,EACA,YAAAmnJ,GAAA,CAAAnnJ,IAAA,GAGAg1B,EAAA7yC,SAAA,CAAAs8K,GAAA,UAAAz+J,CAAA,EACA,iBAAAm+J,IAAA,CAAAn+J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAohD,EAAA,UAAAvjC,CAAA,EACA,iBAAAmnJ,GAAA,CAAAnnJ,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAu8K,IAAA,UAAA1+J,CAAA,EACA,eAAAm+J,IAAA,CAAAn+J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAA0lK,GAAA,UAAA7nJ,CAAA,EACA,eAAAmnJ,GAAA,CAAAnnJ,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAw8K,GAAA,UAAA3+J,CAAA,EACA,gBAAAm+J,IAAA,CAAAn+J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAye,EAAA,UAAAZ,CAAA,EACA,gBAAAmnJ,GAAA,CAAAnnJ,EAAA,EAOAg1B,EAAA5f,GAAA,UAAApV,CAAA,EACA,WAAA4+J,EAAA5+J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAA08K,KAAA,UAAAhrL,CAAA,EAGA,OAFAyF,EAAA,MAAA87B,GAAA,0CACA97B,EAAA,SAAAo3K,QAAA,kCACA78K,EAAAirL,SAAA,OAAAC,SAAA,CAAAlrL,EAAA,EAGAmhD,EAAA7yC,SAAA,CAAA68K,OAAA,YAEA,OADA1lL,EAAA,KAAA87B,GAAA,yDACA,KAAAA,GAAA,CAAA6pJ,WAAA,QAGAjqI,EAAA7yC,SAAA,CAAA48K,SAAA,UAAAlrL,CAAA,EAEA,OADA,KAAAuhC,GAAA,CAAAvhC,EACA,MAGAmhD,EAAA7yC,SAAA,CAAA+8K,QAAA,UAAArrL,CAAA,EAEA,OADAyF,EAAA,MAAA87B,GAAA,0CACA,KAAA2pJ,SAAA,CAAAlrL,EAAA,EAGAmhD,EAAA7yC,SAAA,CAAAg9K,MAAA,UAAAn/J,CAAA,EAEA,OADA1mB,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAn8B,GAAA,MAAA+mB,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAi9K,OAAA,UAAAp/J,CAAA,EAEA,OADA1mB,EAAA,KAAA87B,GAAA,wCACA,KAAAA,GAAA,CAAAq/I,IAAA,MAAAz0J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAk9K,MAAA,UAAAr/J,CAAA,EAEA,OADA1mB,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAA6f,GAAA,MAAAj1B,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAm9K,OAAA,UAAAt/J,CAAA,EAEA,OADA1mB,EAAA,KAAA87B,GAAA,wCACA,KAAAA,GAAA,CAAAs/I,IAAA,MAAA10J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAo9K,MAAA,UAAAv/J,CAAA,EAEA,OADA1mB,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAi7F,GAAA,MAAArwG,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAq9K,MAAA,UAAAx/J,CAAA,EAGA,OAFA1mB,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAqqJ,QAAA,MAAAz/J,GACA,KAAAoV,GAAA,CAAAkf,GAAA,MAAAt0B,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAu9K,OAAA,UAAA1/J,CAAA,EAGA,OAFA1mB,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAqqJ,QAAA,MAAAz/J,GACA,KAAAoV,GAAA,CAAA6iJ,IAAA,MAAAj4J,EAAA,EAGAg1B,EAAA7yC,SAAA,CAAAw9K,MAAA,YAGA,OAFArmL,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAA8iF,GAAA,QAGAljE,EAAA7yC,SAAA,CAAA09K,OAAA,YAGA,OAFAvmL,EAAA,KAAA87B,GAAA,wCACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAAymJ,IAAA,QAIA7mI,EAAA7yC,SAAA,CAAA29K,OAAA,YAGA,OAFAxmL,EAAA,KAAA87B,GAAA,wCACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAAmlF,IAAA,QAGAvlE,EAAA7yC,SAAA,CAAA49K,OAAA,YAGA,OAFAzmL,EAAA,KAAA87B,GAAA,wCACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAAgpJ,IAAA,QAIAppI,EAAA7yC,SAAA,CAAA69K,MAAA,YAGA,OAFA1mL,EAAA,KAAA87B,GAAA,uCACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAAgjF,GAAA,QAGApjE,EAAA7yC,SAAA,CAAA89K,MAAA,UAAAjgK,CAAA,EAGA,OAFA1mB,EAAA,KAAA87B,GAAA,GAAApV,EAAAoV,GAAA,sBACA,KAAAA,GAAA,CAAAwqJ,QAAA,OACA,KAAAxqJ,GAAA,CAAA4e,GAAA,MAAAh0B,EAAA,EAIA,IAAAkgK,EAAA,CACAC,KAAA,KACAC,KAAA,KACAC,KAAA,KACAC,OAAA,MAIA,SAAAC,EAAA5pL,CAAA,CAAA8kB,CAAA,EAEA,KAAA9kB,IAAA,CAAAA,EACA,KAAA8kB,CAAA,KAAAu5B,EAAAv5B,EAAA,IACA,KAAAznB,CAAA,MAAAynB,CAAA,CAAAm/F,SAAA,QAAApiH,CAAA,KAAAw8C,EAAA,GAAA8mI,MAAA,MAAA9nL,CAAA,EAAA0gL,IAAA,MAAAj5J,CAAA,EAGA,KAAAm6E,GAAA,MAAA4qF,IAAA,GAiDA,SAAAC,GAAA,CACAF,EAAAl+K,IAAA,CACA,KACA,OACA,0EACA,CA8DA,SAAAq+K,GAAA,CACAH,EAAAl+K,IAAA,CACA,KACA,OACA,iEACA,CAGA,SAAAs+K,GAAA,CACAJ,EAAAl+K,IAAA,CACA,KACA,OACA,wDACA,CAGA,SAAAu+K,GAAA,CAEAL,EAAAl+K,IAAA,CACA,KACA,QACA,sEACA,CA6CA,SAAAu8K,EAAA/gK,CAAA,EACA,oBAAAA,EAAA,CACA,IAAAgjK,EAAA7rI,EAAA8rI,MAAA,CAAAjjK,EACA,MAAAA,CAAA,CAAAgjK,EAAAplK,CAAA,CACM,KAAAolK,KAAA,CAAAA,CACN,MACAvnL,EAAAukB,EAAA0gK,GAAA,sCACA,KAAA1gK,CAAA,CAAAA,EACA,KAAAgjK,KAAA,MAoOA,SAAAE,EAAAljK,CAAA,EAAA+gK,EAAAv8K,IAAA,MAAAwb,GAGA,KAAArO,KAAA,MAAAqO,CAAA,CAAA+8F,SAAA,GACA,KAAAprG,KAAA,QACA,MAAAA,KAAA,UAAAA,KAAA,KAGA,KAAA1X,CAAA,KAAAk9C,EAAA,GAAA8mI,MAAA,MAAAtsK,KAAA,EACA,KAAAs3G,EAAA,MAAAk6D,IAAA,MAAAlpL,CAAA,CAAAogH,GAAA,SAAA+oE,IAAA,MAAAnpL,CAAA,CAAAmmL,MAAA,MAAApgK,CAAA,EAGA,KAAAqjK,IAAA,MAAAD,IAAA,CAAA3sI,GAAA,MAAAx8C,CAAA,EAAA6kL,KAAA,IAAA5oI,GAAA,MAAAl2B,CAAA,EACA,KAAAqjK,IAAA,MAAAA,IAAA,CAAA5D,IAAA,MAAAxlL,CAAA,EACA,KAAAopL,IAAA,MAAAppL,CAAA,CAAAm9C,GAAA,MAAAisI,IAAA,CACA,CA/aAX,EAAAp+K,SAAA,CAAAq+K,IAAA,YACA,IAAA5qF,EAAA,IAAA5gD,EAAA,MAEA,OADA4gD,EAAAugE,KAAA,OAAAzhK,KAAAC,IAAA,MAAAX,CAAA,MACA4hG,CAAA,EAGA2qF,EAAAp+K,SAAA,CAAAg/K,OAAA,UAAAnhK,CAAA,EAGA,IAAAohK,EAAAtpL,EAAAkoB,EAGA,GACA,KAAAzR,KAAA,CAAAzW,EAAA,KAAA89F,GAAA,EAGMwrF,EAAAtpL,CADNA,EAAAA,CADAA,EAAA,KAAAupL,KAAA,CAAAvpL,EAAA,EACA28K,IAAA,MAAA7+E,GAAA,GACMglB,SAAA,SAAAwmE,EAAA,KAAAptL,CAAA,EAGN,IAAAmzK,EAAAia,EAAA,KAAAptL,CAAA,IAAA8D,EAAAwmL,IAAA,MAAA7iK,CAAA,EAgBA,OAfA0rJ,IAAAA,GACArvK,EAAAq+J,KAAA,MACMr+J,EAAAlD,MAAA,IACNuyK,EAAA,EACMrvK,EAAA48K,IAAA,MAAAj5J,CAAA,EAEN3jB,KAAAL,IAAAK,EAAAwpL,KAAA,CAEQxpL,EAAAwpL,KAAA,GAGRxpL,EAAAw5K,MAAA,GAIAx5K,CAAA,EAGAyoL,EAAAp+K,SAAA,CAAAoM,KAAA,UAAAjX,CAAA,CAAA8xF,CAAA,EACA9xF,EAAA4kL,MAAA,MAAAloL,CAAA,GAAAo1F,EAAA,EAGAm3F,EAAAp+K,SAAA,CAAAk/K,KAAA,UAAArhK,CAAA,EACA,OAAAA,EAAAi4J,IAAA,MAAAz/K,CAAA,GAQAs8F,EAAA2rF,EAAAF,GAGAE,EAAAt+K,SAAA,CAAAoM,KAAA,UAAAjX,CAAA,CAAAuvB,CAAA,EAKA,QAJA3uB,EAAA,QAGAqpL,EAAA7sL,KAAoBorC,GAAA,CAAAxoC,EAAY1C,MAAA,IAChCoF,EAAA,EAAAA,EAAAunL,EAAAvnL,IACA6sB,EAAAsvI,KAAA,CAAAn8J,EAAA,CAAA1C,EAAA6+J,KAAA,CAAAn8J,EAAA,CAIA,GAHA6sB,EAAAjyB,MAAA,CAAA2sL,EAGAjqL,EAAA1C,MAAA,KACA0C,EAAA6+J,KAAA,MACA7+J,EAAA1C,MAAA,GACA,WAIA4wB,EAAAluB,EAAA6+J,KAAA,IAGA,IAAAn8J,EAAA,GAHA6sB,EAAAsvI,KAAA,CAAAtvI,EAAAjyB,MAAA,IAAA4wB,EAAAttB,EAGA8B,EAAA1C,EAAA1C,MAAA,CAAAoF,IAAA,CACA,IAAAxC,EAAAF,EAAAA,EAAA6+J,KAAA,CAAAn8J,EAAA,CACA1C,EAAA6+J,KAAA,CAAAn8J,EAAA,KAAAxC,EAAAU,CAAA,KAAAstB,IAAA,GACAA,EAAAhuB,CACA,CACAguB,KAAA,GACAluB,EAAA6+J,KAAA,CAAAn8J,EAAA,IAAAwrB,EACAA,IAAAA,GAAAluB,EAAA1C,MAAA,IACM0C,EAAA1C,MAAA,KAEN0C,EAAA1C,MAAA,GACA,EAGA6rL,EAAAt+K,SAAA,CAAAk/K,KAAA,UAAArhK,CAAA,EAEAA,EAAAm2I,KAAA,CAAAn2I,EAAAprB,MAAA,IACAorB,EAAAm2I,KAAA,CAAAn2I,EAAAprB,MAAA,MAAAorB,EAAAprB,MAAA,IAKA,QADAwY,EAAA,EACApT,EAAA,EAAAA,EAAAgmB,EAAAprB,MAAA,CAAAoF,IAAA,CACA,IAAA6xB,EAAA7L,EAAAA,EAAAm2I,KAAA,CAAAn8J,EAAA,CACAoT,GAAAye,IAAAA,EACA7L,EAAAm2I,KAAA,CAAAn8J,EAAA,CAAAoT,SAAAA,EACAA,EAAAye,GAAAA,EAAA,eAUA,OANA,IAAA7L,EAAAm2I,KAAA,CAAAn2I,EAAAprB,MAAA,MACAorB,EAAAprB,MAAA,GACA,IAAAorB,EAAAm2I,KAAA,CAAAn2I,EAAAprB,MAAA,KACAorB,EAAAprB,MAAA,IAGAorB,CAAA,EAQA80E,EAAA4rF,EAAAH,GAQAzrF,EAAA6rF,EAAAJ,GASAzrF,EAAA8rF,EAAAL,GAGAK,EAAAz+K,SAAA,CAAAk/K,KAAA,UAAArhK,CAAA,EAGA,QADAklJ,EAAA,EACAlrK,EAAA,EAAAA,EAAAgmB,EAAAprB,MAAA,CAAAoF,IAAA,CACA,IAAAyiG,EAAA,CAAAz8E,EAAAA,EAAAm2I,KAAA,CAAAn8J,EAAA,KAAAkrK,EACA93J,EAAAqvF,SAAAA,EAAAA,KAAA,GAGAz8E,EAAAm2I,KAAA,CAAAn8J,EAAA,CAAAoT,EACA83J,EAAAzoE,CACA,CAIA,OAHA,IAAAyoE,GACAllJ,CAAAA,EAAAm2I,KAAA,CAAAn2I,EAAAprB,MAAA,IAAAswK,CAAA,EAEAllJ,CAAA,EAIAg1B,EAAA8rI,MAAA,UAAAnqL,CAAA,MAIAkqL,EAHA,GAAAX,CAAA,CAAAvpL,EAAA,QAAAupL,CAAA,CAAAvpL,EAAA,CAIA,GAAAA,SAAAA,EACMkqL,EAAA,IAAAJ,OACN,GAAA9pL,SAAAA,EACMkqL,EAAA,IAAAH,OACN,GAAA/pL,SAAAA,EACMkqL,EAAA,IAAAF,OACN,GAAAhqL,WAAAA,EACMkqL,EAAA,IAAAD,OAEN,6BAAAjqL,EAAA,CAIA,OAHAupL,CAAA,CAAAvpL,EAAA,CAAAkqL,EAGAA,CAAA,EAkBAjC,EAAAz8K,SAAA,CAAAy9K,QAAA,UAAApsL,CAAA,EACA8F,EAAA9F,IAAAA,EAAAk9K,QAAA,kCACAp3K,EAAA9F,EAAA4hC,GAAA,qCAGAwpJ,EAAAz8K,SAAA,CAAAs9K,QAAA,UAAAjsL,CAAA,CAAAkZ,CAAA,EACApT,EAAA,CAAA9F,EAAAk9K,QAAA,CAAAhkK,EAAAgkK,QAAA,sCACAp3K,EAAA9F,EAAA4hC,GAAA,EAAA5hC,EAAA4hC,GAAA,GAAA1oB,EAAA0oB,GAAA,CACA,oCAGAwpJ,EAAAz8K,SAAA,CAAA6+K,IAAA,UAAAxtL,CAAA,cAAAqtL,KAAA,MAAAA,KAAA,CAAAM,OAAA,CAAA3tL,GAAAurL,SAAA,QAGA/N,EAAAx9K,EAAAA,EAAA8pL,IAAA,MAAAz/J,CAAA,EAAAkhK,SAAA,QACAvrL,EAJA,EAOAorL,EAAAz8K,SAAA,CAAAi2G,GAAA,UAAA5kH,CAAA,SACA,EAAAq/J,MAAA,GACAr/J,EAAAmlB,KAAA,GAGA,KAAAkF,CAAA,CAAAo3B,GAAA,CAAAzhD,GAAAurL,SAAA,MAHA,EAMAH,EAAAz8K,SAAA,CAAAlJ,GAAA,UAAAzF,CAAA,CAAAkZ,CAAA,OAAA+yK,QAAA,CAAAjsL,EAAAkZ,GAGA,IAAArP,EAAA7J,EAAAyF,GAAA,CAAAyT,GAIA,OAHArP,EAAA8pK,GAAA,MAAAtpJ,CAAA,MACAxgB,EAAAq3K,IAAA,MAAA72J,CAAA,EAEAxgB,EAAA0hL,SAAA,QAGAH,EAAAz8K,SAAA,CAAAsyK,IAAA,UAAAjhL,CAAA,CAAAkZ,CAAA,OAAA+yK,QAAA,CAAAjsL,EAAAkZ,GAGA,IAAArP,EAAA7J,EAAAihL,IAAA,CAAA/nK,GAIA,OAHArP,EAAA8pK,GAAA,MAAAtpJ,CAAA,MACAxgB,EAAAq3K,IAAA,MAAA72J,CAAA,EAEAxgB,CAAA,EAGAuhL,EAAAz8K,SAAA,CAAA8yC,GAAA,UAAAzhD,CAAA,CAAAkZ,CAAA,OAAA+yK,QAAA,CAAAjsL,EAAAkZ,GAGA,IAAArP,EAAA7J,EAAAyhD,GAAA,CAAAvoC,GAIA,OAHA,EAAArP,EAAA8gL,IAAA,KACA9gL,EAAAo3K,IAAA,MAAA52J,CAAA,EAEAxgB,EAAA0hL,SAAA,QAGAH,EAAAz8K,SAAA,CAAAuyK,IAAA,UAAAlhL,CAAA,CAAAkZ,CAAA,OAAA+yK,QAAA,CAAAjsL,EAAAkZ,GAGA,IAAArP,EAAA7J,EAAAkhL,IAAA,CAAAhoK,GAIA,OAHA,EAAArP,EAAA8gL,IAAA,KACA9gL,EAAAo3K,IAAA,MAAA52J,CAAA,EAEAxgB,CAAA,EAGAuhL,EAAAz8K,SAAA,CAAAkuH,GAAA,UAAA78H,CAAA,CAAAwsB,CAAA,EAEA,OADA,KAAA4/J,QAAA,CAAApsL,GACA,KAAAwtL,IAAA,CAAAxtL,EAAA+oL,KAAA,CAAAv8J,GAAA,EAGA4+J,EAAAz8K,SAAA,CAAA81K,IAAA,UAAAzkL,CAAA,CAAAkZ,CAAA,EAEA,OADA,KAAA+yK,QAAA,CAAAjsL,EAAAkZ,GACA,KAAAs0K,IAAA,CAAAxtL,EAAAykL,IAAA,CAAAvrK,GAAA,EAGAkyK,EAAAz8K,SAAA,CAAAmyC,GAAA,UAAA9gD,CAAA,CAAAkZ,CAAA,EAEA,OADA,KAAA+yK,QAAA,CAAAjsL,EAAAkZ,GACA,KAAAs0K,IAAA,CAAAxtL,EAAA8gD,GAAA,CAAA5nC,GAAA,EAGAkyK,EAAAz8K,SAAA,CAAA05K,IAAA,UAAAroL,CAAA,EACA,YAAAykL,IAAA,CAAAzkL,EAAAA,EAAAmlB,KAAA,KAGAimK,EAAAz8K,SAAA,CAAA+1G,GAAA,UAAA1kH,CAAA,EACA,YAAA8gD,GAAA,CAAA9gD,EAAAA,EAAA,EAGAorL,EAAAz8K,SAAA,CAAAo4G,IAAA,UAAA/mH,CAAA,KAAAA,EAAAq/J,MAAA,UAAAr/J,EAAAmlB,KAAA,GAGA,IAAA6oK,EAAA,KAAA3jK,CAAA,CAAA4/J,KAAA,IAIA,GAJAnkL,EAAAkoL,EAAA,MAIAA,IAAAA,EAAA,CACA,IAAAxtI,EAAA,KAAAn2B,CAAA,CAAA5kB,GAAA,KAAA+7C,EAAA,IAAAknI,MAAA,IACA,YAAAloI,GAAA,CAAAxgD,EAAAwgD,EAAA,KAMA,IAAAiS,EAAA,KAAApoC,CAAA,CAAAg/J,IAAA,IACAnkL,EAAA,EACA,CAAAutD,EAAA4sG,MAAA,IAAA5sG,IAAAA,EAAAw3H,KAAA,KACA/kL,IACAutD,EAAAi2H,MAAA,IACA5iL,EAAA,CAAA2sD,EAAA4sG,MAAA,IAGA,IAAA5qC,EAAA,IAAAjzE,EAAA,GAAA6pI,KAAA,OAAA4C,EAAAx5D,EAAA+3D,MAAA,GAKA0B,EAAA,KAAA7jK,CAAA,CAAAg/J,IAAA,IAAAX,MAAA,IACA9zJ,EAAA,KAAAvK,CAAA,CAAA+8F,SAAA,GAGA,IAHAxyF,EAAA,IAAA4sB,EAAA,EAAA5sB,EAAAA,GAAAy2J,KAAA,OAGA,SAAA7qI,GAAA,CAAA5rB,EAAAs5J,GAAAva,GAAA,CAAAsa,IACAr5J,EAAAg3J,OAAA,CAAAqC,GAOA,IAJA,IAAAhmI,EAAA,KAAAzH,GAAA,CAAA5rB,EAAA69B,GACAnuD,EAAA,KAAAk8C,GAAA,CAAAxgD,EAAAyyD,EAAA22H,IAAA,IAAAV,MAAA,KACArjL,EAAA,KAAAm7C,GAAA,CAAAxgD,EAAAyyD,GACApoC,EAAAnlB,EACAG,IAAAA,EAAAsuK,GAAA,CAAAl/C,IAAA,CAEA,QADAryB,EAAA/8F,EACAmB,EAAA,EAAA47F,IAAAA,EAAAuxE,GAAA,CAAAl/C,GAAAjuH,IACA47F,EAAAA,EAAA+pF,MAAA,GAEArmL,EAAAU,EAAA6jB,GAAA,IAAAnR,EAAA,KAAAsnC,GAAA,CAAAyH,EAAA,IAAAzG,EAAA,GAAA8mI,MAAA,CAAAj+J,EAAA7jB,EAAA,IAGAlC,EAAAA,EAAA0nL,MAAA,CAAA9yK,GACA+uC,EAAA/uC,EAAAizK,MAAA,GACA9mL,EAAAA,EAAA2mL,MAAA,CAAA/jI,GACA59B,EAAA7jB,CAAA,CAGA,OAAAlC,CAAA,EAGA8mL,EAAAz8K,SAAA,CAAAi8K,IAAA,UAAA5qL,CAAA,EACA,IAAA+lH,EAAA/lH,EAAAyqL,MAAA,MAAApgK,CAAA,SACA,IAAA07F,EAAAm3D,QAAA,EACAn3D,EAAAm3D,QAAA,GACM,KAAAsQ,IAAA,CAAAznE,GAAAymE,MAAA,IAEN,KAAAgB,IAAA,CAAAznE,EACA,EAGAqlE,EAAAz8K,SAAA,CAAA6xC,GAAA,UAAAxgD,CAAA,CAAAwsB,CAAA,EACA,GAAAA,EAAA6yI,MAAA,cAAA79G,EAAA,GAAA6pI,KAAA,UAAA7+J,IAAAA,EAAAm+J,IAAA,WAAA3qL,EAAAmlB,KAAA,GAGA,IAAA6iG,EAAA,EACAmmE,EAAA,SACAA,CAAAA,CAAA,QAAA3sI,EAAA,GAAA6pI,KAAA,OACA8C,CAAA,IAAAnuL,EACA,QAAAwG,EAAA,EAAAA,EAAA2nL,EAAA/sL,MAAA,CAAAoF,IACA2nL,CAAA,CAAA3nL,EAAA,MAAAs6C,GAAA,CAAAqtI,CAAA,CAAA3nL,EAAA,GAAAxG,GAGA,IAAA6J,EAAAskL,CAAA,IACAl1J,EAAA,EACAm1J,EAAA,EACA18I,EAAAllB,EAAA46F,SAAA,MAKA,IAJA,IAAA11E,GACAA,CAAAA,EAAA,IAGAlrC,EAAAgmB,EAAAprB,MAAA,GAAAoF,GAAA,EAAAA,IAAA,CAEA,QADA05F,EAAA1zE,EAAAm2I,KAAA,CAAAn8J,EAAA,CACAkuB,EAAAgd,EAAA,EAAAhd,GAAA,EAAAA,IAAA,CACA,IAAAsqJ,EAAA,GAAAtqJ,EAAA,EAKA,GAJA7qB,IAAAskL,CAAA,KACAtkL,CAAAA,EAAA,KAAA66G,GAAA,CAAA76G,EAAA,EAGAm1K,IAAAA,GAAA/lJ,IAAAA,EAAA,CACAm1J,EAAA,EACA,aAGA,EACAn1J,GAAA+lJ,EACAoP,CAAAA,EAAAA,IAAApmE,GAAAxhH,IAAAA,GAAAkuB,IAAAA,CAAA,IAGA7qB,EAAA,KAAAi3C,GAAA,CAAAj3C,EAAAskL,CAAA,CAAAl1J,EAAA,EACAm1J,EAAA,EACAn1J,EAAA,EACA,CACAyY,EAAA,GAGA,OAAA7nC,CAAA,EAGAuhL,EAAAz8K,SAAA,CAAA28K,SAAA,UAAA9+J,CAAA,MAAAloB,EAAAkoB,EAAAs9J,IAAA,MAAAz/J,CAAA,EAGA,OAAA/lB,IAAAkoB,EAAAloB,EAAA6gB,KAAA,GAAA7gB,CAAA,EAGA8mL,EAAAz8K,SAAA,CAAA88K,WAAA,UAAAj/J,CAAA,EACA,IAAA3iB,EAAA2iB,EAAArH,KAAA,GAEA,OADAtb,EAAA+3B,GAAA,MACA/3B,CAAA,EAOA23C,EAAA6sI,IAAA,UAAA7hK,CAAA,EACA,WAAA+gK,EAAA/gK,EAAA,EAkBA80E,EAAAisF,EAAAnC,GAGAmC,EAAA5+K,SAAA,CAAA28K,SAAA,UAAA9+J,CAAA,EACA,YAAAghK,IAAA,CAAAhhK,EAAAu8J,KAAA,MAAA/sK,KAAA,IAGAuxK,EAAA5+K,SAAA,CAAA88K,WAAA,UAAAj/J,CAAA,EACA,IAAAloB,EAAA,KAAAkpL,IAAA,CAAAhhK,EAAAs0B,GAAA,MAAA2sI,IAAA,GAEA,OADAnpL,EAAAs9B,GAAA,MACAt9B,CAAA,EAGAipL,EAAA5+K,SAAA,CAAA81K,IAAA,UAAAzkL,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,EAAAq/J,MAAA,IAAAnmJ,EAAAmmJ,MAAA,GAGA,OAFAr/J,EAAA2iK,KAAA,MACA3iK,EAAAoB,MAAA,GACApB,CAAA,CAGA,IAAAqF,EAAArF,EAAAykL,IAAA,CAAAvrK,GACA+uC,EAAA5iD,EAAA6jL,KAAA,MAAAltK,KAAA,EAAA8kC,GAAA,MAAA4sI,IAAA,EAAAzE,MAAA,MAAAjtK,KAAA,EAAA8kC,GAAA,MAAAz2B,CAAA,EACA8nC,EAAA9sD,EAAA67K,IAAA,CAAAj5H,GAAAygI,MAAA,MAAA1sK,KAAA,EAAAnS,EAAAsoD,EASA,OANAA,EAAAwhH,GAAA,MAAAtpJ,CAAA,KACMxgB,EAAAsoD,EAAA+uH,IAAA,MAAA72J,CAAA,EACN,EAAA8nC,EAAAw4H,IAAA,KACA9gL,CAAAA,EAAAsoD,EAAA8uH,IAAA,MAAA52J,CAAA,GAGAxgB,EAAA0hL,SAAA,QAGAgC,EAAA5+K,SAAA,CAAAmyC,GAAA,UAAA9gD,CAAA,CAAAkZ,CAAA,KAAAlZ,EAAAq/J,MAAA,IAAAnmJ,EAAAmmJ,MAAA,cAAA79G,EAAA,GAAA+pI,SAAA,OAGA,IAAAlmL,EAAArF,EAAA8gD,GAAA,CAAA5nC,GACA+uC,EAAA5iD,EAAA6jL,KAAA,MAAAltK,KAAA,EAAA8kC,GAAA,MAAA4sI,IAAA,EAAAzE,MAAA,MAAAjtK,KAAA,EAAA8kC,GAAA,MAAAz2B,CAAA,EACA8nC,EAAA9sD,EAAA67K,IAAA,CAAAj5H,GAAAygI,MAAA,MAAA1sK,KAAA,EACAnS,EAAAsoD,EAOA,OANAA,EAAAwhH,GAAA,MAAAtpJ,CAAA,KACMxgB,EAAAsoD,EAAA+uH,IAAA,MAAA72J,CAAA,EACN,EAAA8nC,EAAAw4H,IAAA,KACA9gL,CAAAA,EAAAsoD,EAAA8uH,IAAA,MAAA52J,CAAA,GAGAxgB,EAAA0hL,SAAA,QAGAgC,EAAA5+K,SAAA,CAAAi8K,IAAA,UAAA5qL,CAAA,EAGA,OAAA6J,IADA,CAAA2jL,IAAA,CAAAxtL,EAAAyqL,MAAA,MAAApgK,CAAA,EAAAy2B,GAAA,MAAAwyE,EAAA,GACAi4D,SAAA,MACC,CAA+B,EA19GhCtrL,EAAAJ,EAAAyuL,GAAA,CAAAruL,GA09GgC,qBAAAN,CAAA,CAAAO,CAAA,CAAAL,CAAA,eC19GnB,IAAAe,EAAAf,EAAA,aAEb+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAA,CAAA5zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,GACD,WAAA66C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACA6mE,EAAA,WAAAA,kBAA0C,EAAA5oE,CAAAA,OAA4B8C,MAAA,UAAA85C,CAAA,CAAA56C,CAAA,EACrEhC,OAAA8L,cAAA,CAAA8wC,EAAA,WAAA3zB,WAAA,GAAAtpB,MAAAqC,CAAA,EACD,WAAA46C,CAAA,CAAA56C,CAAA,EACC46C,EAAA,QAAA56C,CACD,GACA8iD,EAAA,WAAAA,UAAA,WAAAC,CAAA,CAAAnK,CAAA,CAAAh7C,CAAA,CAAAk9C,CAAA,EACA,IAAAjgD,EAAAmoD,EAAA3uB,UAAAl4B,MAAA,CAAAkD,EAAA2jD,EAAA,EAAApK,EAAAkC,IAAA,GAAAA,EAAAA,EAAA98C,OAAA+8C,wBAAA,CAAAnC,EAAAh7C,GAAAk9C,CAAA,CACA,oBAAAmI,SAAA,mBAA6CA,QAAQC,QAAA,CAAA7jD,EAAA4jD,QAAAC,QAAA,CAAAH,EAAAnK,EAAAh7C,EAAAk9C,QACrD,QAAAv5C,EAAAwhD,EAAA5mD,MAAA,GAAAoF,GAAA,EAAAA,IAAA1G,CAAAA,EAAAkoD,CAAA,CAAAxhD,EAAA,GAAAlC,CAAAA,EAAA,CAAA2jD,EAAA,EAAAnoD,EAAAwE,GAAA2jD,EAAA,EAAAnoD,EAAA+9C,EAAAh7C,EAAAyB,GAAAxE,EAAA+9C,EAAAh7C,EAAA,GAAAyB,CAAAA,CAAA,CACA,OAAA2jD,EAAA,GAAA3jD,GAAArB,OAAA8L,cAAA,CAAA8uC,EAAAh7C,EAAAyB,GAAAA,CAAA,EAEAwnE,EAAA,WAAAA,YAAA,WAAA/gD,CAAA,EACA,GAAAA,GAAAA,EAAArc,UAAA,QAAAqc,CAAA,CACA,IAAA5mB,EAAA,GACA,GAAA4mB,IAAA,EAAAA,EAAA,QAAA/lB,KAAA+lB,EAAA,YAAA/lB,GAAA/B,OAAA2L,cAAA,CAAAC,IAAA,CAAAkc,EAAA/lB,IAAA46C,EAAAz7C,EAAA4mB,EAAA/lB,EAAA,CAEA,OADA6mE,EAAA1nE,EAAA4mB,GACA5mB,CACA,EACA2mB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAA,CAAA7O,EAA+B,cAAA0C,MAAsB,KACrD1C,EAAAqlI,oBAAA,CAAArlI,EAAgColI,WAAA,CAAQplI,EAAO6I,SAAA,CAAA7I,EAAAquL,YAAA,CAAAruL,EAAAsuL,YAAA,CAAAtuL,EAAAuuL,UAAA,CAAAvuL,EAAAwuL,UAAA,CAAAxuL,EAAAyuL,UAAA,QAC/C,IAAA3iK,EAAAlB,EAA+BjrB,EAAQ,OACvC+uL,EAAA9jK,EAAAjrB,EAAA,OAEAwJ,EAAAyiE,EAAAjsE,EAAA,OACAgvL,EAAA,mBAAA39H,YAAuD7nD,EAAa6nD,WAAA,CAAAA,WAAA,CACpE49H,EAAA,IAAAD,EAAA,SAAAE,MAAA,KACA,SAAAJ,EAAA/rL,CAAA,EAIA,MAHsB,UAAtB,OAAAA,GACAA,CAAAA,EAAAhC,EAAA2d,IAAA,CAAA3b,EAAA,SAEAgsL,EAAA5nK,OAAA,CAAAnlB,MAAA,CAAAjB,EAAA2d,IAAA,CAAA3b,GACA,CAEA,SAAA8rL,EAAiB9rL,CAAA,EACjB,OAAAhC,EAAA2d,IAAA,CAAAqwK,EAAA5nK,OAAA,CAAA/N,MAAA,CAAArW,GACA,CAHA1C,EAAAyuL,UAAA,CAAAA,EAIAzuL,EAAAwuL,UAAA,CAAAA,EACA,IAAAM,EAAA,IACA,OAAAP,UAAA7gL,MACAzL,YAAAI,CAAA,EACA,MAAAA,GACA,KAAA0sL,SAAA,IACA,KAAAC,eAAA,CAAA3sL,CACA,CACA4sL,eAAA/6G,CAAA,EACA,KAAA66G,SAAA,CAAArlD,MAAA,KAAAx1D,GAEA,KAAA7xE,OAAA,MAAA2sL,eAAA,WAAAD,SAAA,CAAAtsL,IAAA,KACA,CACA,CACAzC,EAAAuuL,UAAA,CAAAA,CAEA,OAAAD,EACArsL,aAAA,CACA,KAAA+f,GAAA,CAAAthB,EAAAknB,KAAA,CAAAknK,GACA,KAAA5tL,MAAA,EACA,CACAguL,aAAA,CACA,KAAAltK,GAAA,CAAA9gB,MAAuB,CAAM,QAAAA,MAAA,EAC7B,MAAA8gB,GAAA,CAAAthB,EAAA01B,MAAA,OAAApU,GAAA,CAAAthB,EAAAknB,KAAA,CAAAknK,GAAA,EAEA,CACAK,QAAAzsL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAltK,GAAA,CAAA+oF,UAAA,CAAAroG,EAAA,KAAAxB,MAAA,EACA,KAAAA,MAAA,GACA,CACAkuL,SAAA1sL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAltK,GAAA,CAAA4hD,aAAA,CAAAlhE,EAAA,KAAAxB,MAAA,EACA,KAAAA,MAAA,GACA,CACAmuL,SAAA3sL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAltK,GAAA,CAAAlH,aAAA,CAAApY,EAAA,KAAAxB,MAAA,EACA,KAAAA,MAAA,GACA,CACAouL,SAAA5sL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAK,WAAA,CAAA7uL,EAAA2d,IAAA,KAAAyN,EAAAhF,OAAA,CAAApkB,GAAA+kB,OAAA,UACA,CACA+nK,UAAA9sL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAK,WAAA,CAAA7uL,EAAA2d,IAAA,KAAAyN,EAAAhF,OAAA,CAAApkB,GAAA+kB,OAAA,WACA,CACAgoK,UAAA/sL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAK,WAAA,CAAA7uL,EAAA2d,IAAA,KAAAyN,EAAAhF,OAAA,CAAApkB,GAAA+kB,OAAA,WACA,CACAioK,UAAAhtL,CAAA,EACA,KAAAwsL,WAAA,GACA,KAAAK,WAAA,CAAA7uL,EAAA2d,IAAA,KAAAyN,EAAAhF,OAAA,CAAApkB,GAAA+kB,OAAA,WACA,CACA8nK,YAAAltK,CAAA,EAEA,IAAY,CAAAL,GAAA,CAAMthB,EAAA01B,MAAA,EAClB11B,EAAA2d,IAAA,MAAA2D,GAAA,CAAAspD,QAAA,QAAApqE,MAAA,GACYmhB,EACZ3hB,EAAAknB,KAAA,CAAAknK,GACA,EACA,KAAA5tL,MAAA,EAAAmhB,EAAAnhB,MAAA,CAEAyuL,YAAA7kK,CAAA,EACA,KAAAokK,WAAwB,GACxB,IAAAl2K,EAAAtY,EAAA2d,IAAA,CAAAyM,EAAA,QACA,KAAAukK,QAAA,CAAAr2K,EAAA9X,MAAA,EACA,KAAAquL,WAAA,CAAAv2K,EACA,CACA42K,gBAAAhvL,CAAyB,EACzB,KAAA2uL,WAAA,CAAA7uL,EAAA2d,IAAA,CAAAzd,GACA,CACAivL,WAAAjvL,CAAA,CAAAi2B,CAAA,EAGA,QAAAi/D,KAFA,KAAAo5F,WAAA,GACA,KAAAG,QAAA,CAAAzuL,EAAAM,MAAA,EACAN,GACA,KAAAsuL,WAAA,GACAr4J,EAAAi/D,EAEA,CACAruE,SAAA,CACA,YAAAzF,GAAA,CAAAspD,QAAA,QAAApqE,MAAA,CACA,CACA,CAEA,SAAA4uL,EAAAnyI,CAAA,CAAAoyI,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAttL,KAAA,CACAstL,EAAAttL,KAAA,aAAA8G,CAAA,EACA,IACA,OAAAymL,EAAAlvL,KAAA,MAAAyI,EACA,CACA,MAAAnC,EAAA,CACA,GAAAA,aAAAilG,WAAA,CACA,IAAA/hG,EAAAlD,EAAAkD,IAAA,CACA,mDAAA2V,OAAA,CAAA3V,IAAA,EACA,UAAAgkL,EAAA,gDAEA,MACAlnL,CAAA,CAEA,CACA,CAjBArH,EAAAsuL,YAAA,CAAAA,CAkBA,OAAAD,EACApsL,YAAA+f,CAAA,EACA,KAAAA,GAAA,CAAAA,EACA,KAAA/I,MAAA,EACA,CACAi3K,QAAA,CACA,IAAAxtL,EAAA,KAAAsf,GAAA,CAAA0nF,SAAA,MAAAzwF,MAAA,EAEA,OADA,KAAAA,MAAA,IACAvW,CACA,CACAytL,SAAA,CACA,IAAAztL,EAAA,KAAAsf,GAAA,CAAA4nF,YAAA,MAAA3wF,MAAA,EAEA,OADA,KAAAA,MAAA,IACAvW,CACA,CACA0tL,SAAA,CACA,IAAA1tL,EAAA,KAAAsf,GAAA,CAAApH,YAAA,MAAA3B,MAAA,EAEA,OADA,KAAAA,MAAA,IACAvW,CACA,CACA2tL,SAAA,CACA,IAAAruK,EAAA,KAAAsuK,UAAA,IACA,WAAAxkK,EAAAhF,OAAA,CAAA9E,EAAA,KACA,CACAuuK,UAAA,CACA,IAAAvuK,EAAA,KAAAsuK,UAAA,KACA,WAAAxkK,EAAAhF,OAAA,CAAA9E,EAAA,KACA,CACAwuK,UAAA,CACA,IAAAxuK,EAAA,KAAAsuK,UAAA,KACA,WAAAxkK,EAAAhF,OAAA,CAAA9E,EAAA,KACA,CACAyuK,UAAA,CACA,IAAAzuK,EAAA,KAAAsuK,UAAA,KACA,WAAAxkK,EAAAhF,OAAA,CAAA9E,EAAA,KACA,CACAsuK,WAAA52J,CAAA,EACA,QAAAzgB,MAAA,CAAAygB,EAAA,KAAA1X,GAAA,CAAA9gB,MAAA,CACA,UAAAqtL,EAAA,0BAAA70J,EAAA,uBAEA,IAAAz1B,EAAA,KAAA+d,GAAA,CAAA1gB,KAAA,MAAA2X,MAAA,MAAAA,MAAA,CAAAygB,GAEA,OADA,KAAAzgB,MAAA,EAAAygB,EACAz1B,CACA,CACAysL,YAAA,CACA,IAAAh3J,EAAA,KAAA02J,OAAA,GACApuK,EAAA,KAAAsuK,UAAA,CAAA52J,GACA,IAEA,OAAAk1J,EAAA71K,MAAA,CAAAiJ,EACA,CACA,MAAA3a,EAAA,CACA,UAAAknL,EAAA,gCAAAlnL,EAAA,GAEA,CACAspL,eAAAj3J,CAAA,EACA,WAAAltB,WAAA,KAAA8jL,UAAA,CAAA52J,GACA,CACAk3J,UAAA/5J,CAAA,EACA,IAAA6C,EAAA,KAAA02J,OAAA,GACAnsL,EAAAnD,EAAwB,CACxB,QAAAwF,EAAA,EAAAA,EAAAozB,EAAA,EAAApzB,EACArC,EAAAzE,IAAA,CAAAq3B,KAEA,OAAA5yB,CACA,CACA,CAgCA,SAAA4sL,EAAA9pL,CAAA,EACA,OAAAA,EAAA4jB,MAAA,IAAA9G,WAAA,GAAA9c,EAAAzF,KAAA,GACA,CACA,SAAAwvL,EAAApsL,CAAA,CAAAwvE,CAAA,CAAAxxE,CAAA,CAAAquL,CAAA,CAAAC,CAAA,EACA,IAEA,oBAAAD,EACAC,CAAA,SAAAH,EAAAE,GAAA,GAAAruL,QAEA,GAAAquL,aAAAjwL,OACA,oBAAAiwL,CAAA,KACA,GAAAruL,EAAAxB,MAAA,GAAA6vL,CAAA,IACA,UAAAxC,EAAA,kCAAAwC,CAAA,gBAAAruL,EAAAxB,MAAA,UAEA8vL,EAAApB,eAAA,CAAAltL,EACA,MACA,GAAAquL,IAAAA,EAAA7vL,MAAA,mBAAA6vL,CAAA,KACA,GAAAruL,EAAAxB,MAAA,GAAA6vL,CAAA,IACA,UAAAxC,EAAA,kCAAAwC,CAAA,gBAAAruL,EAAAxB,MAAA,UAEA,QAAAoF,EAAA,EAAAA,EAAAyqL,CAAA,IAAAzqL,IACAwqL,EAAApsL,EAAA,KAAAhC,CAAA,CAAA4D,EAAA,CAAAyqL,CAAA,IAAAC,EAEA,MAEAA,EAAAnB,UAAA,CAAAntL,EAAA,IACiBouL,EAAApsL,EAAAwvE,EAAA5kC,EAAAyhJ,CAAA,IAAAC,EACjB,EACA,MAEA,GAAAD,KAAAhtL,IAAAgtL,EAAAp7H,IAAA,CACA,OAAAo7H,EAAAp7H,IAAA,EACA,aACAjzD,MAAAA,EACAsuL,EAAA7B,OAAA,KAGA6B,EAAA7B,OAAA,IACA2B,EAAApsL,EAAAwvE,EAAAxxE,EAAAquL,EAAAnuL,IAAA,CAAAouL,IAEA,UAEA,MACAA,EAAA3B,QAAA,CAAA3sL,EAAA7B,IAAA,EACA6B,EAAAyK,OAAA,EAAAkgC,EAAA1qC,IAAA,CACAmuL,EAAApsL,EAAAwvE,EAAAvxE,EAAAouL,EAAApuL,GAAA,CAAAquL,GACqBF,EAAApsL,EAAAwvE,EAAA7mC,EAAA0jJ,EAAAruL,KAAA,CAAAsuL,EACrB,GACA,cAGA,UAAAzC,EAAA,aAAAwC,EAAA,qBAIAE,EAAAvsL,EAAAhC,EAAAsuL,EACA,CAEA,MAAA9qL,EAAA,CAIA,MAHAA,aAAAqoL,GACAroL,EAAA+oL,cAAA,CAAA/6G,GAEAhuE,CAAA,CAEA,CACA,SAAA+qL,EAAAvsL,CAAA,CAAAib,CAAA,CAAAqxK,CAAA,EACA,sBAAArxK,EAAAuxK,cAAA,EACAvxK,EAAAuxK,cAAA,CAAAF,GACA,MACA,KACAG,EAAAzsL,EAAAqe,GAAA,CAAApD,EAAA1d,WAAA,EACA,IAAAkvL,EACA,UAAA5C,EAAA,SAAA5uK,EAAA1d,WAAA,CAAAgB,IAAA,yBAEA,GAAAkuL,WAAAA,EAAAx7H,IAAA,CACAw7H,EAAAh2K,MAAA,CAAAha,GAAA,GAAA+yE,EAAA68G,EAAA,IACSD,EAAApsL,EAAAwvE,EAAAv0D,CAAA,CAAAu0D,EAAA,CAAA68G,EAAAC,EACT,QAEA,GAAAG,SAAAA,EAAAx7H,IAAA,EACA,IAAA1yD,EAAA0c,CAAA,CAAAwxK,EAA0Bl9G,KAAA,EAC1B,QAAA7rE,EAAA,EAAAA,EAAA+oL,EAAA53K,MAAA,CAAArY,MAAA,GAAAkH,EAAA,CACA,IAAA8rE,EAAA68G,EAAA,CAAAI,EAAA53K,MAAA,CAAAnR,EAAA,CACA,GAAA8rE,IAAAjxE,EAAA,CACA+tL,EAAA7B,OAAA,CAAA/mL,GACA0oL,EAAApsL,EAAAwvE,EAAAv0D,CAAA,CAAAu0D,EAAA,CAAA68G,EAAAC,GACA,MACA,CAEA,MAEA,UAAAzC,EAAA,2BAAA4C,EAAAx7H,IAAA,QAAAh2C,EAAA1d,WAAA,CAAAgB,IAAA,IAKA,SAAA4F,EAAAnE,CAAA,CAAAib,CAAA,CAAAyxK,EAAA9C,CAAA,EACA,IAAA0C,EAAA,IAAAI,EAEA,OADAH,EAAAvsL,EAAAib,EAAAqxK,GACAA,EAAAvpK,OAAA,EACA,CAEA,SAAA4pK,EAAA3sL,CAAA,CAAAwvE,CAAA,CAAA68G,CAAA,CAAA1vK,CAAA,EACA,IACA,oBAAA0vK,EACA,OAAA1vK,CAAA,QAAAwvK,EAAAE,GAAA,IACA,CACA,GAAAA,aAAAjwL,MAAA,CACA,oBAAAiwL,CAAA,IACA,OAAA1vK,EAAAsvK,cAAA,CAAAI,CAAA,IAWA,CATA,oBAAAA,CAAA,IAQA,OAAA1vK,EAAAuvK,SAAA,KAAAS,EAAA3sL,EAAAwvE,EAAA68G,CAAA,IAAA1vK,GACA,EARA,IAAAysD,EAAA,GACA,QAAAxnE,EAAA,EAAAA,EAAAyqL,CAAA,IAAAzqL,IACAwnE,EAAAtuE,IAAA,CAAA6xL,EAAA3sL,EAAA,KAAAqsL,CAAA,IAAA1vK,IAEA,OAAAysD,CACA,CAIA,IACAijH,WAAAA,EAAAp7H,IAAA,EACA,IAAA1uC,EAAA5F,EAAA6uK,MAAA,GACA,GAAAjpK,EACA,OAAAoqK,EAAA3sL,EAAAwvE,EAAA68G,EAAAnuL,IAAA,CAAAye,EACA,CACA,MACA,IACA0vK,QAAAA,EAAAp7H,IAAA,EACA,IAAAx0D,EAAA,IAAAiE,IACAlE,EAAAmgB,EAA4B+uK,OAAY,GACxC,QAAA9pL,EAAA,EAAAA,EAAApF,EAAAoF,IAAA,CACA,IAAA3D,EAAA0uL,EAAA3sL,EAAAwvE,EAAA68G,EAAApuL,GAAA,CAAA0e,GACAgsB,EAAAgkJ,EAAA3sL,EAAAwvE,EAAA68G,EAAAruL,KAAA,CAAA2e,GACAlgB,EAAAkE,GAAA,CAAA1C,EAAA0qC,EACA,CACA,OAAAlsC,CACA,QACAmwL,EAAA5sL,EAAAqsL,EAAA1vK,EACA,CACA,MAAAnb,EAAA,CAIA,MAHAA,aAAAqoL,GACAroL,EAAA+oL,cAAA,CAAA/6G,GAEAhuE,CAAA,CAEA,CACA,SAAAorL,EAAA5sL,CAAA,CAAA6sL,CAAA,CAAAlwK,CAAA,EACA,sBAAAkwK,EAAAC,gBAAA,CACA,OAAAD,EAAAC,gBAAA,CAAAnwK,EACA,CACA,IAAA8vK,EAAAzsL,EAAAqe,GAAA,CAAAwuK,GACA,IAAAJ,EACA,UAAA5C,EAAA,SAAAgD,EAAAtuL,IAAA,yBAEA,GAAAkuL,WAAAA,EAAAx7H,IAAA,EACA,IAAA1xD,EAAA,GACA,QAAAiwE,EAAA68G,EAAA,GAAArsL,EAAAqe,GAAA,CAAAwuK,GAAAp2K,MAAA,CACAlX,CAAA,CAAAiwE,EAAA,CAAAm9G,EAAA3sL,EAAAwvE,EAAA68G,EAAA1vK,GAEA,WAAAkwK,EAAAttL,EACA,IACAktL,SAAAA,EAAAx7H,IAAA,EACA,IAAAvtD,EAAAiZ,EAAA6uK,MAAA,GACA,GAAA9nL,GAAA+oL,EAAA53K,MAAA,CAAArY,MAAA,CACA,UAAAqtL,EAAA,eAAAnmL,EAAA,mBAEA,IAAA8rE,EAAA68G,EAAA,CAAAI,EAAA53K,MAAA,CAAAnR,EAAA,CACA+2E,EAAAkyG,EAA+B3sL,EAAAwvE,EAAyB68G,EAAA1vK,GACxD,WAAAkwK,EAAA,EAAAr9G,EAAA,CAAAiL,CAAA,EACA,OACA,IAAAovG,EAAA,2BAAA4C,EAAAx7H,IAAA,QAAA47H,EAAAtvL,WAAA,CAAAgB,IAAA,IAGA,SAAAmiI,EAAA1gI,CAAA,CAAA6sL,CAAA,CAAAlvK,CAAA,CAAAovK,EAAApD,CAAA,EACA,IAAAhtK,EAAA,IAAAowK,EAAApvK,GACApe,EAAAqtL,EAAA5sL,EAAA6sL,EAAAlwK,GACA,GAAAA,EAAApI,MAAA,CAAAoJ,EAAAnhB,MAAA,CACA,UAAAqtL,EAAA,cAAAlsK,EAAAnhB,MAAA,CAAAmgB,EAAApI,MAAA,kCAEA,OAAAhV,CACA,CAGA,SAAAohI,EAAA3gI,CAAA,CAAA6sL,CAAA,CAAAlvK,CAAA,CAAAovK,EAAApD,CAAA,EACA,IAAAhtK,EAAA,IAAAowK,EAAApvK,GACA,OAAAivK,EAAA5sL,EAAA6sL,EAAAlwK,EACA,CA3NAwmC,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,gBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,iBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,iBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,iBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,kBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,kBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,kBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,oBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAA,wBACAo5C,EAAA,CACAioI,EACA,CAAAzB,EAAA5/K,SAAoB,mBACpBzO,EAAAquL,YAAA,CAAAA,EAsGAruL,EAAA6I,SAAA,CAAAA,EAkFA7I,EAAAolI,WAAA,CAAAA,EAK4BplI,EAAAqlI,oBAAA,CAAAA,CAAA,gBAAAtlI,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECtb5B,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAhpB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECFA,IAAAmpB,EAAAnpB,EAAA,MAAAopB,EAAA,4DAEAhpB,CAAAA,EAAAC,OAAA,CAAA8oB,EAAAC,EAAA,gBAAAhpB,CAAA,ECHY,aAOZ,SAAAuwC,EAAAvnB,CAAA,EACA,GAAAA,EAAA7nB,MAAA,2CAEA,QADA6vK,EAAA,IAAkBvkK,WAAA,KAClBgoB,EAAA,EAAAA,EAAAu8I,EAAA7vK,MAAA,CAAAszB,IACAu8I,CAAA,CAAAv8I,EAAA,KAEA,QAAAluB,EAAA,EAAAA,EAAAyiB,EAAA7nB,MAAA,CAAAoF,IAAA,CACA,IAAAlD,EAAA2lB,EAAA4B,MAAA,CAAArkB,GACA0qK,EAAA5tK,EAAAutB,UAAA,IACA,GAAAogJ,MAAAA,CAAA,CAAAC,EAAA,iBAAA5tK,EAAA,iBACA2tK,CAAA,CAAAC,EAAA,CAAA1qK,CACA,CATA,IAUA8hH,EAAAr/F,EAAA7nB,MAAA,CACA+vK,EAAAloJ,EAAA4B,MAAA,IACAumJ,EAAAlwK,KAAA2zD,GAAA,CAAAyzD,GAAApnH,KAAA2zD,GAAA,MACAw8G,EAAAnwK,KAAA2zD,GAAA,MAAA3zD,KAAA2zD,GAAA,CAAAyzD,GA8CA,SAAAgpD,EAAA9nJ,CAAA,EACA,oBAAAA,EAA+B,mCAC/B,GAAAA,IAAAA,EAAApoB,MAAA,YAAAsL,UAAA,CAKA,IAJA,IAAA6kK,EAAA,EAEAC,EAAA,EACApwK,EAAA,EACAooB,CAAA,CAAA+nJ,EAAA,GAAAJ,GACAK,IACAD,IAMA,IAHA,IAAAxwK,EAAA,CAAAyoB,EAAApoB,MAAA,CAAAmwK,CAAA,EAAAH,EAAA,MACAK,EAAA,IAAA/kK,WAAA3L,GAEAyoB,CAAA,CAAA+nJ,EAAA,GAEA,IAAAG,EAAAT,CAAA,CAAAznJ,EAAAqH,UAAA,CAAA0gJ,GAAA,CAEA,GAAAG,MAAAA,EAAA,OAEA,QADAlrK,EAAA,EACAmrK,EAAA5wK,EAAA,GAAA2wK,IAAAA,GAAAlrK,EAAApF,CAAA,GAAAuwK,KAAAA,EAAAA,IAAAnrK,GAAA,CACAkrK,GAAA,EAAAD,CAAA,CAAAE,EAAA,KACAF,CAAA,CAAAE,EAAA,WACAD,EAAA,UAEA,GAAAA,IAAAA,EAAA,8BACAtwK,EAAAoF,EACA+qK,GACA,CAGA,IADA,IAAAK,EAAA7wK,EAAAK,EACAwwK,IAAA7wK,GAAA0wK,IAAAA,CAAA,CAAAG,EAAA,EACAA,IAIA,IAFA,IAAAC,EAAA,IAAAnlK,WAAA8kK,EAAAzwK,CAAAA,EAAA6wK,CAAA,GACAl9I,EAAA88I,EACAI,IAAA7wK,GACA8wK,CAAA,CAAAn9I,IAAA,CAAA+8I,CAAA,CAAAG,IAAA,CAEA,OAAAC,CACA,CACA,SAAA54J,EAAAhS,CAAA,EACA,IAAAsb,EAAA+uJ,EAAkBrqK,GAClB,GAAAsb,EAAA,OAAAA,CAAA,OACA,iBAAA+lG,EAAA,cAEA,OACAzmH,OA7FA,SAAA2nB,CAAA,EAOA,GANMA,aAAA9c,aACNwT,YAAAC,MAAA,CAAAqJ,GACMA,EAAA,IAAA9c,WAAA8c,EAAAjH,MAAA,CAAAiH,EAAAu0C,UAAA,CAAAv0C,EAAAlH,UAAA,EACNthB,MAAA6D,OAAA,CAAA2kB,IACAA,CAAAA,EAAA9c,WAAA6R,IAAA,CAAAiL,EAAA,GAEA,CAAAA,CAAAA,aAAA9c,UAA+B,yCAC/B,GAAA8c,IAAAA,EAAApoB,MAAA,UAMA,IAJA,IAAAowK,EAAA,EACApwK,EAAA,EACA0wK,EAAA,EACAC,EAAAvoJ,EAAApoB,MAAA,CACA0wK,IAAAC,GAAAvoJ,IAAAA,CAAA,CAAAsoJ,EAAA,EACAA,IACAN,IAMA,IAHA,IAAAzwK,EAAA,CAAAgxK,EAAAD,CAAA,EAAAT,EAAA,MACAW,EAAA,IAAAtlK,WAAA3L,GAEA+wK,IAAAC,GAAA,CAIA,QAHAL,EAAAloJ,CAAA,CAAAsoJ,EAAA,CAEAtrK,EAAA,EACAyrK,EAAAlxK,EAAA,GAAA2wK,IAAAA,GAAAlrK,EAAApF,CAAA,GAAA6wK,KAAAA,EAAAA,IAAAzrK,GAAA,CACAkrK,GAAA,IAAAM,CAAA,CAAAC,EAAA,KACAD,CAAA,CAAAC,EAAA,GAAA3pD,IAAA,EACAopD,EAAA,EAAAppD,IAAA,EAEA,GAAAopD,IAAAA,EAAA,8BACAtwK,EAAAoF,EACAsrK,GACA,CAGA,IADA,IAAAI,EAAAnxK,EAAAK,EACA8wK,IAAAnxK,GAAAixK,IAAAA,CAAA,CAAAE,EAAA,EACAA,IAIA,IADA,IAAAlnJ,EAAWmmJ,EAAArI,MAAY,CAAA0I,GACvBU,EAAAnxK,EAAA,EAAAmxK,EAAAlnJ,GAAA/B,EAAA4B,MAAA,CAAAmnJ,CAAA,CAAAE,EAAA,EACA,OAAAlnJ,CACA,EAkDAsmJ,aAAAA,EACAr4J,OAAAA,CACA,CACA,CAAAhZ,EAAAC,OAAA,CAAAswC,CAAA,eAAA7wC,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCxHA,IAAAe,EAAAf,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAkIA,GAqBA,MAAA8Y,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EACA,IAAAC,OAAAC,SAAA,CAAAH,GACA,2CAWA,KAAAA,IAAA,CAAAA,EAWA,KAAAC,QAAA,CAAAA,CAAA,CAkBAG,uBAAA,CACA,SAeAC,OAAAC,CAAA,CAAAC,CAAA,EACA,kCAyBAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,kCAmBAE,QAAAH,CAAA,CAAAC,CAAA,EACA,UAAAP,IAAA,CACA,uCAEA,YAAAA,IAAA,CAmBAU,UAAAT,CAAA,EACA,IAAAU,EAAAtW,OAAA8C,MAAA,MAAA5D,WAAA,CAAAwM,SAAA,EAGA,OAFA1L,OAAAC,MAAA,CAAAqW,EAAA,MACAA,EAAAV,QAAA,CAAAA,EACAU,CAAA,CAuBAC,UAAAC,CAAA,EAEA,CACA,CAQA,SAAAE,EAAAxW,CAAA,CAAAyW,CAAA,SACA,EAAAf,QAAA,CACA1V,EAAA,IAAAyW,EAAAf,QAAA,KAEA1V,CADA,CAgCA,SAAAu6F,EAAAiB,CAAA,CAAA3kF,CAAA,EACA,sBAAA2kF,EACA,6CAEA,GAAAA,EAAA/vF,cAAA,YACA,kDAEA,IAAAoL,CAAAA,GAAAA,aAAArB,CAAA,EACA,2CAEA,GAAAqB,EAAApL,cAAA,sBACA,wDAEA+vF,EAAAC,OAAA,CAAA5kF,EACAA,EAAA6kF,iBAAA,CAAAF,EACA3kF,EAAAhB,qBAAA,SAAA2lF,EACA17F,OAAA8L,cAAA,CAAA4vF,EAAAhwF,SAAA,WACA/L,MAAA,SAAAsW,CAAA,CAAAC,CAAA,EACK,OAAAa,EAAAnY,MAAA,MAAAqX,EAAAC,EACL,EACG8mC,SAAA,EACH,GACAh9C,OAAA8L,cAAA,CAAA4vF,EAAA,UACA/7F,MAAA,SAAAsW,CAAA,CAAAC,CAAA,EACK,OAAAa,EAAAf,MAAA,CAAAC,EAAAC,EACL,EACG8mC,SAAA,EACH,EACA,CAvEc//C,EAAAyY,MAAA,CAAAA,EAaUzY,EAAAyZ,gBAAA,CAAAA,EA0DKzZ,EAAAw9F,qBAAA,CAAAA,CAwB7B,OAAA7jF,UAAAlB,EAYAmB,SAAA,CACA,0CACA,CAkBA,MAAA2jF,UAAA5jF,EACA1X,YAAA28F,CAAA,CAAAjmF,CAAA,EAIA,GAHA5U,KAAAA,IAAA66F,GACAA,CAAAA,EAAA,GAEA,CAAAhmF,OAAAC,SAAA,CAAA+lF,IAAA,GAAAA,EACA,4DACA,SAAAjmF,GAMA,KAAAimF,WAAA,CAAAA,CAAA,CAIAhlF,SAAA,CACA,SAIAb,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4lF,EAAA7lF,EAAA9X,MAAA,CAAA+X,EACA,OAAAjY,KAAAwZ,KAAA,CAAAqkF,EAAA,KAAAD,WAAA,EAIAj9F,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,QACA,EAuBA,MAAAY,UAAAF,EACA1X,YAAA6X,CAAA,CAAAb,CAAA,CAAAN,CAAA,EACA,IAAAmB,CAAAA,aAAArB,CAAA,EACA,2CAGA,GAAA1U,KAAAA,IAAAkV,EACMA,EAAA,OACN,IAAAL,OAAAC,SAAA,CAAAI,GACA,uDAEA,MAAAa,EAAApB,IAAA,CAAAC,GAAAmB,EAAAnB,QAAA,EAGA,KAAAmB,MAAA,CAAAA,EASA,KAAAb,MAAA,CAAAA,CAAA,CAIAW,SAAA,CACA,YAAAE,MAAA,YAAAC,GACA,KAAAD,MAAA,YAAAE,CAAA,CAIAjB,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,KAAAA,MAAA,EAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,KAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,KAAAA,MAAA,CACA,EAmBA,MAAAc,UAAAtB,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAiB,UAAA,CAAAhB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAkB,WAAA,CAAAhB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAAsB,UAAAvB,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAmB,UAAA,CAAAlB,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAoB,WAAA,CAAAlB,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAA4kF,UAAA7kF,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA8lF,SAAA,CAAA7lF,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA+lF,UAAA,CAAA7lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAmBA,MAAA2kF,UAAA5kF,EACAxW,YAAAyW,CAAA,CAAAC,CAAA,EAEA,GADA,MAAAD,EAAAC,GACA,OAAAD,IAAA,CACA,iDAKAK,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAgmF,SAAA,CAAA/lF,EAAA,KAAAP,IAAA,EAIA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAimF,UAAA,CAAA/lF,EAAAD,EAAA,KAAAP,IAAA,EACA,KAAAA,IAAA,CACA,CAEA,IAAA2B,EAAArZ,WAKA,SAAAsZ,EAAApB,CAAA,EACA,IAAAqB,EAAAvZ,KAAAwZ,KAAA,CAAAtB,EAAAmB,GACAI,EAAUvB,EAAAqB,EAAAF,EACV,OAAAE,KAAAA,EAAAE,KAAAA,CAAA,CACA,CAEA,SAAAC,EAAAH,CAAA,CAAAE,CAAA,EACA,OAAAF,EAAAF,EAAAI,CAAA,CAcA,MAAAE,UAAAlC,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAA4B,YAAA,CAAA3B,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,EAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAA8B,aAAA,CAAAD,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAAmkF,UAAA3kF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAsB,EAAAvB,EAAAkmF,YAAA,CAAAjmF,GACAwB,EAAAzB,EAAAkmF,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,EAAApB,GAGA,OAFAF,EAAAmmF,aAAA,CAAAtkF,EAAAN,IAAA,CAAAtB,GACAD,EAAAmmF,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,EAcA,MAAA8B,UAAAtC,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwB,EAAAzB,EAAA4B,YAAA,CAAA3B,GACAsB,EAAAvB,EAAAgC,WAAA,CAAA/B,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,EAAApB,GAGA,OAFAF,EAAA8B,aAAA,CAAAD,EAAAJ,IAAA,CAAAxB,GACAD,EAAAiC,YAAA,CAAAJ,EAAAN,IAAA,CAAAtB,EAAA,GACA,CACA,EAcA,MAAAkkF,UAAA1kF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAsB,EAAAvB,EAAAomF,WAAA,CAAAnmF,GACAwB,EAAAzB,EAAAkmF,YAAA,CAAAjmF,EAAA,GACA,OAAAyB,EAAAH,EAAAE,EAAA,CAIA9Y,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA4B,EAAAP,EAAApB,GAGA,OAFAF,EAAAqmF,YAAA,CAAAxkF,EAAAN,IAAA,CAAAtB,GACAD,EAAAmmF,aAAA,CAAAtkF,EAAAJ,IAAA,CAAAxB,EAAA,GACA,CACA,EAaA,MAAAikF,UAAAzkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAsmF,WAAA,CAAArmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAumF,YAAA,CAAArmF,EAAAD,GACA,CACA,EAaA,MAAAgkF,UAAAxkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAwmF,WAAA,CAAAvmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAAymF,YAAA,CAAAvmF,EAAAD,GACA,CACA,EAaA,MAAA+jF,UAAAvkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA0mF,YAAA,CAAAzmF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA2mF,aAAA,CAAAzmF,EAAAD,GACA,CACA,EAaA,MAAA8jF,UAAAtkF,EACAxW,YAAA0W,CAAA,EACA,QAAAA,EAAA,CAIAI,OAAAC,CAAA,CAAAC,CAAA,EAIA,OAHAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA4mF,YAAA,CAAA3mF,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAKA,OAJAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA6mF,aAAA,CAAA3mF,EAAAD,GACA,CACA,EAoBA,MAAA6jF,UAAArkF,EACAxW,YAAA4qB,CAAA,CAAA0F,CAAA,CAAA5Z,CAAA,EACA,IAAAkU,CAAAA,aAAApU,CAAA,EACA,kDAEA,kBAAAkB,GAAA4Y,EAAA3Y,OAAA,IACAhB,OAAAC,SAAA,CAAA0Z,IAAA,GAAAA,CAAA,EACA,2FACA,CAEA,IAAA7Z,EAAA,GACA6Z,aAAA5Y,IACA,GAAAkT,EAAAnU,IAAA,GACAA,CAAAA,EAAA6Z,EAAA1F,EAAAnU,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAkU,aAAA,CAAAA,EAQA,KAAA0F,KAAA,CAAAA,CAAA,CAIApZ,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA6Z,EAAA,KAAAA,KAAA,CAIA,GAHAA,aAAA5Y,GACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA,OAAA4T,aAAA,CAAAnU,IAAA,CACMA,EAAA6Z,EAAA,KAAA1F,aAAA,CAAAnU,IAAA,KACN,CACA,IAAAtQ,EAAA,EACA,KAAAA,EAAAmqB,GACA7Z,GAAA,KAAAmU,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,EAAAP,GACA,EAAAtQ,CAEA,QACAsQ,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAI,EAAA,GACA/S,EAAA,EACAisB,EAAA,KAAAA,KAAA,CAIA,IAHAA,aAAA5Y,GACA4Y,CAAAA,EAAAA,EAAAxZ,MAAA,CAAAC,EAAAC,EAAA,EAEA3S,EAAAisB,GACAlZ,EAAA7Z,IAAA,MAAAqtB,aAAA,CAAA9T,MAAA,CAAAC,EAAAC,IACAA,GAAA,KAAA4T,aAAA,CAAA1T,OAAA,CAAAH,EAAAC,GACA3S,GAAA,EAEA,OAAA+S,CAAA,CAaA1X,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA6mF,EAAA,KAAAjzE,aAAA,CACAnU,EAAAQ,EAAAmC,MAAA,EAAA3C,EAAA3T,IACK2T,EAAAonF,EAAAn+F,MAAA,CAAAoD,EAAAiU,EAAAC,EAAAP,GACL,GAIA,OAHA,KAAA6Z,KAAA,YAAA5Y,GACA,KAAA4Y,KAAA,CAAA5wB,MAAA,CAAAuX,EAAAhY,MAAA,CAAA8X,EAAAC,GAEAP,CACA,EAmCA,MAAAwC,UAAAzC,EACAxW,YAAAkZ,CAAA,CAAAxC,CAAA,CAAAyC,CAAA,EACA,IAAAta,CAAAA,MAAA6D,OAAA,CAAAwW,IACAA,EAAAE,MAAA,EAAAC,EAAAvW,IAAAuW,GAAAvW,aAAA0T,EAAA,KACA,4DASA,QAAA8C,KAPA,kBAAA5C,GACA5U,KAAAA,IAAAqX,IACAA,EAAAzC,EACAA,EAAA5U,KAAAA,GAIAoX,GACA,KAAAI,EAAA7C,IAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,CACA,oEAIA,IAAAD,EAAA,GACA,IACMA,EAAAyC,EAAAE,MAAA,EAAA3C,EAAA6C,IAAA7C,EAAA6C,EAAApC,OAAA,KACN,OAAA9R,EAAA,CACA,OAAAqR,EAAAC,GAYA,KAAAwC,MAAA,CAAAA,EAYA,KAAAC,cAAA,GAAAA,CAAA,CAIAjC,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,EACA,IACAA,EAAA,KAAAyC,MAAA,CAAAE,MAAA,EAAA3C,EAAA6C,IAAA,CACA,IAAAC,EAAAD,EAAApC,OAAA,CAAAH,EAAAC,GAEO,OADPA,GAAAuC,EACO9C,EAAA8C,CACD,IACN,OAAAnU,EAAA,CACA,uCAEA,OAAAqR,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAwC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CAKA,GAJApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAAC,EAAAC,EAAA,EAEAA,GAAAsC,EAAApC,OAAA,CAAAH,EAAAC,GACA,KAAAmC,cAAA,EACApC,EAAA9X,MAAA,GAAA+X,EACA,MAGA,OAAAwC,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAyC,EAAAzC,EACA0C,EAAA,EACAC,EAAA,EACA,QAAAL,KAAA,KAAAJ,MAAA,EACA,IAAAzC,EAAA6C,EAAA7C,IAAA,CAEA,GADAkD,EAAA,EAAAlD,EAAAA,EAAA,EACA3U,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,IACAD,EAAAL,EAAA5Z,MAAA,CAAAka,EAAA7C,EAAAC,GACA,EAAAP,GAGAA,CAAAA,EAAA6C,EAAApC,OAAA,CAAAH,EAAAC,EAAA,EAGA,GACAA,EACAA,GAAAP,CACA,CAKA,SAAAkD,EAAAF,CAAA,CAIApC,UAAAC,CAAA,EACA,IAAAkC,EAAA,KAAA3C,qBAAA,GACA,QAAAyC,KAAA,KAAAJ,MAAA,CACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,EAAAY,EAAArY,MAAA,EACAua,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAAY,EAAAuC,KAAA,IAGA,OAAAL,CAAA,CAWAM,UAAApD,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAeAS,SAAArD,CAAA,EACA,oBAAAA,EACA,2CAEA,IAAAM,EAAA,EACA,QAAAsC,KAAA,KAAAJ,MAAA,EACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAAM,CACA,CACA,EAAAsC,EAAA7C,IAAA,CACQO,EAAA,GACR,GAAAA,GACAA,CAAAA,GAAAsC,EAAA7C,IAAA,CAEA,CACA,EAiBA,MAAAuD,EACAha,YAAa0W,CAAA,EAKb,KAAAA,QAAA,CAAAA,CAAA,CAOAI,QAAA,CACA,8CAOApX,QAAA,CACA,8CACA,CAoBA,MAAAua,UAAAD,EACAha,YAAA6X,CAAA,CAAAnB,CAAA,EACA,kBAAAgB,GACAG,EAAAF,OAAA,IACA,qEAEA,MAAAjB,GAAAmB,EAAAnB,QAAA,aAKA,KAAAmB,MAAA,CAAAA,CAAA,CAIAf,OAAAC,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAA,CAIAtX,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,YAAAa,MAAA,CAAAnY,MAAA,CAAAuX,EAAAF,EAAAC,EACA,EA8DA,MAAAkD,UAAA1D,EACAxW,YAAAma,CAAA,CAAAC,CAAA,CAAA1D,CAAA,EACA,IAAA2D,EAAA,aAAAvC,GACAqC,aAAApC,EACA,GAAAsC,EACMF,EAAA,IAAAF,EAAA,IAAArC,EAAAuC,SACN,gBAAAzC,GACAyC,EAAAxC,OAAA,GACMwC,EAAA,IAAAF,EAAAE,QACN,IAAAA,CAAAA,aAAAH,CAAA,EACA,mFACA,CAKA,GAHAlY,KAAAA,IAAAsY,GACAA,CAAAA,EAAA,MAEA,SAAAA,GACAA,aAAA5D,CAAA,EACA,0DAEA,UAAA4D,EAAA,CACA,KAAAA,EAAA3D,IAAA,CACA,0DAEA3U,IAAAsY,EAAA1D,QAAA,EACA0D,CAAAA,EAAAA,EAAAjD,SAAA,YACA,KAOAV,EAAA,GACA2D,GAEA,GADA3D,CAAAA,EAAA2D,EAAA3D,IAAA,GACA4D,GACA5D,CAAAA,GAAA0D,EAAAtC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAUA,KAAA4D,aAAA,CAAAH,EAOA,KAAAI,uBAAA,CAAAF,EASA,KAAAD,aAAA,CAAAA,EAYA,KAAAI,QAAA,IAGA,IAAAC,EAAA,KAAAC,uBAAA,CAAAC,IAAA,MAgBA,MAAAC,gBAAA,UAAA3D,CAAA,EACA,OAAAwD,EAAAxD,EAAA,EAgBA,KAAA4D,sBAAA,UAAAC,CAAA,EACAL,EAAAK,EAAAH,IAAA,MACA,EAIAzD,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CACA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAKA,IAAA+D,EAAA,KAAAC,UAAA,CAAAjE,EAAAC,GACA,IAAA+D,EACA,iEAEA,OAAAA,EAAA7D,OAAA,CAAAH,EAAAC,EAAA,CAgCA0D,wBAAAzD,CAAA,EACA,GAAAA,EAAAxK,cAAA,MAAA6N,aAAA,CAAA5D,QAAA,GACA,QAAA0D,aAAA,EACAnD,EAAAxK,cAAA,MAAA2N,aAAA,CAAA1D,QAAA,EACA,MACA,CACA,IAAAqE,EAAA,KAAAP,QAAA,CAAAvD,CAAA,MAAAqD,aAAA,CAAA5D,QAAA,GACA,GAAAqE,GACA,EAAAA,EAAAlD,MAAA,EACAZ,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,GACA,OAAAqE,CACM,MAEN,QAAAE,KAAA,KAAAT,QAAA,EACA,IAAAO,EAAA,KAAAP,QAAA,CAAAS,EAAA,CACA,GAAAhE,EAAAxK,cAAA,CAAAsO,EAAArE,QAAA,EACA,OAAAqE,CACA,CAEA,MACA,qCASAjE,OAAAC,CAAA,CAAAC,CAAA,MAIAwC,CAHA1X,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAGA,IAAAkE,EAAA,KAAAZ,aAAA,CACAH,EAAAe,EAAApE,MAAA,CAAAC,EAAAC,GACAmE,EAAA,KAAAX,QAAA,CAAAL,EAAA,CACA,GAAArY,KAAAA,IAAAqZ,EAAA,CACA,IAAAC,EAAA,EACAD,EAAA,KAAAf,aAAA,CACA,KAAAG,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAGA+C,CADAA,EAAA,KAAA3C,qBAAA,GACA,CAAAqE,EAAAxE,QAAA,EAAAyD,EACMX,CAAA,CAAA2B,EAAAzE,QAAA,OAAA0D,aAAA,CAAAtD,MAAA,CAAAC,EAAAC,EAAAoE,EACN,MACA5B,EAAA2B,EAAArE,MAAA,CAAAC,EAAAC,EACA,CACA,OAAAwC,CAAA,CASA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA+D,EAAA,KAAAH,gBAAA,CAAA3D,GACA,GAAAnV,KAAAA,IAAAiZ,EAAA,CACA,IAAAG,EAAA,KAAAZ,aAAA,CACAa,EAAA,KAAAf,aAAA,CACAgB,EAAA,EAKA,OAJA,KAAAb,uBAAA,EACAa,CAAAA,EAAAF,EAAArD,MAAA,CAAApB,IAAA,EAEAyE,EAAAxb,MAAA,CAAAuX,CAAA,CAAAiE,EAAAxE,QAAA,EAAAK,EAAAC,GACAoE,EAAAD,EAAAzb,MAAA,CAAAuX,CAAA,CAAAkE,EAAAzE,QAAA,EAAAK,EACAC,EAAAoE,EACA,QACAL,EAAArb,MAAA,CAAAuX,EAAAF,EAAAC,EAAA,CAgBAqE,WAAAC,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAU,EAAA,IAAAmE,EAAA,KAAAD,EAAAzD,EAAAnB,GAEA,OADA,KAAA8D,QAAA,CAAAc,EAAA,CAAAlE,EACAA,CAAA,CAiBA4D,WAAAQ,CAAA,CAAAxE,CAAA,EACA,IAAQsE,EAAME,EAOd,OANA/c,EAAAgd,QAAA,CAAAD,KACA1Z,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAsE,EAAA,KAAAhB,aAAA,CAAAxD,MAAA,CAAA0E,EAAAxE,IAEA,KAAAwD,QAAA,CAAAc,EAAA,CACA,CAgCA,MAAAC,UAAA/E,EACAxW,YAAA0b,CAAA,CAAAJ,CAAA,CAAAzD,CAAA,CAAAnB,CAAA,EACA,IAAAgF,CAAAA,aAAAxB,CAAA,EACA,yCAEA,IAAAvD,OAAAC,SAAA,CAAA0E,IAAA,EAAAA,EACA,4DAOA,GALA,iBAAAzD,GACA/V,KAAAA,IAAA4U,IACAA,EAAAmB,EACAA,EAAA,MAEAA,EAAA,CACA,IAAAA,CAAAA,aAAArB,CAAA,EACA,2CAEA,UAAAkF,EAAAtB,aAAA,EACA,GAAAvC,EAAApB,IAAA,EACAoB,EAAApB,IAAA,CAAAiF,EAAAtB,aAAA,CAAA3D,IAAA,CACA,6DAEA,oBAAAC,EACA,uDAEA,IACAD,EAAAiF,EAAAjF,IAAA,CACA,EAAAiF,EAAAjF,IAAA,EAEA,GADAA,CAAAA,EAAAoB,EAAAA,EAAApB,IAAA,KACAiF,EAAAnB,uBAAA,EACA9D,CAAAA,GAAAiF,EAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,MAAAA,EAAAC,GAGA,KAAAgF,KAAA,CAAAA,EAKA,KAAAJ,OAAA,CAAAA,EAOA,KAAAzD,MAAA,CAAAA,GAAA,KAIAX,QAAAH,CAAA,CAAAC,CAAA,EACA,WAAAP,IAAA,CAGA,YAAAA,IAAA,MAEA3U,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAKA,OAJA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAGA2E,EAAA,KAAAvD,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,EAAA,CAIAtE,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,GAIA,GAHA/U,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,YAAA0E,KAAA,CAAAV,UAAA,CAAAjE,EAAAC,GACA,gCAEA,IAAAoE,EAAA,EAWA,OAVA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,CACM2B,CAAA,MAAA9C,QAAA,OAAAmB,MAAA,CAAAf,MAAA,CAAAC,EAAAC,EAAAoE,GACN,KAAA1E,QAAA,CACM8C,CAAA,MAAA9C,QAAA,KACN,KAAAgF,KAAA,CAAAnB,uBAAA,EACAf,CAAAA,CAAA,MAAAkC,KAAA,CAAApB,aAAA,CAAA5D,QAAA,OAAA4E,OAAA,EAEA9B,CAAA,CAIA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAoE,EAAA,EAIA,GAHA,KAAAM,KAAA,CAAAnB,uBAAA,EACAa,CAAAA,EAAA,KAAAM,KAAA,CAAApB,aAAA,CAAAzC,MAAA,CAAApB,IAAA,EAEA,KAAAoB,MAAA,EACA,CAAAZ,EAAAxK,cAAA,MAAAiK,QAAA,EACA,+CAAAA,QAAA,EAEA,KAAAgF,KAAA,CAAApB,aAAA,CAAA5a,MAAA,MAAA4b,OAAA,CAAAvE,EAAAC,GACA,IAAAP,EAAA2E,EACA,QAAAvD,MAAA,GACA,KAAAA,MAAA,CAAAnY,MAAA,CAAAuX,CAAA,MAAAP,QAAA,EAAAK,EAAAC,EAAAoE,GACA3E,GAAA,KAAAoB,MAAA,CAAAX,OAAA,CAAAH,EAAAC,EAAAoE,GACA,QAAAM,KAAA,CAAAjF,IAAA,EACAA,EAAA,KAAAiF,KAAA,CAAAjF,IAAA,EACA,yDAGA,OAAAA,CAAA,CAKAY,UAAAC,CAAA,EACA,QAAAO,MAAA,CACA,YAAAA,MAAA,CAAAR,SAAA,CAAAC,EACA,CACA,CASA,SAAAwmF,EAAAh7F,CAAA,EAIA,OAHA,EAAAA,GACAA,CAAAA,GAAA,YAEAA,CAAA,CAkCA,MAAA83F,UAAApkF,EACAxW,YAAA+9F,CAAA,CAAAC,CAAA,CAAAtnF,CAAA,EACA,kBAAAoB,GACAimF,aAAAhmF,CAAA,EACA,wDAOA,GALA,iBAAAimF,GACAl8F,KAAAA,IAAA4U,IACAA,EAAAsnF,EACAA,EAAAl8F,KAAAA,GAEA,EAAAi8F,EAAAtnF,IAAA,CACA,+CACA,MAAAsnF,EAAAtnF,IAAA,CAAAC,GAKA,KAAAqnF,IAAA,CAAAA,EASA,KAAAC,GAAA,GAAAA,EAQA,KAAA9kF,MAAA,IAMA,IAAAzY,EAAA,CACA,MAAAw9F,eAAA,UAAAn7F,CAAA,EAEA,OADArC,EAAAq9F,EAAAh7F,GACA,MAEA,KAAAo7F,eAAA,YACA,OAAAz9F,CACA,EAIAqW,OAAAC,CAAA,CAAAC,CAAA,EACA,IAAAwC,EAAA,KAAA3C,qBAAA,EACA/U,MAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAvW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA8C,CAAAA,CAAA,CAAAF,EAAA5C,QAAA,EAAA4C,EAAAxC,MAAA,CAAArW,EAAA,EAGA,OAAA+Y,CAAA,CAQA9Z,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAvW,EAAA,KAAAs9F,IAAA,CAAAjnF,MAAA,CAAAC,EAAAC,GAEA,QAAAsC,KADA,KAAA2kF,eAAA,CAAAx9F,GACA,KAAAyY,MAAA,EACA,GAAApX,KAAAA,IAAAwX,EAAA5C,QAAA,EACA,IAAAkD,EAAA3C,CAAA,CAAAqC,EAAA5C,QAAA,OACA5U,IAAA8X,GACAN,EAAA5Z,MAAA,CAAAka,EAEA,QAEA,KAAAmkF,IAAA,CAAAr+F,MAAA,MAAAw+F,eAAA,GAAAnnF,EAAAC,EAAA,CAYAmnF,SAAAvC,CAAA,CAAAllF,CAAA,EACA,IAAA0nF,EAAA,IAAAzD,EAAA,KAAAiB,EAAAllF,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CAAA,CAUAC,WAAA3nF,CAAA,EAGA,IAAA0nF,EAAA,IAAAliB,EAAA,KAAAxlE,GAEA,OADA,KAAAwC,MAAA,CAAA3b,IAAA,CAAA6gG,GACAA,CAAA,CAWAE,SAAA5nF,CAAA,EACA,oBAAAA,EACA,2CAEA,QAAA4C,KAAA,KAAAJ,MAAA,CACA,GAAAI,EAAA5C,QAAA,GAAAA,EACA,OAAA4C,CACA,CAEA,CAuBA,MAAAqhF,EACA36F,YAAA8sB,CAAA,CAAA8uE,CAAA,CAAAllF,CAAA,EACA,IAAAoW,CAAAA,aAAA8tE,CAAA,EACA,oDAEA,IAAAjkF,OAAAC,SAAA,CAAAglF,IAAA,GAAAA,EACA,iDAEA,IAAA2C,EAAA,EAAAzxE,EAAArW,IAAA,CACA+nF,EAAA1xE,EAAA5T,MAAA,CAAAE,MAAA,EAAAqlF,EAAAnlF,IAAAmlF,EAAAnlF,EAAAsiF,IAAA,IACA,KAAA4C,EAAAD,EACA,iDACAA,CAAAA,EAAAC,CAAA,SACAD,EAAA,YAIA,KAAAzxE,SAAA,CAAAA,EAGA,KAAA8uE,IAAA,CAAAA,EAQA,KAAA8C,SAAA,KAAuB9C,CAAA,IACvB,KAAAA,GACA,MAAA8C,SAAA,aAMA,KAAAnvD,KAAA,CAAAivD,EACA,KAAA1xE,SAAA,CAAAkxE,GAAA,EACA,MAAAzuD,KAAA,CAAAgvD,EAAAC,EAAA5C,CAAA,EAIA,KAAA+C,QAAA,CAAAb,EAAA,KAAAY,SAAA,OAAAnvD,KAAA,EAaA,KAAA74B,QAAA,CAAAA,CAAA,CAKAI,QAAA,CACA,IAAAinF,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,EAAAC,EAAA,KAAAY,QAAA,EACAl+F,EAAAm+F,IAAA,KAAArvD,KAAA,CACA,OAAA9uC,CAAA,CAQAf,OAAAe,CAAA,EACA,IAAAkW,OAAAC,SAAA,CAAAnW,IACAA,IAAAq9F,EAAAr9F,EAAA,KAAAi+F,SAAA,EACA,gBAAAlnF,EAAA,wBACA,6CAAAknF,SAAA,EAEA,IAAAX,EAAA,KAAAjxE,SAAA,CAAAoxE,eAAA,GACAU,EAAAd,EAAAr9F,GAAA,KAAA8uC,KAAA,EACA,KAAAziB,SAAA,CAAAmxE,eAAA,CAAAH,EAAAC,EAAA,MAAAY,QAAA,EACAC,EACA,EAoBA,MAAA1iB,UAAAye,EACA36F,YAAA8sB,CAAA,CAAApW,CAAA,EACA,MAAAoW,EAAA,EAAApW,EAAA,CAMAI,OAAAC,CAAA,CAAAC,CAAA,EACA,QAAA2jF,EAAAnuF,SAAA,CAAAsK,MAAA,CAAApK,IAAA,MAAAqK,EAAAC,EAAA,CAIAtX,OAAAe,CAAA,EAKA,MAJA,kBAAAA,GAEAA,CAAAA,EAAA,CAAAA,CAAA,EAEAk6F,EAAAnuF,SAAA,CAAA9M,MAAA,CAAAgN,IAAA,MAAAjM,EACA,CACA,CAiBA,MAAA6c,UAAA9G,EACAxW,YAAAf,CAAA,CAAAyX,CAAA,EACA,kBAAAgB,GAAAzY,EAAA0Y,OAAA,IACAhB,OAAAC,SAAA,CAAA3X,IAAA,GAAAA,CAAA,EACA,wFACA,CAGA,IAAAwX,EAAA,GACAxX,aAAAyY,GACAjB,CAAAA,EAAAxX,CAAA,EACA,MAAAwX,EAAAC,GAQA,KAAAzX,MAAA,CAAAA,CAAA,CAIAiY,QAAAH,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAP,CAAA,CAIAK,OAAAC,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAA,IAAA,CAIA,OAHA,EAAAA,GACAA,CAAAA,EAAA,KAAAxX,MAAA,CAAA6X,MAAA,CAAAC,EAAAC,EAAA,EAEAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,CAQA/W,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACA,IAAAP,EAAA,KAAAxX,MAAA,CAIA,GAHA,KAAAA,MAAA,YAAAyY,GACAjB,CAAAA,EAAAQ,EAAAhY,MAAA,EAEA,CAAAR,CAAAA,EAAAgd,QAAA,CAAAxE,IACAR,IAAAQ,EAAAhY,MAAA,EACA,gBAAAuY,EAAA,oBACA,qBAAAf,EAAA,mBAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAMA,OAJA8X,EAAA6E,KAAA,CAAA3E,EAAAjQ,QAAA,QAAAgQ,EAAAP,EAAA,OACA,KAAAxX,MAAA,YAAAyY,GACA,KAAAzY,MAAA,CAAAS,MAAA,CAAA+W,EAAAM,EAAAC,GAEAP,CACA,EAgBA,MAAAikF,UAAAlkF,EACAxW,YAAA0W,CAAA,EACA,SAAAA,EAAA,CAIAQ,QAASH,CAAA,CAAAC,CAAM,EACf,IAAAvY,EAAAgd,QAAA,CAAA1E,GACA,2CAEAjV,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAA7Q,EAAA6Q,EACA,OAAAD,EAAA9X,MAAA,MAAA8X,CAAA,CAAA5Q,EAAA,EACAA,GAAA,EAEA,SAAAA,EAAA6Q,CAAA,CAIAF,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA1X,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,OAAAD,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,EAAA,GAAAzP,QAAA,UAIAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAKA,iBAAAC,GACAA,CAAAA,EAAAA,EAAAjQ,QAAA,IAEA,IAAA83F,EAAA,IAAArgG,EAAAwY,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,KAAAwX,EAAAM,EAAA9X,MAAA,CACA,6CAIA,OAFA6/F,EAAAl5E,IAAA,CAAA7O,EAAAC,GACAD,CAAA,CAAAC,EAAAP,EAAA,GACAA,EAAA,CACA,EAsBA,MAAAgkF,UAAAjkF,EACAxW,YAAA+1E,CAAA,CAAAr/D,CAAA,EAMA,GALA,iBAAAq/D,GACAj0E,KAAAA,IAAA4U,IACAA,EAAAq/D,EACAA,EAAAj0E,KAAAA,GAEAA,KAAAA,IAAAi0E,EACMA,EAAA,QACN,IAAAp/D,OAAAC,SAAA,CAAAm/D,GACA,8CAEA,SAAAr/D,GAWA,KAAAq/D,OAAA,CAAAA,CAAA,CAIA7+D,QAASH,CAAA,CAAAC,CAAM,EACf,IAAAvY,EAAAgd,QAAA,CAAA1E,GACA,sCAKA,OAHAjV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEAD,EAAA9X,MAAA,CAAA+X,CAAA,CAIAF,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA1X,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAEA,IAAAP,EAAA,KAAAS,OAAA,CAAAH,EAAAC,GACA,WAAA++D,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,OAAAM,EAAA1X,KAAA,CAAA2X,EAAAA,EAAAP,GAAAzP,QAAA,UAIAtH,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EACAlV,KAAAA,IAAAkV,GACAA,CAAAA,EAAA,GAKA,iBAAAC,GACAA,CAAAA,EAAAA,EAAAjQ,QAAA,IAEA,IAAA83F,EAAA,IAAArgG,EAAAwY,EAAA,QACAR,EAAAqoF,EAAA7/F,MAAA,CACA,WAAA82E,OAAA,EACA,KAAAA,OAAA,CAAAt/D,EACA,gDAEA,KAAAA,EAAAM,EAAA9X,MAAA,CACA,6CAGA,OADA6/F,EAAAl5E,IAAA,CAAA7O,EAAAC,GACAP,CACA,EAsBA,MAAA+jF,UAAAhkF,EACAxW,YAAAS,CAAA,CAAAiW,CAAA,UAAAA,GAYA,KAAAjW,KAAA,CAAAA,CAAA,CAIAqW,OAAAC,CAAA,CAAAC,CAAA,CAAAwC,CAAA,EACA,YAAA/Y,KAAA,CAIAf,OAAAuX,CAAA,CAAAF,CAAA,CAAAC,CAAA,EAEA,QACA,EAGAjZ,EAAA2Z,cAAmB,CAAAA,EACnB3Z,EAAAu9F,WAAA,CAAoBA,EACpBv9F,EAAA6Z,YAAY,CAAAA,EACZ7Z,EAAA+Z,IAAA,CAAcA,EACd/Z,EAAAga,MAAW,CAAAA,EACXha,EAAAs9F,GAAA,CAAaA,EACbt9F,EAAAq9F,KAAa,CAAAA,EACbr9F,EAAAk9F,KAAA,CAAeA,EACfl9F,EAAAi9F,OAAc,CAAAA,EACdj9F,EAAAg9F,MAAA,CAAgBA,EAChBh9F,EAAA+8F,QAAgB,CAAAA,EAChB/8F,EAAA88F,QAAA,CAAiBA,EACjB98F,EAAAkb,SAAA,CAAAA,EACAlb,EAAAic,kBAAA,CAAAA,EACAjc,EAAAkc,wBAAa,CAAAA,EACblc,EAAAmc,KAAA,CAAAA,EACAnc,EAAAwd,aAAoB,CAAAA,EACpBxd,EAAA68F,YAAgB,CAAAA,EAChB78F,EAAA48F,QAAe,CAAAA,EACf58F,EAAAm+E,OAAY,CAAAA,EACZn+E,EAAAuf,IAAA,CAAeA,EACfvf,EAAA28F,OAAY,CAAAA,EACZ38F,EAAA08F,IAAA,CAAAA,EAAgB18F,EAAAy8F,QAAA,CAAAA,EAGFz8F,EAAAw8F,MAAA,EAAAoC,EAAAjmF,IAAA,IAAA4kF,EAAAqB,EAAAjmF,GAGA3Y,EAAAiZ,MAAA,EAAAa,EAAAb,EAAAN,IAAA,IAAAkB,EAAAC,EAAAb,EAAAN,GAIJ3Y,EAAA8d,EAAA,CAAAnF,GAAA,IAAAoB,EAAA,EAAApB,GAIC3Y,EAAA2rB,GAAA,CAAAhT,GAAA,IAAAoB,EAAA,EAAApB,GAIA3Y,EAAAu8F,GAAA,CAAA5jF,GAAA,IAAAoB,EAAA,EAAApB,GAIA3Y,EAAA+d,GAAA,CAAApF,GAAA,IAAAoB,EAAA,EAAApB,GAIA3Y,EAAAs8F,GAAA,CAAA3jF,GAAA,IAAAoB,EAAA,EAAApB,GAIA3Y,EAAAq8F,GAAA,CAAA1jF,GAAA,IAAAoB,EAAA,EAAApB,GAIC3Y,EAAAge,IAAA,CAAArF,GAAA,IAAAgC,EAAAhC,GAIC3Y,EAAAo8F,KAAA,CAAAzjF,GAAA,IAAAqB,EAAA,EAAArB,GAIA3Y,EAAAm8F,KAAA,CAAAxjF,GAAA,IAAAqB,EAAA,EAAArB,GAIA3Y,EAAAk8F,KAAA,CAAAvjF,GAAA,IAAAqB,EAAA,EAAArB,GAIA3Y,EAAAi8F,KAAA,CAAAtjF,GAAA,IAAAqB,EAAA,EAAArB,GAIA3Y,EAAAg8F,KAAA,CAAArjF,GAAA,IAAAqB,EAAA,EAAArB,GAIC3Y,EAAA+7F,MAAA,CAAApjF,GAAA,IAAAykF,EAAAzkF,GAIJ3Y,EAAAisB,EAAA,CAAAtT,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIC3Y,EAAAksB,GAAA,CAAAvT,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIA3Y,EAAAw+F,GAAA,CAAA7lF,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIA3Y,EAAAmsB,GAAA,CAAAxT,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIA3Y,EAAAu+F,GAAA,CAAA5lF,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIA3Y,EAAAs+F,GAAA,CAAA3lF,GAAA,IAAA2kF,EAAA,EAAA3kF,GAIC3Y,EAAAie,IAAA,CAAAtF,GAAA,IAAAoC,EAAApC,GAIC3Y,EAAAq+F,KAAA,CAAA1lF,GAAA,IAAA0kF,EAAA,EAAA1kF,GAIA3Y,EAAAo+F,KAAA,CAAAzlF,GAAA,IAAA0kF,EAAA,EAAA1kF,GAIA3Y,EAAAm+F,KAAA,CAAAxlF,GAAA,IAAA0kF,EAAA,EAAA1kF,GAIA3Y,EAAAk+F,KAAA,CAAAvlF,GAAA,IAAA0kF,EAAA,EAAA1kF,GAIA3Y,EAAAi+F,KAAA,CAAAtlF,GAAA,IAAA0kF,EAAA,EAAA1kF,GAIC3Y,EAAAg+F,MAAA,CAAArlF,GAAA,IAAAwkF,EAAAxkF,GAGH3Y,EAAAwrB,GAAA,CAAA7S,GAAA,IAAAukF,EAAAvkF,GAGE3Y,EAAA+9F,KAAA,CAAAplF,GAAA,IAAAskF,EAAAtkF,GAGF3Y,EAAAurB,GAAA,CAAA5S,GAAA,IAAAqkF,EAAArkF,GAGE3Y,EAAA89F,KAAA,CAAAnlF,GAAA,IAAAokF,EAAApkF,GAGC3Y,EAAA4B,MAAA,EAAAuZ,EAAAxC,EAAAyC,IAAA,IAAAF,EAAAC,EAAAxC,EAAAyC,GAGFpb,EAAA69F,IAAA,EAAAmC,EAAAC,EAAAtnF,IAAA,IAAAkkF,EAAAmD,EAAAC,EAAAtnF,GAGD3Y,EAAA8sB,GAAA,EAAAD,EAAA0F,EAAA5Z,IAAA,IAAAmkF,EAAAjwE,EAAA0F,EAAA5Z,GAGE3Y,EAAA2d,KAAA,EAAAvB,EAAAC,EAAA1D,IAAA,IAAAwD,EAAAC,EAAAC,EAAA1D,GAGmB3Y,EAAA49F,wBAAA,EAAA9jF,EAAAnB,IAAA,IAAAuD,EAAApC,EAAAnB,GAGpB3Y,EAAAke,IAAA,EAAAhd,EAAAyX,IAAA,IAAA4G,EAAAre,EAAAyX,GAGA3Y,EAAA29F,IAAA,CAAAhlF,GAAA,IAAAgkF,EAAAhkF,GAGA3Y,EAAAyxD,IAAA,EAAAumB,EAAAr/D,IAAA,IAAA+jF,EAAA1kB,EAAAr/D,GAGC3Y,EAAA,OAAA0C,EAAAiW,IAAA,IAAA8jF,EAAA/5F,EAAAiW,EAAA,gBAAAlZ,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECvpFb,YACA;;;;;CAKA,GAKA,IAAAgyD,EAAAhyD,EAAuB,MACvB+iG,EAAA/iG,EAAA,KACA4jG,EACA,mBAAAjgG,QAAA,mBAAAA,OAAA,IACAA,OAAA,uCAGAtD,EAAAU,MAAA,CAAAA,EACAV,EAAAwjG,UAAA,CAAAA,EAAyBxjG,EAAAyjG,iBAAA,IAGzB,IAAAC,EAAkB,WA2BlB,SAAAC,GAAA,CAEA,IACA,IAAA71B,EAAA,IAAoBthE,WAAA,GACpBo3F,EAAA,CAAAC,IAAA,uBAGI,OAFJ9gG,OAAA+gG,cAAA,CAAAF,EAAAp3F,WAAAiC,SAAA,EACA1L,OAAA+gG,cAAA,CAAAh2B,EAAA81B,GACI91B,KAAAA,EAAA+1B,GAAA,EACJ,OAAAx8F,EAAA,CACA,QACA,EAmBA,SAAA08F,EAAA7iG,CAAA,EACA,GAAAA,EAAAwiG,EACA,+BAAAxiG,EAAA,kCAGA,IAAA8gB,EAAA,IAAAxV,WAAAtL,GAEA,OADA6B,OAAA+gG,cAAA,CAAA9hF,EAAAthB,EAAA+N,SAAA,EACAuT,CAAA,CAaA,SAAAthB,EAAAo2B,CAAA,CAAAktE,CAAA,CAAA9iG,CAAA,EAEA,oBAAA41B,EAAA,CACA,oBAAAktE,EACA,gBACA,qEACA,CAEA,OAAAC,EAAAntE,EACA,QACAzY,EAAAyY,EAAAktE,EAAA9iG,EAAA,CAKA,SAAAmd,EAAA3b,CAAA,CAAAshG,CAAA,CAAA9iG,CAAA,EACA,oBAAAwB,EACA,OAAAwhG,EAAAxhG,EAAAshG,EAAA,CAGA,GAAAhkF,YAAAC,MAAA,CAAAvd,GACA,OAAAyhG,EAAAzhG,EAAA,CAGA,GAAAA,IAAA,EAAAA,EACA,gBACA,kHACA,OAAAA,EACA,CAGA,GAAA0hG,GAAA1hG,EAAAsd,cACAtd,GAAA0hG,GAAA1hG,EAAA2f,MAAA,CAAArC,cAIA,oBAAAqkF,mBACAD,CAAAA,GAAA1hG,EAAA2hG,oBACA3hG,GAAA0hG,GAAA1hG,EAAA2f,MAAA,CAAAgiF,kBAAA,EALA,OAAAC,EAAA5hG,EAAAshG,EAAA9iG,EAAA,CASA,oBAAAwB,EACA,gBACA,wEACA,CAGA,IAAA6hG,EAAA7hG,EAAA6hG,OAAA,EAAA7hG,EAAA6hG,OAAA,GACA,GAAAA,IAAA,EAAAA,GAAAA,IAAA7hG,EACA,OAAAhC,EAAA2d,IAAA,CAAAkmF,EAAAP,EAAA9iG,EAAA,CAGA,IAAA8X,EAAAwrF,EAAA9hG,GAAA,GAAAsW,EAAA,OAAAA,CAAA,CAGA,uBAAA1V,QAAAA,IAAA,EAAAA,OAAA29F,WAAA,EACA,mBAAAv+F,CAAA,CAAAY,OAAA29F,WAAA,EACA,OAAAvgG,EAAA2d,IAAA,CAAA3b,CAAA,CAAAY,OAAA29F,WAAA,YAAA+C,EAAA9iG,EAAA,OAGA,UACA,kHACA,OAAAwB,EACA,CAoBA,SAAA+hG,EAAA5jG,CAAA,EACA,oBAAAA,EACI,0DACJ,GAAAA,EAAA,EACA,+BAAAA,EAAA,kCAIA,SAAA+mB,EAAA/mB,CAAA,CAAAs0F,CAAA,CAAAhsF,CAAA,QAEA,CADAs7F,EAAA5jG,GACAA,GAAA,GACAkjG,EAAAljG,GAEAs0F,KAAApxF,IAAAoxF,EAIA,iBAAAhsF,EACA46F,EAAAljG,GAAAs0F,IAAA,CAAAA,EAAAhsF,GACA46F,EAAAljG,GAAAs0F,IAAA,CAAAA,EAAA,CAEA4O,EAAAljG,EATA,CAoBA,SAAAojG,EAAApjG,CAAA,EAEA,OADA4jG,EAAA5jG,GACAkjG,EAAAljG,EAAA,IAAA6jG,EAAAA,EAAA7jG,EAAA,EAgBA,SAAAqjG,EAAAn9F,CAAA,CAAAoC,CAAA,EAKA,GAJA,kBAAAA,GAAAA,KAAAA,CAAA,GACAA,CAAAA,EAAA,QAGA,CAAAzI,EAAAikG,UAAA,CAAAx7F,GACA,qCAAAA,EAAA,CAGA,IAAAjI,EAAAkhB,EAAAA,EAAArb,EAAAoC,GAAA6Y,EAAA+hF,EAAA7iG,GAEA0jG,EAAA5iF,EAAAnE,KAAA,CAAA9W,EAAAoC,GAUA,OAPAy7F,IAAA1jG,GAIA8gB,CAAAA,EAAAA,EAAA1gB,KAAA,GAAAsjG,EAAA,EAGA5iF,CAAA,CAGA,SAAA6iF,EAAAjkG,CAAA,EACA,IAAAM,EAAAN,EAAAM,MAAA,KAAAwjG,EAAAA,EAAA9jG,EAAAM,MAAA,EACA8gB,EAAA+hF,EAAkB7iG,GAClB,QAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,GAAA,EACA0b,CAAA,CAAA1b,EAAA,CAAA1F,IAAAA,CAAA,CAAA0F,EAAA,CAEA,OAAA0b,CAAA,CAGA,SAAAmiF,EAAAW,CAAA,EACA,GAAAV,GAAAU,EAAAt4F,YAAA,CACA,IAAAqb,EAAA,IAAArb,WAAAs4F,GACA,OAAAR,EAAAz8E,EAAAxF,MAAA,CAAAwF,EAAAg2C,UAAA,CAAAh2C,EAAAzF,UAAA,CACA,QACAyiF,EAAAC,EAAA,CAGA,SAAAR,EAAA1jG,CAAA,CAAAi9D,CAAA,CAAA38D,CAAA,MASA8gB,EARA,GAAA67C,EAAA,GAAAj9D,EAAAwhB,UAAA,CAAAy7C,EACA,yDAGA,GAAAj9D,EAAAwhB,UAAA,CAAAy7C,EAAA38D,CAAAA,GAAA,GACA,yDAeA,OAHA6B,OAAA+gG,cAAA,CAPI9hF,EADJ67C,KAAA95D,IAAA85D,GAAA38D,KAAA6C,IAAA7C,EACI,IAAAsL,WAAA5L,GACJM,KAAA6C,IAAA7C,EACI,IAAAsL,WAAA5L,EAAAi9D,GAEJ,IAAArxD,WAAA5L,EAAAi9D,EAAA38D,GAGAR,EAAA+N,SAAA,EAGAuT,CAAA,CAGA,SAAAwiF,EAAA7kF,CAAA,EACA,GAAAjf,EAAAgd,QAAA,CAAAiC,GAAA,CACA,IAAA+Z,EAAAgrE,EAAAA,EAAA/kF,EAAAze,MAAA,EAAA8gB,EAAA+hF,EAAArqE,UAGA,IAAA1X,EAAA9gB,MAAA,EAIAye,EAAAkI,IAAA,CAAA7F,EAAA,IAAA0X,GAHA1X,CAIA,QAGA,KAAAje,IAAA4b,EAAAze,MAAA,CACA,iBAAAye,EAAAze,MAAA,EAAA6jG,GAAAplF,EAAAze,MAAA,EACA6iG,EAAA,GAEAc,EAAAllF,EADA,CAIAA,WAAAA,EAAA/c,IAAA,EAAA9B,MAAA6D,OAAA,CAAAgb,EAAAje,IAAA,EACAmjG,EAAAllF,EAAAje,IAAA,QAJA,CAQA,SAAAgjG,EAAAxjG,CAAA,EAGA,GAAAA,GAAAwiG,EACA,2EACAA,EAAAz6F,QAAA,eAEA,OAAA/H,EAAAA,CAAA,CAGA,SAAAsiG,EAAAtiG,CAA2B,EAI3B,MAHA,CAAAA,GAAAA,GACAA,CAAAA,EAAA,GAEAR,EAAAknB,KAAA,EAAA1mB,EAAA,CAgGA,SAAAkhB,EAAArb,CAAA,CAAAoC,CAAA,EACA,GAAAzI,EAAAgd,QAAA,CAAA3W,GACA,OAAAA,EAAA7F,MAAA,CAEA,GAAA8e,YAAAC,MAAA,CAAAlZ,IAAAq9F,GAAAr9F,EAAAiZ,aACA,OAAAjZ,EAAAqb,UAAA,CAEA,oBAAArb,EACA,gBACA,2FACA,OAAAA,EACA,CAGA,IAAA2yB,EAAA3yB,EAAA7F,MAAA,CACA8jG,EAAA5rE,UAAAl4B,MAAA,IAAAk4B,CAAA,IAAAA,SAAA,QAAA4rE,GAAAtrE,IAAAA,EAAA,SAIA,IAAAurE,EAAS,GACT,OACA,OAAA97F,GACA,YACA,aACA,aACA,OAAAuwB,CACA,YACA,YACA,OAAAwrE,GAAAn+F,GAAA7F,MAAA,KACA,OACA,YACA,cACA,eACA,OAAAw4B,EAAAA,CACA,WACA,OAAAA,IAAA,CACA,cACA,OAAAyrE,GAAAp+F,GAAA7F,MAAA,SAEA,GAAA+jG,EACA,OAAAD,EAAA,GAAAE,GAAAn+F,GAAA7F,MAAA,CAEAiI,EAAA,IAAAA,CAAA,EAAAmX,WAAA,GACA2kF,EAAA,EACA,CAEA,CAGA,SAAAG,EAAAj8F,CAAA,CAAAqoC,CAAA,CAAA1gB,CAAA,MAAAm0E,EAAA,GAeA,GALAzzD,CAAAA,KAAAztC,IAAAytC,GAAAA,EAAA,IACAA,CAAAA,EAAA,GAIAA,EAAA,KAAAtwC,MAAA,GAIA4vB,CAAAA,KAAA/sB,IAAA+sB,GAAAA,EAAA,KAAA5vB,MAAA,GACA4vB,CAAAA,EAAA,KAAA5vB,MAAA,EAGA4vB,GAAA,GAQAA,CAHAA,KAAA,IAAA0gB,CAAAA,KAAA,IAZA,SAqBA,IAHAroC,GAAAA,CAAAA,EAAA,UAIA,OAAAA,GACA,iBAAAk8F,EAAA,KAAA7zD,EAAA1gB,EAGA,YACA,mBAAAw0E,EAAA,KAAA9zD,EAAA1gB,EAGA,oBAAAy0E,EAAA,KAAA/zD,EAAA1gB,EAGA,cACA,oBAAA00E,EAAA,KAAAh0D,EAAA1gB,EAGA,qBAAA20E,EAAA,KAAAj0D,EAAA1gB,EAGA,YACA,YACA,cACA,sBAAA40E,EAAA,KAAAl0D,EAAA1gB,EAGA,SACA,GAAAm0E,EAAA,qCAAA97F,EAAA,CACAA,EAAA,CAAAA,EAAA,IAAAmX,WAAA,GACA2kF,EAAA,EACA,CACA,CAWA,SAAAU,EAAA3sF,CAAA,CAAA1Y,CAAA,CAAA6pB,CAAA,EACA,IAAA7jB,EAAA0S,CAAA,CAAA1Y,EAAA,CACA0Y,CAAA,CAAA1Y,EAAA,CAAA0Y,CAAA,CAAAmR,EAAA,CACAnR,CAAA,CAAAmR,EAAA,CAAA7jB,CAAA,CA4IA,SAAAs/F,EAAAvjF,CAAA,CAAAgrB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,CAAAsqC,CAAA,EACA,GAAApxB,IAAAA,EAAAnhB,MAAA,WAoBA,GAhBA,iBAAA28D,GACA10D,EAAA00D,EACIA,EAAA,GACJA,EAAA,WACIA,EAAA,WACJA,EAAA,aACAA,CAAAA,EAAA,aAGAknC,GADAlnC,EAAA,CAAAA,IAGAA,CAAAA,EAAApqB,EAAA,EAAApxB,EAAAnhB,MAAA,IAIA28D,EAAA,GAAAA,CAAAA,EAAAx7C,EAAAnhB,MAAA,CAAA28D,CAAA,EACAA,GAAAx7C,EAAAnhB,MAAA,EACA,GAAAuyC,EAAA,SACI,CAAAoqB,EAAAx7C,EAAAnhB,MAAA,EACJ,SAAA28D,EAAA,GACA,IAAApqB,EACA,UADAoqB,EAAA,CACA,IAIA,iBAAAxwB,GACAA,CAAAA,EAAA3sC,EAAA2d,IAAA,CAAAgvB,EAAAlkC,EAAA,EAIAzI,EAAAgd,QAAA,CAAA2vB,UAEA,IAAAA,EAAAnsC,MAAA,CACA,GAEI2kG,EAAAxjF,EAAAgrB,EAAAwwB,EAAA10D,EAAAsqC,EADJ,CAEA,oBAAApG,QAEA,CADAA,GAAA,IACA,mBAAA7gC,WAAAiC,SAAA,CAAAyR,OAAA,EACA,EACQ1T,WAAAiC,SAAA,CAAAyR,OAAA,CAAAvR,IAAA,CAAA0T,EAAAgrB,EAAAwwB,GAERrxD,WAAAiC,SAAA,CAAAq3F,WAAA,CAAAn3F,IAAA,CAAA0T,EAAAgrB,EAAAwwB,EACA,CAEAgoC,EAAAxjF,EAAA,CAAAgrB,EAAA,CAAAwwB,EAAA10D,EAAAsqC,EADA,OAIA,kDAGA,SAAAoyD,EAAA/3B,CAAA,CAAAzgC,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,CAAAsqC,CAAA,EACA,IA0BAntC,EA1BAy/F,EAAA,EACAC,EAAAl4B,EAAA5sE,MAAA,CAAA+kG,EAAA54D,EAAAnsC,MAAA,CAGA,GAAAiI,KAAApF,IAAAoF,GAEAA,CAAAA,SADAA,CAAAA,EAAAiX,OAAAjX,GAAAmX,WAAA,KACAnX,UAAAA,GACAA,YAAAA,GAAAA,aAAAA,CAAA,GACA,GAAA2kE,EAAA5sE,MAAA,IAAAmsC,EAAAnsC,MAAA,GACA,SACA,CACA6kG,EAAA,EACAC,GAAA,EACAC,GAAA,EACApoC,GAAA,CACA,UAGA8kC,EAAA3gF,CAAA,CAAA1b,CAAA,SACA,IAAAy/F,EACM/jF,CAAA,CAAA1b,EAAA,CAEN0b,EAAAkkF,YAAA,CAAA5/F,EAAAy/F,EACA,CAIA,GAAAtyD,EAAA,CACA,IAAA0yD,EAAA,GACA,IAAA7/F,EAAAu3D,EAAAv3D,EAAA0/F,EAAA1/F,IACA,GAAAq8F,EAAA70B,EAAAxnE,KAAAq8F,EAAAt1D,EAAA84D,KAAAA,EAAA,EAAA7/F,EAAA6/F,CAAA,EAEQ,IADR,KAAAA,GAAAA,CAAAA,EAAA7/F,CAAAA,EACQA,EAAA6/F,EAAA,IAAAF,EAAA,OAAAE,EAAAJ,CAAA,MAER,KAAAI,GAAA7/F,CAAAA,GAAAA,EAAA6/F,CAAA,EACAA,EAAA,EACA,MAIA,IADAtoC,EAAAooC,EAAiCD,GAAAnoC,CAAAA,EAAAmoC,EAAAC,CAAA,EACjC3/F,EAAAu3D,EAAAv3D,GAAA,EAAAA,IAAA,CACA,IAAA23E,EAAA,GACA,QAAAzpD,EAAA,EAAAA,EAAAyxE,EAAAzxE,IACA,GAAAmuE,EAAA70B,EAAAxnE,EAAAkuB,KAAAmuE,EAAAt1D,EAAA7Y,GAAA,CACAypD,EAAA,GACA,MACA,GAEAA,EAAA,OAAA33E,CAAA,CACA,OAGA,GAeA,SAAA8/F,EAAApkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,MAiBAoF,EAhBA2S,EAAAL,OAAAK,IAAA,EACA,IAAAotF,EAAArkF,EAAA9gB,MAAA,CAAA+X,EACA/X,EAGAA,CAAAA,EAAA0X,OAAA1X,EAAA,EACAmlG,GACAnlG,CAAAA,EAAAmlG,CAAA,EAJInlG,EAAAmlG,EAOJ,IAAAC,EAAAv/F,EAAA7F,MAAA,CAOA,IAJAA,EAAAolG,EAAA,GACAplG,CAAAA,EAAAolG,EAAA,GAGAhgG,EAAA,EAAAA,EAAApF,EAAA,EAAAoF,EAAA,CACA,IAAAuuB,EAAA4X,SAAA1lC,EAAAyqD,MAAA,CAAAlrD,EAAAA,EAAA,OACA,GAAAy+F,GAAAlwE,GAAA,MACA7S,CAAA,CAAA/I,EAAA3S,EAAA,CAAAuuB,CACA,CACA,OAAAvuB,CAAA,CAGA,SAAAigG,EAAAvkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAtB,GAAAn+F,EAAAib,EAAA9gB,MAAA,CAAA+X,GAAA+I,EAAA/I,EAAA/X,EAAA,CAGA,SAAAulG,EAAAzkF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAE,GAAA3/F,GAAAib,EAAA/I,EAAA/X,EAAA,CAGA,SAAAylG,EAAA3kF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAArB,GAAAp+F,GAAAib,EAAA/I,EAAA/X,EAAA,CAGA,SAAA0lG,EAAA5kF,CAAA,CAAAjb,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,EACA,OAAAslG,GAAAK,GAAA9/F,EAAAib,EAAA9gB,MAAA,CAAA+X,GAAA+I,EAAA/I,EAAA/X,EAAA,CA+EA,SAAAukG,EAAAzjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,SACA,IAAA0gB,GAAA1gB,IAAA9O,EAAA9gB,MAAA,CACIywD,EAAAC,aAAA,CAAA5vC,GAEJ2vC,EAAAC,aAAA,CAAA5vC,EAAA1gB,KAAA,CAAAkwC,EAAA1gB,GACA,CAGA,SAAAw0E,EAAAtjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACAA,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAAA,IAAAnnB,EAAA,GAGArD,EAAAkrC,EACA,KAAAlrC,EAAAwqB,GAAA,CACA,IAAAg2E,EAAA9kF,CAAA,CAAA1b,EAAA,CACAygG,EAAA,KACAC,EAAA,MACA,EACA,MACA,EACA,MACA,IAGA,GAAA1gG,EAAA0gG,GAAAl2E,EAAA,KAAAm2E,EAAAC,EAAAC,EAAAC,EAGA,OAAAJ,GACA,OACAF,EAAA,KACAC,CAAAA,EAAAD,CAAA,EAEA,WACA,EAEAG,CAAAA,IADAA,CAAAA,EAAAjlF,CAAA,CAAA1b,EAAA,GACA,QAEA8gG,CADAA,EAAA,CAAAN,GAAAA,CAAA,KAAAG,GAAAA,CAAA,EACA,KACAF,CAAAA,EAAAK,CAAA,EAGA,WACA,EACAH,EAAAjlF,CAAA,CAAA1b,EAAA,GACA4gG,EAAAllF,CAAA,CAAA1b,EAAA,GACA2gG,CAAAA,IAAAA,CAAA,SAAAC,IAAAA,CAAA,QAEAE,CADAA,EAAA,CAAAN,GAAAA,CAAA,OAAAG,GAAAA,CAAA,KAAAC,GAAAA,CAAA,EACA,MAAAE,CAAAA,EAAA,OAAAA,EAAA,QACAL,CAAAA,EAAAK,CAAA,EAGA,WACA,EACAH,EAAAjlF,CAAA,CAAA1b,EAAA,GACA4gG,EAAAllF,CAAA,CAAA1b,EAAA,GACA6gG,EAAAnlF,CAAA,CAAA1b,EAAA,GACA2gG,CAAAA,IAAAA,CAAA,SAAAC,IAAAA,CAAA,SAAAC,IAAAA,CAAA,QAEAC,CADAA,EAAA,CAAAN,GAAAA,CAAA,OAAAG,GAAAA,CAAA,OAAAC,GAAAA,CAAA,KAAAC,GAAAA,CAAA,EACA,OAAAC,EAAA,SACAL,CAAAA,EAAAK,CAAA,CAGA,MAGA,GAAAL,GAGAA,EAAA,MACMC,EAAA,GACND,EAAA,QAEAA,GAAA,MACAp9F,EAAAnK,IAAA,CAAAunG,IAAA,eACAA,EAAA,MAAAA,KAAAA,GAGAp9F,EAAAnK,IAAA,CAAAunG,GACAzgG,GAAA0gG,CAAA,CAGA,OAAAK,EAAA19F,EAAA,CA3+BkB3J,EAAAsnG,UAAA,CAAA5D,EAgBlBhjG,EAAA6mG,mBAAA,CAAA5D,IAGAjjG,EAAA6mG,mBAAA,sBAAAv9F,SACA,mBAAAA,QAAA9D,KAAA,EACA8D,QAAA9D,KAAA,CACA,iJAkBAnD,OAAA8L,cAAA,CAAAnO,EAAA+N,SAAA,WACAud,WAAA,GACAjJ,IAAA,WACA,GAAAriB,EAAAgd,QAAA,OACA,YAAA2E,MAAA,CACC,GAGDtf,OAAA8L,cAAA,CAAAnO,EAAA+N,SAAA,WACAud,WAAA,GACAjJ,IAAA,WACA,GAAAriB,EAAAgd,QAAA,OACA,YAAAmgD,UAAA,CACC,GAmCDn9D,EAAA8mG,QAAA,MA+DA9mG,EAAA2d,IAAA,UAAA3b,CAAA,CAAAshG,CAAA,CAAA9iG,CAAA,EACA,OAAAmd,EAAA3b,EAAAshG,EAAA9iG,EAAA,EAKA6B,OAAA+gG,cAAA,CAAApjG,EAAA+N,SAAA,CAAAjC,WAAAiC,SAAA,EAAA1L,OAAA+gG,cAAA,CAAApjG,EAAA8L,YA+BA9L,EAAAknB,KAAA,UAAA/mB,CAAA,CAAAs0F,CAAA,CAAAhsF,CAAA,EACA,OAAAye,EAAA/mB,EAAAs0F,EAAAhsF,EAAA,EAWAzI,EAAAujG,WAAA,UAAApjG,CAAA,EACA,OAAAojG,EAAApjG,EACA,EAIAH,EAAA+mG,eAAA,UAAA5mG,CAAA,EACA,OAAAojG,EAAApjG,EAAA,EA8GAH,EAAAgd,QAAA,UAAA1E,CAAA,EACA,OAAAA,IAAA,EAAAA,GAAAA,CAAA,IAAAA,EAAA0uF,SAAA,EACA1uF,IAAAtY,EAAA+N,SAAA,EAGA/N,EAAAs2D,OAAA,UAAAl3D,CAAA,CAAAkZ,CAAA,EAGA,GAFAorF,GAAAtkG,EAAA0M,aAAA1M,CAAAA,EAAAY,EAAA2d,IAAA,CAAAve,EAAAA,EAAAmZ,MAAA,CAAAnZ,EAAAsiB,UAAA,GACAgiF,GAAAprF,EAAAxM,aAAAwM,CAAAA,EAAAtY,EAAA2d,IAAA,CAAArF,EAAAA,EAAAC,MAAA,CAAAD,EAAAoJ,UAAA,GACA,CAAA1hB,EAAAgd,QAAA,CAAA5d,IAAA,CAAAY,EAAAgd,QAAA,CAAA1E,GACA,gBACA,wEACA,CAEA,GAAAlZ,IAAAkZ,EAAA,SAGA,IAAA5V,EAAAtD,EAAAoB,MAAA,CAAAuzB,EAAAzb,EAAA9X,MAAA,CAGA,QAAAoF,EAAA,EAAAozB,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAAAnuB,EAAAozB,EAAA,EAAApzB,EACA,GAAAxG,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,CAAA1S,EAAA,EACAlD,EAAAtD,CAAA,CAAAwG,EAAA,CACAmuB,EAAAzb,CAAA,CAAA1S,EAAA,CACA,MACA,OAGA,EAAAmuB,EAAA,GACAA,EAAArxB,EAAA,EACA,CAFA,EAKA1C,EAAAikG,UAAA,UAAAx7F,CAAA,EACA,OAAAiX,OAAAjX,GAAAmX,WAAA,IACA,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,eACA,QACA,SACA,QACA,GAGA5f,EAAA01B,MAAA,UAAAs0C,CAAA,CAAAxpE,CAAA,MASAoF,EARA,IAAAxF,MAAA6D,OAAA,CAAA+lE,GACA,+DAGA,GAAAA,IAAAA,EAAAxpE,MAAA,CACA,OAAAR,EAAAknB,KAAA,IAIA,GAAA1mB,KAAA6C,IAAA7C,EAEA,IAAAoF,EAAA,EADApF,EAAA,EACAoF,EAAAokE,EAAAxpE,MAAA,GAAAoF,EACApF,GAAAwpE,CAAA,CAAApkE,EAAA,CAAApF,MAAA,CAIA,IAAAmhB,EAAA3hB,EAAAujG,WAAA,CAAA/iG,GACAymG,EAAA,EACA,IAAArhG,EAAA,EAAAA,EAAAokE,EAAAxpE,MAAA,GAAAoF,EAAA,CACA,IAAA0b,EAAA0oD,CAAA,CAAApkE,EAAA,CACA,GAAA89F,GAAApiF,EAAAxV,YACAm7F,EAAA3lF,EAAA9gB,MAAA,CAAAmhB,EAAAnhB,MAAA,EACAR,EAAAgd,QAAA,CAAAsE,IAAAA,CAAAA,EAAAthB,EAAA2d,IAAA,CAAA2D,EAAA,EACQA,EAAA6F,IAAA,CAAAxF,EAAAslF,IAERn7F,WAAAiC,SAAA,CAAApJ,GAAA,CAAAsJ,IAAA,CACA0T,EACAL,EACA2lF,QAGA,GAAAjnG,EAAAgd,QAAA,CAAAsE,GAGAA,EAAA6F,IAAA,CAAAxF,EAAAslF,QAFM,+DAINA,GAAA3lF,EAAA9gB,MAAA,CAEA,OAAAmhB,CAAA,EAiDA3hB,EAAA0hB,UAAA,CAAAA,EA8EA1hB,EAAA+N,SAAA,CAAAi5F,SAAA,IASAhnG,EAAA+N,SAAA,CAAAm5F,MAAA,YACA,IAAAluE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAo5F,MAAA,YACA,IAAAnuE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAq5F,MAAA,YACA,IAAApuE,EAAA,KAAAx4B,MAAA,CACA,GAAAw4B,EAAA,KACA,8DAEA,QAAApzB,EAAA,EAAAA,EAAAozB,EAAApzB,GAAA,EACAq/F,EAAA,KAAAr/F,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GACAq/F,EAAA,KAAAr/F,EAAA,EAAAA,EAAA,GAEA,aAGA5F,EAAA+N,SAAA,CAAAxF,QAAA,YACA,IAAA/H,EAAA,KAAAA,MAAA,QACA,IAAAA,EAAA,GACAk4B,GAAAA,UAAAl4B,MAAA,CAAAokG,EAAA,OAAApkG,GACAkkG,EAAArkG,KAAA,MAAAq4B,UAFA,EAIA14B,EAAA+N,SAAA,CAAAs5F,cAAA,CAAArnG,EAAA+N,SAAA,CAAAxF,QAAA,CAGAvI,EAAA+N,SAAA,CAAA02C,MAAA,UAAAnsC,CAAA,EACA,IAAAtY,EAAAgd,QAAA,CAAA1E,GAAA,oDACA,OAAAA,GACAtY,IAAAA,EAAAs2D,OAAA,MAAAh+C,EAAA,EAGAtY,EAAA+N,SAAA,CAAAu5F,OAAA,YACA,IAAAl9E,EAAA,GACAuhB,EAAArsC,EAAAyjG,iBAAA,CAGA,OAFA34E,EAAA,KAAA7hB,QAAA,SAAAojC,GAAA/nB,OAAA,kBAAAF,IAAA,GACA,KAAAljB,MAAA,CAAAmrC,GAAAvhB,CAAAA,GAAA,SACA,WAAAA,EAAA,GACA,EACAy4E,GACA7iG,CAAAA,EAAA+N,SAAA,CAAA80F,EAAA,CAAA7iG,EAAA+N,SAAA,CAAAu5F,OAAA,EAGAtnG,EAAA+N,SAAA,CAAAuoD,OAAA,UAAArZ,CAAA,CAAAnM,CAAA,CAAA1gB,CAAA,CAAAm3E,CAAA,CAAAC,CAAA,EAIA,GAHA9D,GAAAzmD,EAAAnxC,aACAmxC,CAAAA,EAAAj9C,EAAA2d,IAAA,CAAAs/B,EAAAA,EAAA1kC,MAAA,CAAA0kC,EAAAv7B,UAAA,GAEA,CAAA1hB,EAAAgd,QAAA,CAAAigC,GACA,gBACA,iFACA,OAAAA,EACA,CAgBA,GAbA55C,KAAAA,IAAAytC,GACAA,CAAAA,EAAA,GAEAztC,KAAAA,IAAA+sB,GACAA,CAAAA,EAAA6sB,EAAAA,EAAAz8C,MAAA,IAEA6C,KAAAA,IAAAkkG,GACAA,CAAAA,EAAA,GAEAlkG,KAAAA,IAAAmkG,GACAA,CAAAA,EAAA,KAAAhnG,MAAA,EAGAswC,EAAA,GAAA1gB,EAAA6sB,EAAAz8C,MAAA,EAAA+mG,EAAA,GAAAC,EAAA,KAAAhnG,MAAA,CACA,uCAGA,GAAA+mG,GAAAC,GAAA12D,GAAA1gB,EACA,QACA,CACA,GAAAm3E,GAAAC,EACA,SACA,CACA,GAAA12D,GAAA1gB,EACA,SAOA,GAJA0gB,KAAA,EACA1gB,KAAA,EACAm3E,KAAA,EAAAC,KAAA,EAEA,OAAAvqD,EAAA,SAGA,IAAAv6C,EAAA8kG,EAAAD,EACAxzE,EAAA3D,EAAA0gB,EAAA9X,EAAA14B,KAAAorC,GAAA,CAAAhpC,EAAAqxB,GAGA0zE,EAAA,KAAA7mG,KAAA,CAAA2mG,EAAAC,GAAAE,EAAAzqD,EAAAr8C,KAAA,CAAAkwC,EAAA1gB,GAGA,QAAAxqB,EAAA,EAAAA,EAAAozB,EAAA,EAAApzB,EACA,GAAA6hG,CAAA,CAAA7hG,EAAA,GAAA8hG,CAAA,CAAA9hG,EAAA,EACAlD,EAAA+kG,CAAA,CAAA7hG,EAAA,CACAmuB,EAAA2zE,CAAA,CAAA9hG,EAAA,CACA,MACA,OAGA,EAAAmuB,EAAA,GACAA,EAAArxB,EAAA,EACA,CAFA,EA8HA1C,EAAA+N,SAAA,CAAAimD,QAAA,UAAArnB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,iBAAA+W,OAAA,CAAAmtB,EAAAwwB,EAAA10D,EAAA,EAGAzI,EAAA+N,SAAA,CAAAyR,OAAA,UAAAmtB,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,OAAAy8F,EAAA,KAAAv4D,EAAAwwB,EAAA10D,EAAA,KAGAzI,EAAA+N,SAAA,CAAAq3F,WAAA,UAAAz4D,CAAA,CAAAwwB,CAAA,CAAA10D,CAAA,EACA,OAAAy8F,EAAA,KAAAv4D,EAAAwwB,EAAA10D,EAAA,KA6CAzI,EAAA+N,SAAA,CAAAoP,KAAA,UAAA9W,CAAA,CAAAkS,CAAA,CAAA/X,CAAA,CAAAiI,CAAA,EAEA,GAAA8P,KAAAlV,IAAAkV,EACA9P,EAAA,OACAjI,EAAA,KAAAA,MAAA,CACA+X,EAAA,OAEA,GAAA/X,KAAA6C,IAAA7C,GAAA,iBAAA+X,EACA9P,EAAA8P,EACA/X,EAAA,KAAAA,MAAA,CACA+X,EAAA,OAEA,GAAAovF,SAAApvF,GACAA,KAAA,EACAovF,SAAAnnG,IACAA,KAAA,EACM6C,KAAAA,IAAAoF,GAAAA,CAAAA,EAAA,UAENA,EAAAjI,EACAA,EAAA6C,KAAAA,QAGA,YACA,0EACA,CAGA,IAAAsiG,EAAA,KAAAnlG,MAAA,CAAA+X,EAGA,GAHA/X,CAAAA,KAAA6C,IAAA7C,GAAAA,EAAAmlG,CAAA,GAAAnlG,CAAAA,EAAAmlG,CAAA,EAGA,EAAAnlG,MAAA,IAAAA,CAAAA,EAAA,GAAA+X,EAAA,IAAAA,EAAA,KAAA/X,MAAA,CACA,2DAEAiI,GAAAA,CAAAA,EAAA,QAGA,IAAA87F,EAAS,GACT,OACA,OAAA97F,GACA,iBAAAi9F,EAAA,KAAAr/F,EAAAkS,EAAA/X,EAGA,YACA,mBAAAqlG,EAAA,KAAAx/F,EAAAkS,EAAA/X,EAGA,aACA,aACA,oBAAAulG,EAAA,KAAA1/F,EAAAkS,EAAA/X,EAGA,cACA,OAAAylG,EAAA,KAAA5/F,EAAAkS,EAAA/X,EAGA,YACA,YACA,cACA,sBAAA0lG,EAAA,KAAA7/F,EAAAkS,EAAA/X,EAGA,SACA,GAAA+jG,EAAA,qCAAA97F,EAAA,CACAA,EAAA,IAAAA,CAAA,EAAAmX,WAAA,GACA2kF,EAAA,EACA,CACA,EAGAvkG,EAAA+N,SAAA,CAAA+4E,MAAA,YACA,OACA5kF,KAAA,SACAlB,KAAAZ,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,MAAA25F,IAAA,SACA,GAyFA,IAAAC,EAAA,KAGA,SAAAlB,EAAAmB,CAAA,EACA,IAAA9uE,EAAA8uE,EAAAtnG,MAAA,CACA,GAAAw4B,GAAA6uE,EACA,OAAAnoF,OAAA8B,YAAA,CAAAnhB,KAAA,CAAAqf,OAAAooF,EAAA,CAIA,IAAA7+F,EAAA,GACArD,EAAA,EACA,KAAAA,EAAAozB,GACA/vB,GAAAyW,OAAA8B,YAAA,CAAAnhB,KAAA,CACAqf,OACAooF,EAAAlnG,KAAA,CAAAgF,EAAAA,GAAAiiG,IAGA,OAAA5+F,CAAA,CAGA,SAAA47F,EAAAvjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAusD,EAAA,GAAAvsD,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAGA,QAAAxqB,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA+2E,GAAAj9D,OAAA8B,YAAA,CAAAF,IAAAA,CAAA,CAAA1b,EAAA,EAEA,OAAA+2E,CAAA,CAGA,SAAAmoB,EAAAxjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAusD,EAAA,GAAAvsD,EAAA9vB,KAAAorC,GAAA,CAAApqB,EAAA9gB,MAAA,CAAA4vB,GAGA,QAAAxqB,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA+2E,GAAAj9D,OAAA8B,YAAA,CAAAF,CAAA,CAAA1b,EAAA,EAEA,OAAA+2E,CAAA,CAGA,SAAAgoB,EAAArjF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,MAAA4I,EAAA1X,EAAA9gB,MAAA,CAGA,EAAAswC,GAAAA,EAAA,IAAAA,CAAAA,EAAA,KAAA1gB,GAAAA,EAAA,GAAAA,EAAA4I,CAAA,GAAA5I,CAAAA,EAAA4I,CAAA,EAGA,IAAAg8D,EAAA,GACA,QAAApvF,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACAovF,GAAA+S,EAAA,CAAAzmF,CAAA,CAAA1b,EAAA,EAEA,OAAAovF,CAAA,CAGA,SAAAgQ,EAAA1jF,CAAA,CAAAwvB,CAAA,CAAA1gB,CAAA,EACA,IAAAzM,EAAArC,EAAA1gB,KAAA,CAAAkwC,EAAA1gB,GACAnnB,EAAA,GAEA,QAAArD,EAAA,EAAAA,EAAA+d,EAAAnjB,MAAA,GAAAoF,GAAA,EACAqD,GAAAyW,OAAA8B,YAAA,CAAAmC,CAAA,CAAA/d,EAAA,CAAA+d,IAAAA,CAAA,CAAA/d,EAAA,IAEA,OAAAqD,CAAA,CAkCA,SAAA++F,EAAAzvF,CAAA,CAAA0vF,CAAA,CAAAznG,CAAA,EACA,WAAA+X,EAAA,yCACA,GAAAA,EAAA0vF,EAAAznG,EAAA,0DA0QA,SAAA0nG,EAAA5mF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAA0vF,CAAA,CAAAt8D,CAAA,CAAAD,CAAA,EACA,IAAA1rC,EAAAgd,QAAA,CAAAsE,GAAA,+DACA,GAAAtf,EAAA2pC,GAAA3pC,EAAA0pC,EAAA,sDACA,GAAAnzB,EAAA0vF,EAAA3mF,EAAA9gB,MAAA,wCAgGA,SAAA2nG,EAAA7mF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAmzB,CAAA,CAAAC,CAAA,EAAAy8D,EAAApmG,EAAA0pC,EAAAC,EAAArqB,EAAA/I,EAAA,GAGA,IAAAS,EAAAd,OAAAlW,EAAA6nD,OAAA,YACAvoC,CAAAA,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,IAAA,CAAAS,EACA,IAAAqvF,EAAAnwF,OAAAlW,GAAA6nD,OAAA,IAAAA,OAAA,aAQA,OAPAvoC,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,IAAA,CAAA8vF,EACA9vF,CAAA,CAGA,SAAA+vF,EAAAhnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAmzB,CAAA,CAAAC,CAAA,EAAAy8D,EAAApmG,EAAA0pC,EAAAC,EAAArqB,EAAA/I,EAAA,GAGA,IAAAS,EAAAd,OAAAlW,EAAA6nD,OAAA,YACAvoC,CAAAA,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACAA,IAAA,EACAsI,CAAA,CAAA/I,EAAA,GAAAS,EACA,IAAAqvF,EAAAnwF,OAAAlW,GAAA6nD,OAAA,IAAAA,OAAA,aAQA,OAPAvoC,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,GAAA8vF,EACAA,IAAA,EACA/mF,CAAA,CAAA/I,EAAA,CAAA8vF,EACA9vF,EAAA,EAmHA,SAAAgwF,EAAAjnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAA0vF,CAAA,CAAAt8D,CAAA,CAAAD,CAAA,EACA,GAAAnzB,EAAA0vF,EAAA3mF,EAAA9gB,MAAA,EACA+X,EAAA,EADA,uCAIA,SAAAiwF,EAAAlnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAkwF,CAAA,CAAAC,CAAA,EAOA,OANA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GACAH,EAAAjnF,EAAAtf,EAAAuW,EAAA,8CAEAypF,EAAA7kF,KAAA,CAAAmE,EAAAtf,EAAAuW,EAAAkwF,EAAA,MACAlwF,EAAA,EAWA,SAAAowF,EAAArnF,CAAA,CAAAtf,CAAA,CAAAuW,CAAA,CAAAkwF,CAAA,CAAAC,CAAA,EAOA,OANA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GACAH,EAAAjnF,EAAAtf,EAAAuW,EAAA,gDAEAypF,EAAA7kF,KAAA,CAAAmE,EAAAtf,EAAAuW,EAAAkwF,EAAA,MACAlwF,EAAA,EAxkBAvY,EAAA+N,SAAA,CAAAnN,KAAA,UAAAkwC,CAAA,CAAA1gB,CAAA,EACA,IAAA4I,EAAA,KAAAx4B,MAAA,CACAswC,EAAA,EAAAA,EAAA1gB,EAAAA,KAAA/sB,IAAA+sB,EAAA4I,EAAA,EAAA5I,CAAA,CAGA0gB,EAAA,EACAA,CAAAA,GAAA9X,CAAA,EACI,GAAA8X,CAAAA,EAAA,GACJA,EAAA9X,GACA8X,CAAAA,EAAA9X,CAAA,EAGA5I,EAAA,EACAA,CAAAA,GAAA4I,CAAA,EACI,GAAA5I,CAAAA,EAAA,GACJA,EAAA4I,GACA5I,CAAAA,EAAA4I,CAAA,EAEA5I,EAAA0gB,GAAA1gB,CAAAA,EAAA0gB,CAAA,EAGA,IAAA83D,EAAA,KAAAh+B,QAAA,CAAA95B,EAAA1gB,GAIA,OAHA/tB,OAAA+gG,cAAA,CAAAwF,EAAA5oG,EAAA+N,SAAA,EAGA66F,CAAA,EAWA5oG,EAAA+N,SAAA,CAAA86F,UAAA,CACA7oG,EAAA+N,SAAA,CAAAwL,UAAA,UAAAhB,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,CACA2nC,EAAA,EACAt6C,EAAA,EACA,OAAAA,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA3S,EAAA,CAAAs6C,EAGA,OAAAvT,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA+6F,UAAA,CACA9oG,EAAA+N,SAAA,CAAA0L,UAAA,UAAAlB,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EACAgnF,GACAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,EAAAmJ,EAAA,CACAw+B,EAAA,EACA,KAAAx+B,EAAA,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA,EAAAmJ,EAAA,CAAAw+B,EAGA,OAAAvT,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAg7F,SAAA,CACA/oG,EAAA+N,SAAA,CAAAi7F,SAAA,UAAAzwF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,EAGAvY,EAAA+N,SAAA,CAAAk7F,YAAA,CACAjpG,EAAA+N,SAAA,CAAAm7F,YAAA,UAAA3wF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,MAAAA,EAAA,OAGAvY,EAAA+N,SAAA,CAAAo7F,YAAA,CACAnpG,EAAA+N,SAAA,CAAAy3F,YAAA,UAAAjtF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,KAAA+X,EAAA,SAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAq7F,YAAA,CACAppG,EAAA+N,SAAA,CAAAmM,YAAA,UAAA3B,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,MAAA+X,EAAA,CACA,KAAAA,EAAA,MACA,KAAAA,EAAA,QACA,cAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAs7F,YAAA,CACArpG,EAAA+N,SAAA,CAAAywF,YAAA,UAAAjmF,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,cAAA+X,EAAA,CACA,MAAAA,EAAA,OACA,KAAAA,EAAA,MACA,KAAAA,EAAA,KAGAvY,EAAA+N,SAAA,CAAAu7F,eAAA,CAAAC,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAwY,EAAAlS,EACA,WAAAyR,EAAA,CACA,aAAAA,EAAA,iBAAAA,EAAA,CAGA8vF,EAAA,OAAA9vF,EAAA,CACA,WAAAA,EAAA,CACA,aAAAA,EAAA,CAAAkxF,SAAAA,EAGC,OAAA5/C,OAAA7wC,GAAA6wC,CAAAA,OAAAw+C,IAAAx+C,OAAA,OAGD7pD,EAAA+N,SAAA,CAAA47F,eAAA,CAAAJ,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAA6nG,EAAAvhG,SAAAA,EACA,aAAAyR,EAAA,CACA,WAAAA,EAAA,QAAAA,EAAA,CAGAS,EAAA,gBAAAT,EAAA,CACA,aAAAA,EAAA,CACA,WAAAA,EAAA,CAAAkxF,EAGC,OAAA5/C,OAAAw+C,IAAAx+C,OAAA,KAAAA,OAAA7wC,EAAA,GAGDhZ,EAAA+N,SAAA,CAAAqwF,SAAA,UAAA7lF,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,CACA2nC,EAAA,EACAt6C,EAAA,EACA,OAAAA,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA3S,EAAA,CAAAs6C,EAMA,OAHAvT,GAFAuT,CAAAA,GAAA,MAEAvT,CAAAA,GAAArsC,KAAAs/C,GAAA,KAAAl+B,EAAA,EAGAirB,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAuwF,SAAA,UAAA/lF,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EACAnwF,KAAA,EACAmJ,KAAA,EAAAgnF,GAAAV,EAAAzvF,EAAAmJ,EAAA,KAAAlhB,MAAA,EAGA,IAAAoF,EAAA8b,EACAw+B,EAAA,EACAvT,EAAA,KAAAp0B,EAAA,EAAA3S,EAAA,CACA,KAAAA,EAAA,GAAAs6C,CAAAA,GAAA,MACAvT,GAAA,KAAAp0B,EAAA,EAAA3S,EAAA,CAAAs6C,EAMA,OAHAvT,GAFAuT,CAAAA,GAAA,MAEAvT,CAAAA,GAAArsC,KAAAs/C,GAAA,KAAAl+B,EAAA,EAGAirB,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA67F,QAAA,UAAArxF,CAAA,CAAAmwF,CAAA,QAGA,CAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,SAAA+X,EAAA,EACA,YAAAA,EAAA,OADA,KAAAA,EAAA,EAIAvY,EAAA+N,SAAA,CAAA87F,WAAA,UAAAtxF,CAAA,CAAAmwF,CAAA,EACAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,IAAAmsC,EAAA,KAAAp0B,EAAA,MAAAA,EAAA,MACA,aAAAo0B,EAAAA,WAAAA,EAAAA,CAAA,EAGA3sC,EAAA+N,SAAA,CAAA+7F,WAAA,UAAAvxF,CAAA,CAAAmwF,CAAA,EACAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACA,IAAAmsC,EAAA,KAAAp0B,EAAA,QAAAA,EAAA,IACA,aAAAo0B,EAAAA,WAAAA,EAAAA,CAAA,EAGA3sC,EAAA+N,SAAA,CAAAuM,WAAA,UAAA/B,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,KAAA+X,EAAA,CACA,KAAAA,EAAA,MACA,KAAAA,EAAA,OACA,KAAAA,EAAA,QAGAvY,EAAA+N,SAAA,CAAA2wF,WAAA,UAAAnmF,CAAA,CAAAmwF,CAAA,EAIA,OAHAnwF,KAAA,EAAAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EAGA,KAAA+X,EAAA,KACA,KAAAA,EAAA,OACA,KAAAA,EAAA,MACA,KAAAA,EAAA,IAGAvY,EAAA+N,SAAA,CAAAg8F,cAAA,CAAAR,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAmsC,EAAA,KAAAp0B,EAAA,GACA,SAAAA,EAAA,GACA,WAAAA,EAAA,GAAAkxF,CAAAA,GAAA,IAGA,OAAA5/C,OAAAld,IAAAkd,OAAA,KACAA,OAAA/iD,EACA,WAAAyR,EAAA,CACA,aAAAA,EAAA,CACC,gBAAAA,EAAA,IAGDvY,EAAA+N,SAAA,CAAAi8F,cAAA,CAAAT,GAAA,SAAAhxF,CAAA,EAEAixF,EADAjxF,KAAA,EACA,UACA,IAAAzR,EAAA,KAAAyR,EAAA,CACAkxF,EAAA,KAAAlxF,EAAA,GACAzR,CAAAA,KAAAzD,IAAAyD,GAAA2iG,KAAApmG,IAAAomG,CAAA,GACAC,EAAAnxF,EAAA,KAAA/X,MAAA,IAGA,IAAAmsC,EAAA,CAAA7lC,GAAA,IACA,aAAAyR,EAAA,CACA,WAAAA,EAAA,QAAAA,EAAA,CAGA,OAAAsxC,OAAAld,IAAAkd,OAAA,KACAA,OAAA,gBAAAtxC,EAAA,CACA,aAAAA,EAAA,CACA,WAAAA,EAAA,CACCkxF,EAAA,GAGDzpG,EAAA+N,SAAA,CAAA6wF,WAAA,UAAArmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAwhG,EAAAC,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAA+wF,WAAA,UAAAvmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAwhG,EAAAC,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAAixF,YAAA,UAAAzmF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAwhG,EAAAC,IAAA,MAAA1pF,EAAA,UAGAvY,EAAA+N,SAAA,CAAAmxF,YAAA,UAAA3mF,CAAA,CAAAmwF,CAAA,EAGA,OAFAnwF,KAAA,EACAmwF,GAAAV,EAAAzvF,EAAA,OAAA/X,MAAA,EACAwhG,EAAAC,IAAA,MAAA1pF,EAAA,UASAvY,EAAA+N,SAAA,CAAAk8F,WAAA,CACAjqG,EAAA+N,SAAA,CAAAyL,WAAA,UAAAxX,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAIA,GAHA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmJ,KAAA,EACA,CAAAgnF,EAAA,CACA,IAAAwB,EAAA5pG,KAAAs/C,GAAA,KAAAl+B,GAAA,EACAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAAwoF,EAAA,OAGAhqD,EAAA,EACAt6C,EAAA,EAEA,IADA,KAAA2S,EAAA,CAAAvW,IAAAA,EACA,EAAA4D,EAAA8b,GAAAw+B,CAAAA,GAAA,MACA,KAAA3nC,EAAA3S,EAAA,GAAAs6C,EAAA,IAGA,OAAA3nC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAo8F,WAAA,CACAnqG,EAAA+N,SAAA,CAAA2L,WAAA,UAAA1X,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAIA,GAHA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmJ,KAAA,EACA,CAAAgnF,EAAA,CACA,IAAAwB,EAAA5pG,KAAAs/C,GAAA,KAAAl+B,GAAA,EACAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAAwoF,EAAA,OAGAtkG,EAAA8b,EAAA,EACAw+B,EAAA,EAEA,IADA,KAAA3nC,EAAA3S,EAAA,CAAA5D,IAAAA,EACA,EAAA4D,GAAA,GAAAs6C,CAAAA,GAAA,MACA,KAAA3nC,EAAA3S,EAAA,GAAAs6C,EAAA,IAGA,OAAA3nC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAq8F,UAAA,CACApqG,EAAA+N,SAAA,CAAAs8F,UAAA,UAAAroG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAKA,OAJA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,SACA,KAAAA,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAu8F,aAAA,CACAtqG,EAAA+N,SAAA,CAAAm1D,aAAA,UAAAlhE,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,WACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAw8F,aAAA,CACAvqG,EAAA+N,SAAA,CAAAy8F,aAAA,UAAAxoG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,WACA,KAAAA,EAAA,CAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA08F,aAAA,CACAzqG,EAAA+N,SAAA,CAAAqM,aAAA,UAAApY,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA28F,aAAA,CACA1qG,EAAA+N,SAAA,CAAA0wF,aAAA,UAAAz8F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GA+CAvY,EAAA+N,SAAA,CAAAo1D,gBAAA,CAAAomC,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA4vF,EAAA,KAAAnmG,EAAAuW,EAAAsxC,OAAA,GAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAA48F,gBAAA,CAAApB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA+vF,EAAA,KAAAtmG,EAAAuW,EAAAsxC,OAAA,GAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAAswF,UAAA,UAAAr8F,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAGA,GAFA1mG,EAAA,CAAAA,EACAuW,KAAA,EACA,CAAAmwF,EAAA,KAAAtwB,EAAA93E,KAAAs/C,GAAA,KAAAl+B,EAAA,GAGAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAA02D,EAAA,GAAAA,EAAA,KAGAxyE,EAAA,EACAs6C,EAAA,EACAW,EAAA,EAEA,IADA,KAAAtoC,EAAA,CAAAvW,IAAAA,EACA,EAAA4D,EAAA8b,GAAAw+B,CAAAA,GAAA,MACAl+C,EAAA,GAAA6+C,IAAAA,GAAA,SAAAtoC,EAAA3S,EAAA,IACAi7C,CAAAA,EAAA,GAEA,KAAAtoC,EAAA3S,EAAA,IAAAs6C,GAAA,GAAAW,EAAA,IAGA,OAAAtoC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAAwwF,UAAA,UAAAv8F,CAAA,CAAAuW,CAAA,CAAAmJ,CAAA,CAAAgnF,CAAA,EAGA,GAFA1mG,EAAA,CAAAA,EACAuW,KAAA,EACA,CAAAmwF,EAAA,KAAAtwB,EAAA93E,KAAAs/C,GAAA,KAAAl+B,EAAA,GAGAwmF,EAAA,KAAAlmG,EAAAuW,EAAAmJ,EAAA02D,EAAA,GAAAA,EAAA,KAGAxyE,EAAA8b,EAAA,EACAw+B,EAAA,EACAW,EAAA,EAEA,IADA,KAAAtoC,EAAA3S,EAAA,CAAA5D,IAAAA,EACA,EAAA4D,GAAA,GAAAs6C,CAAAA,GAAA,MACAl+C,EAAA,GAAA6+C,IAAAA,GAAA,SAAAtoC,EAAA3S,EAAA,IACAi7C,CAAAA,EAAA,GAEA,KAAAtoC,EAAA3S,EAAA,IAAAs6C,GAAA,GAAAW,EAAA,IAGA,OAAAtoC,EAAAmJ,CAAA,EAGA1hB,EAAA+N,SAAA,CAAA68F,SAAA,UAAA5oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,YACAvW,EAAA,GAAAA,CAAAA,EAAA,IAAAA,EAAA,GACA,KAAAuW,EAAA,CAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA88F,YAAA,UAAA7oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA+8F,YAAA,UAAA9oG,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAMA,OALA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,gBACA,KAAAA,EAAA,CAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAwM,YAAA,UAAAvY,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EAQA,OAPA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,0BACA,KAAAA,EAAA,CAAAvW,IAAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAA4wF,YAAA,UAAA38F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EASA,OARA1mG,EAAA,CAAAA,EACAuW,KAAA,EACAmwF,GAAAR,EAAA,KAAAlmG,EAAAuW,EAAA,0BACAvW,EAAA,GAAAA,CAAAA,EAAA,WAAAA,EAAA,GACA,KAAAuW,EAAA,CAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,GACA,KAAAuW,EAAA,GAAAvW,IAAA,EACA,KAAAuW,EAAA,GAAAvW,IAAAA,EACAuW,EAAA,GAGAvY,EAAA+N,SAAA,CAAAg9F,eAAA,CAAAxB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA4vF,EAAA,KAAAnmG,EAAAuW,EAAA,CAAAsxC,OAAA,sBAAAA,OAAA,yBAGD7pD,EAAA+N,SAAA,CAAAi9F,eAAA,CAAAzB,GAAA,SAAAvnG,CAAA,CAAAuW,EAAA,GACC,OAAA+vF,EAAA,KAAAtmG,EAAAuW,EAAA,CAAAsxC,OAAA,sBAAAA,OAAA,yBAkBD7pD,EAAA+N,SAAA,CAAA8wF,YAAA,UAAA78F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAF,EAAA,KAAAxmG,EAAAuW,EAAA,GAAAmwF,EAAA,EAGA1oG,EAAA+N,SAAA,CAAAgxF,YAAA,UAAA/8F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAF,EAAA,KAAAxmG,EAAAuW,EAAA,GAAAmwF,EAAA,EAaA1oG,EAAA+N,SAAA,CAAAkxF,aAAA,UAAAj9F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAC,EAAA,KAAA3mG,EAAAuW,EAAA,GAAAmwF,EAAA,EAGA1oG,EAAA+N,SAAA,CAAAoxF,aAAA,UAAAn9F,CAAA,CAAAuW,CAAA,CAAAmwF,CAAA,EACA,OAAAC,EAAA,KAAA3mG,EAAAuW,EAAA,GAAAmwF,EAAA,EAIA1oG,EAAA+N,SAAA,CAAAoZ,IAAA,UAAA81B,CAAA,CAAAguD,CAAA,CAAAn6D,CAAA,CAAA1gB,CAAA,EACA,IAAApwB,EAAAgd,QAAA,CAAAigC,GAAA,+CAQA,GAPAnM,GAAAA,CAAAA,EAAA,GACA1gB,GAAAA,IAAAA,GAAAA,CAAAA,EAAA,KAAA5vB,MAAA,EACAyqG,GAAAhuD,EAAAz8C,MAAA,EAAAyqG,CAAAA,EAAAhuD,EAAAz8C,MAAA,EACAyqG,GAAAA,CAAAA,EAAA,GAAA76E,EAAA,GAAAA,EAAA0gB,GAAA1gB,CAAAA,EAAA0gB,CAAA,EAIA1gB,IAAA0gB,GAAAmM,IAAAA,EAAAz8C,MAAA,WAAAA,MAAA,UAIA,GAAAyqG,EAAA,EACA,8CAEA,GAAAn6D,EAAA,GAAAA,GAAA,KAAAtwC,MAAA,2CAAA4vB,EAAA,8CAIAA,EAAA,KAAA5vB,MAAA,EAAA4vB,CAAAA,EAAA,KAAA5vB,MAAA,EACAy8C,EAAAz8C,MAAA,CAAAyqG,EAAA76E,EAAA0gB,GACA1gB,CAAAA,EAAA6sB,EAAAz8C,MAAA,CAAAyqG,EAAAn6D,CAAA,EAEA,IAAA9X,EAAA5I,EAAA0gB,EAcA,OAXA,OAAAmM,GAAA,mBAAAnxC,WAAAiC,SAAA,CAAAm9F,UAAA,CAEI,KAAAA,UAAA,CAAAD,EAAAn6D,EAAA1gB,GAEJtkB,WAAAiC,SAAA,CAAApJ,GAAA,CAAAsJ,IAAA,CACAgvC,EACA,KAAA2tB,QAAA,CAAA95B,EAAA1gB,GACA66E,GAIAjyE,CAAA,EAOAh5B,EAAA+N,SAAA,CAAA0mF,IAAA,UAAA9nD,CAAA,CAAAmE,CAAA,CAAA1gB,CAAA,CAAA3nB,CAAA,MA6CA7C,EA3CA,oBAAA+mC,EAAA,CASA,GARA,iBAAAmE,GACAroC,EAAAqoC,EACAA,EAAA,EACM1gB,EAAA,KAAA5vB,MAAA,EACN,iBAAA4vB,IACA3nB,EAAA2nB,EACAA,EAAA,KAAA5vB,MAAA,EAEAiI,KAAApF,IAAAoF,GAAA,iBAAAA,EACA,6CAEA,oBAAAA,GAAA,CAAAzI,EAAAikG,UAAA,CAAAx7F,GACA,qCAAAA,EAAA,CAEA,GAAAkkC,IAAAA,EAAAnsC,MAAA,EACA,IAAAqJ,EAAA8iC,EAAA1c,UAAA,IACA,UAAAxnB,GAAAoB,EAAA,KACApB,WAAAA,CAAA,GAEAkkC,CAAAA,EAAA9iC,CAAA,CAEI,MACJ,iBAAA8iC,EACIA,GAAA,IACJ,kBAAAA,GACAA,CAAAA,EAAAz0B,OAAAy0B,EAAA,EAIA,GAAAmE,EAAA,QAAAtwC,MAAA,CAAAswC,GAAA,KAAAtwC,MAAA,CAAA4vB,EACA,uCAGA,GAAAA,GAAA0gB,EACA,YASA,GANAA,KAAA,EAAA1gB,EAAAA,KAAA/sB,IAAA+sB,EAAA,KAAA5vB,MAAA,CAAA4vB,IAAA,EAEAuc,GAAAA,CAAAA,EAAA,GAIA,iBAAAA,EACA,IAAA/mC,EAAAkrC,EAAAlrC,EAAAwqB,EAAA,EAAAxqB,EACA,KAAAA,EAAA,CAAA+mC,MAEA,CACA,IAAAhpB,EAAA3jB,EAAAgd,QAAA,CAAA2vB,GACAA,EACA3sC,EAAA2d,IAAA,CAAAgvB,EAAAlkC,EAAA,CACAuwB,EAAArV,EAAAnjB,MAAA,CACA,GAAAw4B,IAAAA,EACA,8BAAA2T,EACA,qCAEA,IAAA/mC,EAAA,EAAAA,EAAAwqB,EAAA0gB,EAAA,EAAAlrC,EACA,KAAAA,EAAAkrC,EAAA,CAAAntB,CAAA,CAAA/d,EAAAozB,EAAA,CACA,OAGA,MAOA,IAAAm4B,EAAA,GACA,SAAAX,EAAA26C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACAl6C,CAAA,CAAAg6C,EAAA,eAAAE,EACA9pG,aAAA,SAGAc,OAAA8L,cAAA,iBACAnM,MAAAopG,EAAA/qG,KAAA,MAAAq4B,WACA2mB,SAAA,GACOC,aAAA,KAIP,KAAA/8C,IAAA,SAAAA,IAAA,KAAA4oG,EAAA,GAGA,KAAAvmF,KAAA,CAEA,YAAAriB,IAAA,CAGA,IAAAsH,MAAA,CACA,OAAAshG,CAAA,CAGA,IAAAthG,KAAA7H,CAAA,EACAK,OAAA8L,cAAA,cACAmxC,aAAA,GACAh0B,WAAA,GACAtpB,MAAAA,EACOq9C,SAAA,EACP,GAGA92C,UAAgB,CAChB,cAAAhG,IAAA,KAAA4oG,EAAA,UAAAxpG,OAAA,GAEA,EAgCA,SAAA2pG,EAAA3+D,CAAA,EACA,IAAA1jC,EAAA,GACArD,EAAA+mC,EAAAnsC,MAAA,CACAswC,EAASnE,MAAAA,CAAA,IAAgB,IACzB,KAAA/mC,GAAckrC,EAAA,EAAAlrC,GAAA,EACdqD,EAAA,IAAA0jC,EAAA/rC,KAAA,CAAAgF,EAAA,EAAAA,GAAA,EAAAqD,EAAA,EAEA,SAAA0jC,EAAA/rC,KAAA,GAAAgF,GAAA,EAAAqD,EAAA,EAMA,SAAAsiG,EAAAjqF,CAAA,CAAA/I,CAAA,CAAAmJ,CAAA,EACA8nF,EAAAjxF,EAAA,UACA+I,CAAAA,KAAAje,IAAAie,CAAA,CAAA/I,EAAA,EAAA+I,KAAAje,IAAAie,CAAA,CAAA/I,EAAAmJ,EAAA,GACAgoF,EAAAnxF,EAAA+I,EAAA9gB,MAAA,CAAAkhB,CAAAA,EAAA,GACA,CAGA,SAAA0mF,EAAApmG,CAAA,CAAA0pC,CAAA,CAAAC,CAAA,CAAArqB,CAAA,CAAA/I,CAAA,CAAAmJ,CAAA,EACA,GAAA1f,EAAA2pC,GAAA3pC,EAAA0pC,EAAA,KAEA8/D,EADA,IAAA5rG,EAAA,iBAAA8rC,EAAA,aAIQ8/D,EAFR9pF,EAAA,EACAgqB,IAAAA,GAAuBA,IAAGme,OAAY,GAC9B,OAAAjqD,EAAA,UAAAA,EAAA,OAAA8hB,EAAA,OAAA9hB,EAAA,EAER,OAAmB,EAAAA,EAAA,OAAA8hB,EAA2B,GAAE,MAAA9hB,EAChD,gBAAA8hB,EAAA,SAAA9hB,EAAA,CADgD,CAIhD,MAAA8rC,EAAA,EAAA9rC,EAAA,UAAA+rC,EAAA,EAAA/rC,EAAA,EAEA,IAAAuxD,EAAAs6C,gBAAA,SAAAD,EAAAxpG,EAAA,CACA,EACAsf,EAAA/I,EAAAmJ,EAAA,CAGA,SAAA8nF,EAAAxnG,CAAA,CAAAO,CAAA,EACA,oBAAAP,EACA,UAAAmvD,EAAAu6C,oBAAA,CAAAnpG,EAAA,SAAAP,EAAA,CAIA,SAAA0nG,EAAA1nG,CAAA,CAAAxB,CAAA,CAAA0B,CAAA,EACA,GAAA5B,KAAAwZ,KAAA,CAAA9X,KAAAA,EAEA,MADAwnG,EAAAxnG,EAAAE,GACA,IAAAivD,EAAAs6C,gBAAA,CAAAvpG,GAAA,sBAAAF,EAAA,CAGA,GAAAxB,EAAA,EACA,UAAA2wD,EAAAw6C,wBAAA,OAGA,IAAAx6C,EAAAs6C,gBAAA,CAAAvpG,GAA0C,SAC1C,MAAAA,EAAA,cAAA1B,EAAA,EACAwB,EAAA,CAtFAwuD,EAAA,2BACA,SAAAjuD,CAAA,SACA,EACA,GAAAA,EAAA,8BAGG,gDAHH,EAIAqpG,YACAp7C,EAAA,uBACA,SAAAjuD,CAAA,CAAA2hG,CAAwB,EACrB,cAAA3hG,EAAA,0DAAA2hG,EAAA,GACH5iG,WACAkvD,EAAA,mBACA,SAAApmC,CAAA,CAAAohF,CAAA,CAAAtoG,CAAA,CAA+B,CAC/B,IAAApB,EAAA,iBAAAsoB,EAAA,oBACAyhF,EAAA3oG,EAWG,OAVHgV,OAAAC,SAAA,CAAAjV,IAAA5C,KAAA+uB,GAAA,CAAAnsB,GAAA,WACM2oG,EAAAP,EAAA5rF,OAAAxc,IACN,iBAAAA,IACA2oG,EAAAnsF,OAAAxc,GACAA,CAAAA,EAAA2mD,OAAA,IAAAA,OAAA,KAAA3mD,EAAA,CAAA2mD,CAAAA,OAAA,IAAAA,OAAA,OACAgiD,CAAAA,EAAAP,EAAAO,EAAA,EAEAA,GAAA,KAEA/pG,GAAA,eAAA0pG,EAAA,aAAAK,EAAA,GACGD,YAiEH,IAAAE,EAAA,oBAGA,SAAAC,GAAA3hF,CAAA,EAMA,GAAAA,CAFAA,EAAAA,CAFAA,EAAAA,EAAAjQ,KAAA,UAEAuJ,IAAA,GAAAE,OAAA,CAAAkoF,EAAA,KAEAtrG,MAAA,YAEA,KAAA4pB,EAAA5pB,MAAA,OACA4pB,GAAA,IAEA,OAAAA,CAAA,CAGA,SAAAo6E,GAAAn+F,CAAA,CAAAumF,CAAA,MAEAyZ,EADAzZ,EAAAA,GAAA8V,IAEA,IAAAliG,EAAA6F,EAAA7F,MAAA,CACAwrG,EAAA,KAAAroF,EAAA,GAGA,QAAA/d,EAAA,EAAAA,EAAApF,EAAA,EAAAoF,EAAA,CAIA,GAAAygG,CAJAA,EAAAhgG,EAAA4pB,UAAA,CAAArqB,EAAA,EAIA,OAAAygG,EAAA,OAEA,IAAA2F,EAAA,CAEA,GAAA3F,EAAA,OAIAzgG,EAAA,IAAApF,EAJA,CAEAosF,CAAAA,GAAA,OAAAjpE,EAAA7kB,IAAA,cACU,SAIV,EAGAunG,EAGA,YAIAA,EAAA,OACAzZ,CAAAA,GAAA,OAAAjpE,EAAA7kB,IAAA,cACAktG,EAAA3F,EACA,WAIM,CAAA2F,EAAA,UAAA3F,EAAA,YACN,MAAA2F,GAEA,CAAApf,GAAA,OAAAjpE,EAAA7kB,IAAA,cAMA,GAJAktG,EAAA,KAIA3F,EAAA,KACA,IAAAzZ,GAAA,WACMjpE,EAAA7kB,IAAA,CAAAunG,EACN,SAAAA,EAAA,MACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,MACAA,GAAAA,EAAA,IAEA,SAAAA,EAAA,OACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,OACAA,GAAA,SACAA,GAAAA,EAAA,IAEA,SAAAA,EAAA,SACA,IAAAzZ,GAAA,WACAjpE,EAAA7kB,IAAA,CACAunG,GAAA,OACAA,GAAA,UACAA,GAAA,SACAA,GAAAA,EAAA,IAEA,MACA,kCAIA,OAAA1iF,CAAA,CAGA,SAAAqiF,GAAA57E,CAAA,EACA,IAAA6hF,EAAkB,GAClB,QAAArmG,EAAA,EAAAA,EAAAwkB,EAAA5pB,MAAA,GAAAoF,EAEAqmG,EAAAntG,IAAA,CAAAsrB,IAAAA,EAAA6F,UAAA,CAAArqB,IAEA,OAAAqmG,CAAA,CAGA,SAAA9F,GAAA/7E,CAAA,CAAAwiE,CAAA,MACAvlC,EAAAghD,EACA,IAAA4D,EAAkB,GAClB,QAAArmG,EAAA,IAAAwkB,EAAA5pB,MAAA,KAAAosF,GAAA,QAAAhnF,EAIAyiG,EAAAhhD,CADAA,EAAAj9B,EAAA6F,UAAA,CAAArqB,EAAA,GACA,EAEAqmG,EAAAntG,IAAA,CADAuoD,EAAA,KAEA4kD,EAAAntG,IAAA,CAAAupG,GAGA,OAAA4D,CAAA,CAGA,SAAAxH,GAAAr6E,CAAA,EACA,OAAA6mC,EAAAR,WAAA,CAAAs7C,GAAA3hF,GAAA,CAGA,SAAA07E,GAAAttF,CAAA,CAAA0zF,CAAA,CAAA3zF,CAAA,CAAA/X,CAAA,EACA,IAAAoF,EACA,IAAAA,EAAA,EACA,EADApF,IACAoF,CAAAA,EAAA2S,GAAA2zF,EAAA1rG,MAAA,IAAAoF,CAAAA,GAAA4S,EAAAhY,MAAA,EADA,EAAAoF,EAEAsmG,CAAA,CAAAtmG,EAAA2S,EAAA,CAAAC,CAAA,CAAA5S,EAAA,CAEA,OAAAA,CAAA,CAMA,SAAA89F,GAAAzkF,CAAA,CAAA/c,CAAA,EACA,OAAA+c,aAAA/c,GACA+c,IAAA,EAAAA,GAAAA,IAAA,EAAAA,EAAA1d,WAAA,EAAA0d,IAAA,EAAAA,EAAA1d,WAAA,CAAAgB,IAAA,EACA0c,EAAA1d,WAAA,CAAAgB,IAAA,GAAAL,EAAAK,IAAA,CAEA,SAAA8hG,GAAAplF,CAAA,EAEA,OAAAA,GAAAA,CAAA,CAKA,IAAA8oF,GAAA,WACA,IAAAoE,EAAA,mBACAlT,EAAA,MAA0B,KAC1B,QAAArzF,EAAA,EAAAA,EAAA,KAAAA,EAAA,CACA,IAAAolB,EAAAplB,GAAAA,EACA,QAAAkuB,EAAA,EAAAA,EAAA,KAAAA,EACAmlE,CAAA,CAAAjuE,EAAA8I,EAAA,CAAAq4E,CAAA,CAAAvmG,EAAA,CAAAumG,CAAA,CAAAr4E,EAAA,CAGC,OAAAmlE,CAAA,IAID,SAAAsQ,GAAApzE,CAAA,EACA,0BAAA0zB,OAAAuiD,GAAAj2E,CAAA,CAGA,SAAAi2E,IAAA,CACA,oDAAA/sG,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECzjEa,aAE6B,IAAA+xL,EAAA/xL,EAAA,KAEfgyL,EAAAhyL,EAAA,MAE3BiyL,EAAAD,EAAAD,EAAA,4BAGA3xL,CAAAA,EAAAC,OAAA,UAAAiD,CAAA,CAAA4uL,CAAA,EACA,IAAAC,EAAAJ,EAAAzuL,EAAA,EAAA4uL,SACA,mBAAAC,GAAAF,EAAA3uL,EAAA,kBACA0uL,EAAAG,GAEAA,CADA,CACA,gBAAA/xL,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECda,aAGb,IAAAid,EAAAjd,EAAmB,MACnB+xL,EAAA/xL,EAAwB,KAA6BoyL,EAAApyL,EAAA,MAGrDqyL,EAAAryL,EAAA,MACAsyL,EAAAP,EAAA,8BACAQ,EAAAR,EAAA,6BAAAS,EAAAT,EAAA,uBAAA90K,EAAAjO,IAAA,CAAAujL,EAAAD,GAGAG,EAAAzyL,EAAA,MAAA0yL,EAAAX,EAAA,aAGA3xL,CAAAA,EAAAC,OAAA,UAAAsyL,CAAA,EACA,sBAAAA,EACA,UAAAN,EAAA,0BAEA,IAAAx6J,EAAA26J,EAAAv1K,EAAAs1K,EAAA94J,WACA,OAAA24J,EACAv6J,EACA,EAAA66J,EAAA,EAAAC,EAAApxL,MAAA,CAAAk4B,CAAAA,UAAAl4B,MAAA,KACA,GACA,EAGA,IAAAqxL,EAAA,WACA,OAAAJ,EAAAv1K,EAAAq1K,EAAA74J,UAAA,EAGAg5J,EACAA,EAAEryL,EAAAC,OAAA,UAAA0C,MAAA6vL,CAAA,GAEFxyL,EAAAC,OAAA,CAAAe,KAAA,CAAAwxL,CAAA,gBAAAxyL,CAAA,EClCa,aAGb,IAAA0pB,EAAA1iB,GAAA,CACA,IAAA2iB,EAAA,GACAC,EAAA,GAAAC,EAAA,GAGA,QAAAtjB,EAAA,EAAAA,EAAAS,EAAA7F,MAAA,CAAAoF,IAAA,KAAAujB,EAAA9iB,CAAA,CAAAT,EAAA,CAGAojB,GAAA,WAAArJ,IAAA,CAAAwJ,IAAAA,EAAAhG,WAAA,KAAAgG,GACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,GAAA,IAAAS,EAAAzF,KAAA,CAAAgF,GACAojB,EAAA,GACAE,EAAAD,EACAA,EAAA,GACArjB,KACAqjB,GAAAC,GAAA,WAAAvJ,IAAA,CAAAwJ,IAAAA,EAAAvJ,WAAA,KAAAuJ,GACA9iB,EAAAA,EAAAzF,KAAA,GAAAgF,EAAA,OAAAS,EAAAzF,KAAA,CAAAgF,EAAA,GACAsjB,EAAAD,EACAA,EAAA,GACAD,EAAI,KAEJA,EAAAG,EAAAvJ,WAAA,KAAAuJ,GAAAA,EAAAhG,WAAA,KAAAgG,EACAD,EAAAD,EACAA,EAAAE,EAAAhG,WAAA,KAAAgG,GAAAA,EAAAvJ,WAAA,KAAAuJ,EACA,CAGA,OAAA9iB,CAAA,EAGAqjB,EAAA,CAAAxmB,EAAAU,IAAA,CACA,sBAAAV,GAAA9C,MAAA6D,OAAA,CAAAf,EAAA,EACA,gEAGAU,EAAAvB,OAAAC,MAAA,EACEqnB,WAAA,IAAA/lB,GAEF,IAAA2lB,EAAA7mB,GAAAkB,EAAA+lB,UAAA,CAAAjnB,EAAAunB,MAAA,IAAA9G,WAAA,GAAAzgB,EAAA9B,KAAA,IAAA8B,CAAA,CAWA,GAAAQ,IAAAA,CAPAA,EADA9C,MAAA6D,OAAA,CAAAf,GACAA,EAAAzC,GAAA,CAAAiC,GAAAA,EAAAghB,IAAA,IACAkG,MAAA,CAAAlnB,GAAAA,EAAAlC,MAAA,EACGuB,IAAA,MAEHmB,EAAAwgB,IAAA,IAGAljB,MAAA,CACA,SAGA,GAAA0C,IAAAA,EAAA1C,MAAA,CACA,OAAAoD,EAAA+lB,UAAA,CAAAzmB,EAAAigB,WAAA,GAAAjgB,EAAA0c,WAAA,GAEA,IAAAoK,EAAA9mB,IAAAA,EAAA0c,WAAA,GAaA,OAVAoK,GACA9mB,CAAAA,EAAA6lB,EAAA7lB,EAAA,EASAqmB,EANArmB,EAAAA,EACA0gB,OAAA,iBACAhE,WAAA,GACAgE,OAAA,oBAAAljB,EAAAi8B,IAAAA,EAAAxZ,WAAA,IAAAS,OAAA,cAAA6F,GAAAA,EAAAtG,WAAA,IAGA,CAGA9jB,CAAAA,EAAAC,OAAA,CAAAoqB,EACsBrqB,EAAAC,OAAA,SAAAoqB,CAAA,gBAAArqB,CAAA,CAAAC,CAAA,CAAAL,CAAA,EC1EtB,IAACsyK,GAAA,oFACD,SAAAugB,CAAA,EACA,aAiBA,IA2DArxI,EA3DAsxI,EAAA,IAIAC,EAAA,CAOA7zB,UAAA,GAkBAhC,SAAA,EAIA81B,SAAA,GAIAC,SAAA,GAIKC,KAAA,sHACL,EAMAC,EAAA,GAEAC,EAAA,kBACAC,EAAAD,EAAA,qBACAE,EAAAF,EAAA,0BAEA3d,EAAAp0K,KAAAwZ,KAAA,CACA04K,EAAAlyL,KAAAs/C,GAAA,CAEA6yI,EAAA,qCAGA/qE,EAAA,IACAmtD,EAAA,EACAj4H,EAAA,iBACA81I,EAAAhe,EAAA93H,oBAGA4G,EAAA,GAg0BA,SAAA3+C,EAAAnC,CAAA,CAAAqxB,CAAA,EACA,IAAA+8I,EAAA5xK,EAAAyH,EAAAf,EAAAxB,EAAA40B,EAAA25J,EAAAC,EACAC,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CAGA,IAAAz7J,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,CAKA,OADAyvB,EAAAzvB,CAAA,EAAAyvB,CAAAA,EAAA,IAAA8+J,EAAAnwL,EAAA,EACA0vL,EAAAntJ,EAAAlR,EAAAwjB,GAAAxjB,CAAA,CAcA,GAXA4+J,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CAIAkF,EAAA1B,EAAAiE,CAAA,CACAA,EAAAotB,EAAAptB,CAAA,CACAgsL,EAAAA,EAAA/xL,KAAA,GACAgF,EAAAxB,EAAAuC,EAGA,CAsBA,IArBAf,EAAA,GACA1G,EAAAyzL,EACA/sL,EAAA,CAAAA,EACQozB,EAAA45J,EAAApyL,MAAA,GAERtB,EAAA0zL,EACAjsL,EAAAvC,EACA40B,EAAA25J,EAAAnyL,MAAA,EAOAoF,EAFAozB,CAAAA,EAAA50B,CADAA,EAAA9D,KAAAC,IAAA,CAAAg3C,EAAAs9H,EAAA,EACA77I,EAAA50B,EAAA,EAAA40B,EAAA,KAGApzB,EAAAozB,EACA95B,EAAAsB,MAAA,IAIAtB,EAAA8nB,OAAa,GACbphB,KAAA1G,EAAAJ,IAAA,IACAI,EAAA8nB,OAAA,EACA,KAEAgS,CAAAA,EAAA25J,EAAAnyL,MAAA,EACAoF,CAAAA,EAAAgtL,EAAApyL,MAAA,EAGA,IACAoF,EAAAozB,EACA95B,EAAA0zL,EACAA,EAAAD,EACAA,EAAAzzL,GAIA4xK,EAAA,EAAAlrK,GACAkrK,EAAA,CAAA6hB,CAAA,GAAA/sL,EAAA,CAAA+sL,CAAA,CAAA/sL,EAAA,CAAAgtL,CAAA,CAAAhtL,EAAA,CAAAkrK,CAAA,EAAAppD,EAAA,EACAirE,CAAA,CAAA/sL,EAAA,EAAA8hH,EAUA,IAPAopD,IACA6hB,EAAAvnI,OAAA,CAAA0lH,GACA,EAAAnqK,GAKAqyB,EAAA25J,EAAAnyL,MAAA,CAAAmyL,GAAAA,CAAA,GAAA35J,EAAA,EAAA25J,EAAAv/H,GAAA,GAKA,OAHAr/B,EAAA70B,CAAA,CAAAyzL,EACA5+J,EAAAptB,CAAA,CAAAA,EAEAyrL,EAAAntJ,EAAAlR,EAAAwjB,GAAAxjB,CAAA,CAIA,SAAA++J,EAAAltL,CAAA,CAAA8lC,CAAA,CAAAC,CAAA,EACA,GAAA/lC,IAAA,EAAAA,GAAAA,EAAA8lC,GAAA9lC,EAAA+lC,EACA,MAAA3+B,MAAAslL,EAAA1sL,EAAA,CAKA,SAAAmtL,EAAA7zL,CAAA,EACA,IAAA0G,EAAAxB,EAAAuiL,EACAqM,EAAA9zL,EAAAsB,MAAA,GACA4pB,EAAA,GACAqN,EAAAv4B,CAAA,IAEA,GAAA8zL,EAAA,GAEA,IADA5oK,GAAAqN,EACA7xB,EAAA,EAAAA,EAAAotL,EAAAptL,IAEAxB,CAAAA,EAAAywK,EAAA8R,CADAA,EAAAznL,CAAA,CAAA0G,EAAA,KACApF,MAAA,GACA4pB,CAAAA,GAAA6oK,EAAA7uL,EAAA,EACAgmB,GAAAu8J,EAKAviL,CAAAA,EAAAywK,EAAA8R,CADAA,EAAAlvJ,CADAA,EAAAv4B,CAAA,CAAA0G,EAAA,EACA,IACApF,MAAA,GACM4pB,CAAAA,GAAA6oK,EAAA7uL,EAAA,CACN,SAAAqzB,IAAAA,EACA,SACA,CAGA,KAAAA,EAAA,OAAAA,GAAA,GAEA,OAAArN,EAAAqN,CACA,CAr4BA+rB,EAAAq2H,aAAA,CAAAr2H,EAAAn0B,GAAA,YACA,IAAA3sB,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,EAAA5B,CAAAA,EAAA4B,CAAA,IACA5B,CACA,EAUA8gD,EAAAs2H,UAAA,CAAAt2H,EAAAuvH,GAAA,UAAAh/I,CAAA,EACA,IAAAnuB,EAAAkuB,EAAAo/J,EAAAC,EACAzwL,EAAA,KAKA,GAHAqxB,EAAA,IAAArxB,EAAAnB,WAAA,CAAAwyB,GAGArxB,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,QAAA5B,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,CAGA,GAAA5B,EAAAiE,CAAA,GAAAotB,EAAAptB,CAAA,QAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,CAAAjE,EAAA4B,CAAA,QAMA,IAAAsB,EAAA,EAAAkuB,EAAAo/J,CAJAA,EAAAxwL,EAAAxD,CAAA,CAAAsB,MAAA,EACA2yL,CAAAA,EAAAp/J,EAAA70B,CAAA,CAAAsB,MAAA,EAGA0yL,EAAAC,CAAA,CAAAvtL,EAAAkuB,EAAA,EAAAluB,EACA,GAAAlD,EAAAxD,CAAA,CAAA0G,EAAA,GAAAmuB,EAAA70B,CAAA,CAAA0G,EAAA,QAAAlD,EAAAxD,CAAA,CAAA0G,EAAA,CAAAmuB,EAAA70B,CAAA,CAAA0G,EAAA,CAAAlD,EAAA4B,CAAA,QAIA,OAAA4uL,IAAAC,EAAA,EAAAD,EAAAC,EAAAzwL,EAAA4B,CAAA,SAQAk/C,EAAA+4G,aAAA,CAAA/4G,EAAA0vH,EAAA,YACA,IAAAxwK,EAAA,KACA+0B,EAAA/0B,EAAAxD,CAAA,CAAAsB,MAAA,GACA0yK,EAAA,CAAAz7I,EAAA/0B,EAAAiE,CAAA,EAAAkuK,EAIA,GADAp9I,EAAA/0B,EAAAxD,CAAA,CAAAu4B,EAAA,CACA,KAAAA,EAAA,MAAAA,GAAA,GAAAy7I,GAAA,CAEA,OAAAA,EAAA,IAAAA,CAAA,EASA1vH,EAAAu2H,SAAA,CAAAv2H,EAAA7D,GAAA,UAAA5rB,CAAA,EACA,OAAA8pI,EAAA,cAAAt8J,WAAA,CAAAwyB,GACA,EAQAyvB,EAAAw2H,kBAAA,CAAAx2H,EAAAy2H,IAAA,UAAAlmJ,CAAA,EACA,IAAArxB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA,OAAA0jC,EAAA44H,EAAAn7J,EAAA,IAAAmwL,EAAA9+J,GAAA,KAAA8+J,EAAA10B,SAAA,CACA,EAOA36G,EAAAiB,MAAA,CAAAjB,EAAAh3B,EAAA,UAAAuH,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,EACA,EAOAyvB,EAAA4vI,QAAA,YACA,OAAAC,EAAA,KACA,EAQA7vI,EAAAk6G,WAAA,CAAAl6G,EAAAlC,EAAA,UAAAvtB,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,GAAA,CACA,EAQAyvB,EAAA8vI,oBAAA,CAAA9vI,EAAAgwH,GAAA,UAAAz/I,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,IAAA,CACA,EAOAyvB,EAAArrC,SAAA,CAAAqrC,EAAA+vI,KAAA,YACA,YAAA5sL,CAAA,MAAAzH,CAAA,CAAAsB,MAAA,EACA,EAOAgjD,EAAA64G,UAAA,CAAA74G,EAAAwvH,KAAA,YACA,YAAA1uK,CAAA,EACA,EAOAk/C,EAAAq3H,UAAA,CAAAr3H,EAAAgwI,KAAA,YACA,YAAAlvL,CAAA,EACA,EAOAk/C,EAAAi7G,MAAA,YACA,gBAAAn6J,CAAA,EAQAk/C,EAAAw6G,QAAA,CAAAx6G,EAAA2L,EAAA,UAAAp7B,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAOAyvB,EAAAiwI,iBAAA,CAAAjwI,EAAAiwH,GAAA,UAAA1/I,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAgBAyvB,EAAAkwI,SAAA,CAAAlwI,EAAAyQ,GAAA,UAAArkB,CAAA,EACA,IAAAlsC,EACAhB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CACAw1B,EAAAp8I,EAAA,EAGA,GAAA3H,KAAA,IAAAA,EACMA,EAAA,IAAAijJ,EAAA,SAON,GAAAjjJ,CALAA,EAAA,IAAAijJ,EAAAjjJ,EAAA,EAKAtrC,CAAA,IAAAsrC,EAAApjB,EAAA,CAAAi0B,GAAA,MAAAzzC,MAAAqlL,EAAA,OAKA,GAAA3vL,EAAA4B,CAAA,SAAA0I,MAAAqlL,EAAA3vL,CAAAA,EAAA4B,CAAA,4BAGA,EAAAkoB,EAAA,CAAAi0B,GAAA,IAAAoyI,EAAA,IAEAT,EAAA,GACA1uL,EAAAm6J,EAAA5/F,EAAAv7D,EAAAixL,GAAA11H,EAAAruB,EAAA+jJ,GAAAA,GACAvB,EAAA,GAEAntJ,EAAAvhC,EAAA6zC,GANA,EAeAiM,EAAAkwH,KAAA,CAAAlwH,EAAA3C,GAAA,UAAA9sB,CAAA,EACA,IAAArxB,EAAA,KAEA,OADAqxB,EAAA,IAAArxB,EAAAnB,WAAA,CAAAwyB,GACArxB,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,CAAA8nH,EAAA1pH,EAAAqxB,GAAAlvB,EAAAnC,EAAAqxB,CAAAA,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CAAAyvB,CAAA,IASAyvB,EAAA+/D,MAAA,CAAA//D,EAAAr5B,GAAA,UAAA4J,CAAA,EACA,IAAA89B,EACAnvD,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CAKA,IAAApqI,CAHAA,EAAA,IAAA8+J,EAAA9+J,EAAA,EAGAzvB,CAAA,OAAA0I,MAAAqlL,EAAA,cAGA,EAAA/tL,CAAA,EAGA8tL,EAAA,GACAvgI,EAAAgsG,EAAAn7J,EAAAqxB,EAAA,KAAA+/I,KAAA,CAAA//I,GACAq+J,EAAA,GAEA1vL,EAAAgxK,KAAA,CAAA7hH,IAPA5sB,EAAA,IAAA4tJ,EAAAnwL,GAAA60C,EAAA,EAiBAiM,EAAAowI,kBAAA,CAAApwI,EAAA24H,GAAA,YACA,OAAAA,EAAA,KACA,EAQA34H,EAAAqwI,gBAAA,CAAArwI,EAAAya,EAAA,YACA,OAAAA,EAAA,KACA,EAQAza,EAAA83H,OAAA,CAAA93H,EAAAwgE,GAAA,YACA,IAAAthH,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,EAAA5B,EAAA4B,CAAA,IACA5B,CACA,EAQA8gD,EAAAowH,IAAA,CAAApwH,EAAA3+C,GAAA,UAAAkvB,CAAA,EACA,IAAArxB,EAAA,KAEA,OADAqxB,EAAA,IAAArxB,EAAAnB,WAAA,CAAAwyB,GACArxB,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,CAAAO,EAAAnC,EAAAqxB,GAAAq4F,EAAA1pH,EAAAqxB,CAAAA,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CAAAyvB,CAAA,IAUAyvB,EAAA26G,SAAA,CAAA36G,EAAAkvH,EAAA,UAAA1+I,CAAA,EACA,IAAArtB,EAAA+rK,EAAAj7I,EACA/0B,EAAA,KAEA,GAAAsxB,KAAA,IAAAA,GAAAA,CAAA,CAAAA,IAAAA,GAAAA,IAAAA,GAAAA,IAAAA,EAAA,MAAAhnB,MAAAslL,EAAAt+J,EAAA,CAQA,GANArtB,EAAA0sL,EAAA3wL,GAAA,EAEAgwK,EAAAj7I,CADAA,EAAA/0B,EAAAxD,CAAA,CAAAsB,MAAA,IACAq0K,EAAA,EACAp9I,EAAA/0B,EAAAxD,CAAA,CAAAu4B,EAAA,CAGA,CAGA,KAAAA,EAAA,MAAAA,GAAA,GAAAi7I,IAGA,IAAAj7I,EAAA/0B,EAAAxD,CAAA,IAAAu4B,GAAA,GAAAA,GAAA,GAAAi7I,GACA,QAEA1+I,GAAArtB,EAAA+rK,EAAA/rK,EAAA+rK,CAAA,EASAlvH,EAAAg4H,UAAA,CAAAh4H,EAAA2iE,IAAA,YACA,IAAAx/G,EAAA/G,EAAA23C,EAAA7zC,EAAAY,EAAAG,EAAAkvL,EACAjxL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAGA,GAAAmB,EAAA4B,CAAA,IACA,IAAA5B,EAAA4B,CAAA,YAAAuuL,EAAA,SAGA7lL,MAAAqlL,EAAA,OACA,IAEA1rL,EAAA0sL,EAAA3wL,GACA0vL,EAAA,GAOA9tL,GAJAA,CAAAA,EAAAhE,KAAA6lH,IAAA,EAAAzjH,EAAA,GAIA4B,GAAA,KAEA1E,CAAAA,CADAA,EAAAmzL,EAAArwL,EAAAxD,CAAA,GACAsB,MAAA,CAAAmG,CAAAA,EAAA,MAAA/G,CAAAA,GAAA,KACA0E,EAAAhE,KAAA6lH,IAAA,CAAAvmH,GACA+G,EAAA+tK,EAAA,CAAA/tK,EAAA,MAAAA,CAAAA,EAAA,GAAAA,EAAA,GAGQ/G,EADR0E,GAAA,IACQ,KAAAqC,EAGR/G,CADAA,EAAA0E,EAAA2vK,aAAA,IACArzK,KAAA,GAAAhB,EAAA4f,OAAA,SAAA7Y,EAGMjD,EAAA,IAAAmvL,EAAAjzL,IAEN8D,EAAA,IAAAmvL,EAAAvuL,EAAAiE,QAAA,IAIAjE,EAAAqvL,EAAAp8I,CADAA,EAAAs7I,EAAA10B,SAAA,EACA,IAOA,GAFAz6J,EAAAe,CADAA,EAAAf,CAAAA,EACAkwK,IAAA,CAAA/V,EAAAn7J,EAAA+B,EAAAkvL,EAAA,IAAA7f,KAAA,KAEAif,EAAAtuL,EAAAvF,CAAA,EAAA0B,KAAA,GAAA+yL,KAAA,CAAA/zL,EAAAmzL,EAAArvL,EAAAxE,CAAA,GAAA0B,KAAA,GAAA+yL,GAAA,CAKA,GAJA/zL,EAAAA,EAAAgB,KAAA,CAAA+yL,EAAA,EAAAA,EAAA,GAIArvL,GAAAqvL,GAAA/zL,QAAAA,EAMA,IAFAqlC,EAAAxgC,EAAA8yC,EAAA,KAEA9yC,EAAAqvK,KAAA,CAAArvK,GAAA+nB,EAAA,CAAA9pB,GAAA,CACAgB,EAAAe,EACA,MACU,MACV,GAAA7E,QAAAA,EACA,MAGA+zL,GAAA,CACA,QAGAvB,EAAA,GAEAntJ,EAAAvhC,EAAA6zC,EACA,EAQAiM,EAAAswH,KAAA,CAAAtwH,EAAAtD,GAAA,UAAAnsB,CAAA,EACA,IAAA+8I,EAAAnqK,EAAAf,EAAAxB,EAAAV,EAAAowL,EAAArvL,EAAAyuL,EAAAC,EACAzwL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAoxL,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA,CAAA7+J,EAAA,IAAA8+J,EAAA9+J,EAAA,EAAA70B,CAAA,CAGA,IAAAwD,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,YAAAuuL,EAAA,GAoBA,IAlBA9+J,EAAAzvB,CAAA,EAAA5B,EAAA4B,CAAA,CACAqC,EAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,CACAusL,CAAAA,EAAAP,EAAAnyL,MAAA,EACA2yL,CAAAA,EAAAP,EAAApyL,MAAA,IAIAkD,EAAAivL,EACAA,EAAAC,EACAA,EAAAlvL,EACAowL,EAAAZ,EACAA,EAAAC,EACAA,EAAAW,GAIApwL,EAAA,GAEAkC,EADAkuL,EAAAZ,EAAAC,EACAvtL,KAAAlC,EAAA5E,IAAA,IAGA,IAAA8G,EAAAutL,EAAA,EAAAvtL,GAAA,IAEA,IADAkrK,EAAA,EACA1sK,EAAA8uL,EAAAttL,EAAAxB,EAAAwB,GACAnB,EAAAf,CAAA,CAAAU,EAAA,CAAAwuL,CAAA,CAAAhtL,EAAA,CAAA+sL,CAAA,CAAAvuL,EAAAwB,EAAA,GAAAkrK,EACAptK,CAAA,CAAAU,IAAA,CAAAK,EAAAijH,EAAA,EACAopD,EAAArsK,EAAAijH,EAAA,CAGAhkH,CAAAA,CAAA,CAAAU,EAAA,EAAAV,CAAA,CAAAU,EAAA,CAAA0sK,CAAA,EAAAppD,EAAA,CACA,CAGA,MAAAhkH,CAAA,GAAAowL,EAAA,EAAApwL,EAAA0vD,GAAA,GAQA,OANA09G,EAAA,EAAAnqK,EACAjD,EAAA0X,KAAA,GAEA2Y,EAAA70B,CAAA,CAAAwE,EACAqwB,EAAAptB,CAAA,CAAAA,EAEAyrL,EAAAntJ,EAAAlR,EAAA8+J,EAAA10B,SAAA,EAAApqI,CAAA,EAcAyvB,EAAAvB,eAAA,CAAAuB,EAAAuwI,IAAA,UAAA7gB,CAAA,CAAAP,CAAA,EACA,IAAAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,OAGA,CADAmB,EAAA,IAAAmwL,EAAAnwL,GACAwwK,KAAA,IAAAA,GAAAxwK,GAEAowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAEA1tI,EAAAviC,EAAAwwK,EAAAmgB,EAAA3wL,GAAA,EAAAiwK,GAPA,EAmBAnvH,EAAAywH,aAAA,UAAAf,CAAA,CAAAP,CAAA,EACA,IAAAvoJ,EACA1nB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAcA,OAZA2xK,KAAA,IAAAA,EACM9oJ,EAAA7hB,EAAA7F,EAAA,KAENowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAvoJ,EAAA7hB,EADA7F,EAAAuiC,EAAA,IAAA4tJ,EAAAnwL,GAAAwwK,EAAA,EAAAP,GACA,GAAAO,EAAA,IAGA9oJ,CACA,EAmBAo5B,EAAA5W,OAAA,UAAAsmI,CAAA,CAAAP,CAAA,EACA,IAAAvoJ,EAAA2J,EACArxB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,SAAA2xK,EAAA3qK,EAAA7F,IAEAowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAvoJ,EAAA7hB,EAAAwrB,CADAA,EAAAkR,EAAA,IAAA4tJ,EAAAnwL,GAAAwwK,EAAAmgB,EAAA3wL,GAAA,EAAAiwK,EAAA,EACAtjJ,GAAA,MAAA6jJ,EAAAmgB,EAAAt/J,GAAA,GAIArxB,EAAAswK,KAAA,KAAAtwK,EAAA+7J,MAAA,OAAAr0I,EAAAA,CAAA,CAZA,EAqBAo5B,EAAAwwI,SAAA,CAAAxwI,EAAAywI,KAAA,YACA,IAAAvxL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA,OAAA0jC,EAAA,IAAA4tJ,EAAAnwL,GAAA2wL,EAAA3wL,GAAA,EAAAmwL,EAAA12B,QAAA,CACA,EAOA34G,EAAA5lC,QAAA,YACA,aAiBA4lC,EAAA0wI,OAAA,CAAA1wI,EAAA5D,GAAA,UAAA7rB,CAAA,EACA,IAAAptB,EAAAvC,EAAAmzC,EAAA7zC,EAAAsE,EAAAmsL,EACAzxL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA6yL,EAAA,GACA1kI,EAAA,CAAA37B,CAAAA,EAAA,IAAA8+J,EAAA9+J,EAAA,EAGA,IAAAA,EAAAzvB,CAAA,YAAAuuL,EAAApyI,EAAA,CAMA,IAAA/9C,CAJAA,EAAA,IAAAmwL,EAAAnwL,EAAA,EAIA4B,CAAA,EACA,GAAAyvB,EAAAzvB,CAAA,SAAA0I,MAAAqlL,EAAA,YACA,OAAA3vL,CACA,IAGAA,EAAA8pB,EAAA,CAAAi0B,GAAA,OAAA/9C,CAAA,CAKA,GAHA60C,EAAAs7I,EAAA10B,SAAA,CAGApqI,EAAAvH,EAAA,CAAAi0B,GAAA,OAAAxb,EAAAviC,EAAA60C,EAAA,CAOA,GAHA48I,EAAAxtL,CAFAA,EAAAotB,EAAAptB,CAAA,GACAvC,CAAAA,EAAA2vB,EAAA70B,CAAA,CAAAsB,MAAA,IAEAwH,EAAAtF,EAAA4B,CAAA,CAEA6vL,EAMA,KAAA/vL,EAAAsrD,EAAA,GAAAA,EAAAA,CAAA,GAAA9S,EAAA,CASA,IARAl5C,EAAA,IAAAmvL,EAAApyI,GAIA95C,EAAArG,KAAAC,IAAA,CAAAg3C,EAAAs9H,EAAA,GAEAud,EAAA,GAGAhuL,EAAA,GAEAyrG,EAAAnsG,CADAA,EAAAA,EAAAowK,KAAA,CAAApxK,EAAA,EACAxD,CAAA,CAAAyH,GAIAvC,IADAA,CAAAA,EAAAswK,EAAAtwK,EAAA,KAIAyrG,EAAAntG,CADAA,EAAAA,EAAAoxK,KAAA,CAAApxK,EAAA,EACAxD,CAAA,CAAAyH,GAKA,OAFAyrL,EAAA,GAEAr+J,EAAAzvB,CAAA,OAAAuuL,EAAApyI,GAAAd,GAAA,CAAAj8C,GAAAuhC,EAAAvhC,EAAA6zC,EAAA,CACA,MA5BA,GAAAvvC,EAAA,QAAAgF,MAAAqlL,EAAA,OAwCA,OATArqL,EAAAA,EAAA,GAAA+rB,EAAAA,EAAA70B,CAAA,CAAAoB,KAAAqrC,GAAA,CAAAhlC,EAAAvC,GAAA,MAEA1B,EAAA4B,CAAA,GACA8tL,EAAA,GACA1uL,EAAAqwB,EAAA+/I,KAAA,CAAA71G,EAAAv7D,EAAA60C,EAAA68I,IACAhC,EAAA,GAEA1uL,CADAA,EAAAy4K,EAAAz4K,EAAA,EACAY,CAAA,CAAA0D,EAEAtE,CACA,EAcA8/C,EAAA0wH,WAAA,UAAAxB,CAAA,CAAAC,CAAA,EACA,IAAAhsK,EAAAyjB,EACA1nB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAgBA,OAdAmxK,KAAA,IAAAA,GACA/rK,EAAA0sL,EAAA3wL,GACM0nB,EAAA7hB,EAAA7F,EAAAiE,GAAAksL,EAAAZ,QAAA,EAAAtrL,GAAAksL,EAAAX,QAAA,IAENY,EAAApgB,EAAA,EAAAqf,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAhsK,EAAA0sL,EADA3wL,EAAAuiC,EAAA,IAAA4tJ,EAAAnwL,GAAAgwK,EAAAC,IAEAvoJ,EAAA7hB,EAAA7F,EAAAgwK,GAAA/rK,GAAAA,GAAAksL,EAAAZ,QAAA,CAAAvf,IAGAtoJ,CACA,EAYAo5B,EAAA46G,mBAAA,CAAA56G,EAAA6wI,IAAA,UAAA3hB,CAAA,CAAAC,CAAA,EACA,IAAAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAYA,OAVAmxK,KAAA,IAAAA,GACAA,EAAAmgB,EAAA10B,SAAA,CACMwU,EAAAkgB,EAAA12B,QAAA,GAEN22B,EAAApgB,EAAA,EAAAqf,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,MAGA1tI,EAAA,IAAA4tJ,EAAAnwL,GAAAgwK,EAAAC,EACA,EAUAnvH,EAAAj7C,QAAA,CAAAi7C,EAAAqgD,OAAA,CAAArgD,EAAA7W,GAAA,CAAA6W,EAAAsjC,MAAA,YACA,IAAApkF,EAAA,KACAiE,EAAA0sL,EAAA3wL,GACAmwL,EAAAnwL,EAAAnB,WAAA,CAEA,OAAAgH,EAAA7F,EAAAiE,GAAAksL,EAAAZ,QAAA,EAAAtrL,GAAAksL,EAAAX,QAAA,CACA,EAuJA,IAAAr0B,EAAA,WAGA,SAAAy2B,EAAA5xL,CAAA,CAAA0B,CAAA,EACA,IAAAw0K,EACA9H,EAAA,EACAlrK,EAAAlD,EAAAlC,MAAA,CAEA,IAAAkC,EAAAA,EAAA9B,KAAA,GAAAgF,KACAgzK,EAAAl2K,CAAA,CAAAkD,EAAA,CAAAxB,EAAA0sK,EACApuK,CAAA,CAAAkD,EAAA,CAAAgzK,EAAAlxD,EAAA,EACAopD,EAAA8H,EAAAlxD,EAAA,EAKA,OAFAopD,GAAApuK,EAAA0oD,OAAA,CAAA0lH,GAEApuK,CACA,CAEA,SAAA4zD,EAAAl3D,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,CAAAC,CAAA,EACA,IAAAtzK,EAAAlC,EAEA,GAAAu1K,GAAAC,EACQx1K,EAAAu1K,EAAAC,EAAA,UAER,IAAAtzK,EAAAlC,EAAA,EAAAkC,EAAAqzK,EAAArzK,IACA,GAAAxG,CAAA,CAAAwG,EAAA,EAAA0S,CAAA,CAAA1S,EAAA,EACAlC,EAAAtE,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,CAAA1S,EAAA,MACA,MACA,OAIAlC,CACA,CAEA,SAAA0oH,EAAAhtH,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,EAIA,IAHA,IAAArzK,EAAA,EAGAqzK,KACA75K,CAAA,CAAA65K,EAAA,EAAArzK,EACAA,EAAAxG,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,KACA75K,CAAA,CAAA65K,EAAA,CAAArzK,EAAA8hH,EAAAtoH,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,CAIA,MAAA75K,CAAA,KAAAA,EAAAoB,MAAA,IAAApB,EAAAgc,KAAA,EACA,CAEA,gBAAA1Y,CAAA,CAAAqxB,CAAA,CAAAwjB,CAAA,CAAA27H,CAAA,EACA,IAAAH,EAAApsK,EAAAf,EAAAxB,EAAA+0K,EAAAC,EAAAvnH,EAAA0iI,EAAAp2F,EAAAk7E,EAAAC,EAAA5G,EAAAjuK,EAAA80K,EAAAC,EAAAgb,EAAA9a,EAAAC,EACAkZ,EAAAnwL,EAAAnB,WAAA,CACAyG,EAAAtF,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,MACAquL,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CAGA,IAAAwD,EAAA4B,CAAA,YAAAuuL,EAAAnwL,EAAA,CACA,IAAAqxB,EAAAzvB,CAAA,OAAA0I,MAAAqlL,EAAA,oBASA,IAAAzsL,EAAA,EAPAe,EAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,CACA+yK,EAAAkZ,EAAApyL,MAAA,CACAg5K,EAAAmZ,EAAAnyL,MAAA,CAEA+zL,EAAA1iI,CADAA,EAAA,IAAAghI,EAAA7qL,EAAA,EACA9I,CAAA,IAGA0zL,CAAA,CAAAhtL,EAAA,EAAA+sL,CAAAA,CAAA,CAAA/sL,EAAA,QAAAA,EAWA,GAVAgtL,CAAA,CAAAhtL,EAAA,CAAA+sL,CAAAA,CAAA,CAAA/sL,EAAA,QAAAe,EAUA+rK,CAPQA,EADRn7H,IAAA,EAAAA,EACQA,EAAAs7I,EAAA10B,SAAA,CACR+U,EACQ37H,EAAA87I,CAAAA,EAAA3wL,GAAA2wL,EAAAt/J,EAAA,IAERwjB,GAGA,aAAAs7I,EAAA,GAOA,GAJAngB,EAAAA,EAAAmC,EAAA,IACAjvK,EAAA,EAGA8zK,GAAAA,EAMA,IALAt1K,EAAA,EACAwuL,EAAAA,CAAA,IACAlgB,IAGA,CAAA9sK,EAAA4zK,GAAAp1K,CAAAA,GAAAsuK,IAAA9sK,IACAnB,EAAAL,EAAAsjH,EAAAirE,CAAAA,CAAA,CAAA/sL,EAAA,KACA2uL,CAAA,CAAA3uL,EAAA,CAAAnB,EAAAmuL,EAAA,EACAxuL,EAAAK,EAAAmuL,EAAA,MAIA,CAiBA,IAdAxuL,CAAAA,EAAAsjH,EAAAkrE,CAAAA,CAAA,UAEA,IACAA,EAAA0B,EAAA1B,EAAAxuL,GACAuuL,EAAA2B,EAAA3B,EAAAvuL,GACAs1K,EAAAkZ,EAAApyL,MAAA,CACAg5K,EAAAmZ,EAAAnyL,MAAA,EAGA+4K,EAAAG,EAEAL,EAAAl7E,CADAA,EAAAw0F,EAAA/xL,KAAA,GAAA84K,EAAA,EACAl5K,MAAA,CAGA64K,EAAAK,GAAAv7E,CAAA,CAAAk7E,IAAA,GAGAM,CADAA,EAAAiZ,EAAAhyL,KAAA,IACAwqD,OAAA,IACAopI,EAAA5B,CAAA,IAEAA,CAAA,KAAAlrE,EAAA,KAAA8sE,EAEA,GACApwL,EAAA,EAMA2uK,CAHAA,EAAAz8G,EAAAs8H,EAAAz0F,EAAAu7E,EAAAL,EAAA,EAGA,GAGAC,EAAAn7E,CAAA,IACAu7E,GAAAL,GAAAC,CAAAA,EAAAA,EAAA5xD,EAAAvpB,CAAAA,CAAA,SAaA/5F,CAVAA,EAAAk1K,EAAAkb,EAAA,GAUA,GACApwL,GAAAsjH,GAAAtjH,CAAAA,EAAAsjH,EAAA,GAIA0xD,EAAAD,CADAA,EAAAmb,EAAA1B,EAAAxuL,EAAA,EACA5D,MAAA,CACA64K,EAAAl7E,EAAA39F,MAAA,CAMA,GAHAuyK,CAAAA,EAAAz8G,EAAA6iH,EAAAh7E,EAAAi7E,EAAAC,EAAA,IAIAj1K,IAGAgoH,EAAA+sD,EAAAO,EAAAN,EAAAO,EAAAiZ,CAAA,CAAAxZ,MAOA,GAAAh1K,GAAA2uK,CAAAA,EAAA3uK,EAAA,GACA+0K,EAAAyZ,EAAAhyL,KAAA,IAGAw4K,CAAAA,EAAAD,EAAA34K,MAAA,EACA64K,GAAAF,EAAA/tH,OAAA,IAGAghE,EAAAjuB,EAAAg7E,EAAAE,GAGA,IAAAtG,IACAsG,EAAAl7E,EAAA39F,MAAA,CAGAuyK,CAAAA,EAAAz8G,EAAAs8H,EAAAz0F,EAAAu7E,EAAAL,EAAA,EAGA,IACAj1K,IAGAgoH,EAAAjuB,EAAAu7E,EAAAL,EAAAM,EAAAiZ,CAAA,CAAAvZ,KAIYA,EAAAl7E,EAAA39F,MAAA,EACZ,IAAAuyK,IACA3uK,IACA+5F,EAAe,KAIfo2F,CAAA,CAAA3uL,IAAA,CAAAxB,EAGA2uK,GAAA50E,CAAA,IACYA,CAAA,CAAAk7E,IAAA,CAAAsZ,CAAA,CAAApZ,EAAA,KAEZp7E,EAAA,CAAAw0F,CAAA,CAAApZ,EAAA,EACAF,EAAA,SAGA,CAAAE,IAAAC,GAAAr7E,KAAA,IAAAA,CAAA,MAAAu0E,IAAA,CACA,OAGA6hB,CAAA,KAAAA,EAAAn5K,KAAA,GAEAy2C,EAAAlrD,CAAA,CAAAA,EAEAs+B,EAAA4sB,EAAAqhH,EAAA37H,EAAA87I,EAAAxhI,GAAA,EAAAta,CAAA,CACG,CACH,IAyBA,SAAA4kI,EAAAz5K,CAAA,CAAAgwK,CAAA,EACA,IAAA5wH,EAAAlC,EAAAogD,EAAAv7F,EAAAkvL,EACA/tL,EAAA,EACAxB,EAAA,EACAyuL,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CAEA,GAAAk1B,EAAA3wL,GAAA,SAAAsK,MAAAulL,EAAAc,EAAA3wL,GAAA,CAGA,IAAAA,EAAA4B,CAAA,YAAAuuL,EAAApyI,EAAA,CAWA,IATAiyH,IAAA,EAAAA,GACA0f,EAAA,GACMuB,EAAAp8I,GAENo8I,EAAAjhB,EAGAjuK,EAAA,IAAAouL,EAAA,QAEAnwL,EAAA2sB,GAAA,GAAAmkJ,GAAA,MACA9wK,EAAAA,EAAAoxK,KAAA,CAAArvK,GACAL,GAAA,EASA,IAJAuvL,GADArzL,KAAA2zD,GAAA,CAAAu+H,EAAA,EAAApuL,IAAA9D,KAAA6xL,IAAA,OAEArwI,EAAAlC,EAAAogD,EAAA,IAAA6yF,EAAApyI,GACAoyI,EAAA10B,SAAA,CAAAw1B,IAEA,CAKA,GAJA/zI,EAAA3a,EAAA2a,EAAAk0H,KAAA,CAAApxK,GAAAixL,GACA7xI,EAAAA,EAAAgyH,KAAA,GAAAluK,GAGAmtL,EAAAtuL,CAFAA,EAAAu7F,EAAA4zE,IAAA,CAAA/V,EAAAj+G,EAAAkC,EAAA6xI,GAAA,EAEAz0L,CAAA,EAAA0B,KAAA,GAAA+yL,KAAAZ,EAAA/yF,EAAA9gG,CAAA,EAAA0B,KAAA,GAAA+yL,GAAA,CACA,KAAAvvL,KAAA47F,EAAA/6D,EAAA+6D,EAAA8zE,KAAA,CAAA9zE,GAAA2zF,GAEA,OADAd,EAAA10B,SAAA,CAAA5mH,EACAm7H,IAAA,EAAAA,EAAA0f,CAAAA,EAAA,GAAAntJ,EAAA+6D,EAAAzoD,EAAA,EAAAyoD,CAAA,CACA,EAEAv7F,CACA,CACA,CAIA,SAAA4uL,EAAA3wL,CAAA,EAKA,IAJA,IAAAiE,EAAAjE,EAAAiE,CAAA,CAAAkuK,EACAp9I,EAAA/0B,EAAAxD,CAAA,IAGAu4B,GAAA,GAAAA,GAAA,GAAA9wB,IACA,OAAAA,CACA,CAGA,SAAA8tL,EAAA5B,CAAA,CAAAngB,CAAA,CAAAn7H,CAAA,EAEA,GAAAm7H,EAAAmgB,EAAAV,IAAA,CAAAzf,EAAA,GAMA,MAFA0f,EAAA,GACA76I,GAAAs7I,CAAAA,EAAA10B,SAAA,CAAA5mH,CAAA,EACAvqC,MAAAqlL,EAAA,iCAGA,OAAAptJ,EAAA,IAAA4tJ,EAAAA,EAAAV,IAAA,EAAAzf,EACA,CAGA,SAAAugB,EAAA7uL,CAAA,EAEA,IADA,IAAAg4K,EAAW,GACXh4K,KAAAg4K,GAAA,IACA,OAAAA,CACA,CAUA,SAAAn+G,EAAAlqC,CAAA,CAAA2+I,CAAA,EACA,IAAArrH,EAAAyvH,EAAAh1H,EAAAn7C,EAAAk7C,EAAAm+C,EAAAv7F,EAAAkvL,EAAApkE,EACA3vH,EAAA,EACAw0L,EAAA,GACA1xL,EAAAqxB,EACA4+J,EAAAjwL,EAAAxD,CAAA,CACA2zL,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CAIA,GAAAz7J,EAAA4B,CAAA,SAAA0I,MAAAqlL,EAAA3vL,CAAAA,EAAA4B,CAAA,qBAGA,GAAA5B,EAAA8pB,EAAA,CAAAi0B,GAAA,WAAAoyI,EAAA,GASA,GAPAngB,IAAA,EAAAA,GACA0f,EAAA,GACMuB,EAAAp8I,GAENo8I,EAAAjhB,EAGAhwK,EAAA8pB,EAAA,KAEA,OADA,MAAAkmJ,GAAA0f,CAAAA,EAAA,IACAqC,EAAA5B,EAAAc,EACA,CAQA,GANAA,GAAAS,EACAvB,EAAA10B,SAAA,CAAAw1B,EAEA7c,EAAAzvH,CADAA,EAAA0rI,EAAAJ,EAAA,EACA1oK,MAAA,KAGA3pB,CAAAA,MAAAA,KAAA+uB,GAAA,CAFA1oB,EAAA0sL,EAAA3wL,GAEA,EAqCA,OAJA+B,EAAAgwL,EAAA5B,EAAAc,EAAA,EAAAp8I,GAAAu8H,KAAA,CAAAntK,EAAA,IACAjE,EAAAu7D,EAAA,IAAA40H,EAAA/b,EAAA,IAAAzvH,EAAAzmD,KAAA,KAAA+yL,EAAAS,GAAAxgB,IAAA,CAAAnvK,GAEAouL,EAAA10B,SAAA,CAAA5mH,EACAm7H,IAAA,EAAAA,EAAA0f,CAAAA,EAAA,GAAAntJ,EAAAviC,EAAA60C,EAAA,EAAA70C,CAAA,CAxBA,KAAAo0K,EAAA,GAAAA,GAAAA,GAAAA,GAAAA,GAAAzvH,EAAAp9B,MAAA,OAGA6sJ,EAAAzvH,CADAA,EAAA0rI,EAAArwL,CADAA,EAAAA,EAAAoxK,KAAA,CAAA//I,EAAA,EACA70B,CAAA,GACA+qB,MAAA,IACArqB,IAgCA,IA7BA+G,EAAA0sL,EAAA3wL,GAEAo0K,EAAA,GACAp0K,EAAA,IAAAmwL,EAAA,KAAAxrI,GACQ1gD,KAERjE,EAAA,IAAAmwL,EAAA/b,EAAA,IAAAzvH,EAAAzmD,KAAA,KAmBAo/F,EAAAn+C,EAAAn/C,EAAAm7J,EAAAn7J,EAAAgxK,KAAA,CAAAjzH,GAAA/9C,EAAAkxK,IAAA,CAAAnzH,GAAAkzI,GACApkE,EAAAtqF,EAAAviC,EAAAoxK,KAAA,CAAApxK,GAAAixL,GACA7xI,EAAA,IAEA,CAIA,GAHAD,EAAA5c,EAAA4c,EAAAiyH,KAAA,CAAAvkD,GAAAokE,GAGAZ,EAAAtuL,CAFAA,EAAAu7F,EAAA4zE,IAAA,CAAA/V,EAAAh8G,EAAA,IAAAgxI,EAAA/wI,GAAA6xI,GAAA,EAEAz0L,CAAA,EAAA0B,KAAA,GAAA+yL,KAAAZ,EAAA/yF,EAAA9gG,CAAA,EAAA0B,KAAA,GAAA+yL,GAQA,OAPA3zF,EAAAA,EAAA8zE,KAAA,IAGA,IAAAntK,GAAAq5F,CAAAA,EAAAA,EAAA4zE,IAAA,CAAA6gB,EAAA5B,EAAAc,EAAA,EAAAp8I,GAAAu8H,KAAA,CAAAntK,EAAA,MACAq5F,EAAA69D,EAAA79D,EAAA,IAAA6yF,EAAAjzL,GAAA+zL,GAEAd,EAAA10B,SAAA,CAAA5mH,EACAm7H,IAAA,EAAAA,EAAA0f,CAAAA,EAAA,GAAAntJ,EAAA+6D,EAAAzoD,EAAA,EAAAyoD,CAAA,CAGAA,EAAAv7F,EACAq9C,GAAA,CACA,CACA,CAMA,SAAA4yI,EAAAhyL,CAAA,CAAA0nB,CAAA,EACA,IAAAzjB,EAAAf,EAAAozB,EAmBA,IAhBAryB,CAAAA,EAAAyjB,EAAA5K,OAAA,WAAA4K,CAAAA,EAAAA,EAAAxG,OAAA,UAGA,CAAAhe,EAAAwkB,EAAA4F,MAAA,WAGArpB,EAAA,GAAAA,CAAAA,EAAAf,CAAAA,EACAe,GAAA,CAAAyjB,EAAAxpB,KAAA,CAAAgF,EAAA,GACMwkB,EAAAA,EAAA+hB,SAAA,GAAAvmC,IACNe,EAAA,GAGAA,CAAAA,EAAAyjB,EAAA5pB,MAAA,EAIAoF,EAAA,EAAAwkB,KAAAA,EAAA6F,UAAA,CAAArqB,IAAA,EAAAA,EAGA,IAAAozB,EAAA5O,EAAA5pB,MAAA,CAAA4pB,KAAAA,EAAA6F,UAAA,CAAA+I,EAAA,MAAAA,EAGA,GAFA5O,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAAozB,GAEA,CAaA,GAZAA,GAAApzB,EACAe,EAAAA,EAAAf,EAAA,EACAlD,EAAAiE,CAAA,CAAA+tK,EAAA/tK,EAAAkuK,GACAnyK,EAAAxD,CAAA,IAMA0G,EAAA,CAAAe,EAAA,GAAAkuK,EACAluK,EAAA,GAAAf,CAAAA,GAAAivK,CAAA,EAEAjvK,EAAAozB,EAAA,CAEA,IADApzB,GAAAlD,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,EAAAxpB,KAA8B,GAAQgF,IACtCozB,GAAA67I,EAAAjvK,EAAAozB,GAAAt2B,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,EAAAxpB,KAAA,CAAAgF,EAAAA,GAAAivK,IAEQjvK,EAAAivK,EAAAzqJ,CADRA,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAA,EACQpF,MAAA,MAERoF,GAAAozB,CACA,CAEA,KAAApzB,KAAAwkB,GAAA,IAGM,GAFN1nB,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,GAEMgoK,GAAA1vL,CAAAA,EAAAiE,CAAA,CAAA+rL,GAAAhwL,EAAAiE,CAAA,EAAA+rL,CAAA,QAAA1lL,MAAAulL,EAAA5rL,EAAA,MAINjE,EAAA4B,CAAA,GACA5B,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,KAGA,OAAAwD,CACA,CAMA,SAAAuiC,EAAAviC,CAAA,CAAAgwK,CAAA,CAAAC,CAAA,EACA,IAAA/sK,EAAAkuB,EAAA1vB,EAAAxE,EAAAw3K,EAAAud,EAAAl9J,EAAAm9J,EACAjC,EAAAjwL,EAAAxD,CAAA,CAWA,IAAAU,EAAA,EAAAwE,EAAAuuL,CAAA,IAAAvuL,GAAA,GAAAA,GAAA,GAAAxE,IAIA,GAAAgG,CAHAA,EAAA8sK,EAAA9yK,CAAAA,EAGA,EACAgG,GAAAivK,EACA/gJ,EAAA4+I,EACMj7I,EAAAk7J,CAAA,CAAAiC,EAAA,OACN,CAGA,GAFAA,EAAAt0L,KAAAC,IAAA,EAAAqF,EAAA,GAAAivK,GACAzwK,EAAAuuL,EAAAnyL,MAAA,CACAo0L,GAAAxwL,EAAA,OAAA1B,CAAA,CAIA,IAAA9C,EAAA,EAHA63B,EAAArzB,EAAAuuL,CAAA,CAAAiC,EAAA,CAGAxwL,GAAA,GAAAA,GAAA,GAAAxE,IAGAgG,GAAAivK,EAIA/gJ,EAAAluB,EAAAivK,EAAAj1K,CACA,IAEA,SAAA+yK,IAIAyE,EAAA3/I,EAHArzB,CAAAA,EAAAouL,EAAA,GAAA5yL,EAAAk0B,EAAA,IAGA,KAGA6gK,EAAAjiB,EAAA,GAAAigB,KAAA,IAAAA,CAAA,CAAAiC,EAAA,IAAAn9J,EAAArzB,EAMAuwL,EAAAhiB,EAAA,EACA,CAAAyE,GAAAud,CAAA,GAAAhiB,CAAAA,GAAAA,GAAAA,GAAAjwK,CAAAA,EAAA4B,CAAA,SACA8yK,EAAA,GAAAA,GAAAA,GAAAzE,CAAAA,GAAAA,GAAAgiB,GAAAhiB,GAAAA,GAGA,CAAA/sK,EAAA,EAAAkuB,EAAA,EAAA2D,EAAA+6J,EAAA,GAAA5yL,EAAAk0B,GAAA,EAAA6+J,CAAA,CAAAiC,EAAA,UACAjiB,GAAAjwK,CAAAA,EAAA4B,CAAA,UAGAouK,EAAA,IAAAigB,CAAA,IAkBA,OAjBAgC,GACAvwL,EAAAivL,EAAA3wL,GACAiwL,EAAAnyL,MAAA,GAGAkyK,EAAAA,EAAAtuK,EAAA,EAGAuuL,CAAA,IAAAH,EAAA,IAAA3d,EAAAnC,EAAAmC,CAAA,EAAAA,GACQnyK,EAAAiE,CAAA,CAAA+tK,EAAA,CAAAhC,EAAAmC,IAAA,IAER8d,EAAAnyL,MAAA,GAGAmyL,CAAA,IAAAjwL,EAAAiE,CAAA,CAAAjE,EAAA4B,CAAA,IAGA5B,CACA,CAgBA,GAbAkD,GAAAA,GACA+sL,EAAAnyL,MAAA,CAAAo0L,EACAxwL,EAAA,EACMwwL,MAENjC,EAAAnyL,MAAA,CAAAo0L,EAAA,EACAxwL,EAAAouL,EAAA,GAAA3d,EAAAjvK,GAIA+sL,CAAA,CAAAiC,EAAA,CAAA9gK,EAAA,GAAA2D,EAAA+6J,EAAA,GAAA5yL,EAAAk0B,GAAA0+J,EAAA,GAAA1+J,GAAA,GAAA1vB,EAAA,GAGAuwL,EACA,QAGA,GAAAC,GAAAA,EAAA,CACAjC,CAAAA,CAAA,KAAAvuL,CAAAA,GAAAsjH,IACAirE,CAAA,MACA,EAAAjwL,EAAAiE,CAAA,EAGU,MAMV,GAJAgsL,CAAA,CAAAiC,EAAA,EAAAxwL,EACAuuL,CAAA,CAAAiC,EAAA,EAAAltE,EAAA,MACAirE,CAAA,CAAAiC,IAAA,GACAxwL,EAAA,CAEA,CACA,IAGAwB,EAAA+sL,EAAAnyL,MAAA,CAAAmyL,IAAAA,CAAA,GAAA/sL,EAAA,EAAA+sL,EAAAv/H,GAAA,GAEA,GAAAg/H,GAAA1vL,CAAAA,EAAAiE,CAAA,CAAA+rL,GAAAhwL,EAAAiE,CAAA,EAAA+rL,CAAA,EACA,MAAA1lL,MAAAulL,EAAAc,EAAA3wL,GAAA,CAGA,OAAAA,CACA,CAGA,SAAA0pH,EAAA1pH,CAAA,CAAAqxB,CAAA,EACA,IAAA70B,EAAAyH,EAAAf,EAAAkuB,EAAA1vB,EAAA40B,EAAA25J,EAAAh4H,EAAAmgH,EAAA8X,EACAC,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CAIA,IAAAz7J,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,CAGA,OAFAyvB,EAAAzvB,CAAA,CAAAyvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CACAyvB,EAAA,IAAA8+J,EAAAnwL,GACA0vL,EAAAntJ,EAAAlR,EAAAwjB,GAAAxjB,CAAA,CAcA,GAXA4+J,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CAIAyH,EAAAotB,EAAAptB,CAAA,CACAg0D,EAAAj4D,EAAAiE,CAAA,CACAgsL,EAAAA,EAAA/xL,KAAA,GACAwD,EAAAu2D,EAAAh0D,EAGA,CAyBA,IAxBAm0K,CAAAA,EAAA12K,EAAA,IAGAlF,EAAAyzL,EACAvuL,EAAA,CAAAA,EACQ40B,EAAA45J,EAAApyL,MAAA,GAERtB,EAAA0zL,EACAjsL,EAAAg0D,EACA3hC,EAAA25J,EAAAnyL,MAAA,EAMAoF,EAAAtF,KAAAqrC,GAAA,CAAArrC,KAAAC,IAAA,CAAAg3C,EAAAs9H,GAAA77I,GAAA,EAEA50B,EAAAwB,IACAxB,EAAAwB,EACA1G,EAAAsB,MAAA,IAIAtB,EAAA8nB,OAAA,GACAphB,EAAAxB,EAAAwB,KAAA1G,EAAAJ,IAAA,IACAI,EAAA8nB,OAAA,EAGA,MASA,IAHA8zJ,CAAAA,EAAAl1K,CAFAA,EAAA+sL,EAAAnyL,MAAA,EACAw4B,CAAAA,EAAA45J,EAAApyL,MAAA,CACA,GACAw4B,CAAAA,EAAApzB,CAAAA,EAEAA,EAAA,EAAAA,EAAAozB,EAAApzB,IACA,GAAA+sL,CAAA,CAAA/sL,EAAA,EAAAgtL,CAAA,CAAAhtL,EAAA,EACAk1K,EAAA6X,CAAA,CAAA/sL,EAAA,CAAAgtL,CAAA,CAAAhtL,EAAA,CACA,MACA,EAGA,CACA,KAEAk1K,IACA57K,EAAAyzL,EACAA,EAAAC,EACAA,EAAA1zL,EACA60B,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,EAGA00B,EAAA25J,EAAAnyL,MAAA,CAIAoF,EAAAgtL,EAAApyL,MAAA,CAAAw4B,EAAApzB,EAAA,IAAAA,EAAA+sL,CAAA,CAAA35J,IAAA,GAGA,IAAApzB,EAAAgtL,EAAApyL,MAAA,CAAAoF,EAAAxB,GAAA,CACA,GAAAuuL,CAAA,GAAA/sL,EAAA,CAAoBgtL,CAAA,CAAAhtL,EAAA,EACpB,IAAAkuB,EAAAluB,EAAAkuB,GAAA6+J,IAAAA,CAAA,GAAA7+J,EAAA,EAAA6+J,CAAA,CAAA7+J,EAAA,CAAA4zF,EAAA,CACA,GAAAirE,CAAA,CAAA7+J,EAAA,CACA6+J,CAAA,CAAA/sL,EAAA,EAAA8hH,CACA,EAEA,CAAA9hH,EAAA,EAAAgtL,CAAA,CAAAhtL,EAAA,CAIA,KAAA+sL,IAAAA,CAAA,GAAA35J,EAAA,EAAA25J,EAAAv/H,GAAA,GAGA,KAAAu/H,IAAAA,CAAA,IAAAA,EAAAv3K,KAAA,KAAAzU,SAGA,MAEAotB,EAAA70B,CAAA,CAAAyzL,EACA5+J,EAAAptB,CAAA,CAAAA,EAGAyrL,EAAAntJ,EAAAlR,EAAAwjB,GAAAxjB,CAAA,EANA,IAAA8+J,EAAA,GAUA,SAAAtqL,EAAA7F,CAAA,CAAAmyL,CAAA,CAAAniB,CAAA,EACA,IAAAtuK,EACAuC,EAAA0sL,EAAA3wL,GACA0nB,EAAA2oK,EAAArwL,EAAAxD,CAAA,EACA85B,EAAA5O,EAAA5pB,MAAA,CAwBA,OAtBAq0L,GACAniB,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,IACQ5O,EAAAA,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,IAAAqyL,EAAA7uL,GACR40B,EAAA,GACA5O,CAAAA,EAAAA,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,KAGMwpB,EAAAA,EAAAzjB,CAAAA,EAAA,YAAAA,GACNA,EAAA,GACAyjB,EAAA,KAAA6oK,EAAA,CAAAtsL,EAAA,GAAAyjB,EACMsoJ,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,KAAA5O,CAAAA,GAAA6oK,EAAA7uL,EAAA,GACNuC,GAAAqyB,GACA5O,GAAA6oK,EAAAtsL,EAAA,EAAAqyB,GACM05I,GAAA,CAAAtuK,EAAAsuK,EAAA/rK,EAAA,MAAAyjB,CAAAA,EAAAA,EAAA,IAAA6oK,EAAA7uL,EAAA,IAENA,CAAAA,EAAAuC,EAAA,GAAAqyB,GAAA5O,CAAAA,EAAAA,EAAAxpB,KAAA,GAAAwD,GAAA,IAAAgmB,EAAAxpB,KAAA,CAAAwD,EAAA,EACAsuK,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,MACAryB,EAAA,IAAAqyB,GAAA5O,CAAAA,GAAA,KACAA,GAAA6oK,EAAA7uL,KAIA1B,EAAA4B,CAAA,OAAA8lB,EAAAA,CAAA,CAKA,SAAAylF,EAAAziC,CAAA,CAAAp0C,CAAA,EACA,GAAAo0C,EAAA5sE,MAAA,CAAAw4B,EAEA,OADAo0C,EAAA5sE,MAAA,CAAAw4B,EACA,EACA,CAkBA,SAAAzU,EAAAtF,CAAA,EACA,IAAArZ,EAAAyhB,EAAAytK,EASA,SAAA9C,EAAAhwL,CAAA,EACA,IAAAU,EAAA,KAGA,IAAAA,CAAAA,aAAAsvL,CAAA,aAAAA,EAAAhwL,EAAA,CAOA,GAHAU,EAAAnB,WAAA,CAAAywL,EAGAhwL,aAAAgwL,EAAA,CACAtvL,EAAA4B,CAAA,CAAAtC,EAAAsC,CAAA,CACA5B,EAAAiE,CAAA,CAAA3E,EAAA2E,CAAA,CACAjE,EAAAxD,CAAA,EAAA8C,EAAAA,EAAA9C,CAAA,EAAA8C,EAAApB,KAAA,GAAAoB,CAAA,CACA,MACA,IAEA,iBAAAA,EAAA,CAGA,GAAAA,EAAAA,GAAA,EACA,MAAAgL,MAAAslL,EAAAtwL,EAAA,CAGA,GAAAA,EAAA,EACUU,EAAA4B,CAAA,QACV,GAAAtC,EAAA,EACAA,EAAA,CAAAA,EACUU,EAAA4B,CAAA,QACV,CACA5B,EAAA4B,CAAA,GACA5B,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,KACA,MACA,IAGA8C,IAAA,EAAAA,GAAAA,EAAA,KACAU,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,EAAA8C,EAAA,CACA,MACA,QAEQ0yL,EAAAhyL,EAAAV,EAAAuG,QAAA,GACR,CAEA,GAFA,iBAAAvG,EACA,MAAAgL,MAAAslL,EAAAtwL,EAAA,CAWA,GAPAA,KAAAA,EAAAiuB,UAAA,KACAjuB,EAAAA,EAAApB,KAAA,IACQ8B,EAAA4B,CAAA,KAER5B,EAAA4B,CAAA,GAGAmuL,EAAA9yK,IAAA,CAAA3d,GAAA0yL,EAAAhyL,EAAAV,QACA,MAAAgL,MAAAslL,EAAAtwL,EAAA,CAmBA,GAhBAgwL,EAAAjkL,SAAA,CAAAy1C,EAEAwuI,EAAAr2B,QAAA,GACAq2B,EAAAv2B,UAAA,GACAu2B,EAAA1a,UAAA,GACA0a,EAAAza,WAAA,GACAya,EAAAt2B,aAAA,GACAs2B,EAAAxa,eAAA,GACAwa,EAAAva,eAAA,GACAua,EAAAta,eAAA,GACAsa,EAAAra,gBAAA,GAEAqa,EAAAztK,KAAA,CAAAA,EACAytK,EAAAxpL,MAAA,CAAAwpL,EAAArtL,GAAA,CAAA6D,EAEA,SAAAyW,GAAAA,CAAAA,EAAA,IACAA,EAEA,IAAArZ,EAAA,EADAkvL,EAAA,aAAkB,WAAc,8BAChClvL,EAAAkvL,EAAAt0L,MAAA,EAAAye,EAAAjR,cAAA,CAAAqZ,EAAAytK,CAAA,CAAAlvL,IAAA,GAAAqZ,CAAAA,CAAA,CAAAoI,EAAA,MAAAA,EAAA,CACA,CAIA,OAFA2qK,EAAAxpL,MAAA,CAAAyW,GAEA+yK,CACA,CAgBA,SAAAxpL,EAAAyW,CAAA,EACA,IAAAA,GAAA,iBAAAA,EACA,MAAAjS,MAAAqlL,EAAA,mBAEA,IAAAzsL,EAAAyhB,EAAAhjB,EACAywL,EAAA,CACA,cAAA/C,EACA,eACA,kBACA,iBACA,CAEA,IAAAnsL,EAAA,EAAAA,EAAAkvL,EAAAt0L,MAAA,CAAAoF,GAAA,EACA,YAAAvB,CAAAA,EAAA4a,CAAA,CAAAoI,EAAAytK,CAAA,CAAAlvL,EAAA,IACA,GAAA8uK,EAAArwK,KAAAA,GAAAA,GAAAywL,CAAA,CAAAlvL,EAAA,IAAAvB,GAAAywL,CAAA,CAAAlvL,EAAA,QAAAyhB,EAAA,CAAAhjB,OACA,MAAA2I,MAAAslL,EAAAjrK,EAAA,KAAAhjB,EAAA,CACA,GAGA,SAAAA,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,UACA,GAAAhjB,GAAA/D,KAAA6xL,IAAA,MAAA9qK,EAAA,UAAAhjB,QACA,MAAA2I,MAAAslL,EAAAjrK,EAAA,KAAAhjB,EAAA,CACA,OAEA,KAOA2tL,CAFAA,EAAAztK,EAAAytK,EAAA,EAEA,QAAAA,EAAAA,OAAA,CAAAA,EAGAvxI,EAAA,IAAAuxI,EAAA,GAUAzgB,KAAAluK,IAFAkuK,CAAAA,EAAA,YACK,OAAAygB,CAAA,GAAA/jL,IAAA,CAAA3O,EAAAL,EAAAK,EAAAD,EAAA,GACLA,CAAAA,EAAAC,OAAA,CAAAiyK,CAAA,CAcC,oBAAAlyK,CAAA,CAAAC,CAAA,CAAAL,CAAA,EC59DD,IAAAsyK,GAAA,SAAAugB,CAAA,EACA,YAGA,+NAMA,GAQA,IAkFAE,EAAA+C,EAAAC,EAlFAC,EAAA,KAIAlD,EAAA,IAGAmD,EAAA,mBAGA/C,EAAA,qgCAGAn5D,EAAA,qgCAIAm8D,EAAA,CAOAh3B,UAAA,GAiBAhC,SAAA,EAeA54C,OAAA,EAIA0uE,SAAA,GAIAC,SAAA,GAIAkD,KAAA,MAIAC,KAxEA,KA2EKxd,OAAA,EACL,EAOAua,EAAA,GAEAC,EAAA,kBACAC,EAAAD,EAAA,qBACAiD,EAAAjD,EAAA,2BACAkD,EAAAlD,EAAA,qBACA71K,EAAA,mBAEAk4J,EAAAp0K,KAAAwZ,KAAA,CACA04K,EAAAlyL,KAAAs/C,GAAA,CAEA41I,EAAA,6CACAC,EAAA,yDACAC,EAAA,gDACAjD,EAAA,qCAEA/qE,EAAA,IACAmtD,EAAA,EACAj4H,EAAA,iBAEA+4I,EAAAxD,EAAA3xL,MAAA,GACAo1L,EAAA58D,EAAAx4H,MAAA,GAGAgjD,EAAA,CAAAzG,YAAAvgC,CAAA,EA01EA,SAAAu2K,EAAA7zL,CAAA,EACA,IAAA0G,EAAAxB,EAAAuiL,EACAqM,EAAA9zL,EAAAsB,MAAA,GACA4pB,EAAA,GACAqN,EAAAv4B,CAAA,IAEA,GAAA8zL,EAAA,GAEA,IADA5oK,GAAAqN,EACA7xB,EAAA,EAAAA,EAAAotL,EAAAptL,IAEAxB,CAAAA,EAAAywK,EAAA8R,CADAA,EAAAznL,CAAA,CAAA0G,EAAA,KACApF,MAAA,GACA4pB,CAAAA,GAAA6oK,EAAA7uL,EAAA,EACAgmB,GAAAu8J,EAKAviL,CAAAA,EAAAywK,EAAA8R,CADAA,EAAAlvJ,CADAA,EAAAv4B,CAAA,CAAA0G,EAAA,EACA,IACApF,MAAA,GACM4pB,CAAAA,GAAA6oK,EAAA7uL,EAAA,CACN,SAAAqzB,IAAAA,EACA,SACA,CAGA,KAAAA,EAAA,OAAAA,GAAA,GAEA,OAAArN,EAAAqN,CACA,CAGA,SAAAq7J,EAAAltL,CAAA,CAAA8lC,CAAA,CAAAC,CAAA,EACA,GAAA/lC,IAAA,EAAAA,GAAAA,EAAA8lC,GAAA9lC,EAAA+lC,EACA,MAAA3+B,MAAAslL,EAAA1sL,EAAA,CAUA,SAAAiwL,EAAA32L,CAAA,CAAA0G,CAAA,CAAA+sK,CAAA,CAAAmjB,CAAA,EACA,IAAAC,EAAA3xL,EAAAV,EAAA0zK,EAGA,IAAAhzK,EAAAlF,CAAA,IAAAkF,GAAA,GAAAA,GAAA,KAAAwB,EAwCA,MArCA,EAAAA,EAAA,GACAA,GAAAivK,EACMkhB,EAAA,IAENA,EAAAz1L,KAAAC,IAAA,EAAAqF,EAAA,GAAAivK,GACAjvK,GAAAivK,GAMAzwK,EAAAouL,EAAA,GAAA3d,EAAAjvK,GACAwxK,EAAAl4K,CAAA,CAAA62L,EAAA,CAAA3xL,EAAA,EAEA0xL,IAAA,EAAAA,EACAlwL,EAAA,GACAA,GAAAA,EAAAwxK,EAAAA,EAAA,MACA,GAAAxxK,GAAAwxK,CAAAA,EAAAA,EAAA,MACQ1zK,EAAAivK,EAAA,GAAAyE,OAAAA,GAAAzE,EAAA,GAAAyE,OAAAA,GAAAA,KAAAA,GAAAA,GAAAA,GAER1zK,EAAA,CAAAivK,EAAA,GAAAyE,EAAA,GAAAhzK,GAAAuuK,EAAA,GAAAyE,EAAA,GAAAhzK,EAAA,IACA,CAAAlF,CAAA,CAAA62L,EAAA,GAAA3xL,EAAA,QAAAouL,EAAA,GAAA5sL,EAAA,MACA,CAAAwxK,GAAAhzK,EAAA,GAAAgzK,GAAAA,CAAA,IAAAl4K,CAAA,CAAA62L,EAAA,GAAA3xL,EAAA,UAGAwB,EAAA,GACAA,GAAAA,EAAAwxK,EAAAA,EAAA,MACAxxK,GAAAA,EAAAwxK,EAAAA,EAAA,MACA,GAAAxxK,GAAAwxK,CAAAA,EAAAA,EAAA,MACQ1zK,EAAA,CAAAoyL,GAAAnjB,EAAA,IAAAyE,MAAAA,GAAA,CAAA0e,GAAAnjB,EAAA,GAAAyE,MAAAA,GAER1zK,EAAA,EAAAoyL,GAAAnjB,EAAA,IAAAyE,EAAA,GAAAhzK,GACA,CAAA0xL,GAAAnjB,EAAA,GAAAyE,EAAA,GAAAhzK,EAAA,IACA,CAAAlF,CAAA,CAAA62L,EAAA,GAAA3xL,EAAA,QAAAouL,EAAA,GAAA5sL,EAAA,KAIAlC,CACA,CAMA,SAAA+xK,EAAArrJ,CAAA,CAAAouJ,CAAA,CAAAC,CAAA,EAOA,IANA,IAAA3kJ,EAEA4kJ,EADAtrG,EAAA,IAEAxnE,EAAA,EACAowL,EAAA5rK,EAAA5pB,MAAA,CAEAoF,EAAAowL,GAAA,CACA,IAAAtd,EAAAtrG,EAAA5sE,MAAA,CAAAk4K,KAAAtrG,CAAA,CAAAsrG,EAAA,EAAAF,EAEA,IADAprG,CAAA,KAAA8nH,EAAkB11K,OAAA,CAAA4K,EAAgBH,MAAA,CAAArkB,MAClCkuB,EAAA,EAAAA,EAAAs5C,EAAA5sE,MAAA,CAAAszB,IACAs5C,CAAA,CAAAt5C,EAAA,CAAA2kJ,EAAA,IACA,SAAArrG,CAAA,CAAAt5C,EAAA,IAAAs5C,CAAAA,CAAA,CAAAt5C,EAAA,MACAs5C,CAAA,CAAAt5C,EAAA,IAAAs5C,CAAA,CAAAt5C,EAAA,CAAA2kJ,EAAA,EACArrG,CAAA,CAAAt5C,EAAA,EAAA2kJ,EAGA,CAEA,OAAArrG,EAAApmD,OAAA,EACA,CAQA,SAAAivK,EAAApD,CAAA,CAAAnwL,CAAA,EACA,IAAA0B,EAAA40B,EAAAjF,EAEA,GAAArxB,EAAA+7J,MAAA,UAAA/7J,CAAA,CAMAs2B,CAAAA,EAAAt2B,EAAAxD,CAAA,CAAAsB,MAAA,EACA,GAEMuzB,EAAA,GAAAmiK,GAAA,EADN9xL,EAAA9D,KAAAC,IAAA,CAAAy4B,EAAA,GACM,EAAAzwB,QAAA,IAENnE,EAAA,GACA2vB,EAAA,gCAGA8+J,EAAA10B,SAAA,EAAA/5J,EAEA1B,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAoxK,KAAA,CAAA//I,GAAA,IAAA8+J,EAAA,IAGA,QAAAjtL,EAAAxB,EAAAwB,KAAA,CACA,IAAAwwL,EAAA1zL,EAAAoxK,KAAA,CAAApxK,GACAA,EAAA0zL,EAAAtiB,KAAA,CAAAsiB,GAAA1iB,KAAA,CAAA0iB,GAAAtiB,KAAA,IAAAF,IAAA,GACA,CAIA,OAFAif,EAAA10B,SAAA,EAAA/5J,EAEA1B,CACA,CAx6EA8gD,EAAAq2H,aAAA,CAAAr2H,EAAAn0B,GAAA,YACA,IAAA3sB,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,IAAA5B,CAAAA,EAAA4B,CAAA,IACA+xL,EAAA3zL,EACA,EAQA8gD,EAAAjjD,IAAA,YACA,OAAA81L,EAAA,SAAA90L,WAAA,YAAAoF,CAAA,KACA,EAWA68C,EAAA8yI,SAAA,CAAA9yI,EAAA+yI,KAAA,UAAA7qJ,CAAA,CAAAC,CAAA,EACA,IACAjpC,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAGA,GAFAmqC,EAAA,IAAAmnJ,EAAAnnJ,GACAC,EAAA,IAAAknJ,EAAAlnJ,GACA,CAAAD,EAAApnC,CAAA,GAAAqnC,EAAArnC,CAAA,YAAAuuL,EAAApwF,IAAA,CACA,GAAA/2D,EAAA4V,EAAA,CAAA3V,GAAA,MAAA3+B,MAAAslL,EAAA3mJ,EAAA,CAEA,OAAAvnC,EADA1B,EAAAqwK,GAAA,CAAArnI,GACAA,EAAAhpC,EAAAqwK,GAAA,CAAApnI,GAAA,EAAAA,EAAA,IAAAknJ,EAAAnwL,EAAA,EAYA8gD,EAAAs2H,UAAA,CAAAt2H,EAAAuvH,GAAA,UAAAh/I,CAAA,EACA,IAAAnuB,EAAAkuB,EAAAo/J,EAAAC,EACAzwL,EAAA,KACAiwL,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA,CAAA7+J,EAAA,IAAArxB,EAAAnB,WAAA,CAAAwyB,EAAA,EAAA70B,CAAA,CACAivC,EAAAzrC,EAAA4B,CAAA,CACAkyL,EAAAziK,EAAAzvB,CAAA,CAGA,IAAAquL,GAAA,CAAAC,EACA,UAAA4D,EAAAroJ,IAAAqoJ,EAAAroJ,EAAAwkJ,IAAAC,EAAA,GAAAD,EAAAxkJ,EAAA,OAAAs0D,GAAA,CAIA,IAAAkwF,CAAA,MAAAC,CAAA,WAAAD,CAAA,IAAAxkJ,EAAAykJ,CAAA,KAAA4D,EAAA,EAGA,GAAAroJ,IAAAqoJ,EAAA,OAAAroJ,CAAA,CAGA,GAAAzrC,EAAAiE,CAAA,GAAAotB,EAAAptB,CAAA,QAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,CAAAwnC,EAAA,OAMA,IAAAvoC,EAAA,EAAAkuB,EAAAo/J,CAJAA,EAAAP,EAAAnyL,MAAA,EACA2yL,CAAAA,EAAAP,EAAApyL,MAAA,EAGA0yL,EAAAC,CAAA,CAAAvtL,EAAAkuB,EAAA,EAAAluB,EACA,GAAA+sL,CAAA,CAAA/sL,EAAA,GAAAgtL,CAAA,CAAAhtL,EAAA,QAAA+sL,CAAA,CAAA/sL,EAAA,CAAAgtL,CAAA,CAAAhtL,EAAA,CAAAuoC,EAAA,OAIA,OAAA+kJ,IAAAC,EAAA,EAAAD,EAAAC,EAAAhlJ,EAAA,QAiBAqV,EAAAyyI,MAAA,CAAAzyI,EAAAuiI,GAAA,YACA,IAAAxuI,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAArC,CAAA,CAGAwD,EAAAxD,CAAA,KAEAq4C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAAj3C,KAAAqrC,GAAA,CAAAjpC,EAAAiE,CAAA,CAAAjE,EAAAgwK,EAAA,IAAAmC,EACAge,EAAA12B,QAAA,GAEAz5J,EAAAuzL,EAAApD,EAAA4D,GAAA5D,EAAAnwL,IAEAmwL,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEA0jB,EAAArB,GAAAA,GAAAA,GAAAA,EAAAtyL,EAAAshH,GAAA,GAAAthH,CAAA,CAAA60C,EAAAo7H,EAAA,KAZA,IAAAkgB,EAAA,GAHA,IAAAA,EAAApwF,IAAA,EAmCAj/C,EAAAkzI,QAAA,CAAAlzI,EAAAmzI,IAAA,YACA,IAAAhwL,EAAA8iB,EAAA7pB,EAAA8D,EAAA+3K,EAAAn3K,EAAAouK,EAAAjuK,EAAAg5H,EAAAm5D,EACAl0L,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAEA,IAAAmB,EAAAilG,QAAA,IAAAjlG,EAAA+7J,MAAA,cAAAo0B,EAAAnwL,EAAA,CAoCA,IAnCA0vL,EAAA,GAOA,CAJA9tL,EAAA5B,EAAA4B,CAAA,CAAAkuL,EAAA9vL,EAAA4B,CAAA,CAAA5B,EAAA,OAIApC,KAAA+uB,GAAA,CAAA/qB,IAAA,IAqBAZ,EAAA,IAAAmvL,EAAAvuL,EAAAiE,QAAA,KApBA3I,EAAAmzL,EAAArwL,EAAAxD,CAAA,EAIAoF,CAAAA,EAAA,CAAAqC,CAHAA,EAAAjE,EAAAiE,CAAA,EAGA/G,EAAAY,MAAA,QAAAZ,CAAAA,GAAA0E,GAAAA,GAAAA,IAAAA,EAAA,UACAA,EAAAkuL,EAAA5yL,EAAA,KAGA+G,EAAA+tK,EAAA,CAAA/tK,EAAA,MAAAA,CAAAA,EAAA,GAAAA,CAAAA,EAAA,SAGQ/G,EADR0E,GAAA,IACQ,KAAAqC,EAGR/G,CADAA,EAAA0E,EAAA2vK,aAAA,IACArzK,KAAA,GAAAhB,EAAA4f,OAAA,SAAA7Y,EAIMjD,CADNA,EAAA,IAAAmvL,EAAAjzL,EAAA,EACM0E,CAAA,CAAA5B,EAAA4B,CAAA,EAKNouK,EAAA,CAAA/rK,EAAAksL,EAAA10B,SAAA,MAWA,GAJAy4B,EAAAn5D,CADAA,EAAAh5H,CADAA,EAAAf,CAAAA,EACAowK,KAAA,CAAArvK,GAAAqvK,KAAA,CAAArvK,EAAA,EACAmvK,IAAA,CAAAlxK,GACAgB,EAAAm6J,EAAA+4B,EAAAhjB,IAAA,CAAAlxK,GAAAoxK,KAAA,CAAArvK,GAAAmyL,EAAAhjB,IAAA,CAAAn2C,GAAAi1C,EAAA,KAGAqgB,EAAAtuL,EAAAvF,CAAA,EAAA0B,KAAA,GAAA8xK,KAAA,CAAA9yK,EAAAmzL,EAAArvL,EAAAxE,CAAA,GAAA0B,KAAA,GAAA8xK,GAAA,CAKA,GAAA9yK,QAJAA,CAAAA,EAAAA,EAAAgB,KAAA,CAAA8xK,EAAA,EAAAA,EAAA,KAIA,IAAA9yK,QAAAA,CAAA,EAeA,CAIA,CAAAA,GAAA,EAAAA,EAAAgB,KAAA,KAAAhB,KAAAA,EAAAqqB,MAAA,OAGAosK,EAAA3yL,EAAAiD,EAAA,KACA8iB,EAAA,CAAA/lB,EAAAowK,KAAA,CAAApwK,GAAAowK,KAAA,CAAApwK,GAAA8oB,EAAA,CAAA9pB,IAGA,MACA,GAvBA,CAAA+4K,IACA4a,EAAA5xL,EAAAkC,EAAA,KAEAlC,EAAAqvK,KAAA,CAAArvK,GAAAqvK,KAAA,CAAArvK,GAAA+nB,EAAA,CAAA9pB,IAAA,CACAgB,EAAAe,EACA,MAEA,GAEA,EACUg3K,EAAA,CAcV,QAGA2W,EAAA,GAEAiE,EAAA3yL,EAAAiD,EAAAksL,EAAA12B,QAAA,CAAA1yI,EACA,EAOA+5B,EAAA+4G,aAAA,CAAA/4G,EAAA0vH,EAAA,YACA,IAAAz7I,EACAv4B,EAAA,KAAAA,CAAA,CACAU,EAAA6iG,IAEA,GAAAvjG,EAAA,CAMA,GAJAU,EAAA,CAAA63B,CADAA,EAAAv4B,EAAAsB,MAAA,IACAk0K,EAAA,KAAA/tK,CAAA,CAAAkuK,EAAA,EAAAA,EAGAp9I,EAAAv4B,CAAA,CAAAu4B,EAAA,CACA,KAAAA,EAAA,MAAAA,GAAA,GAAA73B,GAAA,CACAA,EAAA,GAAAA,CAAAA,EAAA,EACA,QAEAA,CACA,EAwBA4jD,EAAAu2H,SAAA,CAAAv2H,EAAA7D,GAAA,UAAA5rB,CAAA,EACA,OAAA8pI,EAAA,cAAAt8J,WAAA,CAAAwyB,GACA,EAQAyvB,EAAAw2H,kBAAA,CAAAx2H,EAAAqzI,QAAA,UAAA9iK,CAAA,EACA,IAAArxB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA,OAAA80L,EAAAx4B,EAAAn7J,EAAA,IAAAmwL,EAAA9+J,GAAA,OAAA8+J,EAAA10B,SAAA,CAAA00B,EAAA12B,QAAA,CACA,EAOA34G,EAAAiB,MAAA,CAAAjB,EAAAh3B,EAAA,UAAAuH,CAAA,EACA,gBAAAg/I,GAAA,CAAAh/I,EACA,EAQAyvB,EAAA1pC,KAAA,YACA,OAAAu8K,EAAA,SAAA90L,WAAA,YAAAoF,CAAA,KACA,EAQA68C,EAAAk6G,WAAA,CAAAl6G,EAAAlC,EAAA,UAAAvtB,CAAA,EACA,YAAAg/I,GAAA,CAAAh/I,GAAA,CACA,EAQAyvB,EAAA8vI,oBAAA,CAAA9vI,EAAAgwH,GAAA,UAAAz/I,CAAA,EACA,IAAA3vB,EAAA,KAAA2uK,GAAA,CAAAh/I,GACA,OAAA3vB,GAAAA,GAAAA,IAAAA,CACA,EA4BAo/C,EAAAszI,gBAAA,CAAAtzI,EAAAuzI,IAAA,YACA,IAAA3yL,EAAAxE,EAAA23C,EAAAo7H,EAAA35I,EACAt2B,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAsyH,EAAA,IAAAg/D,EAAA,GAEA,IAAAnwL,EAAAilG,QAAA,cAAAkrF,EAAAnwL,EAAA4B,CAAA,KAAAm+F,GAAA,EACA,GAAA//F,EAAA+7J,MAAA,UAAA5qC,CAAA,CAEAt8E,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAAj3C,KAAAqrC,GAAA,CAAAjpC,EAAAiE,CAAA,CAAAjE,EAAAgwK,EAAA,MACAmgB,EAAA12B,QAAA,GAQAnjI,CAPAA,EAAAt2B,EAAAxD,CAAA,CAAAsB,MAAA,EAOA,GAEMZ,EAAA,GAAAs2L,GAAA,EADN9xL,EAAA9D,KAAAC,IAAA,CAAAy4B,EAAA,GACM,EAAAzwB,QAAA,IAENnE,EAAA,GACAxE,EAAA,gCAGA8C,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAoxK,KAAA,CAAAl0K,GAAA,IAAAizL,EAAA,OAMA,IAHA,IAAAmE,EACApxL,EAAAxB,EACA6yL,EAAW,IAAIpE,EAAA,GACfjtL,KACAoxL,EAAAt0L,EAAAoxK,KAAA,CAAApxK,GACAA,EAAAmxH,EAAA6/C,KAAA,CAAAsjB,EAAAljB,KAAA,CAAAmjB,EAAAvjB,KAAA,CAAAsjB,EAAAljB,KAAA,CAAAmjB,MAGA,OAAAZ,EAAA3zL,EAAAmwL,EAAA10B,SAAA,CAAA5mH,EAAAs7I,EAAA12B,QAAA,CAAAwW,EAAA,GACA,EAiCAnvH,EAAA0zI,cAAA,CAAA1zI,EAAA2zI,IAAA,YACA,IAAA/yL,EAAAmzC,EAAAo7H,EAAA35I,EACAt2B,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAEA,IAAAmB,EAAAilG,QAAA,IAAAjlG,EAAA+7J,MAAA,cAAAo0B,EAAAnwL,EAAA,CAQA,GANA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAAj3C,KAAAqrC,GAAA,CAAAjpC,EAAAiE,CAAA,CAAAjE,EAAAgwK,EAAA,MACAmgB,EAAA12B,QAAA,GAGAnjI,CAFAA,EAAAt2B,EAAAxD,CAAA,CAAAsB,MAAA,EAEA,EACMkC,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAA,EAAA,QACN,CAYA0B,EAAAA,CADAA,EAAA,IAAA9D,KAAA6lH,IAAA,CAAAntF,EAAA,EACA,MAAA50B,EAAAA,CAAA,CAEA1B,EAAAA,EAAAoxK,KAAA,GAAAoiB,GAAA,EAAA9xL,IACA1B,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAA,EAAA,IAOA,IAJA,IAAA00L,EACAC,EAAA,IAAAxE,EAAA,GACAyE,EAAA,IAAAzE,EAAA,IACA0E,EAAa,IAAI1E,EAAA,IACjBzuL,KACAgzL,EAAA10L,EAAAoxK,KAAA,CAAApxK,GACAA,EAAAA,EAAAoxK,KAAA,CAAAujB,EAAAzjB,IAAA,CAAAwjB,EAAAtjB,KAAA,CAAAwjB,EAAAxjB,KAAA,CAAAsjB,GAAAxjB,IAAA,CAAA2jB,KAEA,QAEA1E,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEA0jB,EAAA3zL,EAAA60C,EAAAo7H,EAAA,GACA,EAmBAnvH,EAAAg0I,iBAAA,CAAAh0I,EAAAi0I,IAAA,YACA,IAAAlgJ,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAomG,QAAA,GACAjlG,EAAA+7J,MAAA,OAAAo0B,EAAAnwL,IAEA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAA,EACAs7I,EAAA12B,QAAA,GAEA0B,EAAAn7J,EAAAy0L,IAAA,GAAAz0L,EAAAq0L,IAAA,GAAAlE,EAAA10B,SAAA,CAAA5mH,EAAAs7I,EAAA12B,QAAA,CAAAwW,IARA,IAAAkgB,EAAAnwL,EAAA4B,CAAA,GA+BAk/C,EAAAk0I,aAAA,CAAAl0I,EAAAm0I,IAAA,YACA,IAAAC,EACAl1L,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA6C,EAAA1B,EAAA2sB,GAAA,GAAA0jJ,GAAA,IACAx7H,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,QAEA,KAAA/3J,EACAA,IAAAA,EAEA1B,EAAAs9C,KAAA,GAAA63I,EAAAhF,EAAAt7I,EAAAo7H,GAAA,IAAAkgB,EAAA,GAEA,IAAAA,EAAApwF,IAAA,CAGA//F,EAAA+7J,MAAA,GAAAo5B,EAAAhF,EAAAt7I,EAAA,EAAAo7H,GAAAmB,KAAA,MAIA+e,EAAA10B,SAAA,CAAA5mH,EAAA,EACAs7I,EAAA12B,QAAA,GAEAz5J,EAAAA,EAAAo1L,IAAA,GACAF,EAAAC,EAAAhF,EAAAt7I,EAAA,EAAAo7H,GAAAmB,KAAA,KAEA+e,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEAilB,EAAAlkB,KAAA,CAAAhxK,GAfA,EAsCA8gD,EAAAu0I,uBAAA,CAAAv0I,EAAAw0I,KAAA,YACA,IAAAzgJ,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAkyK,GAAA,QAAAof,EAAAnwL,EAAA8pB,EAAA,MAAAi2E,GAAA,EACA//F,EAAAilG,QAAA,IAEApwD,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAAj3C,KAAAqrC,GAAA,CAAArrC,KAAA+uB,GAAA,CAAA3sB,EAAAiE,CAAA,EAAAjE,EAAAgwK,EAAA,MACAmgB,EAAA12B,QAAA,GACAi2B,EAAA,GAEA1vL,EAAAA,EAAAoxK,KAAA,CAAApxK,GAAAgxK,KAAA,IAAAvtD,IAAA,GAAAytD,IAAA,CAAAlxK,GAEA0vL,EAAA,GACAS,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEAjwK,EAAAu7D,EAAA,IAdA,IAAA40H,EAAAnwL,EADA,EAmCA8gD,EAAAy0I,qBAAA,CAAAz0I,EAAA00I,KAAA,YACA,IAAA3gJ,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,OAEA,CAAAmB,EAAAilG,QAAA,IAAAjlG,EAAA+7J,MAAA,OAAAo0B,EAAAnwL,IAEA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAA,EAAAj3C,KAAAqrC,GAAA,CAAArrC,KAAA+uB,GAAA,CAAA3sB,EAAAiE,CAAA,EAAAjE,EAAAgwK,EAAA,MACAmgB,EAAA12B,QAAA,GACAi2B,EAAA,GAEA1vL,EAAAA,EAAAoxK,KAAA,CAAApxK,GAAAkxK,IAAA,IAAAztD,IAAA,GAAAytD,IAAA,CAAAlxK,GAEA0vL,EAAA,GACAS,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEAjwK,EAAAu7D,EAAA,GAdA,EAqCAza,EAAA20I,wBAAA,CAAA30I,EAAA40I,KAAA,YACA,IAAA7gJ,EAAAo7H,EAAAghB,EAAA0E,EACA31L,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAomG,QAAA,GACAjlG,EAAAiE,CAAA,QAAAksL,EAAAnwL,EAAA2sB,GAAA,GAAA7C,EAAA,IAAA9pB,EAAA4B,CAAA,GAAA5B,EAAA+7J,MAAA,GAAA/7J,EAAA+/F,GAAA,GAEAlrD,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAGA77J,KAAAqrC,GAAA,CAFA0sJ,EAAA31L,EAAAgwK,EAAA,GAEAn7H,GAAA,IAAA70C,EAAAiE,CAAA,KAAA0vL,EAAA,IAAAxD,EAAAnwL,GAAA60C,EAAAo7H,EAAA,KAEAkgB,EAAA10B,SAAA,CAAAw1B,EAAA0E,EAAA31L,EAAAiE,CAAA,CAEAjE,EAAAm7J,EAAAn7J,EAAAkxK,IAAA,QAAAif,EAAA,GAAAnf,KAAA,CAAAhxK,GAAAixL,EAAAp8I,EAAA,GAEAs7I,EAAA10B,SAAA,CAAA5mH,EAAA,EACAs7I,EAAA12B,QAAA,GAEAz5J,EAAAA,EAAAu7D,EAAA,GAEA40H,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEAjwK,EAAAoxK,KAAA,MArBA,IAAA+e,EAAApwF,IAAA,EA8CAj/C,EAAA80I,WAAA,CAAA90I,EAAAs0I,IAAA,YACA,IAAAF,EAAAxzL,EACAmzC,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAk9J,MAAA,OAAAo0B,EAAAnwL,IAEA0B,EAAA1B,EAAA2sB,GAAA,GAAA0jJ,GAAA,IACAx7H,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAEA/3J,KAAAA,GAGA,IAAAA,GAEAwzL,CADAA,EAAAC,EAAAhF,EAAAt7I,EAAA,EAAAo7H,GAAAmB,KAAA,MACAxvK,CAAA,CAAA5B,EAAA4B,CAAA,CACAszL,GAIA,IAAA/E,EAAApwF,IAHA,EAQAowF,EAAA10B,SAAA,CAAA5mH,EAAA,EACAs7I,EAAA12B,QAAA,GAEAz5J,EAAAA,EAAAi9C,GAAA,KAAAkzI,EAAA,GAAAnf,KAAA,CAAAhxK,EAAAoxK,KAAA,CAAApxK,IAAAyjH,IAAA,GAAAytD,IAAA,KAAA2kB,IAAA,GAEA1F,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEAjwK,EAAAoxK,KAAA,IA7BA,EAmDAtwH,EAAAg1I,cAAA,CAAAh1I,EAAA+0I,IAAA,YACA,IAAA3yL,EAAAkuB,EAAA1vB,EAAAxE,EAAA2nC,EAAA9iC,EAAAf,EAAAiwL,EAAApkE,EACA7sH,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAEA,GAAAz5J,EAAAilG,QAAA,IAOA,GAAAjlG,EAAA+7J,MAAA,GACM,WAAAo0B,EAAAnwL,EAKN,CAJA,GAAAA,EAAA2sB,GAAA,GAAA7C,EAAA,KAAA+qB,EAAA,GAAAq+I,EAGA,MADAlyL,CADAA,EAAAm0L,EAAAhF,EAAAt7I,EAAA,EAAAo7H,GAAAmB,KAAA,OACAxvK,CAAA,CAAA5B,EAAA4B,CAAA,CACAZ,CACA,KAbA,CACA,IAAAhB,EAAA4B,CAAA,YAAAuuL,EAAApwF,IAAA,CACA,GAAAlrD,EAAA,GAAAq+I,EAGA,MADAlyL,CADAA,EAAAm0L,EAAAhF,EAAAt7I,EAAA,EAAAo7H,GAAAmB,KAAA,MACAxvK,CAAA,CAAA5B,EAAA4B,CAAA,CACAZ,CACM,CAON,IAEAmvL,EAAA10B,SAAA,CAAAw1B,EAAAp8I,EAAA,GACAs7I,EAAA12B,QAAA,GAUAv2J,EAFAxB,EAAA9D,KAAAorC,GAAA,IAAAioJ,EAAA9e,EAAA,KAEAjvK,EAAA,EAAAA,EAAAlD,EAAAA,EAAAi9C,GAAA,CAAAj9C,EAAAoxK,KAAA,CAAApxK,GAAAkxK,IAAA,IAAAztD,IAAA,GAAAytD,IAAA,KAWA,IATAwe,EAAA,GAEAt+J,EAAAxzB,KAAAC,IAAA,CAAAozL,EAAA9e,GACAj1K,EAAA,EACA2vH,EAAA7sH,EAAAoxK,KAAA,CAAApxK,GACAgB,EAAA,IAAAmvL,EAAAnwL,GACA6kC,EAAA7kC,EAGAkD,KAAAA,GAOA,GANA2hC,EAAAA,EAAAusI,KAAA,CAAAvkD,GACA9qH,EAAAf,EAAAgwK,KAAA,CAAAnsI,EAAAoY,GAAA,CAAA//C,GAAA,IAEA2nC,EAAAA,EAAAusI,KAAA,CAAAvkD,GAGA7rH,KAAA,IAAAA,CAFAA,EAAAe,EAAAmvK,IAAA,CAAArsI,EAAAoY,GAAA,CAAA//C,GAAA,KAEAV,CAAA,CAAA40B,EAAA,KAAAluB,EAAAkuB,EAAApwB,EAAAxE,CAAA,CAAA0G,EAAA,GAAAnB,EAAAvF,CAAA,CAAA0G,EAAA,EAAAA,MAAA,OAGAxB,GAAAV,CAAAA,EAAAA,EAAAowK,KAAA,IAAA1vK,EAAA,IAEAguL,EAAA,GAEAiE,EAAA3yL,EAAAmvL,EAAA10B,SAAA,CAAA5mH,EAAAs7I,EAAA12B,QAAA,CAAAwW,EAAA,GACA,EAOAnvH,EAAAmkD,QAAA,YACA,aAAAzoG,CAAA,EAQAskD,EAAArrC,SAAA,CAAAqrC,EAAAi1I,KAAA,YACA,aAAAv5L,CAAA,EAAAw1K,EAAA,KAAA/tK,CAAA,CAAAkuK,GAAA,KAAA31K,CAAA,CAAAsB,MAAA,EACA,EAOAgjD,EAAAr9C,KAAA,YACA,YAAA7B,CAAA,EAQAk/C,EAAA64G,UAAA,CAAA74G,EAAAxD,KAAA,YACA,YAAA17C,CAAA,EACA,EAOAk/C,EAAAq3H,UAAA,CAAAr3H,EAAAk1I,KAAA,YACA,YAAAp0L,CAAA,EACA,EAOAk/C,EAAAi7G,MAAA,YACA,aAAAv/J,CAAA,WAAAA,CAAA,KAQAskD,EAAAw6G,QAAA,CAAAx6G,EAAA2L,EAAA,UAAAp7B,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAOAyvB,EAAAiwI,iBAAA,CAAAjwI,EAAAiwH,GAAA,UAAA1/I,CAAA,EACA,cAAAg/I,GAAA,CAAAh/I,EACA,EAiCAyvB,EAAAkwI,SAAA,CAAAlwI,EAAAyQ,GAAA,UAAArkB,CAAA,EACA,IAAA+oJ,EAAAz5L,EAAA4iD,EAAA19C,EAAAw0L,EAAAhtK,EAAA8mJ,EAAAhvK,EACA0yB,EAAA,KACAy8J,EAAAz8J,EAAA70B,WAAA,CACAg2C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACAi4B,EAAA,EAGA,GAAAxkJ,IAAA,EAAAA,EACAA,EAAA,IAAAijJ,EAAA,IACM8F,EAAA,OACN,CAKA,GAHAz5L,EAAA0wC,CADAA,EAAA,IAAAijJ,EAAAjjJ,EAAA,EACA1wC,CAAA,CAGA0wC,EAAAtrC,CAAA,KAAApF,GAAA,CAAAA,CAAA,KAAA0wC,EAAApjB,EAAA,eAAAqmK,EAAApwF,IAAA,CAEAk2F,EAAA/oJ,EAAApjB,EAAA,IACA,IAEAttB,EAAAk3B,EAAAl3B,CAAA,CAGAk3B,EAAA9xB,CAAA,KAAApF,GAAA,CAAAA,CAAA,KAAAk3B,EAAA5J,EAAA,IACA,WAAAqmK,EAAA3zL,GAAA,CAAAA,CAAA,SAAAk3B,GAAAA,EAAA9xB,CAAA,CAAAm+F,IAAAvjG,EAAA,MACA,CAIA,GAAAy5L,GACA,GAAAz5L,EAAAsB,MAAA,GACQo4L,EAAA,OACR,CACA,IAAAx0L,EAAAlF,CAAA,IAAAkF,EAAA,OAAAA,GAAA,GACAw0L,EAAAx0L,IAAAA,CACA,EACA,GAEAguL,EAAA,GAsBAyD,EAAAnyL,CAhBAA,EAAAm6J,EAJAjyI,EAAAioK,EAAAz9J,EADAs8I,EAAAn7H,EAAA68I,GAEAtyI,EAAA62I,EAAAlE,EAAA5B,EAAAngB,EAAA,IAAAmhB,EAAAjkJ,EAAA8iI,EAAA,CAGAA,EAAA,IAgBAxzK,CAAA,CAAAkF,EAAAmzC,EAAAo7H,GAEA,GAMA,GALAD,GAAA,GAGAhvK,EAAAm6J,EAFAjyI,EAAAioK,EAAAz9J,EAAAs8I,GACA5wH,EAAA62I,EAAAlE,EAAA5B,EAAAngB,EAAA,IAAAmhB,EAAAjkJ,EAAA8iI,EAAA,CACAA,EAAA,GAEA,CAAAkmB,EAAA,CAGA,CAAA7F,EAAArvL,EAAAxE,CAAA,EAAA0B,KAAA,CAAAwD,EAAA,EAAAA,EAAA,aACAV,CAAAA,EAAA2yL,EAAA3yL,EAAA6zC,EAAA,MAGA,MACQ,MACRs+I,EAAAnyL,EAAAxE,CAAA,CAAAkF,GAAA,GAAAuuK,GAAA,CAKA,OAFAyf,EAAA,GAEAiE,EAAA3yL,EAAA6zC,EAAAo7H,EACA,EAgDAnvH,EAAAkwH,KAAA,CAAAlwH,EAAA3C,GAAA,UAAA9sB,CAAA,EACA,IAAA70B,EAAAyH,EAAAf,EAAAkuB,EAAA1vB,EAAA40B,EAAAue,EAAAo7H,EAAAggB,EAAAh4H,EAAAmgH,EAAA8X,EACAlwL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAKA,GAHAwyB,EAAA,IAAA8+J,EAAA9+J,GAGA,CAAArxB,EAAAxD,CAAA,GAAA60B,EAAA70B,CAAA,CAaA,OAVA,EAAAoF,CAAA,EAAAyvB,EAAAzvB,CAAA,CAGA5B,EAAAxD,CAAA,CAAA60B,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CAKAyvB,EAAA,IAAA8+J,EAAA9+J,EAAA70B,CAAA,EAAAwD,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,CAAA5B,EAAA+/F,GAAA,EARA1uE,EAAA,IAAA8+J,EAAApwF,KAUA1uE,CACA,CAGA,GAAArxB,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,CAEA,OADAyvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CACA5B,EAAAkxK,IAAA,CAAA7/I,EACA,CAQA,GANA4+J,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CACAq4C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAGA,CAAAw2B,CAAA,MAAAC,CAAA,KAGA,GAAAA,CAAA,IAAA7+J,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,MAGA,IAAAquL,CAAA,IAIA,WAAAE,EAAA,IAJA9+J,EAAA,IAAA8+J,EAAAnwL,GAIA,OAEA0vL,EAAAiE,EAAAtiK,EAAAwjB,EAAAo7H,GAAA5+I,CAAA,CACA,GAKAptB,EAAA+tK,EAAA3gJ,EAAAptB,CAAA,CAAAkuK,GACAl6G,EAAA+5G,EAAAhyK,EAAAiE,CAAA,CAAAkuK,GAEA8d,EAAAA,EAAA/xL,KAAA,GACAwD,EAAAu2D,EAAAh0D,EAGA,CAyBA,IAxBAm0K,CAAAA,EAAA12K,EAAA,IAGAlF,EAAAyzL,EACAvuL,EAAA,CAAAA,EACQ40B,EAAA45J,EAAApyL,MAAA,GAERtB,EAAA0zL,EACAjsL,EAAAg0D,EACA3hC,EAAA25J,EAAAnyL,MAAA,EAMAoF,EAAAtF,KAAAqrC,GAAA,CAAArrC,KAAAC,IAAA,CAAAg3C,EAAAs9H,GAAA77I,GAAA,EAEA50B,EAAAwB,IACAxB,EAAAwB,EACA1G,EAAAsB,MAAA,IAIAtB,EAAA8nB,OAAA,GACAphB,EAAAxB,EAAAwB,KAAA1G,EAAAJ,IAAA,IACAI,EAAA8nB,OAAA,EAGA,MASA,IAHA8zJ,CAAAA,EAAAl1K,CAFAA,EAAA+sL,EAAAnyL,MAAA,EACAw4B,CAAAA,EAAA45J,EAAApyL,MAAA,CACA,GACAw4B,CAAAA,EAAApzB,CAAAA,EAEAA,EAAA,EAAAA,EAAAozB,EAAApzB,IACA,GAAA+sL,CAAA,CAAA/sL,EAAA,EAAAgtL,CAAA,CAAAhtL,EAAA,EACAk1K,EAAA6X,CAAA,CAAA/sL,EAAA,CAAAgtL,CAAA,CAAAhtL,EAAA,CACA,MACA,EAGA,CACA,KAEAk1K,IACA57K,EAAAyzL,EACAA,EAAAC,EACAA,EAAA1zL,EACA60B,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,EAGA00B,EAAA25J,EAAAnyL,MAAA,CAIAoF,EAAAgtL,EAAApyL,MAAA,CAAAw4B,EAAApzB,EAAA,IAAAA,EAAA+sL,CAAA,CAAA35J,IAAA,GAGA,IAAApzB,EAAAgtL,EAAApyL,MAAA,CAAAoF,EAAAxB,GAAA,CAEA,GAAAuuL,CAAA,GAAA/sL,EAAA,CAAoBgtL,CAAA,CAAAhtL,EAAA,EACpB,IAAAkuB,EAAAluB,EAAAkuB,GAAA6+J,IAAAA,CAAA,GAAA7+J,EAAA,EAAA6+J,CAAA,CAAA7+J,EAAA,CAAA4zF,EAAA,CACA,GAAAirE,CAAA,CAAA7+J,EAAA,CACA6+J,CAAA,CAAA/sL,EAAA,EAAA8hH,CACA,EAEA,CAAA9hH,EAAA,EAAAgtL,CAAA,CAAAhtL,EAAA,CAIA,KAAA+sL,IAAAA,CAAA,GAAA35J,EAAA,EAAA25J,EAAAv/H,GAAA,GAGA,KAAAu/H,IAAAA,CAAA,IAAAA,EAAAv3K,KAAA,KAAAzU,SAGA,MAEAotB,EAAA70B,CAAA,CAAAyzL,EACA5+J,EAAAptB,CAAA,CAAA0sL,EAAAV,EAAAhsL,GAEAyrL,EAAAiE,EAAAtiK,EAAAwjB,EAAAo7H,GAAA5+I,CAAA,EALA,IAAA8+J,EAAA,KAiCArvI,EAAA+/D,MAAA,CAAA//D,EAAAr5B,GAAA,UAAA4J,CAAA,EACA,IAAA89B,EACAnvD,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,OAKA,CAHAwyB,EAAA,IAAA8+J,EAAA9+J,GAGA,EAAA70B,CAAA,EAAA60B,EAAAzvB,CAAA,EAAAyvB,CAAAA,CAAAA,EAAA70B,CAAA,EAAA60B,EAAA70B,CAAA,MAGA,EAAAA,CAAA,EAAAwD,CAAAA,CAAAA,EAAAxD,CAAA,EAAAwD,EAAAxD,CAAA,MAKAkzL,EAAA,GAEAS,GAAAA,EAAAtvE,MAAA,EAIA1xD,EAAAgsG,EAAAn7J,EAAAqxB,EAAA1E,GAAA,UACMwiC,EAAAvtD,CAAA,EAAAyvB,EAAAzvB,CAAA,EAENutD,EAAAgsG,EAAAn7J,EAAAqxB,EAAA,EAAA8+J,EAAAtvE,MAAA,IAGA1xD,EAAAA,EAAAiiH,KAAA,CAAA//I,GAEAq+J,EAAA,GAEA1vL,EAAAgxK,KAAA,CAAA7hH,IApBAwkI,EAAA,IAAAxD,EAAAnwL,GAAAmwL,EAAA10B,SAAA,CAAA00B,EAAA12B,QAAA,EAJA,IAAA02B,EAAApwF,IAAA,EAkCAj/C,EAAAowI,kBAAA,CAAApwI,EAAA24H,GAAA,YACA,OAAAyX,EAAA,KACA,EAQApwI,EAAAqwI,gBAAA,CAAArwI,EAAAya,EAAA,YACA,OAAA41H,EAAA,KACA,EAQArwI,EAAA83H,OAAA,CAAA93H,EAAAwgE,GAAA,YACA,IAAAthH,EAAA,SAAAnB,WAAA,OAEA,OADAmB,EAAA4B,CAAA,EAAA5B,EAAA4B,CAAA,CACA+xL,EAAA3zL,EACA,EAwBA8gD,EAAAowH,IAAA,CAAApwH,EAAA3+C,GAAA,UAAAkvB,CAAA,EACA,IAAA+8I,EAAA5xK,EAAAyH,EAAAf,EAAAxB,EAAA40B,EAAAue,EAAAo7H,EAAAggB,EAAAC,EACAlwL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAKA,GAHAwyB,EAAA,IAAA8+J,EAAA9+J,GAGA,CAAArxB,EAAAxD,CAAA,GAAA60B,EAAA70B,CAAA,CAWA,OARA,EAAAoF,CAAA,EAAAyvB,EAAAzvB,CAAA,CAMA5B,EAAAxD,CAAA,EAAA60B,CAAAA,EAAA,IAAA8+J,EAAA9+J,EAAA70B,CAAA,EAAAwD,EAAA4B,CAAA,GAAAyvB,EAAAzvB,CAAA,CAAA5B,EAAA+/F,GAAA,GANA1uE,EAAA,IAAA8+J,EAAApwF,KAQA1uE,CACA,CAGA,GAAArxB,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,CAEA,OADAyvB,EAAAzvB,CAAA,EAAAyvB,EAAAzvB,CAAA,CACA5B,EAAAgxK,KAAA,CAAA3/I,EACA,CAQA,GANA4+J,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CACAq4C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAGA,CAAAw2B,CAAA,MAAAC,CAAA,IAMA,OAFAA,CAAA,KAAA7+J,CAAAA,EAAA,IAAA8+J,EAAAnwL,EAAA,EAEA0vL,EAAAiE,EAAAtiK,EAAAwjB,EAAAo7H,GAAA5+I,CAAA,CAaA,GAPA3vB,EAAAswK,EAAAhyK,EAAAiE,CAAA,CAAAkuK,GACAluK,EAAA+tK,EAAA3gJ,EAAAptB,CAAA,CAAAkuK,GAEA8d,EAAAA,EAAA/xL,KAAA,GACAgF,EAAAxB,EAAAuC,EAGA,CAuBA,IArBAf,EAAA,GACA1G,EAAAyzL,EACA/sL,EAAA,CAAAA,EACQozB,EAAA45J,EAAApyL,MAAA,GAERtB,EAAA0zL,EACAjsL,EAAAvC,EACA40B,EAAA25J,EAAAnyL,MAAA,EAOAoF,EAFAozB,CAAAA,EAAA50B,CADAA,EAAA9D,KAAAC,IAAA,CAAAg3C,EAAAs9H,EAAA,EACA77I,EAAA50B,EAAA,EAAA40B,EAAA,KAGApzB,EAAAozB,EACA95B,EAAAsB,MAAA,IAIAtB,EAAA8nB,OAAa,GACbphB,KAAA1G,EAAAJ,IAAA,IACAI,EAAA8nB,OAAA,EACA,KAEAgS,CAAAA,EAAA25J,EAAAnyL,MAAA,EACAoF,CAAAA,EAAAgtL,EAAApyL,MAAA,EAGA,IACAoF,EAAAozB,EACA95B,EAAA0zL,EACAA,EAAAD,EACAA,EAAAzzL,GAIA4xK,EAAA,EAAAlrK,GACAkrK,EAAA,CAAA6hB,CAAA,GAAA/sL,EAAA,CAAA+sL,CAAA,CAAA/sL,EAAA,CAAAgtL,CAAA,CAAAhtL,EAAA,CAAAkrK,CAAA,EAAAppD,EAAA,EACAirE,CAAA,CAAA/sL,EAAA,EAAA8hH,EAUA,IAPAopD,IACA6hB,EAAAvnI,OAAA,CAAA0lH,GACA,EAAAnqK,GAKAqyB,EAAA25J,EAAAnyL,MAAA,CAAAmyL,GAAAA,CAAA,GAAA35J,EAAA,EAAA25J,EAAAv/H,GAAA,GAKA,OAHAr/B,EAAA70B,CAAA,CAAAyzL,EACA5+J,EAAAptB,CAAA,CAAA0sL,EAAAV,EAAAhsL,GAEAyrL,EAAAiE,EAAAtiK,EAAAwjB,EAAAo7H,GAAA5+I,CAAA,EAUAyvB,EAAA26G,SAAA,CAAA36G,EAAAkvH,EAAA,UAAA1+I,CAAA,EACA,IAAA5vB,EACA1B,EAAA,KAEA,GAAAsxB,KAAA,IAAAA,GAAAA,CAAA,CAAAA,IAAAA,GAAAA,IAAAA,GAAAA,IAAAA,EAAA,MAAAhnB,MAAAslL,EAAAt+J,EAAA,CASA,OAPAtxB,EAAAxD,CAAA,EACAkF,EAAAy0L,EAAAn2L,EAAAxD,CAAA,EACM80B,GAAAtxB,EAAAiE,CAAA,GAAAvC,GAAAA,CAAAA,EAAA1B,EAAAiE,CAAA,KAENvC,EAAAq+F,IAGAr+F,CACA,EAQAo/C,EAAAve,KAAA,YACA,IAAAviC,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAEA,OAAA80L,EAAA,IAAAxD,EAAAnwL,GAAAA,EAAAiE,CAAA,GAAAksL,EAAA12B,QAAA,CACA,EAkBA34G,EAAAs1I,IAAA,CAAAt1I,EAAAyiI,GAAA,YACA,IAAA1uI,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAomG,QAAA,GACAjlG,EAAA+7J,MAAA,OAAAo0B,EAAAnwL,IAEA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAAj3C,KAAAqrC,GAAA,CAAAjpC,EAAAiE,CAAA,CAAAjE,EAAAgwK,EAAA,IAAAmC,EACAge,EAAA12B,QAAA,GAEAz5J,EAAAo2L,EAAAjG,EAAA4D,GAAA5D,EAAAnwL,IAEAmwL,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEA0jB,EAAArB,EAAA,EAAAtyL,EAAAshH,GAAA,GAAAthH,CAAA,CAAA60C,EAAAo7H,EAAA,KAbA,IAAAkgB,EAAApwF,IAAA,EA6BAj/C,EAAAg4H,UAAA,CAAAh4H,EAAA2iE,IAAA,YACA,IAAA18F,EAAA7pB,EAAA8yK,EAAAhvK,EAAA+3K,EAAAh3K,EACA/B,EAAA,KACAxD,EAAAwD,EAAAxD,CAAA,CACAyH,EAAAjE,EAAAiE,CAAA,CACArC,EAAA5B,EAAA4B,CAAA,CACAuuL,EAAAnwL,EAAAnB,WAAA,CAGA,GAAA+C,IAAAA,GAAA,CAAApF,GAAA,CAAAA,CAAA,IACA,WAAA2zL,EAAA,CAAAvuL,GAAAA,EAAA,KAAApF,GAAAA,CAAA,KAAAujG,IAAAvjG,EAAAwD,EAAA,IACA,CA+BA,IA7BA0vL,EAAA,GAOA9tL,GAJAA,CAAAA,EAAAhE,KAAA6lH,IAAA,EAAAzjH,EAAA,GAIA4B,GAAA,KAGA1E,CAAAA,CAFAA,EAAAmzL,EAAA7zL,EAAA,EAEAsB,MAAA,CAAAmG,CAAAA,EAAA,MAAA/G,CAAAA,GAAA,KACA0E,EAAAhE,KAAA6lH,IAAA,CAAAvmH,GACA+G,EAAA+tK,EAAA,CAAA/tK,EAAA,MAAAA,CAAAA,EAAA,GAAAA,EAAA,GAGQ/G,EADR0E,GAAA,IACQ,KAAAqC,EAGR/G,CADAA,EAAA0E,EAAA2vK,aAAA,IACArzK,KAAA,GAAAhB,EAAA4f,OAAA,SAAA7Y,EAGMjD,EAAA,IAAAmvL,EAAAjzL,IAEN8D,EAAA,IAAAmvL,EAAAvuL,EAAAiE,QAAA,IAGAmqK,EAAA,CAAA/rK,EAAAksL,EAAA10B,SAAA,MAQA,GAHAz6J,EAAAe,CADAA,EAAAf,CAAAA,EACAkwK,IAAA,CAAA/V,EAAAn7J,EAAA+B,EAAAiuK,EAAA,MAAAoB,KAAA,KAGAif,EAAAtuL,EAAAvF,CAAA,EAAA0B,KAAA,GAAA8xK,KAAA,CAAA9yK,EAAAmzL,EAAArvL,EAAAxE,CAAA,GAAA0B,KAAA,GAAA8xK,GAAA,CAKA,GAAA9yK,QAJAA,CAAAA,EAAAA,EAAAgB,KAAA,CAAA8xK,EAAA,EAAAA,EAAA,KAIA,IAAA9yK,QAAAA,CAAA,EAeA,CAIA,CAAAA,GAAA,EAAAA,EAAAgB,KAAA,KAAAhB,KAAAA,EAAAqqB,MAAA,OAGAosK,EAAA3yL,EAAAiD,EAAA,KACA8iB,EAAA,CAAA/lB,EAAAowK,KAAA,CAAApwK,GAAA8oB,EAAA,CAAA9pB,IAGA,MACA,GAvBA,CAAA+4K,IACA4a,EAAA5xL,EAAAkC,EAAA,KAEAlC,EAAAqvK,KAAA,CAAArvK,GAAA+nB,EAAA,CAAA9pB,IAAA,CACAgB,EAAAe,EACA,MAEA,GAEA,EACUg3K,EAAA,CAcV,QAGA2W,EAAA,GAEAiE,EAAA3yL,EAAAiD,EAAAksL,EAAA12B,QAAA,CAAA1yI,EACA,EAgBA+5B,EAAAu1I,OAAA,CAAAv1I,EAAAw1I,GAAA,YACA,IAAAzhJ,EAAAo7H,EACAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,QAEA,EAAAomG,QAAA,GACAjlG,EAAA+7J,MAAA,OAAAo0B,EAAAnwL,IAEA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CACA02B,EAAA10B,SAAA,CAAA5mH,EAAA,GACAs7I,EAAA12B,QAAA,GAGAz5J,CADAA,EAAAA,EAAAujL,GAAA,IACA3hL,CAAA,GACA5B,EAAAm7J,EAAAn7J,EAAA,IAAAmwL,EAAA,GAAAnf,KAAA,CAAAhxK,EAAAoxK,KAAA,CAAApxK,IAAAyjH,IAAA,GAAA5uE,EAAA,MAEAs7I,EAAA10B,SAAA,CAAA5mH,EACAs7I,EAAA12B,QAAA,CAAAwW,EAEA0jB,EAAArB,GAAAA,GAAAA,GAAAA,EAAAtyL,EAAAshH,GAAA,GAAAthH,CAAA,CAAA60C,EAAAo7H,EAAA,KAfA,IAAAkgB,EAAApwF,IAAA,EAwCAj/C,EAAAswH,KAAA,CAAAtwH,EAAAtD,GAAA,UAAAnsB,CAAA,EACA,IAAA+8I,EAAAnqK,EAAAf,EAAAxB,EAAAV,EAAAowL,EAAArvL,EAAAyuL,EAAAC,EACAzwL,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAoxL,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA,CAAA7+J,EAAA,IAAA8+J,EAAA9+J,EAAA,EAAA70B,CAAA,CAKA,GAHA60B,EAAAzvB,CAAA,EAAA5B,EAAA4B,CAAA,CAGA,CAAAquL,GAAA,CAAAA,CAAA,MAAAC,GAAA,CAAAA,CAAA,IAEA,WAAAC,EAAA,EAAAvuL,CAAA,EAAAquL,CAAAA,CAAAA,GAAAA,CAAA,KAAAC,CAAA,GAAAA,CAAAA,CAAAA,GAAAA,CAAA,KAAAD,CAAA,EAQA,GAAAC,EAAA7+J,EAAAA,EAAAzvB,CAAA,CAAAyvB,EAAAzvB,CAAA,GAJAm+F,GAIA,CACA,CAmBA,IAjBA97F,EAAA+tK,EAAAhyK,EAAAiE,CAAA,CAAAkuK,GAAAH,EAAA3gJ,EAAAptB,CAAA,CAAAkuK,GACAqe,CAAAA,EAAAP,EAAAnyL,MAAA,EACA2yL,CAAAA,EAAAP,EAAApyL,MAAA,IAIAkD,EAAAivL,EACAA,EAAAC,EACAA,EAAAlvL,EACAowL,EAAAZ,EACAA,EAAAC,EACAA,EAAAW,GAIApwL,EAAA,GAEAkC,EADAkuL,EAAAZ,EAAAC,EACAvtL,KAAAlC,EAAA5E,IAAA,IAGA,IAAA8G,EAAAutL,EAAA,EAAAvtL,GAAA,IAEA,IADAkrK,EAAA,EACA1sK,EAAA8uL,EAAAttL,EAAAxB,EAAAwB,GACAnB,EAAAf,CAAA,CAAAU,EAAA,CAAAwuL,CAAA,CAAAhtL,EAAA,CAAA+sL,CAAA,CAAAvuL,EAAAwB,EAAA,GAAAkrK,EACAptK,CAAA,CAAAU,IAAA,CAAAK,EAAAijH,EAAA,EACAopD,EAAArsK,EAAAijH,EAAA,CAGAhkH,CAAAA,CAAA,CAAAU,EAAA,EAAAV,CAAA,CAAAU,EAAA,CAAA0sK,CAAA,EAAAppD,EAAA,CACA,CAGA,MAAAhkH,CAAA,GAAAowL,EAAA,EAAApwL,EAAA0vD,GAAA,GAQA,OANA09G,EAAA,EAAAnqK,EACAjD,EAAA0X,KAAA,GAEA2Y,EAAA70B,CAAA,CAAAwE,EACAqwB,EAAAptB,CAAA,CAAA0sL,EAAA3vL,EAAAiD,GAEAyrL,EAAAiE,EAAAtiK,EAAA8+J,EAAA10B,SAAA,CAAA00B,EAAA12B,QAAA,EAAApoI,CAAA,EAcAyvB,EAAAy1I,QAAA,UAAAvmB,CAAA,CAAAC,CAAA,EACA,OAAAumB,GAAA,OAAAxmB,EAAAC,EACA,EAaAnvH,EAAAvB,eAAA,CAAAuB,EAAA21I,IAAA,UAAAjmB,CAAA,CAAAP,CAAA,EACA,IAAAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,OAGA,CADAmB,EAAA,IAAAmwL,EAAAnwL,GACAwwK,KAAA,IAAAA,GAAAxwK,GAEAowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAEA0jB,EAAA3zL,EAAAwwK,EAAAxwK,EAAAiE,CAAA,GAAAgsK,GAPA,EAmBAnvH,EAAAywH,aAAA,UAAAf,CAAA,CAAAP,CAAA,EACA,IAAAvoJ,EACA1nB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAcA,OAZA2xK,KAAA,IAAAA,EACM9oJ,EAAAgvK,EAAA12L,EAAA,KAENowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAvoJ,EAAAgvK,EADA12L,EAAA2zL,EAAA,IAAAxD,EAAAnwL,GAAAwwK,EAAA,EAAAP,GACA,GAAAO,EAAA,IAGAxwK,EAAAs9C,KAAA,KAAAt9C,EAAA+7J,MAAA,OAAAr0I,EAAAA,CAAA,EAoBAo5B,EAAA5W,OAAA,UAAAsmI,CAAA,CAAAP,CAAA,EACA,IAAAvoJ,EAAA2J,EACArxB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAgBA,OAdA2xK,KAAA,IAAAA,EACM9oJ,EAAAgvK,EAAA12L,IAENowL,EAAA5f,EAAA,EAAA6e,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAvoJ,EAAAgvK,EADArlK,EAAAsiK,EAAA,IAAAxD,EAAAnwL,GAAAwwK,EAAAxwK,EAAAiE,CAAA,GAAAgsK,GACA,GAAAO,EAAAn/I,EAAAptB,CAAA,KAKAjE,EAAAs9C,KAAA,KAAAt9C,EAAA+7J,MAAA,OAAAr0I,EAAAA,CAAA,EAeAo5B,EAAAu4H,UAAA,UAAAsd,CAAA,EACA,IAAAn6L,EAAA88K,EAAAC,EAAAC,EAAAv1K,EAAAvC,EAAAxE,EAAA4hD,EAAAC,EAAAlK,EAAAsa,EAAAnuD,EACAhB,EAAA,KACAiwL,EAAAjwL,EAAAxD,CAAA,CACA2zL,EAAAnwL,EAAAnB,WAAA,CAEA,IAAAoxL,EAAA,WAAAE,EAAAnwL,EAAA,CAUA,GARA++C,EAAAu6H,EAAA,IAAA6W,EAAA,GACA5W,EAAAz6H,EAAA,IAAAqxI,EAAA,GAIAzuL,EAAAuC,CADAA,EAAAzH,CADAA,EAAA,IAAA2zL,EAAA5W,EAAA,EACAt1K,CAAA,CAAAkyL,EAAAlG,GAAAjwL,EAAAiE,CAAA,IACAkuK,EACA31K,EAAAA,CAAA,IAAAszL,EAAA,GAAApuL,EAAA,EAAAywK,EAAAzwK,EAAAA,CAAA,EAEAi1L,IAAA,EAAAA,EAGMA,EAAA1yL,EAAA,EAAAzH,EAAAuiD,CAAA,KACN,CAEA,IAAA7hD,CADAA,EAAA,IAAAizL,EAAAwG,EAAA,EACAZ,KAAA,IAAA74L,EAAAuvD,EAAA,CAAA1N,GAAA,MAAAz0C,MAAAslL,EAAA1yL,EAAA,CACAy5L,EAAAz5L,EAAA0hD,EAAA,CAAApiD,GAAAyH,EAAA,EAAAzH,EAAAuiD,CAAA,CAAA7hD,CAAA,CACA,IAEAwyL,EAAA,GACAxyL,EAAA,IAAAizL,EAAAE,EAAAJ,IACAp7I,EAAAs7I,EAAA10B,SAAA,CACA00B,EAAA10B,SAAA,CAAAx3J,EAAAgsL,EAAAnyL,MAAA,CAAAq0K,EAAA,EAGAhjH,EAAAgsG,EAAAj+J,EAAAV,EAAA,OAEAg9K,GAAAA,CADAA,EAAAF,EAAApI,IAAA,CAAA/hH,EAAAiiH,KAAA,CAAAmI,GAAA,EACAlJ,GAAA,CAAAsmB,IACArd,EAAAC,EACAA,EAAAC,EACAA,EAAAz6H,EACAA,EAAAD,EAAAoyH,IAAA,CAAA/hH,EAAAiiH,KAAA,CAAAoI,IACA16H,EAAA06H,EACAA,EAAAh9K,EACAA,EAAAU,EAAA8zK,KAAA,CAAA7hH,EAAAiiH,KAAA,CAAAoI,IACAt8K,EAAAs8K,EAeA,OAZAA,EAAAre,EAAAw7B,EAAA3lB,KAAA,CAAAsI,GAAAC,EAAA,OACAz6H,EAAAA,EAAAoyH,IAAA,CAAAsI,EAAApI,KAAA,CAAAryH,IACAu6H,EAAAA,EAAApI,IAAA,CAAAsI,EAAApI,KAAA,CAAAmI,IACAz6H,EAAAl9C,CAAA,CAAAm9C,EAAAn9C,CAAA,CAAA5B,EAAA4B,CAAA,CAGAZ,EAAAm6J,EAAAA,EAAAp8G,EAAAw6H,EAAAt1K,EAAA,GAAA+sK,KAAA,CAAAhxK,GAAA2sB,GAAA,GAAA0jJ,GAAA,CAAAlV,EAAAr8G,EAAAw6H,EAAAr1K,EAAA,GAAA+sK,KAAA,CAAAhxK,GAAA2sB,GAAA,IACA,CAAAoyB,EAAAw6H,EAAA,EAAAz6H,EAAAw6H,EAAA,CAEA6W,EAAA10B,SAAA,CAAA5mH,EACA66I,EAAA,GAEA1uL,CACA,EAaA8/C,EAAA81I,aAAA,CAAA91I,EAAAoqE,KAAA,UAAA8kD,CAAA,CAAAC,CAAA,EACA,OAAAumB,GAAA,QAAAxmB,EAAAC,EACA,EAmBAnvH,EAAA+1I,SAAA,UAAAxlK,CAAA,CAAA4+I,CAAA,EACA,IAAAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAIA,GAFAmB,EAAA,IAAAmwL,EAAAnwL,GAEAqxB,IAAA,EAAAA,EAAA,CAGA,IAAArxB,EAAAxD,CAAA,QAAAwD,CAAA,CAEAqxB,EAAA,IAAA8+J,EAAA,GACMlgB,EAAAkgB,EAAA12B,QAAA,KACN,CASA,GARApoI,EAAA,IAAA8+J,EAAA9+J,GACA4+I,KAAA,IAAAA,EACQA,EAAAkgB,EAAA12B,QAAA,CAER22B,EAAAngB,EAAA,KAIA,CAAAjwK,EAAAxD,CAAA,QAAA60B,EAAAzvB,CAAA,CAAA5B,EAAAqxB,CAAA,CAGA,IAAAA,EAAA70B,CAAA,CAEA,OADA60B,EAAAzvB,CAAA,EAAAyvB,CAAAA,EAAAzvB,CAAA,CAAA5B,EAAA4B,CAAA,EACAyvB,CACA,CACA,OAGAA,EAAA70B,CAAA,KACAkzL,EAAA,GACA1vL,EAAAm7J,EAAAn7J,EAAAqxB,EAAA,EAAA4+I,EAAA,GAAAmB,KAAA,CAAA//I,GACAq+J,EAAA,GACAiE,EAAA3zL,KAIAqxB,EAAAzvB,CAAA,CAAA5B,EAAA4B,CAAA,CACA5B,EAAAqxB,GAGArxB,CACA,EAQA8gD,EAAA5lC,QAAA,YACA,aAcA4lC,EAAAg2I,OAAA,UAAA9mB,CAAA,CAAAC,CAAA,EACA,OAAAumB,GAAA,OAAAxmB,EAAAC,EACA,EA8CAnvH,EAAA0wI,OAAA,CAAA1wI,EAAA5D,GAAA,UAAA7rB,CAAA,EACA,IAAAptB,EAAAvC,EAAAmzC,EAAA7zC,EAAAivK,EAAAruK,EACA5B,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACAmuD,EAAA,CAAA37B,CAAAA,EAAA,IAAA8+J,EAAA9+J,EAAA,EAGA,IAAArxB,EAAAxD,CAAA,GAAA60B,EAAA70B,CAAA,GAAAwD,EAAAxD,CAAA,MAAA60B,EAAA70B,CAAA,eAAA2zL,EAAAL,EAAA,CAAA9vL,EAAAgtD,GAAA,CAIA,GAAAhtD,CAFAA,EAAA,IAAAmwL,EAAAnwL,EAAA,EAEA8pB,EAAA,WAAA9pB,CAAA,CAKA,GAHA60C,EAAAs7I,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,CAEApoI,EAAAvH,EAAA,WAAA6pK,EAAA3zL,EAAA60C,EAAAo7H,EAAA,CAMA,GAAAhsK,CAHAA,EAAA+tK,EAAA3gJ,EAAAptB,CAAA,CAAAkuK,EAAA,GAGA9gJ,EAAA70B,CAAA,CAAAsB,MAAA,KAAA4D,EAAAsrD,EAAA,GAAAA,EAAAA,CAAA,GAAA9S,EAEA,OADAl5C,EAAA+1L,EAAA5G,EAAAnwL,EAAA0B,EAAAmzC,GACAxjB,EAAAzvB,CAAA,OAAAuuL,EAAA,GAAAlzI,GAAA,CAAAj8C,GAAA2yL,EAAA3yL,EAAA6zC,EAAAo7H,EAAA,CAMA,GAAAruK,CAHAA,EAAA5B,EAAA4B,CAAA,EAGA,GAGA,GAAAqC,EAAAotB,EAAA70B,CAAA,CAAAsB,MAAA,cAAAqyL,EAAApwF,IAAA,CAMA,GAHA1uE,CAAAA,EAAAA,EAAA70B,CAAA,CAAAyH,EAAA,MAAArC,CAAAA,EAAA,GAGA5B,GAAAA,EAAAiE,CAAA,EAAAjE,GAAAA,EAAAxD,CAAA,KAAAwD,GAAAA,EAAAxD,CAAA,CAAAsB,MAAA,CAEA,OADAkC,EAAA4B,CAAA,CAAAA,EACA5B,CACA,CACA,MAcA,CAPAiE,EAAAvC,GADAA,CAAAA,EAAAouL,EAAA,CAAA9vL,EAAAgtD,EAAA,GACAi4C,SAAAvjG,GAEA,IAAAyuL,EAAAzuL,EAAA,IAAAuC,CAAA,CADA+tK,EAAAhlH,EAAApvD,CAAAA,KAAA2zD,GAAA,MAAA8+H,EAAArwL,EAAAxD,CAAA,GAAAoB,KAAA6xL,IAAA,CAAAzvL,EAAAiE,CAAA,IACA,EAKAksL,EAAAwC,IAAA,IAAA1uL,EAAAksL,EAAAuC,IAAA,OAAAvC,EAAAlsL,EAAA,EAAArC,EAAA,MAEA8tL,EAAA,GACAS,EAAA12B,QAAA,CAAAz5J,EAAA4B,CAAA,GAMAF,EAAA9D,KAAAorC,GAAA,KAAA/kC,EAAA,IAAAnG,MAAA,EAMAkD,CAHAA,EAAAkwL,EAAA7/J,EAAA+/I,KAAA,CAAA+f,EAAAnxL,EAAA60C,EAAAnzC,IAAAmzC,EAAA,EAGAr4C,CAAA,EAOA22L,EAAAnyL,CAJAA,EAAA2yL,EAAA3yL,EAAA6zC,EAAA,MAIAr4C,CAAA,CAAAq4C,EAAAo7H,KACAhsK,EAAA4wC,EAAA,GAMA,CAAAw7I,EAAArvL,CAHAA,EAAA2yL,EAAAzC,EAAA7/J,EAAA+/I,KAAA,CAAA+f,EAAAnxL,EAAAiE,EAAAvC,IAAAuC,GAAAA,EAAA,MAGAzH,CAAA,EAAA0B,KAAA,CAAA22C,EAAA,EAAAA,EAAA,aACA7zC,CAAAA,EAAA2yL,EAAA3yL,EAAA6zC,EAAA,OAKA7zC,EAAAY,CAAA,CAAAA,EACA8tL,EAAA,GACAS,EAAA12B,QAAA,CAAAwW,EAEA0jB,EAAA3yL,EAAA6zC,EAAAo7H,GAvCA,EAsDAnvH,EAAA0wH,WAAA,UAAAxB,CAAA,CAAAC,CAAA,EACA,IAAAvoJ,EACA1nB,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAcA,OAZAmxK,KAAA,IAAAA,EACMtoJ,EAAAgvK,EAAA12L,EAAAA,EAAAiE,CAAA,EAAAksL,EAAAZ,QAAA,EAAAvvL,EAAAiE,CAAA,EAAAksL,EAAAX,QAAA,GAENY,EAAApgB,EAAA,EAAAqf,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,KAGAvoJ,EAAAgvK,EADA12L,EAAA2zL,EAAA,IAAAxD,EAAAnwL,GAAAgwK,EAAAC,GACAD,GAAAhwK,EAAAiE,CAAA,EAAAjE,EAAAiE,CAAA,EAAAksL,EAAAZ,QAAA,CAAAvf,IAGAhwK,EAAAs9C,KAAA,KAAAt9C,EAAA+7J,MAAA,OAAAr0I,EAAAA,CAAA,EAkBAo5B,EAAA46G,mBAAA,CAAA56G,EAAAk2I,IAAA,UAAAhnB,CAAA,CAAAC,CAAA,EACA,IAAAjwK,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CAYA,OAVAmxK,KAAA,IAAAA,GACAA,EAAAmgB,EAAA10B,SAAA,CACMwU,EAAAkgB,EAAA12B,QAAA,GAEN22B,EAAApgB,EAAA,EAAAqf,GAEApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACA22B,EAAAngB,EAAA,MAGA0jB,EAAA,IAAAxD,EAAAnwL,GAAAgwK,EAAAC,EACA,EAUAnvH,EAAAj7C,QAAA,YACA,IAAA7F,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA6oB,EAAAgvK,EAAA12L,EAAAA,EAAAiE,CAAA,EAAAksL,EAAAZ,QAAA,EAAAvvL,EAAAiE,CAAA,EAAAksL,EAAAX,QAAA,EAEA,OAAAxvL,EAAAs9C,KAAA,KAAAt9C,EAAA+7J,MAAA,OAAAr0I,EAAAA,CAAA,EAQAo5B,EAAAm2I,SAAA,CAAAn2I,EAAApD,KAAA,YACA,OAAAi2I,EAAA,SAAA90L,WAAA,YAAAoF,CAAA,KACA,EAQA68C,EAAAqgD,OAAA,CAAArgD,EAAAsjC,MAAA,YACA,IAAApkF,EAAA,KACAmwL,EAAAnwL,EAAAnB,WAAA,CACA6oB,EAAAgvK,EAAA12L,EAAAA,EAAAiE,CAAA,EAAAksL,EAAAZ,QAAA,EAAAvvL,EAAAiE,CAAA,EAAAksL,EAAAX,QAAA,EAEA,OAAAxvL,EAAAs9C,KAAA,OAAA51B,EAAAA,CAAA,EAmNA,IAAAyzI,EAAA,WAGA,SAAAy2B,EAAA5xL,CAAA,CAAA0B,CAAA,CAAAwrC,CAAA,EACA,IAAAgpI,EACA9H,EAAA,EACAlrK,EAAAlD,EAAAlC,MAAA,CAEA,IAAAkC,EAAAA,EAAA9B,KAAA,GAAAgF,KACAgzK,EAAAl2K,CAAA,CAAAkD,EAAA,CAAAxB,EAAA0sK,EACApuK,CAAA,CAAAkD,EAAA,CAAAgzK,EAAAhpI,EAAA,EACAkhI,EAAA8H,EAAAhpI,EAAA,EAKA,OAFAkhI,GAAApuK,EAAA0oD,OAAA,CAAA0lH,GAEApuK,CACA,CAEA,SAAA4zD,EAAAl3D,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,CAAAC,CAAA,EACA,IAAAtzK,EAAAlC,EAEA,GAAAu1K,GAAAC,EACQx1K,EAAAu1K,EAAAC,EAAA,UAER,IAAAtzK,EAAAlC,EAAA,EAAAkC,EAAAqzK,EAAArzK,IACA,GAAAxG,CAAA,CAAAwG,EAAA,EAAA0S,CAAA,CAAA1S,EAAA,EACAlC,EAAAtE,CAAA,CAAAwG,EAAA,CAAA0S,CAAA,CAAA1S,EAAA,MACA,MACA,OAIAlC,CACA,CAEA,SAAA0oH,EAAAhtH,CAAA,CAAAkZ,CAAA,CAAA2gK,CAAA,CAAArpI,CAAA,EAIA,IAHA,IAAAhqC,EAAA,EAGAqzK,KACA75K,CAAA,CAAA65K,EAAA,EAAArzK,EACAA,EAAAxG,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,KACA75K,CAAA,CAAA65K,EAAA,CAAArzK,EAAAgqC,EAAAxwC,CAAA,CAAA65K,EAAA,CAAA3gK,CAAA,CAAA2gK,EAAA,CAIA,MAAA75K,CAAA,KAAAA,EAAAoB,MAAA,IAAApB,EAAAgc,KAAA,EACA,CAEA,gBAAA1Y,CAAA,CAAAqxB,CAAA,CAAAwjB,CAAA,CAAAo7H,CAAA,CAAAO,CAAA,CAAAtjI,CAAA,EACA,IAAAmjI,EAAApsK,EAAAf,EAAAxB,EAAAw1L,EAAAhnB,EAAAuG,EAAAC,EAAAvnH,EAAA0iI,EAAAp2F,EAAAk7E,EAAAC,EAAA5G,EAAAjuK,EAAA80K,EAAAC,EAAAgb,EACA9a,EAAAC,EACAkZ,EAAAnwL,EAAAnB,WAAA,CACAyG,EAAAtF,EAAA4B,CAAA,EAAAyvB,EAAAzvB,CAAA,MACAquL,EAAAjwL,EAAAxD,CAAA,CACA0zL,EAAA7+J,EAAA70B,CAAA,CAGA,IAAAyzL,GAAA,CAAAA,CAAA,MAAAC,GAAA,CAAAA,CAAA,IAEA,WAAAC,EACA,EAAAvuL,CAAA,EAAAyvB,EAAAzvB,CAAA,EAAAquL,CAAAA,EAAAC,CAAAA,GAAAD,CAAA,KAAAC,CAAA,IAAAA,CAAA,EAGAD,GAAAA,GAAAA,CAAA,MAAAC,EAAA5qL,EAAAA,EAAAA,EAAA,EAHAy6F,GAGA,CACA,CAkBA,IAhBA7yD,GACAgqJ,EAAA,EACQjzL,EAAAjE,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,GAERipC,EAAA83E,EACAkyE,EAAA/kB,EACAluK,EAAA+tK,EAAAhyK,EAAAiE,CAAA,CAAAizL,GAAAllB,EAAA3gJ,EAAAptB,CAAA,CAAAizL,IAGAlgB,EAAAkZ,EAAApyL,MAAA,CACAg5K,EAAAmZ,EAAAnyL,MAAA,CAEA+zL,EAAA1iI,CADAA,EAAA,IAAAghI,EAAA7qL,EAAA,EACA9I,CAAA,IAIA0G,EAAA,EAAAgtL,CAAA,CAAAhtL,EAAA,EAAA+sL,CAAAA,CAAA,CAAA/sL,EAAA,KAAAA,KAaA,GAXAgtL,CAAA,CAAAhtL,EAAA,CAAA+sL,CAAAA,CAAA,CAAA/sL,EAAA,MAAAe,IAEA4wC,IAAA,EAAAA,GACAm7H,EAAAn7H,EAAAs7I,EAAA10B,SAAA,CACQwU,EAAAkgB,EAAA12B,QAAA,EAEAuW,EADRQ,EACQ37H,EAAA70C,CAAAA,EAAAiE,CAAA,CAAAotB,EAAAptB,CAAA,IAER4wC,EAGAm7H,EAAA,EACA6hB,EAAAz1L,IAAA,IACQ8zK,EAAA,OACR,CAOA,GAJAF,EAAAA,EAAAknB,EAAA,IACAh0L,EAAA,EAGA8zK,GAAAA,EAAA,CAMA,IALAt1K,EAAA,EACAwuL,EAAAA,CAAA,IACAlgB,IAGA,CAAA9sK,EAAA4zK,GAAAp1K,CAAAA,GAAAsuK,IAAA9sK,IACAnB,EAAAL,EAAAwrC,EAAA+iJ,CAAAA,CAAA,CAAA/sL,EAAA,KACA2uL,CAAA,CAAA3uL,EAAA,CAAAnB,EAAAmuL,EAAA,EACAxuL,EAAAK,EAAAmuL,EAAA,EAGAhgB,EAAAxuK,GAAAwB,EAAA4zK,CAGA,MAiBA,IAdAp1K,CAAAA,EAAAwrC,EAAAgjJ,CAAAA,CAAA,UAEA,IACAA,EAAA0B,EAAA1B,EAAAxuL,EAAAwrC,GACA+iJ,EAAA2B,EAAA3B,EAAAvuL,EAAAwrC,GACA8pI,EAAAkZ,EAAApyL,MAAA,CACAg5K,EAAAmZ,EAAAnyL,MAAA,EAGA+4K,EAAAG,EAEAL,EAAAl7E,CADAA,EAAAw0F,EAAA/xL,KAAA,GAAA84K,EAAA,EACAl5K,MAAA,CAGA64K,EAAAK,GAAAv7E,CAAA,CAAAk7E,IAAA,GAGAM,CADAA,EAAAiZ,EAAAhyL,KAAA,IACAwqD,OAAA,IACAopI,EAAA5B,CAAA,IAEAA,CAAA,KAAAhjJ,EAAA,KAAA4kJ,EAEA,GACApwL,EAAA,EAMA2uK,CAHAA,EAAAz8G,EAAAs8H,EAAAz0F,EAAAu7E,EAAAL,EAAA,EAGA,GAGAC,EAAAn7E,CAAA,IACAu7E,GAAAL,GAAAC,CAAAA,EAAAA,EAAA1pI,EAAAuuD,CAAAA,CAAA,SAaA/5F,CAVAA,EAAAk1K,EAAAkb,EAAA,GAUA,GACApwL,GAAAwrC,GAAAxrC,CAAAA,EAAAwrC,EAAA,GAIAwpI,EAAAD,CADAA,EAAAmb,EAAA1B,EAAAxuL,EAAAwrC,EAAA,EACApvC,MAAA,CACA64K,EAAAl7E,EAAA39F,MAAA,CAMA,GAHAuyK,CAAAA,EAAAz8G,EAAA6iH,EAAAh7E,EAAAi7E,EAAAC,EAAA,IAIAj1K,IAGAgoH,EAAA+sD,EAAAO,EAAAN,EAAAO,EAAAiZ,CAAA,CAAAxZ,EAAAxpI,MAOA,GAAAxrC,GAAA2uK,CAAAA,EAAA3uK,EAAA,GACA+0K,EAAAyZ,EAAAhyL,KAAA,IAGAw4K,CAAAA,EAAAD,EAAA34K,MAAA,EACA64K,GAAAF,EAAA/tH,OAAA,IAGAghE,EAAAjuB,EAAAg7E,EAAAE,EAAAzpI,GAGA,IAAAmjI,IACAsG,EAAAl7E,EAAA39F,MAAA,CAGAuyK,CAAAA,EAAAz8G,EAAAs8H,EAAAz0F,EAAAu7E,EAAAL,EAAA,EAGA,IACAj1K,IAGAgoH,EAAAjuB,EAAAu7E,EAAAL,EAAAM,EAAAiZ,CAAA,CAAAvZ,EAAAzpI,KAIcypI,EAAAl7E,EAAA39F,MAAA,EACd,IAAAuyK,IACA3uK,IACA+5F,EAAiB,KAIjBo2F,CAAA,CAAA3uL,IAAA,CAAAxB,EAGA2uK,GAAA50E,CAAA,IACcA,CAAA,CAAAk7E,IAAA,CAAAsZ,CAAA,CAAApZ,EAAA,KAEdp7E,EAAA,CAAAw0F,CAAA,CAAApZ,EAAA,EACAF,EAAA,SAGA,CAAAE,IAAAC,GAAAr7E,KAAA,IAAAA,CAAA,MAAAu0E,IAAA,CAEAE,EAAAz0E,KAAA,IAAAA,CAAA,IACA,CAGA,KAAAo2F,EAAAn5K,KAAA,EACA,IAGAw+K,GAAAA,EACA/nI,EAAAlrD,CAAA,CAAAA,EACQouL,EAAAniB,MACR,CAGA,IAAAhtK,EAAA,EAAAxB,EAAAmwL,CAAA,IAAAnwL,GAAA,GAAAA,GAAA,GAAAwB,GACAisD,CAAAA,EAAAlrD,CAAA,CAAAf,EAAAe,EAAAizL,EAAA,EAEAvD,EAAAxkI,EAAAqhH,EAAA37H,EAAAsa,EAAAlrD,CAAA,GAAA4wC,CAAA,CAAAo7H,EAAAC,EACA,QAEA/gH,CACG,CACH,IAOA,SAAAwkI,EAAA3zL,CAAA,CAAAgwK,CAAA,CAAAC,CAAA,CAAAknB,CAAA,EACA,IAAAC,EAAAl0L,EAAAkuB,EAAA1vB,EAAAgzK,EAAArb,EAAAtkI,EAAAk7J,EAAAiC,EACA/B,EAAAnwL,EAAAnB,WAAA,CAGAyzF,EAAA,GAAA09E,IAAA,EAAAA,EAAA,CAIA,IAHAigB,CAAAA,EAAAjwL,EAAAxD,CAAA,EAGA,OAAAwD,CAAA,CAWA,IAAAo3L,EAAA,EAAA11L,EAAAuuL,CAAA,IAAAvuL,GAAA,GAAAA,GAAA,GAAA01L,IAIA,GAAAl0L,CAHAA,EAAA8sK,EAAAonB,CAAA,EAGA,EACAl0L,GAAAivK,EACA/gJ,EAAA4+I,EAIQ0E,EAAA3/I,CAHRA,EAAAk7J,CAAA,CAAAiC,EAAA,IAGQpC,EAAA,GAAAsH,EAAAhmK,EAAA,aAIR,GAFA8gK,EAAAt0L,KAAAC,IAAA,EAAAqF,EAAA,GAAAivK,GACAzwK,EAAAuuL,EAAAnyL,MAAA,CACAo0L,GAAAxwL,GACA,GAAAy1L,EAAA,CAGA,KAAAz1L,KAAAwwL,GAAAjC,EAAA7zL,IAAA,IACA24B,EAAA2/I,EAAA,EACA0iB,EAAA,EACAl0L,GAAAivK,EACY/gJ,EAAAluB,EAAAivK,EAAA,CACZ,MACA,MAAA7/E,CAAA,KAEA,CAIA,IAAA8kG,EAAA,EAHAriK,EAAArzB,EAAAuuL,CAAA,CAAAiC,EAAA,CAGAxwL,GAAA,GAAAA,GAAA,GAAA01L,IAGAl0L,GAAAivK,EAOAuC,EAAAtjJ,CAHAA,EAAAluB,EAAAivK,EAAAilB,CAAA,EAGA,IAAAriK,EAAA+6J,EAAA,GAAAsH,EAAAhmK,EAAA,QACA,GAIA+lK,EAAAA,GAAAnnB,EAAA,GACAigB,KAAA,IAAAA,CAAA,CAAAiC,EAAA,IAAA9gK,CAAAA,EAAA,EAAA2D,EAAAA,EAAA+6J,EAAA,GAAAsH,EAAAhmK,EAAA,IAMAioI,EAAA4W,EAAA,EACA,CAAAyE,GAAAyiB,CAAA,GAAAlnB,CAAAA,GAAAA,GAAAA,GAAAjwK,CAAAA,EAAA4B,CAAA,SACA8yK,EAAA,GAAAA,GAAAA,GAAAzE,CAAAA,GAAAA,GAAAknB,GAAAlnB,GAAAA,GAGA,CAAA/sK,EAAA,EAAAkuB,EAAA,EAAA2D,EAAA+6J,EAAA,GAAAsH,EAAAhmK,GAAA,EAAA6+J,CAAA,CAAAiC,EAAA,UACAjiB,GAAAjwK,CAAAA,EAAA4B,CAAA,SAEAouK,EAAA,IAAAigB,CAAA,IAgBA,OAfAA,EAAAnyL,MAAA,GACAu7J,GAGA2W,GAAAhwK,EAAAiE,CAAA,GAGAgsL,CAAA,IAAAH,EAAA,IAAA3d,EAAAnC,EAAAmC,CAAA,EAAAA,GACUnyK,EAAAiE,CAAA,EAAA+rK,GAAA,GAIVigB,CAAA,IAAAjwL,EAAAiE,CAAA,GAGAjE,CACA,CAgBA,GAbAkD,GAAAA,GACA+sL,EAAAnyL,MAAA,CAAAo0L,EACAxwL,EAAA,EACQwwL,MAERjC,EAAAnyL,MAAA,CAAAo0L,EAAA,EACAxwL,EAAAouL,EAAA,GAAA3d,EAAAjvK,GAIA+sL,CAAA,CAAAiC,EAAA,CAAA9gK,EAAA,GAAA2D,EAAA+6J,EAAA,GAAAsH,EAAAhmK,GAAA0+J,EAAA,GAAA1+J,GAAA,GAAA1vB,EAAA,GAGA23J,EACA,QAGA,GAAA64B,GAAAA,EAAA,CAGA,IAAAhvL,EAAA,EAAAkuB,EAAA6+J,CAAA,IAAA7+J,GAAA,GAAAA,GAAA,GAAAluB,IAEA,IADAkuB,EAAA6+J,CAAA,KAAwBvuL,EACxBA,EAAA,EAAA0vB,GAAA,GAAAA,GAAA,GAAA1vB,IAGAwB,GAAAxB,IACA1B,EAAAiE,CAAA,GACAgsL,CAAA,KAAAjrE,GAAAirE,CAAAA,CAAA,QAGY,MAMZ,GAJAA,CAAA,CAAAiC,EAAA,EAAAxwL,EACAuuL,CAAA,CAAAiC,EAAA,EAAAltE,EAAA,MACAirE,CAAA,CAAAiC,IAAA,GACAxwL,EAAA,CAEA,CACA,IAGAwB,EAAA+sL,EAAAnyL,MAAA,CAAAmyL,IAAAA,CAAA,GAAA/sL,EAAA,EAAA+sL,EAAAv/H,GAAA,EACA,QAEAg/H,IAGA1vL,EAAAiE,CAAA,CAAAksL,EAAAwC,IAAA,EAGA3yL,EAAAxD,CAAA,MACAwD,EAAAiE,CAAA,CAAA87F,KAGA//F,EAAAiE,CAAA,CAAAksL,EAAAuC,IAAA,GAGA1yL,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,OAKAwD,CACA,CAGA,SAAA02L,EAAA12L,CAAA,CAAAmyL,CAAA,CAAAniB,CAAA,EACA,IAAAhwK,EAAAilG,QAAA,UAAAoyF,EAAAr3L,EAAA,CACA,IAAA0B,EACAuC,EAAAjE,EAAAiE,CAAA,CACAyjB,EAAA2oK,EAAArwL,EAAAxD,CAAA,EACA85B,EAAA5O,EAAA5pB,MAAA,CAwBA,OAtBAq0L,GACAniB,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,IACQ5O,EAAAA,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,IAAAqyL,EAAA7uL,GACR40B,EAAA,GACA5O,CAAAA,EAAAA,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,KAGMwpB,EAAAA,EAAA1nB,CAAAA,EAAAiE,CAAA,aAAAjE,EAAAiE,CAAA,EACNA,EAAA,GACAyjB,EAAA,KAAA6oK,EAAA,CAAAtsL,EAAA,GAAAyjB,EACMsoJ,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,KAAA5O,CAAAA,GAAA6oK,EAAA7uL,EAAA,GACNuC,GAAAqyB,GACA5O,GAAA6oK,EAAAtsL,EAAA,EAAAqyB,GACM05I,GAAA,CAAAtuK,EAAAsuK,EAAA/rK,EAAA,MAAAyjB,CAAAA,EAAAA,EAAA,IAAA6oK,EAAA7uL,EAAA,IAENA,CAAAA,EAAAuC,EAAA,GAAAqyB,GAAA5O,CAAAA,EAAAA,EAAAxpB,KAAA,GAAAwD,GAAA,IAAAgmB,EAAAxpB,KAAA,CAAAwD,EAAA,EACAsuK,GAAA,CAAAtuK,EAAAsuK,EAAA15I,CAAA,MACAryB,EAAA,IAAAqyB,GAAA5O,CAAAA,GAAA,KACAA,GAAA6oK,EAAA7uL,KAIAgmB,CACA,CAIA,SAAAipK,EAAAyG,CAAA,CAAAnzL,CAAA,EACA,IAAA8wB,EAAAqiK,CAAA,IAGA,IAAAnzL,GAAAkuK,EAAAp9I,GAAA,GAAAA,GAAA,GAAA9wB,IACA,OAAAA,CACA,CAGA,SAAA8tL,EAAA5B,CAAA,CAAAngB,CAAA,CAAAn7H,CAAA,EACA,GAAAm7H,EAAAijB,EAKA,MAFAvD,EAAA,GACA76I,GAAAs7I,CAAAA,EAAA10B,SAAA,CAAA5mH,CAAA,EACAvqC,MAAAsoL,EAAA,CAEA,OAAAe,EAAA,IAAAxD,EAAAV,GAAAzf,EAAA,KACA,CAGA,SAAAmlB,EAAAhF,CAAA,CAAAngB,CAAA,CAAAC,CAAA,EACA,GAAAD,EAAAkjB,EAAA,MAAA5oL,MAAAsoL,EAAA,CACA,OAAAe,EAAA,IAAAxD,EAAA75D,GAAA05C,EAAAC,EAAA,GACA,CAGA,SAAAkmB,EAAAiB,CAAA,EACA,IAAAriK,EAAAqiK,EAAAt5L,MAAA,GACAw4B,EAAAvB,EAAAo9I,EAAA,EAKA,GAHAp9I,EAAAqiK,CAAA,CAAAriK,EAAA,CAGA,CAGA,KAAAA,EAAA,MAAAA,GAAA,GAAAuB,IAGA,IAAAvB,EAAAqiK,CAAA,IAAAriK,GAAA,GAAAA,GAAA,GAAAuB,GACA,QAEAA,CACA,CAGA,SAAAi6J,EAAA7uL,CAAA,EAEA,IADA,IAAAg4K,EAAW,GACXh4K,KAAAg4K,GAAA,IACA,OAAAA,CACA,CAUA,SAAAqd,EAAA5G,CAAA,CAAAnwL,CAAA,CAAA9C,CAAA,CAAA23C,CAAA,EACA,IAAAsiJ,EACAn2L,EAAA,IAAAmvL,EAAA,GAIAzuL,EAAA9D,KAAAC,IAAA,CAAAg3C,EAAAs9H,EAAA,GAIA,IAFAud,EAAA,KAEA,CAOA,GANAxyL,EAAA,GAEAiwG,GAAAnsG,CADAA,EAAAA,EAAAowK,KAAA,CAAApxK,EAAA,EACAxD,CAAA,CAAAkF,IAAAy1L,CAAAA,EAAA,IAIAj6L,IADAA,CAAAA,EAAA80K,EAAA90K,EAAA,IACA,CAGAA,EAAA8D,EAAAxE,CAAA,CAAAsB,MAAA,GACAq5L,GAAAn2L,IAAAA,EAAAxE,CAAA,CAAAU,EAAA,IAAA8D,EAAAxE,CAAA,CAAAU,EAAA,CACA,MACA,GAGA8C,CADAA,EAAAA,EAAAoxK,KAAA,CAAApxK,EAAA,EACAxD,CAAA,CAAAkF,EACA,CAIA,OAFAguL,EAAA,GAEA1uL,CACA,CAGA,SAAAkiH,EAAAhmH,CAAA,EACA,OAAAA,EAAAA,EAAAV,CAAA,CAAAU,EAAAV,CAAA,CAAAsB,MAAA,IAOA,SAAAy2K,EAAA4b,CAAA,CAAA/pL,CAAA,CAAAkxL,CAAA,EAKA,IAJA,IAAAjmK,EACArxB,EAAA,IAAAmwL,EAAA/pL,CAAA,KACAlD,EAAA,EAEA,EAAAA,EAAAkD,EAAAtI,MAAA,EAEA,GAAAuzB,CADAA,EAAA,IAAA8+J,EAAA/pL,CAAA,CAAAlD,EAAA,GACAtB,CAAA,CAGA5B,CAAA,CAAAs3L,EAAA,CAAAjmK,IACArxB,CAAAA,EAAAqxB,CAAAA,MAJA,CACArxB,EAAAqxB,EACQ,MAGR,OAGArxB,CACA,CAkCA,SAAAkxL,EAAAlxL,CAAA,CAAAgwK,CAAA,EACA,IAAA5wH,EAAAsyI,EAAAtgK,EAAA8rB,EAAAogD,EAAAv7F,EAAAkvL,EACAlY,EAAA,EACA71K,EAAA,EACAxB,EAAA,EACAyuL,EAAAnwL,EAAAnB,WAAA,CACAoxK,EAAAkgB,EAAA12B,QAAA,CACA5kH,EAAAs7I,EAAA10B,SAAA,CAGA,IAAAz7J,EAAAxD,CAAA,GAAAwD,EAAAxD,CAAA,KAAAwD,EAAAiE,CAAA,IAEA,WAAAksL,EAAAnwL,EAAAxD,CAAA,CACA,EAAAA,CAAA,IAAAwD,EAAA4B,CAAA,WACA5B,EAAA4B,CAAA,CAAA5B,EAAA4B,CAAA,KAAA5B,CAAA,KACA,CAYA,IAVAgwK,IAAA,EAAAA,GACA0f,EAAA,GACMuB,EAAAp8I,GAENo8I,EAAAjhB,EAGAjuK,EAAA,IAAAouL,EAAA,QAGAnwL,EAAAiE,CAAA,KAGAjE,EAAAA,EAAAoxK,KAAA,CAAArvK,GACAL,GAAA,EAUA,IAJAuvL,GADAS,EAAA9zL,KAAA2zD,GAAA,CAAAu+H,EAAA,EAAApuL,IAAA9D,KAAA6xL,IAAA,OAEArwI,EAAAlC,EAAAogD,EAAA,IAAA6yF,EAAA,GACAA,EAAA10B,SAAA,CAAAw1B,IAEA,CAKA,GAJA/zI,EAAAy2I,EAAAz2I,EAAAk0H,KAAA,CAAApxK,GAAAixL,EAAA,GACA7xI,EAAAA,EAAAgyH,KAAA,GAAAluK,GAGAmtL,EAAAtuL,CAFAA,EAAAu7F,EAAA4zE,IAAA,CAAA/V,EAAAj+G,EAAAkC,EAAA6xI,EAAA,KAEAz0L,CAAA,EAAA0B,KAAA,GAAA+yL,KAAAZ,EAAA/yF,EAAA9gG,CAAA,EAAA0B,KAAA,GAAA+yL,GAAA,CAEA,IADA7/J,EAAA1vB,EACA0vB,KAAAksE,EAAAq2F,EAAAr2F,EAAA8zE,KAAA,CAAA9zE,GAAA2zF,EAAA,GAOA,GAAAjhB,IAAA,EAAAA,EAYA,OADAmgB,EAAA10B,SAAA,CAAA5mH,EACAyoD,CACA,CAXA,IAAAy7E,CAAAA,EAAA,GAAAoa,EAAA71F,EAAA9gG,CAAA,CAAAy0L,EAAAS,EAAAzhB,EAAA8I,EAAA,EAMA,OAAA4a,EAAAr2F,EAAA6yF,EAAA10B,SAAA,CAAA5mH,EAAAo7H,EAAAyf,EAAA,GACU,CANVS,EAAA10B,SAAA,CAAAw1B,GAAA,GACA7xI,EAAAlC,EAAAn7C,EAAA,IAAAouL,EAAA,GACAjtL,EAAA,EACY61K,GAQZ,GAEAh3K,CACA,CACA,CAkBA,SAAAovL,EAAA9/J,CAAA,CAAA2+I,CAAA,EACA,IAAArrH,EAAAyvH,EAAAh1H,EAAAn7C,EAAAk7C,EAAA45H,EAAAz7E,EAAAv7F,EAAAkvL,EAAA7J,EAAAv6D,EACA3vH,EAAA,EACAw0L,EAAA,GACA1xL,EAAAqxB,EACA4+J,EAAAjwL,EAAAxD,CAAA,CACA2zL,EAAAnwL,EAAAnB,WAAA,CACAoxK,EAAAkgB,EAAA12B,QAAA,CACA5kH,EAAAs7I,EAAA10B,SAAA,CAGA,GAAAz7J,EAAA4B,CAAA,KAAAquL,GAAA,CAAAA,CAAA,MAAAjwL,EAAAiE,CAAA,EAAAgsL,GAAAA,CAAA,KAAAA,GAAAA,EAAAnyL,MAAA,CACA,WAAAqyL,EAAAF,GAAA,CAAAA,CAAA,SAAAjwL,GAAAA,EAAA4B,CAAA,CAAAm+F,IAAAkwF,EAAA,EAAAjwL,CAAA,CACA,CAaA,GAXAgwK,IAAA,EAAAA,GACA0f,EAAA,GACMuB,EAAAp8I,GAENo8I,EAAAjhB,EAGAmgB,EAAA10B,SAAA,CAAAw1B,GAAAS,EAEAtd,EAAAzvH,CADAA,EAAA0rI,EAAAJ,EAAA,EACA1oK,MAAA,KAEA3pB,CAAAA,MAAAA,KAAA+uB,GAAA,CAAA1oB,EAAAjE,EAAAiE,CAAA,GAqCA,OAJAlC,EAAAgwL,EAAA5B,EAAAc,EAAA,EAAAp8I,GAAAu8H,KAAA,CAAAntK,EAAA,IACAjE,EAAAmxL,EAAA,IAAAhB,EAAA/b,EAAA,IAAAzvH,EAAAzmD,KAAA,KAAA+yL,EAAAS,GAAAxgB,IAAA,CAAAnvK,GACAouL,EAAA10B,SAAA,CAAA5mH,EAEAm7H,IAAA,EAAAA,EAAA2jB,EAAA3zL,EAAA60C,EAAAo7H,EAAAyf,EAAA,IAAA1vL,CAAA,CAxBA,KAAAo0K,EAAA,GAAAA,GAAAA,GAAAA,GAAAA,GAAAzvH,EAAAp9B,MAAA,OAGA6sJ,EAAAzvH,CADAA,EAAA0rI,EAAArwL,CADAA,EAAAA,EAAAoxK,KAAA,CAAA//I,EAAA,EACA70B,CAAA,GACA+qB,MAAA,IACArqB,IAiCA,IA9BA+G,EAAAjE,EAAAiE,CAAA,CAEAmwK,EAAA,GACAp0K,EAAA,IAAAmwL,EAAA,KAAAxrI,GACQ1gD,KAERjE,EAAA,IAAAmwL,EAAA/b,EAAA,IAAAzvH,EAAAzmD,KAAA,KAeAkpL,EAAApnL,EAKAs9F,EAAAn+C,EAAAn/C,EAAAm7J,EAAAn7J,EAAAgxK,KAAA,IAAAhxK,EAAAkxK,IAAA,IAAA+f,EAAA,GACApkE,EAAA8mE,EAAA3zL,EAAAoxK,KAAA,CAAApxK,GAAAixL,EAAA,GACA7xI,EAAA,IAEA,CAIA,GAHAD,EAAAw0I,EAAAx0I,EAAAiyH,KAAA,CAAAvkD,GAAAokE,EAAA,GAGAZ,EAAAtuL,CAFAA,EAAAu7F,EAAA4zE,IAAA,CAAA/V,EAAAh8G,EAAA,IAAAgxI,EAAA/wI,GAAA6xI,EAAA,KAEAz0L,CAAA,EAAA0B,KAAA,GAAA+yL,KAAAZ,EAAA/yF,EAAA9gG,CAAA,EAAA0B,KAAA,GAAA+yL,GAAA,CAcA,GAbA3zF,EAAAA,EAAA8zE,KAAA,IAIA,IAAAntK,GAAAq5F,CAAAA,EAAAA,EAAA4zE,IAAA,CAAA6gB,EAAA5B,EAAAc,EAAA,EAAAp8I,GAAAu8H,KAAA,CAAAntK,EAAA,MACAq5F,EAAA69D,EAAA79D,EAAA,IAAA6yF,EAAAjzL,GAAA+zL,EAAA,GAQAjhB,IAAA,EAAAA,EAWA,OADAmgB,EAAA10B,SAAA,CAAA5mH,EACAyoD,CACA,CAXA,IAAA61F,EAAA71F,EAAA9gG,CAAA,CAAAy0L,EAAAS,EAAAzhB,EAAA8I,GAMA,OAAA4a,EAAAr2F,EAAA6yF,EAAA10B,SAAA,CAAA5mH,EAAAo7H,EAAAyf,EAAA,GACU,CANVS,EAAA10B,SAAA,CAAAw1B,GAAAS,EACA3vL,EAAAo9C,EAAAn/C,EAAAm7J,EAAAisB,EAAApW,KAAA,IAAAoW,EAAAlW,IAAA,IAAA+f,EAAA,GACApkE,EAAA8mE,EAAA3zL,EAAAoxK,KAAA,CAAApxK,GAAAixL,EAAA,GACY7xI,EAAA25H,EAAA,CAQZ,GAEAh3K,EACAq9C,GAAA,CACA,CACA,CAIA,SAAAi4I,EAAAr3L,CAAA,EAEA,OAAAgd,OAAAhd,EAAA4B,CAAA,CAAA5B,EAAA4B,CAAA,GACA,CAMA,SAAAowL,EAAAhyL,CAAA,CAAA0nB,CAAA,EACA,IAAAzjB,EAAAf,EAAAozB,EAmBA,IAhBAryB,CAAAA,EAAAyjB,EAAA5K,OAAA,WAAA4K,CAAAA,EAAAA,EAAAxG,OAAA,UAGA,CAAAhe,EAAAwkB,EAAA4F,MAAA,WAGArpB,EAAA,GAAAA,CAAAA,EAAAf,CAAAA,EACAe,GAAA,CAAAyjB,EAAAxpB,KAAA,CAAAgF,EAAA,GACMwkB,EAAAA,EAAA+hB,SAAA,GAAAvmC,IACNe,EAAA,GAGAA,CAAAA,EAAAyjB,EAAA5pB,MAAA,EAIAoF,EAAA,EAAAwkB,KAAAA,EAAA6F,UAAA,CAAArqB,GAAAA,KAGA,IAAAozB,EAAA5O,EAAA5pB,MAAA,CAAA4pB,KAAAA,EAAA6F,UAAA,CAAA+I,EAAA,KAAAA,GAGA,GAFA5O,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAAozB,GAEA,CAYA,GAXAA,GAAApzB,EACAlD,EAAAiE,CAAA,CAAAA,EAAAA,EAAAf,EAAA,EACAlD,EAAAxD,CAAA,IAMA0G,EAAA,CAAAe,EAAA,GAAAkuK,EACAluK,EAAA,GAAAf,CAAAA,GAAAivK,CAAA,EAEAjvK,EAAAozB,EAAA,CAEA,IADApzB,GAAAlD,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,EAAAxpB,KAA8B,GAAQgF,IACtCozB,GAAA67I,EAAAjvK,EAAAozB,GAAAt2B,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,EAAAxpB,KAAA,CAAAgF,EAAAA,GAAAivK,IAEQjvK,EAAAivK,EAAAzqJ,CADRA,EAAAA,EAAAxpB,KAAA,CAAAgF,EAAA,EACQpF,MAAA,MAERoF,GAAAozB,CACA,CAEA,KAAApzB,KAAAwkB,GAAA,IACA1nB,EAAAxD,CAAA,CAAAJ,IAAA,EAAAsrB,GAEAgoK,IAGA1vL,EAAAiE,CAAA,CAAAjE,EAAAnB,WAAA,CAAA8zL,IAAA,EAGA3yL,EAAAxD,CAAA,MACAwD,EAAAiE,CAAA,CAAA87F,KAGA//F,EAAAiE,CAAA,CAAAjE,EAAAnB,WAAA,CAAA6zL,IAAA,GAGA1yL,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,MAIA,MAGAwD,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,KAGA,OAAAwD,CACA,CAMA,SAAAu3L,EAAAv3L,CAAA,CAAA0nB,CAAA,EACA,IAAAwlB,EAAAijJ,EAAAqH,EAAAt0L,EAAAu0L,EAAAnhK,EAAA3R,EAAAsrK,EAAAh4H,EAEA,GAAAvwC,EAAA5K,OAAA,SAEM,IADN4K,EAAAA,EAAAxG,OAAA,sBACM6uK,EAAA9yK,IAAA,CAAAyK,GAAA,OAAAsqK,EAAAhyL,EAAA0nB,EAAA,MACN,GAAAA,aAAAA,GAAAA,QAAAA,EAIA,MAHA,CAAAA,GAAA1nB,CAAAA,EAAA4B,CAAA,CAAAm+F,GAAA,EACA//F,EAAAiE,CAAA,CAAA87F,IACA//F,EAAAxD,CAAA,MACAwD,CACA,CAEA,GAAA+yL,EAAA91K,IAAA,CAAAyK,GACAwlB,EAAA,GACMxlB,EAAAA,EAAAxK,WAAA,QACN,GAAA41K,EAAA71K,IAAA,CAAAyK,GACMwlB,EAAA,OACN,GAAA8lJ,EAAA/1K,IAAA,CAAAyK,GACMwlB,EAAA,OAEN,MAAA5iC,MAAAslL,EAAAloK,EAAA,CAgCA,IA1BAxkB,CAFAA,EAAAwkB,EAAA4F,MAAA,QAEA,GACA3I,EAAA,CAAA+C,EAAAxpB,KAAA,CAAAgF,EAAA,GACMwkB,EAAAA,EAAA+hB,SAAA,GAAAvmC,IAENwkB,EAAAA,EAAAxpB,KAAA,IAMAu5L,EAAAv0L,CADAA,EAAAwkB,EAAA5K,OAAA,QACA,EACAqzK,EAAAnwL,EAAAnB,WAAA,CAEA44L,IAGAv0L,EAAAozB,CADAA,EAAA5O,CADAA,EAAAA,EAAAxG,OAAA,UACApjB,MAAA,EACAoF,EAGAs0L,EAAAT,EAAA5G,EAAA,IAAAA,EAAAjjJ,GAAAhqC,EAAAA,EAAAA,IAOAA,EAHA+0D,EAAAg4H,CADAA,EAAAld,EAAArrJ,EAAAwlB,EAAA83E,EAAA,EACAlnH,MAAA,GAGAmyL,IAAAA,CAAA,CAAA/sL,EAAA,GAAAA,EAAA+sL,EAAAv/H,GAAA,UACA,QAAAy/H,EAAAnwL,EAAAA,EAAA4B,CAAA,GACA5B,EAAAiE,CAAA,CAAA0sL,EAAAV,EAAAh4H,GACAj4D,EAAAxD,CAAA,CAAAyzL,EACAP,EAAA,GAQA+H,GAAAz3L,CAAAA,EAAAm7J,EAAAn7J,EAAAw3L,EAAAlhK,EAAAA,EAAA,EAGA3R,GAAA3kB,CAAAA,EAAAA,EAAAoxK,KAAA,CAAAxzK,GAAAA,KAAA+uB,GAAA,CAAAhI,GAAAmrK,EAAA,EAAAnrK,GAAA2qK,EAAApyI,GAAA,GAAAv4B,EAAA,GACA+qK,EAAA,GAEA1vL,EAjBA,CA0BA,SAAAo2L,EAAAjG,CAAA,CAAAnwL,CAAA,EACA,IAAA0B,EACA40B,EAAAt2B,EAAAxD,CAAA,CAAAsB,MAAA,CAEA,GAAAw4B,EAAA,EACA,OAAAt2B,EAAA+7J,MAAA,GAAA/7J,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAA,EAAA,CASA0B,EAAAA,CADAA,EAAA,IAAA9D,KAAA6lH,IAAA,CAAAntF,EAAA,EACA,MAAA50B,EAAAA,CAAA,CAEA1B,EAAAA,EAAAoxK,KAAA,GAAAoiB,GAAA,EAAA9xL,IACA1B,EAAAyzL,GAAAtD,EAAA,EAAAnwL,EAAAA,GAOA,IAJA,IAAA03L,EACA/C,EAAA,IAAAxE,EAAA,GACAyE,EAAA,IAAAzE,EAAA,IACA0E,EAAW,IAAI1E,EAAA,IACfzuL,KACAg2L,EAAA13L,EAAAoxK,KAAA,CAAApxK,GACAA,EAAAA,EAAAoxK,KAAA,CAAAujB,EAAAzjB,IAAA,CAAAwmB,EAAAtmB,KAAA,CAAAwjB,EAAAxjB,KAAA,CAAAsmB,GAAA1mB,KAAA,CAAA6jB,MAGA,OAAA70L,CACA,CAIA,SAAAyzL,GAAAtD,CAAA,CAAAjzL,CAAA,CAAA8C,CAAA,CAAAqxB,CAAA,CAAAsmK,CAAA,EACA,IAAAvmK,EAAArvB,EAAA8sD,EAAAg+D,EAEAh4E,EAAAs7I,EAAA10B,SAAA,CACA/5J,EAAA9D,KAAAC,IAAA,CAAAg3C,EAAAs9H,GAMA,IAJAud,EAAA,GACA7iE,EAAA7sH,EAAAoxK,KAAA,CAAApxK,GACA6uD,EAAA,IAAAshI,EAAA9+J,KAEA,CAMA,GALAtvB,EAAAo5J,EAAAtsG,EAAAuiH,KAAA,CAAAvkD,GAAA,IAAAsjE,EAAAjzL,IAAAA,KAAA23C,EAAA,GACAga,EAAA8oI,EAAAtmK,EAAA6/I,IAAA,CAAAnvK,GAAAsvB,EAAA2/I,KAAA,CAAAjvK,EAAA,CACAsvB,EAAA8pI,EAAAp5J,EAAAqvK,KAAA,CAAAvkD,GAAA,IAAAsjE,EAAAjzL,IAAAA,KAAA23C,EAAA,GAGA9yC,KAAoB,IAApBA,CAFAA,EAAA8sD,EAAAqiH,IAAA,CAAA7/I,EAAA,EAEA70B,CAAA,CAAAkF,EAAA,CAAoB,CACpB,IAAA0vB,EAAA1vB,EAAAK,EAAAvF,CAAA,CAAA40B,EAAA,GAAAy9B,EAAAryD,CAAA,CAAA40B,EAAA,EAAAA,MACA,GAAAA,IAAAA,EAAA,MACA,EAEAy9B,EACAA,EAAAx9B,EACAA,EAAAtvB,EACAA,EAAAqvB,CAEA,CAKA,OAHAs+J,EAAA,GACA3tL,EAAAvF,CAAA,CAAAsB,MAAA,CAAA4D,EAAA,EAEAK,CACA,CAIA,SAAAyxL,GAAA59K,CAAA,CAAA3R,CAAA,EAEA,IADA,IAAA/G,EAAA0Y,EACA,EAAA3R,GAAA/G,GAAA0Y,EACA,OAAA1Y,CACA,CAIA,SAAA62L,GAAA5D,CAAA,CAAAnwL,CAAA,EACA,IAAA+B,EACAu7C,EAAAt9C,EAAA4B,CAAA,GACAg2L,EAAAzC,EAAAhF,EAAAA,EAAA10B,SAAA,IACAy5B,EAAA0C,EAAAxmB,KAAA,KAIA,GAAApxK,CAFAA,EAAAA,EAAA2sB,GAAA,IAEAokJ,GAAA,CAAAmkB,GAEA,OADA5C,EAAAh1I,EAAA,IACAt9C,CACA,CAIA,GAAA+B,CAFAA,EAAA/B,EAAAm0L,QAAA,CAAAyD,EAAA,EAEA77B,MAAA,GACMu2B,EAAAh1I,EAAA,QACN,CAIA,GAAAt9C,CAHAA,EAAAA,EAAAgxK,KAAA,CAAAjvK,EAAAqvK,KAAA,CAAAwmB,GAAA,EAGA7mB,GAAA,CAAAmkB,GAEA,OADA5C,EAAApvE,EAAAnhH,GAAAu7C,EAAA,IAAAA,EAAA,IACAt9C,CACA,CAEAsyL,EAAApvE,EAAAnhH,GAAAu7C,EAAA,IAAAA,EAAA,IACA,OAEAt9C,EAAAgxK,KAAA,CAAA4mB,GAAAjrK,GAAA,EACA,CAQA,SAAA6pK,GAAAx2L,CAAA,CAAA+1K,CAAA,CAAA/F,CAAA,CAAAC,CAAA,EACA,IAAA/iI,EAAAjpC,EAAAf,EAAAxB,EAAA40B,EAAA+iI,EAAA3xI,EAAAuoK,EAAA5+J,EACA8+J,EAAAnwL,EAAAnB,WAAA,CACAszL,EAAAniB,KAAA,IAAAA,EAWA,GATAmiB,GACA/B,EAAApgB,EAAA,EAAAqf,GACApf,KAAA,IAAAA,EAAAA,EAAAkgB,EAAA12B,QAAA,CACM22B,EAAAngB,EAAA,OAEND,EAAAmgB,EAAA10B,SAAA,CACAwU,EAAAkgB,EAAA12B,QAAA,EAGAz5J,EAAAilG,QAAA,GAEA,CAoCA,IAlCA/hG,EAAAwkB,CADAA,EAAAgvK,EAAA12L,EAAA,EACA8c,OAAA,MAOAq1K,GACAjlJ,EAAA,EACA6oI,IAAAA,EACU/F,EAAAA,EAAAA,EAAA,EACV,GAAA+F,GACA/F,CAAAA,EAAAA,EAAAA,EAAA,IAGA9iI,EAAA6oI,EAOA7yK,GAAA,IACAwkB,EAAAA,EAAAxG,OAAA,SAEAmQ,CADAA,EAAA,IAAA8+J,EAAA,IACAlsL,CAAA,CAAAyjB,EAAA5pB,MAAA,CAAAoF,EACAmuB,EAAA70B,CAAA,CAAAu2K,EAAA2jB,EAAArlK,GAAA,GAAA6b,GACA7b,EAAAptB,CAAA,CAAAotB,EAAA70B,CAAA,CAAAsB,MAAA,EAIAmG,EAAAqyB,EAAA25J,CADAA,EAAAld,EAAArrJ,EAAA,GAAAwlB,EAAA,EACApvC,MAAA,CAGAmyL,GAAAA,CAAA,GAAA35J,EAAA,EAAA25J,EAAAv/H,GAAA,GAEA,GAAAu/H,CAAA,IAEA,CAyBA,GAxBA/sL,EAAA,EACUe,KAGVjE,CADAA,EAAA,IAAAmwL,EAAAnwL,EAAA,EACAxD,CAAA,CAAAyzL,EACAjwL,EAAAiE,CAAA,CAAAA,EAEAgsL,EAAAjwL,CADAA,EAAAm7J,EAAAn7J,EAAAqxB,EAAA2+I,EAAAC,EAAA,EAAA/iI,EAAA,EACA1wC,CAAA,CACAyH,EAAAjE,EAAAiE,CAAA,CACAo1J,EAAAg5B,GAIAnvL,EAAA+sL,CAAA,CAAAjgB,EAAA,CACAtuK,EAAAwrC,EAAA,EACAmsH,EAAAA,GAAA42B,KAAA,IAAAA,CAAA,CAAAjgB,EAAA,GAEA3W,EAAA4W,EAAA,EACA,CAAA/sK,KAAA,IAAAA,GAAAm2J,CAAA,GAAA4W,CAAAA,IAAAA,GAAAA,IAAAjwK,CAAAA,EAAA4B,CAAA,SACAsB,EAAAxB,GAAAwB,IAAAxB,GAAAuuK,CAAAA,IAAAA,GAAA5W,GAAA4W,IAAAA,GAAAggB,EAAAA,CAAA,CAAAjgB,EAAA,IACAC,IAAAjwK,CAAAA,EAAA4B,CAAA,SAEAquL,EAAAnyL,MAAA,CAAAkyK,EAEA3W,EAGA,OAAA42B,CAAA,GAAAjgB,EAAA,CAAA9iI,EAAA,GACA+iJ,CAAA,CAAAjgB,EAAA,GACAA,IACA,EAAA/rK,EACAgsL,EAAAvnI,OAAA,IAGA,CAGA,IAAApyB,EAAA25J,EAAAnyL,MAAA,EAAAmyL,CAAA,CAAA35J,EAAA,KAAAA,GAGA,IAAApzB,EAAA,EAAAwkB,EAAA,GAAAxkB,EAAAozB,EAAApzB,IAAAwkB,GAAA8qK,EAAAjrK,MAAA,CAAA0oK,CAAA,CAAA/sL,EAAA,EAGA,GAAAivL,EAAA,CACA,GAAA77J,EAAA,GACA,GAAAy/I,IAAAA,GAAAA,GAAAA,EAAA,CAEA,IADA7yK,EAAA6yK,IAAAA,EAA0B,EAAS,EACnC,EAAAz/I,EAAAA,EAAApzB,EAAAozB,IAAA5O,GAAA,IAEA,IAAA4O,EAAA25J,CADAA,EAAAld,EAAArrJ,EAAoCwlB,EAAA6oI,EAAA,EACpCj4K,MAAA,EAAAmyL,CAAA,CAAA35J,EAAA,KAAAA,GAGc,IAAApzB,EAAA,EAAAwkB,EAAA,KAAAxkB,EAAAozB,EAAApzB,IAAAwkB,GAAA8qK,EAAAjrK,MAAA,CAAA0oK,CAAA,CAAA/sL,EAAA,CACd,MACAwkB,EAAAA,EAAAH,MAAA,QAAAG,EAAAxpB,KAAA,GACA,CACA,EAEUwpB,EAAAzjB,CAAAA,EAAA,YAAAA,CACV,SAAiBA,EAAI,GACrB,OAAAA,GAAAyjB,EAAA,IAAAA,EACUA,EAAA,KAAAA,CACV,MACA,KAAAzjB,EAAAqyB,EAAA,IAAAryB,GAAAqyB,EAAAryB,KAAAyjB,GAAA,SACAzjB,EAAAqyB,GAAA5O,CAAAA,EAAAA,EAAAxpB,KAAA,GAAA+F,GAAA,IAAAyjB,EAAAxpB,KAAA,CAAA+F,EAAA,OAlEQyjB,EAAAyqK,EAAA,WAsERzqK,EAAA,CAAAquJ,IAAAA,EAAA,KAAAA,GAAAA,EAAA,KAAAA,GAAAA,EAAA,SAAAruJ,CACA,MA/GMA,EAAA2vK,EAAAr3L,EA+GN,CAEA,OAAAA,EAAA4B,CAAA,OAAA8lB,EAAAA,CAAA,CAKA,SAAAylF,GAAAziC,CAAA,CAAAp0C,CAAA,EACA,GAAAo0C,EAAA5sE,MAAA,CAAAw4B,EAEA,OADAo0C,EAAA5sE,MAAA,CAAAw4B,EACA,EACA,CA0DA,SAAA3J,GAAA3sB,CAAA,EACA,gBAAAA,GAAA2sB,GAAA,EACA,CASA,SAAAsoK,GAAAj1L,CAAA,EACA,gBAAAA,GAAAi1L,IAAA,EACA,CAUA,SAAAK,GAAAt1L,CAAA,EACA,gBAAAA,GAAAs1L,KAAA,EACA,CAWA,SAAAnzL,GAAAnC,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAkxK,IAAA,CAAA7/I,EACA,CAUA,SAAA+jK,GAAAp1L,CAAA,EACA,gBAAAA,GAAAo1L,IAAA,EACA,CAUA,SAAAI,GAAAx1L,CAAA,EACA,gBAAAA,GAAAw1L,KAAA,EACA,CAUA,SAAAK,GAAA71L,CAAA,EACA,gBAAAA,GAAA61L,IAAA,EACA,CAUA,SAAAH,GAAA11L,CAAA,EACA,gBAAAA,GAAA01L,KAAA,EACA,CA4BA,SAAAmC,GAAAxmK,CAAA,CAAArxB,CAAA,EACAqxB,EAAA,SAAAA,GACArxB,EAAA,SAAAA,GACA,IAAAgB,EACA6zC,EAAA,KAAA4mH,SAAA,CACAwU,EAAA,KAAAxW,QAAA,CACAw3B,EAAAp8I,EAAA,EAkCA,OA/BA,EAAAjzC,CAAA,EAAA5B,EAAA4B,CAAA,CAIA,EAAApF,CAAA,EAAAwD,EAAAxD,CAAA,CAKA,CAAAwD,EAAAxD,CAAA,EAAA60B,EAAA0qI,MAAA,GAEA/6J,CADAA,EAAAhB,EAAA4B,CAAA,GAAAuzL,EAAA,KAAAtgJ,EAAAo7H,GAAA,aACAruK,CAAA,CAAAyvB,EAAAzvB,CAAA,CAGA,CAAAyvB,EAAA70B,CAAA,EAAAwD,EAAA+7J,MAAA,GAEA/6J,CADAA,EAAAm0L,EAAA,KAAAlE,EAAA,GAAA7f,KAAA,MACAxvK,CAAA,CAAAyvB,EAAAzvB,CAAA,CAGA5B,EAAA4B,CAAA,IACA,KAAA65J,SAAA,CAAAw1B,EACA,KAAAx3B,QAAA,GACAz4J,EAAA,KAAA60L,IAAA,CAAA16B,EAAA9pI,EAAArxB,EAAAixL,EAAA,IACAjxL,EAAAm1L,EAAA,KAAAlE,EAAA,GACA,KAAAx1B,SAAA,CAAA5mH,EACA,KAAA4kH,QAAA,CAAAwW,EACMjvK,EAAAqwB,EAAAzvB,CAAA,GAAAZ,EAAAgwK,KAAA,CAAAhxK,GAAAgB,EAAAkwK,IAAA,CAAAlxK,EAAA,EAENgB,EAAA,KAAA60L,IAAA,CAAA16B,EAAA9pI,EAAArxB,EAAAixL,EAAA,IAtBAjwL,CADAA,EAAAm0L,EAAA,KAAAlE,EAAA,GAAA7f,KAAA,CAAApxK,EAAA4B,CAAA,aACAA,CAAA,CAAAyvB,EAAAzvB,CAAA,CALAZ,EAAA,SAAA++F,KA8BA/+F,CACA,CAUA,SAAAizL,GAAAj0L,CAAA,EACA,gBAAAA,GAAAi0L,IAAA,EACA,CASA,SAAAp2L,GAAAmC,CAAA,EACA,OAAA2zL,EAAA3zL,EAAA,SAAAA,GAAAA,EAAAiE,CAAA,KACA,CAWA,SAAA4vL,GAAA7zL,CAAA,CAAAgpC,CAAA,CAAAC,CAAA,EACA,gBAAAjpC,GAAA6zL,KAAA,CAAA7qJ,EAAAC,EACA,CAqBA,SAAAnjC,GAAAyW,CAAA,EACA,IAAAA,GAAA,iBAAAA,EAAA,MAAAjS,MAAAqlL,EAAA,mBACA,IAAAzsL,EAAAyhB,EAAAhjB,EACAm2L,EAAAv7K,CAAA,IAAAA,EAAAw7K,QAAA,CACA3F,EAAA,CACA,cAAA/C,EACA,eACA,YAAAkD,EAAA,EACA,aAAAA,EACA,SAAAA,EACA,QAAAA,EAAA,EACA,aACA,CAEA,IAAArvL,EAAA,EAAAA,EAAAkvL,EAAAt0L,MAAA,CAAAoF,GAAA,EAEA,GADAyhB,EAAAytK,CAAA,CAAAlvL,EAAA,CAAAyhB,GAAA,MAAAA,EAAA,CAAA8tK,CAAA,CAAA9tK,EAAA,EACA,SAAAhjB,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,GACA,GAAAqtJ,EAAArwK,KAAAA,GAAAA,GAAAywL,CAAA,CAAAlvL,EAAA,IAAAvB,GAAAywL,CAAA,CAAAlvL,EAAA,QAAAyhB,EAAA,CAAAhjB,OACA,MAAA2I,MAAAslL,EAAAjrK,EAAA,KAAAhjB,EAAA,CACA,GAGAgjB,EAAA,SAAAA,GAAA,MAAAA,EAAA,CAAA8tK,CAAA,CAAA9tK,EAAA,EACA,SAAAhjB,CAAAA,EAAA4a,CAAA,CAAAoI,EAAA,GACA,GAAAhjB,CAAA,IAAAA,GAAAA,CAAA,IAAAA,GAAAA,IAAAA,GAAAA,IAAAA,GACA,GAAAA,GACA,uBAAAwzK,QAAAA,QACAA,CAAAA,OAAAC,eAAA,EAAAD,OAAA5uD,WAAA,EACY,KAAA5hG,EAAA,SAEZ,MAAAra,MAAAuoL,EAAA,MAGA,KAAAluK,EAAA,GACQ,MAER,MAAAra,MAAAslL,EAAAjrK,EAAA,KAAAhjB,EAAA,CAEA,OAEA,KAWA,SAAA0hL,GAAArjL,CAAA,EACA,gBAAAA,GAAAqjL,GAAA,EACA,CAUA,SAAAgR,GAAAr0L,CAAA,EACA,gBAAAA,GAAAq0L,IAAA,EACA,CAQA,SAAAxyK,GAAAtF,CAAA,EACA,IAAArZ,EAAAyhB,EAAAytK,EASA,SAAA9C,EAAA3tL,CAAA,EACA,IAAAsC,EAAAf,EAAAnB,EACA/B,EAAA,KAGA,IAAAA,CAAAA,aAAAsvL,CAAA,aAAAA,EAAA3tL,EAAA,CAOA,GAHA3B,EAAAnB,WAAA,CAAAywL,EAGA0I,GAAAr2L,GAAA,CACA3B,EAAA4B,CAAA,CAAAD,EAAAC,CAAA,CAEA8tL,EACA,CAAA/tL,EAAAnF,CAAA,EAAAmF,EAAAsC,CAAA,CAAAqrL,EAAAqD,IAAA,EAGA3yL,EAAAiE,CAAA,CAAA87F,IACY//F,EAAAxD,CAAA,OACZmF,EAAAsC,CAAA,CAAAqrL,EAAAoD,IAAA,EAGA1yL,EAAAiE,CAAA,GACYjE,EAAAxD,CAAA,OAEZwD,EAAAiE,CAAA,CAAAtC,EAAAsC,CAAA,CACAjE,EAAAxD,CAAA,CAAAmF,EAAAnF,CAAA,CAAA0B,KAAA,KAGA8B,EAAAiE,CAAA,CAAAtC,EAAAsC,CAAA,CACAjE,EAAAxD,CAAA,CAAAmF,EAAAnF,CAAA,CAAAmF,EAAAnF,CAAA,CAAA0B,KAAA,GAAAyD,EAAAnF,CAAA,EAGA,MACA,IAIAuF,UAFAA,CAAAA,EAAA,OAAAJ,CAAAA,EAEA,CACA,GAAAA,IAAAA,EAAA,CACA3B,EAAA4B,CAAA,GAAAD,EAAA,OACA3B,EAAAiE,CAAA,GACAjE,EAAAxD,CAAA,KACA,MACA,IAEAmF,EAAA,GACAA,EAAA,CAAAA,EACU3B,EAAA4B,CAAA,KAEV5B,EAAA4B,CAAA,GAIAD,IAAA,EAAAA,GAAAA,EAA6B,KAC7B,IAAAsC,EAAA,EAAAf,EAAAvB,CAAA,CAAAuB,GAAA,GAAAA,GAAA,GAAAe,IAEAyrL,EACAzrL,EAAAqrL,EAAAqD,IAAA,EACA3yL,EAAAiE,CAAA,CAAA87F,IACc//F,EAAAxD,CAAA,OACdyH,EAAAqrL,EAAAoD,IAAA,EACA1yL,EAAAiE,CAAA,GACcjE,EAAAxD,CAAA,OAEdwD,EAAAiE,CAAA,CAAAA,EACAjE,EAAAxD,CAAA,EAAAmF,EAAA,GAGA3B,EAAAiE,CAAA,CAAAA,EACAjE,EAAAxD,CAAA,EAAAmF,EAAA,EAGA,MAGA,CAKA,GALAA,EAAAA,GAAA,GACAA,GAAA3B,CAAAA,EAAA4B,CAAA,CAAAm+F,GAAA,EACA//F,EAAAiE,CAAA,CAAA87F,IACA//F,EAAAxD,CAAA,MACA,MACA,QAEAw1L,EAAAhyL,EAAA2B,EAAAkE,QAAA,GAEA,CAEA,GAFA9D,WAAAA,EACA,MAAAuI,MAAAslL,EAAAjuL,EAAA,CAaA,OATA,KAAAuB,CAAAA,EAAAvB,EAAA4rB,UAAA,MACA5rB,EAAAA,EAAAzD,KAAA,IACQ8B,EAAA4B,CAAA,MAGR,KAAAsB,GAAAvB,CAAAA,EAAAA,EAAAzD,KAAA,KACA8B,EAAA4B,CAAA,IAGAmuL,EAAA9yK,IAAA,CAAAtb,GAAAqwL,EAAAhyL,EAAA2B,GAAA41L,EAAAv3L,EAAA2B,EAAA,CA4DA,GAzDA2tL,EAAAjkL,SAAA,CAAAy1C,EAEAwuI,EAAAr2B,QAAA,GACAq2B,EAAAv2B,UAAA,GACAu2B,EAAA1a,UAAA,GACA0a,EAAAza,WAAA,GACAya,EAAAt2B,aAAA,GACAs2B,EAAAxa,eAAA,GACAwa,EAAAva,eAAA,GACAua,EAAAta,eAAA,GACAsa,EAAAra,gBAAA,GACAqa,EAAApa,MAAA,GAEAoa,EAAAxpL,MAAA,CAAAwpL,EAAArtL,GAAA,CAAA6D,GACAwpL,EAAAztK,KAAA,CAAAA,GACAytK,EAAAS,SAAA,CAAAiI,GAEA1I,EAAA3iK,GAAA,CAAAA,GACA2iK,EAAA2F,IAAA,CAAAA,GACA3F,EAAAgG,KAAA,CAAAA,GACAhG,EAAAntL,GAAA,CAAAA,GACAmtL,EAAA8F,IAAA,CAAAA,GACA9F,EAAAkG,KAAA,CAAAA,GACAlG,EAAAuG,IAAA,CAAAA,GACAvG,EAAAoG,KAAA,CAAAA,GACApG,EAAAuI,KAAA,CAAAA,GACAvI,EAAA2E,IAAA,CAAAA,GACA3E,EAAAzxL,IAAA,CAAAA,GACAyxL,EAAAuE,KAAA,CAAAA,GACAvE,EAAAjM,GAAA,CAAAA,GACAiM,EAAA+E,IAAA,CAAAA,GACA/E,EAAAryI,GAAA,CAAAA,GACAqyI,EAAA7V,GAAA,CAAAA,GACA6V,EAAAl4K,KAAA,CAAAA,GACAk4K,EAAA2I,KAAA,CAAAA,GACA3I,EAAA/zH,EAAA,CAAAA,GACA+zH,EAAA/9H,GAAA,CAAAA,GACA+9H,EAAA4I,KAAA,CAAAA,GACA5I,EAAA6I,IAAA,CAAAA,GACA7I,EAAArmJ,GAAA,CAAAA,GACAqmJ,EAAAtmJ,GAAA,CAAAA,GACAsmJ,EAAA7nK,GAAA,CAAAA,GACA6nK,EAAA9xI,GAAA,CAAAA,GACA8xI,EAAApyI,GAAA,CAAAA,GACAoyI,EAAA5Z,MAAA,CAAAA,GACA4Z,EAAA/sJ,KAAA,CAAAA,GACA+sJ,EAAAhqL,IAAA,CAAAA,GACAgqL,EAAA/L,GAAA,CAAAA,GACA+L,EAAAmF,IAAA,CAAAA,GACAnF,EAAA7rE,IAAA,CAAAA,GACA6rE,EAAAnxI,GAAA,CAAAA,GACAmxI,EAAAhyF,GAAA,CAAAA,GACAgyF,EAAAgH,GAAA,CAAAA,GACAhH,EAAAyF,IAAA,CAAAA,GACAzF,EAAA5xI,KAAA,CAAAA,GAEA,SAAAnhC,GAAAA,CAAAA,EAAA,IACAA,GACAA,CAAA,IAAAA,EAAAw7K,QAAA,CAEA,IAAA70L,EAAA,EADAkvL,EAAA,aAAoB,WAAc,uDAClClvL,EAAAkvL,EAAAt0L,MAAA,EAAAye,EAAAjR,cAAA,CAAAqZ,EAAAytK,CAAA,CAAAlvL,IAAA,GAAAqZ,CAAAA,CAAA,CAAAoI,EAAA,MAAAA,EAAA,CAEA,CAIA,OAFA2qK,EAAAxpL,MAAA,CAAAyW,GAEA+yK,CACA,CAWA,SAAAryI,GAAAj9C,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAi9C,GAAA,CAAA5rB,EACA,CAUA,SAAAooJ,GAAAz5K,CAAA,EACA,gBAAAA,GAAAy5K,GAAA,EACA,CASA,SAAAriK,GAAApX,CAAA,EACA,OAAA2zL,EAAA3zL,EAAA,SAAAA,GAAAA,EAAAiE,CAAA,KACA,CAYA,SAAAg0L,IAAA,CACA,IAAA/0L,EAAAhG,EACA6E,EAAA,YAIA,IAAAmB,EAAA,EAFAwsL,EAAA,GAEAxsL,EAAA8yB,UAAAl4B,MAAA,EAEA,GADAZ,EAAA,SAAA84B,SAAA,CAAA9yB,IAAA,EACAhG,EAAAV,CAAA,CAMAuF,EAAAvF,CAAA,EACAuF,CAAAA,EAAAA,EAAAmvK,IAAA,CAAAh0K,EAAAk0K,KAAA,CAAAl0K,GAAA,MAPA,CACA,GAAAA,EAAA0E,CAAA,CAEA,OADA8tL,EAAA,GACA,aACA,CACQ3tL,EAAA7E,CACR,CAEA,OAGAwyL,EAAA,GAEA3tL,EAAA0hH,IAAA,EACA,CAQA,SAAAu0E,GAAAz7K,CAAA,EACA,OAAAA,aAAA+yK,GAAA/yK,GAAAA,EAAA89B,WAAA,GAAAvgC,GAAA,EACA,CAUA,SAAAyhD,GAAAv7D,CAAA,EACA,gBAAAA,GAAAu7D,EAAA,EACA,CAaA,SAAAhK,GAAAvxD,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAuxD,GAAA,CAAAlgC,EACA,CAUA,SAAA8mK,GAAAn4L,CAAA,EACA,gBAAAA,GAAAuxD,GAAA,GACA,CAUA,SAAA2mI,GAAAl4L,CAAA,EACA,gBAAAA,GAAAuxD,GAAA,IACA,CASA,SAAAtoB,IAAA,CACA,OAAAsrI,EAAA,KAAAv+I,UAAA,KACA,CASA,SAAAgT,IAAA,CACA,OAAAurI,EAAA,KAAAv+I,UAAA,KACA,CAWA,SAAAvO,GAAAznB,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAynB,GAAA,CAAA4J,EACA,CAWA,SAAAmsB,GAAAx9C,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAw9C,GAAA,CAAAnsB,EACA,CAWA,SAAA6rB,GAAAl9C,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAk9C,GAAA,CAAA7rB,EACA,CAWA,SAAAqkJ,GAAA1F,CAAA,EACA,IAAAxzK,EAAAyH,EAAAvC,EAAAxE,EACAgG,EAAA,EACAlC,EAAA,YACA0zK,EAAA,GAOA,GALA1E,KAAA,IAAAA,EAAAA,EAAA,KAAAvU,SAAA,CACA20B,EAAApgB,EAAA,EAAAqf,GAEA3tL,EAAA9D,KAAAC,IAAA,CAAAmyK,EAAAmC,GAEA,IAAa,CAAAgD,MAAM,EAInB,GAAAA,OAAAC,eAAA,CAGA,IAFA54K,EAAA24K,OAAAC,eAAA,KAAAn8D,YAAAv3G,IAEAwB,EAAAxB,GAKAxE,CAJAA,EAAAV,CAAA,CAAA0G,EAAA,GAIA,MACU1G,CAAA,CAAA0G,EAAA,CAAAiyK,OAAAC,eAAA,KAAAn8D,YAAA,OAKVy7D,CAAA,CAAAxxK,IAAA,CAAAhG,EAAA,SAKA,GAAAi4K,OAAA5uD,WAAA,EAKA,IAFA/pH,EAAA24K,OAAA5uD,WAAA,CAAA7kH,GAAA,GAEAwB,EAAAxB,GAMAxE,CAHAA,EAAAV,CAAA,CAAA0G,EAAA,CAAA1G,CAAAA,CAAA,CAAA0G,EAAA,OAAA1G,CAAAA,CAAA,CAAA0G,EAAA,UAAA1G,IAAAA,CAAA,CAAA0G,EAAA,WAGA,MACUiyK,OAAA5uD,WAAA,IAAA9hG,IAAA,CAAAjoB,EAAA0G,IAKVwxK,EAAAt4K,IAAA,CAAAc,EAAA,KACAgG,GAAA,GAIMA,EAAAxB,EAAA,CACN,MACA,MAAA4I,MAAAuoL,EAAA,MA9CA,KAAA3vL,EAAAxB,GAAAgzK,CAAA,CAAAxxK,IAAA,CAAAtF,IAAAA,KAAA83K,MAAA,IA+CA,CAYA,IAVAh0K,EAAAgzK,CAAA,GAAAxxK,EAAA,CACA8sK,GAAAmC,EAGAzwK,GAAAsuK,IACA9yK,EAAA4yL,EAAA,GAAA3d,EAAAnC,GACA0E,CAAA,CAAAxxK,EAAA,EAAAxB,EAAAxE,EAAA,GAAAA,GAIAw3K,IAAAA,CAAA,CAAAxxK,EAAA,CAAAA,IAAAwxK,EAAAhkH,GAAA,GAGA,GAAAxtD,EAAA,EACAe,EAAA,EACMywK,EAAA,QACN,CAIA,IAHAzwK,EAAA,GAGAywK,IAAAA,CAAA,IAAAzwK,GAAAkuK,EAAAuC,EAAAh8J,KAAA,GAGA,IAAAhX,EAAA,EAAAxE,EAAAw3K,CAAA,IAAAx3K,GAAA,GAAAA,GAAA,GAAAwE,IAGAA,EAAAywK,GAAAluK,CAAAA,GAAAkuK,EAAAzwK,CAAAA,CACA,QAEAV,EAAAiD,CAAA,CAAAA,EACAjD,EAAAxE,CAAA,CAAAk4K,EAEA1zK,CACA,CAWA,SAAAuhC,GAAAviC,CAAA,EACA,OAAA2zL,EAAA3zL,EAAA,SAAAA,GAAAA,EAAAiE,CAAA,QAAAw1J,QAAA,CACA,CAcA,SAAAn0J,GAAAtF,CAAA,EAEA,MAAAA,CADAA,EAAA,SAAAA,EAAA,EACAxD,CAAA,CAAAwD,EAAAxD,CAAA,IAAAwD,EAAA4B,CAAA,GAAA5B,EAAA4B,CAAA,CAAA5B,EAAA4B,CAAA,EAAAm+F,GAAA,CAWA,SAAAwjF,GAAAvjL,CAAA,EACA,gBAAAA,GAAAujL,GAAA,EACA,CAUA,SAAAkR,GAAAz0L,CAAA,EACA,gBAAAA,GAAAy0L,IAAA,EACA,CAUA,SAAAhxE,GAAAzjH,CAAA,EACA,gBAAAA,GAAAyjH,IAAA,EACA,CAWA,SAAAtlE,GAAAn+C,CAAA,CAAAqxB,CAAA,EACA,gBAAArxB,GAAAm+C,GAAA,CAAA9sB,EACA,CAYA,SAAAisE,IAAA,CACA,IAAAp6F,EAAA,EACAkD,EAAA4vB,UACAh2B,EAAA,SAAAoG,CAAA,CAAAlD,EAAA,EAGA,IADAwsL,EAAW,GACX1vL,EAAA4B,CAAA,IAAAsB,EAAAkD,EAAAtI,MAAA,EAAAkC,EAAAA,EAAAkxK,IAAA,CAAA9qK,CAAA,CAAAlD,EAAA,EAGA,OAFAwsL,EAAA,GAEAiE,EAAA3zL,EAAA,KAAAy7J,SAAA,MAAAhC,QAAA,CACA,CAUA,SAAA68B,GAAAt2L,CAAA,EACA,gBAAAA,GAAAs2L,GAAA,EACA,CAUA,SAAAvB,GAAA/0L,CAAA,EACA,gBAAAA,GAAA+0L,IAAA,EACA,CASA,SAAAr3I,GAAA19C,CAAA,EACA,OAAA2zL,EAAA3zL,EAAA,SAAAA,GAAAA,EAAAiE,CAAA,KACA,CAKAqrL,CADAA,EAAAztK,GAAA4wK,EAAA,EACApnL,SAAA,CAAAxM,WAAA,CAAAywL,EACAA,EAAA,QAAAA,EAAAA,OAAA,CAAAA,EAGAG,EAAA,IAAAH,EAAAG,GACAn5D,EAAA,IAAAg5D,EAAAh5D,GAUAu4C,KAAAluK,IAFAkuK,CAAAA,EAAA,YACK,OAAAygB,CAAA,GAAA/jL,IAAA,CAAA3O,EAAAL,EAAAK,EAAAD,EAAA,GACLA,CAAAA,EAAAC,OAAA,CAAAiyK,CAAA,CAwBC,oBAAAlyK,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECr0JY,aAEqC,IAAAyyL,EAAAzyL,EAAA,MAGlD67L,EAAiB77L,EAAQ,MAAgBqyL,EAAAryL,EAAA,MAEhB87L,EAAA97L,EAAA,KAIzBI,CAAAA,EAAAC,OAAA,UACA2f,CAAA,CACAhH,CAAA,CACAjW,CAAA,CACA,CACA,IAAAid,GAAA,iBAAAA,GAAA,mBAAAA,EACA,UAAAqyK,EAAA,0CAEA,oBAAAr5K,GAAA,iBAAAA,EACA,UAAAq5K,EAAA,4CAEA,GAAA54J,UAAAl4B,MAAA,sBAAAk4B,SAAA,KAAAA,IAAA,GAAAA,SAAA,IACA,UAAA44J,EAAA,2DAEA,GAAA54J,UAAAl4B,MAAA,sBAAAk4B,SAAA,KAAAA,IAAA,GAAAA,SAAA,IACA,UAAA44J,EAAA,yDAEA,GAAA54J,UAAAl4B,MAAA,sBAAAk4B,SAAA,KAAAA,IAAA,GAAAA,SAAA,IACA,UAAA44J,EAAA,6DAEA,GAAA54J,UAAAl4B,MAAA,sBAAAk4B,SAAA,IACA,UAAA44J,EAAA,2CAGA,IAAA0J,EAAAtiK,UAAAl4B,MAAA,GAAAk4B,SAAA,SACAuiK,EAAAviK,UAAAl4B,MAAA,GAAAk4B,SAAA,SACAwiK,EAAAxiK,UAAAl4B,MAAA,GAAAk4B,SAAA,SAAAyiK,EAAAziK,UAAAl4B,MAAA,IAAAk4B,SAAA,IAGAymB,EAAA,EAAA47I,GAAAA,EAAA97K,EAAAhH,GAGA,GAAAy5K,EACAA,EAAAzyK,EAAAhH,EAAA,CACAqnC,aAAA47I,IAAA,GAAAA,GAAA/7I,EAAAA,EAAAG,YAAA,EAAA47I,CAAA,CACA5vK,WAAA0vK,IAAA,GAAAA,GAAA77I,EAAAA,EAAA7zB,UAAA,EAAA0vK,CAAA,CACAh5L,MAAAA,EACGq9C,SAAA47I,IAAA,GAAAA,GAAA97I,EAAAA,EAAAE,QAAA,EAAA47I,CAAA,QAEH,GAAAE,CAAAA,GAAA,IAAAF,GAAAC,CAAA,EAIA,UAAAJ,EAAA,oHAFA77K,CAAG,CAAAhH,EAAA,CAAAjW,CAGH,iBAAA3C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECvDa,aAGb,IAAAqH,EAAArH,EAAA,MAAAm8L,EAAA,mBAAAx4L,QAAA,iBAAAA,OAAA,OAGAm0I,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CACAmtB,EAAAt1B,MAAA2N,SAAyB,CAAA2nB,MAAA,CAA8B2lK,EAAAp8L,EAAA,MAGvDuuG,EAAA,SAAAr3E,CAAA,EACA,yBAAAA,GAAA4gH,sBAAAA,EAAA9oI,IAAA,CAAAkoB,EAAA,EAE4DmlK,EAAAr8L,EAAA,QAG5DkP,EAAA,SAAAktC,CAAA,CAAA94C,CAAA,CAAAP,CAAA,CAAAu5L,CAAA,EACA,GAAAh5L,KAAA84C,GACA,GAAAkgJ,CAAA,IAAAA,EACA,IAAAlgJ,CAAA,CAAA94C,EAAA,GAAAP,EACA,MACI,MACJ,IAAAwrG,EAAA+tF,IAAA,CAAAA,IACA,MACA,GAIAF,EAAGhgJ,EAAA94C,EAAAP,EAAA,IAEHq5L,EAAAhgJ,EAAA94C,EAAAP,EACA,EAGA0kK,EAAA,SAAArrH,CAAA,CAAA56C,CAAA,EACA,IAAA+6L,EAAA9iK,UAAAl4B,MAAA,GAAAk4B,SAAA,OACA1zB,EAAAsB,EAAA7F,GACA26L,GACAp2L,CAAAA,EAAA0wB,EAAAznB,IAAA,CAAAjJ,EAAA3C,OAAA2mD,qBAAA,CAAAvoD,GAAA,EAEA,QAAAmF,EAAA,EAAAA,EAAAZ,EAAAxE,MAAA,CAAAoF,GAAA,EACAuI,EAAAktC,EAAAr2C,CAAA,CAAAY,EAAA,CAAAnF,CAAA,CAAAuE,CAAA,CAAAY,EAAA,EAAA41L,CAAA,CAAAx2L,CAAA,CAAAY,EAAA,EACA,CAEA8gK,CAAAA,EAAA40B,mBAAA,GAAAA,EAEAj8L,EAAAC,OAAA,CAAAonK,CAAA,gBAAArnK,CAAA,EC9Ca,aAGb,SAAAiD,EAAA2c,CAAA,CAAAja,CAAA,EACA,QAAA/C,KAAA+C,EACA3C,OAAA8L,cAAA,CAAA8Q,EAAAhd,EAAA,CACAD,MAAAgD,CAAA,CAAA/C,EAAA,CACAqpB,WAAA,GACSg0B,aAAA,EACT,GAGA,OAAArgC,CAAA,CAGA,SAAAw8K,EAAAzxL,CAAA,CAAAH,CAAA,CAAA7E,CAAA,EACA,IAAAgF,GAAA,iBAAAA,EACA,oDAGAhF,GACAA,CAAAA,EAAA,IAGA,iBAAA6E,IACA7E,EAAA6E,EACAA,EAAAxG,KAAAA,GAGA,MAAAwG,GACA7E,CAAAA,EAAA6E,IAAA,CAAAA,CAAA,EAGA,IACM,OAAAvH,EAAA0H,EAAAhF,EACN,OAAAtE,EAAA,CACAsE,EAAArD,OAAA,CAAAqI,EAAArI,OAAA,CAAAqD,EAAA4f,KAAA,CAAA5a,EAAA4a,KAAA,CAEA,IAAA82K,EAAA,aAKA,OAHAA,EAAA3tL,SAAA,CAAA1L,OAAA8C,MAAA,CAAA9C,OAAAy6C,cAAA,CAAA9yC,IAGA1H,EAAA,IAAAo5L,EAAA12L,EACA,EAEA3F,EAAAC,OAAA,CAAAm8L,CAAA,gBAAAp8L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC9Ca,aAMb,IAAAyyL,EAAAV,EAJ0C,KAI1C,kCACA,GAAAU,EACA,IACAA,EAAG,QAAA1vL,MAAA,GACH,OAAA2E,EAAA,CAEA+qL,EAAA,EACA,GAEApyL,OAAA,CAAAoyL,CAAA,gBAAAryL,CAAA,ECfa,YAGbA,CAAAA,EAAAC,OAAA,CAAAq8L,SAAA,gBAAAt8L,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAA0N,KAAA,gBAAA3N,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAAssG,UAAA,gBAAAvsG,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAAs8L,cAAA,gBAAAv8L,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAAu8L,WAAA,gBAAAx8L,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAAgC,SAAA,gBAAAjC,CAAA,ECHa,YAGbA,CAAAA,EAAAC,OAAA,CAAAw8L,QAAA,gBAAAz8L,CAAA,ECHa,aAGb,IAAAujB,EAAAvgB,OAAA0L,SAAA,CAAAC,cAAA,CAAA+mE,EAAA,IASA,SAAAgnH,GAAA,EA6BA,SAAAC,EAAA7lK,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,EACA,KAAA9lK,EAAA,CAAAA,EACA,KAAA3yB,OAAA,CAAAA,EACA,KAAAy4L,IAAA,CAAAA,GAAA,GAcA,SAAAC,EAAAC,CAAA,CAAApmH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,EACA,sBAAA9lK,EACA,mDAGA,IAAA2pC,EAAA,IAAAk8H,EAAA7lK,EAAA3yB,GAAA24L,EAAAF,GAAAG,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAOA,OAJAomH,EAAA33H,OAAA,CAAA43H,EAAA,CACAD,EAAA33H,OAAA,CAAA43H,EAAA,CAAAjmK,EAAA,CAAAgmK,EAAA33H,OAAA,CAAA43H,EAAA,EAAAD,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt8H,EAAA,CAAAq8H,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt9L,IAAA,CAAAghE,GADAq8H,CAAAA,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt8H,EAAAq8H,EAAAE,YAAA,IAIAF,CAAA,CAUA,SAAAG,EAAAH,CAAA,CAAAC,CAAA,EACA,KAAAD,EAAAE,YAAA,CAAAF,EAAA33H,OAAA,KAAAu3H,EACA,OAAAI,EAAA33H,OAAA,CAAA43H,EAAA,CAUA,SAAAG,GAAA,CACA,KAAA/3H,OAAA,KAAAu3H,EACA,KAAAM,YAAA,GAxEAh6L,OAAA8C,MAAA,GAAA42L,EAAAhuL,SAAA,CAAA1L,OAAA8C,MAAA,OAOA,IAAA42L,IAAAprI,SAAA,EAAAokB,CAAAA,EAAA,KA2EAwnH,EAAAxuL,SAAA,CAAAyuL,UAAA,YACA,IACA/lI,EAAAl0D,EADAk6L,EAAA,GAGA,YAAAJ,YAAA,QAAAI,CAAA,CAGA,IAAAl6L,KAAAk0D,EAAA,KAAA+N,OAAA,CACA5hD,EAAA3U,IAAA,CAAAwoD,EAAAl0D,IAAAk6L,EAAA39L,IAAA,CAAAi2E,EAAAxyE,EAAA3B,KAAA,IAAA2B,CAAA,SAGA,OAAAymD,qBAAA,CACAyzI,EAAA/mK,MAAA,CAAArzB,OAAA2mD,qBAAA,CAAAyN,IAGAgmI,CAHA,EAaAF,EAAAxuL,SAAA,CAAA4sE,SAAA,UAAA5E,CAAA,EACA,IAAAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAAAlhC,EAAA,KAAA2vB,OAAA,CAAA43H,EAAA,CAGA,IAAAvnJ,EAAA,YAAAA,EAAA1e,EAAA,QAAA0e,EAAA1e,EAAA,EAGA,QAAAvwB,EAAA,EAAA2mC,EAAAsI,EAAAr0C,MAAA,CAAAi3D,EAAA,MAAAlrB,GAAA3mC,EAAA2mC,EAAA3mC,IACA6xD,CAAA,CAAA7xD,EAAA,CAAAivC,CAAA,CAAAjvC,EAAA,CAAAuwB,EAAA,CAGA,OAAAshC,CAAA,EAUA8kI,EAAAxuL,SAAA,CAAA2uL,aAAA,UAAA3mH,CAAA,EACA,IAAAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAAA4E,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,QAGA,EACAzhH,EAAAxkD,EAAA,GACAwkD,EAAAn6E,MAAA,CAFA,GAYA+7L,EAAAxuL,SAAA,CAAA8xD,IAAA,UAAAkW,CAAA,CAAA2tD,CAAA,CAAAE,CAAA,CAAAo9C,CAAA,CAAAG,CAAA,CAAAG,CAAA,MAAA8a,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAEA,SAAAvR,OAAA,CAAA43H,EAAA,UAGA,IAEAtzL,EAAAlD,EAFA+0E,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,CACApjK,EAAAN,UAAAl4B,MAAA,CAIA,GAAAm6E,EAAAxkD,EAAA,EAGA,OAHAwkD,EAAAshH,IAAA,OAAAU,cAAA,CAAA5mH,EAAA4E,EAAAxkD,EAAA,CAAA9yB,KAAAA,EAAA,IAGA21B,GACA,cAAA2hD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,UACA,SAAAm3E,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,GAAA,QACA,SAAA/oD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,GAAA,QACA,SAAAjpD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,GAAA,QACA,SAAArmG,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,EAAAG,GAAA,QACA,SAAAxmG,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,EAAAG,EAAAG,GAAA,GAGA,IAAA17K,EAAA,EAAAkD,EAAA,MAAAkwB,EAAA,GAAApzB,EAAAozB,EAAApzB,IACAkD,CAAA,CAAAlD,EAAA,GAAA8yB,SAAA,CAAA9yB,EAAA,CAGI+0E,EAAAxkD,EAAA,CAAA91B,KAAA,CAAAs6E,EAAAn3E,OAAA,CAAAsF,EACJ,MACA,IAAAgrB,EAAAtzB,EAAAm6E,EAAAn6E,MAAA,CAGA,IAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,IAGA,OAHA+0E,CAAA,CAAA/0E,EAAA,CAAAq2L,IAAA,OAAAU,cAAA,CAAA5mH,EAAA4E,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAA9yB,KAAAA,EAAA,IAGA21B,GACA,OAAA2hD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,OAAgE,MAChE,EAAAm3E,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,GAAA,KAAoE,MACpE,EAAA/oD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,EAAAE,GAAA,KAAwE,MACxE,EAAAjpD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,EAAAE,EAAAo9C,GAAA,cAEA,IAAAl4K,EAAA,IAAAgrB,EAAA,EAAAhrB,EAAA,MAAAkwB,EAAA,GAAAlF,EAAAkF,EAAAlF,IACAhrB,CAAA,CAAAgrB,EAAA,GAAA4E,SAAA,CAAA5E,EAAA,CAGA6mD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAA91B,KAAA,CAAAs6E,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAsF,EACA,CACA,OAGA,IAYAyzL,EAAAxuL,SAAA,CAAAqvD,EAAA,UAAA2Y,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,EACA,OAAA04L,EAAA,KAAAnmH,EAAA5/C,EAAA3yB,EAAA,KAYA+4L,EAAAxuL,SAAA,CAAAkuL,IAAA,UAAAlmH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,EACA,OAAA04L,EAAA,KAAAnmH,EAAA5/C,EAAA3yB,EAAA,KAaA+4L,EAAAxuL,SAAA,CAAA4uL,cAAA,UAAA5mH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,MAAAG,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAGA,SAAAvR,OAAA,CAAA43H,EAAA,aACA,IAAAjmK,EAEA,OADAmmK,EAAA,KAAAF,GACA,KAEA,IAAAzhH,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,CAGA,GAAAzhH,EAAAxkD,EAAA,CAEAwkD,EAAAxkD,EAAA,GAAAA,GACA,IAAAwkD,EAAAshH,IAAA,EACA,GAAAthH,EAAAn3E,OAAA,GAAAA,GAEA84L,EAAA,KAAAF,OAEA,CACA,QAAAx2L,EAAA,EAAA6wD,EAAA,GAAAj2D,EAAAm6E,EAAAn6E,MAAA,CAAAoF,EAAApF,EAAAoF,IAEA+0E,CAAAA,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,GAAAA,GACA8lK,GAAA,CAAAthH,CAAA,CAAA/0E,EAAA,CAAAq2L,IAAA,EACAz4L,GAAAm3E,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,GAAAA,CAAA,GAEAizD,EAAA33D,IAAA,CAAA67E,CAAA,CAAA/0E,EAAA,CAOA6wD,CAAAA,EAAAj2D,MAAA,MAAAgkE,OAAA,CAAA43H,EAAA,CAAA3lI,IAAAA,EAAAj2D,MAAA,CAAAi2D,CAAA,IAAAA,CAAA,CACA6lI,EAAA,KAAAF,EAAA,QAGA,MAUAG,EAAAxuL,SAAA,CAAA6uL,kBAAA,UAAA7mH,CAAA,MAAAqmH,EAWA,OARArmH,GACAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CACI,KAAAvR,OAAA,CAAA43H,EAAA,EAAAE,EAAA,KAAAF,KAEJ,KAAA53H,OAAA,KAAAu3H,EACA,KAAAM,YAAA,IAGA,MAMAE,EAAAxuL,SAAA,CAAAkvK,GAAA,CAAAsf,EAAAxuL,SAAA,CAAA4uL,cAAA,CAAAJ,EAAAxuL,SAAA,CAAAmuL,WAAA,CAAAK,EAAAxuL,SAAA,CAAAqvD,EAAA,CAKAm/H,EAAAM,QAAA,CAAA9nH,EAKAwnH,EAAAA,YAAA,CAAAA,EAOAl9L,EAAAC,OAAA,CAAAi9L,CAAA,gBAAAl9L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC/Ua,aAEyB,IAAA69L,EAAA79L,EAAA,MAGtC83I,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CAAAyF,EAAA3L,OAAA0L,SAAA,CAAAC,cAAA,CAGA+uL,EAAA,SAAwC78L,CAAA,CAAA2C,CAAS,CAAAm6L,CAAA,EACjD,QAAAp3L,EAAA,EAAAozB,EAAA94B,EAAAM,MAAA,CAAAoF,EAAAozB,EAAApzB,IACAoI,EAAAC,IAAA,CAAA/N,EAAA0F,KACAo3L,IAAA,EAAAA,EACcn6L,EAAA3C,CAAA,CAAA0F,EAAA,CAAAA,EAAA1F,GAEd2C,EAAAoL,IAAA,CAAA+uL,EAAA98L,CAAA,CAAA0F,EAAA,CAAAA,EAAA1F,GAGA,EAGA+8L,EAAA,SAAyC52L,CAAA,CAASxD,CAAA,CAAAm6L,CAAA,EAClD,QAAAp3L,EAAA,EAAAozB,EAAA3yB,EAAA7F,MAAA,CAAAoF,EAAAozB,EAAApzB,IAEAo3L,IAAA,EAAAA,EACUn6L,EAAAwD,EAAA4jB,MAAA,CAAArkB,GAAAA,EAAAS,GAEVxD,EAAAoL,IAAA,CAAA+uL,EAAA32L,EAAA4jB,MAAA,CAAArkB,GAAAA,EAAAS,EAEA,EAGA62L,EAAA,SAAA7hJ,CAAA,CAAAx4C,CAAA,CAAAm6L,CAAA,EACA,QAAA54L,KAAAi3C,EACArtC,EAAAC,IAAA,CAAAotC,EAAAj3C,KACA44L,IAAA,EAAAA,EACcn6L,EAAAw4C,CAAA,CAAAj3C,EAAA,CAAAA,EAAAi3C,GAEdx4C,EAAAoL,IAAA,CAAA+uL,EAAA3hJ,CAAA,CAAAj3C,EAAA,CAAAA,EAAAi3C,GAGA,EAGA5uC,EAAA,SAAAu9D,CAAA,CAAAnnE,CAAA,CAAAigB,CAAA,MAKAk6K,EAJA,IAAAF,EAAAj6L,GACA,+CAIA61B,UAAAl4B,MAAA,KACAw8L,CAAAA,EAAAl6K,CAAA,EAGAi0H,mBAAAA,EAAA9oI,IAAA,CAAA+7D,GACM+yH,EAAA/yH,EAAAnnE,EAAAm6L,GACN,iBAAAhzH,EACMizH,EAAAjzH,EAAAnnE,EAAAm6L,GAENE,EAAAlzH,EAAAnnE,EAAAm6L,EACA,CAEA39L,CAAAA,EAAAC,OAAA,CAAAmN,CAAA,gBAAApN,CAAA,EC7Da,aAKb,IAAA89L,EAAA,kDACApmD,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CACAojC,EAAArrC,KAAAqrC,GAAA,CAAAyxJ,EAAA,oBAGAC,EAAA,SAAAj+L,CAAA,CAAAkZ,CAAA,EAGA,QAHA80D,EAAA,GAGAxnE,EAAA,EAAAA,EAAAxG,EAAAoB,MAAA,CAAAoF,GAAA,EACAwnE,CAAA,CAAAxnE,EAAA,CAAAxG,CAAA,CAAAwG,EAAA,CAEA,QAAAkuB,EAAA,EAAAA,EAAAxb,EAAA9X,MAAA,CAAAszB,GAAA,EACAs5C,CAAA,CAAAt5C,EAAA10B,EAAAoB,MAAA,EAAA8X,CAAA,CAAAwb,EAAA,CAGA,OAAAs5C,CAAA,EAGAkwH,EAAA,SAAAC,CAAA,CAAAhlL,CAAA,EAEA,QADA60D,EAAA,GACAxnE,EAAA2S,GAAA,EAAAub,EAAA,EAAAluB,EAAA23L,EAAA/8L,MAAA,CAAAoF,GAAA,EAAAkuB,GAAA,EACAs5C,CAAA,CAAAt5C,EAAA,CAAAypK,CAAA,CAAA33L,EAAA,CAEA,OAAAwnE,CAAA,EAGAowH,EAAA,SAAApwH,CAAA,CAAAqwH,CAAA,EAEA,QADArzK,EAAA,GACAxkB,EAAA,EAAAA,EAAAwnE,EAAA5sE,MAAA,CAAAoF,GAAA,EACAwkB,GAAAgjD,CAAA,CAAAxnE,EAAA,CACAA,EAAA,EAAAwnE,EAAA5sE,MAAA,EACA4pB,CAAAA,GAAAqzK,CAAA,EAGA,OAAArzK,CAAA,CAGA/qB,CAAAA,EAAAC,OAAA,UAAAo+L,CAAA,EACA,IAMAC,EANA1gJ,EAAA,KACA,sBAAAA,GAAA85F,EAAA12I,KAAA,CAAA48C,KAAAmgJ,EACA,gBAAAD,EAAAlgJ,EAAA,CAyBA,QAxBAn0C,EAAAw0L,EAAA5kK,UAAA,GAIAklK,EAAA,WACA,mBAAAD,EAAA,CACA,IAAAp6L,EAAA05C,EAAA58C,KAAA,CACA,KACAg9L,EAAAv0L,EAAA4vB,mBAEA,OAAAn1B,KAAAA,EACAA,EAEA,KACA,OACA05C,EAAA58C,KAAA,CACAq9L,EACAL,EAAAv0L,EAAA4vB,WAEA,EAGAmlK,EAAAlyJ,EAAA,EAAAsR,EAAAz8C,MAAA,CAAAsI,EAAAtI,MAAA,EACAs9L,EAAoB,GACpBl4L,EAAA,EAAAA,EAAAi4L,EAAAj4L,IACAk4L,CAAA,CAAAl4L,EAAA,KAAAA,EAKA,GAHuH+3L,EAAA71B,SAAA,6BAAA01B,EAAAM,EAAA,kDAAAF,GAGvH3gJ,EAAAlvC,SAAA,EACA,IAAAgwL,EAAA,YACAA,CAAAA,EAAAhwL,SAAA,CAAAkvC,EAAAlvC,SAAA,CACA4vL,EAAA5vL,SAAA,KAAAgwL,EACAA,EAAAhwL,SAAA,aAGA4vL,CAAA,iBAAAt+L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECnFa,aAEkC,IAAA++L,EAAA/+L,EAAA,KAE/CI,CAAAA,EAAAC,OAAA,CAAAwoK,SAAA/5J,SAAA,CAAAmO,IAAA,EAAA8hL,CAAA,eAAA3+L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECJa,aAKb,IAHAoE,EAGA46L,EAAAh/L,EAAiB,MACjBi/L,EAAAj/L,EAAyB,MACzBk/L,EAAAl/L,EAAsB,MACtBm/L,EAAmBn/L,EAAQ,MAC3B67L,EAAiB77L,EAAQ,MACzBqyL,EAAgBryL,EAAQ,MAAeo/L,EAAAp/L,EAAA,MAEvCq/L,EAAAx2B,SAIAy2B,EAAA,SAAAC,CAAA,EACA,IACA,OAAGF,EAAA,yBAAAE,EAAA,mBACH,OAAA73L,EAAA,IAGA83L,EAAAp8L,OAAA+8C,wBAAA,CACA,GAAAq/I,EACA,IACAA,EAAG,MACH,OAAA93L,EAAA,CACA83L,EAAA,KACA,IAGAC,EAAA,WACA,UAAApN,CAAA,EAEAqN,EAAAF,EACA,WACA,IAGA,OADA/lK,UAAAkmK,MAAA,CACIF,CACJ,OAAAG,EAAA,CACA,IAEA,OAAKJ,EAAA/lK,UAAA,UAAArW,GAAA,CACL,MAAAy8K,EAAA,CACA,OAAAJ,CACA,CACE,CACF,IAAAA,CAAA,CAGAtD,EAAen8L,EAAQ,QAAW8/L,EAAA9/L,EAAA,QAGlC+/L,EAAA38L,OAAAy6C,cAAA,EACAiiJ,CAAAA,EACA,SAAAr8L,CAAA,SAAAA,EAAAiuD,SAAA,EACA,MAEAsuI,EAAA,GAEAC,EAAA,oBAAApzL,YAAAkzL,EAAAA,EAAAlzL,YAAAzI,CAAA,CAGA87L,EAAA,CACAxuI,UAAA,KACA,uCAAAi7B,eAAAvoF,EAAAuoF,cAAA,CACA,UAAAxrF,MACA,oCAAAkf,YAAAjc,EAAAic,WAAA,CACA,2BAAA87K,GAAA4D,EAAAA,EAAA,GAAAp8L,OAAAC,QAAA,KAAAQ,CAAA,CACA,mCAAAA,EACA,kBAAA47L,EACA,mBAAAA,EACA,2BAAAA,EACA,2BAAAA,EACA,gCAAAG,QAAA/7L,EAAA+7L,OAAA,CACA,+BAAAv1I,OAAAxmD,EAAAwmD,MAAA,CACA,sCAAAw1I,cAAAh8L,EAAAg8L,aAAA,CACA,uCAAAC,eAAAj8L,EAAAi8L,cAAA,CACA,YAAA7hH,QACA,iCAAAv+D,SAAA7b,EAAA6b,QAAA,CACA,SAAA67E,KACA,cAAAwkG,UACA,uBAAA17K,mBACA,cAAA27K,UACA,uBAAAtiJ,mBACA,UAAA+gJ,EACA,SAAAwB,KACA,cAAAvB,EACA,qCAAAztF,aAAAptG,EAAAotG,YAAA,CACA,qCAAAC,aAAArtG,EAAAqtG,YAAA,CACA,6CAAAgvF,qBAAAr8L,EAAAq8L,oBAAA,CACA,aAAApB,EACA,sBAAAW,EACA,kCAAAU,UAAAt8L,EAAAs8L,SAAA,CACA,mCAAAC,WAAAv8L,EAAAu8L,UAAA,CACA,mCAAAC,WAAAx8L,EAAAw8L,UAAA,CACA,aAAAl4F,SACA,UAAAxhG,MACA,sBAAAi1L,GAAA4D,EAAAA,EAAAA,EAAA,GAAAp8L,OAAAC,QAAA,MAAAQ,CAAA,CACA,0BAAAN,KAAAA,KAAAM,CAAA,CACA,4BAAAqB,IAAArB,EAAAqB,GAAA,CACA,6CAAAA,KAAA02L,GAAA4D,EAAAA,EAAA,IAAAt6L,KAAA,CAAA9B,OAAAC,QAAA,KAAAQ,CAAA,CACA,SAAA/C,KACA,WAAA4X,OACA,WAAA7V,OACA,eAAA+pC,WACA,aAAAL,SACA,gCAAAvrB,QAAAnd,EAAAmd,OAAA,CACA,8BAAA0zC,MAAA7wD,EAAA6wD,KAAA,CACA,eAAAiqI,EACA,mBAAAC,EACA,gCAAA92I,QAAAjkD,EAAAikD,OAAA,CACA,WAAAmN,OACA,4BAAA7vD,IAAAvB,EAAAuB,GAAA,CACA,6CAAAA,KAAAw2L,GAAA4D,EAAAA,EAAA,IAAAp6L,KAAA,CAAAhC,OAAAC,QAAA,KAAAQ,CAAA,CACA,0CAAAsgG,kBAAAtgG,EAAAsgG,iBAAA,CACA,WAAAjkF,OACA,4BAAA07K,GAAA4D,EAAAA,EAAA,GAAAp8L,OAAAC,QAAA,KAAAQ,CAAA,CACA,WAAA+3L,EAAAx4L,OAAAS,CAAA,CACA,gBAAAy3L,EACA,mBAAA6D,EACA,eAAAO,EACA,cAAA5N,EACA,mCAAAxlL,WAAAzI,EAAAyI,UAAA,CACA,0CAAAg0L,kBAAAz8L,EAAAy8L,iBAAA,CACA,oCAAAC,YAAA18L,EAAA08L,WAAA,CACA,oCAAApkF,YAAAt4G,EAAAs4G,WAAA,CACA,aAAA0iF,EACA,gCAAA/pK,QAAAjxB,EAAAixB,OAAA,CACA,gCAAA0rK,QAAA38L,EAAA28L,OAAA,CACA,gCAAAC,QAAA58L,EAAA48L,OAAA,EAGA,GAAAjB,EACA,IACA,IAAG,CAAAx5L,KAAA,CACH,MAAAmB,EAAA,CAEA,IAAAu5L,EAAAlB,EAAAA,EAAAr4L,GACAw4L,CAAAA,CAAA,sBAAAe,CACA,KAGAC,EAAA,SAAAA,EAAA59L,CAAA,EACA,IAAAP,EACA,GAAAO,oBAAAA,EACAP,EAAGu8L,EAAA,6BACH,GAAAh8L,wBAAAA,EACAP,EAAGu8L,EAAA,wBACH,GAAAh8L,6BAAAA,EACAP,EAAGu8L,EAAA,8BACH,GAAAh8L,qBAAAA,EAAA,CACA,IAAA4zB,EAAAgqK,EAAA,4BACAhqK,GACAn0B,CAAAA,EAAAm0B,EAAApoB,SAAA,CAEA,SAAAxL,6BAAAA,EAAA,CACA,IAAAu/G,EAAAq+E,EAAA,oBACAr+E,GAAAk9E,GACAh9L,CAAAA,EAAAg9L,EAAAl9E,EAAA/zG,SAAA,EACA,QAEAoxL,CAAA,CAAA58L,EAAA,CAAAP,EAGAA,CAAA,EAGAo+L,EAAA,CACAzvI,UAAA,KACA,qDACA,yCACA,uDACA,uDACA,iDACA,qDACA,yDACA,0DACA,+EACA,6CACA,+CACA,uCACA,yCACA,iDACA,uDACA,uDACA,+CACA,gDACA,qEACA,iDACA,mDACA,mDACA,+BACA,uCACA,qCACA,2CACA,2CACA,wDACA,sDACA,6CACA,qDACA,kCACA,wCACA,0CACA,mDACA,2DACA,2CACA,qCACA,iEACA,2CACA,2CACA,qDACA,mDACA,iDACA,mDACA,iEACA,qDACA,qDACA,+CACA,6CACA,8CAGAz0C,EAAAjd,EAAa,MACb4vG,EAAA5vG,EAAA,MACAohM,EAAAnkL,EAAAjO,IAAA,CAAA65J,SAAA75J,IAAA,CAAA7N,MAAA2N,SAAA,CAAA2nB,MAAA,EACA4qK,EAAApkL,EAAAjO,IAAA,CAAA65J,SAAAznK,KAAA,CAAAD,MAAA2N,SAAA,CAAAi7H,MAAA,EACAu3D,EAAArkL,EAAAjO,IAAA,CAAA65J,SAAA75J,IAAA,CAAAyR,OAAA3R,SAAA,CAAA6V,OAAA,EACA48K,EAAAtkL,EAAAjO,IAAA,CAAA65J,SAAA75J,IAAA,CAAAyR,OAAA3R,SAAA,CAAAnN,KAAA,EAAA6/L,EAAAvkL,EAAAjO,IAAA,CAAA65J,SAAA75J,IAAA,CAAAwmD,OAAA1mD,SAAA,CAAA6hB,IAAA,EAIA8wK,EAAA,qGACAC,EAAA,WACAC,EAAA,SAAAv6L,CAAA,EACA,IAAAS,EAAA05L,EAAAn6L,EAAA,KACAojG,EAAA+2F,EAAAn6L,EAAA,IACA,GAAAS,MAAAA,GAAA2iG,MAAAA,EACA,MAAG,IAAAqxF,EAAA,kDACH,GAAArxF,MAAAA,GAAA3iG,MAAAA,EACA,UAAAg0L,EAAA,kDAEA,IAAAv3L,EAAA,GAIA,OAHAg9L,EAAAl6L,EAAAq6L,EAAA,SAAAhkK,CAAA,CAAAx2B,CAAA,CAAAo5J,CAAA,CAAAuhC,CAAA,EACEt9L,CAAA,CAAAA,EAAA/C,MAAA,EAAA8+J,EAAAihC,EAAAM,EAAAF,EAAA,MAAAz6L,GAAAw2B,CAAA,GAEFn5B,CACA,EAGAu9L,EAAA,SAAAv+L,CAAA,CAAA4uL,CAAA,EACA,IACA4P,EADAC,EAAAz+L,EAOA,GALAssG,EAAAuxF,EAAAY,IAEAA,CAAAA,EAAA,IAAAD,CADAA,EAAAX,CAAA,CAAAY,EAAA,CACA,SAGAnyF,EAAAswF,EAAA6B,GAAA,CACA,IAAAh/L,EAAAm9L,CAAA,CAAA6B,EAAA,CAIA,GAHAh/L,IAAAi9L,GACAj9L,CAAAA,EAAAm+L,EAAAa,EAAA,EAEA,SAAAh/L,GAAA,CAAAmvL,EACA,UAAAG,EAAA,aAAA/uL,EAAA,wDAGA,OACAw+L,MAAAA,EACAx+L,KAAAy+L,EACAh/L,MAAAA,CACA,QAGA,IAAA84L,EAAA,aAAAv4L,EAAA,oBAGAlD,CAAAA,EAAAC,OAAA,UAAAiD,CAAA,CAAA4uL,CAAA,EACA,oBAAA5uL,GAAAA,IAAAA,EAAA/B,MAAA,CACA,UAAA8wL,EAAA,6CAEA,GAAA54J,UAAAl4B,MAAA,sBAAA2wL,EACA,UAAAG,EAAA,6CAGA,GAAAmP,IAAA,GAAAA,EAAA,cAAAl+L,GACA,UAAAu4L,EAAA,sFAEA,IAAA52K,EAAA08K,EAAAr+L,GAAA0+L,EAAA/8K,EAAA1jB,MAAA,GAAA0jB,CAAA,OAGAktK,EAAA0P,EAAA,IAAAG,EAAA,IAAA9P,GACA+P,EAAA9P,EAAA7uL,IAAA,CACAP,EAAAovL,EAAApvL,KAAA,CAAAm/L,EAAA,GAGAJ,EAAA3P,EAAA2P,KAAA,CACAA,IACAE,EAAAF,CAAA,IACAT,EAAAp8K,EAAAm8K,EAAA,MAAAU,KAGA,QAAAn7L,EAAA,EAAAw7L,EAAA,GAAAx7L,EAAAse,EAAA1jB,MAAA,CAAAoF,GAAA,GACA,IAAA66J,EAAAv8I,CAAA,CAAAte,EAAA,CACAkB,EAAA05L,EAAA//B,EAAA,KACAh3D,EAAA+2F,EAAA//B,EAAA,IACA,GACA,CACA,MAAA35J,GAAAA,MAAAA,GAAAA,MAAAA,GACA2iG,MAAAA,GAAAA,MAAAA,GAAAA,MAAAA,CAAA,GAEA3iG,IAAA2iG,EAEA,UAAAqxF,EAAA,wDASA,GAPA,gBAAAr6B,GAAA2gC,GACAD,CAAAA,EAAA,IAGAF,GAAA,IAAAxgC,EAGA5xD,EAAAswF,EAHA+B,EAAA,IAAAD,EAAA,KAIAj/L,EAAIm9L,CAAA,CAAA+B,EAAA,MACJ,GAAAl/L,IAAA,EAAAA,EAAA,CACA,IAAAy+J,CAAAA,KAAAz+J,CAAA,GACA,IAAAmvL,EACA,UAAAG,EAAA,sBAAA/uL,EAAA,+CAEA,MACA,IACAk8L,GAAA,KAAAv6K,EAAA1jB,MAAA,EACA,IAAA2+C,EAAAs/I,EAAAz8L,EAAAy+J,GAWAz+J,EADAo/L,CAVAA,EAAA,EAAAjiJ,CAAA,GAUA,QAAAA,GAAA,oBAAAA,EAAA98B,GAAA,EACM88B,EAAA98B,GAAA,CAENrgB,CAAA,CAAAy+J,EAAA,MAGA2gC,EAAAvyF,EAAA7sG,EAAAy+J,GACAz+J,EAAAA,CAAA,CAAAy+J,EAAA,CAGA2gC,GAAA,CAAAD,GACAhC,CAAAA,CAAA,CAAA+B,EAAA,CAAAl/L,CAAA,CAEA,EAEA,OAAAA,CAAA,iBAAA3C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECtWa,aAIb,IAAAw/L,EAAAzN,EAF0C,KAE1C,wCAGA,GAAAyN,EACA,IACAA,EAAG,YACH,OAAA93L,EAAA,CAEA83L,EAAA,KACA,EAEAn/L,OAAA,CAAAm/L,CAAA,gBAAAp/L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECfa,aAEqC,IAAAyyL,EAAAzyL,EAAA,MAGlDoiM,EAAA,WACA,QAAA3P,CAAA,CAGA2P,CAAAA,EAAAC,uBAAA,YAEA,IAAA5P,EACA,YAEA,IACA,OAAGA,IAAAA,EAAA,aAAA1vL,MAAA,IAAAxB,MAAA,CACH,MAAAmG,EAAA,CAEA,QACA,GAEAtH,EAAAC,OAAA,CAAA+hM,CAAA,gBAAAhiM,CAAA,ECrBa,aAGb,IAAAsgB,EAAA,CACAgxC,UAAA,KACAwyC,IAAA,IAEAo+F,EAAAl/L,MAIAhD,CAAAA,EAAAC,OAAA,YAEA,QAAAqxD,UAAAhxC,CAAA,GAAAwjF,GAAA,GAAAxjF,EAAAwjF,GAAA,EACA,CAAAxjF,CAAAA,aAAA4hL,CAAA,kBAAAliM,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECda,aAGb,IAAAuiM,EAAA,oBAAoB5+L,QAAiBA,OAAA6+L,EAAAxiM,EAAA,KAGrCI,CAAAA,EAAAC,OAAA,WAAyC,OACzC,mBAAAkiM,GACA,mBAAA5+L,QACA,iBAAA4+L,EAAA,QAA0C,iBAAA5+L,OAAA,QAG1C6+L,GAAA,iBAAApiM,CAAA,ECZa,YAIbA,CAAAA,EAAAC,OAAA,YACA,sBAAAsD,QAAA,mBAA4CP,OAAA2mD,qBAAA,8BAAApmD,OAAAC,QAAA,UAG5C,IAAAoc,EAAA,GACAksF,EAAAvoG,OAAA,QACA8+L,EAAAr/L,OAAA8oG,GAAgC,oBAAAA,GAGhC9oG,oBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAk9F,IAAqE9oG,oBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAyzL,GAHrC,SAchC,IAAAC,EAAA,GAEA,IAAAx2F,KADAlsF,CAAA,CAAAksF,EAAA,CAAAw2F,EACA1iL,EAAA,SAA2E,sBAAA5c,OAAAiE,IAAA,EAAAjE,IAAAA,OAAAiE,IAAA,CAAA2Y,GAAAze,MAAA,EAE8B,mBAAA6B,OAAA+d,mBAAA,EAAA/d,IAAAA,OAAA+d,mBAAA,CAAAnB,GAAAze,MAAA,CAF9B,SAK3E,IAAAohM,EAAAv/L,OAAA2mD,qBAAA,CAAA/pC,GAA6C,OAAA2iL,EAAAphM,MAAA,EAAAohM,CAAA,MAAAz2F,GAEiB,CAAA9oG,OAAA0L,SAAA,CAAAk7C,oBAAA,CAAAh7C,IAAA,CAAAgR,EAAAksF,GAFjB,SAK7C,sBAAA9oG,OAAA+8C,wBAAA,EACA,IAAAkjH,EAAAjgK,OAAA+8C,wBAAA,CAAAngC,EAAAksF,GACA,GAAAm3D,EAAAtgK,KAAA,GAAA2/L,GAAAr/B,CAAA,IAAAA,EAAAh3I,UAAA,gBAGA,mBAAAjsB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECzCa,aAE+B,IAAAm8L,EAAAn8L,EAAA,KAI5CI,CAAAA,EAAAC,OAAA,YACA,OAAA87L,KAAA,EAAAx4L,OAAAm6C,WAAA,iBAAA19C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECPa,aAGb,IAAAgP,EAAA65J,SAAA/5J,SAAA,CAAAE,IAAA,CACA4zL,EAAWx/L,OAAA0L,SAAO,CAACC,cAAe,CAAAkO,EAAAjd,EAAA,KAGlCI,CAAAA,EAAAC,OAAA,CAAA4c,EAAAjO,IAAA,CAAAA,EAAA4zL,EAAA,gBAAAxiM,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECPa,aAEmB,IAAA6iM,EAAA7iM,EAAA,MAOhC8iM,EAAA,CACAC,kBAAA,GACAC,YAAA,GACAC,aAAA,GACA50J,aAAA,GACA60J,YAAA,GACAC,gBAAA,GACAC,yBAAA,GACAC,yBAAA,GACAviK,OAAA,GACAkU,UAAA,GACA/xC,KAAA,EACA,EACAqgM,EAAA,CACAhgM,KAAA,GACA/B,OAAA,GACAuN,UAAA,GACAy0L,OAAA,GACA5D,OAAA,GACAlmK,UAAA,GACA+pK,MAAA,EACA,EACAC,EAAA,CACA,YACAC,OAAA,GACAr1J,aAAA,GACA60J,YAAA,GACAluJ,UAAA,EACA,EACA2uJ,EAAA,CACA,YACAtsI,QAAA,GACAhpB,aAAA,GACA60J,YAAA,GACAluJ,UAAA,GACA/xC,KAAA,EACA,EACA2gM,EAAA,GAIA,SAAAC,EAAAC,CAAA,SAEA,EAAAC,MAAA,CAAAD,GACIH,EAIJC,CAAA,CAAAE,EAAA,WAAAhB,CAJI,CANJc,CAAA,CAAAf,EAAAmB,UAAA,EAAAP,EAAAG,CAAA,CAAAf,EAAAoB,IAAA,EAAAN,EAaA,IAAAz0L,EAAA9L,OAAA8L,cAAA,CACAiS,EAAA/d,OAAA+d,mBAAA,CACA4oC,EAAA3mD,OAAA2mD,qBAAA,CACA5J,EAAA/8C,OAAA+8C,wBAAA,CACAtC,EAAAz6C,OAAAy6C,cAAA,CACAqmJ,EAAA9gM,OAAA0L,SAAA,CACA,SAAAq1L,EAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,oBAAAD,EAAA,CAEA,GAAAH,EAAA,KAAAK,EAAA1mJ,EAAAwmJ,GAGAE,GAAAA,IAAAL,GACAC,EAAAC,EAAAG,EAAAD,EACA,KAEAj9L,EAAA8Z,EAAAkjL,GAGAt6I,GACA1iD,CAAAA,EAAAA,EAAAovB,MAAA,CAAAszB,EAAAs6I,GAAA,EAMA,QAHAG,EAAAX,EAAAO,GAAAK,EAAAZ,EAAAQ,GAGA19L,EAAA,EAAAA,EAAAU,EAAA9F,MAAA,GAAAoF,EAAA,KAAA3D,EAAAqE,CAAA,CAAAV,EAAA,CAGA,IAAA28L,CAAA,CAAAtgM,EAAA,GAAAshM,CAAAA,GAAAA,CAAA,CAAAthM,EAAA,IAAAyhM,CAAAA,GAAAA,CAAA,CAAAzhM,EAAA,IAAAwhM,CAAAA,GAAAA,CAAA,CAAAxhM,EAAA,OAAAqgK,EAAAljH,EAAAkkJ,EAAArhM,GAGA,IAEUkM,EAAAk1L,EAAAphM,EAAAqgK,EACV,OAAA37J,EAAA,EACA,EACA,QAGA08L,CAAA,CAEAhkM,EAAAC,OAAA,CAAA8jM,CAAA,gBAAArkM,CAAA,CAAAO,CAAA,ECtGA,YACA;;;;;;;CAMA,GAGA,IAAAgZ,EAAA,mBAAA1V,QAAAA,OAAA+6K,GAAA,CAAAt2H,EAAA/uC,EAAA1V,OAAA+6K,GAAA,wBAAAz+K,EAAAoZ,EAAA1V,OAAA+6K,GAAA,uBAAAh3K,EAAA2R,EAAA1V,OAAA+6K,GAAA,yBAAAnxI,EAAAl0B,EAAA1V,OAAA+6K,GAAA,4BAAA/vK,EAAA0K,EAAA1V,OAAA+6K,GAAA,yBAAA5kJ,EAAAzgB,EAAA1V,OAAA+6K,GAAA,yBAAAv5K,EAAAkU,EAAA1V,OAAA+6K,GAAA,wBAAApxI,EAAAj0B,EAAA1V,OAAA+6K,GAAA,2BAAAl0J,EAAAnR,EAAA1V,OAAA+6K,GAAA,gCAAA/9K,EAAA0Y,EAAA1V,OAAA+6K,GAAA,4BAAAt2J,EAAA/O,EAAA1V,OAAA+6K,GAAA,yBAAA9rH,EAAAv5C,EACA1V,OAAA+6K,GAAA,wBAAc,MAAAj6K,EAAA4U,EAAA1V,OAAkC+6K,GAAA,eAAiB,MAAUl5K,EAAA6T,EAAA1V,OAAA+6K,GAAA,eAA0B,MAAAt5K,EAAAiU,EAAA1V,OAAA+6K,GAAA,sBAAAlmJ,EAAAnf,EAAA1V,OAAmD+6K,GAAA,2BAAkC,CAAAj7K,EAAA4V,EAAA1V,OAAA+6K,GAAA,0BAAA5pJ,EAA4Czb,EAAA1V,OAAA+6K,GAAA,gBAAkB,MACxP,SAAA3pJ,EAAA50B,CAAA,KAAgB,UAAG,OAAAA,GAAkB,IAAG,GAAAA,EAAA,KAAAmyD,EAAAnyD,EAAgBukM,QAAG,QAAApyI,GAAA,KAAmBlK,EAAA,OAAAjoD,EAAaA,EAAA8C,IAAA,OAAAqqC,EAAA,KAAA9iB,EAAuB,KAAA9iB,EAAA,KAAAiH,EAAA,KAAA4+B,EAAA,KAA2BnlB,EAAA,OAAAjoB,CAAA,gBAAyBA,EAAAA,GAAAA,EAAAukM,QAAa,OAAAv/L,EAAA,KAAiBxE,EAAA,KAAA6E,EAAA,KAAAf,EAAA,KAAAq1B,EAAyB,OAAA35B,CAAA,SAAa,OAAAmyD,CAAA,OAAiBryD,EAAA,OAAAqyD,CAAA,YAAiByM,EAAA5+D,CAAA,SAAa40B,EAAA50B,KAAAqqB,CAAA,CAAAnqB,EAAAskM,SAAA,CAAAr3J,EAAAjtC,EAAAukM,cAAqD,CAAAp6K,EAAAnqB,EAAAwkM,eAAoB,CAAA1/L,EAAa9E,EAAAykM,eAAiB,CAAAhrK,EAAAz5B,EAAAqG,OAAkB,CAAA0hD,EAAA/nD,EAAa2jM,UAAA,CAAArjM,EAAiBN,EAAA0kM,QAAc,CAAAr9L,EAAArH,EAAa2kM,IAAA,CAAAx/L,EAAAnF,EAAA4jM,IAAA,CAAAx/L,EAAApE,EAAA4kM,MAAA,CAAAhlM,EAC3cI,EAAA6kM,QAAc,CAAAv2L,EAAAtO,EAAa8kM,UAAA,CAAA53J,EAAAltC,EAAiB+kM,QAAA,CAAAh9K,EAAA/nB,EAAgBglM,WAAa,UAAAllM,CAAA,CAAiB,QAAA4+D,EAAA5+D,IAAA40B,EAAA50B,KAAkBmtC,CAAA,EAAAjtC,EAAailM,gBAAiB,CAAAvmI,EAAA1+D,EAAAklM,iBAAoB,UAAaplM,CAAA,SAAA40B,EAAiB50B,KAAAgF,CAAA,EAAA9E,EAAAmlM,iBAA+B,UAAArlM,CAAA,SAAA40B,EAAA50B,KAAA25B,CAAA,EAAAz5B,EAAAolM,SAAA,UAAAtlM,CAAA,yBAAAA,GAAA,OAAAA,GAAAA,EAAAukM,QAAA,GAAAt8I,CAAA,EAAA/nD,EAAAqlM,YAAA,UAAAvlM,CAAA,SAAA40B,EAAA50B,KAAAQ,CAAA,EAAAN,EAAAslM,UAAA,UAAAxlM,CAAA,SAAA40B,EAAA50B,KAAAuH,CAAA,EAAArH,EAAAulM,MAAA,UAAAzlM,CAAA,SAAA40B,EAAA50B,KAAAqF,CAAA,EAC3NnF,EAAA0jM,MAAA,UAAA5jM,CAAA,CAA0B,QAAA40B,EAAA50B,KAAasE,CAAA,EAAApE,EAAAwlM,QAAA,UAAA1lM,CAAA,SAAA40B,EAAA50B,KAAAF,CAAA,EAAAI,EAAAylM,UAAA,UAAA3lM,CAAA,SAAA40B,EAAA50B,KAAAwO,CAAA,EAAAtO,EAAA0lM,YAAA,UAAA5lM,CAAA,SAAA40B,EAAA50B,KAAAotC,CAAA,EAAAltC,EAAA2lM,UAAA,UAAA7lM,CAAA,SAAA40B,EAAA50B,KAAAioB,CAAA,EAA2R/nB,EAAA4lM,kBAAA,UAAA9lM,CAAA,yBAAAA,GAAA,mBAAAA,GAAAA,IAAAuH,GAAAvH,IAAAqqB,GAAArqB,IAAAwO,GAAAxO,IAAAotC,GAAAptC,IAAAioB,GAAAjoB,IAAAyyD,GAAA,iBAAAzyD,GAAA,OAAAA,GAAAA,CAAAA,EAAAukM,QAAA,GAAAl/L,GAAArF,EAAAukM,QAAA,GAAAjgM,GAAAtE,EAAAukM,QAAA,GAAA5qK,GAAA35B,EAAAukM,QAAA,GAAAv/L,GAAAhF,EAAAukM,QAAA,GAAA/jM,GAAAR,EAAAukM,QAAA,GAAAlsK,GAAAr4B,EAAAukM,QAAA,GAAAjhM,GAAAtD,EAAAukM,QAAA,GAAA5vK,GAAA30B,EAAAukM,QAAA,GAAAt/L,CAAAA,CAAA,EAAA/E,EAAA6lM,MAAA,CAAAnxK,CAAA,gBAAA30B,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECdrT,YAIXI,CAAAA,EAEDC,OAAA,CAAAL,EAAA,oBAAAF,CAAA,CAAAO,CAAA,ECLD,uFAAY,GACZA,EAAA2iG,IAAA,UAAAtgF,CAAA,CAAApJ,CAAA,CAAA2pF,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAEA,IADAz7F,EAAA8iB,EACA44E,EAAA,EAAAD,EAAAD,EAAA,EACAG,EAAA,IAAAD,CAAA,IACAE,EAAAD,GAAA,EACAE,EAAA,GACA58F,EAAAs8F,EAAAE,EAAA,IACAljG,EAAAgjG,EAAA,KAAA59F,EAAAqd,CAAA,CAAApJ,EAAA3S,EAAA,CAOoB,IALpBA,GAAA1G,EAGAyH,EAAArC,EAAA,KAAAk+F,CAAA,IACAl+F,IAAA,CAAAk+F,EACAA,GAASH,EAAWG,EAAA,EAAA77F,EAAA,IAAAA,EAAAgb,CAAA,CAAApJ,EAAA3S,EAAA,CAAAA,GAAA1G,EAAAsjG,GAAA,GAKA,IAFpB/4E,EAAA9iB,EAAA,KAAA67F,CAAA,IACA77F,IAAA,CAAA67F,EACAA,GAASL,EAAWK,EAAA,EAAA/4E,EAAA,IAAAA,EAAA9H,CAAA,CAAApJ,EAAA3S,EAAA,CAAAA,GAAA1G,EAAAsjG,GAAA,GAGpB,GAAA77F,IAAAA,EACIA,EAAA,EAAA47F,OACJ,GAAA57F,IAAA27F,EACI,OAAA74E,EAAAg5E,IAAA,CAAAn+F,EAAA,MAAAo+F,CAAAA,GAAA,EAEJj5E,GAAAnpB,KAAAs/C,GAAA,GAAAuiD,GACAx7F,GAAA47F,EACA,MACA,CAAAj+F,EAAA,MAAAmlB,EAAAnpB,KAAAs/C,GAAA,GAAAj5C,EAAAw7F,EAAA,EAGA7iG,EAAA6d,KAAA,UAAAwE,CAAA,CAAA3f,CAAA,CAAAuW,CAAA,CAAA2pF,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAEA,IADAz7F,EAAA8iB,EAAA49B,EACAg7C,EAAA,EAAAD,EAAAD,EAAA,EACAG,EAAA,IAAAD,CAAA,IACAE,EAAAD,GAAA,EACAjwC,EAAA8vC,KAAAA,EAAA7hG,qBAAA,EACAsF,EAAAs8F,EAAA,EAAAE,EAAA,EACAljG,EAAAgjG,EAAA,KAAA59F,EAAAtC,EAAA,GAAAA,IAAAA,GAAA,EAAAA,EAAA,MAmCoB,IA9BpBmE,MAHAnE,EAAA1B,KAAA+uB,GAAA,CAAArtB,KAGAA,IAAA0gG,KACAj5E,EAAAtjB,MAAAnE,GAAA,IACI2E,EAAA27F,IAEJ37F,EAAArG,KAAAwZ,KAAA,CAAAxZ,KAAA2zD,GAAA,CAAAjyD,GAAA1B,KAAAqiG,GAAA,EACA3gG,EAAAqlD,CAAAA,EAAA/mD,KAAAs/C,GAAA,IAAAj5C,EAAA,MACAA,IACA0gD,GAAA,GAEA1gD,EAAA47F,GAAA,EACMvgG,GAAAqwD,EAAAhL,EAENrlD,GAAAqwD,EAAA/xD,KAAAs/C,GAAA,KAAA2iD,GAEAvgG,EAAAqlD,GAAA,IACA1gD,IACA0gD,GAAA,GAGA1gD,EAAA47F,GAAAD,GACA74E,EAAA,EACM9iB,EAAA27F,GACN37F,EAAA47F,GAAA,GACA94E,EAAA,GAAA49B,EAAA,GAAA/mD,KAAAs/C,GAAA,GAAAuiD,GACMx7F,GAAA47F,IAEN94E,EAAAznB,EAAA1B,KAAAs/C,GAAA,GAAA2iD,EAAA,GAAAjiG,KAAAs/C,GAAA,GAAAuiD,GACAx7F,EAAA,IAGoBw7F,GAAA,EAAAxgF,CAAA,CAAApJ,EAAA3S,EAAA,CAAA6jB,IAAAA,EAAA7jB,GAAA1G,EAAAuqB,GAAA,IAAA04E,GAAA,GAID,IADnBx7F,EAAA,GAAAw7F,EAAA14E,EACA44E,GAASF,EAAUE,EAAA,EAAA1gF,CAAA,CAAApJ,EAAA3S,EAAA,CAAAe,IAAAA,EAAAf,GAAA1G,EAAAyH,GAAA,IAAA07F,GAAA,GAGnB1gF,CAAA,CAAApJ,EAAA3S,EAAA1G,EAAA,EAAAoF,IAAAA,CAAA,iBAAAjF,CAAA,ECnFA,mBAAAgD,OAAA8C,MAAA,CAEA9F,EAAAC,OAAA,UAAAitG,CAAA,CAAAC,CAAA,EACAA,IACAD,EAAAE,MAAA,CAAAD,EACAD,EAAAx+F,SAAA,CAAA1L,OAAA8C,MAAA,CAAAqnG,EAAAz+F,SAAA,EACAxM,YAAA,CACAS,MAAAuqG,EACAjhF,WAAA,GACA+zB,SAAA,GACAC,aAAA,EACO,CACP,GAEE,EAGFjgD,EAAAC,OAAA,UAAAitG,CAAA,CAAAC,CAAA,EACA,GAAAA,EAAA,CACAD,EAAAE,MAAA,CAAAD,EACA,IAAAE,EAAA,YACAA,CAAAA,EAAA3+F,SAAA,CAAAy+F,EAAAz+F,SAAA,CACAw+F,EAAAx+F,SAAA,KAAA2+F,EACAH,EAAAx+F,SAAA,CAAAxM,WAAA,CAAAgrG,CACA,EACA,gBAAAltG,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC1Ba,aAGb,IAAAmmM,EAAgBnmM,EAA6B,QAE7ComM,EAAAC,EAF6C,MAE7C,6BAGAC,EAAA,SAAAvjM,CAAA,QACA,CAAAojM,CAAAA,IAAApjM,GAAA,iBAAAA,IAAAY,CAAAA,OAAAm6C,WAAA,IAAA/6C,CAAA,IAGAqjM,uBAAAA,EAAArjM,EAAA,EAGAwjM,EAAA,SAAAxjM,CAAA,QACA,EAAAujM,EAAAvjM,IAGAA,IAAA,GAAAA,GACA,iBAAAA,GACA,iBAAAA,EAAAxB,MAAA,EACAwB,EAAAxB,MAAA,KACA6kM,mBAAAA,EAAArjM,IACAqjM,sBAAAA,EAAArjM,EAAA48L,MAAA,GAGA6G,EAAA,WACC,OAAAF,EAAA7sK,UAAA,GAE0D6sK,CAAAA,EAAAC,iBAAA,CAAAA,EAE3DnmM,EAAAC,OAAA,CAAAmmM,EAAAF,EAAAC,CAAA,gBAAAnmM,CAAA,EChCa,aAGb,IAEAqmM,EACAC,EAHAC,EAAA99B,SAAA/5J,SAAA,CAAAxF,QAAA,CACAs9L,EAAA,iBAAAv+I,SAAAA,IAAA,GAAAA,SAAAA,QAAAjnD,KAAA,CAGA,sBAAAwlM,GAAA,mBAAAxjM,OAAA8L,cAAA,CACA,IACAu3L,EAAArjM,OAAA8L,cAAA,cACAkU,IAAA,WACA,MAAAsjL,CAAA,CAEA,GACAA,EAAA,GAEAE,EAAG,0BAAAH,EACH,OAAAhlM,EAAA,CACAA,IAAAilM,GACAE,CAAAA,EAAA,KAEA,MAEAA,EAAA,KAGA,IAAAC,EAAA,cACAC,EAAA,SAAA/jM,CAAA,EACA,IACA,IAAAgkM,EAAAJ,EAAA33L,IAAA,CAAAjM,GACA,OAAG8jM,EAAAnmL,IAAA,CAAAqmL,EACH,OAAAr/L,EAAA,CACA,QACA,GAGAs/L,EAAA,SAAAjkM,CAAA,EACA,IACA,GAAA+jM,EAAA/jM,GAAA,SAEA,OADA4jM,EAAA33L,IAAA,CAAAjM,GACG,EACH,OAAA2E,EAAA,CACA,QACA,CACA,EACAowI,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CACA29L,EAAA,kBACAC,EAAA,oBACAC,EAAA,6BACAC,EAAA,6BACAC,EAAA,mCACAC,EAAA,0BAA2EnB,EAAA,mBAAAxiM,QAAA,EAAAA,OAAAm6C,WAAA,CAEjDypJ,EAAA,WAG1BC,EAAA,qBACA,oBAAAt5K,SAAA,CAEA,IAAA03B,EAAA13B,SAAA03B,GAAA,CACAkyF,EAAA9oI,IAAA,CAAA42C,KAAAkyF,EAAA9oI,IAAA,CAAAkf,SAAA03B,GAAA,GACA4hJ,CAAAA,EAAA,SAAAzkM,CAAA,EAGA,IAAAwkM,GAAA,CAAAxkM,CAAA,aAAAA,GAAA,iBAAAA,CAAA,EACA,IACA,IAAAooB,EAAA2sH,EAAA9oI,IAAA,CAAAjM,GACA,OACAooB,IAAAi8K,GACAj8K,IAAAk8K,GACAl8K,IAAAm8K,GACAn8K,IAAA87K,CAAA,GACMlkM,IAAY,EAAZA,EAAA,GACN,OAAA2E,EAAA,EACA,MACA,EACA,EACA,GAGArH,OAAA,CAAAumM,EACA,SAAsB7jM,CAAA,EACtB,GAAAykM,EAAAzkM,GAAgB,SAChB,IAAAA,GACA,mBAAAA,GAAA,iBAAAA,EADA,SAEA,IACA6jM,EAAI7jM,EAAA,KAAA0jM,EACJ,OAAA/+L,EAAA,CACA,GAAAA,IAAAg/L,EAAA,SAEA,OAAAI,EAAA/jM,IAAAikM,EAAAjkM,EACA,EACA,SAAsBA,CAAA,EACtB,GAAAykM,EAAAzkM,GAAgB,SAChB,IAAAA,GACA,mBAAAA,GAAwB,iBAAAA,EADxB,SAEA,GAAAojM,EAAA,OAA6Ba,EAAAjkM,EAAA,CAC7B,GAAA+jM,EAAA/jM,GAAA,SACA,IAAA0kM,EAAA3vD,EAAA9oI,IAAA,CAAAjM,SACA,EAAA0kM,CAAAA,IAAAP,GAAAO,IAAAN,GAAA,iBAAAzmL,IAAA,CAAA+mL,EAAA,GACAT,EAAAjkM,EAAA,iBAAA3C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECpGa,aAGb,IAaA0nM,EAbA5vD,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CACAq9L,EAAA99B,SAAA/5J,SAAA,CAAAxF,QAAA,CACAq+L,EAAA,sBACAxB,EAAAnmM,EAAA,QACA+/L,EAAA38L,OAAAy6C,cAAA,CACA+pJ,EAAA,WACA,IAAAzB,EACA,QACA,CACA,IACA,OAAGt9B,SAAA,0BACH,OAAAnhK,EAAA,CACA,CACA,CAGAtH,CAAAA,EAAAC,OAAA,UAAA62B,CAAA,EACA,sBAAAA,EACA,QACA,CACA,GAAAywK,EAAAjnL,IAAA,CAAAimL,EAAA33L,IAAA,CAAAkoB,IACA,QACA,CACA,IAAAivK,EAEA,MAAAh7K,+BADA2sH,EAAA9oI,IAAA,CAAAkoB,EAEA,CACA,IAAA6oK,EACA,QACA,CACA,YAAA2H,EAAA,CACA,IAAAG,EAAAD,IACAF,EAAAG,EAAAA,GAAA9H,EAAA8H,EACA,QACA9H,EAAA7oK,KAAAwwK,CAAA,iBAAAtnM,CAAA,ECrCa,YAKbA,CAAAA,EAAAC,OAAA,UAAA0C,CAAA,EACA,OAAAA,GAAAA,CAAA,gBAAA3C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECNa,aAGb,IAAAgyL,EAAahyL,EAAQ,MAAmBwG,EAAAxG,EAAA,MAGxC++L,EAAkB/+L,EAAQ,MAC1B8nM,EAAW9nM,EAAgB,MAAA+nM,EAAA/nM,EAAA,MAE3BinB,EAAA+qK,EAAA8V,IAAA7uL,QAKAzS,EAAAygB,EAAA,CACA6gL,YAAAA,EACA/I,eAAAA,EACCgJ,KAAAA,CAAA,GAED3nM,EAAAC,OAAA,CAAA4mB,CAAA,gBAAA7mB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECnBa,aAEkC,IAAA++L,EAAA/+L,EAAA,KAG/CI,CAAAA,EAAAC,OAAA,mBACA,OAAA6G,KAAA,EAAA+R,OAAA/R,KAAA,CAAAs8F,MAAA,CAAAvqF,OAAA/R,KAAA,MACA+R,OAAA/R,KAAA,CAEA63L,CADA,CACA,gBAAA3+L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECTa,aAGb,IAAAwG,EAAAxG,EAAkB,MAAoB8nM,EAAA9nM,EAAA,KAKtCI,CAAAA,EAAAC,OAAA,YACA,IAAA4mB,EAAA6gL,IAMA,OALAthM,EAAAyS,OAAA,CAAA/R,MAAA+f,CAAA,GACA/f,MAAA,WACA,OAAA+R,OAAA/R,KAAA,GAAA+f,CACE,CACF,GACAA,CAAA,iBAAA7mB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECfa,aAEoC,IAAAgoM,EAAAhoM,EAAA,KAIjDI,CAAAA,EAAAC,OAAA,UAAA0C,CAAA,EACA,QAAAilM,EAAAjlM,EAAA,iBAAA3C,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECPa,aAGb,IAAAioM,EAAAjoM,EAAwB,MAAAkoM,EAAA,CAA+BC,EAAAnoM,EAAA,MAevDooM,EAAA,SAAAC,CAAA,CAAA1jM,CAAA,EACA,qBAAAyjM,CAAA,EACA,WAAAA,EAAAC,EAAA1jM,EAAA,CAGAA,GACAA,CAAAA,EAAA,IAGA,KAAAA,OAAA,EACA2jM,QAAA,SAAA3jM,EAAA2jM,OAAA,CAAA3jM,EAAA2jM,OAAA,MACAC,SAAA,SAAA5jM,EAAA4jM,QAAA,CAAA5jM,EAAA4jM,QAAA,MACA/jJ,UAAA,SAAA7/C,EAAA6/C,SAAA,CAAA7/C,EAAA6/C,SAAA,mBAAAyjJ,GAAA,EACAnlI,QAAA,SAAAn+D,EAAAm+D,OAAA,CAAAn+D,EAAAm+D,OAAA,GACA0lI,mBAAA,kBAAA7jM,EAAA6jM,kBAAA,EAAA7jM,EAAA6jM,kBAAA,EAGA,KAAAH,UAAA,CAAAA,CAAA,CAEAjoM,CAAAA,EAAAC,OAAA,CAAA+nM,EAYAA,EAAAt5L,SAAA,CAAA+W,OAAA,UAAA7B,CAAA,CAAAyb,CAAA,CAAA90B,CAAA,CAAAiZ,CAAA,MA8CAlhB,EA7CA,IAAA9C,EAAA,KAAAimB,EAAA,KAGA4iL,EAAAtnM,MAAA6D,OAAA,CAAAgf,IAAA,mBAAAyb,EAGA,YAAA96B,OAAA,CAAAm+D,OAAA,EAAA2lI,EACA,0DAGA,IAAAC,EAAA,CAAAD,GAAAzkL,GAAA,iBAAAA,GAAA,mBAAAyb,EAGA,GAAAgpK,GAAAC,EACA9kL,EAAA6b,EACI5Z,EAAA7B,MACJ,CACA,mBAAArZ,IACAiZ,EAAAjZ,EAEAA,EAAAvG,KAAAA,GAEA,IAAAukM,EAAA,mBAAA/kL,EAGA,IACAiC,EAAAsiL,EAAAnkL,EAAAyb,EAAA90B,EAAA,CACA65C,UAAA,KAAA7/C,OAAA,CAAA6/C,SAAA,CACAse,QAAA,KAAAn+D,OAAA,CAAAm+D,OAAA,CACO0lI,mBAAA,KAAA7jM,OAAA,CAAA6jM,kBAAA,EAEP,OAAAz9L,EAAA,CACA,GAAA49L,EACA,OAAA/kL,EAAA7Y,EACA,OACAA,CAAA,CAIA,IAAA49L,EACA,OAAA9iL,CAAA,CAEA,GAIA,CACInjB,EAAAoB,KAAAC,SAAA,CAAA8hB,EAAA,KAAAlhB,OAAA,CAAA4jM,QAAA,CACJ,OAAAx9L,EAAA,CACA,OAAA6Y,EAAA7Y,EAAA,CAQA,OALA,KAAAs9L,UAAA,CAAA3lM,EAAA,SAAAqI,CAAA,CAAAwa,CAAA,EACG3lB,EAAAgpM,cAAA,CAAA79L,EAAAwa,EAAA3B,EAAA,GAIHiC,CAAA,EAUAuiL,EAAAt5L,SAAA,CAAA85L,cAAA,UAAA79L,CAAA,CAAAsb,CAAA,CAAAzC,CAAA,MAYA2B,EAXA,GAAAxa,EAAA,CACA6Y,EAAA7Y,GACA,UAGA,CAAAsb,EAGA,OAAAzC,GAAA,CAIA,IACI2B,EAAAzhB,KAAA2f,KAAA,CAAA4C,EAAA,KAAA1hB,OAAA,CAAA2jM,OAAA,CACJ,OAAAv9L,EAAA,CACA,OAAA6Y,EAAA7Y,EAAA,CAGA,GAAA6Y,IAAAA,EAAAriB,MAAA,EAGA,IAAAJ,MAAA6D,OAAA,CAAAugB,GAiBA,OAAA3B,EAAA,KAAA2B,EAAAhf,KAAA,CAAAgf,EAAAjhB,MAAA,CAEA,EAfA,IAAAsqG,EAAA,SAAA5kG,CAAA,EACA,gBAAAA,EAAAzD,KAAA,EAGAsiM,EAAA,SAAA7+L,CAAA,EACA,OAAA4kG,EAAA5kG,EAAA,EAGA,OAAA4Z,EAAA,KAAA2B,EAAAoF,MAAA,CAAAikF,GAAArpF,EAAAoF,MAAA,CAAAk+K,GACM,CAON,GAGA,KAAAtjL,EAAA,iBAAAnlB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EClKa,aAEkB,IAAAioM,EAAAjoM,EAAA,MAAAkoM,EAAA,CAgB/BC,EAAA,SAAAnkL,CAAA,CAAAyb,CAAA,CAAA90B,CAAA,CAAAhG,CAAA,EACA,oBAAAqf,EACA,gBAAAA,EAAA,qBAEArf,EAAAA,GAAA,GAIA,IAAAm+D,EAAA,iBAAAn+D,EAAAm+D,OAAA,CAAAn+D,EAAAm+D,OAAA,GACA,GAAAA,IAAAA,GAAAA,IAAAA,EACA,gBAAAA,EAAA,mBAGA,IAAAj9C,EAAA,CACA7B,OAAAA,CAAA,EAOA,GAJA,IAAA8+C,GACAj9C,CAAAA,EAAAnb,OAAA,QAGA+0B,EAAA,CAEA,oBAAAA,GAAA,CAAAt+B,MAAA6D,OAAA,CAAAy6B,GACA,gBAAAA,EAAA,wCAEA5Z,EAAA4Z,MAAA,CAAAA,CAAA,IAIA,SAAA90B,EAAA,CACA,IAAA65C,EAAA,mBAAA7/C,EAAA6/C,SAAA,CAAA7/C,EAAA6/C,SAAA,mBAAAyjJ,GAAA,EACIpiL,EAAAlb,EAAA,CAAA65C,EAAA3+B,EAAAlhB,EACJ,MAAAm+D,IAAAA,GAAAn4D,IAAA,GAAAA,EAEAhG,EAAA6jM,kBAAyB,EACzB3iL,CAAAA,EAAAlb,EAAA,OAGAkb,EAAAlb,EAAA,CAAAA,CAAA,CAGA,OAAAkb,CAAA,CAEAzlB,CAAAA,EAAAC,OAAA,CAAA8nM,CAAA,gBAAA/nM,MAAA,CAAAC,OAAA,CAAAL,mBAAA,EC9DA,IACAsyK,8BADA5pJ,QAAA1oB,oBAAA,OAUA,wBAGA,IAAA8oM,MAAA,wBACAC,OAAA,iBAAAr6L,OACAmjB,KAAAk3K,OAAAr6L,OAAA,GACAmjB,KAAAm3K,mBAAA,EACAD,CAAAA,OAAA,IAEA,IAAAE,WAAA,CAAAF,QAAA,iBAAAnpM,KACAspM,QAAA,CAAAr3K,KAAAs3K,oBAAA,mBAAAzgL,SAAAA,QAAA+uE,QAAA,EAAA/uE,QAAA+uE,QAAA,CAAA7lE,IAAA,CACAs3K,QACIr3K,KAAA7xB,oBAAA2O,CAAA,CACJs6L,YACAp3K,CAAAA,KAAAjyB,IAAA,EAEA,IAAAwpM,UAAwC,CAAAv3K,KAAIw3K,sBAAU,EAAAjpM,OAAAC,OAAA,CACtDipM,IAAAtpM,oBAAAupM,IAAA,CACAC,aAAA,CAAA33K,KAAA43K,yBAAA,sBAAAppL,YACAqpL,UAAA,mBAAAxuL,KAAA,KACAyuL,MAAA,gCACAC,MAAA,YACAj3I,EAAA,CACA,uFACA,sFACA,qFACA,sFACA,sFACA,uFACA,mFACA,wFACA,CAAAk3I,aAAA,uCAEAC,OAAA,GAGAj4K,CAAAA,KAAAs3K,oBAAA,GAAAhoM,MAAA6D,OAAA,GACA7D,CAAAA,MAAA6D,OAAA,UAAAgb,CAAA,EACA,MAAA5c,mBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,EACA,GAGAwpL,cAAA33K,CAAAA,KAAAk4K,iCAAA,GAAA1pL,YAAAC,MAAA,GACAD,CAAAA,YAAAC,MAAA,UAAAN,CAAA,EACA,uBAAAA,GAAAA,EAAA0C,MAAA,EAAA1C,EAAA0C,MAAA,CAAApgB,WAAA,GAAA+d,WACA,GAGA,IAAA2pL,mBAAA,SAAAC,CAAA,CAAAC,CAAA,EACA,gBAAAxnM,CAAA,EACA,WAAAynM,OAAAD,EAAA,IAAAtvE,MAAA,CAAAl4H,EAAA,CAAAunM,EAAA,EACA,GAGAG,aAAA,SAAAF,CAAA,EACA,IAAAlmL,EAAAgmL,mBAAA,MAAAE,GACAhB,SACAllL,CAAAA,EAAAqmL,SAAArmL,EAAAkmL,EAAA,EAEAlmL,EAAA9d,MAAA,YACA,WAAAikM,OAAAD,EACA,EACAlmL,EAAA42G,MAAA,UAAAl4H,CAAA,EACA,OAAAshB,EAAA9d,MAAA,GAAA00H,MAAA,CAAAl4H,EACA,EACA,QAAAiE,EAAA,EAAAA,EAAAkjM,aAAAtoM,MAAA,GAAAoF,EAAA,CACA,IAAA1D,EAAA4mM,YAAA,CAAAljM,EAAA,CACAqd,CAAA,CAAA/gB,EAAA,CAAA+mM,mBAAA/mM,EAAAinM,EACA,CACA,OAAAlmL,CAAA,EAGAqmL,SAAA,SAAArmL,MAAA,CAAAkmL,KAAA,EACA,IAAAtxB,OAAA4nB,KAAA,qBACAz/L,OAAAy/L,KAAA,4BACA8J,UAAAJ,MAAA,kBACAK,WAAA,SAAA7nM,CAAA,EACA,oBAAAA,EACQ,OAAAk2K,OAAA4xB,UAAA,CAAAF,WAAA1vE,MAAA,CAAAl4H,EAAA,QAAAs0D,MAAA,OAOR,CALA,GAAAt0D,MAAAA,EACU,YAAAomM,MAAA,QACVpmM,EAAAJ,WAAA,GAAA+d,aACA3d,CAAAA,EAAA,IAAAmK,WAAAnK,EAAA,EAGA,MAAAsC,OAAA,CAAAtC,IAAA2d,YAAAC,MAAA,CAAA5d,IACAA,EAAAJ,WAAA,GAAAvB,OACQ63K,OAAA4xB,UAAA,CAAAF,WAAA1vE,MAAA,KAAA75H,OAAA2B,IAAAs0D,MAAA,QAERhzC,OAAAthB,EACA,EAEA,OAAA6nM,UAAA,EAGAE,uBAAA,SAAAR,CAAA,CAAAC,CAAA,EACA,gBAAAlnM,CAAA,CAAAN,CAAA,EACA,WAAAgoM,WAAA1nM,EAAAknM,EAAA,IAAAtvE,MAAA,CAAAl4H,EAAA,CAAAunM,EAAA,EACA,GAGAU,iBAAA,SAAAT,CAAA,EACA,IAAAlmL,EAAAymL,uBAAA,MAAAP,EACAlmL,CAAAA,EAAA9d,MAAA,UAAAlD,CAAA,EACA,WAAA0nM,WAAA1nM,EAAAknM,EACA,EACAlmL,EAAA42G,MAAA,UAAA53H,CAAA,CAAAN,CAAA,EACA,OAAAshB,EAAA9d,MAAA,CAAAlD,GAAA43H,MAAA,CAAAl4H,EACA,EACA,QAAAiE,EAAA,EAAAA,EAAAkjM,aAAAtoM,MAAA,GAAAoF,EAAA,CACA,IAAA1D,EAAA4mM,YAAA,CAAAljM,EAAA,CACAqd,CAAA,CAAA/gB,EAAA,CAAAwnM,uBAAAxnM,EAAAinM,EACA,CACA,OAAAlmL,CAAA,EAGA,SAAAmmL,OAAAD,CAAA,CAAAU,CAAA,EACAA,GACAd,MAAA,IAAAA,MAAA,KAAAA,MAAA,IAAAA,MAAA,IAAAA,MAAA,IACAA,MAAA,IAAAA,MAAA,IAAAA,MAAA,IAAAA,MAAA,IACAA,MAAA,IAAAA,MAAA,IAAAA,MAAA,KAAAA,MAAA,KACAA,MAAA,KAAAA,MAAA,KAAAA,MAAA,KAAAA,MAAA,OACM,KAAAA,MAAA,CAAAA,QAEN,KAAAA,MAAA,qCAGAI,GACA,KAAAW,EAAA,YACA,KAAAzjK,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACM,KAAAqjK,EAAO,cAEb,KAAAD,EAAA,YACA,KAAAzjK,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,WACA,KAAAqjK,EAAA,aAGA,KAAAt4F,KAAA,MAAA3gE,KAAA,MAAAntB,KAAA,MAAAqmL,MAAA,GACA,KAAAC,SAAA,MAAAl8E,MAAA,IACA,KAAAjnH,KAAA,IACA,KAAAqiM,KAAA,CAAAA,CAAA,CA4QA,SAAAQ,WAAA1nM,CAAA,CAAAknM,CAAA,CAAAU,CAAA,EACA,IAAAjkM,EAAA1D,EAAA,OAAAD,EACA,GAAAC,WAAAA,EAAA,CACA,IAA8B2H,EAA9B8Z,EAAkB,GAAAnjB,EAAYyB,EAAAzB,MAAA,CAAAG,EAAA,EAC9B,IAAAiF,EAAA,EAAAA,EAAApF,EAAA,EAAAoF,EAEAiE,CADAA,EAAA5H,EAAAguB,UAAA,CAAArqB,EAAA,EACA,IACU+d,CAAA,CAAAhjB,IAAA,CAAAkJ,EACVA,EAAA,MACA8Z,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAA,EACU8Z,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAAA,GACVA,EAAA,OAAAA,GAAA,OACA8Z,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAA,GACA8Z,CAAA,CAAAhjB,IAAA,aACUgjB,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAAA,IAEVA,EAAA,QAAAA,KAAAA,CAAA,MAAA5H,KAAAA,EAAAguB,UAAA,GAAArqB,EAAA,EACA+d,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAA,GACA8Z,CAAA,CAAAhjB,IAAA,cACAgjB,CAAA,CAAAhjB,IAAA,aACAgjB,CAAA,CAAAhjB,IAAA,KAAAkJ,GAAAA,GAGM5H,EAAA0hB,CACN,MACA,GAAAzhB,WAAAA,EAAA,CACA,GAAAD,IAAA,GAAAA,EACU,YAAA8lM,MAAA,CACV,GAAAU,cAAAxmM,EAAAV,WAAA,GAAA+d,YACUrd,EAAA,IAAA6J,WAAA7J,QACV,IAAA7B,MAAA6D,OAAA,CAAAhC,IACA,EAAAwmM,cAAA,CAAAnpL,YAAAC,MAAA,CAAAtd,EAAA,EACA,YAAA8lM,MAAA,MAIA,YAAAA,MAAA,CAIA9lM,EAAAzB,MAAA,KACAyB,CAAAA,EAAA,IAAAmnM,OAAAD,EAAA,IAAAtvE,MAAA,CAAA53H,GAAA/B,KAAA,IAGA,IAAAgqM,EAAgB,GAAAC,EAAQ,GACxB,IAAAvkM,EAAA,EAAAA,EAAA,KAAAA,EAAA,CACA,IAAA0S,EAAArW,CAAA,CAAA2D,EAAA,GACAskM,CAAAA,CAAA,CAAAtkM,EAAA,IAAA0S,EACA6xL,CAAA,CAAAvkM,EAAA,IAAA0S,CAAA,CAEA8wL,OAAAn7L,IAAA,MAAAk7L,EAAAU,GAGA,KAAAhwE,MAAA,CAAAswE,GACA,KAAAD,OAAA,CAAAA,EACA,KAAAE,KAAA,IACA,KAAAP,YAAA,CAAAA,CACA,CAlUAT,OAAAr7L,SAAA,CAAA8rH,MAAA,UAAAl4H,CAAA,EACA,SAAAsoM,SAAA,EAGA,IAAAI,EAAAnoM,EAAA,OAAAP,EACA,GAAAO,WAAAA,EAAA,CACA,GAAAA,WAAAA,EAAA,CACA,GAAAP,IAAA,GAAAA,EACU,YAAAomM,MAAA,CACV,GAAAU,cAAA9mM,EAAAJ,WAAA,GAAA+d,YACU3d,EAAA,IAAAmK,WAAAnK,QACV,IAAAvB,MAAA6D,OAAA,CAAAtC,IACA,EAAA8mM,cAAA,CAAAnpL,YAAAC,MAAA,CAAA5d,EAAA,EACA,YAAAomM,MAAA,MAIA,YAAAA,MAAA,CAEAsC,EAAA,EACA,SAAAxgM,EAAAjE,EAAAjF,EAAA,EAAAH,EAAAmB,EAAAnB,MAAA,CAAAuoM,EAAA,KAAAA,MAAA,CAGApoM,EAAAH,GAAA,CAUA,GATA,KAAAutH,MAAA,GACA,KAAAA,MAAA,IACAg7E,CAAA,SAAAt3F,KAAA,CACAs3F,CAAA,KAAAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IACAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IACAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,KAAAA,CAAA,KACAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,QAGAsB,EACA,IAAAzkM,EAAA,KAAAkrC,KAAA,CAAAnwC,EAAAH,GAAAoF,EAAA,KAAAjF,EACAooM,CAAA,CAAAnjM,GAAA,IAAAjE,CAAA,CAAAhB,EAAA,EAAAkoM,KAAA,CAAAjjM,EAAAA,IAAA,MAGA,IAAAA,EAAA,KAAAkrC,KAAA,CAAAnwC,EAAAH,GAAAoF,EAAA,KAAAjF,EAEAkJ,CADAA,EAAAlI,EAAAsuB,UAAA,CAAAtvB,EAAA,EACA,IACYooM,CAAA,CAAAnjM,GAAA,IAAAiE,GAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,CACZiE,EAAA,MACAk/L,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,IAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,CACYmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,EACZiE,EAAA,OAAAA,GAAA,OACAk/L,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,KAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,mBAAAijM,KAAA,CAAAjjM,EAAAA,IAAA,CACYmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,GAEZiE,EAAA,QAAAA,KAAAA,CAAA,MAAAlI,KAAAA,EAAAsuB,UAAA,GAAAtvB,EAAA,EACAooM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,KAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,oBAAAijM,KAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,mBAAAijM,KAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,KAAA,CAAAjjM,EAAAA,IAAA,CAEA,CAGA,KAAA0kM,aAAA,CAAA1kM,EACA,KAAA+d,KAAA,EAAA/d,EAAA,KAAAkrC,KAAA,CACAlrC,GAAA,IACA,KAAA6rG,KAAA,CAAAs3F,CAAA,KACA,KAAAj4J,KAAA,CAAAlrC,EAAA,GACA,KAAA4pB,IAAA,GACQ,KAAAu+F,MAAA,KAER,KAAAj9E,KAAA,CAAAlrC,CAEA,CAKA,OAJA,KAAA+d,KAAA,cACA,KAAAqmL,MAAA,OAAArmL,KAAA,eACA,KAAAA,KAAA,MAAAA,KAAA,aAEA,KAvEA,EA0EAylL,OAAAr7L,SAAA,CAAAw8L,QAAA,YACA,SAAAN,SAAA,EAGA,KAAAA,SAAA,IACA,IAAAlB,EAAA,KAAAA,MAAA,CAAAnjM,EAAA,KAAA0kM,aAAA,CACAvB,CAAA,UAAAt3F,KAAA,CACAs3F,CAAA,CAAAnjM,GAAA,IAAAgjM,KAAA,CAAAhjM,EAAAA,EAAA,CACA,KAAA6rG,KAAA,CAAAs3F,CAAA,KACAnjM,GAAA,KACA,KAAAmoH,MAAA,EACA,KAAAv+F,IAAA,GAEAu5K,CAAA,SAAAt3F,KAAA,CACAs3F,CAAA,KAAAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IACAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,IACAA,CAAA,IAAAA,CAAA,IAAAA,CAAA,KAAAA,CAAA,KACAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,QAEAA,CAAA,UAAAiB,MAAA,SAAArmL,KAAA,MACAolL,CAAA,UAAAplL,KAAA,IACA,KAAA6L,IAAA,GAlBA,EAqBA45K,OAAAr7L,SAAA,CAAAyhB,IAAA,YACA,IAAAsE,EAAA02K,EAAAC,EAAAC,EAAAltE,EAAAvZ,EAAA0mF,EAAAC,EAAAC,EAAAC,EAAAC,EAAA3rM,EAAA,KAAA0qM,EAAA,CAAAxxL,EAAA,KAAA+tB,EAAA,CAAAghB,EAAA,KAAA/gB,EAAA,CAAApnC,EAAA,KAAAqnC,EAAA,CAAA5/B,EAAA,KAAA6/B,EAAA,CAAAgG,EAAA,KAAA/F,EAAA,CAAA74B,EAAA,KAAA84B,EAAA,CAAA3N,EAAA,KAAAgxK,EAAA,CAAAhB,EAAA,KAAAA,MAAA,CAGA,IAAAj1K,EAAA,GAAAA,EAAA,KAAAA,EAGA02K,EAAA,EADAhtE,EAAAurE,CAAA,CAAAj1K,EAAA,OACA,EAAA0pG,GAAA,YAAAA,GAAA,IAAAA,IAAA,EAEAitE,EAAA,EADAjtE,EAAAurE,CAAA,CAAAj1K,EAAA,MACA,GAAA0pG,GAAA,YAAAA,GAAA,IAAAA,IAAA,GACAurE,CAAA,CAAAj1K,EAAA,CAAAi1K,CAAA,CAAAj1K,EAAA,IAAA02K,EAAAzB,CAAA,CAAAj1K,EAAA,GAAA22K,GAAA,EAIA,IAAA32K,EAAA,EADAi3K,EAAAzyL,EAAA+uC,EACAvzB,EAAA,GAAAA,GAAA,EACA,KAAAhtB,KAAA,EACA,KAAAqiM,KAAA,EACAyB,EAAA,OAEA7xK,EAAAykG,CADAA,EAAAurE,CAAA,gBACA,aACU7pM,EAAAs+H,EAAA,cAEVotE,EAAA,UAEA7xK,EAAAykG,CADAA,EAAAurE,CAAA,eACA,cACA7pM,EAAAs+H,EAAA,cAEQ,KAAA12H,KAAA,MAER0jM,EAAA,OAAAprM,GAAA,YAAAA,GAAA,YAAAA,GAAA,IACAqrM,EAAA,OAAA9jM,GAAA,YAAAA,GAAA,YAAAA,GAAA,GAEA+jM,EAAAE,CADAA,EAAAxrM,EAAAkZ,CAAAA,EACAlZ,EAAAioD,EAAA0jJ,EAEAvtE,EAAAzkG,EAAA0xK,EADAE,CAAAA,EAAA,EAAAn+J,EAAA,CAAA7lC,EAAAiH,CAAA,EACAgkD,CAAA,CAAA99B,EAAA,CAAAi1K,CAAA,CAAAj1K,EAAA,CACAmwF,EAAAumF,EAAAE,EACA3xK,EAAA75B,EAAAs+H,GAAA,EACAt+H,EAAAs+H,EAAAvZ,GAAA,GAEAumF,EAAA,OAAAtrM,GAAA,YAAAA,GAAA,YAAAA,GAAA,IACAurM,EAAA,OAAA1xK,GAAA,YAAAA,GAAA,YAAAA,GAAA,GAEA2xK,EAAAG,CADAA,EAAA3rM,EAAAE,CAAAA,EACAF,EAAAoZ,EAAAsyL,EAEAptE,EAAA5vH,EAAA68L,EADAE,CAAAA,EAAA,EAAAhkM,EAAA,CAAAoyB,EAAAyT,CAAA,EACAolB,CAAA,CAAA99B,EAAA,GAAAi1K,CAAA,CAAAj1K,EAAA,GACAmwF,EAAAumF,EAAAE,EACA98L,EAAAy5C,EAAAm2E,GAAA,EAEAgtE,EAAA,EADAnjJ,EAAAm2E,EAAAvZ,GAAA,KACA,EAAA58D,GAAA,YAAAA,GAAA,YAAAA,GAAA,IACAojJ,EAAA,OAAA78L,GAAA,YAAAA,GAAA,YAAAA,GAAA,GAEA88L,EAAAI,CADAA,EAAAzjJ,EAAAnoD,CAAAA,EACAmoD,EAAAjoD,EAAAyrM,EAEArtE,EAAAhxF,EAAAi+J,EADAE,CAAAA,EAAA,EAAA5xK,EAAA,CAAAnrB,EAAAjH,CAAA,EACAirD,CAAA,CAAA99B,EAAA,GAAAi1K,CAAA,CAAAj1K,EAAA,GACAmwF,EAAAumF,EAAAE,EACAl+J,EAAAl0B,EAAAklH,GAAA,EAEAgtE,EAAA,EADAlyL,EAAAklH,EAAAvZ,GAAA,KACA,EAAA3rG,GAAA,YAAAA,GAAA,YAAAA,GAAA,IACAmyL,EAAA,OAAAj+J,GAAA,YAAAA,GAAA,YAAAA,GAAA,GAEAk+J,EAAAK,CADAA,EAAAzyL,EAAA+uC,CAAAA,EACA/uC,EAAApZ,EAAA4rM,EAEAttE,EAAA72H,EAAA8jM,EADAE,CAAAA,EAAA,EAAA/8L,EAAA,CAAA4+B,EAAAzT,CAAA,EACA64B,CAAA,CAAA99B,EAAA,GAAAi1K,CAAA,CAAAj1K,EAAA,GACAmwF,EAAAumF,EAAAE,EACA/jM,EAAAvH,EAAAo+H,GAAA,EACAp+H,EAAAo+H,EAAAvZ,GAAA,CAGA,MAAA6lF,EAAA,MAAAA,EAAA,CAAA1qM,GAAA,EACA,KAAAinC,EAAA,MAAAA,EAAA,CAAA/tB,GAAA,EACA,KAAAguB,EAAA,MAAAA,EAAA,CAAA+gB,GAAA,EACA,KAAA9gB,EAAA,MAAAA,EAAA,CAAArnC,GAAA,EACA,KAAAsnC,EAAA,MAAAA,EAAA,CAAA7/B,GAAA,EACA,KAAA8/B,EAAA,MAAAA,EAAA,CAAA+F,GAAA,EACA,KAAA9F,EAAA,MAAAA,EAAA,CAAA94B,GAAA,EACA,KAAAm8L,EAAA,MAAAA,EAAA,CAAAhxK,GAAA,GAGAqwK,OAAAr7L,SAAA,CAAA6iD,GAAA,iBAAA25I,QAAA,GAGA,IAAAT,EAAA,KAAAA,EAAA,CAAAzjK,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAqjK,EAAA,KAAAA,EAAA,CAGAn5I,EAAA+3I,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAmB,GAAAA,EAAA,CACAnB,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAtiK,GAAAA,EAAA,CACAsiK,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAriK,GAAAA,EAAA,CACAqiK,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAApiK,GAAAA,EAAA,CACAoiK,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAniK,GAAAA,EAAA,CACAmiK,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAliK,GAAAA,EAAA,CACAkiK,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAjiK,GAAAA,EAAA,CAOA,OANA,KAAAyiK,KAAA,EACAv4I,CAAAA,GAAA+3I,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,WACAA,SAAA,WAAAA,SAAA,UACAA,SAAA,UAAAA,SAAA,CAAAoB,GAAAA,EAAA,EAEAn5I,CAAA,EAEAw4I,OAAAr7L,SAAA,CAAAxF,QAAA,CAAA6gM,OAAAr7L,SAAA,CAAA6iD,GAAA,CAGAw4I,OAAAr7L,SAAA,CAAAkoD,MAAA,iBAAAs0I,QAAA,GAGA,IAAAT,EAAA,KAAAA,EAAA,CAAAzjK,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAC,EAAA,KAAAA,EAAA,CAAAqjK,EAAA,KAAAA,EAAA,CAGA38H,EAAA,CACA,6BAAA08H,IAAAA,EACA,6BAAAzjK,IAAAA,EACA,6BAAAC,IAAAA,EACA,6BAAAC,IAAAA,EACA,6BAAAC,IAAAA,EACA,6BAAAC,IAAAA,EACA,6BAAAC,IAAAA,EACA,CAIA,OAHA,KAAAyiK,KAAA,EACA/7H,EAAAtuE,IAAA,8BAAAirM,IAAAA,GAEA38H,CAAA,EAEAg8H,OAAAr7L,SAAA,CAAA7N,KAAA,CAAAkpM,OAAAr7L,SAAA,CAAAkoD,MAAA,CAGAmzI,OAAAr7L,SAAA,CAAAgR,WAAA,iBAAAwrL,QAAA,GAGA,IAAA5oL,EAAA,IAAArC,YAAA,KAAA6pL,KAAA,QACA6B,EAAA,IAAA9rL,SAAAyC,GAWA,OAVAqpL,EAAAC,SAAA,QAAAnB,EAAA,EACAkB,EAAAC,SAAA,QAAA5kK,EAAA,EACA2kK,EAAAC,SAAA,QAAA3kK,EAAA,EACA0kK,EAAAC,SAAA,SAAA1kK,EAAA,EACAykK,EAAAC,SAAA,SAAAzkK,EAAA,EACAwkK,EAAAC,SAAA,SAAAxkK,EAAA,EACAukK,EAAAC,SAAA,SAAAvkK,EAAA,EACA,KAAAyiK,KAAA,EACA6B,EAAAC,SAAA,SAAAlB,EAAA,EAEApoL,CAAA,EA4DAgoL,WAAA57L,SAAA,KAAAq7L,OAGAO,WAAA57L,SAAA,CAAAw8L,QAAA,YAEA,GADAnB,OAAAr7L,SAAA,CAAAw8L,QAAA,CAAAt8L,IAAA,OACA,KAAAm8L,KAAA,EACA,KAAAA,KAAA,IACA,IAAAc,EAAA,KAAAhrM,KAAA,GACAkpM,OAAAn7L,IAAA,WAAAk7L,KAAA,MAAAU,YAAA,EACA,KAAAhwE,MAAA,MAAAqwE,OAAA,EACA,KAAArwE,MAAA,CAAAqxE,GACA9B,OAAAr7L,SAAA,CAAAw8L,QAAA,CAAAt8L,IAAA,MACA,GAGA,IAAA3O,QAAA+pM,cACA/pM,CAAAA,QAAA02D,MAAA,CAAA12D,QACAA,QAAA6rM,MAAA,CAAA9B,aAAA,IACA/pM,QAAA02D,MAAA,CAAA8kE,IAAA,CAAA8uE,mBAAAtqM,QAAA6rM,MAAA,CAAArwE,IAAA,CAAA8uE,iBAAA,IAGAvB,UACIhpM,OAAAC,OAAA,CAAAA,SAEJwxB,KAAAklC,MAAA,CAAA12D,QAAA02D,MAAA,CACAllC,KAAAq6K,MAAA,CAAA7rM,QAAA6rM,MAAA,CACM5C,KAGNh3B,KAAAluK,IAFAkuK,CAAAA,8BAAA,YACO,OAAAjyK,OAAA,GAAA2O,IAAA,CAAA3O,QAAAL,oBAAAK,QAAAD,OAAA,GACPA,CAAAA,OAAAC,OAAA,CAAAiyK,6BAAA,EAEC,mBAAAlyK,CAAA,CAAAC,CAAA,CAAAL,CAAA,ECrgBD,IACAsyK,EADA5pJ,EAAA1oB,EAAA,OAUA,wBAGA,IAAAmsM,EAAA,wBACAC,EAAA,0BACArD,EAAA,iBAAAr6L,OACAmjB,EAAAk3K,EAAAr6L,OAAA,GACAmjB,EAAAw6K,iBAAA,EACAtD,CAAAA,EAAA,IAEA,IAAAE,EAAA,CAAAF,GAAA,iBAAAnpM,IACA,EAAAiyB,EAAAy6K,kBAAA,mBAAA5jL,GAAAA,EAAA+uE,QAAA,EAAA/uE,EAAA+uE,QAAA,CAAA7lE,IAAA,CAEIC,EAAA7xB,EAAA2O,CAAA,CACJs6L,GACAp3K,CAAAA,EAAAjyB,IAAA,EA+JA,QA7JAwpM,EAAwC,CAAAv3K,EAAI06K,oBAAA,EAAUnsM,EAAAC,OAAA,CACtDipM,EAAAtpM,EAAAupM,IAAA,CACAC,EAAA,CAAA33K,EAAA26K,uBAAA,sBAAAnsL,YACAqpL,EAAA,mBAAAxuL,KAAA,KACAuxL,EAAA,4BACAC,EAAA,yBACAC,EAAA,uBACAC,EAAA,0BACAhD,EAAA,YACAiD,EAAA,uEACA,kEACA,gEACA,yEACA,2EACAlnF,EAAA,kBACAmnF,EAAA,UACAjD,EAAA,gDACAkD,EAAA,CACA,QACA,SAIA/nM,EAAA6sB,EAAAy6K,kBAAA,GAAAnrM,MAAA6D,OAAA,CACA,SAAAgb,CAAA,EACA,MAAA5c,mBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgR,EACA,EAAA7e,MAAA6D,OAAA,CAGAsb,EAAA,GAAAuR,CAAAA,EAAAm7K,+BAAA,GAAA3sL,YAAAC,MAAA,EACA,SAAAN,CAAA,EACA,uBAAAA,GAAAA,EAAA0C,MAAA,EAAA1C,EAAA0C,MAAA,CAAApgB,WAAA,GAAA+d,WACA,EAAAA,YAAAC,MAAA,CAIA2sL,EAAA,SAAAvqM,CAAA,EACA,IAAAO,EAAA,OAAAP,EACA,GAAAO,WAAAA,EACA,OAAAP,EAAA,IAEA,GAAAO,WAAAA,GAAAP,IAAA,GAAAA,EACA,YAAAypM,EAAA,CAEA,GAAA3C,GAAA9mM,EAAAJ,WAAA,GAAA+d,YACA,WAAAxT,WAAAnK,GAAA,IAEA,IAAAsC,EAAAtC,IAAA,CAAA4d,EAAA5d,GACA,YAAAypM,EAAA,CAEA,OAAAzpM,EAAA,KAGAwqM,EAAA,SAAAxqM,CAAA,EACA,OAAAuqM,IAAAA,EAAAvqM,EAAA,IAAAnB,MAAA,EAGA4rM,EAAA,SAAAlsM,CAAA,EAEA,QADAmsM,EAAA,EAAoB,CACpBzmM,EAAA,EAAAA,EAAA1F,EAAAM,MAAA,GAAAoF,EACAymM,CAAA,CAAAzmM,EAAA,CAAA1F,CAAA,CAAA0F,EAAA,CAEA,OAAAymM,CAAA,EAGApD,EAAA,SAAA9rG,CAAA,CAAA9qD,CAAA,CAAA62J,CAAA,EACA,gBAAAvnM,CAAA,EACA,WAAAs3H,EAAA97B,EAAA9qD,EAAA8qD,GAAA08B,MAAA,CAAAl4H,EAAA,CAAAunM,EAAA,EACA,GAGAoD,EAAA,SAAAnvG,CAAA,CAAA9qD,CAAA,CAAA62J,CAAA,EACA,gBAAAvnM,CAAA,CAAA4qM,CAAA,EACA,WAAAtzE,EAAA97B,EAAA9qD,EAAAk6J,GAAA1yE,MAAA,CAAAl4H,EAAA,CAAAunM,EAAA,EACA,GAGAsD,EAAA,SAAArvG,CAAA,CAAA9qD,CAAA,CAAA62J,CAAA,EACA,gBAAAvnM,CAAA,CAAA4qM,CAAA,CAAA3sM,CAAA,CAAA0E,CAAA,EACA,OAAAye,CAAA,UAAAo6E,EAAA,CAAA08B,MAAA,CAAAl4H,EAAA4qM,EAAA3sM,EAAA0E,EAAA,CAAA4kM,EAAA,EACA,GAGAuD,EAAA,SAAAtvG,CAAA,CAAA9qD,CAAA,CAAA62J,CAAA,EACA,gBAAAjnM,CAAA,CAAAN,CAAA,CAAA4qM,CAAA,CAAAjoM,CAAA,EACA,OAAAye,CAAA,QAAAo6E,EAAA,CAAA08B,MAAA,CAAA53H,EAAAN,EAAA4qM,EAAAjoM,EAAA,CAAA4kM,EAAA,EACA,GAGAwD,EAAoB,SAAAzpL,CAAA,CAAyBomL,CAAA,CAAAlsG,CAAA,CAAA9qD,CAAA,EAC7C,QAAAzsC,EAAA,EAAAA,EAAAkjM,EAAAtoM,MAAA,GAAAoF,EAAA,CACA,IAAA1D,EAAA4mM,CAAA,CAAAljM,EAAA,CACAqd,CAAA,CAAA/gB,EAAA,CAAAmnM,EAAAlsG,EAAA9qD,EAAAnwC,EACA,CACA,OAAA+gB,CAAA,EAGAomL,EAAA,SAAAlsG,CAAA,CAAA9qD,CAAA,EACA,IAAApvB,EAAAgmL,EAAA9rG,EAAA9qD,EAAA,OAOA,OANApvB,EAAA9d,MAAA,YACA,WAAA8zH,EAAA97B,EAAA9qD,EAAA8qD,EACA,EACAl6E,EAAA42G,MAAA,UAAAl4H,CAAA,EACA,OAAAshB,EAAA9d,MAAA,GAAA00H,MAAA,CAAAl4H,EACA,EACA+qM,EAAAzpL,EAAAgmL,EAAA9rG,EAAA9qD,EAAA,EA0CMs6J,EAAA,CACN,CAAMpqM,KAAA,SAAA8vC,QAAAu5J,EAAAzuG,KAAAynB,EAAAykF,aAAAA,CAAwE,EAC9E,CAAM9mM,KAAA,OAAA8vC,QAAAw5J,EAAA1uG,KAAAynB,EAAAykF,aAAAA,CAAA,EACN,CAAM9mM,KAAA,QAAA8vC,QAAAq5J,EAAAvuG,KAAA4uG,EAAA1C,aA1CN,SAAAlsG,CAAA,CAAA9qD,CAAA,EACA,IAAApvB,EAAAqpL,EAAAnvG,EAAA9qD,EAAA,OAOA,OANApvB,EAAA9d,MAAA,UAAAonM,CAAA,EACA,WAAAtzE,EAAA97B,EAAA9qD,EAAAk6J,EACA,EACAtpL,EAAA42G,MAAA,UAAAl4H,CAAA,CAAA4qM,CAAA,EACA,OAAAtpL,EAAA9d,MAAA,CAAAonM,GAAA1yE,MAAA,CAAAl4H,EACA,EACA+qM,EAAAzpL,EAAAqpL,EAAAnvG,EAAA9qD,EAAA,CAkCM,EACN,CAAM9vC,KAAA,SAAA8vC,QAAAs5J,EAAAxuG,KAAA4uG,EAAA1C,aAhCN,SAAAlsG,CAAA,CAAA9qD,CAAA,EACA,IAAA5a,EAAAu0K,CAAA,CAAA7uG,EAAA,CACAl6E,EAAAupL,EAAArvG,EAAA9qD,EAAA,OAWA,OAVApvB,EAAA9d,MAAA,UAAAonM,CAAA,CAAA3sM,CAAA,CAAA0E,CAAA,SACA,EAAA1E,IAAAusM,EAAA7nM,GACQye,CAAA,SAAAo6E,EAAA,CAAAh4F,MAAA,CAAAonM,GAER,IAAAtzE,EAAA97B,EAAA9qD,EAAAk6J,GAAAK,OAAA,EAAAhtM,EAAA0E,EAAA,CAAAmzB,EACA,EAEAxU,EAAA42G,MAAA,UAAAl4H,CAAA,CAAA4qM,CAAA,CAAA3sM,CAAA,CAAA0E,CAAA,EACA,OAAA2e,EAAA9d,MAAA,CAAAonM,EAAA3sM,EAAA0E,GAAAu1H,MAAA,CAAAl4H,EACA,EACA+qM,EAAAzpL,EAAAupL,EAAArvG,EAAA9qD,EAAA,CAmBM,EACN,CAAA9vC,KAAA,OAAA8vC,QAAAs5J,EAAAxuG,KAAA4uG,EAAA1C,aAjBA,SAAAlsG,CAAA,CAAA9qD,CAAA,EACA,IAAA5a,EAAAu0K,CAAA,CAAA7uG,EAAA,CACAl6E,EAAAwpL,EAAAtvG,EAAA9qD,EAAA,OAOA,OANApvB,EAAA9d,MAAA,UAAAlD,CAAA,CAAAsqM,CAAA,CAAAjoM,CAAA,EACA,WAAAuoM,EAAA1vG,EAAA9qD,EAAAk6J,GAAAK,OAAA,SAAAtoM,EAAA,CAAAmzB,GAAAm1K,OAAA,EAAA3qM,EAAA,CAAAw1B,EACA,EACAxU,EAAA42G,MAAA,UAAA53H,CAAA,CAAAN,CAAA,CAAA4qM,CAAA,CAAAjoM,CAAA,EACA,OAAA2e,EAAA9d,MAAA,CAAAlD,EAAAsqM,EAAAjoM,GAAAu1H,MAAA,CAAAl4H,EACA,EACA+qM,EAAAzpL,EAAAwpL,EAAAtvG,EAAA9qD,EAAA,CAQA,GAEkBtvB,EAAA,GAAA+pL,EAAA,GAGlBlnM,EAAA,EAAAA,EAAA+mM,EAAAnsM,MAAA,GAAAoF,EAGA,QAFA2jM,EAAAoD,CAAA,CAAA/mM,EAAA,CACAu3F,EAAAosG,EAAoBpsG,IAAA,CACpBrpE,EAAA,EAAAA,EAAAqpE,EAAA38F,MAAA,GAAAszB,EAAA,CACA,IAAAsgD,EAAAm1H,EAAAhnM,IAAA,KAAA46F,CAAA,CAAArpE,EAAA,CAGA,GAFAg5K,EAAAhuM,IAAA,CAAAs1E,GACArxD,CAAA,CAAAqxD,EAAA,CAAAm1H,EAAAF,YAAA,CAAAlsG,CAAA,CAAArpE,EAAA,CAAAy1K,EAAAl3J,OAAA,EACAk3J,SAAAA,EAAAhnM,IAAA,EACA,IAAAwqM,EAAAxD,EAAAhnM,IAAA,CAAA46F,CAAA,CAAArpE,EAAA,CACAg5K,EAAAhuM,IAAA,CAAAiuM,GACAhqL,CAAA,CAAAgqL,EAAA,CAAAhqL,CAAA,CAAAqxD,EAAA,CACA,CAIA,SAAA6kD,EAAA97B,CAAA,CAAA9qD,CAAA,CAAAk6J,CAAA,EACA,KAAAxD,MAAA,IACA,KAAAzkM,CAAA,IACA,KAAA+tC,OAAA,CAAAA,EACA,KAAAk6J,UAAA,CAAAA,EACA,KAAA3qF,KAAA,IACA,KAAAqoF,SAAA,IACA,KAAAx4F,KAAA,GACA,KAAA3gE,KAAA,GACA,KAAAk8J,UAAA,MAAA7vG,CAAAA,GAAA,MACA,KAAA8vG,SAAA,MAAAD,UAAA,IACA,KAAAE,YAAA,CAAAX,GAAA,OAAA1qG,UAAA,EAAA0qG,GAAAA,CAAA,KAGA,QAAA3mM,EAAA,EAAAA,EAAA,KAAAA,EACA,KAAAtB,CAAA,CAAAsB,EAAA,EACA,CA+OA,SAAAinM,EAAA1vG,CAAA,CAAA9qD,CAAA,CAAAk6J,CAAA,EACAtzE,EAAAhrH,IAAA,MAAAkvF,EAAA9qD,EAAAk6J,EAAA,CA7OAtzE,EAAAlrH,SAAA,CAAA8rH,MAAA,UAAAl4H,CAAA,EACA,QAAAsoM,SAAA,CACA,YAAAoB,EAAA,CAEA,IAAA9nM,EAAA2oM,EAAAvqM,GACAA,EAAA4B,CAAA,IAKA,IAJA,IACAqC,EAAAiE,EADA4jG,EAAAlqG,CAAA,IACAwlM,EAAA,KAAAA,MAAA,CAAAkE,EAAA,KAAAA,SAAA,CAAAzsM,EAAAmB,EAAAnB,MAAA,CAAAwsM,EAAA,KAAAA,UAAA,CAAArsM,EAAA,EAAA2D,EAAA,KAAAA,CAAA,CAGA3D,EAAAH,GAAA,CACA,QAAAohH,KAAA,CAGA,IAAAh8G,EAAA,EAFA,KAAAg8G,KAAA,IACAmnF,CAAA,IAAoB,KAAAt3F,KAAA,CACpB7rG,EAAAonM,EAAA,IAAApnM,EACAmjM,CAAA,CAAAnjM,EAAA,EAEA,CACA,GAAA6nG,EACA,IAAA7nG,EAAA,KAAAkrC,KAAA,CAAAnwC,EAAAH,GAAAoF,EAAAqnM,EAAA,EAAAtsM,EAEAkJ,CADAA,EAAAlI,EAAAsuB,UAAA,CAAAtvB,EAAA,EACA,IACYooM,CAAA,CAAAnjM,GAAA,IAAAiE,GAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,CACZiE,EAAA,MACAk/L,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,IAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,CACYmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,EACZiE,EAAA,OAAAA,GAAA,OACAk/L,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,KAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,mBAAAijM,CAAA,CAAAjjM,EAAAA,IAAA,CACYmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,GAEZiE,EAAA,QAAAA,KAAAA,CAAA,MAAAlI,KAAAA,EAAAsuB,UAAA,GAAAtvB,EAAA,EACAooM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAA,KAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,oBAAAijM,CAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,mBAAAijM,CAAA,CAAAjjM,EAAAA,IAAA,CACAmjM,CAAA,CAAAnjM,GAAA,SAAAiE,GAAAA,CAAA,GAAAg/L,CAAA,CAAAjjM,EAAAA,IAAA,OAIA,IAAAA,EAAA,KAAAkrC,KAAA,CAAAnwC,EAAAH,GAAAoF,EAAAqnM,EAAA,EAAAtsM,EACAooM,CAAA,CAAAnjM,GAAA,IAAAjE,CAAA,CAAAhB,EAAA,EAAAkoM,CAAA,CAAAjjM,EAAAA,IAAA,CAIA,GADA,KAAA0kM,aAAA,CAAA1kM,EACAA,GAAAqnM,EAAA,CAGA,IAFA,KAAAn8J,KAAA,CAAAlrC,EAAAqnM,EACA,KAAAx7F,KAAA,CAAoBs3F,CAAA,CAAAiE,EAAgB,CACpCpnM,EAAA,EAAAA,EAAAonM,EAAA,EAAApnM,EACAtB,CAAA,CAAAsB,EAAA,EAAAmjM,CAAA,CAAAnjM,EAAA,CAEA4mC,EAAAloC,GACQ,KAAAs9G,KAAA,GACR,MACA,KAAA9wE,KAAA,CAAAlrC,CACA,CAEA,aAGAqzH,EAAAlrH,SAAA,CAAA9M,MAAA,UAAAyB,CAAA,CAAA43C,CAAA,EACA,IAAA2E,EAAAv8C,IAAAA,EAAA9C,EAAA,EACA+jB,EAAA,CAAAs7B,EAAA,CAGA,IAFAv8C,IAAA,EACAu8C,EAAAv8C,IAAAA,EACAu8C,EAAA,GACAt7B,EAAAynC,OAAA,CAAAnM,GACAv8C,IAAA,EACAu8C,EAAAv8C,IAAAA,EACA,EAAA9C,EAQA,OANA06C,EACM32B,EAAA7kB,IAAA,CAAAc,GAEN+jB,EAAAynC,OAAA,CAAAxrD,GAEA,KAAAi6H,MAAA,CAAAl2G,GACAA,EAAAnjB,MAAA,EAGAy4H,EAAAlrH,SAAA,CAAAo/L,YAAA,UAAA/iL,CAAA,EACA,IAAA7mB,EAAA2oM,EAAA9hL,GACAA,EAAA7mB,CAAA,IACA,IAAAkqG,EAAAlqG,CAAA,IACAogB,EAAA,EAAAnjB,EAAA4pB,EAAA5pB,MAAA,CACA,GAAAitG,EACA,QAAA7nG,EAAA,EAAAA,EAAAwkB,EAAA5pB,MAAA,GAAAoF,EAAA,CACA,IAAAiE,EAAAugB,EAAA6F,UAAA,CAAArqB,EACAiE,CAAAA,EAAA,IACU8Z,GAAA,EACV9Z,EAAA,KACU8Z,GAAA,EACV9Z,EAAA,OAAAA,GAAA,MACU8Z,GAAA,GAEV9Z,EAAA,QAAAA,KAAAA,CAAA,MAAAugB,KAAAA,EAAA6F,UAAA,GAAArqB,EAAA,EACA+d,GAAA,EAEM,MAENA,EAAAnjB,CACA,CAGA,OAFAmjB,GAAA,KAAA1iB,MAAA,CAAA0iB,EAAAA,GACA,KAAAk2G,MAAA,CAAAzvG,GACAzG,CAAA,EAGAs1G,EAAAlrH,SAAA,CAAA6+L,OAAA,UAAAQ,CAAA,CAAA31K,CAAA,EAEA,QADA9T,EAAA,IAAoB,CAAA1iB,MAAA,CAAAw2B,GACpB7xB,EAAA,EAAAA,EAAAwnM,EAAA5sM,MAAA,GAAAoF,EACA+d,GAAA,KAAAwpL,YAAA,CAAAC,CAAA,CAAAxnM,EAAA,EAFA,IAIAynM,EAAA,CAAA51K,EAAA9T,EAAA8T,CAAAA,EAAAA,EACAmmJ,EAAA,GAGA,OAFAA,EAAAp9K,MAAA,CAAA6sM,EACA,KAAAxzE,MAAA,CAAA+jD,GACA,MAGA3kD,EAAAlrH,SAAA,CAAAw8L,QAAA,YACA,SAAAN,SAAA,EAGA,KAAAA,SAAA,IACA,IAAAlB,EAAA,KAAAA,MAAA,CAAAnjM,EAAA,KAAA0kM,aAAA,CAAA0C,EAAA,KAAAA,UAAA,CAAA1oM,EAAA,KAAAA,CAAA,CAEA,GADAykM,CAAA,CAAAnjM,GAAA,SAAAysC,OAAA,CAAAzsC,EAAAA,EAAA,CACA,KAAA0kM,aAAA,QAAA2C,SAAA,CAEA,IAAArnM,EAAA,EADAmjM,CAAA,IAAkBA,CAAA,CAAAiE,EAAA,CAClBpnM,EAAAonM,EAAA,IAAApnM,EACAmjM,CAAA,CAAAnjM,EAAA,EAEA,CAEA,IADAmjM,CAAA,CAAAiE,EAAgB,eAChBpnM,EAAA,EAAAA,EAAAonM,EAAA,EAAApnM,EACAtB,CAAA,CAAAsB,EAAA,EAAAmjM,CAAA,CAAAnjM,EAAA,CAEA4mC,EAAAloC,GAdA,EAiBA20H,EAAAlrH,SAAA,CAAAxF,QAAA,CAAA0wH,EAAAlrH,SAAA,CAAA6iD,GAAA,iBAAA25I,QAAA,GAMA,IAHA,IAEA94F,EAFAu7F,EAAA,KAAAA,UAAA,CAAA1oM,EAAA,KAAAA,CAAA,CAAA4oM,EAAA,KAAAA,YAAA,CACArrG,EAAA,KAAAA,UAAA,CAAAj8F,EAAA,EAAAkuB,EAAA,EACA88B,EAAA,GACA98B,EAAAo5K,GAAkB,CAClB,IAAAtnM,EAAA,EAAAA,EAAAonM,GAAAl5K,EAAAo5K,EAAA,EAAAtnM,EAAA,EAAAkuB,CAAA,CAEA88B,GAAA+3I,CAAA,EADAl3F,EAAAntG,CAAA,CAAAsB,EAAA,GACA,MAAA+iM,CAAA,CAAAl3F,GAAAA,EAAA,CACAk3F,CAAA,WAAAA,CAAA,UACAA,CAAA,WAAAA,CAAA,WACAA,CAAA,WAAAA,CAAA,WAEA70K,EAAAk5K,GAAA,IAEAxgK,EADAloC,EAAA8nM,EAAA9nM,IAEAsB,EAAA,EAEA,CAWA,OAVAi8F,IAEAjxC,GAAA+3I,CAAA,EADAl3F,EAAAntG,CAAA,CAAAsB,EAAA,GACA,MAAA+iM,CAAA,CAAAl3F,GAAAA,EAAA,CACA5P,EAAA,GACAjxC,CAAAA,GAAA+3I,CAAA,WAAAA,CAAA,WAEA9mG,EAAA,GACAjxC,CAAAA,GAAA+3I,CAAA,WAAAA,CAAA,aAGA/3I,CAAA,EAGAqoE,EAAAlrH,SAAA,CAAAgR,WAAA,iBAAAwrL,QAAA,GAGA,IAGA5oL,EAHAqrL,EAAA,KAAAA,UAAA,CAAA1oM,EAAA,KAAAA,CAAA,CAAA4oM,EAAA,KAAAA,YAAA,CACArrG,EAAA,KAAAA,UAAA,CAAAj8F,EAAA,EAAAkuB,EAAA,EACAnQ,EAAA,KAAA4oL,UAAA,IAGM5qL,MAAArC,YADNuiF,EACM,OAENl+E,GAGA,IADA,IAAAzjB,EAAA,IAAAy7G,YAAAh6F,GACAmS,EAAAo5K,GAAkB,CAClB,IAAAtnM,EAAA,EAAAA,EAAAonM,GAAAl5K,EAAAo5K,EAAA,EAAAtnM,EAAA,EAAAkuB,CAAA,CACA5zB,CAAA,CAAA4zB,EAAA,CAAAxvB,CAAA,CAAAsB,EAAA,CAEAkuB,EAAAk5K,GAAA,GAEAxgK,EADAloC,EAAA8nM,EAAA9nM,GAGA,CAKA,OAJAu9F,IACA3hG,CAAA,CAAA4zB,EAAA,CAAAxvB,CAAA,CAAAsB,EAAA,CACA+b,EAAAA,EAAA/gB,KAAA,GAAA+iB,IAEAhC,CAAA,EAEAs3G,EAAAlrH,SAAA,CAAA4T,MAAA,CAAAs3G,EAAAlrH,SAAA,CAAAgR,WAAA,CAGAk6G,EAAAlrH,SAAA,CAAAkoD,MAAA,CAAAgjE,EAAAlrH,SAAA,CAAA7N,KAAA,iBAAAqqM,QAAA,GAMA,IAHA,IAEAhyL,EAAAk5F,EAFAu7F,EAAA,KAAAA,UAAA,CAAA1oM,EAAA,KAAAA,CAAA,CAAA4oM,EAAA,KAAAA,YAAA,CACArrG,EAAA,KAAAA,UAAA,CAAAj8F,EAAA,EAAAkuB,EAAA,EACA5zB,EAAA,GACA4zB,EAAAo5K,GAAkB,CAClB,IAAAtnM,EAAA,EAAAA,EAAAonM,GAAAl5K,EAAAo5K,EAAA,EAAAtnM,EAAA,EAAAkuB,CAAA,CACAvb,EAAAub,GAAA,EACA29E,EAAAntG,CAAA,CAAAsB,EAAA,CACA1F,CAAA,CAAAqY,EAAA,CAAAk5F,IAAAA,EACAvxG,CAAA,CAAAqY,EAAA,YACArY,CAAA,CAAAqY,EAAA,aACArY,CAAA,CAAAqY,EAAA,aAEAub,EAAAk5K,GAAA,GAEAxgK,EADAloC,EAAA8nM,EAAA9nM,GAGA,CAYA,OAXAu9F,IACAtpF,EAAAub,GAAA,EACA29E,EAAAntG,CAAA,CAAAsB,EAAA,CACA1F,CAAA,CAAAqY,EAAA,CAAAk5F,IAAAA,EACA5P,EAAA,GACA3hG,CAAAA,CAAA,CAAAqY,EAAA,aAEAspF,EAAA,GACA3hG,CAAAA,CAAA,CAAAqY,EAAA,eAGArY,CAAA,EAMA2sM,EAAA9+L,SAAA,KAAAkrH,EAGA4zE,EAAA9+L,SAAA,CAAAw8L,QAAA,YAEA,OADA,KAAAtpM,MAAA,MAAAsrM,UAAA,KACAtzE,EAAAlrH,SAAA,CAAAw8L,QAAA,CAAAt8L,IAAA,QAGA,IAAAu+B,EAAA,SAAAloC,CAAA,EACA,IAAAy0B,EAAAwT,EAAA3sC,EAAAk3K,EAAA3yD,EAAA2f,EAAAwpE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACAvrB,EAAA1+C,EAAAnU,EAAA8N,EAAA7N,EAAAC,EAAAqT,EAAAqgD,EAAAG,EAAAvgD,EAAArT,EAAAsT,EAAA4qE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACAC,EAAAC,EAAAx+E,EAAAy+E,EAAAnrE,EAAAorE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACAC,EAAAC,EAAgBC,EAAAC,EAAQC,EAAAC,GAAAz/E,GAAA0/E,GAAAC,GAAAC,GAAAtsE,GAAAusE,GAAAC,GAAAC,GAAAC,GAAAC,GACxB,IAAAlwM,EAAA,EAAAA,EAAA,GAAAA,GAAA,EACAk3K,EAAAxyK,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACA6/G,EAAA7/G,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAw/H,EAAAx/H,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAgpM,EAAAhpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAipM,EAAAjpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAkpM,EAAAlpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAmpM,EAAAnpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAopM,EAAAppM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KACAqpM,EAAArpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAspM,EAAAtpM,CAAA,IAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAAAA,CAAA,KAGAy0B,EAAA40K,EAAA,MAAAL,IAAA,IACA/gK,EAAAqhK,EAAA,MAAA9pE,IAAA,IACAx/H,CAAA,KAAAy0B,EACAz0B,CAAA,KAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAxT,EAAA+9I,EAAA,MAAA02B,IAAA,IACAjhK,EAAA43E,EAAA,MAAAopF,IAAA,IACAjpM,CAAA,KAAAy0B,EACAz0B,CAAA,KAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAxT,EAAA+qG,EAAA,MAAA4pE,IAAA,IACAnhK,EAAA+gK,EAAA,MAAAG,IAAA,IACAnpM,CAAA,KAAAy0B,EACAz0B,CAAA,KAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAxT,EAAAw0K,EAAA,MAAAK,IAAA,IACArhK,EAAAihK,EAAA,MAAAG,IAAA,IACArpM,CAAA,KAAAy0B,EACAz0B,CAAA,KAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAxT,EAAA00K,EAAA,MAAAtpF,IAAA,IACA53E,EAAAmhK,EAAA,MAAA52B,IAAA,IACAxyK,CAAA,KAAAy0B,EACAz0B,CAAA,KAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EACAz0B,CAAA,MAAAioC,EACAjoC,CAAA,MAAAy0B,EAAAz0B,CAAA,MAAAioC,EAGA81I,EAAA/9K,CAAA,IACAq/H,EAAAr/H,CAAA,IACAyqM,EAAA,SAAAzqM,CAAA,UACA0qM,EAAA,SAAA1qM,CAAA,UACAypM,EAAA,SAAAzpM,CAAA,UACA0pM,EAAA,SAAA1pM,CAAA,UACAqrM,GAAA,SAAArrM,CAAA,UACAsrM,GAAA,SAAAtrM,CAAA,UACAqqM,EAAA,UAAArqM,CAAA,UACAsqM,EAAA,UAAAtqM,CAAA,UACAsrH,EAAA,QAAAtrH,CAAA,SACA+pM,EAAA,QAAA/pM,CAAA,SACAkrH,EAAA,UAAAlrH,CAAA,UACAg5H,EAAA,UAAAh5H,CAAA,UACA2qM,EAAA,UAAA3qM,CAAA,UACA4qM,EAAA,UAAA5qM,CAAA,UACA2pM,EAAA,UAAA3pM,CAAA,UACA4pM,EAAA,UAAA5pM,CAAA,UACAurM,GAAA,SAAAvrM,CAAA,UACAwrM,GAAA,SAAAxrM,CAAA,UACAurH,GAAA,SAAAvrH,CAAA,QACAirM,GAAA,SAAAjrM,CAAA,QACA4+H,EAAA,SAAA5+H,CAAA,UACAgqM,EAAA,SAAAhqM,CAAA,UACAmrH,EAAA,UAAAnrH,CAAA,UACAorH,EAAA,UAAAprH,CAAA,UACA6qM,EAAA,UAAA7qM,CAAA,UACA8qM,EAAA,UAAA9qM,CAAA,UACA6pM,EAAA,UAAA7pM,CAAA,SACA8pM,EAAA,UAAA9pM,CAAA,SACAqrH,EAAA,SAAArrH,CAAA,QACA2+H,EAAA,SAAA3+H,CAAA,QACAkrM,GAAA,UAAAlrM,CAAA,SACAmrM,GAAA,UAAAnrM,CAAA,SACAiqM,EAAA,UAAAjqM,CAAA,SACAkqM,EAAA,UAAAlqM,CAAA,SACAy+H,EAAA,UAAAz+H,CAAA,UACA8+K,EAAA,UAAA9+K,CAAA,UACA+qM,EAAA,UAAA/qM,CAAA,SACAgrM,GAAA,UAAAhrM,CAAA,SACAuqM,EAAA,SAAAvqM,CAAA,QACAwqM,EAAA,SAAAxqM,CAAA,QACAupM,EAAA,UAAAvpM,CAAA,UACAwpM,EAAA,UAAAxpM,CAAA,UACA6+H,GAAA,SAAA7+H,CAAA,UACAorM,GAAA,SAAAprM,CAAA,UACAmqM,EAAA,SAAAnqM,CAAA,UACAoqM,EAAA,SAAApqM,CAAA,UACAi/K,EAAA,UAAAj/K,CAAA,UAAA0+H,EAAA,UAAA1+H,CAAA,UAGAA,CAAA,IAAA+9K,EAAA,CAAA7yD,EAAAC,EACAnrH,CAAA,IAAAq/H,EAAA,CAAArG,EAAA5N,EACAprH,CAAA,KAAAqrH,EAAA,CAAAk+E,EAAAE,EACAzpM,CAAA,KAAA2+H,EAAA,CAAA6qE,EAAAE,EACA1pM,CAAA,KAAAsrH,EAAA,CAAAsT,EAAAqrE,EACAjqM,CAAA,KAAA+pM,EAAA,CAAAC,EAAAE,EACAlqM,CAAA,KAAAuqM,EAAA,CAAAE,EAAAE,EACA3qM,CAAA,KAAAwqM,EAAA,CAAAE,EAAAE,EACA5qM,CAAA,KAAAurH,GAAA,CAAA2/E,GAAArsE,GACA7+H,CAAA,KAAAirM,GAAA,CAAAE,GAAAC,GACAprM,CAAA,IAAAkrH,EAAA,CAAAC,EAAAsT,EACAz+H,CAAA,IAAAg5H,EAAA,CAAA5N,EAAA0zD,EACA9+K,CAAA,KAAAupM,EAAA,CAAAE,EAAAE,EACA3pM,CAAA,KAAAwpM,EAAA,CAAAE,EAAAE,EACA5pM,CAAA,KAAA4+H,EAAA,CAAAqrE,EAAAE,EACAnqM,CAAA,KAAAgqM,EAAA,CAAAE,EAAAE,EACApqM,CAAA,KAAAyqM,EAAA,CAAAE,EAAAE,EACA7qM,CAAA,KAAA0qM,EAAA,CAAAE,EAAAE,EACA9qM,CAAA,KAAAkrM,GAAA,CAAArsE,GAAAwsE,GACArrM,CAAA,KAAAmrM,GAAA,CAAAC,GAAAE,GACAtrM,CAAA,IAAAmrH,EAAA,CAAAsT,EAAAwgD,EACAj/K,CAAA,IAAAorH,EAAA,CAAA0zD,EAAApgD,EACA1+H,CAAA,KAAAypM,EAAA,CAAAE,EAAAE,EACA7pM,CAAA,KAAA0pM,EAAA,CAAAE,EAAAE,EACA9pM,CAAA,KAAAiqM,EAAA,CAAAE,EAAAE,EACArqM,CAAA,KAAAkqM,EAAA,CAAAE,EAAAE,EACAtqM,CAAA,KAAA2qM,EAAA,CAAAE,EAAAE,EACA/qM,CAAA,KAAA4qM,EAAA,CAAAE,EAAAE,GACAhrM,CAAA,KAAA6+H,GAAA,CAAAwsE,GAAAE,GACAvrM,CAAA,KAAAorM,GAAA,CAAAE,GAAAE,GACAxrM,CAAA,IAAAy+H,EAAA,CAAAwgD,EAAAlB,EACA/9K,CAAA,IAAA8+K,EAAA,CAAApgD,EAAAW,EACAr/H,CAAA,KAAA2pM,EAAA,CAAAE,EAAAx+E,EACArrH,CAAA,KAAA4pM,EAAA,CAAAE,EAAAnrE,EACA3+H,CAAA,KAAAmqM,EAAA,CAAAE,EAAA/+E,EACAtrH,CAAA,KAAAoqM,EAAA,CAAAE,EAAAP,EACA/pM,CAAA,KAAA6qM,EAAA,CAAAE,EAAAR,EACAvqM,CAAA,KAAA8qM,EAAA,CAAAE,GAAAR,EACAxqM,CAAA,KAAAqrM,GAAA,CAAAE,GAAAhgF,GACAvrH,CAAA,KAAAsrM,GAAA,CAAAE,GAAAP,GACAjrM,CAAA,IAAAi/K,EAAA,CAAAlB,EAAA7yD,EACAlrH,CAAA,IAAA0+H,EAAA,CAAAW,EAAArG,EACAh5H,CAAA,KAAA6pM,EAAA,CAAAx+E,EAAAk+E,EACAvpM,CAAA,KAAA8pM,EAAA,CAAAnrE,EAAA6qE,EACAxpM,CAAA,KAAAqqM,EAAA,CAAA/+E,EAAAsT,EACA5+H,CAAA,KAAAsqM,EAAA,CAAAP,EAAAC,EACAhqM,CAAA,KAAA+qM,EAAA,CAAAR,EAAAE,EACAzqM,CAAA,KAAAgrM,GAAA,CAAAR,EAAAE,EACA1qM,CAAA,KAAAurM,GAAA,CAAAhgF,GAAA2/E,GAAAlrM,CAAA,KAAAwrM,GAAA,CAAAP,GAAAE,GAGAnrM,CAAA,KAAAwnM,CAAA,CAAAlsM,EAAA,CACA0E,CAAA,KAAAwnM,CAAA,CAAAlsM,EAAA,IAIA,GAAAyoM,EACIhpM,EAAAC,OAAA,CAAAyjB,MACJ,CACA,IAAAnd,EAAA,EAAAA,EAAAknM,EAAAtsM,MAAA,GAAAoF,EACAkrB,CAAA,CAAAg8K,CAAA,CAAAlnM,EAAA,EAAAmd,CAAA,CAAA+pL,CAAA,CAAAlnM,EAAA,EAEM2iM,GAGNh3B,KAAAluK,IAFAkuK,CAAAA,EAAA,YACO,OAAAxuJ,CAAA,GAAA9U,IAAA,CAAA3O,EAAAL,EAAAK,EAAAD,EAAA,GACPA,CAAAA,EAAAC,OAAA,CAAAiyK,CAAA,CAEC,oBAAAlyK,CAAA,MCppBDuG,EAAAlF,EAAAkF,EAAA,EAAAlF,EAAA,4BAAAkF,EAAAtF,KAAAujL,IAAA,CAAAnjL,EAAAJ,KAAAu+K,KAAA,CAAAp6K,EAAAnE,KAAA+uB,GAAA,CAAA1oB,EAAArG,KAAAqrC,GAAA,CAAA/9B,EAAAtN,KAAAwZ,KAAA,OAAAmlC,UAAA7+C,MAAAmB,YAAAqE,CAAA,CAAAlF,CAAA,WAAAkF,GAAA,KAAAoC,IAAA,CAAAtH,EAAAkF,EAAAq5C,EAAA8wJ,YAAA,yDAAAlmJ,OAAAjkD,CAAA,MAAAlF,EAAAwX,OAAAyvF,QAAA,qBAAA/hG,EAAA,QAAAA,EAAA,OAAAq5C,EAAA+wJ,MAAA,MAAA/wJ,EAAAgxJ,eAAA,CAAArqM,GAAA,SAAAA,EAAAq5C,EAAAixJ,UAAA,EAAAtqM,EAAA,IAAAq5C,EAAAixJ,UAAA,CAAAtqM,EAAA,QAAAlF,EAAAkF,IAAAgI,EAAAhI,KAAAA,EAAA,+BAAAA,EAAA,sEAAAq5C,EAAAkxJ,YAAA,CAAAvqM,EAAA,qBAAAA,EAAA,KAAAlF,EAAAu+C,EAAAmxJ,YAAA,CAAAxqM,GAAA,UAAAlF,EAAA,oCAAAkF,EAAA,uBAAAlF,CAAA,sBAAAkF,EAAA,WAAAA,EAAAq5C,EAAAixJ,UAAA,OAAAjxJ,EAAA+wJ,MAAA,uBAAApqM,EAAA,IAAAA,EAAArE,WAAA,GAAA09C,EAAA,OAAAr5C,CAAA,KAAAlF,EAAAu+C,EAAAoxJ,aAAA,CAAAzqM,GAAA,OAAAq5C,EAAA4K,MAAA,CAAAnpD,EAAA,mCAAAkF,EAAA,gBAAA0qM,eAAA,KAAA1qM,EAAA,oBAAAlF,KAAA,KAAAkF,EAAA9G,IAAA,EAAA4B,EAAA,CAAAA,IAAA,GAAA6H,QAAA,KAAA7H,CAAA,eAAAkF,EAAA9G,IAAA,MAAA8G,EAAA7D,IAAA,KAAAwG,SAAA3C,EAAA,SAAAA,GAAA,GAAAA,EAAA,uFAAApF,MAAA,QAAAoF,CAAAA,EAAAA,EAAA,GAAAq5C,EAAAsxJ,wBAAA,MAAA3qM,GAAAq5C,EAAAuxJ,iBAAA,MAAA5qM,EAAA,WAAAgY,SAAAhY,CAAA,MAAAlF,EAAAkF,EAAApF,MAAA,QAAAE,EAAA,gBAAAA,EAAA,KAAAA,EAAAkF,EAAA6qM,eAAA,WAAA7qM,EAAAoC,IAAA,EAAAtH,EAAAA,CAAA,KAAA+D,EAAAmB,EAAA8qM,OAAA,CAAAhwM,EAAA,GAAAiG,EAAAs4C,EAAA0xJ,OAAA,CAAAlsM,GAAA7E,EAAA,GAAAc,EAAAiG,EAAA,QAAA/G,EAAA,OAAAgG,EAAAoC,IAAA,EAAA06F,IAAA,QAAA90F,EAAAhO,EAAA,EAAA0E,EAAAG,EAAA8nC,EAAA7rC,EAAA,EAAAgD,EAAAiD,EAAA,EAAAvH,EAAA,KAAAsE,EAAA,EAAAY,GAAAZ,CAAA,CAAAtE,KAAA,OAAAmyD,EAAA7tD,EAAA,GAAAxE,EAAA,IAAAwE,EAAA,EAAAY,GAAA,GAAAZ,CAAA,CAAAq1B,EAAA,GAAAr1B,EAAA,MAAA6tD,GAAA,EAAAhlB,GAAAA,CAAAA,IAAAntC,GAAAkF,CAAAA,EAAAsB,EAAA8qM,OAAA,CAAAnkK,EAAA,OAAAglB,EAAAryD,EAAAoF,GAAAitD,EAAA,EAAAx4B,EAAAw4B,EAAA,KAAAx4B,GAAA,EAAAwT,GAAAA,IAAAjoC,EAAAsB,EAAA8qM,OAAA,CAAAnkK,GAAArtC,GAAA,IAAA65B,EAAAz0B,GAAAy0B,EAAA,GAAAz0B,IAAA,GAAAy0B,CAAA,CAAAA,GAAA,OAAAtP,EAAAw1B,EAAA2xJ,gBAAA,CAAAhrM,EAAAmzB,EAAAwT,EAAAjoC,GAAA,QAAAmlB,GAAA,IAAAA,GAAA,MAAAvqB,CAAAA,CAAA,MAAAA,CAAAA,EAAAA,EAAA,WAAAE,EAAAA,IAAA,IAAAA,CAAAA,EAAA,SAAAwO,CAAA,SAAAhI,EAAAoC,IAAA,EAAA06F,IAAA,QAAApqF,EAAA1S,EAAAoC,IAAA,sBAAA4F,EAAAA,EAAA,SAAAqxC,EAAA4xJ,oBAAA,IAAAv4L,EAAA1K,EAAAxO,EAAA6/C,EAAA4xJ,oBAAA,IAAA3xM,EAAA+/C,EAAA6xJ,sBAAA,WAAAC,WAAAnrM,CAAA,SAAAA,EAAApF,MAAA,QAAAoF,CAAA,KAAAlF,EAAAkF,EAAAorM,MAAA,UAAAtwM,EAAAsH,IAAA,EAAApC,EAAAoC,IAAA,CAAAtH,CAAA,QAAAuwM,WAAArrM,CAAA,SAAAA,EAAAoC,IAAA,CAAAi3C,EAAAiyJ,gBAAA,CAAAtrM,GAAAurM,MAAA,GAAAlyJ,EAAAmyJ,gBAAA,CAAAxrM,EAAA,WAAAs8J,aAAAt8J,CAAA,CAAAlF,CAAA,KAAAA,EAAAsH,IAAA,sDAAAtH,EAAAF,MAAA,QAAAy+C,EAAAixJ,UAAA,cAAAtqM,EAAApF,MAAA,QAAAoF,CAAA,QAAAA,EAAApF,MAAA,MAAAoF,EAAA8qM,OAAA,WAAA9qM,EAAAoC,IAAA,QAAAtH,EAAAgwM,OAAA,KAAAzxJ,EAAA8xJ,UAAA,CAAAnrM,GAAAA,CAAA,MAAAlF,EAAAF,MAAA,wCAAAiE,EAAA/D,EAAA+vM,eAAA,WAAAhsM,EAAA,OAAAmB,CAAA,IAAAnB,GAAAw6C,EAAAoyJ,gBAAA,2CAAAzrM,EAAApF,MAAA,MAAAoF,EAAA8qM,OAAA,SAAAhwM,EAAA,KAAA+D,EAAA,IAAAkC,EAAAf,EAAAoC,IAAA,QAAAvD,CAAAA,EAAA7E,EAAA,IAAAq/C,EAAAv+C,EAAAiG,GAAA/G,EAAA0xM,kBAAA,OAAA1jM,EAAA,GAAAnJ,EAAA,UAAA7E,EAAA2xM,UAAA,CAAA7wM,EAAA,EAAAkN,GAAAhO,CAAA,KAAA+G,EAAA,KAAA/G,EAAAgG,EAAA,UAAAnB,CAAAA,GAAAkC,CAAAA,EAAAf,CAAAA,EAAAnB,IAAA,MAAAA,EAAAA,IAAA,EAAA7E,EAAAq/C,EAAAqtE,QAAA,CAAA1sH,EAAAA,GAAA,MAAA6E,CAAAA,IAAAkC,EAAA,OAAAA,EAAA/G,EAAAq/C,EAAAqtE,QAAA,CAAA3lH,EAAA/G,GAAA,QAAA+G,CAAA,QAAA2lH,SAAA5rH,CAAA,CAAA+D,CAAA,SAAA/D,EAAAF,MAAA,QAAAE,CAAA,QAAA+D,EAAAjE,MAAA,QAAAiE,CAAA,KAAAmB,EAAAlF,EAAAF,MAAA,CAAAiE,EAAAjE,MAAA,KAAAE,EAAA8wM,QAAA,GAAA/sM,EAAA+sM,QAAA,IAAA5rM,IAAA,IAAAe,EAAA,IAAAs4C,EAAAr5C,EAAAlF,EAAAsH,IAAA,GAAAvD,EAAAuD,IAAA,EAAArB,EAAA2qM,kBAAA,WAAA1xM,EAAA,EAAAA,EAAAc,EAAAF,MAAA,CAAAZ,IAAAq/C,EAAAwyJ,oBAAA,CAAAhtM,EAAA/D,EAAAgwM,OAAA,CAAA9wM,GAAA+G,EAAA/G,GAAA,OAAA+G,EAAAwqM,MAAA,UAAAtzC,OAAAj4J,CAAA,CAAAlF,CAAA,MAAAd,EAAA,OAAAc,EAAAF,MAAA,2CAAAy+C,EAAAyyJ,iBAAA,CAAA9rM,EAAAlF,GAAA,OAAAu+C,EAAA+wJ,MAAA,OAAAvrM,EAAAmB,EAAAoC,IAAA,GAAAtH,EAAAsH,IAAA,CAAArB,EAAAjG,EAAA+vM,eAAA,WAAA/vM,EAAAF,MAAA,SAAAmG,EAAA,QAAAA,EAAA,OAAAlC,IAAAmB,EAAAoC,IAAA,CAAApC,EAAAq5C,EAAA8xJ,UAAA,CAAAnrM,EAAA,CAAAhG,EAAAq/C,EAAA0yJ,kBAAA,CAAA/rM,EAAAe,EAAA,WAAA/G,EAAAq/C,EAAA2yJ,kBAAA,CAAAhsM,EAAAlF,EAAA,cAAAd,EAAAoI,IAAA,CAAAvD,EAAA7E,EAAAuxM,MAAA,UAAArzC,UAAAl4J,CAAA,CAAAlF,CAAA,SAAAA,EAAAF,MAAA,2CAAAy+C,EAAAyyJ,iBAAA,CAAA9rM,EAAAlF,GAAA,OAAAkF,CAAA,KAAAnB,EAAA/D,EAAA+vM,eAAA,WAAA/vM,EAAAF,MAAA,SAAAiE,EAAA,QAAAA,EAAA,OAAAw6C,EAAA+wJ,MAAA,OAAAtvM,EAAAu+C,EAAA4yJ,kBAAA,CAAAjsM,EAAAnB,GAAA,WAAA/D,EAAAu+C,EAAA+wJ,MAAA,GAAA/wJ,EAAAixJ,UAAA,CAAAxvM,EAAAkF,EAAAoC,IAAA,MAAArB,EAAAs4C,EAAA2yJ,kBAAA,CAAAhsM,EAAAlF,EAAA,cAAAiG,EAAAqB,IAAA,CAAApC,EAAAoC,IAAA,CAAArB,EAAAwqM,MAAA,UAAAtsM,IAAAe,CAAA,CAAAlF,CAAA,MAAA+D,EAAAmB,EAAAoC,IAAA,QAAAvD,IAAA/D,EAAAsH,IAAA,CAAAi3C,EAAA6yJ,aAAA,CAAAlsM,EAAAlF,EAAA+D,GAAA,GAAAw6C,EAAAyyJ,iBAAA,CAAA9rM,EAAAlF,GAAAu+C,EAAA8yJ,aAAA,CAAAnsM,EAAAlF,EAAA+D,GAAAw6C,EAAA8yJ,aAAA,CAAArxM,EAAAkF,EAAA,CAAAnB,EAAA,QAAA2nH,SAAAxmH,CAAA,CAAAlF,CAAA,MAAA+D,EAAAmB,EAAAoC,IAAA,QAAAvD,IAAA/D,EAAAsH,IAAA,IAAAi3C,EAAAyyJ,iBAAA,CAAA9rM,EAAAlF,GAAAu+C,EAAA8yJ,aAAA,CAAAnsM,EAAAlF,EAAA+D,GAAAw6C,EAAA8yJ,aAAA,CAAArxM,EAAAkF,EAAA,CAAAnB,EAAA,CAAAw6C,EAAA6yJ,aAAA,CAAAlsM,EAAAlF,EAAA+D,EAAA,QAAAutM,UAAApsM,CAAA,CAAAlF,CAAA,aAAAA,EAAAF,MAAA,MAAAoF,EAAApF,MAAA,CAAAoF,EAAAlF,EAAAsH,IAAA,CAAAi3C,EAAAgzJ,sBAAA,CAAArsM,EAAAlF,GAAAu+C,EAAAizJ,qBAAA,CAAAtsM,EAAAlF,EAAA,QAAAyxM,iBAAAvsM,CAAA,CAAAlF,CAAA,aAAAA,EAAAF,MAAA,MAAAoF,EAAApF,MAAA,CAAAoF,EAAAlF,EAAAsH,IAAA,CAAAi3C,EAAAizJ,qBAAA,CAAAtsM,EAAAlF,GAAAu+C,EAAAgzJ,sBAAA,CAAArsM,EAAAlF,EAAA,QAAA0xM,oBAAA,gFAAAp0C,SAAAp4J,CAAA,CAAAlF,CAAA,WAAAu+C,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,EAAA,QAAAqgK,gBAAAn7J,CAAA,CAAAlF,CAAA,YAAAu+C,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,EAAA,QAAAg9J,YAAA93J,CAAA,CAAAlF,CAAA,WAAAu+C,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,EAAA,QAAAogK,mBAAAl7J,CAAA,CAAAlF,CAAA,YAAAu+C,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,EAAA,QAAAsvG,MAAAtvG,CAAA,CAAA+D,CAAA,KAAA/D,EAAAsH,IAAA,GAAAvD,EAAAuD,IAAA,EAAAtH,EAAAF,MAAA,GAAAiE,EAAAjE,MAAA,kBAAAmG,EAAA,EAAAA,EAAAjG,EAAAF,MAAA,CAAAmG,IAAA,GAAAjG,EAAAgwM,OAAA,CAAA/pM,KAAAlC,EAAAisM,OAAA,CAAA/pM,GAAA,yBAAAspG,SAAArqG,CAAA,CAAAlF,CAAA,SAAAu+C,EAAA+wD,KAAA,CAAApqG,EAAAlF,EAAA,QAAA4xM,WAAA1sM,CAAA,CAAAlF,CAAA,MAAAkF,EAAAoC,IAAA,GAAAtH,EAAAsH,IAAA,QAAAi3C,EAAAszJ,aAAA,CAAA3sM,EAAAlF,GAAAywM,MAAA,MAAAvrM,EAAAoC,IAAA,EAAAtH,EAAAsH,IAAA,MAAAvD,EAAAkC,EAAAf,EAAApF,MAAA,CAAAE,EAAAF,MAAA,IAAAZ,EAAAq/C,EAAAiyJ,gBAAA,CAAAtrM,EAAAnB,GAAAmJ,EAAAqxC,EAAAiyJ,gBAAA,CAAAxwM,GAAA,OAAAd,EAAAq/C,EAAAuzJ,YAAA,CAAA5yM,EAAAgO,EAAAhO,GAAAq/C,EAAAmyJ,gBAAA,CAAAxxM,EAAA,GAAAA,GAAAuxM,MAAA,UAAAvrM,EAAAoC,IAAA,IAAApC,EAAAlF,EAAA,EAAAA,EAAAkF,EAAA,EAAAq5C,EAAAwzJ,gBAAA,CAAA7sM,EAAAq5C,EAAAiyJ,gBAAA,CAAAxwM,IAAAywM,MAAA,UAAAuB,WAAA9sM,CAAA,CAAAlF,CAAA,MAAAkF,EAAAoC,IAAA,GAAAtH,EAAAsH,IAAA,QAAAi3C,EAAA0zJ,aAAA,CAAA/sM,EAAAlF,GAAAywM,MAAA,MAAAvrM,EAAAoC,IAAA,EAAAtH,EAAAsH,IAAA,MAAAvD,EAAAkC,EAAAf,EAAApF,MAAA,CAAAE,EAAAF,MAAA,EAAAZ,EAAAq/C,EAAAiyJ,gBAAA,CAAAtrM,EAAAnB,GAAAmJ,EAAAqxC,EAAAiyJ,gBAAA,CAAAxwM,GAAA,OAAAu+C,EAAA0zJ,aAAA,CAAA/yM,EAAAgO,EAAAhO,GAAAuxM,MAAA,OAAA1sM,EAAAkC,EAAAf,EAAApF,MAAA,CAAAE,EAAAF,MAAA,GAAAoF,CAAAA,EAAAoC,IAAA,IAAApC,EAAAlF,EAAA,EAAAA,EAAAkF,EAAA,MAAAhG,EAAAq/C,EAAAiyJ,gBAAA,CAAAxwM,EAAA+D,GAAA,OAAA7E,EAAAq/C,EAAA0zJ,aAAA,CAAA/yM,EAAAgG,EAAAhG,GAAAq/C,EAAAmyJ,gBAAA,CAAAxxM,EAAA,GAAAA,GAAAuxM,MAAA,UAAAyB,UAAAhtM,CAAA,CAAAlF,CAAA,MAAA+D,EAAAkC,EAAAf,EAAApF,MAAA,CAAAE,EAAAF,MAAA,MAAAoF,EAAAoC,IAAA,GAAAtH,EAAAsH,IAAA,QAAAi3C,EAAAuzJ,YAAA,CAAA5sM,EAAAlF,GAAAywM,MAAA,MAAAvrM,EAAAoC,IAAA,EAAAtH,EAAAsH,IAAA,MAAArB,EAAAs4C,EAAAiyJ,gBAAA,CAAAtrM,EAAAnB,GAAA7E,EAAAq/C,EAAAiyJ,gBAAA,CAAAxwM,GAAA,OAAAiG,EAAAs4C,EAAAszJ,aAAA,CAAA5rM,EAAA/G,EAAA+G,GAAAs4C,EAAAmyJ,gBAAA,CAAAzqM,EAAA,GAAAA,GAAAwqM,MAAA,GAAAvrM,EAAAoC,IAAA,IAAApC,EAAAlF,EAAA,EAAAA,EAAAkF,EAAA,MAAAhG,EAAAq/C,EAAAiyJ,gBAAA,CAAAxwM,EAAA+D,GAAA,OAAA7E,EAAAq/C,EAAAwzJ,gBAAA,CAAA7yM,EAAAgG,EAAAhG,GAAAq/C,EAAAmyJ,gBAAA,CAAAxxM,EAAA,GAAAA,GAAAuxM,MAAA,UAAA0B,OAAAnyM,CAAA,CAAA+D,CAAA,SAAAA,EAAAjE,MAAA,QAAAiE,CAAA,MAAA/D,CAAAA,EAAAkN,EAAAlN,EAAA,gFAAAA,EAAA,OAAAu+C,EAAA+wJ,MAAA,MAAAtvM,GAAAu+C,EAAAoyJ,gBAAA,QAAA5sM,CAAA,KAAAkC,EAAA,GAAAjG,EAAA,UAAA+D,EAAAjE,MAAA,CAAAmG,EAAA,OAAAlC,CAAA,KAAAH,EAAAG,EAAAgsM,eAAA,CAAA9pM,EAAA,GAAA4lC,EAAA,IAAA7rC,EAAA,SAAA+D,EAAAjE,MAAA,GAAAmG,GAAArC,EAAAioC,EAAA,OAAA9nC,CAAA,KAAAH,EAAAioC,CAAAA,IAAAA,EAAA,OAAA0S,EAAA6zJ,iBAAA,CAAApyM,EAAA+D,EAAA,KAAAA,EAAAuD,IAAA,QAAAi3C,EAAA8zJ,8BAAA,CAAAryM,EAAA+D,EAAA,UAAAH,CAAAA,EAAAioC,EAAA,YAAA3sC,EAAA+G,EAAA,KAAA/G,EAAAA,IAAA,OAAA6E,EAAAisM,OAAA,CAAA9wM,GAAA,OAAAq/C,EAAA8zJ,8BAAA,CAAAryM,EAAA+D,EAAA,WAAAA,EAAAjE,MAAA,GAAAmG,GAAArC,IAAAioC,EAAA9nC,EAAAw6C,EAAA6zJ,iBAAA,CAAApyM,EAAA+D,EAAA,QAAAw6C,EAAA8zJ,8BAAA,CAAAryM,EAAA+D,EAAA,WAAAuuM,QAAAptM,CAAA,CAAAlF,CAAA,SAAAA,EAAAF,MAAA,QAAAE,CAAA,MAAAkF,CAAAA,EAAAgI,EAAAhI,EAAA,gFAAAA,EAAA,OAAAq5C,EAAA+wJ,MAAA,MAAAtvM,EAAAsH,IAAA,KAAApC,EAAAq5C,EAAAoyJ,gBAAA,2CAAApyJ,EAAA8zJ,8BAAA,CAAAntM,EAAAlF,EAAA,OAAAkF,GAAAq5C,EAAAoyJ,gBAAA,QAAA3wM,CAAA,KAAA+D,EAAA,GAAAmB,EAAA,UAAAlF,EAAAF,MAAA,CAAAiE,EAAA,OAAA/D,CAAA,KAAAiG,EAAAf,EAAA,MAAAlF,EAAAF,MAAA,EAAAiE,EAAA,QAAAkC,EAAA,OAAAjG,CAAA,KAAAkF,EAAAlF,EAAAgwM,OAAA,CAAAjsM,EAAA,SAAAmB,IAAAe,EAAA,OAAAjG,CAAA,QAAAu+C,EAAA6zJ,iBAAA,CAAAltM,EAAAlF,EAAA,QAAAuyM,IAAArtM,CAAA,CAAAlF,CAAA,KAAAkF,EAAAq5C,EAAAoxJ,aAAA,CAAAzqM,GAAAlF,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,GAAA,iBAAAkF,CAAA,wBAAAlF,GAAAA,CAAAA,EAAAA,EAAA6H,QAAA,IAAA3C,EAAAlF,CAAA,qBAAAA,EAAA,OAAAkF,EAAA2C,QAAA,GAAA7H,CAAA,IAAAkF,EAAAq5C,EAAAi0J,WAAA,CAAAttM,GAAAlF,EAAAu+C,EAAAi0J,WAAA,CAAAxyM,GAAAu+C,EAAAk0J,UAAA,CAAAvtM,IAAAq5C,EAAAk0J,UAAA,CAAAzyM,EAAA,QAAAu+C,EAAAp6C,GAAA,CAAAe,EAAAlF,EAAA,qBAAAkF,GAAA,iBAAAlF,EAAA,OAAAkF,EAAAlF,CAAA,uFAAA0yM,GAAAxtM,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAo0J,SAAA,CAAAztM,EAAAlF,EAAA,UAAA4yM,GAAA1tM,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAo0J,SAAA,CAAAztM,EAAAlF,EAAA,UAAA6yM,GAAA3tM,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAo0J,SAAA,CAAAztM,EAAAlF,EAAA,UAAA8yM,GAAA5tM,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAo0J,SAAA,CAAAztM,EAAAlF,EAAA,UAAAg+J,GAAA94J,CAAA,CAAAlF,CAAA,aAAAu+C,EAAAk0J,UAAA,CAAAvtM,GAAA,OAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAAu+C,EAAA+wD,KAAA,CAAApqG,EAAAlF,GAAAu+C,EAAAy/G,EAAA,CAAAh+J,EAAAkF,EAAA,qBAAAA,EAAA,IAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,OAAAu+C,EAAAw0J,eAAA,CAAA/yM,EAAAkF,EAAA,qBAAAlF,EAAA,OAAAkF,GAAAlF,CAAAA,CAAAA,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,EAAA,0BAAAkF,EAAA,IAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,cAAAkF,CAAAA,EAAAq5C,EAAAmxJ,YAAA,CAAAxqM,EAAA,GAAAq5C,EAAA+wD,KAAA,CAAApqG,EAAAlF,EAAA,qBAAAA,EAAA,OAAAkF,GAAAlF,CAAAA,CAAAA,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,EAAA,2BAAAkF,EAAA,IAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,OAAAu+C,EAAAw0J,eAAA,CAAA/yM,EAAA,CAAAkF,EAAA,qBAAAlF,EAAA,OAAAkF,GAAAlF,CAAAA,CAAAA,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,EAAA,0BAAAkF,EAAA,IAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,6BAAAA,EAAA,OAAAkF,GAAAlF,CAAAA,CAAAA,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,EAAA,0BAAAkF,GAAA,iBAAAlF,GAAAA,EAAAa,WAAA,GAAA09C,EAAA,OAAAr5C,GAAAlF,CAAA,CAAAkF,EAAAq5C,EAAAoxJ,aAAA,CAAAzqM,EAAA,UAAA+4J,GAAA/4J,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAy/G,EAAA,CAAA94J,EAAAlF,EAAA,QAAAsvM,QAAA,YAAA/wJ,EAAA,aAAAixJ,WAAAtqM,CAAA,CAAAlF,CAAA,MAAA+D,EAAA,IAAAw6C,EAAA,EAAAv+C,GAAA,OAAA+D,EAAA8sM,UAAA,GAAA3rM,GAAAnB,CAAA,CAAAusM,QAAA,KAAAtwM,EAAA,IAAAu+C,EAAA,KAAAz+C,MAAA,MAAAwH,IAAA,UAAAvD,EAAA,EAAAA,EAAA,KAAAjE,MAAA,CAAAiE,IAAA/D,CAAA,CAAA+D,EAAA,MAAAA,EAAA,QAAA/D,CAAA,CAAAywM,QAAA,KAAAvrM,EAAA,KAAApF,MAAA,CAAAE,EAAA,KAAAkF,EAAA,YAAAlF,GAAAkF,EAAA,KAAAA,EAAAA,EAAA,QAAAwtD,GAAA,cAAAxtD,GAAA,MAAAoC,IAAA,UAAAspM,oBAAA,SAAA5wM,EAAA,EAAAA,EAAA,KAAAF,MAAA,CAAAE,IAAA,KAAAA,EAAA,UAAAkwM,iBAAAhrM,CAAA,CAAAlF,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,KAAAc,EAAA,eAAAA,EAAAd,EAAA,CAAAc,EAAA,cAAA+D,EAAA,SAAAA,CAAAA,IAAAkC,EAAAf,EAAA8qM,OAAA,CAAAjsM,GAAA7E,EAAA,OAAAgO,EAAA,GAAAhO,EAAA,MAAA+G,CAAAA,EAAAiH,CAAAA,EAAA,gBAAAjH,CAAAA,EAAAiH,CAAAA,GAAA,EAAAA,EAAA,gBAAAnJ,GAAA,GAAAA,IAAA,IAAAmB,EAAA8qM,OAAA,CAAAjsM,EAAA,0BAAA0rM,aAAAvqM,CAAA,EAAAq5C,EAAA6xJ,sBAAA,IAAAlrM,EAAA,IAAAlF,EAAA,KAAAu+C,EAAA4xJ,oBAAA,SAAApsM,EAAA/D,EAAA,KAAAiG,EAAA,GAAAlC,EAAA,MAAA7E,EAAA,IAAAq/C,EAAAt4C,EAAA,EAAAf,GAAAgI,EAAA,QAAAqxC,EAAA4xJ,oBAAA,YAAAvsM,EAAA26C,EAAA4xJ,oBAAA,IAAAtkK,EAAA,GAAA7oC,EAAAe,EAAA,GAAArF,EAAAmyD,EAAA,QAAA7tD,EAAA,KAAAkC,EAAA2mC,EAAA7oC,CAAA6tD,CAAAA,EAAA3rD,EAAA,GAAAxG,EAAAwO,IAAAhI,EAAAgI,EAAAA,GAAA,GAAAhI,EAAAtB,IAAAsB,EAAAtB,IAAA,GAAAsB,CAAA,cAAAlC,EAAA6tD,EAAA,GAAAnyD,EAAAwO,EAAAA,EAAAtJ,EAAAA,EAAA,WAAAsB,EAAAlC,EAAA6oC,CAAAglB,CAAAA,EAAA,GAAA3rD,EAAAxG,EAAAwO,GAAAhI,EAAAtB,IAAA,GAAAsB,EAAAgI,EAAAtJ,GAAAsB,EAAAtB,EAAA,EAAA1E,EAAA2xM,UAAA,CAAA5qM,EAAA,EAAAvH,GAAA,QAAAsB,EAAAiG,EAAA,KAAAjG,EAAAA,IAAA,EAAA6wD,EAAAA,CAAAA,GAAA,GAAAnyD,EAAAwO,IAAA,EAAAA,EAAAA,GAAA,GAAAtJ,IAAA,EAAAA,IAAA,IAAAlF,EAAA,EAAAQ,EAAA2xM,UAAA,CAAA7wM,EAAAtB,EAAA,QAAAQ,EAAAuxM,MAAA,UAAAuC,eAAA9tM,CAAA,eAAAA,GAAA,GAAAA,CAAAA,GAAA,MAAAA,EAAA,IAAAA,EAAA,QAAAA,EAAA,KAAAA,GAAA,MAAAA,EAAA,QAAAA,EAAA,IAAAA,CAAAA,GAAA,aAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,MAAAA,EAAA,OAAAA,CAAA,SAAAwqM,aAAAxqM,CAAA,CAAAlF,EAAA,OAAA+D,EAAA,EAAAkC,EAAAf,EAAApF,MAAA,CAAAZ,EAAA,KAAAA,IAAA+G,EAAA,OAAAs4C,EAAA+wJ,MAAA,OAAApiM,EAAAhI,EAAAqqB,UAAA,CAAArwB,GAAA,KAAAq/C,EAAAy0J,cAAA,CAAA9lM,IAAA,MAAAhO,IAAA+G,EAAA,OAAAs4C,EAAA+wJ,MAAA,EAAApiM,CAAAA,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,SAAAgO,EAAA,MAAAhO,IAAA+G,EAAA,YAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,GAAA6E,EAAA,eAAAmJ,EAAA,MAAAhO,IAAA+G,EAAA,YAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,GAAA6E,EAAA,UAAA/D,EAAA,IAAAA,EAAA,QAAAkN,CAAA,OAAAhO,IAAA+G,EAAA,OAAAs4C,EAAA+wJ,MAAA,WAAApiM,CAAAA,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,SAAAgO,EAAA,IAAAlN,EAAA,KAAAd,IAAA+G,CAAA,aAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,cAAAgO,GAAA,MAAAA,EAAA,IAAAlN,EAAA,IAAAd,IAAA+G,CAAA,aAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,cAAAgO,GAAA,KAAAA,EAAA,IAAAlN,EAAA,IAAAd,IAAA+G,CAAA,aAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,gBAAAc,GAAA,KAAAkN,EAAA,MAAAhO,IAAA+G,EAAA,OAAAs4C,EAAA+wJ,MAAA,WAAApiM,CAAAA,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,SAAAgO,EAAA,MAAAhO,IAAA+G,EAAA,YAAAiH,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,QAAA6E,GAAA,KAAA/D,EAAA,sBAAAkN,GAAA,MAAAhO,IAAA+G,EAAA,OAAAs4C,EAAA+wJ,MAAA,EAAApiM,CAAAA,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,KAAA0E,EAAAqC,EAAA/G,EAAA2sC,EAAA0S,EAAA00J,iBAAA,CAAAjzM,EAAA,CAAAgD,EAAAu7C,EAAA20J,6BAAA,MAAAtvM,EAAA,WAAAioC,EAAA,gBAAAntC,EAAAmtC,EAAAjoC,EAAAZ,IAAAu7C,EAAA40J,wBAAA,CAAAtiJ,EAAA,IAAAtS,EAAA,GAAA7/C,EAAA,WAAA25B,EAAA,GAAAr4B,EAAAA,EAAA,GAAA4X,EAAA,GAAA5X,EAAAA,EAAA,WAAAA,CAAAA,EAAAA,EAAA,IAAA6rC,IAAA0S,EAAA40J,wBAAA,KAAAnzM,EAAA,GAAA+D,EAAA,GAAAH,EAAA,UAAA26C,EAAA,EAAAv7C,EAAA,cAAAhD,EAAA,GAAAkN,EAAA,OAAAmrB,EAAAr4B,EAAAkN,EAAA,eAAAA,CAAAA,EAAA,OAAA0K,EAAA5X,EAAA,IAAAkN,CAAAA,EAAA,QAAAtJ,EAAA,YAAAZ,GAAA6oC,EAAA0S,EAAAA,GAAA1S,EAAA7rC,EAAA,EAAAd,IAAA+G,CAAA,EAAArC,EAAA,YAAAsJ,EAAAhI,EAAAqqB,UAAA,CAAArwB,GAAA,GAAA8D,EAAA6oC,CAAA,OAAA7rC,EAAA5B,IAAA,CAAAmgD,GAAAx6C,EAAA3F,IAAA,CAAA4E,EAAA,QAAAY,EAAA26C,CAAAA,EAAA60J,eAAA,CAAAviJ,EAAA7wD,EAAA+D,EAAA,MAAA8sD,EAAA+/I,kBAAA,OAAA7sM,EAAA,GAAAH,EAAA,SAAAlF,EAAA,EAAAkyD,EAAA,cAAArS,EAAA,GAAArxC,EAAA,OAAAmrB,EAAAkmB,EAAArxC,EAAA,eAAAA,CAAAA,EAAA,OAAA0K,EAAA2mC,EAAA,IAAArxC,CAAAA,EAAA,QAAAnJ,EAAA,aAAA8nC,EAAA+kB,EAAA5wD,EAAA,cAAA6rC,EAAA,SAAA+kB,EAAA/kB,EAAAntC,EAAAA,EAAAsB,EAAAu+C,EAAA36C,IAAA,EAAA1E,IAAA+G,CAAA,EAAAlC,EAAA,SAAAmJ,EAAAhI,EAAAqqB,UAAA,CAAArwB,EAAA,CAAA8D,EAAA,GAAAu7C,EAAA20J,6BAAA,OAAAvsJ,EAAA,GAAA9a,EAAAjoC,EAAAZ,IAAAu7C,EAAA40J,wBAAA,KAAAtiJ,EAAAwiJ,oBAAA,CAAAziJ,EAAAlyD,EAAAioD,EAAA,QAAA5iD,EAAA,IAAA7E,IAAA+G,EAAA,KAAAs4C,EAAAy0J,cAAA,CAAA9lM,GAAA,gBAAAhO,IAAAA,EAAA+G,EAAA/G,IAAA,GAAAgO,EAAAhI,EAAAqqB,UAAA,CAAArwB,GAAA,CAAAq/C,EAAAy0J,cAAA,CAAA9lM,EAAA,oBAAA2jD,EAAAvpD,IAAA,KAAAvD,EAAA8sD,EAAA4/I,MAAA,UAAA2C,gBAAApzM,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,EAAAgO,EAAA,EAAAqxC,EAAA,UAAA36C,EAAAG,EAAAjE,MAAA,MAAA8D,EAAAA,IAAA,KAAAsB,EAAAnB,CAAA,CAAAH,EAAA,CAAAioC,EAAA5lC,CAAA,CAAArC,EAAA,CAAAsJ,GAAAhI,GAAAq5C,EAAA,KAAAA,CAAAA,GAAA1S,CAAAA,EAAA7rC,CAAAA,EAAA6wM,UAAA,CAAA3xM,IAAAgO,GAAAqxC,EAAA,EAAArxC,EAAA,MAAAqxC,GAAAv+C,CAAAA,EAAA6wM,UAAA,CAAA3xM,IAAA,WAAAgO,GAAAqxC,GAAA,GAAArxC,EAAAhI,IAAA2mC,EAAA0S,CAAA,SAAArxC,EAAA,IAAAhO,GAAAc,EAAAF,MAAA,kCAAAE,CAAAA,EAAA6wM,UAAA,CAAA3xM,IAAAgO,EAAA,MAAAhO,EAAAc,EAAAF,MAAA,CAAAZ,IAAAc,EAAA6wM,UAAA,CAAA3xM,EAAA,UAAA2wM,yBAAA7vM,CAAA,CAAAkF,CAAA,MAAAnB,EAAA/D,EAAAF,MAAA,CAAAmG,EAAAf,EAAA,EAAAe,EAAA,IAAAA,CAAAA,EAAA,IAAAA,CAAAA,EAAA,IAAAA,IAAA,OAAAA,CAAAA,CAAA,WAAAA,CAAAA,CAAA,WAAAA,CAAAA,EAAA,IAAA/G,EAAA+G,EAAAiH,EAAAhI,EAAA,EAAAtB,EAAA5D,EAAAgwM,OAAA,CAAAjsM,EAAA,GAAA8nC,EAAA0S,EAAA0xJ,OAAA,CAAArsM,GAAAZ,EAAA,MAAAe,EAAA8nC,EAAA3sC,EAAA,GAAAA,EAAA,GAAAc,EAAAsH,IAAA,EAAAtE,IAAA,UAAAA,CAAA,oCAAAtE,EAAAgB,MAAAsD,GAAA6tD,EAAA7tD,EAAA,EAAAxE,EAAA,EAAA65B,EAAA,UAAApyB,EAAA,EAAAA,EAAAlC,EAAA,EAAAkC,IAAA,KAAAf,EAAAlF,EAAAgwM,OAAA,CAAA/pM,GAAAlC,EAAA,CAAAvF,EAAA0G,GAAAmzB,CAAAA,EAAAnrB,CAAAxO,CAAAA,CAAA,CAAAmyD,IAAA,CAAAtS,EAAA+0J,kBAAA,CAAAvvM,EAAA,KAAAH,EAAA1E,EAAAm5B,EAAA,IAAA75B,EAAA0G,IAAAtB,EAAAy0B,EAAA,GAAAz0B,CAAA,CAAAy0B,GAAAn5B,GAAAR,CAAA,CAAAmyD,IAAA,CAAAtS,EAAA+0J,kBAAA,CAAA90M,EAAA0O,EAAA,CAAA1O,KAAAU,EAAAm5B,GAAAn5B,CAAA,KAAA6pB,EAAA,CAAAvqB,EAAAoF,GAAAy0B,CAAAA,EAAAnrB,EAAA,IAAAxO,CAAA,CAAAmyD,IAAA,CAAAtS,EAAA+0J,kBAAA,CAAAvqL,EAAA,CAAAvqB,EAAAoF,IAAA1E,EAAAm5B,CAAA,KAAA75B,GAAAE,CAAA,CAAAmyD,IAAA,CAAAtS,EAAA+0J,kBAAA,CAAA90M,EAAA0O,EAAA,CAAA1O,KAAAU,CAAA,IAAAc,EAAAsH,IAAA,EAAA5I,CAAAA,CAAA,CAAAmyD,IAAA,UAAAA,CAAA,0CAAAnyD,EAAA2C,IAAA,YAAAyuM,kBAAA9vM,CAAA,CAAAkF,CAAA,CAAAnB,CAAA,MAAA8sD,EAAAryD,EAAA,IAAAyH,EAAAjG,EAAAF,MAAA,QAAAmG,EAAA,gBAAAA,EAAA,KAAAA,EAAAjG,EAAA+vM,eAAA,IAAAloM,QAAA,CAAA3C,GAAA,WAAAnB,GAAA/D,EAAAsH,IAAA,EAAArB,CAAAA,EAAA,IAAAA,CAAAA,EAAAA,CAAA,KAAA/G,EAAA,GAAA+G,EAAAs4C,EAAA0xJ,OAAA,CAAAjwM,EAAAgwM,OAAA,CAAA/pM,EAAA,IAAAiH,EAAAqxC,EAAA00J,iBAAA,CAAA/tM,EAAA,CAAAtB,EAAAsJ,EAAA,EAAA2+B,EAAA3sC,EAAAq/C,EAAA20J,6BAAA,CAAArnK,GAAAjoC,EAAA,EAAAioC,EAAA,EAAAA,EAAAjoC,CAAA,KAAAZ,EAAA6oC,EAAA,KAAAntC,EAAA6/C,EAAAijH,YAAA,CAAAjjH,EAAAixJ,UAAA,CAAAtqM,EAAA,IAAAq5C,EAAAixJ,UAAA,CAAAxsM,EAAA,KAAAq1B,EAAA35B,EAAAqxM,eAAA,WAAArxM,EAAAoB,MAAA,SAAAu4B,EAAA,CAAAw4B,CAAAA,EAAA,IAAAtS,EAAAv+C,EAAAF,MAAA,MAAA8wM,kBAAA,OAAA7sM,EAAA,UAAAkC,EAAA,EAAAjG,EAAAF,MAAA,MAAAmG,EAAAA,IAAA,KAAAf,EAAAnB,GAAA,GAAA/D,EAAAuzM,WAAA,CAAAttM,EAAA4qD,CAAAA,EAAA2iJ,cAAA,CAAAvtM,EAAA,EAAAf,EAAAmzB,GAAAt0B,EAAA,EAAAmB,EAAAmzB,CAAA,CAAA75B,EAAAuF,EAAA8D,QAAA,CAAA3C,EAAA,UAAAnB,EAAAw6C,EAAA2yJ,kBAAA,CAAAlxM,EAAAtB,EAAA,OAAAmyD,EAAA9sD,EAAAm5J,QAAA,KAAAj3J,EAAAlC,EAAAq5J,SAAA,CAAAqzC,MAAA,GAAAjyM,EAAA+/C,EAAAuxJ,iBAAA,CAAA7pM,EAAAf,EAAA,IAAA2rD,EAAA4/I,MAAA,OAAA1nL,EAAAw1B,EAAAuxJ,iBAAA,CAAAj/I,EAAA3rD,EAAA,SAAA1G,EAAAsB,MAAA,CAAAkD,GAAAxE,EAAA,IAAAA,EAAA,WAAAuF,GAAA/D,EAAAsH,IAAA,EAAAyhB,CAAAA,EAAA,IAAAA,CAAAA,EAAAA,EAAAvqB,CAAA,QAAAi1M,cAAAvuM,CAAA,SAAAA,EAAA,YAAAwuM,kBAAAxuM,CAAA,SAAAA,EAAA,YAAAyuM,eAAAzuM,CAAA,SAAAA,EAAA,YAAAysM,kBAAAzsM,CAAA,CAAAlF,CAAA,MAAA+D,EAAAmB,EAAAoC,IAAA,IAAAvD,IAAA/D,EAAAsH,IAAA,QAAAi3C,EAAAk1J,aAAA,CAAA1vM,EAAA,KAAAkC,EAAAs4C,EAAAyyJ,iBAAA,CAAA9rM,EAAAlF,GAAA,SAAAiG,EAAAs4C,EAAAm1J,iBAAA,CAAA3vM,GAAA,EAAAkC,EAAAs4C,EAAAo1J,cAAA,CAAA5vM,GAAA,SAAA6vM,kBAAA1uM,CAAA,CAAAlF,CAAA,KAAAu+C,EAAAgxJ,eAAA,CAAAvvM,GAAA,KAAAiG,EAAAf,EAAAoC,IAAA,CAAApI,EAAA,EAAAc,EAAA,GAAAiG,IAAA/G,EAAA,OAAAq/C,EAAAk1J,aAAA,CAAAxtM,EAAA,QAAAf,EAAApF,MAAA,KAAAZ,EAAA,6CAAAc,EAAA,UAAAkF,EAAApF,MAAA,QAAAy+C,EAAAm1J,iBAAA,CAAAztM,EAAA,KAAAiH,EAAAnJ,EAAA/D,GAAA4D,EAAAsB,EAAA6qM,eAAA,WAAAnsM,EAAAsJ,EAAAqxC,EAAAm1J,iBAAA,CAAAztM,GAAArC,EAAAsJ,EAAAqxC,EAAAo1J,cAAA,CAAA1tM,GAAA,SAAAs4C,EAAAs1J,iBAAA,CAAA3uM,EAAAlF,EAAA,QAAA6zM,kBAAA3uM,CAAA,CAAAlF,CAAA,KAAAA,GAAAA,EAAA,OAAAA,CAAA,IAAAA,IAAA,iBAAAA,IAAA,CAAAgiG,IAAA,aAAAj+F,EAAAmB,EAAAoC,IAAA,IAAAvD,IAAA,EAAA/D,EAAA,OAAAu+C,EAAAk1J,aAAA,CAAA1vM,EAAA,QAAA/D,EAAA,sEAAAkF,EAAApF,MAAA,UAAAy+C,CAAAA,EAAA6xJ,sBAAA,IAAApwM,EAAA,IAAAiG,EAAA,KAAAs4C,EAAA4xJ,oBAAA,kBAAAlqM,EAAA,yDAAA/G,EAAA+G,EAAA,UAAA/G,EAAA,OAAAq/C,EAAAm1J,iBAAA,CAAA3vM,EAAA,KAAAmJ,EAAAhI,EAAApF,MAAA,CAAA8D,EAAAsB,EAAA8qM,OAAA,CAAA9iM,EAAA,GAAA2+B,EAAA0S,EAAA0xJ,OAAA,CAAArsM,GAAAZ,EAAA,GAAAkK,EAAA2+B,EAAAntC,EAAAQ,EAAA,KAAA8D,EAAAtE,EAAA,OAAA6/C,EAAAo1J,cAAA,CAAA5vM,EAAA,IAAAf,EAAAtE,EAAA,OAAA6/C,EAAAm1J,iBAAA,CAAA3vM,EAAA,KAAA8sD,EAAA,gBAAAtS,EAAA4xJ,oBAAA,IAAA3xM,EAAA+/C,EAAA4xJ,oBAAA,IAAA93K,EAAA,GAAAtP,EAAA,GAAA8iB,EAAA,GAAA9iB,IAAA,IAAA/lB,EAAA,6CAAA4U,EAAAg5C,EAAA,QAAA7nC,EAAA,KAAA7jB,EAAAmzB,EAAAtP,CAAA6nC,CAAAA,EAAA1rD,EAAA,GAAA0S,EAAAi5C,IAAA3rD,EAAA2rD,EAAAA,GAAA,GAAA3rD,EAAA1G,IAAA0G,EAAA1G,IAAA,GAAA0G,CAAA,cAAA6jB,EAAA6nC,EAAA,GAAAh5C,EAAAi5C,EAAAA,EAAAryD,EAAAA,EAAA,WAAA0G,EAAA6jB,EAAAsP,CAAAu4B,CAAAA,EAAA,GAAA1rD,EAAA0S,EAAAi5C,GAAA3rD,EAAA1G,IAAA,GAAA0G,EAAA2rD,EAAAryD,GAAA0G,EAAA1G,EAAA,KAAAoF,CAAAA,KAAA,GAAAgU,CAAAA,KAAA,UAAA2mC,EAAAm1J,iBAAA,CAAA3vM,EAAA,IAAAH,EAAAgU,EAAA,OAAA2mC,EAAAo1J,cAAA,CAAA5vM,EAAA,SAAAkC,EAAAiH,EAAA,KAAAjH,EAAAA,IAAA,GAAA2qD,EAAAA,CAAAA,GAAA,GAAAh5C,EAAAi5C,IAAA,EAAAA,EAAAA,GAAA,GAAAryD,IAAA,EAAAA,IAAA,IAAAoZ,EAAA,MAAA5X,EAAAkF,EAAA6qM,eAAA,CAAA9pM,GAAA,GAAAjG,EAAA4X,EAAA,OAAA2mC,EAAAm1J,iBAAA,CAAA3vM,EAAA,IAAA/D,EAAA4X,EAAA,OAAA2mC,EAAAo1J,cAAA,CAAA5vM,EAAA,QAAA8sD,GAAA,IAAAryD,EAAA,QAAAoyD,EAAA,yCAAArS,EAAAo1J,cAAA,CAAA5vM,EAAA,iBAAAgvM,gBAAA7tM,CAAA,CAAAlF,CAAA,SAAAu+C,EAAAgxJ,eAAA,CAAAvvM,GAAA,IAAAA,EAAA,IAAAkF,EAAApF,MAAA,KAAAoF,EAAApF,MAAA,EAAAoF,EAAAoC,IAAA,KAAAtH,GAAAkF,EAAA6qM,eAAA,MAAAhsM,EAAA/D,EAAA,KAAAu+C,EAAAs1J,iBAAA,CAAA3uM,EAAAlF,EAAA,QAAA8zM,yBAAA5uM,CAAA,CAAAlF,CAAA,aAAAA,EAAA,EAAAkF,EAAA,IAAAlF,EAAA,GAAAkF,EAAA,IAAAlF,EAAA,EAAAkF,EAAA,IAAAlF,EAAA,GAAAkF,EAAA,cAAAytM,UAAAztM,CAAA,CAAAlF,CAAA,CAAA+D,CAAA,KAAAmB,EAAAq5C,EAAAoxJ,aAAA,CAAAzqM,GAAAlF,EAAAu+C,EAAAoxJ,aAAA,CAAA3vM,GAAA,iBAAAkF,GAAA,iBAAAlF,CAAA,QAAA+D,GAAA,cAAAmB,EAAAlF,CAAA,eAAAkF,GAAAlF,CAAA,eAAAkF,EAAAlF,CAAA,eAAAkF,GAAAlF,CAAA,IAAAu+C,EAAAk0J,UAAA,CAAAvtM,IAAA,iBAAAlF,EAAA,cAAAA,CAAAA,EAAAu+C,EAAAmxJ,YAAA,CAAA1vM,EAAA,GAAAu+C,EAAAu1J,wBAAA,CAAAv1J,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,GAAA+D,EAAA,qBAAAmB,GAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,cAAAkF,CAAAA,EAAAq5C,EAAAmxJ,YAAA,CAAAxqM,EAAA,GAAAq5C,EAAAu1J,wBAAA,CAAAv1J,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,GAAA+D,EAAA,IAAAmB,EAAAq5C,EAAAi0J,WAAA,CAAAttM,GAAAlF,EAAAu+C,EAAAi0J,WAAA,CAAAxyM,GAAAu+C,EAAAk0J,UAAA,CAAAvtM,EAAA,KAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,OAAAu+C,EAAAu1J,wBAAA,CAAAv1J,EAAAozJ,iBAAA,CAAAzsM,EAAAlF,GAAA+D,EAAA,qBAAA/D,EAAA,yCAAAu+C,EAAAu1J,wBAAA,CAAAv1J,EAAAq1J,iBAAA,CAAA1uM,EAAAlF,GAAA+D,EAAA,qBAAAmB,EAAA,qCAAAq5C,EAAAk0J,UAAA,CAAAzyM,GAAA,OAAAu+C,EAAAu1J,wBAAA,CAAAv1J,EAAAq1J,iBAAA,CAAA5zM,EAAAkF,GAAA,EAAAnB,EAAA,qBAAA/D,EAAA,6CAAA+D,EAAAmB,EAAAlF,EAAA,IAAA+D,EAAAmB,GAAAlF,EAAA,IAAA+D,EAAAmB,EAAAlF,EAAA,IAAA+D,EAAAmB,GAAAlF,EAAA,OAAA8wM,UAAA,QAAAvyJ,EAAA0xJ,OAAA,MAAAD,OAAA,MAAAlwM,MAAA,YAAAsxM,cAAApxM,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,KAAAjG,EAAAF,MAAA,CAAAiE,EAAAjE,MAAA,QAAAy+C,EAAA6yJ,aAAA,CAAArtM,EAAA/D,EAAAiG,EAAA,QAAAjG,EAAAF,MAAA,QAAAE,CAAA,QAAA+D,EAAAjE,MAAA,QAAAE,EAAAsH,IAAA,GAAArB,EAAAjG,EAAAu+C,EAAA8xJ,UAAA,CAAArwM,EAAA,KAAAd,EAAAc,EAAAF,MAAA,MAAAE,EAAA8wM,QAAA,IAAA/sM,EAAAjE,MAAA,GAAAE,EAAAF,MAAA,MAAAiE,EAAA+sM,QAAA,KAAA5xM,IAAA,IAAAgO,EAAA,IAAAqxC,EAAAr/C,EAAA+G,GAAArC,EAAA,EAAAioC,EAAA,OAAAA,EAAA9nC,EAAAjE,MAAA,CAAA+rC,IAAA,KAAA3mC,EAAAlF,EAAAgwM,OAAA,CAAAnkK,GAAA9nC,EAAAisM,OAAA,CAAAnkK,GAAAjoC,CAAAA,CAAAA,EAAAsB,IAAA,GAAAgI,EAAA2jM,UAAA,CAAAhlK,EAAA,WAAA3mC,EAAA,MAAA2mC,EAAA7rC,EAAAF,MAAA,CAAA+rC,IAAA,KAAA3mC,EAAAlF,EAAAgwM,OAAA,CAAAnkK,GAAAjoC,CAAAA,CAAAA,EAAAsB,IAAA,GAAAgI,EAAA2jM,UAAA,CAAAhlK,EAAA,WAAA3mC,EAAA,QAAA2mC,EAAA3+B,EAAApN,MAAA,EAAAoN,EAAA2jM,UAAA,CAAAhlK,EAAAjoC,GAAAsJ,EAAAujM,MAAA,UAAAY,cAAArxM,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,SAAAjG,EAAAF,MAAA,QAAAE,CAAA,QAAA+D,EAAAjE,MAAA,QAAAE,EAAAsH,IAAA,GAAArB,EAAAjG,EAAAu+C,EAAA8xJ,UAAA,CAAArwM,EAAA,KAAAd,EAAA,IAAAq/C,EAAAv+C,EAAAF,MAAA,CAAAmG,GAAAiH,EAAA,EAAAtJ,EAAA,OAAAA,EAAAG,EAAAjE,MAAA,CAAA8D,IAAA,KAAAsB,EAAAlF,EAAAgwM,OAAA,CAAApsM,GAAAG,EAAAisM,OAAA,CAAApsM,GAAAsJ,CAAAA,CAAAA,EAAA,EAAAhI,IAAA,GAAAhG,EAAA2xM,UAAA,CAAAjtM,EAAA,WAAAsB,EAAA,MAAAtB,EAAA5D,EAAAF,MAAA,CAAA8D,IAAA,KAAAsB,EAAAlF,EAAAgwM,OAAA,CAAApsM,GAAAsJ,CAAAA,CAAAA,EAAA,EAAAhI,IAAA,GAAAhG,EAAA2xM,UAAA,CAAAjtM,EAAA,WAAAsB,EAAA,QAAAhG,EAAAuxM,MAAA,UAAAC,iBAAA1wM,CAAA,CAAAkF,CAAA,CAAAnB,EAAA,UAAAkC,EAAAjG,EAAAF,MAAA,QAAAiE,EAAAA,EAAA,IAAAw6C,EAAAt4C,EAAAf,GAAAnB,EAAAuD,IAAA,CAAApC,CAAA,KAAAhG,EAAA,UAAAgO,EAAA,EAAAA,EAAAjH,EAAAiH,IAAA,KAAAhI,EAAAlF,EAAAgwM,OAAA,CAAA9iM,GAAAhO,CAAAA,CAAAA,EAAAgG,IAAA,GAAAnB,EAAA8sM,UAAA,CAAA3jM,EAAA,WAAAhI,EAAA,WAAAhG,GAAA6E,EAAAgwM,cAAA,CAAA9tM,EAAA,GAAAlC,CAAA,QAAAysM,iBAAAxwM,CAAA,CAAA+D,CAAA,MAAAkC,EAAAjG,EAAAF,MAAA,CAAAiE,EAAAA,GAAAkC,EAAA,IAAA/G,EAAA,IAAAq/C,EAAAx6C,EAAA,IAAAmJ,EAAA,UAAAqxC,EAAA,EAAAA,EAAAt4C,EAAAs4C,IAAA,KAAAr5C,EAAAlF,EAAAgwM,OAAA,CAAAzxJ,GAAArxC,CAAAA,CAAAA,EAAA,EAAAhI,IAAA,GAAAhG,EAAA2xM,UAAA,CAAAtyJ,EAAA,WAAAr5C,EAAA,OAAAgI,EAAA,0CAAAA,EAAAjH,EAAAiH,EAAAnJ,EAAAmJ,IAAAhO,EAAA2xM,UAAA,CAAA3jM,EAAA,UAAAhO,CAAA,QAAA2yM,cAAA7xM,CAAA,CAAA+D,CAAA,CAAAkC,EAAA,UAAA/G,EAAAc,EAAAF,MAAA,CAAAoN,EAAAnJ,EAAAjE,MAAA,CAAA8D,EAAAsJ,EAAA,GAAAhO,EAAAgO,EAAA,CAAAtJ,EAAA1E,EAAA,IAAAgG,EAAAlF,EAAAiG,EAAA/G,CAAAc,CAAAA,EAAA+D,EAAA7E,EAAAgO,EAAAnJ,EAAAmB,EAAAgI,EAAAjH,CAAA,KAAA4lC,EAAAjoC,CAAA,QAAAqC,EAAAA,EAAA,IAAAs4C,EAAA1S,EAAA,IAAAA,EAAA5lC,EAAAnG,MAAA,KAAAkD,EAAA,OAAAA,EAAAY,EAAAZ,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,GAAAe,EAAAisM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA6oC,EAAA7oC,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAA,UAAAiD,CAAA,QAAA8rM,iBAAA/xM,CAAA,CAAA+D,CAAA,CAAAkC,EAAA,UAAA/G,EAAAc,EAAAF,MAAA,CAAAoN,EAAAnJ,EAAAjE,MAAA,CAAA8D,EAAAsJ,CAAAhO,CAAAA,EAAAgO,GAAAtJ,CAAAA,EAAA1E,CAAAA,EAAA,IAAA2sC,EAAA3sC,CAAA,QAAA+G,EAAAA,EAAA,IAAAs4C,EAAA1S,EAAA,IAAAA,EAAA5lC,EAAAnG,MAAA,KAAAkD,EAAA,OAAAA,EAAAY,EAAAZ,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,GAAA,CAAAe,EAAAisM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA9D,EAAA8D,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA6oC,EAAA7oC,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAA,UAAAiD,CAAA,QAAA6rM,aAAA9xM,CAAA,CAAA+D,CAAA,CAAAkC,EAAA,UAAA/G,EAAAc,EAAAF,MAAA,CAAAoN,EAAAnJ,EAAAjE,MAAA,CAAA8D,EAAAsJ,EAAA,GAAAhO,EAAAgO,EAAA,CAAAtJ,EAAA1E,EAAA,IAAAgG,EAAAlF,EAAAiG,EAAA/G,CAAAc,CAAAA,EAAA+D,EAAA7E,EAAAgO,EAAAnJ,EAAAmB,EAAAgI,EAAAjH,CAAA,KAAA4lC,EAAA3sC,CAAA,QAAA+G,EAAAA,EAAA,IAAAs4C,EAAA1S,EAAA,IAAAA,EAAA5lC,EAAAnG,MAAA,KAAAkD,EAAA,OAAAA,EAAAY,EAAAZ,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,GAAAe,EAAAisM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA9D,EAAA8D,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA6oC,EAAA7oC,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAA,UAAAiD,CAAA,QAAAgsM,cAAAjyM,CAAA,CAAA+D,CAAA,CAAAkC,EAAA,UAAA/G,EAAAc,EAAAF,MAAA,CAAAoN,EAAAnJ,EAAAjE,MAAA,CAAA8D,EAAAsJ,EAAA,GAAAhO,EAAAgO,EAAA,CAAAtJ,EAAA1E,EAAA,IAAAgG,EAAAlF,EAAAiG,EAAA/G,CAAAc,CAAAA,EAAA+D,EAAA7E,EAAAgO,EAAAnJ,EAAAmB,EAAAgI,EAAAjH,CAAA,KAAA4lC,EAAA3sC,CAAA,QAAA+G,EAAAA,EAAA,IAAAs4C,EAAA1S,EAAA,IAAAA,EAAA5lC,EAAAnG,MAAA,KAAAkD,EAAA,OAAAA,EAAAY,EAAAZ,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,GAAAe,EAAAisM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA9D,EAAA8D,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAAhD,EAAAgwM,OAAA,CAAAhtM,IAAA,KAAAA,EAAA6oC,EAAA7oC,IAAAiD,EAAA4qM,UAAA,CAAA7tM,EAAA,UAAAiD,CAAA,QAAA+qM,kBAAAhxM,CAAA,CAAA+D,CAAA,MAAAkC,EAAAjG,EAAAF,MAAA,CAAAiE,EAAAjE,MAAA,OAAAmG,EAAA,OAAAA,CAAA,KAAA/G,EAAAc,EAAAF,MAAA,WAAAZ,GAAAc,EAAAgwM,OAAA,CAAA9wM,KAAA6E,EAAAisM,OAAA,CAAA9wM,IAAAA,IAAA,SAAAA,EAAA,EAAAc,EAAA+vM,eAAA,CAAA7wM,GAAA6E,EAAAgsM,eAAA,CAAA7wM,GAAA,YAAA6xM,qBAAA/wM,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,CAAA/G,CAAA,SAAA6E,EAAA,WAAAmJ,EAAA,MAAAnJ,EAAAH,EAAAG,IAAA,GAAA8nC,EAAA,EAAA7oC,EAAA,UAAAtE,EAAAmyD,EAAA,EAAAA,EAAA7wD,EAAAF,MAAA,CAAA+wD,IAAA3xD,GAAA,EAAAR,EAAAuH,EAAA+pM,OAAA,CAAA9wM,GAAA,IAAAgG,EAAAlF,EAAAgwM,OAAA,CAAAn/I,GAAA9sD,EAAA,MAAAmB,EAAA1G,EAAA0G,IAAA,GAAAmzB,EAAAkmB,EAAAy1J,MAAA,CAAAjwM,EAAAmJ,GAAA6b,EAAAw1B,EAAAy1J,MAAA,CAAAjwM,EAAAH,GAAAgU,EAAA2mC,EAAAy1J,MAAA,CAAAx1M,EAAA0O,GAAA0jD,EAAArS,EAAAy1J,MAAA,CAAAx1M,EAAAoF,EAAAlF,CAAAA,GAAAsE,EAAAq1B,EAAAwT,EAAAA,EAAAntC,IAAA,GAAAA,GAAA,WAAAA,GAAA,QAAAqqB,CAAAA,GAAA,YAAAnR,CAAAA,GAAA,IAAAi0B,GAAAntC,IAAA,GAAAsE,EAAA4tD,EAAA7nC,CAAAA,IAAA,IAAAnR,CAAAA,IAAA,IAAA3R,EAAA4qM,UAAA,CAAA3xM,EAAA,WAAAR,EAAA,SAAAmtC,GAAA,IAAA7oC,EAAA9D,IAAA,KAAAgG,EAAAe,EAAA+pM,OAAA,CAAA9wM,EAAAgG,CAAAA,GAAA2mC,EAAA7oC,EAAAA,EAAA,EAAA6oC,EAAA3mC,IAAA,GAAAe,EAAA4qM,UAAA,CAAA3xM,EAAA,WAAAgG,EAAA,SAAA+uM,sBAAAj0M,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,CAAAiH,CAAA,CAAAtJ,CAAA,MAAAioC,EAAA5lC,EAAAvH,EAAA,UAAAQ,EAAA,EAAAA,EAAAgO,EAAAhO,IAAA,KAAAgG,EAAAlF,EAAAgwM,OAAA,CAAA9wM,GAAA+G,EAAAs4C,EAAAy1J,MAAA,OAAA9uM,EAAAnB,GAAAmJ,EAAAqxC,EAAAy1J,MAAA,CAAA9uM,IAAA,GAAAnB,GAAA8sD,EAAA5qD,EAAA,QAAAiH,CAAAA,GAAA,IAAAxO,EAAAmtC,CAAAA,CAAAA,EAAAglB,IAAA,GAAAnyD,EAAAwO,IAAA,GAAAtJ,EAAAitM,UAAA,CAAA3xM,EAAA,WAAA2xD,EAAA,IAAAjtD,EAAA9D,MAAA,CAAAoN,EAAA,IAAAtJ,EAAAitM,UAAA,CAAA3jM,IAAA2+B,EAAAntC,GAAAwO,EAAAtJ,EAAA9D,MAAA,EAAA8D,EAAAitM,UAAA,CAAA3jM,IAAA,eAAA2+B,EAAAntC,EAAA,kCAAA20M,qBAAAnuM,CAAA,CAAAlF,CAAA,CAAA+D,CAAA,EAAAA,EAAA,KAAAjE,MAAA,EAAAiE,CAAAA,EAAA,KAAAjE,MAAA,MAAAmG,EAAA,MAAAf,EAAAhG,EAAAgG,IAAA,GAAAgI,EAAA,EAAAtJ,EAAA5D,EAAA,QAAA6rC,EAAA,EAAAA,EAAA9nC,EAAA8nC,IAAA,KAAA3mC,EAAA,KAAA8qM,OAAA,CAAAnkK,GAAA7rC,EAAA,MAAAkF,EAAAnB,EAAAmB,IAAA,GAAAlC,EAAAu7C,EAAAy1J,MAAA,CAAAh0M,EAAAiG,GAAAvH,EAAA6/C,EAAAy1J,MAAA,CAAAh0M,EAAAd,GAAA2xD,EAAAtS,EAAAy1J,MAAA,CAAAjwM,EAAAkC,GAAAzH,EAAA+/C,EAAAy1J,MAAA,CAAAjwM,EAAA7E,GAAAm5B,EAAAz0B,EAAAZ,EAAAkK,CAAAA,CAAAA,EAAAmrB,IAAA,GAAAA,GAAA,WAAAA,GAAA,QAAA35B,CAAAA,GAAA,YAAAmyD,CAAAA,GAAA,IAAA3jD,GAAAmrB,IAAA,GAAAz0B,EAAApF,EAAAE,CAAAA,IAAA,IAAAmyD,CAAAA,IAAA,SAAAggJ,UAAA,CAAAhlK,EAAA,WAAAxT,EAAA,OAAAnrB,GAAA,IAAAtJ,EAAA,yCAAAqtM,mBAAAjxM,CAAA,CAAA+D,CAAA,CAAAkC,EAAA,aAAAA,GAAAA,CAAAA,EAAA,IAAAs4C,EAAAv+C,EAAAF,MAAA,UAAAZ,EAAA,UAAAgO,EAAAqxC,EAAA,EAAAv+C,EAAAF,MAAA,MAAAy+C,EAAAA,GAAA,GAAArxC,EAAA,CAAAhO,GAAA,GAAAc,EAAAuzM,WAAA,CAAAh1J,EAAA,UAAAr5C,EAAA,EAAAgI,EAAAnJ,EAAAmJ,EAAA,CAAAhO,CAAAA,EAAA,EAAAgO,EAAAnJ,CAAAA,GAAA,GAAA/D,EAAAuzM,WAAA,CAAAh1J,EAAA,YAAA36C,EAAA,EAAAsJ,EAAAnJ,CAAA7E,CAAAA,EAAA,EAAAgO,EAAAnJ,EAAAkC,EAAA4qM,UAAA,CAAAtyJ,IAAA,EAAAr5C,GAAA,GAAAtB,EAAA,QAAAqC,CAAA,QAAAkrM,mBAAAnxM,CAAA,CAAA+D,CAAA,MAAAkC,EAAA,UAAA/G,EAAA,EAAAc,EAAAF,MAAA,MAAAZ,EAAAA,IAAA,KAAAgG,EAAA,CAAAe,GAAA,GAAAjG,EAAAuzM,WAAA,CAAAr0M,EAAA,MAAA+G,EAAA,EAAAf,EAAAnB,CAAA,QAAAkC,CAAA,QAAAirM,mBAAAhsM,CAAA,CAAAlF,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAAiH,EAAAlN,EAAAk0M,iBAAA,GAAAh1M,EAAAc,EAAAF,MAAA,CAAA8D,EAAAsB,EAAAgvM,iBAAA,GAAAhnM,EAAA2+B,EAAA,KAAA9nC,GAAA8nC,CAAAA,EAAA,IAAA0S,EAAA36C,EAAA,WAAAgtM,kBAAA,OAAA5tM,EAAA,IAAAu7C,EAAArxC,EAAA,UAAAlK,EAAA4tM,kBAAA,OAAAlyM,EAAA6/C,EAAA41J,OAAA,CAAAn0M,EAAAuzM,WAAA,CAAArmM,EAAA,MAAAxO,GAAAsB,CAAAA,EAAAu+C,EAAA61J,kBAAA,CAAAp0M,EAAAtB,EAAA,QAAAF,EAAA+/C,EAAA61J,kBAAA,CAAAlvM,EAAAxG,EAAA,GAAAmyD,EAAA7wD,EAAAuzM,WAAA,CAAArmM,EAAA,GAAAmrB,EAAA,UAAA35B,EAAAqqB,EAAAnlB,EAAA,GAAAmlB,EAAAA,IAAA,CAAArqB,EAAA,UAAAwG,EAAA1G,EAAA+0M,WAAA,CAAAxqL,EAAA7b,GAAA,GAAAhI,IAAA2rD,EAAA,KAAA9sD,EAAA,CAAAmB,GAAA,GAAA1G,EAAA+0M,WAAA,CAAAxqL,EAAA7b,EAAA,QAAAxO,EAAA,EAAAqF,EAAA8sD,EAAA,IAAA5qD,EAAA,EAAAlC,EAAA8sD,EAAA3xD,EAAAc,EAAAuzM,WAAA,CAAArmM,EAAA,GAAAtJ,EAAApF,EAAA+0M,WAAA,CAAAxqL,EAAA7b,EAAA,QAAAqxC,EAAAy1J,MAAA,CAAAt1M,EAAAQ,KAAA,GAAA+G,GAAA,GAAArC,CAAAA,IAAA,GAAAlF,CAAAA,IAAA,QAAAuH,CAAAA,GAAA4qD,CAAAA,CAAA5qD,CAAA,KAAAs4C,EAAA01J,qBAAA,CAAAj0M,EAAAtB,EAAA,EAAAQ,EAAA8D,GAAA,IAAAiD,EAAAzH,EAAA61M,YAAA,CAAArxM,EAAA+lB,EAAA7b,EAAA,OAAAjH,GAAAA,CAAAA,EAAAzH,EAAA81M,YAAA,CAAAt0M,EAAA+oB,EAAA7b,GAAA1O,EAAAg1M,cAAA,CAAAzqL,EAAA7b,EAAA,MAAA1O,EAAA+0M,WAAA,CAAAxqL,EAAA7b,GAAAjH,GAAAvH,GAAA,EAAAqF,GAAA,GAAAglB,EAAAsP,EAAA35B,GAAA,GAAAmtC,EAAAglK,UAAA,CAAA9nL,IAAA,EAAAsP,EAAA35B,EAAA,KAAAuH,EAAA,OAAAzH,EAAA+1M,mBAAA,CAAA71M,GAAAqF,EAAA,CAAAm5J,SAAArxH,EAAAuxH,UAAA5+J,CAAA,EAAAA,CAAA,IAAAuF,EAAA,OAAA8nC,CAAA,mCAAAsoK,QAAAjvM,CAAA,SAAAq5C,EAAA0xJ,OAAA,CAAA/qM,GAAA,GAAAovM,aAAAt0M,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,UAAAgO,EAAA,EAAAA,EAAAjH,EAAAiH,IAAA,KAAAhI,EAAA,KAAAquM,WAAA,CAAAxvM,EAAAmJ,GAAAlN,EAAAuzM,WAAA,CAAArmM,GAAAhO,CAAAA,CAAAA,EAAAgG,IAAA,QAAAsuM,cAAA,CAAAzvM,EAAAmJ,EAAA,MAAAhI,EAAA,QAAAhG,CAAA,CAAAm1M,aAAAr0M,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAA/G,EAAA,OAAA6E,EAAA,CAAAA,IAAA,MAAAmJ,EAAA,KAAA8iM,OAAA,CAAAjsM,GAAAw6C,EAAA,MAAArxC,EAAAtJ,EAAA,OAAAA,EAAAqC,EAAA,MAAArC,IAAA,KAAAsB,EAAAlF,EAAAgwM,OAAA,CAAApsM,GAAAqC,EAAA,CAAAiH,IAAA,WAAAhI,CAAAA,EAAAhG,CAAAA,CAAAA,EAAA,EAAA+G,IAAA,QAAA4qM,UAAA,CAAA9sM,EAAAH,EAAA,OAAAqC,CAAAA,GAAA,SAAAs4C,GAAAr/C,EAAA,EAAAq/C,CAAAA,EAAA,OAAArxC,CAAAA,EAAA,KAAA8iM,OAAA,CAAAjsM,EAAAH,EAAA,GAAAsJ,EAAAhI,CAAAA,IAAA,IAAAhG,CAAAA,IAAA,OAAAgG,EAAAlF,EAAAgwM,OAAA,CAAApsM,GAAAioC,EAAA,CAAA3+B,IAAA,WAAAhI,CAAAA,EAAAhG,EAAA,GAAAA,EAAA,EAAA2sC,IAAA,QAAAglK,UAAA,CAAA9sM,EAAAH,EAAA,OAAAioC,CAAAA,GAAA,SAAA0S,GAAAx6C,EAAAH,EAAA,QAAA9D,MAAA,yCAAAmG,CAAAA,GAAAiH,CAAAA,EAAA,EAAAqxC,CAAAA,EAAA,OAAArxC,CAAAA,EAAA,KAAA8iM,OAAA,CAAAjsM,EAAAH,EAAA,GAAAsJ,EAAAhI,CAAAA,IAAA,IAAAhG,CAAAA,IAAA,QAAA2xM,UAAA,CAAA9sM,EAAA/D,EAAAF,MAAA,YAAAoN,EAAA,MAAAqxC,EAAA,OAAAx6C,IAAA,MAAAmJ,EAAA,OAAAA,EAAAlN,EAAAF,MAAA,GAAAoN,IAAA,KAAAhI,EAAA,KAAA8qM,OAAA,CAAAjsM,EAAAmJ,GAAAjH,EAAAjG,EAAAgwM,OAAA,CAAA9iM,GAAAqxC,EAAA,OAAAr5C,CAAAA,EAAA,OAAAe,CAAAA,EAAA/G,EAAAA,EAAA,EAAAq/C,IAAA,OAAA36C,EAAA,CAAAsB,IAAA,IAAAe,CAAAA,IAAA,IAAA/G,CAAAA,CAAAA,EAAA,EAAA0E,IAAA,QAAAitM,UAAA,CAAA9sM,EAAAmJ,EAAA,OAAAtJ,CAAAA,GAAA,SAAA26C,EAAA,KAAAr5C,EAAA,KAAA8qM,OAAA,CAAAjsM,EAAAmJ,GAAAqxC,EAAAv+C,EAAAgwM,OAAA,CAAA9iM,GAAAtJ,EAAA,OAAAsB,CAAAA,EAAA,OAAAq5C,CAAAA,EAAAr/C,EAAAA,EAAA,EAAA0E,IAAA,OAAAioC,EAAA,QAAA5lC,CAAAA,GAAA/G,CAAAA,EAAA,EAAA2sC,CAAAA,EAAA,CAAA3mC,IAAA,IAAAq5C,CAAAA,IAAA,IAAAr/C,CAAAA,IAAA,SAAA2xM,UAAA,CAAA9sM,EAAAmJ,EAAA,OAAA2+B,CAAAA,GAAA,SAAAjoC,EAAA,QAAA1E,CAAA,CAAAq1M,oBAAAv0M,CAAA,SAAAA,EAAA,WAAA+D,EAAA,KAAAisM,OAAA,MAAAhwM,EAAAiG,EAAA,KAAAnG,MAAA,WAAAZ,EAAA,EAAAA,EAAA+G,EAAA/G,IAAA,KAAAgG,EAAA,KAAA8qM,OAAA,CAAA9wM,EAAA,QAAA2xM,UAAA,CAAA3xM,EAAA,WAAAgG,GAAA,GAAAlF,EAAA+D,GAAAA,EAAAmB,IAAAlF,CAAA,MAAA6wM,UAAA,CAAA5qM,EAAAlC,EAAA,QAAAqwM,mBAAAp0M,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAAiH,EAAAlN,EAAAF,MAAA,CAAAZ,EAAA,IAAAq/C,EAAArxC,EAAAjH,EAAA,WAAAlC,EAAA,SAAAA,EAAA,EAAAA,EAAAmJ,EAAAnJ,IAAA7E,EAAA2xM,UAAA,CAAA9sM,EAAA/D,EAAAgwM,OAAA,CAAAjsM,IAAA,SAAAkC,GAAA/G,EAAA2xM,UAAA,CAAA3jM,EAAA,GAAAhO,CAAA,KAAA0E,EAAA,UAAA26C,EAAA,EAAAA,EAAArxC,EAAAqxC,IAAA,KAAAr5C,EAAAlF,EAAAgwM,OAAA,CAAAzxJ,EAAAr/C,CAAAA,EAAA2xM,UAAA,CAAAtyJ,EAAA,WAAAr5C,GAAAnB,EAAAH,GAAAA,EAAAsB,IAAA,GAAAnB,CAAA,UAAAkC,GAAA/G,EAAA2xM,UAAA,CAAA3jM,EAAAtJ,GAAA1E,CAAA,QAAAsyM,sBAAAxxM,CAAA,CAAAkF,CAAA,MAAAnB,EAAAw6C,EAAAi2J,eAAA,CAAAtvM,GAAA,KAAAnB,EAAA,uCAAAkC,EAAA,EAAAlC,EAAA,GAAA7E,EAAA6E,EAAA,GAAAmJ,EAAAlN,EAAAF,MAAA,CAAA8D,EAAA,IAAA1E,GAAA,GAAAc,EAAAgwM,OAAA,CAAA9iM,EAAA,QAAAhO,EAAA2sC,EAAA3+B,EAAAjH,EAAArC,CAAAA,EAAA,KAAAZ,EAAA,IAAAu7C,EAAA1S,EAAA7rC,EAAAsH,IAAA,SAAApI,EAAA,KAAA6E,EAAA,OAAAA,EAAAkC,EAAAlC,IAAAf,EAAA6tM,UAAA,CAAA9sM,EAAA,QAAAA,EAAA8nC,EAAA9nC,IAAAf,EAAA6tM,UAAA,CAAA9sM,EAAA/D,EAAAgwM,OAAA,CAAAjsM,EAAAkC,GAAA,UAAAlC,EAAA,UAAA/D,EAAA,EAAAA,EAAAiG,EAAAjG,IAAAgD,EAAA6tM,UAAA,CAAA7wM,EAAA,WAAAu+C,EAAA,EAAAA,EAAArxC,EAAAqxC,IAAA,KAAAr5C,EAAAlF,EAAAgwM,OAAA,CAAAzxJ,EAAAv7C,CAAAA,EAAA6tM,UAAA,CAAAtyJ,EAAAt4C,EAAA,WAAAf,GAAAhG,EAAA6E,GAAAA,EAAAmB,IAAA,GAAAhG,CAAA,IAAA0E,EAAAZ,EAAA6tM,UAAA,CAAA3jM,EAAAjH,EAAAlC,QAAA,OAAAA,EAAA,yCAAAf,EAAAytM,MAAA,UAAAc,uBAAAvxM,CAAA,CAAAkF,CAAA,MAAAnB,EAAA/D,EAAAF,MAAA,CAAAmG,EAAAjG,EAAAsH,IAAA,CAAApI,EAAAq/C,EAAAi2J,eAAA,CAAAtvM,GAAA,KAAAhG,EAAA,OAAAq/C,EAAAk2J,qBAAA,CAAAxuM,EAAA,KAAAiH,EAAA,EAAAhO,EAAA,GAAA0E,EAAA1E,EAAA,GAAA2sC,EAAA9nC,EAAAmJ,EAAA,MAAA2+B,EAAA,OAAA0S,EAAAk2J,qBAAA,CAAAxuM,EAAA,KAAAjD,EAAA,MAAAiD,GAAA,MAAAjG,CAAAA,EAAAgwM,OAAA,CAAA9iM,GAAA,IAAAtJ,CAAAA,EAAA,GAAAZ,EAAA,gBAAAe,EAAA,EAAAA,EAAAmJ,EAAAnJ,IAAA,OAAA/D,EAAAgwM,OAAA,CAAAjsM,GAAA,CAAAf,EAAA,aAAAA,GAAA,IAAAY,EAAA,KAAAsB,EAAAlF,EAAAgwM,OAAA,CAAAjsM,EAAA,OAAAmB,GAAA2mC,GAAA,KAAAntC,EAAA,IAAA6/C,EAAA1S,EAAA5lC,GAAA,OAAArC,EAAA,CAAAlF,EAAAmyM,UAAA,CAAAhlK,EAAA,aAAA5lC,EAAAiH,EAAAjH,EAAAlC,EAAAkC,IAAAvH,EAAAmyM,UAAA,CAAA5qM,EAAAiH,EAAAlN,EAAAgwM,OAAA,CAAA/pM,GAAA,UAAAA,EAAAjG,EAAAgwM,OAAA,CAAA9iM,KAAAtJ,EAAA1E,EAAA6E,EAAAmJ,EAAA,UAAAnJ,EAAA,EAAAA,EAAA7E,EAAA6E,IAAA,KAAAmB,EAAAlF,EAAAgwM,OAAA,CAAAjsM,EAAAmJ,EAAA,EAAAxO,CAAAA,EAAAmyM,UAAA,CAAA9sM,EAAA,WAAAmB,GAAA,GAAAtB,EAAAqC,GAAAA,EAAAf,IAAAtB,CAAA,CAAAlF,EAAAmyM,UAAA,CAAA3xM,EAAA+G,EAAA,QAAAjD,GAAAtE,CAAAA,EAAA6/C,EAAAmyJ,gBAAA,CAAAhyM,EAAA,GAAAA,EAAA,EAAAA,EAAA+xM,MAAA,UAAAgE,sBAAAvvM,CAAA,SAAAA,EAAAq5C,EAAAixJ,UAAA,OAAAjxJ,EAAA+wJ,MAAA,UAAAkF,gBAAAtvM,CAAA,OAAAA,EAAApF,MAAA,eAAAE,EAAAkF,EAAA6qM,eAAA,WAAA/vM,EAAAu+C,EAAAoyJ,gBAAA,IAAA3wM,CAAA,QAAA2vM,cAAAzqM,CAAA,CAAAlF,EAAA,+BAAAkF,GAAAA,EAAArE,WAAA,GAAA09C,EAAA,OAAAr5C,CAAA,wBAAAhD,QAAA,iBAAAA,OAAA29F,WAAA,MAAA97F,EAAAmB,CAAA,CAAAhD,OAAA29F,WAAA,KAAA97F,EAAA,KAAAmB,EAAAnB,EAAA/D,GAAA,oBAAAkF,EAAA,OAAAA,CAAA,kEAAAnB,EAAAmB,EAAAi+F,OAAA,IAAAp/F,EAAA,KAAA/D,EAAA+D,EAAAwJ,IAAA,CAAArI,GAAA,oBAAAlF,EAAA,OAAAA,CAAA,KAAAiG,EAAAf,EAAA2C,QAAA,IAAA5B,EAAA,KAAAjG,EAAAiG,EAAAsH,IAAA,CAAArI,GAAA,oBAAAlF,EAAA,OAAAA,CAAA,oEAAAwyM,YAAAttM,CAAA,SAAAq5C,EAAAk0J,UAAA,CAAAvtM,GAAAA,EAAA,CAAAA,CAAA,QAAAutM,WAAAvtM,CAAA,yBAAAA,GAAA,OAAAA,GAAAA,EAAArE,WAAA,GAAA09C,CAAA,QAAA6zJ,kBAAAltM,CAAA,CAAAlF,CAAA,MAAA+D,EAAA,GAAAmB,EAAA,OAAAe,EAAA,IAAAs4C,EAAAx6C,EAAA/D,EAAAsH,IAAA,EAAApI,EAAA6E,EAAA,UAAAA,EAAA,EAAAA,EAAA7E,EAAA6E,IAAAkC,EAAA4qM,UAAA,CAAA9sM,EAAA/D,EAAAgwM,OAAA,CAAAjsM,IAAA,IAAAmJ,EAAAlN,EAAAgwM,OAAA,CAAA9wM,GAAA,MAAAgG,EAAA,QAAAlF,EAAA,GAAAkF,EAAA,GAAAgI,EAAAA,GAAAlN,IAAAA,CAAA,QAAAiG,EAAA4qM,UAAA,CAAA3xM,EAAAgO,GAAAjH,EAAAwqM,MAAA,UAAA4B,+BAAAryM,CAAA,CAAA+D,CAAA,CAAAkC,CAAA,MAAAoyB,EAAA,IAAAn5B,EAAAU,KAAAorC,GAAA,KAAA99B,EAAA,GAAAlN,EAAA,OAAA4D,EAAA,IAAA26C,EAAArxC,EAAAjH,GAAA4lC,EAAA,EAAA7oC,EAAAkK,EAAA,EAAAxO,EAAA,UAAAwG,EAAAhG,EAAA8D,EAAAe,EAAAjE,MAAA,EAAA+rC,EAAA3mC,EAAA2mC,IAAA,KAAA3mC,EAAA,EAAAnB,EAAAisM,OAAA,CAAAnkK,GAAAntC,CAAAA,CAAAA,EAAA,EAAAwG,IAAA,GAAAtB,EAAAitM,UAAA,CAAAhlK,EAAA,WAAA3mC,EAAA,MAAA2mC,EAAA7oC,EAAA6oC,IAAAjoC,EAAAitM,UAAA,CAAAhlK,EAAA,cAAAntC,GAAA,IAAAmyD,EAAA7tD,EAAAe,EAAAjE,MAAA,CAAAiE,EAAAisM,OAAA,CAAAhtM,GAAA,EAAAxE,EAAAwB,EAAA,SAAAxB,EAAA65B,EAAA,EAAAw4B,EAAAnyD,EAAA,oBAAAwG,EAAA,GAAA1G,EAAAqyD,EAAAA,GAAA3rD,IAAAA,EAAA,IAAAlF,EAAA,MAAAkF,EAAAmzB,EAAAr4B,EAAA6wD,EAAAnyD,EAAAsB,EAAA,SAAA4D,EAAAitM,UAAA,CAAA7tM,EAAAq1B,GAAAz0B,EAAA6sM,MAAA,GAAAT,QAAAhwM,CAAA,cAAAA,EAAA,CAAA+vM,gBAAA/vM,CAAA,cAAAA,EAAA,KAAA6wM,WAAA7wM,CAAA,CAAAkF,CAAA,OAAAlF,EAAA,GAAAkF,CAAA,CAAA6uM,eAAA/zM,CAAA,CAAAkF,CAAA,OAAAlF,EAAA,GAAAkF,CAAA,CAAAgvM,mBAAA,KAAAhvM,EAAA,KAAApF,MAAA,oBAAAiwM,eAAA,CAAA7qM,EAAA,KAAAA,EAAA,IAAAA,CAAA,CAAAquM,YAAAvzM,CAAA,oBAAAA,IAAA,WAAAA,CAAAA,CAAA,CAAAwzM,eAAAxzM,CAAA,CAAAkF,CAAA,MAAAnB,EAAA/D,IAAA,EAAAiG,EAAA,KAAA+pM,OAAA,CAAAjsM,GAAA7E,EAAA,EAAAc,EAAA,MAAAiG,EAAAf,GAAA,cAAAe,EAAA,MAAAf,CAAA,MAAA2rM,UAAA,CAAA9sM,EAAA7E,EAAA,QAAAw1M,WAAAxvM,CAAA,CAAAlF,CAAA,MAAA+D,EAAA,SAAA/D,GAAA,EAAAA,GAAA+D,CAAAA,GAAAmB,CAAAA,EAAAlF,KAAA,EAAAkF,GAAAA,CAAA,QAAAnB,CAAA,QAAAwrM,gBAAArqM,CAAA,oBAAAA,CAAAA,IAAAA,CAAA,SAAAq5C,EAAA8wJ,YAAA,UAAA9wJ,EAAAoyJ,gBAAA,CAAApyJ,EAAA8wJ,YAAA,IAAA9wJ,EAAA00J,iBAAA,4IAAA10J,EAAA40J,wBAAA,GAAA50J,EAAA20J,6BAAA,IAAA30J,EAAA40J,wBAAA,CAAA50J,EAAA+0J,kBAAA,mJAAA/0J,EAAAo2J,sBAAA,KAAA/1L,YAAA,GAAA2/B,EAAA6xJ,sBAAA,KAAApgG,aAAAzxD,EAAAo2J,sBAAA,EAAAp2J,EAAA4xJ,oBAAA,KAAAhR,WAAA5gJ,EAAAo2J,sBAAA,EAAAp2J,EAAA0xJ,OAAA,CAAAjwM,EAAA,SAAAkF,CAAA,SAAAlF,EAAAkF,GAAA,YAAAA,CAAA,MAAAlF,EAAAJ,KAAAqiG,GAAA,CAAAl+F,EAAAnE,KAAA2zD,GAAA,YAAAruD,EAAA,WAAAnB,EAAAmB,IAAA,GAAAlF,CAAAA,CAAA,EAAAu+C,EAAAy1J,MAAA,CAAA9uM,GAAA,SAAAA,CAAA,CAAAlF,CAAA,WAAAkF,EAAAlF,CAAA,EAAAu+C,CAAA,EAAA5/C,EAAAC,OAAA,CAAAoB,GAAA,gBAAArB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECSA,IAAAq2M,EAAA,sBAGAC,EAAA,IAGAC,EAAA,kBAGAC,EAAA,aAGAC,EAAA,qBAGAC,EAAA,aAGAC,EAAA,cAGAC,EAAA9pK,SAG0F+pK,EAAA,iBAAA72M,EAAA2O,CAAA,EAAA3O,EAAA2O,CAAA,EAAA3O,EAAA2O,CAAA,CAAAvL,MAAA,GAAAA,QAAApD,EAAA2O,CAAA,CAG1FmoM,EAAA,iBAAAl3M,MAAAA,MAAAA,KAAAwD,MAAA,GAAAA,QAAAxD,KAGAiyB,EAAAglL,GAAAC,GAAAjuC,SAAA,iBAUAn5D,EAAAqnG,OAPAjoM,SAAA,CAOAxF,QAAA,CAIA0tM,EAAA31M,KAAAqrC,GAAA,CAAAuqK,EAAA51M,KAAAorC,GAAA,CAmBA6iH,EAAA,WACA,OAAAz9H,EAAAiqE,IAAA,CAAAwzD,GAAA,IAyDA,SAAA4nD,EAAAr/K,CAAA,CAAAq3D,CAAA,CAAAvqF,CAAA,EACA,IAAAwyM,EACAC,EACAC,EACA/yM,EACAgzM,EACAC,EACAC,EAAA,EACAvgH,EAAA,GACAwgH,EAAA,GAAAvgH,EAAA,GAGA,sBAAAr/D,EACA,gBAAAw+K,EAAA,CAUA,SAAAqB,EAAAC,CAAA,EACA,IAAA9tM,EAAAstM,EAAAtzL,EAAAuzL,EAMA,OAHAD,EAAAC,EAAAhzM,KAAAA,EACAozM,EAAAG,EACArzM,EAAAuzB,EAAAz2B,KAAA,CAAAyiB,EAAAha,EACA,CAGA,SAAA+tM,EAAAD,CAAA,EAMA,OAJAH,EAAAG,EAEAL,EAAA3zH,WAAAk0H,EAAA3oH,GAEA+H,EAAAygH,EAAAC,GAAArzM,CAAA,CAGA,SAAAwzM,EAAAH,CAAA,EACA,IAAAI,EAAAJ,EAAAJ,EACAS,EAAAL,EAAAH,EAAAlzM,EAAA4qF,EAAA6oH,EAGA,OAAAN,EAAAR,EAAA3yM,EAAA+yM,EAAAW,GAAA1zM,CAAA,CAGA,SAAA2zM,EAAAN,CAAA,EACA,IAAAI,EAAAJ,EAAAJ,EAAAS,EAAAL,EAAAH,EAMA,OAAAD,KAAAnzM,IAAAmzM,GAAAQ,GAAA7oH,GACA6oH,EAAA,GAAAN,GAAAO,GAAAX,CAAA,CAGA,SAAAQ,GAAA,CACA,IAAAF,EAAAroD,IACA,GAAA2oD,EAAAN,GACA,OAAAO,EAAAP,EACA,CAEAL,EAAA3zH,WAAAk0H,EAAAC,EAAAH,GAAA,CAGA,SAAAO,EAAAP,CAAA,QAKA,CALAL,EAAAlzM,KAAAA,EAKA8yF,GAAAigH,GACAO,EAAAC,IAEAR,EAAAC,EAAAhzM,KAAAA,EACAE,EAFA,CAKA,SAAA6zM,GAAA,CACA/zM,KAAAA,IAAAkzM,GACAj/E,aAAAi/E,GAEAE,EAAA,EACAL,EAAAI,EAAAH,EAAAE,EAAAlzM,KAAAA,CAAA,CAGA,SAAA6rB,GAAA,CACA,OAAAqnL,KAAAlzM,IAAAkzM,EAAAhzM,EAAA4zM,EAAA5oD,IAAA,CAGA,SAAA8oD,GAAA,CACA,IAAAT,EAAAroD,IAAA+oD,EAAAJ,EAAAN,GAOA,GAJAR,EAAA19K,UACA29K,EAAA,KAAAG,EAAAI,EAGAU,EAAA,CACA,GAAAf,KAAAlzM,IAAAkzM,EACA,OAAAM,EAAAL,EACA,CACA,GAAAE,EAGA,OADAH,EAAA3zH,WAAAk0H,EAAA3oH,GACAwoH,EAAAH,EACA,CACA,OACAnzM,KAAAA,IAAAkzM,GACAA,CAAAA,EAAA3zH,WAAAk0H,EAAA3oH,EAAA,EAEA5qF,CACA,CAGA,OAxGA4qF,EAAAvwE,EAAAuwE,IAAA,EACAxrF,EAAAiB,KACAsyF,EAAA,EAAAtyF,EAAAsyF,OAAA,CAEAogH,EAAAI,CADAA,EAAA,YAAA9yM,CAAA,EACAqyM,EAAAr4L,EAAAha,EAAA0yM,OAAA,KAAAnoH,GAAAmoH,CAAA,CACAngH,EAAA,aAAAvyF,EAAA,EAAAA,EAAAuyF,QAAA,CAAAA,CAAA,EAiGAkhH,EAAAD,MAAA,CAAAA,EACAC,EAAAnoL,KAAA,CAAAA,EACAmoL,CAAA,CA4BA,SAAA10M,EAAAX,CAAA,EACA,IAAAE,EAAA,OAAAF,EACA,QAAAA,GAAAE,CAAAA,UAAAA,GAAAA,YAAAA,CAAA,EA2BA,SAAAq1M,EAAAv1M,CAAA,EACA,QAAAA,GAAA,iBAAAA,CAAA,CAoBA,SAAAw1M,EAAAx1M,CAAA,EACA,uBAAAA,GACAu1M,EAAAv1M,IAAA2sG,EAAA1gG,IAAA,CAAAjM,IAAAwzM,CAAA,CA0BA,SAAA53L,EAAA5b,CAAA,EACA,oBAAAA,EACA,OAAAA,CACA,CACA,GAAAw1M,EAAAx1M,GACA,OAAAuzM,CACA,CACA,GAAA5yM,EAAAX,GAAA,CACA,IAAAkiC,EAAA,mBAAAliC,EAAA6hG,OAAA,CAAA7hG,EAAA6hG,OAAA,GAAA7hG,CAAA,CACAA,EAAAW,EAAAuhC,GAAAA,EAAA,GAAAA,CAAA,CACA,GACA,iBAAAliC,EACA,OAAAA,IAAAA,EAAAA,EAAA,CAAAA,CAAA,CAEAA,EAAAA,EAAA4hB,OAAA,CAAA6xL,EAAA,IACA,IAAAjgB,EAAAmgB,EAAAh2L,IAAA,CAAA3d,GACA,UAAA4zM,EAAAj2L,IAAA,CAAA3d,GACA6zM,EAAA7zM,EAAApB,KAAA,IAAA40L,EAAA,KACAkgB,EAAA/1L,IAAA,CAAA3d,GAAAuzM,EAAA,CAAAvzM,CAAA,CAEA3C,EAAAC,OAAA,CAAA62M,CAAA,gBAAA92M,CAAA,ECxXa,YAEbA,CAAAA,EAAAC,OAAA,YACA,OAAA+C,OAAAC,MAAA,CAEA,gBAAAvD,CAAA,CAAAopB,CAAA,CAAAlpB,CAAA,ECHA,CAAA0O,OAAA8pM,QAAA,CAAA9pM,OAAA8pM,QAAA,MAAA34M,IAAA,EACA,QACA,UAAe,CACf,OAAAG,EAAA,KACA,EACA,CAKA,gBAAAF,CAAA,CAAAC,CAAA,CAAAC,CAAA,mBsCwRAy4M,EqB3RAC,EPIAC,EpDDA34M,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,2BAAA64M,EAAA,Q8BVAC,EIYAC,EoBVAC,ExBHAF,EIYAC,EgBDAE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,ECAgZC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,ECAhZC,EETAzB,EcSA0B,EEAsEC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EtEAtEz7K,EAAA9/B,EAAA,MAAAA,EAAA,KAAAA,EAAA,MAAAA,EAAA,SAAAw7M,EAAAx7M,EAAA,MCZA,IAAAgpB,GAAA,oBAAAkF,SCGyEutL,GAAAzyL,GAAAwyL,EAAA18K,eAAA,CAAA08K,EAAAE,SAAA,CCCzE,SAAAC,IAAsB,CAClB,IAAAC,EAAA,GAAAJ,EAAyBviL,MAAA,MAO7B,OANAwiL,GAAA,KACAG,EAAAxiL,OAAA,IACA,KACAwiL,EAAAxiL,OAAA,GACK,GACL,IACAwiL,CAAA,CCZU,IAAAC,GAAA,GAAAp1M,ECCVq1M,GAAA,CACAC,eAAA,GACAC,gBAAA,GCFA,OAAAC,GACA35M,aAAA,CACA,KAAA45B,KAAA,IACA,KAAAggL,SAAA,KAAAv2M,GACA,CACAC,IAAA8iB,CAAA,EACA,SAAAwzL,SAAA,CAAAv4L,GAAA,CAAA+E,GAGA,OAFA,KAAAwzL,SAAA,CAAAt2M,GAAA,CAAA8iB,GACA,KAAAwT,KAAA,CAAAr8B,IAAA,CAAA6oB,GACA,EACA,CAEAyzL,OAAAzzL,CAAA,EACA,IAAAhnB,EAAA,KAAAw6B,KAAA,CAAA3b,OAAA,CAAAmI,GACA,KAAAhnB,IACA,KAAAw6B,KAAA,CAAA6tG,MAAA,CAAAroI,EAAA,GACA,KAAAw6M,SAAA,CAAAp9I,MAAA,CAAAp2C,GAEA,CACA0zL,OAAA,CACA,KAAAlgL,KAAA,CAAA36B,MAAA,GACA,KAAA26M,SAAA,CAAAE,KAAA,EACA,CACA,CACA,SAAAC,GAAAC,CAAA,EAKA,IAAAC,EAAA,IAAAN,GACAO,EAAA,IAAAP,GACAQ,EAAA,EAKAC,EAAA,GACAC,EAAA,GAIAC,EAAA,IAAA5b,QACAvvJ,EAAA,CAIA,SAAA7tB,EAAAi5L,EAAA,GAAAC,EAAA,IACA,IAAAC,EAAAD,GAAAJ,EACA5lF,EAAAimF,EAAAR,EAAAC,CAAA,CAOS,OANTK,GACAD,EAAAh3M,GAAA,CAAAge,GACAkzG,EAAAlxH,GAAA,CAAAge,IAAAm5L,GAAAL,GAEAD,CAAAA,EAAAF,EAAArgL,KAAA,CAAA36B,MAAA,EAESqiB,CACT,EAIA,OAAAA,EAAA,CACA44L,EAAAL,MAAA,CAAAv4L,GACSg5L,EAAA99I,MAAA,CAAAl7C,EACT,EAIA,QAAAo5L,EAAA,CAMA,GAAAN,EAAA,CACAC,EAAA,GACA,MACA,IACAD,EAAA,GACA,CAAAH,EAAAC,EAAA,EAAAA,EAAAD,EAAA,CAEAC,EAAAJ,KAAA,GAEAK,EAAAF,EAAArgL,KAAA,CAAA36B,MAAA,CAEA,QAAAoF,EAAA,EAAAA,EAAA81M,EAAA91M,IAAA,CACA,IAAAid,EAAA24L,EAAArgL,KAAA,CAAAv1B,EAAA,CACAi2M,EAAAj5L,GAAA,CAAAC,KACA6tB,EAAAwrK,QAAA,CAAAr5L,GACA04L,KAEA14L,EAAAo5L,EACA,CACA,EACA,GACAL,IACAA,EAAA,GACAlrK,EAAA/oB,OAAA,CAAAs0L,GAEA,CACA,EACA,OAAAvrK,CAAA,CCjGA,IAAAyrK,GAAA,CACA,OACA,mBACA,SACA,YACA,SACA,aACA,CACAC,GAAA,GACA,SAAAC,GAAAC,CAAA,CAAAC,CAAA,EACA,IAAAhB,EAAA,GACAiB,EAAA,GACAjyJ,EAAA,CACAu2E,MAAA,EACAye,UAAA,EACAo8D,aAAA,EACA,EACAc,EAAAN,GAAmBxhM,MAAgB,EAAAC,EAAA3Y,KACnC2Y,CAAA,CAAA3Y,EAAA,CAAAq5M,GAAA,IAAAC,EAAA,IACS3gM,GACT,IACA8hM,EAAA,IACAD,CAAA,CAAAE,EAAA,CAAAh1L,OAAA,CAAA4iC,EACA,EACAqyJ,EAAA,IAA0B,CAC1B,IAAAr9D,EAAAw7D,GAAAE,eAAA,CACA1wJ,EAAAg1F,SAAA,CACAs9D,YAAAtuD,GAAA,GACAgtD,EAAA,GACAhxJ,EAAAu2E,KAAA,CAAA07E,EACA,OACAl8M,KAAAqrC,GAAA,CAAArrC,KAAAorC,GAAA,CAAA6zG,EAAAh1F,EAAAg1F,SAAA,CAAA68D,IAAA,GACA7xJ,EAAAg1F,SAAA,CAAAA,EACAh1F,EAAAoxJ,YAAA,IACAQ,GAAA1vM,OAAA,CAAAiwM,GACAnyJ,EAAAoxJ,YAAA,IACAJ,GAAAgB,IACAC,EAAA,GACAF,EAAAM,GAEA,EACAE,EAAA,KACAvB,EAAA,GACAiB,EAAA,GACAjyJ,EAAAoxJ,YAAA,EACAW,EAAAM,EAEA,EACAV,EAAAC,GAAAxhM,MAAA,EAAAC,EAAA3Y,IAAA,CACA,IAAAyuC,EAAA+rK,CAAA,CAAAx6M,EAAA,CAMK,OALL2Y,CAAA,CAAA3Y,EAAA,EAAA0lB,EAAAm0L,EAAA,GAAAC,EAAA,MACAR,GACAuB,IACApsK,EAAAwrK,QAAA,CAAAv0L,EAAAm0L,EAAAC,IAESnhM,CACT,MACAw8L,EAAa,GAAA+E,GAAA1vM,OAAA,IAAAgwM,CAAA,CAAAx6M,EAAA,CAAAm1M,MAAA,CAAAzvL,IACb,OAAAu0L,SAAAA,EAAA9E,OAAAA,EAAA7sJ,MAAAA,EAAAkyJ,MAAAA,CAAA,EC3D0K,IAAAP,SAAAa,EAAA,CAAA3F,OAAA4F,EAAA,CAAAzyJ,MAAA0xJ,EAAA,CAAAQ,MAAAA,EAAA,EAAAJ,GAAA,oBAAAY,sBAAAA,sBAAAnC,EAAA,KCE1K,SAAAoC,IAAsB,CACtB,IAAArC,EAAAD,KACA,CAAAuC,EAAwBC,EAAW,IAAA3C,EAAA4C,QAAA,KACnCC,EAAA,GAAA7C,EAAA8C,WAAA,OACK1C,EAAAxiL,OAAA,EAAA+kL,EAAAD,EAAA,EACL,GAAAA,EAAA,EAKAK,EAAA,GAAA/C,EAAA8C,WAAA,MAAAR,GAAAU,UAAA,CAAAH,GAAA,CAAAA,EAAA,EACA,OAAAE,EAAAL,EAAA,CCXqC,IAAAO,GAAA,GAAAjD,EAAA9jL,aAAA,QCKrC,SAAAgnL,GAAgB94L,CAAA,EAChB,IAAAmS,EAAA,GAAAyjL,EAAAviL,MAAA,QAIA,OAHA,OAAAlB,EAAAqB,OAAA,EACArB,CAAAA,EAAAqB,OAAA,CAAAxT,GAAA,EAEAmS,EAAAqB,OAAA,CCTA,IAAAulL,GAAA,GAAAnD,EAAA9jL,aAAA,GACAknL,mBAAA,GAAAx2L,EACAy2L,SAAA,GACCC,cAAA,SCCD,OAAAC,WAAAvD,EAAAwD,SAAA,CACAC,wBAAAC,CAAA,EACA,IAAAzrL,EAAA,KAAA1tB,KAAA,CAAAo5M,QAAA,CAAA/lL,OAAA,CACA,GAAA3F,GAAAyrL,EAAAE,SAAA,QAAAr5M,KAAA,CAAAq5M,SAAA,EACA,IAAAl+M,EAAA,KAAA6E,KAAA,CAAAs5M,OAAA,CAAAjmL,OAAA,CACAl4B,EAAAwoC,MAAA,CAAAjW,EAAA6rL,YAAA,IACAp+M,EAAA02C,KAAA,CAAAnkB,EAAA8rL,WAAA,IACAr+M,EAAAk6C,GAAA,CAAA3nB,EAAA+rL,SAAA,CACAt+M,EAAAq6C,IAAA,CAAA9nB,EAAAgsL,UAAA,CACA,OACA,KAKAC,oBAAA,EACAhc,QAAA,CACA,YAAA39L,KAAA,CAAAgsB,QAAA,CAEA,CACA,SAAA4tL,GAAe,CAAA5tL,SAAAA,CAAA,CAAKqtL,UAAAA,CAAA,GACpB,IAAAz0M,EAAA,CAAgB,EAAA6wM,EAAAoE,KAAA,IAChB7nL,EAAA,CAAiB,EAAAyjL,EAAAviL,MAAA,EAAM,MACvB/3B,EAAA,GAAAs6M,EAAAviL,MAAA,GACA2e,MAAA,EACAlO,OAAA,EACA0R,IAAA,EACKG,KAAA,CACL,GACA,CAAA/sB,MAAAA,CAAA,KAAAgtL,EAAAxjL,UAAA,EAAA2mL,IAkCA,MAxBA,GAAAnD,EAAA38K,kBAAgB,OAChB,IAAA+Y,MAAAA,CAAA,CAAAlO,OAAAA,CAAA,CAAA0R,IAAAA,CAAA,CAAAG,KAAAA,CAAA,EAAAr6C,EAAAk4B,OAAA,CACA,GAAAgmL,GAAA,CAAArnL,EAAAqB,OAAA,GAAAwe,GAAA,CAAAlO,EACA,OACA3R,EAAAqB,OAAA,CAAAymL,OAAA,CAAAC,WAAA,CAAAn1M,EACA,IAAAylC,EAAAliB,SAAAI,aAAA,UAeA,OAdAE,GACA4hB,CAAAA,EAAA5hB,KAAA,CAAAA,CAAA,EACAN,SAAAgI,IAAA,CAAAzH,WAAA,CAAA2hB,GACAA,EAAAniB,KAAA,EACAmiB,EAAAniB,KAAA,CAAA8B,UAAiC,EAAG;+BACpC,EAAAplB,EAAA;;mBAEA,EAAAitC,EAAsB;oBACH,EAAAlO,EAAI;iBACvB,EAAA0R,EAAoB;kBACpB,EAAAG,EAAA;;QAEA,GAEA,KACArtB,SAAAgI,IAAA,CAAA/F,WAAA,CAAAigB,EACK,CACL,GAAAgvK,EAAY,EACZ,GAAAt/K,EAAAM,GAAA,EAAA2+K,GAAA,CAAAK,UAAAA,EAAAD,SAAApnL,EAAAsnL,QAAAn+M,EAAA6wB,SAAAypL,EAAAuE,YAAA,CAAAhuL,EAAA,CAAAgG,IAAAA,CAAA,KCjEA,IAAAioL,GAAA,EAAAjuL,SAAAA,CAA6B,CAAAwzF,QAAAA,CAAW,CAAA65F,UAAAA,CAAA,CAAAa,eAAAA,CAAA,CAAA10C,OAAAA,CAAA,CAAA20C,sBAAAA,CAAA,CAAA77L,KAAAA,CAAA,KACxC,IAAA87L,EAAezB,GAAK0B,IACpBz1M,EAAA,GAAA6wM,EAAoBoE,KAAA,IACpBr7M,EAAA,GAAAi3M,EAAA6E,OAAA,QACA11M,GAAAA,EACA46G,QAAAA,EACA65F,UAAAA,EACA7zC,OAAAA,EACA,eAAA+0C,EAAA,CAEA,QAAAC,KADAJ,EAAAz6M,GAAA,CAAA46M,EAAA,IACAH,EAAAvmM,MAAA,IACA,IAAA2mM,EACA,OAESN,GAAAA,GACT,EACAO,SAAA,IACAL,EAAAz6M,GAAA,CAAA46M,EAAA,IACS,IAAAH,EAAArhJ,MAAA,CAAAwhJ,GAET,GAMIJ,EAAO,CAAA7+M,KAAA83K,MAAA,KAAAimC,EAAA,EAiBX,MAhBA,GAAA5D,EAAA6E,OAAA,OACKF,EAAA3yM,OAAA,EAAA/L,EAAAuB,IAAAm9M,EAAAz6M,GAAA,CAAA1C,EAAA,IACL,GAAAo8M,EAAA,EAKA5D,EAAAE,SAAA,MACA,GACAyE,EAAAj/M,IAAA,GACA++M,GACKA,GACL,GAAAb,EAAA,EACA,cAAA/6L,GACA0N,CAAAA,EAAA,GAAA+N,EAAAM,GAAA,EAAAu/K,GAAA,CAAAP,UAAAA,EAAArtL,SAAAA,CAAA,IAEA,GAAA+N,EAAAM,GAAA,EAAAq+K,GAAA7mL,QAAA,EAAA70B,MAAAwB,EAAAwtB,SAAAA,CAAA,EACA,EACA,SAAAquL,IAAA,CACA,WAAA36M,GAAA,CCpD2C,IAAAg7M,GAAA,GAAAjF,EAAA9jL,aAAA,MCC3C,SAAAgpL,GAAW98L,CAAS,EACpB,SAAA43L,EAAAE,SAAA,UAAA93L,IAAA,ICAA,IAAI+8L,GAWH9E,GCJD+E,GAAA,GAAAC,EAAA79M,GAAA,KACA,SAAA89M,GAAA/uL,CAAA,CAAAgvL,CAAA,EACAhvL,EAAAvkB,OAAA,KACA,IAAAxK,EAAA49M,GAAAC,GACKE,EAAAr7M,GAAA,CAAA1C,EAAA69M,EACL,EACA,CACA,SAAAG,GAAAjvL,CAAA,EACA,IAAAyiD,EAAA,GAMA,OAJAgnI,EAAAyF,QAAY,CAAAzzM,OAAA,CAAAukB,EAAc,IAC1B,GAAAypL,EAAA0F,cAAA,EAAAL,IACKrsI,EAAA30E,IAAA,CAAAghN,EACL,GACArsI,CACA,CAkCA,IAAI2sI,GAAS,EAAApvL,SAAAA,CAAA,CAAAw5I,OAAAA,CAAA,CAAAhmD,QAAAA,EAAA,GAAA06F,eAAAA,CAAA,CAAAmB,gBAAAA,CAAA,CAAAlB,sBAAAA,EAAA,GAAA77L,KAAAA,EAAA,WACbs8L,GAAA,CAAAS,EAAA,4CAGA,IAAA/C,EAAsB,GAAA7C,EAAAxjL,UAAY,EAAAyoL,IAAApC,WAAA,EAAAJ,IAAA,IAClCrC,EAAAD,KAEA0F,EAAAL,GAAAjvL,GACAuvL,EAAAD,EACAE,EAAA,GAAA/F,EAAAviL,MAAA,MAAAxzB,KAAA2zB,OAAA,CAGAooL,EAAA,GAAAhG,EAAAviL,MAAA,EAAAqoL,GAEAP,EAAA,GAAAvF,EAAAviL,MAAA,MAAAxzB,KAAA2zB,OAAA,CAGIqoL,EAAA,CAAyB,EAAAjG,EAAAviL,MAAA,MAW7B,GAVAwiL,GAAA,KACAgG,EAAAroL,OAAA,IACA0nL,GAAAO,EAAAN,GACKS,EAAApoL,OAAA,CAAAkoL,CACD,GACJZ,GAAA,KACAe,EAAAroL,OAAA,IACA2nL,EAAA3E,KAAA,GACKmF,EAAAnF,KAAA,EACL,GACAqF,EAAgBroL,OAAA,CAChB,SAAA0G,EAAAM,GAAA,EAAAN,EAAAilK,QAAA,EAAAhzK,SAAAuvL,EAAA9/M,GAAA,OAAAs+B,EAAAM,GAAA,EAAA4/K,GAAA,CAAAZ,UAAA,GAAA75F,QAAAA,EAAAA,GAAAnhH,KAAAA,EAAA87M,sBAAAA,EAAA77L,KAAAA,EAAA0N,SAAA8uL,CAAA,EAAAD,GAAAC,IAAA,EACA,CAEAS,EAAA,IAAAA,EAAA,CAGA,IAAAI,EAAAF,EAAApoL,OAAA,CAAA53B,GAAA,CAAAo/M,IACAe,EAAAN,EAAA7/M,GAAA,CAAAo/M,IAEAgB,EAAoBF,EAAAngN,MAAgB,CACpC,QAAAoF,EAAA,EAAAA,EAAAi7M,EAAAj7M,IAAA,CACA,IAAA3D,EAAA0+M,CAAA,CAAA/6M,EAAA,CACA,KAAAg7M,EAAAphM,OAAA,CAAAvd,IAAAu+M,EAAA59L,GAAA,CAAA3gB,IACAu+M,EAAA77M,GAAA,CAAA1C,EAAAoB,KAAAA,EAEA,OAGA,SAAAigB,GAAAk9L,EAAArgN,IAAA,EACAogN,CAAAA,EAAA,IAIAC,EAAA/zM,OAAA,EAAAs2L,EAAA9gM,IAAA,CAEA,GAAA2+M,KAAAA,EAAAphM,OAAA,CAAAvd,GACA,OACA,IAAA69M,EAAAE,EAAA39L,GAAA,CAAApgB,GACA,IAAA69M,EACA,OACA,IAAAgB,EAAAH,EAAAnhM,OAAA,CAAAvd,GACA8+M,EAAAhe,EACA,IAAAge,EAAA,CACA,IAAAC,EAAA,KAEAR,EAAAziJ,MAAA,CAAA97D,GAIA,IAAAg/M,EAAA7gN,MAAAud,IAAA,CAAAqiM,EAAA15M,IAAA,IAAAsjB,MAAA,KAAAg3L,EAAA5sJ,QAAA,CAAAktJ,IAaA,GAXAD,EAAAx0M,OAAA,IAAAuzM,EAAAjiJ,MAAA,CAAAojJ,IAEAV,EAAApoL,OAAA,CAAAioL,EAAA12L,MAAA,KACA,IAAAw3L,EAAAvB,GAAAwB,GACA,OAEAD,IAAAn/M,GAEiBg/M,EAAAjtJ,QAAA,CAAAotJ,EACjB,GAEA,CAAAZ,EAAArgN,IAAA,EACA,GAAA06M,CAAA,IAAAA,EAAAxiL,OAAA,CACA,OACAilL,IACA4B,GAAAA,GACA,GAEA6B,EAAA,GAAAhiL,EAAAM,GAAA,EAAA4/K,GAAA,CAAAZ,UAAA,GAAAa,eAAA8B,EAAAx2C,OAAAA,EAAA20C,sBAAAA,EAAA77L,KAAAA,EAAA0N,SAAA8uL,CAAA,EAAAD,GAAAC,IACAU,EAAA77M,GAAA,CAAA1C,EAAA8+M,EACA,GACK/3E,MAAA,CAAA83E,EAAA,EAAAC,EACL,GAGAR,EAAAA,EAAA9/M,GAAA,KACA,IAAAwB,EAAA69M,EAAA79M,GAAA,CACK,OAAAu+M,EAAA59L,GAAA,CAAA3gB,GAAA69M,EAAA,GAAA/gL,EAAAM,GAAA,EAAA4/K,GAAA,CAAAZ,UAAA,GAAAc,sBAAAA,EAAA77L,KAAAA,EAAA0N,SAAA8uL,CAAA,EAAAD,GAAAC,GAAA,GAOL,GAAA/gL,EAAAM,GAAA,EAAAN,EAAAilK,QAAA,EAAAhzK,SAAAwvL,EAAArgN,IAAA,CACAogN,EACAA,EAAA9/M,GAAA,OAAAg6M,EAAAuE,YAAA,EAAAc,GAAA,IAE2B,IAAA3qL,GAAAl2B,EAAA,MAAAqiN,GAAAriN,EAAAW,CAAA,CAAAu1B,IAAAosL,GAAAtiN,EAAA,MAAAuiN,GAAAviN,EAAAW,CAAA,CAAA2hN,IAAAE,GAAAxiN,EAAA,MAAAyiN,GAAAziN,EAAA,KAAA0iN,GAAA1iN,EAAA,MAAAA,EAAA,MCvJgE,IAAA2iN,GAAA,oBAAAj0M,OAAA8sM,EAAA18K,eAAA,CAAA08K,EAAAE,SAAA,CAI3F,SAAAkH,GAAuB3rI,CAAA,CAAArD,CAAM,CAAAngD,CAAA,CAAA9uB,CAAA,EAC3B,IAAAk+M,EAAA,GAAArH,EAAyBviL,MAAA,EAAA26C,GAC3B+uI,GAAA,KACGE,EAAAzpL,OAAA,CAAAw6C,CACD,GAAAA,EAAA,EACF,GAAA4nI,EAAAE,SAAA,OACA,IAAAoH,EAAA,CAAArvL,IAAA,EAAAA,EAAA,OAAAA,EAAA2F,OAAA,GAAA1qB,OACA,IAAAo0M,CAAAA,GAAAA,EAAAl8L,gBAAA,EACA,OACA,IAAAi6C,EAAA,IACAgiJ,EAAAzpL,OAAA,CAAA09C,EACA,EAEA,OADAgsI,EAAAl8L,gBAAA,CAAAqwD,EAAApW,EAAAl8D,GACA,KACAm+M,EAAA/7L,mBAAA,CAAAkwD,EAAApW,EAAAl8D,EACG,CACH,GAAAsyE,EAAAxjD,EAAA9uB,EAAA,EA8HA,SAAAo+M,GAAc7rL,CAAA,CAAM,CACpB,IAAAa,EAAA,GAAAyjL,EAAAviL,MAAA,OACG,+DAKH,OAHA0pL,GAAA,KACG5qL,EAAAqB,OAAA,CAAAlC,CACH,GAAAA,EAAS,EACT,GAAAskL,EAAA8C,WAAA,MAAAz0M,IAAAkuB,EAAAqB,OAAA,IAAAvvB,GAAA,CAAAkuB,EAAA,EC/F8B,IAAAirL,GAxD8C,SAC7ChgN,CAAC,CAASigN,CAAA,MACrCC,EAEC,GAAA1H,EAAA8C,WAAA,OAEG,GACF,CACA,IAAA3uK,EAAOjhC,OAAay0M,YAAM,CAAcC,OAAA,CAAApgN,GACxC,OAAO2sC,EAAO7rC,KAAA2f,KAAA,CAAAksB,GAAAszK,CAAA,OACd18M,EAAY,CAEd,OADE8D,QAAOo3D,IAAA,oCAAAhrC,MAAA,CAAAzzB,EAAA,MAAAuD,GACT08M,CACC,IAAeA,EAAIjgN,EAEtB,EAEM,CAAAqgN,EAAwBC,EAAkB,IAAA9H,EAAU4C,QAAA,EAAA8E,GACxDK,EAAAR,GAAA,IAOI,GACF,CACA,IAAAS,EAAOzgN,aAA0B8lK,SAAK9lK,EAAUsgN,GAAAtgN,CAAA,CAChD2L,OAAAy0M,YAAe,CAAAM,OAAA,CAAAzgN,EAAAc,KAAAC,SAAA,CAAAy/M,IACfF,EAAOE,GACP90M,OAAOg1M,aAAO,KAAAC,MAAA,wBACdp9M,EAAY,CACd8D,QAAAo3D,IAAA,oCAAAhrC,MAAA,CAAAzzB,EAAA,MAAAuD,EACF,CAEA,GAAgB,GAAAi1M,EACdE,SAAA,EAAe,KACf4H,EAAAJ,IAGF,MACyC,IACrCU,EAAK,GAAApI,EAAA8C,WAAD,YACFxnI,GAAAA,EAAA9zE,GAAA,EAAA8zE,EAAA9zE,GAAA,GAAAA,GAIJsgN,EAAAJ,IAAA,GAAMlgN,EAAUkgN,EAGlB,EAGO,OAFPN,GAAiB,UAAAgB,GAEjBhB,GAAO,gBAAAgB,GAAC,CAAaP,EAASE,EAChC,EAE8B5iL,GAAA3gC,EAAA,MAAA2/B,GAAA3/B,EAAA,MAAAsgC,GAAAtgC,EAAA,MCzE9B,IAAIq3B,GAEHmkL,EAAA9jL,aAAA,OAC0B,IAAAmsL,GAAAxsL,GCF3B,SAAAwI,IAAgB,CAChB,IAAM4L,EAGH+vK,EAAAxjL,UAAA,CAAA6rL,IAEH,OAAAp4K,CAAA,CCRA,IAAAq4K,GAAA,mBAAAngN,QAAeA,OAAA+6K,GAAA,CAAyD,IAAAqlC,GAAAD,GAAAngN,OAAA+6K,GAAA,kCCUxE,SAAAslC,GAAAC,CAAA,CAAAC,CAAA,EACA,sBAAAA,EAAA,CACA,IAAQC,EAIHD,EAAAD,GAEL,OAAAE,CACA,OACA,GAAAxkL,GAAA5W,CAAA,KAAAk7L,EAAAC,EAAA,CA2C4B,IAAAE,GAnC5B,SAAAr+M,CAAA,EACA,IACAgsB,SAAAA,CAAA,CACI0Z,MAAAy4K,CAAA,CACJ,CAAAn+M,EACMk+M,EAIHpkL,KAEH4L,EAAA+vK,EAAA6E,OAAA,MACA,IAAA7sL,EAAAywL,IAAA,GAAAA,EAAAC,EAAAF,GAAAC,EAAAC,EAAA,CAIG,OAHU,IAAM,EAAnB1wL,GACAA,CAAAA,CAAA,CAAAuwL,GAAA,CAAAE,IAAA,GAAAA,CAAA,EAEGzwL,CACH,GAAA0wL,EAAAD,EAAsB,EACtB,SAAAnkL,EAAAM,GAAA,EAAAyjL,GAAAjsL,QAAA,EACA70B,MAAA0oC,EACG1Z,SAAAA,CACH,EACA,EAa4BsyL,GAAArkN,EAAA,MAAAskN,GAAAtkN,EAAA,MAAA2uC,GAAA3uC,EAAA,MAAAkuC,GAAAluC,EAAA,MCnD5B,IAAAukN,GAAA,GACA,SAASC,GAAaxkL,CAAA,CAAAE,CAAA,CAAAgkL,CAAA,CAAAO,EAAA,IACtB,OAAAjJ,EAAA6E,OAAA,MACA,IAAAqE,EAAA1kL,GAAAE,CAAA,CAAAF,EAAA,EAAAE,EACA,sBAAAgkL,EAAA,CACA,IAAAC,EAAAD,EAA+BQ,GAC/BpgN,EAAA07B,EAAA,GAAAL,GAAA5W,CAAA,KAAAmX,EAAA,CACO,CAAAF,EAAA,CAAAmkL,CACP,GAAAA,CAAA,QAGA,EACA,IAAA7/M,EAEAA,CADA,CAEA,OACA07B,EAAA,GAAAL,GAAA5W,CAAA,KAAAmX,EAAA,CACK,CAAAF,EAAI,CAAAkkL,CACN,MAAAvkL,GAAA5W,CAAA,KAAAmX,EAAAgkL,EAAA,EACH,CAAAlkL,EAAAE,EAAAgkL,EAAAO,EAAA,EA4D4B,IAAAE,GAlD5B,SAAA5+M,CAAA,EACA,IACAgsB,SAAAA,CAAA,CACA0Z,MAAAy4K,CAAA,CACIlkL,QAAAA,CAAA,CACJ,CAAAj6B,EACAm6B,EAAA,GAAAokL,GAA2Cv7L,CAAA,EAAAw7L,IACrCK,EAIH/kL,MAAA0kL,GAEHM,EAAAL,GAAAxkL,EAAAE,EAAAgkL,GACAY,EAAAN,GAAAxkL,EAAA4kL,EAAAV,EAAA,IACAa,EAAAF,QAAAA,EAAsB7gL,SAAA,CACtB,SAAAlE,EAAAM,GAAA,EAAAgkL,GAAA,CACA34K,MAAAq5K,EACA/yL,SAAA,GAAA+N,EAAAM,GAAA,EAAAikL,GAAA3rL,CAAA,CAAAd,QAAA,EACA70B,MAAA8hN,EACA9yL,SAAA,GAAA+N,EAAAM,GAAA,EAAAuO,GAAA5lB,CAAA,EACAhmB,MAAAgiN,EACAhzL,SAAA,GAAA+N,EAAAM,GAAA,EAAA8N,GAAAnlB,CAAA,EACAhmB,MAAA8hN,IAAA,EAAAA,EAAA,OAAAA,EAAAz2K,UAAA,CACSrc,SAAAA,CACF,EACF,EACF,EACH,EACA,EAqB4BxH,GAAAvqB,EAAA,KCvFG,IAAAyiC,GAAA,UAM/B,SAAAuiL,GAAArsL,CAAA,EACA,IACM8S,MAAAK,CAAA,CACN,CAAAnT,EACA5yB,EAAA,GAAAu6B,GAAiCvX,CAAQ,EAAA4P,EAAA8J,IACzCwiL,EAAsBn5K,CAAA,CAAAvhB,GAAKxB,CAAA,EAC3B,SAAA+W,EAA2BM,GAAA,EAAAukL,GAAQ,GAAAhlL,GAAA5W,CAAA,KAAAhjB,EAAA,CACnCi6B,QAAAilL,EAAA16L,GAAAxB,CAAA,CAAA3kB,KAAAA,CAAA,CACGqnC,MAAAw5K,GAAAn5K,CACH,GACA,CASE,IAAAo5K,GAAAllN,EAAA,MAAA4/B,GAAA5/B,EAAA,MCpBF,IAAAmlN,GAAA,CAAA15K,EAAA25K,IAAA,GAAAzlL,GAAA5W,CAAA,GACAs8L,oBAAA,cAEAC,oBAAA,YAIAntK,UAAA,aAECotK,qBAAA,MACD,EAAAH,GAAA,CAAA35K,EAAAP,IAAA,GACCs6K,YAAA/5K,EAAA1G,OAAA,CAAA1gB,IAAA,GAEDhD,GAAAoqB,GAAA,GAAA9L,GAAA5W,CAAA,GACC0c,MAAA,CAAAgG,EAAAP,IAAA,EAAAO,CAAA,EAAA1G,OAAA,CAAAxhB,IAAA,CAAAof,OAAA,EACD8I,EAAApF,UAAA,CAAAuB,KAAA,EACA8P,gBAAA,CAAAjM,EAAAP,IAAA,EAAAO,CAAA,EAAA1G,OAAA,CAAAhC,UAAA,CAAA5b,OAAA,CACA,gBAEAuwB,gBAAA,CAAAjM,EAAAP,IAAA,EAAAO,CAAA,EAAA1G,OAAA,CAAA5D,MAAA,CAAAE,KAAA,CAEO,GACP1K,GAAA,CAAA8U,EAAA25K,EAAA,MACA,IAAAK,EACA,IAAAC,EAAA,GACAN,GAAA35K,EAAAk6K,YAAA,EACAviN,OAAAkC,OAAA,CAAAmmC,EAAAk6K,YAAA,EAAAn4M,OAAA,GAAAxK,EAAA4iN,EAAA,IACA,IAAAC,CACAH,CAAAA,CAAA,CAAAj6K,EAAAsF,sBAAA,CAAA/tC,GAAA2hB,OAAA,cACA6gM,YAAA,MAAAK,CAAAA,EAAAD,EAAA7gL,OAAA,SAAA8gL,EAAAxhM,IAAA,CAEA,GAEA,IAAAyhM,EAAA,GAAAnmL,GAAA5W,CAAA,GACAo8L,KAAAA,GAAA15K,EAAA25K,GACA,0BACKjtK,UAAA,SACL,EACA,aACKpc,WAAA0P,EAAApF,UAAA,CAAAM,cAAA,EAELtlB,KAAA,GAAAse,GAAA5W,CAAA,GACKoqB,OAAA,CACL,EAAA9xB,GAAAoqB,GAAA,CAGA,eACAiM,gBAAA,CAAAjM,EAAAP,IAAA,EAAAO,CAAA,EAAA1G,OAAA,CAAAhC,UAAA,CAAA5b,OAAA,CAEG,EACH,EAAAu+L,GACAK,EAAA,MAAAN,CAAAA,EAAAh6K,EAAA2C,UAAA,SAAAq3K,CAAAA,EAAAA,EAAAO,cAAA,SAAAP,EAAAn3K,cAAA,CAIA,OAHAy3K,GACAD,CAAAA,EAAA,CAAAA,EAAAC,EAAA,EAEAD,CAAA,EAqC0B,IAAAG,GA/B1B,SAAgBC,CAAA,EAChB,IAAAngN,EAAA,GAAAm/M,GAAAv+M,CAAA,GACAZ,MAAAmgN,EACG5iN,KAAA,gBACH,GACA,CACAyuB,SAAAA,CAAA,CACIqzL,kBAAAA,EAAA,GACJ,CAAAr/M,EACA,SAAA+5B,EAA4BqmL,IAAA,EAAA3K,EAAKzW,QAAA,EACjChzK,SAAA,IAAA+N,EAAAM,GAAA,EAAAR,GAAA7W,CAAA,EACK4N,OAAA8U,GAAA9U,GAAA8U,EAAA25K,EACF,GAAArzL,EAAA,EAEH,ECnFoB,IAClB8O,GAAQ,CAAAjnB,OACF,CACJs1B,GAAI,EACJC,GAAI,IACJC,GAAI,IACJC,GAAI,KACNC,GAAA,IACF,CAEA,EACMhJ,GAAa,iBACjBD,GAAY,CACZC,WAAIA,GAAAc,GACF,CACFd,WAAAA,EACA,EAAIe,GACF,CACFf,WAAAA,EACA,EAAIgB,GACF,CACFhB,WAAAA,EACA,EAAIiB,GACF,CACFjB,WAAAA,EACA,EAAIkB,GACF,CACFlB,WAAAA,EACA,EAAImB,GACF,CACAnB,WAAYA,GACdvK,WAAA,GACF,CAEA,EACEqqL,GAAO,CAAA1jL,MACL,CAASqC,QACP,CACA1gB,KAAA,QAAY0e,WACV,CACF5b,QAAA,SACA,EAASwb,QACP,CACF2B,KAAA,SACA,EAAW1B,UACH,CACR0B,KAAA,SACA,EAAM/gB,KACJ,CACAof,QAAA,UACFC,UAAA,SACF,CACA,EACAyD,WAAAA,GACA+H,WAAA,GACFvN,YAAAA,EACF,CAEA,EAGAwlL,GAAA,GAAAD,GAAA,KAAe,CAAgB,IAAAzhN,GAAA0hN,GClC/B,IAAMC,GAA+B,GAAA9K,EAAA9jL,aAAA,MAErC6uL,GAAwD,aAuCjC,IAAA96K,GAvCiC,SAApC+6K,CAAoB,CAAtB,CAChB,IAAMz0L,SAAAA,CAAA,EAAAy0L,EACAC,EAAC,QACD,CAACC,EAAcC,EAAG,CAAS3D,GAAAuD,GAACE,GAE5B,CAAApiM,EAAAuiM,EAAA,CAAgB,GAAApL,EAAA4C,QAAQ,EAAAsI,MAAAA,EAAMA,EAAAD,CAAA,EAClCI,EAAM,GAAerL,EAAA6E,OAAA,OACrB,IAAAyG,EAAO,GAAAnmL,GAAA5X,CAAA,EAAApkB,GAAA0f,IAAA,MACL,CACA0iM,UAAA1iM,EACAyiM,aAAAA,EAEK,gBAAAE,EACC,CAENJ,EAAA,GAAAI,MAAAA,EAAAA,EAAAC,UAAAA,EAAA,eACF,CACC,IAAM5iM,EAET,EAWwB,MAXR,GAAAm3L,EACdE,SAAS,OACTxtL,SAAIg5L,eAAiB,CAAA34L,YAAA,cAAAlK,GACnBA,SAAAA,EACF6J,SAAOg5L,eAAA,CAAAC,SAAA,CAAAvhN,GAAA,SAENsoB,SAAAg5L,eAAA,CAAAC,SAAA,CAAAhL,MAAA,SAEAwK,EAAAtiM,EAAA,GAAOA,EAAkBsiM,EAE5B,EACgC,GAAA7mL,EAAAM,GAAA,EAAAkmL,GAAA1uL,QAAA,EAAA70B,MAAA8jN,EACd90L,SAAQ,CAAc,EAAA+N,EAAYqmL,IAAA,EAAAnB,GAAA,CAAAv5K,MAAAo7K,EAAAC,YAAA,CAAA/0L,SAAA,CAE7C,GAAA+N,EAAAM,GAAA,EAAA6lL,GAAA,IAAAl0L,EAAA,EAIT,EAEA,EAAuB/xB,EAAA,MCnEvB64M,CADAA,EAIAA,GAAAA,CAAAA,EAAA,KAHA,uBACAA,EAAA,kBACCA,EAAA,gBACD,IAAAj3G,GAAA5hG,EAAA,MCJO,IAAAonN,GAAA,GAAA5L,EAAA9jL,aAAA,MACP,SAAA2vL,IAAW,CACX,SAAA7L,EAAAxjL,UAAA,EAAAovL,GACA,CCDA,IAAAE,GAAuB,EAAAv1L,SAAAA,CAAA,CAAOk8D,SAAAA,CAAA,CAAA1kF,OAAAA,EAAW,CAAAnB,WAAA,WAAU,MACnD,IAAAH,EAAW,GAAAuzM,EAAoB6E,OAAA,UAAAz+G,GAA8B2V,UAAS,CAAAtpB,EAAc1kF,GAAA,CAAA0kF,EAAA1kF,EAAA,EACpF,OAAAiyM,EAAAltL,aAAA,CAAA84L,GAAAxvL,QAAA,EAAA70B,MAAA,CAAAkF,WAAAA,CAAA,GAAA8pB,EACA,MAAAikG,GAAAh2H,EAAA,KCNA,OAAAunN,WAAAx5M,MAEAzL,YAAAI,CAAA,CAAA6D,CAAA,EACA,MAAA7D,GACA,KAAA6D,KAAA,CAAAA,CACA,CACO,CACP,MAAAihN,WAAAD,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,sBACA,CACO,CACP,MAAAmkN,WAAAF,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,kBACA,CACO,CACP,MAAAokN,WAAAH,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,oBACA,CACO,CACP,MAAAqkN,WAAAJ,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,wBACA,CACO,CACP,MAAAskN,WAAAL,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,0BACA,CACO,CACP,MAAAukN,WAAAN,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,2BACA,CACO,CACP,MAAAwkN,WAAAP,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,qBACA,CACO,CACP,MAAAykN,WAAAR,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,uBACA,CACO,CAOP,MAAA0kN,WAAAT,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,0BACA,CACO,CACP,MAAA2kN,WAAAV,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,6BACA,CACO,CACP,MAAA4kN,WAAAX,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,6BACA,CACO,CACP,MAAA6kN,WAAAZ,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,yBACA,CACO,CACP,MAAA8kN,WAAAb,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,oBACA,CACO,CCvEPw1M,CANAA,EAkBOA,GAAAA,CAAAA,EAAgC,KAZvC,sBACAA,EAAA,0BAKAA,EAAA,oBAKCA,EAAA,yBAED,OAAAuP,WAAAryF,GACA,IAAAsyF,WAAA,CACA,aAAApmN,SAAA,CAEA,MAAAqmN,aAAA,CACA,WAAA5wF,OAAA,EACA,CACA,MAAA6wF,mBAAA7/M,CAAA,CAAAV,CAAA,CAAAtD,EAAA,IACA,IAAAzC,EAAA,KAAAA,SAAA,CACA,IAAAA,EACA,UAAA8lN,EAAA,CAQA,OAPAr/M,EAAAsD,QAAA,CAAAtD,EAAAsD,QAAA,EAAA/J,EACAyG,EAAAuD,eAAA,CACAvD,EAAAuD,eAAA,EACA,OAAAjE,EAAAkE,kBAAA,EACA/D,WAAAzD,EAAA8G,mBAAA,CACiB+iI,eAAA7pI,EAAA6pI,cAAA,EACjB,EAAApiI,SAAA,CACAzD,CACA,CACO,CACP,SAAA8/M,GAAAC,CAAA,EAEA,uBAAAh6M,QAAA,oBAAAwf,SACA,OACA,IAAAy6L,EAAA,GACA,SAAAC,GAAA,CACA,IAAAC,EAAAH,IACA,GAAAG,EACA,QAAA92D,KAAA42D,EACA52D,GAEA,CAGA,IAAA55B,EAEAg4B,YAAAy4D,EAAA,KACAD,EAAA9oN,IAAA,KAAAwwJ,cAAAl4B,IAIA,YAAAjqG,SAAApH,UAAA,GACAoH,SAAAtH,gBAAA,oBAAAgiM,EAAA,CAAA5rB,KAAA,KACA2rB,EAAA9oN,IAAA,KAAAquB,SAAAnH,mBAAA,oBAAA6hM,KAKA,aAAA16L,SAAApH,UAAA,GACApY,OAAAkY,gBAAA,QAAAgiM,EAAA,CAAA5rB,KAAA,KACA2rB,EAAA9oN,IAAA,KAAA6O,OAAAqY,mBAAA,QAAA6hM,KAGAA,GACA,CAUA,SAAAE,IAAA,CAEA,IAAAC,UACA,SACA,IAAAC,EAAAD,UAAAC,SAAA,CAAAroM,WAAA,GAGAsoM,EAAAD,EAAAj0J,QAAA,YAAAi0J,EAAAj0J,QAAA,SAIAm0J,EAAAF,EAAAj0J,QAAA,WACA,OAAAk0J,GAAAC,CACA,CC9GA,SAAAtnN,GAAA+G,CAAA,EACA,kBAAAA,CACA,CCCA,MAAAwgN,WAAAd,GACA,MAAAv6J,gBAAAnlD,CAAA,CAAAV,CAAA,CAAAtD,EAAA,IACA,IAAAi8D,EAAA,GACA,IACA,GAAAh/D,GAAA+G,GAAA,CACA,SAAAygN,4BAA8B,CAC9B,UAAAnB,GAAA,iEACA,SAAAmB,4BAA8B,CAAAzlM,GAA0B,CAAAhb,EAAAm6D,OAAA,EACxD,UAAAmlJ,GAAA,+BAAAt/M,EAAAm6D,OAAA,mCACA,IACAn6D,EAAA,WAAA4D,eAAA,CAAA5D,GACA,IAAAsF,EAAAtF,EAAAO,SAAA,GACA,aAAAjB,EAAAmG,kBAAA,CAAAH,EAAAtJ,EACA,CACA,MAAA4B,EAAA,CAEA,GAAAA,aAAA2hN,GAEA,MADAtnJ,EAAA,GACAr6D,CAAA,OAEA,IAAA0hN,GAAA1hN,GAAA7D,QAAA6D,EAAA,CAEA,MAEA,IACA,IAAAqC,QAAAA,CAAA,IAAAsF,EAAA,CAAAvJ,EACAgE,EAAA,WAAA6/M,kBAAA,CAAA7/M,EAAAV,EAAAiG,GACAtF,GAAArH,QAAAoH,EAAA2D,WAAA,IAAA1D,GACAD,EAAA,WAAA4D,eAAA,CAAA5D,GACA,IAAAsF,EAAAtF,EAAAO,SAAA,GACA,aAAAjB,EAAAmG,kBAAA,CAAAH,EAAAC,EACA,CACA,MAAA3H,EAAA,CAEA,GAAAA,aAAA2hN,GAEA,MADAtnJ,EAAA,GACAr6D,CAAA,OAEA,IAAA0hN,GAAA1hN,GAAA7D,QAAA6D,EAAA,CAEA,CAEA,MAAAA,EAAA,CAIA,MAHAq6D,GACA,KAAAA,IAAA,SAAAr6D,GAEAA,CAAA,CAEA,CACA,MAAAoH,oBAAA6/C,CAAA,EACA,QAAgB7kD,KAAA6kD,EAChB,GAAA5rD,GAAA+G,GAAA,CACA,SAAAygN,4BAA8B,CAC9B,UAAAlB,GAAA,iEACA,SAAAkB,4BAA8B,CAAAzlM,GAA0B,CAAAhb,EAAAm6D,OAAA,EACxD,UAAAolJ,GAAA,+BAAAv/M,EAAAm6D,OAAA,mCACA,IAEAumJ,EAAA,GACA,QAAA1gN,KAAA6kD,EACA67J,EAAAxpN,IAAA,YAAA0M,eAAA,CAAA5D,IAEA,OAAA0gN,CACA,CACO,CACP,MAAAC,WAAAH,GACO,CACP,MAAAI,WAAAD,GACA,CCLA,IAAAE,GAAA,wEACAC,GAAA,+BACAC,GAAA,6CACAC,GAAA,+BACAC,GAAA,uCACAC,GAAA,wCACAC,GAAA,mCACAC,GAAA,0CACAC,GAAA,sDACAC,GAAA,4CACAC,GAAA,4CACAC,GAAkB,oDAClBC,GAAA,GAAAT,GAAA,EAAAC,GAA+B,EAAAC,GAAS,EAAAC,GAAU,EAAAC,GAAY,EAAAC,GAAO,EAAAC,GAAA,EAAAC,GAAA,EAAAC,GAAA,EAuCrE,SAASE,GAAQpmN,CAAA,EAmBjB,IAAAvB,EAAkB,GAAAuB,EAAAimH,MAAc;AAAA,EAChCxnH,GAAA,GAAAuB,EAAA27C,OAAA,GACA37C,EAAAqmN,SAAA,EACA5nN,CAAAA,GAAA;;AAAA,EAAAuB,EAAAqmN,SAAA,IAEA,IAAA9uM,EAAA,GAyBA,GAxBAvX,EAAAsmN,GAAA,EACA/uM,EAAA3b,IAAA,SAAAoE,EAAAsmN,GAAA,IAEAtmN,EAAA6+D,OAAA,EACAtnD,EAAA3b,IAAA,aAAAoE,EAAA6+D,OAAA,IAEA7+D,EAAAujF,OAAA,EACAhsE,EAAA3b,IAAA,cAAAoE,EAAAujF,OAAA,IAEAvjF,EAAAuqB,KAAA,EACAhT,EAAA3b,IAAA,WAAAoE,EAAAuqB,KAAA,IAEAvqB,EAAAumN,QAAA,EACAhvM,EAAA3b,IAAA,eAAAoE,EAAAumN,QAAA,IAEAvmN,EAAAwmN,cAAA,EACAjvM,EAAA3b,IAAA,qBAAAoE,EAAAwmN,cAAA,IAEAxmN,EAAAymN,SAAA,EACAlvM,EAAA3b,IAAA,gBAAAoE,EAAAymN,SAAA,IAEAzmN,EAAA0mN,SAAA,EACAnvM,EAAA3b,IAAA,gBAAAoE,EAAA0mN,SAAA,IAEA1mN,EAAA2mN,SAAA,CAEA,QAAAC,KADArvM,EAAA3b,IAAA,eAC6BoE,EAAA2mN,SAAS,EACtCpvM,EAAA3b,IAAA,MAAAgrN,EAAA,EAEA,CAIA,OAHArvM,EAAAja,MAAA,EACAmB,CAAAA,GAAA;;AAAA,EAAA8Y,EAAA1Y,IAAA,UAEAJ,CACA,CAjGA,WAAA8mN,GAAA,EAAAC,GAAA,EAAAC,GAAA,EAAAU,GAAA,QC5EA,IAAAU,GAAA,CACAC,oCAAA,sCACAC,gCAAA,kCACAC,8BAAA,gCACAC,qBAAA,uBACAC,sBAAA,wBACAC,uBAAA,yBACAC,+BAAA,gCACA,CACA,OAAAC,WAAAv9M,MACAzL,YAAA,GAAAuH,CAAA,EACA,IAAAe,EAAAlI,EAAAX,EAAA,CAAA8H,EACA,MAAAnH,GACA,KAAAkI,IAAA,CAAAA,EACA,KAAA7I,IAAA,CAAAA,EACA,KAAAuB,IAAA,iCACA,CACA,CAWA,MAAAioN,WAAAx9M,MACAzL,YAAA,GAAAuH,CAAA,EACA,IAAA2hN,EAAA5gN,EAAAlI,EAAAX,EAAA,CAAA8H,EACA,MAAAnH,GACA,KAAAkI,IAAA,CAAAA,EACA,KAAA7I,IAAA,CAAAA,EACA,KAAAypN,gBAAA,CAAAA,EACA,KAAAloN,IAAA,yCACA,EAkBA,SAAA+gD,GAAAxgC,CAAA,CAA4BygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,GAGA,SAAAsnN,GAAAC,CAAA,CAAAC,CAAA,EACA,OAAAtnK,GAAA,+BACA,IAAAunK,EAAA,MAAAhzC,OAAAizC,MAAA,CAAAC,SAA2D,OAAAJ,GAC3DK,EAAA,MAAAnzC,OAAAizC,MAAA,CAAA9iN,IAAA,EAAAwnB,KAAA,UAAAjtB,KAAA,SAAAqoN,EAAAC,GACArmM,EAAA,IAAA1Y,WAAA++M,EAAAnpM,UAAA,CAAAspM,EAAAtpM,UAAA,EAGK,OAFL8C,EAAA7f,GAAA,KAAAmH,WAAA++M,GAAA,GACArmM,EAAA7f,GAAA,KAAAmH,WAAAk/M,GAAAH,EAAAnpM,UAAA,EACK8C,CACL,GAGA,SAAAvjB,GAAAiC,CAAA,EACA,OAAAyK,OAAAs9M,IAAA,CAAA/nN,EAAA,CAGA,SAAAgoN,GAAWC,CAAuB,EAClC,OAAA7B,GAAA6B,EACA,CACA,SAAAC,GAAAD,CAAA,EACA,OAAAlqN,GAAAiqN,GAAAC,GAAA,CAIA,IAAAE,GAAA,0BACAC,GAAA,4BAUA,SAAAC,GAAuBC,CAAA,CAAAC,CAAA,EACvB,WAAAv3J,MAAA,IACA7xC,IAAAA,CAAA46B,EAAA51B,KACA,MAAA41B,CAAA,CAAA51B,EAAA,EACA41B,CAAAA,CAAA,CAAA51B,EAAA,UAAAqkM,CAAA,EACA,OAAApoK,GAAgC,YAAiB,mBACjD,IAAArgC,OAAAA,CAAA,CAAAyb,OAAAA,CAAA,EAAAitL,GAAAtkM,EAAAqkM,EAAAF,GACAjoN,EAAA,MAAAkoN,EAAAxoM,EAAAyb,GAKqB,MAHrB,cAAAzb,GAAAyb,EAAAktL,eAAA,GAAAroN,EAAAsoN,cAAA,EACAtoN,CAAAA,EAAA,qBAAAuoN,GAAAptL,EAAAktL,eAAA,CAAAroN,EAAAkoN,EAAA,EAEqBM,GAAA1kM,EAAA9jB,EAAAioN,EACrB,EACA,GAESvuK,CAAA,CAAA51B,EAAA,EAETlZ,eAAAA,IACS,GAET69M,eAAAA,IACS,EAET,EACA,CAUA,SAAAL,GAAAv3I,CAAA,CAAA63I,CAAA,CAAAT,CAAA,EACA,IAAA9sL,EAAAutL,EACAhpM,EAAAmxD,EACA7rE,QAAA,GACAqb,OAAA,iBAAAsoM,EAAAtsM,WAAA,MACAA,WAAA,GACA,OAAAw0D,GACA,gBAA0B,CAC1B,IAAA+3I,MAAAA,CAAA,EAAAztL,EACA,GAAA8sL,WAAAA,EAAA,CACA,OAAAW,GACA,qBACAA,EAAA,UACA,UAEA,gBACAA,EAAA,SACA,UAEA,iBACAA,EAAA,eACA,cAGAA,EAAAztL,EAAA4wD,OAAA,CAGA5wD,EAAA4wD,OAAA,CAAA68H,CACA,KACA,CACA,OAAAA,GACA,cACA,aACAA,EAAA,UAAAA,EAAA,EACA,UAEA,eACAA,EAAA,gBAGA,CACAztL,EAAAytL,KAAA,CAAAA,CACA,EAEA,kBAAoB,CACpB,IAAAC,WAAAA,CAAA,CAAAC,SAAAA,CAAA,EAAA3tL,EACA0tL,IAEA,WADAZ,GAEAvoM,EAAA,cACAyb,EAAA,CAAA0tL,WAAAA,EAAAC,SAAAA,CAAA,GAIAppM,EAAA,YAMA,CACA,CACA,OAAAA,OAAAA,EAAAyb,OAAAA,CAAA,CACA,CASA,SAAAqtL,GAAA9oM,CAAA,CAAAuB,CAAA,CAAAgnM,CAAA,EACA,GACA,oBADAvoM,EACA,CACA,IAAAqpM,EAAA9nM,EACA,OAAAgnM,GACA,cACA,IAAAjtJ,EAAA,CAAA8sJ,GAAA,CAIA,MAHA,KAAAiB,EAAAC,4BAAA,EACAhuJ,EAAAz/D,IAAA,CAAAwsN,IAEAjpN,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAgqN,GAAA,CAAA/tJ,SAAAA,CAAA,EACA,CACA,SACA,OAAAl8D,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAgqN,GAAA,CAAAE,oCAAA,GAAAD,6BAAAD,EAAA/tJ,QAAA,CAAAvK,QAAA,CAAAs3J,GAAA,EAEA,CACA,CACA,OACA9mM,CACA,CACA,SAAAsnM,GAAAW,CAAA,CAAAC,CAAA,CAAAjB,CAAA,EACA,IAAA1jN,EACA,OAAAu7C,GAAA,+BACA,IAAA6lE,EAAA,OAAAphH,CAAAA,EAAA0kN,EAAAtjG,MAAA,GAAAphH,KAAA,IAAAA,EAAAA,EAAA4F,OAAAgX,QAAA,CAAAgoM,IAAA,CACA9tK,EAAA6tK,EAAAllN,QAAA,IAAAq3C,OAAA,CACA+tK,EAAAxB,GAAA/oN,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAmqN,GAAA,CAAAtjG,OAAAA,EAAAtqE,QAAAA,CAAA,IACAguK,EAAA,MAAApB,EAAA,iBACA/iN,UAAA,CAAAm2C,EAAA,CACSiuK,SAAA,CAAAF,EAAA,GAETG,EAAA,CACAluK,QAAAA,EACAmuK,eAAAJ,EACA7gN,UAAA8gN,EAAAI,eAAA,IAAArsN,KAAA,CAAAgsN,EAAApsN,MAAA,CACA,EACK,OAAAusN,CACL,GAGA,IAAAG,GAAA,EACA,SAAAC,GAAAC,CAAA,EACA,GAAAA,GAAA,WACA,2FAEA,IAAAnhH,EAAA,IAAA3sF,YAAA4tM,IACA3rM,EAAA,IAAArC,SAAA+sF,GAEA,OADA1qF,EAAA0pL,SAAA,GAAAmiB,EAAA,IACA,IAAAthN,WAAAmgG,EAAA,CAGA,IAAAohH,GAAA,GACAC,GAAA,GACA,SAAAC,GAAAC,CAAA,CAAAJ,CAAA,CAAAK,CAAA,EACA,OAAAnqK,GAAA,+BACA,IAAAoqK,EAAAP,GAAAC,GACAO,EAAA,IAAA7hN,WAAAuhN,IACAx1C,OAAAC,eAAA,CAAA61C,GACA,IAAAC,EAAA,MAAA/1C,OAAAizC,MAAA,CAAA+C,OAAA,CAAAC,GAAAJ,EAAAC,GAAAF,EAAA,IAAAl9J,cAAAtvD,MAAA,CAAAusN,IACAhpM,EAAA,IAAA1Y,WAAA4hN,EAAAhsM,UAAA,CAAAisM,EAAAjsM,UAAA,CAAAksM,EAAAlsM,UAAA,EAIK,OAHL8C,EAAA7f,GAAA,KAAAmH,WAAA4hN,GAAA,GACAlpM,EAAA7f,GAAA,KAAAmH,WAAA6hN,GAAAD,EAAAhsM,UAAA,EACA8C,EAAA7f,GAAA,KAAAmH,WAAA8hN,GAAAF,EAAAhsM,UAAA,CAAAisM,EAAAjsM,UAAA,EACK8C,CACL,EACA,CACA,SAAAupM,GAAApsN,CAAA,CAAA8rN,CAAA,EACA,OAAAnqK,GAAA,+BACA,IAAAoqK,EAAA/rN,EAAAf,KAAA,GAAAssN,IACAS,EAAAhsN,EAAAf,KAAA,CAAAssN,GAAAA,GAAAG,IACAO,EAAAjsN,EAAAf,KAAA,CAAAssN,GAAAG,IACAW,EAAA,MAAAn2C,OAAAizC,MAAA,CAAAmD,OAAA,CAAAH,GAAAJ,EAAAC,GAAAF,EAAAG,GACAJ,EAAAU,KAAA71M,MAAA,CAAA21M,GACK,OAAAR,CACL,EACA,CACA,SAAAM,GAAAV,CAAA,CAAAO,CAAA,EACA,OACAQ,eAAAf,EACAgB,GAAAT,EACAprN,KAAA,UACA8rN,UAAA,GACA,CACA,CAEA,SAAAH,IAAA,CAIA,OAHA7qN,KAAAA,IAAAq0M,GACAA,CAAAA,EAAA,IAAApnJ,YAAA,UAEAonJ,CAAA,CAGA,SAAA4W,IAAA,CACA,OAAAhrK,GAAA,+BACA,aAAAu0H,OAAAizC,MAAA,CAAAyD,WAAA,EACAhsN,KAAA,QACSisN,WAAA,OACJ,cACL,GAGA,SAAAC,IAAA,CACA,OAAAnrK,GAAA,+BACA,aAAAu0H,OAAAizC,MAAA,CAAAyD,WAAA,EACAhsN,KAAA,OACSisN,WAAA,OACJ,gCACL,GAGA,SAAAE,GAAAC,CAAA,CAAAlB,CAAA,EACA,OAAAnqK,GAAA,+BACA,IAAAkqK,EAAAzqN,KAAAC,SAAA,CAAA2rN,GACAvB,EAAAuB,EAAA/kN,EAAA,CACK,OAAA2jN,GAAAC,EAAAJ,EAAAK,EACL,EACA,CACA,SAAAmB,GAAAjtN,CAAA,CAAA8rN,CAAA,EACA,OAAAnqK,GAAA,+BACA,IAAAkqK,EAAA,MAAAO,GAAApsN,EAAA8rN,GACAkB,EAAA5rN,KAAA2f,KAAA,CAAA8qM,GACA,GAAAnrN,OAAA2L,cAAA,CAAAC,IAAA,CAAA0gN,EAAA,SACA,UAAAnE,GAAAmE,EAAA/kN,EAAA,CAAA+kN,EAAAnpN,KAAA,CAAAqE,IAAA,CAAA8kN,EAAAnpN,KAAA,CAAA7D,OAAA,EAEK,OAAAgtN,CACL,GAGA,SAAAE,GAAAC,CAAA,CACAC,CAAA,CAAAC,CAAA,EACA,OAAA1rK,GAAA,+BACA,IAAA2rK,EAAAC,EAAA,OAAA1uM,QAAAqkC,GAAA,EACAgzH,OAAAizC,MAAA,CAAAC,SAAA,OAAAgE,GACAl3C,OAAAizC,MAAA,CAAAqE,SAAA,OAAAL,EAAAluN,KAAA,GAAA0sN,IAAA,CAAA/qN,KAAA,OAAAisN,WAAA,gBACA,EACAf,EAAA,MAAA51C,OAAAizC,MAAA,CAAAsE,UAAA,EAAA7sN,KAAA,OAAA8sN,OAAAH,CAAA,EAAAF,EAAA,KACAM,EAAA,MAAAz3C,OAAAizC,MAAA,CAAAqE,SAAA,OAAA1B,EAAA,yBACA8B,EAAA,MAAA13C,OAAAizC,MAAA,CAAA0E,SAAA,EACAjtN,KAAA,OACAitB,KAAA,UACAigM,KAAA,IAAA3jN,WAAAmjN,GACS9qL,KAAA,IAAAr4B,UACT,EAAAwjN,EAAA,CAAA/sN,KAAA,UAAA/B,OAAA,+BACK,OAAA+uN,CACL,GAGA,SAAAG,GAAA/tN,CAAA,CAAA8rN,CAAA,EACA,OAAAnqK,GAAA,+BACA,IAAAkqK,EAAA,MAAAO,GAAApsN,EAAA8rN,GACAkC,EAAA5sN,KAAA2f,KAAA,CAAA8qM,GACAhC,EAAA,SACA,GAAAnpN,OAAA2L,cAAA,CAAAC,IAAA,CAAA0hN,EAAA,KACA,OAAAA,EAAAtrN,CAAA,EACA,OACA,QACA,SACAmnN,EAAA,KACA,UACA,SACAA,EAAA,SACA,cAEA,UAAAjB,GAAAR,GAAAO,8BAAA,0CAAAqF,EAAAtrN,CAAA,IAEA,MACA,CACSurN,iBAAApE,CACJ,CACL,GAGA,SAAAqE,IAAA,CACA,OAAAC,GAAA,MAAAxvN,KAAAwZ,KAAA,CAAAxZ,MAAAA,KAAA83K,MAAA,IACA,CACA,SAAA03C,GAAAC,CAAA,EACA,GAAAA,EAAA,OAAAA,EAAA,MACA,UAAAxF,GAAAR,GAAAC,mCAAA,6DAAA+F,EAAA,UAAAA,KAAAA,CAAA,GAEA,OAAAA,CAAA,CAIA,SAAAC,GAAAruM,CAAA,EACA,IAAAsuM,EAAA,GACAtsM,EAAA,IAAA7X,WAAA6V,GACAqX,EAAArV,EAAqBjC,UAAU,CAC/B,QAAA+vI,EAAA,EAAAA,EAAAz4H,EAAAy4H,IACAw+D,GAAAvwM,OAAA8B,YAAA,CAAAmC,CAAA,CAAA8tI,EAAA,EAEA,OAAA9jJ,OAAAs9M,IAAA,CAAAgF,EAAA,CAGA,SAAAC,GAAAC,CAAA,EACA,OAAAA,EAAAvsM,OAAA,eACA,QACA,QACK,OACL,GAAA6F,EAAA,EAGA,IAAA2mM,GAAA,gBACA,SAAAC,GAAAC,CAAA,EACA,OAAAA,EAEA1sM,OAAA,oBAEAzJ,KAAA,KACA,CACA,SAAAo2M,GAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,KACA,GAAAD,EAAA,CACA,IACAC,EAAA,IAAAC,IAAAF,EACA,CACA,MAAA1oN,EAAA,EACA,IAAA2oN,MAAAA,EAAA,OAAAA,EAAAr3E,QAAA,aACA,UAAAkxE,GAAAR,GAAAE,+BAAA,6DAEA,GACAyG,CAAAA,EAAA,IAAAC,IAAA,GAAAP,GAAA,MACA,IAAAQ,EAAAJ,EAAA58J,UAAA,MAEA48J,EAEA,IAAAH,GAAAK,EAAAE,QAAA,KAAAP,GAAAG,GAAA,CAAAzuN,IAAA,MACA,WAAA4uN,IAAAC,EAAAF,EACA,CACA,SAAAG,GAAA9B,CAAA,CAAA+B,CAAA,CAAAC,CAAA,CAAAC,EAAA,QACA,OAAA1tK,GAAA,+BACA,IAAA2tK,EAAAnB,GAAAgB,GACAI,EAAA,MAAAr5C,OAAAizC,MAAA,CAAAC,SAAA,OAAAgE,GACAoC,EAAAnB,GAAAkB,GACAtmN,EAAA2lN,GAAA,qBAAAQ,GAMK,OALLnmN,EAAA+T,YAAA,CAAAha,GAAA,eAAwCurN,GAAgBiB,IACxDvmN,EAAA+T,YAAA,CAAAha,GAAA,WAAAssN,EAAA,GACAD,EAAAvkN,OAAA,KACS7B,EAAA+T,YAAA,CAAAha,GAAA,KAAAo9D,EACT,GACKn3D,CACL,GAIA,IAAAwmN,GAAA,CACAC,QAAA,EACAC,MAAA,CACA,EACA,SAAAC,GAAA7uN,CAAA,EACA,OAAAA,CACA,CACA,SAAA8uN,IAAA,CACA,OAAAxJ,KAAAA,UAAAC,SAAA,CAAAzoM,OAAA,aAAA4xM,GAAAC,OAAA,CAAAD,GAAAE,KAAA,CAEA,SAAAG,IAAA,CAIA,WAAAjxM,QAAA,CAAAI,EAAAH,IAAA,CACA,SAAAixM,GAAA,CACAp6F,aAAAuzB,GACAl9I,OAAAqY,mBAAA,QAAA2rM,EACA,CACA,SAAAA,GAAA,CACAD,IACA9wM,GACA,CACAjT,OAAAkY,gBAAA,QAAA8rM,GACA,IAAA9mE,EAAAjoE,WAAA,KACA8uI,IACSjxM,GACJ,MACL,EACA,CACA,IAAAmxM,GAAA,KACA,SAAAC,GAAAjnN,CAAA,EACA,MAAAgnN,KAEAA,CADAA,GAAAzkM,SAAAI,aAAA,YACA8hB,KAAA,CAAAkK,OAAA,QACApsB,SAAA7M,IAAA,CAAAoN,WAAA,CAAAkkM,KAGAA,GAAAE,aAAA,CAAAntM,QAAA,CAAAotM,IAAA,CAAAnnN,EAAArC,QAAA,EACA,CACA,SAAAypN,GAAAjD,CAAA,CAAAgC,CAAA,EACA,OAAAztK,GAAA,+BACA,IAAA2uK,EAAApC,KACAqC,EAAA,MAAArB,GAAA9B,EAAAkD,EAAAlB,GACA,GAAAmB,WAAAA,EAAA74E,QAAA,CAIA1rI,OAAAgX,QAAA,CAAAriB,MAAA,CAAA4vN,QAIA,IACA,IAAAh+F,EAAAs9F,KACA,OAAAt9F,GACA,KAAAk9F,GAAAC,OAAA,CAEAQ,GAAAK,GAEA,WACAd,GAAAE,KAAA,EACA,IAAAa,EAAAV,KACA9jN,OAAAgX,QAAA,CAAAriB,MAAA,CAAA4vN,GACA,MAAAC,EACA,MAEA,QACAZ,GAAAr9F,EACA,CACA,CACA,MAAAvtH,EAAA,CACA,UAAA4jN,GAAAR,GAAAM,sBAAA,wEAEA,OACK4H,CACL,GAGA,IAAAG,GAAA,CAWAC,qBAAA,kCACAvnE,UAAA,GACA,EACAwnE,GAAA,oCACA,SAAAC,IAAA,CACA,uBAAA5kN,QAAAA,CAAA,IAAAA,OAAA6kN,eAAA,CACA,UAAAjI,GAAAR,GAAAG,6BAAA,mFAGA,SAAAuI,GAAAC,CAAA,EACA,IAAA9nN,EACA,IACAA,EAAA,IAAA+lN,IAAA+B,EACA,CACA,MAAA3qN,EAAA,CACA,UAAAwiN,GAAAR,GAAAE,+BAAA,wCAEA,GAAAr/M,WAAAA,EAAAyuI,QAAA,CACA,UAAAkxE,GAAAR,GAAAE,+BAAA,6DAGA,SAAA0I,GAAA1mH,CAAA,EACA,IAAA1qF,EAAA,IAAArC,SAAA+sF,GACA,OAAA1qF,EAAAi9F,SAAA,MACA,CACA,SAAAo0G,GAAA/vM,CAAA,CAAAra,CAAA,EACA,OAAA86C,GAAA,mCAKAuvK,EAJAN,KACA,IAAAO,EAAA,MAAAxE,KACAyE,EAAA,MAAAf,GAA+Cc,EAAY3xN,SAAA,CAAAqH,MAAAA,EAAA,OAAAA,EAAAwqN,OAAA,EAC3DC,EAAA,kBAAAF,EAAA,gBAEAG,EAAA,MACA,IAAAhX,EAAA,IAAAkW,GAAAC,oBAAA,EACS,UAAAnW,EAAA17M,MAAA,GAAA07M,EAAA9gM,KAAA,GAAA8gM,CAAA,IACT,IACAiX,EAAA,EACAC,EAAsB,EACtB7oK,EAAA,CAAA8+F,OAAA,gBACA,WAAA7oI,QAAA,CAAAI,EAAAH,IAAA,KACA00G,EAiIAk+F,EACAC,EAhIA,IAAAC,EAAA,GACAC,EAAA,IAAAlwK,GAAA,+BACA,GAAAiH,eAAAA,EAAA8+F,MAAA,EACA//I,QAAAo3D,IAAA,CACA,wFAAAnW,EAAA8+F,MAAA,OACA,MACA,IACA,CAAAypE,mBAAAA,CAAA,EAAAvoK,EACA4qE,EAAAnvG,mBAAA,QAAAwtM,GACA,IAAAC,EAAA,MAAAhF,KACAt5F,EAAAlvG,IAAA,QAAAykM,GAAA+I,EAAAtyN,SAAA,CAAA2xN,EAAA51F,UAAA,IACA3yE,EAAA,CACA8+F,OAAA,iBACA0lE,qBAAA+D,EAAA3xN,SAAA,CACA6tN,eAAAyE,EAAAv2F,UAAA,CAEA,GACAw2F,EAAA,IACAt3B,EAAAu3B,QAA8B,CAC9BppK,EAAA,CAAA8+F,OAAA,gBAGA5oI,EAAA,IAAA8pM,GAAAR,GAAAI,oBAAA,6CAAA/tB,EAAAvyL,IAAA,KAAAuyL,EAAAlvI,MAAA,MAAA0mK,WAAAx3B,CAAA,IAEAi3B,GACA,EACAQ,EAAA,GAAAvwK,GAAA,+BACA+vK,IACAt4H,KAAAwzD,GAAA,GAAAskE,GAAAT,GAAAtnE,SAAA,CACArqI,EAAA,IAAA8pM,GAAAR,GAAAK,qBAAA,sDAAA2I,EAAA,MAGA,UAAAvyM,QAAA,IACA,IAAAszM,EAAAZ,IACqBI,EAAA3lN,OAAAi1E,UAAA,CAAAhiE,EAAAkzM,EACrB,GACAC,IAEA,GACAC,EAAA,GAAA1wK,GAAA,+BACA,IAAA2wK,EAAA,MAAA73B,EAAAp7L,IAAA,CAAA+d,WAAA,GACA,OAAAwrC,EAAA8+F,MAAA,EACA,gBACA,IACA,IAAAqkE,EAAAuG,EAAArzN,KAAA,GAAAssN,IACAE,EAAAuF,GAAAjF,GACA,GAAAN,IAAAgG,EAAA,EACA,6DAEAA,EAAAhG,EACA,IAAAuB,EAAA,MAAAC,GAAAqF,EAAA1pK,EAAAkjK,YAAA,EACAyG,EAAAX,CAAA,CAAA5E,EAAA/kN,EAAA,SACA2pN,CAAA,CAAA5E,EAAA/kN,EAAA,EACAsqN,EAAAtzM,OAAA,CAAA+tM,EAAAprN,MAAA,CACA,CACA,MAAAoD,EAAA,CACA,GAAAA,aAAA6jN,GAAA,CACA,IAAA0J,EAAAX,CAAA,CAAA5sN,EAAA8jN,gBAAA,SACA8I,CAAA,CAAA5sN,EAAA8jN,gBAAA,EACAyJ,EAAAzzM,MAAA,CAAA9Z,EACA,MAEA,MAAAA,CAAA,CAGA,UACA,kBACA,IAAA8mN,EAAA,MAAAoB,GAAAoF,EAAA1pK,EAAAwkK,oBAAA,CAAAxkK,EAAAykK,cAAA,EACAmF,EAAAF,EAAArzN,KAAA,CAAA0sN,IACA8G,EAAAD,IAAAA,EAAAzyM,UAAA,CACA,MAAA4hC,GAAA,+BACA,IAAAoqK,EAAAyG,EAAAvzN,KAAA,GAAAssN,IACAE,EAAAuF,GAAAjF,GACA,GAAAN,IAAAgG,EAAA,EACA,6DAG6B,OAD7BA,EAAAhG,EACsCsC,GAAAyE,EAAA1G,EACtC,GAAkC,CAAAmC,iBAAA,UAClCrlK,EAAA,CAAA8+F,OAAA,YAAAokE,aAAAA,EAAA2G,kBAAAA,CAAA,EACA,IAAA7pN,EAAAghN,GAAA6I,EAAAxE,gBAAA,EAAA3sM,EAAAyb,IAAA4kB,GAAA,+BACA,IAAA15C,EAAAupN,IAOA,OANAh+F,EAAAlvG,IAAA,QAAAyoM,GAAA,CACA9kN,GAAAA,EACAD,QAAA,MACAsZ,OAAAA,EAC6Byb,OAAAA,MAAAA,EAAAA,EAAA,IAC7B+uL,EAAA,GACA,IAAAjtM,QAAA,CAAAI,EAAAH,IAAA,CACA8yM,CAAA,CAAA3pN,EAAA,EACAgX,QAAArd,CAAA,EACA,OAAA0f,GACA,gBACA,kBAAwD,CACxD,IAAAoxM,gBAAAA,CAAA,EAAA9wN,EACA,GAAA8wN,IAAA,EAAAA,EACA,IACA5B,GAAA4B,EACA,CACA,MAAA1tN,EAAA,CACA8Z,EAAA9Z,GACA,MACA,CACA,CAGA,CACqCia,EAAArd,EACrC,EACAkd,OAAAA,CAC6B,CACJ,EACzB,IACA,IACAG,EAAA,OAAAiC,EAAAtY,EAAA,EACA,CACA,MAAA5D,EAAA,CACA8Z,EAAA9Z,EACA,QACA,CACA0sN,IACAl+F,EAAAQ,KAAA,EACA,CAEA,CACa,CACb,GAGAo+F,EAAA,KACAV,GACAA,IAEA9oK,EAAA,CAAA8+F,OAAA,aAAAypE,mBAAAA,CAAA,EACAzvN,KAAAA,IAAAwvN,GACAA,CAAAA,EAAA93H,KAAAwzD,GAAA,IAGAp5B,CADAA,EAAA,IAAAE,UAAA49F,EAAA,CAAAX,GAAA,GACAzsM,gBAAA,QAAA2tM,GACAr+F,EAAAtvG,gBAAA,SAAA6tM,GACAv+F,EAAAtvG,gBAAA,SAAAguM,GACA1+F,EAAAtvG,gBAAA,WAAAmuM,GACAX,EAAA,KACA1lN,OAAA2pH,YAAA,CAAAg8F,GACAn+F,EAAAnvG,mBAAA,QAAAwtM,GACAr+F,EAAAnvG,mBAAA,SAAA0tM,GACAv+F,EAAAnvG,mBAAA,SAAA6tM,GACA1+F,EAAAnvG,mBAAA,WAAAguM,EACA,CACA,EACSD,GACJ,EACL,GAEsP,IAAA/iK,GAAA/xD,EAAA,MC7sBtP,SAAA8pD,GAAAzkD,CAAA,CAAAqC,CAAA,EACA,IAAAlC,EAAA,GACA,QAAA4iB,KAAA/iB,EAAAjC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA1gB,EAAAA,EAAA6Y,OAAA,CAAA6H,IACA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EACA,GAAA/iB,IAAA,EAAAA,GAAA,mBAAAjC,OAAA2mD,qBAAA,CACA,QAAApjD,EAAA,EAAAyhB,EAAAhlB,OAAA2mD,qBAAA,CAAA1kD,GAAAsB,EAAAyhB,EAAA7mB,MAAA,CAAAoF,IACA,EAAAe,EAAA6Y,OAAA,CAAA6H,CAAA,CAAAzhB,EAAA,GAAAvD,OAAA0L,SAAA,CAAAk7C,oBAAA,CAAAh7C,IAAA,CAAA3J,EAAA+iB,CAAA,CAAAzhB,EAAA,GACAnB,CAAAA,CAAA,CAAA4iB,CAAA,CAAAzhB,EAAA,EAAAtB,CAAA,CAAA+iB,CAAA,CAAAzhB,EAAA,EACA,CACA,OAAAnB,CACA,CAEA,SAAA6vN,GAAAxxM,CAA4B,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,GAGA,SAAAmxN,GAAAtoH,CAAA,EACA,OAAAt+F,OAAAs9M,IAAA,CAAAvrM,OAAA8B,YAAA,CAAAvT,IAAA,SAAAg+F,GACA,CACA,SAAAuoH,GAAAC,CAAA,EACA,WAAA3oN,WAAA6B,OACA+mN,IAAA,CAAAD,GACAt6M,KAAA,KACA1Z,GAAA,IAAA4mD,EAAAp3B,UAAA,MAGA,SAAA0kM,GAAA/sN,CAAA,EACA,IAAAsoI,EAAA,YAAAtoI,EACAA,EAAAO,SAAA,GACAP,EAAAO,SAAA,EACA0jD,qBAAA,GACS8pC,iBAAA,EACT,GACAw1H,EAAAoJ,GAAArkF,GACA,OAAAi7E,CACA,CACA,SAAAyJ,GAAA3oH,CAAA,EACA,IAAAqoD,EAAAroD,CAAA,IACA4oH,EAAoBvgE,EAAAzzD,GAAA0W,yBAA0C,GAC9Dx1C,EAAA8+B,GAAAuY,gBAAA,CAAA+zB,yBAAA,CAAAlhC,EAAArrG,KAAA,CAAAi0N,EAAA5oH,EAAAzrG,MAAA,SACA,WAAAuhE,EACA8+B,GAAA/0C,WAAA,CAAAnuC,IAAA,CAAAsuF,GAGApL,GAAAwY,oBAAA,CAAAqrB,WAAA,CAAAz4B,EACA,CAEA,SAAA6oH,GAAoBjyM,CAAA,CAAAra,CAAA,EACpB,OAAA8rN,GAAA,+BACA,IAAAS,EAAA,GAA6C,CAC7C,IAAAC,EAAA,IAAA9gK,MAAA,IACA7xC,IAAA46B,CAAA,CAAA51B,CAAA,EACA,GAAA41B,IAAA,EAAAA,CAAA,CAAA51B,EAAA,CACA,OAAAA,GACA,8BACA41B,CAAA,CAAA51B,EAAA,CAA0C,SAAAtf,CAAA,EAC1C,IAAA0lI,eAAAA,CAAoD,CAAApmI,WAAAA,CAAA,CAAA+F,cAAAA,CAAA,CAAA+kI,WAAAA,CAAA,CAAA8iF,uCAAAA,CAAA,CAAAxoK,aAAAA,CAAA,EAAA1kD,EAAAnG,EAAAmnD,GAAAhhD,EAAA,sHACpD,OAAAusN,GAAA,+BACA,IAAAxH,EAAArgK,EAAAhsD,GAAA,CAAAk0N,IACA/wN,EAAA,CACAsxN,iBAAAznF,EACApmI,WAAAA,EACA8tN,eAAA/nN,EACAgoN,YAAAjjF,EACAkjF,6CAAAJ,CACA,EACA,CAAgDppN,WAAAypN,CAAA,QAAA/qN,EAAAgrN,uBAAA,CAAAlzN,OAAAC,MAAA,CAAAD,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAV,GAAAS,OAAAwW,MAAA,CAAAjV,GAAAypE,IAAA,CAAA36C,GAAAA,IAAA,EAAAA,GAChD,CAAA9uB,QAAwDA,CAAA,EACxD,OAAAkpN,SAAAA,CAAA,IACAjhN,EAAAypN,EAAA70N,GAAA,CAAA+zN,IAAA/zN,GAAA,CAAAuwD,GAAA/vD,MAAA,EACqC,OAAA4K,CACrC,EACA,EACA,UACA,eACAoxC,CAAA,CAAA51B,EAAA,CAA0C,SAAWtf,CAAA,EACrD,IAAA+kN,SAAAA,CAA2C,EAAS/kN,EAAAnG,EAAAmnD,GAAAhhD,EAAA,cACpD,OAAAusN,GAAA,+BACA,IAAAkB,EAAgD1I,EAAArsN,GAAA,CAAA8zN,IAChD,CAAAtH,gBAAAwI,CAAA,QAAAlrN,EAAAmrN,YAAA,CAAArzN,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAV,GAAA,CAAAkrN,SAAA0I,CAAA,IACAG,EAAAF,EAAAh1N,GAAA,CAAA+zN,IACqC,OAAAmB,CACrC,EACA,EACA,UACA,mBACA14K,CAAA,CAAA51B,EAAA,CAA0C,SAAAtf,CAAA,CAAe,CACzD,IAAA0kD,aAAAA,CAAoD,EAAA1kD,EAAAnG,EAAAmnD,GAAAhhD,EAAA,kBACpD,OAAAusN,GAAA,+BACA,IAAAxH,EAAgDrgK,EAAAhsD,GAAA,CAAAk0N,IAChD,CAAA1H,gBAAA2I,CAAA,QAAArrN,EAAAoiD,gBAAA,CAAAtqD,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAV,GAAA,CAAAkrN,SAAAA,CAAA,IACA+I,EAAAD,EAAAn1N,GAAA,CAAA+zN,IACAlM,EAAAuN,EAAAp1N,GAAA,CAAAm0N,IACqC,OAAAtM,CACrC,EACA,EACA,cAEArrK,CAAA,CAAA51B,EAAA,CAAA9c,CAAA,CAAA8c,EAAA,CAIA,OACiB41B,CAAA,CAAA51B,EAAA,EAEjBlZ,eAAAA,IACiB,GAEjB69M,eAAAA,IACiB,EAEjB,GACA,OAAAnpM,EAAAmyM,EACA,EACK,aAAApC,GAAAmC,EAAAvsN,EACL,GCzHA,SAAAstN,GAAAhzM,CAA4B,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC5B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAoC,SAAMI,CAAA,CAAAH,CAAA,EAC1C,SAAAkjC,EAAA3hD,CAAA,EAAmC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACxF,SAAA2b,EAAAtgB,CAAA,CAAgC,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAChC,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACKouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACL,GAGA,SAAA2yN,GAAAtB,CAAA,EACA,WAAA3oN,WAAA6B,OACA+mN,IAAA,CAAAD,GACAt6M,KAAA,KACA1Z,GAAA,IAAA4mD,EAAAp3B,UAAA,MAGA,SAAA+lM,IAAA,CACA,0BAAAroN,QACAA,OAAA6kN,eAAA,EACA,oBAAArlM,UACA,WAAAxN,IAAA,CAAAqoM,UAAAC,SAAA,EAGA,IAAAgO,GAAA,wBACA1+G,GAAA,GACA,SAAA2+G,GAA+Br3K,CAAA,EAC/B,IAAAs3K,EAAeJ,GAASl3K,GACxB,WAAAgiD,GAAAziF,SAAA,CAAA+3M,EACA,CACA,SAAAC,GAAAxuN,CAAA,EACA,kBAAAA,CACA,CACA,MAAAyuN,WAAA7N,GACAjnN,YAAAiH,CAAA,EACA,IAAAT,EACA,QACA,KAAAsgN,4BAAA,KAAAzjN,IAEA,cACA,KAAArC,IAAA,CAAA0zN,GACA,KAAArrN,GAAA,oCACA,KAAAk4B,IAAA,skBACA,KAAAwzL,WAAA,IAMA,KAAAC,qBAAA,GACA,KAAAC,WAAA,CAAAR,KAAAje,EAAA0e,QAAA,CAAA1e,EAAA2e,WAAA,CACA,KAAAC,yBAAA,CAAAnuN,EAAAouN,wBAAA,CACA,KAAAC,gBAAA,CAAAruN,EAAAsuN,eAAA,CACA,KAAAC,YAAA,CAAAvuN,EAAAwuN,WAAA,CACA,KAAAC,MAAA,QAAAlvN,CAAAA,EAAAS,EAAA2jN,KAAA,GAAApkN,KAAA,IAAAA,EAAAA,EAAAS,EAAA8mF,OAAA,CACA,KAAA4nI,iBAAA,CAAiC1uN,EAAA2uN,gBAAA,CACjC,KAAAX,WAAA,GAAAze,EAAA2e,WAAA,EACA,KAAAC,yBAAA,CAAAt0M,GAAA,GAAAE,IAAA,KACAmqM,GAIA,KAAA0K,wBAAA,EAEA,EAEA,CACA,IAAAj2N,WAAA,CACA,cAAAmkI,UAAA,aAAA+xF,gBAAA,CACA,IACA,KAAA/xF,UAAA,CAAA4wF,GAAA,KAAAmB,gBAAA,CACA,CACA,MAAA1wN,EAAA,CACA,UAAAqgN,GAAA,aAAAh6M,OAAArG,CAAAA,MAAAA,EAAA,OAAAA,EAAAhF,OAAA,mBAAAgF,EAAA,CAEA,OACA,KAAA2+H,UAAA,MAAAA,UAAA,MAEA,IAAAiiF,WAAA,CACA,aAAA+P,oBAAA,CAEA,IAAAC,YAAA,CACA,YAAAjB,WAAA,CAEA,IAAAvwM,YAAA,CACA,YAAAywM,WAAA,CAEAY,0BAAA,CACA,KAAAZ,WAAA,GAAAze,EAAAyf,SAAA,EACA,KAAA33J,IAAA,yBAAA22J,WAAA,CAAAze,EAAAyf,SAAA,CAEA,CACAC,aAAe50M,CAAA,EACf,OAAAizM,GAAA,+BACA,IACA,aAAAjzM,GACA,CACA,MAAAlc,EAAA,CAEA,MADA,KAAAk5D,IAAA,SAAAl5D,GACAA,CAAA,CAEA,EACA,CAEA+wN,6CAAwB,CACxB,OAAA5B,GAAA,+BACS,kBAAAtO,WAAA,EACT,EACA,CACAA,aAAe,CACf,OAAAsO,GAAA,+BACA,SAAAyB,UAAA,QAAAhQ,SAAA,CAGA,kBAAAkQ,YAAyC,KAAA3B,GAAA,IAA0B,0BAAyB,CAC5F,QAAAU,WAA8B,GAAAze,EAAmByf,SAAA,OAAAhB,WAAA,GAAAze,EAAA0e,QAAA,CACjD,UAAAhQ,EAAA,CAEA,KAAA6P,WAAA,IACA,IACA,IAAAqB,EAAA,WAAAhB,yBAAA,CAAAt0M,GAAA,GACAs1M,GAEA,KAAAC,yBAAA,CAAAD,EAEA,CACA,MAAAhxN,EAAA,CACA,UAAAigN,GAAA,aAAA55M,OAAArG,EAAAhF,OAAA,kBAAAgF,EAAA,QAEA,CACA,KAAA2vN,WAAA,GACa,CACJ,GAnBT,EAqBA,CACA1/F,SAAA,CACA,OAAAk/F,GAAA,+BACA,SAAAyB,UAAA,QAAAhQ,SAAA,CAGA,kBAAAkQ,YAAyC,KAAA3B,GAAA,IAA0B,0BAAyB,CAC5F,QAAAU,WAA8B,GAAAze,EAAmByf,SAAA,OAAAhB,WAAA,GAAAze,EAAA0e,QAAA,CACjD,UAAAhQ,EAAA,CAEA,KAAA6P,WAAA,IACA,IACA,WAAAuB,oBAAA,EACA,CACA,MAAAlxN,EAAA,CACA,UAAAigN,GAAA,aAAA55M,OAAArG,EAAAhF,OAAA,kBAAAgF,EAAA,QAEA,CACA,KAAA2vN,WAAA,GACa,CACJ,GAfT,EAiBA,CACAuB,qBAAepL,CAAS,EACxB,OAAAqJ,GAAA,+BACA,IACA,IAAA6B,EAAA,WAAAhB,yBAAA,CAAAt0M,GAAA,GACA,GAAAs1M,EAGA,OADA,KAAAC,yBAAA,CAAAD,GACAA,CACA,CACA,kBAAA/E,QAAA,IAAAkD,GAAA,+BACA,IAAApJ,EAAA,MAAAniN,EAAAutJ,SAAA,EACAq0D,MAAA,KAAA8K,MAAA,CACA5K,SAAA,KAAA0K,YAAA,CACqBnL,gBAAAa,CACrB,GAMiB,OAJjBjsM,QAAAqkC,GAAA,EACA,KAAA8xK,yBAAA,CAAAhyN,GAAA,CAAA+nN,GACA,KAAAkL,yBAAA,CAAAlL,GACA,EACiBA,CACjB,GACA,CACA,MAAA/lN,EAAA,CACA,UAAAigN,GAAA,aAAA55M,OAAArG,EAAAhF,OAAA,kBAAAgF,EAAA,CAEA,EACA,CACAixN,0BAAAlL,CAAA,EACA,IAAA3kN,EACA,OAAA+tN,GAAA,+BACA,IAAAgC,EAEA,WAAAR,oBAAA,EAEA,QAAAvvN,CAAAA,EAAA,KAAAuvN,oBAAA,GAAAvvN,KAAA,IAAAA,EAAA,OAAAA,EAAAP,QAAA,CAAAhH,MAAA,IAAAksN,EAAAllN,QAAA,CAAAhH,MAAA,EAEA,KAAA82N,oBAAA,CAAA9vN,QAAA,CAAA6lE,IAAA,EAAA5lE,EAAAgqJ,IAAAhqJ,EAAAo3C,OAAA,GAAA6tK,EAAAllN,QAAA,CAAAiqJ,EAAA,CAAA5yG,OAAA,EAGA,GAFA,KAAAy4K,oBAAA,CAAA5K,EACA,KAAA0K,wBAAA,GACAU,EAAA,CACA,IAAAC,EAAA,WAAAlB,gBAAA,CAAAmB,MAAA,CAAAtL,EAAAllN,QAAA,CAAA/G,GAAA,GAAAo+C,QAAAA,CAAA,IAAAA,IACAk5K,IAAA,KAAAV,gBAAA,GACA,KAAAA,gBAAA,CAAAU,EACA,YAAAzyF,UAAA,CACA,KAAAzlE,IAAA,WAGA,KAAA1+D,SAAA,EAES,GAET,CACA82N,uBAAe1tN,CAAS,CAAA2tN,CAAA,EACxB,OAAApC,GAAA,+BACA,IACA,IAAApJ,EAAA,MAAAniN,EAAAutJ,SAAA,EACAs0D,WAAA8L,EACiB7L,SAAA,KAAA0K,YAAA,GAGjBv2M,QAAAqkC,GAAA,EACA,KAAA8xK,yBAAA,CAAAhyN,GAAA,CAAA+nN,GACA,KAAAkL,yBAAA,CAAAlL,GACA,CACA,CACA,MAAA/lN,EAAA,CAEA,MADA,KAAAwxN,UAA0B,GAC1B,IAAAtR,GAAA,aAAA75M,OAAArG,CAAAA,MAAAA,EAAA,OAAAA,EAAAhF,OAAA,mBAAAgF,EAAA,CAEA,EACA,CACAwxN,YAAe,CACf,OAAArC,GAAA,mBAAoD,YACpD,KAAAa,yBAAA,CAAAtb,KAAA,GACA,KAAAib,WAAA,IACA,KAAAC,qBAAA,GACA,YAAAe,oBAAA,CACA,YAAAhyF,UAAA,CACA,YAAA+xF,gBAAA,CACS,KAAAx3J,IAAA,cACT,EACA,CACA+yJ,SAAA/vM,CAAA,EACA,IAAA9a,EACA,OAAA+tN,GAAA,+BACA,IAAApD,EAAA,IAAsE,GAAtE3qN,CAAAA,EAAA,KAA6CuvN,oBAAA,GAAyBvvN,KAAA,IAAAA,EAAA,OAAAA,EAAAssN,eAAA,CACtE7rN,EAAAkqN,EAAA,CAAAM,QAAAN,CAAA,EAAArvN,KAAAA,CAAA,CACA+0N,EAAA,KAAA7B,qBAAA,CACA,IACA,aAAAzB,GAAAjyM,EAAAra,EACA,CACA,MAAA7B,EAAA,CASA,MARA,KAAA4vN,qBAAA,GAAkD6B,GAClD,WAAA53M,QAAA,SAEA7Z,aAAAqG,OACArG,mCAAAA,EAAApE,IAAA,EACAoE,2BAAAA,EAAAkD,IAAA,EACA,YAAAqtN,iBAAA,QAEAvwN,CAAA,CAEA,EACA,CACA0xN,oBAAA,CACA,SAAAf,oBAAsB,OAAuB,CAAAD,gBAAA,CAC7C,UAAApQ,EAAA,CACA,OACAiR,UAAA,KAAAZ,oBAAA,CAAAlL,UAAA,CACAkM,gBAAA,KAAAjB,gBAAA,CAEA,CACAkB,wBAAe9rK,CAAS,EACxB,OAAAqpK,GAAoB,IAAY,2BAChC,IAAAoC,UAAAA,CAAA,OAAAG,kBAAA,GACA,IACA,kBAAAzF,QAAA,IAAAkD,GAAA,+BACA,WAAAmC,sBAAA,CAAA1tN,EAAA2tN,GACA,IAAA5P,EAAA,MAAA/9M,EAAAoiD,gBAAA,EACqBF,aAAAA,CACrB,GACiB,OAAA67J,CACjB,GACA,CACA,MAAA9iN,EAA0B,CAC1B,UAAA2hN,GAAA3hN,MAAAA,EAAA,OAAAA,EAAA7D,OAAA,CAAA6D,EAAA,CAEA,EACA,CACAunD,gBAAenlD,CAAS,CAAAV,CAAA,CAAAtD,CAAA,EACxB,OAAAkyN,GAAA,iBAAiD,aAAS,CAC1D,aAAwB,KAAA2B,YAAY,KAAA3B,GAAA,+BACpC,IAAAoC,UAAAA,CAAA,OAAAG,kBAAA,GACA5qF,EAAA7pI,MAAAA,EAAA,OAAAA,EAAA6pI,cAAA,CACA,IACA,kBAAAmlF,QAAA,IAAAkD,GAAA,+BACA,SAAA0C,GAAA,KACAC,EAUAC,EATA,OAAAxxN,EAAAG,UAAA,EACA,gBACA,gBACA,gBACAoxN,EAAAvxN,EAAAG,UAAA,CACA,cAEAoxN,EAAA,WACA,CAEA,OAAA70N,MAAAA,EAAA,OAAAA,EAAA8G,mBAAA,EACA,gBACA,gBACA,gBACAguN,EAAA90N,EAAA8G,mBAAA,CACA,WACArH,KAAAA,EACAq1N,EAAAD,EACA,cAEAC,EAAA,WACA,CACA,IAAAC,EAAAD,cAAAA,EACA,EACAA,cAAAA,EACA,EACA,EACAE,EAAAH,cAAAA,EAAA,EAAAA,cAAAA,EAAA,IACA,OAAAE,EAAAC,EACAF,EACAD,CAAA,CAEA,IAAAnM,EAAAuM,EAAAC,EAAA,OAAAt4M,QAAAqkC,GAAA,EACAt6C,EAAAwuN,eAAA,GAC4B,KAAAd,sBAAsB,CAAA1tN,EAAA2tN,GAClD9B,GAAAxuN,GACA,KAMAkuN,GAAA,+BACA,IAAA/tN,EAEA,GADAH,EAAAsD,QAAA,EAAAtD,CAAAA,EAAAsD,QAAA,QAAAnD,CAAAA,EAAA,KAAA5G,SAAA,GAAA4G,KAAA,IAAAA,EAAAA,EAAA1E,KAAAA,CAAA,EACAuE,IAAgE,EAAhEA,EAAoDuD,eAAY,EAChE,IAAAE,UAAAA,CAAA,QAAAnE,EAAAkE,kBAAA,EAC6C/D,WAAAmxN,GAC7C,EACA5wN,CAAAA,EAAAuD,eAAA,CAAAE,CACqC,GACrC,CACA,EACA,GAAAihN,EAAAE,mCAAA,EACA,IAAA3gN,EAAA,MAAAtB,EAAAgrN,uBAAA,EACA9nF,eAAAA,EAC6BhhF,aAAA,CAAA7kD,EAAA,GAE7B,OAAAiE,CAAA,IAaqB,CAVrB,IAAAmtN,EAAA,OAAAzuN,EAAAoiD,gBAAA,EAC6BF,aAAA,CAAA7kD,EAAA,GAE7B,GAAAwuN,GAAA4C,GACA,aAAA9xN,EAAA6lD,eAAA,CAAAisK,EAKA,EAFA,IAAA9oF,EAAA8oF,EAAA7wN,SAAA,GACA,aAAAjB,EAAAmG,kBAAA,CAAA6iI,EAAA7tI,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAsB,GAAA,CAAA8G,oBAAA8tN,GAAA,GACA,CACqB,CACrB,GACA,CACA,MAAAhzN,EAA8B,CAC9B,UAAA0hN,GAAA1hN,MAAAA,EAAA,OAAAA,EAAA7D,OAAA,CAAA6D,EAAA,CAES,GACT,EACA,CACAgG,gBAAe5D,CAAS,EACxB,OAAAkuN,GAAA,iBAAiD,aAAS,CAC1D,kBAAA2B,YAAA,KAAA3B,GAAA,+BACA,IAAAkD,EAAA,YAAAT,uBAAA,EAAA3wN,EAAA,EACa,OAAAoxN,CACJ,GACT,EACA,CACApsN,oBAAe6/C,CAAS,EACxB,OAAAqpK,GAAA,iBAAiD,aAAS,CAC1D,kBAAA2B,YAAA,KAAA3B,GAAA,+BACA,IAAAxN,EAAA,WAAAiQ,uBAAA,CAAA9rK,GACa,OAAA67J,CACJ,GACT,EACA,CACA2Q,YAAet3N,CAAA,EACf,OAAAm0N,GAAA,iBAAiD,aAAS,CAC1D,aAAwB,KAAA2B,YAAA,KAAA3B,GAA6B,+BACrD,IAAAoC,UAAAA,CAAA,CAAAI,gBAAAA,CAAA,OAAAD,kBAAA,GACA,IACA,kBAAAzF,QAAA,IAAAkD,GAAA,+BACA,WAAAmC,sBAAA,CAAA1tN,EAAA2tN,GACA,IAAAgB,EAAA,OAAA3uN,EAAAmrN,YAAA,EACAhtN,UAAA,CAAA4vN,EAAA,CACyBxL,SAAA,CAAAnrN,EAAA,GAEzBoK,EAAAmtN,EAAAt4N,KAAA,EAAA22G,IACqB,OAAAxrG,CACrB,GACA,CACA,MAAAvG,EAA8B,CAC9B,UAAA4hN,GAAA5hN,MAAAA,EAAA,OAAAA,EAAA7D,OAAA,CAAA6D,EAAA,CAES,GACT,EACA,CACA2zN,OAAAj2N,CAAe,EACf,OAAA4yN,GAAA,iBAAiD,aAAS,CAC1D,kBAAA2B,YAAA,KAAA3B,GAAA,+BACA,IAAA/tN,EAAAgD,EACA,QAAAyrN,WAA8B,GAAAze,EAAmByf,SAAA,OAAAhB,WAAA,GAAAze,EAAA0e,QAAA,CACjD,UAAAhQ,EAAA,CAEA,KAAA6P,WAAA,IACA,IACA,IAAA5J,EAAA,WAAAmL,oBAAA,CAAAx1N,OAAAC,MAAA,CAAAD,OAAAC,MAAA,IAAAY,GAAA,CAAAimH,OAAA,OAAAphH,CAAAA,EAAA7E,MAAAA,EAAA,OAAAA,EAAAimH,MAAA,GAAAphH,KAAA,IAAAA,EAAAA,EAAA4F,OAAAgX,QAAA,CAAAgoM,IAAA,IACA,IAAAD,EAAAb,cAAA,CACA,oEAEA,IAAAuN,EAAA1M,EAAAb,cAA0E,CAAAhtK,OAAA,CAC1Ew6K,EAAAh3N,OAAAC,MAAA,CAAAD,OAAAC,MAAA,WAAAyI,CAAAA,EAAA2hN,EAAAllN,QAAA,CAAAd,IAAA,CAAAkU,GAAAA,EAAAikC,OAAA,EAAAu6K,EAAA,GAAAruN,KAAA,IAAAA,EAAAA,EAAA,CACqB8zC,QAAKu6K,CAC1B,IAAAj4N,UAAA40N,GAAAqD,EAAA,GACA,OACA3xN,QAAA4xN,EACAH,cAAmCnD,GAAYrJ,EAAAb,cAAA,CAAAmB,cAAA,EAC/CjhN,UAAAgqN,GAAArJ,EAAAb,cAAA,CAAA9/M,SAAA,CACA,CACA,CACA,MAAApF,EAAA,CACA,UAAAigN,GAAA,aAAA55M,OAAArG,EAAAhF,OAAA,kBAAAgF,EAAA,QAEA,CACA,KAAA2vN,WAAA,GACa,CACJ,GACT,EACA,EAGA,SAAAgD,IAAA,CACA,OACAtB,OAAAtvN,CAAmB,EACnB,OAAAotN,GAAA,+BACa,OAAAptN,CAAA,KAEb,CACA,EAGA,IAAA6wN,GAAA,qDACA,SAAAC,IAAA,CACA,IAAAC,EACA,IACAA,EAAA9rN,OAAAy0M,YAAA,CAGA,MAAAr6M,EAAA,EACA,OACAszM,OAAA,CACA,OAAAya,GAAA,+BACA,GAAA2D,EAGA,IACAA,EAAAC,UAAA,CAAAH,GAEA,CACa,MAAAxxN,EAAA,EALb,EAOA,EACAsa,KAAA,CACA,OAAAyzM,GAAA,+BACA,GAAA2D,EAGA,IACA,OAAA12N,KAAA2f,KAAA,CAAA+2M,EAAApX,OAAA,CAAAkX,MAAAl2N,KAAAA,CAEA,CACa,MAAA0E,EAAA,EALb,EAOA,EACApD,IAAA+nN,CAAmB,EACnB,OAAAoJ,GAAA,+BACA,GAAA2D,EAGA,IACAA,EAAA/W,OAAA,CAAA6W,GAAAx2N,KAAAC,SAAA,CAAA0pN,GAEA,CACa,MAAA3kN,EAAA,EALb,EAOA,CACA,EAGA,SAAA4xN,GAAoBC,CAAA,EACpB,OAAA9D,GAAA,+BACA,oBAAAnoN,QACAA,OAAAgX,QAAA,CAAAriB,MAAA,CAAAs3N,EAAAhvN,GAAA,CAEA,EACA,CACA,SAAAivN,IAAA,CACA,OAAAF,EAAA,CAEmL,IAAAG,GAAA76N,EAAA,MAAAuM,GAAAvM,EAAA,MCrhBnL,IAAA86N,GAAA,mBCAAC,GAAA,kBCCA,SAAAC,GAA2B1vN,CAAA,EAC3B,OAAQwvN,MAAcxvN,EAAAg0D,QAAA,EACtBy7J,MAASzvN,EAAAg0D,QAAA,EACTu7J,CAAAA,GAAA/nK,CAAA,IAAAxnD,EAAAg0D,QAAA,EAAA/yD,GAAAimD,CAAA,IAAAlnD,EAAAg0D,QAAA,CACA,CCAA,IAAA27J,GAAAD,GAAA,IAAAhB,GAAAh6N,EAAA,MCLA,IAAAk7N,GAAA,gBCAAC,GAAA,iBAEAC,GAAA,gBAEAC,GAAA,iBAEAC,GAAA,kBCLAC,GAAA,sCAUA,SAAAC,GAAAvtI,CAAA,SACA,EAAel5B,QAAA,CAAAwmK,IACfJ,GACA,cAAez6M,IAAA,CAAAutE,GACfmtI,GACA,eAAe16M,IAAA,CAAAutE,GACfotI,GACA,iBAAe36M,IAAA,CAAAutE,IAAqB,mBAAAvtE,IAAA,CAAAutE,GACzBqtI,GACXH,EAPA,CCXA,SAAAM,GAAArzN,CAAA,EACA,OAAAA,GACA,gBACA,gBACA,gBACA,KAAAhE,KAAAA,EACA,OAAAgE,CACA,cACA,iBACA,cACA,mBACA,iBACA,WACA,WACA,iBACA,SACA,MACA,CACA,CCpBA,IAAAszN,GAAA,sBCkFA,SAAAC,GAAAx7N,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,IAAAkZ,EACA,SACA,IAAA9X,EAAApB,EAAAoB,MAAA,CACA,GAAAA,IAAA8X,EAAA9X,MAAA,CACA,QAAoB,CACpB,QAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,IACA,GAAAxG,CAAA,CAAAwG,EAAA,GAAA0S,CAAA,CAAA1S,EAAA,CACA,SAEA,QACA,CAtBAqyM,EAAA,IAAA3jL,QAAA4jL,EAAA,IAAA5jL,QAAA6jL,EAAA,IAAA7jL,QAAA8jL,EAAA,IAAA9jL,QAAA+jL,EAAA,IAAA/jL,QAAAgkL,EAAA,IAAAhkL,OAAA,CCxEA,IAAAumM,GAAA,SAAA79B,CAAA,CAAAzyI,CAAA,CAAAvoD,CAAA,CAAAizD,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,4FACA,YAAA/nI,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,EAAAh7L,GAAAwqC,EAAAA,EAAAxqC,KAAA,CAAAA,EAAAuoD,EAAA5lD,GAAA,CAAAq4L,EAAAh7L,EAAA,CAAAA,CAAA,EAEA84N,GAAA,SAAA99B,CAAA,CAAAzyI,CAAA,CAAA0K,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,6FACA,MAAA/nI,MAAAA,EAAAzoB,EAAAyoB,MAAAA,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,GAAAxwJ,EAAAA,EAAAxqC,KAAA,CAAAuoD,EAAAloC,GAAA,CAAA26K,EAAA,CAWA,OAAA+9B,WAA0BzT,GAC1B/lN,YAAA,CAAAgJ,OAAAA,CAAA,GACA,QACAguM,EAAA1zM,GAAA,OACA2zM,EAAA7zM,GAAA,cACA8zM,EAAA9zM,GAAA,cACA+zM,EAAA/zM,GAAA,cACAg0M,EAAAh0M,GAAA,cACAi0M,EAAAj0M,GAAA,cACAk0M,EAAAl0M,GAAA,cACAm0M,EAAAn0M,GAAA,cACAo0M,EAA0Cp0M,GAAA,0BAAAgJ,QAAA,oBAAAwf,SAC5B4qL,EAAA2e,WAA0B,CACxC3e,EAAAyf,SAAA,EACApe,EAAAz0M,GAAA,UAEA,gBAAA2tC,EAAgC,CAChC,IAAA7qC,EAAAqzN,GAAA,KAAAhiB,EAAA,KAAAtxM,QAAA,IAEAszN,GAAA,KAAAtiB,EAAA,OAAAsiB,GAAA,KAAAniB,EAAA,MAAAlxM,IAAAqzN,GAAA,KAAAtiB,EAAA,OAEA/wM,EAEAqzN,GAAA,KAAAviB,EAAA,IAAAU,GAAAhrM,IAAA,MAAAxG,IAIA,KAAAo4D,IAAA,aAAAgnJ,IAEAiU,GAAA,KAAAviB,EAAA,IAAAW,GAAAjrM,IAAA,QAGA,cAEgBqkC,GAChBwoL,GAAA,KAAAviB,EAAA,IAAAY,GAAAlrM,IAAA,MAEQ,GACA4sN,GAAsB,KAAA/hB,EAAAvuM,EAAA,KACtBswN,GAAsB,KAAAriB,EAAA,UACtBqiB,GAAsB,KAAApiB,EAAA,UACtBoiB,GAAsB,KAAAniB,EAAA,QACtBmiB,GAAsB,KAAAliB,EAAmC,QACzDkiB,GAAsB,KAAAjiB,EAAAkiB,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAAy7J,GAAA,CAAA58J,EAAA,UAAA09J,GAAA,KAAA1hB,EAAA,WAC9B0hB,GAAA,KAAAviB,EAAA,IAAAY,GAAAlrM,IAAA,MACA,CACA,IAAA1L,MAAe,CACf,OAAAu4N,GAAA,KAAAhiB,EAAA,KAAAv2M,IAAA,CAEA,IAAAqI,KAAA,CACA,sDACA,CACA,IAAAk4B,MAAe,CACf,OAAAg4L,GAAA,KAAAhiB,EAAA,KAAAh2K,IAAA,CAEA,IAAA/c,YAAe,CACf,OAAA+0M,GAAA,KAAA/hB,EAAA,IACA,CACA,IAAA53M,WAAe,CACf,OAAA25N,GAAA,KAAAriB,EAAA,IACA,CACA,IAAA8e,YAAe,CACf,OAAAuD,GAAA,KAAApiB,EAAA,IACA,CACA,IAAA2P,8BAAe,CACf,OAAAyS,GAAA,KAAAjiB,EAAA,IACA,CACA,IAAAtuM,QAAe,CACf,OAAAuwN,GAAA,KAAAhiB,EAAA,IACA,CACA,IAAA1wK,UAAA,CACA,QACA,CACA43E,SAAQ,CACA66G,GAAsB,KAAAriB,EAAA,UACtBqiB,GAAsB,KAAApiB,EAAA,UACtBoiB,GAAsB,KAAAniB,EAAA,QAC9BmiB,GAAoB,KAAAliB,EAAsB,QAC1C,IAAA17B,EAAA69C,GAAA,KAAAliB,EAAA,KACY37B,IACZ49C,GAAA,KAAAjiB,EAAA,UACA37B,IAEA,CACA,MAAAuqC,aAAe,CACf,OAAAsT,GAAA,KAAAviB,EAAA,IAAAS,GAAA/qM,IAAA,OAAA+sN,OAAA,IACA,CACA,MAAApkG,SAAe,CACf,OAAAkkG,GAAA,KAAAviB,EAAA,IAAAS,GAAA/qM,IAAA,MACA,CACA,MAAAkqN,YAAY,CACZ,GAAAwC,MAAAG,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CACA,GAAgB,CAChBs8J,GAAsB,KAAsBliB,EAAA,QAC5C,MAAAmiB,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAAo8J,GAAA,CAAAxC,UAAA,EACA,CACA,MAAA3yN,EAAA,CACA,KAAAq6D,IAAA,aAAAinJ,GAAAthN,GAAA7D,QAAA6D,GACA,QACgB,CAChBq1N,GAAA,KAAAliB,EAAA,OACA,CACQ,GACR,KAAAJ,EAAA,IAAAW,GAAAjrM,IAAA,MACA,CACA,MAAA8+C,gBAAAnlD,CAAA,CAAAV,CAAA,CAAAtD,EAAA,IACA,QAIgBq3N,EAHhB,IAAAxzN,EAAAqzN,GAAA,KAAAtiB,EAAA,KACA,IAAA/wM,EACA,UAAAw/M,EAAA,CAEA,GAAA6S,GAA8C/nK,CAAA,IAAA+oK,GAA4B,KAAAhiB,EAAA,KAAAv6I,QAAA,EAC1E,GAAA92D,EAAA82D,QAA8B,CAAAvK,QAAA,CAAA8lK,GAA4B/nK,CAAA,EAC1DkpK,EAAAnB,GAAA/nK,CAAA,MAEA,GAAAvmD,GAA8CimD,CAAA,IAAAqpK,GAAqB,KAAAhiB,EAAA,KAAAv6I,QAAA,EACnE92D,EAAA82D,QAA8B,CAAAvK,QAAA,CAAAxoD,GAAqBimD,CAAA,EACnDwpK,EAAAzvN,GAAAimD,CAAA,MAGA,UAAAs1J,EAAA,MAGA,GAAAv7M,GAA+CimD,CAAA,IAAAqpK,GAAqB,KAAAhiB,EAAA,KAAAv6I,QAAA,EACpE,IAAA92D,EAAA82D,QAA8B,CAAAvK,QAAA,CAAAxoD,GAAkBimD,CAAA,EAChD,MAA0B,IAAAs1J,EAAA,CAC1BkU,EAAAzvN,GAAAimD,CAAA,MAGA,UAAAk1J,EAAA,CAEA,IAAAwF,EAAAsO,GAAAvzN,EAAA8/I,WAAA,EACA,IAAAv/I,EAAAyzN,MAA0B,CAAAlnK,QAAA,CAAAm4J,GAC1B,UAAAjF,EAAA,CACA,QAEoBh3E,EADpB,IAAAroI,QAAAA,CAAA,IAAAsF,EAAA,CAAAvJ,EAcA,GAZA/C,GAAA+G,IACAC,GAAArH,QAAAoH,EAAAI,IAAA,CAAAH,GACAqoI,EAAAtoI,EAAAO,SAAA,KAGAP,EAAA,WAAA6/M,kBAAA,CAAA7/M,EAAAV,EAAAiG,GACAtF,GAAArH,QAAAoH,EAAA2D,WAAA,IAAA1D,GACAqoI,EAAA,IAAApkI,WAAAlE,EAAAO,SAAA,EACA0jD,qBAAA,GACqB8pC,iBAAA,EACrB,KAEAslI,IAAAnB,GAAiE/nK,CAAA,EACjE,IAAAt/B,EAAA,OAAAqoM,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAAu7J,GAAA/nK,CAAA,EAAA+nK,sBAAA,EACAryN,QAAAA,EACA0kN,MAAAA,EACAvkN,YAAAsoI,EACAtsI,QAAA,CACA8G,oBAAAgwN,GAAAvtN,EAAAzC,mBAAA,EAAAxD,EAAAG,UAAA,EACA+F,cAAAD,EAAAC,aAAA,CACA+kI,WAAAhlI,EAAAglI,UAAA,CACyB1E,eAAAtgI,EAAAsgI,cAAA,CAEzB,GAEA,OAAAz8E,GAAA/vD,MAAA,CAAAwxB,EAAA1mB,SAAA,CACA,CAgBA,CAdA,IAAA0mB,EAAA,OAAAqoM,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA/yD,GAAAimD,CAAA,EAAAjmD,eAAA,EACA/D,QAAAA,EACA0kN,MAAAA,EACAvkN,YAAAsoI,EACAtsI,QAAA,CACA8G,oBAAAgwN,GAAAvtN,EAAAzC,mBAAA,EAAAxD,EAAAG,UAAA,EACyBomI,eAAAtgI,EAAAsgI,cAAA,CAEzB,GAEA,aAAAvmI,EAAAmG,kBAAA,CAAAolB,EAAAumM,iBAAA,EACA,GAAA7rN,CAAA,CACqBzC,oBAAAgwN,GAAAvtN,EAAAzC,mBAAA,EAAAxD,EAAAG,UAAA,CACrB,EACA,CACA,CACA,MAAA7B,EAAA,CACA,GAAAA,aAAAghN,GACA,MAA0BhhN,CAAA,OAC1B,IAAA0hN,GAAA1hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,CACAgzM,EAAA,IAAAlkL,QAAAmkL,EAAA,IAAAnkL,QAAAokL,EAAA,IAAApkL,QAAAqkL,EAAA,IAAArkL,QAAAskL,EAAA,IAAAtkL,QAAAukL,EAAA,IAAAvkL,QAAAwkL,EAAA,IAAAxkL,QAAAykL,EAAA,IAAAzkL,QAAA8kL,EAAA,IAAA9kL,QAAAikL,EAAA,IAAAtY,QAAA+Y,EAAA,eAAA91M,CAAA,EACA,IACA,QAAAqkN,SAAA,OAAAgQ,UAAA,CACY,OACZ,GAAAuD,GAAyC,KAAA/hB,EAAA,OAAAhB,EAAAyf,SAAA,CACjC,UAAA/Q,EAAsB,CAE9B,GADAoU,GAAa,IAAsB,CAAAniB,EAAA,QACnC,CAAAoiB,GAAA,KAAAhiB,EAAA,KAAAtxM,QAAA,CAAAhH,MAAA,CACA,IACA,MAAAs6N,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAAw7J,GAAA,CAAAnjG,OAAA,CAAA1zH,EACA,CACA,MAAAsC,EAA0B,CAC1B,UAAAohN,GAAAphN,GAAA7D,QAAA6D,EAAA,CAEA,IACAiC,EAAAqzN,GAAA,KAAAhiB,EAAA,KAAAtxM,QAAA,IACA,IAAAC,EACQ,UAAAs/M,EAAsB,CAC9B+T,GAAA,KAAAviB,EAAA,IAAAU,GAAAhrM,IAAA,MAAAxG,EACA,CACA,MAAAjC,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,QAEQ,CACRq1N,GAAA,KAAAniB,EAAA,OACC,CACD,EAAAO,EAAA,SAAAxxM,CAAA,EACA,IAAAtG,EACA,IAEAA,EAAA,IAAA0/F,GAAAziF,SAAA,CAAA3W,EAAAo3C,OAAA,CACA,CACA,MAAAr5C,EAAkB,CAClB,UAAAwhN,GAAAxhN,GAAA7D,QAAA6D,EAAA,CAEIq1N,GAAsB,KAAAriB,EAAA/wM,EAAA,KACtBozN,GAAsB,KAAApiB,EAAAt3M,EAAA,KAC1B25N,GAAA,KAAAviB,EAAA,IAAAY,GAAAlrM,IAAA,OACC,KAAA4xD,IAAA,WAAA1+D,EACD,EAAA+3M,EAA0B,WACtB2hB,GAAsB,KAAAriB,EAAA,UACtBqiB,GAAsB,KAAApiB,EAAA,UAC1BqiB,GAAA,KAAAviB,EAAA,IAAAY,GAAAlrM,IAAA,OACC,KAAA4xD,IAAA,cACD,EAAAs5I,EAAA,UAAyC,CACzC,IAAUkP,EAAsByR,GAAoD/nK,CAAA,IAAA+oK,GAAA,KAAAhiB,EAA4B,KAAAv6I,QAAA,CACtGu8J,GAAsB,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAoDu7J,GAAqB/nK,CAAA,EAAAs2J,4BAAA,CACrGyS,GAAsB,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA/yD,GAAuEimD,CAAA,EAAA42J,4BAAA,CACjGwS,GAAA,KAAAhiB,EAAA+hB,GAAAvS,EAAA,YACA,KACQ,IAAAzjN,IAAAyjN,EAAA,MACR78M,GAA+BimD,CAAA,IAAAqpK,GAAsB,KAAAhiB,EAAA,KAAAv6I,QAAA,EAAAu8J,GAAA,KAAAtiB,EAAA,MAAAj6I,SAAAvK,QAAA,CAAAxoD,GAAAimD,CAAA,GACrD,KAAAjmD,eAAA,CAAAsvN,GAAmC,IAAsB,CAAAviB,EAAA,IAAAc,GACzD,KAAAzsM,mBAAA,CAAAkuN,GAAA,KAAAviB,EAAA,IAAAe,KAGA,YAAA9tM,eAAA,CACA,YAAAoB,mBAAA,EAEAqsN,GAA2BrrN,CAAA,IAAAktN,GAAsB,KAAAhiB,EAAA,KAAAv6I,QAAA,EAAAu8J,GAAA,KAAAtiB,EAAA,MAAAj6I,SAAAvK,QAAA,CAAAilK,GAAArrN,CAAA,EACjD,KAAAqrN,WAAA,CAAA6B,GAAA,KAAAviB,EAAA,IAAAgB,GAGA,YAAA0f,WAAA,CAEAkB,MAAsBW,GAAsB,KAAAhiB,EAAA,KAAAv6I,QAAA,CAC5C,KAAA46J,MAAA,CAAA2B,GAAA,KAAAviB,EAAA,IAAAiB,GAGA,YAAA2f,MAAA,EAEA9f,EAAA,eAAAzxM,CAAA,EACA,IACA,IAAAH,EAAAqzN,GAAA,KAAAtiB,EAAA,KACA,IAAA/wM,EACA,MAAc,IAAAw/M,EAAA,CACd,IAAAz7M,CAAAA,GAAuCimD,CAAA,IAAAqpK,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,EACvC,UAAAooJ,EAAuC,CACvC,IAAAl/M,EAAA82D,QAAsB,CAAAvK,QAAA,CAAAxoD,GAAkBimD,CAAA,EACxC,UAAAs1J,EAAA,CACA,IACA,IAAAuB,EAAA,MAAAwS,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA/yD,GAAAimD,CAAA,EAAAjmD,eAAA,EACA/D,QAAAA,EACAG,YAAA/G,GAAA+G,GACAA,EAAAO,SAAA,GACA,IAAA2D,WAAAlE,EAAAO,SAAA,EACA0jD,qBAAA,GACqB8pC,iBAAA,EACR,MAGbu6C,EAA0Co4E,CAAA,IAAA0Q,iBAAA,CAC1C,OAAkBn4N,GAAA+G,GACAi5F,GAAAwY,oBAAgB,CAAAqrB,WAAA,CAAAwL,GAClCrvC,GAAA/0C,WAAA,CAAAnuC,IAAA,CAAAuyH,EAAA,CAEA,MAAA1qI,EAAA,CACA,GAAAA,aAAAghN,GACA,MAAsBhhN,CAAA,OACtB,IAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,EAAA8zM,EAAA,eAAA7sJ,CAAA,EACA,IACA,IAAAhlD,EAAAqzN,GAAA,KAAAtiB,EAAA,KACA,IAAA/wM,EACA,MAAc,IAAAw/M,EAAA,CACd,IAAAz7M,CAAAA,GAAuCimD,CAAA,IAAAqpK,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,EACvC,UAAAooJ,EAAuC,CACvC,IAAAl/M,EAAA82D,QAAsB,CAAAvK,QAAA,CAAAxoD,GAAkBimD,CAAA,EACxC,UAAAs1J,EAAA,CACA,IACA,IAAAuB,EAAA,MAAAwS,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA/yD,GAAAimD,CAAA,EAAAjmD,eAAA,IAAAihD,EAAAhsD,GAAA,MACAgH,QAAAA,EACAG,YAAA/G,GAAA+G,GACAA,EAAAO,SAAA,GACA,IAAA2D,WAAAlE,EAAAO,SAAA,EACA0jD,qBAAA,GACqB8pC,iBAAA,EACR,IACb,IACA,OAAAlpC,EAAAhsD,GAAA,EAAAmH,EAAAjH,IAAA,CAEA,IAAAq4N,EAAwB1Q,CAAsB,CAAA3nN,EAAA,CAAAq4N,iBAAA,CAC9C,OAAsBn4N,GAAA+G,GACAi5F,GAAAwY,oBAAgB,CAAAqrB,WAAA,CAAAs0F,GACzBn4H,GAAA/0C,WAAA,CAAAnuC,IAAA,CAAAq7M,EAAA,EAEb,CACA,MAAAxzN,EAAsB,CACtB,UAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,EAAA+zM,EAAA,eAAA53M,CAAA,EACA,IACA,IAAA8F,EAAAqzN,GAAA,KAAAtiB,EAAA,KACA,IAAA/wM,EACA,MAAc,IAAAw/M,EAAA,CACd,IAAAgS,CAAAA,GAAuCrrN,CAAA,IAAAktN,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,EACvC,UAAAooJ,EAAuC,CACvC,IAAAl/M,EAAA82D,QAAsB,CAAAvK,QAAA,CAAAilK,GAAkBrrN,CAAA,EACxC,UAAAm5M,EAAA,CACA,IACA,IAAA4O,EAAA,MAAAmF,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA06J,GAAArrN,CAAA,EAAAqrN,WAAA,EACAxxN,QAAAA,EACa9F,QAAAA,CACb,GAEA,OAAAg0N,CAAA,IAAA5pN,SAAA,CAEA,MAAAvG,EAAsB,CACtB,UAAA4hN,GAAA5hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,EAAAg0M,EAAA,eAAAt2M,EAAA,IACA,QAGAuvB,EAFA,IAAA0nM,CAAAA,MAAsBW,GAAiB,KAAAhiB,EAAA,KAAAv6I,QAAA,EACvC,UAAAooJ,EAAA,CAEA,IACA,CAAAl0L,EAAA,OAAAqoM,GAAA,KAAAhiB,EAAA,KAAAv6I,QAAA,CAAA47J,GAAA,CAAAhB,MAAA,CAAAj2N,EACA,CACA,MAAAsC,EAAsB,CACtB,UAAA6hN,GAAA7hN,GAAA7D,QAAA6D,EAAA,CAEA,IAAAitB,EACQ,UAAA40L,EAAsB,CAE9B,OADAyT,GAAA,KAAAviB,EAAA,IAAAU,GAAAhrM,IAAA,MAAAwkB,EAAAhrB,OAAA,EACAgrB,CACA,CACA,MAAAjtB,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,EChZA,IAAA21N,GAAA,SAAAn+B,CAAA,CAAAzyI,CAAA,CAAAvoD,CAAA,CAAAizD,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,4FACA,YAAA/nI,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,EAAAh7L,GAAAwqC,EAAAA,EAAAxqC,KAAA,CAAAA,EAAAuoD,EAAA5lD,GAAA,CAAAq4L,EAAAh7L,EAAA,CAAAA,CAAA,EAEAo5N,GAAA,SAAAp+B,CAAA,CAAAzyI,CAAA,CAAA0K,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,6FACA,MAAA/nI,MAAAA,EAAAzoB,EAAAyoB,MAAAA,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,GAAAxwJ,EAAAA,EAAAxqC,KAAA,CAAAuoD,EAAAloC,GAAA,CAAA26K,EAAA,EAIA,IAAA/mK,GAAA,IAAArxB,IACA+1E,GAAA,GAoBA,SAAA0gJ,IAAA,CACA,GAAAzjB,IAEAA,EAAAv1M,OAAAquD,MAAA,EAAA+uJ,SAAAA,GAAAp9L,IAAAA,GAAA+6C,GAAAA,EAAA,GACA,oBAAAzvD,QAFA,OAAAiqM,CAAA,CAIA,IAAA0jB,EAAAj5N,OAAAquD,MAAA,EAAA+uJ,SAAAA,EAAA,GACA,IACA9xM,OAAAkY,gBAAA,qCAAA01M,OAAA14M,CAAA,IAAAA,EAAAy4M,GACA,CACA,MAAA91N,EAAA,CACA8D,QAAA9D,KAAA,uEAAAA,EACA,CACA,IACAmI,OAAAg1M,aAAA,KAAA6Y,GAAAF,GACA,CACA,MAAA91N,EAAA,CACA8D,QAAA9D,KAAA,6DAAAA,EACA,CACA,OAAAoyM,CACA,CACA,SAAA6H,GAAA,GAAA7H,CAAA,QAOA,CAHAA,EAAAA,EAAAhuL,MAAA,KAAAqM,GAAArT,GAAA,CAAArY,GAAA,EAGA/J,MAAA,EAEAo3M,EAAAnrM,OAAA,IAAAwpB,GAAApxB,GAAA,CAAA0F,IACAowE,GAAA,UAAAluE,QAAA,GAAAgvN,GAAA,IAAA37J,KAAA83I,KAEA,WACAA,EAAAnrM,OAAA,IAAAwpB,GAAA8nC,MAAA,CAAAxzD,IACAowE,GAAA,YAAAluE,QAAA,GAAAgvN,GAAA,IAAA37J,KAAA83I,IACA,GAPA,OASA,SAAAv1L,IAAA,CACA,UAAA4T,GAAA,CAEA,SAAAmnC,GAAA2Y,CAAA,CAAAjW,CAAA,EAGA,OAFA6a,EAAA,CAAA5E,EAAA,EAAAj3E,KAAAghE,IAAA6a,CAAAA,EAAA,CAAA5E,EAAA,EAAAjW,EAAA,EAEA,WACA6a,EAAA,CAAA5E,EAAA,CAAA4E,EAAA,CAAA5E,EAAA,EAAAnsD,OAAA,GAAAk2C,IAAA47J,EACA,CACA,CACA,SAAAD,GAAA54M,CAAA,EACA,IACAA,GACA,CACA,MAAArd,EAAA,CACA8D,QAAA9D,KAAA,CAAAA,EACA,CACA,CACA,MAAAg2N,WAAA5Y,MACArhN,YAAA+5N,CAAA,EACA,mCACAK,QAAA,GACAC,WAAA,GACSC,SAAA,EACT,GACQpiB,EAAA90M,GAAA,KAAsB,SAC9Bw2N,GAAA,KAAA1hB,EAAA6hB,EAAA,IACA,CACA,IAAAC,QAAe,CACf,OAAAH,GAAA,KAAA3hB,EAAA,IACA,CACA,IAAAv3M,MAAA,CACA,iCACA,CAEA45N,gBAAA,CACA,+CAGAC,0BAAA,CACA,yDAGAC,iBAAA,CACA,gDAEA,CAOA,SAAAC,IAAA,CACA,GAAArkB,IAEAA,EAAAyjB,KACA,oBAAA1tN,QAFA,OAAAiqM,CAAA,CAIA,IAAA9nD,EAAAniJ,OAAAq6M,SAAA,CAAApQ,OAAA,KACA,IAAAx3M,MAAA6D,OAAA,CAAA6rJ,GAEA,OADAxmJ,QAAA9D,KAAA,6CACAoyM,CACA,CACA,IAAA6H,SAAAA,CAAA,EAAA7H,EACA94M,EAAA,IAAAgxJ,IAAAA,EAAArjJ,OAAA,IAAAgvN,GAAA,IAAA54M,EAAA,CAAA48L,SAAAA,CAAA,KACA,IACAp9M,OAAA8L,cAAA,CAAAR,OAAmCq6M,SAAM,YAChChmN,MAAAK,OAAAquD,MAAA,EAAA5xD,KAAAA,CAAA,EACT,EACA,CACA,MAAA0G,EAAA,CAEA,OADA8D,QAAA9D,KAAA,8CACAoyM,CACA,CAEA,OADA94M,KAAAgxJ,GACA8nD,CACA,CClJA,SAAAskB,GAAqBC,CAAA,EACrB,IAAAC,EAAYC,GAAY,IAAW,IAAOz3N,KAC1C,CAAAyd,IAAAA,CAAA,CAAA+6C,GAAAA,CAAA,EAAAi/J,GAAoD,IAAAJ,MAChD,CAAAK,EAASC,EAAA,IAAA9hB,EAAA4C,QAAA,MAAAmf,GAAAn6M,MACb,GAAAo4L,EAAAE,SAAA,OACA,IAAAhgI,EAAA,CACAvd,EAAA,eAAAw6I,IAAA2kB,EAAA,OAAAD,KAAAE,GAAA5kB,GAAA,GACAx6I,EAAA,iBAAAw6I,IAAA2kB,EAAA,GAAAD,EAAA1yM,MAAA,IAAAguL,EAAAvqI,IAAA,IAAA9iE,IAAAkyN,EAAAlyN,MAAA,KACA,CACK,UAAAowE,EAAAluE,OAAA,IAAAwwK,IACL,GAAA7/G,EAAA,EACI,IAAAs/J,EAASC,GAAAL,GAUb,MATA,GAAA7hB,EAAAE,SAAA,OACA,IAAA+hB,EACA,OACA,IAAAE,EAAA,IAAAh4N,IAAA03N,GACAO,EAAA,IAAAj4N,IAAA83N,EAAA9yM,MAAA,KAAAgzM,EAAAh6M,GAAA,CAAAk6M,KACKD,EAAApwN,OAAA,IAAAswN,EAAA/8G,OAAA,GACL,GAAA08G,EAAAJ,EAAA,EAEA,GAAA7hB,EAAWE,SAAA,MAAO,IAAA2hB,EAAA7vN,OAAA,IAAAswN,EAAA/8G,OAAA,QAClB,GAAAy6F,EAAA6E,OAAA,UACAgd,KACAH,EAAAvyM,MAAA,GAAArnB,KAAAA,CAAA,IACA,CAAA+5N,EAAAjvJ,IAAA,IAAAovJ,EAAAl6N,IAAA,GAAAA,KACA65N,EAAAx5M,GAAA,CAAArgB,KACA65N,EAAAv3N,GAAA,CAAAtC,GACA+G,QAAAo3D,IAAA,IAAAn+D,EAAA,+DAAAA,EAAA,kCAEA,KAIA,EAAA+5N,EAAAH,EAAAC,EAAA,CACA,CACA,SAAAC,GAAsBlmM,CAAA,EACtB,IAAAa,EAAA,GAAAyjL,EAAAviL,MAAA,IAIA,OAHAlB,EAAAqB,OAAA,EACArB,CAAAA,EAAAqB,OAAA,EAAAr2B,MAAAm0B,GAAA,GAEAa,EAAAqB,OAAA,CAAAr2B,KAAA,CAEA,SAAA26N,GAAgBpyK,CAAA,EACZ,IAAAvzB,EAAA,GAAAyjL,EAASviL,MAAA,IAIb,MAHA,GAAAuiL,EAAAE,SAAA,OACK3jL,EAAAqB,OAAA,CAAAkyB,CACL,GACAvzB,EAAAqB,OAAA,CAEA,SAAAmkM,GAA0B5kB,CAAA,EAC1B,OAAAA,EAAAhuL,MAAA,CAAAswM,IAAAz5N,GAAA,QAAAs6N,GAAA,CAAAxwN,OAAAA,CAAA,GACA,CC/CA,SAAAyyN,GAAAC,CAAA,EACA,gHAAAt9M,IAAA,CAAAs9M,EACe,CACf,SAAAC,GAAA,CAAAf,SAAAA,CAAA,CAAAc,gBAAAA,CAAA,CAAoD,SACpD,EAAA5vJ,IAAA,IAA+B0vJ,EAAAx6N,IAAA,GAAA0zN,IAC/B8G,EAAAh3M,UAAA,GAAAgyL,EAAAyf,SAAA,EASAxf,EAAAmlB,WAAA,CAEAF,GAEA,WAAAt9M,IAAA,CAAAs9M,IAEA,CAAAD,GAAAC,GACAjlB,EAAAolB,UAAA,CAGAplB,EAAAmlB,WAAA,CC/BA,SAAAE,GAAAnwI,CAAA,SACA,EAGA,UAAAvtE,IAAA,CAAAutE,GACA,SAEA,WAAAvtE,IAAA,CAAAutE,GACA,UAGA,eATA,cACA,CCFA,SAAAowI,GAA0Br7N,CAAA,CAAAs7N,CAAA,EAC1B,IAAAhzK,EAAA,GAAAkwJ,EAAA4C,QAAA,OACA,IACA,IAAAr7M,EAAAogN,aAAAC,OAAA,CAAApgN,GACA,GAAAD,EACA,OAAAe,KAAA2f,KAAA,CAAA1gB,EAAA,CAEA,MAAAwD,EAAA,CACA,oBAAAmI,QACArE,QAAA9D,KAAA,CAAAA,EAEA,CACK,OAAA+3N,CACL,GACAv7N,EAAAuoD,CAAA,IACIizK,EAAS,GAAA/iB,EAAAviL,MAAA,MAoBb,MAnBA,GAAAuiL,EAAAE,SAAA,OACA,GAAA6iB,EAAAnlM,OAAA,EACAmlM,EAAAnlM,OAAA,IACA,MACA,IACA,CACAr2B,IAAA,GAAAA,EACAogN,aAAAsX,UAAA,CAAAz3N,GAGAmgN,aAAAM,OAAA,CAAAzgN,EAAAc,KAAAC,SAAA,CAAAhB,GAEA,CACA,MAAAwD,EAAA,CACA,oBAAAmI,QACArE,QAAA9D,KAAA,CAAAA,EAEK,CACL,GAAAxD,EAAAC,EAAA,EACAsoD,CACA,CJkFAkvJ,EAAA,IAAAnlL,QEnHA0jL,CADAA,EAGAA,GAAAA,CAAAA,EAAA,IAFA,CAAAA,EAAA,6BACCA,CAAA,CAAAA,EAAA,UAAkC,gBGJnC,OAAAylB,WAAAjX,GACAjlN,aAAA,CACA,SAAAm3B,WACA,KAAAn2B,IAAA,yBACA,CACA,KAAAm7N,GAAAz+N,EAAA,MCFA,SAAA0+N,GAA4B,CAAA3sM,SAAAA,CAAA,CAAA4mL,QAAMukB,CAAA,CAAAY,QAAAA,CAAA,CAAAa,eAAAA,CAAA,CAAAC,qBAAAA,CAAA,CAAAC,eAAAA,CAAA,CAAAC,QAAAA,CAAA,CAAAC,eAAAA,CAAA,GAClC,IAAAC,EAAA,GAAAxjB,EAAAviL,MAAwC,MACxC,CAAAq/L,EAAA2G,EAA+B,IAAAzjB,EAAM4C,QAAA,MACrC8gB,EAAA,GAAA1jB,EAAAviL,MAA8C,MAC9C,CAAAkmM,EAAAC,EAAsC,IAAA5jB,EAAA4C,QAAQ,MAC9C,CAAAl8M,EAAAm9N,EAAA,CAAsC,GAAA7jB,EAAA4C,QAAA,EAAQ,IAAA0f,GAAA57N,WAAA,MAC9C,CAAAomN,EAAAgX,EAAA,IAAA9jB,EAAA4C,QAAA,MAAA0f,GAAAxV,WAAA,IAKIiX,EAAS,GAAA/jB,EAAAviL,MAAA,EAAA6lM,GACb,GAAAtjB,EAAAE,SAAA,OACA6jB,EAAAnmM,OAAA,CAAA0lM,EACA,KACAS,EAAAnmM,OAAA,CAAAh1B,KAAAA,CACK,GACL,CAAA06N,EAAA,EACA,IAAAU,EAAA,GAAAhkB,EAAAviL,MAAA,GAAA1yB,EAAAu3N,KACA,CAAAa,EAAAvlM,OAAA,GACAmmM,EAAAnmM,OAAA,CACAmmM,EAAAnmM,OAAA,CAAA7yB,EAAAu3N,IAGAzzN,QAAA9D,KAAA,CAAAA,EAAqCu3N,GACrCv3N,aAAAihN,IAAA,oBAAA94M,QAAAovN,GACApvN,OAAA8X,IAAA,CAAAs3M,EAAAnyN,GAAA,aAIKpF,IAGL,CAAAoyM,EAAA8mB,EAAA,IAAAjkB,EAAA4C,QAAA,MAAA8e,EACA17N,GAAA,MACAs8N,QAAAA,EACKh3M,WAAAg3M,EAAAh3M,UAAA,CACL,GACA6D,MAAA,GAAA7D,WAAAA,CAAA,IAAAA,IAAAgyL,EAAA2e,WAAA,GAEA,GAAAjc,EAAAE,SAAA,OAcA,SAAAgkB,EAAA54M,CAAA,EACA24M,EAAA,IACA,IAAA/9N,EAAAi+N,EAAAjrK,SAAA,GAAAopK,QAAAA,CAAA,IAAAA,IAAA,MACA,GAAAp8N,KAAAA,EACA,OAAAi+N,CAAA,CAEA,IAAA7B,QAAAA,CAAA,EAAA6B,CAAA,CAAAj+N,EAAA,CACA,UACsBi+N,EAAAh+N,KAAA,GAAqBD,GAC3C,CAAAo8N,QAAAA,EAAAh3M,WAAAA,CAAA,KACA64M,EAA4Bh+N,KAAY,CAAAD,EAAA,GAC3B,CAAAipB,MAAA,GAAA7D,WAAAA,CAAA,IAAAA,IAAAgyL,EAAA2e,WAAA,CACb,EACA,CAEA,OA3BAgI,EAAA,GAAAvC,EACA17N,GAAA,EAAAs8N,EAAAp8N,IAAA,CACA,IAAA4J,EAAAqtM,CAAA,CAAAj3M,EAAA,CAEA,OAAA4J,GAAAA,EAAAwyN,OAAA,GAAAA,GAAAxyN,EAAAwb,UAAA,GAAAg3M,EAAAh3M,UAAA,CACAxb,EACA,CACAwyN,QAAAA,EACAh3M,WAAAg3M,EAAAh3M,UAAA,CACS,GAET6D,MAAA,GAAA7D,WAAAA,CAAA,IAAAA,IAAAgyL,EAAA2e,WAAA,GAeAyF,EAAA1vN,OAAA,IAAAswN,EAAA3/J,EAAA,oBAAAuhK,EAAA5B,IACA,KACAZ,EAAA1vN,OAAA,IAAAswN,EAAA9/C,GAAA,oBAAA0hD,EAAA5B,GACK,CACL,GAAAA,EAAAZ,EAAmB,EACnB,IAAA5xN,EAAA,GAAAkwM,EAAA6E,OAAA,MAAA1H,EAAAlxM,IAAA,IAAA6D,EAAAwyN,OAAA,GAAAA,IAAA,MAAAA,EAAAnlB,EAAA,EAEA,GAAA6C,EAAAE,SAAA,OACA,IAAAoiB,EACA,OACA,IAAA8B,EAAA,IACAP,EAAAn9N,GACA88N,EAAA5lM,OAAA,IACA6lM,EAAA,IACAK,EAAA,IACAJ,EAAA9lM,OAAA,IACAgmM,EAAA,GACA,EACAS,EAAA,KACAlB,EAAAvlM,OAAA,GAEAimM,EAAA,MACAL,EAAA5lM,OAAA,IACA6lM,EAAA,IACAK,EAAA,IACAJ,EAAA9lM,OAAA,IACAgmM,EAAA,IACA,EACAxK,EAAA,IACA4K,EAAApmM,OAAA,CAAA7yB,EAAAu3N,EACA,EAIA,OAHAA,EAAA3/J,EAAA,WAAAyhK,GACA9B,EAAA3/J,EAAA,cAAA0hK,GACA/B,EAAA3/J,EAAA,SAAAy2J,GACA,KACAkJ,EAAA9/C,GAAA,WAAA4hD,GACA9B,EAAA9/C,GAAA,cAAA6hD,GACA/B,EAAA9/C,GAAA,SAAA42C,GACAiL,GACK,CACL,GAAA/B,EAAAa,EAAA,EAEI,IAAAmB,EAAS,GAAAtkB,EAAAviL,MAAA,MACb,GAAAuiL,EAAAE,SAAA,MACA,KACAokB,EAAA1mM,OAAA,GACK,EACL,CAAA0kM,EAAA,EAEA,GAAAtiB,EAAAE,SAAA,OACAokB,EAAA1mM,OAAA,EACA4lM,EAAA5lM,OAAA,EACAkvL,IACAsW,GACAtzN,GAAAwb,aAAAgyL,EAAAyf,SAAA,EAAAjtN,GAAAwb,aAAAgyL,EAAA0e,QAAA,GAEAwH,EAAA5lM,OAAA,IACA6lM,EAAA,IACAa,EAAA1mM,OAAA,IACA,iBACA,IACA,MAAAwlM,GACA,CACA,MACAC,GAEA,QACA,CACAI,EAAA,IACAD,EAAA5lM,OAAA,GACS,CACJ,IACL,GAAAkvL,EAAAsW,EAAAC,EAAAvzN,EAAA,EAEA,IAAAwiD,EAAA,GAAA0tJ,EAAA8C,WAAA,QAAA31M,EAAAV,EAAAtD,IAAA,CACA,IAAAm5N,EACA,MAAA0B,EAAApmM,OAAA,KAAAolM,GAAA,CACA,IAAAlW,EACA,MAAAkX,EAAApmM,OAAA,KAAA4uL,GAAA8V,EAAA,CACK,aAAAA,EAAAhwK,eAAA,CAAAnlD,EAAAV,EAAAtD,EACL,GAAAm5N,EAAAxV,EAAA,EAEA/7M,EAAA,GAAAivM,EAAA6E,OAAA,MAAAyd,GAAA,oBAAAA,EACA,MAAAn1N,GAAA,CACA,IAAA2/M,EACA,MAAAkX,EAAApmM,OAAA,KAAA4uL,GAAA8V,EAAA,CACA,aAAAA,EAAAvxN,eAAA,CAAA5D,EACA,EACAvE,KAAAA,CAAA,EAAA05N,EAAAxV,EAAA,EAEA36M,EAAA,GAAA6tM,EAAA6E,OAAA,MAAAyd,GAAA,wBAAAA,EACA,MAAAtwK,GAAA,CACA,IAAA86J,EACA,MAAAkX,EAAApmM,OAAA,KAAA4uL,GAAA8V,EAAA,CACA,aAAAA,EAAAnwN,mBAAA,CAAA6/C,EACA,EACAppD,KAAAA,CAAA,EAAA05N,EAAAxV,EAAA,EAEA0R,EAAA,GAAAxe,EAAA6E,OAAA,MAAAyd,GAAA,gBAAAA,EACA,MAAAp7N,GAAA,CACA,IAAA4lN,EACA,MAAAkX,EAAApmM,OAAA,KAAA4uL,GAAA8V,EAAA,CACA,aAAAA,EAAA9D,WAAA,CAAAt3N,EACA,EACA0B,KAAAA,CAAA,EAAA05N,EAAAxV,EAAA,EAEA4R,EAAA,GAAA1e,EAAA6E,OAAA,MAAAyd,GAAA,WAAAA,EACA,MAAA75N,GACA,MAAA65N,EAAA5D,MAAA,CAAAj2N,GAEAG,KAAAA,CAAA,EAAA05N,EAA0B,EAC1B8B,EAAA,GAAApkB,EAAA8C,WAAA,YACA,GAAA0gB,EAAA5lM,OAAA,EAAA8lM,EAAA9lM,OAAA,EAAA9tB,GAAAwyN,QAAAxV,SAAA,CACA,OACA,IAAAh9M,EACA,MAAgBk0N,EAAApmM,OAAsB,KAAAolM,GAAA,CACtC,IAAAV,QAAAA,CAAA,CAAAh3M,WAAAA,CAA6B,EAAAxb,EAC7B,IAAAwb,CAAAA,IAAAgyL,EAA6Cyf,SAAA,EAAAzxM,IAAmBgyL,EAAA0e,QAAA,EAChE,MAAAgI,EAAApmM,OAAA,KAAAouL,GAAAsW,EAAA,CACAkB,EAAA5lM,OAAA,IACA6lM,EAAA,IACA,IACA,MAAAnB,EAAAnmG,OAAA,EACA,CACA,MAAAjwH,EAAA,CAEA,MADAm3N,IACAn3N,CAAA,QAEA,CACAu3N,EAAA,IACAD,EAAA5lM,OAAA,GACK,CACL,GAAAylM,EAAAvzN,EAA6B,EAC7Bu0N,EAAA,GAAArkB,EAAA8C,WAAA,YACA,IAAA4gB,EAAA9lM,OAAA,EAEA0kM,GAEAoB,EAAA9lM,OAAA,IACAgmM,EAAA,IACA,IACA,MAAAtB,EAAA5E,UAAA,EACA,QACA,CACAkG,EAAA,IACAF,EAAA9lM,OAAA,GACK,EAXL,EAYA,CAAA0kM,EAAY,EACZ,OAAAtiB,EAAAltL,aAAA,CAAAmwM,GAAA1pM,CAAA,CAAA6C,QAAA,EAAA70B,MAAA,CACAwlN,YAAA,EAAAqW,EACAjmB,QAAAA,EACArtM,OAAAA,EACApJ,UAAAA,EACAomN,UAAAA,EACAgQ,WAAAA,EACA6G,cAAAA,EACApG,OAAAgG,EACApnG,QAAAioG,EACA1G,WAAA2G,EACA/xK,gBAAAA,EACAvhD,gBAAAA,EACAoB,oBAAAA,EACAqsN,YAAAA,EACWE,OAAAA,CACX,GAAAnoM,EACA,CCpOA,SAAAguM,IAAA,CAIA,OAHA37N,KAAAA,IAAAs0M,GACAA,CAAAA,EAAAjqM,WAAAs6M,SAAA,EAAAC,WAAA,MAEAtQ,CACA,CACA,SAAAsnB,GAAA9C,CAAA,EACA,IAAAc,EAA4B+B,KAC5B,OAAA9B,GAAA,CAAAf,SAAAA,EAAAc,gBAAAA,CAAA,KAAAjlB,EAAAolB,UAAA,CAEA,SAAA8B,IAAA,CACA,IAAAv6M,EAAAjX,WAAAiX,QAAA,CACA,GAAAA,EAEA,SAAAA,EAAA00H,QAAA,KAAA10H,EAAAgoM,IAAA,GAEA,SAAAwS,GAAY,CAAanuM,SAAAA,CAAE,CAAA4mL,QAAaukB,CAAA,CAAA3U,YAAAA,CAAA,CAAA4X,gBAAAA,EAAA,aAAArB,QAAAA,CAAA,GACxC,IAAA72N,WAAAA,CAAA,EAAAo/M,KACA+Y,EAAgCnD,GAAOC,GACvCvC,EAAA,GAAAnf,EAAA6E,OAAA,OACA,IAAA2f,GAAAI,GACA,YAEA,IAAAC,EAAAD,EAAA34N,IAAA,IAAAq2N,EAAAx6N,IAAA,GAAA0zN,WACA,GAGA,IAAAI,GAA6B,CAC7BS,gBAAAwC,KACAtC,YAAA,CACaxN,IAAA0V,IACb,EACAtI,yBAAqB4C,KACrBlqI,QAAA+tI,GAA8Bn2N,GAAkC8/I,aACvDmwE,iBAAA0C,IACJ,EACL,GAAAwF,EAAAn4N,GAA4C8/I,YAAO,EACnDu4E,EAAA,GAAA9kB,EAAA6E,OAAA,MACA,MAAAsa,GAAAyF,KAAAA,EAAA7/M,OAAA,CAAAo6M,GACAyF,EAEK,CAAAzF,KAAAyF,EAAA,CACL,CAAAA,EAAAzF,EAAwC,EACxC,CAAA4F,EAAoBC,EAAO,CAAAnC,GAAA8B,EAAAH,GAAAI,GAAApJ,GAAA,MAC3B8G,EAAA,GAAAtiB,EAAyB6E,OAAA,MAAAigB,EAAW74N,IAAA,IAAAtH,EAAAmD,IAAA,GAAAi9N,IAAA,MAAAD,EAAAC,EAAA,EACpCE,EAAA,GAAAjlB,EAAA8C,WAAA,MACAiiB,IAAAG,IAEA5C,GAKAA,EAAAx6N,IAAA,GAAA0zN,IACA8G,EAAA5E,UAAA,GAEKsH,EAAAE,GACD,GAAA5C,EAAA0C,EAASD,EAAA,EACb,GAAA/kB,EAAAE,SAAA,OACA,GAAAoiB,EAWA,OADAA,EAAA3/J,EAAA,cAAA0hK,GACA,KACA/B,EAAA9/C,GAAA,cAAA6hD,EACK,CAZL,CACA,SAAAA,GAAA,EACAlB,EAAAvlM,OAAA,GAGAmnM,IAAAvJ,IAAAgJ,GAAAI,IAEAI,EAAA,MACA,CAKA,GAAA1C,EAAAsC,EAAmCI,EAAMD,EAAA,EACzC,IAAAI,EAAA,GAAqCnlB,EAAAviL,MAAA,MACrC2nM,EAAA,GAAAplB,EAAA6E,OAAA,OACA,MAAAyd,EAEA,iBAEAvV,CAAAA,CAAA,IAAAA,GAAA,MAAAA,EAAAuV,EAAA,IACA6C,EAAAvnM,OAAA,CACA,MAAA0kM,EAAAnmG,OAAA,GAGA,MAAAmmG,EAAAvV,WAAA,GAGK,CAXL,EAYA,CAAAA,EAAAuV,EAA2B,EACvBa,EAAS,GAAAnjB,EAAAviL,MAAA,MACb,GAAAuiL,EAAAE,SAAA,MAA2B,CAC3B,GAAA6kB,IAAAvJ,IAAAgJ,GAAAI,GAAA,CACAzB,EAAAvlM,OAAA,IACA,MACA,UACAynM,GAAA,CACAlC,EAAAvlM,OAAA,GACA,CASA,OADA1qB,OAAAkY,gBAAA,gBAAAi6M,GACA,KACAnyN,OAAAqY,mBAAA,gBAAA85M,EACK,CACL,GAAAT,EAA+BG,EAAA,EAC/B,IAAAO,EAAA,GAAAtlB,EAAwC8C,WAAA,OACxCwf,GAAAA,EAAAx6N,IAAA,GAAA0zN,IAEAyJ,EAAA,KAEA,GAAA3C,EAAA2C,EAAyB,EACzBM,EAAA,GAAAvlB,EAAA8C,WAAA,MACAqiB,EAAAvnM,OAAA,IACKqnM,EAAAF,EACL,GAAAE,EAAY,EACZ,OAAAjlB,EAAAltL,aAAA,CAAAowM,GAAA,CAAA/lB,QAAA2nB,EAAAxC,QAAAA,EAAAa,eAAAA,EAAAC,qBAAAgC,EAAA/B,eAAAiC,EAAAhC,QAAAA,EAAAC,eAAAgC,CAAA,EAAAhvM,EACA,KAAAivM,GAAAhhO,EAAA,MAAAihO,GAAAjhO,EAAA,MClIA,IAAAkhO,GAAgB,EAAAv2N,GAAAA,CAAA,CAAAonB,SAAAA,CAAM,CAAAovM,SAAAA,EAAA,OACtB,IAAAppM,EAAA,GAAAyjL,EAAoBviL,MAAA,MAAM,EAC1BmoM,EAAA,GAAA5lB,EAAAviL,MAAA,MACAooM,EAAA,wBACAC,EAAA,KACA,IAAA1vM,EAAAmG,EAAAqB,OAAA,CACAxH,GAEAosL,sBAAA,KACSpsL,EAAAwe,KAAA,CAAA1G,MAAA,CAAA9X,EAAA2vM,YAAA,KACT,EACA,EACAC,EAAA,KACA,IAAA5vM,EAAAmG,EAAAqB,OAAA,CACAxH,GAEAosL,sBAAA,KACApsL,EAAAwe,KAAA,CAAA1G,MAAA,CAAA9X,EAAA0tL,YAAA,MACA1tL,EAAAwe,KAAA,CAAAmK,QAAA,UACAyjK,sBAAA,KACapsL,EAAAwe,KAAA,CAAA1G,MAAA,IACJ,EACT,EACI,EAiCJ,MAhCA,GAAA8xK,EAAA18K,eAAA,OACAqiM,EACAG,IAGAE,GAEI,GAAAL,EAAA,EACJ,GAAA3lB,EAAA18K,eAAA,OACA,IAAAlN,EAAAmG,EAAAqB,OAAA,CACA,GAAAxH,EAoBK,OALLwvM,EAAAhoM,OAAA,GACAqoM,IACAL,EAAAhoM,OAAA,KAEAxH,EAAAhL,gBAAA,iBAAA86M,GACK,IAAA9vM,EAAA7K,mBAAA,iBAAA26M,EAnBL,CACA,SAAAD,GAAA,CACA7vM,IAEAA,EAAAwe,KAAA,CAAAmK,QAAA,CAAA4mL,EAAA,mBACAA,GACAvvM,CAAAA,EAAAwe,KAAA,CAAA1G,MAAA,SAEA,CACA,SAAAg4L,EAAA5qJ,CAAA,EACAllD,GAAAklD,EAAA94B,MAAA,GAAApsB,GAAAklD,WAAAA,EAAA6qJ,YAAA,EACAF,GAEA,CAOA,GAAAN,EAAY,EACZ3lB,EAAAltL,aAAA,QAAA+Q,UAAA,0BAAA10B,GAAAA,EAAAotB,IAAAA,EAAA6pM,KAAA,SAAAxxL,MAAA,CAAA1G,OAAA,EAAA23L,WAAAD,EAAAhoM,OAAA,CAAAh1B,KAAAA,EAAAi9N,CAAA,GAAAtvM,EACA,ECzDA8vM,GAAY,GACZrmB,EAAAltL,aAA2B,WAAA+Q,UAA2B,yBAAAt5B,EAAAs5B,SAAA,KAA+C,EAAAwD,SAAA98B,EAAA88B,QAAA,CAAAuN,MAAArqC,EAAAqqC,KAAA,CAAA0xL,QAAA/7N,EAAA+7N,OAAA,CAAAC,SAAAh8N,EAAAg8N,QAAA,IAAA9+N,KAAA,UACrG8C,EAAAi8N,SAAA,EAAAxmB,EAAAltL,aAAA,MAAA+Q,UAAA,oCAAAt5B,EAAAi8N,SAAA,EACAj8N,EAAAgsB,QAAA,CACAhsB,EAAAk8N,OAAA,EAAAzmB,EAAAltL,aAAA,MAAA+Q,UAAA,kCAAAt5B,EAAAk8N,OAAA,GCJAC,GAAA,EAAqB52N,OAAAA,CAAA,IAAAvF,EAAmB,GACxCuF,GAAAkwM,EAAAltL,aAAA,QAAA/U,IAAAjO,EAAAwyN,OAAA,CAAAj6L,IAAA,CAAAs+L,IAAA,GAAA72N,EAAAwyN,OAAA,CAAAx6N,IAAA,WAAAyC,CAAA,GCEAq8N,GAAY,EAAAC,YAAAA,CAAmB,CAAAN,SAAAA,CAAA,CAAAz2N,OAAAA,CAAA,IACvBkwM,EAAAltL,aAAoB,MAAU,KACtCktL,EAAAltL,aAAA,CAAAuzM,GAAA,CAAAC,QAAAO,EAAAL,UAAAxmB,EAAAltL,aAAA,CAAA4zM,GAAA,CAAA52N,OAAAA,CAAA,GAAAy2N,SAAAA,CAAA,EACAz2N,EAAAwyN,OAAA,CAAAx6N,IAAA,CACAgI,EAAAwb,UAAA,GAAAgyL,EAAAyf,SAAA,EAAA/c,EAAAltL,aAAA,2BCPAg0M,GAAY,IACJ9mB,EAAAltL,aAAmB,QAAaspB,MAAA,KAAAlO,OAAA,KAAA64L,QAAA,YAAA/sI,KAAA,OAAAgtI,MAAA,4BAAyF,EACzHhnB,EAAAltL,aAAmB,WAAam0M,GAAA,OAAAC,GAAA,KAAAj+N,EAAA,KAAA+wF,KAAA,+BAAA/4D,YAAA,QAChC++K,EAAAltL,aAAmB,UAAQ,CAAAm0M,GAAA,OAAAC,GAAA,KAAAj+N,EAAA,KAAkCk+N,OAAA,+BAAA5lM,cAAA,MAAAC,YAAA,MACrEw+K,EAAYltL,aAAA,KAAmB,CAAAs0M,SAAW,wBAC9BpnB,EAAAltL,aAAmB,SAAWruB,EAAA,8sBAA4Qu1F,KAAA,iCAC9SgmH,EAAAltL,aAAmB,SAAAruB,EAAA,kOAAAu1F,KAAA,kCAC3BgmH,EAAYltL,aAAA,QAAmB,KAC/BktL,EAAgBltL,aAAA,kBAA8B,CAAA3jB,GAAA,yBAAsBkgL,GAAA,UAAAg4C,GAAA,UAAAvyG,GAAA,SAAAnC,GAAA,UAAA20G,cAAA,kBACpDtnB,EAAAltL,aAAmB,SAAWy0M,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,SAAmC,GACrEvnB,EAAAltL,aAAmB,SAAAhV,OAAqB,IAAAypN,UAAA,aACpDvnB,EAAgBltL,aAAA,kBAA8B,CAAA3jB,GAAA,yBAAsBkgL,GAAA,UAAAg4C,GAAA,UAAAvyG,GAAA,SAAAnC,GAAA,UAAA20G,cAAA,kBACpDtnB,EAAAltL,aAAmB,SAAWy0M,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,SAAmC,GACrEvnB,EAAAltL,aAAmB,SAAAhV,OAAqB,IAAAypN,UAAA,aACpDvnB,EAAgBltL,aAAA,kBAA8B,CAAA3jB,GAAA,yBAAsBkgL,GAAA,UAAAg4C,GAAA,UAAAvyG,GAAA,UAAAnC,GAAA,UAAA20G,cAAA,kBACpDtnB,EAAAltL,aAAmB,SAAWy0M,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,SAAmC,GACrEvnB,EAAAltL,aAAmB,SAAAhV,OAAqB,IAAAypN,UAAA,aACpDvnB,EAAgBltL,aAAA,kBAA8B,CAAA3jB,GAAA,yBAAsBkgL,GAAA,UAAAg4C,GAAA,UAAAvyG,GAAA,UAAAnC,GAAA,UAAA20G,cAAA,kBACpDtnB,EAAAltL,aAAmB,SAAWy0M,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,YAC9BvnB,EAAAltL,aAAmB,SAAWhV,OAAA,OAAAypN,UAAA,SAAmC,GACrEvnB,EAAAltL,aAAmB,SAAehV,OAAA,IAAAypN,UAAsB,aACpEvnB,EAAgBltL,aAAA,YAAmB,CAAW3jB,GAAA,kBAC9C6wM,EAAAltL,aAAA,SAAAspB,MAAA,KAAAlO,OAAA,KAAA8rD,KAAA,QAAA9iD,UAAA,0BC9BAswL,GAAgB,EAAA3jM,UAAAA,EAAM,GAAAjQ,UAAAA,EAAA,WACtB,IAAA2I,EAAY,GAAAyjL,EAAAviL,MAAkB,EAAE,MAChC,CAAY0/K,QAAAA,CAAA,CAAAogB,OAAAA,CAAe,KAAA0F,GAAAhmM,CAAA,IAC3B,CAAAwqM,WAAAA,CAAA,KAAAjC,GAA4ClnM,CAAA,IAC5C,CAAAqnM,EAAA+B,EAAgC,IAAA1nB,EAAA4C,QAAQ,MACxC,CAAA+kB,EAAAC,EAAA,CAAgC,GAAA5nB,EAAA4C,QAAA,EAAQ,IACxC,CAAAilB,EAAAC,EAAA,IAAA9nB,EAAA4C,QAA8C,QAC9C,CAAAmlB,EAAAC,EAAA,IAAAhoB,EAAA6E,OAAA,OACA,IAAAojB,EAAA,GACAC,EAAA,GACA,QAAAp4N,KAAAqtM,EACArtM,EAAAwb,UAAA,GAAAgyL,EAAAyf,SAAA,CACAkL,EAAA5jO,IAAA,CAAAyL,GAGAo4N,EAAA7jO,IAAA,CAAAyL,GAGK,OAAAm4N,EAAAliO,MAAA,EAAAkiO,EAAAC,EAAA,EAAAA,EAAA,KACL,CAAA/qB,EAAA,EACAgrB,EAAA,GAAAnoB,EAAA8C,WAAA,OACA8kB,EAAA,IACKz/I,WAAA,IAAAs/I,EAAA,QACL,GAAAA,EAAA,EACAxO,EAAA,GAAAjZ,EAAA8C,WAAA,MACAxnI,EAAA+lJ,cAAA,GACK8G,GACL,GAAAA,EAAA,EACAC,EAAA,GAAApoB,EAAA8C,WAAA,GAAAxnI,EAAAypJ,IAAA,CACAxH,EAAAwH,GACK9L,EAAA39I,EACL,GAAAiiJ,EAAAtE,EAAA,EACAoP,EAAyB,GAAAroB,EAAA8C,WAAW,MAAA4kB,EAAA,CAAA/B,GAAA,CAAAA,EAAA,EACpC2C,EAAA,GAAAtoB,EAAA8C,WAAA,MACA,IAAA1sL,EAAAmG,EAAAqB,OAAA,CACA,IAAAxH,EACA,OAEA,IAAAmyM,EAAAnyM,EAAAmE,gBAAA,WAEAiuM,EAAAD,CAAA,IAEAE,EAAAF,CAAA,CAAAA,EAAAxiO,MAAA,IACAu1E,EAAAotJ,QAAA,CAEAh2M,SAAAi2M,aAAA,GAAAH,IACAC,EAAAxgM,KAAA,GACAqzC,EAAA+lJ,cAAA,IAKA3uM,SAAAi2M,aAAA,GAAAF,IACAD,EAAAvgM,KAAA,GACAqzC,EAAA+lJ,cAAA,GAGI,GAAA9kM,EAAA,EAyBJ,MAxBA,GAAAyjL,EAAA18K,eAAA,OACA,IAAAslM,EAAA,IACAttJ,WAAAA,EAAA9zE,GAAA,CACA2gO,IAEA,QAAA7sJ,EAAA9zE,GAAA,EACA8gO,EAAAhtJ,EAEA,EAEA,CAAAv8B,SAAAA,CAAA,EAAA7rC,OAAA21N,gBAAA,CAAAn2M,SAAA7M,IAAA,EAOA,OALAsiE,WAAA,IAAAy/I,EAAA,OAEAl1M,SAAA7M,IAAA,CAAA+uB,KAAA,CAAAmK,QAAA,UAEA7rC,OAAAkY,gBAAA,WAAAw9M,EAAA,IACA,KAEAl2M,SAAA7M,IAAA,CAAA+uB,KAAA,CAAAmK,QAAA,CAAAA,EACA7rC,OAAAqY,mBAAA,WAAAq9M,EAAA,GACK,CACD,GAAAT,EAAAG,EAAe,EACnB,GAAAtoB,EAAA18K,eAAA,MAAAwkM,EAAAp1M,SAAAiL,aAAA,CAAA/J,IAAA,CAAAA,EAAA,EACQi0M,GACR,GAAApC,GAAYqD,YAAmB,EAAA9oB,EAAUltL,aAAA,uDAA6C,oBAAA+Q,UAAA,wBAAA8jM,GAAA,kCAAA9jM,EAAA,EAAAtH,IAAAA,EAAA6pM,KAAA,UACtFpmB,EAAgBltL,aAAA,OAAmB,CAAA+Q,UAAU,kCAC7Cm8K,EAAoBltL,aAAA,OAAmB,CAAA+Q,UAAa,gCACpDm8K,EAAwBltL,aAAA,UAAmB,CAAAwzM,QAAUrN,EAAAp1L,UAA2B,qCAChFm8K,EAA4BltL,aAAA,OAAmB,CAAAspB,MAAW,KAAAlO,OAAA,MAC1D8xK,EAAAltL,aAA4C,SAAAruB,EAAA,qIAAkC,KAC9EsjO,EAAwBhiO,MAAA,CAAmBi6M,EAAAltL,aAAS,CAAAktL,EAAAzW,QAAA,MAC5ByW,EAAAltL,aAAmB,OAAS+Q,UAAA,4BAAwC,4CAC5Fm8K,EAAAltL,aAAA,OAAA+Q,UAA2D,2BAAoB,EAC/EkkM,EAAA/hO,GAAA,IAAuDg6M,EAAAltL,aAAoB,CAAA8zM,GAAY,CAAAp/N,IAAAsI,EAAAwyN,OAAA,CAAAx6N,IAAA,CAAA++N,YAAA,GAAyDuB,EAAA9sJ,EAAAxrE,EAAAwyN,OAAoC,CAAAx6N,IAAA,EAAAgI,OAAoBA,CAAA,IACxMk4N,EAAAjiO,MAAmD,CAAAi6M,EAAAltL,aAAmB,CAAA4yM,GAAa,CAAAC,SAAAA,EAAAx2N,GAAA,iCAAA64N,EAAAhiO,GAAA,IAAwFg6M,EAAAltL,aAAA,CAAA8zM,GAAA,CAAAp/N,IAAAsI,EAAAwyN,OAAA,CAAAx6N,IAAA,CAAA++N,YAAA,GAAAuB,EAAA9sJ,EAAAxrE,EAAAwyN,OAAA,CAAAx6N,IAAA,EAAAy+N,SAAAZ,EAAA,KAAA71N,OAAAA,CAAA,WAC3Kk4N,EAA4BjiO,MAAmB,CAAAi6M,EAAAltL,aAAA,WAAA+Q,UAAA,iCAAAyiM,QAAA+B,EAAA9B,SAAA,GAC/CvmB,EAAAltL,aAAA,aACA6yM,EAAA,gBAC4B,WAC5B3lB,EAAgCltL,aAAA,OAAmB,CAAAspB,MAAW,KAAAlO,OAAA,IAAA64L,QAAA,WAAAC,MAAA,6BAAAnjM,UAAA,GAAA8hM,EAAA,mDACtC3lB,EAAAltL,aAAmB,CAAS,QAAAruB,EAAA,2TAAyC,WAAAu7M,EAAAltL,aAAA,CAAAktL,EAAAzW,QAAA,MACrEyW,EAAAltL,aAAmB,OAAA+Q,UAAU,8BAA0C,8CAC/Fm8K,EAA4BltL,aAAA,OAAoB,CAAA+Q,UAAS,+BACzDm8K,EAAAltL,aAAA,CAAAg0M,GAAmD,OACnDkB,EAA4BjiO,MAAmB,CAAAi6M,EAAAltL,aAAa,CAAAktL,EAAAzW,QAAA,MAC5DyW,EAAgCltL,aAAA,UAAmB,CAAA+Q,UAAA,iCAAAyiM,QAAA+B,EAAA9B,SAAA,GACnDvmB,EAAAltL,aAAA,aACA6yM,EAAA,uCACgC,WAChC3lB,EAAoCltL,aAAA,OAAmB,CAAAspB,MAAW,KAAAlO,OAAA,IAAA64L,QAAA,WAAAC,MAAA,6BAAAnjM,UAAA,GAAA8hM,EAAA,mDACtC3lB,EAAAltL,aAAoB,CAAQ,OAAI,CAAAruB,EAAA,2TAAyD,KACrHu7M,EAAgCltL,aAAA,CAAA4yM,GAAmB,CAASC,SAAAA,EAAAx2N,GAAA,+BAAwC,EACrE6wM,EAAAltL,aAAU,OAAA+Q,UAAA,6BAAAmkM,EAAqEhiO,GAAA,IAAAg6M,EAAAltL,aAAA,CAAA8zM,GAAA,CAAAp/N,IAAAsI,EAAAwyN,OAAA,CAAAx6N,IAAA,CAAA++N,YAAA,GAAAuB,EAAA9sJ,EAAAxrE,EAAAwyN,OAAA,CAAAx6N,IAAA,EAAAy+N,SAAAZ,EAAA,KAAA71N,OAAAA,CAAA,eAC9GkwM,EAAAltL,aAAA,QAAA+Q,UAAA,+BAAAklM,YAAA9P,CAAA,IAAA4O,EACA,ECtHAmB,GAAA,EAAAzyM,SAAAA,CAAkC,IAAAhsB,EAAA,GAAQ,CAC1C,IAAA0+N,EAAYxB,EAAmB,CAAC,GAAAznB,EAAA4C,QAAA,MAChC,OAAA5C,EAAAltL,aAAA,CAAA0yM,GAAAryN,CAAA,CAAAipB,QAAA,EAAA70B,MAAA,CACA0hO,QAAAA,EACWxB,WAAAA,CACX,GACAlxM,EACA0yM,GAAAjpB,EAAAltL,aAAA,CAAA00M,GAAA,IAAAj9N,CAAA,GACA,ECTO2+N,GAAA,SACP,OAAAC,WAA2Brb,GAC3BhnN,YAAAiH,EAAA,IACA,QACA,KAAAjG,IAAA,CAAAohO,GACA,KAAA/4N,GAAA,uBACA,KAAAk4B,IAAA,s+CACA,KAAAulL,4BAAA,KAAAzjN,IAAA,cACA,KAAA4xN,WAAc,qBAAA7oN,QAA4B,oBAAAwf,SAC5B4qL,EAAA2e,WAA4B,CAC1C3e,EAAA8rB,WAAA,CACA,KAAAC,aAAA,MACA,IAAAv5N,EAAA,KAAAw5N,OAAA,CACAx5N,IACAA,EAAA0yK,GAAA,mBAAA6mD,aAAA,EACAv5N,EAAA0yK,GAAA,uBAAA+mD,eAAA,EACA,KAAAD,OAAA,MACA,KAAAz+F,UAAA,MACA,KAAAzlE,IAAA,aAAAgnJ,IACA,KAAAhnJ,IAAA,eAEA,EACA,KAAAmkK,eAAA,KACA,IAAA7iO,EAAA,KAAAmkI,UAAA,CACA,GAAAnkI,GAEA,IACA8iO,EAAA,IAAApjI,GAAAziF,SAAA,CAAA6lN,EAAAt7K,OAAA,GACA,CACA,MAAAnjD,EAAA,CACA,KAAAq6D,IAAA,aAAAmnJ,GAAAxhN,GAAA7D,QAAA6D,IACA,MACA,CACArE,EAAAsjD,MAAA,CAAAw/K,KAEA,KAAA3+F,UAAA,CAAA2+F,EACA,KAAApkK,IAAA,WAAAokK,IAXA,EAaA,KAAA3N,WAAA,IACA,KAAAyN,OAAA,MACA,KAAAz+F,UAAA,MACA,IAAgB,CAAAkxF,WAAA,GAAAze,EAAoB2e,WAAA,GACpC3O,MAEA,KAAAyO,WAAA,CAAAze,EAAA0e,QAAA,CACA,KAAA52J,IAAA,yBAAA22J,WAAA,GAGA9O,GAAA,IACA,EAAA/5M,CAAAA,OAAAu2N,OAAA,EAAAviB,QAA2CwiB,WAAAx2N,OAAAg0M,MAA0B,EAAAwiB,SAAA,IACrE,KAAA3N,WAAA,CAAAze,EAAAyf,SAAA,CACA,KAAA33J,IAAA,yBAAA22J,WAAA,EACA,KAMA,CACA,IAAAr1N,WAAA,CACA,YAAAmkI,UAAA,CAEA,IAAAiyF,YAAA,CACA,YAAAjB,WAAA,CAEA,IAAAvwM,YAAA,CACA,YAAAywM,WAAA,CAEA,MAAAhP,aAAA,CAGA,KAAAzhM,UAAA,GAAAgyL,EAAAyf,SAAA,EACA,WAAA5gG,OAAA,EAEA,CACA,MAAAA,SAAA,CACA,QA0BAz1H,EAzBA,QAAAomN,SAAA,OAAAgQ,UAAA,CACA,OACA,QAAAxxM,UAAA,GAAAgyL,EAAA0e,QAAA,EAGA,IAAA7rN,EAAAsyC,mBAAAvvC,OAAAgX,QAAA,CAAAotM,IAAA,EACA/6L,EAAAkmB,mBAAAvvC,OAAAgX,QAAA,CAAA8uC,MAAA,CACA9lD,CAAAA,OAAAgX,QAAA,CAAAotM,IAAA,kCAAAnnN,EAAA,OAAAosB,EAAA,EACA,MACA,IACA,KAAAjR,UAA0B,GAAAgyL,EAAmByf,SAAA,CAC7C,UAAA/Q,EAAA,CACA,KAAA6P,WAAA,IAEA,IAAA/rN,EAAAoD,OAAAu2N,OAAA,EAAAviB,QAAAh0M,OAAAg0M,MAAA,CACA,IAAAp3M,EAAA65N,WAAA,CACA,IACA,MAAA75N,EAAAqsH,OAAA,EACA,CACA,MAAApxH,EAA8B,CAC9B,UAAAohN,GAAAphN,GAAA7D,QAAA6D,EAAA,CAEA,GACA,CAAA+E,EAAApJ,SAA0B,CAC1B,UAAA4lN,EAAA,CAEA,IACA5lN,EAAA,IAAA0/F,GAAAziF,SAAA,CAAA7T,EAAApJ,SAAA,CAAAwnD,OAAA,GACA,CACA,MAAAnjD,EAA0B,CAC1B,UAAAwhN,GAAAxhN,GAAA7D,QAAA6D,EAAA,CAEA+E,EAAA6yD,EAAA,mBAAA0mK,aAAA,EACAv5N,EAAA6yD,EAAA,uBAAA4mK,eAAA,EACA,KAAAD,OAAA,CAAAx5N,EACA,KAAA+6H,UAAA,CAAAnkI,EACA,KAAA0+D,IAAA,WAAA1+D,EACA,CACA,MAAAqE,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,QAEA,CACA,KAAA8wN,WAAA,GACA,CACA,CACA,MAAA6B,YAAA,CACA,IAAA5tN,EAAA,KAAAw5N,OAAA,CACA,GAAAx5N,EAAA,CACAA,EAAA0yK,GAAA,mBAAA6mD,aAAA,EACAv5N,EAAA0yK,GAAA,uBAAA+mD,eAAA,EACA,KAAAD,OAAA,MACA,KAAAz+F,UAAA,MACA,IACA,MAAA/6H,EAAA4tN,UAAA,EACA,CACA,MAAA3yN,EAAA,CACA,KAAAq6D,IAAA,aAAAinJ,GAAAthN,GAAA7D,QAAA6D,GACA,CACA,KACA,CAAAq6D,IAAA,cACA,CACA,MAAA9S,gBAAAnlD,CAAA,CAAAV,CAAA,CAAAtD,EAAA,IACA,IACA,IAAA2G,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,GAAoB,CAAAp/M,QAAAA,CAAA,IAAAsF,EAAsB,CAAAvJ,EAC1C/C,GAAA+G,GACAC,GAAArH,QAAAoH,EAAAI,IAAA,CAAAH,IAGAD,EAAA,WAAA6/M,kBAAA,CAAA7/M,EAAAV,EAAAiG,GACAtF,GAAArH,QAAAoH,EAAA2D,WAAA,IAAA1D,IAEAsF,EAAwBzC,mBAAY,CAAAyC,EAAAzC,mBAAA,EAAAxD,EAAAG,UAAA,CACpC,IAAA0E,UAAAA,CAAA,QAAAxB,EAAAuvN,sBAAA,CAAAlyN,EAAAuF,GACA,OAAApB,CACA,CACA,MAAAvG,EAAA,CACA,GAAAA,aAAAghN,GACA,MAA0BhhN,CAAA,OAC1B,IAAA0hN,GAAA1hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAgG,gBAAA5D,CAAA,EACA,IACA,IAAA2C,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,aAAA18M,EAAAiB,eAAA,CAAA5D,IAAAA,CACA,CACA,MAAApC,EAA0B,CAC1B,UAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAoH,oBAAA6/C,CAAA,EACA,IACA,IAAAliD,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,aAAA18M,EAAAqC,mBAAA,CAAA6/C,IAAAA,CACA,CACA,MAAAjnD,EAA0B,CAC1B,UAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAyzN,YAAAt3N,CAAA,EACA,IACA,IAAA4I,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,IAAAl7M,UAAAA,CAAA,QAAAxB,EAAA0uN,WAAA,CAAAt3N,GACA,OAAAoK,CACA,CACA,MAAAvG,EAA0B,CAC1B,UAAA4hN,GAAA5hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,CC9NA,IAAA6+N,GAAA,SAAArnC,CAAA,CAAAzyI,CAAA,CAAAvoD,CAAA,CAAAizD,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,4FACA,YAAA/nI,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,EAAAh7L,GAAAwqC,EAAAA,EAAAxqC,KAAA,CAAAA,EAAAuoD,EAAA5lD,GAAA,CAAAq4L,EAAAh7L,EAAA,CAAAA,CAAA,EAEAsiO,GAAA,SAAAtnC,CAAA,CAAAzyI,CAAA,CAAA0K,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,6FACA,MAAA/nI,MAAAA,EAAAzoB,EAAAyoB,MAAAA,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,GAAAxwJ,EAAAA,EAAAxqC,KAAA,CAAAuoD,EAAAloC,GAAA,CAAA26K,EAAA,EAmBA,SAAAunC,GAAwBh6N,CAAA,EACxB,IAAAsY,EAAA,EAAA48L,SAAAA,CAAA,IAAAA,EAAAl1M,GACA,IACAoD,OAAAg1M,aAAA,KAAA6hB,GAAA3hN,GACA,CACA,MAAArd,EAAA,CACA8D,QAAA9D,KAAA,mEAAAA,EACA,CACA,IACAmI,OAAAkY,gBAAA,+BAAA01M,OAAAD,CAAA,IAAAz4M,EAAAy4M,GACA,CACA,MAAA91N,EAAA,CACA8D,QAAA9D,KAAA,iEAAAA,EACA,CACA,CACA,MAAAg/N,WAAA5hB,MACArhN,YAAAshB,CAAA,EACA,yCACA84M,QAAA,GACAC,WAAA,GACSC,SAAA,EACT,GACQniB,EAAA/0M,GAAsB,cAC9B0/N,GAAA,KAAA3qB,EAAA72L,EAAA,IACA,CACA,IAAA04M,QAAe,CACf,OAAA+I,GAAA,KAAA5qB,EAAA,IACA,CACA,IAAAx3M,MAAA,CACA,uCACA,CAEA45N,gBAAA,CACA,+CAGAC,0BAAA,CACA,yDAGAC,iBAAA,CACA,gDAEA,CACAtiB,EAAA,IAAAplL,QCvEA,IAAAwO,GAAA,qjKCDA,IAAA2hM,GAAA,SAAAznC,CAAA,CAAAzyI,CAAA,CAAA0K,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,6FACA,MAAA/nI,MAAAA,EAAAzoB,EAAAyoB,MAAAA,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,GAAAxwJ,EAAAA,EAAAxqC,KAAA,CAAAuoD,EAAAloC,GAAA,CAAA26K,EAAA,EAEA0nC,GAAA,SAAA1nC,CAAA,CAAAzyI,CAAA,CAAAvoD,CAAA,CAAAizD,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,4FACA,YAAA/nI,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,EAAAh7L,GAAAwqC,EAAAA,EAAAxqC,KAAA,CAAAA,EAAAuoD,EAAA5lD,GAAA,CAAAq4L,EAAAh7L,EAAA,CAAAA,CAAA,CAQA,OAAA2iO,GACApjO,aAAA,CACAo4M,EAAA90M,GAAA,OACA+0M,EAAAj1M,GAAA,UACAk1M,EAAAl1M,GAAA,eACAm1M,EAAAn1M,GAAA,MAA+C,YAC/Co1M,EAAAp1M,GAAA,MAAAm+B,IACAk3K,EAAAr1M,GAAA,YACAs1M,EAAYt1M,GAAA,CAAsB,MAAAoxE,EAAAjW,KAClC2kK,GAAyB,KAAA7qB,EAAsB,KAAA7jI,EAAA,EAAAj3E,KAAAghE,IAAA2kK,CAAAA,GAAA,KAAA7qB,EAAA,KAAA7jI,EAAA,EAAAjW,EAAA,EACtC,IAAA2kK,GAAA,KAAA9qB,EAAA,IAAAQ,GAAAlsM,IAAA,MAAA8nE,EAAAjW,KAETs6I,EAAiBz1M,GAAA,CAAsB,eACvC,IAAA8/N,GAAA,KAAAzqB,EAAA,MACA,IAAA4qB,EACA,IACAA,EAAA,OAAA3lO,EAAA0H,CAAA,MAAA4b,IAAA,CAAAtjB,EAAAid,IAAA,CAAAjd,EAAA,QAAAmnB,OAAA,CAEA,MAAA5gB,EAAA,CACA,oDAEgBk/N,GAAsB,KAAA1qB,EAAA,IAAA4qB,EAAA,KACtCH,GAAA,KAAAzqB,EAAA,KAAA58I,EAAA,sBAAAqnK,GAAA,KAAA9qB,EAAA,IAAAO,GAAAjsM,IAAA,eAAAqkC,GACA,QACA,KAAsB9qC,QAAA,CAAAhH,MAAA,EACtB,MAAAikO,GAAA,KAAAzqB,EAAA,KAAApjF,OAAA,GAES,CAAApvH,SAAA,KAAAA,QAAA,CACT,GACA6yM,EAAiB11M,GAAsB,gBACvC8/N,GAAA,KAAAzqB,EAAA,MAES,MAAAyqB,GAAA,KAAAzqB,EAAA,KAAAme,UAAA,EACT,GACA7d,EAAuC31M,GAAA,eAAAmiE,IAAA,CACvC,IAAA29J,GAA0B,IAAuB,CAAAzqB,EAAA,KACjD,UAAyBiN,EAAsB,CACtC,aAAAwd,GAAA,KAAAzqB,EAAA,KAAA6qB,8BAAA,IAAA/9J,EACT,GACAyzI,EAAuC51M,GAAA,eAAAmiE,IAAA,CACvC,IAAA29J,GAA0B,IAAuB,CAAAzqB,EAAA,KACjD,UAAyBiN,EAAsB,CACtC,aAAAwd,GAAA,KAAAzqB,EAAA,KAAA8qB,uBAAA,IAAAh+J,EACT,GACA0zI,EAAuC71M,GAAA,eAAAmiE,IAAA,CACvC,IAAA29J,GAA0B,IAAuB,CAAAzqB,EAAA,KACjD,UAAyBiN,EAAsB,CACtC,aAAAwd,GAAA,KAAAzqB,EAAA,KAAA+qB,mBAAA,IAAAj+J,EACT,EACA,CACA,IAAA/E,SAAe,CACf,OAAA0iK,GAAA,KAAA5qB,EAAA,IACA,CACA,IAAAt3M,MAAe,CACf,OAAAkiO,GAAA,KAAA3qB,EAAA,IACA,CACA,IAAAh3K,MAAe,CACf,OAAA2hM,GAAA,KAAA1qB,EAAA,IACA,CACA,IAAAmhB,QAAgB,CAChB,OAAAd,GAAAC,GAAAC,GAAA,CAEA,IAAA/7J,UAAA,CACA,MAAa,CACb,CAAAw7J,GAAA,EACAh4J,QAAyB,QACZ60D,QAAA6tG,GAAA,KAAArqB,EAAA,IACb,EACA,CAAAugB,GAAA,EACA54J,QAAA,QACao2J,WAAAsM,GAAA,KAAApqB,EAAA,IACb,EACA,CAAA2f,GAAA,EACAj4J,QAAoB,QACP3E,GAAAqnK,GAAA,KAAAxqB,EAAA,IACb,EACA,CAAA6f,GAAA/nK,CAAA,GACAgQ,QAAA,QACAsmJ,6BAAwC,aAC3ByR,uBAAA2K,GAAA,KAAAnqB,EAAA,IACb,EACA,CAAA9uM,GAAAimD,CAAA,GACAsQ,QAAA,QACAsmJ,6BAAiC,aACpB78M,gBAAAi5N,GAAA,KAAAlqB,EAAA,IACb,EACA,CAAA0e,GAAArrN,CAAA,GACAm0D,QAAA,QACak3J,YAAAwL,GAAA,KAAAjqB,EAAA,IACb,CACA,CACA,CACA,IAAAhzM,UAAe,CACf,OAAAi9N,GAAA,KAAAzqB,EAAA,KAAAyqB,GAAA,KAAAzqB,EAAA,KAAAgrB,gBAAA,IAEA,CACAprB,EAAA,IAAAtlL,QAAAulL,EAAA,IAAAvlL,QAAAwlL,EAAA,IAAAxlL,QAAAylL,EAAA,IAAAzlL,QAAA0lL,EAAA,IAAA1lL,QAAA2lL,EAAA,IAAA3lL,QAAA8lL,EAAA,IAAA9lL,QAAA+lL,EAAA,IAAA/lL,QAAAgmL,EAAA,IAAAhmL,QAAAimL,EAAA,IAAAjmL,QAAAkmL,EAAA,IAAAlmL,QAAAqlL,EAAA,IAAA1Z,QAAAia,EAAA,SAAAnkI,CAAA,IAAAjtE,CAAA,EAEC27N,GAAA,KAAA7qB,EAAA,KAAA7jI,EAAA,EAAAtpE,QAAA,GAAAqzD,EAAAz/D,KAAA,MAAAyI,GACD,EAAAqxM,EAA0B,SAAApkI,CAAA,CAAAjW,CAAA,CAAwD,CAClF2kK,GAAA,KAAA7qB,EAAA,KAAA7jI,EAAA,CAAA0uJ,GAAA,KAAA7qB,EAAA,KAAA7jI,EAAA,EAAAnsD,OAAA,GAAAk2C,IAAA47J,EACA,ECpHA,IAAAuJ,GAAiB,GACjB,SAAQC,IAAU,CAClBD,KAEIV,GAAA,IAAUI,IACdM,GAAA,GACA,CAEA,eAAAE,IAAA,CACA,IAAAv7N,EAAA,2BACA,SAAAw7N,GAAA,CACAz3N,OAAAy3N,WAAA,EACAnoL,OAAA,yBACAj8C,KAAA,CACAuB,KAAA,oBACAvB,KAAA,CACA4I,GAAAA,EACAD,QAAA,MACiBsZ,OAAA,iBACJ,CACJ,CACT,EAAAtV,OAAAgX,QAAA,CAAA8uC,MAAA,CACA,CACA,SAAA4xK,EAAAtvJ,CAAA,EACA,IAAAp0E,EAAAo0E,EAAA/0E,IAAA,CACAW,GAAAs7C,SAAA,mBAAAt7C,EAAAX,IAAA,EAAAuB,OAAA,sBACAZ,EAAAX,IAAA,CAAAA,IAAA,EAAA4I,KAAAA,GACA+D,OAAAqY,mBAAA,WAAAq/M,GACoB1jO,EAAAX,IAAA,CAAAA,IAAQ,CAAAwE,KAAA,EAC5B0/N,MAIAE,IAGA,CACAz3N,OAAAkY,gBAAA,WAAAw/M,GACA13N,OAAAi1E,UAAA,KAAAj1E,OAAAqY,mBAAA,WAAAq/M,GAAA,KACAD,GACA,CCvCO,IAAAE,GAAA,UACP,OAAAC,WAA2Bhd,GAC3BhnN,YAAAiH,EAAA,IACA,QACA,KAAAjG,IAAA,CAAA+iO,GACA,KAAA16N,GAAA,wBACA,KAAAk4B,IAAA,ssGACA,KAAAulL,4BAAA,KAAAzjN,IAAA,cACA,KAAA4xN,WAAc,qBAAA7oN,QAA4B,oBAAAwf,SAC5B4qL,EAAA2e,WAAyB,CACvC3e,EAAA0e,QAAA,CACA,KAAAqN,aAAA,MACA,IAAAv5N,EAAA,KAAAw5N,OAAA,CACAx5N,IACAA,EAAA0yK,GAAA,mBAAA6mD,aAAA,EACA,KAAAC,OAAA,MACA,KAAAz+F,UAAA,MACA,KAAAzlE,IAAA,aAAAgnJ,IACA,KAAAhnJ,IAAA,eAEA,EACA,KAAAmkK,eAAA,KACA,IAAAC,EACA,OACA,IAAA9iO,EAAA,KAAAmkI,UAAA,CACA,GAAAnkI,GAEA,IACA8iO,EAAA,IAAApjI,GAAAziF,SAAA,CAAA6lN,EAAAt7K,OAAA,GACA,CACA,MAAAnjD,EAAA,CACA,KAAAq6D,IAAA,aAAAmnJ,GAAAxhN,GAAA7D,QAAA6D,IACA,MACA,CACArE,EAAAsjD,MAAA,CAAAw/K,KAEA,KAAA3+F,UAAA,CAAA2+F,EACA,KAAApkK,IAAA,WAAAokK,IAXA,EAaA,KAAA3N,WAAA,IACA,KAAAhxF,UAAA,MACA,KAAAy+F,OAAA,MACA,KAAAyB,OAAA,CAAAh9N,EACY,KAAAguN,WAAA,GAAAze,EAA6B2e,WAAA,GACzChP,GAAA,IACA,CAAA/5M,EAAAA,OAAA83N,QAAA,EAAAC,cAAuC/3N,OAAAg4N,WAA0B,IACjE,KAAAnP,WAAA,CAAAze,EAAAyf,SAAA,CACA,KAAA33J,IAAA,yBAAA22J,WAAA,EACA,KAIA2O,KAEA,CACA,IAAAhkO,WAAA,CACA,YAAAmkI,UAAA,CAEA,IAAAiyF,YAAA,CACA,YAAAjB,WAAA,CAEA,IAAA/O,WAAA,CACA,aAAAwc,OAAA,EAAAxc,SACA,CACA,IAAAxhM,YAAA,CACA,YAAAywM,WAAA,CAEA,MAAAhP,aAAA,CAGA,KAAAzhM,UAAA,GAAAgyL,EAAA0e,QAAA,EAAA1O,MACA,WAAAnxF,OAAA,EAEA,CACA,MAAAA,SAAA,CACA,QAaAgvG,EAOAr7N,EAkBApJ,EArCA,QAAAomN,SAAA,OAAAgQ,UAAA,CACA,OACA,QAAAf,WAA0B,GAAAze,EAAmB0e,QAAA,OAAAD,WAAA,GAAAze,EAAAyf,SAAA,CAC7C,UAAA/Q,EAAA,CAGA,QAAA1gM,UAAA,GAAAgyL,EAAA0e,QAAA,EAAA1O,KAAA,CACA,IAAAn9M,EAAAsyC,mBAAAvvC,OAAAgX,QAAA,CAAAotM,IAAA,EACA/6L,EAAAkmB,mBAAAvvC,OAAAgX,QAAA,CAAA8uC,MAAA,CACA9lD,CAAAA,OAAAgX,QAAA,CAAAotM,IAAA,sCAAAnnN,EAAA,OAAAosB,EAAA,EACA,MACA,IAEA,CACA4uM,EAAA,OAAA3mO,EAAA0H,CAAA,MAAA4b,IAAA,CAAAtjB,EAAAid,IAAA,CAAAjd,EAAA,OAAAmnB,OAAA,CAEA,MAAA5gB,EAA0B,CAC1B,UAAAkhN,GAAAlhN,GAAA7D,QAAA6D,EAAA,CAGA,IACA+E,EAAA,IAAAq7N,EAAA,CAAAp/I,QAAA,KAAAg/I,OAAA,CAAAh/I,OAAA,EACA,CACA,MAAAhhF,EAA0B,CAC1B,UAAAmhN,GAAAnhN,GAAA7D,QAAA6D,EAAA,CAGA,GADA,KAAA8wN,WAAA,IACA,CAAA/rN,EAAAg9M,SAAA,CACA,IACA,MAAAh9M,EAAAqsH,OAAA,EACA,CACA,MAAApxH,EAA8B,CAC9B,UAAAohN,GAAAphN,GAAA7D,QAAA6D,EAAA,CAEA,GACA,CAAA+E,EAAApJ,SAA0B,CAC1B,UAAAylN,EAAA,CAEA,IACAzlN,EAAA,IAAA0/F,GAAAziF,SAAA,CAAA7T,EAAApJ,SAAA,CAAAwnD,OAAA,GACA,CACA,MAAAnjD,EAA0B,CAC1B,UAAAwhN,GAAAxhN,GAAA7D,QAAA6D,EAAA,CAEA+E,EAAA6yD,EAAA,mBAAA0mK,aAAA,EACAv5N,EAAA6yD,EAAA,uBAAA4mK,eAAA,EACA,KAAAD,OAAA,CAAAx5N,EACA,KAAA+6H,UAAA,CAAAnkI,EACA,KAAA0+D,IAAA,WAAA1+D,EACA,CACA,MAAAqE,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,QAEA,CACA,KAAA8wN,WAAA,GACA,CACA,CACA,MAAA6B,YAAA,CACA,IAAA5tN,EAAA,KAAAw5N,OAAA,CACA,GAAAx5N,EAAA,CACAA,EAAA0yK,GAAA,mBAAA6mD,aAAA,EACAv5N,EAAA0yK,GAAA,uBAAA+mD,eAAA,EACA,KAAAD,OAAA,MACA,KAAAz+F,UAAA,MACA,IACA,MAAA/6H,EAAA4tN,UAAA,EACA,CACA,MAAA3yN,EAAA,CACA,KAAAq6D,IAAA,aAAAinJ,GAAAthN,GAAA7D,QAAA6D,GACA,CACA,KACA,CAAAq6D,IAAA,cACA,CACA,MAAA9S,gBAAAnlD,CAAA,CAAAV,CAAA,CAAAtD,EAAA,IACA,IACA,IAAA2G,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,GAAoB,CAAAp/M,QAAAA,CAAA,IAAAsF,EAAsB,CAAAvJ,EAS1C,OARA/C,GAAA+G,GACAC,GAAArH,QAAAoH,EAAAI,IAAA,CAAAH,IAGAD,EAAA,WAAA6/M,kBAAA,CAAA7/M,EAAAV,EAAAiG,GACAtF,GAAArH,QAAAoH,EAAA2D,WAAA,IAAA1D,IAEAsF,EAAAzC,mBAAA,CAAAyC,EAAAzC,mBAAA,EAAAxD,EAAAG,UAAA,CACA,MAAAkD,EAAAuvN,sBAAA,CAAAlyN,EAAAuF,EACA,CACA,MAAA3H,EAAA,CACA,GAAAA,aAAAghN,GACA,MAA0BhhN,CAAA,OAC1B,IAAA0hN,GAAA1hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAgG,gBAAA5D,CAAA,EACA,IACA,IAAA2C,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,aAAA18M,EAAAiB,eAAA,CAAA5D,IAAAA,CACA,CACA,MAAApC,EAA0B,CAC1B,UAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAoH,oBAAA6/C,CAAA,EACA,IACA,IAAAliD,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,aAAA18M,EAAAqC,mBAAA,CAAA6/C,IAAAA,CACA,CACA,MAAAjnD,EAA0B,CAC1B,UAAA2hN,GAAA3hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,MAAAyzN,YAAAt3N,CAAA,EACA,IACA,IAAA4I,EAAA,KAAAw5N,OAAA,CACA,IAAAx5N,EACA,UAAA08M,EAAA,CACA,IACA,aAAA18M,EAAA0uN,WAAA,CAAAt3N,EAAA,OACA,CACA,MAAA6D,EAA0B,CAC1B,UAAA4hN,GAAA5hN,GAAA7D,QAAA6D,EAAA,CAEA,CACA,MAAAA,EAAA,CAEA,MADA,KAAAq6D,IAAA,SAAAr6D,GACAA,CAAA,CAEA,CACA,CCxN6C,IAAAqgO,GAAL,IACtC,IAAM70M,SAAAA,CAAA,CAAU,CAAAy0L,EAEhBj/H,EAAAsxH,EAAAvwH,MAAA,CACwD2F,EAAA,GAAAutH,EAAA6E,OAAA,SAAAz+G,GAAA8Y,aAAA,EAAAnzB,GAAA,CAAQA,EAEhE,EACQoxH,EACE,GAAA6C,EAAA6E,OAAoB,OACxB,IAAIskB,GAER,IAAA2B,GAAC,EAAQ/+I,EAGX,EACqB,MAAW,GAAAznD,EAAAM,GAAA,EAAAknL,GAAA,CAAAr5H,SAC5BA,EAAel8D,SAAU,GAAA+N,EAAAM,GAAA,EAAA8/L,GAAA,CAASvnB,QAAAA,EAAW4P,YAC3C,GAAoBx2L,SACjB,GAAA+N,EAAAM,GAAA,EAAAokM,GAAA,CAAAzyM,SAAAA,CAAA,IAKX,EAEA,EAAuB,IAAAzmB,GAAAs7N,GAAAC,GAAA7mO,EAAA,MCtCvB,IAAA8mO,GAAA,oBAAA54M,SAIE64M,GAAA,KAGA,IAAI93M,EAAW,GACb63M,GAA8B,CAG9B,IAAAE,EAAiB94M,SAAAiL,aAAA,yCAClBlK,EAAA+3M,MAAAA,EAAAA,EAAA5iO,KAAAA,CAAA,CAED,MAAqB,GAAKyiO,GAAA99M,CAAA,GAAa/lB,IAAA,YAAemsB,QAAA,GAAeF,eAAAA,CACvE,EAE6B,ECYdg4M,GAAkCF,KAAA,SAC/CnuB,GAAQ7yM,CAAA,CAAS,CACjB,GAAM,CAAAi5M,UAAAA,CAAA,CAAckoB,aAAAA,EAAAD,EAAkB,CAAAE,UAAAA,CAAiB,EAAAphO,EAEvDqhO,EAAA,CACE,EAAA5rB,EAAA6E,OAAA,MAAC,IAAAmC,GAAA6kB,WAAe,WAAM,GAAAvnM,EAAAM,GAAA,EAAA+gL,GAAA,CAAA98L,KAAA,OACN0N,SAAQ,GAAA+N,EAAAqmL,IAAA,EAAA9B,GAAAlyJ,CAAA,EAAApvD,MAAAmkO,EAAAn1M,SAAA,CACf,GAAA+N,EAAAqmL,IAAA,EAAA9D,KAAA,CAAAtwL,SAAA,CACI,GAAA+N,EAAAM,GAAA,WAAArO,SAAA,YAEA,GAAA+N,EAAAM,GAAA,UACL98B,KAAA,WAAQgkO,QAAA,6EAGiB,GAAAxnM,EAAAM,GAAA,EAAAoiL,GAAA+kB,mBAAA,EAAAtpF,OAAAmpF,EACnBr1M,SAAkB,GAAA+N,EAAeM,GAAA,EAAAoiL,GAAAglB,OAAA,EAAAl8K,MAAA67K,EACvCM,eAAA,CAAc11M,SACZ,GAAA+N,EAAAM,GAAA,EAAAqL,GAAC,CAAc1Z,SAAA,GAAA+N,EAAAqmL,IAAA,EAAA76M,GAAA,CAAAymB,SAAA,CAEX,GAAA+N,EAAAM,GAAA,EAAAsiL,GAACxvJ,CAAA,EAAAnhC,SAAuB,GAAA+N,EAAAM,GAAA,EAAA4+K,EAAA,IAAAmoB,CAAA,KAEN,GAAArnM,EAAoBM,GAAA,EAAAqiL,GAAAilB,kBAAA,EAAAC,cAAA,gBAQvD,EAED,CAAkB/uB,GAChB5jK,SAAW,EACXgqK,UAAA,KAAc4oB,WAAgB,CAAAC,UAAA,CAC9BX,aAAW,KAAA9qL,MAAA,CACb+qL,UAAA,KAAA/qL,MAAA,CAAAyrL,UAAA,iBAAA/nO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAquF,CAAA,sBAAA05I,CAAA,QAAAhoM,EAAA9/B,EAAA,MAAAw7M,EAAAx7M,EAAA,MCsfsC,IACpC0mE,EAAA,CACA5D,QAAM,QACNx/D,KAAA,qBAAcu8C,aACZ,EAEEv8C,KAAM,iBAAAykO,KACJ,CACA,sBACA,GACA,8GACA,GACA,6BACA,+CACA,mDACA,kFACA,GACA,gHACA,qGACA,GACA,gBACA,2EACA,wHACA,+FACD,wFACD,CAAUx/N,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuB,uBAC9B,CAAKzkK,IACH,CAAOrf,MACL,EAEE+R,KAAM,QACN/yD,KAAA,SACFF,MAAA,mBACA,GAEEizD,KAAM,UACN/yD,KAAA,YACAuF,QAAM,OACR5F,KAAA,MACA,GAEEozD,KAAM,MACN/yD,KAAM,MACRL,KAAA,SACD,EACH,CAEF,GAEEU,KAAA,mBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAkC,kCAC3C,EACA,CAEEzkO,KAAA,OACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA0B,0BACnC,EACA,CAEEzkO,KAAA,aACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAc,cACvB,EACA,CAEEzkO,KAAA,QACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KACJ,CACA,yFACD,yEACH,EACA,CAEEzkO,KAAA,gBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAwB,wBACjC,EACA,CAEEzkO,KAAA,yBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAkC,kCAC3C,EACA,CAEEzkO,KAAA,eACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuB,uBAChC,EAEF,CAAMl+N,KACJ,EAEEvG,KAAM,UACRL,KAAA,KACA,GAEEK,KAAM,OAAAL,KACJ,CAAOhC,MAAC,CAAM,KAAG,GACnB,CAEF,GAEEqC,KAAM,gBACRL,KAAA,KACA,GAEEK,KAAM,cACRL,KAAA,KACA,GAEEK,KAAM,UACRL,KAAA,KACA,GAEEK,KAAM,QACRL,KAAA,KACD,EACH,EACA,CAEEK,KAAA,WAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAmB,mBAC1B,CAAKzkK,IACH,CAAOrf,MACL,EAEE+R,KAAM,QACN/yD,KAAA,SACFF,MAAA,aACA,GAEEizD,KAAM,UACN/yD,KAAM,YACRL,KAAA,UACA,GAEEozD,KAAM,UACN/yD,KAAA,YACAuF,QAAM,oBACR5F,KAAA,aACD,EACH,CAEF,GAEEU,KAAA,OACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuD,uDAChE,EACA,CAEEzkO,KAAA,KACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAyC,yCAClD,EACA,CAEEzkO,KAAA,WACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA8B,8BACvC,EACA,CAEEzkO,KAAA,eACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuB,uBAChC,EACA,CAEEzkO,KAAA,gBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAwB,wBACjC,EAEF,CAAMl+N,KACJ,EAEEvG,KAAM,QACRL,KAAA,KACA,GAEEK,KAAM,SACRL,KAAA,KACA,GAEEK,KAAM,QAAAL,KACJ,CAAKooB,IACH,CAAOpqB,MAAC,CAAM,KAAG,GACnB,CAEJ,CACD,EACH,EACA,CAEEqC,KAAA,WAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,OACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuD,uDAChE,EACA,CAEEzkO,KAAA,KACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA8B,8BACvC,EACA,CAEEzkO,KAAA,WACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAoB,mBAAiC,iCAC9D,EACA,CAEEzkO,KAAA,gBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAwB,wBACjC,EACA,CAEEzkO,KAAA,eACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuB,uBAChC,EAEF,CAAMl+N,KACJ,EAEEvG,KAAM,SACRL,KAAA,KACD,EACH,EACA,CAEEK,KAAA,sBAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,qBACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAuB,uBAChC,EACA,CAEEzkO,KAAA,QACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAe,eACxB,EAEF,CACFl+N,KAAA,IACA,CAEEvG,KAAA,WAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,QACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAe,eACxB,EACA,CAEEzkO,KAAA,WACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAoB,oBAC7B,EAEF,CACFl+N,KAAA,IACA,CAEEvG,KAAA,eAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,QACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAe,eACxB,EAEF,CAAMl+N,KACJ,EAEEvG,KAAM,UACRL,KAAA,KACA,GAEEK,KAAM,QACRL,KAAA,KACD,EACH,EACA,CAEEK,KAAA,gBAAUiF,SACR,EAEEjF,KAAA,cACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAA2B,2BACpC,EACA,CAEEzkO,KAAA,QACAy8D,MAAA,GACA9Y,SAAM,GAAA8gL,KAAC,CAAe,eACxB,EAEF,CAAMl+N,KACJ,EAEEvG,KAAM,OAAAL,KACJ,CAAOhC,MAAC,CAAM,KAAG,GACnB,CAEH,EACH,EAEF,CAAUsH,SACR,EAEEjF,KAAM,cAAAykO,KAAC,CAAsD,sDAC7D,CAAM9kO,KACJ,CACA+yD,KAAA,SAAQx6C,OACN,EAEElY,KAAM,YAAAykO,KAAC,CAAyC,yCAChD,CACF9kO,KAAA,MACA,GAEEK,KAAM,WAAAykO,KAAC,CAAqC,qCAC5C,CACF9kO,KAAA,WACA,GAEEK,KAAM,YAAAykO,KAAC,CAAgC,gCACvC,CACF9kO,KAAA,KACA,GAEEK,KAAM,SAAAykO,KAAC,CAA4B,4BACnC,CACF9kO,KAAA,KACD,EACH,CAEF,GAEEK,KAAM,oBAAAykO,KAAC,CAAkD,kDACzD,CAAM9kO,KACJ,CACA+yD,KAAA,SAAQx6C,OACN,EAEElY,KAAM,OAAAykO,KAAC,CAAa,aACpB,CACF9kO,KAAA,IACA,GAEEK,KAAM,UAAAykO,KAAC,CAAyB,yBAChC,CACF9kO,KAAA,KACA,GAEEK,KAAM,OAAAykO,KAAC,CAA2B,2BAClC,CAAM9kO,KACJ,CAAOhC,MAAC,CAAM,KAAG,GACnB,CAEF,GAEEqC,KAAM,OAAAykO,KAAC,CAAyC,yCAChD,CACF9kO,KAAA,WACA,GAEEK,KAAM,aAAAykO,KAAC,CAA6B,6BACpC,CACF9kO,KAAA,WACA,GAEEK,KAAM,gBAAAykO,KACJ,CACD,mFACD,CACF9kO,KAAA,KACA,GAEEK,KAAM,cAAAykO,KAAC,CAAkD,kDACzD,CACF9kO,KAAA,KACA,GAEEK,KAAM,qBAAAykO,KAAC,CAAiD,iDACxD,CACF9kO,KAAA,KACA,GAEEK,KAAM,kBAAAykO,KAAC,CAA0C,0CACjD,CACF9kO,KAAA,KACA,GAEEK,KAAM,UAAAykO,KAAC,CAAoC,oCAC3C,CACF9kO,KAAA,KACA,GAEEK,KAAM,QAAAykO,KAAC,CAAkC,kCACzC,CACF9kO,KAAA,KACA,GAEEK,KAAM,mBAAAykO,KAAC,CAAoB,oBAC3B,CACF9kO,KAAA,WACA,GAEEK,KAAM,QAAAykO,KAAC,CAAe,eACtB,CACF9kO,KAAA,WACD,EACH,CAEH,EACD,CAAQu0D,OACN,EAEEl0D,KAAA,gBAAQkY,OACN,EAEElY,KAAM,WACNL,KAAA,YACFvB,MAAA,EACA,GAEE4B,KAAM,YACNL,KAAA,MACFvB,MAAA,EACD,EACH,EACA,CAEE4B,KAAA,eAAQkY,OACN,EAEElY,KAAM,WACNL,KAAA,YACFvB,MAAA,EACA,GAEE4B,KAAM,SACNL,KAAA,MACFvB,MAAA,EACD,EACH,EAEF,CAAQwwD,OACN,EAEEtnD,KAAM,IACNtH,KAAK,eACPT,IAAA,sBACA,GAEE+H,KAAM,KACNtH,KAAK,mBACPT,IAAA,+BACA,GAEE+H,KAAM,KACNtH,KAAK,mBACPT,IAAA,6BACA,GAEE+H,KAAM,KACNtH,KAAK,eACPT,IAAA,uDACA,GAEE+H,KAAM,KACNtH,KAAK,gBACPT,IAAA,kDACA,GAEE+H,KAAM,KACNtH,KAAK,uBACPT,IAAA,8CACA,GAEE+H,KAAM,KACNtH,KAAK,YACPT,IAAA,iCACA,GAEE+H,KAAM,KACNtH,KAAK,eACPT,IAAA,sBACA,GAEE+H,KAAM,KACNtH,KAAK,kBACPT,IAAA,uCACA,GAEE+H,KAAM,KACNtH,KAAK,yBACPT,IAAA,+CACA,GAEE+H,KAAM,KACNtH,KAAK,wBACPT,IAAA,kCACA,GAEE+H,KAAM,KACNtH,KAAK,6BACPT,IAAA,8BACA,GAEE+H,KAAM,KACNtH,KAAK,6BACPT,IAAA,8BACD,EACD,MAAAoyH,EAAAj1H,EAAA,MAAAgoO,EAAAhoO,EAAA,MAAAioO,EAAAjoO,EAAA,MAAAiP,EAAAjP,EAAA,MAAAy+N,EAAAz+N,EAAA,MAAA4hG,EAAA5hG,EAAA,MCplC2B,IAC3BkoO,EAAgB,CAChBjgO,WAAU,IAAI,CACdmlD,SAAS,IAAI,CACbyH,QAAS,KACTr0D,IAAA,KACA2nO,kBAAmB,KACnB9zH,cAAA,IAAmBzS,EAAAziF,SAAA,qCACnBipN,kBAAiB,EACjB9gK,YAAW,IAAI,CACfplE,UAAW,KACXomN,UAAS,GACT,MAAA3wF,SAAY,GACd,MAAAuhG,YAAA,EAEA,EAKamP,EAAkE7sB,EAAA9jL,aAAA,CAAAwwM,GAAA95I,EAAL,QA2CxEk6I,EA1CA,IAAMv2M,SAAAA,CACJ,CAAO,CACPy0L,EAMI,CAAA7uF,QAAAA,CAAA,CAAAuhG,WAAAA,CAAiB,CAAA5Q,UAAAA,CAAA,CAAApmN,UAAAqmO,CAAgB,CAAAh8N,gBAAAA,CAAA,CAAAoB,oBAAAA,CAAA,KAAA8wN,EAAAhmM,CAAA,IACjC+vM,EAAgB5mI,EAAIh5E,OAAA,CAAAs6D,QAAW,GAC/BulJ,EAAY,IAAAT,EAAgBj/M,CAAA,CAAQy/M,GAGpC,CAAAtmO,EAAAm9N,EAAgB,IAAA7jB,EAAA4C,QAAA,EAAAoqB,EAAAtmO,SAAA,EACjBwmO,EAAe,oGAClB,CAAAA,EACD,gEAED,IAAMzgO,EAAW,IAAA25F,EAAe2V,UAC9B,CAAAmxH,EAAI,aAGA,CAAAt7K,EAAAojB,EAAiB,IAAAgrI,EAAA4C,QAAA,MAAA6pB,EAAA58N,cAAuC,CAAApD,EAAAwgO,EAAA,KACzDtzI,EAAgB,kDACnB,CAAAA,EACD,0DAED,IAAM/1C,EAAU,IAAIwiD,EAAOziF,SAAyB,CAAAg2E,GAE9CtgC,EAAM,IAAAozK,EAAA/9J,OAAqB,CAAAxD,EAAAtnB,EAAcgO,GAEzC5sD,EAAAyO,EAAA46D,OAAA,CAAAQ,YAAwB,CAAAjd,EAAA,IAAiBw0C,EAEtCziF,SAAS,CAAA01C,EAASzV,SAAA,GAGrB+oL,EAAc,IAAAl5N,EAAA03D,iBAAA,CAAAnmE,EAAA,IAAAyO,EAAoCk9D,GAAE,CAAAtX,EAAAzV,SAAA,GACrD2pG,EAAa,kDAChB,CAAAA,EACD,uDACmC,IAGlC10C,EAAA,IAAAzS,EAAAziF,SAAA,CAAA4pI,GAIIq/E,EAAct7L,SAAA,GAEZ,OAAC,MAGTw6B,EAAU6gK,EAAM7kK,GAAA,CAAAgE,WAAA,CAAA+sC,EAAA,IAAA4gB,EAAAtzE,EAAA,CAAAymL,IAAA,GAAA5sB,EACVE,SAAA,MAAa,CACf4M,GAAaigB,GACblJ,EACEkJ,GAEE/3J,EACE,IAAWy3J,EAAA58N,cAAA,CAAApD,EAAA,CACX/F,UAAAqmO,EACAh8N,gBAAAA,EAEDoB,oBAAAA,CAGP,EAAO,OAEL0xN,EAAYmJ,EAAItmO,SAAA,EACjBsuE,EAAA,IAAAy3J,EAAA58N,cAAA,CAAApD,EAAAwgO,EAAA,KACA,GAAYngB,EAAcigB,EAE7B,EAAkC,IAChC3I,EAAM,UACR,MAAAjoG,GAEA,EACEkoG,EAAM,UACR,MAAA3G,GAEA,EACEn2N,EAAA,CACAkF,WAAAA,EACAmlD,SAAAA,EACAyH,QAAAA,EACAr0D,IAAAA,EACA2nO,kBAAAA,EACA9zH,cAAAA,EACA+zH,kBAAAA,EACA9gK,YAAAA,EACAplE,UAAAA,EACAomN,UAAAA,EACA3wF,QAAAioG,EACF1G,WAAA2G,CAEA,EACyB,MAAQ,GAAA//L,EAAAM,GAAA,EAAAioM,EAAAzwM,QAAA,EAAA70B,MAAAA,EAAQgvB,SAAAA,CAEzC,EAEK,EAAkD+1M,EAAA,OAAAtsB,EAAAxjL,UAAA,EAAAqwM,EAAA,iBCvJzD,iBCAA,kBCAA,kBCAA,gBAAAjoO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECAkDI,EAAAC,OAAA,CAAAL,EAAA,qBAAAI,CAAA,ECArC,aAGb,IAAAglG,EAAA,SAAAriG,CAAA,EACA,OAAAA,GAAAA,CAAA,CAGA3C,CAAAA,EAAAC,OAAA,UAAAF,CAAA,CAAAkZ,CAAA,SACA,IAAAlZ,GAAAkZ,IAAAA,EACA,EAAAlZ,GAAA,EAAAkZ,KAEAlZ,IAAAkZ,GAGA+rF,EAAAjlG,IAAAilG,EAAA/rF,GAJA,CAOA,eAAAjZ,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECjBa,aAGb,IAAAwG,EAAAxG,EAAe,MAAmBgyL,EAAAhyL,EAAA,MAGlC++L,EAAkB/+L,EAAQ,MAC1B8nM,EAAW9nM,EAAgB,MAAA+nM,EAAA/nM,EAAA,MAE3BinB,EAAA+qK,EAAA8V,IAAA1kM,QAGAoD,EAAAygB,EAAA,CACA6gL,YAAAA,EACA/I,eAAAA,EACCgJ,KAAAA,CAAA,GAED3nM,EAAAC,OAAA,CAAA4mB,CAAA,gBAAA7mB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECjBa,aAEkC,IAAA++L,EAAA/+L,EAAA,KAG/CI,CAAAA,EAAAC,OAAA,YACA,yBAAA+C,OAAA+C,EAAA,CAAA/C,OAAA+C,EAAA,CAAA44L,CAAA,iBAAA3+L,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECNa,aAGb,IAAA8nM,EAAa9nM,EAA2B,MAAAwG,EAAAxG,EAAA,KAGxCI,CAAAA,EAAAC,OAAA,YACA,IAAA4mB,EAAA6gL,IAMA,OALAthM,EAAApD,OAAA,CAAA+C,GAAA8gB,CAAA,GACA9gB,GAAA,WACA,OAAA/C,OAAA+C,EAAA,GAAA8gB,CACE,CACF,GACAA,CAAA,iBAAA7mB,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECba,aAGb,IAAA2oO,EACA,IAAAvlO,OAAAiE,IAAA,EAEA,IAAAsc,EAAAvgB,OAAA0L,SAAA,CAAAC,cAAA,CACA+oI,EAAA10I,OAAc0L,SAAA,CAAAxF,QAAuB,CACrCs/N,EAAA5oO,EAAA,MACA6oO,EAAAzlO,OAAA0L,SAAA,CAAAk7C,oBAA2C,CAC3C8+K,EAAA,CAAAD,EAAA75N,IAAA,EAAA1F,SAAA,IAAuD,cACvDy/N,EAAAF,EAAA75N,IAAA,2BACAg6N,EAAA,CACA,WACA,iBACA,UACA,iBACA,gBACA,uBACA,cACA,CACAC,EAAA,SAAAjpL,CAAA,EACA,IAAAstD,EAAAttD,EAAA19C,WAAA,CACA,OAAAgrG,GAAAA,EAAAx+F,SAAA,GAAAkxC,CACA,EACAkpL,EAAA,CACAC,kBAAA,GACAC,SAAA,GACAC,UAAA,GACAC,OAAA,GACAC,cAAA,GACAC,QAAA,GACAC,aAAA,GACAC,YAAA,GACAC,uBAAA,GACAC,sBAAA,GACAC,aAAA,GACAC,YAAA,GACAC,aAAA,GACAC,aAAA,GACAC,QAAA,GACAC,YAAA,GACAC,WAAA,GACAC,SAAA,GACAC,SAAA,GACAC,MAAA,GACAC,iBAAA,GACAC,mBAAA,GACAC,QAAA,EACA,EACAC,EAAA,WAEA,uBAAAh8N,OAAA,SACA,QAAAvJ,KAAAuJ,OACA,IACA,IAAAw6N,CAAA,KAAA/jO,EAAA,EAAAwe,EAAA3U,IAAA,CAAAN,OAAAvJ,IAAAuJ,IAAA,GAAAA,MAAA,CAAAvJ,EAAA,mBAAAuJ,MAAA,CAAAvJ,EAAA,CACA,IACA8jO,EAAOv6N,MAAA,CAAAvJ,EAAA,CACP,OAAAuC,EAAA,CACA,QACA,CACK,CACL,MAAAA,EAAA,CACA,QACA,CAEE,QACF,IACAijO,EAAA,SAAA3qL,CAAA,EAEA,uBAAAtxC,QAAA,CAAAg8N,EACA,OAAAzB,EAAAjpL,EACA,CACA,IACA,OAAIipL,EAAAjpL,EACJ,OAAAt4C,EAAA,CACA,QACA,GAGAihO,EAAA,SAAAvsL,CAAA,EACA,IAAA14C,EAAA04C,IAAA,GAAAA,GAAA,iBAAAA,EACAmyD,EAAAupC,sBAAAA,EAAA9oI,IAAA,CAAAotC,GACAw1D,EAAAg3H,EAAAxsL,GACAoyD,EAAA9qG,GAAAo0I,oBAAAA,EAAA9oI,IAAA,CAAAotC,GAAAwuL,EAAA,GAGA,IAAAlnO,GAAA,CAAA6qG,GAAA,CAAAqD,EACA,sDAGA,IAAAi5H,EAAA9B,GAAAx6H,EACA,GAAAC,GAAApyD,EAAmB76C,MAAA,IAAmB,CAAAoiB,EAAA3U,IAAA,CAAAotC,EAAA,GACtC,QAAAz1C,EAAA,EAAAA,EAAAy1C,EAAA76C,MAAA,GAAAoF,EACAikO,EAAA/qO,IAAA,CAAA4gB,OAAA9Z,GACA,CAGA,GAAAirG,GAAmBx1D,EAAA76C,MAAA,GACnB,QAAAszB,EAAA,EAAAA,EAAAunB,EAAA76C,MAAA,GAAAszB,EACA+1M,EAAA/qO,IAAA,CAAA4gB,OAAAoU,SAGA,QAAAvxB,KAAA84C,EACA,CAAAyuL,CAAAA,GAAAvnO,cAAAA,CAAA,GAAAqgB,EAAA3U,IAAA,CAAAotC,EAAA94C,IACAsnO,EAAA/qO,IAAA,CAAA4gB,OAAAnd,GAEA,CAGA,GAAAwlO,EAGA,QAHAgC,EAAAH,EAAAvuL,GAGAj3C,EAAA,EAAAA,EAAA6jO,EAAAznO,MAAA,GAAA4D,EACA,CAAA2lO,CAAAA,GAAA9B,gBAAAA,CAAA,CAAA7jO,EAAA,GAAAwe,EAAA3U,IAAA,CAAAotC,EAAA4sL,CAAA,CAAA7jO,EAAA,GACAylO,EAAA/qO,IAAA,CAAAmpO,CAAA,CAAA7jO,EAAA,CAGA,CACA,OAAAylO,CACA,CACA,GAAAvqO,OAAA,CAAAsoO,CAAA,gBAAAvoO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECzHa,aAGb,IAAA2B,EAAAR,MAAa2N,SAAA,CAAAnN,KAAQ,CAAeinO,EAAA5oO,EAAA,MAGpC+qO,EAAA3nO,OAAAiE,IAAA,CAA+FshO,EAAAoC,EAAA,SAAA/qL,CAAA,SAAA+qL,EAAA/qL,EAAA,EAAAhgD,EAAA,MAE/FgrO,EAAA5nO,OAAAiE,IAAA,CAGAshO,EAAA5gC,IAAA,YAkBA,OAjBA3kM,OAAAiE,IAAA,CAMA,CALA,WAEA,IAAAwC,EAAAzG,OAAAiE,IAAA,CAAAoyB,WACG,OAAA5vB,GAAAA,EAAAtI,MAAA,GAAAk4B,UAAAl4B,MAAA,EACH,MAEA6B,CAAAA,OAAAiE,IAAA,UAAA+0C,CAAA,SACA,EAAAA,GACA4uL,EAAArpO,EAAAqN,IAAA,CAAAotC,IAEA4uL,EAAA5uL,EADA,CAEA,EAGAh5C,OAAAiE,IAAA,CAAAshO,EAEAvlO,OAAAiE,IAAA,EAAAshO,CAAA,EAEAvoO,EAAAC,OAAA,CAAAsoO,CAAA,gBAAAvoO,CAAA,EC/Ba,aAEb,IAAA03I,EAAA10I,OAAA0L,SAAA,CAAAxF,QAAA,CAGAlJ,EAAAC,OAAA,UAAA0C,CAAA,EACA,IAAAooB,EAAA2sH,EAAA9oI,IAAA,CAAAjM,GACA6lO,EAAAz9M,uBAAAA,EASA,OARAy9M,GACAA,CAAAA,EAAAz9M,mBAAAA,GACApoB,IAAA,GAAAA,GACA,iBAAAA,GACA,iBAAAA,EAAAxB,MAAA,EACAwB,EAAAxB,MAAA,KACAu2I,sBAAAA,EAAA9oI,IAAA,CAAAjM,EAAA48L,MAAA,GAEAipC,CAAA,iBAAAxoO,CAAA,EChBa,YAIbA,CAAAA,EAAAC,OAAA,EACA,eACA,eACA,YACA,aACA,aACA,aACA,oBACA,cACA,cACA,gBACA,iCAAAD,CAAA,ECdA,IAQA6qO,EAAAC,EAmFAC,EA3FAziN,EAAAtoB,EAAAC,OAAA,IAWA,SAAA+qO,GAAA,CACA,+CAEA,SAAAC,GAAA,CACA,iDAsBA,SAAAC,EAAAC,CAAA,EACA,GAAAN,IAAAtnJ,WAEA,OAAAA,WAAA4nJ,EAAA,EACA,CAEA,IAAAN,IAAAG,GAAA,CAAAH,CAAA,GAAAtnJ,WAEA,OADAsnJ,EAAAtnJ,WACAA,WAAA4nJ,EAAA,EACA,CACA,IAEM,OAAAN,EAAAM,EAAA,EACN,OAAA7jO,EAAA,CACA,IAEU,OAAAujO,EAAAj8N,IAAA,MAAAu8N,EAAA,EACV,OAAA7jO,EAAA,CAEA,OAAAujO,EAAAj8N,IAAA,MAAAu8N,EAAA,EACA,EAIA,CACA,SAAAC,EAAAv+L,CAAA,EACA,GAAAi+L,IAAA7yG,aAEA,OAAAA,aAAAprF,EACA,CAEA,IAAAi+L,IAAAG,GAAA,CAAAH,CAAA,GAAA7yG,aAEA,OADA6yG,EAAA7yG,aACAA,aAAAprF,EACA,CACA,IAEM,OAAAi+L,EAAAj+L,EACN,OAAAvlC,EAAA,CACA,IAEU,OAAAwjO,EAAAl8N,IAAA,MAAAi+B,EACV,OAAAvlC,EAAA,CAGA,OAAAwjO,EAAAl8N,IAAA,MAAAi+B,EACA,EAKA,EAvEA,WACA,IAEUg+L,EADV,mBAAAtnJ,WACUA,WAEVynJ,CAEA,OAAA1jO,EAAA,CACAujO,EAAAG,CACA,CACA,IAEUF,EADV,mBAAA7yG,aACUA,aAEVgzG,CAEA,OAAA3jO,EAAA,CACAwjO,EAAAG,CACE,CACF,IAqDA,IAAAv0G,EAAA,GACA20G,EAAA,GACAC,EAAA,GAGA,SAAAC,GAAA,CACAF,GAAAN,IAGAM,EAAA,GACAN,EAAA5pO,MAAA,CACMu1H,EAAAq0G,EAAA10M,MAAA,CAAAqgG,GAEN40G,EAAA,GAEA50G,EAAAv1H,MAAA,EACAqqO,IACA,CAGA,SAAAA,GAAA,CACA,IAAAH,GAGA,IAAA7zG,EAAA0zG,EAAAK,GAAAF,EAAA,GAIA,IADA,IAAA1xM,EAAA+8F,EAAAv1H,MAAA,CACAw4B,GAAA,CAGA,IAFAoxM,EAAAr0G,EACAA,EAAA,GACA,EAAA40G,EAAA3xM,GACAoxM,GACAA,CAAA,CAAAO,EAAA,CAAAhnO,GAAA,GAGAgnO,EAAA,GACA3xM,EAAA+8F,EAAAv1H,MAAA,CAEA4pO,EAAA,KACAM,EAAA,GACAD,EAAA5zG,GAlBA,CAmCA,SAAAi0G,EAAAN,CAAA,CAAAtqO,CAAA,EACA,KAAAsqO,GAAA,CAAAA,EACA,KAAAtqO,KAAA,CAAAA,CACA,CAUA,SAAA61F,GAAA,EA3BApuE,EAAAojN,QAAA,UAAAP,CAAA,EACA,IAAA1hO,EAAA,MAAA4vB,UAAAl4B,MAAA,IACA,GAAAk4B,UAAAl4B,MAAwB,GACxB,QAAAoF,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,IACAkD,CAAA,CAAAlD,EAAA,GAAA8yB,SAAA,CAAA9yB,EAAA,CAGAmwH,EAAAj3H,IAAA,KAAAgsO,EAAAN,EAAA1hO,IACA,IAAAitH,EAAAv1H,MAAA,EAAAkqO,GACAH,EAAAM,EACA,EAQAC,EAAA/8N,SAAA,CAAApK,GAAA,YACA,KAAA6mO,GAAA,CAAAnqO,KAAA,WAAAH,KAAA,CACA,EACAynB,EAAA2qF,KAAA,WACA3qF,EAAAusG,OAAA,IACAvsG,EAAA9c,GAAA,IACA8c,EAAAqjN,IAAA,IACArjN,EAAAo6C,OAAA,IAAAp6C,EAAA+uE,QAAA,IAKA/uE,EAAAy1C,EAAA,CAAA24B,EACApuE,EAAAu0K,WAAA,CAAAnmG,EACApuE,EAAAs0K,IAAA,CAAAlmG,EACApuE,EAAAs1J,GAAA,CAAAlnF,EACApuE,EAAAg1K,cAAA,CAAA5mG,EACApuE,EAAAi1K,kBAAA,CAAA7mG,EACApuE,EAAAk4C,IAAA,CAAAk2B,EACApuE,EAAAsjN,eAAA,CAAAl1I,EAAApuE,EAAAujN,mBAAA,CAAAn1I,EAEsCpuE,EAAAgzD,SAAA,UAAAp4E,CAAA,YAGtColB,EAAAwjN,OAAA,UAAA5oO,CAAA,EACA,iDAGAolB,EAAAivE,GAAA,uBACAjvE,EAAAyjN,KAAA,UAAAr4L,CAAA,EACA,+CAC6BprB,EAAA0jN,KAAA,qCAAAhsO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECvLhB,aAGb,IAAAqsO,EAAYrsO,EAAQ,MAAO+vF,EAAA/vF,EAAA,MAE3B4vG,EAAAxsG,OAAA0L,SAAA,CAAAC,cAAA,CAGA,SAAAu9N,EAAAvhO,CAAA,EACA,OAAAA,GAAAA,kBAAAA,EAAAH,IAAA,EAAAglG,EAAA5gG,IAAA,CAAAjE,EAAA,WAGA,SAAAwhO,EAAAr1M,CAAA,CAAAvyB,CAAA,MACAg1K,EAAA6yD,EAYA,MATA,iBAAAt1M,GAAA,mBAAAvyB,IAEAg1K,EAAAh1K,EACAA,EAAAuyB,EACAA,EAAAyiJ,GAEA6yD,EAAAz8I,EAAAy8I,SAAA,CAAA7nO,GAGA,IAAA4c,QAAA,SAAAI,CAAA,CAAAH,CAAA,EACAgrN,EAAAC,OAAA,UAAAxlO,CAAA,EACAsa,QAAAI,OAAA,GACA2B,IAAA,YACA,OAAA4T,EAAA,SAAAnsB,CAAA,EAKiB,MAJjBuhO,EAAAvhO,IACAA,CAAAA,EAAAA,EAAA2hO,OAAA,EAGiBL,EAAA,mCAAAK,QAAA3hO,CAAA,IACJ9D,EACb,GACAqc,IAAA,CAAA3B,EAAA,SAAA5W,CAAA,EACAuhO,EAAAvhO,KAAAA,EAAAA,EAAA2hO,OAAA,CAGAF,EAAAz8I,KAAA,CAAAhlF,GAAA,WAKayW,EAAAzW,EACJ,EACJ,EACL,GAEA3K,EAAAC,OAAA,CAAAksO,CAAA,gBAAAnsO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECnDuCI,EAAAC,OAAA,CAAAL,EAAA,qBAAAF,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECAS,IAAA2sO,EAAA3sO,EAAA,KAGhDK,CAAAA,EAAAmsO,SAAA,UAAA7nO,CAAA,EACA,IAAAioO,EAAAvsO,EAAAusO,QAAA,CAAAjoO,GACA,WAAAgoO,EAAAC,EAAA,CACAC,QAAAloO,GAAAA,EAAAkoO,OAAA,CACAC,MAAAnoO,GAAAA,EAAAmoO,KAAA,CACGC,aAAApoO,GAAAA,EAAAooO,YAAA,EACH,EAGA1sO,EAAAusO,QAAA,UAAAjoO,CAAA,EACA,GAAAA,aAAAxD,MACA,SAAAs1B,MAAA,CAAA9xB,EAAA,CAGA,IAAA4G,EAAA,CACA0kF,QAAA,GACA+8I,OAAA,EACA98I,WAAA,IACA+8I,WAAAxpI,IACAypI,UAAA,EACA,EACA,QAAAlqO,KAAA2B,EACA4G,CAAA,CAAAvI,EAAA,CAAA2B,CAAA,CAAA3B,EAAA,CAGA,GAAAuI,EAAA2kF,UAAA,CAAA3kF,EAAA0hO,UAAA,CACA,qDAIA,QADAL,EAAA,EAAkB,CAClBjmO,EAAA,EAAAA,EAAA4E,EAAA0kF,OAAA,CAAAtpF,IACAimO,EAAA/sO,IAAA,MAAAstO,aAAA,CAAAxmO,EAAA4E,IAYA,OATA5G,GAAAA,EAAAkoO,OAAA,GAAAD,EAAArrO,MAAA,EACAqrO,EAAA/sO,IAAA,MAAAstO,aAAA,CAAAxmO,EAAA4E,IAIAqhO,EAAAv7L,IAAA,UAAAlxC,CAAA,CAAAkZ,CAAA,EACG,OAAAlZ,EAAAkZ,CAAA,GAGHuzN,CAAA,EAGAvsO,EAAA8sO,aAAA,UAAAV,CAAA,CAAAlhO,CAAA,EAQA,OAHAlK,KAAAorC,GAAA,CAAAprC,KAAA2kC,KAAA,CAAAmzI,CAJA,EAAA+zD,SAAA,CACA7rO,KAAA83K,MAAA,QAGA5tK,EAAA2kF,UAAA,CAAA7uF,KAAAs/C,GAAA,CAAAp1C,EAAAyhO,MAAA,CAAAP,IAAAlhO,EAAA0hO,UAAA,CAGA,EAGA5sO,EAAA+sO,IAAA,UAAAptN,CAAA,CAAArb,CAAA,CAAAmf,CAAA,EAMA,GALAnf,aAAAxD,QACA2iB,EAAAnf,EACAA,EAAA,MAGA,CAAAmf,EAEA,QAAA9gB,KADA8gB,EAAA,GACA9D,EACA,mBAAAA,CAAA,CAAAhd,EAAA,EACA8gB,EAAAjkB,IAAA,CAAAmD,EAEA,CAGA,QAAA2D,EAAA,EAAAA,EAAAmd,EAAAviB,MAAA,CAAAoF,IAAA,CACA,IAAAqd,EAAAF,CAAA,CAAAnd,EAAA,CAAA0mO,EAAArtN,CAAA,CAAAgE,EAAA,CAGAhE,CAAA,CAAAgE,EAAA,WAAAqpN,CAAA,EACA,IAAAC,EAAAjtO,EAAAmsO,SAAA,CAAA7nO,GACAkF,EAAA1I,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,CAAAyqB,UAAA,GAAA7V,EAAA/Z,EAAAsqD,GAAA,GAGAtqD,EAAAhK,IAAA,UAAAkL,CAAA,EACAuiO,EAAAv9I,KAAA,CAAAhlF,KAGAA,GACA0uB,CAAAA,SAAA,IAAA6zM,EAAAC,SAAA,IAEO3pN,EAAAxiB,KAAA,MAAAq4B,WAAA,GAGP6zM,EAAAb,OAAA,YACOY,EAAAjsO,KAAA,CAAA4e,EAAAnW,EACF,EACL,GAAAoT,IAAA,CAAA+C,EAAAqtN,GACArtN,CAAA,CAAAgE,EAAA,CAAArf,OAAA,CAAAA,CACA,kBAAAvE,CAAA,EClGA,SAAAusO,EAAAC,CAAA,CAAAjoO,CAAA,EAEgB,WAAhB,OAAAA,GACAA,CAAAA,EAAA,CAAAkoO,QAAAloO,CAAA,GAGA,KAAA6oO,iBAAA,CAAA1pO,KAAA2f,KAAA,CAAA3f,KAAAC,SAAA,CAAA6oO,IACA,KAAAa,SAAA,CAAAb,EACA,KAAAc,QAAA,CAAA/oO,GAAA,GACA,KAAAgpO,aAAA,CAAAhpO,GAAAA,EAAAooO,YAAA,EAAAtpI,IACA,KAAAmqI,GAAA,MACA,KAAAC,OAAA,IACA,KAAAC,SAAA,GACA,KAAAC,iBAAA,MACA,KAAAC,mBAAA,MACA,KAAAC,QAAA,WAAAC,eAAA,MAGA,KAAAR,QAAA,CAAAb,OAAA,EACA,MAAAsB,eAAA,MAAAV,SAAA,CAAA9rO,KAAA,IAEA,CAAAvB,EAAAC,OAAA,CAAAssO,EAGAA,EAAA79N,SAAA,CAAA6zG,KAAA,YACA,KAAAmrH,SAAA,GACA,KAAAL,SAAA,MAAAD,iBAAA,EAGAb,EAAA79N,SAAA,CAAAs/N,IAAA,YACA,KAAAH,QAAA,EACA51G,aAAA,KAAA41G,QAAA,EAGA,KAAAR,SAAA,IACA,KAAAU,eAAA,OAGAxB,EAAA79N,SAAA,CAAAihF,KAAA,UAAAhlF,CAAA,EAKA,GAJA,KAAAkjO,QAAA,EACA51G,aAAA,KAAA41G,QAAA,EAGA,CAAAljO,EACA,QACA,CACA,IAAAsjO,EAAA,IAAAvyI,OAAAD,OAAA,GACA,GAAA9wF,GAAAsjO,EAAA,KAAAH,eAAA,OAAAP,aAAA,CAEA,OADA,KAAAE,OAAA,CAAA1hL,OAAA,2CACA,GAEA,KAAA0hL,OAAA,CAAAhuO,IAAA,CAAAkL,GAGA,IAAA6sH,EAAA,KAAA61G,SAAA,CAAAtxN,KAAA,GACA,GAAAy7G,KAAAxzH,IAAAwzH,EAAA,CACA,SAAAu2G,eAAA,CAMA,QACA,CALA,KAAAN,OAAA,CAAA9jG,MAAA,MAAA8jG,OAAA,CAAAtsO,MAAA,QAAAssO,OAAA,CAAAtsO,MAAA,EACA,KAAAksO,SAAA,MAAAU,eAAA,CAAAxsO,KAAA,IACMi2H,EAAA,KAAA61G,SAAA,CAAAtxN,KAAA,EAGN,KAGAvc,EAAA,KACA0uO,EAAA3qJ,WAAA,WAAA/jF,EAAAkuO,SAAA,GAGAluO,EAAAouO,mBAAA,GACApuO,EAAAquO,QAAA,CAAAtqJ,WAAA,WACO/jF,EAAAouO,mBAAA,CAAApuO,EAAAkuO,SAAA,GAAAluO,EAAAmuO,iBAAA,EAGPnuO,EAAA8tO,QAAA,CAAAZ,KAAA,EACAltO,EAAAquO,QAAA,CAAAnB,KAAA,IAIGltO,EAAAguO,GAAA,CAAAhuO,EAAAkuO,SAAA,GAAAl2G,GAOH,OAJA,KAAA81G,QAAA,CAAAZ,KAAA,EACAwB,EAAAxB,KAAA,GAGA,IAGAH,EAAA79N,SAAA,CAAA29N,OAAA,UAAAv1M,CAAA,CAAAq3M,CAAA,OAAAX,GAAA,CAAA12M,EAGAq3M,IACAA,EAAA32G,OAAA,EACA,MAAAm2G,iBAAA,CAAAQ,EAAA32G,OAAA,EAEA22G,EAAA93G,EAAA,EACA,MAAAu3G,mBAAA,CAAAO,EAAA93G,EAAA,GAIA,IAAA72H,EAAA,KACA,KAAAouO,mBAAA,EACA,MAAAC,QAAA,CAAAtqJ,WAAA,WACK/jF,EAAAouO,mBAAA,EACL,EAAApuO,EAAAmuO,iBAAA,GAEA,KAAAG,eAAA,KAAApyI,OAAAD,OAAA,GAGA,KAAA+xI,GAAA,MAAAE,SAAA,GAGAnB,EAAA79N,SAAA,CAAA0/N,GAAA,UAAAt3M,CAAA,EACA7sB,QAAA2qD,GAAA,6CACA,KAAAy3K,OAAA,CAAAv1M,EAAA,EAGAy1M,EAAA79N,SAAA,CAAA+iC,KAAA,UAAA3a,CAAA,EACA7sB,QAAA2qD,GAAA,+CACA,KAAAy3K,OAAA,CAAAv1M,EAAA,EAEAy1M,EAAA79N,SAAA,CAAA+iC,KAAA,CAAA86L,EAAA79N,SAAA,CAAA0/N,GAAA,CAGA7B,EAAA79N,SAAA,CAAAojD,MAAA,YACA,YAAA27K,OAAA,EAGAlB,EAAA79N,SAAA,CAAA2/N,QAAA,YACA,YAAAX,SAAA,EAGAnB,EAAA79N,SAAA,CAAAy+N,SAAA,YACA,YAAAM,OAAA,CAAAtsO,MAAA,CACA,YAOA,QAJAmtO,EAAA,GACAnB,EAAA,KAAAoB,EAAA,EAGAhoO,EAAA,EAAAA,EAAA,KAAAknO,OAAA,CAAAtsO,MAAA,CAAAoF,IAAA,CACA,IAAAJ,EAAA,KAAAsnO,OAAA,CAAAlnO,EAAA,CACAjE,EAAA6D,EAAA7D,OAAA,CAAAkwB,EAAA,CAAA87M,CAAA,CAAAhsO,EAAA,MAEAgsO,CAAAA,CAAA,CAAAhsO,EAAA,CAAAkwB,EAGAA,GAAA+7M,IACApB,EAAAhnO,EACAooO,EAAA/7M,EACA,CAGA,OAAA26M,CAAA,iBAAAntO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC7JA,aAS+D,IAAA4uO,EAAA5uO,EAAA,KAG/D,SAAA6uO,GAAA,EACA,SAAAC,GAAA,EAAAA,EAAAC,iBAAA,CAAAF,EAGAzuO,EAAAC,OAAA,YACA,SAAA0nM,EAAAhiM,CAAA,CAAAquC,CAAA,CAAA46L,CAAA,CAAAtpN,CAAA,CAAAupN,CAAA,CAAAC,CAAA,EACA,GAAAA,IAAAN,GAIA,IAAA7jO,EAAA,MACA,kLAKA,OADAA,EAAAzH,IAAA,uBACAyH,CAAA,CAPA,CAUA,SAAAokO,GAAA,CACA,OAAApnC,CACA,CAHAA,EAAA8/B,UAAA,CAAA9/B,EAMA,IAAAqnC,EAAA,CACAnuO,MAAA8mM,EACA7kF,OAAA6kF,EACAz8K,KAAAy8K,EACAlwK,KAAAkwK,EACA9gM,OAAA8gM,EACA3rJ,OAAA2rJ,EACA3gM,OAAA2gM,EAAApgH,OAAAogH,EAGAthM,IAAAshM,EACAsnC,QAAAF,EACA17M,QAAAs0K,EACA6/B,YAAA7/B,EACAunC,WAAAH,EACAv9M,KAAAm2K,EACAwnC,SAAAJ,EACApjE,MAAAojE,EACAK,UAAAL,EACAh9L,MAAAg9L,EAAAM,MAAAN,EAGAO,eAAAZ,EACAC,kBAAAF,CAAA,EAKA,OAHAO,EAAAO,SAAA,CAAAP,EAGAA,CAAA,iBAAAhvO,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EC9CAI,EAAAC,OAAA,CAAAL,EAAA,sBAAAI,CAAA,EClBA,aASA,IAAAwuO,EAAA,8CAEAxuO,CAAAA,EAAAC,OAAA,CAAAuuO,CAAA,eAAAxuO,CAAA,ECTAA,EAAAC,OAAA,EACAqnO,mBAAA,WACK,aAELkI,wBAAA,WACK,YAEH,CAED,gBAAA9vO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA8vO,CAAA,QAAAC,EAAA9vO,EAAA,MAAA+vO,EAAA/vO,EAAA,MCXqEgwO,EAAAhwO,EAAA,MA8F/D6vO,EAAA,GA1FL,UAAAI,CAAA,EAGF,SAAAC,GAAA,KAAArhN,EAwBA,MAnBAA,CAHAA,EAAAohN,EAAAjhO,IAAA,cAGAmhO,KAAA,UAAAC,CAAA,MAAAC,EAGA,IAAAL,EAAAM,EAAA,SAAAD,CAAAA,EAAA3hO,MAAA,SAAA2hO,EAAAzpN,gBAAA,GACA,IAAAi6C,EAAA,WACA,OAAWuvK,GAAA,EAMX,OAFA1hO,OAAAkY,gBAAA,oBAAAi6C,EAAA,IACAnyD,OAAAkY,gBAAA,SAAAi6C,EAAA,IACA,WAEAnyD,OAAAqY,mBAAA,oBAAA85C,GACAnyD,OAAAqY,mBAAA,SAAA85C,EACA,CACA,GAGAhyC,CAAA,CA3BgB,GAAAihN,EAAA/mN,CAAA,EAAAmnN,EAAAD,GA6BhB,IAAAvgN,EAAAwgN,EAAAphO,SAAA,CA4DE,OAzDF4gB,EAAA6gN,WAAA,YACA,KAAA9d,OAAA,EACA,KAAA+d,gBAAA,MAAAL,KAAA,CACA,EAGAzgN,EAAA+gN,aAAA,YACA,SAAAC,YAAA,QAAAC,CAGA,OAAAA,CAAAA,EAAA,KAAAle,OAAA,GAAAke,EAAA3hO,IAAA,OACA,KAAAyjN,OAAA,CAAAruN,KAAAA,CACA,GAGAsrB,EAAA8gN,gBAAA,UAAAL,CAAA,EACA,IAAAS,EAAAC,EAAA,KAGA,KAAAV,KAAA,CAAAA,EACA,MAAAS,CAAAA,EAAA,KAAAne,OAAA,GAAAme,EAAA5hO,IAAA,OACA,KAAAyjN,OAAA,CAAA0d,EAAA,SAAAW,CAAA,EACA,kBAAAA,EACQD,EAAAE,UAAA,CAAAD,GAERD,EAAAT,OAAA,EAEA,IAGA1gN,EAAAqhN,UAAA,UAAAD,CAAA,OAAAA,OAAA,CAAAA,EAGAA,GACA,KAAAV,OAAA,EACA,EAGA1gN,EAAA0gN,OAAA,YACA,KAAA10J,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACKA,GACL,IAGAnxC,EAAAshN,SAAA,kBACA,uBAAAF,OAAA,CACM,KAAAA,OAAA,CAIN,oBAAA5iN,UAIA,CAAA9pB,KAAAA,EAAA,uBAAA2wD,QAAA,CAAA7mC,SAAA+iN,eAAA,CARM,EAWJf,CACK,EAAAH,EAAAziM,CAAA,kBAAAxtC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,+BAAAmxO,EAAAtpO,CAAA,QAAAspO,EAAAlxO,EAAA,MAAAmxO,EAAAnxO,EAAA,MAAAA,EAAAggD,CAAA,CAAAmxL,EAAA,YAAAnxO,EAAAC,CAAA,CAAAF,EAAA,2BAAAoxO,EAAA3J,OAAA,IAAAxnO,EAAAggD,CAAA,CAAAmxL,EAAA,wBAAAnxO,EAAAC,CAAA,CAAAF,EAAA,uCAAAoxO,EAAA5J,mBAAA,IAAAvnO,EAAAggD,CAAA,CAAAmxL,EAAA,gBAAAnxO,EAAAC,CAAA,CAAAF,EAAA,+BAAAoxO,EAAAC,WAAA,IC9FoCpxO,EAAAggD,CAAA,CAAAmxL,EAAA,aAAAnxO,EAAAC,CAAA,CAAAF,EAAA,4BAAAoxO,EAAAE,QAAA,GAcO,gBAAAvxO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAuxO,CAAA,sBAAAC,CAAA,CCdlD,GAGO,IAAAC,EAAAnnO,QACP,SAAAknO,GAAA,CACA,OAAAC,CACO,CACP,SAAAF,EAAAG,CAAA,EACAD,EAAAC,CAAA,iBAAA3xO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA2xO,CAAA,sBAAAC,CAAA,QAAAzgM,EAAAlxC,EAAA,MAAA4xO,EAAA5xO,EAAA,MAAA6xO,EAAA7xO,EAAA,KAAA8xO,EAAA9xO,EAAA,MCR0DgwO,EAAAhwO,EAAA,MAQ1D2xO,EAAA,WACA,SAAAA,EAAmBpoO,CAAA,EACnB,KAAA5E,OAAA,IAAAusC,EAAAnoB,CAAA,KAAAxf,EAAAiC,cAAA,CAAAjC,EAAA5E,OAAA,EACA,KAAAotO,UAAA,CAAAxoO,EAAAwoO,UAAA,CACA,KAAAC,aAAA,CAAAzoO,EAAAyoO,aAAA,CACA,KAAAC,SAAA,IACA,KAAA3mL,KAAA,CAAA/hD,EAAA+hD,KAAA,EAAAomL,IACA,KAAAvkO,IAAA,CAAA5D,EAAA4D,IAAA,CAEA,IAAAuiB,EAAAiiN,EAAA7iO,SAAA,CAuJC,OApJD4gB,EAAAwiN,QAAA,UAAA5mL,CAAA,EACA,KAAA6mL,QAAA,EACAlvO,KAAA,WACKqoD,MAAAA,CACL,IAGA57B,EAAA0iN,WAAA,UAAAC,CAAA,EACA,UAAAJ,SAAA,CAAA1xN,OAAA,CAAA8xN,IACA,KAAAJ,SAAA,CAAApyO,IAAA,CAAAwyO,EACA,EAGA3iN,EAAA4iN,cAAA,UAAAD,CAAA,EACA,KAAAJ,SAAA,MAAAA,SAAA,CAAAtnN,MAAA,UAAAlnB,CAAA,EACK,OAAAA,IAAA4uO,CACL,IAGA3iN,EAAAyoL,MAAA,mBACA,KAAAo6B,OAAA,EACA,KAAAA,OAAA,CAAAp6B,MAAA,GACA,KAAAo6B,OAAA,CAAAvwN,OAAA,CAAAsB,IAAA,CAAA0sN,EAAA5jH,EAAA,EAAAprD,KAAA,CAAAgvK,EAAA5jH,EAAA,GAGA7qG,QAAAI,OAAA,EAHA,EAMA+N,EAAA8iN,QAAA,mBACA,KAAAD,OAAA,EACA,KAAAA,OAAA,CAAAC,QAAA,GACA,KAAAD,OAAA,CAAAvwN,OAAA,EAGA,KAAAkrC,OAAA,EAHA,EAMAx9B,EAAAw9B,OAAA,gBAGAnrD,EAHA8sB,EAAA,KAIA4jN,EAAA,iBAAAnnL,KAAA,CAAAj9C,MAAA,CAAA2T,EAAAT,QAAAI,OAAA,GAwBA,OArBA8wN,IACA,KAAAN,QAAA,EACAlvO,KAAA,UACOyvO,UAAA,KAAA/tO,OAAA,CAAA+tO,SAAA,GAEP1wN,EAAAA,EAAAsB,IAAA,YAEOuL,IAAA,EAAAA,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAopO,QAAA,EAAA9jN,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAopO,QAAA,CAAA9jN,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EACP,GAAAvL,IAAA,YACO,OAAAuL,IAAA,EAAAA,EAAAlqB,OAAA,CAAAguO,QAAA,QAAA9jN,EAAAlqB,OAAA,CAAAguO,QAAA,CAAA9jN,EAAAy8B,KAAA,CAAAonL,SAAA,IACPpvN,IAAA,UAAA/e,CAAA,EACAA,IAAAsqB,EAAAy8B,KAAA,CAAA/mD,OAAA,EACAsqB,EAAAsjN,QAAA,EACAlvO,KAAA,UACAsB,QAAAA,EACWmuO,UAAA7jN,EAAAy8B,KAAA,CAAAonL,SAAA,EAGX,IAGA1wN,EAAAsB,IAAA,YACK,OAAAuL,EAAA+jN,eAAA,EACL,GAAAtvN,IAAA,UAAqBhf,CAAA,EAAAvC,EAAAuC,EAGhBuqB,IAAA,EAAAA,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAspO,SAAA,EAAAhkN,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAspO,SAAA,CAAA9wO,EAAA8sB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,CAAAsqB,EACL,GAAAvL,IAAA,YACK,OAAAuL,IAAA,EAAAA,EAAAlqB,OAAA,CAAAkuO,SAAA,QAAAhkN,EAAAlqB,OAAA,CAAAkuO,SAAA,CAAA9wO,EAAA8sB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,IACL+e,IAAA,YACK,OAAAuL,IAAA,EAAAA,EAAAlqB,OAAA,CAAAmuO,SAAA,QAAAjkN,EAAAlqB,OAAA,CAAAmuO,SAAA,CAAA/wO,EAAA,KAAA8sB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,IACL+e,IAAA,YAMK,OALLuL,EAAAsjN,QAAA,EACAlvO,KAAA,UACOlB,KAAAA,CAAA,GAGFA,CACL,GAAAi/D,KAAA,UAAAz6D,CAAA,EAKA,OAJ0JsoB,IAAA,EAAAA,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAu1N,OAAA,EAAAjwM,EAAAmjN,aAAA,CAAAzoO,MAAA,CAAAu1N,OAAA,CAAAv4N,EAAAsoB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,CAAAsqB,GAG1J,GAAA+iN,EAAA/8M,CAAA,IAAAtuB,KAAA,CAAAA,GACAgb,QAAAI,OAAA,GAAA2B,IAAA,YACO,OAAAuL,IAAA,EAAAA,EAAAlqB,OAAA,CAAAm6N,OAAA,QAAAjwM,EAAAlqB,OAAA,CAAAm6N,OAAA,CAAAv4N,EAAAsoB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,IACP+e,IAAA,YACO,OAAAuL,IAAA,EAAAA,EAAAlqB,OAAA,CAAAmuO,SAAA,QAAAjkN,EAAAlqB,OAAA,CAAAmuO,SAAA,CAAA1uO,KAAAA,EAAAmC,EAAAsoB,EAAAy8B,KAAA,CAAAonL,SAAA,CAAA7jN,EAAAy8B,KAAA,CAAA/mD,OAAA,IACP+e,IAAA,YAMO,MALPuL,EAAAsjN,QAAA,EACAlvO,KAAA,QACSsD,MAAAA,CAAA,GAGFA,CAAA,EAEP,IAGAmpB,EAAAkjN,eAAA,YACA,IAAAG,EAAAlC,EAAA,KA6BA,OA1BA,KAAA0B,OAAA,KAAAT,EAAAkB,EAAA,EACA97M,GAAA,kBACA,EAAAvyB,OAAA,CAAAsuO,UAAA,CAIOpC,EAAAlsO,OAAA,CAAAsuO,UAAA,CAAApC,EAAAvlL,KAAA,CAAAonL,SAAA,EAHPnxN,QAAAC,MAAA,yBAKA0xN,OAAA,WACArC,EAAAsB,QAAA,EACSlvO,KAAA,QACF,EACP,EACAkwO,QAAA,WACAtC,EAAAsB,QAAA,EACSlvO,KAAA,OACF,EACP,EACAmwO,WAAA,WACAvC,EAAAsB,QAAA,EACSlvO,KAAA,UACF,EACP,EACA8sF,MAAA,MAAAgjJ,CAAAA,EAAA,KAAApuO,OAAA,CAAAorF,KAAA,EAAAgjJ,EAAA,EACKM,WAAA,KAAA1uO,OAAA,CAAA0uO,UAAA,GAEL,KAAAd,OAAA,CAAAvwN,OAAA,EAGA0N,EAAAyiN,QAAA,UAAAlvM,CAAA,MAAAqwM,EAAA,KAGI,KAAAhoL,KAAA,CAAAioL,EAAA,KAAAjoL,KAAA,CAAAroB,GACJ4uM,EAAAp/K,CAAA,CAAAmf,KAAA,YACA0hK,EAAArB,SAAA,CAAAzkO,OAAA,UAAA6kO,CAAA,EACOA,EAAAmB,gBAAA,CAAAvwM,EAAA,GAGFqwM,EAAAtB,aAAA,CAAAh6G,MAAA,CAAAs7G,EACL,IAGC3B,CACM,IACP,SAAAD,GAAA,CACA,OACAntO,QAAAH,KAAAA,EACArC,KAAAqC,KAAAA,EACAmC,MAAA,KACAktO,aAAA,EACAC,SAAA,GACArlO,OAAA,OACAqkO,UAAAtuO,KAAAA,CACA,EAGA,SAAAmvO,EAAAjoL,CAAA,CAAAroB,CAAA,EACA,OAAAA,EAAAhgC,IAAA,EACA,aACA,SAAAiuC,EAAAnoB,CAAA,KAAAuiC,EAAA,CACOmoL,aAAAnoL,EAAAmoL,YAAA,IAGP,aACA,SAAAviM,EAAAnoB,CAAA,KAAAuiC,EAAA,CACOooL,SAAA,IAGP,gBACA,SAAAxiM,EAAAnoB,CAAA,KAAAuiC,EAAA,CACOooL,SAAA,IAGP,eACA,SAAAxiM,EAAAnoB,CAAA,KAAAuiC,EAAA,CACA/mD,QAAA0+B,EAAA1+B,OAAA,CACAxC,KAAAqC,KAAAA,EACAmC,MAAA,KACAmtO,SAAA,GACArlO,OAAA,UACOqkO,UAAAzvM,EAAAyvM,SAAA,EAGP,eACA,SAAAxhM,EAAAnoB,CAAA,KAAAuiC,EAAA,CACAvpD,KAAAkhC,EAAAlhC,IAAA,CACAwE,MAAA,KACA8H,OAAA,UACOqlO,SAAA,IAGP,aACA,SAAAxiM,EAAAnoB,CAAA,KAAAuiC,EAAA,CACAvpD,KAAAqC,KAAAA,EACAmC,MAAA08B,EAAA18B,KAAA,CACAktO,aAAAnoL,EAAAmoL,YAAA,GACAC,SAAA,GACOrlO,OAAA,SAGP,gBAAwB,SAAA6iC,EAAAnoB,CAAA,KAAAuiC,EAAAroB,EAAAqoB,KAAA,CAGxB,SACA,OAAAA,CACA,iBAAAxrD,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA4zO,CAAA,ICvO6C,IAAAC,EAAA5zO,EAAA,MAwGtC2zO,EAAA,GApGP,YACA,SAAAE,GAAA,CACA,KAAA/8G,KAAA,SAAAtpE,YAAA,GAGA,KAAAsmL,QAAA,UAAAlwN,CAAA,EACAA,GAAA,EAGA,KAAAmwN,aAAA,UAAAnwN,CAAA,EACAA,GACA,EAEA,IAAA8L,EAAAmkN,EAAA/kO,SAAA,CAqFC,OAlFD4gB,EAAAkiD,KAAA,UAAAhuD,CAAA,EACA,IAAAtf,CAAA,MAAAkpD,YAAA,GAGA,IACMlpD,EAAAsf,GACN,cAAA4pC,YAAA,GAGA,KAAAA,YAAA,EACA,KAAAv9B,KAAA,EACA,CAGA,OAAA3rB,CAAA,EAGAorB,EAAAutL,QAAA,UAAAr5L,CAAA,MAAAiL,EAAA,KAGA,KAAA2+B,YAAA,CACM,KAAAspE,KAAA,CAAAj3H,IAAA,CAAA+jB,GAEN,GAAAgwN,EAAAI,EAAA,aACOnlN,EAAAilN,QAAA,CAAAlwN,EACP,EAEA,EAMA8L,EAAAukN,UAAA,UAAArwN,CAAA,MAAAitN,EAAA,KAGA,kBACA,QAAAr3M,EAAAC,UAAAl4B,MAAA,CAAAsI,EAAA,MAAA2vB,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IACA7vB,CAAA,CAAA6vB,EAAA,CAAAD,SAAA,CAAAC,EAAA,CAGAm3M,EAAA5zB,QAAA,YACOr5L,EAAAxiB,KAAA,QAAAyI,EACP,EACA,GAGA6lB,EAAAO,KAAA,gBAAAqjN,EAAA,KAGAx8G,EAAA,KAAAA,KAAA,MAAAA,KAAA,IAGMA,EAAAv1H,MAAA,EACN,GAAAqyO,EAAAI,EAAA,aACAV,EAAAS,aAAA,YACAj9G,EAAAtpH,OAAA,UAAAoW,CAAA,EACW0vN,EAAAQ,QAAA,CAAAlwN,EACF,EACF,EACP,EAEA,EAOA8L,EAAAwkN,iBAAA,UAAAh9M,CAAA,EACA,KAAA48M,QAAA,CAAA58M,CACA,EAOAxH,EAAAykN,sBAAA,UAAAj9M,CAAA,EACA,KAAA68M,aAAA,CAAA78M,CAAA,EAGK28M,CAAA,IAEE,cAAA/zO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAq0O,CAAA,QAAAtE,EAAA9vO,EAAA,MAAA+vO,EAAA/vO,EAAA,MCxG+DgwO,EAAAhwO,EAAA,MA6F/Do0O,EAAA,GAzFL,UAAAnE,CAAA,EAGF,SAAAoE,GAAA,KAAAxlN,EAwBA,MAnBAA,CAHAA,EAAAohN,EAAAjhO,IAAA,cAGAmhO,KAAA,UAAAmE,CAAA,MAAAjE,EAGA,IAAAL,EAAAM,EAAA,SAAAD,CAAAA,EAAA3hO,MAAA,SAAA2hO,EAAAzpN,gBAAA,GACA,IAAAi6C,EAAA,WACA,OAAWyzK,GAAA,EAMX,OAFA5lO,OAAAkY,gBAAA,UAAAi6C,EAAA,IACAnyD,OAAAkY,gBAAA,WAAAi6C,EAAA,IACA,WAEAnyD,OAAAqY,mBAAA,UAAA85C,GACAnyD,OAAAqY,mBAAA,WAAA85C,EACA,CACA,GAGAhyC,CAAA,CA3BgB,GAAAihN,EAAA/mN,CAAA,EAAAsrN,EAAApE,GA6BhB,IAAAvgN,EAAA2kN,EAAAvlO,SAAA,CA2DE,OAxDF4gB,EAAA6gN,WAAA,YACA,KAAA9d,OAAA,EACA,KAAA+d,gBAAA,MAAAL,KAAA,CACA,EAGAzgN,EAAA+gN,aAAA,YACA,SAAAC,YAAA,QAAAC,CAGA,OAAAA,CAAAA,EAAA,KAAAle,OAAA,GAAAke,EAAA3hO,IAAA,OACA,KAAAyjN,OAAA,CAAAruN,KAAAA,CACA,GAGAsrB,EAAA8gN,gBAAA,UAAAL,CAAA,EACA,IAAAS,EAAAC,EAAA,KAGA,KAAAV,KAAA,CAAAA,EACA,MAAAS,CAAAA,EAAA,KAAAne,OAAA,GAAAme,EAAA5hO,IAAA,OACA,KAAAyjN,OAAA,CAAA0d,EAAA,SAAAoE,CAAA,EACA,kBAAAA,EACQ1D,EAAA2D,SAAA,CAAAD,GAER1D,EAAAyD,QAAA,EAEA,IAGA5kN,EAAA8kN,SAAA,UAAAD,CAAA,OAAAA,MAAA,CAAAA,EAGAA,GACA,KAAAD,QAAA,EACA,EAGA5kN,EAAA4kN,QAAA,YACA,KAAA54J,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACKA,GACL,IAGAnxC,EAAA+kN,QAAA,kBACA,uBAAAF,MAAA,CACA,KAAAA,MAAA,CAGA,oBAAAxrB,WAAA,SAAAA,UAAA2rB,MAAA,EAIA3rB,UAAA2rB,MAAA,EAGEL,CACK,EAAAtE,EAAAziM,CAAA,kBAAAxtC,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAsnO,CAAA,QAAA1nM,EAAA3/B,EAAA,MAAAmkD,EAAAnkD,EAAA,MAAA20O,EAAA30O,EAAA,MAAA2zO,EAAA3zO,EAAA,KAAAwxO,EAAAxxO,EAAA,MAAAuyO,EAAAvyO,EAAA,MCrFP40O,EAAA,WACA,SAAAA,EAAArrO,CAAA,EACA,KAAAsrO,mBAAA,IACA,KAAAC,YAAA,IACA,KAAAtpO,cAAA,CAAAjC,EAAAiC,cAAA,CACA,KAAAupO,UAAA,CAAAxrO,EAAA5E,OAAA,EACA,KAAAstO,SAAA,IACA,KAAAl7M,KAAA,CAAAxtB,EAAAwtB,KAAA,CACA,KAAAi+M,QAAA,CAAAzrO,EAAAyrO,QAAA,CACA,KAAAC,SAAA,CAAA1rO,EAAA0rO,SAAA,CACA,KAAAC,YAAA,CAAA3rO,EAAA+hD,KAAA,OAAAomL,eAAA,MAAA/sO,OAAA,EACA,KAAA2mD,KAAA,MAAA4pL,YAAA,CACA,KAAA/nO,IAAA,CAAA5D,EAAA4D,IAAA,CACA,KAAAgoO,UAAA,GAEA,IAAAzlN,EAAAklN,EAAA9lO,SAAA,CA4dC,OAzdD4gB,EAAAqlN,UAAA,UAAApwO,CAAA,MAAAywO,CAGA,MAAAzwO,OAAA,IAAAg7B,EAAA5W,CAAA,SAAyD,CAAAvd,cAAA,CAAA7G,GAAA,KAAAwI,IAAA,CAAAxI,IAAA,EAAAA,EAAA,OAAAA,EAAAwI,IAAA,CAGzD,KAAAkoO,SAAA,CAAAh0O,KAAAqrC,GAAA,MAAA2oM,SAAA,UAAAD,CAAAA,EAAA,KAAAzwO,OAAA,CAAA0wO,SAAA,EAAAD,EAAA,MAGA1lN,EAAA4lN,iBAAA,UAAA3wO,CAAA,EACA,KAAA6G,cAAA,CAAA7G,CAAA,EAGA+qB,EAAAylN,UAAA,gBAAAtmN,EAAA,KAEA,KAAA0mN,cAAA,GAGA,GAAApxL,EAAAqxL,EAAA,OAAAH,SAAA,GACA,MAAAI,SAAA,CAAA9xJ,WAAA,WACO90D,EAAA6mN,cAAA,EACP,OAAAL,SAAA,EACA,EAGA3lN,EAAA6lN,cAAA,YACA,KAAAE,SAAA,GACAp9G,aAAA,KAAAo9G,SAAA,EACA,KAAAA,SAAA,CAAArxO,KAAAA,EACA,EAGAsrB,EAAAgmN,cAAA,YACA,MAAAzD,SAAA,CAAA1wO,MAAA,GACA,KAAA+pD,KAAA,CAAAqqL,UAAA,CACA,KAAAb,YAAA,EACA,KAAAK,UAAA,GAGA,KAAAp+M,KAAA,CAAAolL,MAAA,OAEA,EAGAzsL,EAAAkmN,OAAA,UAAAC,CAAA,CAAAlxO,CAAA,EAEoC,IAFpCmxO,EAAAC,EAEoCC,EAAA,KAAA1qL,KAAA,CAAAvpD,IAAA,CAEgBA,EAAA,GAAAoiD,EAAA8xL,EAAA,EAAAJ,EAAAG,GAgBpD,MAbA,OAAAF,CAAAA,EAAA,CAAAC,EAAA,KAAApxO,OAAA,EAAAuxO,WAAA,SAAAJ,EAAA9mO,IAAA,CAAA+mO,EAAAC,EAAAj0O,EAAA,EACMA,EAAAi0O,EACN,UAAArxO,OAAA,CAAAwxO,iBAAA,EAEMp0O,CAAAA,EAAA,GAAAoiD,EAAAiyL,EAAA,EAAAJ,EAAAj0O,EAAA,EAIN,KAAAowO,QAAA,EACApwO,KAAAA,EACAkB,KAAA,UACKozO,cAAA1xO,IAAA,EAAAA,EAAA,OAAAA,EAAA2xO,SAAA,GAELv0O,CAAA,EAGA2tB,EAAAwiN,QAAA,UAAA5mL,CAAA,CAAAirL,CAAA,EACA,KAAApE,QAAA,EACAlvO,KAAA,WACAqoD,MAAAA,EACKirL,gBAAAA,CACL,IAGA7mN,EAAAyoL,MAAA,UAAAxzM,CAAA,EAGA,IAHA6xO,EAGAx0N,EAAA,KAAAA,OAAA,CAEA,OADA,IAAkC,EAAlCw0N,CAAAA,EAAA,KAAAjE,OAAA,GAAsCiE,EAAQr+B,MAAA,CAAAxzM,GAC9Cqd,EAAAA,EAAAsB,IAAA,CAAA6gC,EAAAioE,EAAA,EAAAprD,KAAA,CAAA7c,EAAAioE,EAAA,EAAA7qG,QAAAI,OAAA,IAGA+N,EAAAqxF,OAAA,YACA,KAAAw0H,cAAA,GACA,KAAAp9B,MAAA,EACK4jB,OAAA,EACL,IAGArsM,EAAAizF,KAAA,YACA,KAAA5B,OAAA,GACA,KAAAmxH,QAAA,MAAAgD,YAAA,GAGAxlN,EAAA8pH,QAAA,YACA,YAAAy4F,SAAA,CAAA7jK,IAAA,UAAAikK,CAAA,EACK,MAAAA,CAAA,IAAAA,EAAA1tO,OAAA,CAAA8xO,OAAA,EACL,EAGA/mN,EAAAimN,UAAA,YACA,YAAArqL,KAAA,CAAAqqL,UAAA,EAGAjmN,EAAAgnN,OAAA,YACA,YAAAprL,KAAA,CAAAqrL,aAAA,QAAArrL,KAAA,CAAA+qL,aAAA,OAAApE,SAAA,CAAA7jK,IAAA,UAAAikK,CAAA,EACK,OAAAA,EAAAuE,gBAAA,GAAAF,OAAA,EACL,EAGAhnN,EAAAmnN,aAAA,UAAAC,CAAA,EAKA,OAJA,SAAAA,GACAA,CAAAA,EAAA,GAGA,KAAAxrL,KAAA,CAAAqrL,aAAA,QAAArrL,KAAA,CAAA+qL,aAAA,MAAAlyL,EAAA4yL,EAAA,OAAAzrL,KAAA,CAAA+qL,aAAA,CAAAS,EAAA,EAGApnN,EAAA0gN,OAAA,YAGA,IAHA4G,EAGA3E,EAAA,KAAAJ,SAAA,CAAAxqO,IAAA,UAAAhE,CAAA,EACK,OAAAA,EAAAwzO,wBAAA,KAGL5E,GACMA,EAAA6E,OAAA,GAIN,MAAAF,CAAAA,EAAA,KAAAzE,OAAA,GAAAyE,EAAAxE,QAAA,IAGA9iN,EAAA4kN,QAAA,YAGA,IAHA6C,EAGA9E,EAAA,KAAAJ,SAAA,CAAAxqO,IAAA,UAAAhE,CAAA,EACK,OAAAA,EAAA2zO,sBAAA,KAGL/E,GACMA,EAAA6E,OAAA,GAIN,MAAAC,CAAAA,EAAA,KAAA5E,OAAA,GAAA4E,EAAA3E,QAAA,IAGA9iN,EAAA0iN,WAAA,UAAAC,CAAA,EACA,UAAAJ,SAAA,CAAA1xN,OAAA,CAAA8xN,KACA,KAAAJ,SAAA,CAAApyO,IAAA,CAAAwyO,GAAgC,KAAAyC,YAAA,IAGhC,KAAAS,cAAA,GACA,KAAAx+M,KAAA,CAAAihG,MAAA,EACA/0H,KAAA,gBACAo0O,MAAA,KACOhF,SAAAA,CACP,GACA,EAGA3iN,EAAA4iN,cAAA,UAAAD,CAAA,EACA,UAAAJ,SAAA,CAAA1xN,OAAA,CAAA8xN,KACA,KAAAJ,SAAA,MAAAA,SAAA,CAAAtnN,MAAA,UAAAlnB,CAAA,EACO,OAAAA,IAAA4uO,CAAA,GAGP,KAAAJ,SAAA,CAAA1wO,MAAA,GAGA,KAAAgxO,OAAA,GACA,KAAAA,OAAA,CAAA+E,qBAAA,OAAAzC,mBAAA,CACA,KAAAtC,OAAA,CAAAp6B,MAAA,EACao/B,OAAA,EACD,GAEZ,KAAAhF,OAAA,CAAAiF,WAAA,IAIA,KAAAnC,SAAA,CACU,KAAAF,UAAA,GAEV,KAAAp+M,KAAA,CAAAolL,MAAA,QAIA,KAAAplL,KAAA,CAAAihG,MAAA,EACA/0H,KAAA,kBACAo0O,MAAA,KACOhF,SAAAA,CACP,GACA,EAGA3iN,EAAA+nN,iBAAA,YACA,YAAAxF,SAAA,CAAA1wO,MAAA,EAGAmuB,EAAAgoN,UAAA,YACA,KAAApsL,KAAA,CAAAqrL,aAAA,EACA,KAAAxE,QAAA,EACOlvO,KAAA,YACP,EACA,EAGAysB,EAAAnQ,KAAA,UAAA5a,CAAA,CAAAgzO,CAAA,EACA,IAWAC,EAkEAC,EASAC,EArFAC,EACAC,EAAAC,EAFApH,EAAA,KAKA,QAAAvlL,KAAA,CAAAqqL,UAAA,EACA,QAAArqL,KAAA,CAAA+qL,aAAA,EAAAsB,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAO,aAAA,EAEA,KAAA//B,MAAA,EACS4jB,OAAA,EACD,QACR,QAAA/5M,OAAA,CAMA,OAH2F,MAAA41N,CAAAA,EAAA,KAAArF,OAAA,GAAAqF,EAAAO,aAAA,GAG3F,KAAAn2N,OAAA,CACM,GAINrd,GACM,KAAAowO,UAAA,CAAApwO,GAKN,MAAAA,OAAA,CAAAyzO,OAAA,EACA,IAAA/F,EAAA,KAAAJ,SAAA,CAAAxqO,IAAA,UAAAhE,CAAA,EACO,OAAAA,EAAAkB,OAAA,CAAAyzO,OAAA,GAGP/F,GACA,KAAA0C,UAAA,CAAA1C,EAAA1tO,OAAA,CACA,KAGAqwO,EAAA,GAAA7wL,EAA0Bk0L,EAAA,OAAkBrD,QAAI,EAAAsD,EAAA,GAAAn0L,EAAAo0L,EAAA,IAGhDC,EAAA,CACAxD,SAAAA,EACAyD,UAAAr0O,KAAAA,EACA+I,KAAA,KAAAA,IAAA,EAEA/J,OAAA8L,cAAA,CAAAspO,EAAA,UACAnsN,WAAA,GACAjJ,IAAA,WACA,GAAAk1N,EAEA,OADAzH,EAAAgE,mBAAA,IACAyD,EAAAh0N,MAAA,CAIQ,GAGR,IAAAo0N,EAAA,kBACA,EAAA/zO,OAAA,CAAAyzO,OAAA,EAIAvH,EAAAgE,mBAAA,IACOhE,EAAAlsO,OAAA,CAAAyzO,OAAA,CAAAI,IAJPj3N,QAAAC,MAAA,qBAQAjd,EAAA,CACAozO,aAAAA,EACAhzO,QAAA,KAAAA,OAAA,CACAqwO,SAAAA,EACA1pL,MAAA,KAAAA,KAAA,CACAotL,QAAAA,EACAvrO,KAAA,KAAAA,IAAA,EA2EA,MAxEA,OAAA4qO,CAAAA,EAAA,KAAApzO,OAAA,CAAAg0O,QAAA,SAAAZ,EAAAa,OAAA,GAGM,OAAAf,CAAAA,EAAA,KAAAlzO,OAAA,CAAAg0O,QAAA,GAAAd,EAAAe,OAAA,CAAAr0O,EAAA,EAG6B,KAAAs0O,WAAA,MAAAvtL,KAAA,CAGnC,KAAAA,KAAA,CAAAqqL,UAAA,OAAArqL,KAAA,CAAAwtL,SAAA,UAAAd,CAAAA,EAAAzzO,EAAAozO,YAAA,SAAAK,EAAA7qO,IAAA,GAGA,KAAAglO,QAAA,EACAlvO,KAAA,QACOkK,KAAA,MAAA2qO,CAAAA,EAAAvzO,EAAAozO,YAAA,SAAAG,EAAA3qO,IAAA,GAKP,KAAAolO,OAAA,KAAAA,EAAAS,EAAA,EACA97M,GAAA3yB,EAAAm0O,OAAA,CACAxyN,MAAAoyN,IAAA,EAAAA,EAAA,aAAAL,CAAAA,EAAAK,EAAApyN,KAAA,SAAA+xN,EAAAh7N,IAAA,CAAAq7N,EAAA,CACAzF,UAAA,SAA8B9wO,CAAA,EAAA8uO,EAAA+E,OAAA,CAAA7zO,GAGwE8uO,IAAA,EAAAA,EAAA95M,KAAA,CAAAxtB,MAAA,CAAAspO,SAAA,EAAAhC,EAAA95M,KAAA,CAAAxtB,MAAA,CAAAspO,SAAA,CAAA9wO,EAAA8uO,GAGtG,IAAAA,EAAAwE,SAAA,EACAxE,EAAA6E,cAAA,EAEA,EACA5W,QAAA,SAAAv4N,CAAA,EAEA,GAAAgsO,EAAAwG,EAAA,EAAAxyO,IAAAA,EAAAw1N,MAAA,EACA8U,EAAAsB,QAAA,EACAlvO,KAAA,QACWsD,MAAAA,CACX,GAGA,GAAAgsO,EAAAwG,EAAA,EAAAxyO,KACqGsqO,IAAA,EAAAA,EAAA95M,KAAA,CAAAxtB,MAAA,CAAAu1N,OAAA,EAAA+R,EAAA95M,KAAA,CAAAxtB,MAAA,CAAAu1N,OAAA,CAAAv4N,EAAAsqO,GAG3F,GAAAW,EAAA38M,CAAA,IAAAtuB,KAAA,CAAAA,IAIV,IAAAsqO,EAAAwE,SAAA,EACAxE,EAAA6E,cAAA,EAEA,EACAxC,OAAA,WACArC,EAAAsB,QAAA,EACSlvO,KAAA,QACF,EACP,EACAkwO,QAAA,WACAtC,EAAAsB,QAAA,EACSlvO,KAAA,OACF,EACP,EACAmwO,WAAA,WACAvC,EAAAsB,QAAA,EACSlvO,KAAA,UACF,EACP,EACA8sF,MAAAxrF,EAAAI,OAAA,CAAAorF,KAAA,CACKsjJ,WAAA9uO,EAAAI,OAAA,CAAA0uO,UAAA,GAEL,KAAArxN,OAAA,MAAAuwN,OAAA,CAAAvwN,OAAA,CACA,KAAAA,OAAA,EAGA0N,EAAAyiN,QAAA,UAAAlvM,CAAA,MAAAqwM,EAAA,KAGI,KAAAhoL,KAAA,MAAAioL,OAAA,MAAAjoL,KAAA,CAAAroB,GACJ0wM,EAAAlhL,CAAA,CAAAmf,KAAA,YACA0hK,EAAArB,SAAA,CAAAzkO,OAAA,UAAA6kO,CAAA,EACOA,EAAA2G,aAAA,CAAA/1M,EAAA,GAGPqwM,EAAAv8M,KAAA,CAAAihG,MAAA,EACAq/G,MAAA/D,EACArwO,KAAA,eACOggC,OAAAA,CACF,EACL,IAGAvT,EAAAgiN,eAAA,UAAA/sO,CAAA,EACA,IAAA5C,EAAA,mBAAA4C,EAAAs0O,WAAA,CAAAt0O,EAAAs0O,WAAA,GAAAt0O,EAAAs0O,WAAA,CAEAC,EAAAC,KADA,IAAAx0O,EAAAs0O,WAAA,CACA,mBAAAt0O,EAAAu0O,oBAAA,CAAAv0O,EAAAu0O,oBAAA,GAAAv0O,EAAAu0O,oBAAA,GACAE,EAAA,SAAAr3O,EACA,OACAA,KAAAA,EACAs3O,gBAAA,EACAhD,cAAA+C,EAAAF,IAAA,EAAAA,EAAAA,EAAAp9I,KAAAwzD,GAAA,KACA/oJ,MAAA,KACA+yO,iBAAA,EACAC,eAAA,EACAC,kBAAA,EACAV,UAAA,KACAnD,WAAA,GACAgB,cAAA,GACAjD,SAAA,GACArlO,OAAA+qO,EAAA,iBACA,EAGA1pN,EAAA6jN,OAAA,UAAAjoL,CAAA,CAAAroB,CAAA,MAAAw2M,EAAAC,EAGA,OAAAz2M,EAAAhgC,IAAA,EACA,aACA,SAAA08B,EAAA5W,CAAA,KAAAuiC,EAAA,CACSkuL,kBAAAluL,EAAAkuL,iBAAA,IAGT,aACA,SAAA75M,EAAA5W,CAAA,KAAAuiC,EAAA,CACSooL,SAAA,IAGT,gBACA,SAAA/zM,EAAA5W,CAAA,KAAAuiC,EAAA,CACSooL,SAAA,IAGT,aACA,SAAA/zM,EAAA5W,CAAA,KAAAuiC,EAAA,CACAkuL,kBAAA,EACAV,UAAA,MAAAW,CAAAA,EAAAx2M,EAAA91B,IAAA,EAAAssO,EAAA,KACA9D,WAAA,GACSjC,SAAA,EACT,GAAApoL,EAAA+qL,aAAA,GACA9vO,MAAA,KACS8H,OAAA,WAGT,eACA,SAAAsxB,EAAA5W,CAAA,KAAAuiC,EAAA,CACAvpD,KAAAkhC,EAAAlhC,IAAA,CACAs3O,gBAAA/tL,EAAA+tL,eAAA,GACAhD,cAAA,MAAAqD,CAAAA,EAAAz2M,EAAAozM,aAAA,EAAAqD,EAAA59I,KAAAwzD,GAAA,GACA/oJ,MAAA,KACAizO,kBAAA,EACA7D,WAAA,GACAgB,cAAA,GACAjD,SAAA,GACSrlO,OAAA,WAGT,iBAAA9H,EAAA08B,EAAA18B,KAAA,CAGA,MAAAgsO,EAAiBwG,EAAQ,EAAAxyO,IAAGA,EAAAgxO,MAAA,OAAAsB,WAAA,CAC5B,SAAAl5M,EAAA5W,CAAA,UAAA8vN,WAAA,EAGA,SAAAl5M,EAAA5W,CAAA,KAAAuiC,EAAA,CACA/kD,MAAAA,EACA+yO,iBAAAhuL,EAAAguL,gBAAA,GACAC,eAAAz9I,KAAAwzD,GAAA,GACAkqF,kBAAAluL,EAAAkuL,iBAAA,GACA7D,WAAA,GACAjC,SAAA,GACSrlO,OAAA,SAGT,kBACA,SAAAsxB,EAAA5W,CAAA,KAAAuiC,EAAA,CACSqrL,cAAA,IAGT,gBAA0B,SAAAh3M,EAAA5W,CAAA,KAAAuiC,EAAAroB,EAAAqoB,KAAA,CAG1B,SACA,OAAAA,CACA,GAGCspL,CAAA,IAAA+E,EAAA35O,EAAA,MC5eC45O,EAAA,SAAc3J,CAAA,EAGhB,SAAA2J,EAAArwO,CAAA,MAAAslB,EAOA,MAHAA,CADAA,EAAAohN,EAAAjhO,IAAA,cACAzF,MAAA,CAAAA,GAAA,GACAslB,EAAAgrN,OAAA,IACAhrN,EAAAirN,UAAA,IACAjrN,CAAA,CAVgB,GAAA8lN,EAAA5rN,CAAA,EAAA6wN,EAAA3J,GAYhB,IAAAvgN,EAAAkqN,EAAA9qO,SAAA,CA+HE,OA5HF4gB,EAAAi9B,KAAA,UAAAsxF,CAAA,CAAAt5I,CAAA,CAAA2mD,CAAA,EAGA,IAHAyuL,EAGA/E,EAAArwO,EAAAqwO,QAAA,CACAC,EAAA,MAAA8E,CAAAA,EAAAp1O,EAAAswO,SAAA,EAAA8E,EAAA,GAAA51L,EAAA61L,EAAA,EAAAhF,EAAArwO,EAAA,CAAA0yO,EAAA,KAAAj0N,GAAA,CAAA6xN,GAgBA,OAbAoC,IACAA,EAAA,IAAAzC,EAAA,CACA79M,MAAA,KACAi+M,SAAAA,EACAC,UAAAA,EACAtwO,QAAAs5I,EAAAg8F,mBAAA,CAAAt1O,GACA2mD,MAAAA,EACA9/C,eAAAyyI,EAAAi8F,gBAAA,CAAAlF,GACO7nO,KAAAxI,EAAAwI,IAAA,GAEP,KAAAvH,GAAA,CAAAyxO,IAGAA,CAAA,EAGA3nN,EAAA9pB,GAAA,UAAAyxO,CAAA,EACA,KAAAyC,UAAA,CAAAzC,EAAApC,SAAA,IACA,KAAA6E,UAAA,CAAAzC,EAAApC,SAAA,EAAAoC,EACA,KAAAwC,OAAA,CAAAh6O,IAAA,CAAAw3O,GACA,KAAAr/G,MAAA,EACA/0H,KAAA,aACOo0O,MAAAA,CACP,GACA,EAGA3nN,EAAAysL,MAAA,UAAAk7B,CAAA,MAAA8C,EAAA,KAAAL,UAAA,CAAAzC,EAAApC,SAAA,EAGAkF,IACA9C,EAAAt2H,OAAA,GACA,KAAA84H,OAAA,MAAAA,OAAA,CAAAlvN,MAAA,UAAAlnB,CAAA,EACO,OAAAA,IAAA4zO,CAAA,GAGP8C,IAAA9C,GACA,YAAAyC,UAAA,CAAAzC,EAAApC,SAAA,EAGA,KAAAj9G,MAAA,EACA/0H,KAAA,eACOo0O,MAAAA,CACP,GACA,EAGA3nN,EAAA0sL,KAAA,gBAAAy0B,EAAA,KAGA8C,EAAAlhL,CAAA,CAAAmf,KAAA,YACAi/J,EAAAgJ,OAAA,CAAArsO,OAAA,UAAA6pO,CAAA,EACOxG,EAAA10B,MAAA,CAAAk7B,EACF,EACL,IAGA3nN,EAAAtM,GAAA,UAAA6xN,CAAA,EACA,YAAA6E,UAAA,CAAA7E,EAAA,EAGAvlN,EAAA0qN,MAAA,YACA,YAAAP,OAAA,EAGAnqN,EAAAjoB,IAAA,UAA2BikK,CAAA,CAAAC,CAAA,EAC3B,IAAApqG,EAAA84K,CAAA,EAAAl2L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAA,IAOA,OAJA,SAAApqG,EAAAkuK,KAAA,EACAluK,CAAAA,EAAAkuK,KAAA,KAGA,IAAa,CAAAoK,OAAA,CAAApyO,IAAA,UAAA4vO,CAAU,EAClB,SAAAlzL,EAAAswE,EAAA,EAAAlzD,EAAA81K,EACL,IAGA3nN,EAAA6qN,OAAA,UAA4B7uE,CAAA,CAAAC,CAAA,EAC5B,IAAApqG,EAAAi5K,CAAA,EAAAr2L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAA,IAGA,OAAAvoK,OAAaiE,IAAA,CAAAk6D,GAAAhgE,MAAA,CAAU,OAAAs4O,OAAA,CAAAlvN,MAAA,UAAA0sN,CAAA,EAClB,SAAAlzL,EAAAswE,EAAA,EAAAlzD,EAAA81K,EACL,QAAAwC,OAAA,EAGAnqN,EAAAsoG,MAAA,UAAAlhD,CAAA,MAAAw8J,EAAA,KAGAK,EAAAlhL,CAAA,CAAAmf,KAAA,YACA0hK,EAAA53J,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACOA,EAAAiW,EACF,EACL,IAGApnD,EAAA0gN,OAAA,gBAAAqK,EAAA,KAGA9G,EAAAlhL,CAAA,CAAAmf,KAAA,YACA6oK,EAAAZ,OAAA,CAAArsO,OAAA,UAAA6pO,CAAA,EACOA,EAAAjH,OAAA,EACF,EACL,IAGA1gN,EAAA4kN,QAAA,gBAAAoG,EAAA,KAGA/G,EAAAlhL,CAAA,CAAAmf,KAAA,YACA8oK,EAAAb,OAAA,CAAArsO,OAAA,UAAA6pO,CAAA,EACOA,EAAA/C,QAAA,EACF,EACL,IAGEsF,CAAY,EAAAD,EAAArsM,CAAA,EAAAqtM,EAAA36O,EAAA,MC1IZ46O,EAAA,SAAc3K,CAAA,EAGhB,SAAA2K,EAAArxO,CAAA,MAAAslB,EAOA,MAHAA,CADAA,EAAAohN,EAAAjhO,IAAA,cACAzF,MAAA,CAAAA,GAAA,GACAslB,EAAAgsN,SAAA,IACAhsN,EAAAkjN,UAAA,GACAljN,CAAA,CAVgB,GAAA8lN,EAAA5rN,CAAA,EAAA6xN,EAAA3K,GAYhB,IAAAvgN,EAAAkrN,EAAA9rO,SAAA,CA0FE,OAvFF4gB,EAAAi9B,KAAA,UAAuBsxF,CAAA,CAAAt5I,CAAA,CAAA2mD,CAAQ,EAC/B,IAAAwvL,EAAA,IAAAH,EAAAnwN,CAAA,EACAwnN,cAAA,KACAD,WAAA,OAAAA,UAAA,CACAptO,QAAAs5I,EAAA88F,sBAAA,CAAAp2O,GACA2mD,MAAAA,EACA9/C,eAAA7G,EAAAq2O,WAAA,CAAA/8F,EAAAg9F,mBAAA,CAAAt2O,EAAAq2O,WAAA,EAAA52O,KAAAA,CAAA,CACK+I,KAAAxI,EAAAwI,IAAA,GAGL,OADA,KAAAvH,GAAA,CAAAk1O,GACAA,CAAA,EAGAprN,EAAA9pB,GAAA,UAAAk1O,CAAA,EACA,KAAAD,SAAA,CAAAh7O,IAAA,CAAAi7O,GACA,KAAA9iH,MAAA,CAAA8iH,EAAA,EAGAprN,EAAAysL,MAAA,UAAA2+B,CAAA,EACA,KAAAD,SAAA,MAAAA,SAAA,CAAAlwN,MAAA,UAAAlnB,CAAA,EACK,OAAAA,IAAAq3O,CACL,GACAA,EAAA3iC,MAAA,GACA,KAAAngF,MAAA,CAAA8iH,EAAA,EAGAprN,EAAA0sL,KAAA,gBAAAy0B,EAAA,KAGA8C,EAAAlhL,CAAA,CAAAmf,KAAA,YACAi/J,EAAAgK,SAAA,CAAArtO,OAAA,UAAAstO,CAAA,EACOjK,EAAA10B,MAAA,CAAA2+B,EACF,EACL,IAGAprN,EAAA0qN,MAAA,YACA,YAAAS,SAAA,EAGAnrN,EAAAjoB,IAAA,UAAA85D,CAAA,EAKA,OAJA,SAAAA,EAAAkuK,KAAA,EACAluK,CAAAA,EAAAkuK,KAAA,KAGA,IAAa,CAAAoL,SAAA,CAAApzO,IAAA,UAAAqzO,CAAa,EACrB,SAAA32L,EAAA+2L,EAAA,EAAA35K,EAAAu5K,EACL,IAGAprN,EAAA6qN,OAAA,UAAAh5K,CAAA,EACA,WAAa,CAAAs5K,SAAA,CAAAlwN,MAAA,UAAAmwN,CAAa,EACrB,SAAA32L,EAAA+2L,EAAA,EAAA35K,EAAAu5K,EACL,IAGAprN,EAAAsoG,MAAA,UAAA8iH,CAAA,MAAAxH,EAAA,KAGAK,EAAAlhL,CAAA,CAAAmf,KAAA,YACA0hK,EAAA53J,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACOA,EAAAi6K,EACF,EACL,IAGAprN,EAAA0gN,OAAA,YACA,KAAA+K,qBAAA,IAGAzrN,EAAA4kN,QAAA,YACA,KAAA6G,qBAAA,IAGAzrN,EAAAyrN,qBAAA,YACA,IAAAC,EAAA,KAAAP,SAAA,CAAAlwN,MAAA,UAAAlnB,CAAA,EACK,OAAAA,EAAA6nD,KAAA,CAAAooL,QAAA,GAEL,OAAAC,EAAAlhL,CAAA,CAAAmf,KAAA,YACA,OAAAwpK,EAAA1/N,MAAA,UAAAsG,CAAA,CAAA84N,CAAA,EACA,OAAA94N,EAAAsB,IAAA,YACS,OAAAw3N,EAAAtI,QAAA,GAAAxxK,KAAA,CAAA7c,EAAAioE,EAAA,CACF,EACF,EAAA7qG,QAAAI,OAAA,GACL,IAGEi5N,CAAY,EAAAjB,EAAArsM,CAAA,EAAAuiM,EAAA7vO,EAAA,MAAAo0O,EAAAp0O,EAAA,IC3Gd,SAAAq7O,GAAA,CACA,OACAzC,QAAA,SAAAr0O,CAAA,EACAA,EAAAm0O,OAAA,YAGA,IAHAV,EAAAF,EAAAwD,EAAAC,EAAAC,EAAAC,EAoDqBz5N,EAjDrB05N,EAAA,MAAA1D,CAAAA,EAAAzzO,EAAAozO,YAAA,eAAAG,CAAAA,EAAAE,EAAA7qO,IAAA,SAAA2qO,EAAA4D,WAAA,CACAC,EAAA,MAAAL,CAAAA,EAAA/2O,EAAAozO,YAAA,eAAA4D,CAAAA,EAAAD,EAAAnuO,IAAA,SAAAouO,EAAAI,SAAA,CACAlD,EAAAkD,IAAA,EAAAA,EAAA,OAAAA,EAAAlD,SAAA,CACAmD,EAAA,CAAAD,IAAA,EAAAA,EAAA,OAAAA,EAAA33M,SAAA,cACA63M,EAAA,CAAAF,IAAA,EAAAA,EAAA,OAAAA,EAAA33M,SAAA,eACA83M,EAAA,OAAAN,CAAAA,EAAAj3O,EAAA+mD,KAAA,CAAAvpD,IAAA,SAAAy5O,EAAAO,KAAA,MACAC,EAAA,KAAgD,EAAlBP,CAAAA,EAAAl3O,EAAA+mD,KAAkB,CAAAvpD,IAAA,SAAA05O,EAAAQ,UAAA,MAChD3D,EAAA,GAAAn0L,EAAAo0L,EAAA,IACAplG,EAAAmlG,IAAA,EAAAA,EAAA,OAAAA,EAAAh0N,MAAA,CACA43N,EAAAF,EAA+BG,EAAA,GAG/B/D,EAAA7zO,EAAAI,OAAA,CAAAyzO,OAAA,aACA,OAAA72N,QAAAC,MAAA,qBAGA46N,EAAA,SAAAL,CAAA,CAAAv1B,CAAA,CAAA61B,CAAA,CAAAjoN,CAAA,EAEA,OADA8nN,EAAA9nN,EAAA,CAAAoyL,EAAA,CAAA/vL,MAAA,CAAAylN,GAAA,GAAAzlN,MAAA,CAAAylN,EAAA,CAAA11B,EAAA,EACWpyL,EAAA,CAAAioN,EAAA,CAAA5lN,MAAA,CAAAslN,GAAA,GAAAtlN,MAAA,CAAAslN,EAAA,CAAAM,EAAA,GAIXC,EAAA,SAAAP,CAAA,CAAAQ,CAAA,CAAA/1B,CAAA,CAAApyL,CAAA,EACA,GAAA+nN,EACA,OAAA56N,QAAAC,MAAA,cAGA,YAAAglM,GAAA,CAAA+1B,GAAAR,EAAAx6O,MAAA,CACA,OAAAggB,QAAAI,OAAA,CAAAo6N,EAAA,CASA,IAAAS,EAAApE,EANA,CACApD,SAAAzwO,EAAAywO,QAAA,CACA1wN,OAAA6uH,EACAslG,UAAAjyB,EACAr5M,KAAA5I,EAAA4I,IAAA,GAGA6U,EAAAT,QAAAI,OAAA,CAAA66N,GAAAl5N,IAAA,UAAA+4N,CAAA,EACW,OAAAD,EAAAL,EAAAv1B,EAAA61B,EAAAjoN,EAAA,GAQX,MALA,GAAAm+M,EAAAl+B,EAAA,EAAAmoC,IAEAC,CAAAA,EAAAtkC,MAAA,CAAAqkC,EAAArkC,MAAA,EAGAn2L,CAAA,EAKA,GAAA85N,EAAAv6O,MAAA,EAGA,GAAAq6O,EAAA,CACA,IAAAW,EAAA,SAAA9D,EACAjyB,EAAA+1B,EAAA9D,EAAAiE,EAAAn4O,EAAAI,OAAA,CAAAm3O,EAAA,CACY95N,EAAAs6N,EAAAR,EAAAS,EAAA/1B,EACZ,MACA,GAAAq1B,EAAA,KAAAc,EAAA,SAAAlE,EAEAmE,EAAAD,EAAAlE,EAAAoE,EAAAt4O,EAAAI,OAAA,CAAAm3O,EAAA,CAGc95N,EAAAs6N,EAAAR,EAAAa,EAAAC,EAAA,GACd,MAEA,WACAV,EAAA,GACA,IAAAK,EAAA,SAAAh4O,EAAAI,OAAA,CAAA+3O,gBAAA,CAEgK16N,EAAA86N,CAFxCpB,IAAAI,CAAA,KAAAJ,EAAAI,CAAA,MAAAA,GAEwCQ,EAAA,GAAAC,EAAAP,CAAA,KAAAz6N,QAAAI,OAAA,CAAAy6N,EAAA,GAAAJ,CAAA,IAAAF,CAAA,MAiBhK,QAdAiB,EAAA,SAAAp2O,CAAA,EACAqb,EAAAA,EAAAsB,IAAA,UAAAy4N,CAAA,EAGA,GAHAL,CAAAA,IAAAI,CAAA,CAAAn1O,EAAA,EAAA+0O,EAAAI,CAAA,CAAAn1O,EAAA,CAAAA,EAAAm1O,GAGA,KAAAkB,EAAAT,EAAAP,CAAA,CAAAr1O,EAAA,CAAA+1O,EAAAn4O,EAAAI,OAAA,CAAAo3O,EAAA,CAGA,OAAAO,EAAAP,EAAAQ,EAAAS,EAAA,QAGqBz7N,QAAAI,OAAA,CAAAy6N,EAAAL,EAAAC,CAAA,CAAAr1O,EAAA,CAAAm1O,CAAA,CAAAn1O,EAAA,EACrB,IAGAA,EAAA,EAAAA,EAAAm1O,EAAAv6O,MAAA,CAAAoF,IACAo2O,EAAAp2O,EAEA,SAvCUqb,EAAAs6N,EAAA,GAuCV,CAGA,IAAAW,EAAAj7N,EAAAsB,IAAA,UAAAy4N,CAAA,EACA,OACAA,MAAAA,EACAE,WAAAC,CACS,CACT,GAYA,OATAgB,EAAA/kC,MAAA,YACAgkC,EAAA,GAAA7D,IAAA,EAAAA,GAAAA,EAAApyN,KAAA,GAGA,GAAAqsN,EAAAl+B,EAAA,EAAAryL,IACAA,EAAAm2L,MAAA,EACA,EAGA8kC,CACA,CACA,CACA,CACO,CACP,SAAAP,EAAA/3O,CAAA,CAAAo3O,CAAA,EACA,OAAAp3O,IAAA,EAAAA,EAAA+3O,gBAAA,QAAA/3O,EAAA+3O,gBAAA,CAAAX,CAAA,CAAAA,EAAAx6O,MAAA,IAAAw6O,EAAA,CAEA,SAAAc,EAAAl4O,CAAA,CAAAo3O,CAAA,EACA,OAAAp3O,IAAA,EAAAA,EAAAk4O,oBAAA,QAAAl4O,EAAAk4O,oBAAA,CAAAd,CAAA,IAAAA,EAAA,CCxHA,IAAA1U,EAAA,WACA,SAAAA,EAAA99N,CAAA,EACA,SAAAA,GACAA,CAAAA,EAAA,IAGA,KAAA4zO,UAAA,CAAA5zO,EAAA4zO,UAAA,MAAAvD,EACA,KAAA5H,aAAA,CAAAzoO,EAAAyoO,aAAA,MAAA4I,EACA,KAAApvO,cAAA,CAAAjC,EAAAiC,cAAA,KACA,KAAA4xO,aAAA,IACA,KAAAC,gBAAA,IAEA,IAAA3tN,EAAA23M,EAAAv4N,SAAA,CAuUC,OApUD4gB,EAAA4tN,KAAA,gBAAAzuN,EAAA,KAGA,KAAA0uN,gBAAU,CAAA1N,EAA4Bh7M,CAAA,CAAA6rC,SAAA,YACtCmvK,EAAAh7M,CAAA,CAAAm8M,SAAA,IAAAoD,EAAA7hL,CAAA,CAAAkiL,QAAA,KAAA5lN,EAAAmjN,aAAA,CAAA5B,OAAA,GAGAvhN,EAAAsuN,UAAA,CAAA/M,OAAA,GAEA,GACA,KAAAoN,iBAAU,CAAApJ,EAA4B7hL,CAAA,CAAAmO,SAAA,YACtCmvK,EAAAh7M,CAAA,CAAAm8M,SAAA,IAAAoD,EAAA7hL,CAAA,CAAAkiL,QAAA,KAAA5lN,EAAAmjN,aAAA,CAAAsC,QAAA,GAGAzlN,EAAAsuN,UAAA,CAAA7I,QAAA,GAEA,IAGA5kN,EAAA+tN,OAAA,gBAAAC,EAAAC,CAGA,OAAAD,CAAAA,EAAA,KAAAH,gBAAA,GAAAG,EAAA1uO,IAAA,OACA,MAAA2uO,CAAAA,EAAA,KAAAH,iBAAA,GAAAG,EAAA3uO,IAAA,QAGA0gB,EAAAimN,UAAA,UAA2BjqE,CAAA,CAAAC,CAAA,EAC3B,IAAApqG,EAAA84K,CAAA,EAAAl2L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAA,IAIA,OADApqG,EAAAq8K,QAAA,IACA,KAAAT,UAAA,CAAA5C,OAAA,CAAAh5K,GAAAhgE,MAAA,EAGAmuB,EAAAmuN,UAAA,UAAsCt8K,CAAA,EACtC,YAAAywK,aAAA,CAAAuI,OAAA,IAAA56M,EAAA5W,CAAA,KAAAw4C,EAAA,CACKq8K,SAAA,EACL,IAAAr8O,MAAA,EAGAmuB,EAAAouN,YAAA,UAAA9I,CAAA,CAAAzzK,CAAA,MAAAw8K,EAGA,aAAAA,CAAAA,EAAA,KAAAZ,UAAA,CAAA11O,IAAA,CAAAutO,EAAAzzK,EAAA,SAAAw8K,EAAAzyL,KAAA,CAAAvpD,IAAA,EAGA2tB,EAAAsuN,cAAA,UAAAC,CAAA,EACA,YAAAC,aAAA,GAAA3D,OAAA,CAAA0D,GAAAz8O,GAAA,UAAAm3B,CAAA,EAIK,OAHLA,EAAAq8M,QAAA,CAEA1pL,EADAA,KAAA,CACAvpD,IAAA,CACK,EACL,EAGA2tB,EAAAyuN,YAAA,CAAwB,SAAAnJ,CAAA,CAAca,CAAA,CAAAlxO,CAAA,EACtC,IAAAy5O,EAAA,GAAAj6L,EAAAk6L,EAAA,EAAArJ,GACAsJ,EAAA,KAAArE,mBAAA,CAAAmE,GACA,YAAAjB,UAAA,CAAAxwL,KAAA,MAAA2xL,GAAA1I,OAAA,CAAAC,EAAAlxO,EAAA,EAGA+qB,EAAA6uN,cAAA,UAAAN,CAAA,CAAApI,CAAA,CAAAlxO,CAAA,MAAAksO,EAAA,KAGA,OAAA8C,EAAAlhL,CAAA,CAAAmf,KAAA,YACA,OAAAi/J,EAAAqN,aAAA,GAAA3D,OAAA,CAAA0D,GAAAz8O,GAAA,UAAAg9O,CAAA,EACA,IAAAxJ,EAAAwJ,EAAAxJ,QAAA,CACO,OAAAA,EAAAnE,EAAAsN,YAAA,CAAAnJ,EAAAa,EAAAlxO,GAAA,EAEP,IAGA+qB,EAAA+uN,aAAA,UAAAzJ,CAAA,CAAAzzK,CAAA,MAAAm9K,EAGA,aAAAA,CAAAA,EAAA,KAAAvB,UAAA,CAAA11O,IAAA,CAAAutO,EAAAzzK,EAAA,SAAAm9K,EAAApzL,KAAA,EAGA57B,EAAAivN,aAAA,UAA4BjzE,CAAA,CAAAC,CAAA,EAC5B,IAAApqG,EAAAi5K,CAAA,EAAAr2L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAA,IAGIwxE,EAAA,KAAAA,UAAA,CACJxJ,EAAAlhL,CAAA,CAAAmf,KAAA,YACAurK,EAAA5C,OAAA,CAAAh5K,GAAA/zD,OAAA,UAAA6pO,CAAA,EACO8F,EAAAhhC,MAAA,CAAAk7B,EACF,EACL,IAGA3nN,EAAAkvN,YAAA,UAAAlzE,CAAA,CAAAC,CAAA,CAAAC,CAAA,MAAA0nE,EAAA,KAGAuL,EAAA,GAAA16L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAAC,GACArqG,EAAAs9K,CAAA,IAAAl6O,EAAAk6O,CAAA,IAEA1B,EAAA,KAAAA,UAAA,CAGA2B,EAAA,GAAAn/M,EAAA5W,CAAA,KAAAw4C,EAAA,CACKr+B,OAAA,KAGL,OAAAywM,EAAAlhL,CAAA,CAAAmf,KAAA,YAIK,OAHLurK,EAAA5C,OAAA,CAAAh5K,GAAA/zD,OAAA,UAAA6pO,CAAA,EACOA,EAAA10H,KAAA,EACP,GACK2wH,EAAAyL,cAAA,CAAAD,EAAAn6O,EACL,IAGA+qB,EAAAsvN,aAAA,UAAAtzE,CAAA,CAAAC,CAAA,CAAAC,CAAA,MAAA6uE,EAAA,KAGAwE,EAAA,GAAA96L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAAC,GACArqG,EAAA09K,CAAA,IACAC,EAAAD,CAAA,IAA2DE,EAAAD,KAAA,IAAAA,EAAA,GAAAA,CAAA,CAY3D,OATA,SAAAC,EAAA5H,MAAA,EACA4H,CAAAA,EAAA5H,MAAA,KAQAh2N,QAAAqkC,GAAA,CALA+tL,EAAAlhL,CAAA,CAAAmf,KAAA,YACA,OAAA6oK,EAAA0C,UAAA,CAAA5C,OAAA,CAAAh5K,GAAA//D,GAAA,UAAA61O,CAAA,EACO,OAAAA,EAAAl/B,MAAA,CAAAgnC,EACF,EACL,IACA77N,IAAA,CAAA6gC,EAAAioE,EAAA,EAAAprD,KAAA,CAAA7c,EAAAioE,EAAA,GAGA18F,EAAA0vN,iBAAA,UAAA1zE,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAyzE,EACAC,EACAC,EAAA7E,EAAA,KAGA8E,EAAA,GAAAr7L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAAC,GACArqG,EAAAi+K,CAAA,IAAA76O,EAAA66O,CAAA,IAGAV,EAAA,GAAAn/M,EAAA5W,CAAA,KAAAw4C,EAAA,CAGAr+B,OAAA,MAAAm8M,CAAAA,EAAA,MAAAC,CAAAA,EAAA/9K,EAAAk+K,aAAA,EAAAH,EAAA/9K,EAAAr+B,MAAA,GAAAm8M,EACK1/F,SAAA,MAAA4/F,CAAAA,EAAAh+K,EAAAm+K,eAAA,GAAAH,CAAA,GAGL,OAAA5L,EAAAlhL,CAAA,CAAAmf,KAAA,YAKK,OAJL8oK,EAAAyC,UAAA,CAAA5C,OAAA,CAAAh5K,GAAA/zD,OAAA,UAAA6pO,CAAA,EACOA,EAAAK,UAAA,KAGFgD,EAAAqE,cAAA,CAAAD,EAAAn6O,EACL,IAGA+qB,EAAAqvN,cAAA,UAAArzE,CAAA,CAAAC,CAAA,CAAAC,CAAA,MAAA+zE,EAAA,KAGAC,EAAA,GAAAz7L,EAAAm2L,EAAA,EAAA5uE,EAAAC,EAAAC,GACArqG,EAAAq+K,CAAA,IAAAj7O,EAAAi7O,CAAA,IAWiD59N,EAAAT,QAAAqkC,GAAA,CARjD+tL,EAAAlhL,CAAA,CAAAmf,KAAA,YACA,OAAA+tK,EAAAxC,UAAA,CAAA5C,OAAsC,CAAAh5K,GAAA//D,GAAA,UAAA61O,CAAA,CAAQ,CAC9C,OAAAA,EAAA93N,KAAA,CAAAnb,KAAAA,EAAA,GAAAu7B,EAAA5W,CAAA,KAAApkB,EAAA,CACAwI,KAAA,CACAuuO,YAAAn6K,IAAA,EAAAA,EAAA,OAAAA,EAAAm6K,WAAA,CAEO,GACF,EACL,IAAiDp4N,IAAA,CAAA6gC,EAAAioE,EAAA,EAOjD,MAJAznH,CAAAA,IAAA,EAAAA,EAAA,KAA8B,EAAAA,EAAAk7O,YAAI,GAClC79N,CAAAA,EAAAA,EAAAg/C,KAAA,CAAA7c,EAAAioE,EAAA,GAGApqG,CAAA,EAGA0N,EAAAowN,UAAA,UAAwBp0E,CAAA,CAAAC,CAAA,CAAAC,CAAc,EACtC,IAAAwyE,EAAA,GAAAj6L,EAAAk6L,EAAA,EAAA3yE,EAAAC,EAAoEC,GAAA0yE,EAAA,KAAArE,mBAAA,CAAAmE,EAGpE,UAAAE,EAAAvuJ,KAAA,EACAuuJ,CAAAA,EAAAvuJ,KAAA,KAGA,IAAAsnJ,EAAA,KAAA8F,UAAA,CAAAxwL,KAAA,MAAA2xL,GACA,OAAAjH,EAAAR,aAAA,CAAAyH,EAAAxH,SAAA,EAAAO,EAAA93N,KAAA,CAAA++N,GAAA/8N,QAAAI,OAAA,CAAA01N,EAAA/rL,KAAA,CAAAvpD,IAAA,GAGA2tB,EAAAqwN,aAAA,UAAAr0E,CAAkD,CAAAC,CAAA,CAAAC,CAAA,EAClD,YAAAk0E,UAAA,CAAAp0E,EAAAC,EAAAC,GAAAtoJ,IAAA,CAAA6gC,EAAAioE,EAAA,EAAAprD,KAAA,CAAA7c,EAAAioE,EAAA,GAGA18F,EAAAswN,kBAAwB,UAAct0E,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACtC,IAAAwyE,EAAA,GAAAj6L,EAAkDk6L,EAAA,EAAA3yE,EAAAC,EAAAC,GAElD,OADAwyE,EAAAzF,QAAA,CAAA0C,IACA,KAAAyE,UAAA,CAAA1B,EAAA,EAGA1uN,EAAAuwN,qBAAA,UAA0Dv0E,CAAA,CAAAC,CAAA,CAAIC,CAAA,EAC9D,YAAAo0E,kBAAA,CAAAt0E,EAAAC,EAAAC,GAAAtoJ,IAAA,CAAA6gC,EAAAioE,EAAA,EAAAprD,KAAA,CAAA7c,EAAAioE,EAAA,GAGA18F,EAAAwwN,eAAA,gBAAAC,EAAA,KAQA,OAAA5+N,QAAAqkC,GAAA,CALA+tL,EAAAlhL,CAAA,CAAAmf,KAAA,YACA,OAAAuuK,EAAAnO,aAAA,CAAAoI,MAAA,GAAA54O,GAAA,UAAAs5O,CAAA,EACO,OAAAA,EAAA3iC,MAAA,EACF,EACL,IACA70L,IAAA,CAAA6gC,EAAAioE,EAAA,EAAAprD,KAAA,CAAA7c,EAAAioE,EAAA,GAGA18F,EAAAyrN,qBAAA,YACA,YAAAiF,gBAAA,GAAAjF,qBAAA,IAGAzrN,EAAAkjN,eAAA,UAAAjuO,CAAA,EACA,YAAAqtO,aAAA,CAAArlL,KAAA,MAAAhoD,GAAAuoD,OAAA,IAGAx9B,EAAAwuN,aAAA,YACA,YAAAf,UAAA,EAGAztN,EAAA0wN,gBAAA,YACA,YAAApO,aAAA,EAGAtiN,EAAA2wN,iBAAA,YACA,YAAA70O,cAAA,EAGAkkB,EAAA4lN,iBAAA,UAAA3wO,CAAA,EACA,KAAA6G,cAAA,CAAA7G,CAAA,EAGA+qB,EAAA4wN,gBAAA,UAAAtL,CAAA,CAAArwO,CAAA,EACA,IAAAL,EAAa,KAAA84O,aAAA,CAAA31O,IAAA,UAAYhE,CAAA,EACpB,SAAA0gD,EAAAo8L,EAAA,EAAAvL,KAAA,GAAA7wL,EAAAo8L,EAAA,EAAA98O,EAAAuxO,QAAA,IAGL1wO,EACMA,EAAAkH,cAAA,CAAA7G,EAEN,KAAAy4O,aAAA,CAAAv9O,IAAA,EACAm1O,SAAAA,EACOxpO,eAAA7G,CACP,EACA,EAGA+qB,EAAAwqN,gBAAA,UAAAlF,CAAA,MAAAwL,EAGA,OAAAxL,EAAa,IAEb,EAFawL,CAAAA,EAAe,KAAApD,aAAA,CAAA31O,IAAA,UAAAhE,CAAA,EACvB,SAAA0gD,EAAAklB,EAAA,EAAA2rK,EAAAvxO,EAAAuxO,QAAA,CACL,WAAAwL,EAAAh1O,cAAA,CAAApH,KAAAA,CAAA,EAGAsrB,EAAA+wN,mBAAA,UAAAzF,CAAA,CAAAr2O,CAAA,EACA,IAAAL,EAAa,KAAA+4O,gBAAA,CAAA51O,IAAY,UAAAhE,CAAA,EACpB,SAAA0gD,EAAAo8L,EAAA,EAAAvF,KAAA,GAAA72L,EAAAo8L,EAAA,EAAA98O,EAAAu3O,WAAA,IAGL12O,EACMA,EAAAkH,cAAA,CAAA7G,EAEN,KAAA04O,gBAAA,CAAAx9O,IAAA,EACAm7O,YAAAA,EACOxvO,eAAA7G,CACP,EACA,EAGA+qB,EAAAurN,mBAAA,UAAAD,CAAA,MAAA0F,EAGA,OAAA1F,EAAa,IAEb,EAFa0F,CAAAA,EAAe,KAAArD,gBAAA,CAAA51O,IAAA,UAAAhE,CAAA,EACvB,SAAA0gD,EAAAklB,EAAA,EAAA2xK,EAAAv3O,EAAAu3O,WAAA,CACL,WAAA0F,EAAAl1O,cAAA,CAAApH,KAAAA,CAAA,EAGAsrB,EAAAuqN,mBAAA,UAAAt1O,CAAA,EACA,GAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAg8O,UAAA,CACA,OAAAh8O,CAAA,CAGA,IAAA25O,EAAA,GAAA3+M,EAAA5W,CAAA,UAAAvd,cAAA,CAAAquO,OAAA,MAAAK,gBAAA,CAAAv1O,IAAA,EAAAA,EAAA,OAAAA,EAAAqwO,QAAA,EAAArwO,EAAA,CACKg8O,WAAA,KAOL,MAJA,CAAArC,EAAArJ,SAAmC,EAAAqJ,EAAAtJ,QAAA,EACnCsJ,CAAAA,EAAArJ,SAAA,IAAA9wL,EAAA61L,EAAA,EAAAsE,EAAAtJ,QAAA,CAAAsJ,EAAA,EAGAA,CAAA,EAGA5uN,EAAAkxN,2BAAA,UAAAj8O,CAAA,EACA,YAAAs1O,mBAAA,CAAAt1O,EAAA,EAGA+qB,EAAAqrN,sBAAA,UAAAp2O,CAAA,QACA,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAg8O,UAAA,EACAh8O,EAGA,GAAAg7B,EAAA5W,CAAA,UAAAvd,cAAA,CAAAqvO,SAAA,MAAAI,mBAAA,CAAAt2O,IAAA,EAAAA,EAAA,OAAAA,EAAAq2O,WAAA,EAAAr2O,EAAA,CACKg8O,WAAA,EACL,EALA,EAQAjxN,EAAA0sL,KAAA,YACA,KAAA+gC,UAAA,CAAA/gC,KAAA,GACA,KAAA41B,aAAA,CAAA51B,KAAA,IAGCirB,CAAA,mBAAAvnO,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAA8gP,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,QAAAC,EAAAhhP,EAAA,MAAAihP,EAAAjhP,EAAA,IC7V6C4zO,EAAA5zO,EAAA,MAK9C,SAAAkhP,EAAAzN,CAAA,EACA,OAAApyO,KAAAorC,GAAA,KAAAprC,KAAAs/C,GAAA,GAAA8yL,GAAA,KAGA,SAAAqN,EAAA/9O,CAAA,EACA,wBAAAA,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAo1M,MAAA,CACO,CACP,IAAAgpC,EAAA,SAAAx8O,CAAA,EACA,KAAA4yO,MAAA,CAAA5yO,IAAA,EAAAA,EAAA,OAAAA,EAAA4yO,MAAA,CACA,KAAAxb,MAAA,CAAAp3N,IAAA,EAAAA,EAAA,OAAAA,EAAAo3N,MAAA,EAEA,SAAA8kB,EAAA99O,CAAA,EACE,OAAAA,aAAAo+O,CAAA,CAGF,IAAAJ,EAAA,SAAAx3O,CAAA,MAIA63O,EACAC,EACAC,EACAC,EAPA1yN,EAAA,KAGA2oN,EAAA,EAIA,MAAAtxN,KAAA,CAAA3c,EAAA2c,KAAA,CAGA,KAAAiyL,MAAA,UAAAgnC,CAAA,EACA,OAAAiC,IAAA,EAAAA,EAAA,OAAAA,EAAAjC,EAAA,EAGA,KAAA3H,WAAA,YACAA,EAAA,IAGA,KAAAW,aAAA,YACAX,EAAA,IAGA,KAAAhF,QAAA,YACA,OAAA6O,IAAA,EAAAA,EAAA,OAAAA,GAAA,EAGA,KAAA5N,YAAA,GACA,KAAAC,QAAA,IACA,KAAA8N,UAAA,IACA,KAAAlK,qBAAA,IACA,KAAAt1N,OAAA,KAAAT,QAAA,SAAAkgO,CAAA,CAAAC,CAAA,EACAJ,EAAAG,EACGF,EAAAG,CAAA,GAGH,IAAA//N,EAAA,SAAA5e,CAAA,EACA8rB,EAAA2yN,UAAA,GACA3yN,EAAA2yN,UAAA,IACAj4O,IAAA,EAAAA,EAAAspO,SAAA,EAAAtpO,EAAAspO,SAAA,CAAA9vO,GACAs+O,IAAA,EAAAA,GAAAA,IACAC,EAAAv+O,GACA,EAGAye,EAAA,SAAAze,CAAA,EACA8rB,EAAA2yN,UAAA,GACA3yN,EAAA2yN,UAAA,IACAj4O,IAAA,EAAAA,EAAAu1N,OAAA,EAAAv1N,EAAAu1N,OAAA,CAAA/7N,GACAs+O,IAAA,EAAAA,GAAAA,IACAE,EAAAx+O,GACA,EAGA4+O,EAAA,WACA,WAAApgO,QAAA,SAAAqgO,CAAA,EACAP,EAAAO,EACA/yN,EAAA6kN,QAAA,IACKnqO,IAAA,EAAAA,EAAA4pO,OAAA,EAAA5pO,EAAA4pO,OAAA,EACL,GAAA7vN,IAAA,YACA+9N,EAAAj9O,KAAAA,EACAyqB,EAAA6kN,QAAA,IACKnqO,IAAA,EAAAA,EAAA6pO,UAAA,EAAA7pO,EAAA6pO,UAAA,EACL,EAAK,GA0EL1uO,SAtEAA,GAAA,KAKwBm9O,EAHxB,IAAAhzN,EAAA2yN,UAAA,EAMA,IACMK,EAAAt4O,EAAA2tB,EAAA,EACN,OAAA3wB,EAAA,CACMs7O,EAAAtgO,QAAAC,MAAA,CAAAjb,EAAA,CAIN66O,EAAA,SAAAjC,CAAA,EACA,IAAAtwN,EAAA2yN,UAAA,GACAhgO,EAAA,IAAA2/N,EAAAhC,IAAsDtwN,IAAA,EAAAA,EAAA3I,KAAA,EAAA2I,EAAA3I,KAAA,GAGtD46N,EAAAe,IACA,IACYA,EAAA1pC,MAAA,EACZ,OAAA2pC,EAAA,EAEO,EAIPjzN,EAAAyoN,qBAAA,CAAAwJ,EAAAe,GACAtgO,QAAAI,OAAA,CAAAkgO,GAAAv+N,IAAA,CAAA3B,GAAAq/C,KAAA,UAAAz6D,CAAA,EAIA,IAAAsoB,EAAA2yN,UAAA,EAKA,IATAO,EAAAC,EASAjyJ,EAAA,MAAAgyJ,CAAAA,EAAAx4O,EAAAwmF,KAAA,EAAAgyJ,EAAA,EACA1O,EAAA,MAAA2O,CAAAA,EAAAz4O,EAAA8pO,UAAA,EAAA2O,EAAAd,CAAA,CACAj3M,EAAA,mBAAAopM,EAAAA,EAAAxkN,EAAA4kN,YAAA,CAAAltO,GAAA8sO,CAAA,CAAA4O,EAAAlyJ,CAAA,IAAAA,GAAA,iBAAAA,GAAAlhE,EAAA4kN,YAAA,CAAA1jJ,GAAA,mBAAAA,GAAAA,EAAAlhE,EAAA4kN,YAAA,CAAAltO,GAGA,GAAAixO,GAAA,CAAAyK,EAAA,CAEAzgO,EAAAjb,GACA,SAE4BktO,YAAA,GAEqDlqO,IAAA,EAAAA,EAAA2pO,MAAA,EAAA3pO,EAAA2pO,MAAA,CAAArkN,EAAA4kN,YAAA,CAAAltO,GAGjF,GAAAqtO,EAAAz0H,EAAA,EAAAl1E,GACA3mB,IAAA,WAAa,CACb,IAAA09N,EAAAnsN,CAAA,CAAAm8M,SAAA,KAAAiQ,EAAA1uL,CAAA,CAAAkiL,QAAA,GACA,OAAAkN,GACO,GACPr+N,IAAA,YACAk0N,EACUh2N,EAAAjb,GAEV7B,GAEK,GA9BG,GAhCR,GAmEA,iBAAA5E,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAmiP,CAAA,CC5JO,GACP,IAAAA,EAAA,WACA,SAAAA,GAAA,CACA,KAAAxmK,SAAA,IAEA,IAAAhsD,EAAAwyN,EAAApzO,SAAA,CA+BC,OA5BD4gB,EAAAgxC,SAAA,UAAAG,CAAA,MAAAhyC,EAAA,KAGAjL,EAAAi9C,GAAA,WACA,EAKA,OAFA,KAAA6a,SAAA,CAAA77E,IAAA,CAAA+jB,GACA,KAAA2sN,WAAA,GACA,WACA1hN,EAAA6sD,SAAA,CAAA7sD,EAAA6sD,SAAA,CAAA/wD,MAAA,UAAAlnB,CAAA,EACO,OAAAA,IAAAmgB,CAAA,GAGPiL,EAAA4hN,aAAA,EACA,GAGA/gN,EAAAghN,YAAA,YACA,YAAAh1J,SAAA,CAAAn6E,MAAA,IAGAmuB,EAAA6gN,WAAA,cAGA7gN,EAAA+gN,aAAA,cAGCyR,CAAA,qCAAApiP,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAoiP,CAAA,uBAAAC,CAAA,uBAAA//J,CAAA,uBAAAggK,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAA9rJ,CAAA,uBAAA+rJ,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,IEpCyD,IAAAjyM,EAAAlxC,EAAA,MAInDijP,EAAA,oBAAAv0O,OACP,SAAAooF,GAAA,CAEO,CACP,SAAA4rJ,EAAA7M,CAAA,CAAA5xO,CAAA,EACA,yBAAA4xO,EAAAA,EAAA5xO,GAAA4xO,CAAA,CAEA,SAAA0M,EAAAx/O,CAAA,EACA,uBAAAA,GAAAA,GAAA,GAAAA,IAAA0gG,GACO,CACP,SAAAu/I,EAAAjgP,CAAA,EACA,OAAA5B,MAAA6D,OAAA,CAAAjC,GAAAA,EAAA,CAAAA,EAAA,CAYA,SAAAu/O,EAAAhM,CAAA,CAAAQ,CAAA,EACA,OAAAz1O,KAAAqrC,GAAA,CAAA4pM,EAAAQ,CAAAA,GAAA,GAAAh7I,KAAAwzD,GAAA,KACO,CACP,SAAAuzF,EAAAn3E,CAAA,CAAAC,CAAA,CAAAC,CAAA,SACA,EAAAF,GAIA,mBAAWC,EACX,GAAAz6H,EAAAnoB,CAAA,KAAA6iJ,EAAA,CACAopE,SAAAtpE,EACK0sE,QAAAzsE,CACL,GAGA,GAAAz6H,EAAAnoB,CAAA,KAAA4iJ,EAAA,CACGqpE,SAAAtpE,CACH,GAZAA,CAAA,CAcA,SAAAq3E,EAAAr3E,CAAA,CAAAC,CAAA,CAAAC,CAAA,SACA,EAAAF,GACA,mBAAaC,EACb,GAAAz6H,EAAAnoB,CAAA,KAAA6iJ,EAAA,CACAovE,YAAAtvE,EACOunE,WAAAtnE,CACP,GAGA,GAAAz6H,EAAAnoB,CAAA,KAAA4iJ,EAAA,CACKqvE,YAAAtvE,CACL,EALA,CAQA,mBAAWA,EACX,GAAAx6H,EAAAnoB,CAAA,KAAA4iJ,EAAA,CACKsnE,WAAAvnE,CACL,GAGA,GAAAx6H,EAAAnoB,CAAA,KAAA2iJ,EAHA,CAKA,SAAA22E,EAAA32E,CAA6B,CAAAC,CAAA,CAAAC,CAAA,EAC7B,OAAAw3E,EAAA13E,GAAA,IAAAx6H,EAAAnoB,CAAA,KAAA4iJ,EAAA,CACGqpE,SAAAtpE,CACH,GAAAE,EAAA,EAAAF,GAAA,GAAAC,EAAA,CAOA,SAAA03E,EAAAngN,CAAA,CAAAy8G,CAAA,QACA,KAAAz8G,GAAAy8G,CAAA,IAAAA,GAAAz8G,IAAA,EAAAA,GAAAy8G,IAAA,EAAAA,EACI,MACJz8G,CAAA,IAAAA,GAAAy8G,CAAA,IAAAA,EACI,OAKJnG,CADAt2G,IAAA,EAAAA,EAAAA,EAAA,CAAAy8G,CAAA,EACA,oBAGA,SAAAmjG,EAAAvhL,CAAA,CAAA81K,CAAA,EACA,IAAAn0M,EAAAq+B,EAAAr+B,MAAA,CACAusM,EAAAluK,EAAAkuK,KAAA,CACAmO,EAAAr8K,EAAAq8K,QAAA,CACAj+F,EAAAp+E,EAAAo+E,QAAA,CACA28C,EAAA/6H,EAAA+6H,SAAA,CACA04C,EAAAzzK,EAAAyzK,QAAA,CAAAsO,EAAA/hL,EAAA+hL,KAAA,CAGA,GAAAF,EAAApO,IACA,GAAAvF,EACA,IAAA4H,EAAApC,SAAA,GAAAwN,EAAAzN,EAAAqC,EAAA1yO,OAAA,EACA,QACM,MACN,IAAAu+O,EAAA7L,EAAArC,QAAA,CAAAA,GACA,QACA,KAEAuO,EAAAF,EAAAngN,EAAAy8G,GAGA,GAAA4jG,SAAAA,EACI,QAUJ,CATA,GAAAA,QAAAA,EAAA,KAAA/pG,EAAA69F,EAAA79F,QAAA,GAGA,cAAA+pG,GAAA,CAAA/pG,GAIA+pG,aAAAA,GAAA/pG,EAHA,SAKA,MAGA,mBAAA8pG,GAAAjM,EAAAX,OAAA,KAAA4M,CAAA,GAIA,mBAAA1F,GAAAvG,EAAA1B,UAAA,KAAAiI,CAAA,GAIAthD,CAAAA,CAAAA,IAAA,CAAAA,EAAA+6C,EAAA,CAKO,CACP,SAAAuL,EAAArhL,CAAA,CAAAu5K,CAAA,EACA,IAAArL,EAAAluK,EAAAkuK,KAAA,CACAmO,EAAAr8K,EAAAq8K,QAAA,CACAthD,EAAA/6H,EAAA+6H,SAAA,CAAA0+C,EAAAz5K,EAAAy5K,WAAA,CAGA,GAAAoI,EAAApI,GAAA,CACA,IAAAF,EAAAn2O,OAAA,CAAAq2O,WAAA,CACA,SAGA,GAAAvL,EACA,IAAA0T,EAAArI,EAAAn2O,OAAA,CAAAq2O,WAAA,IAAAmI,EAAAnI,GACA,QACM,MACN,IAAAkI,EAAApI,EAAAn2O,OAAA,CAAAq2O,WAAA,CAAAA,GACA,QACA,OAGA,mBAAA4C,GAAA9C,YAAAA,EAAAxvL,KAAA,CAAAj9C,MAAA,GAAAuvO,CAAA,GAIAthD,CAAAA,CAAAA,IAAA,CAAAA,EAAAw+C,EAAA,CAKO,CACP,SAAA2H,EAAAzN,CAAA,CAAArwO,CAAA,EAEA,MAAA6+O,CADA,CAAA7+O,IAAA,EAAAA,EAAA,OAAAA,EAAA8+O,cAAA,GAAAN,CAAA,EACAnO,EACA,CAKA,SAAAmO,EAAAnO,CAAA,EAEA,OAAA0O,EADAV,EAAAhO,GAEA,CAKA,SAAA0O,EAAA3gP,CAAA,EACA,OAAAe,KAAAC,SAAA,CAAAhB,EAAA,SAAAtB,CAAA,CAAAisC,CAAA,EACA,OAAAkQ,EAAAlQ,GAAAtqC,OAAAiE,IAAA,CAAAqmC,GAAA2D,IAAA,GAAA31B,MAAA,UAAApX,CAAA,CAAAtB,CAAA,EAEK,OADLsB,CAAA,CAAAtB,EAAA,CAAA0qC,CAAA,CAAA1qC,EAAA,CACSsB,CACN,MAAAopC,CAAA,EAEH,CAKA,SAAAw1M,EAAA/iP,CAAA,CAAAkZ,CAAA,EACA,OAAAsqO,EAAAX,EAAA7iP,GAAA6iP,EAAA3pO,GACA,CAKA,SAAAsqO,EAAAxjP,CAAA,CAAAkZ,CAAA,SACA,IAAAA,GAIA,OAAAlZ,GAAA,OAAAkZ,GAIAlZ,EAAAA,KAAAkZ,GAAA,iBAAAlZ,GAAA,iBAAAkZ,GACA,CAAAjW,OAAAiE,IAAA,CAAAgS,GAAA+0D,IAAA,UAAAprE,CAAA,EACK,OAAA2gP,EAAAxjP,CAAA,CAAA6C,EAAA,CAAAqW,CAAA,CAAArW,EAAA,CACL,EAIA,CAOA,SAAAw/O,EAAAriP,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,IAAAkZ,EACA,OAAAlZ,CAAA,CAEA,IAAAc,EAAAE,MAAA6D,OAAA,CAAA7E,IAAAgB,MAAA6D,OAAA,CAAAqU,GAGA,GAAApY,GAAA28C,EAAAz9C,IAAAy9C,EAAAvkC,GAAA,CAOA,QANAuqO,EAAA3iP,EAAAd,EAAAoB,MAAA,CAAA6B,OAAAiE,IAAA,CAAAlH,GAAAoB,MAAA,CACAsiP,EAAA5iP,EAAAoY,EAAAjW,OAAAiE,IAAA,CAAAgS,EAAA,CACAyqO,EAAAD,EAAAtiP,MAAA,CACA2mB,EAAAjnB,EAAA,MAAA8iP,EAAA,EAGAp9O,EAAA,EAAAA,EAAAm9O,EAAAn9O,IAAA,CACA,IAAA3D,EAAA/B,EAAA0F,EAAAk9O,CAAA,CAAAl9O,EAAA,CAAAuhB,CAAA,CAAAllB,EAAA,CAAAw/O,EAAAriP,CAAA,CAAA6C,EAAA,CAAAqW,CAAA,CAAArW,EAAA,EAGAklB,CAAA,CAAAllB,EAAA,GAAA7C,CAAA,CAAA6C,EAAA,EACA+gP,GACA,CAGA,OAAAH,IAAAE,GAAAC,IAAAH,EAAAzjP,EAAA+nB,CAAA,QAGA7O,CACA,CAKA,SAAAspO,EAAAxiP,CAAA,CAAAkZ,CAAA,EACA,GAAAlZ,GAAA,CAAAkZ,GAAAA,GAAA,CAAAlZ,EACA,SAGA,QAAA6C,KAAA7C,EACA,GAAAA,CAAA,CAAA6C,EAAA,GAAAqW,CAAA,CAAArW,EAAA,CACA,QACA,CAGE,SAGF,SAAA46C,EAAAoC,CAAA,EACA,IAAAgkM,EAAAhkM,GACI,SAGJ,IAAAstD,EAAAttD,EAAA19C,WAAA,CAGA,YAAAgrG,EACI,SAGJ,IAAA22I,EAAA32I,EAAAx+F,SAAA,UAGAk1O,EAAAC,IAKAA,EAAAl1O,cAAA,kBAKA,CAGA,SAAAi1O,EAAAhkM,CAAA,EACA,MAAA58C,oBAAAA,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgxC,EAAA,CAGA,SAAAojM,EAAArgP,CAAA,EACA,uBAAAA,GAAA5B,MAAA6D,OAAA,CAAAjC,EACO,CAIP,SAAAs/E,EAAAu1C,CAAA,EACA,WAAAr2G,QAAA,SAAAI,CAAA,EACGgiE,WAAAhiE,EAAAi2G,EACH,EACA,CAMA,SAAAuqH,EAAAv+N,CAAA,EACArC,QAAAI,OAAA,GAAA2B,IAAA,CAAAM,GAAAo9C,KAAA,UAAAz6D,CAAA,EACA,OAAAo9E,WAAA,WACK,MAAAp9E,CAAA,EAEL,EACO,CACP,SAAA67O,GAAA,CACA,sBAAA8B,gBACA,WAAAA,eACA,iBAAApkP,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,2BAAAokP,EAAA3c,OAAA,gCAAA4c,EAAA/c,WAAA,wCAAA8c,EAAA5c,mBAAA,gCAAA4c,EAAA/S,WAAA,6BAAA+S,EAAA9S,QAAA,QAAA+S,EAAApkP,EAAA,MAAAA,EAAAggD,CAAA,CAAAokM,EAAA,YAAApkP,EAAAC,CAAA,CAAAF,EAAA,2BAAAqkP,EAAA5c,OAAA,IAAAxnO,EAAAggD,CAAA,CAAAokM,EAAA,wBAAApkP,EAAAC,CAAA,CAAAF,EAAA,uCAAAqkP,EAAA7c,mBAAA,IAAAvnO,EAAAggD,CAAA,CAAAokM,EAAA,gBAAApkP,EAAAC,CAAA,CAAAF,EAAA,+BAAAqkP,EAAAhT,WAAA,IAAApxO,EAAAggD,CAAA,CAAAokM,EAAA,aAAApkP,EAAAC,CAAA,CAAAF,EAAA,4BAAAqkP,EAAA/S,QAAA,IC3UuB,IAAA8S,EAAAnkP,EAAA,qBAAAF,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,2BAAAynO,CAAA,wCAAAD,CAAA,gCAAA6J,CAAA,6BAAAC,CAAA,QAAAsC,EAAA3zO,EAAA,KCC8CqkP,EAAApjB,EDD9C,MCC8CojB,uBAAA,CCCT1Q,EAAAlhL,CAAA,CAAA0hL,sBAAA,CAAAkQ,GAAA,IAAA7S,EAAAxxO,EAAA,MCF3CskP,EAAAj6O,QCED,GAAAmnO,EAAAjgL,CAAA,EAAA+yL,GAAA,IAAA9oC,EAAAx7M,EAAA,MCAhBukP,EAAA/oC,EAAA9jL,aAA6C,CAAAtzB,KAAAA,GAC7CogP,EAAAhpC,EAAA9jL,aAAA,KAOA,SAAA+sN,EAAAC,CAAA,SACA,uBAAAh2O,QACAA,OAAAi2O,uBAAA,EACAj2O,CAAAA,OAAAi2O,uBAAA,CAAAJ,CAAA,EAGA71O,OAAAi2O,uBAAA,EAGAJ,CAHA,CAMA,IAAAK,EAAoB,UAAgB,CAAuC,IAAAxd,EAAA5rB,EAAAxjL,UAAA,CAAAysN,EAAAjpC,EAAAxjL,UAAA,CAAAwsN,KAG3E,IAAApd,EACA,sEAGA,OAAAA,CACO,EACPG,EAAA,SAAA5uM,CAAA,EACA,IAAAslH,EAAAtlH,EAAAslH,MAAA,CACA4mG,EAAAlsN,EAAA+rN,cAAA,CACAA,EAAAG,KAAA,IAAAA,GAAAA,EACE9yN,EAAe4G,EAAA5G,QAAA,CACjBypL,EAAAE,SAAA,YAEA,OADAz9D,EAAAq/F,KAAA,GACA,WACAr/F,EAAAw/F,OAAA,EACG,CACH,GAAAx/F,EAAA,EACA,IAAAp0E,EAAA46K,EAAsBC,GACtB,OAAAlpC,EAAAltL,aAAA,CAAAk2N,EAAA5sN,QAAA,EACG70B,MAAA2hP,CACH,EAAAlpC,EAAAltL,aAAA,CAAAu7C,EAAAjyC,QAAA,EACG70B,MAAAk7I,CACH,EAAAlsH,GAAA,EAAA4N,EAAA3/B,EAAA,MAAAmkD,EAAAnkD,EAAA,MAAA20O,EAAA30O,EAAA,MAAA86O,EAAA96O,EAAA,MAAA25O,EAAA35O,EAAA,MCxCE8kP,EAAc,SAAA7U,CAAA,EAGhB,SAAA6U,EAAA7mG,CAAA,CAAAt5I,CAAA,MAAAkqB,EAYA,MATAA,CAAAA,EAAAohN,EAAAjhO,IAAA,cAAAivI,MAAA,CAAAA,EAEApvH,EAAAkmN,UAAA,CAAApwO,GAEAkqB,EAAAk2N,WAAA,GAEAl2N,EAAAm2N,YAAA,GAGAn2N,CAAA,CAfgB,GAAA8lN,EAAA5rN,CAAA,EAAA+7N,EAAA7U,GAiBhB,IAAAvgN,EAAAo1N,EAAAh2O,SAAA,CAqGE,OAlGF4gB,EAAAq1N,WAAA,YACA,KAAAE,MAAA,MAAAA,MAAA,CAAAhoO,IAAA,OACA,KAAA0lG,KAAA,MAAAA,KAAA,CAAA1lG,IAAA,QAGAyS,EAAAqlN,UAAA,UAAApwO,CAAA,EACA,KAAAA,OAAA,MAAAs5I,MAAA,CAAA88F,sBAAA,CAAAp2O,EAAA,EAGA+qB,EAAA+gN,aAAA,YACA,SAAA/0J,SAAA,CAAAn6E,MAAA,MAAA2jP,CAGA,OAAAA,CAAAA,EAAA,KAAAC,eAAA,GAAAD,EAAA5S,cAAA,MACA,GAGA5iN,EAAA8jN,gBAAyB,UAAAvwM,CAAA,OAAA+hN,YAAA,GAGzB,IAAAI,EAAA,CACA1pK,UAAA,GAGAz4C,CAAA,YAAAA,EAAAhgC,IAAA,CACMmiP,EAAAvS,SAAA,IACN,UAAA5vM,EAAAhgC,IAAA,EACAmiP,CAAAA,EAAAtmB,OAAA,KAGA,KAAA9mG,MAAA,CAAAotH,EAAA,EAGA11N,EAAAknN,gBAAA,YACA,YAAAyO,aAAA,EAGA31N,EAAAizF,KAAA,YACA,KAAAwiI,eAAA,CAAA/gP,KAAAA,EACA,KAAA4gP,YAAA,GACA,KAAAhtH,MAAA,EACKt8C,UAAA,EACL,IAGAhsD,EAAAu1N,MAAA,UAAAvS,CAAA,CAAA/tO,CAAA,EAWA,OAXA,KAAA2gP,aAAA,CAAA3gP,EAGA,KAAAwgP,eAAA,EACA,KAAAA,eAAA,CAAA7S,cAAA,OAGA,KAAA6S,eAAA,MAAAlnG,MAAA,CAAAmiG,gBAAA,GAAAzzL,KAAA,MAAAsxF,MAAA,IAAAt+G,EAAA5W,CAAA,UAAApkB,OAAA,EACK+tO,UAAA,SAAAA,EAAAA,EAAA,KAAA/tO,OAAA,CAAA+tO,SAAA,IAEL,KAAAyS,eAAA,CAAA/S,WAAA,OACA,KAAA+S,eAAA,CAAAj4L,OAAA,IAGAx9B,EAAAs1N,YAAA,YAAmF,IAAA15L,EAAA,KAAA65L,eAAA,MAAAA,eAAA,CAAA75L,KAAA,IAAAwvL,EAAAtoL,CAAA,IAGnFluD,EAAA,GAAAq7B,EAAA5W,CAAA,KAAAuiC,EAAA,CACAi6L,UAAAj6L,YAAAA,EAAAj9C,MAAA,CACAm3O,UAAAl6L,YAAAA,EAAAj9C,MAAA,CACAugG,QAAAtjD,UAAAA,EAAAj9C,MAAA,CACAo3O,OAAAn6L,SAAAA,EAAAj9C,MAAA,CACA42O,OAAA,KAAAA,MAAA,CACKtiI,MAAA,KAAAA,KAAA,EAGL,MAAA0iI,aAAA,CAAA/gP,CAAA,EAGAorB,EAAAsoG,MAAA,UAAArzH,CAAA,MAAAksO,EAAA,KAGA8C,EAAAlhL,CAAA,CAAAmf,KAAA,YAEAi/J,EAAAyU,aAAA,GACA3gP,EAAAkuO,SAAA,EACAhC,IAAA,EAAAA,EAAAyU,aAAA,CAAAzS,SAAA,EAAAhC,EAAAyU,aAAA,CAAAzS,SAAA,CAAAhC,EAAAwU,aAAA,CAAAtjP,IAAA,CAAA8uO,EAAAwU,aAAA,CAAA3S,SAAA,CAAA7B,EAAAwU,aAAA,CAAA9gP,OAAA,EACUssO,IAAA,EAAAA,EAAAyU,aAAA,CAAAxS,SAAA,EAAAjC,EAAAyU,aAAA,CAAAxS,SAAA,CAAAjC,EAAAwU,aAAA,CAAAtjP,IAAA,MAAA8uO,EAAAwU,aAAA,CAAA3S,SAAA,CAAA7B,EAAAwU,aAAA,CAAA9gP,OAAA,GACVI,EAAAm6N,OAAA,GACA+R,IAAA,EAAAA,EAAAyU,aAAA,CAAAxmB,OAAA,EAAA+R,EAAAyU,aAAA,CAAAxmB,OAAA,CAAA+R,EAAAwU,aAAA,CAAA9+O,KAAA,CAAAsqO,EAAAwU,aAAA,CAAA3S,SAAA,CAAA7B,EAAAwU,aAAA,CAAA9gP,OAAA,EACAssO,IAAA,EAAAA,EAAAyU,aAAA,CAAAxS,SAAA,EAAAjC,EAAAyU,aAAA,CAAAxS,SAAA,CAAA1uO,KAAAA,EAAAysO,EAAAwU,aAAA,CAAA9+O,KAAA,CAAAsqO,EAAAwU,aAAA,CAAA3S,SAAA,CAAA7B,EAAAwU,aAAA,CAAA9gP,OAAA,IAKAI,EAAA+2E,SAAA,EACAm1J,EAAAn1J,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACSA,EAAAgwK,EAAAwU,aAAA,CACT,EAEA,IAGEP,CAAY,EAAAnL,EAAArsM,CAAA,EC5Hd,SAAAo4M,EAAAC,CAAA,CAAAC,CAAA,CAAAnmN,CAAA,QAEA,mBAAAmmN,EACIA,EAAAxkP,KAAA,QAAAq+B,GAGoE,kBAAAmmN,EAAAA,EAGxE,EAAAD,CANI,CCKJ,SAAAvU,EAAmB1lE,CAAA,CAAAC,CAAY,CAAAC,CAAA,MAAAi6E,EAAArqC,EAAAviL,MAAA,KAG/B6sN,EAAAC,EAAA3nC,QAAA,OAGAz5M,EAAA,GAAAw/C,EAAkC6hM,EAAA,EAAAt6E,EAAAC,EAAAC,GAClCw7D,EAAewd,IAAYqB,EAAAzqC,EAAAviL,MAAA,EAG3BgtN,CAAAA,EAAA7sN,OAAA,CAGA6sN,EAAA7sN,OAAA,CAAA27M,UAAA,CAAApwO,GAFIshP,EAAA7sN,OAAA,KAAA0rN,EAAA1d,EAAAziO,GAKF,IAAA0gP,EAAeY,EAAA7sN,OAAA,CAAAw9M,gBAAA,GACjBp7B,EAAAE,SAAA,YACAmqC,EAAAzsN,OAAA,IACA,IAAA0nC,EAAAmlL,EAAA7sN,OAAA,CAAAsnC,SAAA,CAAAizK,EAAAlhL,CAAA,CAAAwhL,UAAA,YACA4R,EAAAzsN,OAAA,EACA0sN,EAAA,SAAAriP,CAAA,EACS,OAAAA,EAAA,CACT,EAEA,IACA,kBACAoiP,EAAAzsN,OAAA,IACA0nC,GACG,CACH,MACA,IAAAmkL,EAAAzpC,EAAA8C,WAAA,UAAAo0B,CAAA,CAAA4S,CAA0D,EACvDW,EAAA7sN,OAAA,CAAA6rN,MAAA,CAAAvS,EAAA4S,GAAAtkL,KAAA,CAAA7c,EAAAioE,EAAA,OAGH,GAAAi5H,EAAA9+O,KAAA,EAAAm/O,EAAAthP,KAAAA,EAAA6hP,EAAA7sN,OAAA,CAAAz0B,OAAA,CAAAuhP,gBAAA,EAAAb,EAAA9+O,KAAA,GACA,MAAA8+O,EAAA9+O,KAAA,CAGA,SAAAo5B,EAAA5W,CAAA,KAAAs8N,EAAA,CACAJ,OAAAA,EACGkB,YAAAd,EAAAJ,MAAA,EACH,KAAApV,EAAA7vO,EAAA,MAAAuyO,EAAAvyO,EAAA,MC1CEomP,EAAA,SAAcnW,CAAA,EAGhB,SAAAmW,EAAAnoG,CAAA,CAAAt5I,CAAA,MAAAkqB,EAaA,MATAA,CADAA,EAAAohN,EAAAjhO,IAAA,cACAivI,MAAA,CAAAA,EACApvH,EAAAlqB,OAAA,CAAAA,EACAkqB,EAAAw3N,YAAA,IAAAx3N,EAAAy3N,WAAA,MAEAz3N,EAAAk2N,WAAA,GAEAl2N,EAAAkmN,UAAA,CAAApwO,GAGAkqB,CAAA,CAhBgB,GAAA8lN,EAAA5rN,CAAA,EAAAq9N,EAAAnW,GAkBhB,IAAAvgN,EAAA02N,EAAAt3O,SAAA,CAgfE,OA7eF4gB,EAAAq1N,WAAA,YACA,KAAA5oC,MAAA,MAAAA,MAAA,CAAAl/L,IAAA,OACA,KAAAi6N,OAAA,MAAAA,OAAA,CAAAj6N,IAAA,QAGAyS,EAAA6gN,WAAA,YACA,SAAA70J,SAAA,CAAAn6E,MAAA,QAAAglP,YAAA,CAAAnU,WAAA,OAGAoU,EAAA,KAAAD,YAAA,MAAA5hP,OAAA,GACA,KAAA8hP,YAAA,GAGA,KAAAC,YAAA,GACA,EAGAh3N,EAAA+gN,aAAA,YACA,KAAA/0J,SAAA,CAAAn6E,MAAA,EACA,KAAAw/G,OAAA,EACA,EAGArxF,EAAA0nN,sBAAA,YACA,OAAAuP,EAAA,KAAAJ,YAAA,MAAA5hP,OAAA,MAAAA,OAAA,CAAAiiP,kBAAA,GAGAl3N,EAAAunN,wBAAA,YACA,OAAA0P,EAAA,KAAAJ,YAAA,MAAA5hP,OAAA,MAAAA,OAAA,CAAAkiP,oBAAA,GAGAn3N,EAAAqxF,OAAA,YACA,KAAArlC,SAAA,IACA,KAAAorK,WAAA,GACA,KAAAP,YAAA,CAAAjU,cAAA,QAGA5iN,EAAAqlN,UAAA,UAAApwO,CAAA,CAAAygP,CAAA,EACA,IAAA2B,EAAA,KAAApiP,OAAA,CACAqiP,EAAA,KAAAT,YAAA,CAGA,GAHA,KAAA5hP,OAAA,MAAAs5I,MAAA,CAAA2iG,2BAAA,CAAAj8O,GAGA,cAAAA,OAAA,CAAA8xO,OAAA,yBAAA9xO,OAAA,CAAA8xO,OAAA,CACM,gDAIN,KAAA9xO,OAAA,CAAAqwO,QAAA,EACA,MAAArwO,OAAA,CAAAqwO,QAAA,CAAA+R,EAAA/R,QAAA,EAGA,KAAAiS,WAAA,GAAuC,IAAAC,EAAA,KAAAxW,YAAA,GAGvCwW,GAAAC,EAAA,KAAAZ,YAAA,CAAAS,EAAA,KAAAriP,OAAA,CAAAoiP,IACM,KAAAN,YAAA,GAGgC,KAAAzB,YAAA,CAAAI,GAGtC8B,GAAA,MAAAX,YAAA,GAAAS,GAAA,KAAAriP,OAAA,CAAA8xO,OAAA,GAAAsQ,EAAAtQ,OAAA,OAAA9xO,OAAA,CAAAmyO,SAAA,GAAAiQ,EAAAjQ,SAAA,GACA,KAAAsQ,kBAAA,GAE6D,IAAAC,EAAA,KAAAC,sBAAA,GAG7DJ,GAAA,MAAAX,YAAA,GAAAS,GAAA,KAAAriP,OAAA,CAAA8xO,OAAA,GAAAsQ,EAAAtQ,OAAA,EAAA4Q,IAAA,KAAAE,sBAAA,GACA,KAAAC,qBAAA,CAAAH,EACA,EAGA33N,EAAA+3N,mBAAA,UAAA9iP,CAAA,EACA,IAAA25O,EAAA,KAAArgG,MAAA,CAAA2iG,2BAAA,CAAAj8O,GACA0yO,EAAA,KAAAp5F,MAAA,CAAAigG,aAAA,GAAAvxL,KAAA,MAAAsxF,MAAA,CAAAqgG,GACA,YAAAoJ,YAAA,CAAArQ,EAAAiH,EAAA,EAGA5uN,EAAAknN,gBAAA,YACA,YAAAyO,aAAA,EAGA31N,EAAAi4N,WAAA,UAAArjP,CAAA,CAAAg6O,CAAA,MAAAzN,EAAA,KAEA+W,EAAA,GAGAC,EAAA,SAAA7kP,CAAA,EACA6tO,EAAAwV,YAAA,CAAAtxL,QAAA,CAAA/xD,IACA6tO,EAAAwV,YAAA,CAAAxmP,IAAA,CAAAmD,EACA,EAkBA,OAfAI,OAAAiE,IAAA,CAAA/C,GAAAkJ,OAAA,UAAAxK,CAAA,EACAI,OAAA8L,cAAA,CAAA04O,EAAA5kP,EAAA,CACAq9C,aAAA,GACAh0B,WAAA,GACAjJ,IAAA,WAEA,OADAykO,EAAA7kP,GACAsB,CAAA,CAAAtB,EAAA,CAEK,KAGLs7O,CAAAA,EAAA4H,gBAAA,EAAA5H,EAAAqH,QAAA,GACAkC,EAAA,SAGAD,CAAA,EAGAl4N,EAAAo4N,aAAA,UAAAnjP,CAAA,MAAA2uO,EAAA,KAGA,WAAA/xN,QAAA,SAAAI,CAAA,CAAAH,CAAA,EACA,IAAAs/C,EAAAwyK,EAAA5yK,SAAA,UAAAp8D,CAAA,EACAA,EAAAqxO,UAAA,GAAA70K,IAGAx8D,EAAAsqG,OAAA,EAAAjqG,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAk7O,YAAA,EACYr+N,EAAAld,EAAAiC,KAAA,EAEZob,EAAArd,GAGK,EACL,IAGAorB,EAAAq4N,eAAA,YACA,YAAAxB,YAAA,EAGA72N,EAAAysL,MAAA,YACA,KAAAl+D,MAAA,CAAAigG,aAAA,GAAA/hC,MAAA,MAAAoqC,YAAA,GAGA72N,EAAAwnN,OAAA,UAAsBvyO,CAAA,EACtB,YAAA4a,KAAA,IAAAogB,EAAA5W,CAAA,KAAApkB,EAAA,CACAwI,KAAA,CACAuuO,YAAA/2O,IAAA,EAAAA,EAAA,OAAAA,EAAA+2O,WAAA,CAEA,KAGAhsN,EAAAs4N,eAAA,UAAArjP,CAAA,MAAA81O,EAAA,KAGA6D,EAAA,KAAArgG,MAAA,CAAA2iG,2BAAA,CAAAj8O,GACA0yO,EAAA,KAAAp5F,MAAA,CAAAigG,aAAA,GAAAvxL,KAAA,MAAAsxF,MAAA,CAAAqgG,GACA,OAAAjH,EAAA93N,KAAA,GAAA+D,IAAA,YACK,OAAAm3N,EAAAiN,YAAA,CAAArQ,EAAAiH,EACL,IAGA5uN,EAAAnQ,KAAA,UAAAo4N,CAAA,MAAA+C,EAAA,KAGA,YAAA+L,YAAA,CAAA9O,GAAAr0N,IAAA,YAGK,OAHLo3N,EAAAsK,YAAA,GAGKtK,EAAA2K,aAAA,EACL,EAGA31N,EAAA+2N,YAAA,UAAA9O,CAAA,EACwB,KAAAsP,WAAA,GAExB,IAAAjlO,EAAA,KAAAukO,YAAA,CAAAhnO,KAAA,MAAA5a,OAAA,CAAAgzO,GAOA,MAJAA,CAAAA,IAA8B,EAA9BA,EAA8B,OAAAA,EAAIkI,YAAA,GAClC79N,CAAAA,EAAAA,EAAAg/C,KAAA,CAAA7c,EAAAioE,EAAA,GAGApqG,CAAA,EAGA0N,EAAA03N,kBAAA,gBAAAzH,EAAA,KAKA,GAHA,KAAAsI,iBAAA,GAGA9jM,CAAAA,EAAAmsL,EAAA,QAAA+U,aAAA,CAAA3O,OAAA,KAAAvyL,EAAAqxL,EAAA,OAAA7wO,OAAA,CAAAmyO,SAAA,GAOA,IAAAl/G,EAAA+/E,CAHA,EAAAxzJ,EAAA4yL,EAAA,OAAAsO,aAAA,CAAAhP,aAAA,MAAA1xO,OAAA,CAAAmyO,SAAA,EAGA,CACA,MAAAoR,cAAA,CAAAvkK,WAAA,WACAg8J,EAAA0F,aAAA,CAAA3O,OAAA,EACAiJ,EAAAqF,YAAA,EAEA,EAAAptH,GAXA,EAcAloG,EAAA43N,sBAAA,gBAAAa,EAGA,8BAAAxjP,OAAA,CAAAyjP,eAAA,MAAAzjP,OAAA,CAAAyjP,eAAA,MAAA/C,aAAA,CAAAtjP,IAAA,MAAAwkP,YAAA,QAAA4B,CAAAA,EAAA,KAAAxjP,OAAA,CAAAyjP,eAAA,GAAAD,CAAA,EAGAz4N,EAAA83N,qBAAA,UAAAa,CAAA,MAAAlI,EAAA,KAGA,KAAAmI,oBAAA,QAAAf,sBAAA,CAAAc,GAGAlkM,EAAAmsL,EAAA,YAAA3rO,OAAA,CAAA8xO,OAAA,KAAAtyL,EAAAqxL,EAAA,OAAA+R,sBAAA,YAAAA,sBAAA,EAIA,MAAAgB,iBAAA,CAAAp4F,YAAA,WACAgwF,CAAAA,EAAAx7O,OAAA,CAAA6jP,2BAAA,EAAA3Y,EAAAh7M,CAAA,CAAAm8M,SAAA,KACAmP,EAAAsG,YAAA,EAEA,OAAAc,sBAAA,IAGA73N,EAAAg3N,YAAA,YACA,KAAAU,kBAAA,GACA,KAAAI,qBAAA,MAAAF,sBAAA,KAGA53N,EAAAo3N,WAAA,YACA,KAAAmB,iBAAA,GACA,KAAAK,oBAAA,IAGA54N,EAAAu4N,iBAAA,YACA,KAAAC,cAAA,GACA7vH,aAAA,KAAA6vH,cAAA,EACA,KAAAA,cAAA,CAAA9jP,KAAAA,EACA,EAGAsrB,EAAA44N,oBAAA,YACA,KAAAC,iBAAA,GACAl4F,cAAA,KAAAk4F,iBAAA,EACA,KAAAA,iBAAA,CAAAnkP,KAAAA,EACA,EAGAsrB,EAAAg4N,YAAA,UAAArQ,CAAA,CAAA1yO,CAAA,EACA,IAec5C,EAkDa0mP,EAjE3BzB,EAAA,KAAAT,YAAA,CACAQ,EAAA,KAAApiP,OAAA,CACA+jP,EAAA,KAAArD,aAAA,CACAsD,EAAA,KAAAC,kBAAA,CACAC,EAAA,KAAAC,oBAAA,CACAC,EAAA1R,IAAA2P,EACAgC,EAAAD,EAAA1R,EAAA/rL,KAAA,MAAA29L,wBAAA,CACAC,EAAAH,EAAA,KAAA1D,aAAA,MAAA8D,mBAAA,CACA79L,EAAA+rL,EAAA/rL,KAAA,CACA+qL,EAAA/qL,EAAA+qL,aAAA,CACA9vO,EAAA+kD,EAAA/kD,KAAA,CACAgzO,EAAAjuL,EAAAiuL,cAAA,CACA5D,EAAArqL,EAAAqqL,UAAA,CACAtnO,EAAAi9C,EAAAj9C,MAAA,CACA+6O,EAAA,GACAC,EAAc,GAGd,GAAA1kP,EAAA2kP,iBAAA,EACA,IAAApC,EAAA,KAAAxW,YAAA,GACA6Y,EAAA,CAAArC,GAAAV,EAAAnP,EAAA1yO,GAAA6kP,EAAAtC,GAAAC,EAAA9P,EAAA2P,EAAAriP,EAAAoiP,GAGAwC,CAAAA,GAAAC,CAAA,IAAA7T,EAAA,GAGAU,GACAhoO,CAAAA,EAAA,WAEM,IAIN1J,EAAA8kP,gBAAA,GAAAn+L,EAAA+tL,eAAA,EAAA6P,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAA1D,SAAA,GAAAn3O,UAAAA,EACAtM,EAAAmnP,EAAAnnP,IAAA,CACAs0O,EAAA6S,EAAA7S,aAAA,CACAhoO,EAAA66O,EAAA76O,MAAA,CACM+6O,EAAA,QAEN,GAAAzkP,EAAAo0N,MAAA,WAAAztK,EAAAvpD,IAAA,EAEA,GAAA2mP,GAAAp9L,EAAAvpD,IAAA,GAAA4mP,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAA5mP,IAAA,GAAA4C,EAAAo0N,MAAA,QAAA2wB,QAAA,CACU3nP,EAAA,KAAA4nP,YAAA,MAEV,IACA,KAAAD,QAAA,CAAA/kP,EAAAo0N,MAAA,CAAAh3N,EAAA4C,EAAAo0N,MAAA,CAAAztK,EAAAvpD,IAAA,EAGqB,KAArB4C,EAAqBwxO,iBAAA,EACrBp0O,CAAAA,EAAA,GAAAoiD,EAAAiyL,EAAA,EAAAsS,IAAA,EAAAA,EAAA,OAAAA,EAAA3mP,IAAA,CAAAA,EAAA,EAGA,KAAA4nP,YAAA,CAAA5nP,EACY,KAAAukP,WAAA,MACA,MAAAA,EAAA,CACZ,GAAA9U,EAAA38M,CAAA,IAAAtuB,KAAA,CAAA+/O,GACA,KAAAA,WAAA,CAAAA,CACA,CACQ,MAGEvkP,EAAAupD,EAAAvpD,IAAA,CAIV,QAA2B,IAA3B4C,EAAA8jP,eAA2B,WAAA1mP,GAAAsM,CAAAA,YAAAA,GAAAA,SAAAA,CAAA,GAG3B,IAAAq6O,IAAA,EAAAA,EAAA,OAAAA,EAAAW,iBAAA,GAAA1kP,EAAA8jP,eAAA,GAAAI,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAAJ,eAAA,EACQA,EAAAC,EAAA3mP,IAAA,MAIR,GAHA0mP,EAAA,mBAAA9jP,EAAA8jP,eAAA,CAAA9jP,EAAA8jP,eAAA,GAAA9jP,EAAA8jP,eAAA,CAGA9jP,EAAAo0N,MAAA,WAAA0vB,EACA,IAAAA,EAAA9jP,EAAAo0N,MAAA,CAAA0vB,GAGgC,KAAhC9jP,EAAAwxO,iBAAgC,EAChCsS,CAAAA,EAAA,GAAAtkM,EAAAiyL,EAAA,EAAAsS,IAAA,EAAAA,EAAA,OAAAA,EAAA3mP,IAAA,CAAA0mP,EAAA,EAGY,KAAAnC,WAAA,MACA,MAAAA,EAAA,CACZ,GAAA9U,EAAA38M,CAAA,IAAAtuB,KAAA,CAAA+/O,GACA,KAAAA,WAAA,CAAAA,CACA,CACA,KAGA,IAAAmC,IACAp6O,EAAA,UACAtM,EAAA0mP,EACAY,EAAA,GACA,QAGA,KAAA/C,WAAA,GACA//O,EAAA,KAAA+/O,WAAA,CACAvkP,EAAA,KAAA4nP,YAAA,CACApQ,EAAAz9I,KAAAwzD,GAAA,GACAjhJ,EAAA,SAGA,CACAA,OAAAA,EACAk3O,UAAAl3O,YAAAA,EACAm3O,UAAAn3O,YAAAA,EACAugG,QAAAvgG,UAAAA,EACAo3O,OAAAp3O,SAAAA,EACAtM,KAAAA,EACAs0O,cAAAA,EACA9vO,MAAAA,EACAgzO,eAAAA,EACA9F,aAAAnoL,EAAAkuL,iBAAA,CACAF,iBAAAhuL,EAAAguL,gBAAA,CACAsQ,UAAAt+L,EAAA+tL,eAAA,IAAA/tL,EAAAguL,gBAAA,GACAuQ,oBAAAv+L,EAAA+tL,eAAA,CAAA2P,EAAA3P,eAAA,EAAA/tL,EAAAguL,gBAAA,CAAA0P,EAAA1P,gBAAA,CACA3D,WAAAA,EACAmU,aAAAnU,GAAAtnO,YAAAA,EACA07O,eAAA17O,UAAAA,GAAAi9C,IAAAA,EAAA+qL,aAAA,CACAgT,kBAAAA,EACAD,eAAAA,EACAY,eAAA37O,UAAAA,GAAAi9C,IAAAA,EAAA+qL,aAAA,CACAK,QAAAA,EAAAW,EAAA1yO,GACAuyO,QAAA,KAAAA,OAAA,CACA/6B,OAAA,KAAAA,MAAA,CAEA,EAGAzsL,EAAAu6N,qBAAA,UAAA3lP,CAAA,CAAAokP,CAAA,EACA,IAAAA,EACA,SAGA,IAAA3S,EAAA,KAAApxO,OAAA,CACAulP,EAAAnU,EAAAmU,mBAAA,CAAAC,EAAApU,EAAAoU,6BAAA,CAGA,IAAAD,GAAA,CAAAC,GAIAD,YAAAA,GAAA,MAAA7D,YAAA,CAAA9kP,MAAA,CAHA,SAOA,IAAA6oP,EAAAF,YAAAA,EAAA,KAAA7D,YAAA,CAAA6D,CAAA,CACA,OAAA9mP,OAAAiE,IAAA,CAAA/C,GAAA8pE,IAAA,UAAAprE,CAAA,EACA,IAAAqnP,EAAArnP,EACAsnP,EAAAhmP,CAAA,CAAA+lP,EAAA,GAAA3B,CAAA,CAAA2B,EAAA,CACAE,EAAAH,IAAA,EAAAA,EAAA,OAAAA,EAAAh8K,IAAA,UAAA3qE,CAAA,EACO,OAAAA,IAAAT,CACP,GACAwnP,EAAAL,IAAA,EAAAA,EAAA,OAAAA,EAAA/7K,IAAA,UAAA3qE,CAAA,EACO,OAAAA,IAAAT,CACP,GACK,OAAAsnP,GAAA,CAAAE,GAAA,EAAAJ,GAAAG,CAAA,CACL,IAGA76N,EAAAs1N,YAAA,UAAAI,CAAA,EACA,IAAAsD,EAAA,KAAArD,aAAA,CAKA,GAJA,KAAAA,aAAA,MAAAqC,YAAA,MAAAnB,YAAA,MAAA5hP,OAAA,EACA,KAAAikP,kBAAA,MAAArC,YAA8C,CAAAj7L,KAAA,MAAAw9L,oBAAA,MAAAnkP,OAAA,EAG9C,GAAAw/C,EAAAsmM,EAAA,OAAApF,aAAA,CAAAqD,IAKA,IAAAgC,EAAA,CACA3zN,MAAA,IAGAquN,CAAAA,IAAA,EAAAA,EAAA,OAAAA,EAAA1pK,SAAA,aAAAuuK,qBAAA,MAAA5E,aAAA,CAAAqD,IACAgC,CAAAA,EAAAhvK,SAAA,KAGA,KAAAs8C,MAAA,IAAAr4F,EAAA5W,CAAA,KAAA2hO,EAAAtF,IAZM,EAeN11N,EAAAu3N,WAAA,gBAAA5P,EAAA,KAAAp5F,MAAA,CAAAigG,aAAA,GAAAvxL,KAAA,MAAAsxF,MAAA,MAAAt5I,OAAA,EAGA,GAAA0yO,IAAA,KAAAkP,YAAA,EAIA,IAAAS,EAAA,KAAAT,YAAA,CACA,KAAAA,YAAA,CAAAlP,EACA,KAAA4R,wBAAA,CAAA5R,EAAA/rL,KAAA,MAAA69L,mBAAA,MAAA9D,aAAA,CAGA,KAAA3U,YAAA,KACAsW,IAAA,EAAAA,GAAAA,EAAA1U,cAAA,OACA+E,EAAAjF,WAAA,QAVA,EAcA1iN,EAAAspN,aAAA,UAAA/1M,CAAA,MAAAmiN,EAAA,EAGAniN,CAAA,YAAAA,EAAAhgC,IAAA,CACMmiP,EAAAvS,SAAA,IACN,UAAA5vM,EAAAhgC,IAAA,KAAAsvO,EAAAwG,EAAA,EAAA91M,EAAA18B,KAAA,GACA6+O,CAAAA,EAAAtmB,OAAA,KAEA,KAAAkmB,YAAA,CAAAI,GAGA,KAAA1U,YAAA,IACA,KAAAgW,YAAA,EACA,EAGAh3N,EAAAsoG,MAAA,UAAAotH,CAAA,MAAAuF,EAAA,KAGAhX,EAAAlhL,CAAA,CAAAmf,KAAA,YAEAwzK,EAAAvS,SAAA,EACA8X,IAAA,EAAAA,EAAAhmP,OAAA,CAAAkuO,SAAA,EAAA8X,EAAAhmP,OAAA,CAAAkuO,SAAA,CAAA8X,EAAAtF,aAAA,CAAAtjP,IAAA,EACQ4oP,IAAA,EAAAA,EAAAhmP,OAAA,CAAAmuO,SAAA,EAAA6X,EAAAhmP,OAAA,CAAAmuO,SAAA,CAAA6X,EAAAtF,aAAA,CAAAtjP,IAAA,QACRqjP,EAAAtmB,OAAA,GACA6rB,IAAA,EAAAA,EAAAhmP,OAAA,CAAAm6N,OAAA,EAAA6rB,EAAAhmP,OAAA,CAAAm6N,OAAA,CAAA6rB,EAAAtF,aAAA,CAAA9+O,KAAA,EACQokP,IAAA,EAAAA,EAAAhmP,OAAA,CAAAmuO,SAAA,EAAA6X,EAAAhmP,OAAA,CAAAmuO,SAAA,CAAA1uO,KAAAA,EAAAumP,EAAAtF,aAAA,CAAA9+O,KAAA,GAIR6+O,EAAA1pK,SAAA,EACAivK,EAAAjvK,SAAA,CAAAluE,OAAA,UAAAqzD,CAAA,EACSA,EAAA8pL,EAAAtF,aAAA,CACD,GAIRD,EAAAruN,KAAA,EACA4zN,EAAA1sG,MAAA,CAAAigG,aAAA,GAAAlmH,MAAA,EACAq/G,MAAAsT,EAAApE,YAAA,CACStjP,KAAA,wBACT,EAEA,IAGEmjP,CAAY,EAAAzM,EAAArsM,CAAA,EAGd,SAAAs9M,EAAAvT,CAAA,CAAA1yO,CAAA,EACA,MAAAA,CAAA,IAAAA,EAAA8xO,OAAA,GAAAY,EAAA/rL,KAAA,CAAA+qL,aAAA,GAAAgB,CAAAA,UAAAA,EAAA/rL,KAAA,CAAAj9C,MAAA,EAAA1J,CAAA,IAAAA,EAAAkmP,YAAA,EAGA,SAAArE,EAAAnP,CAAA,CAAA1yO,CAAA,EACA,OAAAimP,EAAAvT,EAAA1yO,IAAA0yO,EAAA/rL,KAAA,CAAA+qL,aAAA,IAAAsQ,EAAAtP,EAAA1yO,EAAAA,EAAAmmP,cAAA,EAGA,SAAAnE,EAAAtP,CAAA,CAAA1yO,CAAA,CAAA2vE,CAAA,EACA,GAAA3vE,CAAA,IAAAA,EAAA8xO,OAAA,EACA,IAAA1zO,EAAA,mBAAAuxE,EAAAA,EAAA+iK,GAAA/iK,CAAA,CACA,MAAAvxE,WAAAA,GAAAA,CAAA,IAAAA,GAAA2zO,EAAAW,EAAA1yO,EAAA,OAGA,GAGA,SAAAwiP,EAAA9P,CAAA,CAAA2P,CAAA,CAAAriP,CAAA,CAAAoiP,CAAA,EACA,MAAApiP,CAAA,IAAAA,EAAA8xO,OAAA,EAAAY,CAAAA,IAAA2P,GAAAD,CAAA,IAAAA,EAAAtQ,OAAA,KAAA9xO,EAAAghP,QAAA,EAAAtO,UAAAA,EAAA/rL,KAAA,CAAAj9C,MAAA,GAAAqoO,EAAAW,EAAA1yO,EAAA,CAGA,SAAA+xO,EAAAW,CAAA,CAAA1yO,CAAA,EACA,OAAA0yO,EAAAR,aAAA,CAAAlyO,EAAAmyO,SAAA,ECjiBA,SAAAiU,GAAA,CACA,IAAAC,EAAA,GACA,OACAC,WAAA,WACKD,EAAA,EACL,EACAroI,MAAA,WACKqoI,EAAA,EACL,EACAE,QAAA,WACA,OAAAF,CACA,CACA,EAEsF,IAAAG,EAAA3vC,EAAA9jL,aAAA,CAAAqzN,KAGtFK,EAAyB,WACzB,OAAG5vC,EAAAxjL,UAAA,CAAAmzN,EAAA,ECfH,SAAAE,EAAmB1mP,CAAA,CAAY2mP,CAAA,MAAAzF,EAAArqC,EAAAviL,MAAA,KAG/B6sN,EAAAC,EAAA3nC,QAAA,OAGAgpB,EAAAwd,IACA2G,EAAAH,IAA2E9M,EAAAlX,EAAAwZ,2BAAA,CAAAj8O,EAE9B25O,CAAAA,EAAAgL,iBAAA,IAG7ChL,EAAAxf,OAAA,EACAwf,CAAAA,EAAAxf,OAAA,CAAA6U,EAAAlhL,CAAA,CAAAwhL,UAAA,CAAAqK,EAAAxf,OAAA,GAGAwf,EAAAzL,SAAA,EACAyL,CAAAA,EAAAzL,SAAA,CAAAc,EAAAlhL,CAAA,CAAAwhL,UAAA,CAAAqK,EAAAzL,SAAA,GAGAyL,EAAAxL,SAAA,EACAwL,CAAAA,EAAAxL,SAAA,CAAAa,EAAAlhL,CAAA,CAAAwhL,UAAA,CAAAqK,EAAAxL,SAAA,GAGAwL,EAAAqH,QAAA,GAGA,iBAAArH,EAAAxH,SAAA,EACMwH,CAAAA,EAAAxH,SAAA,MAKN,IAAAwH,EAAAjJ,SAAA,EACAiJ,CAAAA,EAAAjJ,SAAA,KAIAiJ,CAAAA,EAAAqH,QAAA,EAAArH,EAAA4H,gBAAA,GAEA,CAAAqF,EAAAL,OAAA,IACA5M,CAAAA,EAAAuM,YAAA,KAIA,IAEAxY,EAAAmZ,EAFAptC,QAAA,YACG,WAAAktC,EAAAlkB,EAAAkX,EACH,MAGEh6O,EAAA+tO,EAAeoV,mBAAA,CAAAnJ,GA2BjB,GA1BA9iC,EAAAE,SAAA,YACAmqC,EAAAzsN,OAAA,IACAmyN,EAAAN,UAAA,GACA,IAAAnqL,EAAAuxK,EAAA3xK,SAAA,CAAAizK,EAAAlhL,CAAA,CAAAwhL,UAAA,YACA4R,EAAAzsN,OAAA,EACA0sN,EAAA,SAAAriP,CAAA,EACS,OAAAA,EAAA,CACT,EAEA,IAIA,OADA4uO,EAAA2S,YAAA,GACA,WACAa,EAAAzsN,OAAA,IACA0nC,GACG,CACD,GAAAyqL,EAAelZ,EAAA,EACjB72B,EAAAE,SAAA,YAGA22B,EAAA0C,UAAA,CAAAuJ,EAAA,CACK5iK,UAAA,EACF,EAAiC,GAAA4iK,EAAAjM,EAAA,EAGpCiM,EAAAqH,QAAA,EAAArhP,EAAAihP,SAAA,CACA,MAAAlT,EAAA2V,eAAA,CAAA1J,GAAAh7N,IAAA,UAAAqV,CAAA,EACA,IAAA52B,EAAA42B,EAAA52B,IAAA,CACA,MAAAu8O,EAAAzL,SAAA,EAAAyL,EAAAzL,SAAA,CAAA9wO,GACKu8O,IAAA,EAAAA,EAAAxL,SAAA,EAAAwL,EAAAxL,SAAA,CAAA/wO,EAAA,KACL,GAAAi/D,KAAA,UAAAz6D,CAAA,EACAglP,EAAAN,UAAA,GACA3M,IAAA,EAAAA,EAAAxf,OAAA,EAAAwf,EAAAxf,OAAA,CAAAv4N,GACK+3O,IAAA,EAAAA,EAAAxL,SAAA,EAAAwL,EAAAxL,SAAA,CAAA1uO,KAAAA,EAAAmC,EACD,GAIJ,GAAAjC,EAAAsqG,OAAA,GAAA28I,EAAAL,OAAA,KAAA5mP,EAAAqxO,UAAA,EAAA+P,EAAApH,EAAAqH,QAAA,CAAArH,EAAA4H,gBAAA,EAAA5hP,EAAAiC,KAAA,CAAA8rO,EAAA0V,eAAA,KACI,MAAAzjP,EAAAiC,KAAA,CAQJ,MAJA,YAAA+3O,EAAA4L,mBAAA,EACA5lP,CAAAA,EAAA+tO,EAAAsV,WAAA,CAAArjP,EAAAg6O,EAAA,EAGAh6O,CAAA,CCpGA,SAAA+sO,EAAA3lE,CAAsB,CAAAC,CAAA,CAAAC,CAAA,EAEtB,OAAAy/E,EADqB,GAAAlnM,EAA6Bk6L,EAAA,EAAA3yE,EAAAC,EAAAC,GAClDw6E,EAAA,CCuDA,SAAAz2N,EAAAsuH,CAAA,CAAAwpF,CAAA,CAAA9iO,CAAA,EACA,oBAAA8iO,GAAAA,IAAA,GAAAA,GAIA,IAAAuK,EAAA/zF,EAAAmiG,gBAAA,GACAjD,EAAAl/F,EAAAigG,aAAA,GACArD,EAAApT,EAAAoT,SAAA,KACAhB,EAAApS,EAAAoS,OAAA,KACAgB,EAAArtO,OAAA,UAAAi+O,CAAA,MAAAC,EAGA1Z,EAAArlL,KAAA,CAAAsxF,EAAA,GAAAt+G,EAAA5W,CAAA,KAAApkB,IAAA,EAAAA,EAAA,aAAA+mP,CAAAA,EAAA/mP,EAAA6G,cAAA,SAAAkgP,EAAA7Q,SAAA,EACKG,YAAAyQ,EAAAzQ,WAAA,GACFyQ,EAAAngM,KAAA,CACH,GACAuuL,EAAArsO,OAAA,UAAAm+O,CAAA,EAE2D,IAF3DC,EAE2DvU,EAAA8F,EAAA/5N,GAAA,CAAAuoO,EAAA1W,SAAA,EAG3D,GAAAoC,EAAA,CACAA,EAAA/rL,KAAA,CAAA+qL,aAAA,CAAAsV,EAAArgM,KAAA,CAAA+qL,aAAA,EACAgB,EAAAnF,QAAA,CAAAyZ,EAAArgM,KAAA,EAGM,SAINqB,KAAA,CAAAsxF,EAAA,GAAAt+G,EAAA5W,CAAA,KAAApkB,IAAA,EAAAA,EAAA,aAAAinP,CAAAA,EAAAjnP,EAAA6G,cAAA,SAAAogP,EAAA/R,OAAA,EACA7E,SAAA2W,EAAA3W,QAAA,CACKC,UAAA0W,EAAA1W,SAAA,GACF0W,EAAArgM,KAAA,CACH,GAhCA,CC5DA,SAAAugM,EAAoBvgM,CAAA,CAAA3mD,CAAc,EAClC,IAAAyiO,EAAmBwd,IACnBkH,EAAAtwC,EAAAviL,MAAA,CAAgCt0B,EAChCmnP,CAAAA,EAAA1yN,OAAA,CAAAz0B,EAKA62M,EAAA6E,OAAA,YACM/0J,GACN37B,EAAAy3M,EAAA97K,EAAAwgM,EAAA1yN,OAAA,CAEA,GAAAguM,EAAA97K,EAAA,CACO,CACP,IAAAk8K,EAAA,SAAA7uM,CAAA,EACA,IAAA5G,EAAA4G,EAAA5G,QAAA,CACAptB,EAAAg0B,EAAAh0B,OAAA,CAGA,OADAknP,EADAlzN,EAAA2yB,KAAA,CACA3mD,GACAotB,CAAA,CCZiD,gBAAA3xB,CAAA,ECXpC,aAGb,IAAAujB,EAAAvgB,OAAA0L,SAAA,CAAAC,cAAA,CAAA+mE,EAAA,IASA,SAAAgnH,GAAA,EA6BA,SAAAC,EAAA7lK,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,EACA,KAAA9lK,EAAA,CAAAA,EACA,KAAA3yB,OAAA,CAAAA,EACA,KAAAy4L,IAAA,CAAAA,GAAA,GAcA,SAAAC,EAAAC,CAAA,CAAApmH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,EACA,sBAAA9lK,EACA,mDAGA,IAAA2pC,EAAA,IAAAk8H,EAAA7lK,EAAA3yB,GAAA24L,EAAAF,GAAAG,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAOA,OAJAomH,EAAA33H,OAAA,CAAA43H,EAAA,CACAD,EAAA33H,OAAA,CAAA43H,EAAA,CAAAjmK,EAAA,CAAAgmK,EAAA33H,OAAA,CAAA43H,EAAA,EAAAD,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt8H,EAAA,CAAAq8H,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt9L,IAAA,CAAAghE,GADAq8H,CAAAA,EAAA33H,OAAA,CAAA43H,EAAA,CAAAt8H,EAAAq8H,EAAAE,YAAA,IAIAF,CAAA,CAUA,SAAAG,EAAAH,CAAA,CAAAC,CAAA,EACA,KAAAD,EAAAE,YAAA,CAAAF,EAAA33H,OAAA,KAAAu3H,EACA,OAAAI,EAAA33H,OAAA,CAAA43H,EAAA,CAUA,SAAAG,GAAA,CACA,KAAA/3H,OAAA,KAAAu3H,EACA,KAAAM,YAAA,GAxEAh6L,OAAA8C,MAAA,GAAA42L,EAAAhuL,SAAA,CAAA1L,OAAA8C,MAAA,OAOA,IAAA42L,IAAAprI,SAAA,EAAAokB,CAAAA,EAAA,KA2EAwnH,EAAAxuL,SAAA,CAAAyuL,UAAA,YACA,IACA/lI,EAAAl0D,EADAk6L,EAAA,GAGA,YAAAJ,YAAA,QAAAI,CAAA,CAGA,IAAAl6L,KAAAk0D,EAAA,KAAA+N,OAAA,CACA5hD,EAAA3U,IAAA,CAAAwoD,EAAAl0D,IAAAk6L,EAAA39L,IAAA,CAAAi2E,EAAAxyE,EAAA3B,KAAA,IAAA2B,CAAA,SAGA,OAAAymD,qBAAA,CACAyzI,EAAA/mK,MAAA,CAAArzB,OAAA2mD,qBAAA,CAAAyN,IAGAgmI,CAHA,EAaAF,EAAAxuL,SAAA,CAAA4sE,SAAA,UAAA5E,CAAA,EACA,IAAAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAAAlhC,EAAA,KAAA2vB,OAAA,CAAA43H,EAAA,CAGA,IAAAvnJ,EAAA,YAAAA,EAAA1e,EAAA,QAAA0e,EAAA1e,EAAA,EAGA,QAAAvwB,EAAA,EAAA2mC,EAAAsI,EAAAr0C,MAAA,CAAAi3D,EAAA,MAAAlrB,GAAA3mC,EAAA2mC,EAAA3mC,IACA6xD,CAAA,CAAA7xD,EAAA,CAAAivC,CAAA,CAAAjvC,EAAA,CAAAuwB,EAAA,CAGA,OAAAshC,CAAA,EAUA8kI,EAAAxuL,SAAA,CAAA2uL,aAAA,UAAA3mH,CAAA,EACA,IAAAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAAA4E,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,QAGA,EACAzhH,EAAAxkD,EAAA,GACAwkD,EAAAn6E,MAAA,CAFA,GAYA+7L,EAAAxuL,SAAA,CAAA8xD,IAAA,UAAAkW,CAAA,CAAA2tD,CAAA,CAAAE,CAAA,CAAAo9C,CAAA,CAAAG,CAAA,CAAAG,CAAA,MAAA8a,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAEA,SAAAvR,OAAA,CAAA43H,EAAA,UAGA,IAEAtzL,EAAAlD,EAFA+0E,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,CACApjK,EAAAN,UAAAl4B,MAAA,CAIA,GAAAm6E,EAAAxkD,EAAA,EAGA,OAHAwkD,EAAAshH,IAAA,OAAAU,cAAA,CAAA5mH,EAAA4E,EAAAxkD,EAAA,CAAA9yB,KAAAA,EAAA,IAGA21B,GACA,cAAA2hD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,UACA,SAAAm3E,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,GAAA,QACA,SAAA/oD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,GAAA,QACA,SAAAjpD,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,GAAA,QACA,SAAArmG,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,EAAAG,GAAA,QACA,SAAAxmG,EAAAxkD,EAAA,CAAAloB,IAAA,CAAA0sE,EAAAn3E,OAAA,CAAAkgI,EAAAE,EAAAo9C,EAAAG,EAAAG,GAAA,GAGA,IAAA17K,EAAA,EAAAkD,EAAA,MAAAkwB,EAAA,GAAApzB,EAAAozB,EAAApzB,IACAkD,CAAA,CAAAlD,EAAA,GAAA8yB,SAAA,CAAA9yB,EAAA,CAGI+0E,EAAAxkD,EAAA,CAAA91B,KAAA,CAAAs6E,EAAAn3E,OAAA,CAAAsF,EACJ,MACA,IAAAgrB,EAAAtzB,EAAAm6E,EAAAn6E,MAAA,CAGA,IAAAoF,EAAA,EAAAA,EAAApF,EAAAoF,IAGA,OAHA+0E,CAAA,CAAA/0E,EAAA,CAAAq2L,IAAA,OAAAU,cAAA,CAAA5mH,EAAA4E,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAA9yB,KAAAA,EAAA,IAGA21B,GACA,OAAA2hD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,OAAgE,MAChE,EAAAm3E,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,GAAA,KAAoE,MACpE,EAAA/oD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,EAAAE,GAAA,KAAwE,MACxE,EAAAjpD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAAloB,IAAA,CAAA0sE,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAkgI,EAAAE,EAAAo9C,GAAA,cAEA,IAAAl4K,EAAA,IAAAgrB,EAAA,EAAAhrB,EAAA,MAAAkwB,EAAA,GAAAlF,EAAAkF,EAAAlF,IACAhrB,CAAA,CAAAgrB,EAAA,GAAA4E,SAAA,CAAA5E,EAAA,CAGA6mD,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,CAAA91B,KAAA,CAAAs6E,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,CAAAsF,EACA,CACA,OAGA,IAYAyzL,EAAAxuL,SAAA,CAAAqvD,EAAA,UAAA2Y,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,EACA,OAAA04L,EAAA,KAAAnmH,EAAA5/C,EAAA3yB,EAAA,KAYA+4L,EAAAxuL,SAAA,CAAAkuL,IAAA,UAAAlmH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,EACA,OAAA04L,EAAA,KAAAnmH,EAAA5/C,EAAA3yB,EAAA,KAaA+4L,EAAAxuL,SAAA,CAAA4uL,cAAA,UAAA5mH,CAAA,CAAA5/C,CAAA,CAAA3yB,CAAA,CAAAy4L,CAAA,MAAAG,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CAGA,SAAAvR,OAAA,CAAA43H,EAAA,aACA,IAAAjmK,EAEA,OADAmmK,EAAA,KAAAF,GACA,KAEA,IAAAzhH,EAAA,KAAAnW,OAAA,CAAA43H,EAAA,CAGA,GAAAzhH,EAAAxkD,EAAA,CAEAwkD,EAAAxkD,EAAA,GAAAA,GACA,IAAAwkD,EAAAshH,IAAA,EACA,GAAAthH,EAAAn3E,OAAA,GAAAA,GAEA84L,EAAA,KAAAF,OAEA,CACA,QAAAx2L,EAAA,EAAA6wD,EAAA,GAAAj2D,EAAAm6E,EAAAn6E,MAAA,CAAAoF,EAAApF,EAAAoF,IAEA+0E,CAAAA,CAAA,CAAA/0E,EAAA,CAAAuwB,EAAA,GAAAA,GACA8lK,GAAA,CAAAthH,CAAA,CAAA/0E,EAAA,CAAAq2L,IAAA,EACAz4L,GAAAm3E,CAAA,CAAA/0E,EAAA,CAAApC,OAAA,GAAAA,CAAA,GAEAizD,EAAA33D,IAAA,CAAA67E,CAAA,CAAA/0E,EAAA,CAOA6wD,CAAAA,EAAAj2D,MAAA,MAAAgkE,OAAA,CAAA43H,EAAA,CAAA3lI,IAAAA,EAAAj2D,MAAA,CAAAi2D,CAAA,IAAAA,CAAA,CACA6lI,EAAA,KAAAF,EAAA,QAGA,MAUAG,EAAAxuL,SAAA,CAAA6uL,kBAAA,UAAA7mH,CAAA,MAAAqmH,EAWA,OARArmH,GACAqmH,EAAArnH,EAAAA,EAAAgB,EAAAA,CAAA,CACI,KAAAvR,OAAA,CAAA43H,EAAA,EAAAE,EAAA,KAAAF,KAEJ,KAAA53H,OAAA,KAAAu3H,EACA,KAAAM,YAAA,IAGA,MAMAE,EAAAxuL,SAAA,CAAAkvK,GAAA,CAAAsf,EAAAxuL,SAAA,CAAA4uL,cAAA,CAAAJ,EAAAxuL,SAAA,CAAAmuL,WAAA,CAAAK,EAAAxuL,SAAA,CAAAqvD,EAAA,CAKAm/H,EAAAM,QAAA,CAAA9nH,EAKAwnH,EAAAA,YAAA,CAAAA,EAOAl9L,EAAAC,OAAA,CAAAi9L,CAAA,gBAAAl9L,CAAA,CAAAC,CAAA,CAAAL,CAAA,EC9UA,qFAEA,IAAA0iB,EAAA1iB,EAAA,MAAAe,EAAA2hB,EAAA3hB,MAAA,CAIA,SAAAgrP,EAAAxyO,CAAA,CAAA0zF,CAAA,EACA,QAAAjqG,KAAAuW,EACA0zF,CAAA,CAAAjqG,EAAA,CAAAuW,CAAA,CAAAvW,EAAA,CAWA,SAAAgpP,EAAA70N,CAAA,CAAAktE,CAAA,CAAA9iG,CAAA,EACA,OAAAR,EAAAo2B,EAAAktE,EAAA9iG,EAAA,CATAR,EAAA2d,IAAA,EAAA3d,EAAAknB,KAAA,EAAAlnB,EAAAujG,WAAA,EAAAvjG,EAAA+mG,eAAA,CACE1nG,EAAAC,OAAA,CAAAqiB,GAGAqpO,EAAArpO,EAAcriB,GAChBA,EAAAU,MAAA,CAAAirP,GAMAA,EAAAl9O,SAAA,CAAA1L,OAAA8C,MAAA,CAAAnF,EAAA+N,SAAA,EAGAi9O,EAAAhrP,EAAAirP,GAGAA,EAAAttO,IAAA,UAAAyY,CAAA,CAAAktE,CAAA,CAAA9iG,CAAA,EACA,oBAAA41B,EACA,iDAEA,OAAAp2B,EAAAo2B,EAAAktE,EAAA9iG,EAAA,EAGAyqP,EAAA/jO,KAAA,UAAA/mB,CAAA,CAAAs0F,CAAA,CAAAhsF,CAAA,EACA,oBAAAtI,EACA,6CAEA,IAAAmhB,EAAAthB,EAAAG,GAUA,OATAs0F,KAAApxF,IAAAoxF,EACA,iBAAAhsF,EACM6Y,EAAAmzE,IAAA,CAAAA,EAAAhsF,GAEN6Y,EAAAmzE,IAAA,CAAAA,GAGAnzE,EAAAmzE,IAAA,IAEAnzE,CAAA,EAGA2pO,EAAA1nJ,WAAA,UAAApjG,CAAA,EACA,oBAAAA,EACA,6CAEA,OAAAH,EAAAG,EAAA,EAGA8qP,EAAAlkJ,eAAA,UAAA5mG,CAAA,EACA,oBAAAA,EACA,6CAEA,OAAAwhB,EAAAmhF,UAAA,CAAA3iG,EAAA,iBAAAd,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,EChEa,aAGb,IAAA+xL,EAAa/xL,EAA8B,KAC3CwG,EAAAxG,EAAqB,MACrBisP,EAAWjsP,EAAc,QAAAksP,EAAAlsP,EAAA,MAGzBqyL,EAAAryL,EAAA,MAAAmsP,EAAAp6D,EAAA,eAIA3xL,CAAAA,EAAAC,OAAA,UAAA62B,CAAA,CAAA31B,CAAA,EACA,sBAAA21B,EACA,UAAAm7J,EAAA,0BAEA,oBAAA9wL,GAAAA,EAAA,GAAAA,EAAA,YAAA4qP,EAAA5qP,KAAAA,EACA,UAAA8wL,EAAA,8CAEA,IAAA6J,EAAAziK,UAAAl4B,MAAA,MAAAk4B,SAAA,IAGA2yN,EAAA,GACAC,EAAA,GACA,cAAAn1N,GAAAg1N,EAAA,CACA,IAAAhsM,EAAAgsM,EAAAh1N,EAAA,UACAgpB,GAAA,CAAAA,EAAAG,YAAA,EACA+rM,CAAAA,EAAA,IAEAlsM,GAAA,CAAAA,EAAAE,QAAA,EACAisM,CAAAA,EAAA,GACA,OAGAD,CAAAA,GAAAC,GAAA,CAAAnwD,CAAA,IACA+vD,EACAzlP,EAAI0wB,EAAA,SAAA31B,EAAA,OAEJiF,EAAA0wB,EAAA,SAAA31B,IAGA21B,CAAA,iBAAA92B,CAAA,ECzCa,aAGb,IAAAksP,EAAA,GACAx2K,EAAA,mBACA,SAAA6qI,EAAA74M,CAAA,CAAApF,CAAA,EACA,IAAAoF,GAGA,GAAAwkP,EACA,YAAAx2K,EAAA,CAEA,IAAAy2K,EAAA,mBAAA7pP,EAAAA,IAAAA,CAAA,OAEA,MADA6pP,EAAA,GAAA91N,MAAA,CAAAq/C,EAAA,MAAAr/C,MAAA,CAAA81N,GAAAz2K,CAAA,CACA,CANA,CAQA11E,EAAAC,OAAA,CAAAsgN,CAAA,eAAAvgN,CAAA,ECfAA,EAAAC,OAAA,UAAA82B,CAAA,EACA,OAAAA,GAAA,iBAAAA,GACA,mBAAAA,EAAAjP,IAAA,EACA,mBAAAiP,EAAAq+D,IAAA,EACA,mBAAAr+D,EAAA4yE,SAAA,iBAAAjqG,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECLA,aAMA,IAAAwsP,EAAAxsP,EAA0B,MAC1BysP,EAAsBzsP,EAA2B,MACjDgoM,EAAmBhoM,EAAQ,MAAgB0sP,EAAA1sP,EAAA,MAG3C,SAAA+sK,EAAAx/H,CAAA,EACA,OAAAA,EAAAv+B,IAAA,CAAAiO,IAAA,CAAAswB,EAAA,CAGA,IAAAo/M,EAAA,oBAAA/hM,OAAAgiM,EAAA,oBAAAjpP,OAEAkpP,EAAA9/E,EAAA3pK,OAAA0L,SAAA,CAAAxF,QAAA,EAGAwjP,EAAA//E,EAAA9zJ,OAAAnK,SAAA,CAAA81F,OAAA,EACAmoJ,EAAAhgF,EAAAtsJ,OAAA3R,SAAA,CAAA81F,OAAA,EAAAooJ,EAAAjgF,EAAAvuF,QAAA1vE,SAAA,CAAA81F,OAAA,EAGA,GAAA+nJ,EACA,IAAAM,EAAAlgF,EAAAniH,OAAA97C,SAAA,CAAA81F,OAAA,EAGA,GAAAgoJ,EACA,IAAAM,EAAAngF,EAAAppK,OAAAmL,SAAA,CAAA81F,OAAA,EAGA,SAAAuoJ,EAAApqP,CAAA,CAAAqqP,CAAA,EACA,oBAAArqP,EACA,QACA,CACA,IAEI,OADJqqP,EAAArqP,GACI,EACJ,OAAA2E,EAAA,CACA,QACA,EASA,SAAA88J,EAAAvgK,CAAA,EACA,MACA,aACA,OAAAsd,SACAtd,aAAAsd,SAGAtd,IAAA,GAAAA,GACA,iBAAAA,GACA,mBAAAA,EAAAqf,IAAA,EACA,mBAAArf,EAAA+8D,KAAA,CAMA,SAAA5gD,EAAArd,CAAA,QACA,oBAAAsd,aAAAA,YAAAC,MAAA,CACAD,YAAAC,MAAA,CAAAvd,GAIA2pP,EAAA3pP,IACAgd,EAAAhd,EALA,CAWA,SAAAsqP,EAAAtqP,CAAA,EACA,MAAAilM,eAAAA,EAAAjlM,EACA,CAGA,SAAAuqP,EAAAvqP,CAAA,EACA,MAAAilM,sBAAAA,EAAAjlM,EACA,CAGA,SAAAwqP,EAAAxqP,CAAA,EACA,MAAAilM,gBAAAA,EAAAjlM,EACA,CAGA,SAAAyqP,EAAAzqP,CAAA,EACA,MAAAilM,gBAAAA,EAAAjlM,EACA,CAGA,SAAA0qP,EAAA1qP,CAAA,EACA,MAAAilM,cAAAA,EAAAjlM,EACA,CAGA,SAAA2qP,EAAA3qP,CAAA,EACA,MAAAilM,eAAAA,EAAAjlM,EACA,CAGA,SAAA4qP,EAAA5qP,CAAA,EACA,MAAAilM,eAAAA,EAAAjlM,EACA,CAGA,SAAA0qK,EAAA1qK,CAAA,EACA,MAAAilM,iBAAAA,EAAAjlM,EACA,CAGA,SAAA2qK,EAAA3qK,CAAA,EACA,MAAAilM,iBAAAA,EAAAjlM,EACA,CAGA,SAAA6qP,EAAA7qP,CAAA,EACA,MAAAilM,kBAAAA,EAAAjlM,EACA,CAGA,SAAA8qP,EAAA9qP,CAAA,EACA,MAAAilM,mBAAAA,EAAAjlM,EACA,CAGA,SAAA+qP,EAAA/qP,CAAA,EACA,MAAA8pP,iBAAAA,EAAA9pP,EACA,CAMA,SAAAkqK,EAAAlqK,CAAA,QACA,oBAAA0C,KAIAqoP,CAAAA,EAAAC,OAAA,CACAD,EAAA/qP,GACAA,aAAA0C,GAAA,CACA,CAGA,SAAAuoP,EAAAjrP,CAAA,EACA,MAAA8pP,iBAAAA,EAAA9pP,EACA,CAKA,SAAAmxD,EAAAnxD,CAAA,QACA,oBAAA4C,KAIAqoP,CAAAA,EAAAD,OAAA,CACAC,EAAAjrP,GACAA,aAAA4C,GAAA,CACA,CAGA,SAAAsoP,EAAAlrP,CAAA,EACA,MAAA8pP,qBAAAA,EAAA9pP,EACA,CAKA,SAAAmrP,EAAAnrP,CAAA,QACA,oBAAAsyB,SAIA44N,CAAAA,EAAAF,OAAA,CACAE,EAAAlrP,GACAA,aAAAsyB,OAAA,CACA,CAGA,SAAA84N,EAAAprP,CAAA,EACA,MAAA8pP,qBAAAA,EAAA9pP,EACA,CAKA,SAAAqrP,EAAArrP,CAAA,EACA,OAAAorP,EAAAprP,EACA,CAGA,SAAAsrP,EAAAtrP,CAAA,EACA,MAAA8pP,yBAAAA,EAAA9pP,EACA,CAKA,SAAAurP,EAAAvrP,CAAA,QACA,oBAAAsd,aAIAguO,CAAAA,EAAAN,OAAA,CACAM,EAAAtrP,GACAA,aAAAsd,WAAA,CACA,CAGA,SAAAkuO,EAAAxrP,CAAA,EACA,MAAA8pP,sBAAAA,EAAA9pP,EACA,CAMA,SAAAgd,EAAAhd,CAAA,QACA,oBAAAkd,UAIAsuO,CAAAA,EAAAR,OAAA,CACAQ,EAAAxrP,GACAA,aAAAkd,QAAA,CACA,CA/LA5f,EAAAmsP,iBAAA,CAA2BA,EAC3BnsP,EAAAosP,mBAAoB,CAAAA,EAAApsP,EAAAqsP,YAAA,CAAAA,EAkBHrsP,EAAAmkK,SAAA,CAAAA,EAYQnkK,EAAA+f,iBAAA,CAAAA,EAML/f,EAAAgtP,YAAA,CAAAA,EAKOhtP,EAAAitP,mBAAA,CAAAA,EAKNjtP,EAAAktP,aAAA,CAAAA,EAKAltP,EAAAmtP,aAAA,CAAAA,EAKFntP,EAAAotP,WAAA,CAAAA,EAKCptP,EAAAqtP,YAAA,CAAAA,EAKArtP,EAAAstP,YAAA,CAAAA,EAKEttP,EAAAotK,cAAA,CAAAA,EAKAptK,EAAAqtK,cAAA,CAAAA,EAKCrtK,EAAAutP,eAAA,CAAAA,EAKCvtP,EAAAwtP,gBAAA,CAAAA,EAMxBC,EAAAC,OAAA,CACA,oBAAAtoP,KACAqoP,EAAA,IAAAroP,KAWapF,EAAA4sK,KAAA,CAAAA,EAMb+gF,EAAAD,OAAA,CACA,oBAAApoP,KACAqoP,EAAA,IAAAroP,KAUatF,EAAA6zD,KAAA,CAAAA,EAMb+5L,EAAAF,OAAA,CACA,oBAAA14N,SACA44N,EAAA,IAAA54N,SAUiBh1B,EAAA6tP,SAAA,CAAAA,EAMjBC,EAAAJ,OAAA,CACA,oBAAA/sD,SACAmtD,EAAA,IAAAntD,SAIiB3gM,EAAA+tP,SAAA,CAAAA,EAMjBC,EAAAN,OAAA,CACA,oBAAA1tO,aACAguO,EAAA,IAAAhuO,aAUqBhgB,EAAAiuP,aAAA,CAAAA,EAMrBC,EAAAR,OAAA,CACA,oBAAA1tO,aACA,oBAAAJ,UACAsuO,EAAA,IAAAtuO,SAAA,IAAAI,YAAA,SAUkBhgB,EAAA0f,UAAA,CAAAA,EAIlB,IAAAyuO,EAAA,oBAAA9pJ,kBAAAA,kBAAAtgG,KAAAA,CAAA,CACA,SAAAqqP,EAAA1rP,CAAA,EACA,MAAA8pP,+BAAAA,EAAA9pP,EACA,CACA,SAAA2rP,EAAA3rP,CAAA,SACA,SAAAyrP,IAIA,SAAAC,EAAAV,OAAA,EACAU,CAAAA,EAAAV,OAAA,CAAAU,EAAA,IAAAD,EAAA,EAGAC,EAAAV,OAAA,CACAU,EAAA1rP,GACAA,aAAAyrP,CAAA,CACA,CAGA,SAAAG,EAAA5rP,CAAA,EACA,MAAA8pP,2BAAAA,EAAA9pP,EACA,CAGA,SAAA6rP,EAAA7rP,CAAA,EACA,MAAA8pP,0BAAAA,EAAA9pP,EACA,CAGA,SAAA8rP,EAAA9rP,CAAA,EACA,MAAA8pP,0BAAAA,EAAA9pP,EACA,CAGA,SAAA+rP,EAAA/rP,CAAA,EACA,MAAA8pP,uBAAAA,EAAA9pP,EACA,CAGA,SAAAgsP,EAAAhsP,CAAA,EACA,MAAA8pP,gCAAAA,EAAA9pP,EACA,CAGA,SAAAqqK,EAAArqK,CAAA,EACA,OAAAoqP,EAAApqP,EAAA+pP,EACA,CAGA,SAAAz/E,EAAAtqK,CAAA,EACA,OAAAoqP,EAAApqP,EAAAgqP,EACA,CAGA,SAAAz/E,EAAAvqK,CAAA,EACA,OAAAoqP,EAAApqP,EAAAiqP,EACA,CAGA,SAAAz/E,EAAAxqK,CAAA,EACA,OAAA4pP,GAAAQ,EAAApqP,EAAAkqP,EACA,CAGA,SAAAz/E,GAAAzqK,CAAA,EACA,OAAA6pP,GAAAO,EAAApqP,EAAAmqP,EACA,CAGA,SAAA//E,GAAApqK,CAAA,EACA,OACAqqK,EAAArqK,IACAsqK,EAAAtqK,IACAuqK,EAAAvqK,IACAwqK,EAAAxqK,IACAyqK,GAAAzqK,EAEA,CAGA,SAAAiqK,GAAAjqK,CAAA,EACA,0BAAA8J,YACAyhP,CAAAA,EAAAvrP,IACA2rP,EAAA3rP,EAAA,CAEA,CArE2B1C,EAAAquP,mBAAA,CAAAA,EAKJruP,EAAAsuP,eAAA,CAAAA,EAKFtuP,EAAAuuP,aAAA,CAAAA,EAKAvuP,EAAAwuP,aAAA,CAAAA,EAKIxuP,EAAAyuP,iBAAA,CAAAA,EAKUzuP,EAAA0uP,2BAAA,CAAAA,EAKb1uP,EAAA+sK,cAAA,CAAAA,EAKA/sK,EAAAgtK,cAAA,CAAAA,EAKChtK,EAAAitK,eAAA,CAAAA,EAKDjtK,EAAAktK,cAAA,CAAAA,EAKAltK,EAAAmtK,cAAA,CAAAA,GAWEntK,EAAA8sK,gBAAA,CAAAA,GAQA9sK,EAAA2sK,gBAAA,CAAAA,GAGxB,mDAAAx/J,OAAA,UAAAwW,CAAA,EACA5gB,OAAA8L,cAAA,CAAA7O,EAAA2jB,EAAA,CACAqI,WAAA,GACAtpB,MAAA,WACA,YAAAihB,EAAA,iCAEC,oBAAAlkB,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC7UD,IAAA0oB,EAAA1oB,EAAA,MAsBAwnK,EAAApkK,OAAAokK,yBAAA,EACA,SAAAxnJ,CAAA,EAGA,QAFA3Y,EAAAjE,OAAAiE,IAAA,CAAA2Y,GACAgvO,EAAoB,GACpBroP,EAAA,EAAAA,EAAAU,EAAA9F,MAAA,CAAAoF,IACAqoP,CAAA,CAAA3nP,CAAA,CAAAV,EAAA,EAAAvD,OAAA+8C,wBAAA,CAAAngC,EAAA3Y,CAAA,CAAAV,EAAA,EAEA,OAAAqoP,CAAA,EAGAC,EAAc,UACd5uP,CAAAA,EAAAo2D,MAAA,UAAAlpB,CAAA,EACA,IAAAihE,EAAAjhE,GAAA,CAEA,QADA2O,EAAA,EAAoB,CACpBv1C,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,IACAu1C,EAAAr8C,IAAA,CAAAwoG,EAAA5uE,SAAA,CAAA9yB,EAAA,GAEA,OAAAu1C,EAAAp5C,IAAA,UAsBA,IAnBA6D,EAAA,EACAkD,EAAA4vB,UACAM,EAAAlwB,EAAAtI,MAAA,CACA4pB,EAAA1K,OAAA8sB,GAAA5oB,OAAA,CAAAsqO,EAAA,SAAAxrP,CAAA,EACA,GAAAA,OAAAA,EAAA,UACA,GAAAkD,GAAAozB,EAAA,OAAAt2B,CAAA,CACA,OAAAA,GACA,gBAAAgd,OAAA5W,CAAA,CAAAlD,IAAA,CACA,iBAAAsS,OAAApP,CAAA,CAAAlD,IAAA,CACA,UACA,IACU,OAAA7C,KAAAC,SAAA,CAAA8F,CAAA,CAAAlD,IAAA,CACV,OAAAlF,EAAA,CACA,kBACA,CACA,QACA,OAAAgC,CACG,CACH,GACAA,EAAAoG,CAAA,CAAAlD,EAAA,CAAAA,EAAAozB,EAAAt2B,EAAAoG,CAAA,GAAAlD,EAAA,CACA2oG,EAAA7rG,IAAA,CAAAC,EAAAD,GACM0nB,GAAA,IAAA1nB,EAEN0nB,GAAA,IAAAk9E,EAAA5kG,GAGA,OAAA0nB,CAAA,EAOA9qB,EAAA6uP,SAAa,CAAO,SAAAh4N,CAAA,CAAAr0B,CAAA,EACpB,YAAA6lB,GAAAA,CAAA,IAAAA,EAAAymO,aAAA,CACA,OAAAj4N,CAAA,CAIA,YAAAxO,EACA,kBACA,OAAAroB,EAAA6uP,SAAA,CAAAh4N,EAAAr0B,GAAAzB,KAAA,MAAAq4B,UACA,EAGA,IAAAqrI,EAAA,GAeA,OAdA,WACA,IAAAA,EAAiB,CACjB,GAAAp8I,EAAA0mO,gBAAA,CACQ,YAAgBvsP,EAAA,CACxB6lB,EAAA2mO,gBAAA,CACQhlP,QAAAilP,KAAA,CAAAzsP,GAERwH,QAAA9D,KAAA,CAAA1D,GAEAiiK,EAAA,EACA,QACA5tI,EAAA91B,KAAA,MAAAq4B,UAAA,CAGA,EAIA,IAAA81N,EAAA,GAAAC,EAAA,KAGA,GAAA9mO,EAAA9c,GAAA,CAAA6jP,UAAwB,EACxB,IAAAC,EAAAhnO,EAAA9c,GAAA,CAAA6jP,UAAqC,CAKrCD,EAAA,WAJAE,CAAAA,EAAAA,EAAA/qO,OAAA,8BACAA,OAAA,aACAA,OAAA,aACAT,WAAA,IACA,QACA,UA0BAmkF,EAAAroF,CAAA,CAAAzU,CAAA,EAEA,IAAA/K,EAAA,CACA8oF,KAAA,GACAqkB,QAAAC,CACA,EAiBA,OAfAn0E,UAAAl4B,MAAA,KAAAf,CAAAA,EAAAs0F,KAAA,CAAAr7D,SAAA,KACAA,UAAAl4B,MAAA,KAAAf,CAAAA,EAAAqsC,MAAA,CAAApT,SAAA,KACAo0E,EAAAtiG,GAEI/K,EAAAstG,UAAA,CAAAviG,EACJA,GAEAlL,EAAA0tG,OAAA,CAAAvtG,EAAA+K,GAGAyiG,EAAAxtG,EAAAstG,UAAA,GAAAttG,CAAAA,EAAAstG,UAAA,KACAE,EAAAxtG,EAAAs0F,KAAA,GAAAt0F,CAAAA,EAAAs0F,KAAA,IACAkZ,EAAAxtG,EAAAqsC,MAAA,GAAArsC,CAAAA,EAAAqsC,MAAA,KACAmhE,EAAAxtG,EAAAytG,aAAA,GAAAztG,CAAAA,EAAAytG,aAAA,KACAztG,EAAAqsC,MAAA,EAAArsC,CAAAA,EAAAmtG,OAAA,CAAAO,CAAA,EACAC,EAAA3tG,EAAAwf,EAAAxf,EAAAs0F,KAAA,CACA,CAmCA,SAAAoZ,EAAA/iF,CAAA,CAAAijF,CAAA,MAAAh+D,EAAAi4D,EAAA1xE,MAAA,CAAAy3E,EAAA,QAGA,EACA,QAAA/F,EAAAx7D,MAAA,CAAAuD,EAAA,QAAAjlB,EACI,QAAAk9E,EAAAx7D,MAAA,CAAAuD,EAAA,QAEJjlB,CACA,CAIA,SAAAyiF,EAAAziF,CAAA,CAAAijF,CAAA,EACA,OAAAjjF,CAAA,CAIA,SAAAkjF,EAAAptG,CAAA,MAAAsvB,EAAA,GAOA,OAJAtvB,EAAAuM,OAAA,UAAAkgC,CAAA,CAAAjlC,CAAA,EACG8nB,CAAA,CAAAmd,EAAA,MAGHnd,CAAA,CAIA,SAAA49E,EAAA3tG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,EAGA,GAAA9tG,EAAAytG,aAAA,EACAlrG,GACAwrG,EAAAxrG,EAAAslG,OAAA,GAEAtlG,EAAAslG,OAAA,GAAAhoG,EAAAgoG,OAAA,EAEA,CAAAtlG,CAAAA,EAAAT,WAAA,EAAAS,EAAAT,WAAA,CAAAwM,SAAA,GAAA/L,CAAA,GACA,IAwFAywB,EAxFAkqD,EAAA36E,EAAAslG,OAAA,CAAAiG,EAAA9tG,GAIA,OAHAguG,EAAA9wB,IACAA,CAAAA,EAAAywB,EAAA3tG,EAAAk9E,EAAA4wB,EAAA,EAEA5wB,CAAA,KAIA+wB,EAAAC,EAAAluG,EAAAuC,GACA,GAAA0rG,EACA,OAAAA,CAAA,CAIA,IAAApnG,EAAAjE,OAAAiE,IAAA,CAAAtE,GAAA4rG,EAAAN,EAAAhnG,GASA,GANA7G,EAAAstG,UAAA,EACAzmG,CAAAA,EAAAjE,OAAA+d,mBAAA,CAAApe,EAAA,EAKA6rG,EAAA7rG,IACAsE,CAAAA,EAAAkZ,OAAA,gBAAAlZ,EAAAkZ,OAAA,oBACA,OAAAsuF,EAAA9rG,EAAA,CAIA,GAAAsE,IAAAA,EAAA9F,MAAA,EACA,GAAAgtG,EAAAxrG,GAAA,CACA,IAAAO,EAAAP,EAAAO,IAAA,MAAAP,EAAAO,IAAA,IACA,OAAA9C,EAAAmtG,OAAA,aAAArqG,EAAA,cACA,IACAwrG,EAAA/rG,GACA,OAAAvC,EAAAmtG,OAAA,CAAAn4C,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,SACA,CACA,GAAAgsG,EAAAhsG,GACA,OAAAvC,EAAAmtG,OAAA,CAAA7R,KAAAhtF,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,OACA,CACA,GAAA6rG,EAAA7rG,GACA,OAAA8rG,EAAA9rG,EACA,KAEiD4tC,EAAA,GAAA1vC,EAAA,GAAA+tG,EAAA,gBA8BjD,CA1BAhqG,EAAAjC,KACA9B,EAAA,GACA+tG,EAAA,WAIAT,EAAAxrG,IAEA4tC,CAAAA,EAAA,aADA5tC,CAAAA,EAAAO,IAAA,MAAAP,EAAAO,IAAA,KACA,KAIAwrG,EAAA/rG,IACA4tC,CAAAA,EAAA,IAAA6kB,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,EAAA,EAIAgsG,EAAAhsG,IACA4tC,CAAAA,EAAA,IAAAmrD,KAAAhtF,SAAA,CAAAmgG,WAAA,CAAAjgG,IAAA,CAAAjM,EAAA,EAIA6rG,EAAA7rG,IACA4tC,CAAAA,EAAA,IAAAk+D,EAAA9rG,EAAA,EAGAsE,IAAAA,EAAA9F,MAAA,KAAAwB,GAAAA,EAAAxB,MAAA,EAIA+sG,EAAA,EACA,EAAAvrG,GACMvC,EAAAmtG,OAAA,CAAAn4C,OAAA1mD,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,UAENvC,EAAAmtG,OAAA,sBACA,EAEAntG,EAAA8oF,IAAA,CAAAzpF,IAAA,CAAAkD,GAKIywB,EADJvyB,EACIiuG,EAAA1uG,EAAAuC,EAAAurG,EAAAK,EAAAtnG,GAEJA,EAAA7F,GAAA,UAAAwB,CAAA,EACK,OAAAmsG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EAAA3rG,EAAA/B,EACL,GAEAT,EAAA8oF,IAAA,CAAAn1B,GAAA,GAGAi7C,EAAA57E,EAAAmd,EAAAq+D,IAxBAA,CAAA,IAAAr+D,EAAAq+D,CAAA,IA4BA,SAAAN,EAAAluG,CAAA,CAAAuC,CAAA,EACA,GAAAirG,EAAAjrG,GACA,OAAAvC,EAAAmtG,OAAA,0BACA,GAAAa,EAAAzrG,GAAA,CACA,IAAAssG,EAAA,IAAAvrG,KAAAC,SAAA,CAAAhB,GAAA4hB,OAAA,cACAA,OAAA,aACAA,OAAA,iBACA,OAAAnkB,EAAAmtG,OAAA,CAAA0B,EAAA,SACA,QACA,EAAAtsG,GACAvC,EAAAmtG,OAAA,IAAA5qG,EAAA,UACA8qG,EAAA9qG,GACAvC,EAAAmtG,OAAA,IAAA5qG,EAAA,WAEAusG,EAAAvsG,GACAvC,EAAAmtG,OAAA,sBALA,CASA,SAAAkB,EAAA9rG,CAAA,EACA,UAAAgL,MAAAe,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAjM,GAAA,IAIA,SAAAmsG,EAAA1uG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,CAAAK,CAAA,CAAAtnG,CAAA,EAEA,QADAmsB,EAAA,GACA7sB,EAAA,EAAA2mC,EAAAvqC,EAAAxB,MAAA,CAAAoF,EAAA2mC,EAAA,EAAA3mC,EACAoI,EAAAhM,EAAA0d,OAAA9Z,IACA6sB,EAAA3zB,IAAA,CAAAsvG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EACMluF,OAAA9Z,GAAA,KAEN6sB,EAAA3zB,IAAA,KASA,OANAwH,EAAAmG,OAAA,UAAAxK,CAAA,EACAA,EAAAy6B,KAAA,WACAjK,EAAA3zB,IAAA,CAAAsvG,EAAA3uG,EAAAuC,EAAAurG,EAAAK,EACA3rG,EAAA,IAEA,GACAwwB,CAAA,CAIA,SAAA27E,EAAA3uG,CAAA,CAAAuC,CAAA,CAAAurG,CAAA,CAAAK,CAAA,CAAA3rG,CAAA,CAAA/B,CAAA,EACA,IAAAqC,EAAA6nB,EAAA+0B,EAsCA,GApCAA,CADAA,EAAA98C,OAAA+8C,wBAAA,CAAAp9C,EAAAC,IAAA,CAAAD,MAAAA,CAAA,CAAAC,EAAA,GACAogB,GAAA,CAEM+H,EADN+0B,EAAAx6C,GAAA,CACMlF,EAAAmtG,OAAA,8BAENntG,EAAAmtG,OAAA,uBAGAztD,EAAAx6C,GAAA,EACAylB,CAAAA,EAAA3qB,EAAAmtG,OAAA,wBAGA5+F,EAAA4/F,EAAA3rG,IACAM,CAAAA,EAAA,IAAAN,EAAA,KAEA,CAAAmoB,IACA3qB,EAAAA,EAAA8oF,IAAA,CAAA/oE,OAAA,CAAA2/B,EAAAn9C,KAAA,EAMAooB,CAJQA,EADRmkF,EAAAhB,GACQH,EAAA3tG,EAAA0/C,EAAAn9C,KAAA,OAERorG,EAAA3tG,EAAA0/C,EAAAn9C,KAAA,CAAAurG,EAAA,IAEA/tF,OAAA,YAEA4K,EADAlqB,EACAkqB,EAAAjQ,KAAA,OAAA1Z,GAAA,UAAAwjB,CAAA,EACW,WAAAA,CACD,GAAAliB,IAAA,OAAAnB,KAAA,IAEV,KAAAwpB,EAAAjQ,KAAA,OAAA1Z,GAAA,UAAAwjB,CAAA,EACW,YAAAA,CACX,GAAAliB,IAAA,QAIAqoB,EAAA3qB,EAAAmtG,OAAA,0BAGAK,EAAA1qG,GAAA,CACA,GAAArC,GAAA+B,EAAAy6B,KAAA,UACA,OAAAtS,CACA,CAEA7nB,CADAA,EAAAQ,KAAAC,SAAA,IAAAf,EAAA,EACAy6B,KAAA,kCACAn6B,EAAAA,EAAA3B,KAAA,OACM2B,EAAA9C,EAAAmtG,OAAA,CAAArqG,EAAA,UAENA,EAAAA,EAAAqhB,OAAA,aACAA,OAAA,aACAA,OAAA,iBACArhB,EAAA9C,EAAAmtG,OAAA,CAAArqG,EAAA,UACA,QAGAA,EAAA,KAAA6nB,CAAA,CAIA,SAAAikF,EAAA57E,CAAA,CAAAmd,CAAA,CAAAq+D,CAAA,EACA,IAAA2gJ,EAAA,SAOA,EANAj0O,MAAA,UAAAyW,CAAA,CAAA+mE,CAAA,EAGG,OAFHy2J,IACAz2J,EAAA34E,OAAA,WAAAovO,IACGx9N,EAAA+mE,EAAAv0E,OAAA,uBAAApjB,MAAA,OAGH,GACAytG,CAAA,IACAr+D,CAAAA,KAAAA,EAAA,GAAAA,EAAA,OACA,IACAnd,EAAA1wB,IAAA,UACA,IACAksG,CAAA,IAGAA,CAAA,IAAAr+D,EAAA,IAAAnd,EAAA1wB,IAAA,WAAAksG,CAAA,IAQA,SAAAhqG,EAAAwqG,CAAA,EACA,OAAAruG,MAAA6D,OAAA,CAAAwqG,EACA,CAGA,SAAA3B,EAAA12E,CAAA,EACA,wBAAAA,CACA,CAGA,SAAAm4E,EAAAn4E,CAAA,EACA,OAAAA,IAAA,GAAAA,CACA,CAGA,SAAAy4N,EAAAz4N,CAAA,EACA,OAAAA,IAAA,EAAAA,CACA,CAGA,SAAAs4E,EAAAt4E,CAAA,EACA,uBAAAA,CACA,CAGA,SAAAq3E,EAAAr3E,CAAA,EACA,uBAAAA,CACA,CAGA,SAAAohL,EAAAphL,CAAA,EACA,uBAAAA,CACA,CAGA,SAAA62E,EAAA72E,CAAA,EACA,OAAAA,KAAA,IAAAA,CACA,CAGA,SAAA23E,EAAAliE,CAAA,EACA,OAAAlpC,EAAAkpC,IAAA8iE,oBAAAA,EAAA9iE,EACA,CAIA,SAAAlpC,EAAAyzB,CAAA,EACA,uBAAAA,GAAAA,IAAA,GAAAA,CACA,CAGA,SAAA43E,EAAA9uG,CAAA,EACA,OAAAyD,EAAAzD,IAAAyvG,kBAAAA,EAAAzvG,EACA,CAIA,SAAA2uG,EAAAlnG,CAAA,EACA,OAAAhE,EAAAgE,IACAgoG,CAAAA,mBAAAA,EAAAhoG,IAAAA,aAAAqG,KAAA,CACA,CAIA,SAAAwgG,EAAAp3E,CAAA,EACA,yBAAAA,CACA,CAGA,SAAAw4E,EAAAx4E,CAAA,EACA,OAAAA,IAAA,GAAAA,GACA,kBAAAA,GACA,iBAAAA,GACA,iBAAAA,GACA,iBAAAA,GACA,SAAAA,CACA,CAKA,SAAAu4E,EAAA1vD,CAAA,EACA,OAAA58C,OAAA0L,SAAA,CAAAxF,QAAA,CAAA0F,IAAA,CAAAgxC,EAAA,CAIA,SAAAoiE,EAAAzhH,CAAA,EACA,OAAAA,EAAA,OAAAA,EAAA2I,QAAA,KAAA3I,EAAA2I,QAAA,KAvbAjJ,EAAAwvP,QAAA,UAAAnqP,CAAA,EAEA,IAAA6pP,CAAA,CADA7pP,EAAAA,EAAAwe,WAAA,GACA,EACA,GAAAsrO,EAAgB9uO,IAAO,CAAAhb,GAAA,CACvB,IAAAoqP,EAAApnO,EAAAonO,GAAA,CACAP,CAAA,CAAA7pP,EAAA,YACA,IAAA7C,EAAAxC,EAAAo2D,MAAA,CAAAr1D,KAAA,CAAAf,EAAAo5B,WACApvB,QAAA9D,KAAA,aAAAb,EAAAoqP,EAAAjtP,EACM,CACN,MACA0sP,CAAA,CAAA7pP,EAAA,aACA,CACA,OACA6pP,CAAA,CAAA7pP,EAAA,EAmCerF,EAAAgoG,OAAA,CAAAA,EAKfA,EAAAx7D,MAAA,EACA,YACA,cACA,iBACA,eACA,cACA,aACA,cACA,aACA,aACA,cACA,gBACA,YACA,gBAIAw7D,EAAA1xE,MAAA,EACA,eACA,gBACA,iBACA,iBACA,YACA,eACA,eAEA,cA8Q0Ct2B,EAAAm2D,KAAA,CAAAx2D,EAAA,MAK3BK,EAAA2E,OAAA,CAAAA,EAKE3E,EAAAwtG,SAAA,CAAAA,EAKHxtG,EAAAivG,MAAA,CAAAA,EAKWjvG,EAAAuvP,iBAAA,CAAAA,EAKTvvP,EAAAovG,QAAA,CAAAA,EAKApvG,EAAAmuG,QAAA,CAAAA,EAKAnuG,EAAAk4M,QAAA,CAAAA,EAKGl4M,EAAA2tG,WAAA,CAAAA,EAMnB3tG,EAAAyuG,QAAA,CAAAA,EAAsBzuG,EAAAm2D,KAAA,CAAAs4C,QAAA,CAAAA,EAKNzuG,EAAAqD,QAAA,CAAAA,EAMhBrD,EAAA0uG,MAAA,CAAAA,EAAoB1uG,EAAAm2D,KAAA,CAAAu4C,MAAA,CAAAA,EAOpB1uG,EAAAuuG,OAAA,CAAAA,EAA2BvuG,EAAAm2D,KAAA,CAAA02G,aAAA,CAAAt+D,EAKTvuG,EAAAkuG,UAAA,CAAAA,EAUCluG,EAAAsvG,WAAA,CAAAA,EAE6BtvG,EAAA0d,QAAA,CAAA/d,EAAA,KAahD,IAAA+vP,EAAA,0EAIA,SAAAzvG,GAAA,CACA,IAAArgJ,EAAA,IAAA67F,KACA67G,EAAA,CAAAv1F,EAAAniH,EAAA+vP,QAAA,IACA5tI,EAAAniH,EAAAgwP,UAAA,IACA7tI,EAAAniH,EAAAiwP,UAAA,KAAAptP,IAAA,MACA,OAAA7C,EAAAkwP,OAAA,GAAAJ,CAAA,CAAA9vP,EAAAmwP,QAAA,IAAAz4C,EAAA,CAAA70M,IAAA,MAqCA,SAAAiM,EAAAiR,CAAA,CAAA6zB,CAAA,EACA,OAAAzwC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAgR,EAAA6zB,EAAA,CAjCAxzC,EAAA20D,GAAA,YACA3qD,QAAA2qD,GAAA,WAAAsrF,IAAAjgJ,EAAAo2D,MAAA,CAAAr1D,KAAA,CAAAf,EAAAo5B,WAAA,EAgBsCp5B,EAAAohG,QAAA,CAAAzhG,EAAA,MAGtCK,EAAA0tG,OAAA,UAAAv5C,CAAA,CAAA5uD,CAAA,EACA,IAAAA,GAAA,CAAAlC,EAAAkC,GAAA,OAAA4uD,CAAA,CAKA,IAFA,IAAAntD,EAAAjE,OAAAiE,IAAA,CAAAzB,GACAe,EAAAU,EAAA9F,MAAA,CACAoF,KACA6tD,CAAA,CAAAntD,CAAA,CAAAV,EAAA,EAAAf,CAAA,CAAAyB,CAAA,CAAAV,EAAA,EAEA,OAAA6tD,CAAA,EAMA,IAAA67L,EAAA,oBAAA1sP,OAAAA,OAAA,yBAAAS,KAAAA,CAAA,CA2DA,SAAAksP,EAAAriM,CAAA,CAAAwoE,CAAA,EAKA,IAAAxoE,EAAA,CACA,IAAAsiM,EAAA,gDACAA,CAAAA,EAAAtiM,MAAA,CAAAA,EACAA,EAAAsiM,CACA,QACA95H,EAAAxoE,EAAA,CAGA,SAAAuiM,EAAAnjB,CAAA,EACA,sBAAAA,EACA,oEAMA,SAAAojB,GAAA,CAEA,QADA5mP,EAAA,GACAlD,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,IACAkD,EAAAhK,IAAA,CAAA45B,SAAA,CAAA9yB,EAAA,EAFA,IAKA+pP,EAAA7mP,EAAAsqD,GAAA,GACA,sBAAAu8L,EACA,8DAEA,IAAA9wP,EAAA,KACA62H,EAAA,WACA,OAAAi6H,EAAAtvP,KAAA,CAAAxB,EAAA65B,UACA,EAGA4zM,EAAAjsO,KAAA,MAAAyI,GACAyZ,IAAA,UAAAo6D,CAAA,EAA4Bh1D,EAAOojN,QAAA,CAAAr1G,EAAAx5G,IAAA,WAAAygE,GAAA,EACnC,SAAAizK,CAAA,EAAAjoO,EAAAojN,QAAA,CAAAwkB,EAAArzO,IAAA,MAAA0zO,EAAAl6H,GAAA,GAMA,OAHArzH,OAAA+gG,cAAA,CAAAssJ,EAAArtP,OAAAy6C,cAAA,CAAAwvL,IACAjqO,OAAAqkK,gBAAA,CAAAgpF,EACAjpF,EAAA6lE,IACAojB,CACA,CAtGApwP,EAAAuwP,SAAA,UAAAvjB,CAAA,EACA,sBAAAA,EAAA,oEAGA,GAAAgjB,GAAAhjB,CAAA,CAAAgjB,EAAA,EACA,IAAAn5N,EAAAm2M,CAAA,CAAAgjB,EAAA,CACA,sBAAAn5N,EACA,iFAKA,OAHA9zB,OAAA8L,cAAA,CAAAgoB,EAAAm5N,EAAA,CACKttP,MAAAm0B,EAAA7K,WAAA,GAAA+zB,SAAA,GAAAC,aAAA,EACL,GACAnpB,CAAA,UAGAA,GAAA,CAQA,QAPAoqN,EAAAC,EACAv/N,EAAA,IAAAT,QAAA,SAAAI,CAAA,CAAAH,CAAA,EACA8/N,EAAA3/N,EACK4/N,EAAA//N,CAAA,GAGL3X,EAAA,GACAlD,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,IACAkD,EAAAhK,IAAA,CAAA45B,SAAA,CAAA9yB,EAAA,EAEAkD,EAAAhK,IAAA,UAAAkL,CAAA,CAAAhI,CAAA,EACAgI,EACQw2O,EAAAx2O,GAERu2O,EAAAv+O,EACK,GAGL,IACMsqO,EAAAjsO,KAAA,MAAAyI,EACN,OAAAkB,EAAA,CACAw2O,EAAAx2O,EAAA,CAGA,OAAAiX,CAAA,CAQA,OANA5e,OAAA+gG,cAAA,CAAAjtE,EAAA9zB,OAAAy6C,cAAA,CAAAwvL,IAGAgjB,GAAAjtP,OAAA8L,cAAA,CAAAgoB,EAAAm5N,EAAA,CACGttP,MAAAm0B,EAAA7K,WAAA,GAAA+zB,SAAA,GAAAC,aAAA,EACH,GACAj9C,OAAAqkK,gBAAA,CACAvwI,EACAswI,EAAA6lE,GACA,EAEwBhtO,EAAAuwP,SAAA,CAAArlF,MAAA,CAAA8kF,EAiDLhwP,EAAAmwP,WAAA,CAAAA,CAAA,gBAAA1wP,CAAA,CAAAC,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAA8wP,CAAA,ICrsBJ,IADfh4E,EACei4E,EAAA,IAAAjkP,WAAA,IACf,SAAAkkP,GAAA,CAEA,IAAAl4E,GAKA,CAHAA,CAAAA,EAAA,oBAAAD,QAAAA,OAAAC,eAAA,EAAAD,OAAAC,eAAA,CAAA57J,IAAA,CAAA27J,SAAA,oBAAAo4E,UAAA,mBAAAA,SAAAn4E,eAAA,EAAAm4E,SAAAn4E,eAAA,CAAA57J,IAAA,CAAA+zO,SAAA,EAIA,wHAIA,OAAAn4E,EAAAi4E,EAAA,CGTA,QFToI77J,EAAA,sHCM7Gg8J,EAHvB,SAAAhpD,CAAA,EACA,uBAAAA,GAAAhzG,EAAAv0E,IAAA,CAAAunL,EAAA,ECEAipD,EAAA,GAGAvqP,EAAA,EAAAA,EAAA,MAAAA,EACAuqP,EAAArxP,IAAA,EAAA8G,EAAA,KAAA2C,QAAA,KAAAuoD,MAAA,KFVoI,IE6B5Gs/L,EAhBxB,SAAAhjL,CAAA,EACA,IAAA70D,EAAAmgB,UAAAl4B,MAAA,IAAAk4B,KAAAr1B,IAAAq1B,SAAA,IAAAA,SAAA,MAGAwuK,EAAA,CAAAipD,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,QAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,QAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,QAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,IAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,QAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,KAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,KAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,KAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,KAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,KAAA43O,CAAA,CAAA/iL,CAAA,CAAA70D,EAAA,MAAAqH,WAAA,GAMA,IAAAswO,EAAAhpD,GACA,MAAA5lM,UAAA,+BAGA,OAAA4lM,CAAA,ECJiB4oD,EAnBjB,SAAAlsP,CAAA,CAAA0d,CAAA,CAAA/I,CAAA,EACuD,IAAA83O,EAAAzsP,CAAvDA,EAAAA,GAAA,IAAuDw0K,MAAA,GAAAx0K,EAAAosP,GAAA,EAAAA,CAAA,IAMvD,GAHAK,CAAA,IAAAA,GAAAA,CAAA,OAAmCA,CAAA,IAAAA,GAAAA,CAAA,QAGnC/uO,EAAA,CAAA/I,EAAAA,GAAA,EAGA,QAAA3S,EAAA,EAAAA,EAAA,KAAAA,EACA0b,CAAA,CAAA/I,EAAA3S,EAAA,CAAAyqP,CAAA,CAAAzqP,EAAA,CAGA,OAAA0b,CAAA,QAGA8uO,EAAAC,EAAA,CCdsD,gBAAAhxP,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECPzC,aAGb,IAAAwN,EAAAxN,EAA2B,MAC3BqxP,EAAerxP,EAAmB,MAClCgyL,EAAAhyL,EAAuB,MACvBqmM,EAAWrmM,EAAc,MAAAksP,EAAAlsP,EAAA,MAIzBomM,EAAAC,EAAqB,6BAA+BF,EAAAnmM,EAAA,QAGpD2O,EAAA,oBAAAF,WAAAzO,EAAA2O,CAAA,CAAAF,UAAA,CAAA6iP,EAAAD,IAGAE,EAAAlrD,EAAA,0BAA4CxoJ,EAAAz6C,OAAAy6C,cAAA,CAI5Co0I,EAAAoU,EAAiB,0BAAkB,cAAAplM,CAAA,CAAA8B,CAAA,EACnC,QAAA4D,EAAA,EAAAA,EAAA1F,EAAAM,MAAA,CAAAoF,GAAA,EACA,GAAA1F,CAAA,CAAA0F,EAAA,GAAA5D,EACA,OAAA4D,CACA,CAEA,WAKAowB,EAAA,CAAA26B,UAAA,KACAy0I,CAAAA,GAAA+lD,GAAAruM,EACArwC,EAAA8jP,EAAA,SAAAE,CAAA,EACA,IAAArjL,EAAA,IAAAx/D,CAAA,CAAA6iP,EAAA,CACA,GAAA7tP,OAAAm6C,WAAA,IAAAqwB,EAAA,CACA,IAAA81B,EAAApmD,EAAAswB,GAEAk1F,EAAA6oF,EAAAjoJ,EAAAtgG,OAAAm6C,WAAA,EACAulH,GAGAA,CAAAA,EAAA6oF,EAFAruM,EAAAomD,GAEAtgG,OAAAm6C,WAAA,GAGA/mB,CAAA,KAAAy6N,EAAA,CAAAx/D,EAAA3uB,EAAAjgJ,GAAA,CACE,IAGF5V,EAAA8jP,EAAA,SAAAE,CAAA,EACA,IAAArjL,EAAA,IAAAx/D,CAAA,CAAA6iP,EAAA,CACAt6N,EAAAi3C,EAAAxsE,KAAA,EAAAwsE,EAAAzoE,GAAA,CACAwxB,GAEAH,CAAAA,CAAA,KAAAy6N,EAAA,CAAAx/D,EAAA96J,EAAA,CAEA,GAIA,IAAAu6N,EAAY,SAAA1uP,CAAsC,EAClD,IAAAu7E,EAAA,GAgBA,OAfA9wE,EAEoEupB,EAEpE,SAAA26N,CAAA,CAAAF,CAAA,EACA,IAAAlzK,EACA,IAEA,IAAAozK,EAAA3uP,KAAAyuP,GACAlzK,CAAAA,EAAAizK,EAAAC,EAAA,GAEA,OAAA9pP,EAAA,EACA,GAGA42E,CAAA,EAIAqzK,EAAY,SAAA5uP,CAAA,CAAiC,CAC7C,IAAAu7E,EAAA,GAcA,OAbA9wE,EAE0EupB,EAC1E,SAAA26N,CAAA,CAAApuP,CAAA,EACA,IAAAg7E,EACA,IAEAozK,EAAA3uP,GACAu7E,EAAMizK,EAAYjuP,EAAA,EAClB,OAAAoE,EAAA,EACA,GAGA42E,CAAA,CAIAl+E,CAAAA,EAAAC,OAAA,UAAA0C,CAA4C,EAC5C,IAAAA,GAAA,iBAAAA,EAAA,SACA,IAAAojM,EAAqB,CAErB,IAAA5oL,EAAAg0O,EAAAnrD,EAAArjM,GAAA,aACA,EAAAuuP,EAAA/zO,GAAA,GACAA,EAEA,WAAAA,GAIAo0O,EAAA5uP,EALA,CAMA,OACA,EACA0uP,EAAA1uP,GADA,KACA,kBCnHA,kBCAA,gBAAA3C,CAAA,ECCA,SAAA4rC,EAAAtkC,CAAA,EACA,OAAAA,GAAAA,EAAAmH,UAAA,CAAAnH,EAAA,CACA,QAAAA,CACA,EACoGtH,EAAAC,OAAA,CAAA2rC,EAAA5rC,EAAAC,OAAA,CAAAwO,UAAA,IAAAzO,EAAAC,OAAA,SAAAD,EAAAC,OAAA,gBAAAP,CAAA,CAAAO,CAAA,ECLvF,aAEb+C,OAAA8L,cAAoB,CAAA7O,EAAA,cAAA0C,MAAA,KACpB1C,EAAAyzI,YAAA,QACA,IAAAA,EAAA,IACA,IAAA16H,EAAAe,EAAAf,MAAA,CAAA6D,IAAA,CAAA9C,GACAnY,EAAamY,EAAAnY,MAAA,CAAAib,IAAA,CAAA9C,GACb,OAAAf,OAAAA,EAAApX,OAAAA,CAAA,CACA,CACA3B,CAAAA,EAAAyzI,YAAA,CAAAA,CAAA,eAAAh0I,CAAA,CAAAO,CAAA,CAAAL,CAAA,eCTa,IAAAe,EAAAf,EAAA,aAEboD,OAAA8L,cAAiB,CAAA7O,EAAY,aAAiB,CAAA0C,MAAG,KACjD1C,EAAAuxP,MAAA,CAAAvxP,EAAwBmrB,IAAA,CAAAnrB,EAAAwxP,MAAQ,CAAuBxxP,EAAAyxP,IAAA,CAAAzxP,EAAA0xP,MAAA,CAAA1xP,EAAAqrB,IAAA,CAAArrB,EAAA2xP,KAAA,CAAA3xP,EAAAknB,GAAA,CAAAlnB,EAAA4xP,QAAA,CAAA5xP,EAAA0zI,MAAA,QACvD,IAAA7nH,EAAwBlsB,EAAQ,MAChCkyP,EAAelyP,EAAgB,KAC/BmyP,EAAAnyP,EAAA,MACA+zI,EAAA,OACA,IAAA55H,EAAY,GAAA+R,EAAiB3N,IAAA,EAAAhd,EAAAyX,GAC7B,CAAAhX,OAAAA,CAAA,CAAAoX,OAAAA,CAAA,KAAA+4O,EAAAr+G,YAAA,EAAA35H,GACA65H,EAAA75H,EASA,OARA65H,EAAA56H,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAAH,EAAAsJ,EAAApJ,GACA,SAAA44O,EAAAj+G,UAAA,EAAAlzI,EAAA2d,IAAA,CAAAnF,GACA,EACAy6H,EAAAhyI,MAAA,EAAA+xI,EAAArxH,EAAApJ,IAAA,CACA,IAAAC,EAAA,GAAA24O,EAAAh+G,UAAA,EAAAH,EAAAxyI,GACA,OAAAS,EAAAuX,EAAAmJ,EAAApJ,EACA,EACA06H,CACA,CACA3zI,CAAAA,EAAA0zI,MAAA,CAAAA,EACA,IAAAk+G,EAAA,OACA,IAAA93O,EAAY,GAAA+R,EAAiB3N,IAAA,EAAAhd,EAAAyX,GAC7B,CAAAhX,OAAAA,CAAA,CAAAoX,OAAAA,CAAA,KAAA+4O,EAAAr+G,YAAA,EAAA35H,GACA65H,EAAA75H,EASA,OARA65H,EAAA56H,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAAH,EAAAsJ,EAAApJ,GACA,SAAA44O,EAAA/8E,UAAA,EAAAp0K,EAAA2d,IAAA,CAAAnF,GACA,EACAy6H,EAAAhyI,MAAA,EAAA+xI,EAAArxH,EAAApJ,IAAA,CACA,IAAAC,EAAA,GAAA24O,EAAA98E,UAAA,EAAArhC,EAAAxyI,GACA,OAAAS,EAAAuX,EAAAmJ,EAAApJ,EACA,EACA06H,CACA,CACA3zI,CAAAA,EAAA4xP,QAAW,CAAAA,EACX5xP,EAAAknB,GAAA,CAAa,GAAAlnB,EAAA0zI,MAAA,KACb1zI,EAAA2xP,KAAY,IAAA3xP,EAAA4xP,QAAA,KACZ5xP,EAAAqrB,IAAA,CAAc,GAAArrB,EAAA0zI,MAAA,MACd1zI,EAAA0xP,MAAY,IAAA1xP,EAAA4xP,QAAA,MACZ5xP,EAAAyxP,IAAA,CAAc,GAAAzxP,EAAA0zI,MAAA,MACd1zI,EAAAwxP,MAAY,IAAAxxP,EAAA4xP,QAAA,MACZ5xP,EAAAmrB,IAAA,CAAc,GAAAnrB,EAAA0zI,MAAA,MACd1zI,EAAAuxP,MAAA,IAAAvxP,EAAA4xP,QAAA,qBAAAnyP,CAAA,CAAAO,CAAA,CAAAL,CAAA,EC5Ca,aAEb,IAAAirB,EAAA,WAAAA,eAA6C,WAAAC,CAAA,EAC7C,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,SAAAA,CAAA,GAEA9nB,OAAA8L,cAAkB,CAAA7O,EAAW,cAAA0C,MAAA,KAC7B1C,EAAAg5K,OAAA,CAAAh5K,EAAA+xP,GAAA,QACA,IAAAC,EAAepnO,EAAgBjrB,EAAA,OAC/BmyP,EAAAnyP,EAAiB,MACjBsyP,EAAWtyP,EAAA,IACXK,CAAAA,EAAA+xP,GAAA,KAAAC,EAAAlrO,OAAA,UACA,IAAAkyJ,EAAA,IACA,IAAAl/J,EAAY,GAAAm4O,EAAiB5mO,IAAA,EAAA1S,GAC7B,CAAAhX,OAAAA,CAAA,CAAAoX,OAAAA,CAAA,KAAA+4O,EAAAr+G,YAAA,EAAA35H,GACAo4O,EAAAp4O,EASA,OARAo4O,EAAAn5O,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAAH,EAAAsJ,EAAApJ,GAAAhQ,QAAA,GACA,WAAA+oP,EAAAlrO,OAAA,CAAA5N,GAAAmnC,GAAA,CAAArgD,EAAA+xP,GAAA,CACA,EACAG,EAAAvwP,MAAA,EAAAq3K,EAAA32J,EAAApJ,IAAA,CACA,IAAAC,EAAAqxC,OAAAyuH,EAAAxE,KAAA,CAAAx0K,EAAA+xP,GAAA,EAAA92E,YAAA,GAAAhyK,QAAA,IACA,OAAAtH,EAAAuX,EAAAmJ,EAAApJ,EACA,EACAi5O,CACA,CACAlyP,CAAAA,EAAAg5K,OAAA,CAAAA,CAAA,gBAAAv5K,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECzBa,aAEb,IAAA+/C,EAAA,WAAAA,eAAA,EAAA38C,CAAAA,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAA,CAAA5zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,GACD,WAAA66C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,CACD,EACAm7C,EAAA,WAAAA,YAAA,WAAA91B,CAAA,CAAAnqB,CAAA,EACA,QAAA+nB,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3O,EAAA+nB,IAAA23B,EAAA1/C,EAAAmqB,EAAApC,EACA,EACAhlB,OAAA8L,cAAa,CAAA7O,EAAA,aAAgB,CAAA0C,MAAA,KAC7Bu9C,EAAatgD,EAAQ,MAAUK,GAC/BigD,EAAatgD,EAAQ,KAAWK,GAChCigD,EAAatgD,EAAQ,MAAUK,GAC/BigD,EAAatgD,EAAQ,MAAQK,GAC7BigD,EAAAtgD,EAAA,MAAAK,EAAA,gBAAAP,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECjBa,aAEboD,OAAA8L,cAAY,CAAA7O,EAAA,cAAA0C,MAAA,KACZ1C,EAAAirB,IAAA,QACA,IAAAY,EAAelsB,EAAgB,MAC/BmyP,EAAAnyP,EAAA,MACAsrB,EAAA,IACA,IAAAnR,EAAY,GAAA+R,EAAiB/N,EAAA,EAAAnF,GAC7B,CAAAhX,OAAAA,CAAA,CAAAoX,OAAAA,CAAA,KAAA+4O,EAAAr+G,YAAA,EAAA35H,GACAq4O,EAAAr4O,EASA,OARAq4O,EAAAp5O,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAAH,EAAAsJ,EAAApJ,GACA,QAAAC,CACA,EACAi5O,EAAAxwP,MAAA,EAAAspB,EAAA5I,EAAApJ,IAAA,CACA,IAAAC,EAAAN,OAAAqS,GACA,OAAAtpB,EAAAuX,EAAAmJ,EAAApJ,EACA,EACAk5O,CACA,CACAnyP,CAAAA,EAAAirB,IAAA,CAAAA,CAAA,gBAAAxrB,CAAA,CAAAO,CAAA,CAAAL,CAAA,ECpBa,aAEboD,OAAA8L,cAAiB,CAAA7O,EAAA,cAAA0C,MAAA,KACjB1C,EAAA6B,SAAA,MAAwB,EACxB,IAAAgqB,EAAkBlsB,EAAyB,MAC3CsoB,EAAetoB,EAAQ,MACvBmyP,EAAAnyP,EAAA,MACAkC,EAAA,IACA,IAAAiY,EAAY,GAAA+R,EAAiB3N,IAAA,KAAAvF,GAC7B,CAAAhX,OAAAA,CAAA,CAAAoX,OAAAA,CAAA,KAAA+4O,EAAAr+G,YAAA,EAAA35H,GACAs4O,EAAAt4O,EASA,OARAs4O,EAAAr5O,MAAA,EAAAsJ,EAAApJ,IAAA,CACA,IAAAC,EAAAH,EAAAsJ,EAAApJ,GACA,WAAAgP,EAAAnJ,SAAA,CAAA5F,EACA,EACAk5O,EAAAzwP,MAAA,EAAAE,EAAAwgB,EAAApJ,IAAA,CACA,IAAAC,EAAArX,EAAAkd,QAAA,GACA,OAAApd,EAAAuX,EAAAmJ,EAAApJ,EACA,EACAm5O,CACA,CACApyP,CAAAA,EAAA6B,SAAA,CAAAA,CAAA,gBAAA9B,CAAA,CAAA8oB,CAAA,CAAAlpB,CAAA,ECrBa,aAE2C,IAAA0yP,EAAA1yP,EAAA,MAEN2O,EAAA,oBAAAF,WAAAzO,EAAA2O,CAAA,CAAAF,UAAA,CAIlDrO,EAAAC,OAAA,CAAgB,WAEhB,QAD2C01F,EAAA,GAC3CpvF,EAAA,EAAAA,EAAA+rP,EAAAnxP,MAAA,CAAAoF,IACA,mBAAAgI,CAAA,CAAA+jP,CAAA,CAAA/rP,EAAA,GAEAovF,CAAAA,CAAA,CAAAA,EAAAx0F,MAAA,EAAAmxP,CAAA,CAAA/rP,EAAA,EAGA,OAAAovF,CAAA,iBAAA48J,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eCfA,SAAA4yP,GAAA,CACA,MAAAA,CAAAA,EAAoBxvP,OAAAC,MAAA,CAAAD,OAAsBC,MAAA,CAAA4Z,IAAA,YAAAtc,CAAA,EAC1C,QAAA+G,EAAA,EAAAA,EAAA+xB,UAAAl4B,MAAA,CAAAmG,IAAA,CACA,IAAAlC,EAAAi0B,SAAA,CAAA/xB,EAA0B,CAC1B,QAAAjD,KAAAe,EAAA,KAAAuJ,cAAA,CAAAC,IAAA,CAAAxJ,EAAAf,IAAA9D,CAAAA,CAAA,CAAA8D,EAAA,CAAAe,CAAA,CAAAf,EAAA,CACA,CACG,OAAA9D,CACH,GAAAS,MAAA,KAAAq4B,UAAA,CDQAz5B,EAAAC,CAAA,CAAAF,EAAA,qBAAA6yP,CAAA,CChBA,EAQA,gBAAAD,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eCPA,SAAA6nK,EAAAriK,CAAA,CAAAkC,CAAA,EACA,MAEAmgK,CAFAA,EAAAzkK,OAAA+gG,cAAA,CAAA/gG,OAAA+gG,cAAA,CAAAlnF,IAAA,YAAAzX,CAAA,CAAAkC,CAAA,EACG,OAAAlC,EAAAksD,SAAA,CAAAhqD,EAAAlC,CAAA,CACH,EAAAA,EAAAkC,EAAA,CCFA,SAAAmrP,EAAArtP,CAAA,CAAAw6C,CAAA,EACAx6C,EAAAsJ,SAAA,CAAA1L,OAAA8C,MAAA,CAAA85C,EAAAlxC,SAAA,EAAAtJ,EAAAsJ,SAAA,CAAAxM,WAAA,CAAAkD,EAAAqiK,EAAAriK,EAAAw6C,EAAA,CFKAhgD,EAAAC,CAAA,CAAAF,EAAA,qBAAA8yP,CAAA,GELA,gBAAAF,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eCFA,SAAA8yP,EAAAruP,CAAA,CAAAiD,CAAA,EACA,SAAAjD,EAAA,SACA,IAAAe,EAAA,GACA,QAAA7E,KAAA8D,EAAA,QAAAsK,cAAA,CAAAC,IAAA,CAAAvK,EAAA9D,GAAA,CACA,GAAA+G,EAAA6Y,OAAA,CAAA5f,IAAA,WACA6E,CAAA,CAAA7E,EAAA,CAAA8D,CAAA,CAAA9D,EAAA,CACA,OACA6E,CAAA,CDLAxF,EAAAC,CAAA,CAAAF,EAAA,qBAAA+yP,CAAA,CCHA,EAQA,gBAAAH,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eCPA,SAAAiH,EAAAtG,CAAA,EACA,IAAAsY,OAAAoqG,aAAA,CAAA1iH,IAAAA,EAAA,EACA,8CAAAA,EAAA,GAOA,SAAAi7G,EAAAz7G,CAAA,EACA,OAAAA,aAAA0M,YACA1M,IAAA,EAAAA,GAAA,iBAAAA,GAAAA,eAAAA,EAAAmC,WAAA,CAAAgB,IAAA,CAEA,SAAAohB,EAAArL,CAAA,IAAAykH,CAAA,EACA,IAAAliB,EAAAviG,GACA,mCACA,GAAAykH,EAAAv8H,MAAA,KAAAu8H,EAAA/oE,QAAA,CAAA17C,EAAA9X,MAAA,EACA,6CAAAu8H,EAAA,kBAAAzkH,EAAA9X,MAAA,IAEA,SAAAgvB,EAAAuJ,CAAA,EACA,sBAAAA,GAAA,mBAAAA,EAAA5zB,MAAA,CACA,+DACAe,EAAA6yB,EAAA0pF,SAAA,EACAv8G,EAAA6yB,EAAAmgG,QAAA,CACA,CACA,SAAAjvC,EAAAuqC,CAAA,CAAAw9H,EAAA,IACA,GAAAx9H,EAAA+E,SAAA,CACA,gDACA,GAAAy4H,GAAAx9H,EAAA8E,QAAA,CACA,qDAEA,SAAA7mG,EAAAuiE,CAAA,CAAAw/B,CAAA,EACA7wG,EAAAqxE,GACA,IAAAtpD,EAAA8oF,EAAA/R,SAAA,CACA,GAAAztB,EAAAx0F,MAAA,CAAAkrC,EACA,qEAAAA,EAAA,GD5BAzsC,EAAAC,CAAA,CAAAF,EAAA,sBAAAirF,CAAA,uBAAAx3D,CAAA,uBAAAvsB,CAAA,uBAAAyd,CAAA,uBAAA6L,CAAA,GCiCA,gBAAAoiO,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAizP,CAAA,uBAAAC,CAAA,uBAAAC,CAAA,QAAAC,EAAAnzP,EAAA,MCzC8CozP,EAAApzP,EAAA,MAI9C,SAAAqzP,EAAA/wO,CAAA,CAAA47C,CAAA,CAAAn7D,CAAA,CAAAkgG,CAAA,EACA,sBAAA3gF,EAAA+wO,YAAA,CACA,OAAA/wO,EAAA+wO,YAAA,CAAAn1L,EAAAn7D,EAAAkgG,EAAA,CACA,IAAAqZ,EAAA1xD,OAAA,IACA0oM,EAAA1oM,OAAA,YACA2oM,EAAAt6O,OAAA,GAAAqjG,EAAAg3I,GACAE,EAAAv6O,OAAAlW,EAAAuwP,GACAx5N,EAAAmpE,EAAA,IACA31D,EAAA21D,EAAA,IACA3gF,EAAA0pL,SAAA,CAAA9tI,EAAApkC,EAAAy5N,EAAAtwJ,GACA3gF,EAAA0pL,SAAA,CAAA9tI,EAAA5wB,EAAAkmN,EAAAvwJ,EACA,CAEA,IAAAgwJ,EAAA,CAAA9yP,EAAAkZ,EAAA+uC,IAAA,EAAA/uC,EAAA,CAAAlZ,EAAAioD,EAEA8qM,EAAA,CAAA/yP,EAAAkZ,EAAA+uC,IAAA,EAAA/uC,EAAAlZ,EAAAioD,EAAA/uC,EAAA+uC,CAKA,OAAA4qM,UAAAI,EAAAnhJ,EAAA,CACA3vG,YAAA23H,CAAA,CAAAzW,CAAA,CAAAiwI,CAAA,CAAAxwJ,CAAA,EACA,QACA,KAAAg3B,QAAA,CAAAA,EACA,KAAAzW,SAAA,CAAAA,EACA,KAAAiwI,SAAA,CAAAA,EACA,KAAAxwJ,IAAA,CAAAA,EACA,KAAAo3B,QAAA,IACA,KAAA94H,MAAA,GACA,KAAAymG,GAAA,GACA,KAAAsyB,SAAA,IACA,KAAA53G,MAAA,CAAoB,IAAA7V,WAAAotH,GACpB,KAAA33G,IAAA,IAAA8wO,EAAAM,EAAA,OAAAhxO,MAAA,CACA,CACAk4G,OAAQ74H,CAAA,EACR,GAAAoxP,EAAyCt4H,EAAA,QACzC,IAAev4G,KAAAA,CAAA,CAAAI,OAAAA,CAAA,CAAAu3G,SAAAA,CAAA,OACfl4H,EAAA,GAAAqxP,EAAAt4H,EAAA,EAAA/4H,GACA,IAAAg4B,EAAAh4B,EAAAR,MAA0B,CAC1B,QAAAymG,EAAA,EAAAA,EAAAjuE,GAAA,CACA,IAAAghG,EAAA15H,KAAAorC,GAAA,CAAAwtF,EAAA,KAAAjyB,GAAA,CAAAjuE,EAAAiuE,GAEA,GAAA+yB,IAAAd,EAAiC,CACjC,IAAA8xE,EAAuB,GAAAqnD,EAAuBM,EAAA,EAAA3xP,GAC9C,KAAAk4H,GAAAlgG,EAAAiuE,EAAAA,GAAAiyB,EACA,KAAAvxG,OAAA,CAAAqjL,EAAA/jG,GACA,SACA,EACAtiG,GAAA,CAAA3D,EAAA4pE,QAAA,CAAAq8B,EAAAA,EAAA+yB,GAAA,KAAA/yB,GAAA,EACA,KAAAA,GAAA,EAAA+yB,EACA/yB,GAAA+yB,EACA,KAAA/yB,GAAA,GAAAiyB,IACA,KAAAvxG,OAAA,CAAApG,EAAA,GACA,KAAA0lF,GAAA,GAEA,CAGA,OAFA,KAAAzmG,MAAA,EAAAQ,EAAAR,MAAA,CACA,KAAAu/G,UAAA,GACA,KAEAwa,WAAQvlC,CAAA,EACA,GAAAo9J,EAAAt4H,EAAA,EAAM,MACd,GAAAs4H,EAAA53H,EAAA,EAAAxlC,EAAA,MACA,KAAAskC,QAAA,IAIA,GAAc,CAAA33G,OAAAA,CAAM,CAAAJ,KAAAA,CAAA,CAAA23G,SAAAA,CAAA,CAAAh3B,KAAAA,CAAA,OACpB,CAAA+E,IAAAA,CAAA,OAEAtlF,CAAA,CAAAslF,IAAA,KACA,KAAAtlF,MAAA,CAAAipD,QAAA,CAAAq8B,GAAAxS,IAAA,IAGA,KAAAi+J,SAAA,CAAAx5H,EAAAjyB,IACA,KAAAt/E,OAAA,CAAApG,EAAA,GACA0lF,EAAA,GAGA,QAAArhG,EAAAqhG,EAAArhG,EAAAszH,EAAAtzH,IACA+b,CAAA,CAAA/b,EAAA,GAIA0sP,EAAA/wO,EAAA23G,EAAA,EAAArvE,OAAA,OAAArpD,MAAA,EAAA0hG,GACA,KAAAv6E,OAAA,CAAApG,EAAsB,GACtB,IAAAqxO,EAAA,GAAAP,EAAAM,EAAA,EAAA39J,GACAh8D,EAAA,KAAAypF,SAAA,CAEA,GAAAzpF,EAAA,EACA,2DACA,IAAAm0J,EAAAn0J,EAAA,EACAuxB,EAAA,KAAAloC,GAAA,GACA,GAAA8qK,EAAA5iI,EAAA/pD,MAAA,CACA,YAAwB,qCAAY,CACpC,QAAAoF,EAAA,EAAAA,EAAAunL,EAAAvnL,IACAgtP,EAAA3nD,SAAA,GAAArlM,EAAA2kD,CAAA,CAAA3kD,EAAA,CAAAs8F,EACA,CACAjsC,QAAA,CACA,IAAAt0C,OAAAA,CAAA,CAAA8gG,UAAAA,CAAA,OACA,KAAA8X,UAAA,CAAA54G,GACA,IAAA1Y,EAAA0Y,EAAA/gB,KAAA,GAAA6hH,GAEA,OADA,KAAAzC,OAAA,GACA/2G,CACA,CACAwxH,WAAAnyD,CAAA,EACAA,GAAAA,CAAAA,EAAA,SAAA/mE,WAAA,EACA+mE,EAAA3jE,GAAA,IAAgB,KAAA0d,GAAA,IAChB,IAAA62G,SAAAA,CAAA,CAAAv3G,OAAAA,CAAA,CAAAnhB,OAAAA,CAAA,CAAA84H,SAAAA,CAAA,CAAAC,UAAAA,CAAA,CAAAtyB,IAAAA,CAAA,OAOA,OANA3+B,EAAA9nE,MAAA,CAAAA,EACA8nE,EAAA2+B,GAAA,CAAAA,EACA3+B,EAAAgxD,QAAA,CAAAA,EACAhxD,EAAAixD,SAAA,CAAAA,EACA/4H,EAAA04H,GACA5wD,EAAA3mD,MAAA,CAAAhd,GAAA,CAAAgd,GACA2mD,CACA,CACA,iBAAAspL,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAg3D,CAAA,QAAA68L,EAAA5zP,EAAA,MCzH4C6zP,EAAA7zP,EAAA,MAQ5C,IAAA8zP,EAAA,IAAAp3I,YAAA,CACA,uFACA,sFACA,qFACA,sFACA,sFACA,uFACA,mFACA,wFACA,EAIAq3I,EAAA,IAAAr3I,YAAA,CACA,uFACA,EAGAs3I,EAAqB,IAAAt3I,YAAA,GACrB,OAAAu3I,UAAAL,EAAA50I,EAAA,CACA18G,aAAA,CACA,kBAGA,KAAAy8D,CAAA,CAAAg1L,EAAAA,CAAA,IACA,KAAA3hM,CAAA,CAAA2hM,EAAAA,CAAA,IACA,KAAA5hM,CAAA,CAAA4hM,EAAAA,CAAA,IACA,KAAA1hM,CAAA,CAAA0hM,EAAAA,CAAA,IACA,KAAAxiM,CAAA,CAAAwiM,EAAAA,CAAA,IACA,KAAAz0O,CAAA,CAAAy0O,EAAAA,CAAA,IACA,KAAAjhM,CAAA,CAAAihM,EAAAA,CAAA,IACA,KAAAhhM,CAAA,CAAAghM,EAAAA,CAAA,IAEA3wO,KAAA,CACA,IAAA27C,EAAAA,CAAA,CAAA3M,EAAAA,CAAA,CAAAD,EAAAA,CAAA,CAAAE,EAAAA,CAAA,CAAAd,EAAAA,CAAA,CAAAjyC,EAAAA,CAAA,CAAAwzC,EAAAA,CAAA,CAAAC,EAAAA,CAAA,OACA,OAAAgM,EAAA3M,EAAAD,EAAAE,EAAAd,EAAAjyC,EAAAwzC,EAAAC,EAAA,CAGArtD,IAAAq5D,CAAA,CAAA3M,CAAA,CAAAD,CAAA,CAAAE,CAAA,CAAAd,CAAA,CAAAjyC,CAAA,CAAAwzC,CAAA,CAAAC,CAAA,EACA,KAAAgM,CAAA,CAAAA,EAAAA,EACA,KAAA3M,CAAA,CAAAA,EAAAA,EACA,KAAAD,CAAA,CAAAA,EAAAA,EACA,KAAAE,CAAA,CAAAA,EAAAA,EACA,KAAAd,CAAA,CAAAA,EAAAA,EACA,KAAAjyC,CAAA,CAAAA,EAAAA,EACA,KAAAwzC,CAAA,CAAAA,EAAAA,EACA,KAAAC,CAAA,CAAAA,EAAAA,CACA,CACArqC,QAAApG,CAAA,CAAAhJ,CAAA,EAEA,QAAA3S,EAAA,EAAAA,EAAA,GAAAA,IAAA2S,GAAA,EACA06O,CAAA,CAAArtP,EAAA,CAAyB2b,EAAAi9F,SAAQ,CAAAjmG,EAAA,IACjC,QAAA3S,EAAA,GAAAA,EAAA,GAAAA,IAAA,CACA,IAAAutP,EAAAF,CAAA,CAAArtP,EAAA,IACAssH,EAAuB+gI,CAAA,CAAArtP,EAAA,GACvB4kM,EAAuB,GAAAsoD,EAAAM,EAAA,EAAID,EAAA,GAAW,GAAAL,EAAAM,EAAA,EAAID,EAAA,IAAAA,IAAA,EAC1C1oD,EAAA,GAAAqoD,EAAAM,EAAA,EAAAlhI,EAAA,OAAA4gI,EAAAM,EAAA,EAAAlhI,EAAA,IAAAA,IAAA,EACA+gI,CAAAA,CAAA,CAAArtP,EAAA,GAAAqtP,CAAA,CAAArtP,EAAA,GAAA4kM,EAAAyoD,CAAA,CAAArtP,EAAA,KACA,CAEA,IAAAo4D,EAAAA,CAAA,CAAA3M,EAAAA,CAAA,CAAAD,EAAAA,CAAA,CAAAE,EAAAA,CAAwB,CAAAd,EAAAA,CAAA,CAAAjyC,EAAAA,CAAA,CAAQwzC,EAAAA,CAAA,CAAAC,EAAAA,CAAA,OAChC,QAAApsD,EAAA,EAAAA,EAA2B,GAAAA,IAAA,CAC3B,IAAAytP,EAAA,GAAAP,EAAqCM,EAAA,EAAA5iM,EAAA,GAAG,GAAAsiM,EAAAM,EAAA,EAAA5iM,EAAA,OAAAsiM,EAAAM,EAAA,EAAA5iM,EAAA,IACxC07D,EAAA,EAA2BmnI,EAAA,GAAAR,EAAI9nD,EAAA,EAAAv6I,EAASjyC,EAAAwzC,GAAAghM,CAAA,CAAAntP,EAAA,CAAAqtP,CAAA,CAAArtP,EAAA,GACxC0tP,EAAA,GAAAR,EAAiCM,EAAA,EAAAp1L,EAAG,MAAA80L,EAAAM,EAAA,EAAAp1L,EAAA,OAAA80L,EAAAM,EAAA,EAAAp1L,EAAA,IACpCmuD,EAAA,KAAA0mI,EAAAU,EAAA,EAAAv1L,EAAA3M,EAAAD,GAAA,EACAY,EAAAD,EACAA,EAAAxzC,EACAA,EAAAiyC,EACAA,EAAA,EAAA07D,EAAA,EACA56D,EAAAF,EACAA,EAAAC,EACAA,EAAA2M,EACAA,EAAA,EAAAmuD,EAAA,CACA,CAEAnuD,EAAA,OAAAA,CAAA,GACA3M,EAAA,OAAAA,CAAA,GACAD,EAAA,OAAAA,CAAA,GACAE,EAAA,OAAAA,CAAA,GACAd,EAAA,OAAAA,CAAA,GACAjyC,EAAA,OAAAA,CAAA,GACAwzC,EAAA,OAAAA,CAAA,GACAC,EAAA,OAAAA,CAAA,GACA,KAAArtD,GAAA,CAAAq5D,EAAA3M,EAAAD,EAAAE,EAAAd,EAAAjyC,EAAAwzC,EAAAC,EACA,CACA+tD,YAAA,CACAkzI,EAAAx+J,IAAA,GACA,CACAurB,SAAA,CACA,KAAAr7G,GAAA,kBACA,KAAAgd,MAAA,CAAA8yE,IAAA,GACA,CACA,CAoBO,IAAAz+B,EAA+B,GAAA88L,EAAA5yI,EAAA,UAAAgzI,EACtC,gBAAAtB,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,sBAAAw0P,CAAA,uBAAAC,CAAA,uBAAApvH,CAAA,uBAAAqvH,CAAA,uBAAAxxJ,CAAA,uBAAA+mB,CAAA,uBAAA0qI,CAAA,uBAAAhrM,CAAA,uBAAAtrC,CAAA,uBAAAu2O,CAAA,ICzHA,IAAAC,EAAA,iBAAAnmP,YAAA,WAAAA,WAAAA,WAAAmqK,MAAA,CAAAx0K,KAAAA,CAAA,KAAAm0H,EAAAv4H,EAAA,MCiBA,IAAAoe,EAAA,OAAAs+F,YAAAvuC,EAAAzrD,MAAA,CAAAyrD,EAAAjQ,UAAA,CAAA78D,KAAAwZ,KAAA,CAAAszD,EAAA1rD,UAAA,KAEAgyO,EAAA,OAAAx0O,SAAAkuD,EAAAzrD,MAAA,CAAAyrD,EAAAjQ,UAAA,CAAAiQ,EAAA1rD,UAAA,EAEAiyO,EAAA,CAAAr0J,EAAAlkF,IAAA,MAAAA,EAAAkkF,IAAAlkF,EAGA8mF,EAAA,SAAAp2F,WAAA,IAAA6vG,YAAA,aAAAh6F,MAAA,KAEAmyO,EAAA,oBACA,cACA,YACA,WAIA,SAAAL,EAAoBrmL,CAAA,EACpB,QAAAxnE,EAAA,EAAAA,EAAAwnE,EAAA5sE,MAAA,CAAAoF,IACAwnE,CAAA,CAAAxnE,EAAA,CAAAkuP,EAAA1mL,CAAA,CAAAxnE,EAAA,CAEA,CAoEA,SAAA4+F,EAAAp6E,CAAA,EACA,oBAAAA,EACA,8CAA0D,SAAAA,EAAA,GAC1D,WAAAte,WAAA,IAAAykD,cAAAtvD,MAAA,CAAAmpB,GACA,CAMA,SAAAu+B,EAAA3nD,CAAA,EAIA,MAHA,iBAAAA,GACIA,CAAAA,EAAAwjG,EAAAxjG,EAAM,EACV,GAAAw2H,EAAA2C,EAAA,EAAAn5H,GACAA,CACA,CAIA,SAAAqjI,EAAA,GAAAjjB,CAAA,EACA,IAAAphB,EAAA,EACA,QAAAp6F,EAAA,EAAAA,EAAAw7G,EAAA5gH,MAAA,CAAAoF,IAAA,CACQ,IAAAxG,EAAAgiH,CAAA,CAAAx7G,EAAA,CACR,GAAA4xH,EAAA2C,EAAA,EAAA/6H,GACA4gG,GAAA5gG,EAAAoB,MAAA,CAEA,IAAAyI,EAAA,IAAA6C,WAA6Bk0F,GAC7B,QAAAp6F,EAAA,EAAAy7G,EAAA,EAAAz7G,EAAAw7G,EAAA5gH,MAAA,CAAAoF,IAAA,CACA,IAAAxG,EAAAgiH,CAAA,CAAAx7G,EAAA,CACAqD,EAAAtE,GAAA,CAAAvF,EAAAiiH,GACAA,GAAAjiH,EAAAoB,MAAA,CAEA,OAAAyI,CACA,CAnGA7I,MAAAud,IAAA,EAAAnd,OAAA,MAAAE,EAAAkF,IAAAA,EAAA2C,QAAA,KAAAsoD,QAAA,QAqGA,OAAA2iM,EAEAjvO,OAAA,CACA,YAAAk2G,UAAA,EACA,CACA,CAQA,SAAAm5H,EAAAG,CAAA,EACA,IAAAC,EAAA,GAAAD,IAAAl6H,MAAA,CAAAlxE,EAAA7mD,IAAAm0D,MAAA,GACAurC,EAAAuyJ,IAIA,OAHAC,EAAAvxI,SAAA,CAAAjhB,EAAAihB,SAAA,CACAuxI,EAAA96H,QAAA,CAAA13B,EAAA03B,QAAA,CACA86H,EAAA7uP,MAAA,KAAA4uP,IACAC,CACO,CAoBP,SAAQ/qI,EAAMgtB,EAAW,IACzB,GAAA49G,GAAe,mBAAAA,EAAsB/7E,eAAA,CACrC,OAAA+7E,EAAA/7E,eAAA,KAAAhsK,WAAAmqI,GACA,OACA,gDACA,gBAAA27G,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAi1P,CAAA,sBAAAh0B,CAAA,IC1LkD,IAAAzpM,EAAAv3B,EAAA,MAElD,IAAAi1P,EAAA,CACAhyB,WAAAiyB,CAAA,EACK7qP,QAAA9D,KAAA,CAAA4uP,EAAA,qBACL,EACA1wB,QAAA,EACA,EAOA,SAAA0wB,EAAAlyN,CAAA,CAAAmyN,CAAA,EACA,MACA,sBAAAnyN,EAAA,IAAAmyN,EAAA,yJARAhyP,OAAA8L,cAAA,CAAA+lP,EAAA,WACA7xO,IAAAA,KACA/Y,QAAA9D,KAAA,CAAA4uP,EAAA,mBACK,GAEL,GASO,IAAAH,EAAA,GAAAz9N,EAAAG,aAAA,EAAAu9N,GACP,SAAAj0B,GAAW,CACX,SAAAzpM,EAAAS,UAAA,EAAAg9N,EACA,iBAAArC,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA0+N,CAAA,sBAAA42B,CAAA,ICzBkD,IAAA99N,EAAAv3B,EAAA,MAElD,IAAAs1P,EAAA,GACAL,EAAA,CACA1sC,YAAA,GACA+P,WAAA,GACAhQ,UAAA,GACA6W,cAAA,GACApG,QAAA,CACKw8B,EAAA,gBACL,EACA59H,QAAAA,IACKp2G,QAAAC,MAAA,CAAA+zO,EAAA,mBAELr8B,WAAAA,IACK33M,QAAAC,MAAA,CAAA+zO,EAAA,sBAELznM,gBAAAA,IACKvsC,QAAAC,MAAA,CAAA+zO,EAAA,2BAELhpP,gBAAAA,IACKgV,QAAAC,MAAA,CAAA+zO,EAAA,2BAEL5nP,oBAAAA,IACK4T,QAAAC,MAAA,CAAA+zO,EAAA,+BAELv7B,YAAAA,IACKz4M,QAAAC,MAAA,CAAA+zO,EAAA,uBAELr7B,OAAAA,IACK34M,QAAAC,MAAA,CAAA+zO,EAAA,iBAEL,EAmBA,SAAAA,EAAAtyN,CAAA,CAAAjqB,CAAiD,EACjD,IAAAzS,EAAA,2BAAA08B,EAAA,IAAAjqB,EAAA,4IAGA,OADA3O,QAAA9D,KAAA,CAAAA,GACAA,CACO,CAvBPnD,OAAA8L,cAAA,CAAA+lP,EAAA,WACA7xO,IAAAA,KACAmyO,EAAA,kBACKD,EAEL,GACAlyP,OAAA8L,cAAA,CAAA+lP,EAAA,UACA7xO,IAAAA,KACAmyO,EAAA,iBACK,KAEL,GACAnyP,OAAA8L,cAAA,CAAA+lP,EAAA,aACA7xO,IAAAA,KACAmyO,EAAA,oBACK,KAEL,GAOO,IAAAF,EAAA,GAAA99N,EAAAG,aAAA,EAAAu9N,GACP,SAAAx2B,GAAW,CACX,SAAAlnM,EAAAS,UAAA,EAAAq9N,EACA,iBAAA1C,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAAy1P,CAAA,CC5DA,GAEA,IAAAA,EAAA,+CAAA7C,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA01P,CAAA,CCFA,GAEA,IAAAA,EAAA,oCAAA9C,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAC,CAAA,CAAAF,EAAA,qBAAA21P,CAAA,CCFA,GAEA,IAAAA,EAAA,wCAAA/C,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,mBCiLA21P,EACAC,EAAAC,EAkyJqBC,EAAAC,EDp9JrB/1P,EAAAC,CAAA,CAAAF,EAAA,sBAAAi2P,EAAA,GCAA,0EA6BA,IAAAC,EAAA,EAIAC,EAAA,EACAC,EAAA,EACAC,EAAA,EAKkE,SAAAC,EAAAh0O,CAAA,MAAA0X,EAAA1X,EAAA9gB,MAAA,QAAAw4B,GAAA,GAAA1X,CAAA,CAAA0X,EAAA,GAKlE,IAAAu8N,EAAA,EACAC,EAAA,EACAC,EAAA,EAGAC,EAAA,EACAC,EAAA,IAQAC,EAAA,GAGAC,EAAA,IAGAC,EAAAD,EAAA,EAAAD,EAGAG,EAAA,GAGAC,EAAA,GAGAC,EAAA,EAAAH,EAAA,EAGAI,EAAA,GAGAC,EAAA,GAQAC,EAAA,EAGAC,EAAA,IAGAC,EAAA,GAGAC,EAAA,GAGAC,EAAA,GAIAC,EAAA,IAAA3qP,WAAA,6DAGA4qP,EAAA,IAAA5qP,WAAA,uEAGA6qP,EAAA,IAAA7qP,WAAA,yCAGA8qP,EACA,IAAA9qP,WAAA,kDAY2B+qP,EAAA,IAI3BC,EAAA,OAAAhB,EAAA,MACAR,EAAAwB,GAOA,IAAAC,EAAA,MAAAhB,EAAAA,GACAT,EAAAyB,GAKA,IAAAC,EAAA,MAAAH,GACAvB,EAAA0B,GAMA,IAAAC,EAAA,MAAAtB,EAAAD,EAAA,GACAJ,EAAA2B,GAGA,IAAAC,EAAA,MAAAtB,GACAN,EAAA4B,GAGA,IAAAC,EAAA,MAAApB,GAIA,SAAAqB,EAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAGA,KAAAJ,WAAA,CAAAA,EACA,KAAAC,UAAA,CAAAA,EACA,KAAAC,UAAA,CAAAA,EACA,KAAAC,KAAA,CAAAA,EAAoC,KAAAC,UAAA,CAAAA,EAIpC,KAAAC,SAAA,CAAAL,GAAAA,EAAA72P,MAAA,CASA,SAAAm3P,EAAAC,CAAA,CAAAC,CAAgC,EAChC,KAAAD,QAAA,CAAAA,EACA,KAAAE,QAAA,GACA,KAAAD,SAAA,CAAAA,CAAA,CAzBAvC,EAAA6B,GA6BA,IAAAY,EAAA,GAGA7pP,EAAA,IAAA8oP,CAAA,CAAA9oP,EAAA,CAAA8oP,CAAA,KAAA9oP,CAAAA,IAAA,IAQA8pP,EAAA,CAAA1zP,EAAAmzB,IAAA,CAGAnzB,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,QAAA50D,EACAnzB,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,eAOA6rK,EAAA,CAAA5zP,EAAAtC,EAAAxB,IAAA,CAGA8D,EAAA6zP,QAAA,CAAAhC,EAAA31P,GACA8D,EAAA8zP,MAAA,KAAA9zP,EAAA6zP,QAAA,OACAH,EAAA1zP,EAAAA,EAAA8zP,MAAA,EACA9zP,EAAA8zP,MAAA,CAAAp2P,GAAAm0P,EAAA7xP,EAAA6zP,QAAA,CACI7zP,EAAA6zP,QAAA,EAAA33P,EAAA21P,IAEJ7xP,EAAA8zP,MAAA,KAAA9zP,EAAA6zP,QAAA,OACA7zP,EAAA6zP,QAAA,EAAA33P,EACA,EAGA63P,EAAA,CAAA/zP,EAAA+iD,EAAAixM,IAAA,CAGAJ,EAAA5zP,EAAAg0P,CAAA,CAAAjxM,EAAAA,EAAA,CAAAixM,CAAA,CAAAjxM,EAAAA,EAAA,KAQAkxM,EAAA,CAAA1uP,EAAAmvB,IAAA,CAGA,IAAA/vB,EAAA,EACA,GACAA,GAAAY,EAAAA,EACAA,KAAA,EACIZ,IAAA,QACJ,EAAA+vB,EAAA,GACA,OAAA/vB,IAAA,GAMAuvP,EAAA,IAGAl0P,KAAAA,EAAA6zP,QAAA,EACAH,EAAA1zP,EAAAA,EAAA8zP,MAAA,EACA9zP,EAAA8zP,MAAA,GAAA9zP,EAAA6zP,QAAA,IAGA7zP,EAAA6zP,QAAA,MACA7zP,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAA/nF,IAAAA,EAAA8zP,MAAA,CACA9zP,EAAA8zP,MAAA,KACA9zP,EAAA6zP,QAAA,IACA,EAcAM,EAAA,CAAAn0P,EAAA66C,IAAA,KAWApmB,EACAn5B,EAAA6pB,EACA0zE,EACAu7J,EACAlsN,EAXA,IAAA8rN,EAAAn5M,EAAAy4M,QAAA,CACAE,EAAA34M,EAAA24M,QAAA,CACAa,EAAAx5M,EAAA04M,SAAA,CAAAR,WAAA,CACAK,EAAAv4M,EAAA04M,SAAA,CAAAH,SAAA,CACA3qG,EAAA5tG,EAAA04M,SAAA,CAAAP,UAAA,CACA1nN,EAAAuP,EAAA04M,SAAA,CAAAN,UAAA,CACAE,EAAsBt4M,EAAA04M,SAAA,CAAAJ,UAAA,CAKAj+M,EAAA,EAGtB,IAAA2jD,EAAA,EAAAA,GAAA+4J,EAAA/4J,IACA74F,EAAAs0P,QAAA,CAAAz7J,EAAA,GAQA,IAHgDm7J,CAAA,CAAAh0P,EAAAA,EAAAu0P,IAAA,CAAAv0P,EAAAw0P,QAAA,OAGhD//N,EAAAz0B,EAAAw0P,QAAA,GAAA//N,EAAAk9N,EAAAl9N,IAEAokE,CAAAA,EAAAm7J,CAAA,CAAAA,EAAAA,CAAA,CAAA14P,EADAA,CAAAA,EAAA0E,EAAAu0P,IAAA,CAAA9/N,EAAA,EACA,SACA0+N,IACAt6J,EAAAs6J,EACAj+M,KAEA8+M,CAAA,CAAA14P,EAAAA,EAAA,GAAAu9F,GAEoCv9F,CAAAA,EAAAk4P,CAAA,IAGpCxzP,EAAAs0P,QAAA,CAAAz7J,EAAA,GACAu7J,EAAA,EACA94P,GAAAgwC,GACA8oN,CAAAA,EAAA3rG,CAAA,CAAAntJ,EAAAgwC,EAAA,EAEApD,EAAA8rN,CAAA,CAAA14P,EAAAA,EAAA,CACA0E,EAAAy0P,OAAA,EAAAvsN,EAAA2wD,CAAAA,EAAAu7J,CAAA,EACAhB,GACApzP,CAAAA,EAAA00P,UAAA,EAAAxsN,EAAAmsN,CAAAA,CAAA,CAAA/4P,EAAAA,EAAA,GAAA84P,CAAA,IAEwB,GAAAl/M,IAAAA,GAOxB,GAEA,IADA2jD,EAAAs6J,EAAA,EACAnzP,IAAAA,EAAAs0P,QAAA,CAAAz7J,EAAA,EAA6BA,GAC7B74F,CAAAA,EAAAs0P,QAAA,CAAAz7J,EAAA,GACA74F,EAAAs0P,QAAA,CAAAz7J,EAAA,MACA74F,EAAAs0P,QAAA,CAAAnB,EAAA,GAIIj+M,GAAA,QAAAA,EAAA,GAQJ,IAAA2jD,EAAAs6J,EAAAt6J,IAAAA,EAAAA,IAEA,IADAv9F,EAAA0E,EAAAs0P,QAAA,CAAAz7J,EAAA,CACAv9F,IAAAA,IAEA6pB,CAAAA,CADAA,EAAAnlB,EAAAu0P,IAAA,GAAA9/N,EAAA,EACA++N,CAAA,IACAQ,CAAA,CAAA7uO,EAAAA,EAAA,KAAA0zE,IAEA74F,EAAAy0P,OAAA,GAAA57J,EAAAm7J,CAAA,CAAA7uO,EAAAA,EAAA,IAAA6uO,CAAA,CAAA7uO,EAAAA,EAAA,CACA6uO,CAAA,CAAA7uO,EAAAA,EAAA,GAAA0zE,GAEAv9F,KAlCwB,EAgDxBq5P,EAAA,CAAAX,EAAAR,EAAiCc,IAAA,KAOjCz7J,EAA6Bv9F,EAF7B,IAAAs5P,EAAA,MAA6BhD,EAAA,GAC7BrsP,EAAA,EAOA,IAAAszF,EAAA,EAAAA,GAAA+4J,EAAA/4J,IACAtzF,EAAA,EAAA+uP,CAAA,CAAAz7J,EAAA,MACA+7J,CAAA,CAAA/7J,EAAA,CAAAtzF,EASA,IAAAjK,EAAA,EAAAA,GAAAk4P,EAAAl4P,IAAA,CACA,IAAAo5B,EAAAs/N,CAAA,CAAA14P,EAAAA,EAAqB,GACrB,IAAAo5B,GACAs/N,CAAAA,CAAA,CAAA14P,EAAAA,EAAA,CAAA24P,EAAAW,CAAA,CAAAlgO,EAAA,GAAAA,EAAA,CAKA,GAMAmgO,EAAA,SAGAv5P,EACAu9F,EACA38F,EACAqJ,EACAqE,EACA,IAAA0qP,EAAA,MAAA1C,EAAA,GAiBA,IAAArsP,EAAA,EADArJ,EAAA,EACAqJ,EAAA+rP,EAAA,EAAA/rP,IAEA,IAAAjK,EAAA,EADAs3P,CAAA,CAAgBrtP,EAAA,CAAArJ,EAChBZ,EAAA,GAAA62P,CAAA,CAAA5sP,EAAA,CAAAjK,IACAq3P,CAAA,CAAAz2P,IAAA,CAAAqJ,EAYA,IALAotP,CAAA,CAAAz2P,EAAA,GAAAqJ,EAIAqE,EAAA,EACArE,EAAA,EAAAA,EAAA,GAAAA,IAEA,IAAAjK,EAAA,EADAu3P,CAAA,CAAAttP,EAAgB,CAAAqE,EAChBtO,EAAA,GAAA82P,CAAA,CAAA7sP,EAAA,CAAAjK,IACAo3P,CAAA,CAAA9oP,IAAA,CAAArE,EAKA,IADAqE,IAAS,EACTrE,EAAAksP,EAAAlsP,IAEA,IAAAjK,EAAA,EADAu3P,CAAA,CAAAttP,EAAgB,CAAAqE,GAAA,EAChBtO,EAAA,GAAA82P,CAAA,CAAA7sP,EAAA,GAAAjK,IACAo3P,CAAA,KAAA9oP,IAAA,CAAArE,EAMA,IAAAszF,EAAA,EAAAA,GAAA+4J,EAAA/4J,IACAy7J,CAAA,CAAAz7J,EAAA,GAIA,IADAv9F,EAAA,EACAA,GAAA,KACAk3P,CAAA,CAAAl3P,EAAAA,EAAA,KACAA,IACAg5P,CAAA,MAEA,KAAAh5P,GAAA,KACAk3P,CAAA,CAAAl3P,EAAAA,EAAA,KACAA,IACAg5P,CAAA,MAEA,KAAAh5P,GAAA,KACAk3P,CAAA,CAAAl3P,EAAAA,EAAA,KACAA,IACAg5P,CAAA,MAEA,KAAAh5P,GAAA,KACAk3P,CAAA,CAAAl3P,EAAAA,EAAA,KACAA,IACAg5P,CAAA,MASA,IAJAK,EAAAnC,EAAAhB,EAAA,EAAA8C,GAIAh5P,EAAA,EAAAA,EAAAm2P,EAAAn2P,IACAm3P,CAAA,CAAAn3P,EAAAA,EAAA,KACAm3P,CAAA,CAAAn3P,EAAAA,EAAA,CAAA24P,EAAA34P,EAAA,GAIAg1P,EAAA,IAAAwC,EAAAN,EAAAL,EAAAZ,EAAA,EAAAC,EAAAI,GACArB,EAAA,IAAAuC,EAAAL,EAAAL,EAAA,EAAAX,EAAAG,GAAApB,EAAA,IAAAsC,EAAA,GAAAT,EAAA,EAAAX,EAAAI,EAGA,EAMAgD,EAAA,IAES,IAAAx5P,EAIT,IAAAA,EAAA,EAAcA,EAAAk2P,EAAgBl2P,IAAO0E,EAAA+0P,SAAA,CAAAz5P,EAAAA,EAAA,GACrC,IAAAA,EAAA,EAAcA,EAAAm2P,EAAgBn2P,IAAO0E,EAAAg1P,SAAA,CAAA15P,EAAAA,EAAA,OAAAA,EAAA,EAAAA,EAAAo2P,EAAAp2P,IAAA0E,EAAAi1P,OAAA,CAAA35P,EAAAA,EAAA,EAGrC0E,CAAAA,EAAA+0P,SAAA,CAAAhD,EAAAA,EAAA,GACA/xP,EAAAy0P,OAAA,CAAAz0P,EAAA00P,UAAA,GACA10P,EAAAk1P,QAAA,CAAAl1P,EAAAkuE,OAAA,IAOAinL,GAAA,GACA,CACAn1P,EAAA6zP,QAAA,GACIH,EAAA1zP,EAAAA,EAAA8zP,MAAA,EACJ9zP,EAAA6zP,QAAA,IAEA7zP,CAAAA,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAA/nF,EAAA8zP,MAAA,EAEA9zP,EAAA8zP,MAAA,GACA9zP,EAAA6zP,QAAA,IAMAuB,GAAA,CAAApB,EAAA14P,EAAA6pB,EAAAsqE,IAAA,CAGA,IAAA4lK,EAAA/5P,EAAAA,EACAg6P,EAAAnwO,EAAAA,EACA,OAAA6uO,CAAA,CAAAqB,EAAA,CAAArB,CAAA,CAAAsB,EAAA,EACAtB,CAAA,CAAAqB,EAAA,GAAArB,CAAA,CAAAsB,EAAA,EAAA7lK,CAAA,CAAAn0F,EAAA,EAAAm0F,CAAA,CAAAtqE,EAAA,EASAowO,GAAA,CAAAv1P,EAAAg0P,EAAAl0P,IAAA,CAKA,IAAAC,EAAAC,EAAAu0P,IAAA,CAAmBz0P,EAAA,CACnB0vB,EAAA1vB,GAAA,EACA,KAMgD,GANhDE,EAAAw1P,QAAA,GAEAhmO,EAAAxvB,EAAAw1P,QAAA,EACAJ,GAAApB,EAAAh0P,EAAAu0P,IAAA,CAAA/kO,EAAA,GAAAxvB,EAAAu0P,IAAA,CAAA/kO,EAAA,CAAAxvB,EAAAyvF,KAAA,GACAjgE,KAEgD4lO,GAAApB,EAAAj0P,EAAAC,EAAAu0P,IAAA,CAAA/kO,EAAA,CAAAxvB,EAAAyvF,KAAA,IAIhDzvF,EAAAu0P,IAAA,CAAAz0P,EAAA,CAAAE,EAAAu0P,IAAA,CAAA/kO,EAAA,CAAA1vB,EAAA0vB,EAIAA,IAAA,CAEAxvB,CAAAA,EAAAu0P,IAAA,CAAAz0P,EAAA,CAAAC,CAAA,EAUA01P,GAAA,CAAAz1P,EAAA01P,EAAAC,IAAA,KAKA/rP,EACAgsP,EAEArwP,EAAsBkjJ,EADtB,IAAAtiH,EAAA,EAIA,GAAAnmC,IAAAA,EAAAk1P,QAAA,CACA,GAEAtrP,EADA5J,CAAAA,IAAAA,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA1vN,IAAA,EACA,EAAAnmC,IAAAA,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA1vN,IAAA,MACAyvN,EAAA51P,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA1vN,IAAA,CACAv8B,IAAAA,EACAmqP,EAAA/zP,EAAA41P,EAAAF,IAKA3B,EAAA/zP,EAAAuF,CADAA,EAAAotP,CAAA,CAAAiD,EAAA,EACArE,EAAA,EAAAmE,GAEA,IADAjtG,CAAAA,EAAA0pG,CAAA,CAAA5sP,EAAA,GAGAquP,EAAA5zP,EADA41P,GAAAhD,CAAA,CAAArtP,EAAA,CACAkjJ,GAMAsrG,EAAA/zP,EAHAuF,EAAAkuP,IAAA7pP,GAGA+rP,GAEA,IADAltG,CAAAA,EAAA2pG,CAAA,CAAA7sP,EAAA,GAGAquP,EAAA5zP,EADA4J,GAAAipP,CAAA,CAAAttP,EAAA,CACAkjJ,UAOAtiH,EAAAnmC,EAAAk1P,QAAA,EAGAnB,EAAA/zP,EAAA+xP,EAAA2D,EAAA,EAYAI,GAAA,CAAA91P,EAAA66C,IAAA,KAQAv/C,EAAA6pB,EACqBoH,EALrB,IAAAynO,EAAAn5M,EAAAy4M,QAAA,CACAe,EAAAx5M,EAAA04M,SAAA,CAAAR,WAAA,CACAK,EAAAv4M,EAAA04M,SAAA,CAAAH,SAAA,CACAF,EAAAr4M,EAAqB04M,SAAA,CAAAL,KAAA,CAErBM,EAAA,GAUA,IAAAl4P,EAAA,EAHA0E,EAAAw1P,QAAA,GAAAx1P,EAAAw0P,QAAA,CAAA7C,EAGAr2P,EAAA43P,EAAA53P,IACA04P,IAAAA,CAAA,CAAA14P,EAAAA,EAAA,EACA0E,EAAAu0P,IAAA,GAAAv0P,EAAAw1P,QAAA,EAAAhC,EAAAl4P,EAAA0E,EAAAyvF,KAAA,CAAAn0F,EAAA,IAIA04P,CAAA,CAAA14P,EAAAA,EAAA,KASA,KAAA0E,EAAAw1P,QAAA,IAEAxB,CAAA,CAAAznO,EADAA,CAAAA,EAAAvsB,EAAAu0P,IAAA,GAAAv0P,EAAAw1P,QAAA,EAAAhC,EAAA,IAAAA,EAAA,GACA,GACAxzP,EAAAyvF,KAAA,CAAAljE,EAAA,GAAAvsB,EAAAy0P,OAAA,GAGArB,GACApzP,CAAAA,EAAA00P,UAAA,EAAAL,CAAA,CAAA9nO,EAAAA,EAAA,IAQuD,IALvDsuB,EAAA24M,QAAA,CAAAA,EAKuDl4P,EAAA0E,EAAAw1P,QAAA,IAAAl6P,GAAA,EAAAA,IAAAi6P,GAAAv1P,EAAAg0P,EAAA14P,GAMvDixB,EAAA2mO,EACA,GAGA53P,EAAA0E,EAAAu0P,IAAA,IACAv0P,EAAAu0P,IAAA,IAAAv0P,EAAAu0P,IAAA,CAAAv0P,EAAAw1P,QAAA,IACAD,GAAAv1P,EAAAg0P,EAAA,GAE+B7uO,EAAAnlB,EAAAu0P,IAAA,IAG/Bv0P,EAAAu0P,IAAA,GAAAv0P,EAAAw0P,QAAA,EAAAl5P,EAAA0E,EAAAu0P,IAAA,GAAAv0P,EAAAw0P,QAAA,EAAArvO,EAIA6uO,CAAA,CAAAznO,EAAAA,EAAA,CAAAynO,CAAA,CAAA14P,EAAAA,EAAA,CAAA04P,CAAA,CAAA7uO,EAAAA,EAAA,CACAnlB,EAAAyvF,KAAA,CAAAljE,EAAA,EAAAvsB,EAAAyvF,KAAA,CAAAn0F,EAAA,EAAA0E,EAAAyvF,KAAA,CAAAtqE,EAAA,CAAAnlB,EAAAyvF,KAAA,CAAAn0F,EAAA,CAAA0E,EAAAyvF,KAAA,CAAAtqE,EAAA,IAAA6uO,CAAA,CAAA14P,EAAAA,EAAA,GAAA04P,CAAA,CAAA7uO,EAAAA,EAAA,GAAAoH,EAIAvsB,EAAAu0P,IAAA,IAAAhoO,IAAAgpO,GAAAv1P,EAAAg0P,EAAA,SAEIh0P,EAAAw1P,QAAA,KAEJx1P,EAAAu0P,IAAA,GAAAv0P,EAAAw0P,QAAA,EAAAx0P,EAAAu0P,IAAA,IAKAJ,EAAAn0P,EAAA66C,GAIA85M,EAAAX,EAAAR,EAAAxzP,EAAAs0P,QAAA,GAQAyB,GAAA,CAAA/1P,EAAAg0P,EAAAR,IAAA,KAKAl4P,EAC6B06P,EAA7B,IAAAC,EAAA,GAEyCC,EAAAlC,CAAA,IAGzCzmO,EAAA,EACA4oO,EAAA,EAA6BC,EAAA,EAS7B,IANA,IAAAF,IACAC,EAAA,IACAC,EAAA,GACiDpC,CAAA,EAAAR,EAAA,cAGjDl4P,EAAA,EAAAA,GAAAk4P,EAAAl4P,IACA06P,EAAAE,EAAAA,EAAAlC,CAAA,EAAA14P,EAAA,QAGA,EAAAiyB,EAAA4oO,GAAAH,IAAAE,IAGA3oO,EAAA6oO,EAAAp2P,EAAAi1P,OAAA,CAAAe,EAAAA,EAAA,EAAAzoO,EAEMyoO,IAAAA,GAGNA,IAAAC,GAAAj2P,EAAAi1P,OAAA,CAAAe,EAAAA,EAAA,GAAAh2P,EAAAi1P,OAAA,CAAAjD,EAAAA,EAAA,IAGAzkO,GAAA,GAAAvtB,EAAAi1P,OAAA,CAAAhD,EAAAA,EAAA,GAIAjyP,EAAAi1P,OAAA,CAAA/C,EAAAA,EAAA,GAGA3kO,EAAA,EAAA0oO,EAAAD,EAGAE,IAAAA,GACAC,EAAA,IAAAC,EAAA,GAGAJ,IAAAE,GACAC,EAAA,EAAAC,EAAA,IAIAD,EAAA,EACAC,EAAA,GAEA,EAQAC,GAAA,CAAAr2P,EAAAg0P,EAAAR,IAAA,KAKAl4P,EAC6B06P,EAA7B,IAAAC,EAAA,GAEyCC,EAAAlC,CAAA,IAGzCzmO,EAAA,EACA4oO,EAAA,EAA6BC,EAAA,EAS7B,IALA,IAAAF,IACAC,EAAA,IACAC,EAAA,GAGA96P,EAAA,EAAAA,GAAAk4P,EAAAl4P,IAIA,GAHA06P,EAAAE,EAAAA,EAAAlC,CAAA,EAAA14P,EAAA,QAGA,IAAAiyB,EAAA4oO,CAAA,GAAAH,IAAAE,GAGW,GAAA3oO,EAAA6oO,EAAmC,GAAArC,EAAA/zP,EAAAg2P,EAAAh2P,EAAAi1P,OAAA,aAAA1nO,EAAA,MAG9CyoO,IAAAA,GACAA,IAAAC,IACAlC,EAAA/zP,EAAAg2P,EAAAh2P,EAAAi1P,OAAA,EACA1nO,KAGAwmO,EAAA/zP,EAAAgyP,EAAAhyP,EAAAi1P,OAAA,EAAArB,EAAA5zP,EAAAutB,EAAA,MAGAA,GAAA,IACAwmO,EAAA/zP,EAAAiyP,EAAAjyP,EAAAi1P,OAAA,EAAArB,EAAA5zP,EAAAutB,EAAA,OAIAwmO,EAAA/zP,EAAAkyP,EAAAlyP,EAAAi1P,OAAA,EACArB,EAAA5zP,EAAAutB,EAAA,OAGAA,EAAA,EACA0oO,EAAAD,EACAE,IAAAA,GACAC,EAAA,IAAAC,EAAA,GAGAJ,IAAAE,GACAC,EAAA,EAAAC,EAAA,IAIAD,EAAA,EACAC,EAAA,GAfA,EAwBAE,GAAA,IAEoB,IAAAC,EAiBpB,IAbAR,GAAA/1P,EAAAA,EAAA+0P,SAAA,CAAA/0P,EAAAw2P,MAAA,CAAAhD,QAAA,EAAAuC,GAAA/1P,EAAAA,EAAAg1P,SAAA,CAAAh1P,EAAAy2P,MAAA,CAAAjD,QAAA,EAIAsC,GAAA91P,EAAAA,EAAA02P,OAAA,EASAH,EAAA7E,EAAA,EAAA6E,GAAA,GACAv2P,IAAAA,EAAAi1P,OAAA,CAAA3C,EAAAA,CAAA,CAAAiE,EAAA,IADAA,KAUA,OAJAv2P,EAAAy0P,OAAA,IAAA8B,CAAAA,EAAA,SAIAA,CAAA,EASAI,GAAA,CAAA32P,EAAA42P,EAAAC,EAAAC,IAAA,CAG+B,IAAAC,EAU/B,IAHAnD,EAAA5zP,EAAA42P,EAAA,OACAhD,EAAA5zP,EAAA62P,EAAA,KACAjD,EAAA5zP,EAAA82P,EAAiB,KACjBC,EAAA,EAAAA,EAAAD,EAAAC,IAEAnD,EAAA5zP,EAAAA,EAAAi1P,OAAA,CAAA3C,EAAAA,CAAA,CAAAyE,EAAA,OAIAV,GAAAr2P,EAAAA,EAAA+0P,SAAA,CAAA6B,EAAA,GAGAP,GAAAr2P,EAAAA,EAAAg1P,SAAA,CAAA6B,EAAA,EACA,EAiBAG,GAAA,IAKA,IAAA17P,EAAA27P,EAAA,WAIA,IAAA37P,EAAA,EAAAA,GAAA,GAAAA,IAAA27P,KAAA,EACA,KAAAA,GAAAj3P,IAAAA,EAAA+0P,SAAA,CAAAz5P,EAAAA,EAAA,CACA,OAAAu1P,CACA,CAIA,GAAA7wP,IAAAA,EAAA+0P,SAAA,MAAA/0P,IAAAA,EAAA+0P,SAAA,MACA/0P,IAAAA,EAAA+0P,SAAA,KACA,OAAAjE,CACA,CACA,IAAAx1P,EAAA,GAAAA,EAAAi2P,EAAAj2P,IACA,GAAA0E,IAAAA,EAAA+0P,SAAA,CAAAz5P,EAAAA,EAAA,CACA,OAAAw1P,CACA,CAMA,OAAAD,CAAA,EAGAqG,GAAA,GAMAC,GAAA,IAGAD,KACArC,IACAqC,GAAA,IAGAl3P,EAAAw2P,MAAA,KAAAnD,EAAArzP,EAAA+0P,SAAA,CAAAzE,GACAtwP,EAAAy2P,MAAA,KAAApD,EAAArzP,EAAAg1P,SAAA,CAAAzE,GAAAvwP,EAAA02P,OAAA,KAAArD,EAAArzP,EAAAi1P,OAAA,CAAAzE,GAGAxwP,EAAA8zP,MAAA,GAAA9zP,EAAA6zP,QAAA,GAIAiB,EAAA90P,EAAA,EAOAo3P,GAAA,CAAAp3P,EAAAgd,EAAAq6O,EAAAlyJ,IAAA,CAMAyuJ,EAAA5zP,EAAA,CAAAixP,GAAuB,GAAA9rJ,CAAAA,EAAA,QACvBgwJ,GAAAn1P,GACA0zP,EAAA1zP,EAAAq3P,GACA3D,EAAA1zP,EAAA,CAAAq3P,GACAA,GACAr3P,EAAA2zP,WAAA,CAAAtzP,GAAA,CAAAL,EAAAqJ,MAAA,CAAAi9D,QAAA,CAAAtpD,EAAAA,EAAAq6O,GAAAr3P,EAAA+nF,OAAA,EAEA/nF,EAAA+nF,OAAA,EAAAsvK,CAAA,EAQAC,GAAA,IACA1D,EAAA5zP,EAAAkxP,GAAA,KACA6C,EAAA/zP,EAAA+xP,EAAAS,GACA0B,EAAAl0P,EAAA,EAQAu3P,GAAA,CAAAv3P,EAAAgd,EAAAq6O,EAAAlyJ,IAAA,KAMAqyJ,EAAAC,EAA8B,IAAAlB,EAAA,CAG9Bv2P,CAAAA,EAAA03P,KAAA,IAIA13P,EAAA23P,IAAA,CAAAC,SAAA,GAAA7G,GACA/wP,CAAAA,EAAA23P,IAAA,CAAAC,SAAA,CAAAZ,GAAAh3P,EAAA,EAIA81P,GAAA91P,EAAAA,EAAAw2P,MAAA,EAIAV,GAAA91P,EAAAA,EAAAy2P,MAAA,EASAF,EAAAD,GAAAt2P,GAIAw3P,EAAA,EAAA/C,OAAA,SAAAgD,CAAAA,EAAA,EAAA/C,UAAA,WAMmC8C,GAAAA,CAAAA,EAAAC,CAAA,GAKnCD,EAAAC,EAAAJ,EAAA,EAGA,KAAAG,GAAAx6O,KAAAA,EAQAo6O,GAAAp3P,EAAAgd,EAAAq6O,EAAAlyJ,GAEInlG,EAAAmkJ,QAAA,GAAAysG,GAAA6G,IAAAD,GAGJ5D,EAAA5zP,EAAA,CAAAkxP,GAAA,GAAA/rJ,CAAAA,EAAA,QAAAswJ,GAAAz1P,EAAAwyP,EAAAC,KAIAmB,EAAA5zP,EAAA,CAAAmxP,GAAA,GAAAhsJ,CAAAA,EAAA,QACAwxJ,GAAA32P,EAAAA,EAAAw2P,MAAA,CAAAhD,QAAA,GAAAxzP,EAAAy2P,MAAA,CAAAjD,QAAA,GAAA+C,EAAA,GACAd,GAAAz1P,EAAAA,EAAA+0P,SAAA,CAAA/0P,EAAAg1P,SAAA,GAKAF,EAAA90P,GAGAmlG,GACAgwJ,GAAAn1P,EAGA,EAOA63P,GAAA,CAAA73P,EAAA4J,EAAAgsP,KAKA51P,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA71P,EAAAk1P,QAAA,IAAAtrP,EACA5J,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA71P,EAAAk1P,QAAA,IAAAtrP,GAAA,EACA5J,EAAA2zP,WAAA,CAAA3zP,EAAA61P,OAAA,CAAA71P,EAAAk1P,QAAA,IAAAU,EACAhsP,IAAAA,EAEI5J,EAAA+0P,SAAA,CAAAa,EAAAA,EAAA,IAEJ51P,EAAAkuE,OAAA,GAEAtkE,IAKA5J,EAAA+0P,SAAA,EAAApC,CAAA,CAAAiD,EAAA,CAAArE,EAAA,QACAvxP,EAAAg1P,SAAA,CAAAvB,EAAAA,EAAA7pP,GAAA,IAGA5J,EAAAk1P,QAAA,GAAAl1P,EAAA83P,OAAA,EASA,IAAAC,GAAA,CACAC,SAPAb,GAQAc,iBAPAb,GAQAc,gBAPAX,GAQAY,UAPAN,GAQAO,UARAd,EAQA,EA0BA,IAAAe,GAAA,CAAAC,EAAAt7O,EAAA0X,EAAAiuE,IAAA,CACA,IAAAwjG,EAAA,MAAAmyD,EAAA,EACA7qI,EAAA,eAAAnyH,EAAA,EAGA,KAAAo5B,IAAAA,GAAA,CAIAp5B,EAAAo5B,EAAA,QAAAA,CAAA,CAAAA,GAAAp5B,EAGA,GAEMmyH,EAAA,EADN04E,CAAAA,EAAA,EAAAnpL,CAAA,CAAA2lF,IAAA,IACM,UAAArnG,EAAA,CAGN6qM,GAAA,MACA14E,GAAA,MAGA,SAAAA,GAAA,MAGA,IAAA8qI,GAAAF,GA2BA,IAAAG,GAAA,SAAAz1M,EAAA4xC,EAAA,GAGA,QAAAr5F,EAAA,EAAAA,EAAA,IAAAA,IAAA,CACAynD,EAAAznD,EACA,QAAAwE,EAAA,EAAAA,EAAA,EAAAA,IACAijD,EAAA,EAAAA,EAAA,WAAAA,IAAA,EAAAA,IAAA,EAEA4xC,CAAA,CAAAr5F,EAAA,CAAAynD,CAAA,CAGA,OAAA4xC,CAAA,EAGA8jK,GAAA,IAAAphJ,YAAAmhJ,MAIAE,GAAA,CAAAC,EAAA37O,EAAA0X,EAAAiuE,IAAA,CACA,IAAAxiG,EAAAs4P,GAAA3sO,EAAA62E,EAAAjuE,EAEAikO,GAAA,GAGA,QAAAr3P,EAAAqhG,EAAArhG,EAAAwqB,EAAAxqB,IACAq3P,EAAA,MAAAx4P,CAAA,EAAAw4P,EAAA37O,CAAA,CAAA1b,EAAA,OAGA,OAAAq3P,GAAAA,CAAA,EAGA,IAAAC,GAAAF,GAsBA94H,GAAA,CACA,oBACA,eACA,KACA,kBACA,oBACA,kBACA,2BACA,oBACA,6BAqBAi5H,GAAA,CAIAC,WAAA,EACAC,gBAAA,EACAC,aAAA,EACAC,aAAA,EACAC,SAAA,EACAC,QAAA,EAAAC,QAAA,EAMAC,KAAA,EACAC,aAAA,EACAC,YAAA,EACAC,QAAA,GACAC,eAAA,GACAC,aAAA,GACAC,YAAA,GACAC,YAAA,GAIAC,iBAAA,EACAC,aAAA,EACAC,mBAAA,EAAAC,sBAAA,GAIAC,WAAA,EACAC,eAAA,EACAC,MAAA,EACAC,QAAA,EAAAC,mBAAA,EAIAxJ,SAAA,EACAC,OAAA,EACAwJ,UAAA,EAIAC,WAAA,CACA,EAqB4E,IAAAvC,SAAAA,EAAA,CAAAC,iBAAAA,EAAA,CAAAC,gBAAAA,EAAA,CAAAC,UAAAA,EAAA,CAAAC,UAAAA,EAAA,EAAAL,GAS5E,CACAe,WAAA0B,EAAA,CAAAzB,gBAAAA,EAAA,CAAAE,aAAAwB,EAAA,CAAAvB,SAAAwB,EAAA,CAAAvB,QAAAwB,EAAA,CACAtB,KAAAuB,EAAA,CAAAtB,aAAAuB,EAAA,CAAApB,eAAAqB,EAAA,CAAApB,aAAAqB,EAAA,CAAAnB,YAAAoB,EAAA,CACAhB,sBAAAiB,EAAA,CACAhB,WAAAA,EAAA,CAAAC,eAAAA,EAAA,CAAAC,MAAAA,EAAA,CAAAC,QAAAA,EAAA,CAAAC,mBAAAa,EAAA,CACAZ,UAAAA,EAAA,CACEC,WAAAY,EAAA,EAAAtC,GAMFuC,GAAA,EAEAC,GAAA,GACAC,GAAA,EAIAC,GAAA,GAEAC,GAAA,IAEAC,GAAAD,GAAA,EAAAD,GAEAG,GAAA,GAEAC,GAAA,GAEAC,GAAA,EAAAH,GAAA,EAEAI,GAAA,GAGAC,GAAA,EACAC,GAAA,IAAAC,GAAAD,GAAAD,GAAA,EAEAG,GAAA,GAGAC,GAAA,GAEAC,GAAA,GAEAC,GAAA,GACAC,GAAA,GACAC,GAAA,GACAC,GAAA,IACAC,GAAA,IAA8BC,GAAA,IAG9BC,GAAA,EACAC,GAAA,EACAC,GAAA,EAA6BC,GAAA,EAEPC,GAAA,EAGtBp3P,GAAA,CAAAiyP,EAAA3oM,KACA2oM,EAAAn6P,GAAA,CAAAoiI,EAAA,CAAA5wE,EAAA,CACAA,GAGA+nM,GAAA,GACA,EAAA7uN,EAAA,UAGA60N,GAAA,IACA,IAAAroO,EAAA1X,EAAA9gB,MAAA,QAAAw4B,GAAA,GAAA1X,CAAA,CAAA0X,EAAA,IAQAsoO,GAAA,QACA1hQ,EAAA6pB,EACApC,EAAA,IAAAk6O,EAAAj9P,EAAAk9P,MAAA,CAIAn6O,EADAznB,EAAA0E,EAAAm9P,SAAA,CAEA,GACAh4O,EAAAnlB,EAAA6wB,IAAA,GAAA9N,EAAA,CACI/iB,EAAA6wB,IAAA,CAAA9N,EAAA,CAAAoC,GAAA83O,EAAA93O,EAAA83O,EAAA,QACJ,EAAA3hQ,EAAA,CAGAynB,EAFAznB,EAAA2hQ,EAGA,GACA93O,EAAAnlB,EAAA8sB,IAAA,GAAA/J,EAAA,CACA/iB,EAAA8sB,IAAA,CAAA/J,EAAA,CAAAoC,GAAA83O,EAAA93O,EAAA83O,EAAA,QAIA,EAAA3hQ,EAAA,EAQA8hQ,GAHA,CAAAp9P,EAAA8sB,EAAApwB,IAAA,IAAAsD,EAAAq9P,UAAA,CAAA3gQ,CAAA,EAAAsD,EAAAs9P,SAAA,CAaAC,GAAA,QAAAv9P,EAAA23P,EAAA1xM,KAAA,CAIAvxB,EAAA10B,EAAA+nF,OAAA,CACArzD,EAAAijO,EAAA6F,SAAA,EACA9oO,CAAAA,EAAAijO,EAAA6F,SAAA,EACmB,IAAA9oO,IAGnBijO,EAAAxpO,MAAA,CAAA9tB,GAAA,CAAAL,EAAA2zP,WAAA,CAAArtL,QAAA,CAAAtmE,EAAAy9P,WAAA,CAAAz9P,EAAAy9P,WAAA,CAAA/oO,GAAAijO,EAAA+F,QAAA,EACA/F,EAAA+F,QAAA,EAAAhpO,EACA10B,EAAAy9P,WAAA,EAAA/oO,EACAijO,EAAAgG,SAAA,EAAAjpO,EACAijO,EAAA6F,SAAA,EAAA9oO,EACA10B,EAAA+nF,OAAA,EAAArzD,EACA,IAAA10B,EAAA+nF,OAAA,EACA/nF,CAAAA,EAAAy9P,WAAA,IACA,EAIAG,GAAA,CAAA59P,EAAAmlG,IAAA,CACA+yJ,GAAAl4P,EAAAA,EAAA69P,WAAA,IAAA79P,EAAA69P,WAAA,IAAA79P,EAAA89P,QAAA,CAAA99P,EAAA69P,WAAA,CAAA14J,GACAnlG,EAAA69P,WAAA,CAAA79P,EAAA89P,QAAA,CACAP,GAAAv9P,EAAA23P,IAAA,GAIAoG,GAAA,CAAA/9P,EAAAgU,IAAA,CACAhU,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAA/zE,CAAA,EAQAgqP,GAAA,CAAAh+P,EAAAgU,IAAA,CAKAhU,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,cACA/nF,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAA/zE,IAAAA,CAAA,EAUAiqP,GAAA,CAAAtG,EAAA36O,EAAAwvB,EAAA3wC,IAAA,CAEA,IAAA64B,EAAAijO,EAAAuG,QAAA,OAGmB,CAAnBxpO,EAAA74B,GAAmB64B,CAAAA,EAAA74B,CAAA,EAAA64B,IAAAA,GAAA,GAEnBijO,EAAAuG,QAAA,EAAAxpO,EAIA1X,EAAA3c,GAAA,CAAAs3P,EAAA/4P,KAAA,CAAA0nE,QAAA,CAAAqxL,EAAAwG,OAAA,CAAAxG,EAAAwG,OAAA,CAAAzpO,GAAA8X,GACAmrN,IAAAA,EAAA1xM,KAAA,CAAA8hL,IAAA,CACA4vB,EAAAW,KAAA,CAAAC,GAAAZ,EAAAW,KAAA,CAAAt7O,EAAA0X,EAAA8X,GAGA,IAAAmrN,EAAA1xM,KAAA,CAAA8hL,IAAA,EACA4vB,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt7O,EAAA0X,EAAA8X,EAAA,EAGAmrN,EAAAwG,OAAA,EAAAzpO,EAAAijO,EAAAyG,QAAA,EAAA1pO,EAGAA,EAlBmB,EA8BnB2pO,GAAA,CAAAr+P,EAAAs+P,IAAA,CAGA,IAEAlmO,EACA1D,EAHA6pO,EAAAv+P,EAAAw+P,gBAAyB,CACzBC,EAAAz+P,EAAA89P,QAAA,CAGAY,EAAA1+P,EAAA2+P,WAAA,CACAC,EAAA5+P,EAAA4+P,UAAA,CACA9qL,EAAA,EAAAgqL,QAAA,CAAA99P,EAAAk9P,MAAA,CAAAlB,GAAAh8P,EAAA89P,QAAA,CAAA99P,CAAAA,EAAAk9P,MAAA,CAAAlB,EAAA,IAEyB6C,EAAA7+P,EAAAqJ,MAAA,CAGzBy1P,EAAA9+P,EAAA++P,MAAA,CAAAjyO,EAAA9sB,EAAA8sB,IAAA,CAOAkyO,EAAAh/P,EAAA89P,QAAA,CAAA/B,GACAkD,EAAAJ,CAAA,CAAAJ,EAAAC,EAAA,GAAAQ,EAAAL,CAAA,CAAAJ,EAAAC,EAAA,CASA1+P,EAAA2+P,WAAA,EAAA3+P,EAAAm/P,UAAA,EACAZ,CAAAA,IAAA,GAIkCK,EAAA5+P,EAAAo/P,SAAA,EAAAR,CAAAA,EAAA5+P,EAAAo/P,SAAA,EAKlC,GAaA,GAAAP,CAAA,CAAAzmO,CAZAA,EAAAkmO,CAAA,EAYAI,EAAA,GAAAQ,GACAL,CAAA,CAAAzmO,EAAAsmO,EAAA,KAAAO,GACAJ,CAAA,CAAAzmO,EAAA,GAAAymO,CAAA,CAAAJ,EAAA,EACAI,CAAA,GAAAzmO,EAAA,GAAAymO,CAAA,CAAAJ,EAAA,GACA,SASAA,GAAA,EACArmO,IAMA,SAEAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EAAAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EACAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EAAAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EACAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EAAAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EACAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EAAAymO,CAAA,GAAAJ,EAAA,GAAAI,CAAA,GAAAzmO,EAAA,EAAAqmO,EAAAO,EAAA,CAQA,GAHAtqO,EAAAqnO,GAAAiD,CAAAA,EAAAP,CAAA,EAAAA,EAAAO,EAAAjD,GAGArnO,EAAAgqO,EAAA,CAGA,GAFA1+P,EAAAq/P,WAAA,CAAAf,EACAI,EAAAhqO,EACAA,GAAAkqO,EACA,MAEAK,EAAAJ,CAAA,CAAAJ,EAAAC,EAAA,GACAQ,EAAAL,CAAA,CAAAJ,EAAAC,EAAA,CACI,QAAAJ,EAAAxxO,CAAA,CAAAwxO,EAAAQ,EAAA,EAAAhrL,GAAA,KAAAyqL,EAAA,QAGJ,GAAAv+P,EAAAo/P,SAAA,CACAV,EAEA1+P,EAAAo/P,SAAA,EAaAE,GAAA,QAGAhkQ,EAAAgzK,EAAAxoJ,EAAA,IAAAy5O,EAAAv/P,EAAAk9P,MAAA,CAKA,GAkCA,GAlCA5uF,EAAAtuK,EAAAw/P,WAAA,CAAAx/P,EAAAo/P,SAAA,CAAAp/P,EAAA89P,QAAA,CAoBA99P,EAAA89P,QAAA,EAAAyB,EAAAA,CAAAA,EAAAvD,EAAA,IAGAh8P,EAAAqJ,MAAA,CAAAhJ,GAAA,CAAAL,EAAAqJ,MAAA,CAAAi9D,QAAA,CAAAi5L,EAAAA,EAAAA,EAAAjxF,GAAA,GACAtuK,EAAAq/P,WAAA,EAAAE,EACAv/P,EAAA89P,QAAA,EAAAyB,EAEAv/P,EAAA69P,WAAA,EAAA0B,EACAv/P,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,EACA99P,CAAAA,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,EAEAd,GAAAh9P,GACAsuK,GAAAixF,GAEAv/P,IAAAA,EAAA23P,IAAA,CAAAuG,QAAA,CACA,MAmBA,GAJA5iQ,EAAA2iQ,GAAAj+P,EAAA23P,IAAA,CAAA33P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAA99P,EAAAo/P,SAAA,CAAA9wF,GAAAtuK,EAAAo/P,SAAA,EAAA9jQ,EAIA0E,EAAAo/P,SAAA,CAAAp/P,EAAAwqB,MAAA,EAAAsxO,GASA,IARAh2O,EAAA9lB,EAAA89P,QAAA,CAAA99P,EAAAwqB,MAAA,CAAAxqB,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAAyc,EAAA,CAIA9lB,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAAyc,EAAA,IAIA9lB,EAAAwqB,MAAA,GACAxqB,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAAyc,EAAAg2O,GAAA,IAGA97P,EAAA8sB,IAAA,CAAAhH,EAAA9lB,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EACAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAA35O,EACAA,IACA9lB,EAAAwqB,MAAA,IACAxqB,CAAAA,EAAAo/P,SAAA,CAAAp/P,EAAAwqB,MAAA,CAAAsxO,EAAA,KAIA,OAII97P,EAAAo/P,SAAA,CAAApD,IAAAh8P,IAAAA,EAAA23P,IAAA,CAAAuG,QAAA,GAuDJwB,GAAA,CAAA1/P,EAAA4qB,IAAA,CAMA,IAAA+0O,EAAA3/P,EAAA4/P,gBAAA,GAAA5/P,EAAAk9P,MAAA,CAAAl9P,EAAAk9P,MAAA,CAAAl9P,EAAA4/P,gBAAA,GAOAlrO,EAAAwhB,EAAA2pN,EAAA16J,EAAA,EACA1Q,EAAAz0F,EAAA23P,IAAA,CAAAuG,QAAA,CACA,GAOA,GAFAxpO,EAAA,MACAmrO,EAAA,EAAAhM,QAAA,OACA7zP,EAAA23P,IAAA,CAAA6F,SAAA,CAAAqC,IAIAA,EAAA7/P,EAAA23P,IAAA,CAAA6F,SAAA,CAAAqC,EACA3pN,EAAAl2C,EAAA89P,QAAA,CAAA99P,EAAA69P,WAAA,CACAnpO,EAAAwhB,EAAAl2C,EAAA23P,IAAA,CAAAuG,QAAA,EACAxpO,CAAAA,EAAAwhB,EAAAl2C,EAAA23P,IAAA,CAAAuG,QAAA,EAEAxpO,EAAAmrO,GACAnrO,CAAAA,EAAAmrO,CAAA,EAQAnrO,EAAAirO,GAAA,KAAAjrO,GAAA9J,IAAA8vO,IACA9vO,IAAA4vO,IACA9lO,IAAAwhB,EAAAl2C,EAAA23P,IAAA,CAAAuG,QAAA,GAnBA,MA0BA/4J,EAAAv6E,IAAA8vO,IAAAhmO,IAAAwhB,EAAAl2C,EAAA23P,IAAA,CAAAuG,QAAA,KAAAjG,GAAAj4P,EAAA,IAAAmlG,GAIAnlG,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAArzD,EACA10B,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,IAAArzD,GAAA,EACA10B,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,KAAArzD,EAAA10B,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,KAAArzD,GAAA,EAGA6oO,GAAAv9P,EAAA23P,IAAA,EAUAzhN,IACAA,EAAAxhB,GACAwhB,CAAAA,EAAAxhB,CAAA,EAGA10B,EAAA23P,IAAA,CAAAxpO,MAAA,CAAA9tB,GAAA,CAAAL,EAAAqJ,MAAA,CAAAi9D,QAAA,CAAAtmE,EAAA69P,WAAA,CAAA79P,EAAA69P,WAAA,CAAA3nN,GAAAl2C,EAAA23P,IAAA,CAAA+F,QAAA,EACA19P,EAAA23P,IAAA,CAAA+F,QAAA,EAAAxnN,EACAl2C,EAAA23P,IAAA,CAAA6F,SAAA,EAAAtnN,EACAl2C,EAAA23P,IAAA,CAAAgG,SAAA,EAAAznN,EACAl2C,EAAA69P,WAAA,EAAA3nN,EACAxhB,GAAAwhB,GAMAxhB,IACAupO,GAAAj+P,EAAA23P,IAAA,CAAA33P,EAAA23P,IAAA,CAAAxpO,MAAA,CAAAnuB,EAAA23P,IAAA,CAAA+F,QAAA,CAAAhpO,GACA10B,EAAA23P,IAAA,CAAA+F,QAAA,EAAAhpO,EACA10B,EAAA23P,IAAA,CAAA6F,SAAA,EAAA9oO,EACA10B,EAAA23P,IAAA,CAAAgG,SAAA,EAAAjpO,EACI,OAAAywE,IAAAA,EAAA,OA8CJ,CArCA1Q,CAAAA,GAAAz0F,EAAA23P,IAAA,CAAAuG,QAAA,IAKAzpK,GAAAz0F,EAAAk9P,MAAA,EACAl9P,EAAAkuE,OAAA,GAEAluE,EAAAqJ,MAAA,CAAAhJ,GAAA,CAAAL,EAAA23P,IAAA,CAAA/4P,KAAA,CAAA0nE,QAAA,CAAAtmE,EAAA23P,IAAA,CAAAwG,OAAA,CAAAn+P,EAAAk9P,MAAA,CAAAl9P,EAAA23P,IAAA,CAAAwG,OAAA,KACAn+P,EAAA89P,QAAA,CAAA99P,EAAAk9P,MAAA,CACAl9P,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,GAGA99P,EAAAw/P,WAAA,CAAAx/P,EAAA89P,QAAA,EAAArpK,IAEAz0F,EAAA89P,QAAA,EAAA99P,EAAAk9P,MAAA,CAEAl9P,EAAAqJ,MAAA,CAAAhJ,GAAA,CAAAL,EAAAqJ,MAAA,CAAAi9D,QAAA,CAAAtmE,EAAAk9P,MAAA,CAAAl9P,EAAAk9P,MAAA,CAAAl9P,EAAA89P,QAAA,KACA99P,EAAAkuE,OAAA,IACAluE,EAAAkuE,OAAA,GAEAluE,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,EACA99P,CAAAA,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,GAIA99P,EAAAqJ,MAAA,CAAAhJ,GAAA,CAAAL,EAAA23P,IAAA,CAAA/4P,KAAA,CAAA0nE,QAAA,CAAAtmE,EAAA23P,IAAA,CAAAwG,OAAA,CAAA1pK,EAAAz0F,EAAA23P,IAAA,CAAAwG,OAAA,EAAAn+P,EAAA89P,QAAA,EACA99P,EAAA89P,QAAA,EAAArpK,EACAz0F,EAAAwqB,MAAA,EAAAiqE,EAAAz0F,EAAAk9P,MAAA,CAAAl9P,EAAAwqB,MAAA,CAAAxqB,EAAAk9P,MAAA,CAAAl9P,EAAAwqB,MAAA,CAAAiqE,CAAA,EAEAz0F,EAAA69P,WAAA,CAAA79P,EAAA89P,QAAA,EAEA99P,EAAA8/P,UAAA,CAAA9/P,EAAA89P,QAAA,EACA99P,CAAAA,EAAA8/P,UAAA,CAAA9/P,EAAA89P,QAAA,EAIA34J,GACA03J,GAIAjyO,IAAA4vO,IAAA5vO,IAAA8vO,IACA16P,IAAAA,EAAA23P,IAAA,CAAAuG,QAAA,EAAAl+P,EAAA89P,QAAA,GAAA99P,EAAA69P,WAAA,CACAlB,IAIAkD,EAAA7/P,EAAAw/P,WAAA,CAAAx/P,EAAA89P,QAAA,CACA99P,EAAA23P,IAAA,CAAAuG,QAAA,CAAA2B,GAAA7/P,EAAA69P,WAAA,EAAA79P,EAAAk9P,MAAA,GAEAl9P,EAAA69P,WAAA,EAAA79P,EAAAk9P,MAAA,CACAl9P,EAAA89P,QAAA,EAAA99P,EAAAk9P,MAAA,CAEAl9P,EAAAqJ,MAAA,CAAAhJ,GAAA,CAAAL,EAAAqJ,MAAA,CAAAi9D,QAAA,CAAAtmE,EAAAk9P,MAAA,CAAAl9P,EAAAk9P,MAAA,CAAAl9P,EAAA89P,QAAA,KACA99P,EAAAkuE,OAAA,IACAluE,EAAAkuE,OAAA,GAEA2xL,GAAA7/P,EAAAk9P,MAAA,CACAl9P,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,EACA99P,CAAAA,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,GAGA+B,EAAA7/P,EAAA23P,IAAA,CAAAuG,QAAA,EACA2B,CAAAA,EAAA7/P,EAAA23P,IAAA,CAAAuG,QAAA,EAEA2B,IACA5B,GAAAj+P,EAAA23P,IAAA,CAAA33P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAA+B,GACA7/P,EAAA89P,QAAA,EAAA+B,EACA7/P,EAAAwqB,MAAA,EAAAq1O,EAAA7/P,EAAAk9P,MAAA,CAAAl9P,EAAAwqB,MAAA,CAAAxqB,EAAAk9P,MAAA,CAAAl9P,EAAAwqB,MAAA,CAAAq1O,CAAA,EAEA7/P,EAAA8/P,UAAA,CAAA9/P,EAAA89P,QAAA,EACA99P,CAAAA,EAAA8/P,UAAA,CAAA9/P,EAAA89P,QAAA,EAQA+B,EAAA,EAAAhM,QAAA,OAGA8L,EAAAE,CADAA,EAAA7/P,EAAA4/P,gBAAA,CAAAC,EAAA,YAAA7/P,EAAA4/P,gBAAA,CAAAC,CAAA,EACA7/P,EAAAk9P,MAAA,CAAAl9P,EAAAk9P,MAAA,CAAA2C,CAAA,CAEA3pN,CAAAA,CADAA,EAAAl2C,EAAA89P,QAAA,CAAA99P,EAAA69P,WAAA,GACA8B,GACA,CAAAzpN,GAAAtrB,IAAA8vO,EAAA,GAAA9vO,IAAA4vO,IACAx6P,IAAAA,EAAA23P,IAAA,CAAAuG,QAAA,EAAAhoN,GAAA2pN,CAAA,IACAnrO,EAAAwhB,EAAA2pN,EAAAA,EAAA3pN,CAAA,CACAivD,EAAAv6E,IAAA8vO,IAAA16P,IAAAA,EAAA23P,IAAA,CAAAuG,QAAA,EACAxpO,IAAAwhB,EAAA,IACA+hN,GAAAj4P,EAAAA,EAAA69P,WAAA,CAAAnpO,EAAAywE,GACAnlG,EAAA69P,WAAA,EAAAnpO,EACA6oO,GAAAv9P,EAAA23P,IAAA,GAIAxyJ,EAAAy3J,GAAAF,EAAA,CA3DA,EAqEAqD,GAAA,CAAA//P,EAAA4qB,IAAA,CAGA,IAAAo1O,EAAwBC,EAGxB,QAMA,GAAAjgQ,EAAAo/P,SAAA,CAAApD,GAAA,CAEA,GADAsD,GAAAt/P,GACAA,EAAAo/P,SAAA,CAAApD,IAAApxO,IAAA4vO,GACA,OAAAkC,EACA,CACA,GAAA18P,IAAAA,EAAAo/P,SAAe,CACf,MACA,GAMAY,EAAA,EACAhgQ,EAAAo/P,SAAA,EAAAtD,KAEA97P,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAAhC,GAAA,IACAkE,EAAAhgQ,EAAA8sB,IAAA,CAAA9sB,EAAA89P,QAAA,CAAA99P,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EACAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAAz/P,EAAA89P,QAAA,EAOA,IAAAkC,GAAA,EAAAlC,QAAA,CAAAkC,GAAAhgQ,EAAAk9P,MAAA,CAAAlB,IAKAh8P,CAAAA,EAAAkgQ,YAAA,CAAA7B,GAAAr+P,EAAAggQ,EAAA,EAGAhgQ,EAAAkgQ,YAAA,EAAApE,IAYA,GARAmE,EAAA9H,GAAAn4P,EAAAA,EAAA89P,QAAA,CAAA99P,EAAAq/P,WAAA,CAAAr/P,EAAAkgQ,YAAA,CAAApE,IAEA97P,EAAAo/P,SAAA,EAAAp/P,EAAAkgQ,YAAA,CAMAlgQ,EAAAkgQ,YAAA,EAA0BlgQ,EAAAmgQ,cAAA,EAAAngQ,EAAAo/P,SAAA,EAAAtD,GAAA,CAC1B97P,EAAAkgQ,YAAA,GACA,GACAlgQ,EAAA89P,QAAA,GAEA99P,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAAhC,GAAA,IACAkE,EAAAhgQ,EAAA8sB,IAAA,CAAA9sB,EAAA89P,QAAA,CAAA99P,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EACAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAAz/P,EAAA89P,QAAA,OAKA,KAAA99P,EAAAkgQ,YAAA,EACQlgQ,EAAA89P,QAAA,EACR,MAEA99P,EAAA89P,QAAA,EAAA99P,EAAAkgQ,YAAA,CACAlgQ,EAAAkgQ,YAAA,GACAlgQ,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,EACA99P,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,IASM,MAINmC,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,GAGA99P,EAAAo/P,SAAA,GACAp/P,EAAA89P,QAAA,EACA,CACA,GAAAmC,IAEArC,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACA,OAAAd,EAGA,OAGA,CADA18P,EAAAwqB,MAAA,GAAAszO,QAAA,CAAAhC,GAAA,EAAA97P,EAAA89P,QAAA,CAAAhC,GAAA,EACAlxO,IAAA8vO,IAGA,CADAkD,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAZ,GAGAC,EAFA,CAIA,EAAA3H,QAAA,GAEA0I,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAd,GAIAC,EADA,EAQAyD,GAAA,CAAApgQ,EAAA4qB,IAAA,CAGA,IAAAo1O,EAA2BC,EAE3BI,EAIA,QAMA,GAAArgQ,EAAAo/P,SAAA,CAAApD,GAAA,CAEA,GADAsD,GAAAt/P,GACAA,EAAAo/P,SAAA,CAAApD,IAAApxO,IAAA4vO,GACA,OAAAkC,EACA,CACA,GAAA18P,IAAAA,EAAAo/P,SAAA,UAMAY,EAAA,EACAhgQ,EAAAo/P,SAAA,EAAAtD,KAEA97P,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAAhC,GAAA,IACAkE,EAAAhgQ,EAAA8sB,IAAA,CAAA9sB,EAAA89P,QAAA,CAAA99P,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EACAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAAz/P,EAAA89P,QAAA,EAMA99P,EAAA2+P,WAAA,CAAA3+P,EAAAkgQ,YAAA,CACAlgQ,EAAAsgQ,UAAA,CAAAtgQ,EAAAq/P,WAAA,CAAAr/P,EAAAkgQ,YAAA,CAAApE,GAAA,EAGA,IAAAkE,GAAAhgQ,EAAA2+P,WAAA,CAAA3+P,EAAAmgQ,cAAA,EACAngQ,EAAA89P,QAAA,CAAAkC,GAAAhgQ,EAAAk9P,MAAA,CAAAlB,KAKAh8P,EAAAkgQ,YAAA,CAAA7B,GAAAr+P,EAAAggQ,GAGAhgQ,EAAAkgQ,YAAA,KAAAlgQ,CAAAA,EAAAmkJ,QAAA,GAAA81G,IAAAj6P,EAAAkgQ,YAAA,GAAApE,IAAA97P,EAAA89P,QAAA,CAAA99P,EAAAq/P,WAAA,QAMAr/P,CAAAA,EAAAkgQ,YAAA,CAAApE,GAAA,IAMA97P,EAAA2+P,WAAA,EAAA7C,IAAA97P,EAAAkgQ,YAAA,EAAAlgQ,EAAA2+P,WAAA,EACA0B,EAAArgQ,EAAA89P,QAAA,CAAA99P,EAAAo/P,SAAA,CAAAtD,GAOAmE,EAAA9H,GAAAn4P,EAAAA,EAAA89P,QAAA,GAAA99P,EAAAsgQ,UAAA,CAAAtgQ,EAAA2+P,WAAA,CAAA7C,IAMA97P,EAAAo/P,SAAA,EAAAp/P,EAAA2+P,WAAA,GACA3+P,EAAA2+P,WAAA,IACA,EACA,EAAA3+P,EAAA89P,QAAA,EAAAuC,IAEArgQ,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,CAAAhC,GAAA,IACAkE,EAAAhgQ,EAAA8sB,IAAA,CAAA9sB,EAAA89P,QAAA,CAAA99P,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EACAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAAz/P,EAAA89P,QAAA,QAGA,KAAA99P,EAAA2+P,WAAA,EAKA,GAJA3+P,EAAAugQ,eAAA,GACAvgQ,EAAAkgQ,YAAA,CAAApE,GAAA,EAAA97P,EAAA89P,QAAA,GAGAmC,IAEArC,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACA,OAAAd,EAEA,MAGA,GAAA18P,EAAAugQ,eAAA,CAgBA,IAVAN,CAAAA,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,OAKAF,GAAA59P,EAAA,IAGAA,EAAA89P,QAAA,GACA99P,EAAAo/P,SAAA,GACAp/P,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,CACA,OAAAd,EACM,MAKN18P,EAAAugQ,eAAA,GACAvgQ,EAAA89P,QAAA,GACA99P,EAAAo/P,SAAA,EACA,OAWA,CARAp/P,EAAAugQ,eAAA,GAEAN,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,KAGA99P,EAAAugQ,eAAA,IAEAvgQ,EAAAwqB,MAAA,CAAAxqB,EAAA89P,QAAA,CAAAhC,GAAA,EAAA97P,EAAA89P,QAAA,CAAAhC,GAAA,EACAlxO,IAAA8vO,IAGA,CADAkD,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAZ,GAGAC,EAFA,CAIA,EAAA3H,QAAA,GAEA0I,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAd,GAKAC,EAHA,EAWA6D,GAAA,CAAAxgQ,EAAA4qB,IAAA,KAGAq1O,EACAnzO,EAAyB2xO,EAAAO,EAEzB,IAAAH,EAAA7+P,EAAAqJ,MAAA,CAGA,QAKA,GAAArJ,EAAAo/P,SAAA,EAAArD,GAAA,CAEA,GADAuD,GAAAt/P,GACAA,EAAAo/P,SAAA,EAAArD,IAAAnxO,IAAA4vO,GACA,OAAAkC,EACA,CACA,GAAA18P,IAAAA,EAAAo/P,SAAA,UAIAp/P,EAAAkgQ,YAAA,GACAlgQ,EAAAo/P,SAAA,EAAAtD,IAAA97P,EAAA89P,QAAA,IAGAhxO,CADAA,EAAA+xO,CAAA,CADAJ,EAAAz+P,EAAA89P,QAAA,GACA,IACAe,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EACAO,EAAAh/P,EAAA89P,QAAA,CAAA/B,GACA,SAEAjvO,IAAA+xO,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EACA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EACA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EACA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EAAA3xO,IAAA+xO,CAAA,GAAAJ,EAAA,EACAA,EAAAO,EAAA,CACAh/P,EAAAkgQ,YAAA,CAAAnE,GAAAiD,CAAAA,EAAAP,CAAA,EACAz+P,EAAAkgQ,YAAA,CAAAlgQ,EAAAo/P,SAAA,EACAp/P,CAAAA,EAAAkgQ,YAAA,CAAAlgQ,EAAAo/P,SAAA,CAEA,CACA,GAIAp/P,EAAAkgQ,YAAA,EAAApE,IAGAmE,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAkgQ,YAAA,CAAApE,IAGA97P,EAAAo/P,SAAA,EAAAp/P,EAAAkgQ,YAAA,CACAlgQ,EAAA89P,QAAA,EAAA99P,EAAAkgQ,YAAA,CACMlgQ,EAAAkgQ,YAAA,KAIND,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,GAGA99P,EAAAo/P,SAAA,GACAp/P,EAAA89P,QAAA,IAEAmC,IAEArC,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACA,OAAAd,EAGA,OAGA,CADA18P,EAAAwqB,MAAA,GACAI,IAAA8vO,IAGA,CADAkD,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAZ,GAGAC,EAFA,CAIA,EAAA3H,QAAA,GAEA0I,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAd,GAIAC,EADA,EAOA8D,GAAA,CAAAzgQ,EAAA4qB,IAAA,CAE0B,IAAAq1O,EAG1B,QAEA,GAAAjgQ,IAAAA,EAAAo/P,SAAA,GACAE,GAAAt/P,GACAA,IAAAA,EAAAo/P,SAAA,GACA,GAAAx0O,IAAA4vO,GACA,OAAAkC,EACA,CACA,MACA,GAIA18P,EAAAkgQ,YAAA,GAGAD,EAAA9H,GAAAn4P,EAAA,EAAAA,EAAAqJ,MAAA,CAAArJ,EAAA89P,QAAA,GACA99P,EAAAo/P,SAAA,GACAp/P,EAAA89P,QAAA,GACAmC,IAEArC,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACA,OAAAd,EAGA,OAGA,CADA18P,EAAAwqB,MAAA,GACAI,IAAA8vO,IAGA,CADAkD,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAZ,GAGAC,EAFA,CAIA,EAAA3H,QAAA,GAEA0I,GAAA59P,EAAA,IACAA,IAAAA,EAAA23P,IAAA,CAAA6F,SAAA,EACAd,GAIAC,EADA,EAQA,SAAA+D,GAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAtuO,CAAA,EAGA,KAAAmuO,WAAA,CAAAA,EACA,KAAAC,QAAA,CAAAA,EACA,KAAAC,WAAA,CAAAA,EACA,KAAAC,SAAA,CAAAA,EACA,KAAAtuO,IAAA,CAAAA,CAAA,CAGA,IAAAuuO,GAAA,CAEA,IAAAL,GAAA,QAAAhB,IACA,IAAAgB,GAAA,QAAAX,IACA,IAAAW,GAAA,SAAAX,IAAA,IAAAW,GAAA,UAAAX,IAGA,IAAAW,GAAA,UAAAN,IACA,IAAAM,GAAA,WAAAN,IACA,IAAAM,GAAA,aAAAN,IACA,IAAAM,GAAA,aAAAN,IACA,IAAAM,GAAA,gBAAAN,IACA,IAAAM,GAAA,gBAAAN,IAAA,CAMAY,GAAA,IAEAhhQ,EAAAw/P,WAAA,GAAAx/P,EAAAk9P,MAAA,CAGgBH,GAAA/8P,EAAA6wB,IAAA,EAKhB7wB,EAAAmgQ,cAAA,CAAAY,EAAA,CAAA/gQ,EAAA03P,KAAA,EAAAkJ,QAAA,CACA5gQ,EAAAm/P,UAAA,CAAA4B,EAAA,CAAA/gQ,EAAA03P,KAAA,EAAAiJ,WAAA,CACA3gQ,EAAA4+P,UAAA,CAAAmC,EAAA,CAAA/gQ,EAAA03P,KAAA,EAAAmJ,WAAA,CAAA7gQ,EAAAw+P,gBAAA,CAAAuC,EAAA,CAAA/gQ,EAAA03P,KAAA,EAAAoJ,SAAA,CAGA9gQ,EAAA89P,QAAA,GACA99P,EAAA69P,WAAA,GACA79P,EAAAo/P,SAAA,GACAp/P,EAAAwqB,MAAA,GACAxqB,EAAAkgQ,YAAA,CAAAlgQ,EAAA2+P,WAAA,CAAA7C,GAAA,EACA97P,EAAAugQ,eAAA,GACAvgQ,EAAAy/P,KAAA,IAIA,SAAAwB,IAAA,CACA,KAAAtJ,IAAA,MACA,KAAA3uP,MAAA,GACA,KAAA2qP,WAAA,MACA,KAAAiM,gBAAA,GACA,KAAAnC,WAAA,GACA,KAAA11K,OAAA,GACA,KAAAggJ,IAAA,GACA,KAAAm5B,MAAA,MACA,KAAAC,OAAA,GACA,KAAAxiP,MAAA,CAAAw8O,GAA0B,KAAAiG,UAAA,IAG1B,KAAAlE,MAAA,GACA,KAAAmE,MAAA,GAAoB,KAAAtC,MAAA,GAGpB,KAAA11P,MAAA,MAQA,KAAAm2P,WAAA,GAKA,KAAA1yO,IAAA,MAKsB,KAAA+D,IAAA,MAGtB,KAAA4uO,KAAA,GACA,KAAAtC,SAAA,GACA,KAAAmE,SAAA,GAAwB,KAAAhE,SAAA,GAGxB,KAAAD,UAAA,GAOA,KAAAQ,WAAA,GAKA,KAAAqC,YAAA,GACA,KAAAI,UAAA,GACA,KAAAC,eAAA,GACA,KAAAzC,QAAA,GACA,KAAAuB,WAAA,GAA8B,KAAAD,SAAA,GAG9B,KAAAT,WAAA,GAKA,KAAAH,gBAAA,GAMA,KAAA2B,cAAA,GAYA,KAAAzI,KAAA,GAAsB,KAAAvzG,QAAA,GAGtB,KAAAg7G,UAAA,GAEuB,KAAAP,UAAA,GAavB,KAAA7J,SAAA,KAAAt5D,YAAAmgE,EAAAA,IACA,KAAA5G,SAAA,KAAAv5D,YAAA,GAAAigE,GAAA,MACA,KAAAzG,OAAA,KAAAx5D,YAAA,GAAAkgE,GAAA,MACAoB,GAAA,KAAAhI,SAAA,EACAgI,GAAA,KAAA/H,SAAA,EAAA+H,GAAA,KAAA9H,OAAA,EAGA,KAAAuB,MAAA,MACA,KAAAC,MAAA,MAAgC,KAAAC,OAAA,MAIhC,KAAApC,QAAA,KAAA74D,YAAAogE,GAAA,GAIA,KAAAtH,IAAA,KAAA94D,YAAA,EAAAggE,GAAA,GAAAsB,GAAA,KAAAxI,IAAA,EAGA,KAAAiB,QAAA,GACA,KAAAhB,QAAA,GAKA,KAAA/kK,KAAA,KAAAgsG,YAAA,EAAAggE,GAAA,GACAsB,GAAA,KAAAttK,KAAA,EAG2B,KAAAomK,OAAA,GAG3B,KAAA0L,WAAA,GAoBA,KAAArM,QAAA,GAA0B,KAAA4C,OAAA,GAG1B,KAAArD,OAAA,GACA,KAAAC,UAAA,GACA,KAAAxmL,OAAA,GAA0B,KAAA1jD,MAAA,GAI1B,KAAAspO,MAAA,GAIA,KAAAD,QAAA,EAYA,CAMA,IAAA2N,GAAA,IAGA,IAAA7J,EACA,QACA,CACA,IAAA33P,EAAA23P,EAAA1xM,KAAA,QACA,GAAAjmD,EAAA23P,IAAA,GAAAA,GAAA33P,CAAAA,EAAAgJ,MAAA,GAAAkzP,IAEAl8P,EAAAgJ,MAAA,GAAAmzP,IAEAn8P,EAAAgJ,MAAA,GAAAozP,IACAp8P,EAAAgJ,MAAA,GAAAqzP,IACAr8P,EAAAgJ,MAAA,GAAAszP,IACAt8P,EAAAgJ,MAAA,GAAAuzP,IACAv8P,EAAAgJ,MAAA,GAAAwzP,IACAx8P,EAAAgJ,MAAA,GAAAyzP,EAAA,EAGA,EAFA,CACA,EAIAgF,GAAA,IAGA,GAAAD,GAAA7J,GACA,OAAAjyP,GAAAiyP,EAAAmD,GAAA,CAGAnD,EAAAyG,QAAA,CAAAzG,EAAAgG,SAAA,GAAAhG,EAAAC,SAAA,CAAA0C,GAGA,IAAAt6P,EAAA23P,EAAA1xM,KAAA,CAmBA,OAlBAjmD,EAAA+nF,OAAA,GAAA/nF,EAAAy9P,WAAA,GAGAz9P,EAAA+nO,IAAA,IACA/nO,CAAAA,EAAA+nO,IAAA,EAAA/nO,EAAA+nO,IAAA,EAGA/nO,EAAAgJ,MAAA,CAEAhJ,IAAAA,EAAA+nO,IAAA,CAAAo0B,GAEAn8P,EAAA+nO,IAAA,CAAAm0B,GAAAM,EAAA,CACA7E,EAAAW,KAAA,KAAAt4P,EAAA+nO,IAAA,CACA,EAEA,EACA/nO,EAAAohQ,UAAA,IACApJ,GAAAh4P,GACA46P,EAAA,EAGA8G,GAAA,IAGA,IAAArpL,EAAAopL,GAAA9J,GAIA,OAHAt/K,IAAAuiL,IACAoG,GAAArJ,EAAA1xM,KAAA,EAEAoyB,CAAA,EAGAspL,GAAA,CAAAhK,EAAA9mO,IAGA,GAAA8mO,IAAAA,IAAAA,EAAA1xM,KAAA,CAAA8hL,IAAA,CACA+yB,IAEAnD,EAAA1xM,KAAA,CAAAi7M,MAAA,CAAArwO,EACA+pO,GAFA,CAKAgH,GAAA,CAAAjK,EAAAD,EAAA/4O,EAAAkjP,EAAAC,EAAA39G,IAAA,CAGA,IAAAwzG,EACA,OAAAmD,EACA,KAAA/yB,EAAA,EAkBA,GAfA2vB,IAAAuD,IACAvD,CAAAA,EAAA,GAGAmK,EAAA,GACA95B,EAAA,EACA85B,EAAA,CAAAA,GAGAA,EAAwB,KACxB95B,EAAA,EACA85B,GAAA,IAIAC,EAAA,GAAAA,EAAA1G,IAAAz8O,IAAAw8O,IACA0G,EAAA,GAAAA,EAAA,IAAAnK,EAAA,GAAAA,EAAA,GACAvzG,EAAA,GAAAA,EAAAi2G,IAAAyH,IAAAA,GAAA95B,IAAAA,EACA,OAAAriO,GAAAiyP,EAAAmD,GAAA,CAIA,IAAA+G,GACAA,CAAAA,EAAA,GAGA,IAAA7hQ,EAAA,IAAAihQ,GAoFA,OAjFAtJ,EAAA1xM,KAAA,CAAAjmD,EACAA,EAAA23P,IAAA,CAAAA,EAA6B33P,EAAAgJ,MAAA,CAAAkzP,GAG7Bl8P,EAAA+nO,IAAA,CAAAA,EACA/nO,EAAAkhQ,MAAA,MACAlhQ,EAAAqhQ,MAAA,CAAAQ,EACA7hQ,EAAAk9P,MAAA,IAAAl9P,EAAAqhQ,MAAA,CAAArhQ,EAAA++P,MAAA,CAAA/+P,EAAAk9P,MAAA,GAGAl9P,EAAAshQ,SAAA,CAAAQ,EAAA,EACA9hQ,EAAAm9P,SAAA,IAAAn9P,EAAAshQ,SAAA,CACAthQ,EAAAs9P,SAAA,CAAAt9P,EAAAm9P,SAAA,GAAAn9P,EAAAq9P,UAAA,KAAAr9P,EAAAshQ,SAAA,CAAAxF,GAAA,GAAAA,EAAA,EAGA97P,EAAAqJ,MAAA,KAAA7B,WAAAxH,EAAAA,EAAAk9P,MAAA,EACAl9P,EAAA6wB,IAAA,KAAA4qK,YAAAz7L,EAAAm9P,SAAA,EAAAn9P,EAAA8sB,IAAA,KAAA2uK,YAAAz7L,EAAAk9P,MAAA,EAKuCl9P,EAAAuhQ,WAAA,IAAAO,EAAA,EA0CvC9hQ,EAAA4/P,gBAAA,CAAA5/P,EAAAA,EAAAuhQ,WAAA,CAAAvhQ,EAAA2zP,WAAA,KAAAnsP,WAAAxH,EAAA4/P,gBAAA,EAIA5/P,EAAA61P,OAAA,CAAA71P,EAAAuhQ,WAAA,CAIAvhQ,EAAA83P,OAAA,EAAA93P,EAAAuhQ,WAAA,MAMAvhQ,EAAA03P,KAAA,CAAAA,EACA13P,EAAAmkJ,QAAA,CAAAA,EAAAnkJ,EAAA2e,MAAA,CAAAA,EAGA+iP,GAAA/J,EAAA,EAEAoK,GAAA,CAAApK,EAAAD,IAGAkK,GAAAjK,EAAAD,EAAAyD,GAAAE,GAAAC,GAAAJ,IAIA8G,GAAA,CAAArK,EAAA/sO,IAAA,CAGA,GAAA42O,GAAA7J,IAAA/sO,EAAA+vO,IAAA/vO,EAAA,EACA,OAAA+sO,EAAAjyP,GAAAiyP,EAAAmD,IAAAA,EAAA,CAEA,IAAA96P,EAAA23P,EAAA1xM,KAAA,CAGA,IAAA0xM,EAAAxpO,MAAA,EACAwpO,IAAAA,EAAAuG,QAAA,GAAAvG,EAAA/4P,KAAA,EACAoB,EAAAgJ,MAAA,GAAAyzP,IAAA7xO,IAAA8vO,GACA,OAAAh1P,GAAAiyP,EAAA,IAAAA,EAAA6F,SAAA,CAAAxC,GAAAF,EAAA,EAGA,IAAAmH,EAAAjiQ,EAAAohQ,UAAA,CAIA,GAJAphQ,EAAAohQ,UAAA,CAAAx2O,EAIA5qB,IAAAA,EAAA+nF,OAAA,CAEA,IADAw1K,GAAA5F,GACAA,IAAAA,EAAA6F,SAAA,CAQA,OADAx9P,EAAAohQ,UAAA,IACAxG,EAAA,MAOA,GAAAjD,IAAAA,EAAAuG,QAAA,EAAAnH,GAAAnsO,IAAAmsO,GAAAkL,IACAr3O,IAAA8vO,GACA,OAAAh1P,GAAAiyP,EAAAqD,GAAA,CAIA,GAAAh7P,EAAAgJ,MAAA,GAAAyzP,IAAA9E,IAAAA,EAAAuG,QAAA,CACA,OAAAx4P,GAAAiyP,EAAAqD,GAAA,CAOA,GAHAh7P,EAAAgJ,MAAA,GAAAkzP,IAAAl8P,IAAAA,EAAA+nO,IAAA,EACA/nO,CAAAA,EAAAgJ,MAAA,CAAAwzP,EAAA,EAEAx8P,EAAAgJ,MAAA,GAAAkzP,GAAA,CAEA,IAAArgP,EAAA,MAAAwlP,MAAA,UAAAa,EAAA,GA4BA,GAhBArmP,GAAAqmP,CARMA,EADNliQ,EAAAmkJ,QAAA,EAAA+1G,IAAAl6P,EAAA03P,KAAA,GACM,EACN13P,EAAA03P,KAAA,GACM,EACN13P,IAAAA,EAAA03P,KAAA,CACM,EAEN,IAE4B,EAC5B,IAAA13P,EAAA89P,QAAA,EAAAjiP,CAAAA,GAAAogP,EAAA,EAEA+B,GAAAh+P,EAFA6b,GAAA,GAAAA,EAAA,IAMA,IAAA7b,EAAA89P,QAAA,GACAE,GAAAh+P,EAAA23P,EAAAW,KAAA,OACA0F,GAAAh+P,EAAA23P,MAAAA,EAAAW,KAAA,GAEAX,EAAAW,KAAA,GAAAt4P,EAAAgJ,MAAA,CAAAwzP,GAIAe,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CACA,GAEA56P,EAAAgJ,MAAA,GAAAmzP,IAMA,GAJAxE,EAAAW,KAAA,GACAyF,GAAA/9P,EAAA,IACA+9P,GAAA/9P,EAAA,KACA+9P,GAAA/9P,EAAA,GACAA,EAAAkhQ,MAAA,CAoBAnD,GAAA/9P,EAAA,CAAAA,EAAAkhQ,MAAA,CAAAhjP,IAAA,MACAle,CAAAA,EAAAkhQ,MAAA,CAAAiB,IAAA,MACA,GAAAjB,MAAA,CAAAz4G,KAAA,MACA,GAAAy4G,MAAA,CAAAjjQ,IAAA,MACA,GAAAijQ,MAAA,CAAA9xO,OAAA,QAEA2uO,GAAA/9P,EAAAA,IAAAA,EAAAkhQ,MAAA,CAAA5uD,IAAA,EACAyrD,GAAA/9P,EAAA,EAAAkhQ,MAAA,CAAA5uD,IAAA,SACAyrD,GAAA/9P,EAAA,EAAAkhQ,MAAA,CAAA5uD,IAAA,UACAyrD,GAAA/9P,EAAA,EAAAkhQ,MAAA,CAAA5uD,IAAA,UACAyrD,GAAA/9P,EAAAA,IAAAA,EAAA03P,KAAA,GACA13P,EAAAmkJ,QAAA,EAAA+1G,IAAAl6P,EAAA03P,KAAA,GACA,KACAqG,GAAA/9P,EAAAA,IAAAA,EAAAkhQ,MAAA,CAAAkB,EAAA,EACApiQ,EAAAkhQ,MAAA,CAAAz4G,KAAA,EAAAzoJ,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAAAvsJ,MAAA,GACA6hQ,GAAA/9P,EAAAA,IAAAA,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAAAvsJ,MAAA,EACA6hQ,GAAA/9P,EAAA,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAAAvsJ,MAAA,UAEA8D,EAAAkhQ,MAAA,CAAAiB,IAAA,EACAxK,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,KAEA/nF,EAAAmhQ,OAAA,GACAnhQ,EAAAgJ,MAAA,CAAAozP,QA5BA,GAbA2B,GAAA/9P,EAAA,GACA+9P,GAAA/9P,EAAA,GACA+9P,GAAA/9P,EAAA,GACA+9P,GAAA/9P,EAAA,GACA+9P,GAAA/9P,EAAA,GACA+9P,GAAA/9P,EAAAA,IAAAA,EAAA03P,KAAA,GACA13P,EAAAmkJ,QAAA,EAAA+1G,IAAAl6P,EAAA03P,KAAA,GACA,KACAqG,GAAA/9P,EAAA88P,IAAA98P,EAAAgJ,MAAA,CAAAwzP,GAIAe,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CA2BA,GACA56P,EAAAgJ,MAAA,GAAAozP,GAAA,CACA,GAAAp8P,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAA6B,CAC7B,IAAA45G,EAAAriQ,EAAA+nF,OAAA,CACA7xC,EAAA,CAAAl2C,MAAAA,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAAAvsJ,MAAA,EAAA8D,EAAAmhQ,OAAA,CACA,KAAAnhQ,EAAA+nF,OAAA,CAAA7xC,EAAAl2C,EAAA4/P,gBAAA,GACA,IAAA/8O,EAAA7iB,EAAA4/P,gBAAA,CAAA5/P,EAAA+nF,OAAA,CAYA,GATA/nF,EAAA2zP,WAAA,CAAAtzP,GAAA,CAAAL,EAAAkhQ,MAAA,CAAAz4G,KAAA,CAAAniF,QAAA,CAAAtmE,EAAAmhQ,OAAA,CAAAnhQ,EAAAmhQ,OAAA,CAAAt+O,GAAA7iB,EAAA+nF,OAAA,EACA/nF,EAAA+nF,OAAA,CAAA/nF,EAAA4/P,gBAAA,CAEA5/P,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,EAGAriQ,EAAAmhQ,OAAA,EAAAt+O,EACA06O,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CACAyH,EAAA,EACAnsN,GAAArzB,CACA,CAGA,IAAAy/O,EAAA,IAAA96P,WAAAxH,EAAAkhQ,MAAA,CAAAz4G,KAAA,EAGAzoJ,EAAA2zP,WAAA,CAAAtzP,GAAA,CAAAiiQ,EAAAh8L,QAAA,CAAAtmE,EAAAmhQ,OAAA,CAAAnhQ,EAAAmhQ,OAAA,CAAAjrN,GAAAl2C,EAAA+nF,OAAA,EACA/nF,EAAA+nF,OAAA,EAAA7xC,EAEAl2C,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,EAGAriQ,EAAAmhQ,OAAA,EACA,GACAn4P,MAAA,CAAAqzP,EACA,IACAr8P,EAAAgJ,MAAA,GAAAqzP,GAAA,CACA,GAAAr8P,EAAAkhQ,MAAA,CAAAjjQ,IAAA,CAA6B,CAC7B,IACAoqC,EADAg6N,EAAAriQ,EAAA+nF,OAAA,CAEA,GACA,GAAA/nF,EAAA+nF,OAAA,GAAA/nF,EAAA4/P,gBAAA,EAOA,GALA5/P,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,EAGA9E,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CACAyH,EAAA,CACA,GAEAriQ,EAAAmhQ,OAAA,CAAAnhQ,EAAAkhQ,MAAA,CAAAjjQ,IAAA,CAAA/B,MAAA,CACU8D,IAAAA,EAAAkhQ,MAAA,CAAAjjQ,IAAA,CAAA0tB,UAAA,CAAA3rB,EAAAmhQ,OAAA,IAEV,EAEQpD,GAAA/9P,EAAAqoC,EACR,OAAAA,IAAAA,EAAA,CAEAroC,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,EAGAriQ,EAAAmhQ,OAAA,EACA,GACAn4P,MAAA,CAAAszP,EACA,IACAt8P,EAAAgJ,MAAA,GAAAszP,GAAA,CACA,GAAAt8P,EAAAkhQ,MAAA,CAAA9xO,OAAA,CAA6B,CAC7B,IACAiZ,EADAg6N,EAAAriQ,EAAA+nF,OAAA,CAEA,GACA,GAAA/nF,EAAA+nF,OAAA,GAAA/nF,EAAA4/P,gBAAA,EAOA,GALA5/P,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,EAGA9E,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CACAyH,EAAA,CACA,GAEAriQ,EAAAmhQ,OAAA,CAAAnhQ,EAAAkhQ,MAAA,CAAA9xO,OAAA,CAAAlzB,MAAA,CACU8D,IAAAA,EAAAkhQ,MAAA,CAAA9xO,OAAA,CAAAzD,UAAA,CAAA3rB,EAAAmhQ,OAAA,IAEV,EAEQpD,GAAA/9P,EAAAqoC,EACR,OAAAA,IAAAA,EAAA,CAEAroC,EAAAkhQ,MAAA,CAAAiB,IAAA,EAAAniQ,EAAA+nF,OAAA,CAAAs6K,GACA1K,CAAAA,EAAAW,KAAA,CAAAM,GAAAjB,EAAAW,KAAA,CAAAt4P,EAAA2zP,WAAA,CAAA3zP,EAAA+nF,OAAA,CAAAs6K,EAAAA,EAAA,CAGA,GACAr5P,MAAA,CAAAuzP,EACA,IACAv8P,EAAAgJ,MAAA,GAAAuzP,GAAA,CACA,GAAAv8P,EAAAkhQ,MAAA,CAAAiB,IAAA,EACA,GAAAniQ,EAAA+nF,OAAA,GAAA/nF,EAAA4/P,gBAAA,GACArC,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,EAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EAEA,CACAmD,GAAA/9P,EAAA23P,IAAAA,EAAAW,KAAA,EACAyF,GAAA/9P,EAAA,EAAsBs4P,KAAA,SACtBX,EAAAW,KAAA,EACA,IAAAt4P,EAAAgJ,MAAA,CAAAwzP,GAIAe,GAAA5F,GACA33P,IAAAA,EAAA+nF,OAAA,CAEA,OADA/nF,EAAAohQ,UAAA,IACAxG,EACA,CACA,GAKAjD,IAAAA,EAAAuG,QAAA,EAAAl+P,IAAAA,EAAAo/P,SAAA,EACAx0O,IAAA4vO,IAAAx6P,EAAAgJ,MAAA,GAAAyzP,GAAA,CACA,IAAA8F,EAAAviQ,IAAAA,EAAA03P,KAAA,CAAAgI,GAAA1/P,EAAA4qB,GACA5qB,EAAAmkJ,QAAA,GAAA+1G,GAAAuG,GAAAzgQ,EAAA4qB,GACA5qB,EAAAmkJ,QAAA,GAAAg2G,GAAAqG,GAAAxgQ,EAAA4qB,GAAAm2O,EAAA,CAAA/gQ,EAAA03P,KAAA,EAAAllO,IAAA,CAAAxyB,EAAA4qB,EAAA,CAMA,GAHA23O,CAAAA,IAAA3F,IAAA2F,IAAA1F,EAAA,GACA78P,CAAAA,EAAAgJ,MAAA,CAAAyzP,EAAA,EAEA8F,IAAA7F,IAAA6F,IAAA3F,GAKA,OAJA,IAAAjF,EAAA6F,SAAA,EACAx9P,CAAAA,EAAAohQ,UAAA,KAGAxG,EAQA,CACA,GAAA2H,IAAA5F,KACA/xO,IAAAmuO,GACAX,GAAAp4P,GACsC4qB,IAAA+vO,KAGtC1C,GAAAj4P,EAAA,QAIA4qB,IAAA6vO,KACwBsC,GAAA/8P,EAAA6wB,IAAA,EAGxB,IAAA7wB,EAAAo/P,SAAA,GACAp/P,EAAA89P,QAAA,GACA99P,EAAA69P,WAAA,GACA79P,EAAAwqB,MAAA,MAIA+yO,GAAA5F,GACAA,IAAAA,EAAA6F,SAAA,EAEA,OADAx9P,EAAAohQ,UAAA,IACAxG,EAEA,QAGA,IAAAF,GAAqBE,GAAA56P,EAAA+nO,IAAA,IAAA8yB,IAIrB76P,IAAAA,EAAA+nO,IAAA,EACAg2B,GAAA/9P,EAAA23P,IAAAA,EAAAW,KAAA,EACAyF,GAAA/9P,EAAA,EAAAs4P,KAAA,SACAyF,GAAA/9P,EAAA,EAAAs4P,KAAA,UACAyF,GAAA/9P,EAAA,EAAAs4P,KAAA,UACAyF,GAAA/9P,EAAA23P,IAAAA,EAAAyG,QAAA,EACAL,GAAA/9P,EAAA,EAAAo+P,QAAA,SACAL,GAAA/9P,EAAA,EAAAo+P,QAAA,UACAL,GAAA/9P,EAAA,EAAAo+P,QAAA,YAIAJ,GAAAh+P,EAAA23P,EAAAW,KAAA,OACA0F,GAAAh+P,EAAA23P,MAAAA,EAAAW,KAAA,GAGAiF,GAAA5F,GAIA33P,EAAA+nO,IAAA,IAAA/nO,CAAAA,EAAA+nO,IAAA,EAAA/nO,EAAA+nO,IAAA,EAEA/nO,IAAAA,EAAA+nF,OAAA,CAAA6yK,GAAAC,EAAA,CA1BqB,EA6BrB2H,GAAA,IAGA,GAAAhB,GAAA7J,GACA,OAAAmD,EAAA,CAEA,IAAA9xP,EAAA2uP,EAAA1xM,KAAA,CAAAj9C,MAAA,CAKA,OAHA2uP,EAAA1xM,KAAA,MAGAj9C,IAAAwzP,GAAA92P,GAAAiyP,EAAAoD,IAAAH,EAAA,EAOA6H,GAAA,CAAA9K,EAAA+K,IAAA,CAEA,IAAAC,EAAAD,EAAAxmQ,MAAA,CAGA,GAAAslQ,GAAA7J,GACA,OAAAmD,EAAA,CAGA,IAAA96P,EAAA23P,EAAA1xM,KAAA,CAAA8hL,EAAA/nO,EAAA+nO,IAAA,CAGA,GAAAA,IAAAA,GAAAA,IAAAA,GAAA/nO,EAAAgJ,MAAA,GAAAkzP,IAAAl8P,EAAAo/P,SAAA,CACA,OAAAtE,EAAA,CAYA,GARA,IAAA/yB,GAEA4vB,CAAAA,EAAAW,KAAA,CAAAC,GAAAZ,EAAAW,KAAA,CAAAoK,EAAAC,EAAA,IAEgB3iQ,EAAA+nO,IAAA,GAIhB46B,GAAA3iQ,EAAAk9P,MAAA,EACA,IAAAn1B,IAEAg1B,GAAA/8P,EAAA6wB,IAAA,EACA7wB,EAAA89P,QAAA,GACA99P,EAAA69P,WAAA,GACA79P,EAAAwqB,MAAA,IAIA,IAAAo4O,EAAA,IAAAp7P,WAAAxH,EAAAk9P,MAAA,EACA0F,EAAAviQ,GAAA,CAAAqiQ,EAAAp8L,QAAA,CAAAq8L,EAAA3iQ,EAAAk9P,MAAA,CAAAyF,GAAA,GACAD,EAAAE,EACAD,EAAA3iQ,EAAAk9P,MAAA,CACA,IAEA2F,EAAAlL,EAAAuG,QAAA,CACAp/P,EAAA64P,EAAAwG,OAAA,CACAv/P,EAAA+4P,EAAA/4P,KAAA,CAKA,IAJA+4P,EAAAuG,QAAA,CAAAyE,EACAhL,EAAAwG,OAAA,GACAxG,EAAA/4P,KAAA,CAAA8jQ,EACApD,GAAAt/P,GACAA,EAAAo/P,SAAA,EAAAtD,IAAA,CACA,IAAAh2O,EAAA9lB,EAAA89P,QAAA,CACAxiQ,EAAA0E,EAAAo/P,SAAA,CAAAtD,CAAAA,GAAA,GACA,GACA97P,EAAAy/P,KAAA,CAAArC,GAAAp9P,EAAAA,EAAAy/P,KAAA,CAAAz/P,EAAAqJ,MAAA,CAAAyc,EAAAg2O,GAAA,IAEA97P,EAAA8sB,IAAA,CAAAhH,EAAA9lB,EAAA++P,MAAA,EAAA/+P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAGAz/P,EAAA6wB,IAAA,CAAA7wB,EAAAy/P,KAAA,EAAA35O,EACMA,UACN,EAAAxqB,EAAA,CACA0E,EAAA89P,QAAA,CAAAh4O,EACA9lB,EAAAo/P,SAAA,CAAAtD,GAAA,EACAwD,GAAAt/P,EACA,CAWA,OAVAA,EAAA89P,QAAA,EAAA99P,EAAAo/P,SAAA,CACAp/P,EAAA69P,WAAA,CAAA79P,EAAA89P,QAAA,CACA99P,EAAAwqB,MAAA,CAAAxqB,EAAAo/P,SAAA,CACAp/P,EAAAo/P,SAAA,GACAp/P,EAAAkgQ,YAAA,CAAAlgQ,EAAA2+P,WAAA,CAAA7C,GAAA,EACA97P,EAAAugQ,eAAA,GACA5I,EAAAwG,OAAA,CAAAr/P,EACA64P,EAAA/4P,KAAA,CAAAA,EACA+4P,EAAAuG,QAAA,CAAA2E,EACA7iQ,EAAA+nO,IAAA,CAAAA,EACA6yB,EAAA,EAwBA,IAAAkI,GAAA,CACAf,YArBAA,GAsBAH,aArBAA,GAsBAF,aArBAA,GAsBAD,iBArBAA,GAsBAE,iBArBAA,GAsBAoB,QArBAf,GAsBAQ,WArBAA,GAsBAC,qBArBAA,GAsBAO,YAtBA,oCAsBA,EAGA,IAAAC,GAAA,CAAAtoP,EAAAhd,IACAI,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAgR,EAAAhd,GA6CA,IAAAm+B,GAAA,CACA99B,OA3CA,SAAA2c,CAAA,EACA,IAAAuoP,EAAApnQ,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,CAAAyqB,UAAA,GACA,KAAA8uO,EAAAhnQ,MAAA,GACA,IAAAooB,EAAmB4+O,EAAApsP,KAAA,MAAAwN,GAGnB,oBAAAA,EACA,gBAAAA,EAAA,sBAGA,QAAAvB,KAAAuB,EACA2+O,GAAA3+O,EAAAvB,IACApI,CAAAA,CAAA,CAAAoI,EAAA,CAAAuB,CAAA,CAAAvB,EAAA,EATmB,CAcnB,OAAApI,CAAA,EAKA,cAAAhf,EAAA,CACA,IAAA+4B,EAAA,EAGA,QAAApzB,EAAA,EAAA2mC,EAAAtsC,EAAAO,MAAA,CAAAoF,EAAA2mC,EAAA3mC,IACAozB,GAAA/4B,CAAA,CAAA2F,EAAA,CAAApF,MAAA,CAGA,IAAA+C,EAAA,IAAAuI,WAAAktB,GAGA,QAAApzB,EAAA,EAAAqhG,EAAA,EAAA16D,EAAAtsC,EAAAO,MAAA,CAAAoF,EAAA2mC,EAAA3mC,IAAA,CACA,IAAAmhD,EAAA9mD,CAAA,CAAA2F,EAAA,CACArC,EAAAoB,GAAA,CAAAoiD,EAAAkgD,GACAA,GAAAlgD,EAAAvmD,MAAA,CAGA,OAAA+C,CAAA,CAKA,EAUA,IAAAkkQ,GAAA,GAEyE,IAAA/nP,OAAA8B,YAAA,CAAAnhB,KAAA,UAAAyL,WAAA,UAAA47P,GAAA,CAAAD,GAAA,GAOzE,IAAAE,GAAgB,IAAA77P,WAAS,KACzB,QAAA+lD,GAAA,EAAAA,GAAA,IAAAA,KACA81M,EAAA,CAAA91M,GAAA,CAAAA,IAAA,MAAAA,IAAA,MAAAA,IAAA,MAAAA,IAAA,MAAAA,IAAA,QACmC81M,EAAA,MAAAA,EAAA,QAKnC,IAAAC,GAAA,IACA,sBAAAr3M,aAAAA,YAAAxiD,SAAA,CAAA9M,MAAA,CACA,WAAAsvD,cAAAtvD,MAAA,CAAAmpB,EAAA,CAEA,IAAA9I,EAAA+lC,EAAAy8E,EAAA+jI,EAAAjiQ,EAAAkiQ,EAAA19O,EAAA5pB,MAAA,CAAAunQ,EAAA,EAIA,IAAAF,EAAA,EAAAA,EAAAC,EAAAD,IAEAxgN,CAAAA,MADAA,CAAAA,EAAAj9B,EAAA6F,UAAA,CAAA43O,EAAA,CACA,UAAAA,EAAA,EAAAC,GAEA,CAAAhkI,MADAA,CAAAA,EAAA15G,EAAA6F,UAAA,CAAA43O,EAAA,GACA,WACAxgN,EAAA,oBAAAy8E,CAAAA,EAAA,OACA+jI,KAGAE,GAAA1gN,EAAA,MAAAA,EAAA,OAAAA,EAAA,UAOA,IAAAzhD,EAAA,EAJA0b,EAAA,IAAAxV,WAAAi8P,GAIAF,EAAA,EAAAjiQ,EAAAmiQ,EAAAF,IAEAxgN,CAAAA,MADAA,CAAAA,EAAAj9B,EAAA6F,UAAA,CAAA43O,EAAA,CACA,UAAAA,EAAA,EAAAC,GAEA,CAAAhkI,MADAA,CAAAA,EAAA15G,EAAA6F,UAAA,CAAA43O,EAAA,GACA,WACAxgN,EAAA,oBAAAy8E,CAAAA,EAAA,OACA+jI,KAGAxgN,EAAA,IAEM/lC,CAAA,CAAA1b,IAAA,CAAAyhD,EACNA,EAAA,MAEA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,EACM/lC,CAAA,CAAA1b,IAAA,KAAAyhD,GAAAA,GACNA,EAAA,OAEA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,GACA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,KACM/lC,CAAA,CAAA1b,IAAA,KAAAyhD,GAAAA,IAGN/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,GACA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,MACA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,IAAA,KACA/lC,CAAA,CAAA1b,IAAA,KAAAyhD,GAAAA,GAIA,OAAA/lC,CAAA,EAIA,IAAA0mP,GAAA,CAAA1mP,EAAA0X,IAAA,CAIA,GAAAA,EAAA,OACA1X,EAAAspD,QAAA,EAAA68L,GACA,OAAA/nP,OAAA8B,YAAA,CAAAnhB,KAAA,MAAAihB,EAAA9gB,MAAA,GAAAw4B,EAAA1X,EAAAA,EAAAspD,QAAA,GAAA5xC,EAAA,CACA,CAGA,IAAAz1B,EAAA,GACA,QAAAqC,EAAA,EAAAA,EAAAozB,EAAApzB,IACArC,GAAAmc,OAAA8B,YAAA,CAAAF,CAAA,CAAA1b,EAAA,EAEA,OAAArC,CAAA,EA8EA,IAAAg6B,GAAA,CACAqqO,WAAAA,GA1EA,WAAAtmP,EAAAqqB,EAAA,KAMA/lC,EAAAovF,EANA,IAAAh8D,EAAA2S,GAAArqB,EAAA9gB,MAAA,CAGA,sBAAA8vD,aAAAA,YAAAviD,SAAA,CAAAsK,MAAA,CACA,WAAAi4C,cAAAj4C,MAAA,CAAAiJ,EAAAspD,QAAA,GAAAj/B,GAAA,CAOA,IAAAs8N,EAAA,MAAAjvO,EAAAA,GAGA,IAAAg8D,EAAA,EAAApvF,EAAA,EAAAA,EAAAozB,GAAA,CACA,IAAAquB,EAAA/lC,CAAA,CAAA1b,IAAA,CACyC,GAAAyhD,EAAA,KAAA4gN,CAAA,CAAAjzK,IAAA,CAAA3tC,EAAA,aAGzC6gN,EAAAP,EAAA,CAAAtgN,EAAA,CAC+D,GAAA6gN,EAAA,GAAAD,CAAA,CAAAjzK,IAAA,OAAApvF,GAAAsiQ,EAAA,eAI/D7gN,GAAA6gN,IAAAA,EAAA,GAAAA,IAAAA,EAAA,KAEAA,EAAA,GAAAtiQ,EAAAozB,GACAquB,EAAA,KAAA/lC,GAAAA,CAAA,CAAA1b,IAAA,CACAsiQ,IAG+C,GAAAA,EAAA,GAAAD,CAAA,CAAAjzK,IAAA,kBAG/C,MACMizK,CAAA,CAAAjzK,IAAA,CAAA3tC,GAENA,GAAA,MACA4gN,CAAA,CAAAjzK,IAAA,kBACAizK,CAAA,CAAAjzK,IAAA,OAAA3tC,KAAAA,EACA,CAGA,OAAA2gN,GAAAC,EAAAjzK,EAAA,EASA,WAAA1zE,EAAAqqB,EAAA,CAGAA,CAAAA,EAAAA,GAAArqB,EAAA9gB,MAAA,EAA0B8gB,EAAA9gB,MAAA,EAAAmrC,CAAAA,EAAArqB,EAAA9gB,MAAA,EAI1B,IAAAymG,EAAAt7D,EAAA,EAAmD,KAAAs7D,GAAA,IAAA3lF,IAAAA,CAAA,CAAA2lF,EAAA,QAAAA,WAIlC,KAIEA,IAAAA,EAJFt7D,EAOjB,EAAAg8N,EAAA,CAAArmP,CAAA,CAAA2lF,EAAA,EAAAt7D,EAAAs7D,EAAAt7D,CAAA,CAMA,EA8CAw8N,GAxBA,WAEA,KAAAjlQ,KAAA,MACA,KAAAu/P,OAAA,GAEA,KAAAD,QAAA,GAEA,KAAAE,QAAA,GAEA,KAAAjwO,MAAA,MACA,KAAAuvO,QAAA,GAEA,KAAAF,SAAA,GAEA,KAAAG,SAAA,GAEA,KAAAngQ,GAAA,IAEA,KAAAyoD,KAAA,MAEA,KAAA2xM,SAAA,GAEA,KAAAU,KAAA,IAIA,IAAAwL,GAAA/lQ,OAAA0L,SAAA,CAAAxF,QAAA,CAMA,CACA60P,WAAAiL,EAAA,CAAA/K,aAAAA,EAAA,CAAAC,aAAAA,EAAA,CAAAC,SAAA8K,EAAA,CACA3K,KAAA4K,EAAA,CAAA3K,aAAA4K,EAAA,CACAlK,sBAAAA,EAAA,CACAK,mBAAAA,EAAA,CACEE,WAAA4J,EAAA,EAAAtL,GA2FF,SAAAuL,GAAA9kQ,CAAA,EACA,KAAAA,OAAA,CAAAw8B,GAAA99B,MAAA,EACA05P,MAAAsC,GACAr7O,OAAAwlP,GACA1yH,UAAA,MACAowH,WAAA,GACAC,SAAA,EACG39G,SAAAk2G,EAAe,EAAA/6P,GAAA,IAElB,IAAA+kQ,EAAA,KAAA/kQ,OAAA,CAGA+kQ,EAAAnrO,GAAA,EAAAmrO,EAAAxC,UAAA,GACAwC,EAAAxC,UAAA,EAAAwC,EAAAxC,UAAA,CAGAwC,EAAAC,IAAA,EAAAD,EAAAxC,UAAA,IAAAwC,EAAAxC,UAAA,KACAwC,CAAAA,EAAAxC,UAAA,MAGA,KAAAn8P,GAAA,GACA,KAAAlI,GAAA,IACA,KAAA+mQ,KAAA,IAAwB,KAAA5oQ,MAAA,IAGxB,KAAAg8P,IAAA,KAAAkM,GAAA,KAAAlM,IAAA,CAAA6F,SAAA,GAGA,IAAAx0P,EAAA85P,GAAAlB,YAAA,CACA,KAAAjK,IAAA,CACA0M,EAAA3M,KAAA,CACA2M,EAAA1lP,MAAA,CACA0lP,EAAAxC,UAAA,CACAwC,EAAAvC,QAAA,CACAuC,EAAAlgH,QAAA,EAGA,GAAAn7I,IAAAi7P,GACA,YAAArkI,EAAA,CAAA52H,EAAA,EAOA,GAJAq7P,EAAAxoP,MAAA,EACAinP,GAAAnB,gBAAA,MAAAhK,IAAA,CAAA0M,EAAAxoP,MAAA,EAGAwoP,EAAA3B,UAAA,EACA,IAAA8B,EAaA,GATMA,EAFN,iBAAAH,EAAA3B,UAAA,CAEMzpO,GAAAqqO,UAAA,CAAAe,EAAA3B,UAAA,EACNoB,yBAAAA,GAAAn6P,IAAA,CAAA06P,EAAA3B,UAAA,EACM,IAAAl7P,WAAA68P,EAAA3B,UAAA,EAEN2B,EAAA3B,UAAA,CAKA15P,CAHAA,EAAA85P,GAAAL,oBAAA,MAAA9K,IAAA,CAAA6M,EAAA,IAGAP,GACA,YAAArkI,EAAA,CAAA52H,EAAA,EAGA,KAAAy7P,SAAA,GACA,EA+JA,SAAAC,GAAA9lQ,CAAA,CAAAU,CAAA,MAAAqlQ,EAAA,IAAAP,GAAA9kQ,GAKsB,GAHtBqlQ,EAAAnqQ,IAAA,CAAAoE,EAAA,IAGsB+lQ,EAAAj/P,GAAA,OAAAi/P,EAAAnnQ,GAAA,EAAAoiI,EAAA,CAAA+kI,EAAAj/P,GAAA,EAGtB,OAAAi/P,EAAA1lQ,MAAA,CAYA,SAAA2lQ,GAAAhmQ,CAAA,CAAAU,CAAA,EAGA,MADAA,CADAA,EAAAA,GAAA,IACA45B,GAAA,IACAwrO,GAAA9lQ,EAAAU,EAAA,CAYA,SAAAulQ,GAAAjmQ,CAAA,CAAAU,CAAA,EAGA,MADAA,CADAA,EAAAA,GAAA,IACAglQ,IAAA,IACAI,GAAA9lQ,EAAAU,EAAA,CA5KA8kQ,GAAA36P,SAAA,CAAAjP,IAAA,UAAAkC,CAAA,CAAAooQ,CAAA,MAEA97P,EAAA+7P,EADA,IAAApN,EAAA,KAAAA,IAAA,CACAlmH,EAAA,KAAAnyI,OAAA,CAAAmyI,SAAA,CAEoB,QAAA8yH,KAAA,UAmBpB,IAhBAQ,EAAAD,IAAA,EAAAA,EAAAA,EAAAA,CAAA,IAAAA,EAAAd,GAAAD,EAAA,CAIA,iBAAArnQ,EAEIi7P,EAAA/4P,KAAA,CAAAq6B,GAAAqqO,UAAA,CAAA5mQ,GACJonQ,yBAAAA,GAAAn6P,IAAA,CAAAjN,GACIi7P,EAAA/4P,KAAA,KAAA4I,WAAA9K,GAEJi7P,EAAA/4P,KAAA,CAAAlC,EAGAi7P,EAAAwG,OAAA,GAAAxG,EAAAuG,QAAA,CAAAvG,EAAA/4P,KAAA,CAAA1C,MAAA,GAGA,CAQA,GAPA,IAAAy7P,EAAA6F,SAAA,GACA7F,EAAAxpO,MAAA,KAAA3mB,WAAAiqI,GACAkmH,EAAA+F,QAAA,GACA/F,EAAA6F,SAAA,CAAA/rH,GAIA,CAAAszH,IAAA/L,IAAA+L,IAAA9L,EAAA,GAAAtB,EAAA6F,SAAA,KACA,KAAAwH,MAAA,CAAArN,EAAAxpO,MAAA,CAAAm4C,QAAA,GAAAqxL,EAAA+F,QAAA,GACA/F,EAAA6F,SAAA,GACA,YAMAx0P,CAJAA,EAAA85P,GAAAC,OAAA,CAAApL,EAAAoN,EAAA,IAIAb,GAOA,OANAvM,EAAA+F,QAAA,IACA,KAAAsH,MAAA,CAAArN,EAAAxpO,MAAA,CAAAm4C,QAAA,GAAAqxL,EAAA+F,QAAA,GAEA10P,EAAA85P,GAAAN,UAAA,MAAA7K,IAAA,EACA,KAAAsN,KAAA,CAAAj8P,GACA,KAAAu7P,KAAA,IACAv7P,IAAAi7P,EAAA,CAIA,GAAAtM,IAAAA,EAAA6F,SAAA,EACA,KAAAwH,MAAA,CAAArN,EAAAxpO,MAAA,EACA,YAIA42O,EAAA,GAAApN,EAAA+F,QAAA,IACA,KAAAsH,MAAA,CAAArN,EAAAxpO,MAAA,CAAAm4C,QAAA,GAAAqxL,EAAA+F,QAAA,GACA/F,EAAA6F,SAAA,GACA,YAGA7F,IAAAA,EAAAuG,QAAA,OAGA,UAWAkG,GAAA36P,SAAA,CAAAu7P,MAAA,UAAAviN,CAAA,EACA,KAAA9mD,MAAA,CAAAnB,IAAA,CAAAioD,EAAA,EAaA2hN,GAAA36P,SAAA,CAAAw7P,KAAA,UAAAj8P,CAAA,EAEAA,IAAAi7P,IACA,MAAAhlQ,MAAA,CAAA68B,GAAAopO,aAAA,MAAAvpQ,MAAA,GAEA,KAAAA,MAAA,IACA,KAAA+J,GAAA,CAAAsD,EACA,KAAAxL,GAAA,MAAAm6P,IAAA,CAAAn6P,GAAA,EA+EA,IAAA2nQ,GAAAT,GAKAU,GAAA,CACAC,QAPAjB,GAQArB,QAAAoC,GACAG,WAPAV,GAQAN,KAPAO,GAQAU,UARA1M,EAQA,EAuBA,IAAA2M,GAAA,MAA2BC,GAAA,MAsC3B,IAAAC,GAAA,SAA8B/N,CAAA,CAAAnrN,CAAA,MAC9Bm5N,EACAxgK,EACAygK,EACAvD,EACAv2O,EAEA+5O,EAEA5I,EACA6I,EACAC,EAEAC,EACAC,EACAptK,EACAqtK,EACAC,EACAC,EACAC,EACAC,EACAr+B,EAEAvzM,EACA9qB,EACAyP,EAAAktP,EAGqB3nQ,EAAAuvB,EAIrB,IAAA83B,EAAA0xM,EAAA1xM,KAAA,CAEA0/M,EAAAhO,EAAAwG,OAAA,CACAv/P,EAAA+4P,EAAA/4P,KAAA,CACAumG,EAAAwgK,EAAAhO,CAAAA,EAAAuG,QAAA,IACA0H,EAAAjO,EAAA+F,QAAA,CACAvvO,EAAAwpO,EAAAxpO,MAAA,CACAk0O,EAAAuD,EAAAp5N,CAAAA,EAAAmrN,EAAA6F,SAAA,EACA1xO,EAAA85O,EAAAjO,CAAAA,EAAA6F,SAAA,MAEAqI,EAAA5/M,EAAA4/M,IAAA,CAEA5I,EAAAh3M,EAAAg3M,KAAA,CACA6I,EAAA7/M,EAAA6/M,KAAA,CACAC,EAAA9/M,EAAA8/M,KAAA,CACAC,EAAA//M,EAAA58C,MAAA,CACA48P,EAAAhgN,EAAAggN,IAAA,CACAptK,EAAA5yC,EAAA4yC,IAAA,CACAqtK,EAAAjgN,EAAAugN,OAAA,CACAL,EAAAlgN,EAAAwgN,QAAA,CACAL,EAAA,IAAAngN,EAAAygN,OAAA,IAAAL,EAAA,IAAApgN,EAAA0gN,QAAA,IAOA5wN,EACA,GACA8iD,EAAA,KACAotK,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,EACAotK,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,GAEAytK,EAAAJ,CAAA,CAAAD,EAAAG,EAAA,CAGAQ,EACA,QAKA,GAHAX,KADAh+B,EAAAq+B,IAAA,GAEAztK,GAAAovI,EAEAA,GADAA,CAAAA,EAAA,YAKA95M,CAAA,CAAAy3O,IAAA,CAAAU,MAAAA,OAEA,GAAAr+B,GAAAA,EAAA,CACAvzM,EAAA4xO,MAAAA,EACAr+B,CAAAA,GAAA,MAEApvI,EAAAovI,IACAg+B,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,GAEAnkE,GAAAuxO,EAAA,IAAAh+B,CAAA,IACAg+B,KAAAh+B,EACApvI,GAAAovI,GAGApvI,EAAA,KACAotK,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,EACAotK,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,GACAytK,EAAAH,CAAA,CAAAF,EAAAI,EAAA,CAGAQ,EACA,QAMA,GAJAZ,KADAh+B,EAAAq+B,IAAA,GAEAztK,GAAAovI,EAGAA,GAHAA,CAAAA,EAAA,YAGA,CAaA,GAZAr+N,EAAA08P,MAAAA,EAEAztK,EADAovI,CAAAA,GAAA,MAEAg+B,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,CAAAA,GAAA,GACAovI,IACAg+B,GAAArnQ,CAAA,CAAA+mQ,IAAA,EAAA9sK,EACAA,GAAA,IAKAjvF,CAFAA,GAAAq8P,EAAA,IAAAh+B,CAAA,KAEA49B,EAAA,CACAlO,EAAAn6P,GAAA,iCACAyoD,EAAAjnC,IAAA,CAAAwmP,GACA,MAAAzvN,CAAA,CACA,GAEAkwN,KAAAh+B,EACApvI,GAAAovI,EAGAr+N,EADAq+N,CAAAA,EAAA29B,EAAAvD,CAAA,EACA,CAEA,GAAAp6B,CADAA,EAAAr+N,EAAAq+N,CAAA,EACA69B,GACA7/M,EAAA6gN,IAAA,EACAnP,EAAAn6P,GAAA,iCACAyoD,EAAAjnC,IAAA,CAAAwmP,GACA,MAAAzvN,CAAA,CAwBA,GACA18B,EAAA,EACAktP,EAAAP,EACAD,IAAAA,EAEA,IADA1sP,GAAA4jP,EAAAh1B,EACAA,EAAAvzM,EAAA,CACAA,GAAAuzM,EACA,GACoB95M,CAAA,CAAAy3O,IAAA,CAAAI,CAAA,CAAA3sP,IAAA,OACpB,EAAA4uN,EAAA,CACA5uN,EAAAusP,EAAAh8P,EACA28P,EAAAp4O,CACA,OAEA,GAAA43O,EAAA99B,EAGA,IAFA5uN,GAAA4jP,EAAA8I,EAAA99B,EAEAA,CADAA,GAAA89B,CAAA,EACArxO,EAAA,CACAA,GAAAuzM,EACA,GACoB95M,CAAA,CAAAy3O,IAAA,CAAAI,CAAA,CAAA3sP,IAAA,OACpB,EAAA4uN,EAAA,CAEA,GADA5uN,EAAA,EACA0sP,EAAArxO,EAAA,CAEAA,GADAuzM,EAAA89B,EAEA,GACsB53O,CAAA,CAAAy3O,IAAA,CAAAI,CAAA,CAAA3sP,IAAA,OACtB,EAAA4uN,EAAA,CACA5uN,EAAAusP,EAAAh8P,EACA28P,EAAAp4O,CACA,EACA,MAIA,GADA9U,GAAA0sP,EAAA99B,EACAA,EAAAvzM,EAAA,CACAA,GAAAuzM,EACA,GACoB95M,CAAA,CAAAy3O,IAAA,CAAAI,CAAA,CAAA3sP,IAAA,OACpB,EAAA4uN,EAAA,CACA5uN,EAAAusP,EAAAh8P,EACA28P,EAAAp4O,CACA,MAEAuG,EAAA,GACAvG,CAAA,CAAAy3O,IAAA,CAAAW,CAAA,CAAAltP,IAAA,CACA8U,CAAA,CAAAy3O,IAAA,CAAAW,CAAA,CAAAltP,IAAA,CACA8U,CAAA,CAAAy3O,IAAA,CAAAW,CAAA,CAAAltP,IAAA,CACAqb,GAAA,EAEAA,IACAvG,CAAA,CAAAy3O,IAAA,CAAAW,CAAA,CAAAltP,IAAA,CACAqb,EAAA,GACAvG,CAAAA,CAAA,CAAAy3O,IAAA,CAAAW,CAAA,CAAAltP,IAAA,EAGA,KACA,CACAA,EAAAusP,EAAAh8P,EACA,GACAukB,CAAA,CAAAy3O,IAAA,CAAAz3O,CAAA,CAAA9U,IAAA,CACA8U,CAAA,CAAAy3O,IAAA,CAAAz3O,CAAA,CAAA9U,IAAA,CACA8U,CAAA,CAAAy3O,IAAA,CAAAz3O,CAAA,CAAA9U,IAAA,CACgBqb,GAAA,QAChBA,EAAA,GACAA,IACAvG,CAAA,CAAAy3O,IAAA,CAAAz3O,CAAA,CAAA9U,IAAA,CACAqb,EAAA,GACAvG,CAAAA,CAAA,CAAAy3O,IAAA,CAAAz3O,CAAA,CAAA9U,IAAA,EAGA,OAEA,IAAA4uN,GAAAA,CAAA,MACAq+B,EAAAH,CAAA,EAAAG,MAAAA,CAAA,EAAAL,CAAAA,EAAA,IAAAh+B,CAAA,MACA,SAAA4+B,CAAA,KAEA,CACAlP,EAAAn6P,GAAA,yBACAyoD,EAAAjnC,IAAA,CAAAwmP,GACA,MAAAzvN,CAAA,MAGA,CAEA,MACA,IAAAkyL,GAAAA,CAAA,MACAq+B,EAAAJ,CAAA,EAAAI,MAAAA,CAAA,EAAAL,CAAAA,EAAA,IAAAh+B,CAAA,MACA,SAAA2+B,CAAA,MAEA,GAAA3+B,GAAAA,EAAA,CAEAhiL,EAAAjnC,IAAA,CAAAymP,GACA,MAAA1vN,CAAA,KAEA,CACA4hN,EAAAn6P,GAAA,+BACAyoD,EAAAjnC,IAAA,CAAAwmP,GACA,MAAAzvN,CAAA,MAGA,CACI,OAAA4vN,EAAAxgK,GAAAygK,EAAA95O,EAAA,CAKJ65O,GADAjxO,EAAAmkE,GAAA,EAEAA,GAAAnkE,GAAA,EAAAuxO,GAAA,IAAAptK,CAAA,IAIA8+J,EAAAwG,OAAA,CAAAwH,EACAhO,EAAA+F,QAAA,CAAAkI,EACAjO,EAAAuG,QAAA,CAAAyH,EAAAxgK,EAAA,EAAAA,CAAAA,EAAAwgK,CAAA,IAAAA,CAAAA,EAAAxgK,CAAA,EACAwyJ,EAAA6F,SAAA,CAAAoI,EAAA95O,EAAA,IAAAA,CAAAA,EAAA85O,CAAA,MAAAA,CAAAA,EAAA95O,CAAA,EACAm6B,EAAAggN,IAAA,CAAAA,EACAhgN,EAAA4yC,IAAA,CAAAA,CACA,EAsBA,IAAAkuK,GAAA,GACAC,GAAA,IACAC,GAAA,IAGAC,GAAA,EACAC,GAAA,EAAAC,GAAA,EAGAC,GAAA,IAAA5rE,YAAA,CACA,yCACA,mDAGA6rE,GAAA,IAAA9/P,WAAA,CACA,gDACA,+CAGA+/P,GAAA,IAAA9rE,YAAA,CACA,2CACA,8CACA,6BAGA+rE,GAAA,IAAAhgQ,WAAA,CACA,gDACA,8BACA,oBAGAigQ,GAAA,CAAA7pQ,EAAAo/F,EAAA0qK,EAAA9oG,EAAAjqE,EAAAgzK,EAAAC,EAAA1hQ,IACA,KAaA2hQ,EACA13K,EACAwoB,EACAn5G,EACAV,EAGAs5B,EAIA0vO,EAAAC,EAAAC,EAvBA,IAAAnvK,EAAA3yF,EAAA2yF,IAAA,CAGAnkE,EAAA,EACAmyE,EAAA,EACAz/D,EAAA,EAAAC,EAAA,EACA7a,EAAA,EACA26B,EAAA,EACA8gN,EAAA,EACA/xN,EAAA,EACAu+C,EAAA,EACAyzK,EAAA,EAMA58N,EAAA,KAGA/d,EAAA,IAAAkuK,YAAAsrE,GAAA,GACAoB,EAAA,IAAA1sE,YAAAsrE,GAAA,GAAAt+G,EAAA,KAqCA,IAAA/zH,EAAA,EAAAA,GAAAqyO,GAAAryO,IACAnH,CAAA,CAAAmH,EAAA,GAEA,IAAAmyE,EAAA,EAAAA,EAAA+3D,EAAA/3D,IACAt5E,CAAA,CAAAyvE,CAAA,CAAA0qK,EAAA7gK,EAAA,IAKA,IADAr6E,EAAAqsE,EACAxxD,EAAA0/N,GAAA1/N,GAA4B,GAC5B9Z,IAAAA,CAAA,CAAA8Z,EAAA,CAD4BA,KAM5B,GAHA7a,EAAA6a,GACA7a,CAAAA,EAAA6a,CAAA,EAEAA,IAAAA,EAaA,OAVAstD,CAAA,CAAAgzK,IAAA,UAMAhzK,CAAA,CAAAgzK,IAAA,UAGAzhQ,EAAA2yF,IAAA,GACA,CACA,CACA,IAAAzxD,EAAA,EAAAA,EAAAC,GACA9Z,IAAAA,CAAA,CAAA6Z,EAAA,CADAA,KASA,IANA5a,EAAA4a,GACA5a,CAAAA,EAAA4a,CAAA,EAIA8O,EAAA,EACAxhB,EAAA,EAAAA,GAAAqyO,GAAAryO,IAGA,GAFAwhB,IAAA,EAEAA,CADAA,GAAA3oB,CAAA,CAAAmH,EAAA,EACA,EACA,OAAa,EACb,CAEA,GAAAwhB,EAAA,GAAAt4C,CAAAA,IAAAspQ,IAAoC7/N,IAAAA,CAAA,EACpC,UAKA,IAAA3S,EAAA,EADAyzO,CAAA,MACAzzO,EAAAqyO,GAAAryO,IACAyzO,CAAA,CAAAzzO,EAAA,GAAAyzO,CAAA,CAAAzzO,EAAA,CAAAnH,CAAA,CAAAmH,EAAA,CAIA,IAAAmyE,EAAA,EAAAA,EAAA+3D,EAAA/3D,IACA,IAAA7J,CAAA,CAAA0qK,EAAA7gK,EAAA,EACA+gK,CAAAA,CAAA,CAAAO,CAAA,CAAAnrK,CAAA,CAAA0qK,EAAA7gK,EAAA,KAAAA,CAAA,EAiEA,GA3BAjpG,IAAAspQ,IACA57N,EAAAm9G,EAAAm/G,EAAAxvO,EAAA,IAGAx6B,IAAAupQ,IACA77N,EAAA+7N,GACA5+G,EAAA6+G,GAAAlvO,EAAA,MAIAkT,EAAAi8N,GACA9+G,EAAA++G,GACApvO,EAAA,GAIA8vO,EAAA,EACArhK,EAAA,EACAnyE,EAAA0S,EACAtoC,EAAA6oQ,EACAxgN,EAAA36B,EACAy7O,EAAA,EACAtvJ,EAAA,GAC8Bn5G,EAAAi1F,CAA9BA,EAAA,GAAAjoE,CAAA,EAA8B,EAI9B,IAAA26O,IAAA1yK,EAAAuyK,IACAppQ,IAAAwpQ,IAAA3yK,EAAAwyK,GACA,SAIA,QAEAa,EAAApzO,EAAAuzO,EACAL,CAAA,CAAA/gK,EAAA,GAAAzuE,GACA2vO,EAAA,EACAC,EAAAJ,CAAA,CAAA/gK,EAAA,EAEA+gK,CAAA,CAAA/gK,EAAA,EAAAzuE,GACA2vO,EAAAt/G,CAAA,CAAAm/G,CAAA,CAAA/gK,EAAA,CAAAzuE,EAAA,CACA4vO,EAAA18N,CAAA,CAAAs8N,CAAA,CAAA/gK,EAAA,CAAAzuE,EAAA,GAGA2vO,EAAA,GACAC,EAAA,GAIAH,EAAA,GAAAnzO,EAAAuzO,EAEA7gO,EADA+oD,EAAA,GAAAhpC,EAEA,GAEMwtC,CAAA,CAAA71F,EAAAopQ,CAAAA,GAAAD,CAAA,EADN93K,CAAAA,GAAA03K,CAAA,EACM,OAAAE,GAAA,GAAAC,EAAA,QAAA73K,IAAAA,EAAA,CAKN,IADA03K,EAAA,GAAAnzO,EAAA,EACAwzO,EAAAL,GACAA,IAAA,EAWA,GATAA,IAAAA,GACAK,GAAAL,EAAA,EACMK,GAAAL,GAENK,EAAA,EAIArhK,IACA,KAAAt5E,CAAA,CAAAmH,EAAA,CAAyB,CACzB,GAAAA,IAAA2S,EAAA,MACA3S,EAAAsoE,CAAA,CAAA0qK,EAAAE,CAAA,CAAA/gK,EAAA,KAIAnyE,EAAAlI,GAAA,CAAA07O,EAAA1oQ,CAAA,IAAAm5G,EAAA,CAYA,IAVA,IAAAsvJ,GACAA,CAAAA,EAAAz7O,CAAA,EAG8B1tB,GAAAsoC,EAK9B8O,EAAA,GADAiR,CAAAA,EAAAzyB,EAAAuzO,CAAA,EAIA,EAFAA,EAAA5gO,IAEA6O,CAAAA,CADAA,GAAA3oB,CAAA,CAAA45B,EAAyB8gN,EAAA,GACzB,IACA9gN,IACAjR,IAAA,EAKA,GADAu+C,GAAA,GAAAttC,EACA,IAAAggN,IAAA1yK,EAAAuyK,IACAppQ,IAAAwpQ,IAAA3yK,EAAAwyK,GACA,SAQAtyK,CAAA,CAJAgkB,EAAAuvJ,EAAA1oQ,EAIA,OAAA2nD,GAAA,GAAAroD,EAAA6oQ,EAAA,CACA,EAgBA,OAVA,IAAAO,GAIAvzK,CAAAA,CAAA,CAAA71F,EAAAopQ,EAAA,GAAAD,GAAA,YAKA/hQ,EAAA2yF,IAAA,CAAArsE,EACA,GAGA,IAAA47O,GAAAX,GA2BA,IAAAY,GAAA,EACAC,GAAA,EAAAC,GAAA,EAMA,CACArP,SAAAsP,EAAA,CAAArP,QAAAA,EAAA,CAAAC,QAAAA,EAAA,CACAC,KAAAoP,EAAA,CAAAnP,aAAAoP,EAAA,CAAAnP,YAAAoP,EAAA,CAAAlP,eAAAmP,EAAA,CAAAlP,aAAAmP,EAAA,CAAAlP,YAAAmP,EAAA,CAAAlP,YAAAA,EAAA,CACEW,WAAAA,EAAA,EAAA1B,GAQFkQ,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACA7kE,GAAA,MACA52B,GAAA,MACA9/I,GAAA,MACAw7O,GAAA,MACAC,GAAA,MACAC,GAAA,MACA3oQ,GAAA,MACA4oQ,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MACAC,GAAA,MAA4BC,GAAA,MAO5BC,GAAA,IACAC,GAAA,IAGAC,GAAA,GACAC,GAAAD,GAGAE,GAAA,GAGA,aACA,cACA,EAAAx9M,MAAAA,CAAA,MACA,EAAAA,IAAAA,CAAA,OAIA,SAAAy9M,IAAA,CACA,KAAArT,IAAA,MACA,KAAA34O,IAAA,GACA,KAAAmmF,IAAA,IACA,KAAA4iI,IAAA,GAEA,KAAAkjC,QAAA,IACA,KAAA3jG,KAAA,GAEA,KAAAu+F,IAAA,GACA,KAAAqF,KAAA,GACA,KAAAz0H,KAAA,GAC8B,KAAA5lH,IAAA,MAI9B,KAAA0yF,KAAA,GACA,KAAA05I,KAAA,GACA,KAAA6I,KAAA,GACA,KAAAC,KAAA,GAA8B,KAAA18P,MAAA,MAI9B,KAAA48P,IAAA,GAA8B,KAAAptK,IAAA,GAI9B,KAAA38F,MAAA,GAA8B,KAAA+X,MAAA,GAGA,KAAAw0I,KAAA,GAI9B,KAAA+9G,OAAA,MACA,KAAAC,QAAA,MACA,KAAAC,OAAA,GAA8B,KAAAC,QAAA,GAI9B,KAAAwE,KAAA,GACA,KAAAC,IAAA,GACA,KAAAC,KAAA,GACA,KAAAxL,IAAA,GAAiC,KAAA/gQ,IAAA,MAGjC,KAAAk+F,IAAA,KAAAy+F,YAAA,KAAoC,KAAAmsE,IAAA,KAAAnsE,YAAA,KAQpC,KAAA6vE,MAAA,MACA,KAAAC,OAAA,MACA,KAAAzE,IAAA,GACA,KAAA0E,IAAA,GACA,KAAAC,GAAA,GAGA,IAAAC,GAAA,IAGA,IAAA/T,EACA,QACA,CACA,IAAA1xM,EAAA0xM,EAAA1xM,KAAA,OACA,CAAAA,GAAAA,EAAA0xM,IAAA,GAAAA,GACA1xM,EAAAjnC,IAAA,CAAA+pP,IAAA9iN,EAAAjnC,IAAA,CAAA0rP,GACA,EAEA,CADA,EAIAiB,GAAA,IAGA,GAAAD,GAAA/T,GAAA,OAAAiR,EAAA,CACA,IAAA3iN,EAAA0xM,EAAA1xM,KAAA,CAqBA,OApBA0xM,EAAAyG,QAAA,CAAiBzG,EAAAgG,SAAA,CAAA13M,EAAAwwF,KAAA,GACjBkhH,EAAAn6P,GAAA,IACAyoD,EAAA8hL,IAAA,EACA4vB,CAAAA,EAAAW,KAAA,CAAAryM,EAAAA,EAAA8hL,IAAA,EAEA9hL,EAAAjnC,IAAA,CAAA+pP,GACA9iN,EAAAk/C,IAAA,GACAl/C,EAAAglN,QAAA,GACAhlN,EAAAqhH,KAAA,IACArhH,EAAA4/M,IAAA,OACA5/M,EAAAp1B,IAAA,MACAo1B,EAAAggN,IAAA,GACAhgN,EAAA4yC,IAAA,GAEA5yC,EAAAugN,OAAA,CAAAvgN,EAAAqlN,MAAA,KAAA/vE,WAAAovE,IAAA1kN,EAAAwgN,QAAA,CAAAxgN,EAAAslN,OAAA,KAAAhwE,WAAAqvE,IAGA3kN,EAAA6gN,IAAA,GACA7gN,EAAAulN,IAAA,IAEA/C,EAAA,EAGAmD,GAAA,IAGA,GAAAF,GAAA/T,GAAA,OAAAiR,EAAA,CACA,IAAA3iN,EAAA0xM,EAAA1xM,KAAA,CAGA,OAFAA,EAAAg3M,KAAA,GACAh3M,EAAA6/M,KAAA,GACA7/M,EAAA8/M,KAAA,GAAA4F,GAAAhU,EAEA,EAIAkU,GAAA,CAAAlU,EAAAkK,IAAA,KAAA95B,EAIA,GAAA2jC,GAAA/T,GAAA,OAAAiR,EAAA,KAAA3iN,EAAA0xM,EAAA1xM,KAAA,OAgBA,CAZA47M,EAAA,GACA95B,EAAA,EACA85B,EAAA,CAAAA,IAGA95B,EAAA,CAAA85B,GAAA,KACAA,EAAA,IACAA,CAAAA,GAAA,KAKAA,GAAAA,CAAAA,EAAA,GAAAA,EAAA,KACA+G,IAEA,OAAA3iN,EAAA58C,MAAA,EAAA48C,EAAAs9D,KAAA,GAAAs+I,GACA57M,CAAAA,EAAA58C,MAAA,OAIA48C,EAAA8hL,IAAA,CAAAA,EACA9hL,EAAAs9D,KAAA,CAAAs+I,EACA+J,GAAAjU,GARA,EAWAmU,GAAA,CAAAnU,EAAAkK,IAAA,CAGA,IAAAlK,EAAA,OAAAiR,EAAuC,CAEvC,IAAA3iN,EAAA,IAAA+kN,EAKArT,CAAAA,EAAA1xM,KAAA,CAAAA,EACAA,EAAA0xM,IAAA,CAAAA,EACA1xM,EAAA58C,MAAA,MACA48C,EAAAjnC,IAAA,CAAA+pP,GACA,IAAA1wL,EAAAwzL,GAAAlU,EAAAkK,GAIA,OAHAxpL,IAAAowL,IACA9Q,CAAAA,EAAA1xM,KAAA,OAEAoyB,CAAA,EAGA0zL,GAAA,GAGAD,GAAAnU,EAAAmT,IAaAkB,GAAA,GAKAC,GAAA,IAIA,GAAAD,GAAA,CACAvb,EAAA,IAAAl1D,WAAA,KAAAm1D,EAAA,IAAAn1D,WAAA,IAIA,IAAA10F,EAAA,EACA,KAAAA,EAAA,KAAwB5gD,EAAA+2C,IAAA,CAAA6J,IAAA,GACxB,KAAAA,EAAA,KAAwB5gD,EAAA+2C,IAAA,CAAA6J,IAAA,GACxB,KAAAA,EAAA,KAAwB5gD,EAAA+2C,IAAA,CAAA6J,IAAA,QAAAA,EAAA,KAAA5gD,EAAA+2C,IAAA,CAAA6J,IAAA,GAMD,IAJqDuhK,GAAAE,GAAAriN,EAAA+2C,IAAA,OAAAyzJ,EAAA,EAAAxqM,EAAA2hN,IAAA,EAAA/uK,KAAA,IAI5EgO,EAAA,EAAuBA,EAAA,IAAA5gD,EAAA+2C,IAAA,CAAA6J,IAAA,GAEqDuhK,GAAAG,GAAAtiN,EAAA+2C,IAAA,MAAA0zJ,EAAA,EAAAzqM,EAAA2hN,IAAA,EAAA/uK,KAAA,IAI5EmzK,GAAA,KAGAxF,OAAA,CAAA/V,EACAxqM,EAAAygN,OAAA,GACAzgN,EAAAwgN,QAAA,CAAA/V,EACAzqM,EAAA0gN,QAAA,IAiBAuF,GAAA,CAAAvU,EAAAzjP,EAAA4X,EAAAjJ,IAAA,KAGAjZ,EAAA,IAAAq8C,EAAA0xM,EAAA1xM,KAAA,CAsCA,OAlCA,OAAAA,EAAA58C,MAAA,GACA48C,EAAAg3M,KAAA,IAAAh3M,EAAAs9D,KAAA,CACAt9D,EAAA8/M,KAAA,GAAA9/M,EAAA6/M,KAAA,GAGA7/M,EAAA58C,MAAA,KAAA7B,WAAAy+C,EAAAg3M,KAAA,GAIAp6O,GAAAojC,EAAAg3M,KAAA,EACAh3M,EAAA58C,MAAA,CAAAhJ,GAAA,CAAA6T,EAAAoyD,QAAA,CAAAx6C,EAAAm6B,EAAAg3M,KAAA,CAAAnxO,GAAA,GACAm6B,EAAA8/M,KAAA,GACA9/M,EAAA6/M,KAAA,CAAA7/M,EAAAg3M,KAAA,GAGArzP,CAAAA,EAAAq8C,EAAAg3M,KAAA,CAAAh3M,EAAA8/M,KAAA,EACAljP,GACAjZ,CAAAA,EAAAiZ,CAAA,EAGAojC,EAAA58C,MAAA,CAAAhJ,GAAA,CAAA6T,EAAAoyD,QAAA,CAAAx6C,EAAAjJ,EAAAiJ,EAAAjJ,EAAAjZ,GAAAq8C,EAAA8/M,KAAA,EACAljP,CAAAA,GAAAjZ,CAAA,GAGAq8C,EAAA58C,MAAA,CAAAhJ,GAAA,CAAA6T,EAAAoyD,QAAA,CAAAx6C,EAAAjJ,EAAAiJ,GAAA,GACAm6B,EAAA8/M,KAAA,CAAAljP,EACAojC,EAAA6/M,KAAA,CAAA7/M,EAAAg3M,KAAA,GAGAh3M,EAAA8/M,KAAA,EAAAn8P,EACAq8C,EAAA8/M,KAAA,GAAA9/M,EAAAg3M,KAAA,EAAuCh3M,CAAAA,EAAA8/M,KAAA,IACvC9/M,EAAA6/M,KAAA,CAAA7/M,EAAAg3M,KAAA,EAAAh3M,CAAAA,EAAA6/M,KAAA,EAAAl8P,CAAA,IAGA,GAGAuiQ,GAAA,CAAAxU,EAAA/sO,IAAA,KAGAq7B,EACArnD,EAAAuvB,EACArvB,EACAstQ,EACAvM,EAAA3pN,EACA+vN,EACAptK,EACA8sK,EAAAC,EACA/iP,EACAxJ,EACAktP,EAEAuB,EAAAC,EAAAC,EAEAqE,EAAAC,EAAAC,EACA73O,EACA2jD,EACAnyE,EAES5K,EART,IAAAgrQ,EAAA,EAMAkG,EAAA,IAAAhlQ,WAAA,GAKAqvB,EAAA,IAAArvB,WAAA,kDAIA,GAAAkkQ,GAAA/T,IAAA,CAAAA,EAAAxpO,MAAA,EACA,CAAAwpO,EAAA/4P,KAAA,EAAA+4P,IAAAA,EAAAuG,QAAA,CACA,OAAA0K,EAAA,CAGA3iN,CAAAA,EAAA0xM,EAAA1xM,KAAA,EAAuDjnC,IAAA,GAAAre,IAAAslD,CAAAA,EAAAjnC,IAAA,CAAAuqP,EAAA,EAKvD6C,EAAAzU,EAAA+F,QAAA,CACAvvO,EAAAwpO,EAAAxpO,MAAA,CACA+nB,EAAAyhN,EAAA6F,SAAA,CACA1+P,EAAA64P,EAAAwG,OAAA,CACAv/P,EAAA+4P,EAAA/4P,KAAA,CACAihQ,EAAAlI,EAAAuG,QAAA,CACA+H,EAAAhgN,EAAAggN,IAAA,CACAptK,EAAA5yC,EAAA4yC,IAAA,CAGA8sK,EAAA9F,EACA+F,EAAA1vN,EAAAmiC,EAAAowL,GAGAgE,EACA,OACA,OAAAxmN,EAAAjnC,IAAA,EACA,KAAA+pP,GACA,GAAA9iN,IAAAA,EAAA8hL,IAAA,EACA9hL,EAAAjnC,IAAA,CAAAuqP,GACA,MACA,KAEA1wK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA,KAAA5yC,EAAA8hL,IAAA,EAAAk+B,QAAAA,EAAA,CACA,IAAAhgN,EAAAs9D,KAAA,EACAt9D,CAAAA,EAAAs9D,KAAA,KAEAt9D,EAAAilN,KAAA,GAEAsB,CAAA,IAAAvG,IAAAA,EACAuG,CAAA,cACAvmN,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAsB,EAAA,KAIAvG,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAgqP,GACA,MACA,GACA/iN,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAAhyB,IAAA,KAEA,CAAAonD,CAAAA,EAAAA,EAAA8hL,IAAA,GACA,GAAAk+B,IAAAA,CAAA,MAAAA,CAAAA,GAAA,QACAtO,EAAAn6P,GAAA,0BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,GACA,CAAAvE,GAAAA,CAAA,IAAA1L,GAAA,CACA5C,EAAAn6P,GAAA,8BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,GAEAvE,KAAA,EACAptK,GAAA,EAEAnkE,EAAA,CAAAuxO,GAAAA,CAAA,IACA,IAAAhgN,EAAAs9D,KAAA,EACAt9D,CAAAA,EAAAs9D,KAAA,CAAA7uF,CAAA,EAEAA,EAAA,IAAAA,EAAAuxB,EAAAs9D,KAAA,EACAo0I,EAAAn6P,GAAA,uBACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,QAKA3E,IAAA,IAAA5/M,EAAAs9D,KAAA,CAGAt9D,EAAAqhH,KAAA,GAEAqwF,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,GACAjlN,EAAAjnC,IAAA,CAAAinP,IAAAA,EAAAoD,GAAA1oQ,EAAA,CAEAslQ,EAAA,EACAptK,EAAA,EAEA,WACAmwK,GAEA,KAAAnwK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAGA,GADA5yC,EAAAqhH,KAAA,CAAA2+F,EACA,CAAAhgN,IAAAA,EAAAqhH,KAAA,IAAAizF,GAAA,CACA5C,EAAAn6P,GAAA,8BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,GACAvkN,MAAAA,EAAAqhH,KAAA,EACAqwF,EAAAn6P,GAAA,4BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EACA35O,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAA3S,IAAA,SAEA,IAAA+nC,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,GAEAykC,CAAA,IAAAvG,IAAAA,EACAuG,CAAA,cACAvmN,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAsB,EAAA,MAIAvG,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAiqP,EAEA,MAAAA,GAEA,KAAApwK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAAyhL,IAAA,CAAA2zD,CAAA,EAEA,IAAAhgN,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,GAEAykC,CAAA,IAAAvG,IAAAA,EACAuG,CAAA,cACAA,CAAA,eACAA,CAAA,eACAvmN,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAsB,EAAA,MAIAvG,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAkqP,EAEA,MAAAA,GAEA,KAAArwK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAAp1B,IAAA,GACAo1B,EAAAp1B,IAAA,CAAA67O,MAAA,CAAAzG,IAAAA,EACAhgN,EAAAp1B,IAAA,CAAAuxO,EAAA,CAAA6D,GAAA,GAEA,IAAAhgN,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,GAEAykC,CAAA,IAAAvG,IAAAA,EACAuG,CAAA,cACAvmN,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAsB,EAAA,MAIAvG,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAmqP,EAEA,MAAAA,GACA,GAAAljN,KAAAA,EAAAqhH,KAAA,CAA8B,CAE9B,KAAAzuE,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAA/pD,MAAA,CAAA+pQ,EACAhgN,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAA87O,SAAA,CAAA1G,CAAA,EAEA,IAAAhgN,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,GAEAykC,CAAA,IAAAvG,IAAAA,EACAuG,CAAA,cACAvmN,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAsB,EAAA,MAIAvG,EAAA,EACAptK,EAAA,CAEA,MACA5yC,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAA43H,KAAA,MACA,CACAxiG,EAAAjnC,IAAA,CAAAslL,EAEA,MAAAA,GACA,GAAAr+I,KAAAA,EAAAqhH,KAAA,GACAzkJ,CAAAA,EAAAojC,EAAA/pD,MAA6B,EAC7B2jQ,GAAAh9O,CAAAA,EAAAg9O,CAAA,EACAh9O,IACAojC,EAAAp1B,IAAA,GACA6D,EAAAuxB,EAAAp1B,IAAA,CAAA87O,SAAA,CAAA1mN,EAAA/pD,MAAA,CACA+pD,EAAAp1B,IAAA,CAAA43H,KAAA,EAEAxiG,CAAAA,EAAAp1B,IAAA,CAAA43H,KAAA,KAAAjhJ,WAAAy+C,EAAAp1B,IAAA,CAAA87O,SAAA,GAEA1mN,EAAAp1B,IAAA,CAAA43H,KAAA,CAAApoJ,GAAA,CACAzB,EAAA0nE,QAAA,CACAxnE,EAGAA,EAAA+jB,GAGA6R,IAMA,IAAAuxB,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,EACA9hL,CAAAA,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAtsQ,EAAAikB,EAAA/jB,EAAA,EAEA+gQ,GAAAh9O,EACA/jB,GAAA+jB,EACAojC,EAAA/pD,MAAA,EAAA2mB,GAEAojC,EAAA/pD,MAAA,QAAAuwQ,CAAA,CAEAxmN,EAAA/pD,MAAA,GACA+pD,EAAAjnC,IAAA,CAAA0uJ,EAEA,MAAAA,GACA,GAAAznH,KAAAA,EAAAqhH,KAAA,CAA4B,CAC5B,GAAAu4F,IAAAA,EAAA,MAAA4M,CAAA,CACA5pP,EAAA,EACA,GAEA6R,EAAA91B,CAAA,CAAAE,EAAA+jB,IAAA,CAEAojC,EAAAp1B,IAAA,EAAA6D,GACAuxB,EAAA/pD,MAAA,QACA+pD,CAAAA,EAAAp1B,IAAA,CAAA5yB,IAAA,EAAAmd,OAAA8B,YAAA,CAAAwX,EAAA,QACYA,GAAA7R,EAAAg9O,EAAA,CAQZ,GALA,IAAA55M,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,EACA9hL,CAAAA,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAtsQ,EAAAikB,EAAA/jB,EAAA,EAEA+gQ,GAAAh9O,EACA/jB,GAAA+jB,EACA6R,EAAA,MAAA+3O,CAAA,MAEAxmN,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAA5yB,IAAA,MACA,CACAgoD,EAAA/pD,MAAA,GACA+pD,EAAAjnC,IAAA,CAAA4O,EAEA,MAAAA,GACA,GAAAq4B,KAAAA,EAAAqhH,KAAA,CAA4B,CAC5B,GAAAu4F,IAAAA,EAAA,MAAA4M,CAAA,CACA5pP,EAAA,EACA,GACA6R,EAAA91B,CAAA,CAAAE,EAAA+jB,IAAA,CAEAojC,EAAAp1B,IAAA,EAAA6D,GACAuxB,EAAA/pD,MAAA,QACA+pD,CAAAA,EAAAp1B,IAAA,CAAAzB,OAAA,EAAAhU,OAAA8B,YAAA,CAAAwX,EAAA,QAEAA,GAAA7R,EAAAg9O,EAAA,CAMA,GALA,IAAA55M,EAAAqhH,KAAA,EAAArhH,EAAAA,EAAA8hL,IAAA,EACA9hL,CAAAA,EAAAilN,KAAA,CAAAtS,GAAA3yM,EAAAilN,KAAA,CAAAtsQ,EAAAikB,EAAA/jB,EAAA,EAEA+gQ,GAAAh9O,EACA/jB,GAAA+jB,EACA6R,EAAA,MAAA+3O,CAAA,MAEAxmN,EAAAp1B,IAAA,EACAo1B,CAAAA,EAAAp1B,IAAA,CAAAzB,OAAA,MACA,CACA62B,EAAAjnC,IAAA,CAAAoqP,EAEA,MAAAA,GACA,GAAAnjN,IAAAA,EAAAqhH,KAAA,CAA8B,CAE9B,KAAAzuE,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA,KAAA5yC,EAAA8hL,IAAA,EAAAk+B,IAAAhgN,CAAAA,MAAAA,EAAAilN,KAAA,GACAvT,EAAAn6P,GAAA,uBACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAEA,EACA3xK,EAAA,CAEA,GACAhoE,IAAA,GACAo1B,EAAAp1B,IAAA,CAAAsxO,IAAA,GAAA76F,KAAA,MACArhH,EAAAp1B,IAAA,CAAAhyB,IAAA,KAEA84P,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,GACAjlN,EAAAjnC,IAAA,CAAAre,GACA,WACA0oQ,GAEA,KAAAxwK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA8+J,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,CAAAH,GAAA9E,GAEAA,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAsqP,EAEA,MAAAA,GACA,GAAArjN,IAAAA,EAAAglN,QAAA,CASA,OAPAtT,EAAA+F,QAAA,CAAA0O,EACAzU,EAAA6F,SAAA,CAAAtnN,EACAyhN,EAAAwG,OAAA,CAAAr/P,EACA64P,EAAAuG,QAAA,CAAA2B,EACA55M,EAAAggN,IAAA,CAAAA,EACAhgN,EAAA4yC,IAAA,CAAAA,EAEA8vK,EACA,CACAhR,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,GACAjlN,EAAAjnC,IAAA,CAAAre,EAEA,MAAAA,GACA,GAAAiqB,IAAAuuO,IAAAvuO,IAAAwuO,GAAA,MAAAqT,CAAA,MAEAlD,GACA,GAAAtjN,EAAAk/C,IAAA,EAEA8gK,KAAAptK,EAAAA,EACAA,GAAAA,EAAAA,EAEA5yC,EAAAjnC,IAAA,CAAAqrP,GACA,MACA,KAEAxxK,EAAA,IACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAQA,OANA5yC,EAAAk/C,IAAA,CAAA8gK,EAAAA,EAGAptK,GAAA,EAGAotK,EAJAA,CAAAA,KAAA,IAKA,OAGAhgN,EAAAjnC,IAAA,CAAAwqP,GACA,WACA,EAKA,GAJAyC,GAAAhmN,GAGAA,EAAAjnC,IAAA,CAAA8qP,GACAl/O,IAAAwuO,GAAA,CAEA6M,KAAA,EACAptK,GAAA,EAEA,MAAA4zK,CAAA,CACA,KACA,MACA,EAGAxmN,EAAAjnC,IAAA,CAAA2qP,GACA,WACA,EACAhS,EAAAn6P,GAAA,sBACAyoD,EAAAjnC,IAAA,CAAAwrP,EACA,CAEAvE,KAAA,EACAptK,GAAA,EAEA,WACA2wK,GAMA,IAJAvD,KAAAptK,EAAAA,EACAA,GAAAA,EAAAA,EAGAA,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA,IAAAotK,MAAAA,CAAA,mBACAtO,EAAAn6P,GAAA,gCACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,GACAvkN,EAAA/pD,MAAA,CAAA+pQ,MAAAA,EAIAA,EAAA,EACAptK,EAAA,EAEA5yC,EAAAjnC,IAAA,CAAAyqP,GACA7+O,IAAAwuO,GAAA,MAAAqT,CAAA,MAEAhD,GACAxjN,EAAAjnC,IAAA,CAAA0qP,EAEA,MAAAA,GAEA,GADA7mP,EAAAojC,EAAA/pD,MAAA,CACA,CAGA,GAFA2mB,EAAAg9O,GAA6Bh9O,CAAAA,EAAAg9O,CAAA,EAC7Bh9O,EAAAqzB,GAA4BrzB,CAAAA,EAAAqzB,CAAA,EAC5BrzB,IAAAA,EAAA,MAAA4pP,CAA0C,CAE1Ct+O,EAAA9tB,GAAA,CAAAzB,EAAA0nE,QAAA,CAAAxnE,EAAAA,EAAA+jB,GAAAupP,GAEAvM,GAAAh9O,EACA/jB,GAAA+jB,EACAqzB,GAAArzB,EACAupP,GAAAvpP,EACAojC,EAAA/pD,MAAA,EAAA2mB,EACA,MACA,EAEA7D,IAAA,CAAAre,GACA,WACAgpQ,GAEA,KAAA9wK,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAkBA,GAhBA5yC,EAAAmlN,IAAA,EAAAnF,GAAAA,CAAA,MAEAA,KAAA,EACAptK,GAAA,EAEA5yC,EAAAolN,KAAA,EAAApF,GAAAA,CAAA,IAEAA,KAAA,EACAptK,GAAA,EAEA5yC,EAAAklN,KAAA,EAAAlF,GAAAA,CAAA,IAEAA,KAAA,EACAptK,GAAA,EAGA5yC,EAAAmlN,IAAA,MAAAnlN,EAAAolN,KAAA,KACA1T,EAAAn6P,GAAA,uCACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAGA3K,IAAA,GACA55M,EAAAjnC,IAAA,CAAA4qP,EAEA,MAAAA,GACA,KAAA3jN,EAAA45M,IAAA,CAAA55M,EAAAklN,KAAA,GAEA,KAAAtyK,EAAA,IACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAA+2C,IAAA,CAAAnmE,CAAA,CAAAovB,EAAA45M,IAAA,KAAAoG,EAAAA,EAEAA,KAAA,EACAptK,GAAA,CAEA,CACA,KAAA5yC,EAAA45M,IAAA,KACA55M,EAAA+2C,IAAA,CAAAnmE,CAAA,CAAAovB,EAAA45M,IAAA,OAaA,GAPA55M,EAAAugN,OAAA,CAAAvgN,EAAAqlN,MAAA,CAAArlN,EAAAygN,OAAA,GAGAxgQ,EAAA,CAAA2yF,KAAA5yC,EAAAygN,OAAA,EACAruL,EAAA+vL,GAAAC,GAAApiN,EAAA+2C,IAAA,MAAA/2C,EAAAugN,OAAA,GAAAvgN,EAAA2hN,IAAA,CAAA1hQ,GAAA+/C,EAAAygN,OAAA,CAAAxgQ,EAAA2yF,IAAA,CAGAxgB,EAAA,CACAs/K,EAAAn6P,GAAA,4BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAEA3K,IAAA,GACA55M,EAAAjnC,IAAA,CAAA6qP,EAEA,MAAAA,GACA,KAAA5jN,EAAiB45M,IAAA,CAAA55M,EAAAmlN,IAAA,CAAAnlN,EAAAolN,KAAA,GACjB,KAEAvD,EAAAxB,CADAA,EAAArgN,EAAAugN,OAAA,CAAAP,EAAA,IAAAhgN,EAAAygN,OAAA,QACA,GACAqB,EAAA,WAAAC,EAAA1B,MAAAA,GAGA,IAAAztK,CAAA,GANA,CAQA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CAEA,CACA,GAAAmvK,EAAA,GAEA/B,KAAA6B,EACAjvK,GAAAivK,EAEA7hN,EAAA+2C,IAAA,CAAA/2C,EAAA45M,IAAA,IAAAmI,MAEA,CACA,GAAAA,KAAAA,EAAA,CAGA,IADA1sQ,EAAAwsQ,EAAA,EACAjvK,EAAAv9F,GAAA,CACA,GAAAukQ,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAMA,GAHAotK,KAAA6B,EACAjvK,GAAAivK,EAEA7hN,IAAAA,EAAA45M,IAAA,EACAlI,EAAAn6P,GAAA,6BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EACAvkN,EAAA+2C,IAAA,CAAA/2C,EAAA45M,IAAuC,IACvCh9O,EAAA,EAAAojP,CAAAA,EAAAA,CAAA,EAEAA,KAAA,EACAptK,GAAA,CAEA,MACA,GAAAmvK,KAAAA,EAAA,CAGA,IADA1sQ,EAAAwsQ,EAAA,EACAjvK,EAAAv9F,GAAA,CACA,GAAAukQ,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAGAotK,KAAA6B,EACAjvK,GAAAivK,EAEApzO,EAAA,EACA7R,EAAA,EAAAojP,CAAAA,EAAAA,CAAA,EAEAA,KAAA,EACAptK,GAAA,CAEA,KACA,CAGA,IADAv9F,EAAAwsQ,EAAA,EACAjvK,EAAAv9F,GAAA,CACA,GAAAukQ,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAGAotK,KAAA6B,EACAjvK,GAAAivK,EAEApzO,EAAA,EACA7R,EAAA,GAAAojP,CAAAA,IAAAA,CAAA,EAEAA,KAAA,EACAptK,GAAA,CAEA,IACA5yC,EAAA45M,IAAA,CAAAh9O,EAAAojC,EAAAmlN,IAAA,CAAAnlN,EAAAolN,KAAA,EACA1T,EAAAn6P,GAAA,6BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,KACA3nP,KACAojC,EAAA+2C,IAAA,CAAA/2C,EAAA45M,IAAA,IAAAnrO,CAEA,EAGkC,GAAAuxB,EAAAjnC,IAAA,GAAAwrP,GAAA,MAIlC,GAAAvkN,IAAAA,EAAA+2C,IAAA,OACA26J,EAAAn6P,GAAA,wCACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,SAKAvkN,EAAAygN,OAAA,GAGAxgQ,EAAA,CAAA2yF,KAAA5yC,EAAAygN,OAAA,EACAruL,EAAA+vL,GAAAE,GAAAriN,EAAA+2C,IAAA,GAAA/2C,EAAAmlN,IAAA,CAAAnlN,EAAAugN,OAAA,GAAAvgN,EAAA2hN,IAAA,CAAA1hQ,GAGA+/C,EAAAygN,OAAA,CAAAxgQ,EAAA2yF,IAAA,CAGAxgB,EAAA,CACAs/K,EAAAn6P,GAAA,+BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,SAGAvkN,EAAA0gN,QAAA,GAGA1gN,EAAAwgN,QAAiB,CAAAxgN,EAAAslN,OAAA,CACjBrlQ,EAAA,CAAA2yF,KAAA5yC,EAAA0gN,QAAA,EACAtuL,EAAA+vL,GAAAG,GAAAtiN,EAAA+2C,IAAA,CAAA/2C,EAAAmlN,IAAA,CAAAnlN,EAAAolN,KAAA,CAAAplN,EAAAwgN,QAAA,GAAAxgN,EAAA2hN,IAAA,CAAA1hQ,GAGA+/C,EAAA0gN,QAAA,CAAAzgQ,EAAA2yF,IAAA,CAGAxgB,EAAA,CACAs/K,EAAAn6P,GAAA,yBACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,GAEAvkN,EAAAjnC,IAAA,CAAA8qP,GACAl/O,IAAAwuO,GAAA,MAAAqT,CAAA,MAEA3C,GACA7jN,EAAAjnC,IAAA,CAAA+qP,EAEA,MAAAA,GACA,GAAAlK,GAAA,GAAA3pN,GAAA,KAEAyhN,EAAA+F,QAAA,CAAA0O,EACAzU,EAAA6F,SAAA,CAAAtnN,EACAyhN,EAAAwG,OAAA,CAAAr/P,EACA64P,EAAAuG,QAAA,CAAA2B,EACA55M,EAAAggN,IAAA,CAAAA,EACAhgN,EAAA4yC,IAAA,CAAAA,EAEA6sK,GAAA/N,EAAAiO,GAEAwG,EAAAzU,EAAA+F,QAAA,CACAvvO,EAAAwpO,EAAAxpO,MAAA,CACA+nB,EAAAyhN,EAAA6F,SAAA,CACA1+P,EAAA64P,EAAAwG,OAAA,CACAv/P,EAAA+4P,EAAA/4P,KAAA,CACAihQ,EAAAlI,EAAAuG,QAAA,CACA+H,EAAAhgN,EAAAggN,IAAA,CACAptK,EAAA5yC,EAAA4yC,IAAA,CAGA5yC,EAAAjnC,IAAA,GAAAre,IACAslD,CAAAA,EAAAulN,IAAA,KAEA,MACA,IACAvlN,EAAAulN,IAAe,GAGf1D,EAAAxB,CADAA,EAAArgN,EAAAugN,OAAA,CAAAP,EAAA,IAAAhgN,EAAAygN,OAAA,QACA,GACAqB,EAAA,WAAAC,EAAA1B,MAAAA,GAGAwB,CAAAA,GAAAjvK,CAAA,GANA,CAQA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CAEA,CACA,GAAAkvK,GAAA,CAAAA,IAAAA,CAAA,MAIA,IAHAsE,EAAAvE,EACAwE,EAAAvE,EACAwE,EAAiBvE,EAIjBF,EAAAxB,CAFAA,EAAArgN,EAAAugN,OAAA,CAAA+F,EACA,EAAAtG,EAAA,IAAAoG,EAAAC,CAAA,MAAAD,CAAA,MACA,GACAtE,EAAA,WAAAC,EAAA1B,MAAAA,GAGA,GAAAwB,GAAAjvK,CAAA,GAPA,CASA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CAEA,CAEAotK,KAAAoG,EACAxzK,GAAAwzK,EAEApmN,EAAAulN,IAAA,EAAAa,CACA,IAEApG,KAAA6B,EACAjvK,GAAAivK,EAEA7hN,EAAAulN,IAAA,EAAA1D,EACA7hN,EAAA/pD,MAAA,CAAA8rQ,EACAD,IAAAA,EAAA,CAIA9hN,EAAAjnC,IAAA,CAAAorP,GACA,MACA,GACArC,GAAAA,EAAA,CAEA9hN,EAAAulN,IAAA,IACAvlN,EAAAjnC,IAAA,CAAAre,GACA,MACA,GACAonQ,GAAAA,EAAA,CACApQ,EAAAn6P,GAAA,+BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EACA/hH,KAAA,CAAAs/G,GAAAA,EACA9hN,EAAAjnC,IAAA,CAAAgrP,EAEA,MAAAA,GACA,GAAA/jN,EAAAwiG,KAAA,EAGA,IADAntJ,EAAA2qD,EAAAwiG,KAAA,CACA5vD,EAAAv9F,GAAA,CACA,GAAAukQ,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAA/pD,MAAA,EAAA+pQ,EAAA,IAAAhgN,EAAAwiG,KAAA,IAEAw9G,KAAAhgN,EAAAwiG,KAAA,CACA5vD,GAAA5yC,EAAAwiG,KAAA,CAEAxiG,EAAAulN,IAAA,EAAAvlN,EAAAwiG,KAAA,CACA,EAEAgjH,GAAA,CAAAxlN,EAAA/pD,MAAA,CACA+pD,EAAAjnC,IAAA,CAAAirP,EAEA,MAAAA,GACA,KAEAnC,EAAAxB,CADAA,EAAArgN,EAAAwgN,QAAA,CAAAR,EAAA,IAAAhgN,EAAA0gN,QAAA,QACA,GACAoB,EAAA,WAAAC,EAAA1B,MAAAA,GAGA,IAAAztK,CAAA,GANA,CAQA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CAEA,CACA,IAAAkvK,IAAAA,CAAA,MAIA,IAHAsE,EAAAvE,EACAwE,EAAAvE,EACAwE,EAAiBvE,EAIjBF,EAAAxB,CAFAA,EAAArgN,EAAAwgN,QAAA,CAAA8F,EACA,EAAAtG,EAAA,IAAAoG,EAAAC,CAAA,MAAAD,CAAA,MACA,GACAtE,EAAA,WAAAC,EAAA1B,MAAAA,GAGA,GAAAwB,GAAAjvK,CAAA,GAPA,CASA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CAEA,CAEAotK,KAAAoG,EACAxzK,GAAAwzK,EAEApmN,EAAAulN,IAAA,EAAAa,CACA,IAEApG,KAAA6B,EACAjvK,GAAAivK,EAEA7hN,EAAAulN,IAAA,EAAA1D,EACAC,GAAAA,EAAA,CACApQ,EAAAn6P,GAAA,yBACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EACAv2P,MAAA,CAAA+zP,EACA/hN,EAAAwiG,KAAA,IAAAs/G,EACA9hN,EAAAjnC,IAAA,CAAAkrP,EAEA,MAAAA,GACA,GAAAjkN,EAAAwiG,KAAA,EAGA,IADAntJ,EAAA2qD,EAAAwiG,KAAA,CACA5vD,EAAAv9F,GAAA,CACA,GAAAukQ,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA5yC,EAAAhyC,MAAA,EAAAgyP,EAAA,IAAAhgN,EAAAwiG,KAAA,IAEAw9G,KAAAhgN,EAAAwiG,KAAA,CACA5vD,GAAA5yC,EAAAwiG,KAAA,CAEAxiG,EAAAulN,IAAA,EAAAvlN,EAAAwiG,KAAA,CACA,GAEAxiG,EAAAhyC,MAAA,CAAAgyC,EAAA4/M,IAAA,EACAlO,EAAAn6P,GAAA,iCACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAGAxrP,IAAA,CAAAmrP,EAEA,MAAAA,GACA,GAAAj0N,IAAAA,EAAA,MAAAu2N,CAAA,CAEA,GADA5pP,EAAA+iP,EAAA1vN,EACA+P,EAAAhyC,MAAA,CAAA4O,EAAA,CAEA,GAAAA,CADAA,EAAAojC,EAAAhyC,MAAA,CAAA4O,CAAA,EACAojC,EAAA6/M,KAAA,EACA7/M,EAAA6gN,IAAA,EACAnP,EAAAn6P,GAAA,iCACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MAiBA,EACAvkN,EAAA8/M,KAAA,EACAljP,GAAAojC,EAAA8/M,KAAA,CACA1sP,EAAA4sC,EAAAg3M,KAAA,CAAAp6O,GAGAxJ,EAAA4sC,EAAA8/M,KAAA,CAAAljP,EAEAA,EAAAojC,EAAA/pD,MAAA,EAAA2mB,CAAAA,EAAAojC,EAAA/pD,MAAA,EACAqqQ,EAAAtgN,EAAA58C,MAAA,MAGAk9P,EAAAp4O,EACA9U,EAAA+yP,EAAAnmN,EAAAhyC,MAAA,CACA4O,EAAAojC,EAAA/pD,MAAA,CAEA2mB,EAAAqzB,GAAArzB,CAAAA,EAAAqzB,CAAA,EACAA,GAAArzB,EACAojC,EAAA/pD,MAAA,EAAA2mB,EACA,GACUsL,CAAA,CAAAi+O,IAAA,CAAA7F,CAAA,CAAAltP,IAAA,OACV,EAAAwJ,EAAA,CACA,IAAAojC,EAAA/pD,MAAA,EAAA+pD,CAAAA,EAAAjnC,IAAA,CAAA+qP,EAAA,EACA,WACAK,GACA,GAAAl0N,IAAAA,EAAA,MAAAu2N,CAAA,CACAt+O,CAAA,CAAAi+O,IAAA,CAAAnmN,EAAA/pD,MAAA,CACAg6C,IACA+P,EAAAjnC,IAAA,CAAA+qP,GACA,WACAM,GACA,GAAApkN,EAAA8hL,IAAA,EAEA,KAAAlvI,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IAEAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAaA,GAXA+sK,GAAA1vN,EACAyhN,EAAAgG,SAAA,EAAAiI,EACA3/M,EAAAwwF,KAAA,EAAAmvH,EACA,EAAA3/M,EAAA8hL,IAAA,EAAA69B,GACAjO,CAAAA,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,CACAjlN,EAAAqhH,KAAA,CAAAsxF,GAAA3yM,EAAAilN,KAAA,CAAA/8O,EAAAy3O,EAAAwG,EAAAxG,GAAArN,GAAAtyM,EAAAilN,KAAA,CAAA/8O,EAAAy3O,EAAAwG,EAAAxG,EAAA,EAIAA,EAAA1vN,EAEA,EAAA+P,EAAA8hL,IAAA,GAAA9hL,EAAAqhH,KAAA,CAAA2+F,EAAA8E,GAAA9E,EAAA,IAAAhgN,EAAAilN,KAAA,EACAvT,EAAAn6P,GAAA,wBACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAEA,EACA3xK,EAAA,CAGA,GACA75E,IAAA,CAAAsrP,EAEA,MAAAA,GACA,GAAArkN,EAAA8hL,IAAA,EAAA9hL,EAAAqhH,KAAA,EAEA,KAAAzuE,EAAA,KACA,GAAAgnK,IAAAA,EAAA,MAAA4M,CAAA,CACA5M,IACAoG,GAAArnQ,CAAA,CAAAE,IAAA,EAAA+5F,EACAA,GAAA,CACA,CAEA,KAAA5yC,EAAA8hL,IAAA,EAAAk+B,IAAAhgN,CAAAA,WAAAA,EAAAwwF,KAAA,GACAkhH,EAAAn6P,GAAA,0BACAyoD,EAAAjnC,IAAA,CAAAwrP,GACA,MACA,EAEA,EACA3xK,EAAA,CAGA,GACA75E,IAAA,CAAAurP,EAEA,MAAAA,GACAlyL,EAAAqwL,GACA,MAAA+D,CAAA,MACAjC,GACAnyL,EAAAwwL,GACA,MAAA4D,CAAA,MACAhC,GACA,OAAA3B,EACA,SAGA,OAAAF,EACA,CAwCA,OA3BAjR,EAAA+F,QAAA,CAAA0O,EACAzU,EAAA6F,SAAA,CAAAtnN,EACAyhN,EAAAwG,OAAA,CAAAr/P,EACA64P,EAAAuG,QAAA,CAAA2B,EACA55M,EAAAggN,IAAA,CAAAA,EACAhgN,EAAA4yC,IAAA,CAAAA,EAGA5yC,CAAAA,EAAAg3M,KAAA,EAAA2I,IAAAjO,EAAA6F,SAAA,EAAAv3M,EAAAjnC,IAAA,CAAAwrP,IACAvkN,CAAAA,EAAAjnC,IAAA,CAAAqrP,IAAAz/O,IAAA49O,EAAA,IACA0D,GAAAvU,EAAAA,EAAAxpO,MAAA,CAAAwpO,EAAA+F,QAAA,CAAAkI,EAAAjO,EAAA6F,SAAA,EAEAmI,GAAAhO,EAAAuG,QAAA,CACA0H,GAAAjO,EAAA6F,SAAA,CACA7F,EAAAyG,QAAA,EAAAuH,EACAhO,EAAAgG,SAAA,EAAAiI,EACA3/M,EAAAwwF,KAAA,EAAAmvH,EACA,EAAA3/M,EAAA8hL,IAAA,EAAA69B,GACAjO,CAAAA,EAAAW,KAAA,CAAAryM,EAAAilN,KAAA,CACAjlN,EAAAqhH,KAAA,CAAAsxF,GAAA3yM,EAAAilN,KAAA,CAAA/8O,EAAAy3O,EAAAjO,EAAA+F,QAAA,CAAAkI,GAAArN,GAAAtyM,EAAAilN,KAAA,CAAA/8O,EAAAy3O,EAAAjO,EAAA+F,QAAA,CAAAkI,EAAA,EAEAjO,EAAAC,SAAA,CAAA3xM,EAAA4yC,IAAA,CAAA5yC,CAAAA,EAAAk/C,IAAA,OACAl/C,CAAAA,EAAAjnC,IAAA,GAAAre,GAAA,OACAslD,CAAAA,EAAAjnC,IAAA,GAAA8qP,IAAA7jN,EAAAjnC,IAAA,GAAAyqP,GAAA,OACA,KAAA9D,GAAAC,IAAAA,GAAAh7O,IAAA49O,EAAA,GAAAnwL,IAAAowL,IACApwL,CAAAA,EAAAuhL,EAAA,EAEAvhL,CAAA,EAGAu0L,GAAA,IAGA,GAAAlB,GAAA/T,GACA,OAAAiR,EAAA,CAGA,IAAA3iN,EAAA0xM,EAAA1xM,KAAA,CAKA,OAJAA,EAAA58C,MAAA,EACA48C,CAAAA,EAAA58C,MAAA,OAEAsuP,EAAA1xM,KAAA,MACAwiN,EAAA,EAGAoE,GAAA,CAAAlV,EAAA9mO,IAAA,CAIA,GAAA66O,GAAA/T,GAAA,OAAAiR,EAAA,CACA,IAAA3iN,EAAA0xM,EAAA1xM,KAAA,OAAgC,CAAAA,EAAAA,EAAA8hL,IAAA,KAAA6gC,IAIhC3iN,EAAAp1B,IAAA,CAAAA,EACAA,EAAAhyB,IAAA,IACA4pQ,GANgC,EAUhCqE,GAAA,CAAAnV,EAAA+K,IAAA,KAGAz8M,EACA8mN,EAJA,IAAApK,EAAAD,EAAAxmQ,MAAA,QAQA,GAAAy7P,IAGA1xM,IAAAA,CAHAA,EAAA0xM,EAAA1xM,KAAA,EAGA8hL,IAAA,EAAA9hL,EAAAjnC,IAAA,GAAAsqP,GAHAV,GAQA3iN,EAAAjnC,IAAgB,GAAAsqP,IAIhByD,CADAA,EAAAxU,GAFAwU,EAAA,EAEArK,EAAAC,EAAA,MACA18M,EAAAilN,KAAA,CACArC,GAKAqD,GAAAvU,EAAA+K,EAAAC,EAAAA,IAEA18M,EAAAjnC,IAAA,CAAAyrP,GACA3B,KAEA7iN,EAAAglN,QAAA,GAEAxC,GAzBA,EAoDA,IAAAuE,GAAA,CACApB,aAxBAA,GAyBAC,cAxBAA,GAyBAF,iBAxBAA,GAyBAI,YAxBAA,GAyBAD,aAxBAA,GAyBAmB,QAxBAd,GAyBAS,WAxBAA,GAyBAC,iBAxBAA,GAyBAC,qBAxBAA,GAyBAI,YAzBA,oCAyBA,EAyDAC,GAnCA,WAEA,KAAAjvP,IAAA,GAEA,KAAAo0L,IAAA,GAEA,KAAAo6D,MAAA,GAEA,KAAAtK,EAAA,GAEA,KAAA35G,KAAA,MAEA,KAAAkkH,SAAA,GAWA,KAAA1uQ,IAAA,IAIA,KAAAmxB,OAAA,IAIA,KAAA+yO,IAAA,GAEA,KAAAtjQ,IAAA,KAIA,IAAAoF,GAAAlG,OAAA0L,SAAA,CAAAxF,QAAA,CAMA,CACA60P,WAAAA,EAAA,CAAAI,SAAAA,EAAA,CACEG,KAAAA,EAAA,CAAAC,aAAAA,EAAA,CAAAC,YAAAA,EAAA,CAAAE,eAAAA,EAAA,CAAAC,aAAAA,EAAA,CAAAC,YAAAA,EAAA,EAAAd,GAmFF,SAAAuU,GAAA9tQ,CAAA,EACA,KAAAA,OAAA,CAAAw8B,GAAA99B,MAAA,EACAyzI,UAAA,MACAowH,WAAA,GACG79L,GAAA,EAAe,EAAA1kE,GAAA,IAElB,IAAA+kQ,EAAA,KAAA/kQ,OAAA,CAKA+kQ,EAAAnrO,GAAA,EAAAmrO,EAAAxC,UAAA,KAAAwC,EAAAxC,UAAA,MACAwC,EAAAxC,UAAA,EAAAwC,EAAAxC,UAAgC,CAChC,IAAAwC,EAAAxC,UAAA,EAAAwC,CAAAA,EAAAxC,UAAA,OAIAwC,EAAAxC,UAAA,KAAAwC,EAAAxC,UAAA,KACA,CAAAviQ,CAAAA,GAAAA,EAAAuiQ,UAAA,GACAwC,CAAAA,EAAAxC,UAAA,MAKAwC,EAAAxC,UAAA,KAAAwC,EAAAxC,UAAA,KAGA,CAAAwC,GAAAA,EAAAxC,UAAA,MACAwC,CAAAA,EAAAxC,UAAA,MAIA,KAAAn8P,GAAA,GACA,KAAAlI,GAAA,IACA,KAAA+mQ,KAAA,IAAwB,KAAA5oQ,MAAA,IAGxB,KAAAg8P,IAAA,KAAAkM,GAAA,KAAAlM,IAAA,CAAA6F,SAAA,GAGA,IAAAx0P,EAAAgkQ,GAAAlB,YAAA,CACA,KAAAnU,IAAA,CACA0M,EAAAxC,UAAA,EAGA,GAAA74P,IAAAqwP,KAGA,KAAAx9O,MAAA,KAAAsxP,GAEAH,GAAAH,gBAAA,MAAAlV,IAAA,MAAA97O,MAAA,EAIAwoP,EAAA3B,UAAA,GAEA,iBAAA2B,EAAA3B,UAAA,CACM2B,EAAA3B,UAAA,CAAAzpO,GAAAqqO,UAAA,CAAAe,EAAA3B,UAAA,EACN,yBAAAz+P,GAAA0F,IAAA,CAAA06P,EAAA3B,UAAA,GACA2B,CAAAA,EAAA3B,UAAA,KAAAl7P,WAAA68P,EAAA3B,UAAA,GAEA2B,EAAAnrO,GAAA,EAEAlwB,CADAA,EAAAgkQ,GAAAF,oBAAA,MAAAnV,IAAA,CAAA0M,EAAA3B,UAAA,KACArJ,KAjBA,YAAAz5H,EAAA,CAAA52H,EAAA,EAuOA,SAAAqkQ,GAAAzuQ,CAAA,CAAAU,CAAA,MAAAguQ,EAAA,IAAAF,GAAA9tQ,GAKA,GAHAguQ,EAAA9yQ,IAAA,CAAAoE,GAGA0uQ,EAAA5nQ,GAAA,OAAA4nQ,EAAA9vQ,GAAA,EAAAoiI,EAAA,CAAA0tI,EAAA5nQ,GAAA,EAGA,OAAA4nQ,EAAAruQ,MAAA,CAYA,SAAAsuQ,GAAA3uQ,CAAA,CAAAU,CAAA,EAGA,MADAA,CADAA,EAAAA,GAAA,IACA45B,GAAA,IACAm0O,GAAAzuQ,EAAAU,EAAA,CA7MA8tQ,GAAA3jQ,SAAA,CAAAjP,IAAA,UAAAkC,CAAA,CAAAooQ,CAAA,MAGA97P,EAAA+7P,EAAAyI,EAFA,IAAA7V,EAAA,KAAAA,IAAA,CACAlmH,EAAA,KAAAnyI,OAAA,CAAAmyI,SAAA,CACAixH,EAAA,KAAApjQ,OAAA,CAAAojQ,UAAA,CAEA,QAAA6B,KAAA,UAgBA,IAbAQ,EAAAD,IAAA,EAAAA,EAAAA,EAAAA,CAAA,IAAAA,EAAA5L,GAAAJ,EAAA,CAIA70P,yBAAAA,GAAA0F,IAAA,CAAAjN,GACIi7P,EAAA/4P,KAAA,KAAA4I,WAAA9K,GAEJi7P,EAAA/4P,KAAA,CAAAlC,EAGAi7P,EAAAwG,OAAA,GAAAxG,EAAAuG,QAAA,CAAAvG,EAAA/4P,KAAA,CAAA1C,MAAA,GAGA,CAqBA,IApBA,IAAAy7P,EAAA6F,SAAA,GACA7F,EAAAxpO,MAAA,KAAA3mB,WAAAiqI,GACAkmH,EAAA+F,QAAA,GACA/F,EAAA6F,SAAA,CAAA/rH,GAEAzoI,CAAAA,EAAAgkQ,GAAAC,OAAA,CAAAtV,EAAAoN,EAAA,IAGAxL,IAAAmJ,IAGA15P,CAHAA,EAAAgkQ,GAAAF,oBAAA,CAAAnV,EAAA+K,EAAA,IAGArJ,GACQrwP,EAAAgkQ,GAAAC,OAAA,CAAAtV,EAAAoN,GACR/7P,IAAA0wP,IAEA1wP,CAAAA,EAAAuwP,EAAA,GAKA5B,EAAAuG,QAAA,IACAl1P,IAAAswP,IACA3B,EAAA1xM,KAAA,CAAA8hL,IAAA,IACArrO,IAAAA,CAAA,CAAAi7P,EAAAwG,OAAA,GAEA6O,GAAApB,YAAA,CAAAjU,GACA3uP,EAAAgkQ,GAAAC,OAAA,CAAAtV,EAAAoN,GAGA,OAAA/7P,GACA,KAAAywP,GACA,KAAAC,GACA,KAAAH,GACA,KAAAI,GAGA,OAFA,KAAAsL,KAAA,CAAAj8P,GACA,KAAAu7P,KAAA,IACA,GAOA,GAHAiJ,EAAA7V,EAAA6F,SAAA,CAGA7F,EAAA+F,QAAA,EAAA/F,CAAAA,IAAAA,EAAA6F,SAAA,EAAAx0P,IAAAswP,EAAA,GAEA,mBAAAh6P,OAAA,CAAA0kE,EAAA,EAEA,IAAAypM,EAAAx0O,GAAAy0O,UAAA,CAAA/V,EAAAxpO,MAAA,CAAAwpO,EAAA+F,QAAA,EAGAvlI,EAAAw/H,EAAA+F,QAAA,CAAA+P,EAAAE,EAAA10O,GAAA20O,UAAA,CAAAjW,EAAAxpO,MAAA,CAAAs/O,EAIA9V,CAAAA,EAAA+F,QAAA,CAAAvlI,EACAw/H,EAAA6F,SAAA,CAAA/rH,EAAAtZ,EAAAA,GAAAw/H,EAAAxpO,MAAA,CAAA9tB,GAAA,CAAAs3P,EAAAxpO,MAAA,CAAAm4C,QAAA,CAAAmnM,EAAAA,EAAAt1I,GAAA,GAEA,KAAA6sI,MAAA,CAAA2I,EAGA,MACA,KAAA3I,MAAA,CAAArN,EAAAxpO,MAAA,CAAAjyB,MAAA,GAAAy7P,EAAA+F,QAAA,CAAA/F,EAAAxpO,MAAA,CAAAwpO,EAAAxpO,MAAA,CAAAm4C,QAAA,GAAAqxL,EAAA+F,QAAA,EACA,CACA,GAGA10P,IAAAqwP,IAAAmU,IAAAA,GAIA,GAAAxkQ,IAAAswP,GAIA,OAHAtwP,EAAAgkQ,GAAAJ,UAAA,MAAAjV,IAAA,EACA,KAAAsN,KAAA,CAAAj8P,GACA,KAAAu7P,KAAA,IACA,GAGA,GAAA5M,IAAAA,EAAAuG,QAAA,OAXA,CAcA,UAYAkP,GAAA3jQ,SAAA,CAAAu7P,MAAA,UAAAviN,CAAA,EACA,KAAA9mD,MAAA,CAAAnB,IAAA,CAAAioD,EAAA,EAaA2qN,GAAA3jQ,SAAA,CAAAw7P,KAAA,UAAAj8P,CAAA,EAEAA,IAAAqwP,KACA,gBAAA/5P,OAAA,CAAA0kE,EAAA,CACM,KAAA/kE,MAAA,MAAAtD,MAAA,CAAA8B,IAAA,KAEN,KAAAwB,MAAA,CAAA68B,GAAAopO,aAAA,MAAAvpQ,MAAA,GAGA,KAAAA,MAAA,IACA,KAAA+J,GAAA,CAAAsD,EACA,KAAAxL,GAAA,MAAAm6P,IAAA,CAAAn6P,GAAA,EAiFA,IAAAqwQ,GAAAR,GAEAS,GAAAT,GAGAU,GAAA,CACAC,QAPAZ,GAQAH,QAAAY,GACAI,WAPAV,GAQAW,OAAAJ,GACAvI,UARA1M,EAQA,EAE6C,IAAAwM,QAAAA,EAAA,CAAAtC,QAAAA,EAAA,CAAAuC,WAAAA,EAAA,CAAAhB,KAAAA,EAAA,EAAAc,GAEE,CAAA4I,QAAAA,EAAA,CAAAf,QAAAA,EAAA,CAAAgB,WAAAA,EAAA,CAAAC,OAAAA,EAAA,EAAAH,GAU/C,IAAApd,GAAAsc,EAgByO,gBAAA3f,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eC5sNzO,SAAA+qH,EAAA5qH,CAAA,CAAAssC,CAAA,CAAAC,CAAA,EACA,OAAAD,GAAAtsC,GAAAA,GAAAusC,CAAA,CAOA,SAAA8mO,EAAAxzN,CAAA,EACA,GAAAA,KAAA57C,IAAA47C,EAAA,SACA,GAAAA,IAAA58C,OAAA48C,GAAA,OAAAA,CAAA,OACA39C,UAAA,4CAOA,SAAAoxQ,EAAArsQ,CAAA,EAeA,IAZA,IAAA/B,EAAAob,OAAArZ,GAGAzG,EAAA0E,EAAA9D,MAAA,CAGAoF,EAAA,EAGA2rD,EAAA,GAGA3rD,EAAAhG,GAAA,CAGA,IAAAynD,EAAA/iD,EAAA2rB,UAAA,CAAArqB,GAMA,GAAAyhD,EAAA,OAAAA,EAAA,MAEAkK,EAAAzyD,IAAA,CAAAuoD,QAIA,UAAAA,GAAAA,GAAA,MAEAkK,EAAAzyD,IAAA,aAIA,UAAAuoD,GAAAA,GAAA,OAGA,GAAAzhD,IAAAhG,EAAA,EACA2xD,EAAAzyD,IAAA,YAGA,CACA,IAAAI,EAAAmH,EAAA4pB,UAAA,CAAArqB,EAAA,GAIA,UAAA1G,GAAAA,GAAA,OACA,IAAAE,EAAAioD,KAAAA,EAGA/uC,EAAApZ,KAAAA,EAIAqyD,EAAAzyD,IAAA,OAAAM,CAAAA,GAAA,IAAAkZ,GAIA1S,GAAA,OAMA2rD,EAAAzyD,IAAA,OACA,CACA,IAIA,EAIA,OAAAyyD,CAAA,CAOA,SAAAohN,EAAAC,CAAA,EAEA,QADAtuQ,EAAA,GACAsB,EAAA,EAAAA,EAAAgtQ,EAAApyQ,MAAA,GAAAoF,EAAA,CACA,IAAAitQ,EAAAD,CAAA,CAAAhtQ,EAAA,CACAitQ,GAAA,MACMvuQ,GAAAob,OAAA8B,YAAA,CAAAqxP,IAENA,GAAA,MACAvuQ,GAAAob,OAAA8B,YAAA,EAAAqxP,GAAA,UACA,CAAAA,KAAAA,CAAA,SAEA,CACA,OAAAvuQ,CAAA,CD2lNyOrF,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,+BAAAsxD,CAAA,gCAAAC,CAAA,CC5tN5N,GAiJb,IAAAuiN,EAAA,GAUA,SAAAC,EAAazqL,CAAA,EAEb,KAAAA,MAAA,IAAA1nF,KAAA,CAAAqN,IAAA,CAAAq6E,EAAA,CAGAyqL,EAAAhlQ,SAAA,EAIAilQ,YAAA,WACG,YAAA1qL,MAAA,CAAA9nF,MAAA,EAWHyhG,KAAA,kBACA,KAAA3Z,MAAA,CAAA9nF,MAAA,CAEI,KAAA8nF,MAAA,CAAAltE,KAAA,GADJ03P,CAAA,EAWA1kP,QAAA,SAAAmD,CAAA,EACA,GAAAnxB,MAAA6D,OAAA,CAAAstB,GAEA,IADA,IAAA+2D,EAAA/2D,EACA+2D,EAAA9nF,MAAA,EACM,KAAA8nF,MAAA,CAAAl9B,OAAA,CAAAk9B,EAAAl1B,GAAA,SAEN,KAAAk1B,MAAA,CAAAl9B,OAAA,CAAA75B,EACG,EAUHzyB,KAAA,SAAAyyB,CAAA,EACA,GAAAnxB,MAAA6D,OAAA,CAAAstB,GAEA,IADA,IAAA+2D,EAAA/2D,EACA+2D,EAAA9nF,MAAA,EACM,KAAA8nF,MAAA,CAAAxpF,IAAA,CAAAwpF,EAAAltE,KAAA,SAEN,KAAAktE,MAAA,CAAAxpF,IAAA,CAAAyyB,EACA,CACA,EASA,IAAA+nG,EAAA,GAQA,SAAA25I,EAAA9kF,CAAA,CAAA+kF,CAAA,EACA,GAAA/kF,EACA,MAAA7sL,UAAA,iBACA,OAAA4xQ,GAAA,MA8BA,IAAAC,EAAA,QAWA,SAAA7iN,EAAA7nD,CAAA,CAAA7E,CAAA,EACA,qBAAA0sD,CAAA,EACA,WAAAA,EAAA7nD,EAAA7E,EACA,CAEA,GAAA6E,CADAA,EAAAA,KAAApF,IAAAoF,EAAAiX,OAAAjX,GAAAmX,WAAA,GAAAuzP,CAAA,IACAA,EACA,+DACAvvQ,EAAA6uQ,EAAA7uQ,GAIA,KAAAwvQ,UAAA,IAEA,KAAAC,QAAA,IAEA,KAAAC,QAAA,KAAsB,CAEtB,KAAAC,MAAA,CAAA91L,QAAsB75E,EAAS,OAC/B,KAAA4vQ,UAAA,CAAA/1L,QAAA75E,EAAA,WAGAvB,OAAA8L,cAAA,iBAAwC,CAAAnM,MAAA,UACxCK,OAAA8L,cAAA,eAAAnM,MAA4C,KAAAuxQ,MAAA,GAC5ClxQ,OAAA8L,cAAA,mBAAAnM,MAAA,KAAAwxQ,UAAA,GA6FA,SAAAjjN,EAAA9nD,CAAA,CAAA7E,CAAA,EACA,qBAAA2sD,CAAA,EACA,WAAAA,EAAA9nD,EAAA7E,EAAA,CAEA,GAAA6E,CADAA,EAAAA,KAAApF,IAAAoF,EAAAiX,OAAAjX,GAAAmX,WAAA,GAAAuzP,CAAA,IACAA,EACA,+DACAvvQ,EAAA6uQ,EAAA7uQ,GAIA,KAAAwvQ,UAAA,IAEA,KAAAK,QAAA,MACmB,KAAA9mC,QAAA,EAAAx+C,MAAA1wG,QAAA75E,EAAA,QAGnBvB,OAAA8L,cAAA,kBAAAnM,MAAA,UA4DA,SAAA0xQ,EAAA9vQ,CAAA,MAAAuqL,EAAAvqL,EAAAuqL,KAAA,CAOyBwlF,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,IAAAC,EAAA,GAUzB,MAAAlhM,OAAA,UAAAmhM,CAAA,CAAAC,CAAA,EAGA,GAAAA,IAAAnB,GAAAe,IAAAA,EAEA,OADAA,EAAA,EACAZ,EAAA9kF,EAAA,CAIA,GAAA8lF,IAAAnB,EAAA,OAAAx5I,CAAA,CAGA,GAAAu6I,IAAAA,EAAA,CAIA,GAAA7pJ,EAAAiqJ,EAAA,OAEA,OAAAA,CAAA,CAIA,GAAAjqJ,EAAAiqJ,EAAA,SAGAJ,EAAA,EACAF,EAAAM,EAAA,SAIA,GAAAjqJ,EAAAiqJ,EAAA,SAEA,MAAAA,GACAH,CAAAA,EAAA,KAEA,MAAAG,GACAF,CAAAA,EAAA,KAGAF,EAAA,EACAF,EAAAM,EAAA,SAIA,IAAAjqJ,EAAAiqJ,EAAA,SAgBA,OAAAhB,EAAA9kF,EAAA,CAdA,MAAA8lF,GACAH,CAAAA,EAAA,KAEA,MAAAG,GACAF,CAAAA,EAAA,KAGAF,EAAA,EACAF,EAAAM,EAAA,IAMA,OAMAN,IAAA,EAAAE,EACA,QAIA,CAAA7pJ,EAAAiqJ,EAAAH,EAAAC,GAcA,OARAJ,EAAAE,EAAAD,EAAA,EACAE,EAAA,IAAAC,EAAA,IAGAC,EAAA5lP,OAAA,CAAA6lP,GAIAhB,EAAA9kF,EAAA,CAgBA,GAXA2lF,EAAA,IAAAC,EAAA,IAMAH,GAAA,EAAAD,GAAA,SAAAE,CAAAA,EAAAD,CAAA,EAKAA,IAAAC,EAAA,YAGA,IAAAK,EAAAP,EAQA,OAJAA,EAAAE,EAAAD,EAAA,EAIAM,CACA,EAQA,SAAAC,EAAAvwQ,CAAA,EACAA,EAAAuqL,KAAA,CAMA,KAAAt7G,OAAA,UAAAmhM,CAAA,CAAAE,CAAA,EAEA,GAAAA,IAAApB,EAAA,OAAAx5I,CAAA,CAKA,GAAAtP,EAAAkqJ,EAAA,cAAAA,CAAA,CAMAlqJ,EAAAkqJ,EAAA,WACAriP,EAAA,EACAtZ,EAAA,KAGAyxG,EAAAkqJ,EAAA,aACAriP,EAAA,EACAtZ,EAAA,KAGAyxG,EAAAkqJ,EAAA,iBACAriP,EAAA,EACAtZ,EAAA,KAOA,IAHA,IAlBAsZ,EAAAtZ,EAkBAoL,EAAA,EAAAuwP,GAAA,EAAAriP,CAAA,EAAAtZ,EAAA,CAGAsZ,EAAA,IAGA,IAAA+mJ,EAAAs7F,GAAA,EAAAriP,CAAAA,EAAA,GAGAlO,EAAA7kB,IAAA,KAAA85K,GAAAA,GAIA/mJ,GAAA,EAIA,OAAAlO,CACA,EAzWA2sC,EAAAviD,SAAA,EAMAsK,OAAA,SAAAnV,CAAA,CAAAU,CAAA,EAGM+f,EADN,iBAAAzgB,GAAAA,aAAAoc,YACM,IAAAxT,WAAA5I,GACN,iBAAAA,GAAA,WAAAA,GACAA,EAAAye,MAAA,YAAArC,YACA,IAAAxT,WAAA5I,EAAAye,MAAA,CACAze,EAAAi6D,UAAA,CACMj6D,EAAAwe,UAAA,EAEN,IAAA5V,WAAA,GAEAlI,EAAA6uQ,EAAA7uQ,GAGA,KAAAwvQ,UAAA,GACA,KAAAE,QAAA,KAAAI,EAAA,CAAAvlF,MAAA,KAAAolF,MAAA,GACA,KAAAF,QAAA,KACA,KAAAD,UAAA,CAAA31L,QAAA75E,EAAA,QAUA,IARA,IAnBA+f,EAwBApgB,EALA6wQ,EAAA,IAAArB,EAAApvP,GAEAivP,EAAA,GAQA,CAFAwB,EAAApB,WAAA,IAEAzvQ,CADAA,EAAA,KAAA+vQ,QAAA,CAAAzgM,OAAA,CAAAuhM,EAAAA,EAAAnyK,IAAA,OACAq3B,GAEA,OAAA/1H,IAEAnD,MAAA6D,OAAA,CAAAV,GACAqvQ,EAAA9zQ,IAAA,CAAAuB,KAAA,CAAAuyQ,EAAArvQ,GAEAqvQ,EAAA9zQ,IAAA,CAAAyE,IAEA,SAAA6vQ,UAAA,EACA,GAEA,GAAA7vQ,CADAA,EAAA,KAAA+vQ,QAAA,CAAAzgM,OAAA,CAAAuhM,EAAAA,EAAAnyK,IAAA,OACAq3B,EACA,MACA,GAAA/1H,IAAA,GAAAA,EACA,SACAnD,MAAA6D,OAAA,CAAAV,GACAqvQ,EAAA9zQ,IAAA,CAAAuB,KAAA,CAAAuyQ,EAAArvQ,GAEQqvQ,EAAA9zQ,IAAA,CAAAyE,EACR,QAAA6wQ,EAAApB,WAAA,IACA,KAAAM,QAAA,aAGAV,EAAApyQ,MAAA,EAIA,eAAAgf,OAAA,MAAA/W,QAAA,GACA,KAAA+qQ,UAAA,OAAAH,QAAA,GAEAT,QAAAA,CAAA,KACA,KAAAS,QAAA,IACUT,EAAAx3P,KAAA,IAIV,KAAAi4P,QAAA,KAKAV,EAAAC,EACA,GA8BAriN,EAAAxiD,SAAA,EAMA9M,OAAA,SAAAozQ,CAAA,CAAAzwQ,CAAA,EACAywQ,EAAAA,EAAA30P,OAAA20P,GAAA,GAAAzwQ,EAAA6uQ,EAAA7uQ,GAMA,KAAAwvQ,UAAA,EACA,MAAAK,QAAA,KAAAU,EAAA,KAAAxnC,QAAA,QAAAymC,UAAA,CAAA31L,QAAA75E,EAAA,QAOA,IAJA,IAGAL,EAHAogB,EAAA,GACAywP,EAAe,IAAArB,EAAAL,EAA2B2B,IAK1C,CAFAD,EAAApB,WAAA,IAEAzvQ,CADAA,EAAA,KAAAkwQ,QAAA,CAAA5gM,OAAA,CAAAuhM,EAAAA,EAAAnyK,IAAA,OACAq3B,GAEAl5H,MAAA6D,OAAA,CAAAV,GACAogB,EAAA7kB,IAAA,CAAAuB,KAAA,CAAAsjB,EAAApgB,GAEAogB,EAAA7kB,IAAA,CAAAyE,GAEA,SAAA6vQ,UAAA,EACA,KAEA7vQ,CADAA,EAAA,KAAAkwQ,QAAA,CAAA5gM,OAAA,CAAAuhM,EAAAA,EAAAnyK,IAAA,OACAq3B,GAEAl5H,MAAA6D,OAAA,CAAAV,GACAogB,EAAA7kB,IAAA,CAAAuB,KAAA,CAAAsjB,EAAApgB,GAEAogB,EAAA7kB,IAAA,CAAAyE,EAEA,MAAAkwQ,QAAA,MACA,OACA,IAAA3nQ,WAAA6X,EACA,EAmNkC,gBAAAiuO,CAAA,CAAA5yP,CAAA,CAAAC,CAAA,eAAAA,EAAAyE,CAAA,CAAA1E,GAAAC,EAAAC,CAAA,CAAAF,EAAA,2CAAAs1Q,CAAA,6BAAAvhM,CAAA,qCAAAwhM,CAAA,qCAAAC,CAAA,kCAAAC,CAAA,4BAAAC,CAAA,8BAAApxN,CAAA,2CAAAqxN,CAAA,0CAAAC,CAAA,2CAAAC,CAAA,oCAAA71N,CAAA,+BAAAmI,CAAA,uCAAA2tN,CAAA,iCAAAC,CAAA,iCAAAx1N,CAAA,8BAAAy1N,CAAA,gCAAAC,CAAA,oCAAA/qP,CAAA,iCAAAghD,CAAA,yCAAAgqM,CAAA,+BAAAC,CAAA,4BAAAC,CAAA,8BAAAC,CAAA,2BAAAC,CAAA,2BAAAvsN,CAAA,sCAAAwsN,CAAA,sCAAAC,CAAA,6BAAAC,CAAA,kCAAAC,CAAA,mCAAAC,CAAA,6BAAAC,CAAA,CCxpBlC,GAiBA,IAAAC,EAAA,SAAA32Q,CAAA,CAAAoZ,CAAA,EAIA,MAAAu9P,CAHAA,EAASxzQ,OAAgB+gG,cAAA,EACzB,EAAAzyC,UAAA,eAAwBvwD,OAAA,SAAAlB,CAAA,CAAAoZ,CAAA,EAAApZ,EAAAyxD,SAAA,CAAAr4C,CAAA,GACxB,SAAApZ,CAAA,CAAAoZ,CAAA,UAAA+O,KAAA/O,EAAAjW,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAqK,EAAA+O,IAAAnoB,CAAAA,CAAA,CAAAmoB,EAAA,CAAA/O,CAAA,CAAA+O,EAAA,IACAnoB,EAAAoZ,EAAA,EAGA,SAAA08P,EAAA91Q,CAAA,CAAAoZ,CAAA,EACA,sBAAAA,GAAAA,IAAA,GAAAA,EACA,uCAAAoH,OAAApH,GAAA,iCAEA,SAAAovP,GAAA,MAAAnmQ,WAAA,CAAArC,CAAA,CADA22Q,EAAA32Q,EAAkBoZ,GAElBpZ,EAAA6O,SAAA,CAAAuK,IAAA,GAAAA,EAAAjW,OAAA8C,MAAA,CAAAmT,GAAAovP,CAAAA,EAAA35P,SAAA,CAAAuK,EAAAvK,SAAA,KAAA25P,CAAA,EAGA,IAAA30L,EAAA,WAQA,MAAAA,CAPAA,EAAA1wE,OAAAC,MAAA,WAA+CmC,CAAA,EAC/C,QAAAH,EAAAsB,EAAA,EAAAhG,EAAA84B,UAAAl4B,MAAA,CAAAoF,EAAAhG,EAAAgG,IAEA,QAAAyhB,KADA/iB,EAAAo0B,SAAA,CAAA9yB,EAAA,CACAvD,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EAEA,OAAA5iB,CACA,GACApE,KAAA,MAAAq4B,UAAA,EAGA,SAAAqwB,EAAAzkD,CAAA,CAAAqC,CAAA,EACA,IAAAlC,EAAA,GACA,QAAA4iB,KAAA/iB,EAAAjC,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAA3J,EAAA+iB,IAAA1gB,EAAAA,EAAA6Y,OAAA,CAAA6H,IACA5iB,CAAAA,CAAA,CAAA4iB,EAAA,CAAA/iB,CAAA,CAAA+iB,EAAA,EACA,GAAA/iB,IAAA,EAAAA,GAAA,mBAAAjC,OAAA2mD,qBAAA,CACA,QAAApjD,EAAA,EAAAyhB,EAAAhlB,OAAA2mD,qBAAA,CAAA1kD,GAAAsB,EAAAyhB,EAAA7mB,MAAA,CAAAoF,IACA,EAAAe,EAAA6Y,OAAA,CAAA6H,CAAA,CAAAzhB,EAAA,GAAAvD,OAAA0L,SAAA,CAAAk7C,oBAAA,CAAAh7C,IAAA,CAAA3J,EAAA+iB,CAAA,CAAAzhB,EAAA,GACAnB,CAAAA,CAAA,CAAA4iB,CAAA,CAAAzhB,EAAA,EAAAtB,CAAA,CAAA+iB,CAAA,CAAAzhB,EAAA,EACA,CACA,OAAAnB,CAAA,CAGA,SAAA0iD,EAAAC,CAAA,CAAAnK,CAAA,CAAAh7C,CAAA,CAAAk9C,CAAA,EACA,IAAAjgD,EAAAmoD,EAAA3uB,UAAAl4B,MAAA,CAAAkD,EAAA2jD,EAAA,EAAApK,EAAAkC,IAAA,GAAAA,EAAAA,EAAA98C,OAAA+8C,wBAAA,CAAAnC,EAAAh7C,GAAAk9C,CAAA,CACA,oBAAAmI,SAAA,mBAA2CA,QAAQC,QAAA,CAAA7jD,EAAA4jD,QAAAC,QAAA,CAAAH,EAAAnK,EAAAh7C,EAAAk9C,QACnD,QAAAv5C,EAAAwhD,EAAA5mD,MAAA,GAAAoF,GAAA,EAAAA,IAAA1G,CAAAA,EAAAkoD,CAAA,CAAAxhD,EAAA,GAAAlC,CAAAA,EAAA,CAAA2jD,EAAA,EAAAnoD,EAAAwE,GAAA2jD,EAAA,EAAAnoD,EAAA+9C,EAAAh7C,EAAAyB,GAAAxE,EAAA+9C,EAAAh7C,EAAA,GAAAyB,CAAAA,CAAA,CACA,OAAA2jD,EAAA,GAAA3jD,GAAArB,OAAA8L,cAAA,CAAA8uC,EAAAh7C,EAAAyB,GAAAA,CAAA,CAGA,SAAA0xQ,EAAAU,CAAA,CAAAC,CAAkC,EAClC,gBAAA94N,CAAA,CAAAh7C,CAAA,EAAA8zQ,EAAA94N,EAAAh7C,EAAA6zQ,EAAA,EAGA,SAAAf,EAAAxoK,CAAuB,CAAAypK,CAAA,CAAA5uN,CAAA,CAAA6uN,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACvB,SAAAC,EAAA5pO,CAAA,KAAAA,KAAA,IAAAA,GAAA,mBAAAA,EAAA,4CAAAA,CAAA,CAKA,QADA9rC,EAHAu0D,EAAAghN,EAAAhhN,IAAA,CAAAhzD,EAAAgzD,WAAAA,EAAA,MAAAA,WAAAA,EAAA,cACAhY,EAAA,CAAA+4N,GAAAzpK,EAAA0pK,EAAA,OAAA1pK,EAAAA,EAAAx+F,SAAA,MACAu0J,EAAA0zG,GAAA/4N,CAAAA,EAAA56C,OAAA+8C,wBAAA,CAAAnC,EAAAg5N,EAAA1zQ,IAAA,MACAY,EAAA,GACAyC,EAAAwhD,EAAA5mD,MAAA,GAAAoF,GAAA,EAAAA,IAAA,CACA,IAAApC,EAAA,GACA,QAAA6jB,KAAA4uP,EAAAzyQ,CAAA,CAAA6jB,EAAA,CAAAA,WAAAA,EAAA,GAAA4uP,CAAA,CAAA5uP,EAAA,CACA,QAAAA,KAAA4uP,EAAAI,MAAA,CAAA7yQ,EAA8C6yQ,MAAA,CAAAhvP,EAAA,CAAA4uP,EAAAI,MAAA,CAAAhvP,EAAA,CAC9C7jB,EAAA8yQ,cAAA,UAAA9pO,CAAA,KAAArpC,EAAA,MAA8D,mEAA2C,CAAAgzQ,EAAAr3Q,IAAA,CAAAs3Q,EAAA5pO,GAAA,QACzG,IAAAjpC,EAAA,GAAA6jD,CAAA,CAAAxhD,EAAA,EAAAqvD,aAAAA,EAAA,CAAA5yC,IAAAigJ,EAAAjgJ,GAAA,CAAA1d,IAAA29J,EAAA39J,GAAA,EAAA29J,CAAA,CAAArgK,EAAA,CAAAuB,GACA,GAAAyxD,aAAAA,EAAA,CACA,GAAA1xD,KAAA,IAAAA,EAAA,SACA,GAAAA,IAAA,GAAAA,GAAA,iBAAAA,EAAA,mCACA7C,CAAAA,EAAA01Q,EAAA7yQ,EAAA8e,GAAA,IAAAigJ,CAAAA,EAAAjgJ,GAAA,CAAA3hB,CAAAA,EACAA,CAAAA,EAAA01Q,EAAA7yQ,EAAAoB,GAAA,IAAA29J,CAAAA,EAAA39J,GAAA,CAAAjE,CAAAA,EACAA,CAAAA,EAAA01Q,EAAA7yQ,EAAAshB,IAAA,IAAAqxP,EAAA9qN,OAAA,CAAA1qD,EACA,KACAA,CAAAA,EAAA01Q,EAAA7yQ,EAAA,IACA0xD,UAAAA,EAAAihN,EAAA9qN,OAAA,CAAA1qD,GACA4hK,CAAA,CAAArgK,EAAA,CAAAvB,EACA,CAEAu8C,GAAA56C,OAAA8L,cAAA,CAAA8uC,EAAAg5N,EAAA1zQ,IAAA,CAAA+/J,GACAn/J,EAAA,GAGA,SAAAoyQ,EAAAzyP,CAAA,CAAAozP,CAAA,CAAAl0Q,CAAA,EAEA,QADAu0Q,EAAA79O,UAAkBl4B,MAAA,GAClBoF,EAAA,EAAAA,EAAAswQ,EAAA11Q,MAAA,CAAAoF,IACA5D,EAAAu0Q,EAAAL,CAAA,CAAAtwQ,EAAA,CAAAqI,IAAA,CAAA6U,EAAA9gB,GAAAk0Q,CAAA,CAAAtwQ,EAAA,CAAAqI,IAAA,CAAA6U,EAAA,CAEA,OAAAyzP,EAAAv0Q,EAAA,OAGA,SAAAqzQ,EAAA3yQ,CAAA,EACA,uBAAAA,EAAAA,EAAA,GAAAgzB,MAAA,CAAAhzB,EAAA,CAGA,SAAA8yQ,EAAAhpO,CAAA,CAAAjqC,CAAA,CAAAwyE,CAAA,EAEA,MADA,iBAAAxyE,GAAAA,CAAAA,EAAAA,EAA4CyD,WAAA,KAAA0vB,MAAA,CAAAnzB,EAAAyD,WAAA,UAC5C3D,OAAA8L,cAAA,CAAAq+B,EAAA,QAAA8S,aAAA,GAAAt9C,MAAA+yE,EAAA,GAAAr/C,MAAA,CAAAq/C,EAAA,IAAAxyE,GAAAA,CAAA,GAGA,SAAA4yQ,EAAAqB,CAAA,CAAAC,CAAA,EACA,oBAAAnvN,SAAA,mBAAAA,QAAAovN,QAAA,QAAApvN,QAAAovN,QAAA,CAAAF,EAAAC,EAAA,CAGA,SAAAnzN,EAAAxgC,CAA0B,CAAAygC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAC1B,SAAAC,EAAA1hD,CAAA,SAAAA,aAAAwhD,EAAAxhD,EAAA,IAAAwhD,EAAA,SAAA5iC,CAAA,EAAAA,EAAA5e,EAAA,GACA,UAAAwhD,CAAAA,GAAAA,CAAAA,EAAAhjC,OAAA,GAAkC,SAAMI,CAAA,CAAAH,CAAA,EACxC,SAAAkjC,EAAA3hD,CAAA,EAAiC,IAAM0uC,EAAA+S,EAAArgD,IAAA,CAAApB,GAAA,OAAmC2E,EAAA,CAAA8Z,EAAY9Z,EAAA,EACtF,SAAA2b,EAAAtgB,CAAA,CAA8B,KAAA0uC,EAAA+S,EAAA,MAAAzhD,GAAA,OAAA2E,EAAA,CAAA8Z,EAAA9Z,EAAA,EAC9B,SAAA+pC,EAAAntC,CAAA,EAAAA,EAAAJ,IAAA,CAAAyd,EAAArd,EAAAvB,KAAA,EAAA0hD,EAAAngD,EAAAvB,KAAA,EAAAugB,IAAA,CAAAohC,EAAArhC,EAAA,CACGouB,EAAA,CAAA+S,EAAAA,EAAApjD,KAAA,CAAAyiB,EAAAygC,GAAA,KAAAngD,IAAA,GACH,GAGA,SAAA6xQ,EAAYnyP,CAAA,CAAAxC,CAAA,EACZ,IAAmEksB,EAAAzY,EAAAtvB,EAAAmJ,EAAnElN,EAAA,CAAAi2Q,MAAe,EAAAC,KAAA,cAAAnyQ,EAAAA,CAAA,UAAAA,CAAA,IAAoD,OAAAA,CAAA,KAAAoyQ,KAAA,GAAAC,IAAA,IACnE,OAAAlpQ,EAAA,CAAAxK,KAAqB2zQ,EAAA,SAAAA,EAAsB,UAAAA,EAAA,uBAAAn0Q,QAAAgL,CAAAA,CAAA,CAAAhL,OAAAC,QAAA,2BAAA+K,CAAA,CAC3C,SAAAmpQ,EAAAn3Q,CAAA,kBAAAyE,CAAA,SAAAqsC,EAAA,CAAA9wC,EAAAyE,EAAA,GACA,SAAAqsC,EAAA67L,CAAA,EACA,GAAA//L,EAAA,mDACA,KAAA5+B,GAAAA,CAAAA,EAAA,EAAA2+N,CAAA,KAAA7rO,CAAAA,EAAA,IAAAA,CAAA,MACA,GAAA8rC,EAAA,EAAAzY,GAAAtvB,CAAAA,EAAA8nO,EAAAA,CAAA,IAAAx4M,EAAA,OAAAw4M,CAAA,IAAAx4M,EAAA,SAAAtvB,EAAAsvB,EAAA,SAAAtvB,EAAAwJ,IAAA,CAAA8lB,GAAA,GAAAA,EAAA3wB,IAAA,KAAAqB,EAAAA,EAAAwJ,IAAA,CAAA8lB,EAAAw4M,CAAA,MAAAppO,IAAA,QAAAsB,CAAA,CAEA,OADAsvB,EAAA,EAAAA,GAAAw4M,CAAAA,EAAA,CAAAA,EAAAA,CAAA,IAAA9nO,EAAAzC,KAAA,GACAuqO,CAAA,KACA,cAAA9nO,EAAiC8nO,EAAA,KAAS,MAC1C,EAAiC,OAAjC7rO,EAAAi2Q,KAAA,GAAiC,CAAA30Q,MAAWuqO,CAAA,GAAU,CAAAppO,KAAA,GACtD,QAAAzC,EAAAi2Q,KAAA,GAAA5iP,EAAAw4M,CAAA,CAAwC,GAAAA,EAAA,IAAc,cACtD,EAAAA,EAAA7rO,EAAAo2Q,GAAA,CAAA1jN,GAAA,GAAA1yD,EAAAm2Q,IAAA,CAAAzjN,GAAA,oBAEA,GAAA3uD,CAAAA,CAAAA,EAAAA,CAAAA,EAAA/D,EAAAm2Q,IAAA,EAAAr2Q,MAAA,IAAAiE,CAAA,CAAAA,EAAAjE,MAAA,MAAA+rO,CAAAA,IAAAA,CAA+E,KAAAA,IAAAA,CAAA,GAAiB,GAAA7rO,EAAA,cAChG6rO,IAAAA,CAAA,OAAA9nO,GAAA8nO,CAAA,IAAA9nO,CAAA,CAAuD,IAAA8nO,CAAA,IAAA9nO,CAAA,CAAgB,KAAQ/D,EAAAi2Q,KAAA,CAAApqC,CAAA,aAC/EA,IAAAA,CAAA,KAAA7rO,EAAAi2Q,KAAA,CAA6ClyQ,CAAA,KAAA/D,EAAAi2Q,KAAgB,CAAAlyQ,CAAA,IAAAA,EAAA8nO,EAAgB,SAC7E9nO,GAAA/D,EAAAi2Q,KAAA,CAAAlyQ,CAAA,KAAA/D,EAAAi2Q,KAAA,CAAAlyQ,CAAA,IAAA/D,EAAAo2Q,GAAA,CAAAh4Q,IAAA,CAAAytO,GAAA,OACA,KAAA7rO,EAAAo2Q,GAAgC,CAAA1jN,GAAA,GAChC1yD,EAAAm2Q,IAAA,CAAAzjN,GAAA,YAEQm5K,EAAAjsN,EAAYrS,IAAA,CAAA6U,EAAapiB,EACjC,OAAAiG,EAAA,CAAA4lO,EAAA,GAAA5lO,EAAA,CAAAotB,EAAkC,SAAS,CAAAyY,EAAA/nC,EAAA,EAC3C,GAAA8nO,EAAAA,CAAA,UAAAA,CAAA,WAAAvqO,MAAAuqO,CAAA,IAAAA,CAAA,WAAAppO,KAAA,GACA,EAGA,IAAA67C,EAAA38C,OAAA8C,MAAA,UAAA85C,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACA,IAAA+6C,EAAA98C,OAAA+8C,wBAAA,CAAA31B,EAAArlB,GACA,EAAA+6C,GAAe,SAAAA,EAAA,CAAA11B,EAAA3b,UAAA,CAAAqxC,EAAoCE,QAAA,EAAAF,EAAAG,YAAA,IACnDH,CAAAA,EAAA,CAAA7zB,WAAA,GAAAjJ,IAAA,kBAAAoH,CAAA,CAAArlB,EAAA,IAEC/B,OAAA8L,cAAA,CAAA8wC,EAAAC,EAAAC,EACD,WAAAF,CAAA,CAAAx1B,CAAA,CAAArlB,CAAA,CAAA86C,CAAA,EACA77C,KAAAA,IAAA67C,GAAAA,CAAAA,EAAA96C,CAAAA,EACC66C,CAAA,CAAAC,EAAA,CAAAz1B,CAAA,CAAArlB,EAAA,EAGD,SAAAm7C,EAAA91B,CAAA,CAAAw1B,CAAA,EACA,QAAA53B,KAAAoC,EAAA,YAAApC,GAAAhlB,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAgxC,EAAA53B,IAAA23B,EAAAC,EAAAx1B,EAAApC,EAAA,CAGA,SAAAuuP,EAAA32N,CAAA,EACA,IAAA36C,EAAA,mBAAA1B,QAAAA,OAAAC,QAAA,CAAA4mB,EAAAnlB,GAAA26C,CAAA,CAAA36C,EAAA,CAAAsB,EAAA,EACA,GAAA6jB,EAAA,OAAAA,EAAAxb,IAAA,CAAAgxC,EAAA,CACA,GAAAA,GAAA,iBAAAA,EAAAz+C,MAAA,QACA4C,KAAA,WAEA,OADA67C,GAAmBr5C,GAAAq5C,EAAAz+C,MAAA,EAAAy+C,CAAAA,EAAA,QACnB,CAAAj9C,MAAAi9C,GAAAA,CAAA,CAAAr5C,IAAA,CAAAzC,KAAA,CAAA87C,CAAA,CACA,CACA,QACA,UAAA36C,EAAA,6DAGA,SAAAgxQ,EAAAr2N,CAAA,CAAAr/C,CAAA,EACA,IAAA6pB,EAAA,mBAAA7mB,QAAAq8C,CAAA,CAAAr8C,OAAAC,QAAA,EACA,IAAA4mB,EAAA,OAAAw1B,CAAA,CACA,IAAAv7C,EAAAiD,EAAAf,EAAA6jB,EAAAxb,IAAA,CAAAgxC,GAAAwvD,EAAA,GACA,IACA,MAAA7uG,KAAA,IAAAA,GAAAA,KAAA,MAAA8D,EAAAkC,EAAAxC,IAAA,IAAAD,IAAA,EAAAsrG,EAAA3vG,IAAA,CAAA4E,EAAA1B,KAAA,CACA,CACA,MAAAwD,EAAA,CAAAmB,EAAA,CAAAnB,MAAAA,CAAA,SACA,CACA,IACA9B,GAAA,CAAAA,EAAAP,IAAA,EAAAsmB,CAAAA,EAAA7jB,EAAA,SAAA6jB,EAAAxb,IAAA,CAAArI,EACA,QACA,IAAAe,EAAA,MAAAA,EAAAnB,KAAA,CACA,CACA,OAAAipG,CAAA,CAIA,SAAAgnK,GAAA,CACA,QAAAhnK,EAAA,GAAA7oG,EAAA,EAAAA,EAAA8yB,UAAAl4B,MAAA,CAAAoF,IACA6oG,EAAAA,EAAA/4E,MAAA,CAAA4/O,EAAA58O,SAAA,CAAA9yB,EAAA,GACA,OAAA6oG,CAAA,CAIA,SAAAknK,GAAA,CACA,QAAArxQ,EAAA,EAAAsB,EAAA,EAAAoxQ,EAAAt+O,UAAuCl4B,MAAA,CAAQoF,EAAAoxQ,EAAApxQ,IAAAtB,GAAAo0B,SAAA,CAAA9yB,EAAA,CAAApF,MAAA,CAC/C,QAAAkD,EAAAtD,MAAAkE,GAAAF,EAAA,EAAAwB,EAAA,EAAAA,EAAAoxQ,EAAApxQ,IACA,QAAAxG,EAAAs5B,SAAA,CAAA9yB,EAAA,CAAAkuB,EAAA,EAAAmjP,EAAA73Q,EAAAoB,MAAA,CAAAszB,EAAAmjP,EAAAnjP,IAAA1vB,GAAA,CACAV,CAAA,CAAAU,EAAA,CAAAhF,CAAA,CAAA00B,EAAA,CACA,OAAApwB,CAAA,CAGA,SAAAgyQ,EAAAptM,CAAA,CAAA3qD,CAAA,CAAAu0E,CAAA,EACA,GAAAA,GAAAx5D,GAAAA,UAAAl4B,MAAA,SAAAiuG,EAAA7oG,EAAA,EAAA2mC,EAAA5uB,EAAAnd,MAAA,CAAAoF,EAAA2mC,EAAA3mC,KACA6oG,GAAA7oG,KAAA+X,IACA8wF,GAAAA,CAAAA,EAAAruG,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,CAAA0P,EAAA,EAAA/X,EAAA,EACA6oG,CAAA,CAAA7oG,EAAA,CAAA+X,CAAA,CAAA/X,EAAA,CAEA,CACA,OAAA0iE,EAAA5yC,MAAA,CAAA+4E,GAAAruG,MAAA2N,SAAA,CAAAnN,KAAA,CAAAqN,IAAA,CAAA0P,GAAA,CAGA,SAAA+2P,EAAArwQ,CAAA,EACA,uBAAAqwQ,EAAA,MAAArwQ,CAAA,CAAAA,EAAA,UAAAqwQ,EAAArwQ,EAAA,CAGA,SAAAmwQ,EAAA1xP,CAAA,CAAAygC,CAAA,CAAAE,CAAA,EACA,IAAA7gD,OAAAs0Q,aAAA,yDACA,IAAetxQ,EAAfgI,EAAA61C,EAAepjD,KAAA,CAAAyiB,EAAAygC,GAAA,IAAAsO,EAAA,GACf,OAAAjsD,EAAA,GAAAmxQ,EAAA,QAA4BA,EAAA,SAAAA,EAAsB,SAAAI,GAAAvxQ,CAAA,CAAAhD,OAAAs0Q,aAAA,0BAAAtxQ,CAAA,CAClD,SAAAuxQ,EAAA3qO,CAAwB,kBAAYnoC,CAAA,SAAAmc,QAAsBI,OAAA,CAAAvc,GAAAke,IAAA,CAAAiqB,EAAA/rB,EAAA,CAAqC,CAC/F,SAAAs2P,EAAAn3Q,CAAA,CAAA4sC,CAAA,EAA0B5+B,CAAA,CAAAhO,EAAM,GAAAgG,CAAA,CAAAhG,EAAA,UAAiByE,CAAA,SAAY,IAAAmc,QAAA,SAAAphB,CAAA,CAAAkZ,CAAA,EAAAu5C,EAAA/yD,IAAA,EAAAc,EAAAyE,EAAAjF,EAAAkZ,EAAA,KAAA8+P,EAAAx3Q,EAAAyE,EAAA,IAAAmoC,GAAA5mC,CAAAA,CAAA,CAAAhG,EAAA,CAAA4sC,EAAA5mC,CAAA,CAAAhG,EAAA,IAC7D,SAAAw3Q,EAAAx3Q,CAAA,CAAqByE,CAAA,MAAAqsC,EAAA9iC,CAAA,CAAAhO,EAAA,CAAAyE,GAAA,OAAAsC,EAAA,CAAA0wQ,EAAAxlN,CAAA,OAAAlrD,EAAA,EACrB,SAAA+pC,EAAAhtC,CAAA,EAAAA,EAAA1B,KAA4B,YAAA0yQ,EAAAl0P,QAAAI,OAAA,CAAAld,EAAA1B,KAAA,CAAAqC,CAAA,EAAAke,IAAA,CAAA+0P,EAAA72P,GAAA42P,EAAAxlN,CAAA,OAAAnuD,EAAA,CAC5B,SAAA4zQ,EAAAt1Q,CAAA,EAA2Bo1Q,EAAA,OAAAp1Q,EAAA,CAC3B,SAAAye,EAAAze,CAAA,EAA0Bo1Q,EAAA,QAAAp1Q,EAAA,CAC1B,SAAAq1Q,EAAA7qO,CAAA,CAAAnoC,CAAA,EAAAmoC,EAAAnoC,GAAAwtD,EAAAz2C,KAAA,GAAAoxB,EAAAhsC,MAAA,EAAA42Q,EAAAvlN,CAAA,OAAAA,CAAA,SAGA,SAAA0iN,EAAAt1N,CAAA,EACA,IAAAr5C,EAAAyhB,EACA,OAAAzhB,EAAA,GAAAmxQ,EAAA,QAAwBA,EAAA,iBAA6BpwQ,CAAA,QAAAA,CAAA,GAAoBowQ,EAAA,UAAAnxQ,CAAA,CAAAhD,OAAAC,QAAA,YAAuC,QAAkB,MAAA+C,CAAA,CAClI,SAAAmxQ,EAAAn3Q,CAAA,CAAA4sC,CAAA,EAAA5mC,CAAA,CAAAhG,EAAA,CAAAq/C,CAAA,CAAAr/C,EAAA,UAAAyE,CAAA,SAAAgjB,EAAA,CAAAA,CAAAA,EAAA,CAAArlB,MAAA0yQ,EAAAz1N,CAAA,CAAAr/C,EAAA,CAAAyE,IAAAlB,KAAA,IAAAqpC,EAAAA,EAAAnoC,GAAAA,CAAA,EAAAmoC,CAAA,EAGA,SAAAioO,EAAAx1N,CAAA,EACA,IAAAr8C,OAAAs0Q,aAAA,yDACA,IAAAtxQ,EAAA6jB,EAAAw1B,CAAA,CAAAr8C,OAAAs0Q,aAAA,EACA,OAAAztP,EAAAA,EAAAxb,IAAA,CAAAgxC,GAAqBA,CAAAA,EAA8B22N,EAAA32N,GAAgDr5C,EAAA,GAAAmxQ,EAAA,QAAAA,EAAA,SAAAA,EAAA,UAAAnxQ,CAAA,CAAAhD,OAAwDs0Q,aAAA,0BAAAtxQ,CAAA,EAC3J,SAAAmxQ,EAAAn3Q,CAAA,EAAAgG,CAAA,CAAAhG,EAAA,CAAAq/C,CAAA,CAAAr/C,EAAA,WAA2CyE,CAAA,aAAAmc,QAAA,SAAAI,CAAsC,CAAAH,CAAU,EAAmB42P,EAAIz2P,EAAAH,EAAApc,CAAvBA,EAAA46C,CAAA,CAAAr/C,EAAA,CAAAyE,EAAA,EAAuBlB,IAAA,CAAAkB,EAAArC,KAAA,KAClH,SAAAq1Q,EAAAz2P,CAAA,CAAAH,CAAA,CAAAvhB,CAAA,CAAAmF,CAAA,EAAAmc,QAAAI,OAAA,CAAAvc,GAAAke,IAAA,UAAAle,CAAA,EAAAuc,EAAA,CAAA5e,MAAAqC,EAAAlB,KAAAjE,CAAA,IAAAuhB,EAAA,EAGA,SAAAy0P,EAAAqC,CAA+B,CAAA/5O,CAAA,EAE/B,OADAn7B,OAAA8L,cAAA,CAAA9L,OAAA8L,cAAA,CAAAopQ,EAAA,OAAAv1Q,MAAAw7B,CAAA,GAAA+5O,EAAA/5O,GAAA,CAAAA,EACA+5O,CAAA,CAGA,IAAAtsM,EAAA5oE,OAAA8C,MAAA,CAAwC,SAAA85C,CAAA,CAAA56C,CAAA,EACvChC,OAAA8L,cAAA,CAAA8wC,EAAA,WAAA3zB,WAAA,GAAAtpB,MAAAqC,CAAA,EACD,WAAA46C,CAAA,CAAA56C,CAAA,EACA46C,EAAA,QAAA56C,CAAA,EAGA,SAAA6mE,EAAA/gD,CAAA,EACA,GAAAA,GAAAA,EAAArc,UAAA,QAAAqc,CAAA,CACA,IAAA5mB,EAAA,GACA,GAAA4mB,IAAA,EAAAA,EAAA,QAAA/lB,KAAA+lB,EAAA,YAAA/lB,GAAA/B,OAAA0L,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAkc,EAAA/lB,IAAA46C,EAAAz7C,EAAA4mB,EAAA/lB,EAAA,CAEA,OADA6mE,EAAA1nE,EAAA4mB,GACA5mB,CAAA,CAGA,SAAA2mB,EAAAC,CAAA,EACA,UAAAA,EAAArc,UAAA,CAAAqc,EAAA,CAAA/D,QAAA+D,CAAA,EAGA,SAAAwqP,EAAA33E,CAAA,CAAAzyI,CAAA,CAAA0K,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,6FACA,MAAA/nI,MAAAA,EAAAzoB,EAAAyoB,MAAAA,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,GAAAxwJ,EAAAA,EAAAxqC,KAAA,CAAAuoD,EAAAloC,GAAA,CAAA26K,EAAA,CAGA,SAAA63E,EAAA73E,CAAA,CAAAzyI,CAAA,CAAAvoD,CAAA,CAAAizD,CAAA,CAAAzoB,CAAA,EACA,GAAAyoB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAzoB,EAAA,iEACA,sBAAA+d,EAAAyyI,IAAAzyI,GAAA,CAAA/d,EAAA,CAAA+d,EAAA3nC,GAAA,CAAAo6K,EAAA,4FACA,YAAA/nI,EAAAzoB,EAAAv+B,IAAA,CAAA+uL,EAAAh7L,GAAAwqC,EAAAA,EAAAxqC,KAAA,CAAAA,EAAAuoD,EAAA5lD,GAAA,CAAAq4L,EAAAh7L,EAAA,CAAAA,CAAA,CAGA,SAAA4yQ,EAAArqN,CAAA,CAAAyyI,CAAA,EACA,GAAAA,IAAA,GAAAA,GAAA,iBAAAA,GAAA,mBAAAA,EAAA,0DACA,yBAAAzyI,EAAAyyI,IAAAzyI,EAAAA,EAAA3nC,GAAA,CAAAo6K,EAAA,CAGA,SAAAs3E,EAAAzpQ,CAAA,CAAA7I,CAAA,CAAAw1Q,CAAA,EACA,GAAAx1Q,MAAAA,EAAA,KAEAgvJ,EAAAo5C,EADA,oBAAApoM,GAAA,mBAAAA,EAAA,oCAEA,GAAAw1Q,EAAA,CACA,IAAA50Q,OAAA60Q,YAAA,wDACAzmH,EAAAhvJ,CAAA,CAAAY,OAAA60Q,YAAA,EACA,GACAzmH,KAAA,IAAAA,EAAA,CACA,IAAApuJ,OAAAouJ,OAAA,mDACAA,EAAAhvJ,CAAA,CAAAY,OAAAouJ,OAAA,EACAwmH,GAAAptE,CAAAA,EAAAp5C,CAAA,CACA,IACA,mBAAAA,EAAsC,MAAM,mCAAgC,CAC5Eo5C,GAAAp5C,CAAAA,EAAqB,eAAAo5C,EAAAn8L,IAAA,aAA8CtH,EAAA,QAAA6Z,QAAAC,MAAA,CAAA9Z,EAAA,IACnEkE,EAAA+Z,KAAA,CAAA9lB,IAAA,EAAAkD,MAAAA,EAAAgvJ,QAAAA,EAAAwmH,MAAAA,CAAA,EACA,MACAA,GACA3sQ,EAAA+Z,KAAA,CAAA9lB,IAAA,EAAA04Q,MAAA,IACA,CACA,OAAAx1Q,CAAA,CAGA,IAAA01Q,EAAA,mBAAAC,gBAAAA,gBAAA,SAAAnyQ,CAAA,CAAAoyQ,CAAA,CAAAj2Q,CAAA,EACA,IAAAgF,EAAA,MAAAhF,GACA,OAAAgF,EAAApE,IAAA,mBAAAoE,EAAAnB,KAAA,CAAAA,EAAAmB,EAAAixQ,UAAA,CAAAA,EAAAjxQ,CAAA,EAGA,SAAAmuQ,EAAAjqQ,CAAA,EACA,SAAAskG,EAAAxoG,CAAA,EACAkE,EAAArF,KAAA,CAAAqF,EAAAgtQ,QAAA,KAAAH,EAAA/wQ,EAAAkE,EAAArF,KAAA,6CAAAmB,CAAA,CACAkE,EAAAgtQ,QAAA,GACA,CACA,SAAAz0Q,GAAA,CACA,KAAAyH,EAAA+Z,KAAA,CAAApkB,MAAA,GACA,IAAAy/H,EAAAp1H,EAAA+Z,KAAA,CAAAwuC,GAAA,GACA,IACA,IAAA7vD,EAAA08H,EAAA+wB,OAAA,EAAA/wB,EAAA+wB,OAAA,CAAA/iJ,IAAA,CAAAgyH,EAAAj+H,KAAA,EACA,GAAAi+H,EAAAu3I,KAAA,QAAAh3P,QAAAI,OAAA,CAAArd,GAAAgf,IAAA,CAAAnf,EAAA,SAAAuD,CAAA,SAAAwoG,EAAAxoG,GAAAvD,GAAA,GAEA,MAAAuD,EAAA,CACAwoG,EAAAxoG,EACA,CACA,CACA,GAAAkE,EAAAgtQ,QAAA,OAAAhtQ,EAAArF,KAAA,CAEA,OAAApC,GAAA,CAGApE,EAAA,SACAg2Q,UAAAA,EACAjiM,SAAAA,EACAhqB,OAAAA,EACA5B,WAAAA,EACAiuN,QAAAA,EACAD,WAAAA,EACA7xN,UAAAA,EACA2xN,YAAAA,EACAj2N,gBAAAA,EACAO,aAAAA,EACAq2N,SAAAA,EACAN,OAAAA,EACAG,SAAAA,EACAE,eAAAA,EACAD,cAAAA,EACAhB,QAAAA,EACAF,iBAAAA,EACAD,iBAAAA,EACAE,cAAAA,EACAS,qBAAAA,EACAhqM,aAAAA,EACAhhD,gBAAAA,EACAyqP,uBAAAA,EACAE,uBAAAA,EACAD,sBAAAA,EACAN,wBAAAA,EACCQ,mBAAAA,CAAC,iBAAAz1Q,CAAA,cAAAA,CAAAA,EAAAC,OAAA,CAAAyD,KAAA2f,KAAA,y9PAAAzjB,CAAA,MAAA64Q,EAAA,SAAAC,CAAA,SAAA94Q,EAAAA,EAAAqF,CAAA,CAAAyzQ,EAAA,EAAA94Q,EAAAy4B,CAAA,+BAAAogP,EAAA,MAAAA,EAAA,OAAAE,KAAA/4Q,EAAAy4B,CAAA","sources":["webpack://_N_E/./node_modules/@coral-xyz/anchor/dist/browser/index.js","webpack://_N_E/./node_modules/@coral-xyz/anchor/dist/cjs/nodewallet.js","webpack://_N_E/./node_modules/@coral-xyz/anchor/dist/cjs/utils/common.js","webpack://_N_E/./node_modules/@coral-xyz/anchor/node_modules/bs58/index.js","webpack://_N_E/./node_modules/@coral-xyz/anchor/node_modules/camelcase/index.js","webpack://_N_E/./node_modules/@coral-xyz/borsh/dist/index.js","webpack://_N_E/./node_modules/@emotion/sheet/dist/emotion-sheet.browser.esm.js","webpack://_N_E/./node_modules/stylis/src/Utility.js","webpack://_N_E/./node_modules/stylis/src/Tokenizer.js","webpack://_N_E/./node_modules/stylis/src/Enum.js","webpack://_N_E/./node_modules/stylis/src/Serializer.js","webpack://_N_E/./node_modules/stylis/src/Middleware.js","webpack://_N_E/./node_modules/stylis/src/Parser.js","webpack://_N_E/./node_modules/@emotion/cache/dist/emotion-cache.browser.esm.js","webpack://_N_E/./node_modules/@emotion/memoize/dist/emotion-memoize.esm.js","webpack://_N_E/./node_modules/@emotion/react/dist/emotion-element-43c6fea0.browser.esm.js","webpack://_N_E/./node_modules/@emotion/react/dist/emotion-react.browser.esm.js","webpack://_N_E/./node_modules/@emotion/hash/dist/emotion-hash.esm.js","webpack://_N_E/./node_modules/@emotion/unitless/dist/emotion-unitless.esm.js","webpack://_N_E/./node_modules/@emotion/serialize/dist/emotion-serialize.browser.esm.js","webpack://_N_E/./node_modules/@emotion/use-insertion-effect-with-fallbacks/dist/emotion-use-insertion-effect-with-fallbacks.browser.esm.js","webpack://_N_E/./node_modules/@emotion/utils/dist/emotion-utils.browser.esm.js","webpack://_N_E/./node_modules/@mui/material/DefaultPropsProvider/DefaultPropsProvider.js","webpack://_N_E/./node_modules/@mui/system/esm/GlobalStyles/GlobalStyles.js","webpack://_N_E/./node_modules/@mui/material/GlobalStyles/GlobalStyles.js","webpack://_N_E/./node_modules/@mui/material/styles/createMixins.js","webpack://_N_E/./node_modules/@mui/material/colors/common.js","webpack://_N_E/./node_modules/@mui/material/colors/grey.js","webpack://_N_E/./node_modules/@mui/material/colors/purple.js","webpack://_N_E/./node_modules/@mui/material/colors/red.js","webpack://_N_E/./node_modules/@mui/material/colors/orange.js","webpack://_N_E/./node_modules/@mui/material/colors/blue.js","webpack://_N_E/./node_modules/@mui/material/colors/lightBlue.js","webpack://_N_E/./node_modules/@mui/material/colors/green.js","webpack://_N_E/./node_modules/@mui/material/styles/createPalette.js","webpack://_N_E/./node_modules/@mui/material/styles/createTypography.js","webpack://_N_E/./node_modules/@mui/material/styles/shadows.js","webpack://_N_E/./node_modules/@mui/material/styles/createTransitions.js","webpack://_N_E/./node_modules/@mui/material/styles/zIndex.js","webpack://_N_E/./node_modules/@mui/material/styles/createTheme.js","webpack://_N_E/./node_modules/@mui/material/styles/defaultTheme.js","webpack://_N_E/./node_modules/@mui/material/styles/identifier.js","webpack://_N_E/./node_modules/@mui/styled-engine/GlobalStyles/GlobalStyles.js","webpack://_N_E/./node_modules/@mui/system/colorManipulator.js","webpack://_N_E/./node_modules/@mui/system/esm/DefaultPropsProvider/DefaultPropsProvider.js","webpack://_N_E/./node_modules/@mui/system/esm/RtlProvider/index.js","webpack://_N_E/./node_modules/@mui/system/esm/breakpoints.js","webpack://_N_E/./node_modules/@mui/system/esm/createTheme/applyStyles.js","webpack://_N_E/./node_modules/@mui/system/esm/createTheme/createBreakpoints.js","webpack://_N_E/./node_modules/@mui/system/esm/createTheme/shape.js","webpack://_N_E/./node_modules/@mui/system/esm/createTheme/createSpacing.js","webpack://_N_E/./node_modules/@mui/system/esm/createTheme/createTheme.js","webpack://_N_E/./node_modules/@mui/system/esm/merge.js","webpack://_N_E/./node_modules/@mui/system/esm/memoize.js","webpack://_N_E/./node_modules/@mui/system/esm/spacing.js","webpack://_N_E/./node_modules/@mui/system/esm/style.js","webpack://_N_E/./node_modules/@mui/system/esm/compose.js","webpack://_N_E/./node_modules/@mui/system/esm/borders.js","webpack://_N_E/./node_modules/@mui/system/esm/cssGrid.js","webpack://_N_E/./node_modules/@mui/system/esm/palette.js","webpack://_N_E/./node_modules/@mui/system/esm/sizing.js","webpack://_N_E/./node_modules/@mui/system/esm/styleFunctionSx/defaultSxConfig.js","webpack://_N_E/./node_modules/@mui/system/esm/styleFunctionSx/styleFunctionSx.js","webpack://_N_E/./node_modules/@mui/system/esm/useTheme.js","webpack://_N_E/./node_modules/@mui/system/esm/useThemeWithoutDefault.js","webpack://_N_E/./node_modules/@mui/utils/capitalize/capitalize.js","webpack://_N_E/./node_modules/@mui/utils/clamp/clamp.js","webpack://_N_E/./node_modules/@mui/utils/clamp/index.js","webpack://_N_E/./node_modules/@mui/utils/deepmerge/deepmerge.js","webpack://_N_E/./node_modules/@mui/utils/formatMuiErrorMessage/formatMuiErrorMessage.js","webpack://_N_E/./node_modules/@mui/utils/formatMuiErrorMessage/index.js","webpack://_N_E/./node_modules/@mui/utils/resolveProps/resolveProps.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/helpers/token-instructions.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/index.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/math/decimal-util.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/math/index.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/math/math-util.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/math/percentage.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/address-util.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/ata-util.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/index.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/network/account-requests.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/network/index.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/network/parsing.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/public-key-utils.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/token-util.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/transactions/index.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/transactions/transactions-builder.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/transactions/transactions-processor.js","webpack://_N_E/./node_modules/@orca-so/common-sdk/dist/web3/transactions/types.js","webpack://_N_E/./node_modules/@project-serum/anchor/dist/browser/index.js","webpack://_N_E/./node_modules/@project-serum/anchor/node_modules/bs58/index.js","webpack://_N_E/./node_modules/@project-serum/borsh/dist/lib/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/artifacts/merkle_distributor.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/clients/distributor-client.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/clients/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/constants.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/context.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/fetcher/fetcher.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/fetcher/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/fetcher/parsing.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/clawback.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/newClaim.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/newDistributor.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/setAdmin.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/setClawbackReceiver.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/setMerkleRoot.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/instructions/setTimestamp.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/methods.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/pda.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/types/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/types/type.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/balance-tree.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/bytes32.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/helper.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/merkle-tree.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/program.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/dist/utils/spl.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/node_modules/@coral-xyz/anchor/dist/browser/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/node_modules/@coral-xyz/borsh/dist/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/node_modules/bs58/index.js","webpack://_N_E/./node_modules/@renec-foundation/distributor-sdk/node_modules/camelcase/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/ata.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/common.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/instructions/account.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/instructions/ata.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/instructions/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/instructions/mint.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/instructions/nft.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/layout.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/price.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/splTokenRegistry.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/token.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/tokenAmount.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/tokenList.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/tokenOwner.js","webpack://_N_E/./node_modules/@saberhq/token-utils/dist/cjs/tokenProvider.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/option-utils/dist/cjs/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/broadcaster/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/broadcaster/sendAndSpamRawTx.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/broadcaster/tiered.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/computeBudget/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/computeBudget/instructions.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/computeBudget/layouts.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/constants.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/error.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/interfaces.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/provider.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/PendingTransaction.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/TransactionEnvelope.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/TransactionReceipt.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/parseTransactionLogs.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/programErr.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/txSizer.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/transaction/utils.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/index.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/instructions.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/misc.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/printAccountOwners.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/printTXTable.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/pubkeyCache.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/publicKey.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/simulateTransactionWithCommitment.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/time.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/utils/txLink.js","webpack://_N_E/./node_modules/@saberhq/token-utils/node_modules/@saberhq/solana-contrib/dist/cjs/wallet.js","webpack://_N_E/./node_modules/@solana/buffer-layout/lib/Layout.js","webpack://_N_E/./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/typeof.js","webpack://_N_E/./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/toPrimitive.js","webpack://_N_E/./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","webpack://_N_E/./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/defineProperty.js","webpack://_N_E/./node_modules/@solana/spl-token/lib/index.browser.esm.js","webpack://_N_E/./node_modules/@noble/hashes/esm/_u64.js","webpack://_N_E/./node_modules/@noble/hashes/esm/sha512.js","webpack://_N_E/./node_modules/@noble/curves/esm/abstract/utils.js","webpack://_N_E/./node_modules/@noble/curves/esm/abstract/modular.js","webpack://_N_E/./node_modules/@noble/curves/esm/abstract/curve.js","webpack://_N_E/./node_modules/@noble/curves/esm/abstract/edwards.js","webpack://_N_E/./node_modules/@noble/curves/esm/ed25519.js","webpack://_N_E/./node_modules/@solana/web3.js/node_modules/superstruct/dist/index.mjs","webpack://_N_E/./node_modules/rpc-websockets/node_modules/eventemitter3/index.mjs","webpack://_N_E/./node_modules/rpc-websockets/dist/index.browser.mjs","webpack://_N_E/./node_modules/@noble/hashes/esm/sha3.js","webpack://_N_E/./node_modules/@noble/hashes/esm/hmac.js","webpack://_N_E/./node_modules/@noble/curves/esm/abstract/weierstrass.js","webpack://_N_E/./node_modules/@noble/curves/esm/_shortw_utils.js","webpack://_N_E/./node_modules/@noble/curves/esm/secp256k1.js","webpack://_N_E/./node_modules/@solana/web3.js/lib/index.browser.esm.js","webpack://_N_E/./node_modules/@solana/web3.js/node_modules/bs58/index.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/constants.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/format.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/fraction.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/index.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/percent.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/price.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/token.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/tokenAmount.js","webpack://_N_E/./node_modules/@ubeswap/token-math/dist/cjs/utils.js","webpack://_N_E/./node_modules/assert/build/assert.js","webpack://_N_E/./node_modules/assert/build/internal/assert/assertion_error.js","webpack://_N_E/./node_modules/assert/build/internal/errors.js","webpack://_N_E/./node_modules/assert/build/internal/util/comparisons.js","webpack://_N_E/./node_modules/base-x/src/index.js","webpack://_N_E/./node_modules/base64-js/index.js","webpack://_N_E/./node_modules/big.js/big.js","webpack://_N_E/./node_modules/bigint-buffer/dist/browser.js","webpack://_N_E/./node_modules/bignumber.js/bignumber.js","webpack://_N_E/./node_modules/bn.js/lib/bn.js","webpack://_N_E/./node_modules/borsh/lib/index.js","webpack://_N_E/./node_modules/borsh/node_modules/bs58/index.js","webpack://_N_E/./node_modules/bs58/index.js","webpack://_N_E/./node_modules/bs58/node_modules/base-x/src/index.js","webpack://_N_E/./node_modules/buffer-layout/lib/Layout.js","webpack://_N_E/./node_modules/buffer/index.js","webpack://_N_E/./node_modules/call-bind/callBound.js","webpack://_N_E/./node_modules/call-bind/index.js","webpack://_N_E/./node_modules/camelcase/index.js","webpack://_N_E/./node_modules/decimal.js-light/decimal.js","webpack://_N_E/./node_modules/decimal.js/decimal.js","webpack://_N_E/./node_modules/define-data-property/index.js","webpack://_N_E/./node_modules/define-properties/index.js","webpack://_N_E/./node_modules/err-code/index.js","webpack://_N_E/./node_modules/es-define-property/index.js","webpack://_N_E/./node_modules/es-errors/eval.js","webpack://_N_E/./node_modules/es-errors/index.js","webpack://_N_E/./node_modules/es-errors/range.js","webpack://_N_E/./node_modules/es-errors/ref.js","webpack://_N_E/./node_modules/es-errors/syntax.js","webpack://_N_E/./node_modules/es-errors/type.js","webpack://_N_E/./node_modules/es-errors/uri.js","webpack://_N_E/./node_modules/eventemitter3/index.js","webpack://_N_E/./node_modules/for-each/index.js","webpack://_N_E/./node_modules/function-bind/implementation.js","webpack://_N_E/./node_modules/function-bind/index.js","webpack://_N_E/./node_modules/get-intrinsic/index.js","webpack://_N_E/./node_modules/gopd/index.js","webpack://_N_E/./node_modules/has-property-descriptors/index.js","webpack://_N_E/./node_modules/has-proto/index.js","webpack://_N_E/./node_modules/has-symbols/index.js","webpack://_N_E/./node_modules/has-symbols/shams.js","webpack://_N_E/./node_modules/has-tostringtag/shams.js","webpack://_N_E/./node_modules/hasown/index.js","webpack://_N_E/./node_modules/hoist-non-react-statics/dist/hoist-non-react-statics.cjs.js","webpack://_N_E/./node_modules/hoist-non-react-statics/node_modules/react-is/cjs/react-is.production.min.js","webpack://_N_E/./node_modules/hoist-non-react-statics/node_modules/react-is/index.js","webpack://_N_E/./node_modules/ieee754/index.js","webpack://_N_E/./node_modules/inherits/inherits_browser.js","webpack://_N_E/./node_modules/is-arguments/index.js","webpack://_N_E/./node_modules/is-callable/index.js","webpack://_N_E/./node_modules/is-generator-function/index.js","webpack://_N_E/./node_modules/is-nan/implementation.js","webpack://_N_E/./node_modules/is-nan/index.js","webpack://_N_E/./node_modules/is-nan/polyfill.js","webpack://_N_E/./node_modules/is-nan/shim.js","webpack://_N_E/./node_modules/is-typed-array/index.js","webpack://_N_E/./node_modules/jayson/lib/client/browser/index.js","webpack://_N_E/./node_modules/jayson/lib/generateRequest.js","webpack://_N_E/./node_modules/js-sha256/src/sha256.js","webpack://_N_E/./node_modules/js-sha3/src/sha3.js","webpack://_N_E/./node_modules/jsbi/dist/jsbi-umd.js","webpack://_N_E/./node_modules/lodash.debounce/index.js","webpack://_N_E/./node_modules/next/dist/build/polyfills/object.assign/polyfill.js","webpack://_N_E/?adc8","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/is-browser.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/use-isomorphic-effect.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/use-is-mounted.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/noop.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/GlobalConfig.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/frameloop/render-step.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/frameloop/batcher.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/frameloop/frame.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/use-force-update.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/context/PresenceContext.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/use-constant.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/context/MotionConfigContext.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/components/AnimatePresence/PopChild.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/components/AnimatePresence/PresenceChild.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/context/LayoutGroupContext.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/use-unmount-effect.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/utils/errors.mjs","webpack://_N_E/./node_modules/framer-motion/dist/es/components/AnimatePresence/index.mjs","webpack://_N_E/./node_modules/usehooks-ts/dist/index.mjs","webpack://_N_E/./src/hooks/use-local-storage.ts","webpack://_N_E/./node_modules/@mui/private-theming/useTheme/ThemeContext.js","webpack://_N_E/./node_modules/@mui/private-theming/useTheme/useTheme.js","webpack://_N_E/./node_modules/@mui/private-theming/ThemeProvider/nested.js","webpack://_N_E/./node_modules/@mui/private-theming/ThemeProvider/ThemeProvider.js","webpack://_N_E/./node_modules/@mui/system/esm/ThemeProvider/ThemeProvider.js","webpack://_N_E/./node_modules/@mui/material/styles/ThemeProvider.js","webpack://_N_E/./node_modules/@mui/material/CssBaseline/CssBaseline.js","webpack://_N_E/./src/providers/theme/options.ts","webpack://_N_E/./src/providers/theme/index.tsx","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/types.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/useConnection.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/ConnectionProvider.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/errors.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/adapter.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/transaction.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/signer.js","webpack://_N_E/./node_modules/@solana/wallet-standard-util/lib/esm/signIn.js","webpack://_N_E/./node_modules/@solana-mobile/mobile-wallet-adapter-protocol/lib/esm/index.js","webpack://_N_E/./node_modules/@solana-mobile/mobile-wallet-adapter-protocol-web3js/lib/esm/index.js","webpack://_N_E/./node_modules/@solana-mobile/wallet-adapter-mobile/lib/esm/index.js","webpack://_N_E/./node_modules/@wallet-standard/features/lib/esm/connect.js","webpack://_N_E/./node_modules/@wallet-standard/features/lib/esm/events.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-base/lib/esm/standard.js","webpack://_N_E/./node_modules/@solana/wallet-standard-wallet-adapter-base/lib/esm/types.js","webpack://_N_E/./node_modules/@solana/wallet-standard-features/lib/esm/signIn.js","webpack://_N_E/./node_modules/@solana/wallet-standard-chains/lib/esm/index.js","webpack://_N_E/./node_modules/@solana/wallet-standard-util/lib/esm/endpoint.js","webpack://_N_E/./node_modules/@solana/wallet-standard-util/lib/esm/commitment.js","webpack://_N_E/./node_modules/@wallet-standard/features/lib/esm/disconnect.js","webpack://_N_E/./node_modules/@wallet-standard/wallet/lib/esm/util.js","webpack://_N_E/./node_modules/@solana/wallet-standard-wallet-adapter-base/lib/esm/adapter.js","webpack://_N_E/./node_modules/@wallet-standard/app/lib/esm/wallets.js","webpack://_N_E/./node_modules/@solana/wallet-standard-wallet-adapter-react/lib/esm/useStandardWalletAdapters.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/getEnvironment.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/getInferredClusterFromEndpoint.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/useLocalStorage.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/errors.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/WalletProviderBase.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/WalletProvider.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/Collapse.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/Button.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletIcon.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletListItem.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletSVG.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletModal.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletModalProvider.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-phantom/lib/esm/adapter.js","webpack://_N_E/./node_modules/@wallet-standard/wallet/lib/esm/register.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/icon.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/wallet.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/detect.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-solflare/lib/esm/adapter.js","webpack://_N_E/./src/providers/wallet/index.tsx","webpack://_N_E/./src/utils/create-emotion-cache.ts","webpack://_N_E/./src/pages/_app.tsx","webpack://_N_E/./src/types/merkle_distributor.ts","webpack://_N_E/./src/providers/solana/index.tsx","webpack://_N_E/./src/styles/global.scss","webpack://_N_E/./node_modules/@fontsource-variable/inter/index.css","webpack://_N_E/./node_modules/@fontsource/rubik-mono-one/index.css","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/styles.css","webpack://_N_E/./node_modules/next/head.js","webpack://_N_E/./node_modules/object-is/implementation.js","webpack://_N_E/./node_modules/object-is/index.js","webpack://_N_E/./node_modules/object-is/polyfill.js","webpack://_N_E/./node_modules/object-is/shim.js","webpack://_N_E/./node_modules/object-keys/implementation.js","webpack://_N_E/./node_modules/object-keys/index.js","webpack://_N_E/./node_modules/object-keys/isArguments.js","webpack://_N_E/./node_modules/possible-typed-array-names/index.js","webpack://_N_E/./node_modules/process/browser.js","webpack://_N_E/./node_modules/promise-retry/index.js","webpack://_N_E/./node_modules/promise-retry/node_modules/retry/index.js","webpack://_N_E/./node_modules/promise-retry/node_modules/retry/lib/retry.js","webpack://_N_E/./node_modules/promise-retry/node_modules/retry/lib/retry_operation.js","webpack://_N_E/./node_modules/prop-types/factoryWithThrowingShims.js","webpack://_N_E/./node_modules/prop-types/index.js","webpack://_N_E/./node_modules/prop-types/lib/ReactPropTypesSecret.js","webpack://_N_E/./node_modules/react-query/devtools/index.js","webpack://_N_E/./node_modules/react-query/es/core/focusManager.js","webpack://_N_E/./node_modules/react-query/es/core/index.js","webpack://_N_E/./node_modules/react-query/es/core/logger.js","webpack://_N_E/./node_modules/react-query/es/core/mutation.js","webpack://_N_E/./node_modules/react-query/es/core/notifyManager.js","webpack://_N_E/./node_modules/react-query/es/core/onlineManager.js","webpack://_N_E/./node_modules/react-query/es/core/query.js","webpack://_N_E/./node_modules/react-query/es/core/queryCache.js","webpack://_N_E/./node_modules/react-query/es/core/mutationCache.js","webpack://_N_E/./node_modules/react-query/es/core/infiniteQueryBehavior.js","webpack://_N_E/./node_modules/react-query/es/core/queryClient.js","webpack://_N_E/./node_modules/react-query/es/core/retryer.js","webpack://_N_E/./node_modules/react-query/es/core/subscribable.js","webpack://_N_E/./node_modules/react-query/es/core/types.js","webpack://_N_E/./node_modules/react-query/es/core/utils.js","webpack://_N_E/./node_modules/react-query/es/index.js","webpack://_N_E/./node_modules/react-query/es/react/reactBatchedUpdates.js","webpack://_N_E/./node_modules/react-query/es/react/setBatchUpdatesFn.js","webpack://_N_E/./node_modules/react-query/es/react/logger.js","webpack://_N_E/./node_modules/react-query/es/react/setLogger.js","webpack://_N_E/./node_modules/react-query/es/react/QueryClientProvider.js","webpack://_N_E/./node_modules/react-query/es/core/mutationObserver.js","webpack://_N_E/./node_modules/react-query/es/react/utils.js","webpack://_N_E/./node_modules/react-query/es/react/useMutation.js","webpack://_N_E/./node_modules/react-query/es/core/queryObserver.js","webpack://_N_E/./node_modules/react-query/es/react/QueryErrorResetBoundary.js","webpack://_N_E/./node_modules/react-query/es/react/useBaseQuery.js","webpack://_N_E/./node_modules/react-query/es/react/useQuery.js","webpack://_N_E/./node_modules/react-query/es/core/hydration.js","webpack://_N_E/./node_modules/react-query/es/react/Hydrate.js","webpack://_N_E/./node_modules/react-query/es/react/index.js","webpack://_N_E/./node_modules/rpc-websockets/node_modules/eventemitter3/index.js","webpack://_N_E/./node_modules/safe-buffer/index.js","webpack://_N_E/./node_modules/set-function-length/index.js","webpack://_N_E/./node_modules/tiny-invariant/dist/tiny-invariant.cjs.js","webpack://_N_E/./node_modules/util/support/isBufferBrowser.js","webpack://_N_E/./node_modules/util/support/types.js","webpack://_N_E/./node_modules/util/util.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/rng.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/regex.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/validate.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/stringify.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/v4.js","webpack://_N_E/./node_modules/uuid/dist/esm-browser/index.js","webpack://_N_E/./node_modules/which-typed-array/index.js","webpack://_N_E/ignored|/codebuild/output/src3331091090/src/frontend/node_modules/@coral-xyz/anchor/dist/cjs|fs","webpack://_N_E/ignored|/codebuild/output/src3331091090/src/frontend/node_modules/bn.js/lib|buffer","webpack://_N_E/./node_modules/@babel/runtime/helpers/interopRequireDefault.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/base.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/bigint.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/decimal.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/index.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/native.js","webpack://_N_E/./node_modules/@solana/buffer-layout-utils/lib/cjs/web3.js","webpack://_N_E/./node_modules/available-typed-arrays/index.js","webpack://_N_E/./node_modules/@babel/runtime/helpers/esm/extends.js","webpack://_N_E/./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js","webpack://_N_E/./node_modules/@babel/runtime/helpers/esm/inheritsLoose.js","webpack://_N_E/./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","webpack://_N_E/./node_modules/@noble/hashes/esm/_assert.js","webpack://_N_E/./node_modules/@noble/hashes/esm/_md.js","webpack://_N_E/./node_modules/@noble/hashes/esm/sha256.js","webpack://_N_E/./node_modules/@noble/hashes/esm/crypto.js","webpack://_N_E/./node_modules/@noble/hashes/esm/utils.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react-ui/lib/esm/useWalletModal.js","webpack://_N_E/./node_modules/@solana/wallet-adapter-react/lib/esm/useWallet.js","webpack://_N_E/./node_modules/@solana/wallet-standard-features/lib/esm/signAndSendTransaction.js","webpack://_N_E/./node_modules/@solana/wallet-standard-features/lib/esm/signMessage.js","webpack://_N_E/./node_modules/@solana/wallet-standard-features/lib/esm/signTransaction.js","webpack://_N_E/./node_modules/pako/dist/pako.esm.mjs","webpack://_N_E/./node_modules/text-encoding-utf-8/lib/encoding.lib.mjs","webpack://_N_E/./node_modules/tslib/tslib.es6.mjs","webpack://_N_E/<anon>"],"sourcesContent":["import { Buffer as Buffer$1 } from 'buffer';\nimport { PublicKey, Transaction, TransactionInstruction, SendTransactionError, NONCE_ACCOUNT_LENGTH, SystemProgram } from '@solana/web3.js';\nimport * as web3_js from '@solana/web3.js';\nexport { web3_js as web3 };\nimport BN from 'bn.js';\nexport { default as BN } from 'bn.js';\nimport bs58$1 from 'bs58';\nimport camelCase from 'camelcase';\nimport * as borsh from '@coral-xyz/borsh';\nimport { sha256 as sha256$1 } from '@noble/hashes/sha256';\nimport { inflate } from 'pako';\nimport EventEmitter from 'eventemitter3';\n\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\n\nfunction encode$3(data) {\n    return data.reduce((str, byte) => str + byte.toString(16).padStart(2, \"0\"), \"0x\");\n}\nfunction decode$3(data) {\n    if (data.indexOf(\"0x\") === 0) {\n        data = data.substr(2);\n    }\n    if (data.length % 2 === 1) {\n        data = \"0\" + data;\n    }\n    let key = data.match(/.{2}/g);\n    if (key === null) {\n        return Buffer$1.from([]);\n    }\n    return Buffer$1.from(key.map((byte) => parseInt(byte, 16)));\n}\n\nvar hex = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$3,\n    decode: decode$3\n});\n\nfunction decode$2(array) {\n    const decoder = new TextDecoder(\"utf-8\") // Browser https://caniuse.com/textencoder.\n        ; // Node.\n    return decoder.decode(array);\n}\nfunction encode$2(input) {\n    const encoder = new TextEncoder() // Browser.\n        ; // Node.\n    return encoder.encode(input);\n}\n\nvar utf8 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    decode: decode$2,\n    encode: encode$2\n});\n\nfunction encode$1(data) {\n    return bs58$1.encode(data);\n}\nfunction decode$1(data) {\n    return bs58$1.decode(data);\n}\n\nvar bs58 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$1,\n    decode: decode$1\n});\n\nfunction encode(data) {\n    return data.toString(\"base64\");\n}\nfunction decode(data) {\n    return Buffer$1.from(data, \"base64\");\n}\n\nvar base64 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode,\n    decode: decode\n});\n\nvar index$1 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hex: hex,\n    utf8: utf8,\n    bs58: bs58,\n    base64: base64\n});\n\nfunction isCompositeAccounts(accountItem) {\n    return \"accounts\" in accountItem;\n}\n// Deterministic IDL address as a function of the program id.\nasync function idlAddress(programId) {\n    const base = (await PublicKey.findProgramAddress([], programId))[0];\n    return await PublicKey.createWithSeed(base, seed(), programId);\n}\n// Seed for generating the idlAddress.\nfunction seed() {\n    return \"anchor:idl\";\n}\nconst IDL_ACCOUNT_LAYOUT = borsh.struct([\n    borsh.publicKey(\"authority\"),\n    borsh.vecU8(\"data\"),\n]);\nfunction decodeIdlAccount(data) {\n    return IDL_ACCOUNT_LAYOUT.decode(data);\n}\n/**\n * Convert the given IDL to camelCase.\n *\n * The IDL is generated from Rust which has different conventions compared to\n * JS/TS, e.g. instruction names in Rust are snake_case.\n *\n * The conversion happens automatically for programs, however, if you are using\n * internals such as `BorshInstructionCoder` and you only have the original\n * (not camelCase) IDL, you might need to use this function.\n *\n * @param idl IDL to convert to camelCase\n * @returns camelCase version of the IDL\n */\nfunction convertIdlToCamelCase(idl) {\n    const KEYS_TO_CONVERT = [\"name\", \"path\", \"account\", \"relations\", \"generic\"];\n    // `my_account.field` is getting converted to `myAccountField` but we\n    // need `myAccount.field`.\n    const toCamelCase = (s) => s.split(\".\").map(camelCase).join(\".\");\n    const recursivelyConvertNamesToCamelCase = (obj) => {\n        for (const key in obj) {\n            const val = obj[key];\n            if (KEYS_TO_CONVERT.includes(key)) {\n                obj[key] = Array.isArray(val) ? val.map(toCamelCase) : toCamelCase(val);\n            }\n            else if (typeof val === \"object\") {\n                recursivelyConvertNamesToCamelCase(val);\n            }\n        }\n    };\n    const camelCasedIdl = structuredClone(idl);\n    recursivelyConvertNamesToCamelCase(camelCasedIdl);\n    return camelCasedIdl;\n}\n/** Conveniently handle all defined field kinds with proper type support. */\nfunction handleDefinedFields(fields, unitCb, namedCb, tupleCb) {\n    // Unit\n    if (!(fields === null || fields === void 0 ? void 0 : fields.length))\n        return unitCb();\n    // Named\n    if (fields[0].name) {\n        return namedCb(fields);\n    }\n    // Tuple\n    return tupleCb(fields);\n}\n\nfunction parseIdlErrors(idl) {\n    const errors = new Map();\n    if (idl.errors) {\n        idl.errors.forEach((e) => {\n            var _a;\n            let msg = (_a = e.msg) !== null && _a !== void 0 ? _a : e.name;\n            errors.set(e.code, msg);\n        });\n    }\n    return errors;\n}\nfunction toInstruction(idlIx, ...args) {\n    if (idlIx.args.length != args.length) {\n        throw new Error(\"Invalid argument length\");\n    }\n    const ix = {};\n    let idx = 0;\n    idlIx.args.forEach((ixArg) => {\n        ix[ixArg.name] = args[idx];\n        idx += 1;\n    });\n    return ix;\n}\n// Throws error if any account required for the `ix` is not given.\nfunction validateAccounts(ixAccounts, accounts = {}) {\n    ixAccounts.forEach((acc) => {\n        if (isCompositeAccounts(acc)) {\n            validateAccounts(acc.accounts, accounts[acc.name]);\n        }\n        else {\n            if (!accounts[acc.name]) {\n                throw new Error(`Account \\`${acc.name}\\` not provided.`);\n            }\n        }\n    });\n}\n// Translates an address to a Pubkey.\nfunction translateAddress(address) {\n    return address instanceof PublicKey ? address : new PublicKey(address);\n}\n\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n  constructor(failure, failures) {\n    let cached;\n    const {\n      message,\n      ...rest\n    } = failure;\n    const {\n      path\n    } = failure;\n    const msg = path.length === 0 ? message : \"At path: \" + path.join('.') + \" -- \" + message;\n    super(msg);\n    this.value = void 0;\n    this.key = void 0;\n    this.type = void 0;\n    this.refinement = void 0;\n    this.path = void 0;\n    this.branch = void 0;\n    this.failures = void 0;\n    Object.assign(this, rest);\n    this.name = this.constructor.name;\n\n    this.failures = () => {\n      var _cached;\n\n      return (_cached = cached) != null ? _cached : cached = [failure, ...failures()];\n    };\n  }\n\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n  return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\n\n\nfunction isObject(x) {\n  return typeof x === 'object' && x != null;\n}\n/**\n * Return a value as a printable string.\n */\n\nfunction print(value) {\n  return typeof value === 'string' ? JSON.stringify(value) : \"\" + value;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\n\nfunction shiftIterator(input) {\n  const {\n    done,\n    value\n  } = input.next();\n  return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\n\nfunction toFailure(result, context, struct, value) {\n  if (result === true) {\n    return;\n  } else if (result === false) {\n    result = {};\n  } else if (typeof result === 'string') {\n    result = {\n      message: result\n    };\n  }\n\n  const {\n    path,\n    branch\n  } = context;\n  const {\n    type\n  } = struct;\n  const {\n    refinement,\n    message = \"Expected a value of type `\" + type + \"`\" + (refinement ? \" with refinement `\" + refinement + \"`\" : '') + \", but received: `\" + print(value) + \"`\"\n  } = result;\n  return {\n    value,\n    type,\n    refinement,\n    key: path[path.length - 1],\n    path,\n    branch,\n    ...result,\n    message\n  };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\n\nfunction* toFailures(result, context, struct, value) {\n  if (!isIterable(result)) {\n    result = [result];\n  }\n\n  for (const r of result) {\n    const failure = toFailure(r, context, struct, value);\n\n    if (failure) {\n      yield failure;\n    }\n  }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\n\nfunction* run(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const {\n    path = [],\n    branch = [value],\n    coerce = false,\n    mask = false\n  } = options;\n  const ctx = {\n    path,\n    branch\n  };\n\n  if (coerce) {\n    value = struct.coercer(value, ctx);\n\n    if (mask && struct.type !== 'type' && isObject(struct.schema) && isObject(value) && !Array.isArray(value)) {\n      for (const key in value) {\n        if (struct.schema[key] === undefined) {\n          delete value[key];\n        }\n      }\n    }\n  }\n\n  let valid = true;\n\n  for (const failure of struct.validator(value, ctx)) {\n    valid = false;\n    yield [failure, undefined];\n  }\n\n  for (let [k, v, s] of struct.entries(value, ctx)) {\n    const ts = run(v, s, {\n      path: k === undefined ? path : [...path, k],\n      branch: k === undefined ? branch : [...branch, v],\n      coerce,\n      mask\n    });\n\n    for (const t of ts) {\n      if (t[0]) {\n        valid = false;\n        yield [t[0], undefined];\n      } else if (coerce) {\n        v = t[1];\n\n        if (k === undefined) {\n          value = v;\n        } else if (value instanceof Map) {\n          value.set(k, v);\n        } else if (value instanceof Set) {\n          value.add(v);\n        } else if (isObject(value)) {\n          value[k] = v;\n        }\n      }\n    }\n  }\n\n  if (valid) {\n    for (const failure of struct.refiner(value, ctx)) {\n      valid = false;\n      yield [failure, undefined];\n    }\n  }\n\n  if (valid) {\n    yield [undefined, value];\n  }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\n\nclass Struct {\n  constructor(props) {\n    this.TYPE = void 0;\n    this.type = void 0;\n    this.schema = void 0;\n    this.coercer = void 0;\n    this.validator = void 0;\n    this.refiner = void 0;\n    this.entries = void 0;\n    const {\n      type,\n      schema,\n      validator,\n      refiner,\n      coercer = value => value,\n      entries = function* () {}\n    } = props;\n    this.type = type;\n    this.schema = schema;\n    this.entries = entries;\n    this.coercer = coercer;\n\n    if (validator) {\n      this.validator = (value, context) => {\n        const result = validator(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.validator = () => [];\n    }\n\n    if (refiner) {\n      this.refiner = (value, context) => {\n        const result = refiner(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.refiner = () => [];\n    }\n  }\n  /**\n   * Assert that a value passes the struct's validation, throwing if it doesn't.\n   */\n\n\n  assert(value) {\n    return assert(value, this);\n  }\n  /**\n   * Create a value with the struct's coercion logic, then validate it.\n   */\n\n\n  create(value) {\n    return create(value, this);\n  }\n  /**\n   * Check if a value passes the struct's validation.\n   */\n\n\n  is(value) {\n    return is(value, this);\n  }\n  /**\n   * Mask a value, coercing and validating it, but returning only the subset of\n   * properties defined by the struct's schema.\n   */\n\n\n  mask(value) {\n    return mask(value, this);\n  }\n  /**\n   * Validate a value with the struct's validation logic, returning a tuple\n   * representing the result.\n   *\n   * You may optionally pass `true` for the `withCoercion` argument to coerce\n   * the value before attempting to validate it. If you do, the result will\n   * contain the coerced result when successful.\n   */\n\n\n  validate(value, options) {\n    if (options === void 0) {\n      options = {};\n    }\n\n    return validate(value, this, options);\n  }\n\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\n\nfunction assert(value, struct) {\n  const result = validate(value, struct);\n\n  if (result[0]) {\n    throw result[0];\n  }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\n\nfunction create(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\n\nfunction mask(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true,\n    mask: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Check if a value passes a struct.\n */\n\nfunction is(value, struct) {\n  const result = validate(value, struct);\n  return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\n\nfunction validate(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const tuples = run(value, struct, options);\n  const tuple = shiftIterator(tuples);\n\n  if (tuple[0]) {\n    const error = new StructError(tuple[0], function* () {\n      for (const t of tuples) {\n        if (t[0]) {\n          yield t[0];\n        }\n      }\n    });\n    return [error, undefined];\n  } else {\n    const v = tuple[1];\n    return [undefined, v];\n  }\n}\n/**\n * Define a new struct type with a custom validation function.\n */\n\nfunction define(name, validator) {\n  return new Struct({\n    type: name,\n    schema: null,\n    validator\n  });\n}\n\n/**\n * Ensure that any value passes validation.\n */\n\nfunction any() {\n  return define('any', () => true);\n}\nfunction array(Element) {\n  return new Struct({\n    type: 'array',\n    schema: Element,\n\n    *entries(value) {\n      if (Element && Array.isArray(value)) {\n        for (const [i, v] of value.entries()) {\n          yield [i, v, Element];\n        }\n      }\n    },\n\n    coercer(value) {\n      return Array.isArray(value) ? value.slice() : value;\n    },\n\n    validator(value) {\n      return Array.isArray(value) || \"Expected an array value, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value is a boolean.\n */\n\nfunction boolean() {\n  return define('boolean', value => {\n    return typeof value === 'boolean';\n  });\n}\nfunction literal(constant) {\n  const description = print(constant);\n  const t = typeof constant;\n  return new Struct({\n    type: 'literal',\n    schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n\n    validator(value) {\n      return value === constant || \"Expected the literal `\" + description + \"`, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\n\nfunction nullable(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === null || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === null || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a number.\n */\n\nfunction number() {\n  return define('number', value => {\n    return typeof value === 'number' && !isNaN(value) || \"Expected a number, but received: \" + print(value);\n  });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\n\nfunction optional(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a string.\n */\n\nfunction string() {\n  return define('string', value => {\n    return typeof value === 'string' || \"Expected a string, but received: \" + print(value);\n  });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\n\nfunction type(schema) {\n  const keys = Object.keys(schema);\n  return new Struct({\n    type: 'type',\n    schema,\n\n    *entries(value) {\n      if (isObject(value)) {\n        for (const k of keys) {\n          yield [k, value[k], schema[k]];\n        }\n      }\n    },\n\n    validator(value) {\n      return isObject(value) || \"Expected an object, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\n\nfunction union$1(Structs) {\n  const description = Structs.map(s => s.type).join(' | ');\n  return new Struct({\n    type: 'union',\n    schema: null,\n\n    coercer(value, ctx) {\n      const firstMatch = Structs.find(s => {\n        const [e] = s.validate(value, {\n          coerce: true\n        });\n        return !e;\n      }) || unknown();\n      return firstMatch.coercer(value, ctx);\n    },\n\n    validator(value, ctx) {\n      const failures = [];\n\n      for (const S of Structs) {\n        const [...tuples] = run(value, S, ctx);\n        const [first] = tuples;\n\n        if (!first[0]) {\n          return [];\n        } else {\n          for (const [failure] of tuples) {\n            if (failure) {\n              failures.push(failure);\n            }\n          }\n        }\n      }\n\n      return [\"Expected the value to satisfy a union of `\" + description + \"`, but received: \" + print(value), ...failures];\n    }\n\n  });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\n\nfunction unknown() {\n  return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\n\nfunction coerce(struct, condition, coercer) {\n  return new Struct({ ...struct,\n    coercer: (value, ctx) => {\n      return is(value, condition) ? struct.coercer(coercer(value, ctx), ctx) : struct.coercer(value, ctx);\n    }\n  });\n}\n\n/**\n * Sends a transaction to a program with the given accounts and instruction\n * data.\n */\nasync function invoke(programId, accounts, data, provider) {\n    programId = translateAddress(programId);\n    if (!provider) {\n        provider = getProvider();\n    }\n    const tx = new Transaction();\n    tx.add(new TransactionInstruction({\n        programId,\n        keys: accounts !== null && accounts !== void 0 ? accounts : [],\n        data,\n    }));\n    if (provider.sendAndConfirm === undefined) {\n        throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n    }\n    return await provider.sendAndConfirm(tx, []);\n}\nconst GET_MULTIPLE_ACCOUNTS_LIMIT = 99;\nasync function getMultipleAccounts(connection, publicKeys, commitment) {\n    const results = await getMultipleAccountsAndContext(connection, publicKeys, commitment);\n    return results.map((result) => {\n        return result\n            ? { publicKey: result.publicKey, account: result.account }\n            : null;\n    });\n}\nasync function getMultipleAccountsAndContext(connection, publicKeys, commitment) {\n    if (publicKeys.length <= GET_MULTIPLE_ACCOUNTS_LIMIT) {\n        return await getMultipleAccountsAndContextCore(connection, publicKeys, commitment);\n    }\n    else {\n        const batches = chunks(publicKeys, GET_MULTIPLE_ACCOUNTS_LIMIT);\n        const results = await Promise.all(batches.map((batch) => getMultipleAccountsAndContextCore(connection, batch, commitment)));\n        return results.flat();\n    }\n}\nasync function getMultipleAccountsAndContextCore(connection, publicKeys, commitmentOverride) {\n    const commitment = commitmentOverride !== null && commitmentOverride !== void 0 ? commitmentOverride : connection.commitment;\n    const { value: accountInfos, context } = await connection.getMultipleAccountsInfoAndContext(publicKeys, commitment);\n    const accounts = accountInfos.map((account, idx) => {\n        if (account === null) {\n            return null;\n        }\n        return {\n            publicKey: publicKeys[idx],\n            account,\n            context,\n        };\n    });\n    return accounts;\n}\n// copy from @solana/web3.js that has a commitment param\nasync function simulateTransaction(connection, transaction, signers, commitment, includeAccounts) {\n    var _a;\n    if (signers && signers.length > 0) {\n        transaction.sign(...signers);\n    }\n    // @ts-expect-error\n    const message = transaction._compile();\n    const signData = message.serialize();\n    // @ts-expect-error\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = {\n        encoding: \"base64\",\n        commitment: commitment !== null && commitment !== void 0 ? commitment : connection.commitment,\n    };\n    if (includeAccounts) {\n        const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map((key) => key.toBase58());\n        config[\"accounts\"] = {\n            encoding: \"base64\",\n            addresses,\n        };\n    }\n    if (signers && signers.length > 0) {\n        config.sigVerify = true;\n    }\n    const args = [encodedTransaction, config];\n    // @ts-expect-error\n    const unsafeRes = await connection._rpcRequest(\"simulateTransaction\", args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if (\"error\" in res) {\n        let logs;\n        if (\"data\" in res.error) {\n            logs = (_a = res.error.data) === null || _a === void 0 ? void 0 : _a.logs;\n            if (logs && Array.isArray(logs)) {\n                const traceIndent = \"\\n    \";\n                const logTrace = traceIndent + logs.join(traceIndent);\n                console.error(res.error.message, logTrace);\n            }\n        }\n        throw new SendTransactionError(\"failed to simulate transaction: \" + res.error.message, logs);\n    }\n    return res.result;\n}\n// copy from @solana/web3.js\nfunction jsonRpcResult(schema) {\n    return coerce(createRpcResult(schema), UnknownRpcResult, (value) => {\n        if (\"error\" in value) {\n            return value;\n        }\n        else {\n            return {\n                ...value,\n                result: create(value.result, schema),\n            };\n        }\n    });\n}\n// copy from @solana/web3.js\nconst UnknownRpcResult = createRpcResult(unknown());\n// copy from @solana/web3.js\nfunction createRpcResult(result) {\n    return union$1([\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            result,\n        }),\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            error: type({\n                code: unknown(),\n                message: string(),\n                data: optional(any()),\n            }),\n        }),\n    ]);\n}\n// copy from @solana/web3.js\nfunction jsonRpcResultAndContext(value) {\n    return jsonRpcResult(type({\n        context: type({\n            slot: number(),\n        }),\n        value,\n    }));\n}\n// copy from @solana/web3.js\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n    err: nullable(union$1([type({}), string()])),\n    logs: nullable(array(string())),\n    accounts: optional(nullable(array(nullable(type({\n        executable: boolean(),\n        owner: string(),\n        lamports: number(),\n        data: array(string()),\n        rentEpoch: optional(number()),\n    }))))),\n    unitsConsumed: optional(number()),\n}));\n\nvar rpc = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    invoke: invoke,\n    getMultipleAccounts: getMultipleAccounts,\n    getMultipleAccountsAndContext: getMultipleAccountsAndContext,\n    simulateTransaction: simulateTransaction\n});\n\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n */\nclass AnchorProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, wallet, opts = AnchorProvider.defaultOptions()) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.publicKey = wallet === null || wallet === void 0 ? void 0 : wallet.publicKey;\n    }\n    static defaultOptions() {\n        return {\n            preflightCommitment: \"processed\",\n            commitment: \"processed\",\n        };\n    }\n    /**\n     * Returns a `Provider` with a wallet read from the local filesystem.\n     *\n     * @param url  The network cluster url.\n     * @param opts The default transaction confirmation options.\n     *\n     * (This api is for Node only.)\n     */\n    static local(url, opts = AnchorProvider.defaultOptions()) {\n        {\n            throw new Error(`Provider local is not available on browser.`);\n        }\n    }\n    /**\n     * Returns a `Provider` read from the `ANCHOR_PROVIDER_URL` environment\n     * variable\n     *\n     * (This api is for Node only.)\n     */\n    static env() {\n        {\n            throw new Error(`Provider env is not available on browser.`);\n        }\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sendAndConfirm(tx, signers, opts) {\n        var _a, _b, _c, _d;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n            }\n        }\n        else {\n            tx.feePayer = (_a = tx.feePayer) !== null && _a !== void 0 ? _a : this.wallet.publicKey;\n            tx.recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n            if (signers) {\n                for (const signer of signers) {\n                    tx.partialSign(signer);\n                }\n            }\n        }\n        tx = await this.wallet.signTransaction(tx);\n        const rawTx = tx.serialize();\n        try {\n            return await sendAndConfirmRawTransaction(this.connection, rawTx, opts);\n        }\n        catch (err) {\n            // thrown if the underlying 'confirmTransaction' encounters a failed tx\n            // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n            if (err instanceof ConfirmError) {\n                // choose the shortest available commitment for 'getTransaction'\n                // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                // commitment `sendAndConfirmRawTransaction` used\n                const txSig = encode$1(isVersionedTransaction(tx)\n                    ? ((_b = tx.signatures) === null || _b === void 0 ? void 0 : _b[0]) || new Uint8Array()\n                    : (_c = tx.signature) !== null && _c !== void 0 ? _c : new Uint8Array());\n                const maxVer = isVersionedTransaction(tx) ? 0 : undefined;\n                const failedTx = await this.connection.getTransaction(txSig, {\n                    commitment: \"confirmed\",\n                    maxSupportedTransactionVersion: maxVer,\n                });\n                if (!failedTx) {\n                    throw err;\n                }\n                else {\n                    const logs = (_d = failedTx.meta) === null || _d === void 0 ? void 0 : _d.logMessages;\n                    throw !logs ? err : new SendTransactionError(err.message, logs);\n                }\n            }\n            else {\n                throw err;\n            }\n        }\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     * All transactions need to be of the same type, it doesn't support a mix of `VersionedTransaction`s and `Transaction`s.\n     *\n     * @param txWithSigners Array of transactions and signers.\n     * @param opts          Transaction confirmation options.\n     */\n    async sendAll(txWithSigners, opts) {\n        var _a, _b, _c;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        const recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n        let txs = txWithSigners.map((r) => {\n            var _a, _b;\n            if (isVersionedTransaction(r.tx)) {\n                let tx = r.tx;\n                if (r.signers) {\n                    tx.sign(r.signers);\n                }\n                return tx;\n            }\n            else {\n                let tx = r.tx;\n                let signers = (_a = r.signers) !== null && _a !== void 0 ? _a : [];\n                tx.feePayer = (_b = tx.feePayer) !== null && _b !== void 0 ? _b : this.wallet.publicKey;\n                tx.recentBlockhash = recentBlockhash;\n                signers.forEach((kp) => {\n                    tx.partialSign(kp);\n                });\n                return tx;\n            }\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        const sigs = [];\n        for (let k = 0; k < txs.length; k += 1) {\n            const tx = signedTxs[k];\n            const rawTx = tx.serialize();\n            try {\n                sigs.push(await sendAndConfirmRawTransaction(this.connection, rawTx, opts));\n            }\n            catch (err) {\n                // thrown if the underlying 'confirmTransaction' encounters a failed tx\n                // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n                if (err instanceof ConfirmError) {\n                    // choose the shortest available commitment for 'getTransaction'\n                    // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                    // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                    // commitment `sendAndConfirmRawTransaction` used\n                    const txSig = encode$1(isVersionedTransaction(tx)\n                        ? ((_a = tx.signatures) === null || _a === void 0 ? void 0 : _a[0]) || new Uint8Array()\n                        : (_b = tx.signature) !== null && _b !== void 0 ? _b : new Uint8Array());\n                    const maxVer = isVersionedTransaction(tx) ? 0 : undefined;\n                    const failedTx = await this.connection.getTransaction(txSig, {\n                        commitment: \"confirmed\",\n                        maxSupportedTransactionVersion: maxVer,\n                    });\n                    if (!failedTx) {\n                        throw err;\n                    }\n                    else {\n                        const logs = (_c = failedTx.meta) === null || _c === void 0 ? void 0 : _c.logMessages;\n                        throw !logs ? err : new SendTransactionError(err.message, logs);\n                    }\n                }\n                else {\n                    throw err;\n                }\n            }\n        }\n        return sigs;\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction. If unset, the transaction\n     *                will be simulated with the \"sigVerify: false\" option. This\n     *                allows for simulation of transactions without asking the\n     *                wallet for a signature.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, commitment, includeAccounts) {\n        let recentBlockhash = (await this.connection.getLatestBlockhash(commitment !== null && commitment !== void 0 ? commitment : this.connection.commitment)).blockhash;\n        let result;\n        if (isVersionedTransaction(tx)) {\n            if (signers && signers.length > 0) {\n                tx.sign(signers);\n                tx = await this.wallet.signTransaction(tx);\n            }\n            // Doesn't support includeAccounts which has been changed to something\n            // else in later versions of this function.\n            result = await this.connection.simulateTransaction(tx, { commitment });\n        }\n        else {\n            tx.feePayer = tx.feePayer || this.wallet.publicKey;\n            tx.recentBlockhash = recentBlockhash;\n            if (signers && signers.length > 0) {\n                tx = await this.wallet.signTransaction(tx);\n            }\n            result = await simulateTransaction(this.connection, tx, signers, commitment, includeAccounts);\n        }\n        if (result.value.err) {\n            throw new SimulateError(result.value);\n        }\n        return result.value;\n    }\n}\nclass SimulateError extends Error {\n    constructor(simulationResponse, message) {\n        super(message);\n        this.simulationResponse = simulationResponse;\n    }\n}\n// Copy of Connection.sendAndConfirmRawTransaction that throws\n// a better error if 'confirmTransaction` returns an error status\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, options) {\n    const sendOptions = options && {\n        skipPreflight: options.skipPreflight,\n        preflightCommitment: options.preflightCommitment || options.commitment,\n    };\n    const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n    const status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n    if (status.err) {\n        throw new ConfirmError(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n    }\n    return signature;\n}\nclass ConfirmError extends Error {\n    constructor(message) {\n        super(message);\n    }\n}\n/**\n * Sets the default provider on the client.\n */\nfunction setProvider(provider) {\n    _provider = provider;\n}\n/**\n * Returns the default provider being used by the client.\n */\nfunction getProvider() {\n    if (_provider === null) {\n        return AnchorProvider.local();\n    }\n    return _provider;\n}\n// Global provider used as the default when a provider is not given.\nlet _provider = null;\n\nvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\nvar dist = {};\n\n// Instruction errors.\nObject.defineProperty(dist, \"__esModule\", { value: true });\nvar ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = ANCHOR_ERROR__REQUIRE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_VIOLATED = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = dist.ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = ANCHOR_ERROR__CONSTRAINT_SPACE = dist.ANCHOR_ERROR__CONSTRAINT_SPACE = ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = ANCHOR_ERROR__CONSTRAINT_ZERO = dist.ANCHOR_ERROR__CONSTRAINT_ZERO = ANCHOR_ERROR__CONSTRAINT_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_ADDRESS = ANCHOR_ERROR__CONSTRAINT_CLOSE = dist.ANCHOR_ERROR__CONSTRAINT_CLOSE = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = ANCHOR_ERROR__CONSTRAINT_STATE = dist.ANCHOR_ERROR__CONSTRAINT_STATE = ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = dist.ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = ANCHOR_ERROR__CONSTRAINT_SEEDS = dist.ANCHOR_ERROR__CONSTRAINT_SEEDS = ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = dist.ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = ANCHOR_ERROR__CONSTRAINT_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_OWNER = ANCHOR_ERROR__CONSTRAINT_RAW = dist.ANCHOR_ERROR__CONSTRAINT_RAW = ANCHOR_ERROR__CONSTRAINT_SIGNER = dist.ANCHOR_ERROR__CONSTRAINT_SIGNER = ANCHOR_ERROR__CONSTRAINT_HAS_ONE = dist.ANCHOR_ERROR__CONSTRAINT_HAS_ONE = ANCHOR_ERROR__CONSTRAINT_MUT = dist.ANCHOR_ERROR__CONSTRAINT_MUT = ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = dist.ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = dist.ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = dist.ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = ANCHOR_ERROR__IDL_INSTRUCTION_STUB = dist.ANCHOR_ERROR__IDL_INSTRUCTION_STUB = ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = dist.ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = ANCHOR_ERROR__INSTRUCTION_MISSING = dist.ANCHOR_ERROR__INSTRUCTION_MISSING = void 0;\nvar ANCHOR_ERROR__DEPRECATED = dist.ANCHOR_ERROR__DEPRECATED = ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = dist.ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = dist.ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = dist.ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = dist.ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = dist.ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = dist.ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = dist.ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = dist.ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = dist.ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = dist.ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = dist.ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = ANCHOR_ERROR__INVALID_PROGRAM_ID = dist.ANCHOR_ERROR__INVALID_PROGRAM_ID = ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = dist.ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = dist.ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = dist.ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = ANCHOR_ERROR__REQUIRE_GT_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GT_VIOLATED = ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = void 0;\n/** 8 byte instruction identifier not provided. */\nvar ANCHOR_ERROR__INSTRUCTION_MISSING = dist.ANCHOR_ERROR__INSTRUCTION_MISSING = 100;\n/** Fallback functions are not supported. */\nvar ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = dist.ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = 101;\n/** The program could not deserialize the given instruction. */\nvar ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = 102;\n/** The program could not serialize the given instruction. */\nvar ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = 103;\n// IDL instruction errors.\n/** The program was compiled without idl instructions. */\nvar ANCHOR_ERROR__IDL_INSTRUCTION_STUB = dist.ANCHOR_ERROR__IDL_INSTRUCTION_STUB = 1000;\n/** The transaction was given an invalid program for the IDL instruction. */\nvar ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = dist.ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = 1001;\n/** IDL account must be empty in order to resize, try closing first. */\nvar ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = dist.ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = 1002;\n// Event instructions.\n/** The program was compiled without `event-cpi` feature. */\nvar ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = dist.ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = 1500;\n// Constraint errors.\n/** A mut constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MUT = dist.ANCHOR_ERROR__CONSTRAINT_MUT = 2000;\n/** A has one constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_HAS_ONE = dist.ANCHOR_ERROR__CONSTRAINT_HAS_ONE = 2001;\n/** A signer constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SIGNER = dist.ANCHOR_ERROR__CONSTRAINT_SIGNER = 2002;\n/** A raw constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_RAW = dist.ANCHOR_ERROR__CONSTRAINT_RAW = 2003;\n/** An owner constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_OWNER = 2004;\n/** A rent exemption constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = dist.ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = 2005;\n/** A seeds constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SEEDS = dist.ANCHOR_ERROR__CONSTRAINT_SEEDS = 2006;\n/** An executable constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = dist.ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = 2007;\n/** Deprecated Error, feel free to replace with something else. */\nvar ANCHOR_ERROR__CONSTRAINT_STATE = dist.ANCHOR_ERROR__CONSTRAINT_STATE = 2008;\n/** An associated constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = 2009;\n/** An associated init constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = 2010;\n/** A close constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_CLOSE = dist.ANCHOR_ERROR__CONSTRAINT_CLOSE = 2011;\n/** An address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_ADDRESS = 2012;\n/** Expected zero account discriminant. */\nvar ANCHOR_ERROR__CONSTRAINT_ZERO = dist.ANCHOR_ERROR__CONSTRAINT_ZERO = 2013;\n/** A token mint constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = 2014;\n/** A token owner constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = 2015;\n/** A mint mint authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = 2016;\n/** A mint freeze authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = 2017;\n/** A mint decimals constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = 2018;\n/** A space constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SPACE = dist.ANCHOR_ERROR__CONSTRAINT_SPACE = 2019;\n/** A required account for the constraint is None. */\nvar ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = dist.ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = 2020;\n/** A token account token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = 2021;\n/** A mint token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = 2022;\n/** An associated token account token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = 2023;\n/** A group pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = 2024;\n/** A group pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = 2025;\n/** A group pointer extension group address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = 2026;\n/** A group member pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = 2027;\n/** A group member pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = 2028;\n/** A group member pointer extension group address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = 2029;\n/** A metadata pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = 2030;\n/** A metadata pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = 2031;\n/** A metadata pointer extension metadata address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = 2032;\n/** A close authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = 2033;\n/** A close authority extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = 2034;\n/** A permanent delegate extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = 2035;\n/** A permanent delegate extension delegate constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = 2036;\n/** A transfer hook extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = 2037;\n/** A transfer hook extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = 2038;\n/** A transfer hook extension transfer hook program id constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = 2039;\n// Require errors.\n/** A require expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_VIOLATED = 2500;\n/** A require_eq expression was violated. */\nANCHOR_ERROR__REQUIRE_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = 2501;\n/** A require_keys_eq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = 2502;\n/** A require_neq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = 2503;\n/** A require_keys_neq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = 2504;\n/** A require_gt expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_GT_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GT_VIOLATED = 2505;\n/** A require_gte expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = 2506;\n// Account errors.\n/** The account discriminator was already set on this account. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = 3000;\n/** No 8 byte discriminator was found on the account. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = 3001;\n/** 8 byte discriminator did not match what was expected. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = 3002;\n/** Failed to deserialize the account. */\nvar ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = 3003;\n/** Failed to serialize the account. */\nvar ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = 3004;\n/** Not enough account keys given to the instruction. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = dist.ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = 3005;\n/** The given account is not mutable. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = dist.ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = 3006;\n/** The given account is owned by a different program than expected. */\nvar ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = dist.ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = 3007;\n/** Program ID was not as expected. */\nvar ANCHOR_ERROR__INVALID_PROGRAM_ID = dist.ANCHOR_ERROR__INVALID_PROGRAM_ID = 3008;\n/** Program account is not executable. */\nvar ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = dist.ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = 3009;\n/** The given account did not sign. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = dist.ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = 3010;\n/** The given account is not owned by the system program. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = dist.ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = 3011;\n/** The program expected this account to be already initialized. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = dist.ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = 3012;\n/** The given account is not a program data account. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = dist.ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = 3013;\n/** The given account is not the associated token account. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = dist.ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = 3014;\n/** The given public key does not match the required sysvar. */\nvar ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = 3015;\n/** The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit. */\nvar ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = dist.ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = 3016;\n/** The account was duplicated for more than one reallocation. */\nvar ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = dist.ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = 3017;\n// Miscellaneous errors.\n/** The declared program id does not match the actual program id. */\nvar ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = dist.ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = 4100;\n/** You cannot/should not initialize the payer account as a program account. */\nvar ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = dist.ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = 4101;\n/** The program could not perform the numeric conversion, out of range integral type conversion attempted. */\nvar ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = dist.ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = 4102;\n// Deprecated errors.\n/** The API being used is deprecated and should no longer be used. */\nANCHOR_ERROR__DEPRECATED = dist.ANCHOR_ERROR__DEPRECATED = 5000;\n\nconst _AVAILABLE_FEATURES = new Set([\"debug-logs\"]);\nconst _FEATURES = new Map();\nfunction set(key) {\n    if (!_AVAILABLE_FEATURES.has(key)) {\n        throw new Error(\"Invalid feature\");\n    }\n    _FEATURES.set(key, true);\n}\nfunction isSet(key) {\n    return _FEATURES.get(key) !== undefined;\n}\n\nvar features = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    set: set,\n    isSet: isSet\n});\n\nclass IdlError extends Error {\n    constructor(message) {\n        super(message);\n        this.name = \"IdlError\";\n    }\n}\nclass ProgramErrorStack {\n    constructor(stack) {\n        this.stack = stack;\n    }\n    static parse(logs) {\n        var _a;\n        const programKeyRegex = /^Program (\\w*) invoke/;\n        const successRegex = /^Program \\w* success/;\n        const programStack = [];\n        for (let i = 0; i < logs.length; i++) {\n            if (successRegex.exec(logs[i])) {\n                programStack.pop();\n                continue;\n            }\n            const programKey = (_a = programKeyRegex.exec(logs[i])) === null || _a === void 0 ? void 0 : _a[1];\n            if (!programKey) {\n                continue;\n            }\n            programStack.push(new PublicKey(programKey));\n        }\n        return new ProgramErrorStack(programStack);\n    }\n}\nclass AnchorError extends Error {\n    constructor(errorCode, errorMessage, errorLogs, logs, origin, comparedValues) {\n        super(errorLogs.join(\"\\n\").replace(\"Program log: \", \"\"));\n        this.errorLogs = errorLogs;\n        this.logs = logs;\n        this.error = { errorCode, errorMessage, comparedValues, origin };\n        this._programErrorStack = ProgramErrorStack.parse(logs);\n    }\n    static parse(logs) {\n        if (!logs) {\n            return null;\n        }\n        const anchorErrorLogIndex = logs.findIndex((log) => log.startsWith(\"Program log: AnchorError\"));\n        if (anchorErrorLogIndex === -1) {\n            return null;\n        }\n        const anchorErrorLog = logs[anchorErrorLogIndex];\n        const errorLogs = [anchorErrorLog];\n        let comparedValues;\n        if (anchorErrorLogIndex + 1 < logs.length) {\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left:\n            // <Pubkey>\n            // Right:\n            // <Pubkey>\n            if (logs[anchorErrorLogIndex + 1] === \"Program log: Left:\") {\n                const pubkeyRegex = /^Program log: (.*)$/;\n                const leftPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 2])[1];\n                const rightPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 4])[1];\n                comparedValues = [\n                    new PublicKey(leftPubkey),\n                    new PublicKey(rightPubkey),\n                ];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 5));\n            }\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left: <value>\n            // Right: <value>\n            else if (logs[anchorErrorLogIndex + 1].startsWith(\"Program log: Left:\")) {\n                const valueRegex = /^Program log: (Left|Right): (.*)$/;\n                const leftValue = valueRegex.exec(logs[anchorErrorLogIndex + 1])[2];\n                const rightValue = valueRegex.exec(logs[anchorErrorLogIndex + 2])[2];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 3));\n                comparedValues = [leftValue, rightValue];\n            }\n        }\n        const regexNoInfo = /^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const noInfoAnchorErrorLog = regexNoInfo.exec(anchorErrorLog);\n        const regexFileLine = /^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const fileLineAnchorErrorLog = regexFileLine.exec(anchorErrorLog);\n        const regexAccountName = /^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const accountNameAnchorErrorLog = regexAccountName.exec(anchorErrorLog);\n        if (noInfoAnchorErrorLog) {\n            const [errorCodeString, errorNumber, errorMessage] = noInfoAnchorErrorLog.slice(1, 4);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, undefined, comparedValues);\n        }\n        else if (fileLineAnchorErrorLog) {\n            const [file, line, errorCodeString, errorNumber, errorMessage] = fileLineAnchorErrorLog.slice(1, 6);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            const fileLine = { file, line: parseInt(line) };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, fileLine, comparedValues);\n        }\n        else if (accountNameAnchorErrorLog) {\n            const [accountName, errorCodeString, errorNumber, errorMessage] = accountNameAnchorErrorLog.slice(1, 5);\n            const origin = accountName;\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, origin, comparedValues);\n        }\n        else {\n            return null;\n        }\n    }\n    get program() {\n        return this._programErrorStack.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        return this._programErrorStack.stack;\n    }\n    toString() {\n        return this.message;\n    }\n}\n// An error from a user defined program.\nclass ProgramError extends Error {\n    constructor(code, msg, logs) {\n        super();\n        this.code = code;\n        this.msg = msg;\n        this.logs = logs;\n        if (logs) {\n            this._programErrorStack = ProgramErrorStack.parse(logs);\n        }\n    }\n    static parse(err, idlErrors) {\n        const errString = err.toString();\n        // TODO: don't rely on the error string. web3.js should preserve the error\n        //       code information instead of giving us an untyped string.\n        let unparsedErrorCode;\n        if (errString.includes(\"custom program error:\")) {\n            let components = errString.split(\"custom program error: \");\n            if (components.length !== 2) {\n                return null;\n            }\n            else {\n                unparsedErrorCode = components[1];\n            }\n        }\n        else {\n            const matches = errString.match(/\"Custom\":([0-9]+)}/g);\n            if (!matches || matches.length > 1) {\n                return null;\n            }\n            unparsedErrorCode = matches[0].match(/([0-9]+)/g)[0];\n        }\n        let errorCode;\n        try {\n            errorCode = parseInt(unparsedErrorCode);\n        }\n        catch (parseErr) {\n            return null;\n        }\n        // Parse user error.\n        let errorMsg = idlErrors.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Parse framework internal error.\n        errorMsg = LangErrorMessage.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Unable to parse the error. Just return the untranslated error.\n        return null;\n    }\n    get program() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack;\n    }\n    toString() {\n        return this.msg;\n    }\n}\nfunction translateError(err, idlErrors) {\n    if (isSet(\"debug-logs\")) {\n        console.log(\"Translating error:\", err);\n    }\n    const anchorError = AnchorError.parse(err.logs);\n    if (anchorError) {\n        return anchorError;\n    }\n    const programError = ProgramError.parse(err, idlErrors);\n    if (programError) {\n        return programError;\n    }\n    if (err.logs) {\n        const handler = {\n            get: function (target, prop) {\n                if (prop === \"programErrorStack\") {\n                    return target.programErrorStack.stack;\n                }\n                else if (prop === \"program\") {\n                    return target.programErrorStack.stack[err.programErrorStack.stack.length - 1];\n                }\n                else {\n                    // this is the normal way to return all other props\n                    // without modifying them.\n                    // @ts-expect-error\n                    return Reflect.get(...arguments);\n                }\n            },\n        };\n        err.programErrorStack = ProgramErrorStack.parse(err.logs);\n        return new Proxy(err, handler);\n    }\n    return err;\n}\nconst LangErrorCode = {\n    // Instructions.\n    InstructionMissing: ANCHOR_ERROR__INSTRUCTION_MISSING,\n    InstructionFallbackNotFound: ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND,\n    InstructionDidNotDeserialize: ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE,\n    InstructionDidNotSerialize: ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE,\n    // IDL instructions.\n    IdlInstructionStub: ANCHOR_ERROR__IDL_INSTRUCTION_STUB,\n    IdlInstructionInvalidProgram: ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM,\n    IdlAccountNotEmpty: ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY,\n    // Event instructions.\n    EventInstructionStub: ANCHOR_ERROR__EVENT_INSTRUCTION_STUB,\n    // Constraints.\n    ConstraintMut: ANCHOR_ERROR__CONSTRAINT_MUT,\n    ConstraintHasOne: ANCHOR_ERROR__CONSTRAINT_HAS_ONE,\n    ConstraintSigner: ANCHOR_ERROR__CONSTRAINT_SIGNER,\n    ConstraintRaw: ANCHOR_ERROR__CONSTRAINT_RAW,\n    ConstraintOwner: ANCHOR_ERROR__CONSTRAINT_OWNER,\n    ConstraintRentExempt: ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT,\n    ConstraintSeeds: ANCHOR_ERROR__CONSTRAINT_SEEDS,\n    ConstraintExecutable: ANCHOR_ERROR__CONSTRAINT_EXECUTABLE,\n    ConstraintState: ANCHOR_ERROR__CONSTRAINT_STATE,\n    ConstraintAssociated: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED,\n    ConstraintAssociatedInit: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT,\n    ConstraintClose: ANCHOR_ERROR__CONSTRAINT_CLOSE,\n    ConstraintAddress: ANCHOR_ERROR__CONSTRAINT_ADDRESS,\n    ConstraintZero: ANCHOR_ERROR__CONSTRAINT_ZERO,\n    ConstraintTokenMint: ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT,\n    ConstraintTokenOwner: ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER,\n    ConstraintMintMintAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY,\n    ConstraintMintFreezeAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY,\n    ConstraintMintDecimals: ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS,\n    ConstraintSpace: ANCHOR_ERROR__CONSTRAINT_SPACE,\n    ConstraintAccountIsNone: ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE,\n    ConstraintTokenTokenProgram: ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM,\n    ConstraintMintTokenProgram: ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM,\n    ConstraintAssociatedTokenTokenProgram: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM,\n    ConstraintMintGroupPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION,\n    ConstraintMintGroupPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintGroupPointerExtensionGroupAddress: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS,\n    ConstraintMintGroupMemberPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION,\n    ConstraintMintGroupMemberPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintGroupMemberPointerExtensionMemberAddress: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS,\n    ConstraintMintMetadataPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION,\n    ConstraintMintMetadataPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintMetadataPointerExtensionMetadataAddress: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS,\n    ConstraintMintCloseAuthorityExtension: ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION,\n    ConstraintMintCloseAuthorityExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY,\n    ConstraintMintPermanentDelegateExtension: ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION,\n    ConstraintMintPermanentDelegateExtensionDelegate: ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE,\n    ConstraintMintTransferHookExtension: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION,\n    ConstraintMintTransferHookExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY,\n    ConstraintMintTransferHookExtensionProgramId: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID,\n    // Require.\n    RequireViolated: ANCHOR_ERROR__REQUIRE_VIOLATED,\n    RequireEqViolated: ANCHOR_ERROR__REQUIRE_EQ_VIOLATED,\n    RequireKeysEqViolated: ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED,\n    RequireNeqViolated: ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED,\n    RequireKeysNeqViolated: ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED,\n    RequireGtViolated: ANCHOR_ERROR__REQUIRE_GT_VIOLATED,\n    RequireGteViolated: ANCHOR_ERROR__REQUIRE_GTE_VIOLATED,\n    // Accounts.\n    AccountDiscriminatorAlreadySet: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET,\n    AccountDiscriminatorNotFound: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND,\n    AccountDiscriminatorMismatch: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH,\n    AccountDidNotDeserialize: ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE,\n    AccountDidNotSerialize: ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE,\n    AccountNotEnoughKeys: ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS,\n    AccountNotMutable: ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE,\n    AccountOwnedByWrongProgram: ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM,\n    InvalidProgramId: ANCHOR_ERROR__INVALID_PROGRAM_ID,\n    InvalidProgramExecutable: ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE,\n    AccountNotSigner: ANCHOR_ERROR__ACCOUNT_NOT_SIGNER,\n    AccountNotSystemOwned: ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED,\n    AccountNotInitialized: ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED,\n    AccountNotProgramData: ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA,\n    AccountNotAssociatedTokenAccount: ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT,\n    AccountSysvarMismatch: ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH,\n    AccountReallocExceedsLimit: ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT,\n    AccountDuplicateReallocs: ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS,\n    // Miscellaneous\n    DeclaredProgramIdMismatch: ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH,\n    TryingToInitPayerAsProgramAccount: ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT,\n    InvalidNumericConversion: ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION,\n    // Used for APIs that shouldn't be used anymore.\n    Deprecated: ANCHOR_ERROR__DEPRECATED,\n};\nconst LangErrorMessage = new Map([\n    // Instructions.\n    [\n        LangErrorCode.InstructionMissing,\n        \"8 byte instruction identifier not provided\",\n    ],\n    [\n        LangErrorCode.InstructionFallbackNotFound,\n        \"Fallback functions are not supported\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotDeserialize,\n        \"The program could not deserialize the given instruction\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotSerialize,\n        \"The program could not serialize the given instruction\",\n    ],\n    // Idl instructions.\n    [\n        LangErrorCode.IdlInstructionStub,\n        \"The program was compiled without idl instructions\",\n    ],\n    [\n        LangErrorCode.IdlInstructionInvalidProgram,\n        \"The transaction was given an invalid program for the IDL instruction\",\n    ],\n    [\n        LangErrorCode.IdlAccountNotEmpty,\n        \"IDL account must be empty in order to resize, try closing first\",\n    ],\n    // Event instructions.\n    [\n        LangErrorCode.EventInstructionStub,\n        \"The program was compiled without `event-cpi` feature\",\n    ],\n    // Constraints.\n    [LangErrorCode.ConstraintMut, \"A mut constraint was violated\"],\n    [LangErrorCode.ConstraintHasOne, \"A has one constraint was violated\"],\n    [LangErrorCode.ConstraintSigner, \"A signer constraint was violated\"],\n    [LangErrorCode.ConstraintRaw, \"A raw constraint was violated\"],\n    [LangErrorCode.ConstraintOwner, \"An owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintRentExempt,\n        \"A rent exemption constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSeeds, \"A seeds constraint was violated\"],\n    [LangErrorCode.ConstraintExecutable, \"An executable constraint was violated\"],\n    [\n        LangErrorCode.ConstraintState,\n        \"Deprecated Error, feel free to replace with something else\",\n    ],\n    [LangErrorCode.ConstraintAssociated, \"An associated constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAssociatedInit,\n        \"An associated init constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintClose, \"A close constraint was violated\"],\n    [LangErrorCode.ConstraintAddress, \"An address constraint was violated\"],\n    [LangErrorCode.ConstraintZero, \"Expected zero account discriminant\"],\n    [LangErrorCode.ConstraintTokenMint, \"A token mint constraint was violated\"],\n    [LangErrorCode.ConstraintTokenOwner, \"A token owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintMintMintAuthority,\n        \"A mint mint authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintFreezeAuthority,\n        \"A mint freeze authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintDecimals,\n        \"A mint decimals constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSpace, \"A space constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAccountIsNone,\n        \"A required account for the constraint is None\",\n    ],\n    [\n        LangErrorCode.ConstraintTokenTokenProgram,\n        \"A token account token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTokenProgram,\n        \"A mint token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintAssociatedTokenTokenProgram,\n        \"An associated token account token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtension,\n        \"A group pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtensionAuthority,\n        \"A group pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtensionGroupAddress,\n        \"A group pointer extension group address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtension,\n        \"A group member pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtensionAuthority,\n        \"A group member pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtensionMemberAddress,\n        \"A group member pointer extension group address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtension,\n        \"A metadata pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtensionAuthority,\n        \"A metadata pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtensionMetadataAddress,\n        \"A metadata pointer extension metadata address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintCloseAuthorityExtension,\n        \"A close authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintCloseAuthorityExtensionAuthority,\n        \"A close authority extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintPermanentDelegateExtension,\n        \"A permanent delegate extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintPermanentDelegateExtensionDelegate,\n        \"A permanent delegate extension delegate constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtension,\n        \"A transfer hook extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtensionAuthority,\n        \"A transfer hook extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtensionProgramId,\n        \"A transfer hook extension transfer hook program id constraint was violated\",\n    ],\n    // Require.\n    [LangErrorCode.RequireViolated, \"A require expression was violated\"],\n    [LangErrorCode.RequireEqViolated, \"A require_eq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysEqViolated,\n        \"A require_keys_eq expression was violated\",\n    ],\n    [LangErrorCode.RequireNeqViolated, \"A require_neq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysNeqViolated,\n        \"A require_keys_neq expression was violated\",\n    ],\n    [LangErrorCode.RequireGtViolated, \"A require_gt expression was violated\"],\n    [LangErrorCode.RequireGteViolated, \"A require_gte expression was violated\"],\n    // Accounts.\n    [\n        LangErrorCode.AccountDiscriminatorAlreadySet,\n        \"The account discriminator was already set on this account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorNotFound,\n        \"No 8 byte discriminator was found on the account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorMismatch,\n        \"8 byte discriminator did not match what was expected\",\n    ],\n    [LangErrorCode.AccountDidNotDeserialize, \"Failed to deserialize the account\"],\n    [LangErrorCode.AccountDidNotSerialize, \"Failed to serialize the account\"],\n    [\n        LangErrorCode.AccountNotEnoughKeys,\n        \"Not enough account keys given to the instruction\",\n    ],\n    [LangErrorCode.AccountNotMutable, \"The given account is not mutable\"],\n    [\n        LangErrorCode.AccountOwnedByWrongProgram,\n        \"The given account is owned by a different program than expected\",\n    ],\n    [LangErrorCode.InvalidProgramId, \"Program ID was not as expected\"],\n    [LangErrorCode.InvalidProgramExecutable, \"Program account is not executable\"],\n    [LangErrorCode.AccountNotSigner, \"The given account did not sign\"],\n    [\n        LangErrorCode.AccountNotSystemOwned,\n        \"The given account is not owned by the system program\",\n    ],\n    [\n        LangErrorCode.AccountNotInitialized,\n        \"The program expected this account to be already initialized\",\n    ],\n    [\n        LangErrorCode.AccountNotProgramData,\n        \"The given account is not a program data account\",\n    ],\n    [\n        LangErrorCode.AccountNotAssociatedTokenAccount,\n        \"The given account is not the associated token account\",\n    ],\n    [\n        LangErrorCode.AccountSysvarMismatch,\n        \"The given public key does not match the required sysvar\",\n    ],\n    [\n        LangErrorCode.AccountReallocExceedsLimit,\n        \"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\",\n    ],\n    [\n        LangErrorCode.AccountDuplicateReallocs,\n        \"The account was duplicated for more than one reallocation\",\n    ],\n    // Miscellaneous\n    [\n        LangErrorCode.DeclaredProgramIdMismatch,\n        \"The declared program id does not match the actual program id\",\n    ],\n    [\n        LangErrorCode.TryingToInitPayerAsProgramAccount,\n        \"You cannot/should not initialize the payer account as a program account\",\n    ],\n    [\n        LangErrorCode.InvalidNumericConversion,\n        \"The program could not perform the numeric conversion, out of range integral type conversion attempted\",\n    ],\n    // Deprecated\n    [\n        LangErrorCode.Deprecated,\n        \"The API being used is deprecated and should no longer be used\",\n    ],\n]);\n\nclass IdlCoder {\n    static fieldLayout(field, types = [], genericArgs) {\n        const fieldName = field.name;\n        switch (field.type) {\n            case \"bool\": {\n                return borsh.bool(fieldName);\n            }\n            case \"u8\": {\n                return borsh.u8(fieldName);\n            }\n            case \"i8\": {\n                return borsh.i8(fieldName);\n            }\n            case \"u16\": {\n                return borsh.u16(fieldName);\n            }\n            case \"i16\": {\n                return borsh.i16(fieldName);\n            }\n            case \"u32\": {\n                return borsh.u32(fieldName);\n            }\n            case \"i32\": {\n                return borsh.i32(fieldName);\n            }\n            case \"f32\": {\n                return borsh.f32(fieldName);\n            }\n            case \"u64\": {\n                return borsh.u64(fieldName);\n            }\n            case \"i64\": {\n                return borsh.i64(fieldName);\n            }\n            case \"f64\": {\n                return borsh.f64(fieldName);\n            }\n            case \"u128\": {\n                return borsh.u128(fieldName);\n            }\n            case \"i128\": {\n                return borsh.i128(fieldName);\n            }\n            case \"u256\": {\n                return borsh.u256(fieldName);\n            }\n            case \"i256\": {\n                return borsh.i256(fieldName);\n            }\n            case \"bytes\": {\n                return borsh.vecU8(fieldName);\n            }\n            case \"string\": {\n                return borsh.str(fieldName);\n            }\n            case \"pubkey\": {\n                return borsh.publicKey(fieldName);\n            }\n            default: {\n                if (\"option\" in field.type) {\n                    return borsh.option(IdlCoder.fieldLayout({ type: field.type.option }, types, genericArgs), fieldName);\n                }\n                if (\"vec\" in field.type) {\n                    return borsh.vec(IdlCoder.fieldLayout({ type: field.type.vec }, types, genericArgs), fieldName);\n                }\n                if (\"array\" in field.type) {\n                    let [type, len] = field.type.array;\n                    len = IdlCoder.resolveArrayLen(len, genericArgs);\n                    return borsh.array(IdlCoder.fieldLayout({ type }, types, genericArgs), len, fieldName);\n                }\n                if (\"defined\" in field.type) {\n                    if (!types) {\n                        throw new IdlError(\"User defined types not provided\");\n                    }\n                    const definedName = field.type.defined.name;\n                    const typeDef = types.find((t) => t.name === definedName);\n                    if (!typeDef) {\n                        throw new IdlError(`Type not found: ${field.name}`);\n                    }\n                    return IdlCoder.typeDefLayout({\n                        typeDef,\n                        types,\n                        genericArgs: genericArgs !== null && genericArgs !== void 0 ? genericArgs : field.type.defined.generics,\n                        name: fieldName,\n                    });\n                }\n                if (\"generic\" in field.type) {\n                    const genericArg = genericArgs === null || genericArgs === void 0 ? void 0 : genericArgs.at(0);\n                    if ((genericArg === null || genericArg === void 0 ? void 0 : genericArg.kind) !== \"type\") {\n                        throw new IdlError(`Invalid generic field: ${field.name}`);\n                    }\n                    return IdlCoder.fieldLayout({ ...field, type: genericArg.type }, types);\n                }\n                throw new IdlError(`Not yet implemented: ${JSON.stringify(field.type)}`);\n            }\n        }\n    }\n    /**\n     * Get the type layout of the given defined type(struct or enum).\n     */\n    static typeDefLayout({ typeDef, types, name, genericArgs, }) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const fieldLayouts = handleDefinedFields(typeDef.type.fields, () => [], (fields) => fields.map((f) => {\n                    const genArgs = genericArgs\n                        ? IdlCoder.resolveGenericArgs({\n                            type: f.type,\n                            typeDef,\n                            genericArgs,\n                        })\n                        : genericArgs;\n                    return IdlCoder.fieldLayout(f, types, genArgs);\n                }), (fields) => fields.map((f, i) => {\n                    const genArgs = genericArgs\n                        ? IdlCoder.resolveGenericArgs({\n                            type: f,\n                            typeDef,\n                            genericArgs,\n                        })\n                        : genericArgs;\n                    return IdlCoder.fieldLayout({ name: i.toString(), type: f }, types, genArgs);\n                }));\n                return borsh.struct(fieldLayouts, name);\n            }\n            case \"enum\": {\n                const variants = typeDef.type.variants.map((variant) => {\n                    const fieldLayouts = handleDefinedFields(variant.fields, () => [], (fields) => fields.map((f) => {\n                        const genArgs = genericArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type: f.type,\n                                typeDef,\n                                genericArgs,\n                            })\n                            : genericArgs;\n                        return IdlCoder.fieldLayout(f, types, genArgs);\n                    }), (fields) => fields.map((f, i) => {\n                        const genArgs = genericArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type: f,\n                                typeDef,\n                                genericArgs,\n                            })\n                            : genericArgs;\n                        return IdlCoder.fieldLayout({ name: i.toString(), type: f }, types, genArgs);\n                    }));\n                    return borsh.struct(fieldLayouts, variant.name);\n                });\n                if (name !== undefined) {\n                    // Buffer-layout lib requires the name to be null (on construction)\n                    // when used as a field.\n                    return borsh.rustEnum(variants).replicate(name);\n                }\n                return borsh.rustEnum(variants, name);\n            }\n            case \"type\": {\n                return IdlCoder.fieldLayout({ type: typeDef.type.alias, name }, types);\n            }\n        }\n    }\n    /**\n     * Get the type of the size in bytes. Returns `1` for variable length types.\n     */\n    static typeSize(ty, idl, genericArgs) {\n        var _a;\n        switch (ty) {\n            case \"bool\":\n                return 1;\n            case \"u8\":\n                return 1;\n            case \"i8\":\n                return 1;\n            case \"i16\":\n                return 2;\n            case \"u16\":\n                return 2;\n            case \"u32\":\n                return 4;\n            case \"i32\":\n                return 4;\n            case \"f32\":\n                return 4;\n            case \"u64\":\n                return 8;\n            case \"i64\":\n                return 8;\n            case \"f64\":\n                return 8;\n            case \"u128\":\n                return 16;\n            case \"i128\":\n                return 16;\n            case \"u256\":\n                return 32;\n            case \"i256\":\n                return 32;\n            case \"bytes\":\n                return 1;\n            case \"string\":\n                return 1;\n            case \"pubkey\":\n                return 32;\n            default:\n                if (\"option\" in ty) {\n                    return 1 + IdlCoder.typeSize(ty.option, idl, genericArgs);\n                }\n                if (\"coption\" in ty) {\n                    return 4 + IdlCoder.typeSize(ty.coption, idl, genericArgs);\n                }\n                if (\"vec\" in ty) {\n                    return 1;\n                }\n                if (\"array\" in ty) {\n                    let [type, len] = ty.array;\n                    len = IdlCoder.resolveArrayLen(len, genericArgs);\n                    return IdlCoder.typeSize(type, idl, genericArgs) * len;\n                }\n                if (\"defined\" in ty) {\n                    const typeDef = (_a = idl.types) === null || _a === void 0 ? void 0 : _a.find((t) => t.name === ty.defined.name);\n                    if (!typeDef) {\n                        throw new IdlError(`Type not found: ${JSON.stringify(ty)}`);\n                    }\n                    const typeSize = (type) => {\n                        const genArgs = genericArgs !== null && genericArgs !== void 0 ? genericArgs : ty.defined.generics;\n                        const args = genArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type,\n                                typeDef,\n                                genericArgs: genArgs,\n                            })\n                            : genArgs;\n                        return IdlCoder.typeSize(type, idl, args);\n                    };\n                    switch (typeDef.type.kind) {\n                        case \"struct\": {\n                            return handleDefinedFields(typeDef.type.fields, () => [0], (fields) => fields.map((f) => typeSize(f.type)), (fields) => fields.map((f) => typeSize(f))).reduce((acc, size) => acc + size, 0);\n                        }\n                        case \"enum\": {\n                            const variantSizes = typeDef.type.variants.map((variant) => {\n                                return handleDefinedFields(variant.fields, () => [0], (fields) => fields.map((f) => typeSize(f.type)), (fields) => fields.map((f) => typeSize(f))).reduce((acc, size) => acc + size, 0);\n                            });\n                            return Math.max(...variantSizes) + 1;\n                        }\n                        case \"type\": {\n                            return IdlCoder.typeSize(typeDef.type.alias, idl, genericArgs);\n                        }\n                    }\n                }\n                if (\"generic\" in ty) {\n                    const genericArg = genericArgs === null || genericArgs === void 0 ? void 0 : genericArgs.at(0);\n                    if ((genericArg === null || genericArg === void 0 ? void 0 : genericArg.kind) !== \"type\") {\n                        throw new IdlError(`Invalid generic: ${ty.generic}`);\n                    }\n                    return IdlCoder.typeSize(genericArg.type, idl, genericArgs);\n                }\n                throw new Error(`Invalid type ${JSON.stringify(ty)}`);\n        }\n    }\n    /**\n     * Resolve the generic array length or return the constant-sized array length.\n     */\n    static resolveArrayLen(len, genericArgs) {\n        if (typeof len === \"number\")\n            return len;\n        if (genericArgs) {\n            const genericLen = genericArgs.find((g) => g.kind === \"const\");\n            if ((genericLen === null || genericLen === void 0 ? void 0 : genericLen.kind) === \"const\") {\n                len = +genericLen.value;\n            }\n        }\n        if (typeof len !== \"number\") {\n            throw new IdlError(\"Generic array length did not resolve\");\n        }\n        return len;\n    }\n    /**\n     * Recursively resolve generic arguments i.e. replace all generics with the\n     * actual type that they hold based on the initial `genericArgs` given.\n     */\n    static resolveGenericArgs({ type, typeDef, genericArgs, isDefined, }) {\n        if (typeof type !== \"object\")\n            return null;\n        for (const index in typeDef.generics) {\n            const defGeneric = typeDef.generics[index];\n            if (\"generic\" in type && defGeneric.name === type.generic) {\n                return [genericArgs[index]];\n            }\n            if (\"option\" in type) {\n                const args = IdlCoder.resolveGenericArgs({\n                    type: type.option,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (!args || !isDefined)\n                    return args;\n                if (args[0].kind === \"type\") {\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { option: args[0].type },\n                        },\n                    ];\n                }\n            }\n            if (\"vec\" in type) {\n                const args = IdlCoder.resolveGenericArgs({\n                    type: type.vec,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (!args || !isDefined)\n                    return args;\n                if (args[0].kind === \"type\") {\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { vec: args[0].type },\n                        },\n                    ];\n                }\n            }\n            if (\"array\" in type) {\n                const [elTy, len] = type.array;\n                const isGenericLen = typeof len === \"object\";\n                const args = IdlCoder.resolveGenericArgs({\n                    type: elTy,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (args) {\n                    // Has generic type, also check for generic length\n                    for (const i in typeDef.generics.slice(+index)) {\n                        const curIndex = +index + +i;\n                        if (isGenericLen &&\n                            typeDef.generics[curIndex].name === len.generic) {\n                            args.push(genericArgs[curIndex]);\n                        }\n                    }\n                    if (!isDefined)\n                        return args;\n                    if (args[0].kind === \"type\" && args[1].kind === \"const\") {\n                        return [\n                            {\n                                kind: \"type\",\n                                type: { array: [args[0].type, +args[1].value] },\n                            },\n                        ];\n                    }\n                }\n                // Only generic len\n                if (isGenericLen && defGeneric.name === len.generic) {\n                    const arg = genericArgs[index];\n                    if (!isDefined)\n                        return [arg];\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { array: [elTy, +arg.value] },\n                        },\n                    ];\n                }\n                // Non-generic\n                return null;\n            }\n            if (\"defined\" in type) {\n                if (!type.defined.generics)\n                    return null;\n                return type.defined.generics\n                    .flatMap((g) => {\n                    switch (g.kind) {\n                        case \"type\":\n                            return IdlCoder.resolveGenericArgs({\n                                type: g.type,\n                                typeDef,\n                                genericArgs,\n                                isDefined: true,\n                            });\n                        case \"const\":\n                            return [g];\n                    }\n                })\n                    .filter((g) => g !== null);\n            }\n        }\n        return null;\n    }\n}\n\n/**\n * Encodes and decodes program instructions.\n */\nclass BorshInstructionCoder {\n    constructor(idl) {\n        this.idl = idl;\n        const ixLayouts = idl.instructions.map((ix) => {\n            const name = ix.name;\n            const fieldLayouts = ix.args.map((arg) => IdlCoder.fieldLayout(arg, idl.types));\n            const layout = borsh.struct(fieldLayouts, name);\n            return [name, { discriminator: ix.discriminator, layout }];\n        });\n        this.ixLayouts = new Map(ixLayouts);\n        const sighashLayouts = ixLayouts.map(([name, { discriminator, layout }]) => {\n            return [bs58$1.encode(discriminator), { name, layout }];\n        });\n        this.sighashLayouts = new Map(sighashLayouts);\n    }\n    /**\n     * Encodes a program instruction.\n     */\n    encode(ixName, ix) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const encoder = this.ixLayouts.get(ixName);\n        if (!encoder) {\n            throw new Error(`Unknown method: ${ixName}`);\n        }\n        const len = encoder.layout.encode(ix, buffer);\n        const data = buffer.slice(0, len);\n        return Buffer$1.concat([Buffer$1.from(encoder.discriminator), data]);\n    }\n    /**\n     * Decodes a program instruction.\n     */\n    decode(ix, encoding = \"hex\") {\n        if (typeof ix === \"string\") {\n            ix = encoding === \"hex\" ? Buffer$1.from(ix, \"hex\") : bs58$1.decode(ix);\n        }\n        const disc = ix.slice(0, DISCRIMINATOR_SIZE);\n        const data = ix.slice(DISCRIMINATOR_SIZE);\n        const decoder = this.sighashLayouts.get(bs58$1.encode(disc));\n        if (!decoder) {\n            return null;\n        }\n        return {\n            name: decoder.name,\n            data: decoder.layout.decode(data),\n        };\n    }\n    /**\n     * Returns a formatted table of all the fields in the given instruction data.\n     */\n    format(ix, accountMetas) {\n        return InstructionFormatter.format(ix, accountMetas, this.idl);\n    }\n}\nclass InstructionFormatter {\n    static format(ix, accountMetas, idl) {\n        const idlIx = idl.instructions.find((i) => ix.name === i.name);\n        if (!idlIx) {\n            console.error(\"Invalid instruction given\");\n            return null;\n        }\n        const args = idlIx.args.map((idlField) => {\n            return {\n                name: idlField.name,\n                type: InstructionFormatter.formatIdlType(idlField.type),\n                data: InstructionFormatter.formatIdlData(idlField, ix.data[idlField.name], idl.types),\n            };\n        });\n        const flatIdlAccounts = InstructionFormatter.flattenIdlAccounts(idlIx.accounts);\n        const accounts = accountMetas.map((meta, idx) => {\n            if (idx < flatIdlAccounts.length) {\n                return {\n                    name: flatIdlAccounts[idx].name,\n                    ...meta,\n                };\n            }\n            // \"Remaining accounts\" are unnamed in Anchor.\n            else {\n                return {\n                    name: undefined,\n                    ...meta,\n                };\n            }\n        });\n        return {\n            args,\n            accounts,\n        };\n    }\n    static formatIdlType(idlType) {\n        if (typeof idlType === \"string\") {\n            return idlType;\n        }\n        if (\"option\" in idlType) {\n            return `Option<${this.formatIdlType(idlType.option)}>`;\n        }\n        if (\"coption\" in idlType) {\n            return `COption<${this.formatIdlType(idlType.coption)}>`;\n        }\n        if (\"vec\" in idlType) {\n            return `Vec<${this.formatIdlType(idlType.vec)}>`;\n        }\n        if (\"array\" in idlType) {\n            return `Array<${idlType.array[0]}; ${idlType.array[1]}>`;\n        }\n        if (\"defined\" in idlType) {\n            const name = idlType.defined.name;\n            if (idlType.defined.generics) {\n                const generics = idlType.defined.generics\n                    .map((g) => {\n                    switch (g.kind) {\n                        case \"type\":\n                            return InstructionFormatter.formatIdlType(g.type);\n                        case \"const\":\n                            return g.value;\n                    }\n                })\n                    .join(\", \");\n                return `${name}<${generics}>`;\n            }\n            return name;\n        }\n        throw new Error(`Unknown IDL type: ${idlType}`);\n    }\n    static formatIdlData(idlField, data, types) {\n        if (typeof idlField.type === \"string\") {\n            return data.toString();\n        }\n        if (\"vec\" in idlField.type) {\n            return (\"[\" +\n                data\n                    .map((d) => this.formatIdlData({ name: \"\", type: idlField.type.vec }, d, types))\n                    .join(\", \") +\n                \"]\");\n        }\n        if (\"option\" in idlField.type) {\n            return data === null\n                ? \"null\"\n                : this.formatIdlData({ name: \"\", type: idlField.type.option }, data, types);\n        }\n        if (\"defined\" in idlField.type) {\n            if (!types) {\n                throw new Error(\"User defined types not provided\");\n            }\n            const definedName = idlField.type.defined.name;\n            const typeDef = types.find((t) => t.name === definedName);\n            if (!typeDef) {\n                throw new Error(`Type not found: ${definedName}`);\n            }\n            return InstructionFormatter.formatIdlDataDefined(typeDef, data, types);\n        }\n        return \"unknown\";\n    }\n    static formatIdlDataDefined(typeDef, data, types) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                return (\"{ \" +\n                    handleDefinedFields(typeDef.type.fields, () => \"\", (fields) => {\n                        return Object.entries(data)\n                            .map(([key, val]) => {\n                            const field = fields.find((f) => f.name === key);\n                            if (!field) {\n                                throw new Error(`Field not found: ${key}`);\n                            }\n                            return (key +\n                                \": \" +\n                                InstructionFormatter.formatIdlData(field, val, types));\n                        })\n                            .join(\", \");\n                    }, (fields) => {\n                        return Object.entries(data)\n                            .map(([key, val]) => {\n                            return (key +\n                                \": \" +\n                                InstructionFormatter.formatIdlData({ name: \"\", type: fields[key] }, val, types));\n                        })\n                            .join(\", \");\n                    }) +\n                    \" }\");\n            }\n            case \"enum\": {\n                const variantName = Object.keys(data)[0];\n                const variant = typeDef.type.variants.find((v) => v.name === variantName);\n                if (!variant) {\n                    throw new Error(`Unable to find variant: ${variantName}`);\n                }\n                const enumValue = data[variantName];\n                return handleDefinedFields(variant.fields, () => variantName, (fields) => {\n                    const namedFields = Object.keys(enumValue)\n                        .map((f) => {\n                        const fieldData = enumValue[f];\n                        const idlField = fields.find((v) => v.name === f);\n                        if (!idlField) {\n                            throw new Error(`Field not found: ${f}`);\n                        }\n                        return (f +\n                            \": \" +\n                            InstructionFormatter.formatIdlData(idlField, fieldData, types));\n                    })\n                        .join(\", \");\n                    return `${variantName} { ${namedFields} }`;\n                }, (fields) => {\n                    const tupleFields = Object.entries(enumValue)\n                        .map(([key, val]) => {\n                        return (key +\n                            \": \" +\n                            InstructionFormatter.formatIdlData({ name: \"\", type: fields[key] }, val, types));\n                    })\n                        .join(\", \");\n                    return `${variantName} { ${tupleFields} }`;\n                });\n            }\n            case \"type\": {\n                return InstructionFormatter.formatIdlType(typeDef.type.alias);\n            }\n        }\n    }\n    static flattenIdlAccounts(accounts, prefix) {\n        return accounts\n            .map((account) => {\n            const accName = sentenceCase(account.name);\n            if (account.hasOwnProperty(\"accounts\")) {\n                const newPrefix = prefix ? `${prefix} > ${accName}` : accName;\n                return InstructionFormatter.flattenIdlAccounts(account.accounts, newPrefix);\n            }\n            else {\n                return {\n                    ...account,\n                    name: prefix ? `${prefix} > ${accName}` : accName,\n                };\n            }\n        })\n            .flat();\n    }\n}\nfunction sentenceCase(field) {\n    const result = field.replace(/([A-Z])/g, \" $1\");\n    return result.charAt(0).toUpperCase() + result.slice(1);\n}\n\n/**\n * Number of bytes in anchor discriminators\n */\nconst DISCRIMINATOR_SIZE = 8;\n\n/**\n * Encodes and decodes account objects.\n */\nclass BorshAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n        if (!idl.accounts) {\n            this.accountLayouts = new Map();\n            return;\n        }\n        const types = idl.types;\n        if (!types) {\n            throw new Error(\"Accounts require `idl.types`\");\n        }\n        const layouts = idl.accounts.map((acc) => {\n            const typeDef = types.find((ty) => ty.name === acc.name);\n            if (!typeDef) {\n                throw new Error(`Account not found: ${acc.name}`);\n            }\n            return [acc.name, IdlCoder.typeDefLayout({ typeDef, types })];\n        });\n        this.accountLayouts = new Map(layouts);\n    }\n    async encode(accountName, account) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        const len = layout.encode(account, buffer);\n        const accountData = buffer.slice(0, len);\n        const discriminator = this.accountDiscriminator(accountName);\n        return Buffer$1.concat([discriminator, accountData]);\n    }\n    decode(accountName, data) {\n        // Assert the account discriminator is correct.\n        const discriminator = this.accountDiscriminator(accountName);\n        if (discriminator.compare(data.slice(0, DISCRIMINATOR_SIZE))) {\n            throw new Error(\"Invalid account discriminator\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeAny(data) {\n        const discriminator = data.slice(0, DISCRIMINATOR_SIZE);\n        const accountName = Array.from(this.accountLayouts.keys()).find((key) => this.accountDiscriminator(key).equals(discriminator));\n        if (!accountName) {\n            throw new Error(\"Account not found\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeUnchecked(accountName, acc) {\n        // Chop off the discriminator before decoding.\n        const data = acc.subarray(DISCRIMINATOR_SIZE);\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        return layout.decode(data);\n    }\n    memcmp(accountName, appendData) {\n        const discriminator = this.accountDiscriminator(accountName);\n        return {\n            offset: 0,\n            bytes: bs58$1.encode(appendData ? Buffer$1.concat([discriminator, appendData]) : discriminator),\n        };\n    }\n    size(accountName) {\n        return (DISCRIMINATOR_SIZE +\n            IdlCoder.typeSize({ defined: { name: accountName } }, this.idl));\n    }\n    /**\n     * Calculates and returns a unique 8 byte discriminator prepended to all anchor accounts.\n     *\n     * @param name The name of the account to calculate the discriminator.\n     */\n    accountDiscriminator(name) {\n        var _a;\n        const account = (_a = this.idl.accounts) === null || _a === void 0 ? void 0 : _a.find((acc) => acc.name === name);\n        if (!account) {\n            throw new Error(`Account not found: ${name}`);\n        }\n        return Buffer$1.from(account.discriminator);\n    }\n}\n\nclass BorshEventCoder {\n    constructor(idl) {\n        var _a;\n        if (!idl.events) {\n            this.layouts = new Map();\n            return;\n        }\n        const types = idl.types;\n        if (!types) {\n            throw new Error(\"Events require `idl.types`\");\n        }\n        const layouts = idl.events.map((ev) => {\n            const typeDef = types.find((ty) => ty.name === ev.name);\n            if (!typeDef) {\n                throw new Error(`Event not found: ${ev.name}`);\n            }\n            return [ev.name, IdlCoder.typeDefLayout({ typeDef, types })];\n        });\n        this.layouts = new Map(layouts);\n        this.discriminators = new Map(((_a = idl.events) !== null && _a !== void 0 ? _a : []).map((ev) => [\n            encode(Buffer$1.from(ev.discriminator)),\n            ev.name,\n        ]));\n    }\n    decode(log) {\n        let logArr;\n        // This will throw if log length is not a multiple of 4.\n        try {\n            logArr = decode(log);\n        }\n        catch (e) {\n            return null;\n        }\n        const disc = encode(logArr.slice(0, 8));\n        // Only deserialize if the discriminator implies a proper event.\n        const eventName = this.discriminators.get(disc);\n        if (!eventName) {\n            return null;\n        }\n        const layout = this.layouts.get(eventName);\n        if (!layout) {\n            throw new Error(`Unknown event: ${eventName}`);\n        }\n        const data = layout.decode(logArr.slice(8));\n        return { data, name: eventName };\n    }\n}\n\n/**\n * Encodes and decodes user-defined types.\n */\nclass BorshTypesCoder {\n    constructor(idl) {\n        const types = idl.types;\n        if (!types) {\n            this.typeLayouts = new Map();\n            return;\n        }\n        const layouts = types\n            .filter((ty) => !ty.generics)\n            .map((ty) => [\n            ty.name,\n            IdlCoder.typeDefLayout({ typeDef: ty, types }),\n        ]);\n        this.typeLayouts = new Map(layouts);\n    }\n    encode(name, type) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.typeLayouts.get(name);\n        if (!layout) {\n            throw new Error(`Unknown type: ${name}`);\n        }\n        const len = layout.encode(type, buffer);\n        return buffer.slice(0, len);\n    }\n    decode(name, data) {\n        const layout = this.typeLayouts.get(name);\n        if (!layout) {\n            throw new Error(`Unknown type: ${name}`);\n        }\n        return layout.decode(data);\n    }\n}\n\n/**\n * BorshCoder is the default Coder for Anchor programs implementing the\n * borsh based serialization interface.\n */\nclass BorshCoder {\n    constructor(idl) {\n        this.instruction = new BorshInstructionCoder(idl);\n        this.accounts = new BorshAccountsCoder(idl);\n        this.events = new BorshEventCoder(idl);\n        this.types = new BorshTypesCoder(idl);\n    }\n}\n\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nvar Layout_2 = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob$1 extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/** Factory for {@link OffsetLayout}. */\nvar offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = (property => new UInt(4, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nvar nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nvar ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link Union} values. */\nvar union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = ((length, property) => new Blob$1(length, property));\n\nclass SystemInstructionCoder {\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    constructor(_) { }\n    encode(ixName, ix) {\n        switch (ixName) {\n            case \"createAccount\": {\n                return encodeCreateAccount(ix);\n            }\n            case \"assign\": {\n                return encodeAssign(ix);\n            }\n            case \"transfer\": {\n                return encodeTransfer(ix);\n            }\n            case \"createAccountWithSeed\": {\n                return encodeCreateAccountWithSeed(ix);\n            }\n            case \"advanceNonceAccount\": {\n                return encodeAdvanceNonceAccount(ix);\n            }\n            case \"withdrawNonceAccount\": {\n                return encodeWithdrawNonceAccount(ix);\n            }\n            case \"initializeNonceAccount\": {\n                return encodeInitializeNonceAccount(ix);\n            }\n            case \"authorizeNonceAccount\": {\n                return encodeAuthorizeNonceAccount(ix);\n            }\n            case \"allocate\": {\n                return encodeAllocate(ix);\n            }\n            case \"allocateWithSeed\": {\n                return encodeAllocateWithSeed(ix);\n            }\n            case \"assignWithSeed\": {\n                return encodeAssignWithSeed(ix);\n            }\n            case \"transferWithSeed\": {\n                return encodeTransferWithSeed(ix);\n            }\n            default: {\n                throw new Error(`Invalid instruction: ${ixName}`);\n            }\n        }\n    }\n    encodeState(_ixName, _ix) {\n        throw new Error(\"System does not have state\");\n    }\n}\nclass RustStringLayout extends Layout_2 {\n    constructor(property) {\n        super(-1, property);\n        this.property = property;\n        this.layout = struct([\n            u32(\"length\"),\n            u32(\"lengthPadding\"),\n            blob(offset(u32(), -8), \"chars\"),\n        ], this.property);\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span;\n        }\n        const data = {\n            chars: Buffer.from(src, \"utf8\"),\n        };\n        return this.layout.encode(data, b, offset);\n    }\n    decode(b, offset = 0) {\n        const data = this.layout.decode(b, offset);\n        return data[\"chars\"].toString();\n    }\n    getSpan(b, offset = 0) {\n        return (u32().span +\n            u32().span +\n            new BN(new Uint8Array(b).slice(offset, offset + 4), 10, \"le\").toNumber());\n    }\n}\nfunction rustStringLayout(property) {\n    return new RustStringLayout(property);\n}\nfunction publicKey$2(property) {\n    return blob(32, property);\n}\nfunction encodeCreateAccount({ lamports, space, owner }) {\n    return encodeData({\n        createAccount: { lamports, space, owner: owner.toBuffer() },\n    });\n}\nfunction encodeAssign({ owner }) {\n    return encodeData({\n        assign: { owner: owner.toBuffer() },\n    });\n}\nfunction encodeTransfer({ lamports }) {\n    return encodeData({\n        transfer: { lamports },\n    });\n}\nfunction encodeCreateAccountWithSeed({ base, seed, lamports, space, owner, }) {\n    return encodeData({\n        createAccountWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            lamports,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(3).span + seed.length);\n}\nfunction encodeInitializeNonceAccount({ authorized }) {\n    return encodeData({\n        initializeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAdvanceNonceAccount({ authorized }) {\n    return encodeData({\n        advanceNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeWithdrawNonceAccount({ lamports }) {\n    return encodeData({\n        withdrawNonceAccount: { lamports },\n    });\n}\nfunction encodeAuthorizeNonceAccount({ authorized }) {\n    return encodeData({\n        authorizeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAllocate({ space }) {\n    return encodeData({\n        allocate: { space },\n    });\n}\nfunction encodeAllocateWithSeed({ base, seed, space, owner }) {\n    return encodeData({\n        allocateWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(9).span + seed.length);\n}\nfunction encodeAssignWithSeed({ base, seed, owner }) {\n    return encodeData({\n        assignWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(10).span + seed.length);\n}\nfunction encodeTransferWithSeed({ lamports, seed, owner }) {\n    return encodeData({\n        transferWithSeed: {\n            lamports,\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(11).span + seed.length);\n}\nconst LAYOUT = union(u32(\"instruction\"));\nLAYOUT.addVariant(0, struct([\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccount\");\nLAYOUT.addVariant(1, struct([publicKey$2(\"owner\")]), \"assign\");\nLAYOUT.addVariant(2, struct([ns64(\"lamports\")]), \"transfer\");\nLAYOUT.addVariant(3, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccountWithSeed\");\nLAYOUT.addVariant(4, struct([publicKey$2(\"authorized\")]), \"advanceNonceAccount\");\nLAYOUT.addVariant(5, struct([ns64(\"lamports\")]), \"withdrawNonceAccount\");\nLAYOUT.addVariant(6, struct([publicKey$2(\"authorized\")]), \"initializeNonceAccount\");\nLAYOUT.addVariant(7, struct([publicKey$2(\"authorized\")]), \"authorizeNonceAccount\");\nLAYOUT.addVariant(8, struct([ns64(\"space\")]), \"allocate\");\nLAYOUT.addVariant(9, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"allocateWithSeed\");\nLAYOUT.addVariant(10, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"assignWithSeed\");\nLAYOUT.addVariant(11, struct([\n    ns64(\"lamports\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"transferWithSeed\");\nfunction encodeData(instruction, maxSpan) {\n    const b = Buffer.alloc(maxSpan !== null && maxSpan !== void 0 ? maxSpan : instructionMaxSpan);\n    const span = LAYOUT.encode(instruction, b);\n    if (maxSpan === undefined) {\n        return b.slice(0, span);\n    }\n    return b;\n}\nconst instructionMaxSpan = Math.max(...Object.values(LAYOUT.registry).map((r) => r.span));\n\nclass SystemAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        switch (accountName) {\n            case \"nonce\": {\n                const buffer = Buffer.alloc(NONCE_ACCOUNT_LENGTH);\n                const len = NONCE_ACCOUNT_LAYOUT.encode(account, buffer);\n                return buffer.slice(0, len);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    decode(accountName, ix) {\n        return this.decodeUnchecked(accountName, ix);\n    }\n    decodeUnchecked(accountName, ix) {\n        switch (accountName) {\n            case \"nonce\": {\n                return decodeNonceAccount(ix);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    // TODO: this won't use the appendData.\n    memcmp(accountName, _appendData) {\n        switch (accountName) {\n            case \"nonce\": {\n                return {\n                    dataSize: NONCE_ACCOUNT_LENGTH,\n                };\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    size(accountName) {\n        return IdlCoder.typeSize({ defined: { name: accountName } }, this.idl);\n    }\n}\nfunction decodeNonceAccount(ix) {\n    return NONCE_ACCOUNT_LAYOUT.decode(ix);\n}\nclass WrappedLayout$1 extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey$1(property) {\n    return new WrappedLayout$1(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nconst NONCE_ACCOUNT_LAYOUT = struct([\n    u32(\"version\"),\n    u32(\"state\"),\n    publicKey$1(\"authorizedPubkey\"),\n    publicKey$1(\"nonce\"),\n    struct([nu64(\"lamportsPerSignature\")], \"feeCalculator\"),\n]);\n\nclass SystemEventsCoder {\n    constructor(_idl) { }\n    decode(_log) {\n        throw new Error(\"System program does not have events\");\n    }\n}\n\nclass SystemTypesCoder {\n    constructor(_idl) { }\n    encode(_name, _type) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n    decode(_name, _typeData) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n}\n\n/**\n * Coder for the System program.\n */\nclass SystemCoder {\n    constructor(idl) {\n        this.instruction = new SystemInstructionCoder(idl);\n        this.accounts = new SystemAccountsCoder(idl);\n        this.events = new SystemEventsCoder(idl);\n        this.types = new SystemTypesCoder(idl);\n    }\n}\n\nfunction hash(data) {\n    return new TextDecoder().decode(sha256$1(data));\n}\n\nvar sha256 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hash: hash\n});\n\n// Sync version of web3.PublicKey.createWithSeed.\nfunction createWithSeedSync(fromPublicKey, seed, programId) {\n    const buffer = Buffer$1.concat([\n        fromPublicKey.toBuffer(),\n        Buffer$1.from(seed),\n        programId.toBuffer(),\n    ]);\n    return new PublicKey(sha256$1(buffer));\n}\n\nvar pubkey = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    createWithSeedSync: createWithSeedSync\n});\n\nconst TOKEN_PROGRAM_ID = new PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");\nconst ASSOCIATED_PROGRAM_ID = new PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\nfunction associatedAddress({ mint, owner, }) {\n    return PublicKey.findProgramAddressSync([owner.toBuffer(), TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], ASSOCIATED_PROGRAM_ID)[0];\n}\n\nvar token = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    TOKEN_PROGRAM_ID: TOKEN_PROGRAM_ID,\n    ASSOCIATED_PROGRAM_ID: ASSOCIATED_PROGRAM_ID,\n    associatedAddress: associatedAddress\n});\n\nvar browserPonyfill = {exports: {}};\n\n(function (module, exports) {\nvar global = typeof self !== 'undefined' ? self : commonjsGlobal;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException;\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\n((function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}))({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch; // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch; // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch; // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers;\nexports.Request = ctx.Request;\nexports.Response = ctx.Response;\nmodule.exports = exports;\n}(browserPonyfill, browserPonyfill.exports));\n\nvar fetch = /*@__PURE__*/getDefaultExportFromCjs(browserPonyfill.exports);\n\n/**\n * Returns a verified build from the anchor registry. null if no such\n * verified build exists, e.g., if the program has been upgraded since the\n * last verified build.\n */\nasync function verifiedBuild(connection, programId, limit = 5) {\n    const url = `https://api.apr.dev/api/v0/program/${programId.toString()}/latest?limit=${limit}`;\n    const [programData, latestBuildsResp] = await Promise.all([\n        fetchData(connection, programId),\n        fetch(url),\n    ]);\n    // Filter out all non successful builds.\n    const latestBuilds = (await latestBuildsResp.json()).filter((b) => !b.aborted && b.state === \"Built\" && b.verified === \"Verified\");\n    if (latestBuilds.length === 0) {\n        return null;\n    }\n    // Get the latest build.\n    const build = latestBuilds[0];\n    // Has the program been upgraded since the last build?\n    if (programData.slot.toNumber() !== build.verified_slot) {\n        return null;\n    }\n    // Success.\n    return build;\n}\n/**\n * Returns the program data account for this program, containing the\n * metadata for this program, e.g., the upgrade authority.\n */\nasync function fetchData(connection, programId) {\n    const accountInfo = await connection.getAccountInfo(programId);\n    if (accountInfo === null) {\n        throw new Error(\"program account not found\");\n    }\n    const { program } = decodeUpgradeableLoaderState(accountInfo.data);\n    const programdataAccountInfo = await connection.getAccountInfo(program.programdataAddress);\n    if (programdataAccountInfo === null) {\n        throw new Error(\"program data account not found\");\n    }\n    const { programData } = decodeUpgradeableLoaderState(programdataAccountInfo.data);\n    return programData;\n}\nconst UPGRADEABLE_LOADER_STATE_LAYOUT = borsh.rustEnum([\n    borsh.struct([], \"uninitialized\"),\n    borsh.struct([borsh.option(borsh.publicKey(), \"authorityAddress\")], \"buffer\"),\n    borsh.struct([borsh.publicKey(\"programdataAddress\")], \"program\"),\n    borsh.struct([\n        borsh.u64(\"slot\"),\n        borsh.option(borsh.publicKey(), \"upgradeAuthorityAddress\"),\n    ], \"programData\"),\n], undefined, borsh.u32());\nfunction decodeUpgradeableLoaderState(data) {\n    return UPGRADEABLE_LOADER_STATE_LAYOUT.decode(data);\n}\n\nvar registry = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    verifiedBuild: verifiedBuild,\n    fetchData: fetchData,\n    decodeUpgradeableLoaderState: decodeUpgradeableLoaderState\n});\n\nvar index = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    sha256: sha256,\n    rpc: rpc,\n    publicKey: pubkey,\n    bytes: index$1,\n    token: token,\n    features: features,\n    registry: registry\n});\n\nfunction splitArgsAndCtx(idlIx, args) {\n    var _a, _b;\n    let options = {};\n    const inputLen = idlIx.args ? idlIx.args.length : 0;\n    if (args.length > inputLen) {\n        if (args.length !== inputLen + 1) {\n            throw new Error(`provided too many arguments ${args} to instruction ${idlIx === null || idlIx === void 0 ? void 0 : idlIx.name} expecting: ${(_b = (_a = idlIx.args) === null || _a === void 0 ? void 0 : _a.map((a) => a.name)) !== null && _b !== void 0 ? _b : []}`);\n        }\n        options = args.pop();\n    }\n    return [args, options];\n}\n\nclass InstructionNamespaceFactory {\n    static build(idlIx, encodeFn, programId) {\n        if (idlIx.name === \"_inner\") {\n            throw new IdlError(\"the _inner name is reserved\");\n        }\n        const ix = (...args) => {\n            const [ixArgs, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            validateAccounts(idlIx.accounts, ctx.accounts);\n            validateInstruction(idlIx, ...args);\n            const keys = ix.accounts(ctx.accounts);\n            if (ctx.remainingAccounts !== undefined) {\n                keys.push(...ctx.remainingAccounts);\n            }\n            if (isSet(\"debug-logs\")) {\n                console.log(\"Outgoing account metas:\", keys);\n            }\n            return new TransactionInstruction({\n                keys,\n                programId,\n                data: encodeFn(idlIx.name, toInstruction(idlIx, ...ixArgs)),\n            });\n        };\n        // Utility fn for ordering the accounts for this instruction.\n        ix[\"accounts\"] = (accs) => {\n            return InstructionNamespaceFactory.accountsArray(accs, idlIx.accounts, programId, idlIx.name);\n        };\n        return ix;\n    }\n    static accountsArray(ctx, accounts, programId, ixName) {\n        if (!ctx) {\n            return [];\n        }\n        return accounts\n            .map((acc) => {\n            if (isCompositeAccounts(acc)) {\n                const rpcAccs = ctx[acc.name];\n                return InstructionNamespaceFactory.accountsArray(rpcAccs, acc.accounts, programId, ixName).flat();\n            }\n            let pubkey;\n            try {\n                pubkey = translateAddress(ctx[acc.name]);\n            }\n            catch (err) {\n                throw new Error(`Wrong input type for account \"${acc.name}\" in the instruction accounts object${ixName !== undefined ? ' for instruction \"' + ixName + '\"' : \"\"}. Expected PublicKey or string.`);\n            }\n            const isOptional = acc.optional && pubkey.equals(programId);\n            const isWritable = Boolean(acc.writable && !isOptional);\n            const isSigner = Boolean(acc.signer && !isOptional);\n            return {\n                pubkey,\n                isWritable,\n                isSigner,\n            };\n        })\n            .flat();\n    }\n}\n// Throws error if any argument required for the `ix` is not given.\nfunction validateInstruction(ix, ...args) {\n    // todo\n}\n\nclass TransactionFactory {\n    static build(idlIx, ixFn) {\n        const txFn = (...args) => {\n            var _a, _b, _c;\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            const tx = new Transaction();\n            if (ctx.preInstructions && ctx.instructions) {\n                throw new Error(\"instructions is deprecated, use preInstructions\");\n            }\n            (_a = ctx.preInstructions) === null || _a === void 0 ? void 0 : _a.forEach((ix) => tx.add(ix));\n            (_b = ctx.instructions) === null || _b === void 0 ? void 0 : _b.forEach((ix) => tx.add(ix));\n            tx.add(ixFn(...args));\n            (_c = ctx.postInstructions) === null || _c === void 0 ? void 0 : _c.forEach((ix) => tx.add(ix));\n            return tx;\n        };\n        return txFn;\n    }\n}\n\nclass RpcFactory {\n    static build(idlIx, txFn, idlErrors, provider) {\n        const rpc = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            if (provider.sendAndConfirm === undefined) {\n                throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n            }\n            try {\n                return await provider.sendAndConfirm(tx, (_a = ctx.signers) !== null && _a !== void 0 ? _a : [], ctx.options);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n        };\n        return rpc;\n    }\n}\n\nclass AccountFactory {\n    static build(idl, coder, programId, provider) {\n        var _a;\n        return ((_a = idl.accounts) !== null && _a !== void 0 ? _a : []).reduce((accountFns, acc) => {\n            accountFns[acc.name] = new AccountClient(idl, acc, programId, provider, coder);\n            return accountFns;\n        }, {});\n    }\n}\nclass AccountClient {\n    /**\n     * Returns the number of bytes in this account.\n     */\n    get size() {\n        return this._size;\n    }\n    /**\n     * Returns the program ID owning all accounts.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * Returns the client's wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * Returns the coder.\n     */\n    get coder() {\n        return this._coder;\n    }\n    constructor(idl, idlAccount, programId, provider, coder) {\n        this._idlAccount = idlAccount;\n        this._programId = programId;\n        this._provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._size = this._coder.accounts.size(idlAccount.name);\n    }\n    /**\n     * Returns a deserialized account, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullable(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullableAndContext(address, commitment) {\n        const accountInfo = await this.getAccountInfoAndContext(address, commitment);\n        const { value, context } = accountInfo;\n        return {\n            data: value && value.data.length !== 0\n                ? this._coder.accounts.decode(this._idlAccount.name, value.data)\n                : null,\n            context,\n        };\n    }\n    /**\n     * Returns a deserialized account.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetch(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist or has no data ${address.toString()}`);\n        }\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchAndContext(address, commitment) {\n        const { data, context } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist ${address.toString()}`);\n        }\n        return { data, context };\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultiple(addresses, commitment) {\n        const accounts = await this.fetchMultipleAndContext(addresses, commitment);\n        return accounts.map((account) => (account ? account.data : null));\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultipleAndContext(addresses, commitment) {\n        const accounts = await getMultipleAccountsAndContext(this._provider.connection, addresses.map((address) => translateAddress(address)), commitment);\n        // Decode accounts where discriminator is correct, null otherwise\n        return accounts.map((result) => {\n            if (result == null) {\n                return null;\n            }\n            const { account, context } = result;\n            return {\n                data: this._coder.accounts.decode(this._idlAccount.name, account.data),\n                context,\n            };\n        });\n    }\n    /**\n     * Returns all instances of this account type for the program.\n     *\n     * @param filters User-provided filters to narrow the results from `connection.getProgramAccounts`.\n     *\n     *                When filters are not defined this method returns all\n     *                the account instances.\n     *\n     *                When filters are of type `Buffer`, the filters are appended\n     *                after the discriminator.\n     *\n     *                When filters are of type `GetProgramAccountsFilter[]`,\n     *                filters are appended after the discriminator filter.\n     */\n    async all(filters) {\n        const filter = this.coder.accounts.memcmp(this._idlAccount.name, filters instanceof Buffer ? filters : undefined);\n        const coderFilters = [];\n        if ((filter === null || filter === void 0 ? void 0 : filter.offset) != undefined && (filter === null || filter === void 0 ? void 0 : filter.bytes) != undefined) {\n            coderFilters.push({\n                memcmp: { offset: filter.offset, bytes: filter.bytes },\n            });\n        }\n        if ((filter === null || filter === void 0 ? void 0 : filter.dataSize) != undefined) {\n            coderFilters.push({ dataSize: filter.dataSize });\n        }\n        let resp = await this._provider.connection.getProgramAccounts(this._programId, {\n            commitment: this._provider.connection.commitment,\n            filters: [...coderFilters, ...(Array.isArray(filters) ? filters : [])],\n        });\n        return resp.map(({ pubkey, account }) => {\n            return {\n                publicKey: pubkey,\n                account: this._coder.accounts.decode(this._idlAccount.name, account.data),\n            };\n        });\n    }\n    /**\n     * Returns an `EventEmitter` emitting a \"change\" event whenever the account\n     * changes.\n     */\n    subscribe(address, commitment) {\n        const sub = subscriptions.get(address.toString());\n        if (sub) {\n            return sub.ee;\n        }\n        const ee = new EventEmitter();\n        address = translateAddress(address);\n        const listener = this._provider.connection.onAccountChange(address, (acc) => {\n            const account = this._coder.accounts.decode(this._idlAccount.name, acc.data);\n            ee.emit(\"change\", account);\n        }, commitment);\n        subscriptions.set(address.toString(), {\n            ee,\n            listener,\n        });\n        return ee;\n    }\n    /**\n     * Unsubscribes from the account at the given address.\n     */\n    async unsubscribe(address) {\n        let sub = subscriptions.get(address.toString());\n        if (!sub) {\n            console.warn(\"Address is not subscribed\");\n            return;\n        }\n        if (subscriptions) {\n            await this._provider.connection\n                .removeAccountChangeListener(sub.listener)\n                .then(() => {\n                subscriptions.delete(address.toString());\n            })\n                .catch(console.error);\n        }\n    }\n    /**\n     * Returns an instruction for creating this account.\n     */\n    async createInstruction(signer, sizeOverride) {\n        const size = this.size;\n        if (this._provider.publicKey === undefined) {\n            throw new Error(\"This function requires the Provider interface implementor to have a 'publicKey' field.\");\n        }\n        return SystemProgram.createAccount({\n            fromPubkey: this._provider.publicKey,\n            newAccountPubkey: signer.publicKey,\n            space: sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size,\n            lamports: await this._provider.connection.getMinimumBalanceForRentExemption(sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size),\n            programId: this._programId,\n        });\n    }\n    async getAccountInfo(address, commitment) {\n        return await this._provider.connection.getAccountInfo(translateAddress(address), commitment);\n    }\n    async getAccountInfoAndContext(address, commitment) {\n        return await this._provider.connection.getAccountInfoAndContext(translateAddress(address), commitment);\n    }\n}\n// Tracks all subscriptions.\nconst subscriptions = new Map();\n\nconst PROGRAM_LOG = \"Program log: \";\nconst PROGRAM_DATA = \"Program data: \";\nconst PROGRAM_LOG_START_INDEX = PROGRAM_LOG.length;\nconst PROGRAM_DATA_START_INDEX = PROGRAM_DATA.length;\nclass EventManager {\n    constructor(programId, provider, coder) {\n        this._programId = programId;\n        this._provider = provider;\n        this._eventParser = new EventParser(programId, coder);\n        this._eventCallbacks = new Map();\n        this._eventListeners = new Map();\n        this._listenerIdCount = 0;\n    }\n    addEventListener(eventName, callback) {\n        var _a;\n        let listener = this._listenerIdCount;\n        this._listenerIdCount += 1;\n        // Store the listener into the event map.\n        if (!this._eventListeners.has(eventName)) {\n            this._eventListeners.set(eventName, []);\n        }\n        this._eventListeners.set(eventName, ((_a = this._eventListeners.get(eventName)) !== null && _a !== void 0 ? _a : []).concat(listener));\n        // Store the callback into the listener map.\n        this._eventCallbacks.set(listener, [eventName, callback]);\n        // Create the subscription singleton, if needed.\n        if (this._onLogsSubscriptionId !== undefined) {\n            return listener;\n        }\n        this._onLogsSubscriptionId = this._provider.connection.onLogs(this._programId, (logs, ctx) => {\n            if (logs.err) {\n                return;\n            }\n            for (const event of this._eventParser.parseLogs(logs.logs)) {\n                const allListeners = this._eventListeners.get(event.name);\n                if (allListeners) {\n                    allListeners.forEach((listener) => {\n                        const listenerCb = this._eventCallbacks.get(listener);\n                        if (listenerCb) {\n                            const [, callback] = listenerCb;\n                            callback(event.data, ctx.slot, logs.signature);\n                        }\n                    });\n                }\n            }\n        });\n        return listener;\n    }\n    async removeEventListener(listener) {\n        // Get the callback.\n        const callback = this._eventCallbacks.get(listener);\n        if (!callback) {\n            throw new Error(`Event listener ${listener} doesn't exist!`);\n        }\n        const [eventName] = callback;\n        // Get the listeners.\n        let listeners = this._eventListeners.get(eventName);\n        if (!listeners) {\n            throw new Error(`Event listeners don't exist for ${eventName}!`);\n        }\n        // Update both maps.\n        this._eventCallbacks.delete(listener);\n        listeners = listeners.filter((l) => l !== listener);\n        this._eventListeners.set(eventName, listeners);\n        if (listeners.length === 0) {\n            this._eventListeners.delete(eventName);\n        }\n        // Kill the websocket connection if all listeners have been removed.\n        if (this._eventCallbacks.size === 0) {\n            if (this._eventListeners.size !== 0) {\n                throw new Error(`Expected event listeners size to be 0 but got ${this._eventListeners.size}`);\n            }\n            if (this._onLogsSubscriptionId !== undefined) {\n                await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId);\n                this._onLogsSubscriptionId = undefined;\n            }\n        }\n    }\n}\nclass EventParser {\n    constructor(programId, coder) {\n        this.coder = coder;\n        this.programId = programId;\n    }\n    // Each log given, represents an array of messages emitted by\n    // a single transaction, which can execute many different programs across\n    // CPI boundaries. However, the subscription is only interested in the\n    // events emitted by *this* program. In achieving this, we keep track of the\n    // program execution context by parsing each log and looking for a CPI\n    // `invoke` call. If one exists, we know a new program is executing. So we\n    // push the programId onto a stack and switch the program context. This\n    // allows us to track, for a given log, which program was executing during\n    // its emission, thereby allowing us to know if a given log event was\n    // emitted by *this* program. If it was, then we parse the raw string and\n    // emit the event if the string matches the event being subscribed to.\n    *parseLogs(logs, errorOnDecodeFailure = false) {\n        const logScanner = new LogScanner(logs);\n        const execution = new ExecutionContext();\n        let log = logScanner.next();\n        while (log !== null) {\n            let [event, newProgram, didPop] = this.handleLog(execution, log, errorOnDecodeFailure);\n            if (event) {\n                yield event;\n            }\n            if (newProgram) {\n                execution.push(newProgram);\n            }\n            if (didPop) {\n                execution.pop();\n            }\n            log = logScanner.next();\n        }\n    }\n    // Main log handler. Returns a three element array of the event, the\n    // next program that was invoked for CPI, and a boolean indicating if\n    // a program has completed execution (and thus should be popped off the\n    // execution stack).\n    handleLog(execution, log, errorOnDecodeFailure) {\n        // Executing program is this program.\n        if (execution.stack.length > 0 &&\n            execution.program() === this.programId.toString()) {\n            return this.handleProgramLog(log, errorOnDecodeFailure);\n        }\n        // Executing program is not this program.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs from *this* program.\n    handleProgramLog(log, errorOnDecodeFailure) {\n        // This is a `msg!` log or a `sol_log_data` log.\n        if (log.startsWith(PROGRAM_LOG) || log.startsWith(PROGRAM_DATA)) {\n            const logStr = log.startsWith(PROGRAM_LOG)\n                ? log.slice(PROGRAM_LOG_START_INDEX)\n                : log.slice(PROGRAM_DATA_START_INDEX);\n            const event = this.coder.events.decode(logStr);\n            if (errorOnDecodeFailure && event === null) {\n                throw new Error(`Unable to decode event ${logStr}`);\n            }\n            return [event, null, false];\n        }\n        // System log.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs when the current program being executing is *not* this.\n    handleSystemLog(log) {\n        // System component.\n        const logStart = log.split(\":\")[0];\n        // Did the program finish executing?\n        if (logStart.match(/^Program (.*) success/g) !== null) {\n            return [null, true];\n            // Recursive call.\n        }\n        else if (logStart.startsWith(`Program ${this.programId.toString()} invoke`)) {\n            return [this.programId.toString(), false];\n        }\n        // CPI call.\n        else if (logStart.includes(\"invoke\")) {\n            return [\"cpi\", false]; // Any string will do.\n        }\n        else {\n            return [null, false];\n        }\n    }\n}\n// Stack frame execution context, allowing one to track what program is\n// executing for a given log.\nclass ExecutionContext {\n    constructor() {\n        this.stack = [];\n    }\n    program() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        return this.stack[this.stack.length - 1];\n    }\n    push(newProgram) {\n        this.stack.push(newProgram);\n    }\n    pop() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        this.stack.pop();\n    }\n}\nclass LogScanner {\n    constructor(logs) {\n        this.logs = logs;\n    }\n    next() {\n        if (this.logs.length === 0) {\n            return null;\n        }\n        let l = this.logs[0];\n        this.logs = this.logs.slice(1);\n        return l;\n    }\n}\n\nclass SimulateFactory {\n    static build(idlIx, txFn, idlErrors, provider, coder, programId, idl) {\n        const simulate = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            let resp = undefined;\n            if (provider.simulate === undefined) {\n                throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");\n            }\n            try {\n                resp = await provider.simulate(tx, ctx.signers, (_a = ctx.options) === null || _a === void 0 ? void 0 : _a.commitment);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n            if (resp === undefined) {\n                throw new Error(\"Unable to simulate transaction\");\n            }\n            const logs = resp.logs;\n            if (!logs) {\n                throw new Error(\"Simulated logs not found\");\n            }\n            const events = [];\n            if (idl.events) {\n                let parser = new EventParser(programId, coder);\n                for (const event of parser.parseLogs(logs)) {\n                    events.push(event);\n                }\n            }\n            return { events, raw: logs };\n        };\n        return simulate;\n    }\n}\n\nfunction uint64(property) {\n    return new WrappedLayout(blob(8), (b) => u64.fromBuffer(b), (n) => n.toBuffer(), property);\n}\nfunction publicKey(property) {\n    return new WrappedLayout(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nfunction coption(layout, property) {\n    return new COptionLayout(layout, property);\n}\nclass WrappedLayout extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nclass COptionLayout extends Layout_2 {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = u32();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span + this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 4) + 4;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 4);\n        }\n        throw new Error(\"Invalid coption \" + this.layout.property);\n    }\n    getSpan(b, offset = 0) {\n        return this.layout.getSpan(b, offset + 4) + 4;\n    }\n}\nclass u64 extends BN {\n    /**\n     * Convert to Buffer representation\n     */\n    toBuffer() {\n        const a = super.toArray().reverse();\n        const b = Buffer.from(a);\n        if (b.length === 8) {\n            return b;\n        }\n        if (b.length >= 8) {\n            throw new Error(\"u64 too large\");\n        }\n        const zeroPad = Buffer.alloc(8);\n        b.copy(zeroPad);\n        return zeroPad;\n    }\n    /**\n     * Construct a u64 from Buffer representation\n     */\n    static fromBuffer(buffer) {\n        if (buffer.length !== 8) {\n            throw new Error(`Invalid buffer length: ${buffer.length}`);\n        }\n        return new u64([...buffer]\n            .reverse()\n            .map((i) => `00${i.toString(16)}`.slice(-2))\n            .join(\"\"), 16);\n    }\n}\nconst TOKEN_ACCOUNT_LAYOUT = struct([\n    publicKey(\"mint\"),\n    publicKey(\"owner\"),\n    uint64(\"amount\"),\n    coption(publicKey(), \"delegate\"),\n    ((p) => {\n        const U = union(u8(\"discriminator\"), null, p);\n        U.addVariant(0, struct([]), \"uninitialized\");\n        U.addVariant(1, struct([]), \"initialized\");\n        U.addVariant(2, struct([]), \"frozen\");\n        return U;\n    })(\"state\"),\n    coption(uint64(), \"isNative\"),\n    uint64(\"delegatedAmount\"),\n    coption(publicKey(), \"closeAuthority\"),\n]);\nfunction decodeTokenAccount(b) {\n    return TOKEN_ACCOUNT_LAYOUT.decode(b);\n}\n\n// Populates a given accounts context with PDAs and common missing accounts.\nclass AccountsResolver {\n    constructor(_args, _accounts, _provider, _programId, _idlIx, accountNamespace, _idlTypes, _customResolver) {\n        this._args = _args;\n        this._accounts = _accounts;\n        this._provider = _provider;\n        this._programId = _programId;\n        this._idlIx = _idlIx;\n        this._idlTypes = _idlTypes;\n        this._customResolver = _customResolver;\n        this._accountStore = new AccountStore(_provider, accountNamespace, _programId);\n    }\n    args(args) {\n        this._args = args;\n    }\n    // Note: We serially resolve PDAs one by one rather than doing them\n    //       in parallel because there can be dependencies between\n    //       addresses. That is, one PDA can be used as a seed in another.\n    async resolve() {\n        this.resolveEventCpi(this._idlIx.accounts);\n        this.resolveConst(this._idlIx.accounts);\n        // Auto populate pdas and relations until we stop finding new accounts\n        let depth = 0;\n        while ((await this.resolvePdasAndRelations(this._idlIx.accounts)) +\n            (await this.resolveCustom()) >\n            0) {\n            depth++;\n            if (depth === 16) {\n                throw new Error(\"Reached maximum depth for account resolution\");\n            }\n        }\n    }\n    resolveOptionals(accounts) {\n        Object.assign(this._accounts, this.resolveOptionalsHelper(accounts, this._idlIx.accounts));\n    }\n    get(path) {\n        // Only return if pubkey\n        const ret = path.reduce((acc, subPath) => acc && acc[subPath], this._accounts);\n        if (ret && ret.toBase58) {\n            return ret;\n        }\n    }\n    set(path, value) {\n        let cur = this._accounts;\n        path.forEach((p, i) => {\n            var _a;\n            const isLast = i === path.length - 1;\n            if (isLast) {\n                cur[p] = value;\n            }\n            cur[p] = (_a = cur[p]) !== null && _a !== void 0 ? _a : {};\n            cur = cur[p];\n        });\n    }\n    resolveOptionalsHelper(partialAccounts, accounts) {\n        const nestedAccountsGeneric = {};\n        // Looping through accountItem array instead of on partialAccounts, so\n        // we only traverse array once\n        for (const accountItem of accounts) {\n            const accountName = accountItem.name;\n            const partialAccount = partialAccounts[accountName];\n            // Skip if the account isn't included (thus would be undefined)\n            if (partialAccount === undefined)\n                continue;\n            if (isPartialAccounts(partialAccount)) {\n                // is compound accounts, recurse one level deeper\n                if (isCompositeAccounts(accountItem)) {\n                    nestedAccountsGeneric[accountName] = this.resolveOptionalsHelper(partialAccount, accountItem[\"accounts\"]);\n                }\n                else {\n                    // Here we try our best to recover gracefully. If there are optionals we can't check, we will fail then.\n                    nestedAccountsGeneric[accountName] = flattenPartialAccounts(partialAccount, true);\n                }\n            }\n            else {\n                // if not compound accounts, do null/optional check and proceed\n                if (partialAccount !== null) {\n                    nestedAccountsGeneric[accountName] = translateAddress(partialAccount);\n                }\n                else if (accountItem[\"optional\"]) {\n                    nestedAccountsGeneric[accountName] = this._programId;\n                }\n            }\n        }\n        return nestedAccountsGeneric;\n    }\n    async resolveCustom() {\n        if (this._customResolver) {\n            const { accounts, resolved } = await this._customResolver({\n                args: this._args,\n                accounts: this._accounts,\n                provider: this._provider,\n                programId: this._programId,\n                idlIx: this._idlIx,\n            });\n            this._accounts = accounts;\n            return resolved;\n        }\n        return 0;\n    }\n    /**\n     * Resolve event CPI accounts `eventAuthority` and `program`.\n     *\n     * Accounts will only be resolved if they are declared next to each other to\n     * reduce the chance of name collision.\n     */\n    resolveEventCpi(accounts, path = []) {\n        for (const i in accounts) {\n            const accountOrAccounts = accounts[i];\n            if (isCompositeAccounts(accountOrAccounts)) {\n                this.resolveEventCpi(accountOrAccounts.accounts, [\n                    ...path,\n                    accountOrAccounts.name,\n                ]);\n            }\n            // Validate next index exists\n            const nextIndex = +i + 1;\n            if (nextIndex === accounts.length)\n                return;\n            const currentName = accounts[i].name;\n            const nextName = accounts[nextIndex].name;\n            // Populate event CPI accounts if they exist\n            if (currentName === \"eventAuthority\" && nextName === \"program\") {\n                const currentPath = [...path, currentName];\n                const nextPath = [...path, nextName];\n                if (!this.get(currentPath)) {\n                    this.set(currentPath, PublicKey.findProgramAddressSync([Buffer.from(\"__event_authority\")], this._programId)[0]);\n                }\n                if (!this.get(nextPath)) {\n                    this.set(nextPath, this._programId);\n                }\n                return;\n            }\n        }\n    }\n    resolveConst(accounts, path = []) {\n        for (const accountOrAccounts of accounts) {\n            const name = accountOrAccounts.name;\n            if (isCompositeAccounts(accountOrAccounts)) {\n                this.resolveConst(accountOrAccounts.accounts, [...path, name]);\n            }\n            else {\n                const account = accountOrAccounts;\n                if ((account.signer || account.address) && !this.get([...path, name])) {\n                    // Default signers to the provider\n                    if (account.signer) {\n                        // @ts-expect-error\n                        if (!this._provider.wallet) {\n                            throw new Error(\"This function requires the `Provider` interface implementor to have a `wallet` field.\");\n                        }\n                        // @ts-expect-error\n                        this.set([...path, name], this._provider.wallet.publicKey);\n                    }\n                    // Set based on `address` field\n                    if (account.address) {\n                        this.set([...path, name], translateAddress(account.address));\n                    }\n                }\n            }\n        }\n    }\n    async resolvePdasAndRelations(accounts, path = []) {\n        let found = 0;\n        for (const accountOrAccounts of accounts) {\n            const name = accountOrAccounts.name;\n            if (isCompositeAccounts(accountOrAccounts)) {\n                found += await this.resolvePdasAndRelations(accountOrAccounts.accounts, [...path, name]);\n            }\n            else {\n                const account = accountOrAccounts;\n                if ((account.pda || account.relations) && !this.get([...path, name])) {\n                    found++;\n                    // Accounts might not get resolved successfully if a seed depends on\n                    // another seed to be resolved *and* the accounts for resolution are\n                    // out of order. In this case, skip the accounts that throw in order\n                    // to resolve those accounts later.\n                    try {\n                        if (account.pda) {\n                            const seeds = await Promise.all(account.pda.seeds.map((seed) => this.toBuffer(seed, path)));\n                            if (seeds.some((seed) => !seed)) {\n                                continue;\n                            }\n                            const programId = await this.parseProgramId(account, path);\n                            const [pubkey] = PublicKey.findProgramAddressSync(seeds, programId);\n                            this.set([...path, name], pubkey);\n                        }\n                    }\n                    catch { }\n                    try {\n                        if (account.relations) {\n                            const accountKey = this.get([...path, account.relations[0]]);\n                            if (accountKey) {\n                                const account = await this._accountStore.fetchAccount({\n                                    publicKey: accountKey,\n                                });\n                                this.set([...path, name], account[name]);\n                            }\n                        }\n                    }\n                    catch { }\n                }\n            }\n        }\n        return found;\n    }\n    async parseProgramId(account, path = []) {\n        var _a;\n        if (!((_a = account.pda) === null || _a === void 0 ? void 0 : _a.program)) {\n            return this._programId;\n        }\n        const buf = await this.toBuffer(account.pda.program, path);\n        if (!buf) {\n            throw new Error(`Program seed not resolved: ${account.name}`);\n        }\n        return new PublicKey(buf);\n    }\n    async toBuffer(seed, path = []) {\n        switch (seed.kind) {\n            case \"const\":\n                return this.toBufferConst(seed);\n            case \"arg\":\n                return await this.toBufferArg(seed);\n            case \"account\":\n                return await this.toBufferAccount(seed, path);\n            default:\n                throw new Error(`Unexpected seed: ${seed}`);\n        }\n    }\n    toBufferConst(seed) {\n        return this.toBufferValue(\"bytes\", seed.value);\n    }\n    async toBufferArg(seed) {\n        const [name, ...path] = seed.path.split(\".\");\n        const index = this._idlIx.args.findIndex((arg) => arg.name === name);\n        if (index === -1) {\n            throw new Error(`Unable to find argument for seed: ${name}`);\n        }\n        const value = path.reduce((acc, path) => (acc !== null && acc !== void 0 ? acc : {})[path], this._args[index]);\n        if (value === undefined) {\n            return;\n        }\n        const type = this.getType(this._idlIx.args[index].type, path);\n        return this.toBufferValue(type, value);\n    }\n    async toBufferAccount(seed, path = []) {\n        const [name, ...paths] = seed.path.split(\".\");\n        const fieldPubkey = this.get([...path, name]);\n        if (!fieldPubkey)\n            return;\n        // The seed is a pubkey of the account.\n        if (!paths.length) {\n            return this.toBufferValue(\"pubkey\", fieldPubkey);\n        }\n        if (!seed.account) {\n            throw new Error(`Seed account is required in order to resolve type: ${seed.path}`);\n        }\n        // The key is account data.\n        //\n        // Fetch and deserialize it.\n        const account = await this._accountStore.fetchAccount({\n            publicKey: fieldPubkey,\n            name: seed.account,\n        });\n        // Dereference all fields in the path to get the field value\n        // used in the seed.\n        let accountValue = account;\n        let currentPaths = paths;\n        while (currentPaths.length > 0) {\n            accountValue = accountValue[currentPaths[0]];\n            currentPaths = currentPaths.slice(1);\n        }\n        if (accountValue === undefined)\n            return;\n        const type = this.getType({ defined: { name: seed.account } }, paths);\n        return this.toBufferValue(type, accountValue);\n    }\n    /**\n     * Converts the given idl valaue into a Buffer. The values here must be\n     * primitives, e.g. no structs.\n     */\n    toBufferValue(type, value) {\n        switch (type) {\n            case \"u8\":\n            case \"i8\":\n                return Buffer.from([value]);\n            case \"u16\":\n            case \"i16\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 2);\n            case \"u32\":\n            case \"i32\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 4);\n            case \"u64\":\n            case \"i64\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 8);\n            case \"u128\":\n            case \"i128\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 16);\n            case \"u256\":\n            case \"i256\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 32);\n            case \"string\":\n                return Buffer.from(value);\n            case \"pubkey\":\n                return value.toBuffer();\n            case \"bytes\":\n                return Buffer.from(value);\n            default:\n                if (type === null || type === void 0 ? void 0 : type.array) {\n                    return Buffer.from(value);\n                }\n                throw new Error(`Unexpected seed type: ${type}`);\n        }\n    }\n    /**\n     * Recursively get the type at some path of either a primitive or a user\n     * defined struct.\n     */\n    getType(type, path = []) {\n        var _a;\n        const typeName = (_a = type === null || type === void 0 ? void 0 : type.defined) === null || _a === void 0 ? void 0 : _a.name;\n        if (typeName) {\n            // Handle token account separately\n            if (typeName === \"tokenAccount\") {\n                switch (path.at(0)) {\n                    case \"mint\":\n                    case \"owner\":\n                        return \"pubkey\";\n                    case \"amount\":\n                    case \"delagatedAmount\":\n                        return \"u64\";\n                    default:\n                        throw new Error(`Unknown token account path: ${path}`);\n                }\n            }\n            const definedType = this._idlTypes.find((t) => t.name === typeName);\n            if (!definedType) {\n                throw new Error(`Type not found: ${typeName}`);\n            }\n            // Only named structs are supported\n            const [fieldName, ...subPath] = path;\n            const fields = definedType.type\n                .fields;\n            const field = fields.find((field) => field.name === fieldName);\n            if (!field) {\n                throw new Error(`Field not found: ${fieldName}`);\n            }\n            return this.getType(field.type, subPath);\n        }\n        return type;\n    }\n}\n// TODO: this should be configurable to avoid unnecessary requests.\nclass AccountStore {\n    constructor(_provider, accounts, programId) {\n        this._provider = _provider;\n        this._cache = new Map();\n        this._idls = {};\n        this._idls[programId.toBase58()] = accounts;\n    }\n    async fetchAccount({ publicKey, name, }) {\n        const address = publicKey.toBase58();\n        if (!this._cache.has(address)) {\n            const accountInfo = await this._provider.connection.getAccountInfo(publicKey);\n            if (accountInfo === null) {\n                throw new Error(`Account not found: ${address}`);\n            }\n            if (name === \"tokenAccount\") {\n                const account = decodeTokenAccount(accountInfo.data);\n                this._cache.set(address, account);\n            }\n            else {\n                const accounts = await this.getAccountsNs(accountInfo.owner);\n                if (accounts) {\n                    const accountNs = Object.values(accounts)[0];\n                    if (accountNs) {\n                        const account = accountNs.coder.accounts.decodeAny(accountInfo.data);\n                        this._cache.set(address, account);\n                    }\n                }\n            }\n        }\n        return this._cache.get(address);\n    }\n    async getAccountsNs(programId) {\n        const programIdStr = programId.toBase58();\n        if (!this._idls[programIdStr]) {\n            const idl = await Program.fetchIdl(programId, this._provider);\n            if (idl) {\n                const program = new Program(idl, this._provider);\n                this._idls[programIdStr] = program.account;\n            }\n        }\n        return this._idls[programIdStr];\n    }\n}\n\nclass MethodsBuilderFactory {\n    static build(provider, programId, idlIx, ixFn, txFn, rpcFn, simulateFn, viewFn, accountNamespace, idlTypes, customResolver) {\n        return (...args) => new MethodsBuilder(args, ixFn, txFn, rpcFn, simulateFn, viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n}\nfunction isPartialAccounts(partialAccount) {\n    return (typeof partialAccount === \"object\" &&\n        partialAccount !== null &&\n        !(\"_bn\" in partialAccount) // Ensures not a pubkey\n    );\n}\nfunction flattenPartialAccounts(partialAccounts, throwOnNull) {\n    const toReturn = {};\n    for (const accountName in partialAccounts) {\n        const account = partialAccounts[accountName];\n        if (account === null) {\n            if (throwOnNull)\n                throw new Error(\"Failed to resolve optionals due to IDL type mismatch with input accounts!\");\n            continue;\n        }\n        toReturn[accountName] = isPartialAccounts(account)\n            ? flattenPartialAccounts(account, true)\n            : translateAddress(account);\n    }\n    return toReturn;\n}\nclass MethodsBuilder {\n    constructor(_args, _ixFn, _txFn, _rpcFn, _simulateFn, _viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver) {\n        this._args = _args;\n        this._ixFn = _ixFn;\n        this._txFn = _txFn;\n        this._rpcFn = _rpcFn;\n        this._simulateFn = _simulateFn;\n        this._viewFn = _viewFn;\n        this._accounts = {};\n        this._remainingAccounts = [];\n        this._signers = [];\n        this._preInstructions = [];\n        this._postInstructions = [];\n        this._resolveAccounts = true;\n        this._accountsResolver = new AccountsResolver(_args, this._accounts, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n    args(args) {\n        this._args = args;\n        this._accountsResolver.args(args);\n    }\n    /**\n     * Set instruction accounts with account resolution.\n     *\n     * This method only accepts accounts that cannot be resolved.\n     *\n     * See {@link accountsPartial} for overriding the account resolution or\n     * {@link accountsStrict} for strictly specifying all accounts.\n     */\n    accounts(accounts) {\n        // @ts-ignore\n        return this.accountsPartial(accounts);\n    }\n    /**\n     * Set instruction accounts with account resolution.\n     *\n     * There is no functional difference between this method and {@link accounts}\n     * method, the only difference is this method allows specifying all accounts\n     * even if they can be resolved. On the other hand, {@link accounts} method\n     * doesn't accept accounts that can be resolved.\n     */\n    accountsPartial(accounts) {\n        this._resolveAccounts = true;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    /**\n     * Set instruction accounts without account resolution.\n     *\n     * All accounts strictly need to be specified when this method is used.\n     *\n     * See {@link accounts} and {@link accountsPartial} methods for automatically\n     * resolving accounts.\n     */\n    accountsStrict(accounts) {\n        this._resolveAccounts = false;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    signers(signers) {\n        this._signers = this._signers.concat(signers);\n        return this;\n    }\n    remainingAccounts(accounts) {\n        this._remainingAccounts = this._remainingAccounts.concat(accounts);\n        return this;\n    }\n    preInstructions(ixs, prepend = false) {\n        if (prepend) {\n            this._preInstructions = ixs.concat(this._preInstructions);\n        }\n        else {\n            this._preInstructions = this._preInstructions.concat(ixs);\n        }\n        return this;\n    }\n    postInstructions(ixs) {\n        this._postInstructions = this._postInstructions.concat(ixs);\n        return this;\n    }\n    /**\n     * Get the public keys of the instruction accounts.\n     *\n     * The return type is an object with account names as keys and their public\n     * keys as their values.\n     *\n     * Note that an account key is `undefined` if the account hasn't yet been\n     * specified or resolved.\n     */\n    async pubkeys() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._accounts;\n    }\n    async rpc(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._rpcFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async rpcAndKeys(options) {\n        const pubkeys = await this.pubkeys();\n        return {\n            pubkeys: pubkeys,\n            signature: await this.rpc(options),\n        };\n    }\n    async view(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        if (!this._viewFn) {\n            throw new Error(\"Method does not support views\");\n        }\n        // @ts-ignore\n        return this._viewFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async simulate(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._simulateFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async instruction() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._ixFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n    /**\n     * Convenient shortcut to get instructions and pubkeys via:\n     *\n     * ```ts\n     * const { pubkeys, instructions } = await method.prepare();\n     * ```\n     */\n    async prepare() {\n        return {\n            instruction: await this.instruction(),\n            pubkeys: await this.pubkeys(),\n            signers: this._signers,\n        };\n    }\n    async transaction() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._txFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n}\n\nclass ViewFactory {\n    static build(programId, idlIx, simulateFn, idl) {\n        const isWritable = idlIx.accounts.find((a) => a.writable);\n        const hasReturn = !!idlIx.returns;\n        if (isWritable || !hasReturn)\n            return;\n        const view = async (...args) => {\n            let simulationResult = await simulateFn(...args);\n            const returnPrefix = `Program return: ${programId} `;\n            let returnLog = simulationResult.raw.find((l) => l.startsWith(returnPrefix));\n            if (!returnLog) {\n                throw new Error(\"View expected return log\");\n            }\n            let returnData = decode(returnLog.slice(returnPrefix.length));\n            let returnType = idlIx.returns;\n            if (!returnType) {\n                throw new Error(\"View expected return type\");\n            }\n            const coder = IdlCoder.fieldLayout({ type: returnType }, idl.types);\n            return coder.decode(returnData);\n        };\n        return view;\n    }\n}\n\nclass NamespaceFactory {\n    /**\n     * Generates all namespaces for a given program.\n     */\n    static build(idl, coder, programId, provider, getCustomResolver) {\n        const rpc = {};\n        const instruction = {};\n        const transaction = {};\n        const simulate = {};\n        const methods = {};\n        const view = {};\n        const idlErrors = parseIdlErrors(idl);\n        const account = idl.accounts\n            ? AccountFactory.build(idl, coder, programId, provider)\n            : {};\n        idl.instructions.forEach((idlIx) => {\n            const ixItem = InstructionNamespaceFactory.build(idlIx, (ixName, ix) => coder.instruction.encode(ixName, ix), programId);\n            const txItem = TransactionFactory.build(idlIx, ixItem);\n            const rpcItem = RpcFactory.build(idlIx, txItem, idlErrors, provider);\n            const simulateItem = SimulateFactory.build(idlIx, txItem, idlErrors, provider, coder, programId, idl);\n            const viewItem = ViewFactory.build(programId, idlIx, simulateItem, idl);\n            const methodItem = MethodsBuilderFactory.build(provider, programId, idlIx, ixItem, txItem, rpcItem, simulateItem, viewItem, account, idl.types || [], getCustomResolver === null || getCustomResolver === void 0 ? void 0 : getCustomResolver(idlIx));\n            const name = idlIx.name;\n            instruction[name] = ixItem;\n            transaction[name] = txItem;\n            rpc[name] = rpcItem;\n            simulate[name] = simulateItem;\n            methods[name] = methodItem;\n            if (viewItem) {\n                view[name] = viewItem;\n            }\n        });\n        return [\n            rpc,\n            instruction,\n            transaction,\n            account,\n            simulate,\n            methods,\n            view,\n        ];\n    }\n}\n\n/**\n * ## Program\n *\n * Program provides the IDL deserialized client representation of an Anchor\n * program.\n *\n * This API is the one stop shop for all things related to communicating with\n * on-chain programs. Among other things, one can send transactions, fetch\n * deserialized accounts, decode instruction data, subscribe to account\n * changes, and listen to events.\n *\n * In addition to field accessors and methods, the object provides a set of\n * dynamically generated properties, also known as namespaces, that\n * map one-to-one to program methods and accounts. These namespaces generally\n *  can be used as follows:\n *\n * ## Usage\n *\n * ```javascript\n * program.<namespace>.<program-specific-method>\n * ```\n *\n * API specifics are namespace dependent. The examples used in the documentation\n * below will refer to the two counter examples found\n * [here](https://github.com/coral-xyz/anchor#examples).\n */\nclass Program {\n    /**\n     * Address of the program.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * IDL in camelCase format to work in TypeScript.\n     *\n     * See {@link rawIdl} field if you need the original IDL.\n     */\n    get idl() {\n        return this._idl;\n    }\n    /**\n     * Raw IDL i.e. the original IDL without camelCase conversion.\n     *\n     * See {@link idl} field if you need the camelCased version of the IDL.\n     */\n    get rawIdl() {\n        return this._rawIdl;\n    }\n    /**\n     * Coder for serializing requests.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * @param idl       The interface definition.\n     * @param provider  The network and wallet context to use. If not provided\n     *                  then uses [[getProvider]].\n     * @param getCustomResolver A function that returns a custom account resolver\n     *                          for the given instruction. This is useful for resolving\n     *                          public keys of missing accounts when building instructions\n     */\n    constructor(idl, provider = getProvider(), coder, getCustomResolver) {\n        const camelCasedIdl = convertIdlToCamelCase(idl);\n        // Fields.\n        this._idl = camelCasedIdl;\n        this._rawIdl = idl;\n        this._provider = provider;\n        this._programId = translateAddress(idl.address);\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(camelCasedIdl);\n        this._events = new EventManager(this._programId, provider, this._coder);\n        // Dynamic namespaces.\n        const [rpc, instruction, transaction, account, simulate, methods, views] = NamespaceFactory.build(camelCasedIdl, this._coder, this._programId, provider, getCustomResolver);\n        this.rpc = rpc;\n        this.instruction = instruction;\n        this.transaction = transaction;\n        this.account = account;\n        this.simulate = simulate;\n        this.methods = methods;\n        this.views = views;\n    }\n    /**\n     * Generates a Program client by fetching the IDL from the network.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async at(address, provider) {\n        const programId = translateAddress(address);\n        const idl = await Program.fetchIdl(programId, provider);\n        if (!idl) {\n            throw new Error(`IDL not found for program: ${address.toString()}`);\n        }\n        return new Program(idl, provider);\n    }\n    /**\n     * Fetches an idl from the blockchain.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async fetchIdl(address, provider) {\n        provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        const programId = translateAddress(address);\n        const idlAddr = await idlAddress(programId);\n        const accountInfo = await provider.connection.getAccountInfo(idlAddr);\n        if (!accountInfo) {\n            return null;\n        }\n        // Chop off account discriminator.\n        let idlAccount = decodeIdlAccount(accountInfo.data.slice(8));\n        const inflatedIdl = inflate(idlAccount.data);\n        return JSON.parse(decode$2(inflatedIdl));\n    }\n    /**\n     * Invokes the given callback every time the given event is emitted.\n     *\n     * @param eventName The PascalCase name of the event, provided by the IDL.\n     * @param callback  The function to invoke whenever the event is emitted from\n     *                  program logs.\n     */\n    addEventListener(eventName, callback) {\n        return this._events.addEventListener(eventName, callback);\n    }\n    /**\n     * Unsubscribes from the given eventName.\n     */\n    async removeEventListener(listener) {\n        return await this._events.removeEventListener(listener);\n    }\n}\n\nnew PublicKey(\"11111111111111111111111111111111\");\nfunction program(provider) {\n    return new Program(IDL, provider, coder());\n}\nfunction coder() {\n    return new SystemCoder(IDL);\n}\nconst IDL = {\n    address: \"11111111111111111111111111111111\",\n    metadata: {\n        name: \"systemProgram\",\n        version: \"0.1.0\",\n        spec: \"0.1.0\",\n    },\n    instructions: [\n        {\n            name: \"advanceNonceAccount\",\n            discriminator: [4, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"allocate\",\n            discriminator: [8, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"allocateWithSeed\",\n            discriminator: [9, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"account\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"assign\",\n            discriminator: [1, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"assignWithSeed\",\n            discriminator: [10, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"account\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"authorizeNonceAccount\",\n            discriminator: [7, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"createAccount\",\n            discriminator: [0, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"createAccountWithSeed\",\n            discriminator: [3, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"initializeNonceAccount\",\n            discriminator: [6, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"rent\",\n                    address: \"SysvarRent111111111111111111111111111111111\",\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"transfer\",\n            discriminator: [2, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"transferWithSeed\",\n            discriminator: [11, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"withdrawNonceAccount\",\n            discriminator: [5, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"rent\",\n                    address: \"SysvarRent111111111111111111111111111111111\",\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n    ],\n    accounts: [\n        {\n            name: \"nonce\",\n            discriminator: [],\n        },\n    ],\n    types: [\n        {\n            name: \"feeCalculator\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"lamportsPerSignature\",\n                        type: \"u64\",\n                    },\n                ],\n            },\n        },\n        {\n            name: \"nonce\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"version\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"state\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"authorizedPubkey\",\n                        type: \"pubkey\",\n                    },\n                    {\n                        name: \"nonce\",\n                        type: \"pubkey\",\n                    },\n                    {\n                        name: \"feeCalculator\",\n                        type: {\n                            defined: {\n                                name: \"feeCalculator\",\n                            },\n                        },\n                    },\n                ],\n            },\n        },\n    ],\n};\n\nclass Native {\n    static system(provider) {\n        return program(provider);\n    }\n}\n\nexport { AccountClient, AnchorError, AnchorProvider, BorshAccountsCoder, BorshCoder, BorshEventCoder, BorshInstructionCoder, DISCRIMINATOR_SIZE, EventManager, EventParser, IdlError, LangErrorCode, LangErrorMessage, MethodsBuilderFactory, Native, Program, ProgramError, ProgramErrorStack, SystemCoder, getProvider, parseIdlErrors, setProvider, splitArgsAndCtx, toInstruction, translateAddress, translateError, index as utils, validateAccounts };\n//# sourceMappingURL=index.js.map\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst buffer_1 = require(\"buffer\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst common_js_1 = require(\"./utils/common.js\");\n/**\n * Node only wallet.\n */\nclass NodeWallet {\n    constructor(payer) {\n        this.payer = payer;\n    }\n    static local() {\n        const process = require(\"process\");\n        if (!process.env.ANCHOR_WALLET || process.env.ANCHOR_WALLET === \"\") {\n            throw new Error(\"expected environment variable `ANCHOR_WALLET` is not set.\");\n        }\n        const payer = web3_js_1.Keypair.fromSecretKey(buffer_1.Buffer.from(JSON.parse(require(\"fs\").readFileSync(process.env.ANCHOR_WALLET, {\n            encoding: \"utf-8\",\n        }))));\n        return new NodeWallet(payer);\n    }\n    async signTransaction(tx) {\n        if ((0, common_js_1.isVersionedTransaction)(tx)) {\n            tx.sign([this.payer]);\n        }\n        else {\n            tx.partialSign(this.payer);\n        }\n        return tx;\n    }\n    async signAllTransactions(txs) {\n        return txs.map((t) => {\n            if ((0, common_js_1.isVersionedTransaction)(t)) {\n                t.sign([this.payer]);\n            }\n            else {\n                t.partialSign(this.payer);\n            }\n            return t;\n        });\n    }\n    get publicKey() {\n        return this.payer.publicKey;\n    }\n}\nexports.default = NodeWallet;\n//# sourceMappingURL=nodewallet.js.map","\"use strict\";\nvar _a;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isVersionedTransaction = exports.chunks = exports.isBrowser = void 0;\n/**\n * Returns true if being run inside a web browser,\n * false if in a Node process or electron app.\n */\nexports.isBrowser = process.env.ANCHOR_BROWSER ||\n    (typeof window !== \"undefined\" && !((_a = window.process) === null || _a === void 0 ? void 0 : _a.hasOwnProperty(\"type\")));\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\nexports.chunks = chunks;\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\nexports.isVersionedTransaction = isVersionedTransaction;\n//# sourceMappingURL=common.js.map","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict';\n\nconst UPPERCASE = /[\\p{Lu}]/u;\nconst LOWERCASE = /[\\p{Ll}]/u;\nconst LEADING_CAPITAL = /^[\\p{Lu}](?![\\p{Lu}])/gu;\nconst IDENTIFIER = /([\\p{Alpha}\\p{N}_]|$)/u;\nconst SEPARATORS = /[_.\\- ]+/;\n\nconst LEADING_SEPARATORS = new RegExp('^' + SEPARATORS.source);\nconst SEPARATORS_AND_IDENTIFIER = new RegExp(SEPARATORS.source + IDENTIFIER.source, 'gu');\nconst NUMBERS_AND_IDENTIFIER = new RegExp('\\\\d+' + IDENTIFIER.source, 'gu');\n\nconst preserveCamelCase = (string, toLowerCase, toUpperCase) => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && UPPERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && LOWERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = toLowerCase(character) === character && toUpperCase(character) !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = toUpperCase(character) === character && toLowerCase(character) !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst preserveConsecutiveUppercase = (input, toLowerCase) => {\n\tLEADING_CAPITAL.lastIndex = 0;\n\n\treturn input.replace(LEADING_CAPITAL, m1 => toLowerCase(m1));\n};\n\nconst postProcess = (input, toUpperCase) => {\n\tSEPARATORS_AND_IDENTIFIER.lastIndex = 0;\n\tNUMBERS_AND_IDENTIFIER.lastIndex = 0;\n\n\treturn input.replace(SEPARATORS_AND_IDENTIFIER, (_, identifier) => toUpperCase(identifier))\n\t\t.replace(NUMBERS_AND_IDENTIFIER, m => toUpperCase(m));\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = {\n\t\tpascalCase: false,\n\t\tpreserveConsecutiveUppercase: false,\n\t\t...options\n\t};\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tconst toLowerCase = options.locale === false ?\n\t\tstring => string.toLowerCase() :\n\t\tstring => string.toLocaleLowerCase(options.locale);\n\tconst toUpperCase = options.locale === false ?\n\t\tstring => string.toUpperCase() :\n\t\tstring => string.toLocaleUpperCase(options.locale);\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? toUpperCase(input) : toLowerCase(input);\n\t}\n\n\tconst hasUpperCase = input !== toLowerCase(input);\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input, toLowerCase, toUpperCase);\n\t}\n\n\tinput = input.replace(LEADING_SEPARATORS, '');\n\n\tif (options.preserveConsecutiveUppercase) {\n\t\tinput = preserveConsecutiveUppercase(input, toLowerCase);\n\t} else {\n\t\tinput = toLowerCase(input);\n\t}\n\n\tif (options.pascalCase) {\n\t\tinput = toUpperCase(input.charAt(0)) + input.slice(1);\n\t}\n\n\treturn postProcess(input, toUpperCase);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports.default = camelCase;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = (0, buffer_layout_1.blob)(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n    return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n    return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = (0, buffer_layout_1.u8)();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = (0, buffer_layout_1.struct)([\n        u64(\"tag\"),\n        layout.replicate(\"data\"),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error(\"Invalid tag, expected: \" +\n                tag.toString(\"hex\") +\n                \", got: \" +\n                receivedTag.toString(\"hex\"));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = (0, buffer_layout_1.struct)([\n        (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map","/*\n\nBased off glamor's StyleSheet, thanks Sunil ❤️\n\nhigh performance StyleSheet for css-in-js systems\n\n- uses multiple style tags behind the scenes for millions of rules\n- uses `insertRule` for appending in production for *much* faster performance\n\n// usage\n\nimport { StyleSheet } from '@emotion/sheet'\n\nlet styleSheet = new StyleSheet({ key: '', container: document.head })\n\nstyleSheet.insert('#box { border: 1px solid red; }')\n- appends a css rule into the stylesheet\n\nstyleSheet.flush()\n- empties the stylesheet of all its contents\n\n*/\n// $FlowFixMe\nfunction sheetForTag(tag) {\n  if (tag.sheet) {\n    // $FlowFixMe\n    return tag.sheet;\n  } // this weirdness brought to you by firefox\n\n  /* istanbul ignore next */\n\n\n  for (var i = 0; i < document.styleSheets.length; i++) {\n    if (document.styleSheets[i].ownerNode === tag) {\n      // $FlowFixMe\n      return document.styleSheets[i];\n    }\n  }\n}\n\nfunction createStyleElement(options) {\n  var tag = document.createElement('style');\n  tag.setAttribute('data-emotion', options.key);\n\n  if (options.nonce !== undefined) {\n    tag.setAttribute('nonce', options.nonce);\n  }\n\n  tag.appendChild(document.createTextNode(''));\n  tag.setAttribute('data-s', '');\n  return tag;\n}\n\nvar StyleSheet = /*#__PURE__*/function () {\n  // Using Node instead of HTMLElement since container may be a ShadowRoot\n  function StyleSheet(options) {\n    var _this = this;\n\n    this._insertTag = function (tag) {\n      var before;\n\n      if (_this.tags.length === 0) {\n        if (_this.insertionPoint) {\n          before = _this.insertionPoint.nextSibling;\n        } else if (_this.prepend) {\n          before = _this.container.firstChild;\n        } else {\n          before = _this.before;\n        }\n      } else {\n        before = _this.tags[_this.tags.length - 1].nextSibling;\n      }\n\n      _this.container.insertBefore(tag, before);\n\n      _this.tags.push(tag);\n    };\n\n    this.isSpeedy = options.speedy === undefined ? process.env.NODE_ENV === 'production' : options.speedy;\n    this.tags = [];\n    this.ctr = 0;\n    this.nonce = options.nonce; // key is the value of the data-emotion attribute, it's used to identify different sheets\n\n    this.key = options.key;\n    this.container = options.container;\n    this.prepend = options.prepend;\n    this.insertionPoint = options.insertionPoint;\n    this.before = null;\n  }\n\n  var _proto = StyleSheet.prototype;\n\n  _proto.hydrate = function hydrate(nodes) {\n    nodes.forEach(this._insertTag);\n  };\n\n  _proto.insert = function insert(rule) {\n    // the max length is how many rules we have per style tag, it's 65000 in speedy mode\n    // it's 1 in dev because we insert source maps that map a single rule to a location\n    // and you can only have one source map per style tag\n    if (this.ctr % (this.isSpeedy ? 65000 : 1) === 0) {\n      this._insertTag(createStyleElement(this));\n    }\n\n    var tag = this.tags[this.tags.length - 1];\n\n    if (process.env.NODE_ENV !== 'production') {\n      var isImportRule = rule.charCodeAt(0) === 64 && rule.charCodeAt(1) === 105;\n\n      if (isImportRule && this._alreadyInsertedOrderInsensitiveRule) {\n        // this would only cause problem in speedy mode\n        // but we don't want enabling speedy to affect the observable behavior\n        // so we report this error at all times\n        console.error(\"You're attempting to insert the following rule:\\n\" + rule + '\\n\\n`@import` rules must be before all other types of rules in a stylesheet but other rules have already been inserted. Please ensure that `@import` rules are before all other rules.');\n      }\n      this._alreadyInsertedOrderInsensitiveRule = this._alreadyInsertedOrderInsensitiveRule || !isImportRule;\n    }\n\n    if (this.isSpeedy) {\n      var sheet = sheetForTag(tag);\n\n      try {\n        // this is the ultrafast version, works across browsers\n        // the big drawback is that the css won't be editable in devtools\n        sheet.insertRule(rule, sheet.cssRules.length);\n      } catch (e) {\n        if (process.env.NODE_ENV !== 'production' && !/:(-moz-placeholder|-moz-focus-inner|-moz-focusring|-ms-input-placeholder|-moz-read-write|-moz-read-only|-ms-clear|-ms-expand|-ms-reveal){/.test(rule)) {\n          console.error(\"There was a problem inserting the following rule: \\\"\" + rule + \"\\\"\", e);\n        }\n      }\n    } else {\n      tag.appendChild(document.createTextNode(rule));\n    }\n\n    this.ctr++;\n  };\n\n  _proto.flush = function flush() {\n    // $FlowFixMe\n    this.tags.forEach(function (tag) {\n      return tag.parentNode && tag.parentNode.removeChild(tag);\n    });\n    this.tags = [];\n    this.ctr = 0;\n\n    if (process.env.NODE_ENV !== 'production') {\n      this._alreadyInsertedOrderInsensitiveRule = false;\n    }\n  };\n\n  return StyleSheet;\n}();\n\nexport { StyleSheet };\n","/**\n * @param {number}\n * @return {number}\n */\nexport var abs = Math.abs\n\n/**\n * @param {number}\n * @return {string}\n */\nexport var from = String.fromCharCode\n\n/**\n * @param {object}\n * @return {object}\n */\nexport var assign = Object.assign\n\n/**\n * @param {string} value\n * @param {number} length\n * @return {number}\n */\nexport function hash (value, length) {\n\treturn charat(value, 0) ^ 45 ? (((((((length << 2) ^ charat(value, 0)) << 2) ^ charat(value, 1)) << 2) ^ charat(value, 2)) << 2) ^ charat(value, 3) : 0\n}\n\n/**\n * @param {string} value\n * @return {string}\n */\nexport function trim (value) {\n\treturn value.trim()\n}\n\n/**\n * @param {string} value\n * @param {RegExp} pattern\n * @return {string?}\n */\nexport function match (value, pattern) {\n\treturn (value = pattern.exec(value)) ? value[0] : value\n}\n\n/**\n * @param {string} value\n * @param {(string|RegExp)} pattern\n * @param {string} replacement\n * @return {string}\n */\nexport function replace (value, pattern, replacement) {\n\treturn value.replace(pattern, replacement)\n}\n\n/**\n * @param {string} value\n * @param {string} search\n * @return {number}\n */\nexport function indexof (value, search) {\n\treturn value.indexOf(search)\n}\n\n/**\n * @param {string} value\n * @param {number} index\n * @return {number}\n */\nexport function charat (value, index) {\n\treturn value.charCodeAt(index) | 0\n}\n\n/**\n * @param {string} value\n * @param {number} begin\n * @param {number} end\n * @return {string}\n */\nexport function substr (value, begin, end) {\n\treturn value.slice(begin, end)\n}\n\n/**\n * @param {string} value\n * @return {number}\n */\nexport function strlen (value) {\n\treturn value.length\n}\n\n/**\n * @param {any[]} value\n * @return {number}\n */\nexport function sizeof (value) {\n\treturn value.length\n}\n\n/**\n * @param {any} value\n * @param {any[]} array\n * @return {any}\n */\nexport function append (value, array) {\n\treturn array.push(value), value\n}\n\n/**\n * @param {string[]} array\n * @param {function} callback\n * @return {string}\n */\nexport function combine (array, callback) {\n\treturn array.map(callback).join('')\n}\n","import {from, trim, charat, strlen, substr, append, assign} from './Utility.js'\n\nexport var line = 1\nexport var column = 1\nexport var length = 0\nexport var position = 0\nexport var character = 0\nexport var characters = ''\n\n/**\n * @param {string} value\n * @param {object | null} root\n * @param {object | null} parent\n * @param {string} type\n * @param {string[] | string} props\n * @param {object[] | string} children\n * @param {number} length\n */\nexport function node (value, root, parent, type, props, children, length) {\n\treturn {value: value, root: root, parent: parent, type: type, props: props, children: children, line: line, column: column, length: length, return: ''}\n}\n\n/**\n * @param {object} root\n * @param {object} props\n * @return {object}\n */\nexport function copy (root, props) {\n\treturn assign(node('', null, null, '', null, null, 0), root, {length: -root.length}, props)\n}\n\n/**\n * @return {number}\n */\nexport function char () {\n\treturn character\n}\n\n/**\n * @return {number}\n */\nexport function prev () {\n\tcharacter = position > 0 ? charat(characters, --position) : 0\n\n\tif (column--, character === 10)\n\t\tcolumn = 1, line--\n\n\treturn character\n}\n\n/**\n * @return {number}\n */\nexport function next () {\n\tcharacter = position < length ? charat(characters, position++) : 0\n\n\tif (column++, character === 10)\n\t\tcolumn = 1, line++\n\n\treturn character\n}\n\n/**\n * @return {number}\n */\nexport function peek () {\n\treturn charat(characters, position)\n}\n\n/**\n * @return {number}\n */\nexport function caret () {\n\treturn position\n}\n\n/**\n * @param {number} begin\n * @param {number} end\n * @return {string}\n */\nexport function slice (begin, end) {\n\treturn substr(characters, begin, end)\n}\n\n/**\n * @param {number} type\n * @return {number}\n */\nexport function token (type) {\n\tswitch (type) {\n\t\t// \\0 \\t \\n \\r \\s whitespace token\n\t\tcase 0: case 9: case 10: case 13: case 32:\n\t\t\treturn 5\n\t\t// ! + , / > @ ~ isolate token\n\t\tcase 33: case 43: case 44: case 47: case 62: case 64: case 126:\n\t\t// ; { } breakpoint token\n\t\tcase 59: case 123: case 125:\n\t\t\treturn 4\n\t\t// : accompanied token\n\t\tcase 58:\n\t\t\treturn 3\n\t\t// \" ' ( [ opening delimit token\n\t\tcase 34: case 39: case 40: case 91:\n\t\t\treturn 2\n\t\t// ) ] closing delimit token\n\t\tcase 41: case 93:\n\t\t\treturn 1\n\t}\n\n\treturn 0\n}\n\n/**\n * @param {string} value\n * @return {any[]}\n */\nexport function alloc (value) {\n\treturn line = column = 1, length = strlen(characters = value), position = 0, []\n}\n\n/**\n * @param {any} value\n * @return {any}\n */\nexport function dealloc (value) {\n\treturn characters = '', value\n}\n\n/**\n * @param {number} type\n * @return {string}\n */\nexport function delimit (type) {\n\treturn trim(slice(position - 1, delimiter(type === 91 ? type + 2 : type === 40 ? type + 1 : type)))\n}\n\n/**\n * @param {string} value\n * @return {string[]}\n */\nexport function tokenize (value) {\n\treturn dealloc(tokenizer(alloc(value)))\n}\n\n/**\n * @param {number} type\n * @return {string}\n */\nexport function whitespace (type) {\n\twhile (character = peek())\n\t\tif (character < 33)\n\t\t\tnext()\n\t\telse\n\t\t\tbreak\n\n\treturn token(type) > 2 || token(character) > 3 ? '' : ' '\n}\n\n/**\n * @param {string[]} children\n * @return {string[]}\n */\nexport function tokenizer (children) {\n\twhile (next())\n\t\tswitch (token(character)) {\n\t\t\tcase 0: append(identifier(position - 1), children)\n\t\t\t\tbreak\n\t\t\tcase 2: append(delimit(character), children)\n\t\t\t\tbreak\n\t\t\tdefault: append(from(character), children)\n\t\t}\n\n\treturn children\n}\n\n/**\n * @param {number} index\n * @param {number} count\n * @return {string}\n */\nexport function escaping (index, count) {\n\twhile (--count && next())\n\t\t// not 0-9 A-F a-f\n\t\tif (character < 48 || character > 102 || (character > 57 && character < 65) || (character > 70 && character < 97))\n\t\t\tbreak\n\n\treturn slice(index, caret() + (count < 6 && peek() == 32 && next() == 32))\n}\n\n/**\n * @param {number} type\n * @return {number}\n */\nexport function delimiter (type) {\n\twhile (next())\n\t\tswitch (character) {\n\t\t\t// ] ) \" '\n\t\t\tcase type:\n\t\t\t\treturn position\n\t\t\t// \" '\n\t\t\tcase 34: case 39:\n\t\t\t\tif (type !== 34 && type !== 39)\n\t\t\t\t\tdelimiter(character)\n\t\t\t\tbreak\n\t\t\t// (\n\t\t\tcase 40:\n\t\t\t\tif (type === 41)\n\t\t\t\t\tdelimiter(type)\n\t\t\t\tbreak\n\t\t\t// \\\n\t\t\tcase 92:\n\t\t\t\tnext()\n\t\t\t\tbreak\n\t\t}\n\n\treturn position\n}\n\n/**\n * @param {number} type\n * @param {number} index\n * @return {number}\n */\nexport function commenter (type, index) {\n\twhile (next())\n\t\t// //\n\t\tif (type + character === 47 + 10)\n\t\t\tbreak\n\t\t// /*\n\t\telse if (type + character === 42 + 42 && peek() === 47)\n\t\t\tbreak\n\n\treturn '/*' + slice(index, position - 1) + '*' + from(type === 47 ? type : next())\n}\n\n/**\n * @param {number} index\n * @return {string}\n */\nexport function identifier (index) {\n\twhile (!token(peek()))\n\t\tnext()\n\n\treturn slice(index, position)\n}\n","export var MS = '-ms-'\nexport var MOZ = '-moz-'\nexport var WEBKIT = '-webkit-'\n\nexport var COMMENT = 'comm'\nexport var RULESET = 'rule'\nexport var DECLARATION = 'decl'\n\nexport var PAGE = '@page'\nexport var MEDIA = '@media'\nexport var IMPORT = '@import'\nexport var CHARSET = '@charset'\nexport var VIEWPORT = '@viewport'\nexport var SUPPORTS = '@supports'\nexport var DOCUMENT = '@document'\nexport var NAMESPACE = '@namespace'\nexport var KEYFRAMES = '@keyframes'\nexport var FONT_FACE = '@font-face'\nexport var COUNTER_STYLE = '@counter-style'\nexport var FONT_FEATURE_VALUES = '@font-feature-values'\nexport var LAYER = '@layer'\n","import {IMPORT, LAYER, COMMENT, RULESET, DECLARATION, KEYFRAMES} from './Enum.js'\nimport {strlen, sizeof} from './Utility.js'\n\n/**\n * @param {object[]} children\n * @param {function} callback\n * @return {string}\n */\nexport function serialize (children, callback) {\n\tvar output = ''\n\tvar length = sizeof(children)\n\n\tfor (var i = 0; i < length; i++)\n\t\toutput += callback(children[i], i, children, callback) || ''\n\n\treturn output\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n * @param {function} callback\n * @return {string}\n */\nexport function stringify (element, index, children, callback) {\n\tswitch (element.type) {\n\t\tcase LAYER: if (element.children.length) break\n\t\tcase IMPORT: case DECLARATION: return element.return = element.return || element.value\n\t\tcase COMMENT: return ''\n\t\tcase KEYFRAMES: return element.return = element.value + '{' + serialize(element.children, callback) + '}'\n\t\tcase RULESET: element.value = element.props.join(',')\n\t}\n\n\treturn strlen(children = serialize(element.children, callback)) ? element.return = element.value + '{' + children + '}' : ''\n}\n","import {MS, MOZ, WEBKIT, RULESET, KEYFRAMES, DECLARATION} from './Enum.js'\nimport {match, charat, substr, strlen, sizeof, replace, combine} from './Utility.js'\nimport {copy, tokenize} from './Tokenizer.js'\nimport {serialize} from './Serializer.js'\nimport {prefix} from './Prefixer.js'\n\n/**\n * @param {function[]} collection\n * @return {function}\n */\nexport function middleware (collection) {\n\tvar length = sizeof(collection)\n\n\treturn function (element, index, children, callback) {\n\t\tvar output = ''\n\n\t\tfor (var i = 0; i < length; i++)\n\t\t\toutput += collection[i](element, index, children, callback) || ''\n\n\t\treturn output\n\t}\n}\n\n/**\n * @param {function} callback\n * @return {function}\n */\nexport function rulesheet (callback) {\n\treturn function (element) {\n\t\tif (!element.root)\n\t\t\tif (element = element.return)\n\t\t\t\tcallback(element)\n\t}\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n * @param {function} callback\n */\nexport function prefixer (element, index, children, callback) {\n\tif (element.length > -1)\n\t\tif (!element.return)\n\t\t\tswitch (element.type) {\n\t\t\t\tcase DECLARATION: element.return = prefix(element.value, element.length, children)\n\t\t\t\t\treturn\n\t\t\t\tcase KEYFRAMES:\n\t\t\t\t\treturn serialize([copy(element, {value: replace(element.value, '@', '@' + WEBKIT)})], callback)\n\t\t\t\tcase RULESET:\n\t\t\t\t\tif (element.length)\n\t\t\t\t\t\treturn combine(element.props, function (value) {\n\t\t\t\t\t\t\tswitch (match(value, /(::plac\\w+|:read-\\w+)/)) {\n\t\t\t\t\t\t\t\t// :read-(only|write)\n\t\t\t\t\t\t\t\tcase ':read-only': case ':read-write':\n\t\t\t\t\t\t\t\t\treturn serialize([copy(element, {props: [replace(value, /:(read-\\w+)/, ':' + MOZ + '$1')]})], callback)\n\t\t\t\t\t\t\t\t// :placeholder\n\t\t\t\t\t\t\t\tcase '::placeholder':\n\t\t\t\t\t\t\t\t\treturn serialize([\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, ':' + WEBKIT + 'input-$1')]}),\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, ':' + MOZ + '$1')]}),\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, MS + 'input-$1')]})\n\t\t\t\t\t\t\t\t\t], callback)\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\treturn ''\n\t\t\t\t\t\t})\n\t\t\t}\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n */\nexport function namespace (element) {\n\tswitch (element.type) {\n\t\tcase RULESET:\n\t\t\telement.props = element.props.map(function (value) {\n\t\t\t\treturn combine(tokenize(value), function (value, index, children) {\n\t\t\t\t\tswitch (charat(value, 0)) {\n\t\t\t\t\t\t// \\f\n\t\t\t\t\t\tcase 12:\n\t\t\t\t\t\t\treturn substr(value, 1, strlen(value))\n\t\t\t\t\t\t// \\0 ( + > ~\n\t\t\t\t\t\tcase 0: case 40: case 43: case 62: case 126:\n\t\t\t\t\t\t\treturn value\n\t\t\t\t\t\t// :\n\t\t\t\t\t\tcase 58:\n\t\t\t\t\t\t\tif (children[++index] === 'global')\n\t\t\t\t\t\t\t\tchildren[index] = '', children[++index] = '\\f' + substr(children[index], index = 1, -1)\n\t\t\t\t\t\t// \\s\n\t\t\t\t\t\tcase 32:\n\t\t\t\t\t\t\treturn index === 1 ? '' : value\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tswitch (index) {\n\t\t\t\t\t\t\t\tcase 0: element = value\n\t\t\t\t\t\t\t\t\treturn sizeof(children) > 1 ? '' : value\n\t\t\t\t\t\t\t\tcase index = sizeof(children) - 1: case 2:\n\t\t\t\t\t\t\t\t\treturn index === 2 ? value + element + element : value + element\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\treturn value\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t})\n\t}\n}\n","import {COMMENT, RULESET, DECLARATION} from './Enum.js'\nimport {abs, charat, trim, from, sizeof, strlen, substr, append, replace, indexof} from './Utility.js'\nimport {node, char, prev, next, peek, caret, alloc, dealloc, delimit, whitespace, escaping, identifier, commenter} from './Tokenizer.js'\n\n/**\n * @param {string} value\n * @return {object[]}\n */\nexport function compile (value) {\n\treturn dealloc(parse('', null, null, null, [''], value = alloc(value), 0, [0], value))\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {string[]} rule\n * @param {string[]} rules\n * @param {string[]} rulesets\n * @param {number[]} pseudo\n * @param {number[]} points\n * @param {string[]} declarations\n * @return {object}\n */\nexport function parse (value, root, parent, rule, rules, rulesets, pseudo, points, declarations) {\n\tvar index = 0\n\tvar offset = 0\n\tvar length = pseudo\n\tvar atrule = 0\n\tvar property = 0\n\tvar previous = 0\n\tvar variable = 1\n\tvar scanning = 1\n\tvar ampersand = 1\n\tvar character = 0\n\tvar type = ''\n\tvar props = rules\n\tvar children = rulesets\n\tvar reference = rule\n\tvar characters = type\n\n\twhile (scanning)\n\t\tswitch (previous = character, character = next()) {\n\t\t\t// (\n\t\t\tcase 40:\n\t\t\t\tif (previous != 108 && charat(characters, length - 1) == 58) {\n\t\t\t\t\tif (indexof(characters += replace(delimit(character), '&', '&\\f'), '&\\f') != -1)\n\t\t\t\t\t\tampersand = -1\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t// \" ' [\n\t\t\tcase 34: case 39: case 91:\n\t\t\t\tcharacters += delimit(character)\n\t\t\t\tbreak\n\t\t\t// \\t \\n \\r \\s\n\t\t\tcase 9: case 10: case 13: case 32:\n\t\t\t\tcharacters += whitespace(previous)\n\t\t\t\tbreak\n\t\t\t// \\\n\t\t\tcase 92:\n\t\t\t\tcharacters += escaping(caret() - 1, 7)\n\t\t\t\tcontinue\n\t\t\t// /\n\t\t\tcase 47:\n\t\t\t\tswitch (peek()) {\n\t\t\t\t\tcase 42: case 47:\n\t\t\t\t\t\tappend(comment(commenter(next(), caret()), root, parent), declarations)\n\t\t\t\t\t\tbreak\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcharacters += '/'\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t// {\n\t\t\tcase 123 * variable:\n\t\t\t\tpoints[index++] = strlen(characters) * ampersand\n\t\t\t// } ; \\0\n\t\t\tcase 125 * variable: case 59: case 0:\n\t\t\t\tswitch (character) {\n\t\t\t\t\t// \\0 }\n\t\t\t\t\tcase 0: case 125: scanning = 0\n\t\t\t\t\t// ;\n\t\t\t\t\tcase 59 + offset: if (ampersand == -1) characters = replace(characters, /\\f/g, '')\n\t\t\t\t\t\tif (property > 0 && (strlen(characters) - length))\n\t\t\t\t\t\t\tappend(property > 32 ? declaration(characters + ';', rule, parent, length - 1) : declaration(replace(characters, ' ', '') + ';', rule, parent, length - 2), declarations)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// @ ;\n\t\t\t\t\tcase 59: characters += ';'\n\t\t\t\t\t// { rule/at-rule\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tappend(reference = ruleset(characters, root, parent, index, offset, rules, points, type, props = [], children = [], length), rulesets)\n\n\t\t\t\t\t\tif (character === 123)\n\t\t\t\t\t\t\tif (offset === 0)\n\t\t\t\t\t\t\t\tparse(characters, root, reference, reference, props, rulesets, length, points, children)\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tswitch (atrule === 99 && charat(characters, 3) === 110 ? 100 : atrule) {\n\t\t\t\t\t\t\t\t\t// d l m s\n\t\t\t\t\t\t\t\t\tcase 100: case 108: case 109: case 115:\n\t\t\t\t\t\t\t\t\t\tparse(value, reference, reference, rule && append(ruleset(value, reference, reference, 0, 0, rules, points, type, rules, props = [], length), children), rules, children, length, points, rule ? props : children)\n\t\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\tparse(characters, reference, reference, reference, [''], children, 0, points, children)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tindex = offset = property = 0, variable = ampersand = 1, type = characters = '', length = pseudo\n\t\t\t\tbreak\n\t\t\t// :\n\t\t\tcase 58:\n\t\t\t\tlength = 1 + strlen(characters), property = previous\n\t\t\tdefault:\n\t\t\t\tif (variable < 1)\n\t\t\t\t\tif (character == 123)\n\t\t\t\t\t\t--variable\n\t\t\t\t\telse if (character == 125 && variable++ == 0 && prev() == 125)\n\t\t\t\t\t\tcontinue\n\n\t\t\t\tswitch (characters += from(character), character * variable) {\n\t\t\t\t\t// &\n\t\t\t\t\tcase 38:\n\t\t\t\t\t\tampersand = offset > 0 ? 1 : (characters += '\\f', -1)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// ,\n\t\t\t\t\tcase 44:\n\t\t\t\t\t\tpoints[index++] = (strlen(characters) - 1) * ampersand, ampersand = 1\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// @\n\t\t\t\t\tcase 64:\n\t\t\t\t\t\t// -\n\t\t\t\t\t\tif (peek() === 45)\n\t\t\t\t\t\t\tcharacters += delimit(next())\n\n\t\t\t\t\t\tatrule = peek(), offset = length = strlen(type = characters += identifier(caret())), character++\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// -\n\t\t\t\t\tcase 45:\n\t\t\t\t\t\tif (previous === 45 && strlen(characters) == 2)\n\t\t\t\t\t\t\tvariable = 0\n\t\t\t\t}\n\t\t}\n\n\treturn rulesets\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {number} index\n * @param {number} offset\n * @param {string[]} rules\n * @param {number[]} points\n * @param {string} type\n * @param {string[]} props\n * @param {string[]} children\n * @param {number} length\n * @return {object}\n */\nexport function ruleset (value, root, parent, index, offset, rules, points, type, props, children, length) {\n\tvar post = offset - 1\n\tvar rule = offset === 0 ? rules : ['']\n\tvar size = sizeof(rule)\n\n\tfor (var i = 0, j = 0, k = 0; i < index; ++i)\n\t\tfor (var x = 0, y = substr(value, post + 1, post = abs(j = points[i])), z = value; x < size; ++x)\n\t\t\tif (z = trim(j > 0 ? rule[x] + ' ' + y : replace(y, /&\\f/g, rule[x])))\n\t\t\t\tprops[k++] = z\n\n\treturn node(value, root, parent, offset === 0 ? RULESET : type, props, children, length)\n}\n\n/**\n * @param {number} value\n * @param {object} root\n * @param {object?} parent\n * @return {object}\n */\nexport function comment (value, root, parent) {\n\treturn node(value, root, parent, COMMENT, from(char()), substr(value, 2, -2), 0)\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {number} length\n * @return {object}\n */\nexport function declaration (value, root, parent, length) {\n\treturn node(value, root, parent, DECLARATION, substr(value, 0, length), substr(value, length + 1, -1), length)\n}\n","import { StyleSheet } from '@emotion/sheet';\nimport { dealloc, alloc, next, token, from, peek, delimit, slice, position, RULESET, combine, match, serialize, copy, replace, WEBKIT, MOZ, MS, KEYFRAMES, DECLARATION, hash, charat, strlen, indexof, stringify, COMMENT, rulesheet, middleware, compile } from 'stylis';\nimport '@emotion/weak-memoize';\nimport '@emotion/memoize';\n\nvar identifierWithPointTracking = function identifierWithPointTracking(begin, points, index) {\n  var previous = 0;\n  var character = 0;\n\n  while (true) {\n    previous = character;\n    character = peek(); // &\\f\n\n    if (previous === 38 && character === 12) {\n      points[index] = 1;\n    }\n\n    if (token(character)) {\n      break;\n    }\n\n    next();\n  }\n\n  return slice(begin, position);\n};\n\nvar toRules = function toRules(parsed, points) {\n  // pretend we've started with a comma\n  var index = -1;\n  var character = 44;\n\n  do {\n    switch (token(character)) {\n      case 0:\n        // &\\f\n        if (character === 38 && peek() === 12) {\n          // this is not 100% correct, we don't account for literal sequences here - like for example quoted strings\n          // stylis inserts \\f after & to know when & where it should replace this sequence with the context selector\n          // and when it should just concatenate the outer and inner selectors\n          // it's very unlikely for this sequence to actually appear in a different context, so we just leverage this fact here\n          points[index] = 1;\n        }\n\n        parsed[index] += identifierWithPointTracking(position - 1, points, index);\n        break;\n\n      case 2:\n        parsed[index] += delimit(character);\n        break;\n\n      case 4:\n        // comma\n        if (character === 44) {\n          // colon\n          parsed[++index] = peek() === 58 ? '&\\f' : '';\n          points[index] = parsed[index].length;\n          break;\n        }\n\n      // fallthrough\n\n      default:\n        parsed[index] += from(character);\n    }\n  } while (character = next());\n\n  return parsed;\n};\n\nvar getRules = function getRules(value, points) {\n  return dealloc(toRules(alloc(value), points));\n}; // WeakSet would be more appropriate, but only WeakMap is supported in IE11\n\n\nvar fixedElements = /* #__PURE__ */new WeakMap();\nvar compat = function compat(element) {\n  if (element.type !== 'rule' || !element.parent || // positive .length indicates that this rule contains pseudo\n  // negative .length indicates that this rule has been already prefixed\n  element.length < 1) {\n    return;\n  }\n\n  var value = element.value,\n      parent = element.parent;\n  var isImplicitRule = element.column === parent.column && element.line === parent.line;\n\n  while (parent.type !== 'rule') {\n    parent = parent.parent;\n    if (!parent) return;\n  } // short-circuit for the simplest case\n\n\n  if (element.props.length === 1 && value.charCodeAt(0) !== 58\n  /* colon */\n  && !fixedElements.get(parent)) {\n    return;\n  } // if this is an implicitly inserted rule (the one eagerly inserted at the each new nested level)\n  // then the props has already been manipulated beforehand as they that array is shared between it and its \"rule parent\"\n\n\n  if (isImplicitRule) {\n    return;\n  }\n\n  fixedElements.set(element, true);\n  var points = [];\n  var rules = getRules(value, points);\n  var parentRules = parent.props;\n\n  for (var i = 0, k = 0; i < rules.length; i++) {\n    for (var j = 0; j < parentRules.length; j++, k++) {\n      element.props[k] = points[i] ? rules[i].replace(/&\\f/g, parentRules[j]) : parentRules[j] + \" \" + rules[i];\n    }\n  }\n};\nvar removeLabel = function removeLabel(element) {\n  if (element.type === 'decl') {\n    var value = element.value;\n\n    if ( // charcode for l\n    value.charCodeAt(0) === 108 && // charcode for b\n    value.charCodeAt(2) === 98) {\n      // this ignores label\n      element[\"return\"] = '';\n      element.value = '';\n    }\n  }\n};\nvar ignoreFlag = 'emotion-disable-server-rendering-unsafe-selector-warning-please-do-not-use-this-the-warning-exists-for-a-reason';\n\nvar isIgnoringComment = function isIgnoringComment(element) {\n  return element.type === 'comm' && element.children.indexOf(ignoreFlag) > -1;\n};\n\nvar createUnsafeSelectorsAlarm = function createUnsafeSelectorsAlarm(cache) {\n  return function (element, index, children) {\n    if (element.type !== 'rule' || cache.compat) return;\n    var unsafePseudoClasses = element.value.match(/(:first|:nth|:nth-last)-child/g);\n\n    if (unsafePseudoClasses) {\n      var isNested = !!element.parent; // in nested rules comments become children of the \"auto-inserted\" rule and that's always the `element.parent`\n      //\n      // considering this input:\n      // .a {\n      //   .b /* comm */ {}\n      //   color: hotpink;\n      // }\n      // we get output corresponding to this:\n      // .a {\n      //   & {\n      //     /* comm */\n      //     color: hotpink;\n      //   }\n      //   .b {}\n      // }\n\n      var commentContainer = isNested ? element.parent.children : // global rule at the root level\n      children;\n\n      for (var i = commentContainer.length - 1; i >= 0; i--) {\n        var node = commentContainer[i];\n\n        if (node.line < element.line) {\n          break;\n        } // it is quite weird but comments are *usually* put at `column: element.column - 1`\n        // so we seek *from the end* for the node that is earlier than the rule's `element` and check that\n        // this will also match inputs like this:\n        // .a {\n        //   /* comm */\n        //   .b {}\n        // }\n        //\n        // but that is fine\n        //\n        // it would be the easiest to change the placement of the comment to be the first child of the rule:\n        // .a {\n        //   .b { /* comm */ }\n        // }\n        // with such inputs we wouldn't have to search for the comment at all\n        // TODO: consider changing this comment placement in the next major version\n\n\n        if (node.column < element.column) {\n          if (isIgnoringComment(node)) {\n            return;\n          }\n\n          break;\n        }\n      }\n\n      unsafePseudoClasses.forEach(function (unsafePseudoClass) {\n        console.error(\"The pseudo class \\\"\" + unsafePseudoClass + \"\\\" is potentially unsafe when doing server-side rendering. Try changing it to \\\"\" + unsafePseudoClass.split('-child')[0] + \"-of-type\\\".\");\n      });\n    }\n  };\n};\n\nvar isImportRule = function isImportRule(element) {\n  return element.type.charCodeAt(1) === 105 && element.type.charCodeAt(0) === 64;\n};\n\nvar isPrependedWithRegularRules = function isPrependedWithRegularRules(index, children) {\n  for (var i = index - 1; i >= 0; i--) {\n    if (!isImportRule(children[i])) {\n      return true;\n    }\n  }\n\n  return false;\n}; // use this to remove incorrect elements from further processing\n// so they don't get handed to the `sheet` (or anything else)\n// as that could potentially lead to additional logs which in turn could be overhelming to the user\n\n\nvar nullifyElement = function nullifyElement(element) {\n  element.type = '';\n  element.value = '';\n  element[\"return\"] = '';\n  element.children = '';\n  element.props = '';\n};\n\nvar incorrectImportAlarm = function incorrectImportAlarm(element, index, children) {\n  if (!isImportRule(element)) {\n    return;\n  }\n\n  if (element.parent) {\n    console.error(\"`@import` rules can't be nested inside other rules. Please move it to the top level and put it before regular rules. Keep in mind that they can only be used within global styles.\");\n    nullifyElement(element);\n  } else if (isPrependedWithRegularRules(index, children)) {\n    console.error(\"`@import` rules can't be after other rules. Please put your `@import` rules before your other rules.\");\n    nullifyElement(element);\n  }\n};\n\n/* eslint-disable no-fallthrough */\n\nfunction prefix(value, length) {\n  switch (hash(value, length)) {\n    // color-adjust\n    case 5103:\n      return WEBKIT + 'print-' + value + value;\n    // animation, animation-(delay|direction|duration|fill-mode|iteration-count|name|play-state|timing-function)\n\n    case 5737:\n    case 4201:\n    case 3177:\n    case 3433:\n    case 1641:\n    case 4457:\n    case 2921: // text-decoration, filter, clip-path, backface-visibility, column, box-decoration-break\n\n    case 5572:\n    case 6356:\n    case 5844:\n    case 3191:\n    case 6645:\n    case 3005: // mask, mask-image, mask-(mode|clip|size), mask-(repeat|origin), mask-position, mask-composite,\n\n    case 6391:\n    case 5879:\n    case 5623:\n    case 6135:\n    case 4599:\n    case 4855: // background-clip, columns, column-(count|fill|gap|rule|rule-color|rule-style|rule-width|span|width)\n\n    case 4215:\n    case 6389:\n    case 5109:\n    case 5365:\n    case 5621:\n    case 3829:\n      return WEBKIT + value + value;\n    // appearance, user-select, transform, hyphens, text-size-adjust\n\n    case 5349:\n    case 4246:\n    case 4810:\n    case 6968:\n    case 2756:\n      return WEBKIT + value + MOZ + value + MS + value + value;\n    // flex, flex-direction\n\n    case 6828:\n    case 4268:\n      return WEBKIT + value + MS + value + value;\n    // order\n\n    case 6165:\n      return WEBKIT + value + MS + 'flex-' + value + value;\n    // align-items\n\n    case 5187:\n      return WEBKIT + value + replace(value, /(\\w+).+(:[^]+)/, WEBKIT + 'box-$1$2' + MS + 'flex-$1$2') + value;\n    // align-self\n\n    case 5443:\n      return WEBKIT + value + MS + 'flex-item-' + replace(value, /flex-|-self/, '') + value;\n    // align-content\n\n    case 4675:\n      return WEBKIT + value + MS + 'flex-line-pack' + replace(value, /align-content|flex-|-self/, '') + value;\n    // flex-shrink\n\n    case 5548:\n      return WEBKIT + value + MS + replace(value, 'shrink', 'negative') + value;\n    // flex-basis\n\n    case 5292:\n      return WEBKIT + value + MS + replace(value, 'basis', 'preferred-size') + value;\n    // flex-grow\n\n    case 6060:\n      return WEBKIT + 'box-' + replace(value, '-grow', '') + WEBKIT + value + MS + replace(value, 'grow', 'positive') + value;\n    // transition\n\n    case 4554:\n      return WEBKIT + replace(value, /([^-])(transform)/g, '$1' + WEBKIT + '$2') + value;\n    // cursor\n\n    case 6187:\n      return replace(replace(replace(value, /(zoom-|grab)/, WEBKIT + '$1'), /(image-set)/, WEBKIT + '$1'), value, '') + value;\n    // background, background-image\n\n    case 5495:\n    case 3959:\n      return replace(value, /(image-set\\([^]*)/, WEBKIT + '$1' + '$`$1');\n    // justify-content\n\n    case 4968:\n      return replace(replace(value, /(.+:)(flex-)?(.*)/, WEBKIT + 'box-pack:$3' + MS + 'flex-pack:$3'), /s.+-b[^;]+/, 'justify') + WEBKIT + value + value;\n    // (margin|padding)-inline-(start|end)\n\n    case 4095:\n    case 3583:\n    case 4068:\n    case 2532:\n      return replace(value, /(.+)-inline(.+)/, WEBKIT + '$1$2') + value;\n    // (min|max)?(width|height|inline-size|block-size)\n\n    case 8116:\n    case 7059:\n    case 5753:\n    case 5535:\n    case 5445:\n    case 5701:\n    case 4933:\n    case 4677:\n    case 5533:\n    case 5789:\n    case 5021:\n    case 4765:\n      // stretch, max-content, min-content, fill-available\n      if (strlen(value) - 1 - length > 6) switch (charat(value, length + 1)) {\n        // (m)ax-content, (m)in-content\n        case 109:\n          // -\n          if (charat(value, length + 4) !== 45) break;\n        // (f)ill-available, (f)it-content\n\n        case 102:\n          return replace(value, /(.+:)(.+)-([^]+)/, '$1' + WEBKIT + '$2-$3' + '$1' + MOZ + (charat(value, length + 3) == 108 ? '$3' : '$2-$3')) + value;\n        // (s)tretch\n\n        case 115:\n          return ~indexof(value, 'stretch') ? prefix(replace(value, 'stretch', 'fill-available'), length) + value : value;\n      }\n      break;\n    // position: sticky\n\n    case 4949:\n      // (s)ticky?\n      if (charat(value, length + 1) !== 115) break;\n    // display: (flex|inline-flex)\n\n    case 6444:\n      switch (charat(value, strlen(value) - 3 - (~indexof(value, '!important') && 10))) {\n        // stic(k)y\n        case 107:\n          return replace(value, ':', ':' + WEBKIT) + value;\n        // (inline-)?fl(e)x\n\n        case 101:\n          return replace(value, /(.+:)([^;!]+)(;|!.+)?/, '$1' + WEBKIT + (charat(value, 14) === 45 ? 'inline-' : '') + 'box$3' + '$1' + WEBKIT + '$2$3' + '$1' + MS + '$2box$3') + value;\n      }\n\n      break;\n    // writing-mode\n\n    case 5936:\n      switch (charat(value, length + 11)) {\n        // vertical-l(r)\n        case 114:\n          return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'tb') + value;\n        // vertical-r(l)\n\n        case 108:\n          return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'tb-rl') + value;\n        // horizontal(-)tb\n\n        case 45:\n          return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'lr') + value;\n      }\n\n      return WEBKIT + value + MS + value + value;\n  }\n\n  return value;\n}\n\nvar prefixer = function prefixer(element, index, children, callback) {\n  if (element.length > -1) if (!element[\"return\"]) switch (element.type) {\n    case DECLARATION:\n      element[\"return\"] = prefix(element.value, element.length);\n      break;\n\n    case KEYFRAMES:\n      return serialize([copy(element, {\n        value: replace(element.value, '@', '@' + WEBKIT)\n      })], callback);\n\n    case RULESET:\n      if (element.length) return combine(element.props, function (value) {\n        switch (match(value, /(::plac\\w+|:read-\\w+)/)) {\n          // :read-(only|write)\n          case ':read-only':\n          case ':read-write':\n            return serialize([copy(element, {\n              props: [replace(value, /:(read-\\w+)/, ':' + MOZ + '$1')]\n            })], callback);\n          // :placeholder\n\n          case '::placeholder':\n            return serialize([copy(element, {\n              props: [replace(value, /:(plac\\w+)/, ':' + WEBKIT + 'input-$1')]\n            }), copy(element, {\n              props: [replace(value, /:(plac\\w+)/, ':' + MOZ + '$1')]\n            }), copy(element, {\n              props: [replace(value, /:(plac\\w+)/, MS + 'input-$1')]\n            })], callback);\n        }\n\n        return '';\n      });\n  }\n};\n\nvar defaultStylisPlugins = [prefixer];\n\nvar createCache = function createCache(options) {\n  var key = options.key;\n\n  if (process.env.NODE_ENV !== 'production' && !key) {\n    throw new Error(\"You have to configure `key` for your cache. Please make sure it's unique (and not equal to 'css') as it's used for linking styles to your cache.\\n\" + \"If multiple caches share the same key they might \\\"fight\\\" for each other's style elements.\");\n  }\n\n  if (key === 'css') {\n    var ssrStyles = document.querySelectorAll(\"style[data-emotion]:not([data-s])\"); // get SSRed styles out of the way of React's hydration\n    // document.head is a safe place to move them to(though note document.head is not necessarily the last place they will be)\n    // note this very very intentionally targets all style elements regardless of the key to ensure\n    // that creating a cache works inside of render of a React component\n\n    Array.prototype.forEach.call(ssrStyles, function (node) {\n      // we want to only move elements which have a space in the data-emotion attribute value\n      // because that indicates that it is an Emotion 11 server-side rendered style elements\n      // while we will already ignore Emotion 11 client-side inserted styles because of the :not([data-s]) part in the selector\n      // Emotion 10 client-side inserted styles did not have data-s (but importantly did not have a space in their data-emotion attributes)\n      // so checking for the space ensures that loading Emotion 11 after Emotion 10 has inserted some styles\n      // will not result in the Emotion 10 styles being destroyed\n      var dataEmotionAttribute = node.getAttribute('data-emotion');\n\n      if (dataEmotionAttribute.indexOf(' ') === -1) {\n        return;\n      }\n      document.head.appendChild(node);\n      node.setAttribute('data-s', '');\n    });\n  }\n\n  var stylisPlugins = options.stylisPlugins || defaultStylisPlugins;\n\n  if (process.env.NODE_ENV !== 'production') {\n    // $FlowFixMe\n    if (/[^a-z-]/.test(key)) {\n      throw new Error(\"Emotion key must only contain lower case alphabetical characters and - but \\\"\" + key + \"\\\" was passed\");\n    }\n  }\n\n  var inserted = {};\n  var container;\n  var nodesToHydrate = [];\n\n  {\n    container = options.container || document.head;\n    Array.prototype.forEach.call( // this means we will ignore elements which don't have a space in them which\n    // means that the style elements we're looking at are only Emotion 11 server-rendered style elements\n    document.querySelectorAll(\"style[data-emotion^=\\\"\" + key + \" \\\"]\"), function (node) {\n      var attrib = node.getAttribute(\"data-emotion\").split(' '); // $FlowFixMe\n\n      for (var i = 1; i < attrib.length; i++) {\n        inserted[attrib[i]] = true;\n      }\n\n      nodesToHydrate.push(node);\n    });\n  }\n\n  var _insert;\n\n  var omnipresentPlugins = [compat, removeLabel];\n\n  if (process.env.NODE_ENV !== 'production') {\n    omnipresentPlugins.push(createUnsafeSelectorsAlarm({\n      get compat() {\n        return cache.compat;\n      }\n\n    }), incorrectImportAlarm);\n  }\n\n  {\n    var currentSheet;\n    var finalizingPlugins = [stringify, process.env.NODE_ENV !== 'production' ? function (element) {\n      if (!element.root) {\n        if (element[\"return\"]) {\n          currentSheet.insert(element[\"return\"]);\n        } else if (element.value && element.type !== COMMENT) {\n          // insert empty rule in non-production environments\n          // so @emotion/jest can grab `key` from the (JS)DOM for caches without any rules inserted yet\n          currentSheet.insert(element.value + \"{}\");\n        }\n      }\n    } : rulesheet(function (rule) {\n      currentSheet.insert(rule);\n    })];\n    var serializer = middleware(omnipresentPlugins.concat(stylisPlugins, finalizingPlugins));\n\n    var stylis = function stylis(styles) {\n      return serialize(compile(styles), serializer);\n    };\n\n    _insert = function insert(selector, serialized, sheet, shouldCache) {\n      currentSheet = sheet;\n\n      if (process.env.NODE_ENV !== 'production' && serialized.map !== undefined) {\n        currentSheet = {\n          insert: function insert(rule) {\n            sheet.insert(rule + serialized.map);\n          }\n        };\n      }\n\n      stylis(selector ? selector + \"{\" + serialized.styles + \"}\" : serialized.styles);\n\n      if (shouldCache) {\n        cache.inserted[serialized.name] = true;\n      }\n    };\n  }\n\n  var cache = {\n    key: key,\n    sheet: new StyleSheet({\n      key: key,\n      container: container,\n      nonce: options.nonce,\n      speedy: options.speedy,\n      prepend: options.prepend,\n      insertionPoint: options.insertionPoint\n    }),\n    nonce: options.nonce,\n    inserted: inserted,\n    registered: {},\n    insert: _insert\n  };\n  cache.sheet.hydrate(nodesToHydrate);\n  return cache;\n};\n\nexport { createCache as default };\n","function memoize(fn) {\n  var cache = Object.create(null);\n  return function (arg) {\n    if (cache[arg] === undefined) cache[arg] = fn(arg);\n    return cache[arg];\n  };\n}\n\nexport { memoize as default };\n","import * as React from 'react';\nimport { useContext, forwardRef } from 'react';\nimport createCache from '@emotion/cache';\nimport _extends from '@babel/runtime/helpers/esm/extends';\nimport weakMemoize from '@emotion/weak-memoize';\nimport hoistNonReactStatics from '../_isolated-hnrs/dist/emotion-react-_isolated-hnrs.browser.esm.js';\nimport { getRegisteredStyles, registerStyles, insertStyles } from '@emotion/utils';\nimport { serializeStyles } from '@emotion/serialize';\nimport { useInsertionEffectAlwaysWithSyncFallback } from '@emotion/use-insertion-effect-with-fallbacks';\n\nvar isBrowser = \"object\" !== 'undefined';\nvar hasOwn = {}.hasOwnProperty;\n\nvar EmotionCacheContext = /* #__PURE__ */React.createContext( // we're doing this to avoid preconstruct's dead code elimination in this one case\n// because this module is primarily intended for the browser and node\n// but it's also required in react native and similar environments sometimes\n// and we could have a special build just for that\n// but this is much easier and the native packages\n// might use a different theme context in the future anyway\ntypeof HTMLElement !== 'undefined' ? /* #__PURE__ */createCache({\n  key: 'css'\n}) : null);\n\nif (process.env.NODE_ENV !== 'production') {\n  EmotionCacheContext.displayName = 'EmotionCacheContext';\n}\n\nvar CacheProvider = EmotionCacheContext.Provider;\nvar __unsafe_useEmotionCache = function useEmotionCache() {\n  return useContext(EmotionCacheContext);\n};\n\nvar withEmotionCache = function withEmotionCache(func) {\n  // $FlowFixMe\n  return /*#__PURE__*/forwardRef(function (props, ref) {\n    // the cache will never be null in the browser\n    var cache = useContext(EmotionCacheContext);\n    return func(props, cache, ref);\n  });\n};\n\nif (!isBrowser) {\n  withEmotionCache = function withEmotionCache(func) {\n    return function (props) {\n      var cache = useContext(EmotionCacheContext);\n\n      if (cache === null) {\n        // yes, we're potentially creating this on every render\n        // it doesn't actually matter though since it's only on the server\n        // so there will only every be a single render\n        // that could change in the future because of suspense and etc. but for now,\n        // this works and i don't want to optimise for a future thing that we aren't sure about\n        cache = createCache({\n          key: 'css'\n        });\n        return /*#__PURE__*/React.createElement(EmotionCacheContext.Provider, {\n          value: cache\n        }, func(props, cache));\n      } else {\n        return func(props, cache);\n      }\n    };\n  };\n}\n\nvar ThemeContext = /* #__PURE__ */React.createContext({});\n\nif (process.env.NODE_ENV !== 'production') {\n  ThemeContext.displayName = 'EmotionThemeContext';\n}\n\nvar useTheme = function useTheme() {\n  return React.useContext(ThemeContext);\n};\n\nvar getTheme = function getTheme(outerTheme, theme) {\n  if (typeof theme === 'function') {\n    var mergedTheme = theme(outerTheme);\n\n    if (process.env.NODE_ENV !== 'production' && (mergedTheme == null || typeof mergedTheme !== 'object' || Array.isArray(mergedTheme))) {\n      throw new Error('[ThemeProvider] Please return an object from your theme function, i.e. theme={() => ({})}!');\n    }\n\n    return mergedTheme;\n  }\n\n  if (process.env.NODE_ENV !== 'production' && (theme == null || typeof theme !== 'object' || Array.isArray(theme))) {\n    throw new Error('[ThemeProvider] Please make your theme prop a plain object');\n  }\n\n  return _extends({}, outerTheme, theme);\n};\n\nvar createCacheWithTheme = /* #__PURE__ */weakMemoize(function (outerTheme) {\n  return weakMemoize(function (theme) {\n    return getTheme(outerTheme, theme);\n  });\n});\nvar ThemeProvider = function ThemeProvider(props) {\n  var theme = React.useContext(ThemeContext);\n\n  if (props.theme !== theme) {\n    theme = createCacheWithTheme(theme)(props.theme);\n  }\n\n  return /*#__PURE__*/React.createElement(ThemeContext.Provider, {\n    value: theme\n  }, props.children);\n};\nfunction withTheme(Component) {\n  var componentName = Component.displayName || Component.name || 'Component';\n\n  var render = function render(props, ref) {\n    var theme = React.useContext(ThemeContext);\n    return /*#__PURE__*/React.createElement(Component, _extends({\n      theme: theme,\n      ref: ref\n    }, props));\n  }; // $FlowFixMe\n\n\n  var WithTheme = /*#__PURE__*/React.forwardRef(render);\n  WithTheme.displayName = \"WithTheme(\" + componentName + \")\";\n  return hoistNonReactStatics(WithTheme, Component);\n}\n\nvar getLastPart = function getLastPart(functionName) {\n  // The match may be something like 'Object.createEmotionProps' or\n  // 'Loader.prototype.render'\n  var parts = functionName.split('.');\n  return parts[parts.length - 1];\n};\n\nvar getFunctionNameFromStackTraceLine = function getFunctionNameFromStackTraceLine(line) {\n  // V8\n  var match = /^\\s+at\\s+([A-Za-z0-9$.]+)\\s/.exec(line);\n  if (match) return getLastPart(match[1]); // Safari / Firefox\n\n  match = /^([A-Za-z0-9$.]+)@/.exec(line);\n  if (match) return getLastPart(match[1]);\n  return undefined;\n};\n\nvar internalReactFunctionNames = /* #__PURE__ */new Set(['renderWithHooks', 'processChild', 'finishClassComponent', 'renderToString']); // These identifiers come from error stacks, so they have to be valid JS\n// identifiers, thus we only need to replace what is a valid character for JS,\n// but not for CSS.\n\nvar sanitizeIdentifier = function sanitizeIdentifier(identifier) {\n  return identifier.replace(/\\$/g, '-');\n};\n\nvar getLabelFromStackTrace = function getLabelFromStackTrace(stackTrace) {\n  if (!stackTrace) return undefined;\n  var lines = stackTrace.split('\\n');\n\n  for (var i = 0; i < lines.length; i++) {\n    var functionName = getFunctionNameFromStackTraceLine(lines[i]); // The first line of V8 stack traces is just \"Error\"\n\n    if (!functionName) continue; // If we reach one of these, we have gone too far and should quit\n\n    if (internalReactFunctionNames.has(functionName)) break; // The component name is the first function in the stack that starts with an\n    // uppercase letter\n\n    if (/^[A-Z]/.test(functionName)) return sanitizeIdentifier(functionName);\n  }\n\n  return undefined;\n};\n\nvar typePropName = '__EMOTION_TYPE_PLEASE_DO_NOT_USE__';\nvar labelPropName = '__EMOTION_LABEL_PLEASE_DO_NOT_USE__';\nvar createEmotionProps = function createEmotionProps(type, props) {\n  if (process.env.NODE_ENV !== 'production' && typeof props.css === 'string' && // check if there is a css declaration\n  props.css.indexOf(':') !== -1) {\n    throw new Error(\"Strings are not allowed as css prop values, please wrap it in a css template literal from '@emotion/react' like this: css`\" + props.css + \"`\");\n  }\n\n  var newProps = {};\n\n  for (var key in props) {\n    if (hasOwn.call(props, key)) {\n      newProps[key] = props[key];\n    }\n  }\n\n  newProps[typePropName] = type; // For performance, only call getLabelFromStackTrace in development and when\n  // the label hasn't already been computed\n\n  if (process.env.NODE_ENV !== 'production' && !!props.css && (typeof props.css !== 'object' || typeof props.css.name !== 'string' || props.css.name.indexOf('-') === -1)) {\n    var label = getLabelFromStackTrace(new Error().stack);\n    if (label) newProps[labelPropName] = label;\n  }\n\n  return newProps;\n};\n\nvar Insertion = function Insertion(_ref) {\n  var cache = _ref.cache,\n      serialized = _ref.serialized,\n      isStringTag = _ref.isStringTag;\n  registerStyles(cache, serialized, isStringTag);\n  useInsertionEffectAlwaysWithSyncFallback(function () {\n    return insertStyles(cache, serialized, isStringTag);\n  });\n\n  return null;\n};\n\nvar Emotion = /* #__PURE__ */withEmotionCache(function (props, cache, ref) {\n  var cssProp = props.css; // so that using `css` from `emotion` and passing the result to the css prop works\n  // not passing the registered cache to serializeStyles because it would\n  // make certain babel optimisations not possible\n\n  if (typeof cssProp === 'string' && cache.registered[cssProp] !== undefined) {\n    cssProp = cache.registered[cssProp];\n  }\n\n  var WrappedComponent = props[typePropName];\n  var registeredStyles = [cssProp];\n  var className = '';\n\n  if (typeof props.className === 'string') {\n    className = getRegisteredStyles(cache.registered, registeredStyles, props.className);\n  } else if (props.className != null) {\n    className = props.className + \" \";\n  }\n\n  var serialized = serializeStyles(registeredStyles, undefined, React.useContext(ThemeContext));\n\n  if (process.env.NODE_ENV !== 'production' && serialized.name.indexOf('-') === -1) {\n    var labelFromStack = props[labelPropName];\n\n    if (labelFromStack) {\n      serialized = serializeStyles([serialized, 'label:' + labelFromStack + ';']);\n    }\n  }\n\n  className += cache.key + \"-\" + serialized.name;\n  var newProps = {};\n\n  for (var key in props) {\n    if (hasOwn.call(props, key) && key !== 'css' && key !== typePropName && (process.env.NODE_ENV === 'production' || key !== labelPropName)) {\n      newProps[key] = props[key];\n    }\n  }\n\n  newProps.ref = ref;\n  newProps.className = className;\n  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(Insertion, {\n    cache: cache,\n    serialized: serialized,\n    isStringTag: typeof WrappedComponent === 'string'\n  }), /*#__PURE__*/React.createElement(WrappedComponent, newProps));\n});\n\nif (process.env.NODE_ENV !== 'production') {\n  Emotion.displayName = 'EmotionCssPropInternal';\n}\n\nvar Emotion$1 = Emotion;\n\nexport { CacheProvider as C, Emotion$1 as E, ThemeContext as T, __unsafe_useEmotionCache as _, ThemeProvider as a, withTheme as b, createEmotionProps as c, hasOwn as h, isBrowser as i, useTheme as u, withEmotionCache as w };\n","import { h as hasOwn, E as Emotion, c as createEmotionProps, w as withEmotionCache, T as ThemeContext, i as isBrowser$1 } from './emotion-element-43c6fea0.browser.esm.js';\nexport { C as CacheProvider, T as ThemeContext, a as ThemeProvider, _ as __unsafe_useEmotionCache, u as useTheme, w as withEmotionCache, b as withTheme } from './emotion-element-43c6fea0.browser.esm.js';\nimport * as React from 'react';\nimport { insertStyles, registerStyles, getRegisteredStyles } from '@emotion/utils';\nimport { useInsertionEffectWithLayoutFallback, useInsertionEffectAlwaysWithSyncFallback } from '@emotion/use-insertion-effect-with-fallbacks';\nimport { serializeStyles } from '@emotion/serialize';\nimport '@emotion/cache';\nimport '@babel/runtime/helpers/extends';\nimport '@emotion/weak-memoize';\nimport '../_isolated-hnrs/dist/emotion-react-_isolated-hnrs.browser.esm.js';\nimport 'hoist-non-react-statics';\n\nvar pkg = {\n\tname: \"@emotion/react\",\n\tversion: \"11.11.4\",\n\tmain: \"dist/emotion-react.cjs.js\",\n\tmodule: \"dist/emotion-react.esm.js\",\n\tbrowser: {\n\t\t\"./dist/emotion-react.esm.js\": \"./dist/emotion-react.browser.esm.js\"\n\t},\n\texports: {\n\t\t\".\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./dist/emotion-react.worker.esm.js\",\n\t\t\t\tbrowser: \"./dist/emotion-react.browser.esm.js\",\n\t\t\t\t\"default\": \"./dist/emotion-react.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./dist/emotion-react.cjs.mjs\",\n\t\t\t\"default\": \"./dist/emotion-react.cjs.js\"\n\t\t},\n\t\t\"./jsx-runtime\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./jsx-runtime/dist/emotion-react-jsx-runtime.worker.esm.js\",\n\t\t\t\tbrowser: \"./jsx-runtime/dist/emotion-react-jsx-runtime.browser.esm.js\",\n\t\t\t\t\"default\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.cjs.mjs\",\n\t\t\t\"default\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.cjs.js\"\n\t\t},\n\t\t\"./_isolated-hnrs\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.worker.esm.js\",\n\t\t\t\tbrowser: \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.browser.esm.js\",\n\t\t\t\t\"default\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.cjs.mjs\",\n\t\t\t\"default\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.cjs.js\"\n\t\t},\n\t\t\"./jsx-dev-runtime\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.worker.esm.js\",\n\t\t\t\tbrowser: \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.browser.esm.js\",\n\t\t\t\t\"default\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.cjs.mjs\",\n\t\t\t\"default\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.cjs.js\"\n\t\t},\n\t\t\"./package.json\": \"./package.json\",\n\t\t\"./types/css-prop\": \"./types/css-prop.d.ts\",\n\t\t\"./macro\": {\n\t\t\ttypes: {\n\t\t\t\t\"import\": \"./macro.d.mts\",\n\t\t\t\t\"default\": \"./macro.d.ts\"\n\t\t\t},\n\t\t\t\"default\": \"./macro.js\"\n\t\t}\n\t},\n\ttypes: \"types/index.d.ts\",\n\tfiles: [\n\t\t\"src\",\n\t\t\"dist\",\n\t\t\"jsx-runtime\",\n\t\t\"jsx-dev-runtime\",\n\t\t\"_isolated-hnrs\",\n\t\t\"types/*.d.ts\",\n\t\t\"macro.*\"\n\t],\n\tsideEffects: false,\n\tauthor: \"Emotion Contributors\",\n\tlicense: \"MIT\",\n\tscripts: {\n\t\t\"test:typescript\": \"dtslint types\"\n\t},\n\tdependencies: {\n\t\t\"@babel/runtime\": \"^7.18.3\",\n\t\t\"@emotion/babel-plugin\": \"^11.11.0\",\n\t\t\"@emotion/cache\": \"^11.11.0\",\n\t\t\"@emotion/serialize\": \"^1.1.3\",\n\t\t\"@emotion/use-insertion-effect-with-fallbacks\": \"^1.0.1\",\n\t\t\"@emotion/utils\": \"^1.2.1\",\n\t\t\"@emotion/weak-memoize\": \"^0.3.1\",\n\t\t\"hoist-non-react-statics\": \"^3.3.1\"\n\t},\n\tpeerDependencies: {\n\t\treact: \">=16.8.0\"\n\t},\n\tpeerDependenciesMeta: {\n\t\t\"@types/react\": {\n\t\t\toptional: true\n\t\t}\n\t},\n\tdevDependencies: {\n\t\t\"@definitelytyped/dtslint\": \"0.0.112\",\n\t\t\"@emotion/css\": \"11.11.2\",\n\t\t\"@emotion/css-prettifier\": \"1.1.3\",\n\t\t\"@emotion/server\": \"11.11.0\",\n\t\t\"@emotion/styled\": \"11.11.0\",\n\t\t\"html-tag-names\": \"^1.1.2\",\n\t\treact: \"16.14.0\",\n\t\t\"svg-tag-names\": \"^1.1.1\",\n\t\ttypescript: \"^4.5.5\"\n\t},\n\trepository: \"https://github.com/emotion-js/emotion/tree/main/packages/react\",\n\tpublishConfig: {\n\t\taccess: \"public\"\n\t},\n\t\"umd:main\": \"dist/emotion-react.umd.min.js\",\n\tpreconstruct: {\n\t\tentrypoints: [\n\t\t\t\"./index.js\",\n\t\t\t\"./jsx-runtime.js\",\n\t\t\t\"./jsx-dev-runtime.js\",\n\t\t\t\"./_isolated-hnrs.js\"\n\t\t],\n\t\tumdName: \"emotionReact\",\n\t\texports: {\n\t\t\tenvConditions: [\n\t\t\t\t\"browser\",\n\t\t\t\t\"worker\"\n\t\t\t],\n\t\t\textra: {\n\t\t\t\t\"./types/css-prop\": \"./types/css-prop.d.ts\",\n\t\t\t\t\"./macro\": {\n\t\t\t\t\ttypes: {\n\t\t\t\t\t\t\"import\": \"./macro.d.mts\",\n\t\t\t\t\t\t\"default\": \"./macro.d.ts\"\n\t\t\t\t\t},\n\t\t\t\t\t\"default\": \"./macro.js\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nvar jsx = function jsx(type, props) {\n  var args = arguments;\n\n  if (props == null || !hasOwn.call(props, 'css')) {\n    // $FlowFixMe\n    return React.createElement.apply(undefined, args);\n  }\n\n  var argsLength = args.length;\n  var createElementArgArray = new Array(argsLength);\n  createElementArgArray[0] = Emotion;\n  createElementArgArray[1] = createEmotionProps(type, props);\n\n  for (var i = 2; i < argsLength; i++) {\n    createElementArgArray[i] = args[i];\n  } // $FlowFixMe\n\n\n  return React.createElement.apply(null, createElementArgArray);\n};\n\nvar warnedAboutCssPropForGlobal = false; // maintain place over rerenders.\n// initial render from browser, insertBefore context.sheet.tags[0] or if a style hasn't been inserted there yet, appendChild\n// initial client-side render from SSR, use place of hydrating tag\n\nvar Global = /* #__PURE__ */withEmotionCache(function (props, cache) {\n  if (process.env.NODE_ENV !== 'production' && !warnedAboutCssPropForGlobal && ( // check for className as well since the user is\n  // probably using the custom createElement which\n  // means it will be turned into a className prop\n  // $FlowFixMe I don't really want to add it to the type since it shouldn't be used\n  props.className || props.css)) {\n    console.error(\"It looks like you're using the css prop on Global, did you mean to use the styles prop instead?\");\n    warnedAboutCssPropForGlobal = true;\n  }\n\n  var styles = props.styles;\n  var serialized = serializeStyles([styles], undefined, React.useContext(ThemeContext));\n\n  if (!isBrowser$1) {\n    var _ref;\n\n    var serializedNames = serialized.name;\n    var serializedStyles = serialized.styles;\n    var next = serialized.next;\n\n    while (next !== undefined) {\n      serializedNames += ' ' + next.name;\n      serializedStyles += next.styles;\n      next = next.next;\n    }\n\n    var shouldCache = cache.compat === true;\n    var rules = cache.insert(\"\", {\n      name: serializedNames,\n      styles: serializedStyles\n    }, cache.sheet, shouldCache);\n\n    if (shouldCache) {\n      return null;\n    }\n\n    return /*#__PURE__*/React.createElement(\"style\", (_ref = {}, _ref[\"data-emotion\"] = cache.key + \"-global \" + serializedNames, _ref.dangerouslySetInnerHTML = {\n      __html: rules\n    }, _ref.nonce = cache.sheet.nonce, _ref));\n  } // yes, i know these hooks are used conditionally\n  // but it is based on a constant that will never change at runtime\n  // it's effectively like having two implementations and switching them out\n  // so it's not actually breaking anything\n\n\n  var sheetRef = React.useRef();\n  useInsertionEffectWithLayoutFallback(function () {\n    var key = cache.key + \"-global\"; // use case of https://github.com/emotion-js/emotion/issues/2675\n\n    var sheet = new cache.sheet.constructor({\n      key: key,\n      nonce: cache.sheet.nonce,\n      container: cache.sheet.container,\n      speedy: cache.sheet.isSpeedy\n    });\n    var rehydrating = false; // $FlowFixMe\n\n    var node = document.querySelector(\"style[data-emotion=\\\"\" + key + \" \" + serialized.name + \"\\\"]\");\n\n    if (cache.sheet.tags.length) {\n      sheet.before = cache.sheet.tags[0];\n    }\n\n    if (node !== null) {\n      rehydrating = true; // clear the hash so this node won't be recognizable as rehydratable by other <Global/>s\n\n      node.setAttribute('data-emotion', key);\n      sheet.hydrate([node]);\n    }\n\n    sheetRef.current = [sheet, rehydrating];\n    return function () {\n      sheet.flush();\n    };\n  }, [cache]);\n  useInsertionEffectWithLayoutFallback(function () {\n    var sheetRefCurrent = sheetRef.current;\n    var sheet = sheetRefCurrent[0],\n        rehydrating = sheetRefCurrent[1];\n\n    if (rehydrating) {\n      sheetRefCurrent[1] = false;\n      return;\n    }\n\n    if (serialized.next !== undefined) {\n      // insert keyframes\n      insertStyles(cache, serialized.next, true);\n    }\n\n    if (sheet.tags.length) {\n      // if this doesn't exist then it will be null so the style element will be appended\n      var element = sheet.tags[sheet.tags.length - 1].nextElementSibling;\n      sheet.before = element;\n      sheet.flush();\n    }\n\n    cache.insert(\"\", serialized, sheet, false);\n  }, [cache, serialized.name]);\n  return null;\n});\n\nif (process.env.NODE_ENV !== 'production') {\n  Global.displayName = 'EmotionGlobal';\n}\n\nfunction css() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return serializeStyles(args);\n}\n\nvar keyframes = function keyframes() {\n  var insertable = css.apply(void 0, arguments);\n  var name = \"animation-\" + insertable.name; // $FlowFixMe\n\n  return {\n    name: name,\n    styles: \"@keyframes \" + name + \"{\" + insertable.styles + \"}\",\n    anim: 1,\n    toString: function toString() {\n      return \"_EMO_\" + this.name + \"_\" + this.styles + \"_EMO_\";\n    }\n  };\n};\n\nvar classnames = function classnames(args) {\n  var len = args.length;\n  var i = 0;\n  var cls = '';\n\n  for (; i < len; i++) {\n    var arg = args[i];\n    if (arg == null) continue;\n    var toAdd = void 0;\n\n    switch (typeof arg) {\n      case 'boolean':\n        break;\n\n      case 'object':\n        {\n          if (Array.isArray(arg)) {\n            toAdd = classnames(arg);\n          } else {\n            if (process.env.NODE_ENV !== 'production' && arg.styles !== undefined && arg.name !== undefined) {\n              console.error('You have passed styles created with `css` from `@emotion/react` package to the `cx`.\\n' + '`cx` is meant to compose class names (strings) so you should convert those styles to a class name by passing them to the `css` received from <ClassNames/> component.');\n            }\n\n            toAdd = '';\n\n            for (var k in arg) {\n              if (arg[k] && k) {\n                toAdd && (toAdd += ' ');\n                toAdd += k;\n              }\n            }\n          }\n\n          break;\n        }\n\n      default:\n        {\n          toAdd = arg;\n        }\n    }\n\n    if (toAdd) {\n      cls && (cls += ' ');\n      cls += toAdd;\n    }\n  }\n\n  return cls;\n};\n\nfunction merge(registered, css, className) {\n  var registeredStyles = [];\n  var rawClassName = getRegisteredStyles(registered, registeredStyles, className);\n\n  if (registeredStyles.length < 2) {\n    return className;\n  }\n\n  return rawClassName + css(registeredStyles);\n}\n\nvar Insertion = function Insertion(_ref) {\n  var cache = _ref.cache,\n      serializedArr = _ref.serializedArr;\n  useInsertionEffectAlwaysWithSyncFallback(function () {\n\n    for (var i = 0; i < serializedArr.length; i++) {\n      insertStyles(cache, serializedArr[i], false);\n    }\n  });\n\n  return null;\n};\n\nvar ClassNames = /* #__PURE__ */withEmotionCache(function (props, cache) {\n  var hasRendered = false;\n  var serializedArr = [];\n\n  var css = function css() {\n    if (hasRendered && process.env.NODE_ENV !== 'production') {\n      throw new Error('css can only be used during render');\n    }\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    var serialized = serializeStyles(args, cache.registered);\n    serializedArr.push(serialized); // registration has to happen here as the result of this might get consumed by `cx`\n\n    registerStyles(cache, serialized, false);\n    return cache.key + \"-\" + serialized.name;\n  };\n\n  var cx = function cx() {\n    if (hasRendered && process.env.NODE_ENV !== 'production') {\n      throw new Error('cx can only be used during render');\n    }\n\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return merge(cache.registered, css, classnames(args));\n  };\n\n  var content = {\n    css: css,\n    cx: cx,\n    theme: React.useContext(ThemeContext)\n  };\n  var ele = props.children(content);\n  hasRendered = true;\n  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(Insertion, {\n    cache: cache,\n    serializedArr: serializedArr\n  }), ele);\n});\n\nif (process.env.NODE_ENV !== 'production') {\n  ClassNames.displayName = 'EmotionClassNames';\n}\n\nif (process.env.NODE_ENV !== 'production') {\n  var isBrowser = \"object\" !== 'undefined'; // #1727, #2905 for some reason Jest and Vitest evaluate modules twice if some consuming module gets mocked\n\n  var isTestEnv = typeof jest !== 'undefined' || typeof vi !== 'undefined';\n\n  if (isBrowser && !isTestEnv) {\n    // globalThis has wide browser support - https://caniuse.com/?search=globalThis, Node.js 12 and later\n    var globalContext = // $FlowIgnore\n    typeof globalThis !== 'undefined' ? globalThis // eslint-disable-line no-undef\n    : isBrowser ? window : global;\n    var globalKey = \"__EMOTION_REACT_\" + pkg.version.split('.')[0] + \"__\";\n\n    if (globalContext[globalKey]) {\n      console.warn('You are loading @emotion/react when it is already loaded. Running ' + 'multiple instances may cause problems. This can happen if multiple ' + 'versions are used, or if multiple builds of the same version are ' + 'used.');\n    }\n\n    globalContext[globalKey] = true;\n  }\n}\n\nexport { ClassNames, Global, jsx as createElement, css, jsx, keyframes };\n","/* eslint-disable */\n// Inspired by https://github.com/garycourt/murmurhash-js\n// Ported from https://github.com/aappleby/smhasher/blob/61a0530f28277f2e850bfc39600ce61d02b518de/src/MurmurHash2.cpp#L37-L86\nfunction murmur2(str) {\n  // 'm' and 'r' are mixing constants generated offline.\n  // They're not really 'magic', they just happen to work well.\n  // const m = 0x5bd1e995;\n  // const r = 24;\n  // Initialize the hash\n  var h = 0; // Mix 4 bytes at a time into the hash\n\n  var k,\n      i = 0,\n      len = str.length;\n\n  for (; len >= 4; ++i, len -= 4) {\n    k = str.charCodeAt(i) & 0xff | (str.charCodeAt(++i) & 0xff) << 8 | (str.charCodeAt(++i) & 0xff) << 16 | (str.charCodeAt(++i) & 0xff) << 24;\n    k =\n    /* Math.imul(k, m): */\n    (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16);\n    k ^=\n    /* k >>> r: */\n    k >>> 24;\n    h =\n    /* Math.imul(k, m): */\n    (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16) ^\n    /* Math.imul(h, m): */\n    (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  } // Handle the last few bytes of the input array\n\n\n  switch (len) {\n    case 3:\n      h ^= (str.charCodeAt(i + 2) & 0xff) << 16;\n\n    case 2:\n      h ^= (str.charCodeAt(i + 1) & 0xff) << 8;\n\n    case 1:\n      h ^= str.charCodeAt(i) & 0xff;\n      h =\n      /* Math.imul(h, m): */\n      (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  } // Do a few final mixes of the hash to ensure the last few\n  // bytes are well-incorporated.\n\n\n  h ^= h >>> 13;\n  h =\n  /* Math.imul(h, m): */\n  (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  return ((h ^ h >>> 15) >>> 0).toString(36);\n}\n\nexport { murmur2 as default };\n","var unitlessKeys = {\n  animationIterationCount: 1,\n  aspectRatio: 1,\n  borderImageOutset: 1,\n  borderImageSlice: 1,\n  borderImageWidth: 1,\n  boxFlex: 1,\n  boxFlexGroup: 1,\n  boxOrdinalGroup: 1,\n  columnCount: 1,\n  columns: 1,\n  flex: 1,\n  flexGrow: 1,\n  flexPositive: 1,\n  flexShrink: 1,\n  flexNegative: 1,\n  flexOrder: 1,\n  gridRow: 1,\n  gridRowEnd: 1,\n  gridRowSpan: 1,\n  gridRowStart: 1,\n  gridColumn: 1,\n  gridColumnEnd: 1,\n  gridColumnSpan: 1,\n  gridColumnStart: 1,\n  msGridRow: 1,\n  msGridRowSpan: 1,\n  msGridColumn: 1,\n  msGridColumnSpan: 1,\n  fontWeight: 1,\n  lineHeight: 1,\n  opacity: 1,\n  order: 1,\n  orphans: 1,\n  tabSize: 1,\n  widows: 1,\n  zIndex: 1,\n  zoom: 1,\n  WebkitLineClamp: 1,\n  // SVG-related properties\n  fillOpacity: 1,\n  floodOpacity: 1,\n  stopOpacity: 1,\n  strokeDasharray: 1,\n  strokeDashoffset: 1,\n  strokeMiterlimit: 1,\n  strokeOpacity: 1,\n  strokeWidth: 1\n};\n\nexport { unitlessKeys as default };\n","import hashString from '@emotion/hash';\nimport unitless from '@emotion/unitless';\nimport memoize from '@emotion/memoize';\n\nvar ILLEGAL_ESCAPE_SEQUENCE_ERROR = \"You have illegal escape sequence in your template literal, most likely inside content's property value.\\nBecause you write your CSS inside a JavaScript string you actually have to do double escaping, so for example \\\"content: '\\\\00d7';\\\" should become \\\"content: '\\\\\\\\00d7';\\\".\\nYou can read more about this here:\\nhttps://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals#ES2018_revision_of_illegal_escape_sequences\";\nvar UNDEFINED_AS_OBJECT_KEY_ERROR = \"You have passed in falsy value as style object's key (can happen when in example you pass unexported component as computed key).\";\nvar hyphenateRegex = /[A-Z]|^ms/g;\nvar animationRegex = /_EMO_([^_]+?)_([^]*?)_EMO_/g;\n\nvar isCustomProperty = function isCustomProperty(property) {\n  return property.charCodeAt(1) === 45;\n};\n\nvar isProcessableValue = function isProcessableValue(value) {\n  return value != null && typeof value !== 'boolean';\n};\n\nvar processStyleName = /* #__PURE__ */memoize(function (styleName) {\n  return isCustomProperty(styleName) ? styleName : styleName.replace(hyphenateRegex, '-$&').toLowerCase();\n});\n\nvar processStyleValue = function processStyleValue(key, value) {\n  switch (key) {\n    case 'animation':\n    case 'animationName':\n      {\n        if (typeof value === 'string') {\n          return value.replace(animationRegex, function (match, p1, p2) {\n            cursor = {\n              name: p1,\n              styles: p2,\n              next: cursor\n            };\n            return p1;\n          });\n        }\n      }\n  }\n\n  if (unitless[key] !== 1 && !isCustomProperty(key) && typeof value === 'number' && value !== 0) {\n    return value + 'px';\n  }\n\n  return value;\n};\n\nif (process.env.NODE_ENV !== 'production') {\n  var contentValuePattern = /(var|attr|counters?|url|element|(((repeating-)?(linear|radial))|conic)-gradient)\\(|(no-)?(open|close)-quote/;\n  var contentValues = ['normal', 'none', 'initial', 'inherit', 'unset'];\n  var oldProcessStyleValue = processStyleValue;\n  var msPattern = /^-ms-/;\n  var hyphenPattern = /-(.)/g;\n  var hyphenatedCache = {};\n\n  processStyleValue = function processStyleValue(key, value) {\n    if (key === 'content') {\n      if (typeof value !== 'string' || contentValues.indexOf(value) === -1 && !contentValuePattern.test(value) && (value.charAt(0) !== value.charAt(value.length - 1) || value.charAt(0) !== '\"' && value.charAt(0) !== \"'\")) {\n        throw new Error(\"You seem to be using a value for 'content' without quotes, try replacing it with `content: '\\\"\" + value + \"\\\"'`\");\n      }\n    }\n\n    var processed = oldProcessStyleValue(key, value);\n\n    if (processed !== '' && !isCustomProperty(key) && key.indexOf('-') !== -1 && hyphenatedCache[key] === undefined) {\n      hyphenatedCache[key] = true;\n      console.error(\"Using kebab-case for css properties in objects is not supported. Did you mean \" + key.replace(msPattern, 'ms-').replace(hyphenPattern, function (str, _char) {\n        return _char.toUpperCase();\n      }) + \"?\");\n    }\n\n    return processed;\n  };\n}\n\nvar noComponentSelectorMessage = 'Component selectors can only be used in conjunction with ' + '@emotion/babel-plugin, the swc Emotion plugin, or another Emotion-aware ' + 'compiler transform.';\n\nfunction handleInterpolation(mergedProps, registered, interpolation) {\n  if (interpolation == null) {\n    return '';\n  }\n\n  if (interpolation.__emotion_styles !== undefined) {\n    if (process.env.NODE_ENV !== 'production' && interpolation.toString() === 'NO_COMPONENT_SELECTOR') {\n      throw new Error(noComponentSelectorMessage);\n    }\n\n    return interpolation;\n  }\n\n  switch (typeof interpolation) {\n    case 'boolean':\n      {\n        return '';\n      }\n\n    case 'object':\n      {\n        if (interpolation.anim === 1) {\n          cursor = {\n            name: interpolation.name,\n            styles: interpolation.styles,\n            next: cursor\n          };\n          return interpolation.name;\n        }\n\n        if (interpolation.styles !== undefined) {\n          var next = interpolation.next;\n\n          if (next !== undefined) {\n            // not the most efficient thing ever but this is a pretty rare case\n            // and there will be very few iterations of this generally\n            while (next !== undefined) {\n              cursor = {\n                name: next.name,\n                styles: next.styles,\n                next: cursor\n              };\n              next = next.next;\n            }\n          }\n\n          var styles = interpolation.styles + \";\";\n\n          if (process.env.NODE_ENV !== 'production' && interpolation.map !== undefined) {\n            styles += interpolation.map;\n          }\n\n          return styles;\n        }\n\n        return createStringFromObject(mergedProps, registered, interpolation);\n      }\n\n    case 'function':\n      {\n        if (mergedProps !== undefined) {\n          var previousCursor = cursor;\n          var result = interpolation(mergedProps);\n          cursor = previousCursor;\n          return handleInterpolation(mergedProps, registered, result);\n        } else if (process.env.NODE_ENV !== 'production') {\n          console.error('Functions that are interpolated in css calls will be stringified.\\n' + 'If you want to have a css call based on props, create a function that returns a css call like this\\n' + 'let dynamicStyle = (props) => css`color: ${props.color}`\\n' + 'It can be called directly with props or interpolated in a styled call like this\\n' + \"let SomeComponent = styled('div')`${dynamicStyle}`\");\n        }\n\n        break;\n      }\n\n    case 'string':\n      if (process.env.NODE_ENV !== 'production') {\n        var matched = [];\n        var replaced = interpolation.replace(animationRegex, function (match, p1, p2) {\n          var fakeVarName = \"animation\" + matched.length;\n          matched.push(\"const \" + fakeVarName + \" = keyframes`\" + p2.replace(/^@keyframes animation-\\w+/, '') + \"`\");\n          return \"${\" + fakeVarName + \"}\";\n        });\n\n        if (matched.length) {\n          console.error('`keyframes` output got interpolated into plain string, please wrap it with `css`.\\n\\n' + 'Instead of doing this:\\n\\n' + [].concat(matched, [\"`\" + replaced + \"`\"]).join('\\n') + '\\n\\nYou should wrap it with `css` like this:\\n\\n' + (\"css`\" + replaced + \"`\"));\n        }\n      }\n\n      break;\n  } // finalize string values (regular strings and functions interpolated into css calls)\n\n\n  if (registered == null) {\n    return interpolation;\n  }\n\n  var cached = registered[interpolation];\n  return cached !== undefined ? cached : interpolation;\n}\n\nfunction createStringFromObject(mergedProps, registered, obj) {\n  var string = '';\n\n  if (Array.isArray(obj)) {\n    for (var i = 0; i < obj.length; i++) {\n      string += handleInterpolation(mergedProps, registered, obj[i]) + \";\";\n    }\n  } else {\n    for (var _key in obj) {\n      var value = obj[_key];\n\n      if (typeof value !== 'object') {\n        if (registered != null && registered[value] !== undefined) {\n          string += _key + \"{\" + registered[value] + \"}\";\n        } else if (isProcessableValue(value)) {\n          string += processStyleName(_key) + \":\" + processStyleValue(_key, value) + \";\";\n        }\n      } else {\n        if (_key === 'NO_COMPONENT_SELECTOR' && process.env.NODE_ENV !== 'production') {\n          throw new Error(noComponentSelectorMessage);\n        }\n\n        if (Array.isArray(value) && typeof value[0] === 'string' && (registered == null || registered[value[0]] === undefined)) {\n          for (var _i = 0; _i < value.length; _i++) {\n            if (isProcessableValue(value[_i])) {\n              string += processStyleName(_key) + \":\" + processStyleValue(_key, value[_i]) + \";\";\n            }\n          }\n        } else {\n          var interpolated = handleInterpolation(mergedProps, registered, value);\n\n          switch (_key) {\n            case 'animation':\n            case 'animationName':\n              {\n                string += processStyleName(_key) + \":\" + interpolated + \";\";\n                break;\n              }\n\n            default:\n              {\n                if (process.env.NODE_ENV !== 'production' && _key === 'undefined') {\n                  console.error(UNDEFINED_AS_OBJECT_KEY_ERROR);\n                }\n\n                string += _key + \"{\" + interpolated + \"}\";\n              }\n          }\n        }\n      }\n    }\n  }\n\n  return string;\n}\n\nvar labelPattern = /label:\\s*([^\\s;\\n{]+)\\s*(;|$)/g;\nvar sourceMapPattern;\n\nif (process.env.NODE_ENV !== 'production') {\n  sourceMapPattern = /\\/\\*#\\ssourceMappingURL=data:application\\/json;\\S+\\s+\\*\\//g;\n} // this is the cursor for keyframes\n// keyframes are stored on the SerializedStyles object as a linked list\n\n\nvar cursor;\nvar serializeStyles = function serializeStyles(args, registered, mergedProps) {\n  if (args.length === 1 && typeof args[0] === 'object' && args[0] !== null && args[0].styles !== undefined) {\n    return args[0];\n  }\n\n  var stringMode = true;\n  var styles = '';\n  cursor = undefined;\n  var strings = args[0];\n\n  if (strings == null || strings.raw === undefined) {\n    stringMode = false;\n    styles += handleInterpolation(mergedProps, registered, strings);\n  } else {\n    if (process.env.NODE_ENV !== 'production' && strings[0] === undefined) {\n      console.error(ILLEGAL_ESCAPE_SEQUENCE_ERROR);\n    }\n\n    styles += strings[0];\n  } // we start at 1 since we've already handled the first arg\n\n\n  for (var i = 1; i < args.length; i++) {\n    styles += handleInterpolation(mergedProps, registered, args[i]);\n\n    if (stringMode) {\n      if (process.env.NODE_ENV !== 'production' && strings[i] === undefined) {\n        console.error(ILLEGAL_ESCAPE_SEQUENCE_ERROR);\n      }\n\n      styles += strings[i];\n    }\n  }\n\n  var sourceMap;\n\n  if (process.env.NODE_ENV !== 'production') {\n    styles = styles.replace(sourceMapPattern, function (match) {\n      sourceMap = match;\n      return '';\n    });\n  } // using a global regex with .exec is stateful so lastIndex has to be reset each time\n\n\n  labelPattern.lastIndex = 0;\n  var identifierName = '';\n  var match; // https://esbench.com/bench/5b809c2cf2949800a0f61fb5\n\n  while ((match = labelPattern.exec(styles)) !== null) {\n    identifierName += '-' + // $FlowFixMe we know it's not null\n    match[1];\n  }\n\n  var name = hashString(styles) + identifierName;\n\n  if (process.env.NODE_ENV !== 'production') {\n    // $FlowFixMe SerializedStyles type doesn't have toString property (and we don't want to add it)\n    return {\n      name: name,\n      styles: styles,\n      map: sourceMap,\n      next: cursor,\n      toString: function toString() {\n        return \"You have tried to stringify object returned from `css` function. It isn't supposed to be used directly (e.g. as value of the `className` prop), but rather handed to emotion so it can handle it (e.g. as value of `css` prop).\";\n      }\n    };\n  }\n\n  return {\n    name: name,\n    styles: styles,\n    next: cursor\n  };\n};\n\nexport { serializeStyles };\n","import * as React from 'react';\n\nvar syncFallback = function syncFallback(create) {\n  return create();\n};\n\nvar useInsertionEffect = React['useInsertion' + 'Effect'] ? React['useInsertion' + 'Effect'] : false;\nvar useInsertionEffectAlwaysWithSyncFallback = useInsertionEffect || syncFallback;\nvar useInsertionEffectWithLayoutFallback = useInsertionEffect || React.useLayoutEffect;\n\nexport { useInsertionEffectAlwaysWithSyncFallback, useInsertionEffectWithLayoutFallback };\n","var isBrowser = \"object\" !== 'undefined';\nfunction getRegisteredStyles(registered, registeredStyles, classNames) {\n  var rawClassName = '';\n  classNames.split(' ').forEach(function (className) {\n    if (registered[className] !== undefined) {\n      registeredStyles.push(registered[className] + \";\");\n    } else {\n      rawClassName += className + \" \";\n    }\n  });\n  return rawClassName;\n}\nvar registerStyles = function registerStyles(cache, serialized, isStringTag) {\n  var className = cache.key + \"-\" + serialized.name;\n\n  if ( // we only need to add the styles to the registered cache if the\n  // class name could be used further down\n  // the tree but if it's a string tag, we know it won't\n  // so we don't have to add it to registered cache.\n  // this improves memory usage since we can avoid storing the whole style string\n  (isStringTag === false || // we need to always store it if we're in compat mode and\n  // in node since emotion-server relies on whether a style is in\n  // the registered cache to know whether a style is global or not\n  // also, note that this check will be dead code eliminated in the browser\n  isBrowser === false ) && cache.registered[className] === undefined) {\n    cache.registered[className] = serialized.styles;\n  }\n};\nvar insertStyles = function insertStyles(cache, serialized, isStringTag) {\n  registerStyles(cache, serialized, isStringTag);\n  var className = cache.key + \"-\" + serialized.name;\n\n  if (cache.inserted[serialized.name] === undefined) {\n    var current = serialized;\n\n    do {\n      cache.insert(serialized === current ? \".\" + className : '', current, cache.sheet, true);\n\n      current = current.next;\n    } while (current !== undefined);\n  }\n};\n\nexport { getRegisteredStyles, insertStyles, registerStyles };\n","'use client';\n\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport SystemDefaultPropsProvider, { useDefaultProps as useSystemDefaultProps } from '@mui/system/DefaultPropsProvider';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nfunction DefaultPropsProvider(props) {\n  return /*#__PURE__*/_jsx(SystemDefaultPropsProvider, _extends({}, props));\n}\nprocess.env.NODE_ENV !== \"production\" ? DefaultPropsProvider.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │ To update them, edit the TypeScript types and run `pnpm proptypes`. │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * @ignore\n   */\n  children: PropTypes.node,\n  /**\n   * @ignore\n   */\n  value: PropTypes.object.isRequired\n} : void 0;\nexport default DefaultPropsProvider;\nexport function useDefaultProps(params) {\n  return useSystemDefaultProps(params);\n}","'use client';\n\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { GlobalStyles as MuiGlobalStyles } from '@mui/styled-engine';\nimport useTheme from '../useTheme';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nfunction GlobalStyles({\n  styles,\n  themeId,\n  defaultTheme = {}\n}) {\n  const upperTheme = useTheme(defaultTheme);\n  const globalStyles = typeof styles === 'function' ? styles(themeId ? upperTheme[themeId] || upperTheme : upperTheme) : styles;\n  return /*#__PURE__*/_jsx(MuiGlobalStyles, {\n    styles: globalStyles\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? GlobalStyles.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │ To update them, edit the TypeScript types and run `pnpm proptypes`. │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * @ignore\n   */\n  defaultTheme: PropTypes.object,\n  /**\n   * @ignore\n   */\n  styles: PropTypes /* @typescript-to-proptypes-ignore */.oneOfType([PropTypes.array, PropTypes.func, PropTypes.number, PropTypes.object, PropTypes.string, PropTypes.bool]),\n  /**\n   * @ignore\n   */\n  themeId: PropTypes.string\n} : void 0;\nexport default GlobalStyles;","'use client';\n\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { GlobalStyles as SystemGlobalStyles } from '@mui/system';\nimport defaultTheme from '../styles/defaultTheme';\nimport THEME_ID from '../styles/identifier';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nfunction GlobalStyles(props) {\n  return /*#__PURE__*/_jsx(SystemGlobalStyles, _extends({}, props, {\n    defaultTheme: defaultTheme,\n    themeId: THEME_ID\n  }));\n}\nprocess.env.NODE_ENV !== \"production\" ? GlobalStyles.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │    To update them, edit the d.ts file and run `pnpm proptypes`.     │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * The styles you want to apply globally.\n   */\n  styles: PropTypes /* @typescript-to-proptypes-ignore */.oneOfType([PropTypes.array, PropTypes.func, PropTypes.number, PropTypes.object, PropTypes.string, PropTypes.bool])\n} : void 0;\nexport default GlobalStyles;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nexport default function createMixins(breakpoints, mixins) {\n  return _extends({\n    toolbar: {\n      minHeight: 56,\n      [breakpoints.up('xs')]: {\n        '@media (orientation: landscape)': {\n          minHeight: 48\n        }\n      },\n      [breakpoints.up('sm')]: {\n        minHeight: 64\n      }\n    }\n  }, mixins);\n}","const common = {\n  black: '#000',\n  white: '#fff'\n};\nexport default common;","const grey = {\n  50: '#fafafa',\n  100: '#f5f5f5',\n  200: '#eeeeee',\n  300: '#e0e0e0',\n  400: '#bdbdbd',\n  500: '#9e9e9e',\n  600: '#757575',\n  700: '#616161',\n  800: '#424242',\n  900: '#212121',\n  A100: '#f5f5f5',\n  A200: '#eeeeee',\n  A400: '#bdbdbd',\n  A700: '#616161'\n};\nexport default grey;","const purple = {\n  50: '#f3e5f5',\n  100: '#e1bee7',\n  200: '#ce93d8',\n  300: '#ba68c8',\n  400: '#ab47bc',\n  500: '#9c27b0',\n  600: '#8e24aa',\n  700: '#7b1fa2',\n  800: '#6a1b9a',\n  900: '#4a148c',\n  A100: '#ea80fc',\n  A200: '#e040fb',\n  A400: '#d500f9',\n  A700: '#aa00ff'\n};\nexport default purple;","const red = {\n  50: '#ffebee',\n  100: '#ffcdd2',\n  200: '#ef9a9a',\n  300: '#e57373',\n  400: '#ef5350',\n  500: '#f44336',\n  600: '#e53935',\n  700: '#d32f2f',\n  800: '#c62828',\n  900: '#b71c1c',\n  A100: '#ff8a80',\n  A200: '#ff5252',\n  A400: '#ff1744',\n  A700: '#d50000'\n};\nexport default red;","const orange = {\n  50: '#fff3e0',\n  100: '#ffe0b2',\n  200: '#ffcc80',\n  300: '#ffb74d',\n  400: '#ffa726',\n  500: '#ff9800',\n  600: '#fb8c00',\n  700: '#f57c00',\n  800: '#ef6c00',\n  900: '#e65100',\n  A100: '#ffd180',\n  A200: '#ffab40',\n  A400: '#ff9100',\n  A700: '#ff6d00'\n};\nexport default orange;","const blue = {\n  50: '#e3f2fd',\n  100: '#bbdefb',\n  200: '#90caf9',\n  300: '#64b5f6',\n  400: '#42a5f5',\n  500: '#2196f3',\n  600: '#1e88e5',\n  700: '#1976d2',\n  800: '#1565c0',\n  900: '#0d47a1',\n  A100: '#82b1ff',\n  A200: '#448aff',\n  A400: '#2979ff',\n  A700: '#2962ff'\n};\nexport default blue;","const lightBlue = {\n  50: '#e1f5fe',\n  100: '#b3e5fc',\n  200: '#81d4fa',\n  300: '#4fc3f7',\n  400: '#29b6f6',\n  500: '#03a9f4',\n  600: '#039be5',\n  700: '#0288d1',\n  800: '#0277bd',\n  900: '#01579b',\n  A100: '#80d8ff',\n  A200: '#40c4ff',\n  A400: '#00b0ff',\n  A700: '#0091ea'\n};\nexport default lightBlue;","const green = {\n  50: '#e8f5e9',\n  100: '#c8e6c9',\n  200: '#a5d6a7',\n  300: '#81c784',\n  400: '#66bb6a',\n  500: '#4caf50',\n  600: '#43a047',\n  700: '#388e3c',\n  800: '#2e7d32',\n  900: '#1b5e20',\n  A100: '#b9f6ca',\n  A200: '#69f0ae',\n  A400: '#00e676',\n  A700: '#00c853'\n};\nexport default green;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport _formatMuiErrorMessage from \"@mui/utils/formatMuiErrorMessage\";\nconst _excluded = [\"mode\", \"contrastThreshold\", \"tonalOffset\"];\nimport deepmerge from '@mui/utils/deepmerge';\nimport { darken, getContrastRatio, lighten } from '@mui/system/colorManipulator';\nimport common from '../colors/common';\nimport grey from '../colors/grey';\nimport purple from '../colors/purple';\nimport red from '../colors/red';\nimport orange from '../colors/orange';\nimport blue from '../colors/blue';\nimport lightBlue from '../colors/lightBlue';\nimport green from '../colors/green';\nexport const light = {\n  // The colors used to style the text.\n  text: {\n    // The most important text.\n    primary: 'rgba(0, 0, 0, 0.87)',\n    // Secondary text.\n    secondary: 'rgba(0, 0, 0, 0.6)',\n    // Disabled text have even lower visual prominence.\n    disabled: 'rgba(0, 0, 0, 0.38)'\n  },\n  // The color used to divide different elements.\n  divider: 'rgba(0, 0, 0, 0.12)',\n  // The background colors used to style the surfaces.\n  // Consistency between these values is important.\n  background: {\n    paper: common.white,\n    default: common.white\n  },\n  // The colors used to style the action elements.\n  action: {\n    // The color of an active action like an icon button.\n    active: 'rgba(0, 0, 0, 0.54)',\n    // The color of an hovered action.\n    hover: 'rgba(0, 0, 0, 0.04)',\n    hoverOpacity: 0.04,\n    // The color of a selected action.\n    selected: 'rgba(0, 0, 0, 0.08)',\n    selectedOpacity: 0.08,\n    // The color of a disabled action.\n    disabled: 'rgba(0, 0, 0, 0.26)',\n    // The background color of a disabled action.\n    disabledBackground: 'rgba(0, 0, 0, 0.12)',\n    disabledOpacity: 0.38,\n    focus: 'rgba(0, 0, 0, 0.12)',\n    focusOpacity: 0.12,\n    activatedOpacity: 0.12\n  }\n};\nexport const dark = {\n  text: {\n    primary: common.white,\n    secondary: 'rgba(255, 255, 255, 0.7)',\n    disabled: 'rgba(255, 255, 255, 0.5)',\n    icon: 'rgba(255, 255, 255, 0.5)'\n  },\n  divider: 'rgba(255, 255, 255, 0.12)',\n  background: {\n    paper: '#121212',\n    default: '#121212'\n  },\n  action: {\n    active: common.white,\n    hover: 'rgba(255, 255, 255, 0.08)',\n    hoverOpacity: 0.08,\n    selected: 'rgba(255, 255, 255, 0.16)',\n    selectedOpacity: 0.16,\n    disabled: 'rgba(255, 255, 255, 0.3)',\n    disabledBackground: 'rgba(255, 255, 255, 0.12)',\n    disabledOpacity: 0.38,\n    focus: 'rgba(255, 255, 255, 0.12)',\n    focusOpacity: 0.12,\n    activatedOpacity: 0.24\n  }\n};\nfunction addLightOrDark(intent, direction, shade, tonalOffset) {\n  const tonalOffsetLight = tonalOffset.light || tonalOffset;\n  const tonalOffsetDark = tonalOffset.dark || tonalOffset * 1.5;\n  if (!intent[direction]) {\n    if (intent.hasOwnProperty(shade)) {\n      intent[direction] = intent[shade];\n    } else if (direction === 'light') {\n      intent.light = lighten(intent.main, tonalOffsetLight);\n    } else if (direction === 'dark') {\n      intent.dark = darken(intent.main, tonalOffsetDark);\n    }\n  }\n}\nfunction getDefaultPrimary(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: blue[200],\n      light: blue[50],\n      dark: blue[400]\n    };\n  }\n  return {\n    main: blue[700],\n    light: blue[400],\n    dark: blue[800]\n  };\n}\nfunction getDefaultSecondary(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: purple[200],\n      light: purple[50],\n      dark: purple[400]\n    };\n  }\n  return {\n    main: purple[500],\n    light: purple[300],\n    dark: purple[700]\n  };\n}\nfunction getDefaultError(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: red[500],\n      light: red[300],\n      dark: red[700]\n    };\n  }\n  return {\n    main: red[700],\n    light: red[400],\n    dark: red[800]\n  };\n}\nfunction getDefaultInfo(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: lightBlue[400],\n      light: lightBlue[300],\n      dark: lightBlue[700]\n    };\n  }\n  return {\n    main: lightBlue[700],\n    light: lightBlue[500],\n    dark: lightBlue[900]\n  };\n}\nfunction getDefaultSuccess(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: green[400],\n      light: green[300],\n      dark: green[700]\n    };\n  }\n  return {\n    main: green[800],\n    light: green[500],\n    dark: green[900]\n  };\n}\nfunction getDefaultWarning(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: orange[400],\n      light: orange[300],\n      dark: orange[700]\n    };\n  }\n  return {\n    main: '#ed6c02',\n    // closest to orange[800] that pass 3:1.\n    light: orange[500],\n    dark: orange[900]\n  };\n}\nexport default function createPalette(palette) {\n  const {\n      mode = 'light',\n      contrastThreshold = 3,\n      tonalOffset = 0.2\n    } = palette,\n    other = _objectWithoutPropertiesLoose(palette, _excluded);\n  const primary = palette.primary || getDefaultPrimary(mode);\n  const secondary = palette.secondary || getDefaultSecondary(mode);\n  const error = palette.error || getDefaultError(mode);\n  const info = palette.info || getDefaultInfo(mode);\n  const success = palette.success || getDefaultSuccess(mode);\n  const warning = palette.warning || getDefaultWarning(mode);\n\n  // Use the same logic as\n  // Bootstrap: https://github.com/twbs/bootstrap/blob/1d6e3710dd447de1a200f29e8fa521f8a0908f70/scss/_functions.scss#L59\n  // and material-components-web https://github.com/material-components/material-components-web/blob/ac46b8863c4dab9fc22c4c662dc6bd1b65dd652f/packages/mdc-theme/_functions.scss#L54\n  function getContrastText(background) {\n    const contrastText = getContrastRatio(background, dark.text.primary) >= contrastThreshold ? dark.text.primary : light.text.primary;\n    if (process.env.NODE_ENV !== 'production') {\n      const contrast = getContrastRatio(background, contrastText);\n      if (contrast < 3) {\n        console.error([`MUI: The contrast ratio of ${contrast}:1 for ${contrastText} on ${background}`, 'falls below the WCAG recommended absolute minimum contrast ratio of 3:1.', 'https://www.w3.org/TR/2008/REC-WCAG20-20081211/#visual-audio-contrast-contrast'].join('\\n'));\n      }\n    }\n    return contrastText;\n  }\n  const augmentColor = ({\n    color,\n    name,\n    mainShade = 500,\n    lightShade = 300,\n    darkShade = 700\n  }) => {\n    color = _extends({}, color);\n    if (!color.main && color[mainShade]) {\n      color.main = color[mainShade];\n    }\n    if (!color.hasOwnProperty('main')) {\n      throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: The color${name ? ` (${name})` : ''} provided to augmentColor(color) is invalid.\nThe color object needs to have a \\`main\\` property or a \\`${mainShade}\\` property.` : _formatMuiErrorMessage(11, name ? ` (${name})` : '', mainShade));\n    }\n    if (typeof color.main !== 'string') {\n      throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: The color${name ? ` (${name})` : ''} provided to augmentColor(color) is invalid.\n\\`color.main\\` should be a string, but \\`${JSON.stringify(color.main)}\\` was provided instead.\n\nDid you intend to use one of the following approaches?\n\nimport { green } from \"@mui/material/colors\";\n\nconst theme1 = createTheme({ palette: {\n  primary: green,\n} });\n\nconst theme2 = createTheme({ palette: {\n  primary: { main: green[500] },\n} });` : _formatMuiErrorMessage(12, name ? ` (${name})` : '', JSON.stringify(color.main)));\n    }\n    addLightOrDark(color, 'light', lightShade, tonalOffset);\n    addLightOrDark(color, 'dark', darkShade, tonalOffset);\n    if (!color.contrastText) {\n      color.contrastText = getContrastText(color.main);\n    }\n    return color;\n  };\n  const modes = {\n    dark,\n    light\n  };\n  if (process.env.NODE_ENV !== 'production') {\n    if (!modes[mode]) {\n      console.error(`MUI: The palette mode \\`${mode}\\` is not supported.`);\n    }\n  }\n  const paletteOutput = deepmerge(_extends({\n    // A collection of common colors.\n    common: _extends({}, common),\n    // prevent mutable object.\n    // The palette mode, can be light or dark.\n    mode,\n    // The colors used to represent primary interface elements for a user.\n    primary: augmentColor({\n      color: primary,\n      name: 'primary'\n    }),\n    // The colors used to represent secondary interface elements for a user.\n    secondary: augmentColor({\n      color: secondary,\n      name: 'secondary',\n      mainShade: 'A400',\n      lightShade: 'A200',\n      darkShade: 'A700'\n    }),\n    // The colors used to represent interface elements that the user should be made aware of.\n    error: augmentColor({\n      color: error,\n      name: 'error'\n    }),\n    // The colors used to represent potentially dangerous actions or important messages.\n    warning: augmentColor({\n      color: warning,\n      name: 'warning'\n    }),\n    // The colors used to present information to the user that is neutral and not necessarily important.\n    info: augmentColor({\n      color: info,\n      name: 'info'\n    }),\n    // The colors used to indicate the successful completion of an action that user triggered.\n    success: augmentColor({\n      color: success,\n      name: 'success'\n    }),\n    // The grey colors.\n    grey,\n    // Used by `getContrastText()` to maximize the contrast between\n    // the background and the text.\n    contrastThreshold,\n    // Takes a background color and returns the text color that maximizes the contrast.\n    getContrastText,\n    // Generate a rich color object.\n    augmentColor,\n    // Used by the functions below to shift a color's luminance by approximately\n    // two indexes within its tonal palette.\n    // E.g., shift from Red 500 to Red 300 or Red 700.\n    tonalOffset\n  }, modes[mode]), other);\n  return paletteOutput;\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nconst _excluded = [\"fontFamily\", \"fontSize\", \"fontWeightLight\", \"fontWeightRegular\", \"fontWeightMedium\", \"fontWeightBold\", \"htmlFontSize\", \"allVariants\", \"pxToRem\"];\nimport deepmerge from '@mui/utils/deepmerge';\nfunction round(value) {\n  return Math.round(value * 1e5) / 1e5;\n}\nconst caseAllCaps = {\n  textTransform: 'uppercase'\n};\nconst defaultFontFamily = '\"Roboto\", \"Helvetica\", \"Arial\", sans-serif';\n\n/**\n * @see @link{https://m2.material.io/design/typography/the-type-system.html}\n * @see @link{https://m2.material.io/design/typography/understanding-typography.html}\n */\nexport default function createTypography(palette, typography) {\n  const _ref = typeof typography === 'function' ? typography(palette) : typography,\n    {\n      fontFamily = defaultFontFamily,\n      // The default font size of the Material Specification.\n      fontSize = 14,\n      // px\n      fontWeightLight = 300,\n      fontWeightRegular = 400,\n      fontWeightMedium = 500,\n      fontWeightBold = 700,\n      // Tell MUI what's the font-size on the html element.\n      // 16px is the default font-size used by browsers.\n      htmlFontSize = 16,\n      // Apply the CSS properties to all the variants.\n      allVariants,\n      pxToRem: pxToRem2\n    } = _ref,\n    other = _objectWithoutPropertiesLoose(_ref, _excluded);\n  if (process.env.NODE_ENV !== 'production') {\n    if (typeof fontSize !== 'number') {\n      console.error('MUI: `fontSize` is required to be a number.');\n    }\n    if (typeof htmlFontSize !== 'number') {\n      console.error('MUI: `htmlFontSize` is required to be a number.');\n    }\n  }\n  const coef = fontSize / 14;\n  const pxToRem = pxToRem2 || (size => `${size / htmlFontSize * coef}rem`);\n  const buildVariant = (fontWeight, size, lineHeight, letterSpacing, casing) => _extends({\n    fontFamily,\n    fontWeight,\n    fontSize: pxToRem(size),\n    // Unitless following https://meyerweb.com/eric/thoughts/2006/02/08/unitless-line-heights/\n    lineHeight\n  }, fontFamily === defaultFontFamily ? {\n    letterSpacing: `${round(letterSpacing / size)}em`\n  } : {}, casing, allVariants);\n  const variants = {\n    h1: buildVariant(fontWeightLight, 96, 1.167, -1.5),\n    h2: buildVariant(fontWeightLight, 60, 1.2, -0.5),\n    h3: buildVariant(fontWeightRegular, 48, 1.167, 0),\n    h4: buildVariant(fontWeightRegular, 34, 1.235, 0.25),\n    h5: buildVariant(fontWeightRegular, 24, 1.334, 0),\n    h6: buildVariant(fontWeightMedium, 20, 1.6, 0.15),\n    subtitle1: buildVariant(fontWeightRegular, 16, 1.75, 0.15),\n    subtitle2: buildVariant(fontWeightMedium, 14, 1.57, 0.1),\n    body1: buildVariant(fontWeightRegular, 16, 1.5, 0.15),\n    body2: buildVariant(fontWeightRegular, 14, 1.43, 0.15),\n    button: buildVariant(fontWeightMedium, 14, 1.75, 0.4, caseAllCaps),\n    caption: buildVariant(fontWeightRegular, 12, 1.66, 0.4),\n    overline: buildVariant(fontWeightRegular, 12, 2.66, 1, caseAllCaps),\n    // TODO v6: Remove handling of 'inherit' variant from the theme as it is already handled in Material UI's Typography component. Also, remember to remove the associated types.\n    inherit: {\n      fontFamily: 'inherit',\n      fontWeight: 'inherit',\n      fontSize: 'inherit',\n      lineHeight: 'inherit',\n      letterSpacing: 'inherit'\n    }\n  };\n  return deepmerge(_extends({\n    htmlFontSize,\n    pxToRem,\n    fontFamily,\n    fontSize,\n    fontWeightLight,\n    fontWeightRegular,\n    fontWeightMedium,\n    fontWeightBold\n  }, variants), other, {\n    clone: false // No need to clone deep\n  });\n}","const shadowKeyUmbraOpacity = 0.2;\nconst shadowKeyPenumbraOpacity = 0.14;\nconst shadowAmbientShadowOpacity = 0.12;\nfunction createShadow(...px) {\n  return [`${px[0]}px ${px[1]}px ${px[2]}px ${px[3]}px rgba(0,0,0,${shadowKeyUmbraOpacity})`, `${px[4]}px ${px[5]}px ${px[6]}px ${px[7]}px rgba(0,0,0,${shadowKeyPenumbraOpacity})`, `${px[8]}px ${px[9]}px ${px[10]}px ${px[11]}px rgba(0,0,0,${shadowAmbientShadowOpacity})`].join(',');\n}\n\n// Values from https://github.com/material-components/material-components-web/blob/be8747f94574669cb5e7add1a7c54fa41a89cec7/packages/mdc-elevation/_variables.scss\nconst shadows = ['none', createShadow(0, 2, 1, -1, 0, 1, 1, 0, 0, 1, 3, 0), createShadow(0, 3, 1, -2, 0, 2, 2, 0, 0, 1, 5, 0), createShadow(0, 3, 3, -2, 0, 3, 4, 0, 0, 1, 8, 0), createShadow(0, 2, 4, -1, 0, 4, 5, 0, 0, 1, 10, 0), createShadow(0, 3, 5, -1, 0, 5, 8, 0, 0, 1, 14, 0), createShadow(0, 3, 5, -1, 0, 6, 10, 0, 0, 1, 18, 0), createShadow(0, 4, 5, -2, 0, 7, 10, 1, 0, 2, 16, 1), createShadow(0, 5, 5, -3, 0, 8, 10, 1, 0, 3, 14, 2), createShadow(0, 5, 6, -3, 0, 9, 12, 1, 0, 3, 16, 2), createShadow(0, 6, 6, -3, 0, 10, 14, 1, 0, 4, 18, 3), createShadow(0, 6, 7, -4, 0, 11, 15, 1, 0, 4, 20, 3), createShadow(0, 7, 8, -4, 0, 12, 17, 2, 0, 5, 22, 4), createShadow(0, 7, 8, -4, 0, 13, 19, 2, 0, 5, 24, 4), createShadow(0, 7, 9, -4, 0, 14, 21, 2, 0, 5, 26, 4), createShadow(0, 8, 9, -5, 0, 15, 22, 2, 0, 6, 28, 5), createShadow(0, 8, 10, -5, 0, 16, 24, 2, 0, 6, 30, 5), createShadow(0, 8, 11, -5, 0, 17, 26, 2, 0, 6, 32, 5), createShadow(0, 9, 11, -5, 0, 18, 28, 2, 0, 7, 34, 6), createShadow(0, 9, 12, -6, 0, 19, 29, 2, 0, 7, 36, 6), createShadow(0, 10, 13, -6, 0, 20, 31, 3, 0, 8, 38, 7), createShadow(0, 10, 13, -6, 0, 21, 33, 3, 0, 8, 40, 7), createShadow(0, 10, 14, -6, 0, 22, 35, 3, 0, 8, 42, 7), createShadow(0, 11, 14, -7, 0, 23, 36, 3, 0, 9, 44, 8), createShadow(0, 11, 15, -7, 0, 24, 38, 3, 0, 9, 46, 8)];\nexport default shadows;","import _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nconst _excluded = [\"duration\", \"easing\", \"delay\"];\n// Follow https://material.google.com/motion/duration-easing.html#duration-easing-natural-easing-curves\n// to learn the context in which each easing should be used.\nexport const easing = {\n  // This is the most common easing curve.\n  easeInOut: 'cubic-bezier(0.4, 0, 0.2, 1)',\n  // Objects enter the screen at full velocity from off-screen and\n  // slowly decelerate to a resting point.\n  easeOut: 'cubic-bezier(0.0, 0, 0.2, 1)',\n  // Objects leave the screen at full velocity. They do not decelerate when off-screen.\n  easeIn: 'cubic-bezier(0.4, 0, 1, 1)',\n  // The sharp curve is used by objects that may return to the screen at any time.\n  sharp: 'cubic-bezier(0.4, 0, 0.6, 1)'\n};\n\n// Follow https://m2.material.io/guidelines/motion/duration-easing.html#duration-easing-common-durations\n// to learn when use what timing\nexport const duration = {\n  shortest: 150,\n  shorter: 200,\n  short: 250,\n  // most basic recommended timing\n  standard: 300,\n  // this is to be used in complex animations\n  complex: 375,\n  // recommended when something is entering screen\n  enteringScreen: 225,\n  // recommended when something is leaving screen\n  leavingScreen: 195\n};\nfunction formatMs(milliseconds) {\n  return `${Math.round(milliseconds)}ms`;\n}\nfunction getAutoHeightDuration(height) {\n  if (!height) {\n    return 0;\n  }\n  const constant = height / 36;\n\n  // https://www.wolframalpha.com/input/?i=(4+%2B+15+*+(x+%2F+36+)+**+0.25+%2B+(x+%2F+36)+%2F+5)+*+10\n  return Math.round((4 + 15 * constant ** 0.25 + constant / 5) * 10);\n}\nexport default function createTransitions(inputTransitions) {\n  const mergedEasing = _extends({}, easing, inputTransitions.easing);\n  const mergedDuration = _extends({}, duration, inputTransitions.duration);\n  const create = (props = ['all'], options = {}) => {\n    const {\n        duration: durationOption = mergedDuration.standard,\n        easing: easingOption = mergedEasing.easeInOut,\n        delay = 0\n      } = options,\n      other = _objectWithoutPropertiesLoose(options, _excluded);\n    if (process.env.NODE_ENV !== 'production') {\n      const isString = value => typeof value === 'string';\n      // IE11 support, replace with Number.isNaN\n      // eslint-disable-next-line no-restricted-globals\n      const isNumber = value => !isNaN(parseFloat(value));\n      if (!isString(props) && !Array.isArray(props)) {\n        console.error('MUI: Argument \"props\" must be a string or Array.');\n      }\n      if (!isNumber(durationOption) && !isString(durationOption)) {\n        console.error(`MUI: Argument \"duration\" must be a number or a string but found ${durationOption}.`);\n      }\n      if (!isString(easingOption)) {\n        console.error('MUI: Argument \"easing\" must be a string.');\n      }\n      if (!isNumber(delay) && !isString(delay)) {\n        console.error('MUI: Argument \"delay\" must be a number or a string.');\n      }\n      if (typeof options !== 'object') {\n        console.error(['MUI: Secong argument of transition.create must be an object.', \"Arguments should be either `create('prop1', options)` or `create(['prop1', 'prop2'], options)`\"].join('\\n'));\n      }\n      if (Object.keys(other).length !== 0) {\n        console.error(`MUI: Unrecognized argument(s) [${Object.keys(other).join(',')}].`);\n      }\n    }\n    return (Array.isArray(props) ? props : [props]).map(animatedProp => `${animatedProp} ${typeof durationOption === 'string' ? durationOption : formatMs(durationOption)} ${easingOption} ${typeof delay === 'string' ? delay : formatMs(delay)}`).join(',');\n  };\n  return _extends({\n    getAutoHeightDuration,\n    create\n  }, inputTransitions, {\n    easing: mergedEasing,\n    duration: mergedDuration\n  });\n}","// We need to centralize the zIndex definitions as they work\n// like global values in the browser.\nconst zIndex = {\n  mobileStepper: 1000,\n  fab: 1050,\n  speedDial: 1050,\n  appBar: 1100,\n  drawer: 1200,\n  modal: 1300,\n  snackbar: 1400,\n  tooltip: 1500\n};\nexport default zIndex;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport _formatMuiErrorMessage from \"@mui/utils/formatMuiErrorMessage\";\nconst _excluded = [\"breakpoints\", \"mixins\", \"spacing\", \"palette\", \"transitions\", \"typography\", \"shape\"];\nimport deepmerge from '@mui/utils/deepmerge';\nimport styleFunctionSx, { unstable_defaultSxConfig as defaultSxConfig } from '@mui/system/styleFunctionSx';\nimport systemCreateTheme from '@mui/system/createTheme';\nimport generateUtilityClass from '@mui/utils/generateUtilityClass';\nimport createMixins from './createMixins';\nimport createPalette from './createPalette';\nimport createTypography from './createTypography';\nimport shadows from './shadows';\nimport createTransitions from './createTransitions';\nimport zIndex from './zIndex';\nfunction createTheme(options = {}, ...args) {\n  const {\n      mixins: mixinsInput = {},\n      palette: paletteInput = {},\n      transitions: transitionsInput = {},\n      typography: typographyInput = {}\n    } = options,\n    other = _objectWithoutPropertiesLoose(options, _excluded);\n  if (options.vars) {\n    throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: \\`vars\\` is a private field used for CSS variables support.\nPlease use another name.` : _formatMuiErrorMessage(18));\n  }\n  const palette = createPalette(paletteInput);\n  const systemTheme = systemCreateTheme(options);\n  let muiTheme = deepmerge(systemTheme, {\n    mixins: createMixins(systemTheme.breakpoints, mixinsInput),\n    palette,\n    // Don't use [...shadows] until you've verified its transpiled code is not invoking the iterator protocol.\n    shadows: shadows.slice(),\n    typography: createTypography(palette, typographyInput),\n    transitions: createTransitions(transitionsInput),\n    zIndex: _extends({}, zIndex)\n  });\n  muiTheme = deepmerge(muiTheme, other);\n  muiTheme = args.reduce((acc, argument) => deepmerge(acc, argument), muiTheme);\n  if (process.env.NODE_ENV !== 'production') {\n    // TODO v6: Refactor to use globalStateClassesMapping from @mui/utils once `readOnly` state class is used in Rating component.\n    const stateClasses = ['active', 'checked', 'completed', 'disabled', 'error', 'expanded', 'focused', 'focusVisible', 'required', 'selected'];\n    const traverse = (node, component) => {\n      let key;\n\n      // eslint-disable-next-line guard-for-in, no-restricted-syntax\n      for (key in node) {\n        const child = node[key];\n        if (stateClasses.indexOf(key) !== -1 && Object.keys(child).length > 0) {\n          if (process.env.NODE_ENV !== 'production') {\n            const stateClass = generateUtilityClass('', key);\n            console.error([`MUI: The \\`${component}\\` component increases ` + `the CSS specificity of the \\`${key}\\` internal state.`, 'You can not override it like this: ', JSON.stringify(node, null, 2), '', `Instead, you need to use the '&.${stateClass}' syntax:`, JSON.stringify({\n              root: {\n                [`&.${stateClass}`]: child\n              }\n            }, null, 2), '', 'https://mui.com/r/state-classes-guide'].join('\\n'));\n          }\n          // Remove the style to prevent global conflicts.\n          node[key] = {};\n        }\n      }\n    };\n    Object.keys(muiTheme.components).forEach(component => {\n      const styleOverrides = muiTheme.components[component].styleOverrides;\n      if (styleOverrides && component.indexOf('Mui') === 0) {\n        traverse(styleOverrides, component);\n      }\n    });\n  }\n  muiTheme.unstable_sxConfig = _extends({}, defaultSxConfig, other == null ? void 0 : other.unstable_sxConfig);\n  muiTheme.unstable_sx = function sx(props) {\n    return styleFunctionSx({\n      sx: props,\n      theme: this\n    });\n  };\n  return muiTheme;\n}\nlet warnedOnce = false;\nexport function createMuiTheme(...args) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (!warnedOnce) {\n      warnedOnce = true;\n      console.error(['MUI: the createMuiTheme function was renamed to createTheme.', '', \"You should use `import { createTheme } from '@mui/material/styles'`\"].join('\\n'));\n    }\n  }\n  return createTheme(...args);\n}\nexport default createTheme;","'use client';\n\nimport createTheme from './createTheme';\nconst defaultTheme = createTheme();\nexport default defaultTheme;","export default '$$material';","'use client';\n\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { Global } from '@emotion/react';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nfunction isEmpty(obj) {\n  return obj === undefined || obj === null || Object.keys(obj).length === 0;\n}\nexport default function GlobalStyles(props) {\n  const {\n    styles,\n    defaultTheme = {}\n  } = props;\n  const globalStyles = typeof styles === 'function' ? themeInput => styles(isEmpty(themeInput) ? defaultTheme : themeInput) : styles;\n  return /*#__PURE__*/_jsx(Global, {\n    styles: globalStyles\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? GlobalStyles.propTypes = {\n  defaultTheme: PropTypes.object,\n  styles: PropTypes.oneOfType([PropTypes.array, PropTypes.string, PropTypes.object, PropTypes.func])\n} : void 0;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.alpha = alpha;\nexports.blend = blend;\nexports.colorChannel = void 0;\nexports.darken = darken;\nexports.decomposeColor = decomposeColor;\nexports.emphasize = emphasize;\nexports.getContrastRatio = getContrastRatio;\nexports.getLuminance = getLuminance;\nexports.hexToRgb = hexToRgb;\nexports.hslToRgb = hslToRgb;\nexports.lighten = lighten;\nexports.private_safeAlpha = private_safeAlpha;\nexports.private_safeColorChannel = void 0;\nexports.private_safeDarken = private_safeDarken;\nexports.private_safeEmphasize = private_safeEmphasize;\nexports.private_safeLighten = private_safeLighten;\nexports.recomposeColor = recomposeColor;\nexports.rgbToHex = rgbToHex;\nvar _formatMuiErrorMessage2 = _interopRequireDefault(require(\"@mui/utils/formatMuiErrorMessage\"));\nvar _clamp = _interopRequireDefault(require(\"@mui/utils/clamp\"));\n/* eslint-disable @typescript-eslint/naming-convention */\n\n/**\n * Returns a number whose value is limited to the given range.\n * @param {number} value The value to be clamped\n * @param {number} min The lower boundary of the output range\n * @param {number} max The upper boundary of the output range\n * @returns {number} A number in the range [min, max]\n */\nfunction clampWrapper(value, min = 0, max = 1) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (value < min || value > max) {\n      console.error(`MUI: The value provided ${value} is out of range [${min}, ${max}].`);\n    }\n  }\n  return (0, _clamp.default)(value, min, max);\n}\n\n/**\n * Converts a color from CSS hex format to CSS rgb format.\n * @param {string} color - Hex color, i.e. #nnn or #nnnnnn\n * @returns {string} A CSS rgb color string\n */\nfunction hexToRgb(color) {\n  color = color.slice(1);\n  const re = new RegExp(`.{1,${color.length >= 6 ? 2 : 1}}`, 'g');\n  let colors = color.match(re);\n  if (colors && colors[0].length === 1) {\n    colors = colors.map(n => n + n);\n  }\n  return colors ? `rgb${colors.length === 4 ? 'a' : ''}(${colors.map((n, index) => {\n    return index < 3 ? parseInt(n, 16) : Math.round(parseInt(n, 16) / 255 * 1000) / 1000;\n  }).join(', ')})` : '';\n}\nfunction intToHex(int) {\n  const hex = int.toString(16);\n  return hex.length === 1 ? `0${hex}` : hex;\n}\n\n/**\n * Returns an object with the type and values of a color.\n *\n * Note: Does not support rgb % values.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {object} - A MUI color object: {type: string, values: number[]}\n */\nfunction decomposeColor(color) {\n  // Idempotent\n  if (color.type) {\n    return color;\n  }\n  if (color.charAt(0) === '#') {\n    return decomposeColor(hexToRgb(color));\n  }\n  const marker = color.indexOf('(');\n  const type = color.substring(0, marker);\n  if (['rgb', 'rgba', 'hsl', 'hsla', 'color'].indexOf(type) === -1) {\n    throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: Unsupported \\`${color}\\` color.\nThe following formats are supported: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color().` : (0, _formatMuiErrorMessage2.default)(9, color));\n  }\n  let values = color.substring(marker + 1, color.length - 1);\n  let colorSpace;\n  if (type === 'color') {\n    values = values.split(' ');\n    colorSpace = values.shift();\n    if (values.length === 4 && values[3].charAt(0) === '/') {\n      values[3] = values[3].slice(1);\n    }\n    if (['srgb', 'display-p3', 'a98-rgb', 'prophoto-rgb', 'rec-2020'].indexOf(colorSpace) === -1) {\n      throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: unsupported \\`${colorSpace}\\` color space.\nThe following color spaces are supported: srgb, display-p3, a98-rgb, prophoto-rgb, rec-2020.` : (0, _formatMuiErrorMessage2.default)(10, colorSpace));\n    }\n  } else {\n    values = values.split(',');\n  }\n  values = values.map(value => parseFloat(value));\n  return {\n    type,\n    values,\n    colorSpace\n  };\n}\n\n/**\n * Returns a channel created from the input color.\n *\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {string} - The channel for the color, that can be used in rgba or hsla colors\n */\nconst colorChannel = color => {\n  const decomposedColor = decomposeColor(color);\n  return decomposedColor.values.slice(0, 3).map((val, idx) => decomposedColor.type.indexOf('hsl') !== -1 && idx !== 0 ? `${val}%` : val).join(' ');\n};\nexports.colorChannel = colorChannel;\nconst private_safeColorChannel = (color, warning) => {\n  try {\n    return colorChannel(color);\n  } catch (error) {\n    if (warning && process.env.NODE_ENV !== 'production') {\n      console.warn(warning);\n    }\n    return color;\n  }\n};\n\n/**\n * Converts a color object with type and values to a string.\n * @param {object} color - Decomposed color\n * @param {string} color.type - One of: 'rgb', 'rgba', 'hsl', 'hsla', 'color'\n * @param {array} color.values - [n,n,n] or [n,n,n,n]\n * @returns {string} A CSS color string\n */\nexports.private_safeColorChannel = private_safeColorChannel;\nfunction recomposeColor(color) {\n  const {\n    type,\n    colorSpace\n  } = color;\n  let {\n    values\n  } = color;\n  if (type.indexOf('rgb') !== -1) {\n    // Only convert the first 3 values to int (i.e. not alpha)\n    values = values.map((n, i) => i < 3 ? parseInt(n, 10) : n);\n  } else if (type.indexOf('hsl') !== -1) {\n    values[1] = `${values[1]}%`;\n    values[2] = `${values[2]}%`;\n  }\n  if (type.indexOf('color') !== -1) {\n    values = `${colorSpace} ${values.join(' ')}`;\n  } else {\n    values = `${values.join(', ')}`;\n  }\n  return `${type}(${values})`;\n}\n\n/**\n * Converts a color from CSS rgb format to CSS hex format.\n * @param {string} color - RGB color, i.e. rgb(n, n, n)\n * @returns {string} A CSS rgb color string, i.e. #nnnnnn\n */\nfunction rgbToHex(color) {\n  // Idempotent\n  if (color.indexOf('#') === 0) {\n    return color;\n  }\n  const {\n    values\n  } = decomposeColor(color);\n  return `#${values.map((n, i) => intToHex(i === 3 ? Math.round(255 * n) : n)).join('')}`;\n}\n\n/**\n * Converts a color from hsl format to rgb format.\n * @param {string} color - HSL color values\n * @returns {string} rgb color values\n */\nfunction hslToRgb(color) {\n  color = decomposeColor(color);\n  const {\n    values\n  } = color;\n  const h = values[0];\n  const s = values[1] / 100;\n  const l = values[2] / 100;\n  const a = s * Math.min(l, 1 - l);\n  const f = (n, k = (n + h / 30) % 12) => l - a * Math.max(Math.min(k - 3, 9 - k, 1), -1);\n  let type = 'rgb';\n  const rgb = [Math.round(f(0) * 255), Math.round(f(8) * 255), Math.round(f(4) * 255)];\n  if (color.type === 'hsla') {\n    type += 'a';\n    rgb.push(values[3]);\n  }\n  return recomposeColor({\n    type,\n    values: rgb\n  });\n}\n/**\n * The relative brightness of any point in a color space,\n * normalized to 0 for darkest black and 1 for lightest white.\n *\n * Formula: https://www.w3.org/TR/WCAG20-TECHS/G17.html#G17-tests\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {number} The relative brightness of the color in the range 0 - 1\n */\nfunction getLuminance(color) {\n  color = decomposeColor(color);\n  let rgb = color.type === 'hsl' || color.type === 'hsla' ? decomposeColor(hslToRgb(color)).values : color.values;\n  rgb = rgb.map(val => {\n    if (color.type !== 'color') {\n      val /= 255; // normalized\n    }\n    return val <= 0.03928 ? val / 12.92 : ((val + 0.055) / 1.055) ** 2.4;\n  });\n\n  // Truncate at 3 digits\n  return Number((0.2126 * rgb[0] + 0.7152 * rgb[1] + 0.0722 * rgb[2]).toFixed(3));\n}\n\n/**\n * Calculates the contrast ratio between two colors.\n *\n * Formula: https://www.w3.org/TR/WCAG20-TECHS/G17.html#G17-tests\n * @param {string} foreground - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla()\n * @param {string} background - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla()\n * @returns {number} A contrast ratio value in the range 0 - 21.\n */\nfunction getContrastRatio(foreground, background) {\n  const lumA = getLuminance(foreground);\n  const lumB = getLuminance(background);\n  return (Math.max(lumA, lumB) + 0.05) / (Math.min(lumA, lumB) + 0.05);\n}\n\n/**\n * Sets the absolute transparency of a color.\n * Any existing alpha values are overwritten.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} value - value to set the alpha channel to in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction alpha(color, value) {\n  color = decomposeColor(color);\n  value = clampWrapper(value);\n  if (color.type === 'rgb' || color.type === 'hsl') {\n    color.type += 'a';\n  }\n  if (color.type === 'color') {\n    color.values[3] = `/${value}`;\n  } else {\n    color.values[3] = value;\n  }\n  return recomposeColor(color);\n}\nfunction private_safeAlpha(color, value, warning) {\n  try {\n    return alpha(color, value);\n  } catch (error) {\n    if (warning && process.env.NODE_ENV !== 'production') {\n      console.warn(warning);\n    }\n    return color;\n  }\n}\n\n/**\n * Darkens a color.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction darken(color, coefficient) {\n  color = decomposeColor(color);\n  coefficient = clampWrapper(coefficient);\n  if (color.type.indexOf('hsl') !== -1) {\n    color.values[2] *= 1 - coefficient;\n  } else if (color.type.indexOf('rgb') !== -1 || color.type.indexOf('color') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] *= 1 - coefficient;\n    }\n  }\n  return recomposeColor(color);\n}\nfunction private_safeDarken(color, coefficient, warning) {\n  try {\n    return darken(color, coefficient);\n  } catch (error) {\n    if (warning && process.env.NODE_ENV !== 'production') {\n      console.warn(warning);\n    }\n    return color;\n  }\n}\n\n/**\n * Lightens a color.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction lighten(color, coefficient) {\n  color = decomposeColor(color);\n  coefficient = clampWrapper(coefficient);\n  if (color.type.indexOf('hsl') !== -1) {\n    color.values[2] += (100 - color.values[2]) * coefficient;\n  } else if (color.type.indexOf('rgb') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] += (255 - color.values[i]) * coefficient;\n    }\n  } else if (color.type.indexOf('color') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] += (1 - color.values[i]) * coefficient;\n    }\n  }\n  return recomposeColor(color);\n}\nfunction private_safeLighten(color, coefficient, warning) {\n  try {\n    return lighten(color, coefficient);\n  } catch (error) {\n    if (warning && process.env.NODE_ENV !== 'production') {\n      console.warn(warning);\n    }\n    return color;\n  }\n}\n\n/**\n * Darken or lighten a color, depending on its luminance.\n * Light colors are darkened, dark colors are lightened.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient=0.15 - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction emphasize(color, coefficient = 0.15) {\n  return getLuminance(color) > 0.5 ? darken(color, coefficient) : lighten(color, coefficient);\n}\nfunction private_safeEmphasize(color, coefficient, warning) {\n  try {\n    return emphasize(color, coefficient);\n  } catch (error) {\n    if (warning && process.env.NODE_ENV !== 'production') {\n      console.warn(warning);\n    }\n    return color;\n  }\n}\n\n/**\n * Blend a transparent overlay color with a background color, resulting in a single\n * RGB color.\n * @param {string} background - CSS color\n * @param {string} overlay - CSS color\n * @param {number} opacity - Opacity multiplier in the range 0 - 1\n * @param {number} [gamma=1.0] - Gamma correction factor. For gamma-correct blending, 2.2 is usual.\n */\nfunction blend(background, overlay, opacity, gamma = 1.0) {\n  const blendChannel = (b, o) => Math.round((b ** (1 / gamma) * (1 - opacity) + o ** (1 / gamma) * opacity) ** gamma);\n  const backgroundColor = decomposeColor(background);\n  const overlayColor = decomposeColor(overlay);\n  const rgb = [blendChannel(backgroundColor.values[0], overlayColor.values[0]), blendChannel(backgroundColor.values[1], overlayColor.values[1]), blendChannel(backgroundColor.values[2], overlayColor.values[2])];\n  return recomposeColor({\n    type: 'rgb',\n    values: rgb\n  });\n}","'use client';\n\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport resolveProps from '@mui/utils/resolveProps';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nconst PropsContext = /*#__PURE__*/React.createContext(undefined);\nfunction DefaultPropsProvider({\n  value,\n  children\n}) {\n  return /*#__PURE__*/_jsx(PropsContext.Provider, {\n    value: value,\n    children: children\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? DefaultPropsProvider.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │ To update them, edit the TypeScript types and run `pnpm proptypes`. │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * @ignore\n   */\n  children: PropTypes.node,\n  /**\n   * @ignore\n   */\n  value: PropTypes.object\n} : void 0;\nfunction getThemeProps(params) {\n  const {\n    theme,\n    name,\n    props\n  } = params;\n  if (!theme || !theme.components || !theme.components[name]) {\n    return props;\n  }\n  const config = theme.components[name];\n  if (config.defaultProps) {\n    // compatible with v5 signature\n    return resolveProps(config.defaultProps, props);\n  }\n  if (!config.styleOverrides && !config.variants) {\n    // v6 signature, no property 'defaultProps'\n    return resolveProps(config, props);\n  }\n  return props;\n}\nexport function useDefaultProps({\n  props,\n  name\n}) {\n  const ctx = React.useContext(PropsContext);\n  return getThemeProps({\n    props,\n    name,\n    theme: {\n      components: ctx\n    }\n  });\n}\nexport default DefaultPropsProvider;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nconst _excluded = [\"value\"];\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nconst RtlContext = /*#__PURE__*/React.createContext();\nfunction RtlProvider(_ref) {\n  let {\n      value\n    } = _ref,\n    props = _objectWithoutPropertiesLoose(_ref, _excluded);\n  return /*#__PURE__*/_jsx(RtlContext.Provider, _extends({\n    value: value != null ? value : true\n  }, props));\n}\nprocess.env.NODE_ENV !== \"production\" ? RtlProvider.propTypes = {\n  children: PropTypes.node,\n  value: PropTypes.bool\n} : void 0;\nexport const useRtl = () => {\n  const value = React.useContext(RtlContext);\n  return value != null ? value : false;\n};\nexport default RtlProvider;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport PropTypes from 'prop-types';\nimport deepmerge from '@mui/utils/deepmerge';\nimport merge from './merge';\n\n// The breakpoint **start** at this value.\n// For instance with the first breakpoint xs: [xs, sm[.\nexport const values = {\n  xs: 0,\n  // phone\n  sm: 600,\n  // tablet\n  md: 900,\n  // small laptop\n  lg: 1200,\n  // desktop\n  xl: 1536 // large screen\n};\nconst defaultBreakpoints = {\n  // Sorted ASC by size. That's important.\n  // It can't be configured as it's used statically for propTypes.\n  keys: ['xs', 'sm', 'md', 'lg', 'xl'],\n  up: key => `@media (min-width:${values[key]}px)`\n};\nexport function handleBreakpoints(props, propValue, styleFromPropValue) {\n  const theme = props.theme || {};\n  if (Array.isArray(propValue)) {\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    return propValue.reduce((acc, item, index) => {\n      acc[themeBreakpoints.up(themeBreakpoints.keys[index])] = styleFromPropValue(propValue[index]);\n      return acc;\n    }, {});\n  }\n  if (typeof propValue === 'object') {\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    return Object.keys(propValue).reduce((acc, breakpoint) => {\n      // key is breakpoint\n      if (Object.keys(themeBreakpoints.values || values).indexOf(breakpoint) !== -1) {\n        const mediaKey = themeBreakpoints.up(breakpoint);\n        acc[mediaKey] = styleFromPropValue(propValue[breakpoint], breakpoint);\n      } else {\n        const cssKey = breakpoint;\n        acc[cssKey] = propValue[cssKey];\n      }\n      return acc;\n    }, {});\n  }\n  const output = styleFromPropValue(propValue);\n  return output;\n}\nfunction breakpoints(styleFunction) {\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const newStyleFunction = props => {\n    const theme = props.theme || {};\n    const base = styleFunction(props);\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    const extended = themeBreakpoints.keys.reduce((acc, key) => {\n      if (props[key]) {\n        acc = acc || {};\n        acc[themeBreakpoints.up(key)] = styleFunction(_extends({\n          theme\n        }, props[key]));\n      }\n      return acc;\n    }, null);\n    return merge(base, extended);\n  };\n  newStyleFunction.propTypes = process.env.NODE_ENV !== 'production' ? _extends({}, styleFunction.propTypes, {\n    xs: PropTypes.object,\n    sm: PropTypes.object,\n    md: PropTypes.object,\n    lg: PropTypes.object,\n    xl: PropTypes.object\n  }) : {};\n  newStyleFunction.filterProps = ['xs', 'sm', 'md', 'lg', 'xl', ...styleFunction.filterProps];\n  return newStyleFunction;\n}\nexport function createEmptyBreakpointObject(breakpointsInput = {}) {\n  var _breakpointsInput$key;\n  const breakpointsInOrder = (_breakpointsInput$key = breakpointsInput.keys) == null ? void 0 : _breakpointsInput$key.reduce((acc, key) => {\n    const breakpointStyleKey = breakpointsInput.up(key);\n    acc[breakpointStyleKey] = {};\n    return acc;\n  }, {});\n  return breakpointsInOrder || {};\n}\nexport function removeUnusedBreakpoints(breakpointKeys, style) {\n  return breakpointKeys.reduce((acc, key) => {\n    const breakpointOutput = acc[key];\n    const isBreakpointUnused = !breakpointOutput || Object.keys(breakpointOutput).length === 0;\n    if (isBreakpointUnused) {\n      delete acc[key];\n    }\n    return acc;\n  }, style);\n}\nexport function mergeBreakpointsInOrder(breakpointsInput, ...styles) {\n  const emptyBreakpoints = createEmptyBreakpointObject(breakpointsInput);\n  const mergedOutput = [emptyBreakpoints, ...styles].reduce((prev, next) => deepmerge(prev, next), {});\n  return removeUnusedBreakpoints(Object.keys(emptyBreakpoints), mergedOutput);\n}\n\n// compute base for responsive values; e.g.,\n// [1,2,3] => {xs: true, sm: true, md: true}\n// {xs: 1, sm: 2, md: 3} => {xs: true, sm: true, md: true}\nexport function computeBreakpointsBase(breakpointValues, themeBreakpoints) {\n  // fixed value\n  if (typeof breakpointValues !== 'object') {\n    return {};\n  }\n  const base = {};\n  const breakpointsKeys = Object.keys(themeBreakpoints);\n  if (Array.isArray(breakpointValues)) {\n    breakpointsKeys.forEach((breakpoint, i) => {\n      if (i < breakpointValues.length) {\n        base[breakpoint] = true;\n      }\n    });\n  } else {\n    breakpointsKeys.forEach(breakpoint => {\n      if (breakpointValues[breakpoint] != null) {\n        base[breakpoint] = true;\n      }\n    });\n  }\n  return base;\n}\nexport function resolveBreakpointValues({\n  values: breakpointValues,\n  breakpoints: themeBreakpoints,\n  base: customBase\n}) {\n  const base = customBase || computeBreakpointsBase(breakpointValues, themeBreakpoints);\n  const keys = Object.keys(base);\n  if (keys.length === 0) {\n    return breakpointValues;\n  }\n  let previous;\n  return keys.reduce((acc, breakpoint, i) => {\n    if (Array.isArray(breakpointValues)) {\n      acc[breakpoint] = breakpointValues[i] != null ? breakpointValues[i] : breakpointValues[previous];\n      previous = i;\n    } else if (typeof breakpointValues === 'object') {\n      acc[breakpoint] = breakpointValues[breakpoint] != null ? breakpointValues[breakpoint] : breakpointValues[previous];\n      previous = breakpoint;\n    } else {\n      acc[breakpoint] = breakpointValues;\n    }\n    return acc;\n  }, {});\n}\nexport default breakpoints;","/**\n * A universal utility to style components with multiple color modes. Always use it from the theme object.\n * It works with:\n *  - [Basic theme](https://mui.com/material-ui/customization/dark-mode/)\n *  - [CSS theme variables](https://mui.com/material-ui/experimental-api/css-theme-variables/overview/)\n *  - Zero-runtime engine\n *\n * Tips: Use an array over object spread and place `theme.applyStyles()` last.\n *\n * ✅ [{ background: '#e5e5e5' }, theme.applyStyles('dark', { background: '#1c1c1c' })]\n *\n * 🚫 { background: '#e5e5e5', ...theme.applyStyles('dark', { background: '#1c1c1c' })}\n *\n * @example\n * 1. using with `styled`:\n * ```jsx\n *   const Component = styled('div')(({ theme }) => [\n *     { background: '#e5e5e5' },\n *     theme.applyStyles('dark', {\n *       background: '#1c1c1c',\n *       color: '#fff',\n *     }),\n *   ]);\n * ```\n *\n * @example\n * 2. using with `sx` prop:\n * ```jsx\n *   <Box sx={theme => [\n *     { background: '#e5e5e5' },\n *     theme.applyStyles('dark', {\n *        background: '#1c1c1c',\n *        color: '#fff',\n *      }),\n *     ]}\n *   />\n * ```\n *\n * @example\n * 3. theming a component:\n * ```jsx\n *   extendTheme({\n *     components: {\n *       MuiButton: {\n *         styleOverrides: {\n *           root: ({ theme }) => [\n *             { background: '#e5e5e5' },\n *             theme.applyStyles('dark', {\n *               background: '#1c1c1c',\n *               color: '#fff',\n *             }),\n *           ],\n *         },\n *       }\n *     }\n *   })\n *```\n */\nexport default function applyStyles(key, styles) {\n  // @ts-expect-error this is 'any' type\n  const theme = this;\n  if (theme.vars && typeof theme.getColorSchemeSelector === 'function') {\n    // If CssVarsProvider is used as a provider,\n    // returns '* :where([data-mui-color-scheme=\"light|dark\"]) &'\n    const selector = theme.getColorSchemeSelector(key).replace(/(\\[[^\\]]+\\])/, '*:where($1)');\n    return {\n      [selector]: styles\n    };\n  }\n  if (theme.palette.mode === key) {\n    return styles;\n  }\n  return {};\n}","import _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nconst _excluded = [\"values\", \"unit\", \"step\"];\n// Sorted ASC by size. That's important.\n// It can't be configured as it's used statically for propTypes.\nexport const breakpointKeys = ['xs', 'sm', 'md', 'lg', 'xl'];\nconst sortBreakpointsValues = values => {\n  const breakpointsAsArray = Object.keys(values).map(key => ({\n    key,\n    val: values[key]\n  })) || [];\n  // Sort in ascending order\n  breakpointsAsArray.sort((breakpoint1, breakpoint2) => breakpoint1.val - breakpoint2.val);\n  return breakpointsAsArray.reduce((acc, obj) => {\n    return _extends({}, acc, {\n      [obj.key]: obj.val\n    });\n  }, {});\n};\n\n// Keep in mind that @media is inclusive by the CSS specification.\nexport default function createBreakpoints(breakpoints) {\n  const {\n      // The breakpoint **start** at this value.\n      // For instance with the first breakpoint xs: [xs, sm).\n      values = {\n        xs: 0,\n        // phone\n        sm: 600,\n        // tablet\n        md: 900,\n        // small laptop\n        lg: 1200,\n        // desktop\n        xl: 1536 // large screen\n      },\n      unit = 'px',\n      step = 5\n    } = breakpoints,\n    other = _objectWithoutPropertiesLoose(breakpoints, _excluded);\n  const sortedValues = sortBreakpointsValues(values);\n  const keys = Object.keys(sortedValues);\n  function up(key) {\n    const value = typeof values[key] === 'number' ? values[key] : key;\n    return `@media (min-width:${value}${unit})`;\n  }\n  function down(key) {\n    const value = typeof values[key] === 'number' ? values[key] : key;\n    return `@media (max-width:${value - step / 100}${unit})`;\n  }\n  function between(start, end) {\n    const endIndex = keys.indexOf(end);\n    return `@media (min-width:${typeof values[start] === 'number' ? values[start] : start}${unit}) and ` + `(max-width:${(endIndex !== -1 && typeof values[keys[endIndex]] === 'number' ? values[keys[endIndex]] : end) - step / 100}${unit})`;\n  }\n  function only(key) {\n    if (keys.indexOf(key) + 1 < keys.length) {\n      return between(key, keys[keys.indexOf(key) + 1]);\n    }\n    return up(key);\n  }\n  function not(key) {\n    // handle first and last key separately, for better readability\n    const keyIndex = keys.indexOf(key);\n    if (keyIndex === 0) {\n      return up(keys[1]);\n    }\n    if (keyIndex === keys.length - 1) {\n      return down(keys[keyIndex]);\n    }\n    return between(key, keys[keys.indexOf(key) + 1]).replace('@media', '@media not all and');\n  }\n  return _extends({\n    keys,\n    values: sortedValues,\n    up,\n    down,\n    between,\n    only,\n    not,\n    unit\n  }, other);\n}","const shape = {\n  borderRadius: 4\n};\nexport default shape;","import { createUnarySpacing } from '../spacing';\n\n// The different signatures imply different meaning for their arguments that can't be expressed structurally.\n// We express the difference with variable names.\n\nexport default function createSpacing(spacingInput = 8) {\n  // Already transformed.\n  if (spacingInput.mui) {\n    return spacingInput;\n  }\n\n  // Material Design layouts are visually balanced. Most measurements align to an 8dp grid, which aligns both spacing and the overall layout.\n  // Smaller components, such as icons, can align to a 4dp grid.\n  // https://m2.material.io/design/layout/understanding-layout.html\n  const transform = createUnarySpacing({\n    spacing: spacingInput\n  });\n  const spacing = (...argsInput) => {\n    if (process.env.NODE_ENV !== 'production') {\n      if (!(argsInput.length <= 4)) {\n        console.error(`MUI: Too many arguments provided, expected between 0 and 4, got ${argsInput.length}`);\n      }\n    }\n    const args = argsInput.length === 0 ? [1] : argsInput;\n    return args.map(argument => {\n      const output = transform(argument);\n      return typeof output === 'number' ? `${output}px` : output;\n    }).join(' ');\n  };\n  spacing.mui = true;\n  return spacing;\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nconst _excluded = [\"breakpoints\", \"palette\", \"spacing\", \"shape\"];\nimport deepmerge from '@mui/utils/deepmerge';\nimport createBreakpoints from './createBreakpoints';\nimport shape from './shape';\nimport createSpacing from './createSpacing';\nimport styleFunctionSx from '../styleFunctionSx/styleFunctionSx';\nimport defaultSxConfig from '../styleFunctionSx/defaultSxConfig';\nimport applyStyles from './applyStyles';\nfunction createTheme(options = {}, ...args) {\n  const {\n      breakpoints: breakpointsInput = {},\n      palette: paletteInput = {},\n      spacing: spacingInput,\n      shape: shapeInput = {}\n    } = options,\n    other = _objectWithoutPropertiesLoose(options, _excluded);\n  const breakpoints = createBreakpoints(breakpointsInput);\n  const spacing = createSpacing(spacingInput);\n  let muiTheme = deepmerge({\n    breakpoints,\n    direction: 'ltr',\n    components: {},\n    // Inject component definitions.\n    palette: _extends({\n      mode: 'light'\n    }, paletteInput),\n    spacing,\n    shape: _extends({}, shape, shapeInput)\n  }, other);\n  muiTheme.applyStyles = applyStyles;\n  muiTheme = args.reduce((acc, argument) => deepmerge(acc, argument), muiTheme);\n  muiTheme.unstable_sxConfig = _extends({}, defaultSxConfig, other == null ? void 0 : other.unstable_sxConfig);\n  muiTheme.unstable_sx = function sx(props) {\n    return styleFunctionSx({\n      sx: props,\n      theme: this\n    });\n  };\n  return muiTheme;\n}\nexport default createTheme;","import deepmerge from '@mui/utils/deepmerge';\nfunction merge(acc, item) {\n  if (!item) {\n    return acc;\n  }\n  return deepmerge(acc, item, {\n    clone: false // No need to clone deep, it's way faster.\n  });\n}\nexport default merge;","export default function memoize(fn) {\n  const cache = {};\n  return arg => {\n    if (cache[arg] === undefined) {\n      cache[arg] = fn(arg);\n    }\n    return cache[arg];\n  };\n}","import responsivePropType from './responsivePropType';\nimport { handleBreakpoints } from './breakpoints';\nimport { getPath } from './style';\nimport merge from './merge';\nimport memoize from './memoize';\nconst properties = {\n  m: 'margin',\n  p: 'padding'\n};\nconst directions = {\n  t: 'Top',\n  r: 'Right',\n  b: 'Bottom',\n  l: 'Left',\n  x: ['Left', 'Right'],\n  y: ['Top', 'Bottom']\n};\nconst aliases = {\n  marginX: 'mx',\n  marginY: 'my',\n  paddingX: 'px',\n  paddingY: 'py'\n};\n\n// memoize() impact:\n// From 300,000 ops/sec\n// To 350,000 ops/sec\nconst getCssProperties = memoize(prop => {\n  // It's not a shorthand notation.\n  if (prop.length > 2) {\n    if (aliases[prop]) {\n      prop = aliases[prop];\n    } else {\n      return [prop];\n    }\n  }\n  const [a, b] = prop.split('');\n  const property = properties[a];\n  const direction = directions[b] || '';\n  return Array.isArray(direction) ? direction.map(dir => property + dir) : [property + direction];\n});\nexport const marginKeys = ['m', 'mt', 'mr', 'mb', 'ml', 'mx', 'my', 'margin', 'marginTop', 'marginRight', 'marginBottom', 'marginLeft', 'marginX', 'marginY', 'marginInline', 'marginInlineStart', 'marginInlineEnd', 'marginBlock', 'marginBlockStart', 'marginBlockEnd'];\nexport const paddingKeys = ['p', 'pt', 'pr', 'pb', 'pl', 'px', 'py', 'padding', 'paddingTop', 'paddingRight', 'paddingBottom', 'paddingLeft', 'paddingX', 'paddingY', 'paddingInline', 'paddingInlineStart', 'paddingInlineEnd', 'paddingBlock', 'paddingBlockStart', 'paddingBlockEnd'];\nconst spacingKeys = [...marginKeys, ...paddingKeys];\nexport function createUnaryUnit(theme, themeKey, defaultValue, propName) {\n  var _getPath;\n  const themeSpacing = (_getPath = getPath(theme, themeKey, false)) != null ? _getPath : defaultValue;\n  if (typeof themeSpacing === 'number') {\n    return abs => {\n      if (typeof abs === 'string') {\n        return abs;\n      }\n      if (process.env.NODE_ENV !== 'production') {\n        if (typeof abs !== 'number') {\n          console.error(`MUI: Expected ${propName} argument to be a number or a string, got ${abs}.`);\n        }\n      }\n      return themeSpacing * abs;\n    };\n  }\n  if (Array.isArray(themeSpacing)) {\n    return abs => {\n      if (typeof abs === 'string') {\n        return abs;\n      }\n      if (process.env.NODE_ENV !== 'production') {\n        if (!Number.isInteger(abs)) {\n          console.error([`MUI: The \\`theme.${themeKey}\\` array type cannot be combined with non integer values.` + `You should either use an integer value that can be used as index, or define the \\`theme.${themeKey}\\` as a number.`].join('\\n'));\n        } else if (abs > themeSpacing.length - 1) {\n          console.error([`MUI: The value provided (${abs}) overflows.`, `The supported values are: ${JSON.stringify(themeSpacing)}.`, `${abs} > ${themeSpacing.length - 1}, you need to add the missing values.`].join('\\n'));\n        }\n      }\n      return themeSpacing[abs];\n    };\n  }\n  if (typeof themeSpacing === 'function') {\n    return themeSpacing;\n  }\n  if (process.env.NODE_ENV !== 'production') {\n    console.error([`MUI: The \\`theme.${themeKey}\\` value (${themeSpacing}) is invalid.`, 'It should be a number, an array or a function.'].join('\\n'));\n  }\n  return () => undefined;\n}\nexport function createUnarySpacing(theme) {\n  return createUnaryUnit(theme, 'spacing', 8, 'spacing');\n}\nexport function getValue(transformer, propValue) {\n  if (typeof propValue === 'string' || propValue == null) {\n    return propValue;\n  }\n  const abs = Math.abs(propValue);\n  const transformed = transformer(abs);\n  if (propValue >= 0) {\n    return transformed;\n  }\n  if (typeof transformed === 'number') {\n    return -transformed;\n  }\n  return `-${transformed}`;\n}\nexport function getStyleFromPropValue(cssProperties, transformer) {\n  return propValue => cssProperties.reduce((acc, cssProperty) => {\n    acc[cssProperty] = getValue(transformer, propValue);\n    return acc;\n  }, {});\n}\nfunction resolveCssProperty(props, keys, prop, transformer) {\n  // Using a hash computation over an array iteration could be faster, but with only 28 items,\n  // it's doesn't worth the bundle size.\n  if (keys.indexOf(prop) === -1) {\n    return null;\n  }\n  const cssProperties = getCssProperties(prop);\n  const styleFromPropValue = getStyleFromPropValue(cssProperties, transformer);\n  const propValue = props[prop];\n  return handleBreakpoints(props, propValue, styleFromPropValue);\n}\nfunction style(props, keys) {\n  const transformer = createUnarySpacing(props.theme);\n  return Object.keys(props).map(prop => resolveCssProperty(props, keys, prop, transformer)).reduce(merge, {});\n}\nexport function margin(props) {\n  return style(props, marginKeys);\n}\nmargin.propTypes = process.env.NODE_ENV !== 'production' ? marginKeys.reduce((obj, key) => {\n  obj[key] = responsivePropType;\n  return obj;\n}, {}) : {};\nmargin.filterProps = marginKeys;\nexport function padding(props) {\n  return style(props, paddingKeys);\n}\npadding.propTypes = process.env.NODE_ENV !== 'production' ? paddingKeys.reduce((obj, key) => {\n  obj[key] = responsivePropType;\n  return obj;\n}, {}) : {};\npadding.filterProps = paddingKeys;\nfunction spacing(props) {\n  return style(props, spacingKeys);\n}\nspacing.propTypes = process.env.NODE_ENV !== 'production' ? spacingKeys.reduce((obj, key) => {\n  obj[key] = responsivePropType;\n  return obj;\n}, {}) : {};\nspacing.filterProps = spacingKeys;\nexport default spacing;","import capitalize from '@mui/utils/capitalize';\nimport responsivePropType from './responsivePropType';\nimport { handleBreakpoints } from './breakpoints';\nexport function getPath(obj, path, checkVars = true) {\n  if (!path || typeof path !== 'string') {\n    return null;\n  }\n\n  // Check if CSS variables are used\n  if (obj && obj.vars && checkVars) {\n    const val = `vars.${path}`.split('.').reduce((acc, item) => acc && acc[item] ? acc[item] : null, obj);\n    if (val != null) {\n      return val;\n    }\n  }\n  return path.split('.').reduce((acc, item) => {\n    if (acc && acc[item] != null) {\n      return acc[item];\n    }\n    return null;\n  }, obj);\n}\nexport function getStyleValue(themeMapping, transform, propValueFinal, userValue = propValueFinal) {\n  let value;\n  if (typeof themeMapping === 'function') {\n    value = themeMapping(propValueFinal);\n  } else if (Array.isArray(themeMapping)) {\n    value = themeMapping[propValueFinal] || userValue;\n  } else {\n    value = getPath(themeMapping, propValueFinal) || userValue;\n  }\n  if (transform) {\n    value = transform(value, userValue, themeMapping);\n  }\n  return value;\n}\nfunction style(options) {\n  const {\n    prop,\n    cssProperty = options.prop,\n    themeKey,\n    transform\n  } = options;\n\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const fn = props => {\n    if (props[prop] == null) {\n      return null;\n    }\n    const propValue = props[prop];\n    const theme = props.theme;\n    const themeMapping = getPath(theme, themeKey) || {};\n    const styleFromPropValue = propValueFinal => {\n      let value = getStyleValue(themeMapping, transform, propValueFinal);\n      if (propValueFinal === value && typeof propValueFinal === 'string') {\n        // Haven't found value\n        value = getStyleValue(themeMapping, transform, `${prop}${propValueFinal === 'default' ? '' : capitalize(propValueFinal)}`, propValueFinal);\n      }\n      if (cssProperty === false) {\n        return value;\n      }\n      return {\n        [cssProperty]: value\n      };\n    };\n    return handleBreakpoints(props, propValue, styleFromPropValue);\n  };\n  fn.propTypes = process.env.NODE_ENV !== 'production' ? {\n    [prop]: responsivePropType\n  } : {};\n  fn.filterProps = [prop];\n  return fn;\n}\nexport default style;","import merge from './merge';\nfunction compose(...styles) {\n  const handlers = styles.reduce((acc, style) => {\n    style.filterProps.forEach(prop => {\n      acc[prop] = style;\n    });\n    return acc;\n  }, {});\n\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const fn = props => {\n    return Object.keys(props).reduce((acc, prop) => {\n      if (handlers[prop]) {\n        return merge(acc, handlers[prop](props));\n      }\n      return acc;\n    }, {});\n  };\n  fn.propTypes = process.env.NODE_ENV !== 'production' ? styles.reduce((acc, style) => Object.assign(acc, style.propTypes), {}) : {};\n  fn.filterProps = styles.reduce((acc, style) => acc.concat(style.filterProps), []);\n  return fn;\n}\nexport default compose;","import responsivePropType from './responsivePropType';\nimport style from './style';\nimport compose from './compose';\nimport { createUnaryUnit, getValue } from './spacing';\nimport { handleBreakpoints } from './breakpoints';\nexport function borderTransform(value) {\n  if (typeof value !== 'number') {\n    return value;\n  }\n  return `${value}px solid`;\n}\nfunction createBorderStyle(prop, transform) {\n  return style({\n    prop,\n    themeKey: 'borders',\n    transform\n  });\n}\nexport const border = createBorderStyle('border', borderTransform);\nexport const borderTop = createBorderStyle('borderTop', borderTransform);\nexport const borderRight = createBorderStyle('borderRight', borderTransform);\nexport const borderBottom = createBorderStyle('borderBottom', borderTransform);\nexport const borderLeft = createBorderStyle('borderLeft', borderTransform);\nexport const borderColor = createBorderStyle('borderColor');\nexport const borderTopColor = createBorderStyle('borderTopColor');\nexport const borderRightColor = createBorderStyle('borderRightColor');\nexport const borderBottomColor = createBorderStyle('borderBottomColor');\nexport const borderLeftColor = createBorderStyle('borderLeftColor');\nexport const outline = createBorderStyle('outline', borderTransform);\nexport const outlineColor = createBorderStyle('outlineColor');\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nexport const borderRadius = props => {\n  if (props.borderRadius !== undefined && props.borderRadius !== null) {\n    const transformer = createUnaryUnit(props.theme, 'shape.borderRadius', 4, 'borderRadius');\n    const styleFromPropValue = propValue => ({\n      borderRadius: getValue(transformer, propValue)\n    });\n    return handleBreakpoints(props, props.borderRadius, styleFromPropValue);\n  }\n  return null;\n};\nborderRadius.propTypes = process.env.NODE_ENV !== 'production' ? {\n  borderRadius: responsivePropType\n} : {};\nborderRadius.filterProps = ['borderRadius'];\nconst borders = compose(border, borderTop, borderRight, borderBottom, borderLeft, borderColor, borderTopColor, borderRightColor, borderBottomColor, borderLeftColor, borderRadius, outline, outlineColor);\nexport default borders;","import style from './style';\nimport compose from './compose';\nimport { createUnaryUnit, getValue } from './spacing';\nimport { handleBreakpoints } from './breakpoints';\nimport responsivePropType from './responsivePropType';\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nexport const gap = props => {\n  if (props.gap !== undefined && props.gap !== null) {\n    const transformer = createUnaryUnit(props.theme, 'spacing', 8, 'gap');\n    const styleFromPropValue = propValue => ({\n      gap: getValue(transformer, propValue)\n    });\n    return handleBreakpoints(props, props.gap, styleFromPropValue);\n  }\n  return null;\n};\ngap.propTypes = process.env.NODE_ENV !== 'production' ? {\n  gap: responsivePropType\n} : {};\ngap.filterProps = ['gap'];\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nexport const columnGap = props => {\n  if (props.columnGap !== undefined && props.columnGap !== null) {\n    const transformer = createUnaryUnit(props.theme, 'spacing', 8, 'columnGap');\n    const styleFromPropValue = propValue => ({\n      columnGap: getValue(transformer, propValue)\n    });\n    return handleBreakpoints(props, props.columnGap, styleFromPropValue);\n  }\n  return null;\n};\ncolumnGap.propTypes = process.env.NODE_ENV !== 'production' ? {\n  columnGap: responsivePropType\n} : {};\ncolumnGap.filterProps = ['columnGap'];\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nexport const rowGap = props => {\n  if (props.rowGap !== undefined && props.rowGap !== null) {\n    const transformer = createUnaryUnit(props.theme, 'spacing', 8, 'rowGap');\n    const styleFromPropValue = propValue => ({\n      rowGap: getValue(transformer, propValue)\n    });\n    return handleBreakpoints(props, props.rowGap, styleFromPropValue);\n  }\n  return null;\n};\nrowGap.propTypes = process.env.NODE_ENV !== 'production' ? {\n  rowGap: responsivePropType\n} : {};\nrowGap.filterProps = ['rowGap'];\nexport const gridColumn = style({\n  prop: 'gridColumn'\n});\nexport const gridRow = style({\n  prop: 'gridRow'\n});\nexport const gridAutoFlow = style({\n  prop: 'gridAutoFlow'\n});\nexport const gridAutoColumns = style({\n  prop: 'gridAutoColumns'\n});\nexport const gridAutoRows = style({\n  prop: 'gridAutoRows'\n});\nexport const gridTemplateColumns = style({\n  prop: 'gridTemplateColumns'\n});\nexport const gridTemplateRows = style({\n  prop: 'gridTemplateRows'\n});\nexport const gridTemplateAreas = style({\n  prop: 'gridTemplateAreas'\n});\nexport const gridArea = style({\n  prop: 'gridArea'\n});\nconst grid = compose(gap, columnGap, rowGap, gridColumn, gridRow, gridAutoFlow, gridAutoColumns, gridAutoRows, gridTemplateColumns, gridTemplateRows, gridTemplateAreas, gridArea);\nexport default grid;","import style from './style';\nimport compose from './compose';\nexport function paletteTransform(value, userValue) {\n  if (userValue === 'grey') {\n    return userValue;\n  }\n  return value;\n}\nexport const color = style({\n  prop: 'color',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nexport const bgcolor = style({\n  prop: 'bgcolor',\n  cssProperty: 'backgroundColor',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nexport const backgroundColor = style({\n  prop: 'backgroundColor',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nconst palette = compose(color, bgcolor, backgroundColor);\nexport default palette;","import style from './style';\nimport compose from './compose';\nimport { handleBreakpoints, values as breakpointsValues } from './breakpoints';\nexport function sizingTransform(value) {\n  return value <= 1 && value !== 0 ? `${value * 100}%` : value;\n}\nexport const width = style({\n  prop: 'width',\n  transform: sizingTransform\n});\nexport const maxWidth = props => {\n  if (props.maxWidth !== undefined && props.maxWidth !== null) {\n    const styleFromPropValue = propValue => {\n      var _props$theme, _props$theme2;\n      const breakpoint = ((_props$theme = props.theme) == null || (_props$theme = _props$theme.breakpoints) == null || (_props$theme = _props$theme.values) == null ? void 0 : _props$theme[propValue]) || breakpointsValues[propValue];\n      if (!breakpoint) {\n        return {\n          maxWidth: sizingTransform(propValue)\n        };\n      }\n      if (((_props$theme2 = props.theme) == null || (_props$theme2 = _props$theme2.breakpoints) == null ? void 0 : _props$theme2.unit) !== 'px') {\n        return {\n          maxWidth: `${breakpoint}${props.theme.breakpoints.unit}`\n        };\n      }\n      return {\n        maxWidth: breakpoint\n      };\n    };\n    return handleBreakpoints(props, props.maxWidth, styleFromPropValue);\n  }\n  return null;\n};\nmaxWidth.filterProps = ['maxWidth'];\nexport const minWidth = style({\n  prop: 'minWidth',\n  transform: sizingTransform\n});\nexport const height = style({\n  prop: 'height',\n  transform: sizingTransform\n});\nexport const maxHeight = style({\n  prop: 'maxHeight',\n  transform: sizingTransform\n});\nexport const minHeight = style({\n  prop: 'minHeight',\n  transform: sizingTransform\n});\nexport const sizeWidth = style({\n  prop: 'size',\n  cssProperty: 'width',\n  transform: sizingTransform\n});\nexport const sizeHeight = style({\n  prop: 'size',\n  cssProperty: 'height',\n  transform: sizingTransform\n});\nexport const boxSizing = style({\n  prop: 'boxSizing'\n});\nconst sizing = compose(width, maxWidth, minWidth, height, maxHeight, minHeight, boxSizing);\nexport default sizing;","import { padding, margin } from '../spacing';\nimport { borderRadius, borderTransform } from '../borders';\nimport { gap, rowGap, columnGap } from '../cssGrid';\nimport { paletteTransform } from '../palette';\nimport { maxWidth, sizingTransform } from '../sizing';\nconst defaultSxConfig = {\n  // borders\n  border: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderTop: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderRight: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderBottom: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderLeft: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderColor: {\n    themeKey: 'palette'\n  },\n  borderTopColor: {\n    themeKey: 'palette'\n  },\n  borderRightColor: {\n    themeKey: 'palette'\n  },\n  borderBottomColor: {\n    themeKey: 'palette'\n  },\n  borderLeftColor: {\n    themeKey: 'palette'\n  },\n  outline: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  outlineColor: {\n    themeKey: 'palette'\n  },\n  borderRadius: {\n    themeKey: 'shape.borderRadius',\n    style: borderRadius\n  },\n  // palette\n  color: {\n    themeKey: 'palette',\n    transform: paletteTransform\n  },\n  bgcolor: {\n    themeKey: 'palette',\n    cssProperty: 'backgroundColor',\n    transform: paletteTransform\n  },\n  backgroundColor: {\n    themeKey: 'palette',\n    transform: paletteTransform\n  },\n  // spacing\n  p: {\n    style: padding\n  },\n  pt: {\n    style: padding\n  },\n  pr: {\n    style: padding\n  },\n  pb: {\n    style: padding\n  },\n  pl: {\n    style: padding\n  },\n  px: {\n    style: padding\n  },\n  py: {\n    style: padding\n  },\n  padding: {\n    style: padding\n  },\n  paddingTop: {\n    style: padding\n  },\n  paddingRight: {\n    style: padding\n  },\n  paddingBottom: {\n    style: padding\n  },\n  paddingLeft: {\n    style: padding\n  },\n  paddingX: {\n    style: padding\n  },\n  paddingY: {\n    style: padding\n  },\n  paddingInline: {\n    style: padding\n  },\n  paddingInlineStart: {\n    style: padding\n  },\n  paddingInlineEnd: {\n    style: padding\n  },\n  paddingBlock: {\n    style: padding\n  },\n  paddingBlockStart: {\n    style: padding\n  },\n  paddingBlockEnd: {\n    style: padding\n  },\n  m: {\n    style: margin\n  },\n  mt: {\n    style: margin\n  },\n  mr: {\n    style: margin\n  },\n  mb: {\n    style: margin\n  },\n  ml: {\n    style: margin\n  },\n  mx: {\n    style: margin\n  },\n  my: {\n    style: margin\n  },\n  margin: {\n    style: margin\n  },\n  marginTop: {\n    style: margin\n  },\n  marginRight: {\n    style: margin\n  },\n  marginBottom: {\n    style: margin\n  },\n  marginLeft: {\n    style: margin\n  },\n  marginX: {\n    style: margin\n  },\n  marginY: {\n    style: margin\n  },\n  marginInline: {\n    style: margin\n  },\n  marginInlineStart: {\n    style: margin\n  },\n  marginInlineEnd: {\n    style: margin\n  },\n  marginBlock: {\n    style: margin\n  },\n  marginBlockStart: {\n    style: margin\n  },\n  marginBlockEnd: {\n    style: margin\n  },\n  // display\n  displayPrint: {\n    cssProperty: false,\n    transform: value => ({\n      '@media print': {\n        display: value\n      }\n    })\n  },\n  display: {},\n  overflow: {},\n  textOverflow: {},\n  visibility: {},\n  whiteSpace: {},\n  // flexbox\n  flexBasis: {},\n  flexDirection: {},\n  flexWrap: {},\n  justifyContent: {},\n  alignItems: {},\n  alignContent: {},\n  order: {},\n  flex: {},\n  flexGrow: {},\n  flexShrink: {},\n  alignSelf: {},\n  justifyItems: {},\n  justifySelf: {},\n  // grid\n  gap: {\n    style: gap\n  },\n  rowGap: {\n    style: rowGap\n  },\n  columnGap: {\n    style: columnGap\n  },\n  gridColumn: {},\n  gridRow: {},\n  gridAutoFlow: {},\n  gridAutoColumns: {},\n  gridAutoRows: {},\n  gridTemplateColumns: {},\n  gridTemplateRows: {},\n  gridTemplateAreas: {},\n  gridArea: {},\n  // positions\n  position: {},\n  zIndex: {\n    themeKey: 'zIndex'\n  },\n  top: {},\n  right: {},\n  bottom: {},\n  left: {},\n  // shadows\n  boxShadow: {\n    themeKey: 'shadows'\n  },\n  // sizing\n  width: {\n    transform: sizingTransform\n  },\n  maxWidth: {\n    style: maxWidth\n  },\n  minWidth: {\n    transform: sizingTransform\n  },\n  height: {\n    transform: sizingTransform\n  },\n  maxHeight: {\n    transform: sizingTransform\n  },\n  minHeight: {\n    transform: sizingTransform\n  },\n  boxSizing: {},\n  // typography\n  fontFamily: {\n    themeKey: 'typography'\n  },\n  fontSize: {\n    themeKey: 'typography'\n  },\n  fontStyle: {\n    themeKey: 'typography'\n  },\n  fontWeight: {\n    themeKey: 'typography'\n  },\n  letterSpacing: {},\n  textTransform: {},\n  lineHeight: {},\n  textAlign: {},\n  typography: {\n    cssProperty: false,\n    themeKey: 'typography'\n  }\n};\nexport default defaultSxConfig;","import capitalize from '@mui/utils/capitalize';\nimport merge from '../merge';\nimport { getPath, getStyleValue as getValue } from '../style';\nimport { handleBreakpoints, createEmptyBreakpointObject, removeUnusedBreakpoints } from '../breakpoints';\nimport defaultSxConfig from './defaultSxConfig';\nfunction objectsHaveSameKeys(...objects) {\n  const allKeys = objects.reduce((keys, object) => keys.concat(Object.keys(object)), []);\n  const union = new Set(allKeys);\n  return objects.every(object => union.size === Object.keys(object).length);\n}\nfunction callIfFn(maybeFn, arg) {\n  return typeof maybeFn === 'function' ? maybeFn(arg) : maybeFn;\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport function unstable_createStyleFunctionSx() {\n  function getThemeValue(prop, val, theme, config) {\n    const props = {\n      [prop]: val,\n      theme\n    };\n    const options = config[prop];\n    if (!options) {\n      return {\n        [prop]: val\n      };\n    }\n    const {\n      cssProperty = prop,\n      themeKey,\n      transform,\n      style\n    } = options;\n    if (val == null) {\n      return null;\n    }\n\n    // TODO v6: remove, see https://github.com/mui/material-ui/pull/38123\n    if (themeKey === 'typography' && val === 'inherit') {\n      return {\n        [prop]: val\n      };\n    }\n    const themeMapping = getPath(theme, themeKey) || {};\n    if (style) {\n      return style(props);\n    }\n    const styleFromPropValue = propValueFinal => {\n      let value = getValue(themeMapping, transform, propValueFinal);\n      if (propValueFinal === value && typeof propValueFinal === 'string') {\n        // Haven't found value\n        value = getValue(themeMapping, transform, `${prop}${propValueFinal === 'default' ? '' : capitalize(propValueFinal)}`, propValueFinal);\n      }\n      if (cssProperty === false) {\n        return value;\n      }\n      return {\n        [cssProperty]: value\n      };\n    };\n    return handleBreakpoints(props, val, styleFromPropValue);\n  }\n  function styleFunctionSx(props) {\n    var _theme$unstable_sxCon;\n    const {\n      sx,\n      theme = {}\n    } = props || {};\n    if (!sx) {\n      return null; // Emotion & styled-components will neglect null\n    }\n    const config = (_theme$unstable_sxCon = theme.unstable_sxConfig) != null ? _theme$unstable_sxCon : defaultSxConfig;\n\n    /*\n     * Receive `sxInput` as object or callback\n     * and then recursively check keys & values to create media query object styles.\n     * (the result will be used in `styled`)\n     */\n    function traverse(sxInput) {\n      let sxObject = sxInput;\n      if (typeof sxInput === 'function') {\n        sxObject = sxInput(theme);\n      } else if (typeof sxInput !== 'object') {\n        // value\n        return sxInput;\n      }\n      if (!sxObject) {\n        return null;\n      }\n      const emptyBreakpoints = createEmptyBreakpointObject(theme.breakpoints);\n      const breakpointsKeys = Object.keys(emptyBreakpoints);\n      let css = emptyBreakpoints;\n      Object.keys(sxObject).forEach(styleKey => {\n        const value = callIfFn(sxObject[styleKey], theme);\n        if (value !== null && value !== undefined) {\n          if (typeof value === 'object') {\n            if (config[styleKey]) {\n              css = merge(css, getThemeValue(styleKey, value, theme, config));\n            } else {\n              const breakpointsValues = handleBreakpoints({\n                theme\n              }, value, x => ({\n                [styleKey]: x\n              }));\n              if (objectsHaveSameKeys(breakpointsValues, value)) {\n                css[styleKey] = styleFunctionSx({\n                  sx: value,\n                  theme\n                });\n              } else {\n                css = merge(css, breakpointsValues);\n              }\n            }\n          } else {\n            css = merge(css, getThemeValue(styleKey, value, theme, config));\n          }\n        }\n      });\n      return removeUnusedBreakpoints(breakpointsKeys, css);\n    }\n    return Array.isArray(sx) ? sx.map(traverse) : traverse(sx);\n  }\n  return styleFunctionSx;\n}\nconst styleFunctionSx = unstable_createStyleFunctionSx();\nstyleFunctionSx.filterProps = ['sx'];\nexport default styleFunctionSx;","'use client';\n\nimport createTheme from './createTheme';\nimport useThemeWithoutDefault from './useThemeWithoutDefault';\nexport const systemDefaultTheme = createTheme();\nfunction useTheme(defaultTheme = systemDefaultTheme) {\n  return useThemeWithoutDefault(defaultTheme);\n}\nexport default useTheme;","'use client';\n\nimport * as React from 'react';\nimport { ThemeContext } from '@mui/styled-engine';\nfunction isObjectEmpty(obj) {\n  return Object.keys(obj).length === 0;\n}\nfunction useTheme(defaultTheme = null) {\n  const contextTheme = React.useContext(ThemeContext);\n  return !contextTheme || isObjectEmpty(contextTheme) ? defaultTheme : contextTheme;\n}\nexport default useTheme;","import _formatMuiErrorMessage from \"@mui/utils/formatMuiErrorMessage\";\n// It should to be noted that this function isn't equivalent to `text-transform: capitalize`.\n//\n// A strict capitalization should uppercase the first letter of each word in the sentence.\n// We only handle the first word.\nexport default function capitalize(string) {\n  if (typeof string !== 'string') {\n    throw new Error(process.env.NODE_ENV !== \"production\" ? `MUI: \\`capitalize(string)\\` expects a string argument.` : _formatMuiErrorMessage(7));\n  }\n  return string.charAt(0).toUpperCase() + string.slice(1);\n}","function clamp(val, min = Number.MIN_SAFE_INTEGER, max = Number.MAX_SAFE_INTEGER) {\n  return Math.max(min, Math.min(val, max));\n}\nexport default clamp;","export { default } from './clamp';","import _extends from \"@babel/runtime/helpers/esm/extends\";\n// https://github.com/sindresorhus/is-plain-obj/blob/main/index.js\nexport function isPlainObject(item) {\n  if (typeof item !== 'object' || item === null) {\n    return false;\n  }\n  const prototype = Object.getPrototypeOf(item);\n  return (prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null) && !(Symbol.toStringTag in item) && !(Symbol.iterator in item);\n}\nfunction deepClone(source) {\n  if (!isPlainObject(source)) {\n    return source;\n  }\n  const output = {};\n  Object.keys(source).forEach(key => {\n    output[key] = deepClone(source[key]);\n  });\n  return output;\n}\nexport default function deepmerge(target, source, options = {\n  clone: true\n}) {\n  const output = options.clone ? _extends({}, target) : target;\n  if (isPlainObject(target) && isPlainObject(source)) {\n    Object.keys(source).forEach(key => {\n      if (isPlainObject(source[key]) &&\n      // Avoid prototype pollution\n      Object.prototype.hasOwnProperty.call(target, key) && isPlainObject(target[key])) {\n        // Since `output` is a clone of `target` and we have narrowed `target` in this block we can cast to the same type.\n        output[key] = deepmerge(target[key], source[key], options);\n      } else if (options.clone) {\n        output[key] = isPlainObject(source[key]) ? deepClone(source[key]) : source[key];\n      } else {\n        output[key] = source[key];\n      }\n    });\n  }\n  return output;\n}","/**\n * WARNING: Don't import this directly.\n * Use `MuiError` from `@mui/internal-babel-macros/MuiError.macro` instead.\n * @param {number} code\n */\nexport default function formatMuiErrorMessage(code) {\n  // Apply babel-plugin-transform-template-literals in loose mode\n  // loose mode is safe if we're concatenating primitives\n  // see https://babeljs.io/docs/en/babel-plugin-transform-template-literals#loose\n  /* eslint-disable prefer-template */\n  let url = 'https://mui.com/production-error/?code=' + code;\n  for (let i = 1; i < arguments.length; i += 1) {\n    // rest params over-transpile for this case\n    // eslint-disable-next-line prefer-rest-params\n    url += '&args[]=' + encodeURIComponent(arguments[i]);\n  }\n  return 'Minified MUI error #' + code + '; visit ' + url + ' for the full message.';\n  /* eslint-enable prefer-template */\n}","export { default } from './formatMuiErrorMessage';","import _extends from \"@babel/runtime/helpers/esm/extends\";\n/**\n * Add keys, values of `defaultProps` that does not exist in `props`\n * @param {object} defaultProps\n * @param {object} props\n * @returns {object} resolved props\n */\nexport default function resolveProps(defaultProps, props) {\n  const output = _extends({}, props);\n  Object.keys(defaultProps).forEach(propName => {\n    if (propName.toString().match(/^(components|slots)$/)) {\n      output[propName] = _extends({}, defaultProps[propName], output[propName]);\n    } else if (propName.toString().match(/^(componentsProps|slotProps)$/)) {\n      const defaultSlotProps = defaultProps[propName] || {};\n      const slotProps = props[propName];\n      output[propName] = {};\n      if (!slotProps || !Object.keys(slotProps)) {\n        // Reduce the iteration if the slot props is empty\n        output[propName] = defaultSlotProps;\n      } else if (!defaultSlotProps || !Object.keys(defaultSlotProps)) {\n        // Reduce the iteration if the default slot props is empty\n        output[propName] = slotProps;\n      } else {\n        output[propName] = _extends({}, slotProps);\n        Object.keys(defaultSlotProps).forEach(slotPropName => {\n          output[propName][slotPropName] = resolveProps(defaultSlotProps[slotPropName], slotProps[slotPropName]);\n        });\n      }\n    } else if (output[propName] === undefined) {\n      output[propName] = defaultProps[propName];\n    }\n  });\n  return output;\n}","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createWSOLAccountInstructions = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\n// TODO use native-mint instead\nfunction createWSOLAccountInstructions(walletAddress, amountIn, rentExemptLamports) {\n    const tempAccount = new web3_js_1.Keypair();\n    const createAccountInstruction = web3_js_1.SystemProgram.createAccount({\n        fromPubkey: walletAddress,\n        newAccountPubkey: tempAccount.publicKey,\n        lamports: amountIn.toNumber() + rentExemptLamports,\n        space: spl_token_1.AccountLayout.span,\n        programId: spl_token_1.TOKEN_PROGRAM_ID,\n    });\n    const initAccountInstruction = spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, spl_token_1.NATIVE_MINT, tempAccount.publicKey, walletAddress);\n    const closeWSOLAccountInstruction = spl_token_1.Token.createCloseAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, tempAccount.publicKey, walletAddress, walletAddress, []);\n    return {\n        address: tempAccount.publicKey,\n        instructions: [createAccountInstruction, initAccountInstruction],\n        cleanupInstructions: [closeWSOLAccountInstruction],\n        signers: [tempAccount],\n    };\n}\nexports.createWSOLAccountInstructions = createWSOLAccountInstructions;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./math\"), exports);\n__exportStar(require(\"./web3\"), exports);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DecimalUtil = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst decimal_js_1 = __importDefault(require(\"decimal.js\"));\nclass DecimalUtil {\n    static adjustDecimals(input, shift = 0) {\n        return input.div(decimal_js_1.default.pow(10, shift));\n    }\n    static fromU64(input, shift = 0) {\n        return new decimal_js_1.default(input.toString()).div(new decimal_js_1.default(10).pow(shift));\n    }\n    static fromNumber(input, shift = 0) {\n        return new decimal_js_1.default(input).div(new decimal_js_1.default(10).pow(shift));\n    }\n    static toU64(input, shift = 0) {\n        if (input.isNeg()) {\n            throw new Error(\"Negative decimal value ${input} cannot be converted to u64.\");\n        }\n        const shiftedValue = input.mul(new decimal_js_1.default(10).pow(shift));\n        const zeroDecimalValue = shiftedValue.trunc();\n        return new spl_token_1.u64(zeroDecimalValue.toString());\n    }\n}\nexports.DecimalUtil = DecimalUtil;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./decimal-util\"), exports);\n__exportStar(require(\"./math-util\"), exports);\n__exportStar(require(\"./percentage\"), exports);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MathUtil = exports.U64_MAX = exports.U128 = exports.TWO = exports.ONE = exports.ZERO = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst decimal_js_1 = __importDefault(require(\"decimal.js\"));\n/**\n * @category Math\n */\nexports.ZERO = new anchor_1.BN(0);\n/**\n * @category Math\n */\nexports.ONE = new anchor_1.BN(1);\n/**\n * @category Math\n */\nexports.TWO = new anchor_1.BN(2);\n/**\n * @category Math\n */\nexports.U128 = exports.TWO.pow(new anchor_1.BN(128));\n/**\n * @category Math\n */\nexports.U64_MAX = exports.TWO.pow(new anchor_1.BN(64)).sub(exports.ONE);\n/**\n * @category Math\n */\nclass MathUtil {\n    static toX64_BN(num) {\n        return num.mul(new anchor_1.BN(2).pow(new anchor_1.BN(64)));\n    }\n    static toX64_Decimal(num) {\n        return num.mul(decimal_js_1.default.pow(2, 64));\n    }\n    static toX64(num) {\n        return new anchor_1.BN(num.mul(decimal_js_1.default.pow(2, 64)).floor().toFixed());\n    }\n    static fromX64(num) {\n        return new decimal_js_1.default(num.toString()).mul(decimal_js_1.default.pow(2, -64));\n    }\n    static fromX64_Decimal(num) {\n        return num.mul(decimal_js_1.default.pow(2, -64));\n    }\n    static fromX64_BN(num) {\n        return num.div(new anchor_1.BN(2).pow(new anchor_1.BN(64)));\n    }\n    static shiftRightRoundUp(n) {\n        let result = n.shrn(64);\n        if (n.mod(exports.U64_MAX).gt(exports.ZERO)) {\n            result = result.add(exports.ONE);\n        }\n        return result;\n    }\n    static divRoundUp(n0, n1) {\n        const hasRemainder = !n0.mod(n1).eq(exports.ZERO);\n        if (hasRemainder) {\n            return n0.div(n1).add(new anchor_1.BN(1));\n        }\n        else {\n            return n0.div(n1);\n        }\n    }\n    static subUnderflowU128(n0, n1) {\n        return n0.add(exports.U128).sub(n1).mod(exports.U128);\n    }\n}\nexports.MathUtil = MathUtil;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Percentage = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst decimal_js_1 = __importDefault(require(\"decimal.js\"));\n/**\n * @category Math\n */\nclass Percentage {\n    constructor(numerator, denominator) {\n        this.toString = () => {\n            return `${this.numerator.toString()}/${this.denominator.toString()}`;\n        };\n        this.numerator = numerator;\n        this.denominator = denominator;\n    }\n    static fromDecimal(number) {\n        return Percentage.fromFraction(number.toDecimalPlaces(1).mul(10).toNumber(), 1000);\n    }\n    static fromFraction(numerator, denominator) {\n        const num = typeof numerator === \"number\" ? new spl_token_1.u64(numerator.toString()) : numerator;\n        const denom = typeof denominator === \"number\" ? new spl_token_1.u64(denominator.toString()) : denominator;\n        return new Percentage(num, denom);\n    }\n    toDecimal() {\n        if (this.denominator.eq(new spl_token_1.u64(0))) {\n            return new decimal_js_1.default(0);\n        }\n        return new decimal_js_1.default(this.numerator.toString()).div(new decimal_js_1.default(this.denominator.toString()));\n    }\n    add(p2) {\n        const denomGcd = this.denominator.gcd(p2.denominator);\n        const denomLcm = this.denominator.div(denomGcd).mul(p2.denominator);\n        const p1DenomAdjustment = denomLcm.div(this.denominator);\n        const p2DenomAdjustment = denomLcm.div(p2.denominator);\n        const p1NumeratorAdjusted = this.numerator.mul(p1DenomAdjustment);\n        const p2NumeratorAdjusted = p2.numerator.mul(p2DenomAdjustment);\n        const newNumerator = p1NumeratorAdjusted.add(p2NumeratorAdjusted);\n        return new Percentage(new spl_token_1.u64(newNumerator.toString()), new spl_token_1.u64(denomLcm.toString()));\n    }\n}\nexports.Percentage = Percentage;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AddressUtil = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\n/**\n * @category Util\n */\nclass AddressUtil {\n    static toPubKey(address) {\n        return (0, anchor_1.translateAddress)(address);\n    }\n    static toPubKeys(addresses) {\n        return addresses.map((address) => AddressUtil.toPubKey(address));\n    }\n    static toString(address) {\n        return AddressUtil.toPubKey(address).toBase58();\n    }\n    static toStrings(addresses) {\n        return addresses.map((address) => AddressUtil.toString(address));\n    }\n    static findProgramAddress(seeds, programId) {\n        const [publicKey, bump] = anchor_1.utils.publicKey.findProgramAddressSync(seeds, programId);\n        return { publicKey, bump };\n    }\n}\nexports.AddressUtil = AddressUtil;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.deriveATA = exports.resolveOrCreateATAs = exports.resolveOrCreateATA = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst token_instructions_1 = require(\"../helpers/token-instructions\");\nconst token_util_1 = require(\"./token-util\");\nconst types_1 = require(\"./transactions/types\");\n/**\n * IMPORTANT: wrappedSolAmountIn should only be used for input/source token that\n *            could be SOL. This is because when SOL is the output, it is the end\n *            destination, and thus does not need to be wrapped with an amount.\n *\n * @param connection Solana connection class\n * @param ownerAddress The user's public key\n * @param tokenMint Token mint address\n * @param wrappedSolAmountIn Optional. Only use for input/source token that could be SOL\n * @param payer Payer that would pay the rent for the creation of the ATAs\n * @param modeIdempotent Optional. Use CreateIdempotent instruction instead of Create instruction\n * @returns\n */\nfunction resolveOrCreateATA(connection, ownerAddress, tokenMint, getAccountRentExempt, wrappedSolAmountIn = new spl_token_1.u64(0), payer = ownerAddress, modeIdempotent = false) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const instructions = yield resolveOrCreateATAs(connection, ownerAddress, [{ tokenMint, wrappedSolAmountIn }], getAccountRentExempt, payer, modeIdempotent);\n        return instructions[0];\n    });\n}\nexports.resolveOrCreateATA = resolveOrCreateATA;\n/**\n * IMPORTANT: wrappedSolAmountIn should only be used for input/source token that\n *            could be SOL. This is because when SOL is the output, it is the end\n *            destination, and thus does not need to be wrapped with an amount.\n *\n * @param connection Solana connection class\n * @param ownerAddress The user's public key\n * @param tokenMint Token mint address\n * @param wrappedSolAmountIn Optional. Only use for input/source token that could be SOL\n * @param payer Payer that would pay the rent for the creation of the ATAs\n * @param modeIdempotent Optional. Use CreateIdempotent instruction instead of Create instruction\n * @returns\n */\nfunction resolveOrCreateATAs(connection, ownerAddress, requests, getAccountRentExempt, payer = ownerAddress, modeIdempotent = false) {\n    var _a;\n    return __awaiter(this, void 0, void 0, function* () {\n        const nonNativeMints = requests.filter(({ tokenMint }) => !tokenMint.equals(spl_token_1.NATIVE_MINT));\n        const nativeMints = requests.filter(({ tokenMint }) => tokenMint.equals(spl_token_1.NATIVE_MINT));\n        if (nativeMints.length > 1) {\n            throw new Error(\"Cannot resolve multiple WSolAccounts\");\n        }\n        let instructionMap = {};\n        if (nonNativeMints.length > 0) {\n            const nonNativeAddresses = yield Promise.all(nonNativeMints.map(({ tokenMint }) => deriveATA(ownerAddress, tokenMint)));\n            const tokenAccountInfos = yield connection.getMultipleAccountsInfo(nonNativeAddresses);\n            const tokenAccounts = tokenAccountInfos.map((tai) => token_util_1.TokenUtil.deserializeTokenAccount(tai === null || tai === void 0 ? void 0 : tai.data));\n            tokenAccounts.forEach((tokenAccount, index) => {\n                const ataAddress = nonNativeAddresses[index];\n                let resolvedInstruction;\n                if (tokenAccount) {\n                    // ATA whose owner has been changed is abnormal entity.\n                    // To prevent to send swap/withdraw/collect output to the ATA, an error should be thrown.\n                    if (!tokenAccount.owner.equals(ownerAddress)) {\n                        throw new Error(`ATA with change of ownership detected: ${ataAddress.toBase58()}`);\n                    }\n                    resolvedInstruction = Object.assign({ address: ataAddress }, types_1.EMPTY_INSTRUCTION);\n                }\n                else {\n                    const createAtaInstruction = createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, nonNativeMints[index].tokenMint, ataAddress, ownerAddress, payer, modeIdempotent);\n                    resolvedInstruction = {\n                        address: ataAddress,\n                        instructions: [createAtaInstruction],\n                        cleanupInstructions: [],\n                        signers: [],\n                    };\n                }\n                instructionMap[nonNativeMints[index].tokenMint.toBase58()] = resolvedInstruction;\n            });\n        }\n        if (nativeMints.length > 0) {\n            const accountRentExempt = yield getAccountRentExempt();\n            const wrappedSolAmountIn = ((_a = nativeMints[0]) === null || _a === void 0 ? void 0 : _a.wrappedSolAmountIn) || new spl_token_1.u64(0);\n            instructionMap[spl_token_1.NATIVE_MINT.toBase58()] = (0, token_instructions_1.createWSOLAccountInstructions)(ownerAddress, wrappedSolAmountIn, accountRentExempt);\n        }\n        // Preserve order of resolution\n        return requests.map(({ tokenMint }) => instructionMap[tokenMint.toBase58()]);\n    });\n}\nexports.resolveOrCreateATAs = resolveOrCreateATAs;\nfunction deriveATA(ownerAddress, tokenMint) {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield spl_token_1.Token.getAssociatedTokenAddress(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, ownerAddress);\n    });\n}\nexports.deriveATA = deriveATA;\nfunction createAssociatedTokenAccountInstruction(associatedTokenProgramId, tokenProgramId, mint, associatedAccount, owner, payer, modeIdempotent) {\n    if (!modeIdempotent) {\n        return spl_token_1.Token.createAssociatedTokenAccountInstruction(associatedTokenProgramId, tokenProgramId, mint, associatedAccount, owner, payer);\n    }\n    // create CreateIdempotent instruction\n    // spl-token v0.1.8 doesn't have a method for CreateIdempotent.\n    // https://github.com/solana-labs/solana-program-library/blob/master/associated-token-account/program/src/instruction.rs#L26\n    const keys = [\n        { pubkey: payer, isSigner: true, isWritable: true },\n        { pubkey: associatedAccount, isSigner: false, isWritable: true },\n        { pubkey: owner, isSigner: false, isWritable: false },\n        { pubkey: mint, isSigner: false, isWritable: false },\n        { pubkey: web3_js_1.SystemProgram.programId, isSigner: false, isWritable: false },\n        { pubkey: tokenProgramId, isSigner: false, isWritable: false },\n    ];\n    const instructionData = Buffer.from([1]);\n    return new web3_js_1.TransactionInstruction({\n        keys,\n        programId: associatedTokenProgramId,\n        data: instructionData,\n    });\n}\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./address-util\"), exports);\n__exportStar(require(\"./ata-util\"), exports);\n__exportStar(require(\"./network\"), exports);\n__exportStar(require(\"./public-key-utils\"), exports);\n__exportStar(require(\"./token-util\"), exports);\n__exportStar(require(\"./transactions\"), exports);\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getMultipleAccounts = exports.getMultipleParsedAccounts = exports.getParsedAccount = void 0;\nconst tiny_invariant_1 = __importDefault(require(\"tiny-invariant\"));\nconst address_util_1 = require(\"../address-util\");\nfunction getParsedAccount(connection, address, parser) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const value = yield connection.getAccountInfo(address_util_1.AddressUtil.toPubKey(address));\n        return parser.parse(value === null || value === void 0 ? void 0 : value.data);\n    });\n}\nexports.getParsedAccount = getParsedAccount;\nfunction getMultipleParsedAccounts(connection, addresses, parser) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (addresses.length === 0) {\n            return [];\n        }\n        const values = yield getMultipleAccounts(connection, address_util_1.AddressUtil.toPubKeys(addresses));\n        const results = values\n            .map((value) => parser.parse(value === null || value === void 0 ? void 0 : value.data))\n            .filter((value) => value !== undefined);\n        (0, tiny_invariant_1.default)(results.length === addresses.length, \"not enough results fetched\");\n        return results;\n    });\n}\nexports.getMultipleParsedAccounts = getMultipleParsedAccounts;\nfunction getMultipleAccounts(connection, addresses) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (addresses.length === 0) {\n            return [];\n        }\n        const responses = [];\n        const chunk = 100; // getMultipleAccounts has limitation of 100 accounts per request\n        for (let i = 0; i < addresses.length; i += chunk) {\n            const addressChunk = addresses.slice(i, i + chunk);\n            const res = connection.getMultipleAccountsInfo(address_util_1.AddressUtil.toPubKeys(addressChunk), connection.commitment);\n            responses.push(res);\n        }\n        const combinedResult = (yield Promise.all(responses)).flat();\n        (0, tiny_invariant_1.default)(combinedResult.length === addresses.length, \"getMultipleAccounts not enough results\");\n        return combinedResult;\n    });\n}\nexports.getMultipleAccounts = getMultipleAccounts;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./account-requests\"), exports);\n__exportStar(require(\"./parsing\"), exports);\n","\"use strict\";\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.staticImplements = exports.ParsableMintInfo = exports.ParsableTokenAccountInfo = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst token_util_1 = require(\"../token-util\");\n/**\n * @category Parsables\n */\nlet ParsableTokenAccountInfo = class ParsableTokenAccountInfo {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return token_util_1.TokenUtil.deserializeTokenAccount(data);\n        }\n        catch (e) {\n            console.error(`error while parsing TokenAccount: ${e}`);\n            return null;\n        }\n    }\n};\nParsableTokenAccountInfo = __decorate([\n    staticImplements()\n], ParsableTokenAccountInfo);\nexports.ParsableTokenAccountInfo = ParsableTokenAccountInfo;\n/**\n * @category Parsables\n */\nlet ParsableMintInfo = class ParsableMintInfo {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            if (data.byteLength !== spl_token_1.MintLayout.span) {\n                throw new Error(\"Invalid data length for MintInfo\");\n            }\n            const buffer = spl_token_1.MintLayout.decode(data);\n            const mintInfo = {\n                mintAuthority: buffer.mintAuthorityOption === 0 ? null : new web3_js_1.PublicKey(buffer.mintAuthority),\n                supply: spl_token_1.u64.fromBuffer(buffer.supply),\n                decimals: buffer.decimals,\n                isInitialized: buffer.isInitialized !== 0,\n                freezeAuthority: buffer.freezeAuthorityOption === 0 ? null : new web3_js_1.PublicKey(buffer.freezeAuthority),\n            };\n            return mintInfo;\n        }\n        catch (e) {\n            console.error(`error while parsing MintInfo: ${e}`);\n            return null;\n        }\n    }\n};\nParsableMintInfo = __decorate([\n    staticImplements()\n], ParsableMintInfo);\nexports.ParsableMintInfo = ParsableMintInfo;\n/**\n * Class decorator to define an interface with static methods\n * Reference: https://github.com/Microsoft/TypeScript/issues/13462#issuecomment-295685298\n */\nfunction staticImplements() {\n    return (constructor) => {\n        constructor;\n    };\n}\nexports.staticImplements = staticImplements;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PublicKeyUtils = void 0;\nclass PublicKeyUtils {\n    /**\n     * Check whether a string is a Base58 string.\n     * @param value\n     * @returns Whether the string is a Base58 string.\n     */\n    static isBase58(value) {\n        return /^[A-HJ-NP-Za-km-z1-9]*$/.test(value);\n    }\n    /**\n     * Order a list of public keys by bytes.\n     * @param keys a list of public keys to order\n     * @returns an ordered array of public keys\n     */\n    static orderKeys(...keys) {\n        return keys.sort(comparePublicKeys);\n    }\n}\nexports.PublicKeyUtils = PublicKeyUtils;\nfunction comparePublicKeys(key1, key2) {\n    const bytes1 = key1.toBytes();\n    const bytes2 = key2.toBytes();\n    // PublicKeys should be zero-padded 32 byte length\n    if (bytes1.byteLength !== bytes2.byteLength) {\n        return bytes1.byteLength - bytes2.byteLength;\n    }\n    for (let i = 0; i < bytes1.byteLength; i++) {\n        let byte1 = bytes1[i];\n        let byte2 = bytes2[i];\n        if (byte1 !== byte2) {\n            return byte1 - byte2;\n        }\n    }\n    return 0;\n}\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __rest = (this && this.__rest) || function (s, e) {\n    var t = {};\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n        t[p] = s[p];\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n                t[p[i]] = s[p[i]];\n        }\n    return t;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenUtil = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst tiny_invariant_1 = __importDefault(require(\"tiny-invariant\"));\nconst math_1 = require(\"../math\");\nconst web3_1 = require(\"../web3\");\n/**\n * @category Util\n */\nclass TokenUtil {\n    static isNativeMint(mint) {\n        return mint.equals(spl_token_1.NATIVE_MINT);\n    }\n    /**\n     * Create an ix to send a spl-token / native-mint to another wallet.\n     * This function will handle the associated token accounts internally for spl-token.\n     * SOL is sent directly to the user's wallet.\n     *\n     * @param connection - Connection object\n     * @param sourceWallet - PublicKey for the sender's wallet\n     * @param destinationWallet - PublicKey for the receiver's wallet\n     * @param tokenMint - Mint for the token that is being sent.\n     * @param tokenDecimals - Decimal for the token that is being sent.\n     * @param amount - Amount of token to send\n     * @param getAccountRentExempt - Fn to fetch the account rent exempt value\n     * @param payer - PublicKey for the payer that would fund the possibly new token-accounts. (must sign the txn)\n     * @returns\n     */\n    static createSendTokensToWalletInstruction(connection, sourceWallet, destinationWallet, tokenMint, tokenDecimals, amount, getAccountRentExempt, payer) {\n        return __awaiter(this, void 0, void 0, function* () {\n            (0, tiny_invariant_1.default)(!amount.eq(math_1.ZERO), \"SendToken transaction must send more than 0 tokens.\");\n            // Specifically handle SOL, which is not a spl-token.\n            if (tokenMint.equals(spl_token_1.NATIVE_MINT)) {\n                const sendSolTxn = web3_js_1.SystemProgram.transfer({\n                    fromPubkey: sourceWallet,\n                    toPubkey: destinationWallet,\n                    lamports: BigInt(amount.toString()),\n                });\n                return {\n                    instructions: [sendSolTxn],\n                    cleanupInstructions: [],\n                    signers: [],\n                };\n            }\n            const sourceTokenAccount = yield (0, web3_1.deriveATA)(sourceWallet, tokenMint);\n            const _a = yield (0, web3_1.resolveOrCreateATA)(connection, destinationWallet, tokenMint, getAccountRentExempt, amount, payer), { address: destinationTokenAccount } = _a, destinationAtaIx = __rest(_a, [\"address\"]);\n            const transferIx = spl_token_1.Token.createTransferCheckedInstruction(spl_token_1.TOKEN_PROGRAM_ID, sourceTokenAccount, tokenMint, destinationTokenAccount, sourceWallet, [], new spl_token_1.u64(amount.toString()), tokenDecimals);\n            return {\n                instructions: destinationAtaIx.instructions.concat(transferIx),\n                cleanupInstructions: destinationAtaIx.cleanupInstructions,\n                signers: destinationAtaIx.signers,\n            };\n        });\n    }\n}\nexports.TokenUtil = TokenUtil;\nTokenUtil.deserializeTokenAccount = (data) => {\n    if (!data) {\n        return null;\n    }\n    if (data.byteLength !== spl_token_1.AccountLayout.span) {\n        throw new Error(\"Invalid data length for TokenAccount\");\n    }\n    const accountInfo = spl_token_1.AccountLayout.decode(data);\n    accountInfo.mint = new web3_js_1.PublicKey(accountInfo.mint);\n    accountInfo.owner = new web3_js_1.PublicKey(accountInfo.owner);\n    accountInfo.amount = spl_token_1.u64.fromBuffer(accountInfo.amount);\n    if (accountInfo.delegateOption === 0) {\n        accountInfo.delegate = null;\n        accountInfo.delegatedAmount = new spl_token_1.u64(0);\n    }\n    else {\n        accountInfo.delegate = new web3_js_1.PublicKey(accountInfo.delegate);\n        accountInfo.delegatedAmount = spl_token_1.u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n    accountInfo.isInitialized = accountInfo.state !== 0;\n    accountInfo.isFrozen = accountInfo.state === 2;\n    if (accountInfo.isNativeOption === 1) {\n        accountInfo.rentExemptReserve = spl_token_1.u64.fromBuffer(accountInfo.isNative);\n        accountInfo.isNative = true;\n    }\n    else {\n        accountInfo.rentExemptReserve = null;\n        accountInfo.isNative = false;\n    }\n    if (accountInfo.closeAuthorityOption === 0) {\n        accountInfo.closeAuthority = null;\n    }\n    else {\n        accountInfo.closeAuthority = new web3_js_1.PublicKey(accountInfo.closeAuthority);\n    }\n    return accountInfo;\n};\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./transactions-builder\"), exports);\n__exportStar(require(\"./transactions-processor\"), exports);\n__exportStar(require(\"./types\"), exports);\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TransactionBuilder = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst transactions_processor_1 = require(\"./transactions-processor\");\n/**\n * @category Transactions Util\n */\nclass TransactionBuilder {\n    constructor(connection, wallet) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.instructions = [];\n        this.signers = [];\n    }\n    /**\n     * Append an instruction into this builder.\n     * @param instruction - An Instruction\n     * @returns Returns this transaction builder.\n     */\n    addInstruction(instruction) {\n        this.instructions.push(instruction);\n        return this;\n    }\n    /**\n     * Append a list of instructions into this builder.\n     * @param instructions - A list of Instructions\n     * @returns Returns this transaction builder.\n     */\n    addInstructions(instructions) {\n        this.instructions = this.instructions.concat(instructions);\n        return this;\n    }\n    /**\n     * Prepend a list of instructions into this builder.\n     * @param instruction - An Instruction\n     * @returns Returns this transaction builder.\n     */\n    prependInstruction(instruction) {\n        this.instructions.unshift(instruction);\n        return this;\n    }\n    /**\n     * Prepend a list of instructions into this builder.\n     * @param instructions - A list of Instructions\n     * @returns Returns this transaction builder.\n     */\n    prependInstructions(instructions) {\n        this.instructions = instructions.concat(this.instructions);\n        return this;\n    }\n    addSigner(signer) {\n        this.signers.push(signer);\n        return this;\n    }\n    isEmpty() {\n        return this.instructions.length == 0;\n    }\n    /**\n     * Compresses all instructions & signers in this builder\n     * into one single instruction\n     * @param compressPost Compress all post instructions into the instructions field\n     * @returns Instruction object containing all\n     */\n    compressIx(compressPost) {\n        let instructions = [];\n        let cleanupInstructions = [];\n        let signers = [];\n        this.instructions.forEach((curr) => {\n            instructions = instructions.concat(curr.instructions);\n            // Cleanup instructions should execute in reverse order\n            cleanupInstructions = curr.cleanupInstructions.concat(cleanupInstructions);\n            signers = signers.concat(curr.signers);\n        });\n        if (compressPost) {\n            instructions = instructions.concat(cleanupInstructions);\n            cleanupInstructions = [];\n        }\n        return {\n            instructions: [...instructions],\n            cleanupInstructions: [...cleanupInstructions],\n            signers,\n        };\n    }\n    /**\n     * Returns the size of the current transaction in bytes.\n     * @returns the size of the current transaction in bytes.\n     * @throws error if transaction is over maximum package size.\n     */\n    txnSize(options = { latestBlockhash: undefined }) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (this.isEmpty()) {\n                return 0;\n            }\n            const request = yield this.build(options);\n            return request.transaction.serialize({ requireAllSignatures: false }).length;\n        });\n    }\n    /**\n     * Constructs a transaction payload with the gathered instructions\n     * @returns a TransactionPayload object that can be excuted or agregated into other transactions\n     */\n    build(options = { latestBlockhash: undefined }) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { latestBlockhash } = options;\n            let recentBlockhash = !latestBlockhash\n                ? yield this.connection.getLatestBlockhash(\"singleGossip\")\n                : latestBlockhash;\n            const transaction = new web3_js_1.Transaction(Object.assign(Object.assign({}, recentBlockhash), { feePayer: this.wallet.publicKey }));\n            const ix = this.compressIx(true);\n            transaction.add(...ix.instructions);\n            transaction.feePayer = this.wallet.publicKey;\n            return {\n                transaction: transaction,\n                signers: ix.signers.concat(this.signers),\n            };\n        });\n    }\n    /**\n     * Constructs a transaction payload with the gathered instructions, sign it with the provider and send it out\n     * @returns the txId of the transaction\n     */\n    buildAndExecute() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const tx = yield this.build();\n            const tp = new transactions_processor_1.TransactionProcessor(this.connection, this.wallet);\n            const { execute } = yield tp.signAndConstructTransaction(tx);\n            return execute();\n        });\n    }\n    /**\n     * Send multiple transactions at once.\n     * @deprecated This method is here for legacy reasons and we prefer the use of TransactionProcessor\n     */\n    static sendAll(provider, txns, opts) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const txRequest = yield Promise.all(txns.map((txBuilder) => __awaiter(this, void 0, void 0, function* () {\n                const { transaction, signers } = yield txBuilder.build();\n                return { tx: transaction, signers };\n            })));\n            return yield provider.sendAll(txRequest, opts);\n        });\n    }\n}\nexports.TransactionBuilder = TransactionBuilder;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TransactionProcessor = void 0;\nclass TransactionProcessor {\n    constructor(connection, wallet, commitment = \"confirmed\") {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.commitment = commitment;\n    }\n    signTransaction(txRequest) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transactions, lastValidBlockHeight, blockhash } = yield this.signTransactions([\n                txRequest,\n            ]);\n            return { transaction: transactions[0], lastValidBlockHeight, blockhash };\n        });\n    }\n    signTransactions(txRequests) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { blockhash, lastValidBlockHeight } = yield this.connection.getLatestBlockhash(this.commitment);\n            const feePayer = this.wallet.publicKey;\n            const pSignedTxs = txRequests.map((txRequest) => {\n                return rewriteTransaction(txRequest, feePayer, blockhash);\n            });\n            const transactions = yield this.wallet.signAllTransactions(pSignedTxs);\n            return {\n                transactions,\n                lastValidBlockHeight,\n                blockhash,\n            };\n        });\n    }\n    sendTransaction(transaction, lastValidBlockHeight, blockhash) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const execute = this.constructSendTransactions([transaction], lastValidBlockHeight, blockhash);\n            const txs = yield execute();\n            const ex = txs[0];\n            if (ex.status === \"fulfilled\") {\n                return ex.value;\n            }\n            else {\n                throw ex.reason;\n            }\n        });\n    }\n    constructSendTransactions(transactions, lastValidBlockHeight, blockhash, parallel = true) {\n        const executeTx = (tx) => __awaiter(this, void 0, void 0, function* () {\n            const rawTxs = tx.serialize();\n            return this.connection.sendRawTransaction(rawTxs, {\n                preflightCommitment: this.commitment,\n            });\n        });\n        const confirmTx = (txId) => __awaiter(this, void 0, void 0, function* () {\n            const result = yield this.connection.confirmTransaction({\n                signature: txId,\n                lastValidBlockHeight: lastValidBlockHeight,\n                blockhash,\n            }, this.commitment);\n            if (result.value.err) {\n                throw new Error(`Transaction failed: ${JSON.stringify(result.value)}`);\n            }\n        });\n        return () => __awaiter(this, void 0, void 0, function* () {\n            if (parallel) {\n                const results = transactions.map((tx) => __awaiter(this, void 0, void 0, function* () {\n                    const txId = yield executeTx(tx);\n                    yield confirmTx(txId);\n                    return txId;\n                }));\n                return Promise.allSettled(results);\n            }\n            else {\n                const results = [];\n                for (const tx of transactions) {\n                    const txId = yield executeTx(tx);\n                    yield confirmTx(txId);\n                    results.push(txId);\n                }\n                return Promise.allSettled(results);\n            }\n        });\n    }\n    signAndConstructTransaction(txRequest) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transaction, lastValidBlockHeight, blockhash } = yield this.signTransaction(txRequest);\n            return {\n                signedTx: transaction,\n                execute: () => __awaiter(this, void 0, void 0, function* () { return this.sendTransaction(transaction, lastValidBlockHeight, blockhash); }),\n            };\n        });\n    }\n    signAndConstructTransactions(txRequests, parallel = true) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transactions, lastValidBlockHeight, blockhash } = yield this.signTransactions(txRequests);\n            const execute = this.constructSendTransactions(transactions, lastValidBlockHeight, blockhash, parallel);\n            return { signedTxs: transactions, execute };\n        });\n    }\n}\nexports.TransactionProcessor = TransactionProcessor;\nfunction rewriteTransaction(txRequest, feePayer, blockhash) {\n    var _a;\n    const signers = (_a = txRequest.signers) !== null && _a !== void 0 ? _a : [];\n    const tx = txRequest.transaction;\n    tx.feePayer = feePayer;\n    tx.recentBlockhash = blockhash;\n    signers.filter((s) => s !== undefined).forEach((keypair) => tx.partialSign(keypair));\n    return tx;\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EMPTY_INSTRUCTION = void 0;\n/**\n * @category Transactions Util\n */\nexports.EMPTY_INSTRUCTION = {\n    instructions: [],\n    cleanupInstructions: [],\n    signers: [],\n};\n","import{Buffer as t}from\"buffer\";import{PublicKey as e,Transaction as n,TransactionInstruction as r,SendTransactionError as o,NONCE_ACCOUNT_LENGTH as i,SystemProgram as s,SYSVAR_RENT_PUBKEY as a}from\"@solana/web3.js\";import*as c from\"@solana/web3.js\";export{c as web3};import u from\"bn.js\";export{default as BN}from\"bn.js\";import d from\"bs58\";import*as l from\"base64-js\";import h from\"camelcase\";import{sha256 as p}from\"js-sha256\";import*as f from\"@project-serum/borsh\";import{inflate as m}from\"pako\";import y from\"eventemitter3\";import*as g from\"assert\";var w=Object.freeze({__proto__:null,encode:function(t){return t.reduce(((t,e)=>t+e.toString(16).padStart(2,\"0\")),\"0x\")},decode:function(e){0===e.indexOf(\"0x\")&&(e=e.substr(2)),e.length%2==1&&(e=\"0\"+e);let n=e.match(/.{2}/g);return null===n?t.from([]):t.from(n.map((t=>parseInt(t,16))))}});function v(t){return new TextDecoder(\"utf-8\").decode(t)}function b(t){return(new TextEncoder).encode(t)}var A=Object.freeze({__proto__:null,decode:v,encode:b});function _(t){return d.encode(t)}var S=Object.freeze({__proto__:null,encode:_,decode:function(t){return d.decode(t)}});function E(e){return t.from(l.toByteArray(e))}var I=Object.freeze({__proto__:null,encode:function(t){return l.fromByteArray(t)},decode:E}),k=Object.freeze({__proto__:null,hex:w,utf8:A,bs58:S,base64:I});function M(t){const e=new Map;return t.errors&&t.errors.forEach((t=>{var n;let r=null!==(n=t.msg)&&void 0!==n?n:t.name;e.set(t.code,r)})),e}function x(t,...e){if(t.args.length!=e.length)throw new Error(\"Invalid argument length\");const n={};let r=0;return t.args.forEach((t=>{n[t.name]=e[r],r+=1})),n}function P(t,e={}){t.forEach((t=>{if(\"accounts\"in t)P(t.accounts,e[t.name]);else if(void 0===e[t.name])throw new Error(`Invalid arguments: ${t.name} not provided.`)}))}function L(t){return t instanceof e?t:new e(t)}class T extends TypeError{constructor(t,e){let n;const{message:r,...o}=t,{path:i}=t;super(0===i.length?r:\"At path: \"+i.join(\".\")+\" -- \"+r),this.value=void 0,this.key=void 0,this.type=void 0,this.refinement=void 0,this.path=void 0,this.branch=void 0,this.failures=void 0,Object.assign(this,o),this.name=this.constructor.name,this.failures=()=>{var r;return null!=(r=n)?r:n=[t,...e()]}}}function C(t){return\"object\"==typeof t&&null!=t}function z(t){return\"string\"==typeof t?JSON.stringify(t):\"\"+t}function B(t,e,n,r){if(!0===t)return;!1===t?t={}:\"string\"==typeof t&&(t={message:t});const{path:o,branch:i}=e,{type:s}=n,{refinement:a,message:c=\"Expected a value of type `\"+s+\"`\"+(a?\" with refinement `\"+a+\"`\":\"\")+\", but received: `\"+z(r)+\"`\"}=t;return{value:r,type:s,refinement:a,key:o[o.length-1],path:o,branch:i,...t,message:c}}function*O(t,e,n,r){var o;C(o=t)&&\"function\"==typeof o[Symbol.iterator]||(t=[t]);for(const o of t){const t=B(o,e,n,r);t&&(yield t)}}function*D(t,e,n){void 0===n&&(n={});const{path:r=[],branch:o=[t],coerce:i=!1,mask:s=!1}=n,a={path:r,branch:o};if(i&&(t=e.coercer(t,a),s&&\"type\"!==e.type&&C(e.schema)&&C(t)&&!Array.isArray(t)))for(const n in t)void 0===e.schema[n]&&delete t[n];let c=!0;for(const n of e.validator(t,a))c=!1,yield[n,void 0];for(let[n,u,d]of e.entries(t,a)){const e=D(u,d,{path:void 0===n?r:[...r,n],branch:void 0===n?o:[...o,u],coerce:i,mask:s});for(const r of e)r[0]?(c=!1,yield[r[0],void 0]):i&&(u=r[1],void 0===n?t=u:t instanceof Map?t.set(n,u):t instanceof Set?t.add(u):C(t)&&(t[n]=u))}if(c)for(const n of e.refiner(t,a))c=!1,yield[n,void 0];c&&(yield[void 0,t])}class N{constructor(t){this.TYPE=void 0,this.type=void 0,this.schema=void 0,this.coercer=void 0,this.validator=void 0,this.refiner=void 0,this.entries=void 0;const{type:e,schema:n,validator:r,refiner:o,coercer:i=(t=>t),entries:s=function*(){}}=t;this.type=e,this.schema=n,this.entries=s,this.coercer=i,this.validator=r?(t,e)=>O(r(t,e),e,this,t):()=>[],this.refiner=o?(t,e)=>O(o(t,e),e,this,t):()=>[]}assert(t){return function(t,e){const n=U(t,e);if(n[0])throw n[0]}(t,this)}create(t){return R(t,this)}is(t){return V(t,this)}mask(t){return function(t,e){const n=U(t,e,{coerce:!0,mask:!0});if(n[0])throw n[0];return n[1]}(t,this)}validate(t,e){return void 0===e&&(e={}),U(t,this,e)}}function R(t,e){const n=U(t,e,{coerce:!0});if(n[0])throw n[0];return n[1]}function V(t,e){return!U(t,e)[0]}function U(t,e,n){void 0===n&&(n={});const r=D(t,e,n),o=function(t){const{done:e,value:n}=t.next();return e?void 0:n}(r);if(o[0]){return[new T(o[0],(function*(){for(const t of r)t[0]&&(yield t[0])})),void 0]}return[void 0,o[1]]}function j(t,e){return new N({type:t,schema:null,validator:e})}function $(t){return new N({type:\"array\",schema:t,*entries(e){if(t&&Array.isArray(e))for(const[n,r]of e.entries())yield[n,r,t]},coercer:t=>Array.isArray(t)?t.slice():t,validator:t=>Array.isArray(t)||\"Expected an array value, but received: \"+z(t)})}function K(t){const e=z(t),n=typeof t;return new N({type:\"literal\",schema:\"string\"===n||\"number\"===n||\"boolean\"===n?t:null,validator:n=>n===t||\"Expected the literal `\"+e+\"`, but received: \"+z(n)})}function q(t){return new N({...t,validator:(e,n)=>null===e||t.validator(e,n),refiner:(e,n)=>null===e||t.refiner(e,n)})}function F(){return j(\"number\",(t=>\"number\"==typeof t&&!isNaN(t)||\"Expected a number, but received: \"+z(t)))}function W(t){return new N({...t,validator:(e,n)=>void 0===e||t.validator(e,n),refiner:(e,n)=>void 0===e||t.refiner(e,n)})}function G(){return j(\"string\",(t=>\"string\"==typeof t||\"Expected a string, but received: \"+z(t)))}function H(t){const e=Object.keys(t);return new N({type:\"type\",schema:t,*entries(n){if(C(n))for(const r of e)yield[r,n[r],t[r]]},validator:t=>C(t)||\"Expected an object, but received: \"+z(t)})}function J(t){const e=t.map((t=>t.type)).join(\" | \");return new N({type:\"union\",schema:null,coercer:(e,n)=>(t.find((t=>{const[n]=t.validate(e,{coerce:!0});return!n}))||Z()).coercer(e,n),validator(n,r){const o=[];for(const e of t){const[...t]=D(n,e,r),[i]=t;if(!i[0])return[];for(const[e]of t)e&&o.push(e)}return[\"Expected the value to satisfy a union of `\"+e+\"`, but received: \"+z(n),...o]}})}function Z(){return j(\"unknown\",(()=>!0))}async function X(t,e,n){if(e.length<=99)return await Q(t,e,n);{const r=function(t,e){return Array.apply(0,new Array(Math.ceil(t.length/e))).map(((n,r)=>t.slice(r*e,(r+1)*e)))}(e,99);return(await Promise.all(r.map((e=>Q(t,e,n))))).flat()}}async function Q(t,e,n){const r=null!=n?n:t.commitment;return(await t.getMultipleAccountsInfo(e,r)).map(((t,n)=>null===t?null:{publicKey:e[n],account:t}))}async function Y(t,e,n,r,i){n&&n.length>0&&e.sign(...n);const s=e._compile(),a=s.serialize(),c=e._serialize(a).toString(\"base64\"),u={encoding:\"base64\",commitment:null!=r?r:t.commitment};if(i){const t=(Array.isArray(i)?i:s.nonProgramIds()).map((t=>t.toBase58()));u.accounts={encoding:\"base64\",addresses:t}}n&&(u.sigVerify=!0);const d=[c,u],l=R(await t._rpcRequest(\"simulateTransaction\",d),rt);if(\"error\"in l){let t;if(\"data\"in l.error&&(t=l.error.data.logs,t&&Array.isArray(t))){const e=\"\\n    \",n=e+t.join(e);console.error(l.error.message,n)}throw new o(\"failed to simulate transaction: \"+l.error.message,t)}return l.result}function tt(t){return function(t,e,n){return new N({...t,coercer:(r,o)=>V(r,e)?t.coercer(n(r,o),o):t.coercer(r,o)})}(nt(t),et,(e=>\"error\"in e?e:{...e,result:R(e.result,t)}))}const et=nt(Z());function nt(t){return J([H({jsonrpc:K(\"2.0\"),id:G(),result:t}),H({jsonrpc:K(\"2.0\"),id:G(),error:H({code:Z(),message:G(),data:W(j(\"any\",(()=>!0)))})})])}const rt=(ot=H({err:q(J([H({}),G()])),logs:q($(G())),accounts:W(q($(q(H({executable:j(\"boolean\",(t=>\"boolean\"==typeof t)),owner:G(),lamports:F(),data:$(G()),rentEpoch:W(F())}))))),unitsConsumed:W(F())}),tt(H({context:H({slot:F()}),value:ot})));var ot,it=Object.freeze({__proto__:null,invoke:async function(t,e,o,i){t=L(t),i||(i=lt());const s=new n;if(s.add(new r({programId:t,keys:null!=e?e:[],data:o})),void 0===i.sendAndConfirm)throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");return await i.sendAndConfirm(s,[])},getMultipleAccounts:X,simulateTransaction:Y});class st{constructor(t,e,n){this.connection=t,this.wallet=e,this.opts=n,this.publicKey=e.publicKey}static defaultOptions(){return{preflightCommitment:\"processed\",commitment:\"processed\"}}static local(t,e){throw new Error(\"Provider local is not available on browser.\")}static env(){throw new Error(\"Provider env is not available on browser.\")}async sendAndConfirm(t,e,n){var r;void 0===n&&(n=this.opts),t.feePayer=this.wallet.publicKey,t.recentBlockhash=(await this.connection.getRecentBlockhash(n.preflightCommitment)).blockhash,t=await this.wallet.signTransaction(t),(null!=e?e:[]).forEach((e=>{t.partialSign(e)}));const i=t.serialize();try{return await ct(this.connection,i,n)}catch(e){if(e instanceof ut){const n=await this.connection.getTransaction(_(t.signature),{commitment:\"confirmed\"});if(n){const t=null===(r=n.meta)||void 0===r?void 0:r.logMessages;throw t?new o(e.message,t):e}throw e}throw e}}async sendAll(t,e){void 0===e&&(e=this.opts);const n=await this.connection.getRecentBlockhash(e.preflightCommitment);let r=t.map((t=>{var e;let r=t.tx,o=null!==(e=t.signers)&&void 0!==e?e:[];return r.feePayer=this.wallet.publicKey,r.recentBlockhash=n.blockhash,o.forEach((t=>{r.partialSign(t)})),r}));const o=await this.wallet.signAllTransactions(r),i=[];for(let t=0;t<r.length;t+=1){const n=o[t].serialize();i.push(await ct(this.connection,n,e))}return i}async simulate(t,e,n,r){t.feePayer=this.wallet.publicKey,t.recentBlockhash=(await this.connection.getLatestBlockhash(null!=n?n:this.connection.commitment)).blockhash,t=await this.wallet.signTransaction(t);const o=await Y(this.connection,t,e,n,r);if(o.value.err)throw new at(o.value);return o.value}}class at extends Error{constructor(t,e){super(e),this.simulationResponse=t}}async function ct(t,e,n){const r=n&&{skipPreflight:n.skipPreflight,preflightCommitment:n.preflightCommitment||n.commitment},o=await t.sendRawTransaction(e,r),i=(await t.confirmTransaction(o,n&&n.commitment)).value;if(i.err)throw new ut(`Raw transaction ${o} failed (${JSON.stringify(i)})`);return o}class ut extends Error{constructor(t){super(t)}}function dt(t){ht=t}function lt(){return null===ht?st.local():ht}let ht=null;const pt=new Set([\"anchor-deprecated-state\",\"debug-logs\"]),ft=new Map;function mt(t){return void 0!==ft.get(t)}var yt=Object.freeze({__proto__:null,set:function(t){if(!pt.has(t))throw new Error(\"Invalid feature\");ft.set(t,!0)},isSet:mt});class gt extends Error{constructor(t){super(t),this.name=\"IdlError\"}}class wt{constructor(t){this.stack=t}static parse(t){var n;const r=/^Program (\\w*) invoke/,o=/^Program \\w* success/,i=[];for(let s=0;s<t.length;s++){if(o.exec(t[s])){i.pop();continue}const a=null===(n=r.exec(t[s]))||void 0===n?void 0:n[1];a&&i.push(new e(a))}return new wt(i)}}class vt extends Error{constructor(t,e,n,r,o,i){super(n.join(\"\\n\").replace(\"Program log: \",\"\")),this.errorLogs=n,this.logs=r,this.error={errorCode:t,errorMessage:e,comparedValues:i,origin:o},this._programErrorStack=wt.parse(r)}static parse(t){if(!t)return null;const n=t.findIndex((t=>t.startsWith(\"Program log: AnchorError\")));if(-1===n)return null;const r=t[n],o=[r];let i;if(n+1<t.length)if(\"Program log: Left:\"===t[n+1]){const r=/^Program log: (.*)$/,s=r.exec(t[n+2])[1],a=r.exec(t[n+4])[1];i=[new e(s),new e(a)],o.push(...t.slice(n+1,n+5))}else if(t[n+1].startsWith(\"Program log: Left:\")){const e=/^Program log: (Left|Right): (.*)$/,r=e.exec(t[n+1])[2],s=e.exec(t[n+2])[2];o.push(...t.slice(n+1,n+3)),i=[r,s]}const s=/^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r),a=/^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r),c=/^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r);if(s){const[e,n,r]=s.slice(1,4),a={code:e,number:parseInt(n)};return new vt(a,r,o,t,void 0,i)}if(a){const[e,n,r,s,c]=a.slice(1,6),u={code:r,number:parseInt(s)},d={file:e,line:parseInt(n)};return new vt(u,c,o,t,d,i)}if(c){const[e,n,r,s]=c.slice(1,5),a=e,u={code:n,number:parseInt(r)};return new vt(u,s,o,t,a,i)}return null}get program(){return this._programErrorStack.stack[this._programErrorStack.stack.length-1]}get programErrorStack(){return this._programErrorStack.stack}toString(){return this.message}}class bt extends Error{constructor(t,e,n){super(),this.code=t,this.msg=e,this.logs=n,n&&(this._programErrorStack=wt.parse(n))}static parse(t,e){const n=t.toString();let r,o;if(n.includes(\"custom program error:\")){let t=n.split(\"custom program error: \");if(2!==t.length)return null;r=t[1]}else{const t=n.match(/\"Custom\":([0-9]+)}/g);if(!t||t.length>1)return null;r=t[0].match(/([0-9]+)/g)[0]}try{o=parseInt(r)}catch(t){return null}let i=e.get(o);return void 0!==i?new bt(o,i,t.logs):(i=St.get(o),void 0!==i?new bt(o,i,t.logs):null)}get program(){var t;return null===(t=this._programErrorStack)||void 0===t?void 0:t.stack[this._programErrorStack.stack.length-1]}get programErrorStack(){var t;return null===(t=this._programErrorStack)||void 0===t?void 0:t.stack}toString(){return this.msg}}function At(t,e){mt(\"debug-logs\")&&console.log(\"Translating error:\",t);const n=vt.parse(t.logs);if(n)return n;const r=bt.parse(t,e);if(r)return r;if(t.logs){const e={get:function(e,n){return\"programErrorStack\"===n?e.programErrorStack.stack:\"program\"===n?e.programErrorStack.stack[t.programErrorStack.stack.length-1]:Reflect.get(...arguments)}};return t.programErrorStack=wt.parse(t.logs),new Proxy(t,e)}return t}const _t={InstructionMissing:100,InstructionFallbackNotFound:101,InstructionDidNotDeserialize:102,InstructionDidNotSerialize:103,IdlInstructionStub:1e3,IdlInstructionInvalidProgram:1001,ConstraintMut:2e3,ConstraintHasOne:2001,ConstraintSigner:2002,ConstraintRaw:2003,ConstraintOwner:2004,ConstraintRentExempt:2005,ConstraintSeeds:2006,ConstraintExecutable:2007,ConstraintState:2008,ConstraintAssociated:2009,ConstraintAssociatedInit:2010,ConstraintClose:2011,ConstraintAddress:2012,ConstraintZero:2013,ConstraintTokenMint:2014,ConstraintTokenOwner:2015,ConstraintMintMintAuthority:2016,ConstraintMintFreezeAuthority:2017,ConstraintMintDecimals:2018,ConstraintSpace:2019,RequireViolated:2500,RequireEqViolated:2501,RequireKeysEqViolated:2502,RequireNeqViolated:2503,RequireKeysNeqViolated:2504,RequireGtViolated:2505,RequireGteViolated:2506,AccountDiscriminatorAlreadySet:3e3,AccountDiscriminatorNotFound:3001,AccountDiscriminatorMismatch:3002,AccountDidNotDeserialize:3003,AccountDidNotSerialize:3004,AccountNotEnoughKeys:3005,AccountNotMutable:3006,AccountOwnedByWrongProgram:3007,InvalidProgramId:3008,InvalidProgramExecutable:3009,AccountNotSigner:3010,AccountNotSystemOwned:3011,AccountNotInitialized:3012,AccountNotProgramData:3013,AccountNotAssociatedTokenAccount:3014,AccountSysvarMismatch:3015,AccountReallocExceedsLimit:3016,AccountDuplicateReallocs:3017,StateInvalidAddress:4e3,DeclaredProgramIdMismatch:4100,Deprecated:5e3},St=new Map([[_t.InstructionMissing,\"8 byte instruction identifier not provided\"],[_t.InstructionFallbackNotFound,\"Fallback functions are not supported\"],[_t.InstructionDidNotDeserialize,\"The program could not deserialize the given instruction\"],[_t.InstructionDidNotSerialize,\"The program could not serialize the given instruction\"],[_t.IdlInstructionStub,\"The program was compiled without idl instructions\"],[_t.IdlInstructionInvalidProgram,\"The transaction was given an invalid program for the IDL instruction\"],[_t.ConstraintMut,\"A mut constraint was violated\"],[_t.ConstraintHasOne,\"A has_one constraint was violated\"],[_t.ConstraintSigner,\"A signer constraint was violated\"],[_t.ConstraintRaw,\"A raw constraint was violated\"],[_t.ConstraintOwner,\"An owner constraint was violated\"],[_t.ConstraintRentExempt,\"A rent exemption constraint was violated\"],[_t.ConstraintSeeds,\"A seeds constraint was violated\"],[_t.ConstraintExecutable,\"An executable constraint was violated\"],[_t.ConstraintState,\"A state constraint was violated\"],[_t.ConstraintAssociated,\"An associated constraint was violated\"],[_t.ConstraintAssociatedInit,\"An associated init constraint was violated\"],[_t.ConstraintClose,\"A close constraint was violated\"],[_t.ConstraintAddress,\"An address constraint was violated\"],[_t.ConstraintZero,\"Expected zero account discriminant\"],[_t.ConstraintTokenMint,\"A token mint constraint was violated\"],[_t.ConstraintTokenOwner,\"A token owner constraint was violated\"],[_t.ConstraintMintMintAuthority,\"A mint mint authority constraint was violated\"],[_t.ConstraintMintFreezeAuthority,\"A mint freeze authority constraint was violated\"],[_t.ConstraintMintDecimals,\"A mint decimals constraint was violated\"],[_t.ConstraintSpace,\"A space constraint was violated\"],[_t.RequireViolated,\"A require expression was violated\"],[_t.RequireEqViolated,\"A require_eq expression was violated\"],[_t.RequireKeysEqViolated,\"A require_keys_eq expression was violated\"],[_t.RequireNeqViolated,\"A require_neq expression was violated\"],[_t.RequireKeysNeqViolated,\"A require_keys_neq expression was violated\"],[_t.RequireGtViolated,\"A require_gt expression was violated\"],[_t.RequireGteViolated,\"A require_gte expression was violated\"],[_t.AccountDiscriminatorAlreadySet,\"The account discriminator was already set on this account\"],[_t.AccountDiscriminatorNotFound,\"No 8 byte discriminator was found on the account\"],[_t.AccountDiscriminatorMismatch,\"8 byte discriminator did not match what was expected\"],[_t.AccountDidNotDeserialize,\"Failed to deserialize the account\"],[_t.AccountDidNotSerialize,\"Failed to serialize the account\"],[_t.AccountNotEnoughKeys,\"Not enough account keys given to the instruction\"],[_t.AccountNotMutable,\"The given account is not mutable\"],[_t.AccountOwnedByWrongProgram,\"The given account is owned by a different program than expected\"],[_t.InvalidProgramId,\"Program ID was not as expected\"],[_t.InvalidProgramExecutable,\"Program account is not executable\"],[_t.AccountNotSigner,\"The given account did not sign\"],[_t.AccountNotSystemOwned,\"The given account is not owned by the system program\"],[_t.AccountNotInitialized,\"The program expected this account to be already initialized\"],[_t.AccountNotProgramData,\"The given account is not a program data account\"],[_t.AccountNotAssociatedTokenAccount,\"The given account is not the associated token account\"],[_t.AccountSysvarMismatch,\"The given public key does not match the required sysvar\"],[_t.AccountReallocExceedsLimit,\"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\"],[_t.AccountDuplicateReallocs,\"The account was duplicated for more than one reallocation\"],[_t.StateInvalidAddress,\"The given state account does not have the correct address\"],[_t.DeclaredProgramIdMismatch,\"The declared program id does not match the actual program id\"],[_t.Deprecated,\"The API being used is deprecated and should no longer be used\"]]);\n/*! *****************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\nvar Et=function(){return Et=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var o in e=arguments[n])Object.prototype.hasOwnProperty.call(e,o)&&(t[o]=e[o]);return t},Et.apply(this,arguments)};function It(t){return t.toLowerCase()}var kt=[/([a-z0-9])([A-Z])/g,/([A-Z])([A-Z][a-z])/g],Mt=/[^A-Z0-9]+/gi;function xt(t,e,n){return e instanceof RegExp?t.replace(e,n):e.reduce((function(t,e){return t.replace(e,n)}),t)}function Pt(t,e){return void 0===e&&(e={}),function(t,e){void 0===e&&(e={});for(var n=e.splitRegexp,r=void 0===n?kt:n,o=e.stripRegexp,i=void 0===o?Mt:o,s=e.transform,a=void 0===s?It:s,c=e.delimiter,u=void 0===c?\" \":c,d=xt(xt(t,r,\"$1\\0$2\"),i,\"\\0\"),l=0,h=d.length;\"\\0\"===d.charAt(l);)l++;for(;\"\\0\"===d.charAt(h-1);)h--;return d.slice(l,h).split(\"\\0\").map(a).join(u)}(t,Et({delimiter:\".\"},e))}class Lt{static fieldLayout(t,e){const n=void 0!==t.name?h(t.name):void 0;switch(t.type){case\"bool\":return f.bool(n);case\"u8\":return f.u8(n);case\"i8\":return f.i8(n);case\"u16\":return f.u16(n);case\"i16\":return f.i16(n);case\"u32\":return f.u32(n);case\"i32\":return f.i32(n);case\"f32\":return f.f32(n);case\"u64\":return f.u64(n);case\"i64\":return f.i64(n);case\"f64\":return f.f64(n);case\"u128\":return f.u128(n);case\"i128\":return f.i128(n);case\"bytes\":return f.vecU8(n);case\"string\":return f.str(n);case\"publicKey\":return f.publicKey(n);default:if(\"vec\"in t.type)return f.vec(Lt.fieldLayout({name:void 0,type:t.type.vec},e),n);if(\"option\"in t.type)return f.option(Lt.fieldLayout({name:void 0,type:t.type.option},e),n);if(\"defined\"in t.type){const r=t.type.defined;if(void 0===e)throw new gt(\"User defined types not provided\");const o=e.filter((t=>t.name===r));if(1!==o.length)throw new gt(`Type not found: ${JSON.stringify(t)}`);return Lt.typeDefLayout(o[0],e,n)}if(\"array\"in t.type){let r=t.type.array[0],o=t.type.array[1],i=Lt.fieldLayout({name:void 0,type:r},e);return f.array(i,o,n)}throw new Error(`Not yet implemented: ${t}`)}}static typeDefLayout(t,e=[],n){if(\"struct\"===t.type.kind){const r=t.type.fields.map((t=>Lt.fieldLayout(t,e)));return f.struct(r,n)}if(\"enum\"===t.type.kind){let r=t.type.variants.map((t=>{const n=h(t.name);if(void 0===t.fields)return f.struct([],n);const r=t.fields.map((t=>{if(!t.hasOwnProperty(\"name\"))throw new Error(\"Tuple enum variants not yet implemented.\");return Lt.fieldLayout(t,e)}));return f.struct(r,n)}));return void 0!==n?f.rustEnum(r).replicate(n):f.rustEnum(r,n)}throw new Error(`Unknown type kint: ${t}`)}}class Tt{constructor(t){this.idl=t,this.ixLayout=Tt.parseIxLayout(t);const e=new Map;t.instructions.forEach((t=>{const n=zt(\"global\",t.name);e.set(d.encode(n),{layout:this.ixLayout.get(t.name),name:t.name})})),t.state&&t.state.methods.map((t=>{const n=zt(\"state\",t.name);e.set(d.encode(n),{layout:this.ixLayout.get(t.name),name:t.name})})),this.sighashLayouts=e}encode(t,e){return this._encode(\"global\",t,e)}encodeState(t,e){return this._encode(\"state\",t,e)}_encode(e,n,r){const o=t.alloc(1e3),i=h(n),s=this.ixLayout.get(i);if(!s)throw new Error(`Unknown method: ${i}`);const a=s.encode(r,o),c=o.slice(0,a);return t.concat([zt(e,n),c])}static parseIxLayout(t){const e=(t.state?t.state.methods:[]).map((e=>{let n=e.args.map((e=>{var n,r;return Lt.fieldLayout(e,Array.from([...null!==(n=t.accounts)&&void 0!==n?n:[],...null!==(r=t.types)&&void 0!==r?r:[]]))}));const r=h(e.name);return[r,f.struct(n,r)]})).concat(t.instructions.map((e=>{let n=e.args.map((e=>{var n,r;return Lt.fieldLayout(e,Array.from([...null!==(n=t.accounts)&&void 0!==n?n:[],...null!==(r=t.types)&&void 0!==r?r:[]]))}));const r=h(e.name);return[r,f.struct(n,r)]})));return new Map(e)}decode(e,n=\"hex\"){\"string\"==typeof e&&(e=\"hex\"===n?t.from(e,\"hex\"):d.decode(e));let r=d.encode(e.slice(0,8)),o=e.slice(8);const i=this.sighashLayouts.get(r);return i?{data:i.layout.decode(o),name:i.name}:null}format(t,e){return Ct.format(t,e,this.idl)}}class Ct{static format(t,e,n){const r=n.instructions.filter((e=>t.name===e.name))[0];if(void 0===r)return console.error(\"Invalid instruction given\"),null;const o=r.args.map((e=>({name:e.name,type:Ct.formatIdlType(e.type),data:Ct.formatIdlData(e,t.data[e.name],n.types)}))),i=Ct.flattenIdlAccounts(r.accounts);return{args:o,accounts:e.map(((t,e)=>e<i.length?{name:i[e].name,...t}:{name:void 0,...t}))}}static formatIdlType(t){if(\"string\"==typeof t)return t;if(\"vec\"in t)return`Vec<${this.formatIdlType(t.vec)}>`;if(\"option\"in t)return`Option<${this.formatIdlType(t.option)}>`;if(\"defined\"in t)return t.defined;if(\"array\"in t)return`Array<${t.array[0]}; ${t.array[1]}>`;throw new Error(`Unknown IDL type: ${t}`)}static formatIdlData(t,e,n){if(\"string\"==typeof t.type)return e.toString();if(t.type.hasOwnProperty(\"vec\"))return\"[\"+e.map((e=>this.formatIdlData({name:\"\",type:t.type.vec},e))).join(\", \")+\"]\";if(t.type.hasOwnProperty(\"option\"))return null===e?\"null\":this.formatIdlData({name:\"\",type:t.type.option},e,n);if(t.type.hasOwnProperty(\"defined\")){if(void 0===n)throw new Error(\"User defined types not provided\");const r=n.filter((e=>e.name===t.type.defined));if(1!==r.length)throw new Error(`Type not found: ${t.type.defined}`);return Ct.formatIdlDataDefined(r[0],e,n)}return\"unknown\"}static formatIdlDataDefined(t,e,n){if(\"struct\"===t.type.kind){const r=t.type;return\"{ \"+Object.keys(e).map((t=>{const o=r.fields.filter((e=>e.name===t))[0];if(void 0===o)throw new Error(\"Unable to find type\");return t+\": \"+Ct.formatIdlData(o,e[t],n)})).join(\", \")+\" }\"}if(0===t.type.variants.length)return\"{}\";if(t.type.variants[0].name){const r=t.type.variants,o=Object.keys(e)[0],i=e[o],s=Object.keys(i).map((t=>{var e;const s=i[t],a=null===(e=r[o])||void 0===e?void 0:e.filter((e=>e.name===t))[0];if(void 0===a)throw new Error(\"Unable to find variant\");return t+\": \"+Ct.formatIdlData(a,s,n)})).join(\", \"),a=h(o,{pascalCase:!0});return 0===s.length?a:`${a} { ${s} }`}return\"Tuple formatting not yet implemented\"}static flattenIdlAccounts(t,e){return t.map((t=>{const n=function(t){const e=t.replace(/([A-Z])/g,\" $1\");return e.charAt(0).toUpperCase()+e.slice(1)}(t.name);if(t.hasOwnProperty(\"accounts\")){const r=e?`${e} > ${n}`:n;return Ct.flattenIdlAccounts(t.accounts,r)}return{...t,name:e?`${e} > ${n}`:n}})).flat()}}function zt(e,n){var r;let o=`${e}:${void 0===r&&(r={}),Pt(n,Et({delimiter:\"_\"},r))}`;return t.from(p.digest(o)).slice(0,8)}function Bt(t,e){if(\"enum\"===e.type.kind){let n=e.type.variants.map((e=>void 0===e.fields?0:e.fields.map((e=>{if(\"object\"!=typeof e||!(\"name\"in e))throw new Error(\"Tuple enum variants not yet implemented.\");return Ot(t,e.type)})).reduce(((t,e)=>t+e))));return Math.max(...n)+1}return void 0===e.type.fields?0:e.type.fields.map((e=>Ot(t,e.type))).reduce(((t,e)=>t+e),0)}function Ot(t,e){var n,r;switch(e){case\"bool\":case\"u8\":case\"i8\":case\"bytes\":case\"string\":return 1;case\"i16\":case\"u16\":return 2;case\"u32\":case\"i32\":case\"f32\":return 4;case\"u64\":case\"i64\":case\"f64\":return 8;case\"u128\":case\"i128\":return 16;case\"publicKey\":return 32;default:if(\"vec\"in e)return 1;if(\"option\"in e)return 1+Ot(t,e.option);if(\"coption\"in e)return 4+Ot(t,e.coption);if(\"defined\"in e){const o=null!==(r=null===(n=t.types)||void 0===n?void 0:n.filter((t=>t.name===e.defined)))&&void 0!==r?r:[];if(1!==o.length)throw new gt(`Type not found: ${JSON.stringify(e)}`);return Bt(t,o[0])}if(\"array\"in e){let n=e.array[0],r=e.array[1];return Ot(t,n)*r}throw new Error(`Invalid type ${JSON.stringify(e)}`)}}const Dt=8;class Nt{constructor(t){if(void 0===t.accounts)return void(this.accountLayouts=new Map);const e=t.accounts.map((e=>[e.name,Lt.typeDefLayout(e,t.types)]));this.accountLayouts=new Map(e),this.idl=t}async encode(e,n){const r=t.alloc(1e3),o=this.accountLayouts.get(e);if(!o)throw new Error(`Unknown account: ${e}`);const i=o.encode(n,r);let s=r.slice(0,i),a=Nt.accountDiscriminator(e);return t.concat([a,s])}decode(t,e){if(Nt.accountDiscriminator(t).compare(e.slice(0,8)))throw new Error(\"Invalid account discriminator\");return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){const n=e.slice(8),r=this.accountLayouts.get(t);if(!r)throw new Error(`Unknown account: ${t}`);return r.decode(n)}memcmp(e,n){const r=Nt.accountDiscriminator(e);return{offset:0,bytes:d.encode(n?t.concat([r,n]):r)}}size(t){var e;return 8+(null!==(e=Bt(this.idl,t))&&void 0!==e?e:0)}static accountDiscriminator(e){return t.from(p.digest(`account:${h(e,{pascalCase:!0})}`)).slice(0,8)}}class Rt{constructor(t){if(void 0===t.events)return void(this.layouts=new Map);const e=t.events.map((e=>{let n={name:e.name,type:{kind:\"struct\",fields:e.fields.map((t=>({name:t.name,type:t.type})))}};return[e.name,Lt.typeDefLayout(n,t.types)]}));this.layouts=new Map(e),this.discriminators=new Map(void 0===t.events?[]:t.events.map((t=>[l.fromByteArray(Vt(t.name)),t.name])))}decode(e){let n;try{n=t.from(l.toByteArray(e))}catch(t){return null}const r=l.fromByteArray(n.slice(0,8)),o=this.discriminators.get(r);if(void 0===o)return null;const i=this.layouts.get(o);if(!i)throw new Error(`Unknown event: ${o}`);return{data:i.decode(n.slice(8)),name:o}}}function Vt(e){return t.from(p.digest(`event:${e}`)).slice(0,8)}class Ut{constructor(t){if(void 0===t.state)throw new Error(\"Idl state not defined.\");this.layout=Lt.typeDefLayout(t.state.struct,t.types)}async encode(e,n){const r=t.alloc(1e3),o=this.layout.encode(n,r),i=await jt(e),s=r.slice(0,o);return t.concat([i,s])}decode(t){const e=t.slice(8);return this.layout.decode(e)}}async function jt(e){let n=mt(\"anchor-deprecated-state\")?\"account\":\"state\";return t.from(p.digest(`${n}:${e}`)).slice(0,8)}class $t{constructor(t){if(void 0===t.types)return void(this.typeLayouts=new Map);const e=t.types.map((e=>[e.name,Lt.typeDefLayout(e,t.types)]));this.typeLayouts=new Map(e),this.idl=t}encode(e,n){const r=t.alloc(1e3),o=this.typeLayouts.get(e);if(!o)throw new Error(`Unknown type: ${e}`);const i=o.encode(n,r);return r.slice(0,i)}decode(t,e){const n=this.typeLayouts.get(t);if(!n)throw new Error(`Unknown type: ${t}`);return n.decode(e)}}class Kt{constructor(t){this.instruction=new Tt(t),this.accounts=new Nt(t),this.events=new Rt(t),t.state&&(this.state=new Ut(t)),this.types=new $t(t)}}var qt=\"undefined\"!=typeof globalThis?globalThis:\"undefined\"!=typeof window?window:\"undefined\"!=typeof global?global:\"undefined\"!=typeof self?self:{};function Ft(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}class Wt{constructor(t,e){if(!Number.isInteger(t))throw new TypeError(\"span must be an integer\");this.span=t,this.property=e}makeDestinationObject(){return{}}decode(t,e){throw new Error(\"Layout is abstract\")}encode(t,e,n){throw new Error(\"Layout is abstract\")}getSpan(t,e){if(0>this.span)throw new RangeError(\"indeterminate span\");return this.span}replicate(t){const e=Object.create(this.constructor.prototype);return Object.assign(e,this),e.property=t,e}fromArray(t){}}var Gt=Wt;class Ht extends Wt{isCount(){throw new Error(\"ExternalLayout is abstract\")}}class Jt extends Ht{constructor(t,e,n){if(!(t instanceof Wt))throw new TypeError(\"layout must be a Layout\");if(void 0===e)e=0;else if(!Number.isInteger(e))throw new TypeError(\"offset must be integer or undefined\");super(t.span,n||t.property),this.layout=t,this.offset=e}isCount(){return this.layout instanceof Zt||this.layout instanceof Xt}decode(t,e){return void 0===e&&(e=0),this.layout.decode(t,e+this.offset)}encode(t,e,n){return void 0===n&&(n=0),this.layout.encode(t,e,n+this.offset)}}class Zt extends Wt{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e){return void 0===e&&(e=0),t.readUIntLE(e,this.span)}encode(t,e,n){return void 0===n&&(n=0),e.writeUIntLE(t,n,this.span),this.span}}class Xt extends Wt{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e){return void 0===e&&(e=0),t.readUIntBE(e,this.span)}encode(t,e,n){return void 0===n&&(n=0),e.writeUIntBE(t,n,this.span),this.span}}const Qt=Math.pow(2,32);function Yt(t){const e=Math.floor(t/Qt);return{hi32:e,lo32:t-e*Qt}}function te(t,e){return t*Qt+e}class ee extends Wt{constructor(t){super(8,t)}decode(t,e){void 0===e&&(e=0);const n=t.readUInt32LE(e);return te(t.readUInt32LE(e+4),n)}encode(t,e,n){void 0===n&&(n=0);const r=Yt(t);return e.writeUInt32LE(r.lo32,n),e.writeUInt32LE(r.hi32,n+4),8}}class ne extends Wt{constructor(t){super(8,t)}decode(t,e){void 0===e&&(e=0);const n=t.readUInt32LE(e);return te(t.readInt32LE(e+4),n)}encode(t,e,n){void 0===n&&(n=0);const r=Yt(t);return e.writeUInt32LE(r.lo32,n),e.writeInt32LE(r.hi32,n+4),8}}class re extends Wt{constructor(t,e,n){if(!Array.isArray(t)||!t.reduce(((t,e)=>t&&e instanceof Wt),!0))throw new TypeError(\"fields must be array of Layout instances\");\"boolean\"==typeof e&&void 0===n&&(n=e,e=void 0);for(const e of t)if(0>e.span&&void 0===e.property)throw new Error(\"fields cannot contain unnamed variable-length layout\");let r=-1;try{r=t.reduce(((t,e)=>t+e.getSpan()),0)}catch(t){}super(r,e),this.fields=t,this.decodePrefixes=!!n}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);let n=0;try{n=this.fields.reduce(((n,r)=>{const o=r.getSpan(t,e);return e+=o,n+o}),0)}catch(t){throw new RangeError(\"indeterminate span\")}return n}decode(t,e){void 0===e&&(e=0);const n=this.makeDestinationObject();for(const r of this.fields)if(void 0!==r.property&&(n[r.property]=r.decode(t,e)),e+=r.getSpan(t,e),this.decodePrefixes&&t.length===e)break;return n}encode(t,e,n){void 0===n&&(n=0);const r=n;let o=0,i=0;for(const r of this.fields){let s=r.span;if(i=0<s?s:0,void 0!==r.property){const o=t[r.property];void 0!==o&&(i=r.encode(o,e,n),0>s&&(s=r.getSpan(e,n)))}o=n,n+=s}return o+i-r}fromArray(t){const e=this.makeDestinationObject();for(const n of this.fields)void 0!==n.property&&0<t.length&&(e[n.property]=t.shift());return e}layoutFor(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");for(const e of this.fields)if(e.property===t)return e}offsetOf(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");let e=0;for(const n of this.fields){if(n.property===t)return e;0>n.span?e=-1:0<=e&&(e+=n.span)}}}class oe{constructor(t){this.property=t}decode(){throw new Error(\"UnionDiscriminator is abstract\")}encode(){throw new Error(\"UnionDiscriminator is abstract\")}}class ie extends oe{constructor(t,e){if(!(t instanceof Ht&&t.isCount()))throw new TypeError(\"layout must be an unsigned integer ExternalLayout\");super(e||t.property||\"variant\"),this.layout=t}decode(t,e){return this.layout.decode(t,e)}encode(t,e,n){return this.layout.encode(t,e,n)}}class se extends Wt{constructor(t,e,n){const r=t instanceof Zt||t instanceof Xt;if(r)t=new ie(new Jt(t));else if(t instanceof Ht&&t.isCount())t=new ie(t);else if(!(t instanceof oe))throw new TypeError(\"discr must be a UnionDiscriminator or an unsigned integer layout\");if(void 0===e&&(e=null),!(null===e||e instanceof Wt))throw new TypeError(\"defaultLayout must be null or a Layout\");if(null!==e){if(0>e.span)throw new Error(\"defaultLayout must have constant span\");void 0===e.property&&(e=e.replicate(\"content\"))}let o=-1;e&&(o=e.span,0<=o&&r&&(o+=t.layout.span)),super(o,n),this.discriminator=t,this.usesPrefixDiscriminator=r,this.defaultLayout=e,this.registry={};let i=this.defaultGetSourceVariant.bind(this);this.getSourceVariant=function(t){return i(t)},this.configGetSourceVariant=function(t){i=t.bind(this)}}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);const n=this.getVariant(t,e);if(!n)throw new Error(\"unable to determine span for unrecognized variant\");return n.getSpan(t,e)}defaultGetSourceVariant(t){if(t.hasOwnProperty(this.discriminator.property)){if(this.defaultLayout&&t.hasOwnProperty(this.defaultLayout.property))return;const e=this.registry[t[this.discriminator.property]];if(e&&(!e.layout||t.hasOwnProperty(e.property)))return e}else for(const e in this.registry){const n=this.registry[e];if(t.hasOwnProperty(n.property))return n}throw new Error(\"unable to infer src variant\")}decode(t,e){let n;void 0===e&&(e=0);const r=this.discriminator,o=r.decode(t,e);let i=this.registry[o];if(void 0===i){let s=0;i=this.defaultLayout,this.usesPrefixDiscriminator&&(s=r.layout.span),n=this.makeDestinationObject(),n[r.property]=o,n[i.property]=this.defaultLayout.decode(t,e+s)}else n=i.decode(t,e);return n}encode(t,e,n){void 0===n&&(n=0);const r=this.getSourceVariant(t);if(void 0===r){const r=this.discriminator,o=this.defaultLayout;let i=0;return this.usesPrefixDiscriminator&&(i=r.layout.span),r.encode(t[r.property],e,n),i+o.encode(t[o.property],e,n+i)}return r.encode(t,e,n)}addVariant(t,e,n){const r=new ae(this,t,e,n);return this.registry[t]=r,r}getVariant(t,e){let n=t;return Buffer.isBuffer(t)&&(void 0===e&&(e=0),n=this.discriminator.decode(t,e)),this.registry[n]}}class ae extends Wt{constructor(t,e,n,r){if(!(t instanceof se))throw new TypeError(\"union must be a Union\");if(!Number.isInteger(e)||0>e)throw new TypeError(\"variant must be a (non-negative) integer\");if(\"string\"==typeof n&&void 0===r&&(r=n,n=null),n){if(!(n instanceof Wt))throw new TypeError(\"layout must be a Layout\");if(null!==t.defaultLayout&&0<=n.span&&n.span>t.defaultLayout.span)throw new Error(\"variant span exceeds span of containing union\");if(\"string\"!=typeof r)throw new TypeError(\"variant must have a String property\")}let o=t.span;0>t.span&&(o=n?n.span:0,0<=o&&t.usesPrefixDiscriminator&&(o+=t.discriminator.layout.span)),super(o,r),this.union=t,this.variant=e,this.layout=n||null}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);let n=0;return this.union.usesPrefixDiscriminator&&(n=this.union.discriminator.layout.span),n+this.layout.getSpan(t,e+n)}decode(t,e){const n=this.makeDestinationObject();if(void 0===e&&(e=0),this!==this.union.getVariant(t,e))throw new Error(\"variant mismatch\");let r=0;return this.union.usesPrefixDiscriminator&&(r=this.union.discriminator.layout.span),this.layout?n[this.property]=this.layout.decode(t,e+r):this.property?n[this.property]=!0:this.union.usesPrefixDiscriminator&&(n[this.union.discriminator.property]=this.variant),n}encode(t,e,n){void 0===n&&(n=0);let r=0;if(this.union.usesPrefixDiscriminator&&(r=this.union.discriminator.layout.span),this.layout&&!t.hasOwnProperty(this.property))throw new TypeError(\"variant lacks property \"+this.property);this.union.discriminator.encode(this.variant,e,n);let o=r;if(this.layout&&(this.layout.encode(t[this.property],e,n+r),o+=this.layout.getSpan(e,n+r),0<=this.union.span&&o>this.union.span))throw new Error(\"encoded variant overruns containing union\");return o}fromArray(t){if(this.layout)return this.layout.fromArray(t)}}class ce extends Wt{constructor(t,e){if(!(t instanceof Ht&&t.isCount()||Number.isInteger(t)&&0<=t))throw new TypeError(\"length must be positive integer or an unsigned integer ExternalLayout\");let n=-1;t instanceof Ht||(n=t),super(n,e),this.length=t}getSpan(t,e){let n=this.span;return 0>n&&(n=this.length.decode(t,e)),n}decode(t,e){void 0===e&&(e=0);let n=this.span;return 0>n&&(n=this.length.decode(t,e)),t.slice(e,e+n)}encode(t,e,n){let r=this.length;if(this.length instanceof Ht&&(r=t.length),!Buffer.isBuffer(t)||r!==t.length)throw new TypeError((o=\"Blob.encode\",((i=this).property?o+\"[\"+i.property+\"]\":o)+\" requires (length \"+r+\") Buffer as src\"));var o,i;if(n+r>e.length)throw new RangeError(\"encoding overruns Buffer\");return e.write(t.toString(\"hex\"),n,r,\"hex\"),this.length instanceof Ht&&this.length.encode(r,e,n),r}}var ue=(t,e,n)=>new Jt(t,e,n),de=t=>new Zt(1,t),le=t=>new Zt(4,t),he=t=>new ee(t),pe=t=>new ne(t),fe=(t,e,n)=>new re(t,e,n),me=(t,e,n)=>new se(t,e,n),ye=(t,e)=>new ce(t,e);class ge{constructor(t){}encode(t,n){switch(h(t)){case\"initializeMint\":return function({decimals:t,mintAuthority:n,freezeAuthority:r}){return be({initializeMint:{decimals:t,mintAuthority:n.toBuffer(),freezeAuthorityOption:!!r,freezeAuthority:(r||e.default).toBuffer()}})}(n);case\"initializeAccount\":return be({initializeAccount:{}});case\"initializeMultisig\":return function({m:t}){return be({initializeMultisig:{m:t}})}(n);case\"transfer\":return function({amount:t}){return be({transfer:{amount:t}})}(n);case\"approve\":return function({amount:t}){return be({approve:{amount:t}})}(n);case\"revoke\":return be({revoke:{}});case\"setAuthority\":return function({authorityType:t,newAuthority:e}){return be({setAuthority:{authorityType:t,newAuthority:e}})}(n);case\"mintTo\":return function({amount:t}){return be({mintTo:{amount:t}})}(n);case\"burn\":return function({amount:t}){return be({burn:{amount:t}})}(n);case\"closeAccount\":return be({closeAccount:{}});case\"freezeAccount\":return be({freezeAccount:{}});case\"thawAccount\":return be({thawAccount:{}});case\"transferChecked\":return function({amount:t,decimals:e}){return be({transferChecked:{amount:t,decimals:e}})}(n);case\"approvedChecked\":return function({amount:t,decimals:e}){return be({approveChecked:{amount:t,decimals:e}})}(n);case\"mintToChecked\":return function({amount:t,decimals:e}){return be({mintToChecked:{amount:t,decimals:e}})}(n);case\"burnChecked\":return function({amount:t,decimals:e}){return be({burnChecked:{amount:t,decimals:e}})}(n);case\"intializeAccount2\":return function({authority:t}){return be({initilaizeAccount2:{authority:t}})}(n);case\"syncNative\":return be({syncNative:{}});case\"initializeAccount3\":return function({authority:t}){return be({initializeAccount3:{authority:t}})}(n);case\"initializeMultisig2\":return function({m:t}){return be({initializeMultisig2:{m:t}})}(n);case\"initializeMint2\":return function({decimals:t,mintAuthority:e,freezeAuthority:n}){return be({encodeInitializeMint2:{decimals:t,mintAuthority:e,freezeAuthority:n}})}(n);default:throw new Error(`Invalid instruction: ${t}`)}}encodeState(t,e){throw new Error(\"SPL token does not have state\")}}const we=me(de(\"instruction\"));function ve(t){return ye(32,t)}function be(t){let e=Buffer.alloc(Ae),n=we.encode(t,e);return e.slice(0,n)}we.addVariant(0,fe([de(\"decimals\"),ye(32,\"mintAuthority\"),de(\"freezeAuthorityOption\"),ve(\"freezeAuthority\")]),\"initializeMint\"),we.addVariant(1,fe([]),\"initializeAccount\"),we.addVariant(2,fe([de(\"m\")]),\"initializeMultisig\"),we.addVariant(3,fe([he(\"amount\")]),\"transfer\"),we.addVariant(4,fe([he(\"amount\")]),\"approve\"),we.addVariant(5,fe([]),\"revoke\"),we.addVariant(6,fe([de(\"authorityType\"),de(\"newAuthorityOption\"),ve(\"newAuthority\")]),\"setAuthority\"),we.addVariant(7,fe([he(\"amount\")]),\"mintTo\"),we.addVariant(8,fe([he(\"amount\")]),\"burn\"),we.addVariant(9,fe([]),\"closeAccount\"),we.addVariant(10,fe([]),\"freezeAccount\"),we.addVariant(11,fe([]),\"thawAccount\"),we.addVariant(12,fe([he(\"amount\"),de(\"decimals\")]),\"transferChecked\"),we.addVariant(13,fe([he(\"amount\"),de(\"decimals\")]),\"approvedChecked\"),we.addVariant(14,fe([he(\"amount\"),de(\"decimals\")]),\"mintToChecked\"),we.addVariant(15,fe([he(\"amount\"),de(\"decimals\")]),\"burnedChecked\"),we.addVariant(16,fe([ve(\"authority\")]),\"InitializeAccount2\"),we.addVariant(17,fe([]),\"syncNative\"),we.addVariant(18,fe([ve(\"authority\")]),\"initializeAccount3\"),we.addVariant(19,fe([de(\"m\")]),\"initializeMultisig2\"),we.addVariant(20,fe([de(\"decimals\"),ve(\"mintAuthority\"),de(\"freezeAuthorityOption\"),ve(\"freezeAuthority\")]),\"initializeMint2\");const Ae=Math.max(...Object.values(we.registry).map((t=>t.span)));class _e{constructor(t){}encode(t,e){throw new Error(\"SPL token does not have state\")}decode(t){throw new Error(\"SPL token does not have state\")}}function Se(t){return new ke(ye(8),(t=>Le.fromBuffer(t)),(t=>t.toBuffer()),t)}function Ee(t){return new ke(ye(32),(t=>new e(t)),(t=>t.toBuffer()),t)}function Ie(t,e){return new Me(t,e)}class ke extends Gt{constructor(t,e,n,r){super(t.span,r),this.layout=t,this.decoder=e,this.encoder=n}decode(t,e){return this.decoder(this.layout.decode(t,e))}encode(t,e,n){return this.layout.encode(this.encoder(t),e,n)}getSpan(t,e){return this.layout.getSpan(t,e)}}class Me extends Gt{constructor(t,e){super(-1,e),this.layout=t,this.discriminator=le()}encode(t,e,n=0){return null==t?this.layout.span+this.discriminator.encode(0,e,n):(this.discriminator.encode(1,e,n),this.layout.encode(t,e,n+4)+4)}decode(t,e=0){const n=this.discriminator.decode(t,e);if(0===n)return null;if(1===n)return this.layout.decode(t,e+4);throw new Error(\"Invalid coption \"+this.layout.property)}getSpan(t,e=0){return this.layout.getSpan(t,e+4)+4}}function xe(t){if(0===t)return!1;if(1===t)return!0;throw new Error(\"Invalid bool: \"+t)}function Pe(t){return t?1:0}class Le extends u{toBuffer(){const t=super.toArray().reverse(),e=Buffer.from(t);if(8===e.length)return e;if(e.length>=8)throw new Error(\"u64 too large\");const n=Buffer.alloc(8);return e.copy(n),n}static fromBuffer(t){if(8!==t.length)throw new Error(`Invalid buffer length: ${t.length}`);return new Le([...t].reverse().map((t=>`00${t.toString(16)}`.slice(-2))).join(\"\"),16)}}class Te{constructor(t){this.idl=t}async encode(t,e){switch(t){case\"token\":{const t=Buffer.alloc(165),n=Be.encode(e,t);return t.slice(0,n)}case\"mint\":{const t=Buffer.alloc(82),n=Ce.encode(e,t);return t.slice(0,n)}default:throw new Error(`Invalid account name: ${t}`)}}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){switch(t){case\"token\":return function(t){return Be.decode(t)}(e);case\"mint\":return function(t){return Ce.decode(t)}(e);default:throw new Error(`Invalid account name: ${t}`)}}memcmp(t,e){switch(t){case\"token\":return{dataSize:165};case\"mint\":return{dataSize:82};default:throw new Error(`Invalid account name: ${t}`)}}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}const Ce=fe([Ie(Ee(),\"mintAuthority\"),Se(\"supply\"),de(\"decimals\"),(ze=\"isInitialized\",new ke(de(),xe,Pe,ze)),Ie(Ee(),\"freezeAuthority\")]);var ze;const Be=fe([Ee(\"mint\"),Ee(\"authority\"),Se(\"amount\"),Ie(Ee(),\"delegate\"),de(\"state\"),Ie(Se(),\"isNative\"),Se(\"delegatedAmount\"),Ie(Ee(),\"closeAuthority\")]);class Oe{constructor(t){}decode(t){throw new Error(\"SPL token program does not have events\")}}class De{constructor(t){}encode(t,e){throw new Error(\"SPL token does not have user-defined types\")}decode(t,e){throw new Error(\"SPL token does not have user-defined types\")}}class Ne{constructor(t){this.instruction=new ge(t),this.accounts=new Te(t),this.events=new Oe(t),this.state=new _e(t),this.types=new De(t)}}class Re{constructor(t){}encode(t,e){switch(h(t)){case\"createAccount\":return function({lamports:t,space:e,owner:n}){return Ke({createAccount:{lamports:t,space:e,owner:n.toBuffer()}})}(e);case\"assign\":return function({owner:t}){return Ke({assign:{owner:t.toBuffer()}})}(e);case\"transfer\":return function({lamports:t}){return Ke({transfer:{lamports:t}})}(e);case\"createAccountWithSeed\":return function({base:t,seed:e,lamports:n,space:r,owner:o}){return Ke({createAccountWithSeed:{base:t.toBuffer(),seed:e,lamports:n,space:r,owner:o.toBuffer()}},$e.getVariant(3).span+e.length)}(e);case\"advanceNonceAccount\":return function({authorized:t}){return Ke({advanceNonceAccount:{authorized:t.toBuffer()}})}(e);case\"withdrawNonceAccount\":return function({lamports:t}){return Ke({withdrawNonceAccount:{lamports:t}})}(e);case\"initializeNonceAccount\":return function({authorized:t}){return Ke({initializeNonceAccount:{authorized:t.toBuffer()}})}(e);case\"authorizeNonceAccount\":return function({authorized:t}){return Ke({authorizeNonceAccount:{authorized:t.toBuffer()}})}(e);case\"allocate\":return function({space:t}){return Ke({allocate:{space:t}})}(e);case\"allocateWithSeed\":return function({base:t,seed:e,space:n,owner:r}){return Ke({allocateWithSeed:{base:t.toBuffer(),seed:e,space:n,owner:r.toBuffer()}},$e.getVariant(9).span+e.length)}(e);case\"assignWithSeed\":return function({base:t,seed:e,owner:n}){return Ke({assignWithSeed:{base:t.toBuffer(),seed:e,owner:n.toBuffer()}},$e.getVariant(10).span+e.length)}(e);case\"transferWithSeed\":return function({lamports:t,seed:e,owner:n}){return Ke({transferWithSeed:{lamports:t,seed:e,owner:n.toBuffer()}},$e.getVariant(11).span+e.length)}(e);default:throw new Error(`Invalid instruction: ${t}`)}}encodeState(t,e){throw new Error(\"System does not have state\")}}class Ve extends Gt{constructor(t){super(-1,t),this.property=t,this.layout=fe([le(\"length\"),le(\"lengthPadding\"),ye(ue(le(),-8),\"chars\")],this.property)}encode(t,e,n=0){if(null==t)return this.layout.span;const r={chars:Buffer.from(t,\"utf8\")};return this.layout.encode(r,e,n)}decode(t,e=0){return this.layout.decode(t,e).chars.toString()}getSpan(t,e=0){return le().span+le().span+new u(new Uint8Array(t).slice(e,e+4),10,\"le\").toNumber()}}function Ue(t){return new Ve(t)}function je(t){return ye(32,t)}const $e=me(le(\"instruction\"));function Ke(t,e){const n=Buffer.alloc(null!=e?e:qe),r=$e.encode(t,n);return void 0===e?n.slice(0,r):n}$e.addVariant(0,fe([pe(\"lamports\"),pe(\"space\"),je(\"owner\")]),\"createAccount\"),$e.addVariant(1,fe([je(\"owner\")]),\"assign\"),$e.addVariant(2,fe([pe(\"lamports\")]),\"transfer\"),$e.addVariant(3,fe([je(\"base\"),Ue(\"seed\"),pe(\"lamports\"),pe(\"space\"),je(\"owner\")]),\"createAccountWithSeed\"),$e.addVariant(4,fe([je(\"authorized\")]),\"advanceNonceAccount\"),$e.addVariant(5,fe([pe(\"lamports\")]),\"withdrawNonceAccount\"),$e.addVariant(6,fe([je(\"authorized\")]),\"initializeNonceAccount\"),$e.addVariant(7,fe([je(\"authorized\")]),\"authorizeNonceAccount\"),$e.addVariant(8,fe([pe(\"space\")]),\"allocate\"),$e.addVariant(9,fe([je(\"base\"),Ue(\"seed\"),pe(\"space\"),je(\"owner\")]),\"allocateWithSeed\"),$e.addVariant(10,fe([je(\"base\"),Ue(\"seed\"),je(\"owner\")]),\"assignWithSeed\"),$e.addVariant(11,fe([pe(\"lamports\"),Ue(\"seed\"),je(\"owner\")]),\"transferWithSeed\");const qe=Math.max(...Object.values($e.registry).map((t=>t.span)));class Fe{constructor(t){}encode(t,e){throw new Error(\"System does not have state\")}decode(t){throw new Error(\"System does not have state\")}}class We{constructor(t){this.idl=t}async encode(t,e){if(\"nonce\"===t){const t=Buffer.alloc(i),n=Je.encode(e,t);return t.slice(0,n)}throw new Error(`Invalid account name: ${t}`)}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){if(\"nonce\"===t)return function(t){return Je.decode(t)}(e);throw new Error(`Invalid account name: ${t}`)}memcmp(t,e){if(\"nonce\"===t)return{dataSize:i};throw new Error(`Invalid account name: ${t}`)}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}class Ge extends Gt{constructor(t,e,n,r){super(t.span,r),this.layout=t,this.decoder=e,this.encoder=n}decode(t,e){return this.decoder(this.layout.decode(t,e))}encode(t,e,n){return this.layout.encode(this.encoder(t),e,n)}getSpan(t,e){return this.layout.getSpan(t,e)}}function He(t){return new Ge(ye(32),(t=>new e(t)),(t=>t.toBuffer()),t)}const Je=fe([le(\"version\"),le(\"state\"),He(\"authorizedPubkey\"),He(\"nonce\"),fe([he(\"lamportsPerSignature\")],\"feeCalculator\")]);class Ze{constructor(t){}decode(t){throw new Error(\"System program does not have events\")}}class Xe{constructor(t){}encode(t,e){throw new Error(\"System does not have user-defined types\")}decode(t,e){throw new Error(\"System does not have user-defined types\")}}class Qe{constructor(t){this.instruction=new Re(t),this.accounts=new We(t),this.events=new Ze(t),this.state=new Fe(t),this.types=new Xe(t)}}var Ye=Object.freeze({__proto__:null,hash:function(t){return p(t)}});function tn(n,r,o){const i=t.concat([n.toBuffer(),t.from(r),o.toBuffer()]),s=p.digest(i);return new e(t.from(s))}function en(n,r){let o=t.alloc(0);n.forEach((function(e){if(e.length>32)throw new TypeError(\"Max seed length exceeded\");o=t.concat([o,rn(e)])})),o=t.concat([o,r.toBuffer(),t.from(\"ProgramDerivedAddress\")]);let i=p(new Uint8Array(o)),s=new u(i,16).toArray(void 0,32);if(e.isOnCurve(new Uint8Array(s)))throw new Error(\"Invalid seeds, address must fall off the curve\");return new e(s)}function nn(e,n){let r,o=255;for(;0!=o;){try{r=en(e.concat(t.from([o])),n)}catch(t){if(t instanceof TypeError)throw t;o--;continue}return[r,o]}throw new Error(\"Unable to find a viable program address nonce\")}const rn=e=>e instanceof t?e:e instanceof Uint8Array?t.from(e.buffer,e.byteOffset,e.byteLength):t.from(e);async function on(n,...r){let o=[t.from([97,110,99,104,111,114])];r.forEach((e=>{o.push(e instanceof t?e:L(e).toBuffer())}));const[i]=await e.findProgramAddress(o,L(n));return i}var sn=Object.freeze({__proto__:null,createWithSeedSync:tn,createProgramAddressSync:en,findProgramAddressSync:nn,associated:on});const an=new e(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\"),cn=new e(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");var un=Object.freeze({__proto__:null,TOKEN_PROGRAM_ID:an,ASSOCIATED_PROGRAM_ID:cn,associatedAddress:async function({mint:t,owner:n}){return(await e.findProgramAddress([n.toBuffer(),an.toBuffer(),t.toBuffer()],cn))[0]}}),dn={exports:{}};!function(t,e){var n=\"undefined\"!=typeof self?self:qt,r=function(){function t(){this.fetch=!1,this.DOMException=n.DOMException}return t.prototype=n,new t}();!function(t){!function(e){var n=\"URLSearchParams\"in t,r=\"Symbol\"in t&&\"iterator\"in Symbol,o=\"FileReader\"in t&&\"Blob\"in t&&function(){try{return new Blob,!0}catch(t){return!1}}(),i=\"FormData\"in t,s=\"ArrayBuffer\"in t;if(s)var a=[\"[object Int8Array]\",\"[object Uint8Array]\",\"[object Uint8ClampedArray]\",\"[object Int16Array]\",\"[object Uint16Array]\",\"[object Int32Array]\",\"[object Uint32Array]\",\"[object Float32Array]\",\"[object Float64Array]\"],c=ArrayBuffer.isView||function(t){return t&&a.indexOf(Object.prototype.toString.call(t))>-1};function u(t){if(\"string\"!=typeof t&&(t=String(t)),/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(t))throw new TypeError(\"Invalid character in header field name\");return t.toLowerCase()}function d(t){return\"string\"!=typeof t&&(t=String(t)),t}function l(t){var e={next:function(){var e=t.shift();return{done:void 0===e,value:e}}};return r&&(e[Symbol.iterator]=function(){return e}),e}function h(t){this.map={},t instanceof h?t.forEach((function(t,e){this.append(e,t)}),this):Array.isArray(t)?t.forEach((function(t){this.append(t[0],t[1])}),this):t&&Object.getOwnPropertyNames(t).forEach((function(e){this.append(e,t[e])}),this)}function p(t){if(t.bodyUsed)return Promise.reject(new TypeError(\"Already read\"));t.bodyUsed=!0}function f(t){return new Promise((function(e,n){t.onload=function(){e(t.result)},t.onerror=function(){n(t.error)}}))}function m(t){var e=new FileReader,n=f(e);return e.readAsArrayBuffer(t),n}function y(t){if(t.slice)return t.slice(0);var e=new Uint8Array(t.byteLength);return e.set(new Uint8Array(t)),e.buffer}function g(){return this.bodyUsed=!1,this._initBody=function(t){var e;this._bodyInit=t,t?\"string\"==typeof t?this._bodyText=t:o&&Blob.prototype.isPrototypeOf(t)?this._bodyBlob=t:i&&FormData.prototype.isPrototypeOf(t)?this._bodyFormData=t:n&&URLSearchParams.prototype.isPrototypeOf(t)?this._bodyText=t.toString():s&&o&&((e=t)&&DataView.prototype.isPrototypeOf(e))?(this._bodyArrayBuffer=y(t.buffer),this._bodyInit=new Blob([this._bodyArrayBuffer])):s&&(ArrayBuffer.prototype.isPrototypeOf(t)||c(t))?this._bodyArrayBuffer=y(t):this._bodyText=t=Object.prototype.toString.call(t):this._bodyText=\"\",this.headers.get(\"content-type\")||(\"string\"==typeof t?this.headers.set(\"content-type\",\"text/plain;charset=UTF-8\"):this._bodyBlob&&this._bodyBlob.type?this.headers.set(\"content-type\",this._bodyBlob.type):n&&URLSearchParams.prototype.isPrototypeOf(t)&&this.headers.set(\"content-type\",\"application/x-www-form-urlencoded;charset=UTF-8\"))},o&&(this.blob=function(){var t=p(this);if(t)return t;if(this._bodyBlob)return Promise.resolve(this._bodyBlob);if(this._bodyArrayBuffer)return Promise.resolve(new Blob([this._bodyArrayBuffer]));if(this._bodyFormData)throw new Error(\"could not read FormData body as blob\");return Promise.resolve(new Blob([this._bodyText]))},this.arrayBuffer=function(){return this._bodyArrayBuffer?p(this)||Promise.resolve(this._bodyArrayBuffer):this.blob().then(m)}),this.text=function(){var t=p(this);if(t)return t;if(this._bodyBlob)return function(t){var e=new FileReader,n=f(e);return e.readAsText(t),n}(this._bodyBlob);if(this._bodyArrayBuffer)return Promise.resolve(function(t){for(var e=new Uint8Array(t),n=new Array(e.length),r=0;r<e.length;r++)n[r]=String.fromCharCode(e[r]);return n.join(\"\")}(this._bodyArrayBuffer));if(this._bodyFormData)throw new Error(\"could not read FormData body as text\");return Promise.resolve(this._bodyText)},i&&(this.formData=function(){return this.text().then(b)}),this.json=function(){return this.text().then(JSON.parse)},this}h.prototype.append=function(t,e){t=u(t),e=d(e);var n=this.map[t];this.map[t]=n?n+\", \"+e:e},h.prototype.delete=function(t){delete this.map[u(t)]},h.prototype.get=function(t){return t=u(t),this.has(t)?this.map[t]:null},h.prototype.has=function(t){return this.map.hasOwnProperty(u(t))},h.prototype.set=function(t,e){this.map[u(t)]=d(e)},h.prototype.forEach=function(t,e){for(var n in this.map)this.map.hasOwnProperty(n)&&t.call(e,this.map[n],n,this)},h.prototype.keys=function(){var t=[];return this.forEach((function(e,n){t.push(n)})),l(t)},h.prototype.values=function(){var t=[];return this.forEach((function(e){t.push(e)})),l(t)},h.prototype.entries=function(){var t=[];return this.forEach((function(e,n){t.push([n,e])})),l(t)},r&&(h.prototype[Symbol.iterator]=h.prototype.entries);var w=[\"DELETE\",\"GET\",\"HEAD\",\"OPTIONS\",\"POST\",\"PUT\"];function v(t,e){var n,r,o=(e=e||{}).body;if(t instanceof v){if(t.bodyUsed)throw new TypeError(\"Already read\");this.url=t.url,this.credentials=t.credentials,e.headers||(this.headers=new h(t.headers)),this.method=t.method,this.mode=t.mode,this.signal=t.signal,o||null==t._bodyInit||(o=t._bodyInit,t.bodyUsed=!0)}else this.url=String(t);if(this.credentials=e.credentials||this.credentials||\"same-origin\",!e.headers&&this.headers||(this.headers=new h(e.headers)),this.method=(n=e.method||this.method||\"GET\",r=n.toUpperCase(),w.indexOf(r)>-1?r:n),this.mode=e.mode||this.mode||null,this.signal=e.signal||this.signal,this.referrer=null,(\"GET\"===this.method||\"HEAD\"===this.method)&&o)throw new TypeError(\"Body not allowed for GET or HEAD requests\");this._initBody(o)}function b(t){var e=new FormData;return t.trim().split(\"&\").forEach((function(t){if(t){var n=t.split(\"=\"),r=n.shift().replace(/\\+/g,\" \"),o=n.join(\"=\").replace(/\\+/g,\" \");e.append(decodeURIComponent(r),decodeURIComponent(o))}})),e}function A(t,e){e||(e={}),this.type=\"default\",this.status=void 0===e.status?200:e.status,this.ok=this.status>=200&&this.status<300,this.statusText=\"statusText\"in e?e.statusText:\"OK\",this.headers=new h(e.headers),this.url=e.url||\"\",this._initBody(t)}v.prototype.clone=function(){return new v(this,{body:this._bodyInit})},g.call(v.prototype),g.call(A.prototype),A.prototype.clone=function(){return new A(this._bodyInit,{status:this.status,statusText:this.statusText,headers:new h(this.headers),url:this.url})},A.error=function(){var t=new A(null,{status:0,statusText:\"\"});return t.type=\"error\",t};var _=[301,302,303,307,308];A.redirect=function(t,e){if(-1===_.indexOf(e))throw new RangeError(\"Invalid status code\");return new A(null,{status:e,headers:{location:t}})},e.DOMException=t.DOMException;try{new e.DOMException}catch(t){e.DOMException=function(t,e){this.message=t,this.name=e;var n=Error(t);this.stack=n.stack},e.DOMException.prototype=Object.create(Error.prototype),e.DOMException.prototype.constructor=e.DOMException}function S(t,n){return new Promise((function(r,i){var s=new v(t,n);if(s.signal&&s.signal.aborted)return i(new e.DOMException(\"Aborted\",\"AbortError\"));var a=new XMLHttpRequest;function c(){a.abort()}a.onload=function(){var t,e,n={status:a.status,statusText:a.statusText,headers:(t=a.getAllResponseHeaders()||\"\",e=new h,t.replace(/\\r?\\n[\\t ]+/g,\" \").split(/\\r?\\n/).forEach((function(t){var n=t.split(\":\"),r=n.shift().trim();if(r){var o=n.join(\":\").trim();e.append(r,o)}})),e)};n.url=\"responseURL\"in a?a.responseURL:n.headers.get(\"X-Request-URL\");var o=\"response\"in a?a.response:a.responseText;r(new A(o,n))},a.onerror=function(){i(new TypeError(\"Network request failed\"))},a.ontimeout=function(){i(new TypeError(\"Network request failed\"))},a.onabort=function(){i(new e.DOMException(\"Aborted\",\"AbortError\"))},a.open(s.method,s.url,!0),\"include\"===s.credentials?a.withCredentials=!0:\"omit\"===s.credentials&&(a.withCredentials=!1),\"responseType\"in a&&o&&(a.responseType=\"blob\"),s.headers.forEach((function(t,e){a.setRequestHeader(e,t)})),s.signal&&(s.signal.addEventListener(\"abort\",c),a.onreadystatechange=function(){4===a.readyState&&s.signal.removeEventListener(\"abort\",c)}),a.send(void 0===s._bodyInit?null:s._bodyInit)}))}S.polyfill=!0,t.fetch||(t.fetch=S,t.Headers=h,t.Request=v,t.Response=A),e.Headers=h,e.Request=v,e.Response=A,e.fetch=S,Object.defineProperty(e,\"__esModule\",{value:!0})}({})}(r),r.fetch.ponyfill=!0,delete r.fetch.polyfill;var o=r;(e=o.fetch).default=o.fetch,e.fetch=o.fetch,e.Headers=o.Headers,e.Request=o.Request,e.Response=o.Response,t.exports=e}(dn,dn.exports);var ln=Ft(dn.exports);async function hn(t,e){const n=await t.getAccountInfo(e);if(null===n)throw new Error(\"program account not found\");const{program:r}=fn(n.data),o=await t.getAccountInfo(r.programdataAddress);if(null===o)throw new Error(\"program data account not found\");const{programData:i}=fn(o.data);return i}const pn=f.rustEnum([f.struct([],\"uninitialized\"),f.struct([f.option(f.publicKey(),\"authorityAddress\")],\"buffer\"),f.struct([f.publicKey(\"programdataAddress\")],\"program\"),f.struct([f.u64(\"slot\"),f.option(f.publicKey(),\"upgradeAuthorityAddress\")],\"programData\")],void 0,f.u32());function fn(t){return pn.decode(t)}var mn=Object.freeze({__proto__:null,verifiedBuild:async function(t,e,n=5){const r=`https://api.apr.dev/api/v0/program/${e.toString()}/latest?limit=${n}`,[o,i]=await Promise.all([hn(t,e),ln(r)]),s=(await i.json()).filter((t=>!t.aborted&&\"Built\"===t.state&&\"Verified\"===t.verified));if(0===s.length)return null;const a=s[0];return o.slot.toNumber()!==a.verified_slot?null:a},fetchData:hn,decodeUpgradeableLoaderState:fn}),yn=Object.freeze({__proto__:null,sha256:Ye,rpc:it,publicKey:sn,bytes:k,token:un,features:yt,registry:mn});const gn=f.struct([f.publicKey(\"authority\"),f.vecU8(\"data\")]);function wn(t,e){var n,r;let o={};const i=t.args?t.args.length:0;if(e.length>i){if(e.length!==i+1)throw new Error(`provided too many arguments ${e} to instruction ${null==t?void 0:t.name} expecting: ${null!==(r=null===(n=t.args)||void 0===n?void 0:n.map((t=>t.name)))&&void 0!==r?r:[]}`);o=e.pop()}return[e,o]}class vn{static build(t,e,n){if(\"_inner\"===t.name)throw new gt(\"the _inner name is reserved\");const o=(...i)=>{const[s,a]=wn(t,[...i]);P(t.accounts,a.accounts);const c=o.accounts(a.accounts);return void 0!==a.remainingAccounts&&c.push(...a.remainingAccounts),mt(\"debug-logs\")&&console.log(\"Outgoing account metas:\",c),new r({keys:c,programId:n,data:e(t.name,x(t,...s))})};return o.accounts=e=>vn.accountsArray(e,t.accounts,t.name),o}static accountsArray(t,e,n){return t?e.map((e=>{if(void 0!==(\"accounts\"in e?e.accounts:void 0)){const r=t[e.name];return vn.accountsArray(r,e.accounts,n).flat()}{const r=e;let o;try{o=L(t[e.name])}catch(t){throw new Error(`Wrong input type for account \"${e.name}\" in the instruction accounts object${void 0!==n?' for instruction \"'+n+'\"':\"\"}. Expected PublicKey or string.`)}return{pubkey:o,isWritable:r.isMut,isSigner:r.isSigner}}})).flat():[]}}class bn{static build(t,e,n,r){return async(...o)=>{var i;const s=e(...o),[,a]=wn(t,[...o]);if(void 0===r.sendAndConfirm)throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");try{return await r.sendAndConfirm(s,null!==(i=a.signers)&&void 0!==i?i:[],a.options)}catch(t){throw At(t,n)}}}}class An{static build(t,e){return(...r)=>{var o,i,s;const[,a]=wn(t,[...r]),c=new n;if(a.preInstructions&&a.instructions)throw new Error(\"instructions is deprecated, use preInstructions\");return null===(o=a.preInstructions)||void 0===o||o.forEach((t=>c.add(t))),null===(i=a.instructions)||void 0===i||i.forEach((t=>c.add(t))),c.add(e(...r)),null===(s=a.postInstructions)||void 0===s||s.forEach((t=>c.add(t))),c}}}class _n{constructor(t,e,n=lt(),r=new Kt(t)){this.provider=n,this.coder=r,this._idl=t,this._programId=e,this._address=Sn(e),this._sub=null;const[o,i,a]=(()=>{var o;let i={},a={},c={};return null===(o=t.state)||void 0===o||o.methods.forEach((o=>{const u=vn.build(o,((t,e)=>r.instruction.encodeState(t,e)),e);u.accounts=t=>{const r=function(t,e,n,r){if(\"new\"===n.name){const[n]=nn([],t);if(void 0===e.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");return[{pubkey:e.wallet.publicKey,isWritable:!1,isSigner:!0},{pubkey:Sn(t),isWritable:!0,isSigner:!1},{pubkey:n,isWritable:!1,isSigner:!1},{pubkey:s.programId,isWritable:!1,isSigner:!1},{pubkey:t,isWritable:!1,isSigner:!1}]}return P(n.accounts,r),[{pubkey:Sn(t),isWritable:!0,isSigner:!1}]}(e,n,o,t);return r.concat(vn.accountsArray(t,o.accounts,o.name))};const d=An.build(o,u),l=bn.build(o,d,M(t),n),p=h(o.name);i[p]=u,a[p]=d,c[p]=l})),[i,a,c]})();this.instruction=o,this.transaction=i,this.rpc=a}get programId(){return this._programId}async fetch(){const t=this.address(),e=await this.provider.connection.getAccountInfo(t);if(null===e)throw new Error(`Account does not exist ${t.toString()}`);const n=this._idl.state;if(!n)throw new Error(\"State is not specified in IDL.\");if((await jt(n.struct.name)).compare(e.data.slice(0,8)))throw new Error(\"Invalid account discriminator\");return this.coder.state.decode(e.data)}address(){return this._address}subscribe(t){if(null!==this._sub)return this._sub.ee;const e=new y,n=this.provider.connection.onAccountChange(this.address(),(t=>{const n=this.coder.state.decode(t.data);e.emit(\"change\",n)}),t);return this._sub={ee:e,listener:n},e}unsubscribe(){null!==this._sub&&this.provider.connection.removeAccountChangeListener(this._sub.listener).then((async()=>{this._sub=null})).catch(console.error)}}function Sn(t){let[e]=nn([],t);return tn(e,\"unversioned\",t)}class En{constructor(t,e,n,r,o){this._idlAccount=e,this._programId=n,this._provider=null!=r?r:lt(),this._coder=null!=o?o:new Kt(t),this._size=this._coder.accounts.size(e)}get size(){return this._size}get programId(){return this._programId}get provider(){return this._provider}get coder(){return this._coder}async fetchNullable(t,e){const n=await this.getAccountInfo(t,e);return null===n?null:this._coder.accounts.decode(this._idlAccount.name,n.data)}async fetch(t,e){const n=await this.fetchNullable(t,e);if(null===n)throw new Error(`Account does not exist ${t.toString()}`);return n}async fetchMultiple(t,e){return(await X(this._provider.connection,t.map((t=>L(t))),e)).map((t=>null==t?null:this._coder.accounts.decode(this._idlAccount.name,null==t?void 0:t.account.data)))}async all(t){return(await this._provider.connection.getProgramAccounts(this._programId,{commitment:this._provider.connection.commitment,filters:[{memcmp:this.coder.accounts.memcmp(this._idlAccount.name,t instanceof Buffer?t:void 0)},...Array.isArray(t)?t:[]]})).map((({pubkey:t,account:e})=>({publicKey:t,account:this._coder.accounts.decode(this._idlAccount.name,e.data)})))}subscribe(t,e){const n=In.get(t.toString());if(n)return n.ee;const r=new y;t=L(t);const o=this._provider.connection.onAccountChange(t,(t=>{const e=this._coder.accounts.decode(this._idlAccount.name,t.data);r.emit(\"change\",e)}),e);return In.set(t.toString(),{ee:r,listener:o}),r}async unsubscribe(t){let e=In.get(t.toString());e?In&&await this._provider.connection.removeAccountChangeListener(e.listener).then((()=>{In.delete(t.toString())})).catch(console.error):console.warn(\"Address is not subscribed\")}async createInstruction(t,e){const n=this.size;if(void 0===this._provider.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");return s.createAccount({fromPubkey:this._provider.wallet.publicKey,newAccountPubkey:t.publicKey,space:null!=e?e:n,lamports:await this._provider.connection.getMinimumBalanceForRentExemption(null!=e?e:n),programId:this._programId})}async associated(...t){const e=await this.associatedAddress(...t);return await this.fetch(e)}async associatedAddress(...t){return await on(this._programId,...t)}async getAccountInfo(t,e){return await this._provider.connection.getAccountInfo(L(t),e)}}const In=new Map,kn=\"Program log: \".length,Mn=\"Program data: \".length;class xn{constructor(t,e,n){this._programId=t,this._provider=e,this._eventParser=new Pn(t,n),this._eventCallbacks=new Map,this._eventListeners=new Map,this._listenerIdCount=0}addEventListener(t,e){var n;let r=this._listenerIdCount;return this._listenerIdCount+=1,t in this._eventCallbacks||this._eventListeners.set(t,[]),this._eventListeners.set(t,(null!==(n=this._eventListeners.get(t))&&void 0!==n?n:[]).concat(r)),this._eventCallbacks.set(r,[t,e]),void 0!==this._onLogsSubscriptionId||(this._onLogsSubscriptionId=this._provider.connection.onLogs(this._programId,((t,e)=>{if(!t.err)for(const n of this._eventParser.parseLogs(t.logs)){const r=this._eventListeners.get(n.name);r&&r.forEach((r=>{const o=this._eventCallbacks.get(r);if(o){const[,r]=o;r(n.data,e.slot,t.signature)}}))}}))),r}async removeEventListener(t){const e=this._eventCallbacks.get(t);if(!e)throw new Error(`Event listener ${t} doesn't exist!`);const[n]=e;let r=this._eventListeners.get(n);if(!r)throw new Error(`Event listeners don't exist for ${n}!`);this._eventCallbacks.delete(t),r=r.filter((e=>e!==t)),0===r.length&&this._eventListeners.delete(n),0==this._eventCallbacks.size&&(g.ok(0===this._eventListeners.size),void 0!==this._onLogsSubscriptionId&&(await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId),this._onLogsSubscriptionId=void 0))}}class Pn{constructor(t,e){this.coder=e,this.programId=t}*parseLogs(t){const e=new Tn(t),n=new Ln;let r=e.next();for(;null!==r;){let[t,o,i]=this.handleLog(n,r);t&&(yield t),o&&n.push(o),i&&n.pop(),r=e.next()}}handleLog(t,e){return t.stack.length>0&&t.program()===this.programId.toString()?this.handleProgramLog(e):[null,...this.handleSystemLog(e)]}handleProgramLog(t){if(t.startsWith(\"Program log: \")||t.startsWith(\"Program data: \")){const e=t.startsWith(\"Program log: \")?t.slice(kn):t.slice(Mn);return[this.coder.events.decode(e),null,!1]}return[null,...this.handleSystemLog(t)]}handleSystemLog(t){const e=t.split(\":\")[0];return null!==e.match(/^Program (.*) success/g)?[null,!0]:e.startsWith(`Program ${this.programId.toString()} invoke`)?[this.programId.toString(),!1]:e.includes(\"invoke\")?[\"cpi\",!1]:[null,!1]}}class Ln{constructor(){this.stack=[]}program(){return g.ok(this.stack.length>0),this.stack[this.stack.length-1]}push(t){this.stack.push(t)}pop(){g.ok(this.stack.length>0),this.stack.pop()}}class Tn{constructor(t){this.logs=t}next(){if(0===this.logs.length)return null;let t=this.logs[0];return this.logs=this.logs.slice(1),t}}const Cn=new e(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");function zn(){return new Ne(Bn)}const Bn={version:\"0.1.0\",name:\"spl_token\",instructions:[{name:\"initializeMint\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"decimals\",type:\"u8\"},{name:\"mintAuthority\",type:\"publicKey\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]},{name:\"initializeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[]},{name:\"initializeMultisig\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"m\",type:\"u8\"}]},{name:\"transfer\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"approve\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"delegate\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"revoke\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"setAuthority\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"authorityType\",type:\"u8\"},{name:\"newAuthority\",type:{coption:\"publicKey\"}}]},{name:\"mintTo\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"burn\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"closeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!1}],args:[]},{name:\"freezeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"thawAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"transferChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"approveChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"delegate\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"mintToChecked\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"burnChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"initializeAccount2\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"authority\",type:\"publicKey\"}]},{name:\"syncNative\",accounts:[{name:\"account\",isMut:!0,isSigner:!1}],args:[]},{name:\"initializeAccount3\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1}],args:[{name:\"authority\",type:\"publicKey\"}]},{name:\"initializeMultisig2\",accounts:[{name:\"account\",isMut:!0,isSigner:!1}],args:[{name:\"m\",type:\"u8\"}]},{name:\"initializeMint2\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1}],args:[{name:\"decimals\",type:\"u8\"},{name:\"mintAuthority\",type:\"publicKey\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]}],accounts:[{name:\"mint\",type:{kind:\"struct\",fields:[{name:\"mintAuthority\",type:{coption:\"publicKey\"}},{name:\"supply\",type:\"u64\"},{name:\"decimals\",type:\"u8\"},{name:\"isInitialized\",type:\"bool\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]}},{name:\"token\",type:{kind:\"struct\",fields:[{name:\"mint\",type:\"publicKey\"},{name:\"authority\",type:\"publicKey\"},{name:\"amount\",type:\"u64\"},{name:\"delegate\",type:{coption:\"publicKey\"}},{name:\"state\",type:\"u8\"},{name:\"isNative\",type:{coption:\"u64\"}},{name:\"delegatedAmount\",type:\"u64\"},{name:\"closeAuthority\",type:{coption:\"publicKey\"}}]}}]};class On{constructor(t,e,n,r,o,i){this._args=t,this._accounts=e,this._provider=n,this._programId=r,this._idlIx=o,this._accountStore=new Dn(n,i)}async resolve(){for(let t=0;t<this._idlIx.accounts.length;t+=1){const e=this._idlIx.accounts[t],n=h(e.name);if(!e.isSigner||this._accounts[n])Reflect.has(On.CONST_ACCOUNTS,n)&&!this._accounts[n]&&(this._accounts[n]=On.CONST_ACCOUNTS[n]);else{if(void 0===this._provider.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");this._accounts[n]=this._provider.wallet.publicKey}}for(let t=0;t<this._idlIx.accounts.length;t+=1){const e=this._idlIx.accounts[t],n=h(e.name);e.pda&&e.pda.seeds.length>0&&!this._accounts[n]&&await this.autoPopulatePda(e)}}async autoPopulatePda(t){if(!t.pda||!t.pda.seeds)throw new Error(\"Must have seeds\");const n=await Promise.all(t.pda.seeds.map((t=>this.toBuffer(t)))),r=await this.parseProgramId(t),[o]=await e.findProgramAddress(n,r);this._accounts[h(t.name)]=o}async parseProgramId(t){var n;if(!(null===(n=t.pda)||void 0===n?void 0:n.programId))return this._programId;switch(t.pda.programId.kind){case\"const\":return new e(this.toBufferConst(t.pda.programId.value));case\"arg\":return this.argValue(t.pda.programId);case\"account\":return await this.accountValue(t.pda.programId);default:throw new Error(`Unexpected program seed kind: ${t.pda.programId.kind}`)}}async toBuffer(t){switch(t.kind){case\"const\":return this.toBufferConst(t);case\"arg\":return await this.toBufferArg(t);case\"account\":return await this.toBufferAccount(t);default:throw new Error(`Unexpected seed kind: ${t.kind}`)}}toBufferConst(t){return this.toBufferValue(t.type,t.value)}async toBufferArg(t){const e=this.argValue(t);return this.toBufferValue(t.type,e)}argValue(t){const e=h(t.path.split(\".\")[0]),n=this._idlIx.args.findIndex((t=>t.name===e));if(-1===n)throw new Error(`Unable to find argument for seed: ${e}`);return this._args[n]}async toBufferAccount(t){const e=await this.accountValue(t);return this.toBufferValue(t.type,e)}async accountValue(t){const e=t.path.split(\".\"),n=e[0],r=this._accounts[h(n)];if(1===e.length)return r;const o=await this._accountStore.fetchAccount(t.account,r);return this.parseAccountValue(o,e.slice(1))}parseAccountValue(t,e){let n;for(;e.length>0;)n=t[h(e[0])],e=e.slice(1);return n}toBufferValue(t,e){switch(t){case\"u8\":return Buffer.from([e]);case\"u16\":let n=Buffer.alloc(2);return n.writeUInt16LE(e),n;case\"u32\":let r=Buffer.alloc(4);return r.writeUInt32LE(e),r;case\"u64\":let o=Buffer.alloc(8);return o.writeBigUInt64LE(BigInt(e)),o;case\"string\":return Buffer.from(b(e));case\"publicKey\":return e.toBuffer();default:if(t.array)return Buffer.from(e);throw new Error(`Unexpected seed type: ${t}`)}}}On.CONST_ACCOUNTS={associatedTokenProgram:cn,rent:a,systemProgram:s.programId,tokenProgram:an};class Dn{constructor(t,e){this._provider=t,this._accounts=e,this._cache=new Map}async fetchAccount(t,e){const n=e.toString();if(!this._cache.has(n))if(\"TokenAccount\"===t){const t=await this._provider.connection.getAccountInfo(e);if(null===t)throw new Error(`invalid account info for ${n}`);const r=zn().accounts.decode(\"token\",t.data);this._cache.set(n,r)}else{const r=this._accounts[h(t)].fetch(e);this._cache.set(n,r)}return this._cache.get(n)}}class Nn{static build(t,e,n,r,o,i,s,a,c){return(...u)=>new Rn(u,r,o,i,s,a,t,e,n,c)}}class Rn{constructor(t,e,n,r,o,i,s,a,c,u){this._args=t,this._ixFn=e,this._txFn=n,this._rpcFn=r,this._simulateFn=o,this._viewFn=i,this._accounts={},this._remainingAccounts=[],this._signers=[],this._preInstructions=[],this._postInstructions=[],this._autoResolveAccounts=!0,this._accountsResolver=new On(t,this._accounts,s,a,c,u)}async pubkeys(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._accounts}accounts(t){return this._autoResolveAccounts=!0,Object.assign(this._accounts,t),this}accountsStrict(t){return this._autoResolveAccounts=!1,Object.assign(this._accounts,t),this}signers(t){return this._signers=this._signers.concat(t),this}remainingAccounts(t){return this._remainingAccounts=this._remainingAccounts.concat(t),this}preInstructions(t){return this._preInstructions=this._preInstructions.concat(t),this}postInstructions(t){return this._postInstructions=this._postInstructions.concat(t),this}async rpc(t){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._rpcFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async view(t){if(this._autoResolveAccounts&&await this._accountsResolver.resolve(),!this._viewFn)throw new Error(\"Method does not support views\");return this._viewFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async simulate(t){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._simulateFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async instruction(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._ixFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions})}async transaction(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._txFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions})}}class Vn{constructor(t,e,n,r){e=L(e),n||(n=lt()),this._idl=t,this._provider=n,this._programId=e,this._coder=null!=r?r:new Kt(t),this._events=new xn(this._programId,n,this._coder);const[o,i,s,a,c,u,d,l]=class{static build(t,e,n,r){const o={},i={},s={},a={},c={},u={},d=M(t),l=t.accounts?class{static build(t,e,n,r){var o;const i={};return null===(o=t.accounts)||void 0===o||o.forEach((o=>{const s=h(o.name);i[s]=new En(t,o,n,r,e)})),i}}.build(t,e,n,r):{},p=class{static build(t,e,n,r){if(void 0!==t.state)return new _n(t,n,r,e)}}.build(t,e,n,r);return t.instructions.forEach((p=>{const f=vn.build(p,((t,n)=>e.instruction.encode(t,n)),n),m=An.build(p,f),y=bn.build(p,m,d,r),g=class{static build(t,e,n,r,o,i,s){return async(...a)=>{var c;const u=e(...a),[,d]=wn(t,[...a]);let l;if(void 0===r.simulate)throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");try{l=await r.simulate(u,d.signers,null===(c=d.options)||void 0===c?void 0:c.commitment)}catch(t){throw At(t,n)}if(void 0===l)throw new Error(\"Unable to simulate transaction\");const h=l.logs;if(!h)throw new Error(\"Simulated logs not found\");const p=[];if(s.events){let t=new Pn(i,o);for(const e of t.parseLogs(h))p.push(e)}return{events:p,raw:h}}}}.build(p,m,d,r,e,n,t),w=class{static build(t,e,n,r){const o=e.accounts.find((t=>t.isMut)),i=!!e.returns;if(!o&&i)return async(...o)=>{var i,s;let a=await n(...o);const c=`Program return: ${t} `;let u=a.raw.find((t=>t.startsWith(c)));if(!u)throw new Error(\"View expected return log\");let d=E(u.slice(c.length)),l=e.returns;if(!l)throw new Error(\"View expected return type\");return Lt.fieldLayout({type:l},Array.from([...null!==(i=r.accounts)&&void 0!==i?i:[],...null!==(s=r.types)&&void 0!==s?s:[]])).decode(d)}}}.build(n,p,g,t),v=Nn.build(r,n,p,f,m,y,g,w,l),b=h(p.name);i[b]=f,s[b]=m,o[b]=y,a[b]=g,c[b]=v,w&&(u[b]=w)})),[o,i,s,l,a,c,p,u]}}.build(t,this._coder,e,n);this.rpc=o,this.instruction=i,this.transaction=s,this.account=a,this.simulate=c,this.methods=u,this.state=d,this.views=l}get programId(){return this._programId}get idl(){return this._idl}get coder(){return this._coder}get provider(){return this._provider}static async at(t,e){const n=L(t),r=await Vn.fetchIdl(n,e);if(!r)throw new Error(`IDL not found for program: ${t.toString()}`);return new Vn(r,n,e)}static async fetchIdl(t,n){n=null!=n?n:lt();const r=L(t),o=await async function(t){const n=(await e.findProgramAddress([],t))[0];return await e.createWithSeed(n,\"anchor:idl\",t)}(r),i=await n.connection.getAccountInfo(o);if(!i)return null;let s=(a=i.data.slice(8),gn.decode(a));var a;const c=m(s.data);return JSON.parse(v(c))}addEventListener(t,e){return this._events.addEventListener(t,e)}async removeEventListener(t){return await this._events.removeEventListener(t)}}class Un{constructor(t){}encode(t,e){if(\"create\"===h(t))return Buffer.alloc(0);throw new Error(`Invalid instruction: ${t}`)}encodeState(t,e){throw new Error(\"SPL associated token does not have state\")}}class jn{constructor(t){}encode(t,e){throw new Error(\"SPL associated token does not have state\")}decode(t){throw new Error(\"SPL associated token does not have state\")}}class $n{constructor(t){this.idl=t}async encode(t,e){throw new Error(`Invalid account name: ${t}`)}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){throw new Error(`Invalid account name: ${t}`)}memcmp(t,e){throw new Error(`Invalid account name: ${t}`)}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}class Kn{constructor(t){}decode(t){throw new Error(\"SPL associated token program does not have events\")}}class qn{constructor(t){}encode(t,e){throw new Error(\"SPL associated token does not have user-defined types\")}decode(t,e){throw new Error(\"SPL associated token does not have user-defined types\")}}class Fn{constructor(t){this.instruction=new Un(t),this.accounts=new $n(t),this.events=new Kn(t),this.state=new jn(t),this.types=new qn(t)}}const Wn=new e(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");function Gn(t){return new Vn(Hn,Wn,t,new Fn(Hn))}const Hn={version:\"0.1.0\",name:\"spl_associated_token\",instructions:[{name:\"create\",accounts:[{name:\"authority\",isMut:!0,isSigner:!0},{name:\"associatedAccount\",isMut:!0,isSigner:!1},{name:\"owner\",isMut:!1,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"systemProgram\",isMut:!1,isSigner:!1},{name:\"tokenProgram\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[]}]};class Jn{static token(t){return function(t){return new Vn(Bn,Cn,t,zn())}(t)}static associatedToken(t){return Gn(t)}}const Zn=new e(\"11111111111111111111111111111111\");function Xn(t){return new Vn(Qn,Zn,t,new Qe(Qn))}const Qn={version:\"0.1.0\",name:\"system_program\",instructions:[{name:\"createAccount\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!0}],args:[{name:\"lamports\",type:\"u64\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"assign\",accounts:[{name:\"pubkey\",isMut:!0,isSigner:!0}],args:[{name:\"owner\",type:\"publicKey\"}]},{name:\"transfer\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1}],args:[{name:\"lamports\",type:\"u64\"}]},{name:\"createAccountWithSeed\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"lamports\",type:\"u64\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"advanceNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"withdrawNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"lamports\",type:\"u64\"}]},{name:\"initializeNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!0},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"authorizeNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"allocate\",accounts:[{name:\"pubkey\",isMut:!0,isSigner:!0}],args:[{name:\"space\",type:\"u64\"}]},{name:\"allocateWithSeed\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"assignWithSeed\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"transferWithSeed\",accounts:[{name:\"from\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1}],args:[{name:\"lamports\",type:\"u64\"},{name:\"seed\",type:\"string\"},{name:\"owner\",type:\"publicKey\"}]}],accounts:[{name:\"nonce\",type:{kind:\"struct\",fields:[{name:\"version\",type:\"u32\"},{name:\"state\",type:\"u32\"},{name:\"authorizedPubkey\",type:\"publicKey\"},{name:\"nonce\",type:\"publicKey\"},{name:\"feeCalculator\",type:{defined:\"FeeCalculator\"}}]}}],types:[{name:\"FeeCalculator\",type:{kind:\"struct\",fields:[{name:\"lamportsPerSignature\",type:\"u64\"}]}}]};class Yn{static system(t){return Xn(t)}}export{Dt as ACCOUNT_DISCRIMINATOR_SIZE,En as AccountClient,vt as AnchorError,st as AnchorProvider,Nt as BorshAccountsCoder,Kt as BorshCoder,Rt as BorshEventCoder,Tt as BorshInstructionCoder,Ut as BorshStateCoder,xn as EventManager,Pn as EventParser,gt as IdlError,_t as LangErrorCode,St as LangErrorMessage,Nn as MethodsBuilderFactory,Yn as Native,Vn as Program,bt as ProgramError,wt as ProgramErrorStack,Jn as Spl,Ne as SplTokenCoder,_n as StateClient,Qe as SystemCoder,Vt as eventDiscriminator,lt as getProvider,M as parseIdlErrors,dt as setProvider,wn as splitArgsAndCtx,jt as stateDiscriminator,x as toInstruction,L as translateAddress,At as translateError,yn as utils,P as validateAccounts};\n//# sourceMappingURL=index.js.map\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = buffer_layout_1.blob(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, 'le');\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, 'le', this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout(buffer_layout_1.blob(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = buffer_layout_1.u8();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error('Invalid option ' + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error('Invalid option ' + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout(buffer_layout_1.u8(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error('Invalid bool: ' + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.seq(elementLayout, buffer_layout_1.offset(length, -length.span), 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, values => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = buffer_layout_1.struct([\n        u64('tag'),\n        layout.replicate('data'),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error('Invalid tag, expected: ' +\n                tag.toString('hex') +\n                ', got: ' +\n                receivedTag.toString('hex'));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, data => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.blob(buffer_layout_1.offset(length, -length.span), 'data'),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, data => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), data => data.toString('utf-8'), s => Buffer.from(s, 'utf-8'), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = buffer_layout_1.union(discriminant !== null && discriminant !== void 0 ? discriminant : buffer_layout_1.u8(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = buffer_layout_1.struct([\n        buffer_layout_1.seq(elementLayout, length, 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, values => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.seq(new MapEntryLayout(keyLayout, valueLayout), buffer_layout_1.offset(length, -length.span), 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), values => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.IDL = void 0;\nexports.IDL = {\n    \"version\": \"0.0.1\",\n    \"name\": \"merkle_distributor\",\n    \"instructions\": [\n        {\n            \"name\": \"newDistributor\",\n            \"docs\": [\n                \"READ THE FOLLOWING:\",\n                \"\",\n                \"This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.\",\n                \"\",\n                \"An attack could look like:\",\n                \"- A legitimate user opens a new distributor.\",\n                \"- Someone observes the call to this instruction.\",\n                \"- They replace the clawback_receiver, admin, or time parameters with their own.\",\n                \"\",\n                \"One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.\",\n                \"Then the attacker can steal all funds from the distributor to their own clawback_receiver account.\",\n                \"\",\n                \"HOW TO AVOID:\",\n                \"- When you call into this instruction, ensure your transaction succeeds.\",\n                \"- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and\",\n                \"assert the parameters are what you expect, most importantly the clawback_receiver and admin.\",\n                \"- If your transaction fails, double check the value on-chain matches what you expect.\"\n            ],\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"[MerkleDistributor].\"\n                    ],\n                    \"pda\": {\n                        \"seeds\": [\n                            {\n                                \"kind\": \"const\",\n                                \"type\": \"string\",\n                                \"value\": \"MerkleDistributor\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"account\": \"Mint\",\n                                \"path\": \"mint\"\n                            },\n                            {\n                                \"kind\": \"arg\",\n                                \"type\": \"u64\",\n                                \"path\": \"version\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"clawbackReceiver\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Clawback receiver token account\"\n                    ]\n                },\n                {\n                    \"name\": \"mint\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The mint to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenVault\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Token vault\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin wallet, responsible for creating the distributor and paying for the transaction.\",\n                        \"Also has the authority to set the clawback receiver and change itself.\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"associatedTokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [Associated Token] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [Token] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"version\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"root\",\n                    \"type\": {\n                        \"array\": [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"maxTotalClaim\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"maxNumNodes\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"startTs\",\n                    \"type\": \"i64\"\n                },\n                {\n                    \"name\": \"endTs\",\n                    \"type\": \"i64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"newClaim\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"claimStatus\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Claim status PDA\"\n                    ],\n                    \"pda\": {\n                        \"seeds\": [\n                            {\n                                \"kind\": \"const\",\n                                \"type\": \"string\",\n                                \"value\": \"ClaimStatus\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"path\": \"claimant\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"account\": \"MerkleDistributor\",\n                                \"path\": \"distributor\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"from\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"to\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Account to send the claimed tokens to.\"\n                    ]\n                },\n                {\n                    \"name\": \"claimant\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Who is claiming the tokens.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"SPL [Token] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"index\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"proof\",\n                    \"type\": {\n                        \"vec\": {\n                            \"array\": [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    }\n                }\n            ]\n        },\n        {\n            \"name\": \"clawback\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"from\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"to\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The Clawback token account.\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin account\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"SPL [Token] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"setClawbackReceiver\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"newClawbackAccount\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"New clawback account\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": []\n        },\n        {\n            \"name\": \"setAdmin\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                },\n                {\n                    \"name\": \"newAdmin\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"New admin account\"\n                    ]\n                }\n            ],\n            \"args\": []\n        },\n        {\n            \"name\": \"setTimestamp\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"startTs\",\n                    \"type\": \"i64\"\n                },\n                {\n                    \"name\": \"endTs\",\n                    \"type\": \"i64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"setMerkleRoot\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"root\",\n                    \"type\": {\n                        \"array\": [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"maxTotalClaim\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"maxNumNodes\",\n                    \"type\": \"u64\"\n                }\n            ]\n        }\n    ],\n    \"accounts\": [\n        {\n            \"name\": \"claimStatus\",\n            \"docs\": [\n                \"Holds whether or not a claimant has claimed tokens.\"\n            ],\n            \"type\": {\n                \"kind\": \"struct\",\n                \"fields\": [\n                    {\n                        \"name\": \"isClaimed\",\n                        \"docs\": [\n                            \"If true, the tokens have been claimed.\"\n                        ],\n                        \"type\": \"bool\"\n                    },\n                    {\n                        \"name\": \"claimant\",\n                        \"docs\": [\n                            \"Authority that claimed the tokens.\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"claimedAt\",\n                        \"docs\": [\n                            \"When the tokens were claimed.\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"amount\",\n                        \"docs\": [\n                            \"Amount of tokens claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    }\n                ]\n            }\n        },\n        {\n            \"name\": \"merkleDistributor\",\n            \"docs\": [\n                \"State for the account which distributes tokens.\"\n            ],\n            \"type\": {\n                \"kind\": \"struct\",\n                \"fields\": [\n                    {\n                        \"name\": \"bump\",\n                        \"docs\": [\n                            \"Bump seed.\"\n                        ],\n                        \"type\": \"u8\"\n                    },\n                    {\n                        \"name\": \"version\",\n                        \"docs\": [\n                            \"Version of the airdrop\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"root\",\n                        \"docs\": [\n                            \"The 256-bit merkle root.\"\n                        ],\n                        \"type\": {\n                            \"array\": [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    },\n                    {\n                        \"name\": \"mint\",\n                        \"docs\": [\n                            \"[Mint] of the token to be distributed.\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"tokenVault\",\n                        \"docs\": [\n                            \"Token Address of the vault\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"maxTotalClaim\",\n                        \"docs\": [\n                            \"Maximum number of tokens that can ever be claimed from this [MerkleDistributor].\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"maxNumNodes\",\n                        \"docs\": [\n                            \"Maximum number of nodes in [MerkleDistributor].\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"totalAmountClaimed\",\n                        \"docs\": [\n                            \"Total amount of tokens that have been claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"numNodesClaimed\",\n                        \"docs\": [\n                            \"Number of nodes that have been claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"startTs\",\n                        \"docs\": [\n                            \"Claim time start (Unix Timestamp)\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"endTs\",\n                        \"docs\": [\n                            \"Claim time end (Unix Timestamp)\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"clawbackReceiver\",\n                        \"docs\": [\n                            \"Clawback receiver\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"admin\",\n                        \"docs\": [\n                            \"Admin wallet\"\n                        ],\n                        \"type\": \"publicKey\"\n                    }\n                ]\n            }\n        }\n    ],\n    \"events\": [\n        {\n            \"name\": \"NewClaimEvent\",\n            \"fields\": [\n                {\n                    \"name\": \"claimant\",\n                    \"type\": \"publicKey\",\n                    \"index\": false\n                },\n                {\n                    \"name\": \"timestamp\",\n                    \"type\": \"i64\",\n                    \"index\": false\n                }\n            ]\n        },\n        {\n            \"name\": \"ClaimedEvent\",\n            \"fields\": [\n                {\n                    \"name\": \"claimant\",\n                    \"type\": \"publicKey\",\n                    \"index\": false\n                },\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\",\n                    \"index\": false\n                }\n            ]\n        }\n    ],\n    \"errors\": [\n        {\n            \"code\": 6000,\n            \"name\": \"InvalidProof\",\n            \"msg\": \"Invalid Merkle proof\"\n        },\n        {\n            \"code\": 6001,\n            \"name\": \"ExceededMaxClaim\",\n            \"msg\": \"Exceeded maximum claim amount\"\n        },\n        {\n            \"code\": 6002,\n            \"name\": \"MaxNodesExceeded\",\n            \"msg\": \"Exceeded maximum node count\"\n        },\n        {\n            \"code\": 6003,\n            \"name\": \"Unauthorized\",\n            \"msg\": \"Account is not authorized to execute this instruction\"\n        },\n        {\n            \"code\": 6004,\n            \"name\": \"OwnerMismatch\",\n            \"msg\": \"Token account owner did not match intended owner\"\n        },\n        {\n            \"code\": 6005,\n            \"name\": \"SameClawbackReceiver\",\n            \"msg\": \"New and old Clawback receivers are identical\"\n        },\n        {\n            \"code\": 6006,\n            \"name\": \"SameAdmin\",\n            \"msg\": \"New and old admin are identical\"\n        },\n        {\n            \"code\": 6007,\n            \"name\": \"ClaimExpired\",\n            \"msg\": \"Claim window expired\"\n        },\n        {\n            \"code\": 6008,\n            \"name\": \"ArithmeticError\",\n            \"msg\": \"Arithmetic Error (overflow/underflow)\"\n        },\n        {\n            \"code\": 6009,\n            \"name\": \"StartTimestampAfterEnd\",\n            \"msg\": \"Start Timestamp cannot be after end Timestamp\"\n        },\n        {\n            \"code\": 6010,\n            \"name\": \"TimestampsNotInFuture\",\n            \"msg\": \"Timestamps cannot be in the past\"\n        },\n        {\n            \"code\": 6011,\n            \"name\": \"DistributionAlreadyStarted\",\n            \"msg\": \"Distribution already started\"\n        },\n        {\n            \"code\": 6012,\n            \"name\": \"InsufficientClawbackAmount\",\n            \"msg\": \"Insufficient clawback amount\"\n        }\n    ]\n};\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DistributorClient = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst common_sdk_1 = require(\"@orca-so/common-sdk\");\nconst token_utils_1 = require(\"@saberhq/token-utils\");\nconst utils_1 = require(\"../utils\");\nconst buffer_layout_1 = require(\"@solana/buffer-layout\");\nconst buffer_layout_utils_1 = require(\"@solana/buffer-layout-utils\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nclass DistributorClient {\n    constructor(ctx, pda) {\n        this.ctx = ctx;\n        this.pda = pda;\n    }\n    newDistributor(mint, root, clawbackReceiver, maxTotalClaim, maxNumNodes, startTs, endTs, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const clawbackReceiverATA = (0, token_utils_1.getATAAddressSync)({ mint, owner: clawbackReceiver });\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const clawbackTokenAccountInfo = yield this.ctx.connection.getAccountInfo(clawbackReceiverATA);\n            if (clawbackTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [\n                        spl_token_1.Token.createAssociatedTokenAccountInstruction(token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, token_utils_1.TOKEN_PROGRAM_ID, mint, clawbackReceiverATA, clawbackReceiver, this.ctx.wallet.publicKey)\n                    ],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const tokenVault = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const newDistributorIx = yield this.ctx.methods.newDistributor({\n                accounts: {\n                    distributor: distributor.key,\n                    clawbackReceiver: clawbackReceiverATA,\n                    mint,\n                    tokenVault,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    version,\n                    root: (0, utils_1.toBytes32Array)(root),\n                    maxTotalClaim,\n                    maxNumNodes,\n                    startTs,\n                    endTs,\n                },\n            });\n            if (newDistributorIx.ix) {\n                tx.addInstruction(newDistributorIx.ix);\n            }\n            return tx;\n        });\n    }\n    setAdmin(mint, newAdmin, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setAdmin({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                    newAdmin\n                },\n                inputs: {},\n            })).toTx();\n            return tx;\n        });\n    }\n    setClawbackReceiver(mint, clawbackReceiver, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const clawbackReceiverATA = (0, token_utils_1.getATAAddressSync)({ mint, owner: clawbackReceiver });\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const clawbackTokenAccountInfo = yield this.ctx.connection.getAccountInfo(clawbackReceiverATA);\n            if (clawbackTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [\n                        spl_token_1.Token.createAssociatedTokenAccountInstruction(token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, token_utils_1.TOKEN_PROGRAM_ID, mint, clawbackReceiverATA, clawbackReceiver, this.ctx.wallet.publicKey)\n                    ],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const setClawbackReceiverIx = yield this.ctx.methods.setClawbackReceiver({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                    newClawbackAccount: clawbackReceiverATA,\n                },\n                inputs: {},\n            });\n            if (setClawbackReceiverIx.ix) {\n                tx.addInstruction(setClawbackReceiverIx.ix);\n            }\n            return tx;\n        });\n    }\n    setMerkleRoot(mint, root, maxTotalClaim, maxNumNodes, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setMerkleRoot({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    root: (0, utils_1.toBytes32Array)(root),\n                    maxTotalClaim,\n                    maxNumNodes,\n                },\n            })).toTx();\n            return tx;\n        });\n    }\n    setTimestamp(mint, startTs, endTs, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setTimestamp({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    startTs,\n                    endTs,\n                },\n            })).toTx();\n            return tx;\n        });\n    }\n    deposit(mint, amount, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            let distributorData;\n            try {\n                distributorData = yield this.ctx.fetcher.getOneMerkleDistributor(distributor.key);\n            }\n            catch (error) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const fromAssociatedTokenAccount = (0, token_utils_1.getATAAddressSync)({\n                mint,\n                owner: this.ctx.wallet.publicKey\n            });\n            // tokenVault is initialized when creating the distributor\n            const tokenVault = distributorData.tokenVault;\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const keys = (0, utils_1.addSigners)([\n                { pubkey: fromAssociatedTokenAccount, isSigner: false, isWritable: true },\n                { pubkey: tokenVault, isSigner: false, isWritable: true },\n            ], this.ctx.wallet.publicKey, []);\n            const transferInstructionData = (0, buffer_layout_1.struct)([(0, buffer_layout_1.u8)('instruction'), (0, buffer_layout_utils_1.u64)('amount')]);\n            const data = Buffer.alloc(transferInstructionData.span);\n            transferInstructionData.encode({ instruction: utils_1.TokenInstruction.Transfer, amount: BigInt(amount.toString()) }, data);\n            tx.addInstruction({\n                instructions: [new web3_js_1.TransactionInstruction({\n                        keys,\n                        programId: token_utils_1.TOKEN_PROGRAM_ID,\n                        data\n                    })],\n                cleanupInstructions: [],\n                signers: []\n            });\n            return tx;\n        });\n    }\n    newClaim(mint, index, amount, proof, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (proof.length === 0) {\n                throw new Error(\"Proof is empty\");\n            }\n            const distributor = this.pda.distributor(mint, version);\n            const claimStatus = this.pda.claim_status(this.ctx.wallet.publicKey, distributor.key);\n            try {\n                yield this.ctx.program.account.claimStatus.fetch(claimStatus.key);\n                throw Error(`Already claimed`);\n            }\n            catch (error) {\n                if (!error.message.includes(\"Account does not exist\")) {\n                    throw error;\n                }\n            }\n            const from = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const to = (0, token_utils_1.getATAAddressSync)({ mint, owner: this.ctx.wallet.publicKey });\n            const toTokenAccountInfo = yield this.ctx.connection.getAccountInfo(to);\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            if (toTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [(0, token_utils_1.createATAInstruction)({ address: to, mint, owner: this.ctx.wallet.publicKey, payer: this.ctx.wallet.publicKey })],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const newClaimIx = yield this.ctx.methods.newClaim({\n                accounts: {\n                    distributor: distributor.key,\n                    claimStatus: claimStatus.key,\n                    from,\n                    to,\n                    claimant: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    index,\n                    amount,\n                    proof: proof.map((p) => (0, utils_1.toBytes32Array)(p)),\n                },\n            });\n            if (newClaimIx.ix) {\n                tx.addInstruction(newClaimIx.ix);\n            }\n            return tx;\n        });\n    }\n    clawback(mint, amount, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            amount = amount.gt(new anchor_1.BN(0)) ? amount : new anchor_1.BN(0);\n            const from = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const tx = (yield this.ctx.methods.clawback({\n                accounts: {\n                    distributor: distributor.key,\n                    from,\n                    to: distributorData.clawbackReceiver,\n                    claimant: this.ctx.wallet.publicKey,\n                },\n                inputs: { amount },\n            })).toTx();\n            return tx;\n        });\n    }\n}\nexports.DistributorClient = DistributorClient;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./distributor-client\"), exports);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MERKLE_DISTRIBUTOR_PROGRAM_ID = exports.PROGRAM_ID = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nexports.PROGRAM_ID = new web3_js_1.PublicKey(\"EqaUmBqKuUsS8C1HwvckQymErozrmzzivxkP9CazU2mX\");\nexports.MERKLE_DISTRIBUTOR_PROGRAM_ID = exports.PROGRAM_ID;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Context = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst types_1 = require(\"./types\");\nconst fetcher_1 = require(\"./fetcher\");\nconst methods_1 = require(\"./methods\");\n/**\n * @category Core\n */\nclass Context {\n    static from(connection, wallet, programId, fetcher = new fetcher_1.AccountFetcher(connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        const anchorProvider = new anchor_1.AnchorProvider(connection, wallet, opts);\n        const program = new anchor_1.Program(types_1.MerkleDistributorIDL, programId, anchorProvider);\n        return new Context(anchorProvider, anchorProvider.wallet, program, fetcher, opts);\n    }\n    static fromWorkspace(provider, program, fetcher = new fetcher_1.AccountFetcher(provider.connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        return new Context(provider, provider.wallet, program, fetcher, opts);\n    }\n    static withProvider(provider, programId, fetcher = new fetcher_1.AccountFetcher(provider.connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        const program = new anchor_1.Program(types_1.MerkleDistributorIDL, programId, provider);\n        return new Context(provider, provider.wallet, program, fetcher, opts);\n    }\n    constructor(provider, wallet, program, fetcher, opts) {\n        this.connection = provider.connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        // It's a hack but it works on Anchor workspace *shrug*\n        this.program = program;\n        this.provider = provider;\n        this.fetcher = fetcher;\n        this.methods = new methods_1.Methods(this);\n    }\n}\nexports.Context = Context;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AccountFetcher = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst tiny_invariant_1 = __importDefault(require(\"tiny-invariant\"));\nconst parsing_1 = require(\"./parsing\");\nclass AccountFetcher {\n    constructor(connection, cache) {\n        this._cache = {};\n        this.connection = connection;\n        this._cache = cache !== null && cache !== void 0 ? cache : {};\n    }\n    /*** Public Methods ***/\n    /**\n     * Update the cached value of all entities currently in the cache.\n     * Uses batched rpc request for network efficient fetch.\n     */\n    refreshAll() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const addresses = Object.keys(this._cache);\n            const data = yield this.bulkRequest(addresses);\n            for (const [idx, [key, cachedContent]] of Object.entries(this._cache).entries()) {\n                const entity = cachedContent.entity;\n                const value = entity.parse(data[idx]);\n                this._cache[key] = { entity, value };\n            }\n        });\n    }\n    /*** Private Methods ***/\n    /**\n     * Retrieve from cache or fetch from rpc, an account\n     */\n    get(address, entity, refresh) {\n        var _a;\n        return __awaiter(this, void 0, void 0, function* () {\n            const key = address.toBase58();\n            const cachedValue = (_a = this._cache[key]) === null || _a === void 0 ? void 0 : _a.value;\n            if (cachedValue !== undefined && !refresh) {\n                return cachedValue;\n            }\n            const accountInfo = yield this.connection.getAccountInfo(address);\n            const accountData = accountInfo === null || accountInfo === void 0 ? void 0 : accountInfo.data;\n            const value = entity.parse(accountData);\n            this._cache[key] = { entity, value };\n            return value;\n        });\n    }\n    /**\n     * Retrieve from cache or fetch from rpc, a list of accounts\n     */\n    list(addresses, entity, refresh) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const keys = addresses.map((address) => address.toBase58());\n            const cachedValues = keys.map((key) => {\n                var _a;\n                return [\n                    key,\n                    refresh ? undefined : (_a = this._cache[key]) === null || _a === void 0 ? void 0 : _a.value,\n                ];\n            });\n            /* Look for accounts not found in cache */\n            const undefinedAccounts = [];\n            cachedValues.forEach(([key, value], cacheIndex) => {\n                if (value === undefined) {\n                    undefinedAccounts.push({ cacheIndex, key });\n                }\n            });\n            /* Fetch accounts not found in cache */\n            if (undefinedAccounts.length > 0) {\n                const data = yield this.bulkRequest(undefinedAccounts.map((account) => account.key));\n                undefinedAccounts.forEach(({ cacheIndex, key }, dataIndex) => {\n                    var _a;\n                    const value = entity.parse(data[dataIndex]);\n                    (0, tiny_invariant_1.default)(((_a = cachedValues[cacheIndex]) === null || _a === void 0 ? void 0 : _a[1]) === undefined, \"unexpected non-undefined value\");\n                    cachedValues[cacheIndex] = [key, value];\n                    this._cache[key] = { entity, value };\n                });\n            }\n            const result = cachedValues\n                .map(([_, value]) => value)\n                .filter((value) => value !== undefined);\n            (0, tiny_invariant_1.default)(result.length === addresses.length, \"not enough results fetched\");\n            return result;\n        });\n    }\n    /**\n     * Make batch rpc request\n     */\n    bulkRequest(addresses) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const responses = [];\n            const chunk = 100; // getMultipleAccounts has limitation of 100 accounts per request\n            for (let i = 0; i < addresses.length; i += chunk) {\n                const addressesSubset = addresses.slice(i, i + chunk);\n                const res = this.connection._rpcRequest(\"getMultipleAccounts\", [\n                    addressesSubset,\n                    { commitment: this.connection.commitment },\n                ]);\n                responses.push(res);\n            }\n            const combinedResult = [];\n            (yield Promise.all(responses)).forEach((res) => {\n                var _a;\n                (0, tiny_invariant_1.default)(!res.error, `bulkRequest result error: ${res.error}`);\n                (0, tiny_invariant_1.default)(!!((_a = res.result) === null || _a === void 0 ? void 0 : _a.value), \"bulkRequest no value\");\n                res.result.value.forEach((account) => {\n                    if (!account || account.data[1] !== \"base64\") {\n                        combinedResult.push(null);\n                    }\n                    else {\n                        combinedResult.push(Buffer.from(account.data[0], account.data[1]));\n                    }\n                });\n            });\n            (0, tiny_invariant_1.default)(combinedResult.length === addresses.length, \"bulkRequest not enough results\");\n            return combinedResult;\n        });\n    }\n    // YOUR CODE:\n    getOneMerkleDistributor(address, refresh = false) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this.get((0, anchor_1.translateAddress)(address), parsing_1.ParsableMerkleDistributor, refresh);\n        });\n    }\n    getOneClaimStatus(address, refresh = false) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this.get((0, anchor_1.translateAddress)(address), parsing_1.ParsableClaimStatus, refresh);\n        });\n    }\n}\nexports.AccountFetcher = AccountFetcher;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./fetcher\"), exports);\n__exportStar(require(\"./parsing\"), exports);\n","\"use strict\";\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ParsableClaimStatus = exports.ParsableMerkleDistributor = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst types_1 = require(\"../types\");\n/**\n * Class decorator to define an interface with static methods\n * Reference: https://github.com/Microsoft/TypeScript/issues/13462#issuecomment-295685298\n */\nfunction staticImplements() {\n    return (constructor) => {\n        constructor;\n    };\n}\nfunction parseAnchorAccount(accountName, data) {\n    const discriminator = anchor_1.BorshAccountsCoder.accountDiscriminator(accountName);\n    if (discriminator.compare(data.subarray(0, 8))) {\n        console.error(\"incorrect account name during parsing\");\n        return null;\n    }\n    try {\n        return types_1.accountsCoder.decode(accountName, data);\n    }\n    catch (_e) {\n        console.error(\"unknown account name during parsing\");\n        return null;\n    }\n}\n// YOUR ACCOUNTS\nlet ParsableMerkleDistributor = class ParsableMerkleDistributor {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return parseAnchorAccount(types_1.AccountName.MerkleDistributor, data);\n        }\n        catch (e) {\n            console.error(`error while parsing MerkleDistributor: ${e}`);\n            return null;\n        }\n    }\n};\nParsableMerkleDistributor = __decorate([\n    staticImplements()\n], ParsableMerkleDistributor);\nexports.ParsableMerkleDistributor = ParsableMerkleDistributor;\nlet ParsableClaimStatus = class ParsableClaimStatus {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return parseAnchorAccount(types_1.AccountName.ClaimStatus, data);\n        }\n        catch (e) {\n            console.error(`error while parsing ClaimStatus: ${e}`);\n            return null;\n        }\n    }\n};\nParsableClaimStatus = __decorate([\n    staticImplements()\n], ParsableClaimStatus);\nexports.ParsableClaimStatus = ParsableClaimStatus;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./types\"), exports);\n__exportStar(require(\"./context\"), exports);\n__exportStar(require(\"./methods\"), exports);\n__exportStar(require(\"./pda\"), exports);\n__exportStar(require(\"./clients\"), exports);\n__exportStar(require(\"./constants\"), exports);\n__exportStar(require(\"./utils\"), exports);\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.clawback = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst token_utils_1 = require(\"@saberhq/token-utils\");\nfunction clawback(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .clawback(inputs.amount)\n            .accounts(Object.assign(Object.assign({}, accounts), { systemProgram: web3_js_1.SystemProgram.programId, tokenProgram: token_utils_1.TOKEN_PROGRAM_ID }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.clawback = clawback;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./clawback\"), exports);\n__exportStar(require(\"./newClaim\"), exports);\n__exportStar(require(\"./newDistributor\"), exports);\n__exportStar(require(\"./setAdmin\"), exports);\n__exportStar(require(\"./setClawbackReceiver\"), exports);\n__exportStar(require(\"./setMerkleRoot\"), exports);\n__exportStar(require(\"./setTimestamp\"), exports);\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.newClaim = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst token_utils_1 = require(\"@saberhq/token-utils\");\nfunction newClaim(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .newClaim(inputs.index, inputs.amount, inputs.proof)\n            .accounts(Object.assign(Object.assign({}, accounts), { tokenProgram: token_utils_1.TOKEN_PROGRAM_ID, systemProgram: web3_js_1.SystemProgram.programId }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.newClaim = newClaim;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.newDistributor = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst token_utils_1 = require(\"@saberhq/token-utils\");\nfunction newDistributor(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .newDistributor(inputs.version, inputs.root, inputs.maxTotalClaim, inputs.maxNumNodes, inputs.startTs, inputs.endTs)\n            .accounts(Object.assign(Object.assign({}, accounts), { systemProgram: web3_js_1.SystemProgram.programId, associatedTokenProgram: token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, tokenProgram: token_utils_1.TOKEN_PROGRAM_ID }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.newDistributor = newDistributor;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.setAdmin = void 0;\nfunction setAdmin(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setAdmin()\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setAdmin = setAdmin;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.setClawbackReceiver = void 0;\nfunction setClawbackReceiver(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, } = params;\n        const ix = yield program.methods\n            .setClawbackReceiver()\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setClawbackReceiver = setClawbackReceiver;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.setMerkleRoot = void 0;\nfunction setMerkleRoot(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setMerkleRoot(inputs.root, inputs.maxTotalClaim, inputs.maxNumNodes)\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setMerkleRoot = setMerkleRoot;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.setTimestamp = void 0;\nfunction setTimestamp(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setTimestamp(inputs.startTs, inputs.endTs)\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setTimestamp = setTimestamp;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Methods = void 0;\nconst common_sdk_1 = require(\"@orca-so/common-sdk\");\nconst ixs = __importStar(require(\"./instructions\"));\nclass Methods {\n    constructor(ctx, ix) {\n        this.ctx = ctx;\n        this.ix = ix;\n    }\n    newDistributor(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.newDistributor(this.ctx.program, params);\n            return this;\n        });\n    }\n    setAdmin(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setAdmin(this.ctx.program, params);\n            return this;\n        });\n    }\n    setTimestamp(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setTimestamp(this.ctx.program, params);\n            return this;\n        });\n    }\n    setMerkleRoot(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setMerkleRoot(this.ctx.program, params);\n            return this;\n        });\n    }\n    setClawbackReceiver(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setClawbackReceiver(this.ctx.program, params);\n            return this;\n        });\n    }\n    newClaim(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.newClaim(this.ctx.program, params);\n            return this;\n        });\n    }\n    clawback(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.clawback(this.ctx.program, params);\n            return this;\n        });\n    }\n    toTx() {\n        const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n        return this.ix ? tx.addInstruction(this.ix) : tx;\n    }\n}\nexports.Methods = Methods;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PDA = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst constants_1 = require(\"./constants\");\nclass PDA {\n    constructor(programId) {\n        this.distributor = (mint, version = new anchor_1.BN(1)) => {\n            const [pda, bump] = web3_js_1.PublicKey.findProgramAddressSync([anchor_1.utils.bytes.utf8.encode(\"MerkleDistributor\"), mint.toBytes(), version.toArrayLike(Buffer, \"le\", 8)], constants_1.PROGRAM_ID);\n            return {\n                key: pda,\n                bump,\n            };\n        };\n        this.claim_status = (claimant, distributor) => {\n            const [pda, bump] = web3_js_1.PublicKey.findProgramAddressSync([\n                anchor_1.utils.bytes.utf8.encode(\"ClaimStatus\"),\n                claimant.toBytes(),\n                distributor.toBytes(),\n            ], constants_1.PROGRAM_ID);\n            return {\n                key: pda,\n                bump,\n            };\n        };\n        this.programId = programId;\n    }\n}\nexports.PDA = PDA;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./type\"), exports);\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AccountName = exports.accountsCoder = exports.MerkleDistributorIDL = void 0;\nconst anchor_1 = require(\"@project-serum/anchor\");\nconst IDL = __importStar(require(\"../artifacts/merkle_distributor.json\"));\nexports.MerkleDistributorIDL = IDL;\nexports.accountsCoder = new anchor_1.BorshAccountsCoder(exports.MerkleDistributorIDL);\nvar AccountName;\n(function (AccountName) {\n    AccountName[\"MerkleDistributor\"] = \"MerkleDistributor\";\n    AccountName[\"ClaimStatus\"] = \"ClaimStatus\";\n})(AccountName = exports.AccountName || (exports.AccountName = {}));\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BalanceTree = void 0;\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nconst js_sha3_1 = require(\"js-sha3\");\nconst merkle_tree_1 = require(\"./merkle-tree\");\nclass BalanceTree {\n    constructor(balances) {\n        this._tree = new merkle_tree_1.MerkleTree(balances.map(({ account, amount }, index) => {\n            return BalanceTree.toNode(index, account, amount);\n        }));\n    }\n    static verifyProof(index, account, amount, proof, root) {\n        let pair = BalanceTree.toNode(index, account, amount);\n        for (const item of proof) {\n            pair = merkle_tree_1.MerkleTree.combinedHash(pair, item);\n        }\n        return pair.equals(root);\n    }\n    // keccak256(abi.encode(index, account, amount))\n    static toNode(index, account, amount) {\n        let buf = Buffer.concat([\n            new bn_js_1.default(index).toArrayLike(Buffer, \"le\", 8),\n            account.toBuffer(),\n            new bn_js_1.default(amount).toArrayLike(Buffer, \"le\", 8),\n        ]);\n        buf = Buffer.from((0, js_sha3_1.keccak_256)(buf), \"hex\");\n        const LEAF_PREFIX = Buffer.from([0]);\n        buf = Buffer.concat([LEAF_PREFIX, buf]);\n        return Buffer.from((0, js_sha3_1.keccak_256)(buf), \"hex\");\n    }\n    getHexRoot() {\n        return this._tree.getHexRoot();\n    }\n    // returns the hex bytes32 values of the proof\n    getHexProof(index, account, amount) {\n        return this._tree.getHexProof(BalanceTree.toNode(index, account, amount));\n    }\n    getRoot() {\n        return this._tree.getRoot();\n    }\n    getProof(index, account, amount) {\n        return this._tree.getProof(BalanceTree.toNode(index, account, amount));\n    }\n}\nexports.BalanceTree = BalanceTree;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toBytes32Array = void 0;\nconst tiny_invariant_1 = __importDefault(require(\"tiny-invariant\"));\nconst toBytes32Array = (b) => {\n    (0, tiny_invariant_1.default)(b.length <= 32, `invalid length ${b.length}`);\n    const buf = Buffer.alloc(32);\n    b.copy(buf, 32 - b.length);\n    return Array.from(buf);\n};\nexports.toBytes32Array = toBytes32Array;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getOrCreateATAInstruction = exports.deriveClaimStatus = void 0;\nconst anchor_1 = require(\"@coral-xyz/anchor\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nfunction deriveClaimStatus(claimant, distributor, programId) {\n    return anchor_1.web3.PublicKey.findProgramAddressSync([Buffer.from('ClaimStatus'), claimant.toBytes(), distributor.toBytes()], programId);\n}\nexports.deriveClaimStatus = deriveClaimStatus;\nconst getOrCreateATAInstruction = (tokenMint, owner, connection, allowOwnerOffCurve = true, payer = owner) => __awaiter(void 0, void 0, void 0, function* () {\n    let toAccount;\n    try {\n        toAccount = yield spl_token_1.Token.getAssociatedTokenAddress(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, owner, allowOwnerOffCurve);\n        const account = yield connection.getAccountInfo(toAccount);\n        if (!account) {\n            const ix = spl_token_1.Token.createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, toAccount, owner, payer);\n            return [toAccount, ix];\n        }\n        return [toAccount, undefined];\n    }\n    catch (e) {\n        /* handle error */\n        console.error('Error::getOrCreateATAInstruction', e);\n        throw e;\n    }\n});\nexports.getOrCreateATAInstruction = getOrCreateATAInstruction;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./balance-tree\"), exports);\n__exportStar(require(\"./bytes32\"), exports);\n__exportStar(require(\"./helper\"), exports);\n__exportStar(require(\"./merkle-tree\"), exports);\n__exportStar(require(\"./program\"), exports);\n__exportStar(require(\"./spl\"), exports);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MerkleTree = void 0;\nconst js_sha3_1 = require(\"js-sha3\");\nconst tiny_invariant_1 = __importDefault(require(\"tiny-invariant\"));\nconst INTERMEDIATE_PREFIX = Buffer.from([1]);\nfunction getPairElement(idx, layer) {\n    const pairIdx = idx % 2 === 0 ? idx + 1 : idx - 1;\n    if (pairIdx < layer.length) {\n        const pairEl = layer[pairIdx];\n        (0, tiny_invariant_1.default)(pairEl, \"pairEl\");\n        return pairEl;\n    }\n    else {\n        return null;\n    }\n}\nfunction bufDedup(elements) {\n    return elements.filter((el, idx) => {\n        var _a;\n        return idx === 0 || !((_a = elements[idx - 1]) === null || _a === void 0 ? void 0 : _a.equals(el));\n    });\n}\nfunction bufArrToHexArr(arr) {\n    if (arr.some((el) => !Buffer.isBuffer(el))) {\n        throw new Error(\"Array is not an array of buffers\");\n    }\n    return arr.map((el) => \"0x\" + el.toString(\"hex\"));\n}\nfunction sortAndConcat(...args) {\n    const sorted = [...args].sort(Buffer.compare.bind(null));\n    const buf = [INTERMEDIATE_PREFIX];\n    for (const arg of sorted) {\n        buf.push(arg);\n    }\n    return Buffer.concat(buf);\n}\nclass MerkleTree {\n    constructor(elements) {\n        this._elements = [...elements];\n        // Sort elements\n        this._elements.sort(Buffer.compare.bind(null));\n        // Deduplicate elements\n        this._elements = bufDedup(this._elements);\n        this._bufferElementPositionIndex = this._elements.reduce((memo, el, index) => {\n            memo[el.toString(\"hex\")] = index;\n            return memo;\n        }, {});\n        // Create layers\n        this._layers = this.getLayers(this._elements);\n    }\n    getLayers(elements) {\n        var _a, _b;\n        if (elements.length === 0) {\n            throw new Error(\"empty tree\");\n        }\n        const layers = [];\n        layers.push(elements);\n        // Get next layer until we reach the root\n        while (((_b = (_a = layers[layers.length - 1]) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0) > 1) {\n            const nextLayerIndex = layers[layers.length - 1];\n            (0, tiny_invariant_1.default)(nextLayerIndex, \"nextLayerIndex\");\n            layers.push(this.getNextLayer(nextLayerIndex));\n        }\n        return layers;\n    }\n    getNextLayer(elements) {\n        return elements.reduce((layer, el, idx, arr) => {\n            if (idx % 2 === 0) {\n                // Hash the current element with its pair element\n                const pairEl = arr[idx + 1];\n                layer.push(MerkleTree.combinedHash(el, pairEl));\n            }\n            return layer;\n        }, []);\n    }\n    static combinedHash(first, second) {\n        if (!first) {\n            (0, tiny_invariant_1.default)(second, \"second element of pair must exist\");\n            return second;\n        }\n        if (!second) {\n            (0, tiny_invariant_1.default)(first, \"first element of pair must exist\");\n            return first;\n        }\n        return Buffer.from(js_sha3_1.keccak_256.digest(sortAndConcat(first, second)));\n    }\n    getRoot() {\n        var _a;\n        const root = (_a = this._layers[this._layers.length - 1]) === null || _a === void 0 ? void 0 : _a[0];\n        (0, tiny_invariant_1.default)(root, \"root\");\n        return root;\n    }\n    getHexRoot() {\n        return this.getRoot().toString(\"hex\");\n    }\n    getProof(el) {\n        const initialIdx = this._bufferElementPositionIndex[el.toString(\"hex\")];\n        if (typeof initialIdx !== \"number\") {\n            throw new Error(\"Element does not exist in Merkle tree\");\n        }\n        let idx = initialIdx;\n        return this._layers.reduce((proof, layer) => {\n            const pairElement = getPairElement(idx, layer);\n            if (pairElement) {\n                proof.push(pairElement);\n            }\n            idx = Math.floor(idx / 2);\n            return proof;\n        }, []);\n    }\n    getHexProof(el) {\n        const proof = this.getProof(el);\n        return bufArrToHexArr(proof);\n    }\n}\nexports.MerkleTree = MerkleTree;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createMerkleDistributorProgram = void 0;\nconst anchor_1 = require(\"@coral-xyz/anchor\");\nconst merkle_distributor_1 = require(\"../artifacts/merkle_distributor\");\nfunction createMerkleDistributorProgram(provider, programId) {\n    const program = new anchor_1.Program(merkle_distributor_1.IDL, programId, provider);\n    return program;\n}\nexports.createMerkleDistributorProgram = createMerkleDistributorProgram;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenInstruction = exports.addSigners = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\n/** @internal */\nfunction addSigners(keys, ownerOrAuthority, multiSigners) {\n    keys.push({\n        pubkey: ownerOrAuthority,\n        isSigner: multiSigners.length === 0,\n        isWritable: false\n    });\n    for (const signer of multiSigners) {\n        keys.push({\n            pubkey: signer instanceof web3_js_1.PublicKey ? signer : signer.publicKey,\n            isSigner: true,\n            isWritable: false\n        });\n    }\n    return keys;\n}\nexports.addSigners = addSigners;\n/** Instructions defined by the program */\nvar TokenInstruction;\n(function (TokenInstruction) {\n    TokenInstruction[TokenInstruction[\"InitializeMint\"] = 0] = \"InitializeMint\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount\"] = 1] = \"InitializeAccount\";\n    TokenInstruction[TokenInstruction[\"InitializeMultisig\"] = 2] = \"InitializeMultisig\";\n    TokenInstruction[TokenInstruction[\"Transfer\"] = 3] = \"Transfer\";\n    TokenInstruction[TokenInstruction[\"Approve\"] = 4] = \"Approve\";\n    TokenInstruction[TokenInstruction[\"Revoke\"] = 5] = \"Revoke\";\n    TokenInstruction[TokenInstruction[\"SetAuthority\"] = 6] = \"SetAuthority\";\n    TokenInstruction[TokenInstruction[\"MintTo\"] = 7] = \"MintTo\";\n    TokenInstruction[TokenInstruction[\"Burn\"] = 8] = \"Burn\";\n    TokenInstruction[TokenInstruction[\"CloseAccount\"] = 9] = \"CloseAccount\";\n    TokenInstruction[TokenInstruction[\"FreezeAccount\"] = 10] = \"FreezeAccount\";\n    TokenInstruction[TokenInstruction[\"ThawAccount\"] = 11] = \"ThawAccount\";\n    TokenInstruction[TokenInstruction[\"TransferChecked\"] = 12] = \"TransferChecked\";\n    TokenInstruction[TokenInstruction[\"ApproveChecked\"] = 13] = \"ApproveChecked\";\n    TokenInstruction[TokenInstruction[\"MintToChecked\"] = 14] = \"MintToChecked\";\n    TokenInstruction[TokenInstruction[\"BurnChecked\"] = 15] = \"BurnChecked\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount2\"] = 16] = \"InitializeAccount2\";\n    TokenInstruction[TokenInstruction[\"SyncNative\"] = 17] = \"SyncNative\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount3\"] = 18] = \"InitializeAccount3\";\n    TokenInstruction[TokenInstruction[\"InitializeMultisig2\"] = 19] = \"InitializeMultisig2\";\n    TokenInstruction[TokenInstruction[\"InitializeMint2\"] = 20] = \"InitializeMint2\";\n    TokenInstruction[TokenInstruction[\"GetAccountDataSize\"] = 21] = \"GetAccountDataSize\";\n    TokenInstruction[TokenInstruction[\"InitializeImmutableOwner\"] = 22] = \"InitializeImmutableOwner\";\n    TokenInstruction[TokenInstruction[\"AmountToUiAmount\"] = 23] = \"AmountToUiAmount\";\n    TokenInstruction[TokenInstruction[\"UiAmountToAmount\"] = 24] = \"UiAmountToAmount\";\n    TokenInstruction[TokenInstruction[\"InitializeMintCloseAuthority\"] = 25] = \"InitializeMintCloseAuthority\";\n    TokenInstruction[TokenInstruction[\"TransferFeeExtension\"] = 26] = \"TransferFeeExtension\";\n    TokenInstruction[TokenInstruction[\"ConfidentialTransferExtension\"] = 27] = \"ConfidentialTransferExtension\";\n    TokenInstruction[TokenInstruction[\"DefaultAccountStateExtension\"] = 28] = \"DefaultAccountStateExtension\";\n    TokenInstruction[TokenInstruction[\"Reallocate\"] = 29] = \"Reallocate\";\n    TokenInstruction[TokenInstruction[\"MemoTransferExtension\"] = 30] = \"MemoTransferExtension\";\n    TokenInstruction[TokenInstruction[\"CreateNativeMint\"] = 31] = \"CreateNativeMint\";\n    TokenInstruction[TokenInstruction[\"InitializeNonTransferableMint\"] = 32] = \"InitializeNonTransferableMint\";\n    TokenInstruction[TokenInstruction[\"InterestBearingMintExtension\"] = 33] = \"InterestBearingMintExtension\";\n    TokenInstruction[TokenInstruction[\"CpiGuardExtension\"] = 34] = \"CpiGuardExtension\";\n    TokenInstruction[TokenInstruction[\"InitializePermanentDelegate\"] = 35] = \"InitializePermanentDelegate\";\n    TokenInstruction[TokenInstruction[\"TransferHookExtension\"] = 36] = \"TransferHookExtension\";\n    // ConfidentialTransferFeeExtension = 37,\n    // WithdrawalExcessLamports = 38,\n    TokenInstruction[TokenInstruction[\"MetadataPointerExtension\"] = 39] = \"MetadataPointerExtension\";\n    TokenInstruction[TokenInstruction[\"GroupPointerExtension\"] = 40] = \"GroupPointerExtension\";\n    TokenInstruction[TokenInstruction[\"GroupMemberPointerExtension\"] = 41] = \"GroupMemberPointerExtension\";\n})(TokenInstruction = exports.TokenInstruction || (exports.TokenInstruction = {}));\n","import { Buffer as Buffer$1 } from 'buffer';\nimport { PublicKey, Transaction, TransactionInstruction, SendTransactionError, NONCE_ACCOUNT_LENGTH, SystemProgram, SYSVAR_RENT_PUBKEY, SYSVAR_CLOCK_PUBKEY } from '@solana/web3.js';\nimport * as web3_js from '@solana/web3.js';\nexport { web3_js as web3 };\nimport BN from 'bn.js';\nexport { default as BN } from 'bn.js';\nimport bs58$1 from 'bs58';\nimport camelCase from 'camelcase';\nimport * as borsh from '@coral-xyz/borsh';\nimport { sha256 as sha256$1 } from '@noble/hashes/sha256';\nimport { inflate } from 'pako';\nimport EventEmitter from 'eventemitter3';\n\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\n\nfunction encode$3(data) {\n    return data.reduce((str, byte) => str + byte.toString(16).padStart(2, \"0\"), \"0x\");\n}\nfunction decode$3(data) {\n    if (data.indexOf(\"0x\") === 0) {\n        data = data.substr(2);\n    }\n    if (data.length % 2 === 1) {\n        data = \"0\" + data;\n    }\n    let key = data.match(/.{2}/g);\n    if (key === null) {\n        return Buffer$1.from([]);\n    }\n    return Buffer$1.from(key.map((byte) => parseInt(byte, 16)));\n}\n\nvar hex = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$3,\n    decode: decode$3\n});\n\nfunction decode$2(array) {\n    const decoder = new TextDecoder(\"utf-8\") // Browser https://caniuse.com/textencoder.\n        ; // Node.\n    return decoder.decode(array);\n}\nfunction encode$2(input) {\n    const encoder = new TextEncoder() // Browser.\n        ; // Node.\n    return encoder.encode(input);\n}\n\nvar utf8 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    decode: decode$2,\n    encode: encode$2\n});\n\nfunction encode$1(data) {\n    return bs58$1.encode(data);\n}\nfunction decode$1(data) {\n    return bs58$1.decode(data);\n}\n\nvar bs58 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$1,\n    decode: decode$1\n});\n\nfunction encode(data) {\n    return data.toString(\"base64\");\n}\nfunction decode(data) {\n    return Buffer$1.from(data, \"base64\");\n}\n\nvar base64 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode,\n    decode: decode\n});\n\nvar index$1 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hex: hex,\n    utf8: utf8,\n    bs58: bs58,\n    base64: base64\n});\n\nfunction parseIdlErrors(idl) {\n    const errors = new Map();\n    if (idl.errors) {\n        idl.errors.forEach((e) => {\n            var _a;\n            let msg = (_a = e.msg) !== null && _a !== void 0 ? _a : e.name;\n            errors.set(e.code, msg);\n        });\n    }\n    return errors;\n}\n// Allow either IdLInstruction or IdlStateMethod since the types share fields.\nfunction toInstruction(idlIx, ...args) {\n    if (idlIx.args.length != args.length) {\n        throw new Error(\"Invalid argument length\");\n    }\n    const ix = {};\n    let idx = 0;\n    idlIx.args.forEach((ixArg) => {\n        ix[ixArg.name] = args[idx];\n        idx += 1;\n    });\n    return ix;\n}\n// Throws error if any account required for the `ix` is not given.\nfunction validateAccounts(ixAccounts, accounts = {}) {\n    ixAccounts.forEach((acc) => {\n        if (\"accounts\" in acc) {\n            validateAccounts(acc.accounts, accounts[acc.name]);\n        }\n        else {\n            if (accounts[acc.name] === undefined) {\n                throw new Error(`Invalid arguments: ${acc.name} not provided.`);\n            }\n        }\n    });\n}\n// Translates an address to a Pubkey.\nfunction translateAddress(address) {\n    return address instanceof PublicKey ? address : new PublicKey(address);\n}\n\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n  constructor(failure, failures) {\n    let cached;\n    const {\n      message,\n      ...rest\n    } = failure;\n    const {\n      path\n    } = failure;\n    const msg = path.length === 0 ? message : \"At path: \" + path.join('.') + \" -- \" + message;\n    super(msg);\n    this.value = void 0;\n    this.key = void 0;\n    this.type = void 0;\n    this.refinement = void 0;\n    this.path = void 0;\n    this.branch = void 0;\n    this.failures = void 0;\n    Object.assign(this, rest);\n    this.name = this.constructor.name;\n\n    this.failures = () => {\n      var _cached;\n\n      return (_cached = cached) != null ? _cached : cached = [failure, ...failures()];\n    };\n  }\n\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n  return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\n\n\nfunction isObject(x) {\n  return typeof x === 'object' && x != null;\n}\n/**\n * Return a value as a printable string.\n */\n\nfunction print(value) {\n  return typeof value === 'string' ? JSON.stringify(value) : \"\" + value;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\n\nfunction shiftIterator(input) {\n  const {\n    done,\n    value\n  } = input.next();\n  return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\n\nfunction toFailure(result, context, struct, value) {\n  if (result === true) {\n    return;\n  } else if (result === false) {\n    result = {};\n  } else if (typeof result === 'string') {\n    result = {\n      message: result\n    };\n  }\n\n  const {\n    path,\n    branch\n  } = context;\n  const {\n    type\n  } = struct;\n  const {\n    refinement,\n    message = \"Expected a value of type `\" + type + \"`\" + (refinement ? \" with refinement `\" + refinement + \"`\" : '') + \", but received: `\" + print(value) + \"`\"\n  } = result;\n  return {\n    value,\n    type,\n    refinement,\n    key: path[path.length - 1],\n    path,\n    branch,\n    ...result,\n    message\n  };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\n\nfunction* toFailures(result, context, struct, value) {\n  if (!isIterable(result)) {\n    result = [result];\n  }\n\n  for (const r of result) {\n    const failure = toFailure(r, context, struct, value);\n\n    if (failure) {\n      yield failure;\n    }\n  }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\n\nfunction* run(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const {\n    path = [],\n    branch = [value],\n    coerce = false,\n    mask = false\n  } = options;\n  const ctx = {\n    path,\n    branch\n  };\n\n  if (coerce) {\n    value = struct.coercer(value, ctx);\n\n    if (mask && struct.type !== 'type' && isObject(struct.schema) && isObject(value) && !Array.isArray(value)) {\n      for (const key in value) {\n        if (struct.schema[key] === undefined) {\n          delete value[key];\n        }\n      }\n    }\n  }\n\n  let valid = true;\n\n  for (const failure of struct.validator(value, ctx)) {\n    valid = false;\n    yield [failure, undefined];\n  }\n\n  for (let [k, v, s] of struct.entries(value, ctx)) {\n    const ts = run(v, s, {\n      path: k === undefined ? path : [...path, k],\n      branch: k === undefined ? branch : [...branch, v],\n      coerce,\n      mask\n    });\n\n    for (const t of ts) {\n      if (t[0]) {\n        valid = false;\n        yield [t[0], undefined];\n      } else if (coerce) {\n        v = t[1];\n\n        if (k === undefined) {\n          value = v;\n        } else if (value instanceof Map) {\n          value.set(k, v);\n        } else if (value instanceof Set) {\n          value.add(v);\n        } else if (isObject(value)) {\n          value[k] = v;\n        }\n      }\n    }\n  }\n\n  if (valid) {\n    for (const failure of struct.refiner(value, ctx)) {\n      valid = false;\n      yield [failure, undefined];\n    }\n  }\n\n  if (valid) {\n    yield [undefined, value];\n  }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\n\nclass Struct {\n  constructor(props) {\n    this.TYPE = void 0;\n    this.type = void 0;\n    this.schema = void 0;\n    this.coercer = void 0;\n    this.validator = void 0;\n    this.refiner = void 0;\n    this.entries = void 0;\n    const {\n      type,\n      schema,\n      validator,\n      refiner,\n      coercer = value => value,\n      entries = function* () {}\n    } = props;\n    this.type = type;\n    this.schema = schema;\n    this.entries = entries;\n    this.coercer = coercer;\n\n    if (validator) {\n      this.validator = (value, context) => {\n        const result = validator(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.validator = () => [];\n    }\n\n    if (refiner) {\n      this.refiner = (value, context) => {\n        const result = refiner(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.refiner = () => [];\n    }\n  }\n  /**\n   * Assert that a value passes the struct's validation, throwing if it doesn't.\n   */\n\n\n  assert(value) {\n    return assert(value, this);\n  }\n  /**\n   * Create a value with the struct's coercion logic, then validate it.\n   */\n\n\n  create(value) {\n    return create(value, this);\n  }\n  /**\n   * Check if a value passes the struct's validation.\n   */\n\n\n  is(value) {\n    return is(value, this);\n  }\n  /**\n   * Mask a value, coercing and validating it, but returning only the subset of\n   * properties defined by the struct's schema.\n   */\n\n\n  mask(value) {\n    return mask(value, this);\n  }\n  /**\n   * Validate a value with the struct's validation logic, returning a tuple\n   * representing the result.\n   *\n   * You may optionally pass `true` for the `withCoercion` argument to coerce\n   * the value before attempting to validate it. If you do, the result will\n   * contain the coerced result when successful.\n   */\n\n\n  validate(value, options) {\n    if (options === void 0) {\n      options = {};\n    }\n\n    return validate(value, this, options);\n  }\n\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\n\nfunction assert(value, struct) {\n  const result = validate(value, struct);\n\n  if (result[0]) {\n    throw result[0];\n  }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\n\nfunction create(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\n\nfunction mask(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true,\n    mask: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Check if a value passes a struct.\n */\n\nfunction is(value, struct) {\n  const result = validate(value, struct);\n  return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\n\nfunction validate(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const tuples = run(value, struct, options);\n  const tuple = shiftIterator(tuples);\n\n  if (tuple[0]) {\n    const error = new StructError(tuple[0], function* () {\n      for (const t of tuples) {\n        if (t[0]) {\n          yield t[0];\n        }\n      }\n    });\n    return [error, undefined];\n  } else {\n    const v = tuple[1];\n    return [undefined, v];\n  }\n}\n/**\n * Define a new struct type with a custom validation function.\n */\n\nfunction define(name, validator) {\n  return new Struct({\n    type: name,\n    schema: null,\n    validator\n  });\n}\n\n/**\n * Ensure that any value passes validation.\n */\n\nfunction any() {\n  return define('any', () => true);\n}\nfunction array(Element) {\n  return new Struct({\n    type: 'array',\n    schema: Element,\n\n    *entries(value) {\n      if (Element && Array.isArray(value)) {\n        for (const [i, v] of value.entries()) {\n          yield [i, v, Element];\n        }\n      }\n    },\n\n    coercer(value) {\n      return Array.isArray(value) ? value.slice() : value;\n    },\n\n    validator(value) {\n      return Array.isArray(value) || \"Expected an array value, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value is a boolean.\n */\n\nfunction boolean() {\n  return define('boolean', value => {\n    return typeof value === 'boolean';\n  });\n}\nfunction literal(constant) {\n  const description = print(constant);\n  const t = typeof constant;\n  return new Struct({\n    type: 'literal',\n    schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n\n    validator(value) {\n      return value === constant || \"Expected the literal `\" + description + \"`, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\n\nfunction nullable(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === null || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === null || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a number.\n */\n\nfunction number() {\n  return define('number', value => {\n    return typeof value === 'number' && !isNaN(value) || \"Expected a number, but received: \" + print(value);\n  });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\n\nfunction optional(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a string.\n */\n\nfunction string() {\n  return define('string', value => {\n    return typeof value === 'string' || \"Expected a string, but received: \" + print(value);\n  });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\n\nfunction type(schema) {\n  const keys = Object.keys(schema);\n  return new Struct({\n    type: 'type',\n    schema,\n\n    *entries(value) {\n      if (isObject(value)) {\n        for (const k of keys) {\n          yield [k, value[k], schema[k]];\n        }\n      }\n    },\n\n    validator(value) {\n      return isObject(value) || \"Expected an object, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\n\nfunction union$1(Structs) {\n  const description = Structs.map(s => s.type).join(' | ');\n  return new Struct({\n    type: 'union',\n    schema: null,\n\n    coercer(value, ctx) {\n      const firstMatch = Structs.find(s => {\n        const [e] = s.validate(value, {\n          coerce: true\n        });\n        return !e;\n      }) || unknown();\n      return firstMatch.coercer(value, ctx);\n    },\n\n    validator(value, ctx) {\n      const failures = [];\n\n      for (const S of Structs) {\n        const [...tuples] = run(value, S, ctx);\n        const [first] = tuples;\n\n        if (!first[0]) {\n          return [];\n        } else {\n          for (const [failure] of tuples) {\n            if (failure) {\n              failures.push(failure);\n            }\n          }\n        }\n      }\n\n      return [\"Expected the value to satisfy a union of `\" + description + \"`, but received: \" + print(value), ...failures];\n    }\n\n  });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\n\nfunction unknown() {\n  return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\n\nfunction coerce(struct, condition, coercer) {\n  return new Struct({ ...struct,\n    coercer: (value, ctx) => {\n      return is(value, condition) ? struct.coercer(coercer(value, ctx), ctx) : struct.coercer(value, ctx);\n    }\n  });\n}\n\n/**\n * Sends a transaction to a program with the given accounts and instruction\n * data.\n */\nasync function invoke(programId, accounts, data, provider) {\n    programId = translateAddress(programId);\n    if (!provider) {\n        provider = getProvider();\n    }\n    const tx = new Transaction();\n    tx.add(new TransactionInstruction({\n        programId,\n        keys: accounts !== null && accounts !== void 0 ? accounts : [],\n        data,\n    }));\n    if (provider.sendAndConfirm === undefined) {\n        throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n    }\n    return await provider.sendAndConfirm(tx, []);\n}\nconst GET_MULTIPLE_ACCOUNTS_LIMIT = 99;\nasync function getMultipleAccounts(connection, publicKeys, commitment) {\n    const results = await getMultipleAccountsAndContext(connection, publicKeys, commitment);\n    return results.map((result) => {\n        return result\n            ? { publicKey: result.publicKey, account: result.account }\n            : null;\n    });\n}\nasync function getMultipleAccountsAndContext(connection, publicKeys, commitment) {\n    if (publicKeys.length <= GET_MULTIPLE_ACCOUNTS_LIMIT) {\n        return await getMultipleAccountsAndContextCore(connection, publicKeys, commitment);\n    }\n    else {\n        const batches = chunks(publicKeys, GET_MULTIPLE_ACCOUNTS_LIMIT);\n        const results = await Promise.all(batches.map((batch) => getMultipleAccountsAndContextCore(connection, batch, commitment)));\n        return results.flat();\n    }\n}\nasync function getMultipleAccountsAndContextCore(connection, publicKeys, commitmentOverride) {\n    const commitment = commitmentOverride !== null && commitmentOverride !== void 0 ? commitmentOverride : connection.commitment;\n    const { value: accountInfos, context } = await connection.getMultipleAccountsInfoAndContext(publicKeys, commitment);\n    const accounts = accountInfos.map((account, idx) => {\n        if (account === null) {\n            return null;\n        }\n        return {\n            publicKey: publicKeys[idx],\n            account,\n            context,\n        };\n    });\n    return accounts;\n}\n// copy from @solana/web3.js that has a commitment param\nasync function simulateTransaction(connection, transaction, signers, commitment, includeAccounts) {\n    var _a;\n    if (signers && signers.length > 0) {\n        transaction.sign(...signers);\n    }\n    // @ts-expect-error\n    const message = transaction._compile();\n    const signData = message.serialize();\n    // @ts-expect-error\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = {\n        encoding: \"base64\",\n        commitment: commitment !== null && commitment !== void 0 ? commitment : connection.commitment,\n    };\n    if (includeAccounts) {\n        const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map((key) => key.toBase58());\n        config[\"accounts\"] = {\n            encoding: \"base64\",\n            addresses,\n        };\n    }\n    if (signers) {\n        config.sigVerify = true;\n    }\n    const args = [encodedTransaction, config];\n    // @ts-expect-error\n    const unsafeRes = await connection._rpcRequest(\"simulateTransaction\", args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if (\"error\" in res) {\n        let logs;\n        if (\"data\" in res.error) {\n            logs = (_a = res.error.data) === null || _a === void 0 ? void 0 : _a.logs;\n            if (logs && Array.isArray(logs)) {\n                const traceIndent = \"\\n    \";\n                const logTrace = traceIndent + logs.join(traceIndent);\n                console.error(res.error.message, logTrace);\n            }\n        }\n        throw new SendTransactionError(\"failed to simulate transaction: \" + res.error.message, logs);\n    }\n    return res.result;\n}\n// copy from @solana/web3.js\nfunction jsonRpcResult(schema) {\n    return coerce(createRpcResult(schema), UnknownRpcResult, (value) => {\n        if (\"error\" in value) {\n            return value;\n        }\n        else {\n            return {\n                ...value,\n                result: create(value.result, schema),\n            };\n        }\n    });\n}\n// copy from @solana/web3.js\nconst UnknownRpcResult = createRpcResult(unknown());\n// copy from @solana/web3.js\nfunction createRpcResult(result) {\n    return union$1([\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            result,\n        }),\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            error: type({\n                code: unknown(),\n                message: string(),\n                data: optional(any()),\n            }),\n        }),\n    ]);\n}\n// copy from @solana/web3.js\nfunction jsonRpcResultAndContext(value) {\n    return jsonRpcResult(type({\n        context: type({\n            slot: number(),\n        }),\n        value,\n    }));\n}\n// copy from @solana/web3.js\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n    err: nullable(union$1([type({}), string()])),\n    logs: nullable(array(string())),\n    accounts: optional(nullable(array(nullable(type({\n        executable: boolean(),\n        owner: string(),\n        lamports: number(),\n        data: array(string()),\n        rentEpoch: optional(number()),\n    }))))),\n    unitsConsumed: optional(number()),\n}));\n\nvar rpc = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    invoke: invoke,\n    getMultipleAccounts: getMultipleAccounts,\n    getMultipleAccountsAndContext: getMultipleAccountsAndContext,\n    simulateTransaction: simulateTransaction\n});\n\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n */\nclass AnchorProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, wallet, opts) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.publicKey = wallet === null || wallet === void 0 ? void 0 : wallet.publicKey;\n    }\n    static defaultOptions() {\n        return {\n            preflightCommitment: \"processed\",\n            commitment: \"processed\",\n        };\n    }\n    /**\n     * Returns a `Provider` with a wallet read from the local filesystem.\n     *\n     * @param url  The network cluster url.\n     * @param opts The default transaction confirmation options.\n     *\n     * (This api is for Node only.)\n     */\n    static local(url, opts) {\n        {\n            throw new Error(`Provider local is not available on browser.`);\n        }\n    }\n    /**\n     * Returns a `Provider` read from the `ANCHOR_PROVIDER_URL` environment\n     * variable\n     *\n     * (This api is for Node only.)\n     */\n    static env() {\n        {\n            throw new Error(`Provider env is not available on browser.`);\n        }\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sendAndConfirm(tx, signers, opts) {\n        var _a, _b, _c, _d;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n            }\n        }\n        else {\n            tx.feePayer = (_a = tx.feePayer) !== null && _a !== void 0 ? _a : this.wallet.publicKey;\n            tx.recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n            if (signers) {\n                for (const signer of signers) {\n                    tx.partialSign(signer);\n                }\n            }\n        }\n        tx = await this.wallet.signTransaction(tx);\n        const rawTx = tx.serialize();\n        try {\n            return await sendAndConfirmRawTransaction(this.connection, rawTx, opts);\n        }\n        catch (err) {\n            // thrown if the underlying 'confirmTransaction' encounters a failed tx\n            // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n            if (err instanceof ConfirmError) {\n                // choose the shortest available commitment for 'getTransaction'\n                // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                // commitment `sendAndConfirmRawTransaction` used\n                const txSig = encode$1(isVersionedTransaction(tx)\n                    ? ((_b = tx.signatures) === null || _b === void 0 ? void 0 : _b[0]) || new Uint8Array()\n                    : (_c = tx.signature) !== null && _c !== void 0 ? _c : new Uint8Array());\n                const failedTx = await this.connection.getTransaction(txSig, {\n                    commitment: \"confirmed\",\n                });\n                if (!failedTx) {\n                    throw err;\n                }\n                else {\n                    const logs = (_d = failedTx.meta) === null || _d === void 0 ? void 0 : _d.logMessages;\n                    throw !logs ? err : new SendTransactionError(err.message, logs);\n                }\n            }\n            else {\n                throw err;\n            }\n        }\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     * All transactions need to be of the same type, it doesn't support a mix of `VersionedTransaction`s and `Transaction`s.\n     *\n     * @param txWithSigners Array of transactions and signers.\n     * @param opts          Transaction confirmation options.\n     */\n    async sendAll(txWithSigners, opts) {\n        var _a, _b, _c;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        const recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n        let txs = txWithSigners.map((r) => {\n            var _a, _b;\n            if (isVersionedTransaction(r.tx)) {\n                let tx = r.tx;\n                if (r.signers) {\n                    tx.sign(r.signers);\n                }\n                return tx;\n            }\n            else {\n                let tx = r.tx;\n                let signers = (_a = r.signers) !== null && _a !== void 0 ? _a : [];\n                tx.feePayer = (_b = tx.feePayer) !== null && _b !== void 0 ? _b : this.wallet.publicKey;\n                tx.recentBlockhash = recentBlockhash;\n                signers.forEach((kp) => {\n                    tx.partialSign(kp);\n                });\n                return tx;\n            }\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        const sigs = [];\n        for (let k = 0; k < txs.length; k += 1) {\n            const tx = signedTxs[k];\n            const rawTx = tx.serialize();\n            try {\n                sigs.push(await sendAndConfirmRawTransaction(this.connection, rawTx, opts));\n            }\n            catch (err) {\n                // thrown if the underlying 'confirmTransaction' encounters a failed tx\n                // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n                if (err instanceof ConfirmError) {\n                    // choose the shortest available commitment for 'getTransaction'\n                    // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                    // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                    // commitment `sendAndConfirmRawTransaction` used\n                    const txSig = encode$1(isVersionedTransaction(tx)\n                        ? ((_a = tx.signatures) === null || _a === void 0 ? void 0 : _a[0]) || new Uint8Array()\n                        : (_b = tx.signature) !== null && _b !== void 0 ? _b : new Uint8Array());\n                    const failedTx = await this.connection.getTransaction(txSig, {\n                        commitment: \"confirmed\",\n                    });\n                    if (!failedTx) {\n                        throw err;\n                    }\n                    else {\n                        const logs = (_c = failedTx.meta) === null || _c === void 0 ? void 0 : _c.logMessages;\n                        throw !logs ? err : new SendTransactionError(err.message, logs);\n                    }\n                }\n                else {\n                    throw err;\n                }\n            }\n        }\n        return sigs;\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction. If unset, the transaction\n     *                will be simulated with the \"sigVerify: false\" option. This\n     *                allows for simulation of transactions without asking the\n     *                wallet for a signature.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, commitment, includeAccounts) {\n        let recentBlockhash = (await this.connection.getLatestBlockhash(commitment !== null && commitment !== void 0 ? commitment : this.connection.commitment)).blockhash;\n        let result;\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n                tx = await this.wallet.signTransaction(tx);\n            }\n            // Doesn't support includeAccounts which has been changed to something\n            // else in later versions of this function.\n            result = await this.connection.simulateTransaction(tx, { commitment });\n        }\n        else {\n            tx.feePayer = tx.feePayer || this.wallet.publicKey;\n            tx.recentBlockhash = recentBlockhash;\n            if (signers) {\n                tx = await this.wallet.signTransaction(tx);\n            }\n            result = await simulateTransaction(this.connection, tx, signers, commitment, includeAccounts);\n        }\n        if (result.value.err) {\n            throw new SimulateError(result.value);\n        }\n        return result.value;\n    }\n}\nclass SimulateError extends Error {\n    constructor(simulationResponse, message) {\n        super(message);\n        this.simulationResponse = simulationResponse;\n    }\n}\n// Copy of Connection.sendAndConfirmRawTransaction that throws\n// a better error if 'confirmTransaction` returns an error status\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, options) {\n    const sendOptions = options && {\n        skipPreflight: options.skipPreflight,\n        preflightCommitment: options.preflightCommitment || options.commitment,\n    };\n    const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n    const status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n    if (status.err) {\n        throw new ConfirmError(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n    }\n    return signature;\n}\nclass ConfirmError extends Error {\n    constructor(message) {\n        super(message);\n    }\n}\n/**\n * Sets the default provider on the client.\n */\nfunction setProvider(provider) {\n    _provider = provider;\n}\n/**\n * Returns the default provider being used by the client.\n */\nfunction getProvider() {\n    if (_provider === null) {\n        return AnchorProvider.local();\n    }\n    return _provider;\n}\n// Global provider used as the default when a provider is not given.\nlet _provider = null;\n\nconst _AVAILABLE_FEATURES = new Set([\"anchor-deprecated-state\", \"debug-logs\"]);\nconst _FEATURES = new Map();\nfunction set(key) {\n    if (!_AVAILABLE_FEATURES.has(key)) {\n        throw new Error(\"Invalid feature\");\n    }\n    _FEATURES.set(key, true);\n}\nfunction isSet(key) {\n    return _FEATURES.get(key) !== undefined;\n}\n\nvar features = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    set: set,\n    isSet: isSet\n});\n\nclass IdlError extends Error {\n    constructor(message) {\n        super(message);\n        this.name = \"IdlError\";\n    }\n}\nclass ProgramErrorStack {\n    constructor(stack) {\n        this.stack = stack;\n    }\n    static parse(logs) {\n        var _a;\n        const programKeyRegex = /^Program (\\w*) invoke/;\n        const successRegex = /^Program \\w* success/;\n        const programStack = [];\n        for (let i = 0; i < logs.length; i++) {\n            if (successRegex.exec(logs[i])) {\n                programStack.pop();\n                continue;\n            }\n            const programKey = (_a = programKeyRegex.exec(logs[i])) === null || _a === void 0 ? void 0 : _a[1];\n            if (!programKey) {\n                continue;\n            }\n            programStack.push(new PublicKey(programKey));\n        }\n        return new ProgramErrorStack(programStack);\n    }\n}\nclass AnchorError extends Error {\n    constructor(errorCode, errorMessage, errorLogs, logs, origin, comparedValues) {\n        super(errorLogs.join(\"\\n\").replace(\"Program log: \", \"\"));\n        this.errorLogs = errorLogs;\n        this.logs = logs;\n        this.error = { errorCode, errorMessage, comparedValues, origin };\n        this._programErrorStack = ProgramErrorStack.parse(logs);\n    }\n    static parse(logs) {\n        if (!logs) {\n            return null;\n        }\n        const anchorErrorLogIndex = logs.findIndex((log) => log.startsWith(\"Program log: AnchorError\"));\n        if (anchorErrorLogIndex === -1) {\n            return null;\n        }\n        const anchorErrorLog = logs[anchorErrorLogIndex];\n        const errorLogs = [anchorErrorLog];\n        let comparedValues;\n        if (anchorErrorLogIndex + 1 < logs.length) {\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left:\n            // <Pubkey>\n            // Right:\n            // <Pubkey>\n            if (logs[anchorErrorLogIndex + 1] === \"Program log: Left:\") {\n                const pubkeyRegex = /^Program log: (.*)$/;\n                const leftPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 2])[1];\n                const rightPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 4])[1];\n                comparedValues = [\n                    new PublicKey(leftPubkey),\n                    new PublicKey(rightPubkey),\n                ];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 5));\n            }\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left: <value>\n            // Right: <value>\n            else if (logs[anchorErrorLogIndex + 1].startsWith(\"Program log: Left:\")) {\n                const valueRegex = /^Program log: (Left|Right): (.*)$/;\n                const leftValue = valueRegex.exec(logs[anchorErrorLogIndex + 1])[2];\n                const rightValue = valueRegex.exec(logs[anchorErrorLogIndex + 2])[2];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 3));\n                comparedValues = [leftValue, rightValue];\n            }\n        }\n        const regexNoInfo = /^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const noInfoAnchorErrorLog = regexNoInfo.exec(anchorErrorLog);\n        const regexFileLine = /^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const fileLineAnchorErrorLog = regexFileLine.exec(anchorErrorLog);\n        const regexAccountName = /^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const accountNameAnchorErrorLog = regexAccountName.exec(anchorErrorLog);\n        if (noInfoAnchorErrorLog) {\n            const [errorCodeString, errorNumber, errorMessage] = noInfoAnchorErrorLog.slice(1, 4);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, undefined, comparedValues);\n        }\n        else if (fileLineAnchorErrorLog) {\n            const [file, line, errorCodeString, errorNumber, errorMessage] = fileLineAnchorErrorLog.slice(1, 6);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            const fileLine = { file, line: parseInt(line) };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, fileLine, comparedValues);\n        }\n        else if (accountNameAnchorErrorLog) {\n            const [accountName, errorCodeString, errorNumber, errorMessage] = accountNameAnchorErrorLog.slice(1, 5);\n            const origin = accountName;\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, origin, comparedValues);\n        }\n        else {\n            return null;\n        }\n    }\n    get program() {\n        return this._programErrorStack.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        return this._programErrorStack.stack;\n    }\n    toString() {\n        return this.message;\n    }\n}\n// An error from a user defined program.\nclass ProgramError extends Error {\n    constructor(code, msg, logs) {\n        super();\n        this.code = code;\n        this.msg = msg;\n        this.logs = logs;\n        if (logs) {\n            this._programErrorStack = ProgramErrorStack.parse(logs);\n        }\n    }\n    static parse(err, idlErrors) {\n        const errString = err.toString();\n        // TODO: don't rely on the error string. web3.js should preserve the error\n        //       code information instead of giving us an untyped string.\n        let unparsedErrorCode;\n        if (errString.includes(\"custom program error:\")) {\n            let components = errString.split(\"custom program error: \");\n            if (components.length !== 2) {\n                return null;\n            }\n            else {\n                unparsedErrorCode = components[1];\n            }\n        }\n        else {\n            const matches = errString.match(/\"Custom\":([0-9]+)}/g);\n            if (!matches || matches.length > 1) {\n                return null;\n            }\n            unparsedErrorCode = matches[0].match(/([0-9]+)/g)[0];\n        }\n        let errorCode;\n        try {\n            errorCode = parseInt(unparsedErrorCode);\n        }\n        catch (parseErr) {\n            return null;\n        }\n        // Parse user error.\n        let errorMsg = idlErrors.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Parse framework internal error.\n        errorMsg = LangErrorMessage.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Unable to parse the error. Just return the untranslated error.\n        return null;\n    }\n    get program() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack;\n    }\n    toString() {\n        return this.msg;\n    }\n}\nfunction translateError(err, idlErrors) {\n    if (isSet(\"debug-logs\")) {\n        console.log(\"Translating error:\", err);\n    }\n    const anchorError = AnchorError.parse(err.logs);\n    if (anchorError) {\n        return anchorError;\n    }\n    const programError = ProgramError.parse(err, idlErrors);\n    if (programError) {\n        return programError;\n    }\n    if (err.logs) {\n        const handler = {\n            get: function (target, prop) {\n                if (prop === \"programErrorStack\") {\n                    return target.programErrorStack.stack;\n                }\n                else if (prop === \"program\") {\n                    return target.programErrorStack.stack[err.programErrorStack.stack.length - 1];\n                }\n                else {\n                    // this is the normal way to return all other props\n                    // without modifying them.\n                    // @ts-expect-error\n                    return Reflect.get(...arguments);\n                }\n            },\n        };\n        err.programErrorStack = ProgramErrorStack.parse(err.logs);\n        return new Proxy(err, handler);\n    }\n    return err;\n}\nconst LangErrorCode = {\n    // Instructions.\n    InstructionMissing: 100,\n    InstructionFallbackNotFound: 101,\n    InstructionDidNotDeserialize: 102,\n    InstructionDidNotSerialize: 103,\n    // IDL instructions.\n    IdlInstructionStub: 1000,\n    IdlInstructionInvalidProgram: 1001,\n    // Constraints.\n    ConstraintMut: 2000,\n    ConstraintHasOne: 2001,\n    ConstraintSigner: 2002,\n    ConstraintRaw: 2003,\n    ConstraintOwner: 2004,\n    ConstraintRentExempt: 2005,\n    ConstraintSeeds: 2006,\n    ConstraintExecutable: 2007,\n    ConstraintState: 2008,\n    ConstraintAssociated: 2009,\n    ConstraintAssociatedInit: 2010,\n    ConstraintClose: 2011,\n    ConstraintAddress: 2012,\n    ConstraintZero: 2013,\n    ConstraintTokenMint: 2014,\n    ConstraintTokenOwner: 2015,\n    ConstraintMintMintAuthority: 2016,\n    ConstraintMintFreezeAuthority: 2017,\n    ConstraintMintDecimals: 2018,\n    ConstraintSpace: 2019,\n    ConstraintAccountIsNone: 2020,\n    // Require.\n    RequireViolated: 2500,\n    RequireEqViolated: 2501,\n    RequireKeysEqViolated: 2502,\n    RequireNeqViolated: 2503,\n    RequireKeysNeqViolated: 2504,\n    RequireGtViolated: 2505,\n    RequireGteViolated: 2506,\n    // Accounts.\n    AccountDiscriminatorAlreadySet: 3000,\n    AccountDiscriminatorNotFound: 3001,\n    AccountDiscriminatorMismatch: 3002,\n    AccountDidNotDeserialize: 3003,\n    AccountDidNotSerialize: 3004,\n    AccountNotEnoughKeys: 3005,\n    AccountNotMutable: 3006,\n    AccountOwnedByWrongProgram: 3007,\n    InvalidProgramId: 3008,\n    InvalidProgramExecutable: 3009,\n    AccountNotSigner: 3010,\n    AccountNotSystemOwned: 3011,\n    AccountNotInitialized: 3012,\n    AccountNotProgramData: 3013,\n    AccountNotAssociatedTokenAccount: 3014,\n    AccountSysvarMismatch: 3015,\n    AccountReallocExceedsLimit: 3016,\n    AccountDuplicateReallocs: 3017,\n    // Miscellaneous\n    DeclaredProgramIdMismatch: 4100,\n    // Used for APIs that shouldn't be used anymore.\n    Deprecated: 5000,\n};\nconst LangErrorMessage = new Map([\n    // Instructions.\n    [\n        LangErrorCode.InstructionMissing,\n        \"8 byte instruction identifier not provided\",\n    ],\n    [\n        LangErrorCode.InstructionFallbackNotFound,\n        \"Fallback functions are not supported\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotDeserialize,\n        \"The program could not deserialize the given instruction\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotSerialize,\n        \"The program could not serialize the given instruction\",\n    ],\n    // Idl instructions.\n    [\n        LangErrorCode.IdlInstructionStub,\n        \"The program was compiled without idl instructions\",\n    ],\n    [\n        LangErrorCode.IdlInstructionInvalidProgram,\n        \"The transaction was given an invalid program for the IDL instruction\",\n    ],\n    // Constraints.\n    [LangErrorCode.ConstraintMut, \"A mut constraint was violated\"],\n    [LangErrorCode.ConstraintHasOne, \"A has one constraint was violated\"],\n    [LangErrorCode.ConstraintSigner, \"A signer constraint was violated\"],\n    [LangErrorCode.ConstraintRaw, \"A raw constraint was violated\"],\n    [LangErrorCode.ConstraintOwner, \"An owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintRentExempt,\n        \"A rent exemption constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSeeds, \"A seeds constraint was violated\"],\n    [LangErrorCode.ConstraintExecutable, \"An executable constraint was violated\"],\n    [\n        LangErrorCode.ConstraintState,\n        \"Deprecated Error, feel free to replace with something else\",\n    ],\n    [LangErrorCode.ConstraintAssociated, \"An associated constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAssociatedInit,\n        \"An associated init constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintClose, \"A close constraint was violated\"],\n    [LangErrorCode.ConstraintAddress, \"An address constraint was violated\"],\n    [LangErrorCode.ConstraintZero, \"Expected zero account discriminant\"],\n    [LangErrorCode.ConstraintTokenMint, \"A token mint constraint was violated\"],\n    [LangErrorCode.ConstraintTokenOwner, \"A token owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintMintMintAuthority,\n        \"A mint mint authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintFreezeAuthority,\n        \"A mint freeze authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintDecimals,\n        \"A mint decimals constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSpace, \"A space constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAccountIsNone,\n        \"A required account for the constraint is None\",\n    ],\n    // Require.\n    [LangErrorCode.RequireViolated, \"A require expression was violated\"],\n    [LangErrorCode.RequireEqViolated, \"A require_eq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysEqViolated,\n        \"A require_keys_eq expression was violated\",\n    ],\n    [LangErrorCode.RequireNeqViolated, \"A require_neq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysNeqViolated,\n        \"A require_keys_neq expression was violated\",\n    ],\n    [LangErrorCode.RequireGtViolated, \"A require_gt expression was violated\"],\n    [LangErrorCode.RequireGteViolated, \"A require_gte expression was violated\"],\n    // Accounts.\n    [\n        LangErrorCode.AccountDiscriminatorAlreadySet,\n        \"The account discriminator was already set on this account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorNotFound,\n        \"No 8 byte discriminator was found on the account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorMismatch,\n        \"8 byte discriminator did not match what was expected\",\n    ],\n    [LangErrorCode.AccountDidNotDeserialize, \"Failed to deserialize the account\"],\n    [LangErrorCode.AccountDidNotSerialize, \"Failed to serialize the account\"],\n    [\n        LangErrorCode.AccountNotEnoughKeys,\n        \"Not enough account keys given to the instruction\",\n    ],\n    [LangErrorCode.AccountNotMutable, \"The given account is not mutable\"],\n    [\n        LangErrorCode.AccountOwnedByWrongProgram,\n        \"The given account is owned by a different program than expected\",\n    ],\n    [LangErrorCode.InvalidProgramId, \"Program ID was not as expected\"],\n    [LangErrorCode.InvalidProgramExecutable, \"Program account is not executable\"],\n    [LangErrorCode.AccountNotSigner, \"The given account did not sign\"],\n    [\n        LangErrorCode.AccountNotSystemOwned,\n        \"The given account is not owned by the system program\",\n    ],\n    [\n        LangErrorCode.AccountNotInitialized,\n        \"The program expected this account to be already initialized\",\n    ],\n    [\n        LangErrorCode.AccountNotProgramData,\n        \"The given account is not a program data account\",\n    ],\n    [\n        LangErrorCode.AccountNotAssociatedTokenAccount,\n        \"The given account is not the associated token account\",\n    ],\n    [\n        LangErrorCode.AccountSysvarMismatch,\n        \"The given public key does not match the required sysvar\",\n    ],\n    [\n        LangErrorCode.AccountReallocExceedsLimit,\n        \"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\",\n    ],\n    [\n        LangErrorCode.AccountDuplicateReallocs,\n        \"The account was duplicated for more than one reallocation\",\n    ],\n    // Miscellaneous\n    [\n        LangErrorCode.DeclaredProgramIdMismatch,\n        \"The declared program id does not match the actual program id\",\n    ],\n    // Deprecated\n    [\n        LangErrorCode.Deprecated,\n        \"The API being used is deprecated and should no longer be used\",\n    ],\n]);\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign$1 = function() {\r\n    __assign$1 = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    };\r\n    return __assign$1.apply(this, arguments);\r\n};\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    };\r\n    return __assign.apply(this, arguments);\r\n};\n\n/**\n * Source: ftp://ftp.unicode.org/Public/UCD/latest/ucd/SpecialCasing.txt\n */\n/**\n * Lower case as a function.\n */\nfunction lowerCase(str) {\n    return str.toLowerCase();\n}\n\n// Support camel case (\"camelCase\" -> \"camel Case\" and \"CAMELCase\" -> \"CAMEL Case\").\nvar DEFAULT_SPLIT_REGEXP = [/([a-z0-9])([A-Z])/g, /([A-Z])([A-Z][a-z])/g];\n// Remove all non-word characters.\nvar DEFAULT_STRIP_REGEXP = /[^A-Z0-9]+/gi;\n/**\n * Normalize the string into something other libraries can manipulate easier.\n */\nfunction noCase(input, options) {\n    if (options === void 0) { options = {}; }\n    var _a = options.splitRegexp, splitRegexp = _a === void 0 ? DEFAULT_SPLIT_REGEXP : _a, _b = options.stripRegexp, stripRegexp = _b === void 0 ? DEFAULT_STRIP_REGEXP : _b, _c = options.transform, transform = _c === void 0 ? lowerCase : _c, _d = options.delimiter, delimiter = _d === void 0 ? \" \" : _d;\n    var result = replace(replace(input, splitRegexp, \"$1\\0$2\"), stripRegexp, \"\\0\");\n    var start = 0;\n    var end = result.length;\n    // Trim the delimiter from around the output string.\n    while (result.charAt(start) === \"\\0\")\n        start++;\n    while (result.charAt(end - 1) === \"\\0\")\n        end--;\n    // Transform each token independently.\n    return result.slice(start, end).split(\"\\0\").map(transform).join(delimiter);\n}\n/**\n * Replace `re` in the input string with the replacement value.\n */\nfunction replace(input, re, value) {\n    if (re instanceof RegExp)\n        return input.replace(re, value);\n    return re.reduce(function (input, re) { return input.replace(re, value); }, input);\n}\n\nfunction dotCase(input, options) {\n    if (options === void 0) { options = {}; }\n    return noCase(input, __assign({ delimiter: \".\" }, options));\n}\n\nfunction snakeCase(input, options) {\n    if (options === void 0) { options = {}; }\n    return dotCase(input, __assign$1({ delimiter: \"_\" }, options));\n}\n\nclass IdlCoder {\n    static fieldLayout(field, types) {\n        const fieldName = field.name !== undefined ? camelCase(field.name) : undefined;\n        switch (field.type) {\n            case \"bool\": {\n                return borsh.bool(fieldName);\n            }\n            case \"u8\": {\n                return borsh.u8(fieldName);\n            }\n            case \"i8\": {\n                return borsh.i8(fieldName);\n            }\n            case \"u16\": {\n                return borsh.u16(fieldName);\n            }\n            case \"i16\": {\n                return borsh.i16(fieldName);\n            }\n            case \"u32\": {\n                return borsh.u32(fieldName);\n            }\n            case \"i32\": {\n                return borsh.i32(fieldName);\n            }\n            case \"f32\": {\n                return borsh.f32(fieldName);\n            }\n            case \"u64\": {\n                return borsh.u64(fieldName);\n            }\n            case \"i64\": {\n                return borsh.i64(fieldName);\n            }\n            case \"f64\": {\n                return borsh.f64(fieldName);\n            }\n            case \"u128\": {\n                return borsh.u128(fieldName);\n            }\n            case \"i128\": {\n                return borsh.i128(fieldName);\n            }\n            case \"u256\": {\n                return borsh.u256(fieldName);\n            }\n            case \"i256\": {\n                return borsh.i256(fieldName);\n            }\n            case \"bytes\": {\n                return borsh.vecU8(fieldName);\n            }\n            case \"string\": {\n                return borsh.str(fieldName);\n            }\n            case \"publicKey\": {\n                return borsh.publicKey(fieldName);\n            }\n            default: {\n                if (\"vec\" in field.type) {\n                    return borsh.vec(IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: field.type.vec,\n                    }, types), fieldName);\n                }\n                else if (\"option\" in field.type) {\n                    return borsh.option(IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: field.type.option,\n                    }, types), fieldName);\n                }\n                else if (\"defined\" in field.type) {\n                    // User defined type.\n                    if (!types) {\n                        throw new IdlError(\"User defined types not provided\");\n                    }\n                    const defined = field.type.defined;\n                    const filtered = types.filter((t) => t.name === defined);\n                    if (filtered.length !== 1) {\n                        throw new IdlError(`Type not found: ${JSON.stringify(field)}`);\n                    }\n                    return IdlCoder.typeDefLayout(filtered[0], types, fieldName);\n                }\n                else if (\"array\" in field.type) {\n                    let arrayTy = field.type.array[0];\n                    let arrayLen = field.type.array[1];\n                    let innerLayout = IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: arrayTy,\n                    }, types);\n                    return borsh.array(innerLayout, arrayLen, fieldName);\n                }\n                else {\n                    throw new Error(`Not yet implemented: ${field}`);\n                }\n            }\n        }\n    }\n    static typeDefLayout(typeDef, types = [], name) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const fieldLayouts = typeDef.type.fields.map((field) => {\n                    return IdlCoder.fieldLayout(field, types);\n                });\n                return borsh.struct(fieldLayouts, name);\n            }\n            case \"enum\": {\n                let variants = typeDef.type.variants.map((variant) => {\n                    const name = camelCase(variant.name);\n                    if (!variant.fields) {\n                        return borsh.struct([], name);\n                    }\n                    const fieldLayouts = variant.fields.map((f, i) => {\n                        if (f === null || f === void 0 ? void 0 : f.name) {\n                            return IdlCoder.fieldLayout(f, types);\n                        }\n                        return IdlCoder.fieldLayout({ type: f, name: i.toString() }, types);\n                    });\n                    return borsh.struct(fieldLayouts, name);\n                });\n                if (name !== undefined) {\n                    // Buffer-layout lib requires the name to be null (on construction)\n                    // when used as a field.\n                    return borsh.rustEnum(variants).replicate(name);\n                }\n                return borsh.rustEnum(variants, name);\n            }\n            case \"alias\": {\n                return IdlCoder.fieldLayout({ type: typeDef.type.value, name: typeDef.name }, types);\n            }\n        }\n    }\n}\n\n/**\n * Namespace for global instruction function signatures (i.e. functions\n * that aren't namespaced by the state or any of its trait implementations).\n */\nconst SIGHASH_GLOBAL_NAMESPACE = \"global\";\n/**\n * Encodes and decodes program instructions.\n */\nclass BorshInstructionCoder {\n    constructor(idl) {\n        this.idl = idl;\n        this.ixLayout = BorshInstructionCoder.parseIxLayout(idl);\n        const sighashLayouts = new Map();\n        idl.instructions.forEach((ix) => {\n            const sh = sighash(SIGHASH_GLOBAL_NAMESPACE, ix.name);\n            sighashLayouts.set(bs58$1.encode(sh), {\n                layout: this.ixLayout.get(ix.name),\n                name: ix.name,\n            });\n        });\n        this.sighashLayouts = sighashLayouts;\n    }\n    /**\n     * Encodes a program instruction.\n     */\n    encode(ixName, ix) {\n        return this._encode(SIGHASH_GLOBAL_NAMESPACE, ixName, ix);\n    }\n    _encode(nameSpace, ixName, ix) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const methodName = camelCase(ixName);\n        const layout = this.ixLayout.get(methodName);\n        if (!layout) {\n            throw new Error(`Unknown method: ${methodName}`);\n        }\n        const len = layout.encode(ix, buffer);\n        const data = buffer.slice(0, len);\n        return Buffer$1.concat([sighash(nameSpace, ixName), data]);\n    }\n    static parseIxLayout(idl) {\n        const ixLayouts = idl.instructions.map((ix) => {\n            let fieldLayouts = ix.args.map((arg) => {\n                var _a, _b;\n                return IdlCoder.fieldLayout(arg, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n            });\n            const name = camelCase(ix.name);\n            return [name, borsh.struct(fieldLayouts, name)];\n        });\n        return new Map(ixLayouts);\n    }\n    /**\n     * Decodes a program instruction.\n     */\n    decode(ix, encoding = \"hex\") {\n        if (typeof ix === \"string\") {\n            ix = encoding === \"hex\" ? Buffer$1.from(ix, \"hex\") : bs58$1.decode(ix);\n        }\n        let sighash = bs58$1.encode(ix.slice(0, 8));\n        let data = ix.slice(8);\n        const decoder = this.sighashLayouts.get(sighash);\n        if (!decoder) {\n            return null;\n        }\n        return {\n            data: decoder.layout.decode(data),\n            name: decoder.name,\n        };\n    }\n    /**\n     * Returns a formatted table of all the fields in the given instruction data.\n     */\n    format(ix, accountMetas) {\n        return InstructionFormatter.format(ix, accountMetas, this.idl);\n    }\n}\nclass InstructionFormatter {\n    static format(ix, accountMetas, idl) {\n        const idlIx = idl.instructions.filter((i) => ix.name === i.name)[0];\n        if (idlIx === undefined) {\n            console.error(\"Invalid instruction given\");\n            return null;\n        }\n        const args = idlIx.args.map((idlField) => {\n            return {\n                name: idlField.name,\n                type: InstructionFormatter.formatIdlType(idlField.type),\n                data: InstructionFormatter.formatIdlData(idlField, ix.data[idlField.name], idl.types),\n            };\n        });\n        const flatIdlAccounts = InstructionFormatter.flattenIdlAccounts(idlIx.accounts);\n        const accounts = accountMetas.map((meta, idx) => {\n            if (idx < flatIdlAccounts.length) {\n                return {\n                    name: flatIdlAccounts[idx].name,\n                    ...meta,\n                };\n            }\n            // \"Remaining accounts\" are unnamed in Anchor.\n            else {\n                return {\n                    name: undefined,\n                    ...meta,\n                };\n            }\n        });\n        return {\n            args,\n            accounts,\n        };\n    }\n    static formatIdlType(idlType) {\n        if (typeof idlType === \"string\") {\n            return idlType;\n        }\n        if (\"vec\" in idlType) {\n            return `Vec<${this.formatIdlType(idlType.vec)}>`;\n        }\n        if (\"option\" in idlType) {\n            return `Option<${this.formatIdlType(idlType.option)}>`;\n        }\n        if (\"defined\" in idlType) {\n            return idlType.defined;\n        }\n        if (\"array\" in idlType) {\n            return `Array<${idlType.array[0]}; ${idlType.array[1]}>`;\n        }\n        throw new Error(`Unknown IDL type: ${idlType}`);\n    }\n    static formatIdlData(idlField, data, types) {\n        if (typeof idlField.type === \"string\") {\n            return data.toString();\n        }\n        if (idlField.type.hasOwnProperty(\"vec\")) {\n            return (\"[\" +\n                data\n                    .map((d) => this.formatIdlData({ name: \"\", type: idlField.type.vec }, d))\n                    .join(\", \") +\n                \"]\");\n        }\n        if (idlField.type.hasOwnProperty(\"option\")) {\n            return data === null\n                ? \"null\"\n                : this.formatIdlData({ name: \"\", type: idlField.type.option }, data, types);\n        }\n        if (idlField.type.hasOwnProperty(\"defined\")) {\n            if (types === undefined) {\n                throw new Error(\"User defined types not provided\");\n            }\n            const filtered = types.filter((t) => t.name === idlField.type.defined);\n            if (filtered.length !== 1) {\n                throw new Error(`Type not found: ${idlField.type.defined}`);\n            }\n            return InstructionFormatter.formatIdlDataDefined(filtered[0], data, types);\n        }\n        return \"unknown\";\n    }\n    static formatIdlDataDefined(typeDef, data, types) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const struct = typeDef.type;\n                const fields = Object.keys(data)\n                    .map((k) => {\n                    const field = struct.fields.find((f) => f.name === k);\n                    if (!field) {\n                        throw new Error(\"Unable to find type\");\n                    }\n                    return (k +\n                        \": \" +\n                        InstructionFormatter.formatIdlData(field, data[k], types));\n                })\n                    .join(\", \");\n                return \"{ \" + fields + \" }\";\n            }\n            case \"enum\": {\n                if (typeDef.type.variants.length === 0) {\n                    return \"{}\";\n                }\n                // Struct enum.\n                if (typeDef.type.variants[0].name) {\n                    const variants = typeDef.type.variants;\n                    const variant = Object.keys(data)[0];\n                    const enumType = data[variant];\n                    const namedFields = Object.keys(enumType)\n                        .map((f) => {\n                        var _a;\n                        const fieldData = enumType[f];\n                        const idlField = (_a = variants[variant]) === null || _a === void 0 ? void 0 : _a.find((v) => v.name === f);\n                        if (!idlField) {\n                            throw new Error(\"Unable to find variant\");\n                        }\n                        return (f +\n                            \": \" +\n                            InstructionFormatter.formatIdlData(idlField, fieldData, types));\n                    })\n                        .join(\", \");\n                    const variantName = camelCase(variant, { pascalCase: true });\n                    if (namedFields.length === 0) {\n                        return variantName;\n                    }\n                    return `${variantName} { ${namedFields} }`;\n                }\n                // Tuple enum.\n                else {\n                    // TODO.\n                    return \"Tuple formatting not yet implemented\";\n                }\n            }\n            case \"alias\": {\n                return InstructionFormatter.formatIdlType(typeDef.type.value);\n            }\n        }\n    }\n    static flattenIdlAccounts(accounts, prefix) {\n        return accounts\n            .map((account) => {\n            const accName = sentenceCase(account.name);\n            if (account.hasOwnProperty(\"accounts\")) {\n                const newPrefix = prefix ? `${prefix} > ${accName}` : accName;\n                return InstructionFormatter.flattenIdlAccounts(account.accounts, newPrefix);\n            }\n            else {\n                return {\n                    ...account,\n                    name: prefix ? `${prefix} > ${accName}` : accName,\n                };\n            }\n        })\n            .flat();\n    }\n}\nfunction sentenceCase(field) {\n    const result = field.replace(/([A-Z])/g, \" $1\");\n    return result.charAt(0).toUpperCase() + result.slice(1);\n}\n// Not technically sighash, since we don't include the arguments, as Rust\n// doesn't allow function overloading.\nfunction sighash(nameSpace, ixName) {\n    let name = snakeCase(ixName);\n    let preimage = `${nameSpace}:${name}`;\n    return Buffer$1.from(sha256$1(preimage).slice(0, 8));\n}\n\nfunction accountSize(idl, idlAccount) {\n    switch (idlAccount.type.kind) {\n        case \"struct\": {\n            return idlAccount.type.fields\n                .map((f) => typeSize(idl, f.type))\n                .reduce((acc, size) => acc + size, 0);\n        }\n        case \"enum\": {\n            const variantSizes = idlAccount.type.variants.map((variant) => {\n                if (!variant.fields) {\n                    return 0;\n                }\n                return variant.fields\n                    .map((f) => {\n                    // Unnamed enum variant\n                    if (!(typeof f === \"object\" && \"name\" in f)) {\n                        return typeSize(idl, f);\n                    }\n                    // Named enum variant\n                    return typeSize(idl, f.type);\n                })\n                    .reduce((acc, size) => acc + size, 0);\n            });\n            return Math.max(...variantSizes) + 1;\n        }\n        case \"alias\": {\n            return typeSize(idl, idlAccount.type.value);\n        }\n    }\n}\n// Returns the size of the type in bytes. For variable length types, just return\n// 1. Users should override this value in such cases.\nfunction typeSize(idl, ty) {\n    var _a, _b;\n    switch (ty) {\n        case \"bool\":\n            return 1;\n        case \"u8\":\n            return 1;\n        case \"i8\":\n            return 1;\n        case \"i16\":\n            return 2;\n        case \"u16\":\n            return 2;\n        case \"u32\":\n            return 4;\n        case \"i32\":\n            return 4;\n        case \"f32\":\n            return 4;\n        case \"u64\":\n            return 8;\n        case \"i64\":\n            return 8;\n        case \"f64\":\n            return 8;\n        case \"u128\":\n            return 16;\n        case \"i128\":\n            return 16;\n        case \"u256\":\n            return 32;\n        case \"i256\":\n            return 32;\n        case \"bytes\":\n            return 1;\n        case \"string\":\n            return 1;\n        case \"publicKey\":\n            return 32;\n        default:\n            if (\"vec\" in ty) {\n                return 1;\n            }\n            if (\"option\" in ty) {\n                return 1 + typeSize(idl, ty.option);\n            }\n            if (\"coption\" in ty) {\n                return 4 + typeSize(idl, ty.coption);\n            }\n            if (\"defined\" in ty) {\n                const filtered = (_b = (_a = idl.types) === null || _a === void 0 ? void 0 : _a.filter((t) => t.name === ty.defined)) !== null && _b !== void 0 ? _b : [];\n                if (filtered.length !== 1) {\n                    throw new IdlError(`Type not found: ${JSON.stringify(ty)}`);\n                }\n                let typeDef = filtered[0];\n                return accountSize(idl, typeDef);\n            }\n            if (\"array\" in ty) {\n                let arrayTy = ty.array[0];\n                let arraySize = ty.array[1];\n                return typeSize(idl, arrayTy) * arraySize;\n            }\n            throw new Error(`Invalid type ${JSON.stringify(ty)}`);\n    }\n}\n\n/**\n * Number of bytes in anchor discriminators\n */\nconst DISCRIMINATOR_SIZE = 8;\nfunction discriminator(preimage) {\n    return Buffer.from(sha256$1(preimage).slice(0, DISCRIMINATOR_SIZE));\n}\n\n/**\n * Encodes and decodes account objects.\n */\nclass BorshAccountsCoder {\n    constructor(idl) {\n        if (idl.accounts === undefined) {\n            this.accountLayouts = new Map();\n            return;\n        }\n        const layouts = idl.accounts.map((acc) => {\n            return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n        });\n        this.accountLayouts = new Map(layouts);\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        const len = layout.encode(account, buffer);\n        let accountData = buffer.slice(0, len);\n        let discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        return Buffer$1.concat([discriminator, accountData]);\n    }\n    decode(accountName, data) {\n        // Assert the account discriminator is correct.\n        const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        if (discriminator.compare(data.slice(0, 8))) {\n            throw new Error(\"Invalid account discriminator\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeAny(data) {\n        const accountDescriminator = data.slice(0, 8);\n        const accountName = Array.from(this.accountLayouts.keys()).find((key) => BorshAccountsCoder.accountDiscriminator(key).equals(accountDescriminator));\n        if (!accountName) {\n            throw new Error(\"Account descriminator not found\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeUnchecked(accountName, ix) {\n        // Chop off the discriminator before decoding.\n        const data = ix.subarray(DISCRIMINATOR_SIZE);\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        return layout.decode(data);\n    }\n    memcmp(accountName, appendData) {\n        const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        return {\n            offset: 0,\n            bytes: bs58$1.encode(appendData ? Buffer$1.concat([discriminator, appendData]) : discriminator),\n        };\n    }\n    size(idlAccount) {\n        var _a;\n        return DISCRIMINATOR_SIZE + ((_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0);\n    }\n    /**\n     * Calculates and returns a unique 8 byte discriminator prepended to all anchor accounts.\n     *\n     * @param name The name of the account to calculate the discriminator.\n     */\n    static accountDiscriminator(name) {\n        const discriminatorPreimage = `account:${camelCase(name, {\n            pascalCase: true,\n            preserveConsecutiveUppercase: true,\n        })}`;\n        return discriminator(discriminatorPreimage);\n    }\n}\n\nclass BorshEventCoder {\n    constructor(idl) {\n        if (idl.events === undefined) {\n            this.layouts = new Map();\n            return;\n        }\n        const layouts = idl.events.map((event) => {\n            let eventTypeDef = {\n                name: event.name,\n                type: {\n                    kind: \"struct\",\n                    fields: event.fields.map((f) => {\n                        return { name: f.name, type: f.type };\n                    }),\n                },\n            };\n            return [event.name, IdlCoder.typeDefLayout(eventTypeDef, idl.types)];\n        });\n        this.layouts = new Map(layouts);\n        this.discriminators = new Map(idl.events === undefined\n            ? []\n            : idl.events.map((e) => [\n                encode(eventDiscriminator(e.name)),\n                e.name,\n            ]));\n    }\n    decode(log) {\n        let logArr;\n        // This will throw if log length is not a multiple of 4.\n        try {\n            logArr = decode(log);\n        }\n        catch (e) {\n            return null;\n        }\n        const disc = encode(logArr.slice(0, 8));\n        // Only deserialize if the discriminator implies a proper event.\n        const eventName = this.discriminators.get(disc);\n        if (eventName === undefined) {\n            return null;\n        }\n        const layout = this.layouts.get(eventName);\n        if (!layout) {\n            throw new Error(`Unknown event: ${eventName}`);\n        }\n        const data = layout.decode(logArr.slice(8));\n        return { data, name: eventName };\n    }\n}\nfunction eventDiscriminator(name) {\n    return discriminator(`event:${name}`);\n}\n\n/**\n * Encodes and decodes user-defined types.\n */\nclass BorshTypesCoder {\n    constructor(idl) {\n        if (idl.types === undefined) {\n            this.typeLayouts = new Map();\n            return;\n        }\n        const layouts = idl.types.map((acc) => {\n            return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n        });\n        this.typeLayouts = new Map(layouts);\n        this.idl = idl;\n    }\n    encode(typeName, type) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.typeLayouts.get(typeName);\n        if (!layout) {\n            throw new Error(`Unknown type: ${typeName}`);\n        }\n        const len = layout.encode(type, buffer);\n        return buffer.slice(0, len);\n    }\n    decode(typeName, typeData) {\n        const layout = this.typeLayouts.get(typeName);\n        if (!layout) {\n            throw new Error(`Unknown type: ${typeName}`);\n        }\n        return layout.decode(typeData);\n    }\n}\n\n/**\n * BorshCoder is the default Coder for Anchor programs implementing the\n * borsh based serialization interface.\n */\nclass BorshCoder {\n    constructor(idl) {\n        this.instruction = new BorshInstructionCoder(idl);\n        this.accounts = new BorshAccountsCoder(idl);\n        this.events = new BorshEventCoder(idl);\n        this.types = new BorshTypesCoder(idl);\n    }\n}\n\nvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nvar Layout_2 = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob$1 extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/** Factory for {@link OffsetLayout}. */\nvar offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = (property => new UInt(4, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nvar nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nvar ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link Union} values. */\nvar union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = ((length, property) => new Blob$1(length, property));\n\nclass SystemInstructionCoder {\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    constructor(_) { }\n    encode(ixName, ix) {\n        switch (camelCase(ixName)) {\n            case \"createAccount\": {\n                return encodeCreateAccount(ix);\n            }\n            case \"assign\": {\n                return encodeAssign(ix);\n            }\n            case \"transfer\": {\n                return encodeTransfer(ix);\n            }\n            case \"createAccountWithSeed\": {\n                return encodeCreateAccountWithSeed(ix);\n            }\n            case \"advanceNonceAccount\": {\n                return encodeAdvanceNonceAccount(ix);\n            }\n            case \"withdrawNonceAccount\": {\n                return encodeWithdrawNonceAccount(ix);\n            }\n            case \"initializeNonceAccount\": {\n                return encodeInitializeNonceAccount(ix);\n            }\n            case \"authorizeNonceAccount\": {\n                return encodeAuthorizeNonceAccount(ix);\n            }\n            case \"allocate\": {\n                return encodeAllocate(ix);\n            }\n            case \"allocateWithSeed\": {\n                return encodeAllocateWithSeed(ix);\n            }\n            case \"assignWithSeed\": {\n                return encodeAssignWithSeed(ix);\n            }\n            case \"transferWithSeed\": {\n                return encodeTransferWithSeed(ix);\n            }\n            default: {\n                throw new Error(`Invalid instruction: ${ixName}`);\n            }\n        }\n    }\n    encodeState(_ixName, _ix) {\n        throw new Error(\"System does not have state\");\n    }\n}\nclass RustStringLayout extends Layout_2 {\n    constructor(property) {\n        super(-1, property);\n        this.property = property;\n        this.layout = struct([\n            u32(\"length\"),\n            u32(\"lengthPadding\"),\n            blob(offset(u32(), -8), \"chars\"),\n        ], this.property);\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span;\n        }\n        const data = {\n            chars: Buffer.from(src, \"utf8\"),\n        };\n        return this.layout.encode(data, b, offset);\n    }\n    decode(b, offset = 0) {\n        const data = this.layout.decode(b, offset);\n        return data[\"chars\"].toString();\n    }\n    getSpan(b, offset = 0) {\n        return (u32().span +\n            u32().span +\n            new BN(new Uint8Array(b).slice(offset, offset + 4), 10, \"le\").toNumber());\n    }\n}\nfunction rustStringLayout(property) {\n    return new RustStringLayout(property);\n}\nfunction publicKey$2(property) {\n    return blob(32, property);\n}\nfunction encodeCreateAccount({ lamports, space, owner }) {\n    return encodeData({\n        createAccount: { lamports, space, owner: owner.toBuffer() },\n    });\n}\nfunction encodeAssign({ owner }) {\n    return encodeData({\n        assign: { owner: owner.toBuffer() },\n    });\n}\nfunction encodeTransfer({ lamports }) {\n    return encodeData({\n        transfer: { lamports },\n    });\n}\nfunction encodeCreateAccountWithSeed({ base, seed, lamports, space, owner, }) {\n    return encodeData({\n        createAccountWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            lamports,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(3).span + seed.length);\n}\nfunction encodeInitializeNonceAccount({ authorized }) {\n    return encodeData({\n        initializeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAdvanceNonceAccount({ authorized }) {\n    return encodeData({\n        advanceNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeWithdrawNonceAccount({ lamports }) {\n    return encodeData({\n        withdrawNonceAccount: { lamports },\n    });\n}\nfunction encodeAuthorizeNonceAccount({ authorized }) {\n    return encodeData({\n        authorizeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAllocate({ space }) {\n    return encodeData({\n        allocate: { space },\n    });\n}\nfunction encodeAllocateWithSeed({ base, seed, space, owner }) {\n    return encodeData({\n        allocateWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(9).span + seed.length);\n}\nfunction encodeAssignWithSeed({ base, seed, owner }) {\n    return encodeData({\n        assignWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(10).span + seed.length);\n}\nfunction encodeTransferWithSeed({ lamports, seed, owner }) {\n    return encodeData({\n        transferWithSeed: {\n            lamports,\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(11).span + seed.length);\n}\nconst LAYOUT = union(u32(\"instruction\"));\nLAYOUT.addVariant(0, struct([\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccount\");\nLAYOUT.addVariant(1, struct([publicKey$2(\"owner\")]), \"assign\");\nLAYOUT.addVariant(2, struct([ns64(\"lamports\")]), \"transfer\");\nLAYOUT.addVariant(3, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccountWithSeed\");\nLAYOUT.addVariant(4, struct([publicKey$2(\"authorized\")]), \"advanceNonceAccount\");\nLAYOUT.addVariant(5, struct([ns64(\"lamports\")]), \"withdrawNonceAccount\");\nLAYOUT.addVariant(6, struct([publicKey$2(\"authorized\")]), \"initializeNonceAccount\");\nLAYOUT.addVariant(7, struct([publicKey$2(\"authorized\")]), \"authorizeNonceAccount\");\nLAYOUT.addVariant(8, struct([ns64(\"space\")]), \"allocate\");\nLAYOUT.addVariant(9, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"allocateWithSeed\");\nLAYOUT.addVariant(10, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"assignWithSeed\");\nLAYOUT.addVariant(11, struct([\n    ns64(\"lamports\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"transferWithSeed\");\nfunction encodeData(instruction, maxSpan) {\n    const b = Buffer.alloc(maxSpan !== null && maxSpan !== void 0 ? maxSpan : instructionMaxSpan);\n    const span = LAYOUT.encode(instruction, b);\n    if (maxSpan === undefined) {\n        return b.slice(0, span);\n    }\n    return b;\n}\nconst instructionMaxSpan = Math.max(...Object.values(LAYOUT.registry).map((r) => r.span));\n\nclass SystemAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        switch (accountName) {\n            case \"nonce\": {\n                const buffer = Buffer.alloc(NONCE_ACCOUNT_LENGTH);\n                const len = NONCE_ACCOUNT_LAYOUT.encode(account, buffer);\n                return buffer.slice(0, len);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    decode(accountName, ix) {\n        return this.decodeUnchecked(accountName, ix);\n    }\n    decodeUnchecked(accountName, ix) {\n        switch (accountName) {\n            case \"nonce\": {\n                return decodeNonceAccount(ix);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    // TODO: this won't use the appendData.\n    memcmp(accountName, _appendData) {\n        switch (accountName) {\n            case \"nonce\": {\n                return {\n                    dataSize: NONCE_ACCOUNT_LENGTH,\n                };\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    size(idlAccount) {\n        var _a;\n        return (_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0;\n    }\n}\nfunction decodeNonceAccount(ix) {\n    return NONCE_ACCOUNT_LAYOUT.decode(ix);\n}\nclass WrappedLayout$1 extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey$1(property) {\n    return new WrappedLayout$1(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nconst NONCE_ACCOUNT_LAYOUT = struct([\n    u32(\"version\"),\n    u32(\"state\"),\n    publicKey$1(\"authorizedPubkey\"),\n    publicKey$1(\"nonce\"),\n    struct([nu64(\"lamportsPerSignature\")], \"feeCalculator\"),\n]);\n\nclass SystemEventsCoder {\n    constructor(_idl) { }\n    decode(_log) {\n        throw new Error(\"System program does not have events\");\n    }\n}\n\nclass SystemTypesCoder {\n    constructor(_idl) { }\n    encode(_name, _type) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n    decode(_name, _typeData) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n}\n\n/**\n * Coder for the System program.\n */\nclass SystemCoder {\n    constructor(idl) {\n        this.instruction = new SystemInstructionCoder(idl);\n        this.accounts = new SystemAccountsCoder(idl);\n        this.events = new SystemEventsCoder(idl);\n        this.types = new SystemTypesCoder(idl);\n    }\n}\n\nfunction hash(data) {\n    return new TextDecoder().decode(sha256$1(data));\n}\n\nvar sha256 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hash: hash\n});\n\n// Sync version of web3.PublicKey.createWithSeed.\nfunction createWithSeedSync(fromPublicKey, seed, programId) {\n    const buffer = Buffer$1.concat([\n        fromPublicKey.toBuffer(),\n        Buffer$1.from(seed),\n        programId.toBuffer(),\n    ]);\n    return new PublicKey(sha256$1(buffer));\n}\nfunction associated(programId, ...args) {\n    let seeds = [Buffer$1.from([97, 110, 99, 104, 111, 114])]; // b\"anchor\".\n    args.forEach((arg) => {\n        seeds.push(arg instanceof Buffer$1 ? arg : translateAddress(arg).toBuffer());\n    });\n    const [assoc] = PublicKey.findProgramAddressSync(seeds, translateAddress(programId));\n    return assoc;\n}\n\nvar pubkey = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    createWithSeedSync: createWithSeedSync,\n    associated: associated\n});\n\nconst TOKEN_PROGRAM_ID = new PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");\nconst ASSOCIATED_PROGRAM_ID = new PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\nfunction associatedAddress({ mint, owner, }) {\n    return PublicKey.findProgramAddressSync([owner.toBuffer(), TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], ASSOCIATED_PROGRAM_ID)[0];\n}\n\nvar token = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    TOKEN_PROGRAM_ID: TOKEN_PROGRAM_ID,\n    ASSOCIATED_PROGRAM_ID: ASSOCIATED_PROGRAM_ID,\n    associatedAddress: associatedAddress\n});\n\nvar browserPonyfill = {exports: {}};\n\n(function (module, exports) {\nvar global = typeof self !== 'undefined' ? self : commonjsGlobal;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException;\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\n((function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}))({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch; // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch; // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch; // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers;\nexports.Request = ctx.Request;\nexports.Response = ctx.Response;\nmodule.exports = exports;\n}(browserPonyfill, browserPonyfill.exports));\n\nvar fetch = /*@__PURE__*/getDefaultExportFromCjs(browserPonyfill.exports);\n\n/**\n * Returns a verified build from the anchor registry. null if no such\n * verified build exists, e.g., if the program has been upgraded since the\n * last verified build.\n */\nasync function verifiedBuild(connection, programId, limit = 5) {\n    const url = `https://api.apr.dev/api/v0/program/${programId.toString()}/latest?limit=${limit}`;\n    const [programData, latestBuildsResp] = await Promise.all([\n        fetchData(connection, programId),\n        fetch(url),\n    ]);\n    // Filter out all non successful builds.\n    const latestBuilds = (await latestBuildsResp.json()).filter((b) => !b.aborted && b.state === \"Built\" && b.verified === \"Verified\");\n    if (latestBuilds.length === 0) {\n        return null;\n    }\n    // Get the latest build.\n    const build = latestBuilds[0];\n    // Has the program been upgraded since the last build?\n    if (programData.slot.toNumber() !== build.verified_slot) {\n        return null;\n    }\n    // Success.\n    return build;\n}\n/**\n * Returns the program data account for this program, containing the\n * metadata for this program, e.g., the upgrade authority.\n */\nasync function fetchData(connection, programId) {\n    const accountInfo = await connection.getAccountInfo(programId);\n    if (accountInfo === null) {\n        throw new Error(\"program account not found\");\n    }\n    const { program } = decodeUpgradeableLoaderState(accountInfo.data);\n    const programdataAccountInfo = await connection.getAccountInfo(program.programdataAddress);\n    if (programdataAccountInfo === null) {\n        throw new Error(\"program data account not found\");\n    }\n    const { programData } = decodeUpgradeableLoaderState(programdataAccountInfo.data);\n    return programData;\n}\nconst UPGRADEABLE_LOADER_STATE_LAYOUT = borsh.rustEnum([\n    borsh.struct([], \"uninitialized\"),\n    borsh.struct([borsh.option(borsh.publicKey(), \"authorityAddress\")], \"buffer\"),\n    borsh.struct([borsh.publicKey(\"programdataAddress\")], \"program\"),\n    borsh.struct([\n        borsh.u64(\"slot\"),\n        borsh.option(borsh.publicKey(), \"upgradeAuthorityAddress\"),\n    ], \"programData\"),\n], undefined, borsh.u32());\nfunction decodeUpgradeableLoaderState(data) {\n    return UPGRADEABLE_LOADER_STATE_LAYOUT.decode(data);\n}\n\nvar registry = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    verifiedBuild: verifiedBuild,\n    fetchData: fetchData,\n    decodeUpgradeableLoaderState: decodeUpgradeableLoaderState\n});\n\nvar index = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    sha256: sha256,\n    rpc: rpc,\n    publicKey: pubkey,\n    bytes: index$1,\n    token: token,\n    features: features,\n    registry: registry\n});\n\nfunction isIdlAccounts(accountItem) {\n    return \"accounts\" in accountItem;\n}\n// Deterministic IDL address as a function of the program id.\nasync function idlAddress(programId) {\n    const base = (await PublicKey.findProgramAddress([], programId))[0];\n    return await PublicKey.createWithSeed(base, seed(), programId);\n}\n// Seed for generating the idlAddress.\nfunction seed() {\n    return \"anchor:idl\";\n}\nconst IDL_ACCOUNT_LAYOUT = borsh.struct([\n    borsh.publicKey(\"authority\"),\n    borsh.vecU8(\"data\"),\n]);\nfunction decodeIdlAccount(data) {\n    return IDL_ACCOUNT_LAYOUT.decode(data);\n}\n\nfunction splitArgsAndCtx(idlIx, args) {\n    var _a, _b;\n    let options = {};\n    const inputLen = idlIx.args ? idlIx.args.length : 0;\n    if (args.length > inputLen) {\n        if (args.length !== inputLen + 1) {\n            throw new Error(`provided too many arguments ${args} to instruction ${idlIx === null || idlIx === void 0 ? void 0 : idlIx.name} expecting: ${(_b = (_a = idlIx.args) === null || _a === void 0 ? void 0 : _a.map((a) => a.name)) !== null && _b !== void 0 ? _b : []}`);\n        }\n        options = args.pop();\n    }\n    return [args, options];\n}\n\nclass InstructionNamespaceFactory {\n    static build(idlIx, encodeFn, programId) {\n        if (idlIx.name === \"_inner\") {\n            throw new IdlError(\"the _inner name is reserved\");\n        }\n        const ix = (...args) => {\n            const [ixArgs, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            validateAccounts(idlIx.accounts, ctx.accounts);\n            validateInstruction(idlIx, ...args);\n            const keys = ix.accounts(ctx.accounts);\n            if (ctx.remainingAccounts !== undefined) {\n                keys.push(...ctx.remainingAccounts);\n            }\n            if (isSet(\"debug-logs\")) {\n                console.log(\"Outgoing account metas:\", keys);\n            }\n            return new TransactionInstruction({\n                keys,\n                programId,\n                data: encodeFn(idlIx.name, toInstruction(idlIx, ...ixArgs)),\n            });\n        };\n        // Utility fn for ordering the accounts for this instruction.\n        ix[\"accounts\"] = (accs) => {\n            return InstructionNamespaceFactory.accountsArray(accs, idlIx.accounts, programId, idlIx.name);\n        };\n        return ix;\n    }\n    static accountsArray(ctx, accounts, programId, ixName) {\n        if (!ctx) {\n            return [];\n        }\n        return accounts\n            .map((acc) => {\n            // Nested accounts.\n            const nestedAccounts = \"accounts\" in acc ? acc.accounts : undefined;\n            if (nestedAccounts !== undefined) {\n                const rpcAccs = ctx[acc.name];\n                return InstructionNamespaceFactory.accountsArray(rpcAccs, acc.accounts, programId, ixName).flat();\n            }\n            else {\n                const account = acc;\n                let pubkey;\n                try {\n                    pubkey = translateAddress(ctx[acc.name]);\n                }\n                catch (err) {\n                    throw new Error(`Wrong input type for account \"${acc.name}\" in the instruction accounts object${ixName !== undefined ? ' for instruction \"' + ixName + '\"' : \"\"}. Expected PublicKey or string.`);\n                }\n                const optional = account.isOptional && pubkey.equals(programId);\n                const isWritable = account.isMut && !optional;\n                const isSigner = account.isSigner && !optional;\n                return {\n                    pubkey,\n                    isWritable,\n                    isSigner,\n                };\n            }\n        })\n            .flat();\n    }\n}\n// Throws error if any argument required for the `ix` is not given.\nfunction validateInstruction(ix, ...args) {\n    // todo\n}\n\nclass TransactionFactory {\n    static build(idlIx, ixFn) {\n        const txFn = (...args) => {\n            var _a, _b, _c;\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            const tx = new Transaction();\n            if (ctx.preInstructions && ctx.instructions) {\n                throw new Error(\"instructions is deprecated, use preInstructions\");\n            }\n            (_a = ctx.preInstructions) === null || _a === void 0 ? void 0 : _a.forEach((ix) => tx.add(ix));\n            (_b = ctx.instructions) === null || _b === void 0 ? void 0 : _b.forEach((ix) => tx.add(ix));\n            tx.add(ixFn(...args));\n            (_c = ctx.postInstructions) === null || _c === void 0 ? void 0 : _c.forEach((ix) => tx.add(ix));\n            return tx;\n        };\n        return txFn;\n    }\n}\n\nclass RpcFactory {\n    static build(idlIx, txFn, idlErrors, provider) {\n        const rpc = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            if (provider.sendAndConfirm === undefined) {\n                throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n            }\n            try {\n                return await provider.sendAndConfirm(tx, (_a = ctx.signers) !== null && _a !== void 0 ? _a : [], ctx.options);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n        };\n        return rpc;\n    }\n}\n\nclass AccountFactory {\n    static build(idl, coder, programId, provider) {\n        var _a;\n        const accountFns = {};\n        (_a = idl.accounts) === null || _a === void 0 ? void 0 : _a.forEach((idlAccount) => {\n            const name = camelCase(idlAccount.name);\n            accountFns[name] = new AccountClient(idl, idlAccount, programId, provider, coder);\n        });\n        return accountFns;\n    }\n}\nclass AccountClient {\n    /**\n     * Returns the number of bytes in this account.\n     */\n    get size() {\n        return this._size;\n    }\n    /**\n     * Returns the program ID owning all accounts.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * Returns the client's wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * Returns the coder.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Returns the idl account.\n     */\n    get idlAccount() {\n        return this._idlAccount;\n    }\n    constructor(idl, idlAccount, programId, provider, coder) {\n        this._idlAccount = idlAccount;\n        this._programId = programId;\n        this._provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._size = this._coder.accounts.size(idlAccount);\n    }\n    /**\n     * Returns a deserialized account, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullable(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullableAndContext(address, commitment) {\n        const accountInfo = await this.getAccountInfoAndContext(address, commitment);\n        const { value, context } = accountInfo;\n        return {\n            data: value && value.data.length !== 0\n                ? this._coder.accounts.decode(this._idlAccount.name, value.data)\n                : null,\n            context,\n        };\n    }\n    /**\n     * Returns a deserialized account.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetch(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist or has no data ${address.toString()}`);\n        }\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchAndContext(address, commitment) {\n        const { data, context } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist ${address.toString()}`);\n        }\n        return { data, context };\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultiple(addresses, commitment) {\n        const accounts = await this.fetchMultipleAndContext(addresses, commitment);\n        return accounts.map((account) => (account ? account.data : null));\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultipleAndContext(addresses, commitment) {\n        const accounts = await getMultipleAccountsAndContext(this._provider.connection, addresses.map((address) => translateAddress(address)), commitment);\n        // Decode accounts where discriminator is correct, null otherwise\n        return accounts.map((result) => {\n            if (result == null) {\n                return null;\n            }\n            const { account, context } = result;\n            return {\n                data: this._coder.accounts.decode(this._idlAccount.name, account.data),\n                context,\n            };\n        });\n    }\n    /**\n     * Returns all instances of this account type for the program.\n     *\n     * @param filters User-provided filters to narrow the results from `connection.getProgramAccounts`.\n     *\n     *                When filters are not defined this method returns all\n     *                the account instances.\n     *\n     *                When filters are of type `Buffer`, the filters are appended\n     *                after the discriminator.\n     *\n     *                When filters are of type `GetProgramAccountsFilter[]`,\n     *                filters are appended after the discriminator filter.\n     */\n    async all(filters) {\n        const filter = this.coder.accounts.memcmp(this._idlAccount.name, filters instanceof Buffer ? filters : undefined);\n        const coderFilters = [];\n        if ((filter === null || filter === void 0 ? void 0 : filter.offset) != undefined && (filter === null || filter === void 0 ? void 0 : filter.bytes) != undefined) {\n            coderFilters.push({\n                memcmp: { offset: filter.offset, bytes: filter.bytes },\n            });\n        }\n        if ((filter === null || filter === void 0 ? void 0 : filter.dataSize) != undefined) {\n            coderFilters.push({ dataSize: filter.dataSize });\n        }\n        let resp = await this._provider.connection.getProgramAccounts(this._programId, {\n            commitment: this._provider.connection.commitment,\n            filters: [...coderFilters, ...(Array.isArray(filters) ? filters : [])],\n        });\n        return resp.map(({ pubkey, account }) => {\n            return {\n                publicKey: pubkey,\n                account: this._coder.accounts.decode(this._idlAccount.name, account.data),\n            };\n        });\n    }\n    /**\n     * Returns an `EventEmitter` emitting a \"change\" event whenever the account\n     * changes.\n     */\n    subscribe(address, commitment) {\n        const sub = subscriptions.get(address.toString());\n        if (sub) {\n            return sub.ee;\n        }\n        const ee = new EventEmitter();\n        address = translateAddress(address);\n        const listener = this._provider.connection.onAccountChange(address, (acc) => {\n            const account = this._coder.accounts.decode(this._idlAccount.name, acc.data);\n            ee.emit(\"change\", account);\n        }, commitment);\n        subscriptions.set(address.toString(), {\n            ee,\n            listener,\n        });\n        return ee;\n    }\n    /**\n     * Unsubscribes from the account at the given address.\n     */\n    async unsubscribe(address) {\n        let sub = subscriptions.get(address.toString());\n        if (!sub) {\n            console.warn(\"Address is not subscribed\");\n            return;\n        }\n        if (subscriptions) {\n            await this._provider.connection\n                .removeAccountChangeListener(sub.listener)\n                .then(() => {\n                subscriptions.delete(address.toString());\n            })\n                .catch(console.error);\n        }\n    }\n    /**\n     * Returns an instruction for creating this account.\n     */\n    async createInstruction(signer, sizeOverride) {\n        const size = this.size;\n        if (this._provider.publicKey === undefined) {\n            throw new Error(\"This function requires the Provider interface implementor to have a 'publicKey' field.\");\n        }\n        return SystemProgram.createAccount({\n            fromPubkey: this._provider.publicKey,\n            newAccountPubkey: signer.publicKey,\n            space: sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size,\n            lamports: await this._provider.connection.getMinimumBalanceForRentExemption(sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size),\n            programId: this._programId,\n        });\n    }\n    /**\n     * @deprecated since version 14.0.\n     *\n     * Function returning the associated account. Args are keys to associate.\n     * Order matters.\n     */\n    async associated(...args) {\n        const addr = await this.associatedAddress(...args);\n        return await this.fetch(addr);\n    }\n    /**\n     * @deprecated since version 14.0.\n     *\n     * Function returning the associated address. Args are keys to associate.\n     * Order matters.\n     */\n    async associatedAddress(...args) {\n        return await associated(this._programId, ...args);\n    }\n    async getAccountInfo(address, commitment) {\n        return await this._provider.connection.getAccountInfo(translateAddress(address), commitment);\n    }\n    async getAccountInfoAndContext(address, commitment) {\n        return await this._provider.connection.getAccountInfoAndContext(translateAddress(address), commitment);\n    }\n}\n// Tracks all subscriptions.\nconst subscriptions = new Map();\n\nconst PROGRAM_LOG = \"Program log: \";\nconst PROGRAM_DATA = \"Program data: \";\nconst PROGRAM_LOG_START_INDEX = PROGRAM_LOG.length;\nconst PROGRAM_DATA_START_INDEX = PROGRAM_DATA.length;\nclass EventManager {\n    constructor(programId, provider, coder) {\n        this._programId = programId;\n        this._provider = provider;\n        this._eventParser = new EventParser(programId, coder);\n        this._eventCallbacks = new Map();\n        this._eventListeners = new Map();\n        this._listenerIdCount = 0;\n    }\n    addEventListener(eventName, callback) {\n        var _a;\n        let listener = this._listenerIdCount;\n        this._listenerIdCount += 1;\n        // Store the listener into the event map.\n        if (!this._eventListeners.has(eventName)) {\n            this._eventListeners.set(eventName, []);\n        }\n        this._eventListeners.set(eventName, ((_a = this._eventListeners.get(eventName)) !== null && _a !== void 0 ? _a : []).concat(listener));\n        // Store the callback into the listener map.\n        this._eventCallbacks.set(listener, [eventName, callback]);\n        // Create the subscription singleton, if needed.\n        if (this._onLogsSubscriptionId !== undefined) {\n            return listener;\n        }\n        this._onLogsSubscriptionId = this._provider.connection.onLogs(this._programId, (logs, ctx) => {\n            if (logs.err) {\n                return;\n            }\n            for (const event of this._eventParser.parseLogs(logs.logs)) {\n                const allListeners = this._eventListeners.get(event.name);\n                if (allListeners) {\n                    allListeners.forEach((listener) => {\n                        const listenerCb = this._eventCallbacks.get(listener);\n                        if (listenerCb) {\n                            const [, callback] = listenerCb;\n                            callback(event.data, ctx.slot, logs.signature);\n                        }\n                    });\n                }\n            }\n        });\n        return listener;\n    }\n    async removeEventListener(listener) {\n        // Get the callback.\n        const callback = this._eventCallbacks.get(listener);\n        if (!callback) {\n            throw new Error(`Event listener ${listener} doesn't exist!`);\n        }\n        const [eventName] = callback;\n        // Get the listeners.\n        let listeners = this._eventListeners.get(eventName);\n        if (!listeners) {\n            throw new Error(`Event listeners don't exist for ${eventName}!`);\n        }\n        // Update both maps.\n        this._eventCallbacks.delete(listener);\n        listeners = listeners.filter((l) => l !== listener);\n        this._eventListeners.set(eventName, listeners);\n        if (listeners.length === 0) {\n            this._eventListeners.delete(eventName);\n        }\n        // Kill the websocket connection if all listeners have been removed.\n        if (this._eventCallbacks.size === 0) {\n            if (this._eventListeners.size !== 0) {\n                throw new Error(`Expected event listeners size to be 0 but got ${this._eventListeners.size}`);\n            }\n            if (this._onLogsSubscriptionId !== undefined) {\n                await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId);\n                this._onLogsSubscriptionId = undefined;\n            }\n        }\n    }\n}\nclass EventParser {\n    constructor(programId, coder) {\n        this.coder = coder;\n        this.programId = programId;\n    }\n    // Each log given, represents an array of messages emitted by\n    // a single transaction, which can execute many different programs across\n    // CPI boundaries. However, the subscription is only interested in the\n    // events emitted by *this* program. In achieving this, we keep track of the\n    // program execution context by parsing each log and looking for a CPI\n    // `invoke` call. If one exists, we know a new program is executing. So we\n    // push the programId onto a stack and switch the program context. This\n    // allows us to track, for a given log, which program was executing during\n    // its emission, thereby allowing us to know if a given log event was\n    // emitted by *this* program. If it was, then we parse the raw string and\n    // emit the event if the string matches the event being subscribed to.\n    *parseLogs(logs, errorOnDecodeFailure = false) {\n        const logScanner = new LogScanner(logs);\n        const execution = new ExecutionContext();\n        let log = logScanner.next();\n        while (log !== null) {\n            let [event, newProgram, didPop] = this.handleLog(execution, log, errorOnDecodeFailure);\n            if (event) {\n                yield event;\n            }\n            if (newProgram) {\n                execution.push(newProgram);\n            }\n            if (didPop) {\n                execution.pop();\n            }\n            log = logScanner.next();\n        }\n    }\n    // Main log handler. Returns a three element array of the event, the\n    // next program that was invoked for CPI, and a boolean indicating if\n    // a program has completed execution (and thus should be popped off the\n    // execution stack).\n    handleLog(execution, log, errorOnDecodeFailure) {\n        // Executing program is this program.\n        if (execution.stack.length > 0 &&\n            execution.program() === this.programId.toString()) {\n            return this.handleProgramLog(log, errorOnDecodeFailure);\n        }\n        // Executing program is not this program.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs from *this* program.\n    handleProgramLog(log, errorOnDecodeFailure) {\n        // This is a `msg!` log or a `sol_log_data` log.\n        if (log.startsWith(PROGRAM_LOG) || log.startsWith(PROGRAM_DATA)) {\n            const logStr = log.startsWith(PROGRAM_LOG)\n                ? log.slice(PROGRAM_LOG_START_INDEX)\n                : log.slice(PROGRAM_DATA_START_INDEX);\n            const event = this.coder.events.decode(logStr);\n            if (errorOnDecodeFailure && event === null) {\n                throw new Error(`Unable to decode event ${logStr}`);\n            }\n            return [event, null, false];\n        }\n        // System log.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs when the current program being executing is *not* this.\n    handleSystemLog(log) {\n        // System component.\n        const logStart = log.split(\":\")[0];\n        // Did the program finish executing?\n        if (logStart.match(/^Program (.*) success/g) !== null) {\n            return [null, true];\n            // Recursive call.\n        }\n        else if (logStart.startsWith(`Program ${this.programId.toString()} invoke`)) {\n            return [this.programId.toString(), false];\n        }\n        // CPI call.\n        else if (logStart.includes(\"invoke\")) {\n            return [\"cpi\", false]; // Any string will do.\n        }\n        else {\n            return [null, false];\n        }\n    }\n}\n// Stack frame execution context, allowing one to track what program is\n// executing for a given log.\nclass ExecutionContext {\n    constructor() {\n        this.stack = [];\n    }\n    program() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        return this.stack[this.stack.length - 1];\n    }\n    push(newProgram) {\n        this.stack.push(newProgram);\n    }\n    pop() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        this.stack.pop();\n    }\n}\nclass LogScanner {\n    constructor(logs) {\n        this.logs = logs;\n    }\n    next() {\n        if (this.logs.length === 0) {\n            return null;\n        }\n        let l = this.logs[0];\n        this.logs = this.logs.slice(1);\n        return l;\n    }\n}\n\nclass SimulateFactory {\n    static build(idlIx, txFn, idlErrors, provider, coder, programId, idl) {\n        const simulate = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            let resp = undefined;\n            if (provider.simulate === undefined) {\n                throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");\n            }\n            try {\n                resp = await provider.simulate(tx, ctx.signers, (_a = ctx.options) === null || _a === void 0 ? void 0 : _a.commitment);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n            if (resp === undefined) {\n                throw new Error(\"Unable to simulate transaction\");\n            }\n            const logs = resp.logs;\n            if (!logs) {\n                throw new Error(\"Simulated logs not found\");\n            }\n            const events = [];\n            if (idl.events) {\n                let parser = new EventParser(programId, coder);\n                for (const event of parser.parseLogs(logs)) {\n                    events.push(event);\n                }\n            }\n            return { events, raw: logs };\n        };\n        return simulate;\n    }\n}\n\nfunction uint64(property) {\n    return new WrappedLayout(blob(8), (b) => u64.fromBuffer(b), (n) => n.toBuffer(), property);\n}\nfunction publicKey(property) {\n    return new WrappedLayout(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nfunction coption(layout, property) {\n    return new COptionLayout(layout, property);\n}\nclass WrappedLayout extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nclass COptionLayout extends Layout_2 {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = u32();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span + this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 4) + 4;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 4);\n        }\n        throw new Error(\"Invalid coption \" + this.layout.property);\n    }\n    getSpan(b, offset = 0) {\n        return this.layout.getSpan(b, offset + 4) + 4;\n    }\n}\nclass u64 extends BN {\n    /**\n     * Convert to Buffer representation\n     */\n    toBuffer() {\n        const a = super.toArray().reverse();\n        const b = Buffer.from(a);\n        if (b.length === 8) {\n            return b;\n        }\n        if (b.length >= 8) {\n            throw new Error(\"u64 too large\");\n        }\n        const zeroPad = Buffer.alloc(8);\n        b.copy(zeroPad);\n        return zeroPad;\n    }\n    /**\n     * Construct a u64 from Buffer representation\n     */\n    static fromBuffer(buffer) {\n        if (buffer.length !== 8) {\n            throw new Error(`Invalid buffer length: ${buffer.length}`);\n        }\n        return new u64([...buffer]\n            .reverse()\n            .map((i) => `00${i.toString(16)}`.slice(-2))\n            .join(\"\"), 16);\n    }\n}\nconst TOKEN_ACCOUNT_LAYOUT = struct([\n    publicKey(\"mint\"),\n    publicKey(\"owner\"),\n    uint64(\"amount\"),\n    coption(publicKey(), \"delegate\"),\n    ((p) => {\n        const U = union(u8(\"discriminator\"), null, p);\n        U.addVariant(0, struct([]), \"uninitialized\");\n        U.addVariant(1, struct([]), \"initialized\");\n        U.addVariant(2, struct([]), \"frozen\");\n        return U;\n    })(\"state\"),\n    coption(uint64(), \"isNative\"),\n    uint64(\"delegatedAmount\"),\n    coption(publicKey(), \"closeAuthority\"),\n]);\nfunction decodeTokenAccount(b) {\n    return TOKEN_ACCOUNT_LAYOUT.decode(b);\n}\n\n// Populates a given accounts context with PDAs and common missing accounts.\nclass AccountsResolver {\n    constructor(_args, _accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n        this._accounts = _accounts;\n        this._provider = _provider;\n        this._programId = _programId;\n        this._idlIx = _idlIx;\n        this._idlTypes = _idlTypes;\n        this._customResolver = _customResolver;\n        this._args = _args;\n        this._accountStore = new AccountStore(_provider, _accountNamespace, this._programId);\n    }\n    args(_args) {\n        this._args = _args;\n    }\n    // Note: We serially resolve PDAs one by one rather than doing them\n    //       in parallel because there can be dependencies between\n    //       addresses. That is, one PDA can be used as a seed in another.\n    async resolve() {\n        await this.resolveConst(this._idlIx.accounts);\n        this._resolveEventCpi(this._idlIx.accounts);\n        // Auto populate pdas and relations until we stop finding new accounts\n        while ((await this.resolvePdas(this._idlIx.accounts)) +\n            (await this.resolveRelations(this._idlIx.accounts)) +\n            (await this.resolveCustom()) >\n            0) { }\n    }\n    async resolveCustom() {\n        if (this._customResolver) {\n            const { accounts, resolved } = await this._customResolver({\n                args: this._args,\n                accounts: this._accounts,\n                provider: this._provider,\n                programId: this._programId,\n                idlIx: this._idlIx,\n            });\n            this._accounts = accounts;\n            return resolved;\n        }\n        return 0;\n    }\n    resolveOptionalsHelper(partialAccounts, accountItems) {\n        const nestedAccountsGeneric = {};\n        // Looping through accountItem array instead of on partialAccounts, so\n        // we only traverse array once\n        for (const accountItem of accountItems) {\n            const accountName = accountItem.name;\n            const partialAccount = partialAccounts[accountName];\n            // Skip if the account isn't included (thus would be undefined)\n            if (partialAccount === undefined)\n                continue;\n            if (isPartialAccounts(partialAccount)) {\n                // is compound accounts, recurse one level deeper\n                if (isIdlAccounts(accountItem)) {\n                    nestedAccountsGeneric[accountName] = this.resolveOptionalsHelper(partialAccount, accountItem[\"accounts\"]);\n                }\n                else {\n                    // Here we try our best to recover gracefully. If there are optionals we can't check, we will fail then.\n                    nestedAccountsGeneric[accountName] = flattenPartialAccounts(partialAccount, true);\n                }\n            }\n            else {\n                // if not compound accounts, do null/optional check and proceed\n                if (partialAccount !== null) {\n                    nestedAccountsGeneric[accountName] = translateAddress(partialAccount);\n                }\n                else if (accountItem[\"isOptional\"]) {\n                    nestedAccountsGeneric[accountName] = this._programId;\n                }\n            }\n        }\n        return nestedAccountsGeneric;\n    }\n    resolveOptionals(accounts) {\n        Object.assign(this._accounts, this.resolveOptionalsHelper(accounts, this._idlIx.accounts));\n    }\n    get(path) {\n        // Only return if pubkey\n        const ret = path.reduce((acc, subPath) => acc && acc[subPath], this._accounts);\n        if (ret && ret.toBase58) {\n            return ret;\n        }\n    }\n    set(path, value) {\n        let curr = this._accounts;\n        path.forEach((p, idx) => {\n            const isLast = idx == path.length - 1;\n            if (isLast) {\n                curr[p] = value;\n            }\n            curr[p] = curr[p] || {};\n            curr = curr[p];\n        });\n    }\n    async resolveConst(accounts, path = []) {\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDescOrAccounts = accounts[k];\n            const subAccounts = accountDescOrAccounts.accounts;\n            if (subAccounts) {\n                await this.resolveConst(subAccounts, [\n                    ...path,\n                    camelCase(accountDescOrAccounts.name),\n                ]);\n            }\n            const accountDesc = accountDescOrAccounts;\n            const accountDescName = camelCase(accountDescOrAccounts.name);\n            // Signers default to the provider.\n            if (accountDesc.isSigner && !this.get([...path, accountDescName])) {\n                // @ts-expect-error\n                if (this._provider.wallet === undefined) {\n                    throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");\n                }\n                // @ts-expect-error\n                this.set([...path, accountDescName], this._provider.wallet.publicKey);\n            }\n            // Common accounts are auto populated with magic names by convention.\n            if (Reflect.has(AccountsResolver.CONST_ACCOUNTS, accountDescName) &&\n                !this.get([...path, accountDescName])) {\n                this.set([...path, accountDescName], AccountsResolver.CONST_ACCOUNTS[accountDescName]);\n            }\n        }\n    }\n    /**\n     * Resolve event CPI accounts `eventAuthority` and `program`.\n     *\n     * Accounts will only be resolved if they are declared next to each other to\n     * reduce the chance of name collision.\n     */\n    _resolveEventCpi(accounts, path = []) {\n        for (const i in accounts) {\n            const accountDescOrAccounts = accounts[i];\n            const subAccounts = accountDescOrAccounts.accounts;\n            if (subAccounts) {\n                this._resolveEventCpi(subAccounts, [\n                    ...path,\n                    camelCase(accountDescOrAccounts.name),\n                ]);\n            }\n            // Validate next index exists\n            const nextIndex = +i + 1;\n            if (nextIndex === accounts.length)\n                return;\n            const currentName = camelCase(accounts[i].name);\n            const nextName = camelCase(accounts[nextIndex].name);\n            // Populate event CPI accounts if they exist\n            if (currentName === \"eventAuthority\" && nextName === \"program\") {\n                const currentPath = [...path, currentName];\n                const nextPath = [...path, nextName];\n                if (!this.get(currentPath)) {\n                    this.set(currentPath, PublicKey.findProgramAddressSync([Buffer.from(\"__event_authority\")], this._programId)[0]);\n                }\n                if (!this.get(nextPath)) {\n                    this.set(nextPath, this._programId);\n                }\n                return;\n            }\n        }\n    }\n    async resolvePdas(accounts, path = []) {\n        let found = 0;\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDesc = accounts[k];\n            const subAccounts = accountDesc.accounts;\n            if (subAccounts) {\n                found += await this.resolvePdas(subAccounts, [\n                    ...path,\n                    camelCase(accountDesc.name),\n                ]);\n            }\n            const accountDescCasted = accountDesc;\n            const accountDescName = camelCase(accountDesc.name);\n            // PDA derived from IDL seeds.\n            if (accountDescCasted.pda &&\n                accountDescCasted.pda.seeds.length > 0 &&\n                !this.get([...path, accountDescName])) {\n                if (Boolean(await this.autoPopulatePda(accountDescCasted, path))) {\n                    found += 1;\n                }\n            }\n        }\n        return found;\n    }\n    async resolveRelations(accounts, path = []) {\n        let found = 0;\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDesc = accounts[k];\n            const subAccounts = accountDesc.accounts;\n            if (subAccounts) {\n                found += await this.resolveRelations(subAccounts, [\n                    ...path,\n                    camelCase(accountDesc.name),\n                ]);\n            }\n            const relations = accountDesc.relations || [];\n            const accountDescName = camelCase(accountDesc.name);\n            const newPath = [...path, accountDescName];\n            // If we have this account and there's some missing accounts that are relations to this account, fetch them\n            const accountKey = this.get(newPath);\n            if (accountKey) {\n                const matching = relations.filter((rel) => !this.get([...path, camelCase(rel)]));\n                found += matching.length;\n                if (matching.length > 0) {\n                    const account = await this._accountStore.fetchAccount({\n                        publicKey: accountKey,\n                    });\n                    await Promise.all(matching.map(async (rel) => {\n                        const relName = camelCase(rel);\n                        this.set([...path, relName], account[relName]);\n                        return account[relName];\n                    }));\n                }\n            }\n        }\n        return found;\n    }\n    async autoPopulatePda(accountDesc, path = []) {\n        if (!accountDesc.pda || !accountDesc.pda.seeds)\n            throw new Error(\"Must have seeds\");\n        const seeds = await Promise.all(accountDesc.pda.seeds.map((seedDesc) => this.toBuffer(seedDesc, path)));\n        if (seeds.some((seed) => typeof seed == \"undefined\")) {\n            return;\n        }\n        const programId = await this.parseProgramId(accountDesc, path);\n        if (!programId) {\n            return;\n        }\n        const [pubkey] = await PublicKey.findProgramAddress(seeds, programId);\n        this.set([...path, camelCase(accountDesc.name)], pubkey);\n    }\n    async parseProgramId(accountDesc, path = []) {\n        var _a;\n        if (!((_a = accountDesc.pda) === null || _a === void 0 ? void 0 : _a.programId)) {\n            return this._programId;\n        }\n        switch (accountDesc.pda.programId.kind) {\n            case \"const\":\n                return new PublicKey(this.toBufferConst(accountDesc.pda.programId.value));\n            case \"arg\":\n                return this.argValue(accountDesc.pda.programId);\n            case \"account\":\n                return await this.accountValue(accountDesc.pda.programId, path);\n            default:\n                throw new Error(`Unexpected program seed kind: ${accountDesc.pda.programId.kind}`);\n        }\n    }\n    async toBuffer(seedDesc, path = []) {\n        switch (seedDesc.kind) {\n            case \"const\":\n                return this.toBufferConst(seedDesc);\n            case \"arg\":\n                return await this.toBufferArg(seedDesc);\n            case \"account\":\n                return await this.toBufferAccount(seedDesc, path);\n            default:\n                throw new Error(`Unexpected seed kind: ${seedDesc.kind}`);\n        }\n    }\n    /**\n     * Recursively get the type at some path of either a primitive or a user defined struct.\n     */\n    getType(type, path = []) {\n        if (path.length > 0 && type.defined) {\n            const subType = this._idlTypes.find((t) => t.name === type.defined);\n            if (!subType) {\n                throw new Error(`Cannot find type ${type.defined}`);\n            }\n            const structType = subType.type; // enum not supported yet\n            const field = structType.fields.find((field) => field.name === path[0]);\n            return this.getType(field.type, path.slice(1));\n        }\n        return type;\n    }\n    toBufferConst(seedDesc) {\n        return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), seedDesc.value);\n    }\n    async toBufferArg(seedDesc) {\n        const argValue = this.argValue(seedDesc);\n        if (typeof argValue === \"undefined\") {\n            return;\n        }\n        return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), argValue);\n    }\n    argValue(seedDesc) {\n        const split = seedDesc.path.split(\".\");\n        const seedArgName = camelCase(split[0]);\n        const idlArgPosition = this._idlIx.args.findIndex((argDesc) => argDesc.name === seedArgName);\n        if (idlArgPosition === -1) {\n            throw new Error(`Unable to find argument for seed: ${seedArgName}`);\n        }\n        return split\n            .slice(1)\n            .reduce((curr, path) => (curr || {})[path], this._args[idlArgPosition]);\n    }\n    async toBufferAccount(seedDesc, path = []) {\n        const accountValue = await this.accountValue(seedDesc, path);\n        if (!accountValue) {\n            return;\n        }\n        return this.toBufferValue(seedDesc.type, accountValue);\n    }\n    async accountValue(seedDesc, path = []) {\n        const pathComponents = seedDesc.path.split(\".\");\n        const fieldName = pathComponents[0];\n        const fieldPubkey = this.get([...path, camelCase(fieldName)]);\n        if (fieldPubkey === null) {\n            throw new Error(`fieldPubkey is null`);\n        }\n        // The seed is a pubkey of the account.\n        if (pathComponents.length === 1) {\n            return fieldPubkey;\n        }\n        // The key is account data.\n        //\n        // Fetch and deserialize it.\n        const account = await this._accountStore.fetchAccount({\n            publicKey: fieldPubkey,\n            name: seedDesc.account,\n        });\n        // Dereference all fields in the path to get the field value\n        // used in the seed.\n        const fieldValue = this.parseAccountValue(account, pathComponents.slice(1));\n        return fieldValue;\n    }\n    parseAccountValue(account, path) {\n        let accountField;\n        while (path.length > 0) {\n            accountField = account[camelCase(path[0])];\n            path = path.slice(1);\n        }\n        return accountField;\n    }\n    // Converts the given idl valaue into a Buffer. The values here must be\n    // primitives. E.g. no structs.\n    //\n    // TODO: add more types here as needed.\n    toBufferValue(type, value) {\n        switch (type) {\n            case \"u8\":\n                return Buffer.from([value]);\n            case \"u16\":\n                let b = Buffer.alloc(2);\n                b.writeUInt16LE(value);\n                return b;\n            case \"u32\":\n                let buf = Buffer.alloc(4);\n                buf.writeUInt32LE(value);\n                return buf;\n            case \"u64\":\n                let bU64 = Buffer.alloc(8);\n                bU64.writeBigUInt64LE(BigInt(value));\n                return bU64;\n            case \"string\":\n                return Buffer.from(encode$2(value));\n            case \"publicKey\":\n                return value.toBuffer();\n            default:\n                if (type.array) {\n                    return Buffer.from(value);\n                }\n                throw new Error(`Unexpected seed type: ${type}`);\n        }\n    }\n}\nAccountsResolver.CONST_ACCOUNTS = {\n    associatedTokenProgram: ASSOCIATED_PROGRAM_ID,\n    rent: SYSVAR_RENT_PUBKEY,\n    systemProgram: SystemProgram.programId,\n    tokenProgram: TOKEN_PROGRAM_ID,\n    clock: SYSVAR_CLOCK_PUBKEY,\n};\n// TODO: this should be configureable to avoid unnecessary requests.\nclass AccountStore {\n    // todo: don't use the progrma use the account namespace.\n    constructor(_provider, _accounts, _programId) {\n        this._provider = _provider;\n        this._programId = _programId;\n        this._cache = new Map();\n        this._idls = {};\n        this._idls[_programId.toBase58()] = _accounts;\n    }\n    async ensureIdl(programId) {\n        if (!this._idls[programId.toBase58()]) {\n            const idl = await Program.fetchIdl(programId, this._provider);\n            if (idl) {\n                const program = new Program(idl, programId, this._provider);\n                this._idls[programId.toBase58()] = program.account;\n            }\n        }\n        return this._idls[programId.toBase58()];\n    }\n    async fetchAccount({ publicKey, name, programId = this._programId, }) {\n        const address = publicKey.toString();\n        if (!this._cache.has(address)) {\n            if (name === \"TokenAccount\") {\n                const accountInfo = await this._provider.connection.getAccountInfo(publicKey);\n                if (accountInfo === null) {\n                    throw new Error(`invalid account info for ${address}`);\n                }\n                const data = decodeTokenAccount(accountInfo.data);\n                this._cache.set(address, data);\n            }\n            else if (name) {\n                const accounts = await this.ensureIdl(programId);\n                if (accounts) {\n                    const accountFetcher = accounts[camelCase(name)];\n                    if (accountFetcher) {\n                        const account = await accountFetcher.fetch(publicKey);\n                        this._cache.set(address, account);\n                    }\n                }\n            }\n            else {\n                const account = await this._provider.connection.getAccountInfo(publicKey);\n                if (account === null) {\n                    throw new Error(`invalid account info for ${address}`);\n                }\n                const data = account.data;\n                const accounts = await this.ensureIdl(account.owner);\n                if (accounts) {\n                    const firstAccountLayout = Object.values(accounts)[0];\n                    if (!firstAccountLayout) {\n                        throw new Error(\"No accounts for this program\");\n                    }\n                    const result = firstAccountLayout.coder.accounts.decodeAny(data);\n                    this._cache.set(address, result);\n                }\n            }\n        }\n        return this._cache.get(address);\n    }\n}\n\nclass MethodsBuilderFactory {\n    static build(provider, programId, idlIx, ixFn, txFn, rpcFn, simulateFn, viewFn, accountNamespace, idlTypes, customResolver) {\n        return (...args) => new MethodsBuilder(args, ixFn, txFn, rpcFn, simulateFn, viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n}\nfunction isPartialAccounts(partialAccount) {\n    return (typeof partialAccount === \"object\" &&\n        partialAccount !== null &&\n        !(\"_bn\" in partialAccount) // Ensures not a pubkey\n    );\n}\nfunction flattenPartialAccounts(partialAccounts, throwOnNull) {\n    const toReturn = {};\n    for (const accountName in partialAccounts) {\n        const account = partialAccounts[accountName];\n        if (account === null) {\n            if (throwOnNull)\n                throw new Error(\"Failed to resolve optionals due to IDL type mismatch with input accounts!\");\n            continue;\n        }\n        toReturn[accountName] = isPartialAccounts(account)\n            ? flattenPartialAccounts(account, true)\n            : translateAddress(account);\n    }\n    return toReturn;\n}\nclass MethodsBuilder {\n    constructor(_args, _ixFn, _txFn, _rpcFn, _simulateFn, _viewFn, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n        this._ixFn = _ixFn;\n        this._txFn = _txFn;\n        this._rpcFn = _rpcFn;\n        this._simulateFn = _simulateFn;\n        this._viewFn = _viewFn;\n        this._programId = _programId;\n        this._accounts = {};\n        this._remainingAccounts = [];\n        this._signers = [];\n        this._preInstructions = [];\n        this._postInstructions = [];\n        this._autoResolveAccounts = true;\n        this._args = _args;\n        this._accountsResolver = new AccountsResolver(_args, this._accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver);\n    }\n    args(_args) {\n        this._args = _args;\n        this._accountsResolver.args(_args);\n    }\n    async pubkeys() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        return this._accounts;\n    }\n    accounts(accounts) {\n        this._autoResolveAccounts = true;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    accountsStrict(accounts) {\n        this._autoResolveAccounts = false;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    signers(signers) {\n        this._signers = this._signers.concat(signers);\n        return this;\n    }\n    remainingAccounts(accounts) {\n        this._remainingAccounts = this._remainingAccounts.concat(accounts);\n        return this;\n    }\n    preInstructions(ixs) {\n        this._preInstructions = this._preInstructions.concat(ixs);\n        return this;\n    }\n    postInstructions(ixs) {\n        this._postInstructions = this._postInstructions.concat(ixs);\n        return this;\n    }\n    async rpc(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._rpcFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async rpcAndKeys(options) {\n        const pubkeys = await this.pubkeys();\n        return {\n            pubkeys,\n            signature: await this.rpc(options),\n        };\n    }\n    async view(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        if (!this._viewFn) {\n            throw new Error(\"Method does not support views\");\n        }\n        // @ts-ignore\n        return this._viewFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async simulate(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._simulateFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async instruction() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._ixFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n    /**\n     * Convenient shortcut to get instructions and pubkeys via\n     * const { pubkeys, instructions } = await prepare();\n     */\n    async prepare() {\n        return {\n            instruction: await this.instruction(),\n            pubkeys: await this.pubkeys(),\n            signers: await this._signers,\n        };\n    }\n    async transaction() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._txFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n}\n\nclass ViewFactory {\n    static build(programId, idlIx, simulateFn, idl) {\n        const isMut = idlIx.accounts.find((a) => a.isMut);\n        const hasReturn = !!idlIx.returns;\n        if (isMut || !hasReturn)\n            return;\n        const view = async (...args) => {\n            var _a, _b;\n            let simulationResult = await simulateFn(...args);\n            const returnPrefix = `Program return: ${programId} `;\n            let returnLog = simulationResult.raw.find((l) => l.startsWith(returnPrefix));\n            if (!returnLog) {\n                throw new Error(\"View expected return log\");\n            }\n            let returnData = decode(returnLog.slice(returnPrefix.length));\n            let returnType = idlIx.returns;\n            if (!returnType) {\n                throw new Error(\"View expected return type\");\n            }\n            const coder = IdlCoder.fieldLayout({ type: returnType }, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n            return coder.decode(returnData);\n        };\n        return view;\n    }\n}\n\nclass NamespaceFactory {\n    /**\n     * Generates all namespaces for a given program.\n     */\n    static build(idl, coder, programId, provider, getCustomResolver) {\n        const rpc = {};\n        const instruction = {};\n        const transaction = {};\n        const simulate = {};\n        const methods = {};\n        const view = {};\n        const idlErrors = parseIdlErrors(idl);\n        const account = idl.accounts\n            ? AccountFactory.build(idl, coder, programId, provider)\n            : {};\n        idl.instructions.forEach((idlIx) => {\n            const ixItem = InstructionNamespaceFactory.build(idlIx, (ixName, ix) => coder.instruction.encode(ixName, ix), programId);\n            const txItem = TransactionFactory.build(idlIx, ixItem);\n            const rpcItem = RpcFactory.build(idlIx, txItem, idlErrors, provider);\n            const simulateItem = SimulateFactory.build(idlIx, txItem, idlErrors, provider, coder, programId, idl);\n            const viewItem = ViewFactory.build(programId, idlIx, simulateItem, idl);\n            const methodItem = MethodsBuilderFactory.build(provider, programId, idlIx, ixItem, txItem, rpcItem, simulateItem, viewItem, account, idl.types || [], getCustomResolver && getCustomResolver(idlIx));\n            const name = camelCase(idlIx.name);\n            instruction[name] = ixItem;\n            transaction[name] = txItem;\n            rpc[name] = rpcItem;\n            simulate[name] = simulateItem;\n            methods[name] = methodItem;\n            if (viewItem) {\n                view[name] = viewItem;\n            }\n        });\n        return [\n            rpc,\n            instruction,\n            transaction,\n            account,\n            simulate,\n            methods,\n            view,\n        ];\n    }\n}\n\n/**\n * ## Program\n *\n * Program provides the IDL deserialized client representation of an Anchor\n * program.\n *\n * This API is the one stop shop for all things related to communicating with\n * on-chain programs. Among other things, one can send transactions, fetch\n * deserialized accounts, decode instruction data, subscribe to account\n * changes, and listen to events.\n *\n * In addition to field accessors and methods, the object provides a set of\n * dynamically generated properties, also known as namespaces, that\n * map one-to-one to program methods and accounts. These namespaces generally\n *  can be used as follows:\n *\n * ## Usage\n *\n * ```javascript\n * program.<namespace>.<program-specific-method>\n * ```\n *\n * API specifics are namespace dependent. The examples used in the documentation\n * below will refer to the two counter examples found\n * [here](https://github.com/coral-xyz/anchor#examples).\n */\nclass Program {\n    /**\n     * Address of the program.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * IDL defining the program's interface.\n     */\n    get idl() {\n        return this._idl;\n    }\n    /**\n     * Coder for serializing requests.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * @param idl       The interface definition.\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context to use. If not provided\n     *                  then uses [[getProvider]].\n     * @param getCustomResolver A function that returns a custom account resolver\n     *                          for the given instruction. This is useful for resolving\n     *                          public keys of missing accounts when building instructions\n     */\n    constructor(idl, programId, provider, coder, getCustomResolver) {\n        programId = translateAddress(programId);\n        if (!provider) {\n            provider = getProvider();\n        }\n        // Fields.\n        this._idl = idl;\n        this._provider = provider;\n        this._programId = programId;\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._events = new EventManager(this._programId, provider, this._coder);\n        // Dynamic namespaces.\n        const [rpc, instruction, transaction, account, simulate, methods, views] = NamespaceFactory.build(idl, this._coder, programId, provider, getCustomResolver !== null && getCustomResolver !== void 0 ? getCustomResolver : (() => undefined));\n        this.rpc = rpc;\n        this.instruction = instruction;\n        this.transaction = transaction;\n        this.account = account;\n        this.simulate = simulate;\n        this.methods = methods;\n        this.views = views;\n    }\n    /**\n     * Generates a Program client by fetching the IDL from the network.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async at(address, provider) {\n        const programId = translateAddress(address);\n        const idl = await Program.fetchIdl(programId, provider);\n        if (!idl) {\n            throw new Error(`IDL not found for program: ${address.toString()}`);\n        }\n        return new Program(idl, programId, provider);\n    }\n    /**\n     * Fetches an idl from the blockchain.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async fetchIdl(address, provider) {\n        provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        const programId = translateAddress(address);\n        const idlAddr = await idlAddress(programId);\n        const accountInfo = await provider.connection.getAccountInfo(idlAddr);\n        if (!accountInfo) {\n            return null;\n        }\n        // Chop off account discriminator.\n        let idlAccount = decodeIdlAccount(accountInfo.data.slice(8));\n        const inflatedIdl = inflate(idlAccount.data);\n        return JSON.parse(decode$2(inflatedIdl));\n    }\n    /**\n     * Invokes the given callback every time the given event is emitted.\n     *\n     * @param eventName The PascalCase name of the event, provided by the IDL.\n     * @param callback  The function to invoke whenever the event is emitted from\n     *                  program logs.\n     */\n    addEventListener(eventName, callback) {\n        return this._events.addEventListener(eventName, callback);\n    }\n    /**\n     * Unsubscribes from the given eventName.\n     */\n    async removeEventListener(listener) {\n        return await this._events.removeEventListener(listener);\n    }\n}\n\nconst SYSTEM_PROGRAM_ID = new PublicKey(\"11111111111111111111111111111111\");\nfunction program(provider) {\n    return new Program(IDL, SYSTEM_PROGRAM_ID, provider, coder());\n}\nfunction coder() {\n    return new SystemCoder(IDL);\n}\nconst IDL = {\n    version: \"0.1.0\",\n    name: \"system_program\",\n    instructions: [\n        {\n            name: \"createAccount\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"assign\",\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"transfer\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"createAccountWithSeed\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"advanceNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"withdrawNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"rent\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"initializeNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"rent\",\n                    isMut: false,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"authorizeNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"allocate\",\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"allocateWithSeed\",\n            accounts: [\n                {\n                    name: \"account\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"assignWithSeed\",\n            accounts: [\n                {\n                    name: \"account\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"transferWithSeed\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n    ],\n    accounts: [\n        {\n            name: \"nonce\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"version\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"state\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"authorizedPubkey\",\n                        type: \"publicKey\",\n                    },\n                    {\n                        name: \"nonce\",\n                        type: \"publicKey\",\n                    },\n                    {\n                        name: \"feeCalculator\",\n                        type: {\n                            defined: \"FeeCalculator\",\n                        },\n                    },\n                ],\n            },\n        },\n    ],\n    types: [\n        {\n            name: \"FeeCalculator\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"lamportsPerSignature\",\n                        type: \"u64\",\n                    },\n                ],\n            },\n        },\n    ],\n};\n\nclass Native {\n    static system(provider) {\n        return program(provider);\n    }\n}\n\nexport { AccountClient, AnchorError, AnchorProvider, BorshAccountsCoder, BorshCoder, BorshEventCoder, BorshInstructionCoder, DISCRIMINATOR_SIZE, EventManager, EventParser, IdlError, LangErrorCode, LangErrorMessage, MethodsBuilderFactory, Native, Program, ProgramError, ProgramErrorStack, SystemCoder, eventDiscriminator, getProvider, parseIdlErrors, setProvider, splitArgsAndCtx, toInstruction, translateAddress, translateError, index as utils, validateAccounts };\n//# sourceMappingURL=index.js.map\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = (0, buffer_layout_1.blob)(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n    return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n    return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = (0, buffer_layout_1.u8)();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = (0, buffer_layout_1.struct)([\n        u64(\"tag\"),\n        layout.replicate(\"data\"),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error(\"Invalid tag, expected: \" +\n                tag.toString(\"hex\") +\n                \", got: \" +\n                receivedTag.toString(\"hex\"));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = (0, buffer_layout_1.struct)([\n        (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict';\n\nconst UPPERCASE = /[\\p{Lu}]/u;\nconst LOWERCASE = /[\\p{Ll}]/u;\nconst LEADING_CAPITAL = /^[\\p{Lu}](?![\\p{Lu}])/gu;\nconst IDENTIFIER = /([\\p{Alpha}\\p{N}_]|$)/u;\nconst SEPARATORS = /[_.\\- ]+/;\n\nconst LEADING_SEPARATORS = new RegExp('^' + SEPARATORS.source);\nconst SEPARATORS_AND_IDENTIFIER = new RegExp(SEPARATORS.source + IDENTIFIER.source, 'gu');\nconst NUMBERS_AND_IDENTIFIER = new RegExp('\\\\d+' + IDENTIFIER.source, 'gu');\n\nconst preserveCamelCase = (string, toLowerCase, toUpperCase) => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && UPPERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && LOWERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = toLowerCase(character) === character && toUpperCase(character) !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = toUpperCase(character) === character && toLowerCase(character) !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst preserveConsecutiveUppercase = (input, toLowerCase) => {\n\tLEADING_CAPITAL.lastIndex = 0;\n\n\treturn input.replace(LEADING_CAPITAL, m1 => toLowerCase(m1));\n};\n\nconst postProcess = (input, toUpperCase) => {\n\tSEPARATORS_AND_IDENTIFIER.lastIndex = 0;\n\tNUMBERS_AND_IDENTIFIER.lastIndex = 0;\n\n\treturn input.replace(SEPARATORS_AND_IDENTIFIER, (_, identifier) => toUpperCase(identifier))\n\t\t.replace(NUMBERS_AND_IDENTIFIER, m => toUpperCase(m));\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = {\n\t\tpascalCase: false,\n\t\tpreserveConsecutiveUppercase: false,\n\t\t...options\n\t};\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tconst toLowerCase = options.locale === false ?\n\t\tstring => string.toLowerCase() :\n\t\tstring => string.toLocaleLowerCase(options.locale);\n\tconst toUpperCase = options.locale === false ?\n\t\tstring => string.toUpperCase() :\n\t\tstring => string.toLocaleUpperCase(options.locale);\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? toUpperCase(input) : toLowerCase(input);\n\t}\n\n\tconst hasUpperCase = input !== toLowerCase(input);\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input, toLowerCase, toUpperCase);\n\t}\n\n\tinput = input.replace(LEADING_SEPARATORS, '');\n\n\tif (options.preserveConsecutiveUppercase) {\n\t\tinput = preserveConsecutiveUppercase(input, toLowerCase);\n\t} else {\n\t\tinput = toLowerCase(input);\n\t}\n\n\tif (options.pascalCase) {\n\t\tinput = toUpperCase(input.charAt(0)) + input.slice(1);\n\t}\n\n\treturn postProcess(input, toUpperCase);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports.default = camelCase;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getATAAddressesSync = exports.getATAAddresses = exports.getATAAddressSync = exports.getATAAddress = void 0;\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\n/**\n * Gets an associated token account address.\n *\n * @deprecated use {@link getATAAddressSync}\n */\nconst getATAAddress = async ({ mint, owner, }) => {\n    return Promise.resolve((0, exports.getATAAddressSync)({ mint, owner }));\n};\nexports.getATAAddress = getATAAddress;\n/**\n * Gets an associated token account address synchronously.\n */\nconst getATAAddressSync = ({ mint, owner, }) => {\n    return (0, solana_contrib_1.getProgramAddress)([owner.toBuffer(), spl_token_1.TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID);\n};\nexports.getATAAddressSync = getATAAddressSync;\n/**\n * Gets multiple associated token account addresses.\n *\n * @deprecated use {@link getATAAddressesSync}\n */\nconst getATAAddresses = ({ mints, owner, }) => {\n    return Promise.resolve((0, exports.getATAAddressesSync)({ mints, owner }));\n};\nexports.getATAAddresses = getATAAddresses;\n/**\n * Gets multiple associated token account addresses.\n */\nconst getATAAddressesSync = ({ mints, owner, }) => {\n    const result = Object.entries(mints).map((args) => {\n        const [name, mint] = args;\n        const result = (0, exports.getATAAddressSync)({\n            mint,\n            owner: owner,\n        });\n        return {\n            address: result,\n            name,\n            mint,\n        };\n    });\n    const deduped = result.reduce((acc, { address, name, mint }) => {\n        return {\n            accounts: {\n                ...acc.accounts,\n                [name]: { address, mint },\n            },\n        };\n    }, { accounts: {} });\n    return {\n        accounts: deduped.accounts,\n    };\n};\nexports.getATAAddressesSync = getATAAddressesSync;\n//# sourceMappingURL=ata.js.map","\"use strict\";\n/**\n * This file is a port of serum-common, which was built for web3.js 0.x.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sleep = exports.getTokenAccount = exports.getMintInfo = exports.createAccountRentExempt = exports.createTokenAccountInstrs = exports.createMintAndVault = exports.createMintInstructions = exports.createToken = exports.createMint = exports.SPL_SHARED_MEMORY_ID = exports.DEFAULT_TOKEN_DECIMALS = exports.token = void 0;\nconst tslib_1 = require(\"tslib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst index_js_1 = require(\"./index.js\");\nexports.token = tslib_1.__importStar(require(\"./token.js\"));\n/**\n * Default number of decimals of a token.\n */\nexports.DEFAULT_TOKEN_DECIMALS = 6;\nexports.SPL_SHARED_MEMORY_ID = new web3_js_1.PublicKey(\"shmem4EWT2sPdVGvTZCzXXRAURL9G5vpPxNwSeKhHUL\");\nasync function createMint(provider, authority, decimals) {\n    if (authority === undefined) {\n        authority = provider.wallet.publicKey;\n    }\n    const mint = web3_js_1.Keypair.generate();\n    const instructions = await createMintInstructions(provider, authority, mint.publicKey, decimals);\n    const tx = new web3_js_1.Transaction();\n    tx.add(...instructions);\n    await provider.send(tx, [mint]);\n    return mint.publicKey;\n}\nexports.createMint = createMint;\n/**\n * Creates a Token.\n *\n * @param provider\n * @param authority The mint authority.\n * @param decimals Number of decimals.\n * @returns\n */\nasync function createToken(provider, authority, decimals = 6) {\n    return index_js_1.Token.fromMint(await createMint(provider, authority, decimals), decimals);\n}\nexports.createToken = createToken;\nasync function createMintInstructions(provider, authority, mint, decimals = 6) {\n    const instructions = [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: provider.wallet.publicKey,\n            newAccountPubkey: mint,\n            space: index_js_1.MintLayout.span,\n            lamports: await provider.connection.getMinimumBalanceForRentExemption(index_js_1.MintLayout.span),\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitMintInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, decimals, authority, null),\n    ];\n    return instructions;\n}\nexports.createMintInstructions = createMintInstructions;\nasync function createMintAndVault(provider, amount, owner, decimals) {\n    if (owner === undefined) {\n        owner = provider.wallet.publicKey;\n    }\n    const mint = web3_js_1.Keypair.generate();\n    const vault = web3_js_1.Keypair.generate();\n    const tx = new web3_js_1.Transaction();\n    tx.add(...(await createMintInstructions(provider, provider.wallet.publicKey, mint.publicKey, decimals)), web3_js_1.SystemProgram.createAccount({\n        fromPubkey: provider.wallet.publicKey,\n        newAccountPubkey: vault.publicKey,\n        space: 165,\n        lamports: await provider.connection.getMinimumBalanceForRentExemption(165),\n        programId: spl_token_1.TOKEN_PROGRAM_ID,\n    }), spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint.publicKey, vault.publicKey, owner), spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint.publicKey, vault.publicKey, provider.wallet.publicKey, [], amount));\n    await provider.send(tx, [mint, vault]);\n    return [mint.publicKey, vault.publicKey];\n}\nexports.createMintAndVault = createMintAndVault;\nasync function createTokenAccountInstrs(provider, newAccountPubkey, mint, owner, lamports) {\n    if (lamports === undefined) {\n        lamports = await provider.connection.getMinimumBalanceForRentExemption(165);\n    }\n    return [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: provider.wallet.publicKey,\n            newAccountPubkey,\n            space: 165,\n            lamports,\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, newAccountPubkey, owner),\n    ];\n}\nexports.createTokenAccountInstrs = createTokenAccountInstrs;\nasync function createAccountRentExempt(provider, programId, size) {\n    const acc = web3_js_1.Keypair.generate();\n    const tx = new web3_js_1.Transaction();\n    tx.add(web3_js_1.SystemProgram.createAccount({\n        fromPubkey: provider.wallet.publicKey,\n        newAccountPubkey: acc.publicKey,\n        space: size,\n        lamports: await provider.connection.getMinimumBalanceForRentExemption(size),\n        programId,\n    }));\n    await provider.send(tx, [acc]);\n    return acc;\n}\nexports.createAccountRentExempt = createAccountRentExempt;\nasync function getMintInfo(provider, addr) {\n    const depositorAccInfo = await provider.getAccountInfo(addr);\n    if (depositorAccInfo === null) {\n        throw new Error(\"Failed to find token mint account\");\n    }\n    return (0, index_js_1.deserializeMint)(depositorAccInfo.accountInfo.data);\n}\nexports.getMintInfo = getMintInfo;\nasync function getTokenAccount(provider, addr) {\n    const depositorAccInfo = await provider.getAccountInfo(addr);\n    if (depositorAccInfo === null) {\n        throw new Error(\"Failed to find token account\");\n    }\n    return (0, index_js_1.deserializeAccount)(depositorAccInfo.accountInfo.data);\n}\nexports.getTokenAccount = getTokenAccount;\nfunction sleep(ms) {\n    return new Promise((resolve) => setTimeout(resolve, ms));\n}\nexports.sleep = sleep;\n//# sourceMappingURL=common.js.map","\"use strict\";\n/**\n * [[include:token-utils/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.u64 = exports.TOKEN_PROGRAM_ID = exports.SPLToken = exports.NATIVE_MINT = exports.ASSOCIATED_TOKEN_PROGRAM_ID = exports.ZERO = exports.validateU256 = exports.validateU64 = exports.TEN = exports.Rounding = exports.Percent = exports.parseBigintIsh = exports.ONE = exports.MAX_U256 = exports.MAX_U64 = exports.makeDecimalMultiplier = exports.Fraction = void 0;\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./ata.js\"), exports);\ntslib_1.__exportStar(require(\"./instructions/index.js\"), exports);\ntslib_1.__exportStar(require(\"./layout.js\"), exports);\ntslib_1.__exportStar(require(\"./price.js\"), exports);\ntslib_1.__exportStar(require(\"./splTokenRegistry.js\"), exports);\ntslib_1.__exportStar(require(\"./token.js\"), exports);\ntslib_1.__exportStar(require(\"./tokenAmount.js\"), exports);\ntslib_1.__exportStar(require(\"./tokenList.js\"), exports);\ntslib_1.__exportStar(require(\"./tokenOwner.js\"), exports);\ntslib_1.__exportStar(require(\"./tokenProvider.js\"), exports);\nvar token_math_1 = require(\"@ubeswap/token-math\");\nObject.defineProperty(exports, \"Fraction\", { enumerable: true, get: function () { return token_math_1.Fraction; } });\nObject.defineProperty(exports, \"makeDecimalMultiplier\", { enumerable: true, get: function () { return token_math_1.makeDecimalMultiplier; } });\nObject.defineProperty(exports, \"MAX_U64\", { enumerable: true, get: function () { return token_math_1.MAX_U64; } });\nObject.defineProperty(exports, \"MAX_U256\", { enumerable: true, get: function () { return token_math_1.MAX_U256; } });\nObject.defineProperty(exports, \"ONE\", { enumerable: true, get: function () { return token_math_1.ONE; } });\nObject.defineProperty(exports, \"parseBigintIsh\", { enumerable: true, get: function () { return token_math_1.parseBigintIsh; } });\nObject.defineProperty(exports, \"Percent\", { enumerable: true, get: function () { return token_math_1.Percent; } });\nObject.defineProperty(exports, \"Rounding\", { enumerable: true, get: function () { return token_math_1.Rounding; } });\nObject.defineProperty(exports, \"TEN\", { enumerable: true, get: function () { return token_math_1.TEN; } });\nObject.defineProperty(exports, \"validateU64\", { enumerable: true, get: function () { return token_math_1.validateU64; } });\nObject.defineProperty(exports, \"validateU256\", { enumerable: true, get: function () { return token_math_1.validateU256; } });\nObject.defineProperty(exports, \"ZERO\", { enumerable: true, get: function () { return token_math_1.ZERO; } });\n// serum common\ntslib_1.__exportStar(require(\"./common.js\"), exports);\nvar spl_token_1 = require(\"@solana/spl-token\");\nObject.defineProperty(exports, \"ASSOCIATED_TOKEN_PROGRAM_ID\", { enumerable: true, get: function () { return spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID; } });\nObject.defineProperty(exports, \"NATIVE_MINT\", { enumerable: true, get: function () { return spl_token_1.NATIVE_MINT; } });\nObject.defineProperty(exports, \"SPLToken\", { enumerable: true, get: function () { return spl_token_1.Token; } });\nObject.defineProperty(exports, \"TOKEN_PROGRAM_ID\", { enumerable: true, get: function () { return spl_token_1.TOKEN_PROGRAM_ID; } });\nObject.defineProperty(exports, \"u64\", { enumerable: true, get: function () { return spl_token_1.u64; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.buildCreateTokenAccountTX = exports.createTokenAccount = void 0;\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst layout_js_1 = require(\"../layout.js\");\nconst createTokenAccount = async ({ provider, mint, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, accountSigner = web3_js_1.Keypair.generate(), }) => {\n    // Allocate memory for the account\n    const rentExemptAccountBalance = await spl_token_1.Token.getMinBalanceRentForExemptAccount(provider.connection);\n    return (0, exports.buildCreateTokenAccountTX)({\n        provider,\n        mint,\n        rentExemptAccountBalance,\n        owner,\n        payer,\n        accountSigner,\n    });\n};\nexports.createTokenAccount = createTokenAccount;\nconst buildCreateTokenAccountTX = ({ provider, mint, rentExemptAccountBalance, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, accountSigner = web3_js_1.Keypair.generate(), }) => {\n    const tokenAccount = accountSigner.publicKey;\n    return {\n        key: tokenAccount,\n        tx: new solana_contrib_1.TransactionEnvelope(provider, [\n            web3_js_1.SystemProgram.createAccount({\n                fromPubkey: payer,\n                newAccountPubkey: accountSigner.publicKey,\n                lamports: rentExemptAccountBalance,\n                space: layout_js_1.TokenAccountLayout.span,\n                programId: spl_token_1.TOKEN_PROGRAM_ID,\n            }),\n            spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, tokenAccount, owner),\n        ], [accountSigner]),\n    };\n};\nexports.buildCreateTokenAccountTX = buildCreateTokenAccountTX;\n//# sourceMappingURL=account.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createATAInstruction = exports.getOrCreateATAs = exports.getOrCreateATA = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst ata_js_1 = require(\"../ata.js\");\n/**\n * Gets an associated token account, returning a create instruction if it doesn't exist.\n * @param param0\n * @returns\n */\nconst getOrCreateATA = async ({ provider, mint, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, }) => {\n    const address = (0, ata_js_1.getATAAddressSync)({ mint, owner });\n    if (await provider.getAccountInfo(address)) {\n        return { address, instruction: null };\n    }\n    else {\n        return {\n            address,\n            instruction: (0, exports.createATAInstruction)({\n                mint,\n                address,\n                owner,\n                payer,\n            }),\n        };\n    }\n};\nexports.getOrCreateATA = getOrCreateATA;\n/**\n * Gets ATAs and creates them if they don't exist.\n * @param param0\n * @returns\n */\nconst getOrCreateATAs = async ({ provider, mints, owner = provider.wallet.publicKey, }) => {\n    const result = await Promise.all(Object.entries(mints).map(async ([name, mint]) => {\n        const mintKey = new web3_js_1.PublicKey(mint);\n        const result = await (0, exports.getOrCreateATA)({\n            provider,\n            mint: mintKey,\n            owner: owner,\n            payer: provider.wallet.publicKey,\n        });\n        return {\n            address: result.address,\n            instruction: result.instruction,\n            name,\n            mintKey,\n        };\n    }));\n    const deduped = result.reduce((acc, { address, name, instruction }) => {\n        return {\n            accounts: {\n                ...acc.accounts,\n                [name]: address,\n            },\n            createAccountInstructions: {\n                ...acc.createAccountInstructions,\n                [name]: instruction,\n            },\n            instructions: instruction\n                ? {\n                    ...acc.instructions,\n                    [address.toString()]: instruction,\n                }\n                : acc.instructions,\n        };\n    }, { accounts: {}, instructions: {}, createAccountInstructions: {} });\n    return {\n        accounts: deduped.accounts,\n        createAccountInstructions: deduped.createAccountInstructions,\n        instructions: Object.values(deduped.instructions),\n    };\n};\nexports.getOrCreateATAs = getOrCreateATAs;\n/**\n * Instruction for creating an ATA.\n * @returns\n */\nconst createATAInstruction = ({ address, mint, owner, payer, }) => spl_token_1.Token.createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, mint, address, owner, payer);\nexports.createATAInstruction = createATAInstruction;\n//# sourceMappingURL=ata.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./account.js\"), exports);\ntslib_1.__exportStar(require(\"./ata.js\"), exports);\ntslib_1.__exportStar(require(\"./mint.js\"), exports);\ntslib_1.__exportStar(require(\"./nft.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createMintToInstruction = exports.createInitMintTX = exports.createInitMintInstructions = void 0;\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst layout_js_1 = require(\"../layout.js\");\n/**\n * Creates instructions for initializing a mint.\n * @param param0\n * @returns\n */\nconst createInitMintInstructions = async ({ provider, mintKP, decimals, mintAuthority = provider.wallet.publicKey, freezeAuthority = null, }) => {\n    return (0, exports.createInitMintTX)({\n        provider,\n        mintKP,\n        decimals,\n        rentExemptMintBalance: await spl_token_1.Token.getMinBalanceRentForExemptMint(provider.connection),\n        mintAuthority,\n        freezeAuthority,\n    });\n};\nexports.createInitMintInstructions = createInitMintInstructions;\n/**\n * Creates instructions for initializing a mint.\n * @param param0\n * @returns\n */\nconst createInitMintTX = ({ provider, mintKP, decimals, rentExemptMintBalance, mintAuthority = provider.wallet.publicKey, freezeAuthority = null, }) => {\n    const from = provider.wallet.publicKey;\n    return new solana_contrib_1.TransactionEnvelope(provider, [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: from,\n            newAccountPubkey: mintKP.publicKey,\n            space: layout_js_1.MintLayout.span,\n            lamports: rentExemptMintBalance,\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitMintInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, decimals, mintAuthority, freezeAuthority),\n    ], [mintKP]);\n};\nexports.createInitMintTX = createInitMintTX;\nconst createMintToInstruction = ({ provider, mint, mintAuthorityKP, to, amount, }) => {\n    return new solana_contrib_1.TransactionEnvelope(provider, [\n        spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, to, mintAuthorityKP.publicKey, [], amount),\n    ], [mintAuthorityKP]);\n};\nexports.createMintToInstruction = createMintToInstruction;\n//# sourceMappingURL=mint.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mintNFT = void 0;\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst ata_js_1 = require(\"./ata.js\");\nconst mint_js_1 = require(\"./mint.js\");\nconst mintNFT = async (provider, mintKP, owner = provider.wallet.publicKey) => {\n    // Temporary mint authority\n    const tempMintAuthority = provider.wallet.publicKey;\n    // Mint for the NFT\n    const tx = await (0, mint_js_1.createInitMintInstructions)({\n        provider,\n        mintKP,\n        decimals: 0,\n        mintAuthority: tempMintAuthority,\n    });\n    // Token account for the NFT\n    const { address, instruction } = await (0, ata_js_1.getOrCreateATA)({\n        provider,\n        mint: mintKP.publicKey,\n        owner: owner,\n        payer: provider.wallet.publicKey,\n    });\n    if (instruction) {\n        tx.instructions.push(instruction);\n    }\n    // Mint to owner's ATA\n    tx.instructions.push(spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, address, tempMintAuthority, [], new spl_token_1.u64(1)));\n    // Set mint authority of the NFT to NULL\n    tx.instructions.push(spl_token_1.Token.createSetAuthorityInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, null, \"MintTokens\", tempMintAuthority, []));\n    return tx;\n};\nexports.mintNFT = mintNFT;\n//# sourceMappingURL=nft.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.deserializeMint = exports.deserializeAccount = exports.MintLayout = exports.TokenAccountLayout = exports.Uint64Layout = exports.PublicKeyLayout = exports.structLayout = exports.TypedStructure = exports.TypedLayout = void 0;\nconst tslib_1 = require(\"tslib\");\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst BufferLayout = tslib_1.__importStar(require(\"@solana/buffer-layout\"));\nconst spl_token_1 = require(\"@solana/spl-token\");\nvar buffer_layout_1 = require(\"@solana/buffer-layout\");\nObject.defineProperty(exports, \"TypedLayout\", { enumerable: true, get: function () { return buffer_layout_1.Layout; } });\nObject.defineProperty(exports, \"TypedStructure\", { enumerable: true, get: function () { return buffer_layout_1.Structure; } });\n/**\n * Typed struct buffer layout\n * @param fields\n * @param property\n * @param decodePrefixes\n * @returns\n */\nconst structLayout = (fields, property, decodePrefixes) => BufferLayout.struct(fields, property, decodePrefixes);\nexports.structLayout = structLayout;\n/**\n * Layout for a public key\n */\nconst PublicKeyLayout = (property = \"publicKey\") => {\n    return BufferLayout.blob(32, property);\n};\nexports.PublicKeyLayout = PublicKeyLayout;\n/**\n * Layout for a 64bit unsigned value\n */\nconst Uint64Layout = (property = \"uint64\") => {\n    return BufferLayout.blob(8, property);\n};\nexports.Uint64Layout = Uint64Layout;\n/**\n * Layout for a TokenAccount.\n */\nexports.TokenAccountLayout = spl_token_1.AccountLayout;\n/**\n * Layout for a Mint.\n */\nexports.MintLayout = spl_token_1.MintLayout;\n/**\n * Deserializes a token account.\n * @param address\n * @param data\n * @returns\n */\nconst deserializeAccount = (data) => {\n    const accountInfo = exports.TokenAccountLayout.decode(data);\n    const mint = new solana_contrib_1.PublicKey(accountInfo.mint);\n    const owner = new solana_contrib_1.PublicKey(accountInfo.owner);\n    const amount = spl_token_1.u64.fromBuffer(accountInfo.amount);\n    let delegate;\n    let delegatedAmount;\n    if (accountInfo.delegateOption === 0) {\n        delegate = null;\n        delegatedAmount = new spl_token_1.u64(0);\n    }\n    else {\n        delegate = new solana_contrib_1.PublicKey(accountInfo.delegate);\n        delegatedAmount = spl_token_1.u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n    const isInitialized = accountInfo.state !== 0;\n    const isFrozen = accountInfo.state === 2;\n    let rentExemptReserve;\n    let isNative;\n    if (accountInfo.isNativeOption === 1) {\n        rentExemptReserve = spl_token_1.u64.fromBuffer(accountInfo.isNative);\n        isNative = true;\n    }\n    else {\n        rentExemptReserve = null;\n        isNative = false;\n    }\n    let closeAuthority;\n    if (accountInfo.closeAuthorityOption === 0) {\n        closeAuthority = null;\n    }\n    else {\n        closeAuthority = new solana_contrib_1.PublicKey(accountInfo.closeAuthority);\n    }\n    return {\n        mint,\n        owner,\n        amount,\n        delegate,\n        delegatedAmount,\n        isInitialized,\n        isFrozen,\n        rentExemptReserve,\n        isNative,\n        closeAuthority,\n    };\n};\nexports.deserializeAccount = deserializeAccount;\n/**\n * Deserialize a {@link Buffer} into a {@link MintInfo}.\n * @param data\n * @returns\n */\nconst deserializeMint = (data) => {\n    if (data.length !== exports.MintLayout.span) {\n        throw new Error(\"Not a valid Mint\");\n    }\n    const mintInfo = exports.MintLayout.decode(data);\n    let mintAuthority;\n    if (mintInfo.mintAuthorityOption === 0) {\n        mintAuthority = null;\n    }\n    else {\n        mintAuthority = new solana_contrib_1.PublicKey(mintInfo.mintAuthority);\n    }\n    const supply = spl_token_1.u64.fromBuffer(mintInfo.supply);\n    const isInitialized = mintInfo.isInitialized !== 0;\n    let freezeAuthority;\n    if (mintInfo.freezeAuthorityOption === 0) {\n        freezeAuthority = null;\n    }\n    else {\n        freezeAuthority = new solana_contrib_1.PublicKey(mintInfo.freezeAuthority);\n    }\n    return {\n        mintAuthority,\n        supply,\n        decimals: mintInfo.decimals,\n        isInitialized,\n        freezeAuthority,\n    };\n};\nexports.deserializeMint = deserializeMint;\n//# sourceMappingURL=layout.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Price = void 0;\nconst token_math_1 = require(\"@ubeswap/token-math\");\n/**\n * A price of one token relative to another.\n */\nclass Price extends token_math_1.Price {\n    /**\n     * Constructs a price.\n     * @param baseCurrency\n     * @param quoteCurrency\n     * @param denominator\n     * @param numerator\n     */\n    constructor(baseCurrency, quoteCurrency, denominator, numerator) {\n        super(baseCurrency, quoteCurrency, denominator, numerator);\n    }\n    new(baseCurrency, quoteCurrency, denominator, numerator) {\n        return new Price(baseCurrency, quoteCurrency, denominator, numerator);\n    }\n    static fromUPrice(price) {\n        return new Price(price.baseCurrency, price.quoteCurrency, price.denominator, price.numerator);\n    }\n}\nexports.Price = Price;\n//# sourceMappingURL=price.js.map","\"use strict\";\n/**\n * These types all come from the @solana/spl-token-registry package.\n *\n * We re-export them here so we do not have to have a hard dependency on\n * that package, which is massive.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ENV = void 0;\n/**\n * Chain ID.\n */\nvar ENV;\n(function (ENV) {\n    ENV[ENV[\"MainnetBeta\"] = 101] = \"MainnetBeta\";\n    ENV[ENV[\"Testnet\"] = 102] = \"Testnet\";\n    ENV[ENV[\"Devnet\"] = 103] = \"Devnet\";\n})(ENV || (exports.ENV = ENV = {}));\n//# sourceMappingURL=splTokenRegistry.js.map","\"use strict\";\nvar _a;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WRAPPED_SOL = exports.RAW_SOL = exports.chainIdToNetwork = exports.networkToChainId = exports.CHAIN_ID_TO_NETWORK = exports.NETWORK_TO_CHAIN_ID = exports.ChainId = exports.makeTokenForAllNetworks = exports.tokensEqual = exports.Token = exports.RAW_SOL_MINT = void 0;\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst layout_js_1 = require(\"./layout.js\");\n/**\n * Magic value representing the raw, underlying Solana native asset.\n */\nexports.RAW_SOL_MINT = new solana_contrib_1.PublicKey(\"RawSo11111111111111111111111111111111111112\");\n/**\n * Token information.\n */\nclass Token {\n    constructor(info) {\n        var _b;\n        this.info = info;\n        this._mintAccount = null;\n        this.network = (_b = (0, exports.chainIdToNetwork)(info.chainId)) !== null && _b !== void 0 ? _b : \"localnet\";\n    }\n    /**\n     * The mint PublicKey of the token.\n     *\n     * Avoid using this value to print it to a string, as base58\n     * strings are relatively slow to create since they require the use\n     * of hash functions.\n     */\n    get mintAccount() {\n        if (this._mintAccount) {\n            return this._mintAccount;\n        }\n        this._mintAccount = new solana_contrib_1.PublicKey(this.info.address);\n        return this._mintAccount;\n    }\n    /**\n     * If true, this token represents unwrapped, native, \"raw\" SOL.\n     */\n    get isRawSOL() {\n        return this.mintAccount.equals(exports.RAW_SOL_MINT);\n    }\n    /**\n     * The Base58 string representation of the mint address.\n     */\n    get address() {\n        return this.info.address;\n    }\n    /**\n     * The chain ID of the token.\n     */\n    get chainId() {\n        return this.info.chainId;\n    }\n    /**\n     * Number of decimals of the token.\n     */\n    get decimals() {\n        return this.info.decimals;\n    }\n    /**\n     * The name of the token.\n     */\n    get name() {\n        return this.info.name;\n    }\n    /**\n     * The symbol of the token.\n     */\n    get symbol() {\n        return this.info.symbol;\n    }\n    /**\n     * The token's icon to render.\n     */\n    get icon() {\n        return this.info.logoURI;\n    }\n    equals(other) {\n        return (0, exports.tokensEqual)(this, other);\n    }\n    toString() {\n        return `Token[mint=${this.address}, decimals=${this.decimals}, network=${this.network}]`;\n    }\n    toJSON() {\n        return this.info;\n    }\n    /**\n     * Returns true if the given tag is present.\n     * @param tag The tag to check.\n     * @returns\n     */\n    hasTag(tag) {\n        var _b;\n        return !!((_b = this.info.tags) === null || _b === void 0 ? void 0 : _b.includes(tag));\n    }\n}\nexports.Token = Token;\n_a = Token;\n/**\n * Loads a token from a Mint.\n * @param mint\n * @param opts\n * @returns\n */\nToken.fromMint = (mint, decimals, opts = {}) => {\n    var _b, _c, _d;\n    return new _a({\n        ...opts,\n        // required\n        address: mint.toString(),\n        decimals,\n        // optional\n        name: (_b = opts.name) !== null && _b !== void 0 ? _b : `Token ${mint.toString().slice(0, 4)}`,\n        symbol: (_c = opts.symbol) !== null && _c !== void 0 ? _c : mint.toString().slice(0, 5),\n        chainId: (_d = opts.chainId) !== null && _d !== void 0 ? _d : ChainId.Localnet,\n    });\n};\n/**\n * Loads a token from a Connection.\n *\n * @param connection\n * @param mint\n * @param info\n */\nToken.load = async (connection, mint, info = {}) => {\n    if (typeof info.decimals === \"number\") {\n        return _a.fromMint(mint, info.decimals, info);\n    }\n    const mintAccountInfo = await connection.getAccountInfo(mint);\n    if (!mintAccountInfo) {\n        return null;\n    }\n    const mintInfo = (0, layout_js_1.deserializeMint)(mintAccountInfo.data);\n    return _a.fromMint(mint, mintInfo.decimals, info);\n};\n/**\n * Checks if two tokens are equal.\n * @param a\n * @param b\n * @returns\n */\nconst tokensEqual = (a, b) => a !== undefined &&\n    b !== undefined &&\n    a.address === b.address &&\n    a.network === b.network;\nexports.tokensEqual = tokensEqual;\nconst rawSol = {\n    address: exports.RAW_SOL_MINT.toString(),\n    name: \"Solana\",\n    symbol: \"SOL\",\n    decimals: 9,\n    logoURI: \"https://raw.githubusercontent.com/solana-labs/token-list/main/assets/mainnet/So11111111111111111111111111111111111111112/logo.png\",\n};\nconst wrappedSol = {\n    address: spl_token_1.NATIVE_MINT.toString(),\n    name: \"Wrapped SOL\",\n    symbol: \"SOL\",\n    decimals: 9,\n    logoURI: \"https://raw.githubusercontent.com/solana-labs/token-list/main/assets/mainnet/So11111111111111111111111111111111111111112/logo.png\",\n};\n/**\n * Creates a Token for all networks.\n */\nconst makeTokenForAllNetworks = (token) => ({\n    \"mainnet-beta\": new Token({ ...token, chainId: ChainId.MainnetBeta }),\n    devnet: new Token({ ...token, chainId: ChainId.Devnet }),\n    testnet: new Token({ ...token, chainId: ChainId.Testnet }),\n    localnet: new Token({ ...token, chainId: ChainId.Localnet }),\n});\nexports.makeTokenForAllNetworks = makeTokenForAllNetworks;\n// comes from @solana/spl-token-registry, except we've added localnet\nvar ChainId;\n(function (ChainId) {\n    ChainId[ChainId[\"MainnetBeta\"] = 101] = \"MainnetBeta\";\n    ChainId[ChainId[\"Testnet\"] = 102] = \"Testnet\";\n    ChainId[ChainId[\"Devnet\"] = 103] = \"Devnet\";\n    ChainId[ChainId[\"Localnet\"] = 104] = \"Localnet\";\n})(ChainId || (exports.ChainId = ChainId = {}));\nexports.NETWORK_TO_CHAIN_ID = {\n    \"mainnet-beta\": ChainId.MainnetBeta,\n    devnet: ChainId.Devnet,\n    testnet: ChainId.Testnet,\n    localnet: 104,\n};\nexports.CHAIN_ID_TO_NETWORK = Object.entries(exports.NETWORK_TO_CHAIN_ID).reduce((acc, [network, env]) => ({ ...acc, [env]: network }), {});\n/**\n * Gets the chain id associated with a network.\n * @param network\n * @returns\n */\nconst networkToChainId = (network) => exports.NETWORK_TO_CHAIN_ID[network];\nexports.networkToChainId = networkToChainId;\n/**\n * Gets the Network associated with a chain id.\n * @param network\n * @returns\n */\nconst chainIdToNetwork = (env) => exports.CHAIN_ID_TO_NETWORK[env];\nexports.chainIdToNetwork = chainIdToNetwork;\n/**\n * Raw Solana token.\n *\n * This is a magic value. This is not a real token.\n */\nexports.RAW_SOL = (0, exports.makeTokenForAllNetworks)(rawSol);\n/**\n * Wrapped Solana token.\n */\nexports.WRAPPED_SOL = (0, exports.makeTokenForAllNetworks)(wrappedSol);\n//# sourceMappingURL=token.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenAmount = void 0;\nconst tslib_1 = require(\"tslib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst token_math_1 = require(\"@ubeswap/token-math\");\nconst bn_js_1 = tslib_1.__importDefault(require(\"bn.js\"));\nclass TokenAmount extends token_math_1.TokenAmount {\n    // amount _must_ be raw, i.e. in the native representation\n    constructor(token, amount) {\n        super(token, amount, token_math_1.validateU64);\n    }\n    new(token, amount) {\n        // unsafe but nobody will be extending this anyway probably\n        return new TokenAmount(token, amount);\n    }\n    /**\n     * Parses a token amount from a decimal representation.\n     * @param token\n     * @param uiAmount\n     * @returns\n     */\n    static parse(token, uiAmount) {\n        const prev = (0, token_math_1.parseAmountFromString)(token, uiAmount, \".\", \",\");\n        return new TokenAmount(token, prev);\n    }\n    /**\n     * Divides this TokenAmount by a raw integer.\n     * @param other\n     * @returns\n     */\n    divideByInteger(other) {\n        return new TokenAmount(this.token, this.toU64().div(new bn_js_1.default((0, token_math_1.parseBigintIsh)(other).toString())));\n    }\n    /**\n     * String representation of this token amount.\n     */\n    toString() {\n        return `TokenAmount[Token=(${this.token.toString()}), amount=${this.toExact()}`;\n    }\n    /**\n     * JSON representation of the token amount.\n     */\n    toJSON() {\n        return {\n            ...super.toJSON(),\n            _isTA: true,\n            mint: this.token.address,\n            uiAmount: this.toExact(),\n        };\n    }\n    /**\n     * Converts this to the raw u64 used by the SPL library\n     * @returns\n     */\n    toU64() {\n        return new spl_token_1.u64(this.raw.toString());\n    }\n}\nexports.TokenAmount = TokenAmount;\n//# sourceMappingURL=tokenAmount.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.dedupeTokens = exports.makeTokenMap = exports.ORIGIN_CHAINS = void 0;\nconst token_js_1 = require(\"./token.js\");\n/**\n * Known origin chains.\n */\nexports.ORIGIN_CHAINS = [\n    \"bitcoin\",\n    \"ethereum\",\n    \"terra\",\n    \"avalanche\",\n    \"binance\",\n    \"celo\",\n    \"polygon\",\n    \"fantom\",\n    \"polygon\",\n    \"heco\",\n];\n/**\n * Creates a token map from a TokenList.\n * @param tokens\n * @returns\n */\nconst makeTokenMap = (tokenList) => {\n    const ret = {};\n    tokenList.tokens.forEach((item) => {\n        ret[item.address] = new token_js_1.Token(item);\n    });\n    return ret;\n};\nexports.makeTokenMap = makeTokenMap;\n/**\n * Dedupes a list of tokens, picking the first instance of the token in a list.\n * @param tokens\n * @returns\n */\nconst dedupeTokens = (tokens) => {\n    const seen = new Set();\n    return tokens.filter((token) => {\n        const tokenID = `${token.address}_${token.chainId}`;\n        if (seen.has(tokenID)) {\n            return false;\n        }\n        else {\n            seen.add(tokenID);\n            return true;\n        }\n    });\n};\nexports.dedupeTokens = dedupeTokens;\n//# sourceMappingURL=tokenList.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenOwner = void 0;\nconst index_js_1 = require(\"./index.js\");\n/**\n * Wrapper around a token account owner to create token instructions.\n */\nclass TokenOwner {\n    constructor(owner) {\n        this.owner = owner;\n    }\n    /**\n     * Gets the user's ATA.\n     * @param mint\n     * @returns\n     */\n    async getATA(mint) {\n        return await (0, index_js_1.getATAAddress)({ mint, owner: this.owner });\n    }\n    /**\n     * Gets the user's ATA.\n     * @param mint\n     * @returns\n     */\n    getATASync(mint) {\n        return (0, index_js_1.getATAAddressSync)({ mint, owner: this.owner });\n    }\n    /**\n     * Transfers tokens to a token account.\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    async transfer(amount, to) {\n        return index_js_1.SPLToken.createTransferInstruction(index_js_1.TOKEN_PROGRAM_ID, await this.getATA(amount.token.mintAccount), to, this.owner, [], amount.toU64());\n    }\n    /**\n     * Transfers tokens to a token account, checked..\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    async transferChecked(amount, to) {\n        return index_js_1.SPLToken.createTransferCheckedInstruction(index_js_1.TOKEN_PROGRAM_ID, await this.getATA(amount.token.mintAccount), amount.token.mintAccount, to, this.owner, [], amount.toU64(), amount.token.decimals);\n    }\n    /**\n     * Mints tokens to a token account.\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    mintTo(amount, to) {\n        return index_js_1.SPLToken.createMintToInstruction(index_js_1.TOKEN_PROGRAM_ID, amount.token.mintAccount, to, this.owner, [], amount.toU64());\n    }\n    /**\n     * Creates an associated token account instruction.\n     * @param mint Mint of the ATA.\n     * @param payer Payer to create the ATA. Defaults to the owner.\n     * @returns The transaction instruction.\n     */\n    async createATA(mint, payer = this.owner) {\n        return index_js_1.SPLToken.createAssociatedTokenAccountInstruction(index_js_1.ASSOCIATED_TOKEN_PROGRAM_ID, index_js_1.TOKEN_PROGRAM_ID, mint, await this.getATA(mint), this.owner, payer);\n    }\n}\nexports.TokenOwner = TokenOwner;\n//# sourceMappingURL=tokenOwner.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenAugmentedProvider = void 0;\nconst solana_contrib_1 = require(\"@saberhq/solana-contrib\");\nconst spl_token_1 = require(\"@solana/spl-token\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst ata_js_1 = require(\"./ata.js\");\nconst common_js_1 = require(\"./common.js\");\nconst index_js_1 = require(\"./index.js\");\nconst ata_js_2 = require(\"./instructions/ata.js\");\nconst layout_js_1 = require(\"./layout.js\");\nconst token_js_1 = require(\"./token.js\");\n/**\n * Augmented provider with token utilities.\n */\nclass TokenAugmentedProvider extends solana_contrib_1.SolanaAugmentedProvider {\n    constructor(provider) {\n        super(provider);\n    }\n    /**\n     * Creates a transaction to create a {@link Token}.\n     */\n    async createTokenTX({ mintKP = web3_js_1.Keypair.generate(), authority = this.walletKey, decimals = common_js_1.DEFAULT_TOKEN_DECIMALS, } = {}) {\n        const instructions = await (0, common_js_1.createMintInstructions)(this.provider, authority, mintKP.publicKey, decimals);\n        return {\n            token: token_js_1.Token.fromMint(mintKP.publicKey, decimals),\n            tx: this.newTX(instructions, [mintKP]),\n        };\n    }\n    /**\n     * Transfers tokens from the provider's ATA to a `TokenAccount`.\n     */\n    async transferTo({ amount, source, destination, }) {\n        const txEnv = this.newTX();\n        if (!source) {\n            const sourceATA = await this.getOrCreateATA({\n                mint: amount.token.mintAccount,\n            });\n            txEnv.append(sourceATA.instruction);\n            source = sourceATA.address;\n        }\n        txEnv.append(index_js_1.SPLToken.createTransferInstruction(spl_token_1.TOKEN_PROGRAM_ID, source, destination, this.walletKey, [], amount.toU64()));\n        return txEnv;\n    }\n    /**\n     * Transfers tokens to a recipient's ATA.\n     */\n    async transfer({ amount, source, to, }) {\n        const toATA = await this.getOrCreateATA({\n            mint: amount.token.mintAccount,\n            owner: to,\n        });\n        const txEnv = await this.transferTo({\n            amount,\n            source,\n            destination: toATA.address,\n        });\n        txEnv.prepend(toATA.instruction);\n        return txEnv;\n    }\n    /**\n     * Creates a {@link Token}.\n     */\n    async createToken({ mintKP = web3_js_1.Keypair.generate(), authority = this.walletKey, decimals = common_js_1.DEFAULT_TOKEN_DECIMALS, } = {}) {\n        const { token, tx } = await this.createTokenTX({\n            mintKP,\n            authority,\n            decimals,\n        });\n        await tx.confirm();\n        return token;\n    }\n    /**\n     * Gets an ATA address.\n     * @returns\n     */\n    async getATAAddress({ mint, owner = this.walletKey, }) {\n        return await (0, ata_js_1.getATAAddress)({ mint, owner });\n    }\n    /**\n     * Gets an ATA address.\n     * @returns\n     */\n    async getATAAddresses({ mints, owner = this.walletKey, }) {\n        return await (0, ata_js_1.getATAAddresses)({ mints, owner });\n    }\n    /**\n     * Gets an ATA, creating it if it doesn't exist.\n     * @returns\n     */\n    async getOrCreateATA({ mint, owner = this.walletKey, }) {\n        return await (0, ata_js_2.getOrCreateATA)({ provider: this.provider, mint, owner });\n    }\n    /**\n     * Get or create multiple ATAs.\n     * @returns\n     */\n    async getOrCreateATAs({ mints, owner = this.walletKey, }) {\n        return await (0, ata_js_2.getOrCreateATAs)({ provider: this.provider, mints, owner });\n    }\n    /**\n     * Loads a token from the blockchain, only if the decimals are not provided.\n     * @param mint\n     * @returns\n     */\n    async loadToken(mint, info = {}) {\n        return token_js_1.Token.load(this.provider.connection, mint, info);\n    }\n    /**\n     * Mints tokens to a token account.\n     * @param mint\n     * @returns\n     */\n    mintToAccount({ amount, destination, }) {\n        return this.newTX([\n            index_js_1.SPLToken.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, amount.token.mintAccount, destination, this.walletKey, [], amount.toU64()),\n        ]);\n    }\n    /**\n     * Mints tokens to the ATA of the `to` account.\n     * @param amount The amount of tokens to mint.\n     * @param to The owner of the ATA that may be created.\n     * @returns\n     */\n    async mintTo({ amount, to = this.walletKey, }) {\n        const toATA = await this.getOrCreateATA({\n            mint: amount.token.mintAccount,\n            owner: to,\n        });\n        const txEnv = this.mintToAccount({\n            amount,\n            destination: toATA.address,\n        });\n        txEnv.prepend(toATA.instruction);\n        return txEnv;\n    }\n    /**\n     * Fetches a mint.\n     * @param address\n     * @returns\n     */\n    async fetchMint(address) {\n        const accountInfo = await this.getAccountInfo(address);\n        if (accountInfo === null) {\n            return null;\n        }\n        return (0, layout_js_1.deserializeMint)(accountInfo.accountInfo.data);\n    }\n    /**\n     * Fetches a token account.\n     * @param address\n     * @returns\n     */\n    async fetchTokenAccount(address) {\n        const tokenAccountInfo = await this.getAccountInfo(address);\n        if (tokenAccountInfo === null) {\n            return null;\n        }\n        return (0, layout_js_1.deserializeAccount)(tokenAccountInfo.accountInfo.data);\n    }\n    /**\n     * Fetches an ATA.\n     * @param mint\n     * @param owner\n     * @returns\n     */\n    async fetchATA(mint, owner = this.walletKey) {\n        const taAddress = await (0, ata_js_1.getATAAddress)({ mint, owner });\n        return await this.fetchTokenAccount(taAddress);\n    }\n}\nexports.TokenAugmentedProvider = TokenAugmentedProvider;\n//# sourceMappingURL=tokenProvider.js.map","\"use strict\";\n/**\n * [[include:option-utils/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.exists = exports.isNotUndefined = exports.isNotNull = exports.mapSome = exports.mapN = void 0;\n/**\n * Applies a function to a list of null/undefined values, unwrapping the null/undefined value or passing it through.\n */\nconst mapN = (fn, ...args) => {\n    if (!args.every((arg) => arg !== undefined)) {\n        return undefined;\n    }\n    if (!args.every((arg) => arg !== null)) {\n        return null;\n    }\n    return fn(...args);\n};\nexports.mapN = mapN;\n/**\n * Applies a function to a null/undefined inner value if it is null or undefined,\n * otherwise returns null/undefined.\n *\n * For consistency reasons, we recommend just using {@link mapN} in all cases.\n *\n * @deprecated use {@link mapN}\n * @param obj\n * @param fn\n * @returns\n */\nconst mapSome = (obj, fn) => ((0, exports.exists)(obj) ? fn(obj) : obj);\nexports.mapSome = mapSome;\n/**\n * Checks to see if the provided value is not null.\n *\n * Useful for preserving types in filtering out non-null values.\n *\n * @param value\n * @returns\n */\nconst isNotNull = (value) => {\n    return value !== null;\n};\nexports.isNotNull = isNotNull;\n/**\n * Checks to see if the provided value is not undefined.\n *\n * @param value\n * @returns\n */\nconst isNotUndefined = (value) => {\n    return value !== undefined;\n};\nexports.isNotUndefined = isNotUndefined;\n/**\n * Checks to see if the provided value is not null or undefined.\n *\n * @param value\n * @returns\n */\nconst exists = (value) => {\n    return value !== null && value !== undefined;\n};\nexports.exists = exists;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MultipleConnectionBroadcaster = exports.SingleConnectionBroadcaster = exports.DEFAULT_FALLBACK_RETRY_OPTIONS = exports.DEFAULT_RETRY_OPTIONS = void 0;\nconst tslib_1 = require(\"tslib\");\nconst error_js_1 = require(\"../error.js\");\nconst provider_js_1 = require(\"../provider.js\");\nconst index_js_1 = require(\"../transaction/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst simulateTransactionWithCommitment_js_1 = require(\"../utils/simulateTransactionWithCommitment.js\");\nconst sendAndSpamRawTx_js_1 = require(\"./sendAndSpamRawTx.js\");\ntslib_1.__exportStar(require(\"./tiered.js\"), exports);\n/**\n * Default retry parameters.\n */\nexports.DEFAULT_RETRY_OPTIONS = {\n    retryTimes: 3,\n    retryInterval: 1000,\n};\n/**\n * Default retry parameters for fallbacks.\n */\nexports.DEFAULT_FALLBACK_RETRY_OPTIONS = {\n    retryTimes: 10,\n    retryInterval: 300,\n};\n/**\n * Broadcasts transactions to a single connection.\n */\nclass SingleConnectionBroadcaster {\n    constructor(sendConnection, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.sendConnection = sendConnection;\n        this.opts = opts;\n    }\n    /**\n     * @inheritdoc\n     */\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.commitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.sendConnection.getLatestBlockhash(commitment);\n    }\n    /**\n     * @inheritdoc\n     */\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.commitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        const result = await this.sendConnection.getLatestBlockhash(commitment);\n        return result.blockhash;\n    }\n    /**\n     * @inheritdoc\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return new index_js_1.PendingTransaction(this.sendConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.sendConnection, rawTx, opts, opts));\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return new index_js_1.PendingTransaction(this.sendConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.sendConnection, rawTx, opts, opts));\n        });\n    }\n    /**\n     * @inheritdoc\n     */\n    async simulate(tx, _a) {\n        var _b, _c;\n        var { commitment = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_c = this.opts.preflightCommitment) !== null && _c !== void 0 ? _c : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        return await (0, simulateTransactionWithCommitment_js_1.simulateTransactionWithCommitment)(this.sendConnection, tx, commitment);\n    }\n}\nexports.SingleConnectionBroadcaster = SingleConnectionBroadcaster;\n/**\n * Broadcasts transactions to multiple connections simultaneously.\n */\nclass MultipleConnectionBroadcaster {\n    constructor(connections, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.connections = connections;\n        this.opts = opts;\n    }\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        try {\n            const result = await Promise.any(this.connections.map((conn) => conn.getLatestBlockhash(commitment)));\n            return result;\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        try {\n            const result = await Promise.any(this.connections.map((conn) => conn.getLatestBlockhash(commitment)));\n            return result.blockhash;\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    async _sendRawTransaction(encoded, options) {\n        try {\n            return await Promise.any(this.connections.map(async (connection) => {\n                return new index_js_1.PendingTransaction(connection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(connection, encoded, options !== null && options !== void 0 ? options : this.opts));\n            }));\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    /**\n     * Broadcasts a signed transaction.\n     *\n     * @param tx\n     * @param confirm\n     * @param opts\n     * @returns\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return await this._sendRawTransaction(rawTx, opts);\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return await this._sendRawTransaction(rawTx, opts);\n        });\n    }\n    /**\n     * Simulates a transaction with a commitment.\n     * @param tx\n     * @param commitment\n     * @returns\n     */\n    async simulate(tx, _a) {\n        var _b, _c, _d, _e;\n        var { commitment = (_c = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : this.opts.commitment) !== null && _c !== void 0 ? _c : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_e = (_d = this.opts.preflightCommitment) !== null && _d !== void 0 ? _d : this.opts.commitment) !== null && _e !== void 0 ? _e : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        try {\n            return await Promise.any(this.connections.map(async (connection) => {\n                return await (0, simulateTransactionWithCommitment_js_1.simulateTransactionWithCommitment)(connection, tx, commitment);\n            }));\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n}\nexports.MultipleConnectionBroadcaster = MultipleConnectionBroadcaster;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sendAndSpamRawTx = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst index_js_2 = require(\"./index.js\");\n/**\n * Sends and spams a raw transaction multiple times.\n * @param connection Connection to send the transaction to. We recommend using a public endpoint such as GenesysGo.\n * @param rawTx\n * @param opts\n */\nconst sendAndSpamRawTx = async (connection, rawTx, sendOptions, { retryTimes = index_js_2.DEFAULT_RETRY_OPTIONS.retryTimes, retryInterval = index_js_2.DEFAULT_RETRY_OPTIONS.retryInterval, } = index_js_2.DEFAULT_RETRY_OPTIONS) => {\n    const result = await connection.sendRawTransaction(rawTx, sendOptions);\n    // if we could send the TX with preflight, let's spam it.\n    void (async () => {\n        // technique stolen from Mango.\n        for (let i = 0; i < retryTimes; i++) {\n            try {\n                await (0, index_js_1.sleep)(retryInterval);\n                await connection.sendRawTransaction(rawTx, {\n                    ...sendOptions,\n                    skipPreflight: true,\n                });\n            }\n            catch (e) {\n                console.warn(`[Broadcaster] sendAndSpamRawTx error`, e);\n            }\n        }\n    })();\n    return result;\n};\nexports.sendAndSpamRawTx = sendAndSpamRawTx;\n//# sourceMappingURL=sendAndSpamRawTx.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TieredBroadcaster = void 0;\nconst provider_js_1 = require(\"../provider.js\");\nconst index_js_1 = require(\"../transaction/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst index_js_3 = require(\"./index.js\");\nconst sendAndSpamRawTx_js_1 = require(\"./sendAndSpamRawTx.js\");\n/**\n * Broadcasts transactions to multiple connections simultaneously.\n */\nclass TieredBroadcaster {\n    constructor(primaryConnection, \n    /**\n     * Connections to send to in addition to the primary.\n     */\n    fallbackConnections, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.primaryConnection = primaryConnection;\n        this.fallbackConnections = fallbackConnections;\n        this.opts = opts;\n        this.premiumBroadcaster = new index_js_3.SingleConnectionBroadcaster(primaryConnection, opts);\n    }\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.premiumBroadcaster.getLatestBlockhash(commitment);\n    }\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.premiumBroadcaster.getRecentBlockhash(commitment);\n    }\n    async _sendRawTransaction(encoded, options) {\n        const pending = new index_js_1.PendingTransaction(this.primaryConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.primaryConnection, encoded, options !== null && options !== void 0 ? options : this.opts, options !== null && options !== void 0 ? options : index_js_3.DEFAULT_RETRY_OPTIONS));\n        void (async () => {\n            await Promise.all(this.fallbackConnections.map(async (fc) => {\n                var _a;\n                try {\n                    await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(fc, encoded, options !== null && options !== void 0 ? options : this.opts, (_a = options === null || options === void 0 ? void 0 : options.fallbackRetryOptions) !== null && _a !== void 0 ? _a : index_js_3.DEFAULT_FALLBACK_RETRY_OPTIONS);\n                }\n                catch (e) {\n                    console.warn(`[Broadcaster] _sendRawTransaction error`, e);\n                }\n            }));\n        })();\n        return pending;\n    }\n    /**\n     * Broadcasts a signed transaction.\n     *\n     * @param tx\n     * @param confirm\n     * @param opts\n     * @returns\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return await this._sendRawTransaction(rawTx, opts);\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return await this._sendRawTransaction(rawTx, opts);\n        });\n    }\n    /**\n     * Simulates a transaction with a commitment.\n     * @param tx\n     * @param commitment\n     * @returns\n     */\n    async simulate(tx, _a) {\n        var _b, _c;\n        var { commitment = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_c = this.opts.preflightCommitment) !== null && _c !== void 0 ? _c : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        return this.premiumBroadcaster.simulate(tx, {\n            commitment,\n            verifySigners,\n        });\n    }\n}\nexports.TieredBroadcaster = TieredBroadcaster;\n//# sourceMappingURL=tiered.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.COMPUTE_BUDGET_PROGRAM = void 0;\nconst tslib_1 = require(\"tslib\");\nconst web3_js_1 = require(\"@solana/web3.js\");\n/**\n * The compute budget program.\n * Source: https://github.com/solana-labs/solana/blob/master/program-runtime/src/compute_budget.rs#L101\n */\nexports.COMPUTE_BUDGET_PROGRAM = new web3_js_1.PublicKey(\"ComputeBudget111111111111111111111111111111\");\ntslib_1.__exportStar(require(\"./instructions.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.requestHeapFrameInstruction = exports.requestComputeUnitsInstruction = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst index_js_1 = require(\"./index.js\");\nconst layouts_js_1 = require(\"./layouts.js\");\n/**\n * Request a specific maximum number of compute units the transaction is\n * allowed to consume and an additional fee to pay.\n */\nconst requestComputeUnitsInstruction = (units, additionalFee) => {\n    const data = Buffer.alloc(layouts_js_1.RequestUnitsLayout.span);\n    layouts_js_1.RequestUnitsLayout.encode({ instruction: 0, units, additionalFee }, data);\n    return new web3_js_1.TransactionInstruction({\n        data,\n        keys: [],\n        programId: index_js_1.COMPUTE_BUDGET_PROGRAM,\n    });\n};\nexports.requestComputeUnitsInstruction = requestComputeUnitsInstruction;\n/**\n * Request a specific transaction-wide program heap region size in bytes.\n * The value requested must be a multiple of 1024. This new heap region\n * size applies to each program executed, including all calls to CPIs.\n */\nconst requestHeapFrameInstruction = (bytes) => {\n    const data = Buffer.alloc(layouts_js_1.RequestHeapFrameLayout.span);\n    layouts_js_1.RequestHeapFrameLayout.encode({ instruction: 1, bytes }, data);\n    return new web3_js_1.TransactionInstruction({\n        data,\n        keys: [],\n        programId: index_js_1.COMPUTE_BUDGET_PROGRAM,\n    });\n};\nexports.requestHeapFrameInstruction = requestHeapFrameInstruction;\n//# sourceMappingURL=instructions.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.RequestHeapFrameLayout = exports.RequestUnitsLayout = void 0;\nconst tslib_1 = require(\"tslib\");\nconst BufferLayout = tslib_1.__importStar(require(\"@solana/buffer-layout\"));\nexports.RequestUnitsLayout = BufferLayout.struct([\n    BufferLayout.u8(\"instruction\"),\n    BufferLayout.u32(\"units\"),\n    BufferLayout.u32(\"additionalFee\"),\n]);\nexports.RequestHeapFrameLayout = BufferLayout.struct([BufferLayout.u8(\"instruction\"), BufferLayout.u32(\"bytes\")]);\n//# sourceMappingURL=layouts.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DEFAULT_NETWORK_CONFIG_MAP = exports.formatNetwork = void 0;\n/**\n * Formats the network as a string.\n * @param network\n * @returns\n */\nconst formatNetwork = (network) => {\n    if (network === \"mainnet-beta\") {\n        return \"mainnet\";\n    }\n    return network;\n};\nexports.formatNetwork = formatNetwork;\n/**\n * Default configuration for all networks.\n */\nexports.DEFAULT_NETWORK_CONFIG_MAP = {\n    \"mainnet-beta\": {\n        name: \"Mainnet Beta\",\n        endpoint: \"https://api.mainnet-beta.solana.com/\",\n    },\n    devnet: {\n        name: \"Devnet\",\n        endpoint: \"https://api.devnet.solana.com/\",\n    },\n    testnet: {\n        name: \"Testnet\",\n        endpoint: \"https://api.testnet.solana.com/\",\n    },\n    localnet: {\n        name: \"Localnet\",\n        endpoint: \"http://127.0.0.1:8899\",\n    },\n};\n//# sourceMappingURL=constants.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.firstAggregateError = void 0;\nconst firstAggregateError = (err) => {\n    const errors = err.errors;\n    const [firstError, ...remErrors] = [errors.pop(), ...errors];\n    if (remErrors.length > 0) {\n        console.error(remErrors);\n    }\n    return firstError;\n};\nexports.firstAggregateError = firstAggregateError;\n//# sourceMappingURL=error.js.map","\"use strict\";\n/**\n * [[include:solana-contrib/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./broadcaster/index.js\"), exports);\ntslib_1.__exportStar(require(\"./constants.js\"), exports);\ntslib_1.__exportStar(require(\"./interfaces.js\"), exports);\ntslib_1.__exportStar(require(\"./provider.js\"), exports);\ntslib_1.__exportStar(require(\"./transaction/index.js\"), exports);\ntslib_1.__exportStar(require(\"./utils/index.js\"), exports);\ntslib_1.__exportStar(require(\"./wallet.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n//# sourceMappingURL=interfaces.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SolanaAugmentedProvider = exports.SolanaProvider = exports.SolanaTransactionSigner = exports.doSignAndBroadcastTransaction = exports.SolanaReadonlyProvider = exports.DEFAULT_READONLY_PUBLIC_KEY = exports.DEFAULT_PROVIDER_OPTIONS = void 0;\nconst tslib_1 = require(\"tslib\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst index_js_1 = require(\"./broadcaster/index.js\");\nconst index_js_2 = require(\"./index.js\");\nconst TransactionEnvelope_js_1 = require(\"./transaction/TransactionEnvelope.js\");\nexports.DEFAULT_PROVIDER_OPTIONS = {\n    preflightCommitment: \"confirmed\",\n    commitment: \"confirmed\",\n};\nexports.DEFAULT_READONLY_PUBLIC_KEY = web3_js_1.SystemProgram.programId;\n/**\n * Provider that can only read.\n */\nclass SolanaReadonlyProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param opts       Transaction confirmation options to use by default.\n     * @param publicKey  Optional public key of read-only wallet.\n     */\n    constructor(connection, opts = exports.DEFAULT_PROVIDER_OPTIONS, publicKey = exports.DEFAULT_READONLY_PUBLIC_KEY) {\n        this.connection = connection;\n        this.opts = opts;\n        this.publicKey = publicKey;\n        this.wallet = {\n            signTransaction: Promise.resolve.bind(Promise),\n            signAllTransactions: Promise.resolve.bind(Promise),\n            publicKey: exports.DEFAULT_READONLY_PUBLIC_KEY,\n        };\n        this.wallet = {\n            ...this.wallet,\n            publicKey,\n        };\n    }\n    /**\n     * Gets\n     * @param accountId\n     * @returns\n     */\n    async getAccountInfo(accountId) {\n        const accountInfo = await this.connection.getAccountInfo(accountId, this.opts.commitment);\n        if (!accountInfo) {\n            return null;\n        }\n        return {\n            accountId,\n            accountInfo,\n        };\n    }\n}\nexports.SolanaReadonlyProvider = SolanaReadonlyProvider;\nconst doSignAndBroadcastTransaction = async (wallet, transaction, broadcaster, opts) => {\n    const tx = await wallet.signTransaction(transaction);\n    if ((opts === null || opts === void 0 ? void 0 : opts.signers) && opts.signers.length > 0) {\n        tx.sign(...opts.signers);\n    }\n    return await broadcaster.broadcast(tx, opts);\n};\nexports.doSignAndBroadcastTransaction = doSignAndBroadcastTransaction;\n/**\n * Signs Solana transactions.\n */\nclass SolanaTransactionSigner {\n    constructor(wallet, broadcaster, preflightCommitment = \"confirmed\") {\n        this.wallet = wallet;\n        this.broadcaster = broadcaster;\n        this.preflightCommitment = preflightCommitment;\n    }\n    get publicKey() {\n        return this.wallet.publicKey;\n    }\n    async signAndBroadcastTransaction(transaction, opts) {\n        return await (0, exports.doSignAndBroadcastTransaction)(this.wallet, transaction, this.broadcaster, opts);\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provdier wallet that\n     *                will sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sign(tx, signers = [], opts = {\n        preflightCommitment: this.preflightCommitment,\n    }) {\n        const { blockhash, lastValidBlockHeight } = await this.broadcaster.getLatestBlockhash(opts.preflightCommitment);\n        tx.feePayer = this.wallet.publicKey;\n        tx.lastValidBlockHeight = lastValidBlockHeight;\n        tx.recentBlockhash = blockhash;\n        await this.wallet.signTransaction(tx);\n        signers\n            .filter((s) => s !== undefined)\n            .forEach((kp) => {\n            tx.partialSign(kp);\n        });\n        return tx;\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     */\n    async signAll(reqs, opts = {\n        preflightCommitment: this.preflightCommitment,\n    }) {\n        const { blockhash, lastValidBlockHeight } = await this.broadcaster.getLatestBlockhash(opts.preflightCommitment);\n        const txs = reqs.map(({ tx, signers = [] }) => {\n            tx.feePayer = this.wallet.publicKey;\n            tx.lastValidBlockHeight = lastValidBlockHeight;\n            tx.recentBlockhash = blockhash;\n            signers\n                .filter((s) => s !== undefined)\n                .forEach((kp) => {\n                tx.partialSign(kp);\n            });\n            return tx;\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        return signedTxs;\n    }\n}\nexports.SolanaTransactionSigner = SolanaTransactionSigner;\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n *\n * This implementation was taken from Anchor.\n */\nclass SolanaProvider extends SolanaReadonlyProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param sendConnection The connection where transactions are sent to.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, broadcaster, wallet, opts = exports.DEFAULT_PROVIDER_OPTIONS, signer = new SolanaTransactionSigner(wallet, broadcaster, opts.preflightCommitment)) {\n        super(connection, opts);\n        this.connection = connection;\n        this.broadcaster = broadcaster;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.signer = signer;\n    }\n    async signAndBroadcastTransaction(transaction, opts) {\n        return await this.signer.signAndBroadcastTransaction(transaction, opts);\n    }\n    /**\n     * Creates a new SolanaProvider.\n     * @deprecated use {@link SolanaProvider.init}\n     */\n    static load({ connection, sendConnection = connection, wallet, opts, }) {\n        return new SolanaProvider(connection, new index_js_1.SingleConnectionBroadcaster(sendConnection, opts), wallet, opts);\n    }\n    /**\n     * Initializes a new SolanaProvider.\n     */\n    static init({ connection, broadcastConnections = [connection], wallet, opts = exports.DEFAULT_PROVIDER_OPTIONS, }) {\n        const firstBroadcastConnection = broadcastConnections[0];\n        (0, tiny_invariant_1.default)(firstBroadcastConnection, \"must have at least one broadcast connection\");\n        return new SolanaProvider(connection, broadcastConnections.length > 1\n            ? new index_js_2.TieredBroadcaster(connection, broadcastConnections, opts)\n            : new index_js_1.SingleConnectionBroadcaster(firstBroadcastConnection, opts), wallet, opts);\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provider wallet that\n     *                will sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async send(tx, signers = [], opts = this.opts) {\n        const theTx = await this.signer.sign(tx, signers, opts);\n        const pending = await this.broadcaster.broadcast(theTx, opts);\n        await pending.wait();\n        return pending;\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     */\n    async sendAll(reqs, opts = this.opts) {\n        const txs = await this.signer.signAll(reqs, opts);\n        return await Promise.all(txs.map(async (tx) => {\n            const pending = await this.broadcaster.broadcast(tx, opts);\n            await pending.wait();\n            return pending;\n        }));\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provider wallet that\n     *                will sign the transaction. If specified, the provider will\n     *                sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, opts = this.opts) {\n        let simTX = tx;\n        if (signers !== undefined) {\n            simTX = await this.signer.sign(tx, signers, opts);\n        }\n        return await this.broadcaster.simulate(simTX, {\n            verifySigners: signers !== undefined,\n            commitment: opts.commitment,\n        });\n    }\n}\nexports.SolanaProvider = SolanaProvider;\n/**\n * Wrapper for a Provider containing utility functions.\n */\nclass SolanaAugmentedProvider {\n    constructor(provider) {\n        this.provider = provider;\n    }\n    get walletKey() {\n        return this.provider.wallet.publicKey;\n    }\n    get connection() {\n        return this.provider.connection;\n    }\n    get signer() {\n        return this.provider.signer;\n    }\n    get broadcaster() {\n        return this.provider.broadcaster;\n    }\n    get opts() {\n        return this.provider.opts;\n    }\n    get wallet() {\n        return this.provider.wallet;\n    }\n    signAndBroadcastTransaction(transaction, opts) {\n        return this.provider.signAndBroadcastTransaction(transaction, opts);\n    }\n    send(tx, signers, opts) {\n        return this.provider.send(tx, signers, opts);\n    }\n    sendAll(reqs, opts) {\n        return this.provider.sendAll(reqs, opts);\n    }\n    simulate(tx, signers, opts) {\n        return this.provider.simulate(tx, signers, opts);\n    }\n    getAccountInfo(accountId) {\n        return this.provider.getAccountInfo(accountId);\n    }\n    /**\n     * Creates a new transaction using this Provider.\n     * @param instructions\n     * @param signers\n     * @returns\n     */\n    newTX(instructions = [], signers = []) {\n        return TransactionEnvelope_js_1.TransactionEnvelope.create(this, instructions, signers);\n    }\n    /**\n     * Requests an airdrop of tokens.\n     * @param amount\n     * @returns\n     */\n    async requestAirdrop(lamports, to = this.wallet.publicKey) {\n        return new index_js_2.PendingTransaction(this.connection, await this.connection.requestAirdrop(to, lamports));\n    }\n    /**\n     * Returns this provider with a different signer.\n     * @param signer\n     * @returns\n     */\n    withSigner(signer) {\n        return new SolanaAugmentedProvider(new SolanaProvider(this.connection, this.broadcaster, new index_js_2.SignerWallet(signer), this.opts));\n    }\n}\nexports.SolanaAugmentedProvider = SolanaAugmentedProvider;\n//# sourceMappingURL=provider.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PendingTransaction = void 0;\nconst tslib_1 = require(\"tslib\");\nconst promise_retry_1 = tslib_1.__importDefault(require(\"promise-retry\"));\nconst txLink_js_1 = require(\"../utils/txLink.js\");\nconst TransactionReceipt_js_1 = require(\"./TransactionReceipt.js\");\n/**\n * Transaction which may or may not be confirmed.\n */\nclass PendingTransaction {\n    constructor(connection, signature) {\n        this.connection = connection;\n        this.signature = signature;\n        this._receipt = null;\n    }\n    /**\n     * Gets the transaction receipt, if it has already been fetched.\n     *\n     * You probably want the async version of this function, `wait`.\n     */\n    get receipt() {\n        return this._receipt;\n    }\n    /**\n     * Waits for the confirmation of the transaction.\n     * @returns\n     */\n    async wait({ commitment = \"confirmed\", maxSupportedTransactionVersion = 0, useWebsocket = true, ...retryOpts } = {}) {\n        if (this._receipt) {\n            return this._receipt;\n        }\n        if (useWebsocket) {\n            await this.confirm({ commitment, ...retryOpts });\n            return await this.pollForReceipt({\n                commitment,\n                maxSupportedTransactionVersion,\n            });\n        }\n        return await this.pollForReceipt({\n            commitment,\n            maxSupportedTransactionVersion,\n            ...retryOpts,\n        });\n    }\n    /**\n     * Fetches the TransactionReceipt via polling.\n     * @returns\n     */\n    async pollForReceipt({ commitment = \"confirmed\", maxSupportedTransactionVersion = 0, ...retryOpts } = {}) {\n        const receipt = await (0, promise_retry_1.default)(async (retry) => {\n            const result = await this.connection.getTransaction(this.signature, {\n                commitment,\n                maxSupportedTransactionVersion,\n            });\n            if (!result) {\n                retry(new Error(\"Error fetching transaction\"));\n                return;\n            }\n            return new TransactionReceipt_js_1.TransactionReceipt(this.signature, result);\n        }, {\n            retries: 5,\n            minTimeout: 500,\n            ...retryOpts,\n        });\n        if (!receipt) {\n            throw new Error(\"transaction could not be confirmed\");\n        }\n        this._receipt = receipt;\n        return receipt;\n    }\n    /**\n     * Awaits the confirmation of the transaction, via onSignature subscription.\n     *\n     * @deprecated use {@link PendingTransaction#confirm}\n     * @returns\n     */\n    async awaitSignatureConfirmation(commitment = \"confirmed\") {\n        const { value } = await this.connection.confirmTransaction(this.signature, commitment);\n        if (value.err) {\n            throw value.err;\n        }\n        return this.signature;\n    }\n    /**\n     * Awaits the confirmation of the transaction, via onSignature subscription.\n     * @returns\n     */\n    async confirm({ commitment = \"confirmed\", blockhash, lastValidBlockHeight, }) {\n        let value;\n        if (blockhash && lastValidBlockHeight) {\n            value = (await this.connection.confirmTransaction({\n                signature: this.signature,\n                blockhash,\n                lastValidBlockHeight,\n            }, commitment)).value;\n        }\n        else {\n            value = (await this.connection.confirmTransaction(this.signature, commitment)).value;\n        }\n        if (value.err) {\n            throw new Error(`Transaction ${this.signature} failed (${JSON.stringify(value)})`);\n        }\n        return this.signature;\n    }\n    /**\n     * Generates a link to view this {@link PendingTransaction} on the official Solana explorer.\n     * @param network\n     * @returns\n     */\n    generateSolanaExplorerLink(cluster = \"mainnet-beta\") {\n        return (0, txLink_js_1.generateTXLink)(this.signature, cluster);\n    }\n}\nexports.PendingTransaction = PendingTransaction;\n//# sourceMappingURL=PendingTransaction.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TransactionEnvelope = exports.PACKET_DATA_SIZE = void 0;\nconst tslib_1 = require(\"tslib\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst index_js_1 = require(\"../computeBudget/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst txSizer_js_1 = require(\"./txSizer.js\");\nconst utils_js_1 = require(\"./utils.js\");\nexports.PACKET_DATA_SIZE = 1280 - 40 - 8;\nconst ASSOCIATED_TOKEN_PROGRAM_ID = new web3_js_1.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\n/**\n * Filters the required signers for a list of instructions.\n * @param ixs\n * @returns\n */\nconst filterRequiredSigners = (ixs, signers) => {\n    // filter out the signers required for the transaction\n    const requiredSigners = ixs.flatMap((ix) => ix.keys.filter((k) => k.isSigner).map((k) => k.pubkey));\n    return signers.filter((s) => requiredSigners.find((rs) => rs.equals(s.publicKey)));\n};\n/**\n * Contains a Transaction that is being built.\n */\nclass TransactionEnvelope {\n    constructor(\n    /**\n     * Provider that will be sending the transaction as the fee payer.\n     */\n    provider, \n    /**\n     * Instructions associated with the transaction.\n     */\n    instructions, \n    /**\n     * Optional signers of the transaction.\n     */\n    signers = []) {\n        this.provider = provider;\n        this.instructions = instructions;\n        this.signers = signers;\n    }\n    /**\n     * Prepends the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to prepend.\n     * @returns\n     */\n    prepend(...instructions) {\n        this.instructions.unshift(...instructions.filter((ix) => !!ix));\n        return this;\n    }\n    /**\n     * Appends the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to append.\n     * @returns\n     */\n    append(...instructions) {\n        this.instructions.push(...instructions.filter((ix) => !!ix));\n        return this;\n    }\n    /**\n     * A the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to add.\n     * @deprecated Use {@link #append} instead.\n     * @returns\n     */\n    addInstructions(...instructions) {\n        return this.append(...instructions);\n    }\n    /**\n     * Adds the given {@link Signer}s to the {@link TransactionEnvelope}.\n     * @param signers The signers to add.\n     * @returns\n     */\n    addSigners(...signers) {\n        this.signers.push(...signers);\n        return this;\n    }\n    /**\n     * Builds a transaction from this envelope.\n     * @param feePayer Optional override for the fee payer.\n     */\n    build(feePayer = this.provider.wallet.publicKey) {\n        const tx = new web3_js_1.Transaction().add(...this.instructions);\n        tx.feePayer = feePayer;\n        return tx;\n    }\n    /**\n     * Builds a transaction and estimates the size in bytes.\n     * Does not check to see if the transaction is too big.\n     *\n     * @returns Byte count\n     */\n    estimateSizeUnsafe() {\n        const builtTx = this.build();\n        // dummy blockhash that is required for building the transaction\n        builtTx.recentBlockhash = \"MaryHadALittLeLambZNdhAUTrsLE1ydg6rmtvFEpKT\";\n        return (0, txSizer_js_1.calculateTxSizeUnsafe)(builtTx);\n    }\n    /**\n     * Builds a transaction and estimates the size in bytes. This number is primrily\n     * to be used for checking to see if a transaction is too big and instructions\n     * need to be split. It may not be 100% accurate.\n     *\n     * This is used in expectTXTable and is useful for increasing efficiency in\n     * dapps that build large transactions.\n     *\n     * The max transaction size of a v1 Transaction in Solana is 1232 bytes.\n     * For info about Transaction v2: https://docs.solana.com/proposals/transactions-v2\n     */\n    estimateSize() {\n        return (0, index_js_2.suppressConsoleError)(() => {\n            try {\n                const builtTx = this.build();\n                // dummy blockhash that is required for building the transaction\n                builtTx.recentBlockhash = \"MaryHadALittLeLambZNdhAUTrsLE1ydg6rmtvFEpKT\";\n                const size = (0, txSizer_js_1.calculateTxSizeUnsafe)(builtTx);\n                if (size > exports.PACKET_DATA_SIZE) {\n                    return { error: new index_js_2.EstimatedTXTooBigError(builtTx, size) };\n                }\n                return { size };\n            }\n            catch (e) {\n                return { error: new index_js_2.TXSizeEstimationError(e) };\n            }\n        });\n    }\n    /**\n     * Partition a large {@link TransactionEnvelope} into smaller, valid {@link Transaction}s.\n     * This relies on this envelope already having the correct number of signers.\n     *\n     * @param feePayer Optional fee payer override.\n     * @returns A list of {@link Transaction}s.\n     */\n    buildPartition(feePayer = this.provider.wallet.publicKey) {\n        const partition = this.partition();\n        return partition.map((env) => env.build(feePayer));\n    }\n    /**\n     * Partition a large {@link TransactionEnvelope} into smaller, valid transaction envelopes which can be built.\n     * This relies on this envelope already having the correct number of signers.\n     *\n     * @returns\n     */\n    partition() {\n        const estimation = this.estimateSize();\n        if (\"size\" in estimation) {\n            return [this];\n        }\n        // empty partition should have no envelopes\n        if (this.instructions.length === 0) {\n            return [];\n        }\n        let lastTXEnv = new TransactionEnvelope(this.provider, this.instructions.slice(0, 1), this._filterRequiredSigners(this.instructions.slice(0, 1)));\n        let lastEstimation = lastTXEnv.estimateSizeUnsafe();\n        const txs = [];\n        this.instructions.slice(1).forEach((ix, i) => {\n            if (lastEstimation > exports.PACKET_DATA_SIZE) {\n                throw new Error(`cannot construct a valid partition: instruction ${i} is too large (${lastEstimation} > ${exports.PACKET_DATA_SIZE})`);\n            }\n            const nextIXs = [...lastTXEnv.instructions, ix];\n            const nextSigners = this._filterRequiredSigners(nextIXs);\n            const nextTXEnv = new TransactionEnvelope(this.provider, nextIXs, nextSigners);\n            const nextEstimation = nextTXEnv.estimateSizeUnsafe();\n            // move to next tx envelope if too big\n            if (nextEstimation > exports.PACKET_DATA_SIZE) {\n                txs.push(lastTXEnv);\n                const nextIXs = [ix];\n                lastTXEnv = new TransactionEnvelope(this.provider, nextIXs, this._filterRequiredSigners(nextIXs));\n                lastEstimation = lastTXEnv.estimateSizeUnsafe();\n            }\n            else {\n                lastTXEnv = nextTXEnv;\n                lastEstimation = nextEstimation;\n            }\n        });\n        txs.push(lastTXEnv);\n        return txs;\n    }\n    /**\n     * Filters the required signers for a list of instructions.\n     * @param ixs\n     * @returns\n     */\n    _filterRequiredSigners(ixs) {\n        return filterRequiredSigners(ixs, this.signers);\n    }\n    /**\n     * Generates a link for inspecting the contents of this {@link TransactionEnvelope}.\n     *\n     * @returns URL\n     */\n    generateInspectLink(cluster = \"mainnet-beta\") {\n        const t = this.build();\n        t.recentBlockhash = utils_js_1.RECENT_BLOCKHASH_STUB;\n        const str = t.serializeMessage().toString(\"base64\");\n        return (0, utils_js_1.generateInspectLinkFromBase64)(cluster, str);\n    }\n    /**\n     * Simulates the transaction.\n     * @param opts\n     * @returns\n     */\n    simulate(opts = {\n        verifySigners: true,\n    }) {\n        return this.provider.simulate(this.build(), opts.verifySigners ? this.signers : undefined, opts);\n    }\n    /**\n     * Simulates the transaction, without validating signers.\n     *\n     * @deprecated Use {@link TXEnvelope#simulate} instead.\n     * @param opts\n     * @returns\n     */\n    simulateUnchecked(opts) {\n        return this.simulate({ ...opts, verifySigners: false });\n    }\n    /**\n     * Simulates the transaction and prints a fancy table in the console.\n     * ```\n     *    ┌─────┬───┬───┬───┬───────────┬──────┬─────┬──────┬───┐\n     *    │index│iso│mar│cum│ programId │quota │used │ left │CPI│\n     *    ├─────┼───┼───┼───┼───────────┼──────┼─────┼──────┼───┤\n     *    │  0  │298│281│464│'ATokenG..'│200000│24270│175730│ 1 │\n     *    │  1  │298│ 74│538│'ATokenG..'│178730│21270│157460│ 1 │\n     *    │  2  │298│ 74│612│'ATokenG..'│157460│27277│130183│ 1 │\n     *    │  3  │298│ 42│686│'ATokenG..'│130183│21270│108913│ 1 │\n     *    │  4  │338│265│951│'qExampL..'│108913│76289│ 32624│ 3 │\n     *    └─────┴───┴───┴───┴───────────┴──────┴─────┴──────┴───┘\n     * ```\n     *\n     * - **index**: the array index of the instruction within the transaction\n     * - **iso**: the isolated size of the instruction (marginal cost of only the instruction)\n     * - **mar**: the marginal size cost of the instruction (when added to previous)\n     * - **cum**: the cumulative size of the instructions up until that instruction\n     * - **quota/used/left**: [BPF instruction compute unit info](https://docs.solana.com/developing/programming-model/runtime)\n     * - **CPI**: [the maximum depth of CPI](https://docs.solana.com/developing/programming-model/calling-between-programs) (current limit in Solana is 4)\n     *\n     * @param opts\n     * @returns\n     */\n    simulateTable(opts) {\n        return this.simulate(opts).then((simulation) => {\n            var _a;\n            if ((_a = simulation === null || simulation === void 0 ? void 0 : simulation.value) === null || _a === void 0 ? void 0 : _a.logs) {\n                (0, index_js_2.printTXTable)(this, simulation.value.logs, \"\");\n            }\n            return simulation;\n        });\n    }\n    /**\n     * Sends the transaction without confirming it.\n     * @param opts\n     * @returns\n     */\n    async send(opts) {\n        const signed = await this.provider.signer.sign(this.build(), this.signers, opts);\n        return this.provider.broadcaster.broadcast(signed, opts);\n    }\n    /**\n     * Sends the transaction and waits for confirmation.\n     * @param opts\n     */\n    async confirm(opts) {\n        return (await this.send(opts)).wait();\n    }\n    /**\n     * Combines the instructions/signers of the other envelope to create one large transaction.\n     */\n    combine(other) {\n        return new TransactionEnvelope(this.provider, [...this.instructions, ...other.instructions], [...this.signers, ...other.signers]);\n    }\n    /**\n     * Get a list of all writable accounts, deduped\n     * All of these accounts likely need to be updated after the transaction is confirmed.\n     */\n    get writableKeys() {\n        return [\n            ...new Set([\n                ...this.instructions\n                    .map((inst) => inst.keys.filter((key) => key.isWritable).map((k) => k.pubkey))\n                    .reduce((acc, el) => acc.concat(el)),\n            ]).values(),\n        ];\n    }\n    /**\n     * Gets the instructions in a format that can be serialized easily to JSON.\n     */\n    get instructionsJSON() {\n        return this.instructions.map((instruction) => ({\n            programId: instruction.programId.toString(),\n            keys: instruction.keys.map((m) => ({\n                isSigner: m.isSigner,\n                isWritable: m.isWritable,\n                publicKey: m.pubkey.toString(),\n            })),\n            data: instruction.data.toString(\"base64\"),\n        }));\n    }\n    /**\n     * Returns a string representation of the {@link TransactionEnvelope}.\n     */\n    get debugStr() {\n        return [\n            \"=> Instructions\",\n            this.instructions\n                .map((ser, i) => {\n                return [\n                    `Instruction ${i}: ${ser.programId.toString()}`,\n                    ...ser.keys.map((k, i) => `  [${i}] ${k.pubkey.toString()} ${k.isWritable ? \"(mut)\" : \"\"} ${k.isSigner ? \"(signer)\" : \"\"}`),\n                    `  Data (base64): ${ser.data.toString(\"base64\")}`,\n                ].join(\"\\n\");\n            })\n                .join(\"\\n\"),\n            \"=> Signers\",\n            this.signers.map((sg) => sg.publicKey.toString()).join(\"\\n\"),\n        ].join(\"\\n\");\n    }\n    /**\n     * Creates a new {@link TransactionEnvelope}.\n     * @param provider\n     * @param instructions\n     * @param signers\n     * @returns\n     */\n    static create(provider, instructions, signers = []) {\n        const ixs = instructions.filter((ix) => !!ix);\n        return new TransactionEnvelope(provider, ixs, signers);\n    }\n    /**\n     * Add a memo to each transaction envelope specified.\n     */\n    static addMemos(memo, ...txs) {\n        return txs.map((tx) => tx.addMemo(memo));\n    }\n    /**\n     * Combines multiple TransactionEnvelopes into one.\n     */\n    static combineAll(...txs) {\n        return txs.reduce((acc, tx) => acc.combine(tx));\n    }\n    /**\n     * Takes a list of {@link TransactionEnvelope}s and combines them if they\n     * are able to be combined under the maximum TX size limit.\n     *\n     * @param txs\n     * @returns\n     */\n    static pack(...txs) {\n        if (txs.length === 0) {\n            return [];\n        }\n        const [first, ...rest] = txs;\n        (0, tiny_invariant_1.default)(first);\n        const { provider } = first;\n        let lastTXEnv = first;\n        let lastEstimation = lastTXEnv.estimateSizeUnsafe();\n        const partition = [];\n        rest.forEach((addedTX, i) => {\n            if (lastEstimation > exports.PACKET_DATA_SIZE) {\n                throw new Error(`cannot construct a valid partition: instruction ${i} is too large (${lastEstimation} > ${exports.PACKET_DATA_SIZE})`);\n            }\n            const nextIXs = [...lastTXEnv.instructions, ...addedTX.instructions];\n            const nextSigners = filterRequiredSigners(nextIXs, [\n                ...lastTXEnv.signers,\n                ...addedTX.signers,\n            ]);\n            const nextTXEnv = new TransactionEnvelope(provider, nextIXs, nextSigners);\n            const nextEstimation = nextTXEnv.estimateSizeUnsafe();\n            // move to next tx envelope if too big\n            if (nextEstimation > exports.PACKET_DATA_SIZE) {\n                partition.push(lastTXEnv);\n                lastTXEnv = addedTX;\n                lastEstimation = lastTXEnv.estimateSizeUnsafe();\n            }\n            else {\n                lastTXEnv = nextTXEnv;\n                lastEstimation = nextEstimation;\n            }\n        });\n        partition.push(lastTXEnv);\n        return partition;\n    }\n    /**\n     * Combines multiple async TransactionEnvelopes into one, serially.\n     */\n    static async combineAllAsync(firstTX, ...txs) {\n        let acc = await firstTX;\n        for (const tx of txs) {\n            acc = acc.combine(await tx);\n        }\n        return acc;\n    }\n    /**\n     * Sends all of the envelopes.\n     * @returns Pending transactions\n     */\n    static async sendAll(txs, opts) {\n        const firstTX = txs[0];\n        if (!firstTX) {\n            return [];\n        }\n        const provider = firstTX.provider;\n        return await provider.sendAll(txs.map((tx) => ({ tx: tx.build(), signers: tx.signers })), opts);\n    }\n    /**\n     * Deduplicate ATA instructions inside the transaction envelope.\n     */\n    dedupeATAIXs() {\n        if (this.instructions.length === 0) {\n            return this;\n        }\n        const seenATAs = new Set();\n        const instructions = this.instructions\n            .map((ix) => {\n            var _a;\n            const programId = ix.programId;\n            if (programId.equals(ASSOCIATED_TOKEN_PROGRAM_ID)) {\n                const ataKey = (_a = ix.keys[1]) === null || _a === void 0 ? void 0 : _a.pubkey.toString();\n                if (!ataKey) {\n                    throw new Error(\"ATA key does not exist on ATA instruction\");\n                }\n                if (seenATAs.has(ataKey)) {\n                    return null;\n                }\n                seenATAs.add(ataKey);\n            }\n            return ix;\n        })\n            .filter((ix) => !!ix);\n        return new TransactionEnvelope(this.provider, instructions, this.signers);\n    }\n    /**\n     * Split out ATA instructions to a separate transaction envelope.\n     */\n    splitATAIXs() {\n        const ataIXs = new TransactionEnvelope(this.provider, [], this.signers);\n        const newTx = new TransactionEnvelope(this.provider, [], this.signers);\n        for (const ix of this.instructions) {\n            if (ix.programId.equals(ASSOCIATED_TOKEN_PROGRAM_ID)) {\n                ataIXs.instructions.push(ix);\n            }\n            else {\n                newTx.instructions.push(ix);\n            }\n        }\n        return {\n            ataIXs: ataIXs.dedupeATAIXs(),\n            tx: newTx,\n        };\n    }\n    /**\n     * Get an instruction from the transaction envelope by index.\n     */\n    getInstruction(index) {\n        const ix = this.instructions[index];\n        if (!ix) {\n            throw new Error(`No instruction found at index ${index}`);\n        }\n        return ix;\n    }\n    /**\n     * Attach a memo instruction to this transaction.\n     */\n    addMemo(memo) {\n        this.instructions.push((0, index_js_2.createMemoInstruction)(memo));\n        return this;\n    }\n    /**\n     * Request for additional compute units before processing this transaction.\n     */\n    addAdditionalComputeBudget(units, additionalFee) {\n        this.instructions.unshift((0, index_js_1.requestComputeUnitsInstruction)(units, additionalFee));\n        return this;\n    }\n    /**\n     * Request a specific transaction-wide program heap region size in bytes.\n     */\n    addAdditionalHeapFrame(bytes) {\n        this.instructions.unshift((0, index_js_1.requestHeapFrameInstruction)(bytes));\n        return this;\n    }\n}\nexports.TransactionEnvelope = TransactionEnvelope;\n//# sourceMappingURL=TransactionEnvelope.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TransactionReceipt = exports.confirmTransactionLike = void 0;\nconst tslib_1 = require(\"tslib\");\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst misc_js_1 = require(\"../utils/misc.js\");\nconst txLink_js_1 = require(\"../utils/txLink.js\");\nconst PendingTransaction_js_1 = require(\"./PendingTransaction.js\");\n/**\n * Confirms a transaction, returning its receipt.\n *\n * @param tx\n * @returns\n */\nconst confirmTransactionLike = async (tx) => {\n    const ish = await (0, misc_js_1.valueAsPromise)(tx);\n    if (ish instanceof TransactionReceipt) {\n        return ish;\n    }\n    let pending;\n    if (ish instanceof PendingTransaction_js_1.PendingTransaction) {\n        pending = ish;\n    }\n    else {\n        pending = await ish.send({\n            printLogs: false,\n        });\n    }\n    return await pending.wait();\n};\nexports.confirmTransactionLike = confirmTransactionLike;\n/**\n * A transaction that has been processed by the cluster.\n */\nclass TransactionReceipt {\n    constructor(\n    /**\n     * Signature (id) of the transaction.\n     */\n    signature, \n    /**\n     * Raw response from web3.js\n     */\n    response) {\n        this.signature = signature;\n        this.response = response;\n    }\n    /**\n     * Gets the events associated with this transaction.\n     */\n    getEvents(eventParser) {\n        var _a;\n        const logs = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages;\n        if (logs && logs.length > 0) {\n            return eventParser(logs);\n        }\n        return [];\n    }\n    /**\n     * Prints the logs associated with this transaction.\n     */\n    printLogs() {\n        var _a, _b;\n        console.log((_b = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages) === null || _b === void 0 ? void 0 : _b.join(\"\\n\"));\n    }\n    /**\n     * Gets the compute units used by the transaction.\n     * @returns\n     */\n    get computeUnits() {\n        var _a;\n        const logs = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages;\n        (0, tiny_invariant_1.default)(logs, \"no logs\");\n        const consumeLog = logs[logs.length - 2];\n        (0, tiny_invariant_1.default)(consumeLog, \"no consume log\");\n        const amtStr = consumeLog.split(\" \")[3];\n        (0, tiny_invariant_1.default)(amtStr, \"no amount\");\n        return parseInt(amtStr);\n    }\n    /**\n     * Generates a link to view this {@link TransactionReceipt} on the official Solana explorer.\n     * @param network\n     * @returns\n     */\n    generateSolanaExplorerLink(cluster = \"mainnet-beta\") {\n        return (0, txLink_js_1.generateTXLink)(this.signature, cluster);\n    }\n}\nexports.TransactionReceipt = TransactionReceipt;\n//# sourceMappingURL=TransactionReceipt.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./parseTransactionLogs.js\"), exports);\ntslib_1.__exportStar(require(\"./PendingTransaction.js\"), exports);\ntslib_1.__exportStar(require(\"./programErr.js\"), exports);\ntslib_1.__exportStar(require(\"./TransactionEnvelope.js\"), exports);\ntslib_1.__exportStar(require(\"./TransactionReceipt.js\"), exports);\ntslib_1.__exportStar(require(\"./utils.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n * Adapted from explorer.solana.com code written by @jstarry.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.formatInstructionLogs = exports.formatLogEntry = exports.parseTransactionLogs = void 0;\nconst tslib_1 = require(\"tslib\");\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst programErr_js_1 = require(\"./programErr.js\");\n/**\n * Stack-aware program log parser.\n * @param logs\n * @param error\n * @returns\n */\nconst parseTransactionLogs = (logs, error) => {\n    let depth = 0;\n    const prettyLogs = [];\n    let prettyError;\n    if (!logs) {\n        if (error)\n            throw new Error(JSON.stringify(error));\n        throw new Error(\"No logs detected\");\n    }\n    else if (error) {\n        prettyError = (0, programErr_js_1.getTransactionInstructionError)(error);\n    }\n    logs.forEach((log) => {\n        var _a, _b, _c, _d, _e;\n        if (log.startsWith(\"Program log:\")) {\n            (_a = prettyLogs[prettyLogs.length - 1]) === null || _a === void 0 ? void 0 : _a.logs.push({\n                type: \"text\",\n                depth,\n                text: log,\n            });\n        }\n        else {\n            const regex = /Program (\\w*) invoke \\[(\\d)\\]/g;\n            const matches = [...log.matchAll(regex)];\n            if (matches.length > 0) {\n                const programAddress = (_b = matches[0]) === null || _b === void 0 ? void 0 : _b[1];\n                (0, tiny_invariant_1.default)(programAddress, \"program address\");\n                if (depth === 0) {\n                    prettyLogs.push({\n                        programAddress,\n                        logs: [],\n                        failed: false,\n                    });\n                }\n                else {\n                    (_c = prettyLogs[prettyLogs.length - 1]) === null || _c === void 0 ? void 0 : _c.logs.push({\n                        type: \"cpi\",\n                        depth,\n                        programAddress: programAddress !== null && programAddress !== void 0 ? programAddress : null,\n                    });\n                }\n                depth++;\n            }\n            else if (log.includes(\"success\")) {\n                (_d = prettyLogs[prettyLogs.length - 1]) === null || _d === void 0 ? void 0 : _d.logs.push({\n                    type: \"success\",\n                    depth,\n                });\n                depth--;\n            }\n            else if (log.includes(\"failed\")) {\n                const instructionLog = prettyLogs[prettyLogs.length - 1];\n                if (instructionLog && !instructionLog.failed) {\n                    instructionLog.failed = true;\n                    instructionLog.logs.push({\n                        type: \"programError\",\n                        depth,\n                        text: log.slice(log.indexOf(\": \") + 2),\n                    });\n                }\n                depth--;\n            }\n            else {\n                if (depth === 0) {\n                    prettyLogs.push({\n                        logs: [],\n                        failed: false,\n                    });\n                    depth++;\n                }\n                // system transactions don't start with \"Program log:\"\n                (_e = prettyLogs[prettyLogs.length - 1]) === null || _e === void 0 ? void 0 : _e.logs.push({\n                    type: \"system\",\n                    depth,\n                    text: log,\n                });\n            }\n        }\n    });\n    // If the instruction's simulation returned an error without any logs then add an empty log entry for Runtime error\n    // For example BpfUpgradableLoader fails without returning any logs for Upgrade instruction with buffer that doesn't exist\n    if (prettyError && prettyLogs.length === 0) {\n        prettyLogs.push({\n            logs: [],\n            failed: true,\n        });\n    }\n    if (prettyError && prettyError.index === prettyLogs.length - 1) {\n        const failedIx = prettyLogs[prettyError.index];\n        if (failedIx) {\n            failedIx.failed = true;\n            failedIx.logs.push({\n                type: \"runtimeError\",\n                depth: 1,\n                text: prettyError.message,\n            });\n        }\n    }\n    return prettyLogs;\n};\nexports.parseTransactionLogs = parseTransactionLogs;\nconst buildPrefix = (depth) => {\n    const prefix = new Array(depth - 1).fill(\"\\u00A0\\u00A0\").join(\"\");\n    return prefix + \"> \";\n};\nconst formatLogEntryString = (entry) => {\n    switch (entry.type) {\n        case \"success\":\n            return `Program returned success`;\n        case \"programError\":\n            return `Program returned error: ${entry.text}`;\n        case \"runtimeError\":\n            return `Runtime error: ${entry.text}`;\n        case \"system\":\n            return entry.text;\n        case \"text\":\n            return entry.text;\n        case \"cpi\":\n            return `Invoking Unknown ${entry.programAddress ? `(${entry.programAddress}) ` : \"\"}Program`;\n    }\n};\n/**\n * Formats a log entry to be printed out.\n * @param entry\n * @param prefix\n * @returns\n */\nconst formatLogEntry = (entry, prefix = false) => {\n    const prefixString = prefix ? buildPrefix(entry.depth) : \"\";\n    return `${prefixString}${formatLogEntryString(entry)}`;\n};\nexports.formatLogEntry = formatLogEntry;\n/**\n * Formats instruction logs.\n * @param logs\n */\nconst formatInstructionLogs = (logs) => logs\n    .map((log, i) => {\n    return [\n        `=> Instruction #${i}: ${log.programAddress ? `Program ${log.programAddress}` : \"System\"}`,\n        ...log.logs.map((entry) => (0, exports.formatLogEntry)(entry, true)),\n    ].join(\"\\n\");\n})\n    .join(\"\\n\");\nexports.formatInstructionLogs = formatInstructionLogs;\n//# sourceMappingURL=parseTransactionLogs.js.map","\"use strict\";\n/**\n * Borrowed from explorer.solana.com code written by @jstarry.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getTransactionInstructionError = exports.BUILTIN_SOLANA_ERROR_MESSAGES = void 0;\n/**\n * Solana error messages built-in.\n */\nexports.BUILTIN_SOLANA_ERROR_MESSAGES = new Map([\n    [\"GenericError\", \"generic instruction error\"],\n    [\"InvalidArgument\", \"invalid program argument\"],\n    [\"InvalidInstructionData\", \"invalid instruction data\"],\n    [\"InvalidAccountData\", \"invalid account data for instruction\"],\n    [\"AccountDataTooSmall\", \"account data too small for instruction\"],\n    [\"InsufficientFunds\", \"insufficient funds for instruction\"],\n    [\"IncorrectProgramId\", \"incorrect program id for instruction\"],\n    [\"MissingRequiredSignature\", \"missing required signature for instruction\"],\n    [\n        \"AccountAlreadyInitialized\",\n        \"instruction requires an uninitialized account\",\n    ],\n    [\"UninitializedAccount\", \"instruction requires an initialized account\"],\n    [\n        \"UnbalancedInstruction\",\n        \"sum of account balances before and after instruction do not match\",\n    ],\n    [\"ModifiedProgramId\", \"instruction modified the program id of an account\"],\n    [\n        \"ExternalAccountLamportSpend\",\n        \"instruction spent from the balance of an account it does not own\",\n    ],\n    [\n        \"ExternalAccountDataModified\",\n        \"instruction modified data of an account it does not own\",\n    ],\n    [\n        \"ReadonlyLamportChange\",\n        \"instruction changed the balance of a read-only account\",\n    ],\n    [\"ReadonlyDataModified\", \"instruction modified data of a read-only account\"],\n    [\"DuplicateAccountIndex\", \"instruction contains duplicate accounts\"],\n    [\"ExecutableModified\", \"instruction changed executable bit of an account\"],\n    [\"RentEpochModified\", \"instruction modified rent epoch of an account\"],\n    [\"NotEnoughAccountKeys\", \"insufficient account keys for instruction\"],\n    [\"AccountDataSizeChanged\", \"non-system instruction changed account size\"],\n    [\"AccountNotExecutable\", \"instruction expected an executable account\"],\n    [\n        \"AccountBorrowFailed\",\n        \"instruction tries to borrow reference for an account which is already borrowed\",\n    ],\n    [\n        \"AccountBorrowOutstanding\",\n        \"instruction left account with an outstanding borrowed reference\",\n    ],\n    [\n        \"DuplicateAccountOutOfSync\",\n        \"instruction modifications of multiply-passed account differ\",\n    ],\n    [\"Custom\", \"custom program error: {0}\"],\n    [\"InvalidError\", \"program returned invalid error code\"],\n    [\"ExecutableDataModified\", \"instruction changed executable accounts data\"],\n    [\n        \"ExecutableLamportChange\",\n        \"instruction changed the balance of a executable account\",\n    ],\n    [\"ExecutableAccountNotRentExempt\", \"executable accounts must be rent exempt\"],\n    [\"UnsupportedProgramId\", \"Unsupported program id\"],\n    [\"CallDepth\", \"Cross-program invocation call depth too deep\"],\n    [\"MissingAccount\", \"An account required by the instruction is missing\"],\n    [\n        \"ReentrancyNotAllowed\",\n        \"Cross-program invocation reentrancy not allowed for this instruction\",\n    ],\n    [\n        \"MaxSeedLengthExceeded\",\n        \"Length of the seed is too long for address generation\",\n    ],\n    [\"InvalidSeeds\", \"Provided seeds do not result in a valid address\"],\n    [\"InvalidRealloc\", \"Failed to reallocate account data\"],\n    [\"ComputationalBudgetExceeded\", \"Computational budget exceeded\"],\n    [\n        \"PrivilegeEscalation\",\n        \"Cross-program invocation with unauthorized signer or writable account\",\n    ],\n    [\n        \"ProgramEnvironmentSetupFailure\",\n        \"Failed to create program execution environment\",\n    ],\n    [\"ProgramFailedToComplete\", \"Program failed to complete\"],\n    [\"ProgramFailedToCompile\", \"Program failed to compile\"],\n    [\"Immutable\", \"Account is immutable\"],\n    [\"IncorrectAuthority\", \"Incorrect authority provided\"],\n    [\"BorshIoError\", \"Failed to serialize or deserialize account data: {0}\"],\n    [\n        \"AccountNotRentExempt\",\n        \"An account does not have enough lamports to be rent-exempt\",\n    ],\n    [\"InvalidAccountOwner\", \"Invalid account owner\"],\n    [\"ArithmeticOverflow\", \"Program arithmetic overflowed\"],\n    [\"UnsupportedSysvar\", \"Unsupported sysvar\"],\n    [\"IllegalOwner\", \"Provided owner is not allowed\"],\n]);\nfunction getTransactionInstructionError(error) {\n    if (!error) {\n        return;\n    }\n    if (typeof error === \"object\" && \"InstructionError\" in error) {\n        const innerError = error[\"InstructionError\"];\n        const index = innerError[0];\n        const instructionError = innerError[1];\n        return {\n            index,\n            message: getInstructionError(instructionError),\n        };\n    }\n}\nexports.getTransactionInstructionError = getTransactionInstructionError;\nfunction getInstructionError(error) {\n    let out;\n    let value = null;\n    if (typeof error === \"string\") {\n        const message = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(error);\n        if (message) {\n            return message;\n        }\n    }\n    else if (\"Custom\" in error) {\n        out = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(\"Custom\");\n        value = error[\"Custom\"];\n    }\n    else if (\"BorshIoError\" in error) {\n        out = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(\"BorshIoError\");\n        value = error[\"BorshIoError\"];\n    }\n    if (out && value) {\n        return out.replace(\"{0}\", value);\n    }\n    return \"Unknown instruction error\";\n}\n//# sourceMappingURL=programErr.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.calculateTxSizeUnsafe = void 0;\nfunction shortvecEncodeLength(bytes, len) {\n    let rem_len = len;\n    for (;;) {\n        let elem = rem_len & 0x7f;\n        rem_len >>= 7;\n        if (rem_len === 0) {\n            bytes.push(elem);\n            break;\n        }\n        else {\n            elem |= 0x80;\n            bytes.push(elem);\n        }\n    }\n}\n/**\n * Calculates transaction size. If the transaction is too large, it does not throw.\n * @param tx\n * @returns\n */\nconst calculateTxSizeUnsafe = (tx) => {\n    // check if fee payer signed.\n    const { feePayer } = tx;\n    const hasFeePayerSigned = feePayer && tx.signatures.find((s) => s.publicKey.equals(feePayer));\n    const signData = tx.serializeMessage();\n    const numSigners = tx.signatures.length + (hasFeePayerSigned ? 1 : 0);\n    const signatureCount = [];\n    shortvecEncodeLength(signatureCount, numSigners);\n    return signatureCount.length + numSigners * 64 + signData.length;\n};\nexports.calculateTxSizeUnsafe = calculateTxSizeUnsafe;\n//# sourceMappingURL=txSizer.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.generateUncheckedInspectLink = exports.generateInspectLinkFromBase64 = exports.serializeToBase64Unchecked = exports.buildStubbedTransaction = exports.RECENT_BLOCKHASH_STUB = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\n/**\n * Stub of a recent blockhash that can be used to simulate transactions.\n */\nexports.RECENT_BLOCKHASH_STUB = \"GfVcyD4kkTrj4bKc7WA9sZCin9JDbdT4Zkd3EittNR1W\";\n/**\n * Builds a transaction with a fake `recentBlockhash` and `feePayer` for the purpose\n * of simulating a sequence of instructions.\n *\n * @param cluster\n * @param ixs\n * @returns\n */\nconst buildStubbedTransaction = (cluster, ixs) => {\n    const tx = new web3_js_1.Transaction();\n    tx.recentBlockhash = exports.RECENT_BLOCKHASH_STUB;\n    // random keys that always have money in them\n    tx.feePayer =\n        cluster === \"devnet\"\n            ? new web3_js_1.PublicKey(\"A2jaCHPzD6346348JoEym2KFGX9A7uRBw6AhCdX7gTWP\")\n            : new web3_js_1.PublicKey(\"9u9iZBWqGsp5hXBxkVZtBTuLSGNAG9gEQLgpuVw39ASg\");\n    tx.instructions = ixs;\n    return tx;\n};\nexports.buildStubbedTransaction = buildStubbedTransaction;\n/**\n * Serializes a {@link Transaction} to base64 format without checking signatures.\n * @param tx\n * @returns\n */\nconst serializeToBase64Unchecked = (tx) => tx\n    .serialize({\n    requireAllSignatures: false,\n    verifySignatures: false,\n})\n    .toString(\"base64\");\nexports.serializeToBase64Unchecked = serializeToBase64Unchecked;\n/**\n * Generates a link for inspecting the contents of a transaction.\n *\n * @returns URL\n */\nconst generateInspectLinkFromBase64 = (cluster, base64TX) => {\n    return `https://${cluster === \"mainnet-beta\" ? \"\" : `${cluster}.`}anchor.so/tx/inspector?message=${encodeURIComponent(base64TX)}`;\n};\nexports.generateInspectLinkFromBase64 = generateInspectLinkFromBase64;\n/**\n * Generates a link for inspecting the contents of a transaction, not checking for\n * or requiring valid signatures.\n *\n * @returns URL\n */\nconst generateUncheckedInspectLink = (cluster, tx) => {\n    return (0, exports.generateInspectLinkFromBase64)(cluster, (0, exports.serializeToBase64Unchecked)(tx));\n};\nexports.generateUncheckedInspectLink = generateUncheckedInspectLink;\n//# sourceMappingURL=utils.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./instructions.js\"), exports);\ntslib_1.__exportStar(require(\"./misc.js\"), exports);\ntslib_1.__exportStar(require(\"./printAccountOwners.js\"), exports);\ntslib_1.__exportStar(require(\"./printTXTable.js\"), exports);\ntslib_1.__exportStar(require(\"./pubkeyCache.js\"), exports);\ntslib_1.__exportStar(require(\"./publicKey.js\"), exports);\ntslib_1.__exportStar(require(\"./simulateTransactionWithCommitment.js\"), exports);\ntslib_1.__exportStar(require(\"./time.js\"), exports);\ntslib_1.__exportStar(require(\"./txLink.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createMemoInstruction = exports.MEMO_PROGRAM_ID = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\n/**\n * ID of the memo program.\n */\nexports.MEMO_PROGRAM_ID = new web3_js_1.PublicKey(\"MemoSq4gqABAXKb96qnH8TysNcWxMyWCqXgDLGmfcHr\");\n/**\n * Creates a memo program instruction.\n *\n * More info: https://spl.solana.com/memo\n *\n * @param text Text of the memo.\n * @param signers Optional signers to validate.\n * @returns\n */\nconst createMemoInstruction = (text, signers = []) => {\n    return new web3_js_1.TransactionInstruction({\n        programId: exports.MEMO_PROGRAM_ID,\n        keys: signers.map((s) => ({\n            pubkey: s,\n            isSigner: true,\n            isWritable: false,\n        })),\n        data: Buffer.from(text, \"utf8\"),\n    });\n};\nexports.createMemoInstruction = createMemoInstruction;\n//# sourceMappingURL=instructions.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.formatPubkeyShort = exports.valueAsPromise = exports.sleep = exports.suppressConsoleError = exports.suppressConsoleErrorAsync = void 0;\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"@saberhq/option-utils\"), exports);\nconst noop = () => {\n    // noop\n};\n/**\n * Hide the console.error because @solana/web3.js often emits noisy errors as a\n * side effect.\n */\nconst suppressConsoleErrorAsync = async (fn) => {\n    const oldConsoleError = console.error;\n    console.error = noop;\n    try {\n        const result = await fn();\n        console.error = oldConsoleError;\n        return result;\n    }\n    catch (e) {\n        console.error = oldConsoleError;\n        throw e;\n    }\n};\nexports.suppressConsoleErrorAsync = suppressConsoleErrorAsync;\n/**\n * Hide the console.error because @solana/web3.js often emits noisy errors as a\n * side effect.\n */\nconst suppressConsoleError = (fn) => {\n    const oldConsoleError = console.error;\n    console.error = noop;\n    try {\n        const result = fn();\n        console.error = oldConsoleError;\n        return result;\n    }\n    catch (e) {\n        console.error = oldConsoleError;\n        throw e;\n    }\n};\nexports.suppressConsoleError = suppressConsoleError;\nfunction sleep(ms) {\n    return new Promise((resolve) => setTimeout(resolve, ms));\n}\nexports.sleep = sleep;\n/**\n * Awaits for a promise or value.\n */\nconst valueAsPromise = async (awaitable) => {\n    if (\"then\" in awaitable) {\n        return await awaitable;\n    }\n    return awaitable;\n};\nexports.valueAsPromise = valueAsPromise;\n/**\n * Shortens a pubkey.\n * @param pubkey\n * @returns\n */\nconst formatPubkeyShort = (pubkey, leading = 7, trailing = 7) => {\n    const str = pubkey.toString();\n    return str.length > 20\n        ? `${str.substring(0, leading)}.....${str.substring(str.length - trailing, str.length)}`\n        : str;\n};\nexports.formatPubkeyShort = formatPubkeyShort;\n//# sourceMappingURL=misc.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.printAccountOwners = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\n/**\n * A useful tool for debugging account structs. It gives a quick glance at\n * addresses and owners. It also converts bignums into JS numbers.\n *\n * Types converted:\n * - **big numbers**: converted to native numbers\n * - **addresses**: format in base58, and prints the owner in parentheses if the account exists\n * - **plain objects**: recursively converts\n *\n * HINT: This function is mainly useful for the browser. If you are writing\n * Rust integration tests, use debugAccountOwners from chai-solana instead, so\n * that you don't have to pass in connection.\n *\n * Usage:\n * ```\n * await printAccountOwners(connection, depositAccounts);\n * // using void is recommend in dapps to avoid slowing down the user experience\n * void printAccountOwners(connection, depositAccounts);\n * ```\n *\n * Example output:\n * ```\n * tests/awesomeTest.spec.ts:583:29 {\n *   payer: 'CEGhKVeyXUrihUnNU9EchSuu6pMHEsB8MiKgvhJqYgd1 (11111111111111111111111111111111)',\n *   foo: '61tMNVhG66QZQ4UEAoHytqaUN4G1xpk1zsS5YU7Y2Qui (135QzSyjKTKaZ7ebhLpvNA2KUahEjykMjbqz3JV1V4k9)',\n *   bar: '9oPMxXVSm5msAecxi4zJpKDwbHS9c6Yos1ru739rVExc (TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA)',\n *   tokenProgram: 'TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA (BPFLoader2111111111111111111111111111111111)'\n * }\n * ```\n *\n * WARNING: This may break silently if web3 changes its api. This is only\n * intended for debugging purposes only. But it should be safe to use in production.\n */\nasync function printAccountOwners(connection, plainObj) {\n    var _a, _b;\n    try {\n        if (typeof plainObj !== \"object\") {\n            throw new Error(\"printAccountOwners only works on objects\");\n        }\n        else {\n            let relativePath;\n            const callStack = (_a = new Error().stack) === null || _a === void 0 ? void 0 : _a.split(\"\\n\");\n            if (callStack) {\n                let expectIndex = callStack.findIndex((l) => l.includes(`at ${printAccountOwners.name}`));\n                // debugAccountOwners in chai-solana wraps printAccountOwners\n                // We need to get the caller of debugAccountOwners instead\n                const debugAccountOwnersIndex = callStack.findIndex((l) => l.includes(`at debugAccountOwners`));\n                if (debugAccountOwnersIndex > expectIndex) {\n                    expectIndex = debugAccountOwnersIndex;\n                }\n                // Only log the line number in Node.js\n                if (expectIndex > 0 &&\n                    typeof process !== \"undefined\" &&\n                    process.versions !== undefined &&\n                    process.versions.node !== undefined) {\n                    const maybeProcess = process;\n                    const targetLine = callStack[expectIndex + 1];\n                    if (targetLine) {\n                        const cwd = ((_b = maybeProcess.cwd) === null || _b === void 0 ? void 0 : _b.call(maybeProcess)) || \"/\";\n                        // get the part of targetLine after cwd\n                        const targetLineAfterCwd = targetLine.substring(targetLine.indexOf(cwd) + cwd.length);\n                        if (targetLineAfterCwd.length > 0) {\n                            relativePath = targetLineAfterCwd.substring(1).replace(/\\)$/, \"\");\n                        }\n                    }\n                }\n            }\n            if (!connection) {\n                return;\n            }\n            if (relativePath) {\n                console.log(relativePath, await _transformAccountOwners(plainObj, connection));\n            }\n            else {\n                console.log(await _transformAccountOwners(plainObj, connection));\n            }\n        }\n    }\n    catch (e) {\n        console.error(\"Error in printAccountOwners:\", e);\n    }\n}\nexports.printAccountOwners = printAccountOwners;\n/**\n * This is a patched version of web3's getMultipleAccountsInfo.\n *\n * When it reaches an account that doesn't exist, it will just continue instead\n * of giving up.\n *\n * WARNING: This may break silently if web3 changes its api. This is only\n * intended for debugging purposes only.\n */\nasync function gracefulGetMultipleAccountsInfo(connection, publicKeys) {\n    var _a;\n    try {\n        // To be honest, the web3 internals aren't going to change that much. And if\n        // they do, it'll be rare.\n        const unknownConection = connection;\n        const rpcRequest = unknownConection._rpcRequest;\n        if (typeof rpcRequest !== \"function\") {\n            console.error(\"_rpcRequest is not a function. Maybe web3 changed?\");\n            return [];\n        }\n        const unsafeRes = await rpcRequest(\"getMultipleAccounts\", [\n            publicKeys.map((key) => key.toBase58()),\n            { encoding: \"base64\", commitment: \"confirmed\" },\n        ]);\n        const value = (_a = unsafeRes === null || unsafeRes === void 0 ? void 0 : unsafeRes.result) === null || _a === void 0 ? void 0 : _a.value;\n        if (value) {\n            return value;\n        }\n        return [];\n    }\n    catch (e) {\n        console.error(\"Error in gracefulGetMultipleAccountsInfo:\", e);\n        return [];\n    }\n}\n/**\n * Lots of complexity in this function. But using getMultipleAccountsInfo is\n * very important. Even locally, it reduces the time from 300ms to 40ms. On a\n * remote RPC server, it would probably save much more time.\n */\nconst _transformAccountOwners = async (plainObjWithAddressesAndBignums, connection) => {\n    /* eslint-disable */\n    const result = {};\n    if (!plainObjWithAddressesAndBignums ||\n        typeof plainObjWithAddressesAndBignums !== \"object\") {\n        return plainObjWithAddressesAndBignums;\n    }\n    const base58ToResultKey = {};\n    const base58ToLookup = [];\n    const asyncKeys = [];\n    const asyncPromises = [];\n    for (const [key, value] of Object.entries(plainObjWithAddressesAndBignums)) {\n        if (value && value.toBase58 && typeof value.toBase58 === \"function\") {\n            const base58 = value.toBase58();\n            base58ToResultKey[base58] = key;\n            const pubKey = new web3_js_1.PublicKey(base58);\n            if (!base58ToLookup.includes(pubKey)) {\n                base58ToLookup.push(pubKey);\n            }\n        }\n        else if (value &&\n            value.toNumber &&\n            typeof value.toNumber === \"function\") {\n            result[key] = value.toNumber();\n        }\n        else if (isPlainObject(value) && value) {\n            asyncKeys.push(key);\n            asyncPromises.push(_transformAccountOwners(value, connection));\n        }\n        else {\n            result[key] = value;\n        }\n    }\n    if (Object.keys(base58ToResultKey).length > 0) {\n        const accountInfos = await gracefulGetMultipleAccountsInfo(connection, base58ToLookup);\n        for (const [base58, resultKey] of Object.entries(base58ToResultKey)) {\n            const lookupIndex = base58ToLookup.findIndex((p) => p.toBase58() === base58);\n            if (lookupIndex >= 0) {\n                const accountInfo = accountInfos[lookupIndex];\n                const owner = accountInfo === null || accountInfo === void 0 ? void 0 : accountInfo.owner;\n                if (owner) {\n                    result[resultKey] = `${base58} (${owner})`;\n                    // Uncomment to verify that this implementation is correct\n                    // const accountInfo =\n                    //   await connection.getAccountInfo(\n                    //     new PublicKey(base58)\n                    //   );\n                    // const correctOwner = accountInfo?.owner; // we know for sure this works\n                    // if (!correctOwner) {\n                    //   throw new Error(\"Unable to load correct owner\");\n                    // }\n                    // if (!new PublicKey(owner).equals(correctOwner)) {\n                    //   console.log(\"OWNER MISMATCH\", base58, owner, accountInfo?.owner);\n                    //   throw new Error(\"OWNER MISMATCH\");\n                    // }\n                }\n                else {\n                    result[resultKey] = `${base58}`;\n                }\n            }\n            else {\n                result[resultKey] = `${base58}`;\n            }\n        }\n    }\n    const asyncValues = await Promise.all(asyncPromises);\n    for (let i = 0; i < asyncKeys.length; i++) {\n        result[asyncKeys[i]] = asyncValues[i];\n    }\n    return result;\n};\nfunction isPlainObject(obj) {\n    /* eslint-disable */\n    return (typeof obj === \"object\" && // separate from primitives\n        obj !== null && // is obvious\n        obj.constructor === Object && // separate instances (Array, DOM, ...)\n        Object.prototype.toString.call(obj) === \"[object Object]\"); // separate build-in like Math\n}\n//# sourceMappingURL=printAccountOwners.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.estimateTransactionSize = exports.EstimatedTXTooBigError = exports.TXSizeEstimationError = exports.printTXTable = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst index_js_1 = require(\"../index.js\");\n/**\n * Takes in a simulation result of a transaction and prints it in a cool table.\n * ```\n *    ┌─────┬───┬───┬───┬───────────┬──────┬─────┬──────┬───┐\n *    │index│iso│mar│cum│ programId │quota │used │ left │CPI│\n *    ├─────┼───┼───┼───┼───────────┼──────┼─────┼──────┼───┤\n *    │  0  │298│281│464│'ATokenG..'│200000│24270│175730│ 1 │\n *    │  1  │298│ 74│538│'ATokenG..'│178730│21270│157460│ 1 │\n *    │  2  │298│ 74│612│'ATokenG..'│157460│27277│130183│ 1 │\n *    │  3  │298│ 42│686│'ATokenG..'│130183│21270│108913│ 1 │\n *    │  4  │338│265│951│'qExampL..'│108913│76289│ 32624│ 3 │\n *    └─────┴───┴───┴───┴───────────┴──────┴─────┴──────┴───┘\n * ```\n *\n * - **index**: the array index of the instruction within the transaction\n * - **iso**: the isolated size of the instruction (marginal cost of only the instruction)\n * - **mar**: the marginal size cost of the instruction (when added to previous)\n * - **cum**: the cumulative size of the instructions up until that instruction\n * - **quota/used/left**: [BPF instruction compute unit info](https://docs.solana.com/developing/programming-model/runtime)\n * - **CPI**: [the maximum depth of CPI](https://docs.solana.com/developing/programming-model/calling-between-programs) (current limit in Solana is 4)\n *\n * Safe for browser usage. Can be conveniently run with txEnvelope.simulateTable()\n */\nconst printTXTable = (tx, transactionLogs, message) => {\n    if (message && message !== \"\") {\n        console.log((0, exports.estimateTransactionSize)(tx), message);\n    }\n    else {\n        console.log(\"Transaction size:\", (0, exports.estimateTransactionSize)(tx));\n    }\n    const computeUnitLogStack = [];\n    const cpiLogStack = [];\n    let currentIndex = -1;\n    transactionLogs.forEach((line) => {\n        if (line.includes(\" invoke [1]\")) {\n            currentIndex++;\n            cpiLogStack[currentIndex] = 0;\n        }\n        const cpiMatch = line.match(/ invoke \\[(\\d)\\]/);\n        if (cpiMatch && cpiMatch[1]) {\n            const cur = cpiLogStack[currentIndex];\n            cpiLogStack[currentIndex] =\n                cur === undefined\n                    ? Number(cpiMatch[1]) - 1\n                    : Math.max(Number(cpiMatch[1]) - 1, cur);\n        }\n        const computeMatch = line.match(/consumed \\d* of \\d* compute units/);\n        if (computeMatch && computeMatch[0]) {\n            computeUnitLogStack[currentIndex] = computeMatch[0];\n        }\n    });\n    const instructionTable = [];\n    tx.instructions.forEach((instruction, i) => {\n        const computeUnitLog = computeUnitLogStack[i];\n        const computeUnitMatch = computeUnitLog === null || computeUnitLog === void 0 ? void 0 : computeUnitLog.match(/consumed (\\d*) of (\\d*)/);\n        const [consumed, quota] = (computeUnitMatch === null || computeUnitMatch === void 0 ? void 0 : computeUnitMatch.slice(1, 3).map((num) => parseInt(num, 10))) || [undefined, undefined];\n        instructionTable.push({\n            iso: isolatedInstructionSize(tx.provider, instruction),\n            mar: marginalInstructionSize(tx.provider, tx.instructions.slice(0, i), instruction),\n            cum: instructionsSize(tx.provider, tx.instructions.slice(0, i + 1)),\n            programId: instruction.programId.toBase58(),\n            quota: quota ? quota : i === 0 ? 200000 : undefined,\n            used: consumed,\n            left: quota && consumed ? quota - consumed : undefined,\n            CPI: cpiLogStack[i],\n        });\n    });\n    console.table(instructionTable);\n};\nexports.printTXTable = printTXTable;\nclass TXSizeEstimationError extends Error {\n    constructor(underlyingError) {\n        super(`could not estimate transaction size`);\n        this.underlyingError = underlyingError;\n        this.name = \"TXSizeEstimationError\";\n    }\n}\nexports.TXSizeEstimationError = TXSizeEstimationError;\nclass EstimatedTXTooBigError extends Error {\n    constructor(tx, size) {\n        super(`Transaction too large`);\n        this.tx = tx;\n        this.size = size;\n        this.name = \"EstimatedTXTooBigError\";\n    }\n}\nexports.EstimatedTXTooBigError = EstimatedTXTooBigError;\n/**\n * Builds a transaction and estimates the size in bytes. This number is primrily\n * to be used for checking to see if a transaction is too big and instructions\n * need to be split. It may not be 100% accurate.\n *\n * This is used in expectTXTable and is useful for increasing efficiency in\n * dapps that build large transactions.\n *\n * The max transaction size of a v1 Transaction in Solana is 1232 bytes.\n * For info about Transaction v2: https://docs.solana.com/proposals/transactions-v2\n *\n * Returns 8888 if the transaction was too big.\n * Returns 9999 if the transaction was unable to be built.\n */\nconst estimateTransactionSize = (txEnvelope) => {\n    const result = txEnvelope.estimateSize();\n    if (\"size\" in result) {\n        return result.size;\n    }\n    if (result.error instanceof TXSizeEstimationError) {\n        console.error(\"Unknown error estimating transaction size\", result.error.underlyingError);\n        return 9999;\n    }\n    return 8888;\n};\nexports.estimateTransactionSize = estimateTransactionSize;\n/**\n * A dummy instruction that is probably tiny and has overlap with most instructions\n */\nconst simpleInstruction = () => {\n    const fs = getFakeSigner();\n    return web3_js_1.SystemProgram.transfer({\n        fromPubkey: fs.publicKey,\n        toPubkey: fs.publicKey,\n        lamports: 1,\n    });\n};\nconst isolatedInstructionSize = (randomProvider, instruction) => {\n    return marginalInstructionSize(randomProvider, [simpleInstruction()], instruction);\n};\nconst marginalInstructionSize = (randomProvider, previousInstructions, instruction) => {\n    const previousTxSize = instructionsSize(randomProvider, previousInstructions.length ? previousInstructions : [simpleInstruction()]);\n    const biggerTxSize = instructionsSize(randomProvider, [\n        ...previousInstructions,\n        instruction,\n    ]);\n    return biggerTxSize - previousTxSize;\n};\nconst instructionsSize = (randomProvider, instructions) => {\n    const instructionedTx = new index_js_1.TransactionEnvelope(randomProvider, [\n        ...instructions,\n    ]);\n    return (0, exports.estimateTransactionSize)(instructionedTx);\n};\nlet fakeSigner = undefined;\nconst getFakeSigner = () => {\n    if (!fakeSigner) {\n        fakeSigner = web3_js_1.Keypair.generate();\n    }\n    return fakeSigner;\n};\n//# sourceMappingURL=printTXTable.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getProgramAddress = exports.getPublicKey = exports.CachedPublicKey = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst pubkeyCache = {};\n/**\n * PublicKey with a cached base58 value.\n */\nclass CachedPublicKey extends web3_js_1.PublicKey {\n    constructor(value) {\n        super(value);\n        this._base58 = super.toBase58();\n    }\n    equals(other) {\n        if (other instanceof CachedPublicKey) {\n            return other._base58 === this._base58;\n        }\n        return super.equals(other);\n    }\n    toString() {\n        return this._base58;\n    }\n    toBase58() {\n        return this._base58;\n    }\n}\nexports.CachedPublicKey = CachedPublicKey;\nconst getOrCreatePublicKey = (pk) => {\n    const cached = pubkeyCache[pk];\n    if (!cached) {\n        return (pubkeyCache[pk] = new CachedPublicKey(pk));\n    }\n    return cached;\n};\n/**\n * Gets or parses a PublicKey.\n * @param pk\n * @returns\n */\nconst getPublicKey = (pk) => {\n    if (typeof pk === \"string\") {\n        return getOrCreatePublicKey(pk);\n    }\n    else if (pk instanceof web3_js_1.PublicKey) {\n        return getOrCreatePublicKey(pk.toString());\n    }\n    else {\n        return getOrCreatePublicKey(new web3_js_1.PublicKey(pk).toString());\n    }\n};\nexports.getPublicKey = getPublicKey;\nconst gpaCache = {};\n/**\n * Concatenates seeds to generate a unique number array.\n * @param seeds\n * @returns\n */\nconst concatSeeds = (seeds) => {\n    return Uint8Array.from(seeds.reduce((acc, seed) => [...acc, ...seed], []));\n};\n/**\n * Gets a cached program address for the given seeds.\n * @param seeds\n * @param programId\n * @returns\n */\nconst getProgramAddress = (seeds, programId) => {\n    const normalizedSeeds = concatSeeds(seeds);\n    const cacheKey = `${normalizedSeeds.toString()}_${programId.toString()}`;\n    const cached = gpaCache[cacheKey];\n    if (cached) {\n        return cached;\n    }\n    const [key] = web3_js_1.PublicKey.findProgramAddressSync(seeds, programId);\n    return (gpaCache[cacheKey] = (0, exports.getPublicKey)(key));\n};\nexports.getProgramAddress = getProgramAddress;\n//# sourceMappingURL=pubkeyCache.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isPublicKey = exports.parsePublicKey = exports.PublicKey = void 0;\nconst tslib_1 = require(\"tslib\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = tslib_1.__importDefault(require(\"bn.js\"));\nvar web3_js_2 = require(\"@solana/web3.js\");\nObject.defineProperty(exports, \"PublicKey\", { enumerable: true, get: function () { return web3_js_2.PublicKey; } });\n/**\n * Returns a {@link PublicKey} if it can be parsed, otherwise returns null.\n * @param pk\n * @returns\n */\nconst parsePublicKey = (pk) => {\n    if (!pk) {\n        return null;\n    }\n    if (pk instanceof web3_js_1.PublicKey) {\n        return pk;\n    }\n    if (typeof pk !== \"object\" ||\n        Array.isArray(pk) ||\n        (\"constructor\" in pk && bn_js_1.default.isBN(pk))) {\n        return null;\n    }\n    try {\n        return new web3_js_1.PublicKey(pk);\n    }\n    catch (e) {\n        return null;\n    }\n};\nexports.parsePublicKey = parsePublicKey;\n/**\n * Returns true if the given value is a {@link PublicKey}.\n * @param pk\n * @returns\n */\nconst isPublicKey = (pk) => {\n    return !!(0, exports.parsePublicKey)(pk);\n};\nexports.isPublicKey = isPublicKey;\n//# sourceMappingURL=publicKey.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.simulateTransactionWithCommitment = void 0;\nconst web3_js_1 = require(\"@solana/web3.js\");\n/**\n * Copy of Connection.simulateTransaction that takes a commitment parameter.\n */\nasync function simulateTransactionWithCommitment(connection, transaction, commitment = \"confirmed\") {\n    var _a;\n    const connectionInner = connection;\n    // only populate recent blockhash if it isn't on the tx\n    if (!transaction.recentBlockhash) {\n        const { blockhash } = await connection.getLatestBlockhash(commitment);\n        transaction.recentBlockhash = blockhash;\n    }\n    const wireTransaction = transaction.serialize({\n        requireAllSignatures: false,\n    });\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = { encoding: \"base64\", commitment };\n    const res = await connectionInner._rpcRequest(\"simulateTransaction\", [\n        encodedTransaction,\n        config,\n    ]);\n    if (res.error) {\n        throw new web3_js_1.SendTransactionError(\"failed to simulate transaction: \" + res.error.message, (_a = res.result.value.logs) !== null && _a !== void 0 ? _a : undefined);\n    }\n    return res.result;\n}\nexports.simulateTransactionWithCommitment = simulateTransactionWithCommitment;\n//# sourceMappingURL=simulateTransactionWithCommitment.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.tsToDate = exports.dateToTs = void 0;\nconst tslib_1 = require(\"tslib\");\nconst bn_js_1 = tslib_1.__importDefault(require(\"bn.js\"));\n/**\n * Converts a {@link Date} to a {@link BN} timestamp.\n * @param date\n * @returns\n */\nconst dateToTs = (date) => new bn_js_1.default(Math.floor(date.getTime() / 1000));\nexports.dateToTs = dateToTs;\n/**\n * Converts a {@link BN} timestamp to a {@link Date}.\n * @param ts\n * @returns\n */\nconst tsToDate = (ts) => new Date(ts.toNumber() * 1000);\nexports.tsToDate = tsToDate;\n//# sourceMappingURL=time.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.generateTXLink = exports.ExplorerType = void 0;\nvar ExplorerType;\n(function (ExplorerType) {\n    ExplorerType[\"SOLANA_EXPLORER\"] = \"solana-explorer\";\n    ExplorerType[\"SOLSCAN\"] = \"solscan\";\n})(ExplorerType || (exports.ExplorerType = ExplorerType = {}));\nfunction generateTXLink(signature, cluster = \"mainnet-beta\", explorerType = ExplorerType.SOLANA_EXPLORER) {\n    switch (explorerType) {\n        case ExplorerType.SOLANA_EXPLORER:\n            return `https://explorer.solana.com/tx/${signature}?cluster=${cluster}`;\n        case ExplorerType.SOLSCAN:\n            return `https://solscan.io/tx/${signature}?cluster=${cluster}`;\n        default:\n            throw new Error(`Explorer type ${explorerType} is not supported.`);\n    }\n}\nexports.generateTXLink = generateTXLink;\n//# sourceMappingURL=txLink.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SignerWallet = void 0;\nconst provider_js_1 = require(\"./provider.js\");\n/**\n * Wallet based on a Signer.\n */\nclass SignerWallet {\n    constructor(signer) {\n        this.signer = signer;\n    }\n    get publicKey() {\n        return this.signer.publicKey;\n    }\n    signAllTransactions(transactions) {\n        return Promise.resolve(transactions.map((tx) => {\n            tx.partialSign(this.signer);\n            return tx;\n        }));\n    }\n    signTransaction(transaction) {\n        transaction.partialSign(this.signer);\n        return Promise.resolve(transaction);\n    }\n    /**\n     * Creates a Provider from this Wallet by adding a Connection.\n     * @param connection\n     * @returns\n     */\n    createProvider(connection, sendConnection, opts) {\n        return provider_js_1.SolanaProvider.load({\n            connection,\n            sendConnection,\n            wallet: this,\n            opts,\n        });\n    }\n}\nexports.SignerWallet = SignerWallet;\n//# sourceMappingURL=wallet.js.map","/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n/**\n * Support for translating between Uint8Array instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n *   format} with {@link module:Layout.u8|8-bit}, {@link\n *   module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n *   {@link module:Layout.u32|32-bit}, {@link\n *   module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n *   format} with {@link module:Layout.u16be|16-bit}, {@link\n *   module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n *   {@link module:Layout.u40be|40-bit}, and {@link\n *   module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n *   format} with {@link module:Layout.s8|8-bit}, {@link\n *   module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n *   {@link module:Layout.s32|32-bit}, {@link\n *   module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n *   with {@link module:Layout.s16be|16-bit}, {@link\n *   module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n *   {@link module:Layout.s40be|40-bit}, and {@link\n *   module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n *   less than 2^53) or nearby integral Number in {@link\n *   module:Layout.nu64|unsigned little-endian}, {@link\n *   module:Layout.nu64be|unsigned big-endian}, {@link\n *   module:Layout.ns64|signed little-endian}, and {@link\n *   module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n *   module:Layout.f32|little-endian} and {@link\n *   module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n *   module:Layout.f64|little-endian} and {@link\n *   module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n *   encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n *   module:Layout~Layout|Layout}, with JavaScript representation as\n *   an Array and constant or data-dependent {@link\n *   module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n *   heterogeneous sequence of {@link module:Layout~Layout|Layout}\n *   instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n *   module:Layout~VariantLayout|variant layouts} over a fixed\n *   (padded) or variable (not padded) span of bytes, using an\n *   unsigned integer at the start of the data or a separate {@link\n *   module:Layout.unionLayoutDiscriminator|layout element} to\n *   determine which layout to use when interpreting the buffer\n *   contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n *   of individual {@link\n *   module:Layout~BitStructure#addField|BitField}s packed into an 8,\n *   16, 24, or 32-bit unsigned integer starting at the least- or\n *   most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n *   module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.s16 = exports.s8 = exports.nu64be = exports.u48be = exports.u40be = exports.u32be = exports.u24be = exports.u16be = exports.nu64 = exports.u48 = exports.u40 = exports.u32 = exports.u24 = exports.u16 = exports.u8 = exports.offset = exports.greedy = exports.Constant = exports.UTF8 = exports.CString = exports.Blob = exports.Boolean = exports.BitField = exports.BitStructure = exports.VariantLayout = exports.Union = exports.UnionLayoutDiscriminator = exports.UnionDiscriminator = exports.Structure = exports.Sequence = exports.DoubleBE = exports.Double = exports.FloatBE = exports.Float = exports.NearInt64BE = exports.NearInt64 = exports.NearUInt64BE = exports.NearUInt64 = exports.IntBE = exports.Int = exports.UIntBE = exports.UInt = exports.OffsetLayout = exports.GreedyCount = exports.ExternalLayout = exports.bindConstructorLayout = exports.nameWithProperty = exports.Layout = exports.uint8ArrayToBuffer = exports.checkUint8Array = void 0;\nexports.constant = exports.utf8 = exports.cstr = exports.blob = exports.unionLayoutDiscriminator = exports.union = exports.seq = exports.bits = exports.struct = exports.f64be = exports.f64 = exports.f32be = exports.f32 = exports.ns64be = exports.s48be = exports.s40be = exports.s32be = exports.s24be = exports.s16be = exports.ns64 = exports.s48 = exports.s40 = exports.s32 = exports.s24 = void 0;\nconst buffer_1 = require(\"buffer\");\n/* Check if a value is a Uint8Array.\n *\n * @ignore */\nfunction checkUint8Array(b) {\n    if (!(b instanceof Uint8Array)) {\n        throw new TypeError('b must be a Uint8Array');\n    }\n}\nexports.checkUint8Array = checkUint8Array;\n/* Create a Buffer instance from a Uint8Array.\n *\n * @ignore */\nfunction uint8ArrayToBuffer(b) {\n    checkUint8Array(b);\n    return buffer_1.Buffer.from(b.buffer, b.byteOffset, b.length);\n}\nexports.uint8ArrayToBuffer = uint8ArrayToBuffer;\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n    constructor(span, property) {\n        if (!Number.isInteger(span)) {\n            throw new TypeError('span must be an integer');\n        }\n        /** The span of the layout in bytes.\n         *\n         * Positive values are generally expected.\n         *\n         * Zero will only appear in {@link Constant}s and in {@link\n         * Sequence}s where the {@link Sequence#count|count} is zero.\n         *\n         * A negative value indicates that the span is value-specific, and\n         * must be obtained using {@link Layout#getSpan|getSpan}. */\n        this.span = span;\n        /** The property name used when this layout is represented in an\n         * Object.\n         *\n         * Used only for layouts that {@link Layout#decode|decode} to Object\n         * instances.  If left undefined the span of the unnamed layout will\n         * be treated as padding: it will not be mutated by {@link\n         * Layout#encode|encode} nor represented as a property in the\n         * decoded Object. */\n        this.property = property;\n    }\n    /** Function to create an Object into which decoded properties will\n     * be written.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances, which means:\n     * * {@link Structure}\n     * * {@link Union}\n     * * {@link VariantLayout}\n     * * {@link BitStructure}\n     *\n     * If left undefined the JavaScript representation of these layouts\n     * will be Object instances.\n     *\n     * See {@link bindConstructorLayout}.\n     */\n    makeDestinationObject() {\n        return {};\n    }\n    /**\n     * Calculate the span of a specific instance of a layout.\n     *\n     * @param {Uint8Array} b - the buffer that contains an encoded instance.\n     *\n     * @param {Number} [offset] - the offset at which the encoded instance\n     * starts.  If absent a zero offset is inferred.\n     *\n     * @return {Number} - the number of bytes covered by the layout\n     * instance.  If this method is not overridden in a subclass the\n     * definition-time constant {@link Layout#span|span} will be\n     * returned.\n     *\n     * @throws {RangeError} - if the length of the value cannot be\n     * determined.\n     */\n    getSpan(b, offset) {\n        if (0 > this.span) {\n            throw new RangeError('indeterminate span');\n        }\n        return this.span;\n    }\n    /**\n     * Replicate the layout using a new property.\n     *\n     * This function must be used to get a structurally-equivalent layout\n     * with a different name since all {@link Layout} instances are\n     * immutable.\n     *\n     * **NOTE** This is a shallow copy.  All fields except {@link\n     * Layout#property|property} are strictly equal to the origin layout.\n     *\n     * @param {String} property - the value for {@link\n     * Layout#property|property} in the replica.\n     *\n     * @returns {Layout} - the copy with {@link Layout#property|property}\n     * set to `property`.\n     */\n    replicate(property) {\n        const rv = Object.create(this.constructor.prototype);\n        Object.assign(rv, this);\n        rv.property = property;\n        return rv;\n    }\n    /**\n     * Create an object from layout properties and an array of values.\n     *\n     * **NOTE** This function returns `undefined` if invoked on a layout\n     * that does not return its value as an Object.  Objects are\n     * returned for things that are a {@link Structure}, which includes\n     * {@link VariantLayout|variant layouts} if they are structures, and\n     * excludes {@link Union}s.  If you want this feature for a union\n     * you must use {@link Union.getVariant|getVariant} to select the\n     * desired layout.\n     *\n     * @param {Array} values - an array of values that correspond to the\n     * default order for properties.  As with {@link Layout#decode|decode}\n     * layout elements that have no property name are skipped when\n     * iterating over the array values.  Only the top-level properties are\n     * assigned; arguments are not assigned to properties of contained\n     * layouts.  Any unused values are ignored.\n     *\n     * @return {(Object|undefined)}\n     */\n    fromArray(values) {\n        return undefined;\n    }\n}\nexports.Layout = Layout;\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n    if (lo.property) {\n        return name + '[' + lo.property + ']';\n    }\n    return name;\n}\nexports.nameWithProperty = nameWithProperty;\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\n// `Class` must be a constructor Function, but the assignment of a `layout_` property to it makes it difficult to type\n// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\nfunction bindConstructorLayout(Class, layout) {\n    if ('function' !== typeof Class) {\n        throw new TypeError('Class must be constructor');\n    }\n    if (Object.prototype.hasOwnProperty.call(Class, 'layout_')) {\n        throw new Error('Class is already bound to a layout');\n    }\n    if (!(layout && (layout instanceof Layout))) {\n        throw new TypeError('layout must be a Layout');\n    }\n    if (Object.prototype.hasOwnProperty.call(layout, 'boundConstructor_')) {\n        throw new Error('layout is already bound to a constructor');\n    }\n    Class.layout_ = layout;\n    layout.boundConstructor_ = Class;\n    layout.makeDestinationObject = (() => new Class());\n    Object.defineProperty(Class.prototype, 'encode', {\n        value(b, offset) {\n            return layout.encode(this, b, offset);\n        },\n        writable: true,\n    });\n    Object.defineProperty(Class, 'decode', {\n        value(b, offset) {\n            return layout.decode(b, offset);\n        },\n        writable: true,\n    });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n    /**\n     * Return `true` iff the external layout decodes to an unsigned\n     * integer layout.\n     *\n     * In that case it can be used as the source of {@link\n     * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n     * or as {@link UnionLayoutDiscriminator#layout|external union\n     * discriminators}.\n     *\n     * @abstract\n     */\n    isCount() {\n        throw new Error('ExternalLayout is abstract');\n    }\n}\nexports.ExternalLayout = ExternalLayout;\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n    constructor(elementSpan = 1, property) {\n        if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n            throw new TypeError('elementSpan must be a (positive) integer');\n        }\n        super(-1, property);\n        /** The layout for individual elements of the sequence.  The value\n         * must be a positive integer.  If not provided, the value will be\n         * 1. */\n        this.elementSpan = elementSpan;\n    }\n    /** @override */\n    isCount() {\n        return true;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        checkUint8Array(b);\n        const rem = b.length - offset;\n        return Math.floor(rem / this.elementSpan);\n    }\n    /** @override */\n    encode(src, b, offset) {\n        return 0;\n    }\n}\nexports.GreedyCount = GreedyCount;\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n    constructor(layout, offset = 0, property) {\n        if (!(layout instanceof Layout)) {\n            throw new TypeError('layout must be a Layout');\n        }\n        if (!Number.isInteger(offset)) {\n            throw new TypeError('offset must be integer or undefined');\n        }\n        super(layout.span, property || layout.property);\n        /** The subordinated layout. */\n        this.layout = layout;\n        /** The location of {@link OffsetLayout#layout} relative to the\n         * start of another layout.\n         *\n         * The value may be positive or negative, but an error will thrown\n         * if at the point of use it goes outside the span of the Uint8Array\n         * being accessed.  */\n        this.offset = offset;\n    }\n    /** @override */\n    isCount() {\n        return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return this.layout.decode(b, offset + this.offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        return this.layout.encode(src, b, offset + this.offset);\n    }\n}\nexports.OffsetLayout = OffsetLayout;\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readUIntLE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeUIntLE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.UInt = UInt;\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readUIntBE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeUIntBE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.UIntBE = UIntBE;\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readIntLE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeIntLE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.Int = Int;\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readIntBE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeIntBE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.IntBE = IntBE;\nconst V2E32 = Math.pow(2, 32);\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n    const hi32 = Math.floor(src / V2E32);\n    const lo32 = src - (hi32 * V2E32);\n    return { hi32, lo32 };\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n    return hi32 * V2E32 + lo32;\n}\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const lo32 = buffer.readUInt32LE(offset);\n        const hi32 = buffer.readUInt32LE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32LE(split.lo32, offset);\n        buffer.writeUInt32LE(split.hi32, offset + 4);\n        return 8;\n    }\n}\nexports.NearUInt64 = NearUInt64;\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const hi32 = buffer.readUInt32BE(offset);\n        const lo32 = buffer.readUInt32BE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32BE(split.hi32, offset);\n        buffer.writeUInt32BE(split.lo32, offset + 4);\n        return 8;\n    }\n}\nexports.NearUInt64BE = NearUInt64BE;\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const lo32 = buffer.readUInt32LE(offset);\n        const hi32 = buffer.readInt32LE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32LE(split.lo32, offset);\n        buffer.writeInt32LE(split.hi32, offset + 4);\n        return 8;\n    }\n}\nexports.NearInt64 = NearInt64;\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const hi32 = buffer.readInt32BE(offset);\n        const lo32 = buffer.readUInt32BE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeInt32BE(split.hi32, offset);\n        buffer.writeUInt32BE(split.lo32, offset + 4);\n        return 8;\n    }\n}\nexports.NearInt64BE = NearInt64BE;\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n    constructor(property) {\n        super(4, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readFloatLE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeFloatLE(src, offset);\n        return 4;\n    }\n}\nexports.Float = Float;\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n    constructor(property) {\n        super(4, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readFloatBE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeFloatBE(src, offset);\n        return 4;\n    }\n}\nexports.FloatBE = FloatBE;\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readDoubleLE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeDoubleLE(src, offset);\n        return 8;\n    }\n}\nexports.Double = Double;\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readDoubleBE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeDoubleBE(src, offset);\n        return 8;\n    }\n}\nexports.DoubleBE = DoubleBE;\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n    constructor(elementLayout, count, property) {\n        if (!(elementLayout instanceof Layout)) {\n            throw new TypeError('elementLayout must be a Layout');\n        }\n        if (!(((count instanceof ExternalLayout) && count.isCount())\n            || (Number.isInteger(count) && (0 <= count)))) {\n            throw new TypeError('count must be non-negative integer '\n                + 'or an unsigned integer ExternalLayout');\n        }\n        let span = -1;\n        if ((!(count instanceof ExternalLayout))\n            && (0 < elementLayout.span)) {\n            span = count * elementLayout.span;\n        }\n        super(span, property);\n        /** The layout for individual elements of the sequence. */\n        this.elementLayout = elementLayout;\n        /** The number of elements in the sequence.\n         *\n         * This will be either a non-negative integer or an instance of\n         * {@link ExternalLayout} for which {@link\n         * ExternalLayout#isCount|isCount()} is `true`. */\n        this.count = count;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        let span = 0;\n        let count = this.count;\n        if (count instanceof ExternalLayout) {\n            count = count.decode(b, offset);\n        }\n        if (0 < this.elementLayout.span) {\n            span = count * this.elementLayout.span;\n        }\n        else {\n            let idx = 0;\n            while (idx < count) {\n                span += this.elementLayout.getSpan(b, offset + span);\n                ++idx;\n            }\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const rv = [];\n        let i = 0;\n        let count = this.count;\n        if (count instanceof ExternalLayout) {\n            count = count.decode(b, offset);\n        }\n        while (i < count) {\n            rv.push(this.elementLayout.decode(b, offset));\n            offset += this.elementLayout.getSpan(b, offset);\n            i += 1;\n        }\n        return rv;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n     *\n     * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n     * the unused space in the buffer is left unchanged.  If `src` is\n     * longer than {@link Sequence#count|count} the unneeded elements are\n     * ignored.\n     *\n     * **NOTE** If {@link Layout#count|count} is an instance of {@link\n     * ExternalLayout} then the length of `src` will be encoded as the\n     * count after `src` is encoded. */\n    encode(src, b, offset = 0) {\n        const elo = this.elementLayout;\n        const span = src.reduce((span, v) => {\n            return span + elo.encode(v, b, offset + span);\n        }, 0);\n        if (this.count instanceof ExternalLayout) {\n            this.count.encode(src.length, b, offset);\n        }\n        return span;\n    }\n}\nexports.Sequence = Sequence;\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n    constructor(fields, property, decodePrefixes) {\n        if (!(Array.isArray(fields)\n            && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n            throw new TypeError('fields must be array of Layout instances');\n        }\n        if (('boolean' === typeof property)\n            && (undefined === decodePrefixes)) {\n            decodePrefixes = property;\n            property = undefined;\n        }\n        /* Verify absence of unnamed variable-length fields. */\n        for (const fd of fields) {\n            if ((0 > fd.span)\n                && (undefined === fd.property)) {\n                throw new Error('fields cannot contain unnamed variable-length layout');\n            }\n        }\n        let span = -1;\n        try {\n            span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n        }\n        catch (e) {\n            // ignore error\n        }\n        super(span, property);\n        /** The sequence of {@link Layout} values that comprise the\n         * structure.\n         *\n         * The individual elements need not be the same type, and may be\n         * either scalar or aggregate layouts.  If a member layout leaves\n         * its {@link Layout#property|property} undefined the\n         * corresponding region of the buffer associated with the element\n         * will not be mutated.\n         *\n         * @type {Layout[]} */\n        this.fields = fields;\n        /** Control behavior of {@link Layout#decode|decode()} given short\n         * buffers.\n         *\n         * In some situations a structure many be extended with additional\n         * fields over time, with older installations providing only a\n         * prefix of the full structure.  If this property is `true`\n         * decoding will accept those buffers and leave subsequent fields\n         * undefined, as long as the buffer ends at a field boundary.\n         * Defaults to `false`. */\n        this.decodePrefixes = !!decodePrefixes;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        let span = 0;\n        try {\n            span = this.fields.reduce((span, fd) => {\n                const fsp = fd.getSpan(b, offset);\n                offset += fsp;\n                return span + fsp;\n            }, 0);\n        }\n        catch (e) {\n            throw new RangeError('indeterminate span');\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        checkUint8Array(b);\n        const dest = this.makeDestinationObject();\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                dest[fd.property] = fd.decode(b, offset);\n            }\n            offset += fd.getSpan(b, offset);\n            if (this.decodePrefixes\n                && (b.length === offset)) {\n                break;\n            }\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Structure}.\n     *\n     * If `src` is missing a property for a member with a defined {@link\n     * Layout#property|property} the corresponding region of the buffer is\n     * left unmodified. */\n    encode(src, b, offset = 0) {\n        const firstOffset = offset;\n        let lastOffset = 0;\n        let lastWrote = 0;\n        for (const fd of this.fields) {\n            let span = fd.span;\n            lastWrote = (0 < span) ? span : 0;\n            if (undefined !== fd.property) {\n                const fv = src[fd.property];\n                if (undefined !== fv) {\n                    lastWrote = fd.encode(fv, b, offset);\n                    if (0 > span) {\n                        /* Read the as-encoded span, which is not necessarily the\n                         * same as what we wrote. */\n                        span = fd.getSpan(b, offset);\n                    }\n                }\n            }\n            lastOffset = offset;\n            offset += span;\n        }\n        /* Use (lastOffset + lastWrote) instead of offset because the last\n         * item may have had a dynamic length and we don't want to include\n         * the padding between it and the end of the space reserved for\n         * it. */\n        return (lastOffset + lastWrote) - firstOffset;\n    }\n    /** @override */\n    fromArray(values) {\n        const dest = this.makeDestinationObject();\n        for (const fd of this.fields) {\n            if ((undefined !== fd.property)\n                && (0 < values.length)) {\n                dest[fd.property] = values.shift();\n            }\n        }\n        return dest;\n    }\n    /**\n     * Get access to the layout of a given property.\n     *\n     * @param {String} property - the structure member of interest.\n     *\n     * @return {Layout} - the layout associated with `property`, or\n     * undefined if there is no such property.\n     */\n    layoutFor(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return fd;\n            }\n        }\n        return undefined;\n    }\n    /**\n     * Get the offset of a structure member.\n     *\n     * @param {String} property - the structure member of interest.\n     *\n     * @return {Number} - the offset in bytes to the start of `property`\n     * within the structure, or undefined if `property` is not a field\n     * within the structure.  If the property is a member but follows a\n     * variable-length structure member a negative number will be\n     * returned.\n     */\n    offsetOf(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        let offset = 0;\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return offset;\n            }\n            if (0 > fd.span) {\n                offset = -1;\n            }\n            else if (0 <= offset) {\n                offset += fd.span;\n            }\n        }\n        return undefined;\n    }\n}\nexports.Structure = Structure;\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n    constructor(property) {\n        /** The {@link Layout#property|property} to be used when the\n         * discriminator is referenced in isolation (generally when {@link\n         * Union#decode|Union decode} cannot delegate to a specific\n         * variant). */\n        this.property = property;\n    }\n    /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n     *\n     * The implementation of this method need not reference the buffer if\n     * variant information is available through other means. */\n    decode(b, offset) {\n        throw new Error('UnionDiscriminator is abstract');\n    }\n    /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n     *\n     * The implementation of this method need not store the value if\n     * variant information is maintained through other means. */\n    encode(src, b, offset) {\n        throw new Error('UnionDiscriminator is abstract');\n    }\n}\nexports.UnionDiscriminator = UnionDiscriminator;\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n    constructor(layout, property) {\n        if (!((layout instanceof ExternalLayout)\n            && layout.isCount())) {\n            throw new TypeError('layout must be an unsigned integer ExternalLayout');\n        }\n        super(property || layout.property || 'variant');\n        /** The {@link ExternalLayout} used to access the discriminator\n         * value. */\n        this.layout = layout;\n    }\n    /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n    decode(b, offset) {\n        return this.layout.decode(b, offset);\n    }\n    /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n    encode(src, b, offset) {\n        return this.layout.encode(src, b, offset);\n    }\n}\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n    constructor(discr, defaultLayout, property) {\n        let discriminator;\n        if ((discr instanceof UInt)\n            || (discr instanceof UIntBE)) {\n            discriminator = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n        }\n        else if ((discr instanceof ExternalLayout)\n            && discr.isCount()) {\n            discriminator = new UnionLayoutDiscriminator(discr);\n        }\n        else if (!(discr instanceof UnionDiscriminator)) {\n            throw new TypeError('discr must be a UnionDiscriminator '\n                + 'or an unsigned integer layout');\n        }\n        else {\n            discriminator = discr;\n        }\n        if (undefined === defaultLayout) {\n            defaultLayout = null;\n        }\n        if (!((null === defaultLayout)\n            || (defaultLayout instanceof Layout))) {\n            throw new TypeError('defaultLayout must be null or a Layout');\n        }\n        if (null !== defaultLayout) {\n            if (0 > defaultLayout.span) {\n                throw new Error('defaultLayout must have constant span');\n            }\n            if (undefined === defaultLayout.property) {\n                defaultLayout = defaultLayout.replicate('content');\n            }\n        }\n        /* The union span can be estimated only if there's a default\n         * layout.  The union spans its default layout, plus any prefix\n         * variant layout.  By construction both layouts, if present, have\n         * non-negative span. */\n        let span = -1;\n        if (defaultLayout) {\n            span = defaultLayout.span;\n            if ((0 <= span) && ((discr instanceof UInt)\n                || (discr instanceof UIntBE))) {\n                span += discriminator.layout.span;\n            }\n        }\n        super(span, property);\n        /** The interface for the discriminator value in isolation.\n         *\n         * This a {@link UnionDiscriminator} either passed to the\n         * constructor or synthesized from the `discr` constructor\n         * argument.  {@link\n         * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n         * `true` iff the `discr` parameter was a non-offset {@link\n         * Layout} instance. */\n        this.discriminator = discriminator;\n        /** `true` if the {@link Union#discriminator|discriminator} is the\n         * first field in the union.\n         *\n         * If `false` the discriminator is obtained from somewhere\n         * else. */\n        this.usesPrefixDiscriminator = (discr instanceof UInt)\n            || (discr instanceof UIntBE);\n        /** The layout for non-discriminator content when the value of the\n         * discriminator is not recognized.\n         *\n         * This is the value passed to the constructor.  It is\n         * structurally equivalent to the second component of {@link\n         * Union#layout|layout} but may have a different property\n         * name. */\n        this.defaultLayout = defaultLayout;\n        /** A registry of allowed variants.\n         *\n         * The keys are unsigned integers which should be compatible with\n         * {@link Union.discriminator|discriminator}.  The property value\n         * is the corresponding {@link VariantLayout} instances assigned\n         * to this union by {@link Union#addVariant|addVariant}.\n         *\n         * **NOTE** The registry remains mutable so that variants can be\n         * {@link Union#addVariant|added} at any time.  Users should not\n         * manipulate the content of this property. */\n        this.registry = {};\n        /* Private variable used when invoking getSourceVariant */\n        let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n        /** Function to infer the variant selected by a source object.\n         *\n         * Defaults to {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n         * be overridden using {@link\n         * Union#configGetSourceVariant|configGetSourceVariant}.\n         *\n         * @param {Object} src - as with {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n         *\n         * @returns {(undefined|VariantLayout)} The default variant\n         * (`undefined`) or first registered variant that uses a property\n         * available in `src`. */\n        this.getSourceVariant = function (src) {\n            return boundGetSourceVariant(src);\n        };\n        /** Function to override the implementation of {@link\n         * Union#getSourceVariant|getSourceVariant}.\n         *\n         * Use this if the desired variant cannot be identified using the\n         * algorithm of {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n         *\n         * **NOTE** The provided function will be invoked bound to this\n         * Union instance, providing local access to {@link\n         * Union#registry|registry}.\n         *\n         * @param {Function} gsv - a function that follows the API of\n         * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n        this.configGetSourceVariant = function (gsv) {\n            boundGetSourceVariant = gsv.bind(this);\n        };\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        /* Default layouts always have non-negative span, so we don't have\n         * one and we have to recognize the variant which will in turn\n         * determine the span. */\n        const vlo = this.getVariant(b, offset);\n        if (!vlo) {\n            throw new Error('unable to determine span for unrecognized variant');\n        }\n        return vlo.getSpan(b, offset);\n    }\n    /**\n     * Method to infer a registered Union variant compatible with `src`.\n     *\n     * The first satisfied rule in the following sequence defines the\n     * return value:\n     * * If `src` has properties matching the Union discriminator and\n     *   the default layout, `undefined` is returned regardless of the\n     *   value of the discriminator property (this ensures the default\n     *   layout will be used);\n     * * If `src` has a property matching the Union discriminator, the\n     *   value of the discriminator identifies a registered variant, and\n     *   either (a) the variant has no layout, or (b) `src` has the\n     *   variant's property, then the variant is returned (because the\n     *   source satisfies the constraints of the variant it identifies);\n     * * If `src` does not have a property matching the Union\n     *   discriminator, but does have a property matching a registered\n     *   variant, then the variant is returned (because the source\n     *   matches a variant without an explicit conflict);\n     * * An error is thrown (because we either can't identify a variant,\n     *   or we were explicitly told the variant but can't satisfy it).\n     *\n     * @param {Object} src - an object presumed to be compatible with\n     * the content of the Union.\n     *\n     * @return {(undefined|VariantLayout)} - as described above.\n     *\n     * @throws {Error} - if `src` cannot be associated with a default or\n     * registered variant.\n     */\n    defaultGetSourceVariant(src) {\n        if (Object.prototype.hasOwnProperty.call(src, this.discriminator.property)) {\n            if (this.defaultLayout && this.defaultLayout.property\n                && Object.prototype.hasOwnProperty.call(src, this.defaultLayout.property)) {\n                return undefined;\n            }\n            const vlo = this.registry[src[this.discriminator.property]];\n            if (vlo\n                && ((!vlo.layout)\n                    || (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)))) {\n                return vlo;\n            }\n        }\n        else {\n            for (const tag in this.registry) {\n                const vlo = this.registry[tag];\n                if (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)) {\n                    return vlo;\n                }\n            }\n        }\n        throw new Error('unable to infer src variant');\n    }\n    /** Implement {@link Layout#decode|decode} for {@link Union}.\n     *\n     * If the variant is {@link Union#addVariant|registered} the return\n     * value is an instance of that variant, with no explicit\n     * discriminator.  Otherwise the {@link Union#defaultLayout|default\n     * layout} is used to decode the content. */\n    decode(b, offset = 0) {\n        let dest;\n        const dlo = this.discriminator;\n        const discr = dlo.decode(b, offset);\n        const clo = this.registry[discr];\n        if (undefined === clo) {\n            const defaultLayout = this.defaultLayout;\n            let contentOffset = 0;\n            if (this.usesPrefixDiscriminator) {\n                contentOffset = dlo.layout.span;\n            }\n            dest = this.makeDestinationObject();\n            dest[dlo.property] = discr;\n            // defaultLayout.property can be undefined, but this is allowed by buffer-layout\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            dest[defaultLayout.property] = defaultLayout.decode(b, offset + contentOffset);\n        }\n        else {\n            dest = clo.decode(b, offset);\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Union}.\n     *\n     * This API assumes the `src` object is consistent with the union's\n     * {@link Union#defaultLayout|default layout}.  To encode variants\n     * use the appropriate variant-specific {@link VariantLayout#encode}\n     * method. */\n    encode(src, b, offset = 0) {\n        const vlo = this.getSourceVariant(src);\n        if (undefined === vlo) {\n            const dlo = this.discriminator;\n            // this.defaultLayout is not undefined when vlo is undefined\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const clo = this.defaultLayout;\n            let contentOffset = 0;\n            if (this.usesPrefixDiscriminator) {\n                contentOffset = dlo.layout.span;\n            }\n            dlo.encode(src[dlo.property], b, offset);\n            // clo.property is not undefined when vlo is undefined\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            return contentOffset + clo.encode(src[clo.property], b, offset + contentOffset);\n        }\n        return vlo.encode(src, b, offset);\n    }\n    /** Register a new variant structure within a union.  The newly\n     * created variant is returned.\n     *\n     * @param {Number} variant - initializer for {@link\n     * VariantLayout#variant|variant}.\n     *\n     * @param {Layout} layout - initializer for {@link\n     * VariantLayout#layout|layout}.\n     *\n     * @param {String} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {VariantLayout} */\n    addVariant(variant, layout, property) {\n        const rv = new VariantLayout(this, variant, layout, property);\n        this.registry[variant] = rv;\n        return rv;\n    }\n    /**\n     * Get the layout associated with a registered variant.\n     *\n     * If `vb` does not produce a registered variant the function returns\n     * `undefined`.\n     *\n     * @param {(Number|Uint8Array)} vb - either the variant number, or a\n     * buffer from which the discriminator is to be read.\n     *\n     * @param {Number} offset - offset into `vb` for the start of the\n     * union.  Used only when `vb` is an instance of {Uint8Array}.\n     *\n     * @return {({VariantLayout}|undefined)}\n     */\n    getVariant(vb, offset = 0) {\n        let variant;\n        if (vb instanceof Uint8Array) {\n            variant = this.discriminator.decode(vb, offset);\n        }\n        else {\n            variant = vb;\n        }\n        return this.registry[variant];\n    }\n}\nexports.Union = Union;\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n    constructor(union, variant, layout, property) {\n        if (!(union instanceof Union)) {\n            throw new TypeError('union must be a Union');\n        }\n        if ((!Number.isInteger(variant)) || (0 > variant)) {\n            throw new TypeError('variant must be a (non-negative) integer');\n        }\n        if (('string' === typeof layout)\n            && (undefined === property)) {\n            property = layout;\n            layout = null;\n        }\n        if (layout) {\n            if (!(layout instanceof Layout)) {\n                throw new TypeError('layout must be a Layout');\n            }\n            if ((null !== union.defaultLayout)\n                && (0 <= layout.span)\n                && (layout.span > union.defaultLayout.span)) {\n                throw new Error('variant span exceeds span of containing union');\n            }\n            if ('string' !== typeof property) {\n                throw new TypeError('variant must have a String property');\n            }\n        }\n        let span = union.span;\n        if (0 > union.span) {\n            span = layout ? layout.span : 0;\n            if ((0 <= span) && union.usesPrefixDiscriminator) {\n                span += union.discriminator.layout.span;\n            }\n        }\n        super(span, property);\n        /** The {@link Union} to which this variant belongs. */\n        this.union = union;\n        /** The unsigned integral value identifying this variant within\n         * the {@link Union#discriminator|discriminator} of the containing\n         * union. */\n        this.variant = variant;\n        /** The {@link Layout} to be used when reading/writing the\n         * non-discriminator part of the {@link\n         * VariantLayout#union|union}.  If `null` the variant carries no\n         * data. */\n        this.layout = layout || null;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            /* Will be equal to the containing union span if that is not\n             * variable. */\n            return this.span;\n        }\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        /* Span is defined solely by the variant (and prefix discriminator) */\n        let span = 0;\n        if (this.layout) {\n            span = this.layout.getSpan(b, offset + contentOffset);\n        }\n        return contentOffset + span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const dest = this.makeDestinationObject();\n        if (this !== this.union.getVariant(b, offset)) {\n            throw new Error('variant mismatch');\n        }\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        if (this.layout) {\n            dest[this.property] = this.layout.decode(b, offset + contentOffset);\n        }\n        else if (this.property) {\n            dest[this.property] = true;\n        }\n        else if (this.union.usesPrefixDiscriminator) {\n            dest[this.union.discriminator.property] = this.variant;\n        }\n        return dest;\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        if (this.layout\n            && (!Object.prototype.hasOwnProperty.call(src, this.property))) {\n            throw new TypeError('variant lacks property ' + this.property);\n        }\n        this.union.discriminator.encode(this.variant, b, offset);\n        let span = contentOffset;\n        if (this.layout) {\n            this.layout.encode(src[this.property], b, offset + contentOffset);\n            span += this.layout.getSpan(b, offset + contentOffset);\n            if ((0 <= this.union.span)\n                && (span > this.union.span)) {\n                throw new Error('encoded variant overruns containing union');\n            }\n        }\n        return span;\n    }\n    /** Delegate {@link Layout#fromArray|fromArray} to {@link\n     * VariantLayout#layout|layout}. */\n    fromArray(values) {\n        if (this.layout) {\n            return this.layout.fromArray(values);\n        }\n        return undefined;\n    }\n}\nexports.VariantLayout = VariantLayout;\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n    if (0 > v) {\n        v += 0x100000000;\n    }\n    return v;\n}\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n    constructor(word, msb, property) {\n        if (!((word instanceof UInt)\n            || (word instanceof UIntBE))) {\n            throw new TypeError('word must be a UInt or UIntBE layout');\n        }\n        if (('string' === typeof msb)\n            && (undefined === property)) {\n            property = msb;\n            msb = false;\n        }\n        if (4 < word.span) {\n            throw new RangeError('word cannot exceed 32 bits');\n        }\n        super(word.span, property);\n        /** The layout used for the packed value.  {@link BitField}\n         * instances are packed sequentially depending on {@link\n         * BitStructure#msb|msb}. */\n        this.word = word;\n        /** Whether the bit sequences are packed starting at the most\n         * significant bit growing down (`true`), or the least significant\n         * bit growing up (`false`).\n         *\n         * **NOTE** Regardless of this value, the least significant bit of\n         * any {@link BitField} value is the least significant bit of the\n         * corresponding section of the packed value. */\n        this.msb = !!msb;\n        /** The sequence of {@link BitField} layouts that comprise the\n         * packed structure.\n         *\n         * **NOTE** The array remains mutable to allow fields to be {@link\n         * BitStructure#addField|added} after construction.  Users should\n         * not manipulate the content of this property.*/\n        this.fields = [];\n        /* Storage for the value.  Capture a variable instead of using an\n         * instance property because we don't want anything to change the\n         * value without going through the mutator. */\n        let value = 0;\n        this._packedSetValue = function (v) {\n            value = fixBitwiseResult(v);\n            return this;\n        };\n        this._packedGetValue = function () {\n            return value;\n        };\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const dest = this.makeDestinationObject();\n        const value = this.word.decode(b, offset);\n        this._packedSetValue(value);\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                dest[fd.property] = fd.decode(b);\n            }\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n     *\n     * If `src` is missing a property for a member with a defined {@link\n     * Layout#property|property} the corresponding region of the packed\n     * value is left unmodified.  Unused bits are also left unmodified. */\n    encode(src, b, offset = 0) {\n        const value = this.word.decode(b, offset);\n        this._packedSetValue(value);\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                const fv = src[fd.property];\n                if (undefined !== fv) {\n                    fd.encode(fv);\n                }\n            }\n        }\n        return this.word.encode(this._packedGetValue(), b, offset);\n    }\n    /** Register a new bitfield with a containing bit structure.  The\n     * resulting bitfield is returned.\n     *\n     * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n     *\n     * @param {string} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {BitField} */\n    addField(bits, property) {\n        const bf = new BitField(this, bits, property);\n        this.fields.push(bf);\n        return bf;\n    }\n    /** As with {@link BitStructure#addField|addField} for single-bit\n     * fields with `boolean` value representation.\n     *\n     * @param {string} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {Boolean} */\n    // `Boolean` conflicts with the native primitive type\n    // eslint-disable-next-line @typescript-eslint/ban-types\n    addBoolean(property) {\n        // This is my Boolean, not the Javascript one.\n        const bf = new Boolean(this, property);\n        this.fields.push(bf);\n        return bf;\n    }\n    /**\n     * Get access to the bit field for a given property.\n     *\n     * @param {String} property - the bit field of interest.\n     *\n     * @return {BitField} - the field associated with `property`, or\n     * undefined if there is no such property.\n     */\n    fieldFor(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return fd;\n            }\n        }\n        return undefined;\n    }\n}\nexports.BitStructure = BitStructure;\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n    constructor(container, bits, property) {\n        if (!(container instanceof BitStructure)) {\n            throw new TypeError('container must be a BitStructure');\n        }\n        if ((!Number.isInteger(bits)) || (0 >= bits)) {\n            throw new TypeError('bits must be positive integer');\n        }\n        const totalBits = 8 * container.span;\n        const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n        if ((bits + usedBits) > totalBits) {\n            throw new Error('bits too long for span remainder ('\n                + (totalBits - usedBits) + ' of '\n                + totalBits + ' remain)');\n        }\n        /** The {@link BitStructure} instance to which this bit field\n         * belongs. */\n        this.container = container;\n        /** The span of this value in bits. */\n        this.bits = bits;\n        /** A mask of {@link BitField#bits|bits} bits isolating value bits\n         * that fit within the field.\n         *\n         * That is, it masks a value that has not yet been shifted into\n         * position within its containing packed integer. */\n        this.valueMask = (1 << bits) - 1;\n        if (32 === bits) { // shifted value out of range\n            this.valueMask = 0xFFFFFFFF;\n        }\n        /** The offset of the value within the containing packed unsigned\n         * integer.  The least significant bit of the packed value is at\n         * offset zero, regardless of bit ordering used. */\n        this.start = usedBits;\n        if (this.container.msb) {\n            this.start = totalBits - usedBits - bits;\n        }\n        /** A mask of {@link BitField#bits|bits} isolating the field value\n         * within the containing packed unsigned integer. */\n        this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n        /** The property name used when this bitfield is represented in an\n         * Object.\n         *\n         * Intended to be functionally equivalent to {@link\n         * Layout#property}.\n         *\n         * If left undefined the corresponding span of bits will be\n         * treated as padding: it will not be mutated by {@link\n         * Layout#encode|encode} nor represented as a property in the\n         * decoded Object. */\n        this.property = property;\n    }\n    /** Store a value into the corresponding subsequence of the containing\n     * bit field. */\n    decode(b, offset) {\n        const word = this.container._packedGetValue();\n        const wordValue = fixBitwiseResult(word & this.wordMask);\n        const value = wordValue >>> this.start;\n        return value;\n    }\n    /** Store a value into the corresponding subsequence of the containing\n     * bit field.\n     *\n     * **NOTE** This is not a specialization of {@link\n     * Layout#encode|Layout.encode} and there is no return value. */\n    encode(value) {\n        if ('number' !== typeof value\n            || !Number.isInteger(value)\n            || (value !== fixBitwiseResult(value & this.valueMask))) {\n            throw new TypeError(nameWithProperty('BitField.encode', this)\n                + ' value must be integer not exceeding ' + this.valueMask);\n        }\n        const word = this.container._packedGetValue();\n        const wordValue = fixBitwiseResult(value << this.start);\n        this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n            | wordValue);\n    }\n}\nexports.BitField = BitField;\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n    constructor(container, property) {\n        super(container, 1, property);\n    }\n    /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n     *\n     * @returns {boolean} */\n    decode(b, offset) {\n        return !!super.decode(b, offset);\n    }\n    /** @override */\n    encode(value) {\n        if ('boolean' === typeof value) {\n            // BitField requires integer values\n            value = +value;\n        }\n        super.encode(value);\n    }\n}\nexports.Boolean = Boolean;\n/* eslint-enable no-extend-native */\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Uint8Array.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n    constructor(length, property) {\n        if (!(((length instanceof ExternalLayout) && length.isCount())\n            || (Number.isInteger(length) && (0 <= length)))) {\n            throw new TypeError('length must be positive integer '\n                + 'or an unsigned integer ExternalLayout');\n        }\n        let span = -1;\n        if (!(length instanceof ExternalLayout)) {\n            span = length;\n        }\n        super(span, property);\n        /** The number of bytes in the blob.\n         *\n         * This may be a non-negative integer, or an instance of {@link\n         * ExternalLayout} that satisfies {@link\n         * ExternalLayout#isCount|isCount()}. */\n        this.length = length;\n    }\n    /** @override */\n    getSpan(b, offset) {\n        let span = this.span;\n        if (0 > span) {\n            span = this.length.decode(b, offset);\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        let span = this.span;\n        if (0 > span) {\n            span = this.length.decode(b, offset);\n        }\n        return uint8ArrayToBuffer(b).slice(offset, offset + span);\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Blob}.\n     *\n     * **NOTE** If {@link Layout#count|count} is an instance of {@link\n     * ExternalLayout} then the length of `src` will be encoded as the\n     * count after `src` is encoded. */\n    encode(src, b, offset) {\n        let span = this.length;\n        if (this.length instanceof ExternalLayout) {\n            span = src.length;\n        }\n        if (!(src instanceof Uint8Array && span === src.length)) {\n            throw new TypeError(nameWithProperty('Blob.encode', this)\n                + ' requires (length ' + span + ') Uint8Array as src');\n        }\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Uint8Array');\n        }\n        const srcBuffer = uint8ArrayToBuffer(src);\n        uint8ArrayToBuffer(b).write(srcBuffer.toString('hex'), offset, span, 'hex');\n        if (this.length instanceof ExternalLayout) {\n            this.length.encode(span, b, offset);\n        }\n        return span;\n    }\n}\nexports.Blob = Blob;\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n    constructor(property) {\n        super(-1, property);\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        checkUint8Array(b);\n        let idx = offset;\n        while ((idx < b.length) && (0 !== b[idx])) {\n            idx += 1;\n        }\n        return 1 + idx - offset;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const span = this.getSpan(b, offset);\n        return uint8ArrayToBuffer(b).slice(offset, offset + span - 1).toString('utf-8');\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        /* Must force this to a string, lest it be a number and the\n         * \"utf8-encoding\" below actually allocate a buffer of length\n         * src */\n        if ('string' !== typeof src) {\n            src = String(src);\n        }\n        const srcb = buffer_1.Buffer.from(src, 'utf8');\n        const span = srcb.length;\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Buffer');\n        }\n        const buffer = uint8ArrayToBuffer(b);\n        srcb.copy(buffer, offset);\n        buffer[offset + span] = 0;\n        return span + 1;\n    }\n}\nexports.CString = CString;\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n    constructor(maxSpan, property) {\n        if (('string' === typeof maxSpan) && (undefined === property)) {\n            property = maxSpan;\n            maxSpan = undefined;\n        }\n        if (undefined === maxSpan) {\n            maxSpan = -1;\n        }\n        else if (!Number.isInteger(maxSpan)) {\n            throw new TypeError('maxSpan must be an integer');\n        }\n        super(-1, property);\n        /** The maximum span of the layout in bytes.\n         *\n         * Positive values are generally expected.  Zero is abnormal.\n         * Attempts to encode or decode a value that exceeds this length\n         * will throw a `RangeError`.\n         *\n         * A negative value indicates that there is no bound on the length\n         * of the content. */\n        this.maxSpan = maxSpan;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        checkUint8Array(b);\n        return b.length - offset;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const span = this.getSpan(b, offset);\n        if ((0 <= this.maxSpan)\n            && (this.maxSpan < span)) {\n            throw new RangeError('text length exceeds maxSpan');\n        }\n        return uint8ArrayToBuffer(b).slice(offset, offset + span).toString('utf-8');\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        /* Must force this to a string, lest it be a number and the\n         * \"utf8-encoding\" below actually allocate a buffer of length\n         * src */\n        if ('string' !== typeof src) {\n            src = String(src);\n        }\n        const srcb = buffer_1.Buffer.from(src, 'utf8');\n        const span = srcb.length;\n        if ((0 <= this.maxSpan)\n            && (this.maxSpan < span)) {\n            throw new RangeError('text length exceeds maxSpan');\n        }\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Buffer');\n        }\n        srcb.copy(uint8ArrayToBuffer(b), offset);\n        return span;\n    }\n}\nexports.UTF8 = UTF8;\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n    constructor(value, property) {\n        super(0, property);\n        /** The value produced by this constant when the layout is {@link\n         * Constant#decode|decoded}.\n         *\n         * Any JavaScript value including `null` and `undefined` is\n         * permitted.\n         *\n         * **WARNING** If `value` passed in the constructor was not\n         * frozen, it is possible for users of decoded values to change\n         * the content of the value. */\n        this.value = value;\n    }\n    /** @override */\n    decode(b, offset) {\n        return this.value;\n    }\n    /** @override */\n    encode(src, b, offset) {\n        /* Constants take no space */\n        return 0;\n    }\n}\nexports.Constant = Constant;\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = ((property) => new UInt(1, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = ((property) => new UInt(2, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = ((property) => new UInt(3, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = ((property) => new UInt(4, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = ((property) => new UInt(5, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = ((property) => new UInt(6, property));\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = ((property) => new NearUInt64(property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = ((property) => new UIntBE(2, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = ((property) => new UIntBE(3, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = ((property) => new UIntBE(4, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = ((property) => new UIntBE(5, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = ((property) => new UIntBE(6, property));\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = ((property) => new NearUInt64BE(property));\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = ((property) => new Int(1, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = ((property) => new Int(2, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = ((property) => new Int(3, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = ((property) => new Int(4, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = ((property) => new Int(5, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = ((property) => new Int(6, property));\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = ((property) => new NearInt64(property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = ((property) => new IntBE(2, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = ((property) => new IntBE(3, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = ((property) => new IntBE(4, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = ((property) => new IntBE(5, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = ((property) => new IntBE(6, property));\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = ((property) => new NearInt64BE(property));\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = ((property) => new Float(property));\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = ((property) => new FloatBE(property));\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = ((property) => new Double(property));\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = ((property) => new DoubleBE(property));\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n/** Factory for {@link CString} values. */\nexports.cstr = ((property) => new CString(property));\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n/** Factory for {@link Constant} values. */\nexports.constant = ((value, property) => new Constant(value, property));\n//# sourceMappingURL=Layout.js.map","function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}\nexport { _typeof as default };","import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n  if (\"object\" != _typeof(t) || !t) return t;\n  var e = t[Symbol.toPrimitive];\n  if (void 0 !== e) {\n    var i = e.call(t, r || \"default\");\n    if (\"object\" != _typeof(i)) return i;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n    value: t,\n    enumerable: !0,\n    configurable: !0,\n    writable: !0\n  }) : e[r] = t, e;\n}\nexport { _defineProperty as default };","import _defineProperty from '@babel/runtime/helpers/defineProperty';\nimport BN from 'bn.js';\nimport { sendAndConfirmTransaction as sendAndConfirmTransaction$1, PublicKey, Keypair, Transaction, SystemProgram, SYSVAR_RENT_PUBKEY, TransactionInstruction } from '@solana/web3.js';\n\nvar buffer = {};\n\nvar base64Js = {};\n\nbase64Js.byteLength = byteLength;\nbase64Js.toByteArray = toByteArray;\nbase64Js.fromByteArray = fromByteArray;\n\nvar lookup = [];\nvar revLookup = [];\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i];\n  revLookup[code.charCodeAt(i)] = i;\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62;\nrevLookup['_'.charCodeAt(0)] = 63;\n\nfunction getLens (b64) {\n  var len = b64.length;\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=');\n  if (validLen === -1) validLen = len;\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4);\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64);\n  var validLen = lens[0];\n  var placeHoldersLen = lens[1];\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp;\n  var lens = getLens(b64);\n  var validLen = lens[0];\n  var placeHoldersLen = lens[1];\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));\n\n  var curByte = 0;\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen;\n\n  var i;\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)];\n    arr[curByte++] = (tmp >> 16) & 0xFF;\n    arr[curByte++] = (tmp >> 8) & 0xFF;\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4);\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2);\n    arr[curByte++] = (tmp >> 8) & 0xFF;\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp;\n  var output = [];\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF);\n    output.push(tripletToBase64(tmp));\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp;\n  var len = uint8.length;\n  var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes\n  var parts = [];\n  var maxChunkLength = 16383; // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)));\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1];\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    );\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1];\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    );\n  }\n\n  return parts.join('')\n}\n\nvar ieee754 = {};\n\n/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\n\nieee754.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m;\n  var eLen = (nBytes * 8) - mLen - 1;\n  var eMax = (1 << eLen) - 1;\n  var eBias = eMax >> 1;\n  var nBits = -7;\n  var i = isLE ? (nBytes - 1) : 0;\n  var d = isLE ? -1 : 1;\n  var s = buffer[offset + i];\n\n  i += d;\n\n  e = s & ((1 << (-nBits)) - 1);\n  s >>= (-nBits);\n  nBits += eLen;\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1);\n  e >>= (-nBits);\n  nBits += mLen;\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias;\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen);\n    e = e - eBias;\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n};\n\nieee754.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c;\n  var eLen = (nBytes * 8) - mLen - 1;\n  var eMax = (1 << eLen) - 1;\n  var eBias = eMax >> 1;\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0);\n  var i = isLE ? 0 : (nBytes - 1);\n  var d = isLE ? 1 : -1;\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;\n\n  value = Math.abs(value);\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0;\n    e = eMax;\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2);\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--;\n      c *= 2;\n    }\n    if (e + eBias >= 1) {\n      value += rt / c;\n    } else {\n      value += rt * Math.pow(2, 1 - eBias);\n    }\n    if (value * c >= 2) {\n      e++;\n      c /= 2;\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0;\n      e = eMax;\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen);\n      e = e + eBias;\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);\n      e = 0;\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m;\n  eLen += mLen;\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128;\n};\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n\n(function (exports) {\n\nconst base64 = base64Js;\nconst ieee754$1 = ieee754;\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null;\n\nexports.Buffer = Buffer;\nexports.SlowBuffer = SlowBuffer;\nexports.INSPECT_MAX_BYTES = 50;\n\nconst K_MAX_LENGTH = 0x7fffffff;\nexports.kMaxLength = K_MAX_LENGTH;\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport();\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  );\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1);\n    const proto = { foo: function () { return 42 } };\n    Object.setPrototypeOf(proto, Uint8Array.prototype);\n    Object.setPrototypeOf(arr, proto);\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n});\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n});\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length);\n  Object.setPrototypeOf(buf, Buffer.prototype);\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192; // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf();\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value);\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n};\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype);\nObject.setPrototypeOf(Buffer, Uint8Array);\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size);\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n};\n\nfunction allocUnsafe (size) {\n  assertSize(size);\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n};\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n};\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8';\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0;\n  let buf = createBuffer(length);\n\n  const actual = buf.write(string, encoding);\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual);\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0;\n  const buf = createBuffer(length);\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255;\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView);\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf;\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array);\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset);\n  } else {\n    buf = new Uint8Array(array, byteOffset, length);\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype);\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0;\n    const buf = createBuffer(len);\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len);\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0;\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n};\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength);\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength);\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length;\n  let y = b.length;\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n};\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n};\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i;\n  if (length === undefined) {\n    length = 0;\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length;\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length);\n  let pos = 0;\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i];\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf);\n        buf.copy(buffer, pos);\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        );\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos);\n    }\n    pos += buf.length;\n  }\n  return buffer\n};\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length;\n  const mustMatch = (arguments.length > 2 && arguments[2] === true);\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false;\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase();\n        loweredCase = true;\n    }\n  }\n}\nBuffer.byteLength = byteLength;\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false;\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0;\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length;\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0;\n  start >>>= 0;\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8';\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase();\n        loweredCase = true;\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true;\n\nfunction swap (b, n, m) {\n  const i = b[n];\n  b[n] = b[m];\n  b[m] = i;\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length;\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1);\n  }\n  return this\n};\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length;\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3);\n    swap(this, i + 1, i + 2);\n  }\n  return this\n};\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length;\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7);\n    swap(this, i + 1, i + 6);\n    swap(this, i + 2, i + 5);\n    swap(this, i + 3, i + 4);\n  }\n  return this\n};\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length;\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n};\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString;\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n};\n\nBuffer.prototype.inspect = function inspect () {\n  let str = '';\n  const max = exports.INSPECT_MAX_BYTES;\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim();\n  if (this.length > max) str += ' ... ';\n  return '<Buffer ' + str + '>'\n};\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect;\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength);\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0;\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0;\n  }\n  if (thisStart === undefined) {\n    thisStart = 0;\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length;\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0;\n  end >>>= 0;\n  thisStart >>>= 0;\n  thisEnd >>>= 0;\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart;\n  let y = end - start;\n  const len = Math.min(x, y);\n\n  const thisCopy = this.slice(thisStart, thisEnd);\n  const targetCopy = target.slice(start, end);\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i];\n      y = targetCopy[i];\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n};\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset;\n    byteOffset = 0;\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff;\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000;\n  }\n  byteOffset = +byteOffset; // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1);\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset;\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1;\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0;\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding);\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF; // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1;\n  let arrLength = arr.length;\n  let valLength = val.length;\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase();\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2;\n      arrLength /= 2;\n      valLength /= 2;\n      byteOffset /= 2;\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i;\n  if (dir) {\n    let foundIndex = -1;\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i;\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex;\n        foundIndex = -1;\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true;\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false;\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n};\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n};\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n};\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0;\n  const remaining = buf.length - offset;\n  if (!length) {\n    length = remaining;\n  } else {\n    length = Number(length);\n    if (length > remaining) {\n      length = remaining;\n    }\n  }\n\n  const strLen = string.length;\n\n  if (length > strLen / 2) {\n    length = strLen / 2;\n  }\n  let i;\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16);\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed;\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8';\n    length = this.length;\n    offset = 0;\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset;\n    length = this.length;\n    offset = 0;\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0;\n    if (isFinite(length)) {\n      length = length >>> 0;\n      if (encoding === undefined) encoding = 'utf8';\n    } else {\n      encoding = length;\n      length = undefined;\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset;\n  if (length === undefined || length > remaining) length = remaining;\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8';\n\n  let loweredCase = false;\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase();\n        loweredCase = true;\n    }\n  }\n};\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n};\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end);\n  const res = [];\n\n  let i = start;\n  while (i < end) {\n    const firstByte = buf[i];\n    let codePoint = null;\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1;\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint;\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte;\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1];\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F);\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F);\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          fourthByte = buf[i + 3];\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F);\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint;\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD;\n      bytesPerSequence = 1;\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000;\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800);\n      codePoint = 0xDC00 | codePoint & 0x3FF;\n    }\n\n    res.push(codePoint);\n    i += bytesPerSequence;\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000;\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length;\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = '';\n  let i = 0;\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    );\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F);\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i]);\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length;\n\n  if (!start || start < 0) start = 0;\n  if (!end || end < 0 || end > len) end = len;\n\n  let out = '';\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]];\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end);\n  let res = '';\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256));\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length;\n  start = ~~start;\n  end = end === undefined ? len : ~~end;\n\n  if (start < 0) {\n    start += len;\n    if (start < 0) start = 0;\n  } else if (start > len) {\n    start = len;\n  }\n\n  if (end < 0) {\n    end += len;\n    if (end < 0) end = 0;\n  } else if (end > len) {\n    end = len;\n  }\n\n  if (end < start) end = start;\n\n  const newBuf = this.subarray(start, end);\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype);\n\n  return newBuf\n};\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let val = this[offset];\n  let mul = 1;\n  let i = 0;\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul;\n  }\n\n  return val\n};\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length);\n  }\n\n  let val = this[offset + --byteLength];\n  let mul = 1;\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul;\n  }\n\n  return val\n};\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 1, this.length);\n  return this[offset]\n};\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  return this[offset] | (this[offset + 1] << 8)\n};\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  return (this[offset] << 8) | this[offset + 1]\n};\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n};\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n};\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24;\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24;\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n});\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset];\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last;\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n});\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let val = this[offset];\n  let mul = 1;\n  let i = 0;\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul;\n  }\n  mul *= 0x80;\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n  return val\n};\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let i = byteLength;\n  let mul = 1;\n  let val = this[offset + --i];\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul;\n  }\n  mul *= 0x80;\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n  return val\n};\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 1, this.length);\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n};\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  const val = this[offset] | (this[offset + 1] << 8);\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  const val = this[offset + 1] | (this[offset] << 8);\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n};\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n};\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24); // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n});\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset];\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n});\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n  return ieee754$1.read(this, offset, true, 23, 4)\n};\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n  return ieee754$1.read(this, offset, false, 23, 4)\n};\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 8, this.length);\n  return ieee754$1.read(this, offset, true, 52, 8)\n};\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 8, this.length);\n  return ieee754$1.read(this, offset, false, 52, 8)\n};\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n    checkInt(this, value, offset, byteLength, maxBytes, 0);\n  }\n\n  let mul = 1;\n  let i = 0;\n  this[offset] = value & 0xFF;\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n    checkInt(this, value, offset, byteLength, maxBytes, 0);\n  }\n\n  let i = byteLength - 1;\n  let mul = 1;\n  this[offset + i] = value & 0xFF;\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n  this[offset] = (value & 0xff);\n  return offset + 1\n};\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  return offset + 2\n};\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n  this[offset] = (value >>> 8);\n  this[offset + 1] = (value & 0xff);\n  return offset + 2\n};\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n  this[offset + 3] = (value >>> 24);\n  this[offset + 2] = (value >>> 16);\n  this[offset + 1] = (value >>> 8);\n  this[offset] = (value & 0xff);\n  return offset + 4\n};\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n  this[offset] = (value >>> 24);\n  this[offset + 1] = (value >>> 16);\n  this[offset + 2] = (value >>> 8);\n  this[offset + 3] = (value & 0xff);\n  return offset + 4\n};\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset + 7] = lo;\n  lo = lo >> 8;\n  buf[offset + 6] = lo;\n  lo = lo >> 8;\n  buf[offset + 5] = lo;\n  lo = lo >> 8;\n  buf[offset + 4] = lo;\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));\n  buf[offset + 3] = hi;\n  hi = hi >> 8;\n  buf[offset + 2] = hi;\n  hi = hi >> 8;\n  buf[offset + 1] = hi;\n  hi = hi >> 8;\n  buf[offset] = hi;\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n});\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n});\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1);\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit);\n  }\n\n  let i = 0;\n  let mul = 1;\n  let sub = 0;\n  this[offset] = value & 0xFF;\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1;\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1);\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit);\n  }\n\n  let i = byteLength - 1;\n  let mul = 1;\n  let sub = 0;\n  this[offset + i] = value & 0xFF;\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1;\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);\n  if (value < 0) value = 0xff + value + 1;\n  this[offset] = (value & 0xff);\n  return offset + 1\n};\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  return offset + 2\n};\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n  this[offset] = (value >>> 8);\n  this[offset + 1] = (value & 0xff);\n  return offset + 2\n};\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  this[offset + 2] = (value >>> 16);\n  this[offset + 3] = (value >>> 24);\n  return offset + 4\n};\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n  if (value < 0) value = 0xffffffff + value + 1;\n  this[offset] = (value >>> 24);\n  this[offset + 1] = (value >>> 16);\n  this[offset + 2] = (value >>> 8);\n  this[offset + 3] = (value & 0xff);\n  return offset + 4\n};\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n});\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n});\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4);\n  }\n  ieee754$1.write(buf, value, offset, littleEndian, 23, 4);\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n};\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n};\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8);\n  }\n  ieee754$1.write(buf, value, offset, littleEndian, 52, 8);\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n};\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n};\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0;\n  if (!end && end !== 0) end = this.length;\n  if (targetStart >= target.length) targetStart = target.length;\n  if (!targetStart) targetStart = 0;\n  if (end > 0 && end < start) end = start;\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length;\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start;\n  }\n\n  const len = end - start;\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end);\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    );\n  }\n\n  return len\n};\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start;\n      start = 0;\n      end = this.length;\n    } else if (typeof end === 'string') {\n      encoding = end;\n      end = this.length;\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0);\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code;\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255;\n  } else if (typeof val === 'boolean') {\n    val = Number(val);\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0;\n  end = end === undefined ? this.length : end >>> 0;\n\n  if (!val) val = 0;\n\n  let i;\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val;\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding);\n    const len = bytes.length;\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len];\n    }\n  }\n\n  return this\n};\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {};\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super();\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      });\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`;\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack; // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name;\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      });\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  };\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError);\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError);\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`;\n    let received = input;\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input));\n    } else if (typeof input === 'bigint') {\n      received = String(input);\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received);\n      }\n      received += 'n';\n    }\n    msg += ` It must be ${range}. Received ${received}`;\n    return msg\n  }, RangeError);\n\nfunction addNumericalSeparator (val) {\n  let res = '';\n  let i = val.length;\n  const start = val[0] === '-' ? 1 : 0;\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`;\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset');\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1));\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : '';\n    let range;\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`;\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`;\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`;\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength);\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type);\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0];\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '');\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '=';\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity;\n  let codePoint;\n  const length = string.length;\n  let leadSurrogate = null;\n  const bytes = [];\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i);\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint;\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n        leadSurrogate = codePoint;\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000;\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n    }\n\n    leadSurrogate = null;\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint);\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      );\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      );\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      );\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = [];\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF);\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo;\n  const byteArray = [];\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i);\n    hi = c >> 8;\n    lo = c % 256;\n    byteArray.push(lo);\n    byteArray.push(hi);\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i;\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i];\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef';\n  const table = new Array(256);\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16;\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j];\n    }\n  }\n  return table\n})();\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n}(buffer));\n\nvar global$1 = (typeof global !== \"undefined\" ? global :\n  typeof self !== \"undefined\" ? self :\n  typeof window !== \"undefined\" ? window : {});\n\nvar inherits;\nif (typeof Object.create === 'function'){\n  inherits = function inherits(ctor, superCtor) {\n    // implementation from standard node.js 'util' module\n    ctor.super_ = superCtor;\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  inherits = 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}\nvar inherits$1 = inherits;\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect$1(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    _extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect$1.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect$1.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect$1.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect$1.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect$1.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== inspect$1 &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var length = output.reduce(function(prev, cur) {\n    if (cur.indexOf('\\n') >= 0) ;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\n\nfunction isNull(arg) {\n  return arg === null;\n}\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\nfunction _extend(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n}\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n\n  var x = a.length;\n  var y = b.length;\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nvar hasOwn = Object.prototype.hasOwnProperty;\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) {\n    if (hasOwn.call(obj, key)) keys.push(key);\n  }\n  return keys;\n};\nvar pSlice = Array.prototype.slice;\nvar _functionsHaveNames;\nfunction functionsHaveNames() {\n  if (typeof _functionsHaveNames !== 'undefined') {\n    return _functionsHaveNames;\n  }\n  return _functionsHaveNames = (function () {\n    return function foo() {}.name === 'foo';\n  }());\n}\nfunction pToString (obj) {\n  return Object.prototype.toString.call(obj);\n}\nfunction isView(arrbuf) {\n  if (buffer.isBuffer(arrbuf)) {\n    return false;\n  }\n  if (typeof global$1.ArrayBuffer !== 'function') {\n    return false;\n  }\n  if (typeof ArrayBuffer.isView === 'function') {\n    return ArrayBuffer.isView(arrbuf);\n  }\n  if (!arrbuf) {\n    return false;\n  }\n  if (arrbuf instanceof DataView) {\n    return true;\n  }\n  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {\n    return true;\n  }\n  return false;\n}\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nfunction assert(value, message) {\n  if (!value) fail(value, true, message, '==', ok);\n}\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n//                             actual: actual,\n//                             expected: expected })\n\nvar regex = /\\s*function\\s+([^\\(\\s]*)\\s*/;\n// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js\nfunction getName(func) {\n  if (!isFunction(func)) {\n    return;\n  }\n  if (functionsHaveNames()) {\n    return func.name;\n  }\n  var str = func.toString();\n  var match = str.match(regex);\n  return match && match[1];\n}\nassert.AssertionError = AssertionError;\nfunction AssertionError(options) {\n  this.name = 'AssertionError';\n  this.actual = options.actual;\n  this.expected = options.expected;\n  this.operator = options.operator;\n  if (options.message) {\n    this.message = options.message;\n    this.generatedMessage = false;\n  } else {\n    this.message = getMessage(this);\n    this.generatedMessage = true;\n  }\n  var stackStartFunction = options.stackStartFunction || fail;\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(this, stackStartFunction);\n  } else {\n    // non v8 browsers so we can have a stacktrace\n    var err = new Error();\n    if (err.stack) {\n      var out = err.stack;\n\n      // try to strip useless frames\n      var fn_name = getName(stackStartFunction);\n      var idx = out.indexOf('\\n' + fn_name);\n      if (idx >= 0) {\n        // once we have located the function frame\n        // we need to strip out everything before it (and its line)\n        var next_line = out.indexOf('\\n', idx + 1);\n        out = out.substring(next_line + 1);\n      }\n\n      this.stack = out;\n    }\n  }\n}\n\n// assert.AssertionError instanceof Error\ninherits$1(AssertionError, Error);\n\nfunction truncate(s, n) {\n  if (typeof s === 'string') {\n    return s.length < n ? s : s.slice(0, n);\n  } else {\n    return s;\n  }\n}\nfunction inspect(something) {\n  if (functionsHaveNames() || !isFunction(something)) {\n    return inspect$1(something);\n  }\n  var rawname = getName(something);\n  var name = rawname ? ': ' + rawname : '';\n  return '[Function' +  name + ']';\n}\nfunction getMessage(self) {\n  return truncate(inspect(self.actual), 128) + ' ' +\n         self.operator + ' ' +\n         truncate(inspect(self.expected), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided.  All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n  throw new AssertionError({\n    message: message,\n    actual: actual,\n    expected: expected,\n    operator: operator,\n    stackStartFunction: stackStartFunction\n  });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n  if (!value) fail(value, true, message, '==', ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\nassert.equal = equal;\nfunction equal(actual, expected, message) {\n  if (actual != expected) fail(actual, expected, message, '==', equal);\n}\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\nassert.notEqual = notEqual;\nfunction notEqual(actual, expected, message) {\n  if (actual == expected) {\n    fail(actual, expected, message, '!=', notEqual);\n  }\n}\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\nassert.deepEqual = deepEqual;\nfunction deepEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'deepEqual', deepEqual);\n  }\n}\nassert.deepStrictEqual = deepStrictEqual;\nfunction deepStrictEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'deepStrictEqual', deepStrictEqual);\n  }\n}\n\nfunction _deepEqual(actual, expected, strict, memos) {\n  // 7.1. All identical values are equivalent, as determined by ===.\n  if (actual === expected) {\n    return true;\n  } else if (buffer.isBuffer(actual) && buffer.isBuffer(expected)) {\n    return compare(actual, expected) === 0;\n\n  // 7.2. If the expected value is a Date object, the actual value is\n  // equivalent if it is also a Date object that refers to the same time.\n  } else if (isDate(actual) && isDate(expected)) {\n    return actual.getTime() === expected.getTime();\n\n  // 7.3 If the expected value is a RegExp object, the actual value is\n  // equivalent if it is also a RegExp object with the same source and\n  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n  } else if (isRegExp(actual) && isRegExp(expected)) {\n    return actual.source === expected.source &&\n           actual.global === expected.global &&\n           actual.multiline === expected.multiline &&\n           actual.lastIndex === expected.lastIndex &&\n           actual.ignoreCase === expected.ignoreCase;\n\n  // 7.4. Other pairs that do not both pass typeof value == 'object',\n  // equivalence is determined by ==.\n  } else if ((actual === null || typeof actual !== 'object') &&\n             (expected === null || typeof expected !== 'object')) {\n    return strict ? actual === expected : actual == expected;\n\n  // If both values are instances of typed arrays, wrap their underlying\n  // ArrayBuffers in a Buffer each to increase performance\n  // This optimization requires the arrays to have the same type as checked by\n  // Object.prototype.toString (aka pToString). Never perform binary\n  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their\n  // bit patterns are not identical.\n  } else if (isView(actual) && isView(expected) &&\n             pToString(actual) === pToString(expected) &&\n             !(actual instanceof Float32Array ||\n               actual instanceof Float64Array)) {\n    return compare(new Uint8Array(actual.buffer),\n                   new Uint8Array(expected.buffer)) === 0;\n\n  // 7.5 For all other Object pairs, including Array objects, equivalence is\n  // determined by having the same number of owned properties (as verified\n  // with Object.prototype.hasOwnProperty.call), the same set of keys\n  // (although not necessarily the same order), equivalent values for every\n  // corresponding key, and an identical 'prototype' property. Note: this\n  // accounts for both named and indexed properties on Arrays.\n  } else if (buffer.isBuffer(actual) !== buffer.isBuffer(expected)) {\n    return false;\n  } else {\n    memos = memos || {actual: [], expected: []};\n\n    var actualIndex = memos.actual.indexOf(actual);\n    if (actualIndex !== -1) {\n      if (actualIndex === memos.expected.indexOf(expected)) {\n        return true;\n      }\n    }\n\n    memos.actual.push(actual);\n    memos.expected.push(expected);\n\n    return objEquiv(actual, expected, strict, memos);\n  }\n}\n\nfunction isArguments(object) {\n  return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b, strict, actualVisitedObjects) {\n  if (a === null || a === undefined || b === null || b === undefined)\n    return false;\n  // if one is a primitive, the other must be same\n  if (isPrimitive(a) || isPrimitive(b))\n    return a === b;\n  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n    return false;\n  var aIsArgs = isArguments(a);\n  var bIsArgs = isArguments(b);\n  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n    return false;\n  if (aIsArgs) {\n    a = pSlice.call(a);\n    b = pSlice.call(b);\n    return _deepEqual(a, b, strict);\n  }\n  var ka = objectKeys(a);\n  var kb = objectKeys(b);\n  var key, i;\n  // having the same number of owned properties (keys incorporates\n  // hasOwnProperty)\n  if (ka.length !== kb.length)\n    return false;\n  //the same set of keys (although not necessarily the same order),\n  ka.sort();\n  kb.sort();\n  //~~~cheap key test\n  for (i = ka.length - 1; i >= 0; i--) {\n    if (ka[i] !== kb[i])\n      return false;\n  }\n  //equivalent values for every corresponding key, and\n  //~~~possibly expensive deep test\n  for (i = ka.length - 1; i >= 0; i--) {\n    key = ka[i];\n    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))\n      return false;\n  }\n  return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\nassert.notDeepEqual = notDeepEqual;\nfunction notDeepEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'notDeepEqual', notDeepEqual);\n  }\n}\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);\n  }\n}\n\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\nassert.strictEqual = strictEqual;\nfunction strictEqual(actual, expected, message) {\n  if (actual !== expected) {\n    fail(actual, expected, message, '===', strictEqual);\n  }\n}\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);\nassert.notStrictEqual = notStrictEqual;\nfunction notStrictEqual(actual, expected, message) {\n  if (actual === expected) {\n    fail(actual, expected, message, '!==', notStrictEqual);\n  }\n}\n\nfunction expectedException(actual, expected) {\n  if (!actual || !expected) {\n    return false;\n  }\n\n  if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n    return expected.test(actual);\n  }\n\n  try {\n    if (actual instanceof expected) {\n      return true;\n    }\n  } catch (e) {\n    // Ignore.  The instanceof check doesn't work for arrow functions.\n  }\n\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n\n  return expected.call({}, actual) === true;\n}\n\nfunction _tryBlock(block) {\n  var error;\n  try {\n    block();\n  } catch (e) {\n    error = e;\n  }\n  return error;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n  var actual;\n\n  if (typeof block !== 'function') {\n    throw new TypeError('\"block\" argument must be a function');\n  }\n\n  if (typeof expected === 'string') {\n    message = expected;\n    expected = null;\n  }\n\n  actual = _tryBlock(block);\n\n  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n            (message ? ' ' + message : '.');\n\n  if (shouldThrow && !actual) {\n    fail(actual, expected, 'Missing expected exception' + message);\n  }\n\n  var userProvidedMessage = typeof message === 'string';\n  var isUnwantedException = !shouldThrow && isError(actual);\n  var isUnexpectedException = !shouldThrow && actual && !expected;\n\n  if ((isUnwantedException &&\n      userProvidedMessage &&\n      expectedException(actual, expected)) ||\n      isUnexpectedException) {\n    fail(actual, expected, 'Got unwanted exception' + message);\n  }\n\n  if ((shouldThrow && actual && expected &&\n      !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n    throw actual;\n  }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\nassert.throws = throws;\nfunction throws(block, /*optional*/error, /*optional*/message) {\n  _throws(true, block, error, message);\n}\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = doesNotThrow;\nfunction doesNotThrow(block, /*optional*/error, /*optional*/message) {\n  _throws(false, block, error, message);\n}\n\nassert.ifError = ifError;\nfunction ifError(err) {\n  if (err) throw err;\n}\n\nvar Layout$1 = {};\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nLayout$1.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\nLayout$1.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n  if ('function' !== typeof Class) {\n    throw new TypeError('Class must be constructor');\n  }\n  if (Class.hasOwnProperty('layout_')) {\n    throw new Error('Class is already bound to a layout');\n  }\n  if (!(layout && (layout instanceof Layout))) {\n    throw new TypeError('layout must be a Layout');\n  }\n  if (layout.hasOwnProperty('boundConstructor_')) {\n    throw new Error('layout is already bound to a constructor');\n  }\n  Class.layout_ = layout;\n  layout.boundConstructor_ = Class;\n  layout.makeDestinationObject = (() => new Class());\n  Object.defineProperty(Class.prototype, 'encode', {\n    value: function(b, offset) {\n      return layout.encode(this, b, offset);\n    },\n    writable: true,\n  });\n  Object.defineProperty(Class, 'decode', {\n    value: function(b, offset) {\n      return layout.decode(b, offset);\n    },\n    writable: true,\n  });\n}\nLayout$1.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n  constructor(elementSpan, property) {\n    if (undefined === elementSpan) {\n      elementSpan = 1;\n    }\n    if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n      throw new TypeError('elementSpan must be a (positive) integer');\n    }\n    super(-1, property);\n\n    /** The layout for individual elements of the sequence.  The value\n     * must be a positive integer.  If not provided, the value will be\n     * 1. */\n    this.elementSpan = elementSpan;\n  }\n\n  /** @override */\n  isCount() {\n    return true;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rem = b.length - offset;\n    return Math.floor(rem / this.elementSpan);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    return 0;\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readUInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatLE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatBE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleLE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleBE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n  constructor(elementLayout, count, property) {\n    if (!(elementLayout instanceof Layout)) {\n      throw new TypeError('elementLayout must be a Layout');\n    }\n    if (!(((count instanceof ExternalLayout) && count.isCount())\n          || (Number.isInteger(count) && (0 <= count)))) {\n      throw new TypeError('count must be non-negative integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n    let span = -1;\n    if ((!(count instanceof ExternalLayout))\n        && (0 < elementLayout.span)) {\n      span = count * elementLayout.span;\n    }\n\n    super(span, property);\n\n    /** The layout for individual elements of the sequence. */\n    this.elementLayout = elementLayout;\n\n    /** The number of elements in the sequence.\n     *\n     * This will be either a non-negative integer or an instance of\n     * {@link ExternalLayout} for which {@link\n     * ExternalLayout#isCount|isCount()} is `true`. */\n    this.count = count;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    if (0 < this.elementLayout.span) {\n      span = count * this.elementLayout.span;\n    } else {\n      let idx = 0;\n      while (idx < count) {\n        span += this.elementLayout.getSpan(b, offset + span);\n        ++idx;\n      }\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rv = [];\n    let i = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    while (i < count) {\n      rv.push(this.elementLayout.decode(b, offset));\n      offset += this.elementLayout.getSpan(b, offset);\n      i += 1;\n    }\n    return rv;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n   *\n   * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n   * the unused space in the buffer is left unchanged.  If `src` is\n   * longer than {@link Sequence#count|count} the unneeded elements are\n   * ignored.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const elo = this.elementLayout;\n    const span = src.reduce((span, v) => {\n      return span + elo.encode(v, b, offset + span);\n    }, 0);\n    if (this.count instanceof ExternalLayout) {\n      this.count.encode(src.length, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (buffer.Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n  if (0 > v) {\n    v += 0x100000000;\n  }\n  return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n  constructor(word, msb, property) {\n    if (!((word instanceof UInt)\n          || (word instanceof UIntBE))) {\n      throw new TypeError('word must be a UInt or UIntBE layout');\n    }\n    if (('string' === typeof msb)\n        && (undefined === property)) {\n      property = msb;\n      msb = undefined;\n    }\n    if (4 < word.span) {\n      throw new RangeError('word cannot exceed 32 bits');\n    }\n    super(word.span, property);\n\n    /** The layout used for the packed value.  {@link BitField}\n     * instances are packed sequentially depending on {@link\n     * BitStructure#msb|msb}. */\n    this.word = word;\n\n    /** Whether the bit sequences are packed starting at the most\n     * significant bit growing down (`true`), or the least significant\n     * bit growing up (`false`).\n     *\n     * **NOTE** Regardless of this value, the least significant bit of\n     * any {@link BitField} value is the least significant bit of the\n     * corresponding section of the packed value. */\n    this.msb = !!msb;\n\n    /** The sequence of {@link BitField} layouts that comprise the\n     * packed structure.\n     *\n     * **NOTE** The array remains mutable to allow fields to be {@link\n     * BitStructure#addField|added} after construction.  Users should\n     * not manipulate the content of this property.*/\n    this.fields = [];\n\n    /* Storage for the value.  Capture a variable instead of using an\n     * instance property because we don't want anything to change the\n     * value without going through the mutator. */\n    let value = 0;\n    this._packedSetValue = function(v) {\n      value = fixBitwiseResult(v);\n      return this;\n    };\n    this._packedGetValue = function() {\n      return value;\n    };\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(value);\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the packed\n   * value is left unmodified.  Unused bits are also left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          fd.encode(fv);\n        }\n      }\n    }\n    return this.word.encode(this._packedGetValue(), b, offset);\n  }\n\n  /** Register a new bitfield with a containing bit structure.  The\n   * resulting bitfield is returned.\n   *\n   * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {BitField} */\n  addField(bits, property) {\n    const bf = new BitField(this, bits, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /** As with {@link BitStructure#addField|addField} for single-bit\n   * fields with `boolean` value representation.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {Boolean} */\n  addBoolean(property) {\n    // This is my Boolean, not the Javascript one.\n    // eslint-disable-next-line no-new-wrappers\n    const bf = new Boolean(this, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /**\n   * Get access to the bit field for a given property.\n   *\n   * @param {String} property - the bit field of interest.\n   *\n   * @return {BitField} - the field associated with `property`, or\n   * undefined if there is no such property.\n   */\n  fieldFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n  constructor(container, bits, property) {\n    if (!(container instanceof BitStructure)) {\n      throw new TypeError('container must be a BitStructure');\n    }\n    if ((!Number.isInteger(bits)) || (0 >= bits)) {\n      throw new TypeError('bits must be positive integer');\n    }\n    const totalBits = 8 * container.span;\n    const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n    if ((bits + usedBits) > totalBits) {\n      throw new Error('bits too long for span remainder ('\n                      + (totalBits - usedBits) + ' of '\n                      + totalBits + ' remain)');\n    }\n\n    /** The {@link BitStructure} instance to which this bit field\n     * belongs. */\n    this.container = container;\n\n    /** The span of this value in bits. */\n    this.bits = bits;\n\n    /** A mask of {@link BitField#bits|bits} bits isolating value bits\n     * that fit within the field.\n     *\n     * That is, it masks a value that has not yet been shifted into\n     * position within its containing packed integer. */\n    this.valueMask = (1 << bits) - 1;\n    if (32 === bits) { // shifted value out of range\n      this.valueMask = 0xFFFFFFFF;\n    }\n\n    /** The offset of the value within the containing packed unsigned\n     * integer.  The least significant bit of the packed value is at\n     * offset zero, regardless of bit ordering used. */\n    this.start = usedBits;\n    if (this.container.msb) {\n      this.start = totalBits - usedBits - bits;\n    }\n\n    /** A mask of {@link BitField#bits|bits} isolating the field value\n     * within the containing packed unsigned integer. */\n    this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n    /** The property name used when this bitfield is represented in an\n     * Object.\n     *\n     * Intended to be functionally equivalent to {@link\n     * Layout#property}.\n     *\n     * If left undefined the corresponding span of bits will be\n     * treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field. */\n  decode() {\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(word & this.wordMask);\n    const value = wordValue >>> this.start;\n    return value;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field.\n   *\n   * **NOTE** This is not a specialization of {@link\n   * Layout#encode|Layout.encode} and there is no return value. */\n  encode(value) {\n    if ((!Number.isInteger(value))\n        || (value !== fixBitwiseResult(value & this.valueMask))) {\n      throw new TypeError(nameWithProperty('BitField.encode', this)\n                          + ' value must be integer not exceeding ' + this.valueMask);\n    }\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(value << this.start);\n    this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n                                   | wordValue);\n  };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n  constructor(container, property) {\n    super(container, 1, property);\n  }\n\n  /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n   *\n   * @returns {boolean} */\n  decode(b, offset) {\n    return !!BitField.prototype.decode.call(this, b, offset);\n  }\n\n  /** @override */\n  encode(value) {\n    if ('boolean' === typeof value) {\n      // BitField requires integer values\n      value = +value;\n    }\n    return BitField.prototype.encode.call(this, value);\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(buffer.Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n  constructor(property) {\n    super(-1, property);\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!buffer.Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let idx = offset;\n    while ((idx < b.length) && (0 !== b[idx])) {\n      idx += 1;\n    }\n    return 1 + idx - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    return b.slice(offset, offset + span - 1).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new buffer.Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    b[offset + span] = 0;\n    return span + 1;\n  }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n  constructor(maxSpan, property) {\n    if (('string' === typeof maxSpan)\n        && (undefined === property)) {\n      property = maxSpan;\n      maxSpan = undefined;\n    }\n    if (undefined === maxSpan) {\n      maxSpan = -1;\n    } else if (!Number.isInteger(maxSpan)) {\n      throw new TypeError('maxSpan must be an integer');\n    }\n\n    super(-1, property);\n\n    /** The maximum span of the layout in bytes.\n     *\n     * Positive values are generally expected.  Zero is abnormal.\n     * Attempts to encode or decode a value that exceeds this length\n     * will throw a `RangeError`.\n     *\n     * A negative value indicates that there is no bound on the length\n     * of the content. */\n    this.maxSpan = maxSpan;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!buffer.Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.length - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    return b.slice(offset, offset + span).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new buffer.Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    return span;\n  }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n  constructor(value, property) {\n    super(0, property);\n\n    /** The value produced by this constant when the layout is {@link\n     * Constant#decode|decoded}.\n     *\n     * Any JavaScript value including `null` and `undefined` is\n     * permitted.\n     *\n     * **WARNING** If `value` passed in the constructor was not\n     * frozen, it is possible for users of decoded values to change\n     * the content of the value. */\n    this.value = value;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    return this.value;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    /* Constants take no space */\n    return 0;\n  }\n}\n\nLayout$1.ExternalLayout = ExternalLayout;\nLayout$1.GreedyCount = GreedyCount;\nLayout$1.OffsetLayout = OffsetLayout;\nLayout$1.UInt = UInt;\nLayout$1.UIntBE = UIntBE;\nLayout$1.Int = Int;\nLayout$1.IntBE = IntBE;\nLayout$1.Float = Float;\nLayout$1.FloatBE = FloatBE;\nLayout$1.Double = Double;\nLayout$1.DoubleBE = DoubleBE;\nLayout$1.Sequence = Sequence;\nLayout$1.Structure = Structure;\nLayout$1.UnionDiscriminator = UnionDiscriminator;\nLayout$1.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nLayout$1.Union = Union;\nLayout$1.VariantLayout = VariantLayout;\nLayout$1.BitStructure = BitStructure;\nLayout$1.BitField = BitField;\nLayout$1.Boolean = Boolean;\nLayout$1.Blob = Blob;\nLayout$1.CString = CString;\nLayout$1.UTF8 = UTF8;\nLayout$1.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nLayout$1.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nLayout$1.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = Layout$1.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nLayout$1.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nLayout$1.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = Layout$1.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nLayout$1.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nLayout$1.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nLayout$1.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nLayout$1.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nLayout$1.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nLayout$1.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nLayout$1.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nLayout$1.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nLayout$1.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nLayout$1.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nLayout$1.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nLayout$1.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nLayout$1.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nLayout$1.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nLayout$1.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nLayout$1.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nLayout$1.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nLayout$1.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nLayout$1.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nLayout$1.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nLayout$1.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nLayout$1.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nLayout$1.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nLayout$1.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nLayout$1.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nLayout$1.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = Layout$1.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nLayout$1.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nLayout$1.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nLayout$1.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nLayout$1.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = Layout$1.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nLayout$1.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nLayout$1.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nLayout$1.const = ((value, property) => new Constant(value, property));\n\n//      \n/**\n * Layout for a public key\n */\n\nconst publicKey = (property = 'publicKey') => {\n  return blob(32, property);\n};\n/**\n * Layout for a 64bit unsigned value\n */\n\nconst uint64 = (property = 'uint64') => {\n  return blob(8, property);\n};\n\n//      \nfunction sendAndConfirmTransaction(title, connection, transaction, ...signers) {\n  return sendAndConfirmTransaction$1(connection, transaction, signers, {\n    skipPreflight: false\n  });\n}\n\nconst TOKEN_PROGRAM_ID = new PublicKey('TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA');\nconst ASSOCIATED_TOKEN_PROGRAM_ID = new PublicKey('ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL');\nconst FAILED_TO_FIND_ACCOUNT = 'Failed to find account';\nconst INVALID_ACCOUNT_OWNER = 'Invalid account owner';\n/**\n * Unfortunately, BufferLayout.encode uses an `instanceof` check for `Buffer`\n * which fails when using `publicKey.toBuffer()` directly because the bundled `Buffer`\n * class in `@solana/web3.js` is different from the bundled `Buffer` class in this package\n */\n\nfunction pubkeyToBuffer(publicKey) {\n  return buffer.Buffer.from(publicKey.toBuffer());\n}\n/**\n * 64-bit value\n */\n\n\nclass u64 extends BN {\n  /**\n   * Convert to Buffer representation\n   */\n  toBuffer() {\n    const a = super.toArray().reverse();\n    const b = buffer.Buffer.from(a);\n\n    if (b.length === 8) {\n      return b;\n    }\n\n    assert(b.length < 8, 'u64 too large');\n    const zeroPad = buffer.Buffer.alloc(8);\n    b.copy(zeroPad);\n    return zeroPad;\n  }\n  /**\n   * Construct a u64 from Buffer representation\n   */\n\n\n  static fromBuffer(buffer) {\n    assert(buffer.length === 8, `Invalid buffer length: ${buffer.length}`);\n    return new u64([...buffer].reverse().map(i => `00${i.toString(16)}`.slice(-2)).join(''), 16);\n  }\n\n}\n\nfunction isAccount(accountOrPublicKey) {\n  return 'publicKey' in accountOrPublicKey;\n}\n\nconst AuthorityTypeCodes = {\n  MintTokens: 0,\n  FreezeAccount: 1,\n  AccountOwner: 2,\n  CloseAccount: 3\n}; // The address of the special mint for wrapped native token.\n\nconst NATIVE_MINT = new PublicKey('So11111111111111111111111111111111111111112');\n/**\n * Information about the mint\n */\n\nconst MintLayout = struct([u32('mintAuthorityOption'), publicKey('mintAuthority'), uint64('supply'), u8('decimals'), u8('isInitialized'), u32('freezeAuthorityOption'), publicKey('freezeAuthority')]);\n/**\n * Information about an account\n */\n\n/**\n * @private\n */\n\nconst AccountLayout = struct([publicKey('mint'), publicKey('owner'), uint64('amount'), u32('delegateOption'), publicKey('delegate'), u8('state'), u32('isNativeOption'), uint64('isNative'), uint64('delegatedAmount'), u32('closeAuthorityOption'), publicKey('closeAuthority')]);\n/**\n * Information about an multisig\n */\n\n/**\n * @private\n */\n\nconst MultisigLayout = struct([u8('m'), u8('n'), u8('is_initialized'), publicKey('signer1'), publicKey('signer2'), publicKey('signer3'), publicKey('signer4'), publicKey('signer5'), publicKey('signer6'), publicKey('signer7'), publicKey('signer8'), publicKey('signer9'), publicKey('signer10'), publicKey('signer11')]);\n/**\n * An ERC20-like Token\n */\n\nclass Token {\n  /**\n   * @private\n   */\n\n  /**\n   * The public key identifying this mint\n   */\n\n  /**\n   * Program Identifier for the Token program\n   */\n\n  /**\n   * Program Identifier for the Associated Token program\n   */\n\n  /**\n   * Fee payer\n   */\n\n  /**\n   * Create a Token object attached to the specific mint\n   *\n   * @param connection The connection to use\n   * @param token Public key of the mint\n   * @param programId token programId\n   * @param payer Payer of fees\n   */\n  constructor(connection, publicKey, programId, payer) {\n    _defineProperty(this, \"connection\", void 0);\n\n    _defineProperty(this, \"publicKey\", void 0);\n\n    _defineProperty(this, \"programId\", void 0);\n\n    _defineProperty(this, \"associatedProgramId\", void 0);\n\n    _defineProperty(this, \"payer\", void 0);\n\n    Object.assign(this, {\n      connection,\n      publicKey,\n      programId,\n      payer,\n      // Hard code is ok; Overriding is needed only for tests\n      associatedProgramId: ASSOCIATED_TOKEN_PROGRAM_ID\n    });\n  }\n  /**\n   * Get the minimum balance for the mint to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptMint(connection) {\n    return await connection.getMinimumBalanceForRentExemption(MintLayout.span);\n  }\n  /**\n   * Get the minimum balance for the account to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptAccount(connection) {\n    return await connection.getMinimumBalanceForRentExemption(AccountLayout.span);\n  }\n  /**\n   * Get the minimum balance for the multsig to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptMultisig(connection) {\n    return await connection.getMinimumBalanceForRentExemption(MultisigLayout.span);\n  }\n  /**\n   * Create and initialize a token.\n   *\n   * @param connection The connection to use\n   * @param payer Fee payer for transaction\n   * @param mintAuthority Account or multisig that will control minting\n   * @param freezeAuthority Optional account or multisig that can freeze token accounts\n   * @param decimals Location of the decimal place\n   * @param programId Optional token programId, uses the system programId by default\n   * @return Token object for the newly minted token\n   */\n\n\n  static async createMint(connection, payer, mintAuthority, freezeAuthority, decimals, programId) {\n    const mintAccount = Keypair.generate();\n    const token = new Token(connection, mintAccount.publicKey, programId, payer); // Allocate memory for the account\n\n    const balanceNeeded = await Token.getMinBalanceRentForExemptMint(connection);\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: payer.publicKey,\n      newAccountPubkey: mintAccount.publicKey,\n      lamports: balanceNeeded,\n      space: MintLayout.span,\n      programId\n    }));\n    transaction.add(Token.createInitMintInstruction(programId, mintAccount.publicKey, decimals, mintAuthority, freezeAuthority)); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeMint', connection, transaction, payer, mintAccount);\n    return token;\n  }\n  /**\n   * Create and initialize a new account.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return Public key of the new empty account\n   */\n\n\n  async createAccount(owner) {\n    // Allocate memory for the account\n    const balanceNeeded = await Token.getMinBalanceRentForExemptAccount(this.connection);\n    const newAccount = Keypair.generate();\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: this.payer.publicKey,\n      newAccountPubkey: newAccount.publicKey,\n      lamports: balanceNeeded,\n      space: AccountLayout.span,\n      programId: this.programId\n    }));\n    const mintPublicKey = this.publicKey;\n    transaction.add(Token.createInitAccountInstruction(this.programId, mintPublicKey, newAccount.publicKey, owner)); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeAccount', this.connection, transaction, this.payer, newAccount);\n    return newAccount.publicKey;\n  }\n  /**\n   * Create and initialize the associated account.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return Public key of the new associated account\n   */\n\n\n  async createAssociatedTokenAccount(owner) {\n    const associatedAddress = await Token.getAssociatedTokenAddress(this.associatedProgramId, this.programId, this.publicKey, owner);\n    return this.createAssociatedTokenAccountInternal(owner, associatedAddress);\n  }\n\n  async createAssociatedTokenAccountInternal(owner, associatedAddress) {\n    await sendAndConfirmTransaction('CreateAssociatedTokenAccount', this.connection, new Transaction().add(Token.createAssociatedTokenAccountInstruction(this.associatedProgramId, this.programId, this.publicKey, associatedAddress, owner, this.payer.publicKey)), this.payer);\n    return associatedAddress;\n  }\n  /**\n   * Retrieve the associated account or create one if not found.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return The new associated account\n   */\n\n\n  async getOrCreateAssociatedAccountInfo(owner) {\n    const associatedAddress = await Token.getAssociatedTokenAddress(this.associatedProgramId, this.programId, this.publicKey, owner); // This is the optimum logic, considering TX fee, client-side computation,\n    // RPC roundtrips and guaranteed idempotent.\n    // Sadly we can't do this atomically;\n\n    try {\n      return await this.getAccountInfo(associatedAddress);\n    } catch (err) {\n      // INVALID_ACCOUNT_OWNER can be possible if the associatedAddress has\n      // already been received some lamports (= became system accounts).\n      // Assuming program derived addressing is safe, this is the only case\n      // for the INVALID_ACCOUNT_OWNER in this code-path\n      if (err.message === FAILED_TO_FIND_ACCOUNT || err.message === INVALID_ACCOUNT_OWNER) {\n        // as this isn't atomic, it's possible others can create associated\n        // accounts meanwhile\n        try {\n          await this.createAssociatedTokenAccountInternal(owner, associatedAddress);\n        } catch (err) {// ignore all errors; for now there is no API compatible way to\n          // selectively ignore the expected instruction error if the\n          // associated account is existing already.\n        } // Now this should always succeed\n\n\n        return await this.getAccountInfo(associatedAddress);\n      } else {\n        throw err;\n      }\n    }\n  }\n  /**\n   * Create and initialize a new account on the special native token mint.\n   *\n   * In order to be wrapped, the account must have a balance of native tokens\n   * when it is initialized with the token program.\n   *\n   * This function sends lamports to the new account before initializing it.\n   *\n   * @param connection A solana web3 connection\n   * @param programId The token program ID\n   * @param owner The owner of the new token account\n   * @param payer The source of the lamports to initialize, and payer of the initialization fees.\n   * @param amount The amount of lamports to wrap\n   * @return {Promise<PublicKey>} The new token account\n   */\n\n\n  static async createWrappedNativeAccount(connection, programId, owner, payer, amount) {\n    // Allocate memory for the account\n    const balanceNeeded = await Token.getMinBalanceRentForExemptAccount(connection); // Create a new account\n\n    const newAccount = Keypair.generate();\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: payer.publicKey,\n      newAccountPubkey: newAccount.publicKey,\n      lamports: balanceNeeded,\n      space: AccountLayout.span,\n      programId\n    })); // Send lamports to it (these will be wrapped into native tokens by the token program)\n\n    transaction.add(SystemProgram.transfer({\n      fromPubkey: payer.publicKey,\n      toPubkey: newAccount.publicKey,\n      lamports: amount\n    })); // Assign the new account to the native token mint.\n    // the account will be initialized with a balance equal to the native token balance.\n    // (i.e. amount)\n\n    transaction.add(Token.createInitAccountInstruction(programId, NATIVE_MINT, newAccount.publicKey, owner)); // Send the three instructions\n\n    await sendAndConfirmTransaction('createAccount, transfer, and initializeAccount', connection, transaction, payer, newAccount);\n    return newAccount.publicKey;\n  }\n  /**\n   * Create and initialize a new multisig.\n   *\n   * This account may then be used for multisignature verification\n   *\n   * @param m Number of required signatures\n   * @param signers Full set of signers\n   * @return Public key of the new multisig account\n   */\n\n\n  async createMultisig(m, signers) {\n    const multisigAccount = Keypair.generate(); // Allocate memory for the account\n\n    const balanceNeeded = await Token.getMinBalanceRentForExemptMultisig(this.connection);\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: this.payer.publicKey,\n      newAccountPubkey: multisigAccount.publicKey,\n      lamports: balanceNeeded,\n      space: MultisigLayout.span,\n      programId: this.programId\n    })); // create the new account\n\n    let keys = [{\n      pubkey: multisigAccount.publicKey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    signers.forEach(signer => keys.push({\n      pubkey: signer,\n      isSigner: false,\n      isWritable: false\n    }));\n    const dataLayout = struct([u8('instruction'), u8('m')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 2,\n      // InitializeMultisig instruction\n      m\n    }, data);\n    transaction.add({\n      keys,\n      programId: this.programId,\n      data\n    }); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeMultisig', this.connection, transaction, this.payer, multisigAccount);\n    return multisigAccount.publicKey;\n  }\n  /**\n   * Retrieve mint information\n   */\n\n\n  async getMintInfo() {\n    const info = await this.connection.getAccountInfo(this.publicKey);\n\n    if (info === null) {\n      throw new Error('Failed to find mint account');\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(`Invalid mint owner: ${JSON.stringify(info.owner)}`);\n    }\n\n    if (info.data.length != MintLayout.span) {\n      throw new Error(`Invalid mint size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const mintInfo = MintLayout.decode(data);\n\n    if (mintInfo.mintAuthorityOption === 0) {\n      mintInfo.mintAuthority = null;\n    } else {\n      mintInfo.mintAuthority = new PublicKey(mintInfo.mintAuthority);\n    }\n\n    mintInfo.supply = u64.fromBuffer(mintInfo.supply);\n    mintInfo.isInitialized = mintInfo.isInitialized != 0;\n\n    if (mintInfo.freezeAuthorityOption === 0) {\n      mintInfo.freezeAuthority = null;\n    } else {\n      mintInfo.freezeAuthority = new PublicKey(mintInfo.freezeAuthority);\n    }\n\n    return mintInfo;\n  }\n  /**\n   * Retrieve account information\n   *\n   * @param account Public key of the account\n   */\n\n\n  async getAccountInfo(account, commitment) {\n    const info = await this.connection.getAccountInfo(account, commitment);\n\n    if (info === null) {\n      throw new Error(FAILED_TO_FIND_ACCOUNT);\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(INVALID_ACCOUNT_OWNER);\n    }\n\n    if (info.data.length != AccountLayout.span) {\n      throw new Error(`Invalid account size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const accountInfo = AccountLayout.decode(data);\n    accountInfo.address = account;\n    accountInfo.mint = new PublicKey(accountInfo.mint);\n    accountInfo.owner = new PublicKey(accountInfo.owner);\n    accountInfo.amount = u64.fromBuffer(accountInfo.amount);\n\n    if (accountInfo.delegateOption === 0) {\n      accountInfo.delegate = null;\n      accountInfo.delegatedAmount = new u64();\n    } else {\n      accountInfo.delegate = new PublicKey(accountInfo.delegate);\n      accountInfo.delegatedAmount = u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n\n    accountInfo.isInitialized = accountInfo.state !== 0;\n    accountInfo.isFrozen = accountInfo.state === 2;\n\n    if (accountInfo.isNativeOption === 1) {\n      accountInfo.rentExemptReserve = u64.fromBuffer(accountInfo.isNative);\n      accountInfo.isNative = true;\n    } else {\n      accountInfo.rentExemptReserve = null;\n      accountInfo.isNative = false;\n    }\n\n    if (accountInfo.closeAuthorityOption === 0) {\n      accountInfo.closeAuthority = null;\n    } else {\n      accountInfo.closeAuthority = new PublicKey(accountInfo.closeAuthority);\n    }\n\n    if (!accountInfo.mint.equals(this.publicKey)) {\n      throw new Error(`Invalid account mint: ${JSON.stringify(accountInfo.mint)} !== ${JSON.stringify(this.publicKey)}`);\n    }\n\n    return accountInfo;\n  }\n  /**\n   * Retrieve Multisig information\n   *\n   * @param multisig Public key of the account\n   */\n\n\n  async getMultisigInfo(multisig) {\n    const info = await this.connection.getAccountInfo(multisig);\n\n    if (info === null) {\n      throw new Error('Failed to find multisig');\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(`Invalid multisig owner`);\n    }\n\n    if (info.data.length != MultisigLayout.span) {\n      throw new Error(`Invalid multisig size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const multisigInfo = MultisigLayout.decode(data);\n    multisigInfo.signer1 = new PublicKey(multisigInfo.signer1);\n    multisigInfo.signer2 = new PublicKey(multisigInfo.signer2);\n    multisigInfo.signer3 = new PublicKey(multisigInfo.signer3);\n    multisigInfo.signer4 = new PublicKey(multisigInfo.signer4);\n    multisigInfo.signer5 = new PublicKey(multisigInfo.signer5);\n    multisigInfo.signer6 = new PublicKey(multisigInfo.signer6);\n    multisigInfo.signer7 = new PublicKey(multisigInfo.signer7);\n    multisigInfo.signer8 = new PublicKey(multisigInfo.signer8);\n    multisigInfo.signer9 = new PublicKey(multisigInfo.signer9);\n    multisigInfo.signer10 = new PublicKey(multisigInfo.signer10);\n    multisigInfo.signer11 = new PublicKey(multisigInfo.signer11);\n    return multisigInfo;\n  }\n  /**\n   * Transfer tokens to another account\n   *\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Number of tokens to transfer\n   */\n\n\n  async transfer(source, destination, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    return await sendAndConfirmTransaction('Transfer', this.connection, new Transaction().add(Token.createTransferInstruction(this.programId, source, destination, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Grant a third-party permission to transfer up the specified number of tokens from an account\n   *\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   */\n\n\n  async approve(account, delegate, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Approve', this.connection, new Transaction().add(Token.createApproveInstruction(this.programId, account, delegate, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Remove approval for the transfer of any remaining tokens\n   *\n   * @param account Public key of the account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  async revoke(account, owner, multiSigners) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Revoke', this.connection, new Transaction().add(Token.createRevokeInstruction(this.programId, account, ownerPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Assign a new authority to the account\n   *\n   * @param account Public key of the account\n   * @param newAuthority New authority of the account\n   * @param authorityType Type of authority to set\n   * @param currentAuthority Current authority of the account\n   * @param multiSigners Signing accounts if `currentAuthority` is a multiSig\n   */\n\n\n  async setAuthority(account, newAuthority, authorityType, currentAuthority, multiSigners) {\n    let currentAuthorityPublicKey;\n    let signers;\n\n    if (isAccount(currentAuthority)) {\n      currentAuthorityPublicKey = currentAuthority.publicKey;\n      signers = [currentAuthority];\n    } else {\n      currentAuthorityPublicKey = currentAuthority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('SetAuthority', this.connection, new Transaction().add(Token.createSetAuthorityInstruction(this.programId, account, newAuthority, authorityType, currentAuthorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Mint new tokens\n   *\n   * @param dest Public key of the account to mint to\n   * @param authority Minting authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   */\n\n\n  async mintTo(dest, authority, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      ownerPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      ownerPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('MintTo', this.connection, new Transaction().add(Token.createMintToInstruction(this.programId, this.publicKey, dest, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Burn tokens\n   *\n   * @param account Account to burn tokens from\n   * @param owner Account owner\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Amount to burn\n   */\n\n\n  async burn(account, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Burn', this.connection, new Transaction().add(Token.createBurnInstruction(this.programId, this.publicKey, account, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Close account\n   *\n   * @param account Account to close\n   * @param dest Account to receive the remaining balance of the closed account\n   * @param authority Authority which is allowed to close the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async closeAccount(account, dest, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('CloseAccount', this.connection, new Transaction().add(Token.createCloseAccountInstruction(this.programId, account, dest, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Freeze account\n   *\n   * @param account Account to freeze\n   * @param authority The mint freeze authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async freezeAccount(account, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('FreezeAccount', this.connection, new Transaction().add(Token.createFreezeAccountInstruction(this.programId, account, this.publicKey, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Thaw account\n   *\n   * @param account Account to thaw\n   * @param authority The mint freeze authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async thawAccount(account, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('ThawAccount', this.connection, new Transaction().add(Token.createThawAccountInstruction(this.programId, account, this.publicKey, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Transfer tokens to another account, asserting the token mint and decimals\n   *\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Number of tokens to transfer\n   * @param decimals Number of decimals in transfer amount\n   */\n\n\n  async transferChecked(source, destination, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    return await sendAndConfirmTransaction('TransferChecked', this.connection, new Transaction().add(Token.createTransferCheckedInstruction(this.programId, source, this.publicKey, destination, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Grant a third-party permission to transfer up the specified number of tokens from an account,\n   * asserting the token mint and decimals\n   *\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   * @param decimals Number of decimals in approve amount\n   */\n\n\n  async approveChecked(account, delegate, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('ApproveChecked', this.connection, new Transaction().add(Token.createApproveCheckedInstruction(this.programId, account, this.publicKey, delegate, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Mint new tokens, asserting the token mint and decimals\n   *\n   * @param dest Public key of the account to mint to\n   * @param authority Minting authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   * @param decimals Number of decimals in amount to mint\n   */\n\n\n  async mintToChecked(dest, authority, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      ownerPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      ownerPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('MintToChecked', this.connection, new Transaction().add(Token.createMintToCheckedInstruction(this.programId, this.publicKey, dest, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Burn tokens, asserting the token mint and decimals\n   *\n   * @param account Account to burn tokens from\n   * @param owner Account owner\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Amount to burn\n   * @param decimals Number of decimals in amount to burn\n   */\n\n\n  async burnChecked(account, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('BurnChecked', this.connection, new Transaction().add(Token.createBurnCheckedInstruction(this.programId, this.publicKey, account, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Sync amount in native SPL token account to underlying lamports\n   *\n   * @param nativeAccount Account to sync\n   */\n\n\n  async syncNative(nativeAccount) {\n    await sendAndConfirmTransaction('SyncNative', this.connection, new Transaction().add(Token.createSyncNativeInstruction(this.programId, nativeAccount)), this.payer);\n  }\n  /**\n   * Construct an InitializeMint instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param decimals Number of decimals in token account amounts\n   * @param mintAuthority Minting authority\n   * @param freezeAuthority Optional authority that can freeze token accounts\n   */\n\n\n  static createInitMintInstruction(programId, mint, decimals, mintAuthority, freezeAuthority) {\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    const commandDataLayout = struct([u8('instruction'), u8('decimals'), publicKey('mintAuthority'), u8('option'), publicKey('freezeAuthority')]);\n    let data = buffer.Buffer.alloc(1024);\n    {\n      const encodeLength = commandDataLayout.encode({\n        instruction: 0,\n        // InitializeMint instruction\n        decimals,\n        mintAuthority: pubkeyToBuffer(mintAuthority),\n        option: freezeAuthority === null ? 0 : 1,\n        freezeAuthority: pubkeyToBuffer(freezeAuthority || new PublicKey(0))\n      }, data);\n      data = data.slice(0, encodeLength);\n    }\n    return new TransactionInstruction({\n      keys,\n      programId,\n      data\n    });\n  }\n  /**\n   * Construct an InitializeAccount instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param account New account\n   * @param owner Owner of the new account\n   */\n\n\n  static createInitAccountInstruction(programId, mint, account, owner) {\n    const keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: owner,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 1 // InitializeAccount instruction\n\n    }, data);\n    return new TransactionInstruction({\n      keys,\n      programId,\n      data\n    });\n  }\n  /**\n   * Construct a Transfer instruction\n   *\n   * @param programId SPL Token program account\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Number of tokens to transfer\n   */\n\n\n  static createTransferInstruction(programId, source, destination, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 3,\n      // Transfer instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: source,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: destination,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct an Approve instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer of tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   */\n\n\n  static createApproveInstruction(programId, account, delegate, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 4,\n      // Approve instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: delegate,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Revoke instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createRevokeInstruction(programId, account, owner, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 5 // Approve instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a SetAuthority instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param newAuthority New authority of the account\n   * @param authorityType Type of authority to set\n   * @param currentAuthority Current authority of the specified type\n   * @param multiSigners Signing accounts if `currentAuthority` is a multiSig\n   */\n\n\n  static createSetAuthorityInstruction(programId, account, newAuthority, authorityType, currentAuthority, multiSigners) {\n    const commandDataLayout = struct([u8('instruction'), u8('authorityType'), u8('option'), publicKey('newAuthority')]);\n    let data = buffer.Buffer.alloc(1024);\n    {\n      const encodeLength = commandDataLayout.encode({\n        instruction: 6,\n        // SetAuthority instruction\n        authorityType: AuthorityTypeCodes[authorityType],\n        option: newAuthority === null ? 0 : 1,\n        newAuthority: pubkeyToBuffer(newAuthority || new PublicKey(0))\n      }, data);\n      data = data.slice(0, encodeLength);\n    }\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: currentAuthority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: currentAuthority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a MintTo instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Public key of the mint\n   * @param dest Public key of the account to mint to\n   * @param authority The mint authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   */\n\n\n  static createMintToInstruction(programId, mint, dest, authority, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 7,\n      // MintTo instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Burn instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Mint for the account\n   * @param account Account to burn tokens from\n   * @param owner Owner of the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount amount to burn\n   */\n\n\n  static createBurnInstruction(programId, mint, account, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 8,\n      // Burn instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Close instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to close\n   * @param dest Account to receive the remaining balance of the closed account\n   * @param authority Account Close authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createCloseAccountInstruction(programId, account, dest, owner, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 9 // CloseAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Freeze instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to freeze\n   * @param mint Mint account\n   * @param authority Mint freeze authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createFreezeAccountInstruction(programId, account, mint, authority, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 10 // FreezeAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Thaw instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to thaw\n   * @param mint Mint account\n   * @param authority Mint freeze authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createThawAccountInstruction(programId, account, mint, authority, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 11 // ThawAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a TransferChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param source Source account\n   * @param mint Mint account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Number of tokens to transfer\n   * @param decimals Number of decimals in transfer amount\n   */\n\n\n  static createTransferCheckedInstruction(programId, source, mint, destination, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 12,\n      // TransferChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: source,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: destination,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct an ApproveChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param mint Mint account\n   * @param delegate Account authorized to perform a transfer of tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   * @param decimals Number of decimals in approve amount\n   */\n\n\n  static createApproveCheckedInstruction(programId, account, mint, delegate, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 13,\n      // ApproveChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: delegate,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a MintToChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Public key of the mint\n   * @param dest Public key of the account to mint to\n   * @param authority The mint authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   * @param decimals Number of decimals in amount to mint\n   */\n\n\n  static createMintToCheckedInstruction(programId, mint, dest, authority, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 14,\n      // MintToChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a BurnChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Mint for the account\n   * @param account Account to burn tokens from\n   * @param owner Owner of the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount amount to burn\n   */\n\n\n  static createBurnCheckedInstruction(programId, mint, account, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 15,\n      // BurnChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a SyncNative instruction\n   *\n   * @param programId SPL Token program account\n   * @param nativeAccount Account to sync lamports from\n   */\n\n\n  static createSyncNativeInstruction(programId, nativeAccount) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 17 // SyncNative instruction\n\n    }, data);\n    let keys = [{\n      pubkey: nativeAccount,\n      isSigner: false,\n      isWritable: true\n    }];\n    return new TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Get the address for the associated token account\n   *\n   * @param associatedProgramId SPL Associated Token program account\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param owner Owner of the new account\n   * @return Public key of the associated token account\n   */\n\n\n  static async getAssociatedTokenAddress(associatedProgramId, programId, mint, owner, allowOwnerOffCurve = false) {\n    if (!allowOwnerOffCurve && !PublicKey.isOnCurve(owner.toBuffer())) {\n      throw new Error(`Owner cannot sign: ${owner.toString()}`);\n    }\n\n    return (await PublicKey.findProgramAddress([owner.toBuffer(), programId.toBuffer(), mint.toBuffer()], associatedProgramId))[0];\n  }\n  /**\n   * Construct the AssociatedTokenProgram instruction to create the associated\n   * token account\n   *\n   * @param associatedProgramId SPL Associated Token program account\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param associatedAccount New associated account\n   * @param owner Owner of the new account\n   * @param payer Payer of fees\n   */\n\n\n  static createAssociatedTokenAccountInstruction(associatedProgramId, programId, mint, associatedAccount, owner, payer) {\n    const data = buffer.Buffer.alloc(0);\n    let keys = [{\n      pubkey: payer,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: associatedAccount,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: owner,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: SystemProgram.programId,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: programId,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    return new TransactionInstruction({\n      keys,\n      programId: associatedProgramId,\n      data\n    });\n  }\n\n}\n\nexport { ASSOCIATED_TOKEN_PROGRAM_ID, AccountLayout, MintLayout, NATIVE_MINT, TOKEN_PROGRAM_ID, Token, u64 };\n//# sourceMappingURL=index.browser.esm.js.map\n","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n    let Ah = new Uint32Array(lst.length);\n    let Al = new Uint32Array(lst.length);\n    for (let i = 0; i < lst.length; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { HashMD } from './_md.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n    constructor() {\n        super(128, 64, 16, false);\n        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n        // Also looks cleaner and easier to verify with spec.\n        // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x6a09e667 | 0;\n        this.Al = 0xf3bcc908 | 0;\n        this.Bh = 0xbb67ae85 | 0;\n        this.Bl = 0x84caa73b | 0;\n        this.Ch = 0x3c6ef372 | 0;\n        this.Cl = 0xfe94f82b | 0;\n        this.Dh = 0xa54ff53a | 0;\n        this.Dl = 0x5f1d36f1 | 0;\n        this.Eh = 0x510e527f | 0;\n        this.El = 0xade682d1 | 0;\n        this.Fh = 0x9b05688c | 0;\n        this.Fl = 0x2b3e6c1f | 0;\n        this.Gh = 0x1f83d9ab | 0;\n        this.Gl = 0xfb41bd6b | 0;\n        this.Hh = 0x5be0cd19 | 0;\n        this.Hl = 0x137e2179 | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        SHA512_W_H.fill(0);\n        SHA512_W_L.fill(0);\n    }\n    destroy() {\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nclass SHA512_224 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x8c3d37c8 | 0;\n        this.Al = 0x19544da2 | 0;\n        this.Bh = 0x73e19966 | 0;\n        this.Bl = 0x89dcd4d6 | 0;\n        this.Ch = 0x1dfab7ae | 0;\n        this.Cl = 0x32ff9c82 | 0;\n        this.Dh = 0x679dd514 | 0;\n        this.Dl = 0x582f9fcf | 0;\n        this.Eh = 0x0f6d2b69 | 0;\n        this.El = 0x7bd44da8 | 0;\n        this.Fh = 0x77e36f73 | 0;\n        this.Fl = 0x04c48942 | 0;\n        this.Gh = 0x3f9d85a8 | 0;\n        this.Gl = 0x6a1d36c8 | 0;\n        this.Hh = 0x1112e6ad | 0;\n        this.Hl = 0x91d692a1 | 0;\n        this.outputLen = 28;\n    }\n}\nclass SHA512_256 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x22312194 | 0;\n        this.Al = 0xfc2bf72c | 0;\n        this.Bh = 0x9f555fa3 | 0;\n        this.Bl = 0xc84c64c2 | 0;\n        this.Ch = 0x2393b86b | 0;\n        this.Cl = 0x6f53b151 | 0;\n        this.Dh = 0x96387719 | 0;\n        this.Dl = 0x5940eabd | 0;\n        this.Eh = 0x96283ee2 | 0;\n        this.El = 0xa88effe3 | 0;\n        this.Fh = 0xbe5e1e25 | 0;\n        this.Fl = 0x53863992 | 0;\n        this.Gh = 0x2b0199fc | 0;\n        this.Gl = 0x2c85b8aa | 0;\n        this.Hh = 0x0eb72ddc | 0;\n        this.Hl = 0x81c52ca2 | 0;\n        this.outputLen = 32;\n    }\n}\nclass SHA384 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0xcbbb9d5d | 0;\n        this.Al = 0xc1059ed8 | 0;\n        this.Bh = 0x629a292a | 0;\n        this.Bl = 0x367cd507 | 0;\n        this.Ch = 0x9159015a | 0;\n        this.Cl = 0x3070dd17 | 0;\n        this.Dh = 0x152fecd8 | 0;\n        this.Dl = 0xf70e5939 | 0;\n        this.Eh = 0x67332667 | 0;\n        this.El = 0xffc00b31 | 0;\n        this.Fh = 0x8eb44a87 | 0;\n        this.Fl = 0x68581511 | 0;\n        this.Gh = 0xdb0c2e0d | 0;\n        this.Gl = 0x64f98fa7 | 0;\n        this.Hh = 0x47b5481d | 0;\n        this.Hl = 0xbefa4fa4 | 0;\n        this.outputLen = 48;\n    }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nexport function abytes(item) {\n    if (!isBytes(item))\n        throw new Error('Uint8Array expected');\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    abytes(bytes);\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (isBytes(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n    const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²\nimport { validateBasic, wNAF } from './curve.js';\nimport { mod } from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _8n = BigInt(8);\n// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\nconst VERIFY_DEFAULT = { zip215: true };\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(curve, {\n        hash: 'function',\n        a: 'bigint',\n        d: 'bigint',\n        randomBytes: 'function',\n    }, {\n        adjustScalarBytes: 'function',\n        domain: 'function',\n        uvRatio: 'function',\n        mapToCurve: 'function',\n    });\n    // Set defaults\n    return Object.freeze({ ...opts });\n}\n// It is not generic twisted curve for now, but ed25519/ed448 generic implementation\nexport function twistedEdwards(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER, prehash: prehash, hash: cHash, randomBytes, nByteLength, h: cofactor, } = CURVE;\n    const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n    const modP = Fp.create; // Function overrides\n    // sqrt(u/v)\n    const uvRatio = CURVE.uvRatio ||\n        ((u, v) => {\n            try {\n                return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };\n            }\n            catch (e) {\n                return { isValid: false, value: _0n };\n            }\n        });\n    const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP\n    const domain = CURVE.domain ||\n        ((data, ctx, phflag) => {\n            if (ctx.length || phflag)\n                throw new Error('Contexts/pre-hash are not supported');\n            return data;\n        }); // NOOP\n    const inBig = (n) => typeof n === 'bigint' && _0n < n; // n in [1..]\n    const inRange = (n, max) => inBig(n) && inBig(max) && n < max; // n in [1..max-1]\n    const in0MaskRange = (n) => n === _0n || inRange(n, MASK); // n in [0..MASK-1]\n    function assertInRange(n, max) {\n        // n in [1..max-1]\n        if (inRange(n, max))\n            return n;\n        throw new Error(`Expected valid scalar < ${max}, got ${typeof n} ${n}`);\n    }\n    function assertGE0(n) {\n        // n in [0..CURVE_ORDER-1]\n        return n === _0n ? n : assertInRange(n, CURVE_ORDER); // GE = prime subgroup, not full group\n    }\n    const pointPrecomputes = new Map();\n    function isPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ExtendedPoint expected');\n    }\n    // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).\n    // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n    class Point {\n        constructor(ex, ey, ez, et) {\n            this.ex = ex;\n            this.ey = ey;\n            this.ez = ez;\n            this.et = et;\n            if (!in0MaskRange(ex))\n                throw new Error('x required');\n            if (!in0MaskRange(ey))\n                throw new Error('y required');\n            if (!in0MaskRange(ez))\n                throw new Error('z required');\n            if (!in0MaskRange(et))\n                throw new Error('t required');\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        static fromAffine(p) {\n            if (p instanceof Point)\n                throw new Error('extended point not allowed');\n            const { x, y } = p || {};\n            if (!in0MaskRange(x) || !in0MaskRange(y))\n                throw new Error('invalid affine point');\n            return new Point(x, y, _1n, modP(x * y));\n        }\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.ez));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // Not required for fromHex(), which always creates valid points.\n        // Could be useful for fromAffine().\n        assertValidity() {\n            const { a, d } = CURVE;\n            if (this.is0())\n                throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n            // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n            // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX² + Y²)Z² = Z⁴ + dX²Y²\n            const { ex: X, ey: Y, ez: Z, et: T } = this;\n            const X2 = modP(X * X); // X²\n            const Y2 = modP(Y * Y); // Y²\n            const Z2 = modP(Z * Z); // Z²\n            const Z4 = modP(Z2 * Z2); // Z⁴\n            const aX2 = modP(X2 * a); // aX²\n            const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n            const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n            if (left !== right)\n                throw new Error('bad point: equation left != right (1)');\n            // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n            const XY = modP(X * Y);\n            const ZT = modP(Z * T);\n            if (XY !== ZT)\n                throw new Error('bad point: equation left != right (2)');\n        }\n        // Compare one point to another.\n        equals(other) {\n            isPoint(other);\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2 } = other;\n            const X1Z2 = modP(X1 * Z2);\n            const X2Z1 = modP(X2 * Z1);\n            const Y1Z2 = modP(Y1 * Z2);\n            const Y2Z1 = modP(Y2 * Z1);\n            return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        negate() {\n            // Flips point sign to a negative one (-x, y in affine coords)\n            return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));\n        }\n        // Fast algo for doubling Extended Point.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n        // Cost: 4M + 4S + 1*a + 6add + 1*2.\n        double() {\n            const { a } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const A = modP(X1 * X1); // A = X12\n            const B = modP(Y1 * Y1); // B = Y12\n            const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12\n            const D = modP(a * A); // D = a*A\n            const x1y1 = X1 + Y1;\n            const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n            const G = D + B; // G = D+B\n            const F = G - C; // F = G-C\n            const H = D - B; // H = D-B\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        // Fast algo for adding 2 Extended Points.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n        // Cost: 9M + 1*a + 1*d + 7add.\n        add(other) {\n            isPoint(other);\n            const { a, d } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;\n            // Faster algo for adding 2 Extended Points when curve's a=-1.\n            // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4\n            // Cost: 8M + 8add + 2*2.\n            // Note: It does not check whether the `other` point is valid.\n            if (a === BigInt(-1)) {\n                const A = modP((Y1 - X1) * (Y2 + X2));\n                const B = modP((Y1 + X1) * (Y2 - X2));\n                const F = modP(B - A);\n                if (F === _0n)\n                    return this.double(); // Same point. Tests say it doesn't affect timing\n                const C = modP(Z1 * _2n * T2);\n                const D = modP(T1 * _2n * Z2);\n                const E = D + C;\n                const G = B + A;\n                const H = D - C;\n                const X3 = modP(E * F);\n                const Y3 = modP(G * H);\n                const T3 = modP(E * H);\n                const Z3 = modP(F * G);\n                return new Point(X3, Y3, Z3, T3);\n            }\n            const A = modP(X1 * X2); // A = X1*X2\n            const B = modP(Y1 * Y2); // B = Y1*Y2\n            const C = modP(T1 * d * T2); // C = T1*d*T2\n            const D = modP(Z1 * Z2); // D = Z1*Z2\n            const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n            const F = D - C; // F = D-C\n            const G = D + C; // G = D+C\n            const H = modP(B - a * A); // H = B-a*A\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, Point.normalizeZ);\n        }\n        // Constant-time multiplication.\n        multiply(scalar) {\n            const { p, f } = this.wNAF(assertInRange(scalar, CURVE_ORDER));\n            return Point.normalizeZ([p, f])[0];\n        }\n        // Non-constant-time multiplication. Uses double-and-add algorithm.\n        // It's faster, but should only be used when you don't care about\n        // an exposed private key e.g. sig verification.\n        // Does NOT allow scalars higher than CURVE.n.\n        multiplyUnsafe(scalar) {\n            let n = assertGE0(scalar); // 0 <= scalar < CURVE.n\n            if (n === _0n)\n                return I;\n            if (this.equals(I) || n === _1n)\n                return this;\n            if (this.equals(G))\n                return this.wNAF(n).p;\n            return wnaf.unsafeLadder(this, n);\n        }\n        // Checks if point is of small order.\n        // If you add something to small order point, you will have \"dirty\"\n        // point with torsion component.\n        // Multiplies point by cofactor and checks if the result is 0.\n        isSmallOrder() {\n            return this.multiplyUnsafe(cofactor).is0();\n        }\n        // Multiplies point by curve order and checks if the result is 0.\n        // Returns `false` is the point is dirty.\n        isTorsionFree() {\n            return wnaf.unsafeLadder(this, CURVE_ORDER).is0();\n        }\n        // Converts Extended point to default (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        toAffine(iz) {\n            const { ex: x, ey: y, ez: z } = this;\n            const is0 = this.is0();\n            if (iz == null)\n                iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily\n            const ax = modP(x * iz);\n            const ay = modP(y * iz);\n            const zz = modP(z * iz);\n            if (is0)\n                return { x: _0n, y: _1n };\n            if (zz !== _1n)\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        clearCofactor() {\n            const { h: cofactor } = CURVE;\n            if (cofactor === _1n)\n                return this;\n            return this.multiplyUnsafe(cofactor);\n        }\n        // Converts hash string or Uint8Array to Point.\n        // Uses algo from RFC8032 5.1.3.\n        static fromHex(hex, zip215 = false) {\n            const { d, a } = CURVE;\n            const len = Fp.BYTES;\n            hex = ensureBytes('pointHex', hex, len); // copy hex to a new array\n            const normed = hex.slice(); // copy again, we'll manipulate it\n            const lastByte = hex[len - 1]; // select last byte\n            normed[len - 1] = lastByte & ~0x80; // clear last bit\n            const y = ut.bytesToNumberLE(normed);\n            if (y === _0n) {\n                // y=0 is allowed\n            }\n            else {\n                // RFC8032 prohibits >= p, but ZIP215 doesn't\n                if (zip215)\n                    assertInRange(y, MASK); // zip215=true [1..P-1] (2^255-19-1 for ed25519)\n                else\n                    assertInRange(y, Fp.ORDER); // zip215=false [1..MASK-1] (2^256-1 for ed25519)\n            }\n            // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n            // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n            const y2 = modP(y * y); // denominator is always non-0 mod p.\n            const u = modP(y2 - _1n); // u = y² - 1\n            const v = modP(d * y2 - a); // v = d y² + 1.\n            let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n            if (!isValid)\n                throw new Error('Point.fromHex: invalid y coordinate');\n            const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n            const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n            if (!zip215 && x === _0n && isLastByteOdd)\n                // if x=0 and x_0 = 1, fail\n                throw new Error('Point.fromHex: x=0 and x_0=1');\n            if (isLastByteOdd !== isXOdd)\n                x = modP(-x); // if x_0 != x mod 2, set x = p-x\n            return Point.fromAffine({ x, y });\n        }\n        static fromPrivateKey(privKey) {\n            return getExtendedPublicKey(privKey).point;\n        }\n        toRawBytes() {\n            const { x, y } = this.toAffine();\n            const bytes = ut.numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)\n            bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0; // when compressing, it's enough to store y\n            return bytes; // and use the last byte to encode sign of x\n        }\n        toHex() {\n            return ut.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n    Point.ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n    const { BASE: G, ZERO: I } = Point;\n    const wnaf = wNAF(Point, nByteLength * 8);\n    function modN(a) {\n        return mod(a, CURVE_ORDER);\n    }\n    // Little-endian SHA512 with modulo n\n    function modN_LE(hash) {\n        return modN(ut.bytesToNumberLE(hash));\n    }\n    /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */\n    function getExtendedPublicKey(key) {\n        const len = nByteLength;\n        key = ensureBytes('private key', key, len);\n        // Hash private key with curve's hash function to produce uniformingly random input\n        // Check byte lengths: ensure(64, h(ensure(32, key)))\n        const hashed = ensureBytes('hashed private key', cHash(key), 2 * len);\n        const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n        const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n        const scalar = modN_LE(head); // The actual private scalar\n        const point = G.multiply(scalar); // Point on Edwards curve aka public key\n        const pointBytes = point.toRawBytes(); // Uint8Array representation\n        return { head, prefix, scalar, point, pointBytes };\n    }\n    // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared\n    function getPublicKey(privKey) {\n        return getExtendedPublicKey(privKey).pointBytes;\n    }\n    // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n    function hashDomainToScalar(context = new Uint8Array(), ...msgs) {\n        const msg = ut.concatBytes(...msgs);\n        return modN_LE(cHash(domain(msg, ensureBytes('context', context), !!prehash)));\n    }\n    /** Signs message with privateKey. RFC8032 5.1.6 */\n    function sign(msg, privKey, options = {}) {\n        msg = ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph etc.\n        const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);\n        const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n        const R = G.multiply(r).toRawBytes(); // R = rG\n        const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n        const s = modN(r + k * scalar); // S = (r + k * s) mod L\n        assertGE0(s); // 0 <= s < l\n        const res = ut.concatBytes(R, ut.numberToBytesLE(s, Fp.BYTES));\n        return ensureBytes('result', res, nByteLength * 2); // 64-byte signature\n    }\n    const verifyOpts = VERIFY_DEFAULT;\n    function verify(sig, msg, publicKey, options = verifyOpts) {\n        const { context, zip215 } = options;\n        const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n        sig = ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.\n        msg = ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph, etc\n        const s = ut.bytesToNumberLE(sig.slice(len, 2 * len));\n        // zip215: true is good for consensus-critical apps and allows points < 2^256\n        // zip215: false follows RFC8032 / NIST186-5 and restricts points to CURVE.p\n        let A, R, SB;\n        try {\n            A = Point.fromHex(publicKey, zip215);\n            R = Point.fromHex(sig.slice(0, len), zip215);\n            SB = G.multiplyUnsafe(s); // 0 <= s < l is done inside\n        }\n        catch (error) {\n            return false;\n        }\n        if (!zip215 && A.isSmallOrder())\n            return false;\n        const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);\n        const RkA = R.add(A.multiplyUnsafe(k));\n        // [8][S]B = [8]R + [8][k]A'\n        return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);\n    }\n    G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n    const utils = {\n        getExtendedPublicKey,\n        // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.\n        randomPrivateKey: () => randomBytes(Fp.BYTES),\n        /**\n         * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT\n         * values. This slows down first getPublicKey() by milliseconds (see Speed section),\n         * but allows to speed-up subsequent getPublicKey() calls up to 20x.\n         * @param windowSize 2, 4, 8, 16\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3));\n            return point;\n        },\n    };\n    return {\n        CURVE,\n        getPublicKey,\n        sign,\n        verify,\n        ExtendedPoint: Point,\n        utils,\n    };\n}\n//# sourceMappingURL=edwards.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha512';\nimport { concatBytes, randomBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { twistedEdwards } from './abstract/edwards.js';\nimport { createHasher, expand_message_xmd } from './abstract/hash-to-curve.js';\nimport { Field, FpSqrtEven, isNegativeLE, mod, pow2 } from './abstract/modular.js';\nimport { montgomery } from './abstract/montgomery.js';\nimport { bytesToHex, bytesToNumberLE, ensureBytes, equalBytes, numberToBytesLE, } from './abstract/utils.js';\n/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n */\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _5n = BigInt(5), _8n = BigInt(8);\nfunction ed25519_pow_2_252_3(x) {\n    // prettier-ignore\n    const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n    const P = ED25519_P;\n    const x2 = (x * x) % P;\n    const b2 = (x2 * x) % P; // x^3, 11\n    const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n    const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n    const b10 = (pow2(b5, _5n, P) * b5) % P;\n    const b20 = (pow2(b10, _10n, P) * b10) % P;\n    const b40 = (pow2(b20, _20n, P) * b20) % P;\n    const b80 = (pow2(b40, _40n, P) * b40) % P;\n    const b160 = (pow2(b80, _80n, P) * b80) % P;\n    const b240 = (pow2(b160, _80n, P) * b80) % P;\n    const b250 = (pow2(b240, _10n, P) * b10) % P;\n    const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n    // ^ To pow to (p+3)/8, multiply it by x.\n    return { pow_p_5_8, b2 };\n}\nfunction adjustScalarBytes(bytes) {\n    // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n    // set the three least significant bits of the first byte\n    bytes[0] &= 248; // 0b1111_1000\n    // and the most significant bit of the last to zero,\n    bytes[31] &= 127; // 0b0111_1111\n    // set the second most significant bit of the last byte to 1\n    bytes[31] |= 64; // 0b0100_0000\n    return bytes;\n}\n// sqrt(u/v)\nfunction uvRatio(u, v) {\n    const P = ED25519_P;\n    const v3 = mod(v * v * v, P); // v³\n    const v7 = mod(v3 * v3 * v, P); // v⁷\n    // (p+3)/8 and (p-5)/8\n    const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n    let x = mod(u * v3 * pow, P); // (uv³)(uv⁷)^(p-5)/8\n    const vx2 = mod(v * x * x, P); // vx²\n    const root1 = x; // First root candidate\n    const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n    const useRoot1 = vx2 === u; // If vx² = u (mod p), x is a square root\n    const useRoot2 = vx2 === mod(-u, P); // If vx² = -u, set x <-- x * 2^((p-1)/4)\n    const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx² = -u√(-1)\n    if (useRoot1)\n        x = root1;\n    if (useRoot2 || noRoot)\n        x = root2; // We return root2 anyway, for const-time\n    if (isNegativeLE(x, P))\n        x = mod(-x, P);\n    return { isValid: useRoot1 || useRoot2, value: x };\n}\n// Just in case\nexport const ED25519_TORSION_SUBGROUP = [\n    '0100000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n    '0000000000000000000000000000000000000000000000000000000000000080',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n    'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n    '0000000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n];\nconst Fp = /* @__PURE__ */ (() => Field(ED25519_P, undefined, true))();\nconst ed25519Defaults = /* @__PURE__ */ (() => ({\n    // Param: a\n    a: BigInt(-1), // Fp.create(-1) is proper; our way still works and is faster\n    // d is equal to -121665/121666 over finite field.\n    // Negative number is P - number, and division is invert(number, P)\n    d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n    // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n\n    Fp,\n    // Subgroup order: how many points curve has\n    // 2n**252n + 27742317777372353535851937790883648493n;\n    n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n    // Cofactor\n    h: _8n,\n    // Base point (x, y) aka generator point\n    Gx: BigInt('15112221349535400772501151409588531511454012693041857206046113283949847762202'),\n    Gy: BigInt('46316835694926478169428394003475163141307993866256225615783033603165251855960'),\n    hash: sha512,\n    randomBytes,\n    adjustScalarBytes,\n    // dom2\n    // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.\n    // Constant-time, u/√v\n    uvRatio,\n}))();\nexport const ed25519 = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();\nfunction ed25519_domain(data, ctx, phflag) {\n    if (ctx.length > 255)\n        throw new Error('Context is too big');\n    return concatBytes(utf8ToBytes('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);\n}\nexport const ed25519ctx = /* @__PURE__ */ (() => twistedEdwards({\n    ...ed25519Defaults,\n    domain: ed25519_domain,\n}))();\nexport const ed25519ph = /* @__PURE__ */ (() => twistedEdwards(Object.assign({}, ed25519Defaults, {\n    domain: ed25519_domain,\n    prehash: sha512,\n})))();\nexport const x25519 = /* @__PURE__ */ (() => montgomery({\n    P: ED25519_P,\n    a: BigInt(486662),\n    montgomeryBits: 255, // n is 253 bits\n    nByteLength: 32,\n    Gu: BigInt(9),\n    powPminus2: (x) => {\n        const P = ED25519_P;\n        // x^(p-2) aka x^(2^255-21)\n        const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n        return mod(pow2(pow_p_5_8, _3n, P) * b2, P);\n    },\n    adjustScalarBytes,\n    randomBytes,\n}))();\n/**\n * Converts ed25519 public key to x25519 public key. Uses formula:\n * * `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`\n * * `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`\n * @example\n *   const someonesPub = ed25519.getPublicKey(ed25519.utils.randomPrivateKey());\n *   const aPriv = x25519.utils.randomPrivateKey();\n *   x25519.getSharedSecret(aPriv, edwardsToMontgomeryPub(someonesPub))\n */\nexport function edwardsToMontgomeryPub(edwardsPub) {\n    const { y } = ed25519.ExtendedPoint.fromHex(edwardsPub);\n    const _1n = BigInt(1);\n    return Fp.toBytes(Fp.create((_1n + y) * Fp.inv(_1n - y)));\n}\nexport const edwardsToMontgomery = edwardsToMontgomeryPub; // deprecated\n/**\n * Converts ed25519 secret key to x25519 secret key.\n * @example\n *   const someonesPub = x25519.getPublicKey(x25519.utils.randomPrivateKey());\n *   const aPriv = ed25519.utils.randomPrivateKey();\n *   x25519.getSharedSecret(edwardsToMontgomeryPriv(aPriv), someonesPub)\n */\nexport function edwardsToMontgomeryPriv(edwardsPriv) {\n    const hashed = ed25519Defaults.hash(edwardsPriv.subarray(0, 32));\n    return ed25519Defaults.adjustScalarBytes(hashed).subarray(0, 32);\n}\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ */ (() => (Fp.ORDER + _3n) / _8n)(); // 1. c1 = (q + 3) / 8       # Integer arithmetic\nconst ELL2_C2 = /* @__PURE__ */ (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\n// prettier-ignore\nfunction map_to_curve_elligator2_curve25519(u) {\n    const ELL2_C4 = (Fp.ORDER - _5n) / _8n; // 4. c4 = (q - 5) / 8       # Integer arithmetic\n    const ELL2_J = BigInt(486662);\n    let tv1 = Fp.sqr(u); //  1.  tv1 = u^2\n    tv1 = Fp.mul(tv1, _2n); //  2.  tv1 = 2 * tv1\n    let xd = Fp.add(tv1, Fp.ONE); //  3.   xd = tv1 + 1         # Nonzero: -1 is square (mod p), tv1 is not\n    let x1n = Fp.neg(ELL2_J); //  4.  x1n = -J              # x1 = x1n / xd = -J / (1 + 2 * u^2)\n    let tv2 = Fp.sqr(xd); //  5.  tv2 = xd^2\n    let gxd = Fp.mul(tv2, xd); //  6.  gxd = tv2 * xd        # gxd = xd^3\n    let gx1 = Fp.mul(tv1, ELL2_J); //  7.  gx1 = J * tv1         # x1n + J * xd\n    gx1 = Fp.mul(gx1, x1n); //  8.  gx1 = gx1 * x1n       # x1n^2 + J * x1n * xd\n    gx1 = Fp.add(gx1, tv2); //  9.  gx1 = gx1 + tv2       # x1n^2 + J * x1n * xd + xd^2\n    gx1 = Fp.mul(gx1, x1n); //  10. gx1 = gx1 * x1n       # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n    let tv3 = Fp.sqr(gxd); //  11. tv3 = gxd^2\n    tv2 = Fp.sqr(tv3); //  12. tv2 = tv3^2           # gxd^4\n    tv3 = Fp.mul(tv3, gxd); //  13. tv3 = tv3 * gxd       # gxd^3\n    tv3 = Fp.mul(tv3, gx1); //  14. tv3 = tv3 * gx1       # gx1 * gxd^3\n    tv2 = Fp.mul(tv2, tv3); //  15. tv2 = tv2 * tv3       # gx1 * gxd^7\n    let y11 = Fp.pow(tv2, ELL2_C4); //  16. y11 = tv2^c4        # (gx1 * gxd^7)^((p - 5) / 8)\n    y11 = Fp.mul(y11, tv3); //  17. y11 = y11 * tv3       # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n    let y12 = Fp.mul(y11, ELL2_C3); //  18. y12 = y11 * c3\n    tv2 = Fp.sqr(y11); //  19. tv2 = y11^2\n    tv2 = Fp.mul(tv2, gxd); //  20. tv2 = tv2 * gxd\n    let e1 = Fp.eql(tv2, gx1); //  21.  e1 = tv2 == gx1\n    let y1 = Fp.cmov(y12, y11, e1); //  22.  y1 = CMOV(y12, y11, e1)  # If g(x1) is square, this is its sqrt\n    let x2n = Fp.mul(x1n, tv1); //  23. x2n = x1n * tv1       # x2 = x2n / xd = 2 * u^2 * x1n / xd\n    let y21 = Fp.mul(y11, u); //  24. y21 = y11 * u\n    y21 = Fp.mul(y21, ELL2_C2); //  25. y21 = y21 * c2\n    let y22 = Fp.mul(y21, ELL2_C3); //  26. y22 = y21 * c3\n    let gx2 = Fp.mul(gx1, tv1); //  27. gx2 = gx1 * tv1       # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n    tv2 = Fp.sqr(y21); //  28. tv2 = y21^2\n    tv2 = Fp.mul(tv2, gxd); //  29. tv2 = tv2 * gxd\n    let e2 = Fp.eql(tv2, gx2); //  30.  e2 = tv2 == gx2\n    let y2 = Fp.cmov(y22, y21, e2); //  31.  y2 = CMOV(y22, y21, e2)  # If g(x2) is square, this is its sqrt\n    tv2 = Fp.sqr(y1); //  32. tv2 = y1^2\n    tv2 = Fp.mul(tv2, gxd); //  33. tv2 = tv2 * gxd\n    let e3 = Fp.eql(tv2, gx1); //  34.  e3 = tv2 == gx1\n    let xn = Fp.cmov(x2n, x1n, e3); //  35.  xn = CMOV(x2n, x1n, e3)  # If e3, x = x1, else x = x2\n    let y = Fp.cmov(y2, y1, e3); //  36.   y = CMOV(y2, y1, e3)    # If e3, y = y1, else y = y2\n    let e4 = Fp.isOdd(y); //  37.  e4 = sgn0(y) == 1        # Fix sign of y\n    y = Fp.cmov(y, Fp.neg(y), e3 !== e4); //  38.   y = CMOV(y, -y, e3 XOR e4)\n    return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; //  39. return (xn, xd, y, 1)\n}\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))(); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u) {\n    const { xMn, xMd, yMn, yMd } = map_to_curve_elligator2_curve25519(u); //  1.  (xMn, xMd, yMn, yMd) =\n    // map_to_curve_elligator2_curve25519(u)\n    let xn = Fp.mul(xMn, yMd); //  2.  xn = xMn * yMd\n    xn = Fp.mul(xn, ELL2_C1_EDWARDS); //  3.  xn = xn * c1\n    let xd = Fp.mul(xMd, yMn); //  4.  xd = xMd * yMn    # xn / xd = c1 * xM / yM\n    let yn = Fp.sub(xMn, xMd); //  5.  yn = xMn - xMd\n    let yd = Fp.add(xMn, xMd); //  6.  yd = xMn + xMd    # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n    let tv1 = Fp.mul(xd, yd); //  7. tv1 = xd * yd\n    let e = Fp.eql(tv1, Fp.ZERO); //  8.   e = tv1 == 0\n    xn = Fp.cmov(xn, Fp.ZERO, e); //  9.  xn = CMOV(xn, 0, e)\n    xd = Fp.cmov(xd, Fp.ONE, e); //  10. xd = CMOV(xd, 1, e)\n    yn = Fp.cmov(yn, Fp.ONE, e); //  11. yn = CMOV(yn, 1, e)\n    yd = Fp.cmov(yd, Fp.ONE, e); //  12. yd = CMOV(yd, 1, e)\n    const inv = Fp.invertBatch([xd, yd]); // batch division\n    return { x: Fp.mul(xn, inv[0]), y: Fp.mul(yn, inv[1]) }; //  13. return (xn, xd, yn, yd)\n}\nconst htf = /* @__PURE__ */ (() => createHasher(ed25519.ExtendedPoint, (scalars) => map_to_curve_elligator2_edwards25519(scalars[0]), {\n    DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n    encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n    p: Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha512,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\nfunction assertRstPoint(other) {\n    if (!(other instanceof RistPoint))\n        throw new Error('RistrettoPoint expected');\n}\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// √(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235');\n// 1 / √(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578');\n// 1-d²\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838');\n// (d-1)²\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952');\n// Calculates 1/√(number)\nconst invertSqrt = (number) => uvRatio(_1n, number);\nconst MAX_255B = /* @__PURE__ */ BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff');\nconst bytes255ToNumberLE = (bytes) => ed25519.CURVE.Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n// Computes Elligator map for Ristretto\n// https://ristretto.group/formulas/elligator.html\nfunction calcElligatorRistrettoMap(r0) {\n    const { d } = ed25519.CURVE;\n    const P = ed25519.CURVE.Fp.ORDER;\n    const mod = ed25519.CURVE.Fp.create;\n    const r = mod(SQRT_M1 * r0 * r0); // 1\n    const Ns = mod((r + _1n) * ONE_MINUS_D_SQ); // 2\n    let c = BigInt(-1); // 3\n    const D = mod((c - d * r) * mod(r + d)); // 4\n    let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n    let s_ = mod(s * r0); // 6\n    if (!isNegativeLE(s_, P))\n        s_ = mod(-s_);\n    if (!Ns_D_is_sq)\n        s = s_; // 7\n    if (!Ns_D_is_sq)\n        c = r; // 8\n    const Nt = mod(c * (r - _1n) * D_MINUS_ONE_SQ - D); // 9\n    const s2 = s * s;\n    const W0 = mod((s + s) * D); // 10\n    const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n    const W2 = mod(_1n - s2); // 12\n    const W3 = mod(_1n + s2); // 13\n    return new ed25519.ExtendedPoint(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n/**\n * Each ed25519/ExtendedPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like ExtendedPoint,\n * but it should work in its own namespace: do not combine those two.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-ristretto255-decaf448\n */\nclass RistPoint {\n    // Private property to discourage combining ExtendedPoint + RistrettoPoint\n    // Always use Ristretto encoding/decoding instead.\n    constructor(ep) {\n        this.ep = ep;\n    }\n    static fromAffine(ap) {\n        return new RistPoint(ed25519.ExtendedPoint.fromAffine(ap));\n    }\n    /**\n     * Takes uniform output of 64-byte hash function like sha512 and converts it to `RistrettoPoint`.\n     * The hash-to-group operation applies Elligator twice and adds the results.\n     * **Note:** this is one-way map, there is no conversion from point to hash.\n     * https://ristretto.group/formulas/elligator.html\n     * @param hex 64-byte output of a hash function\n     */\n    static hashToCurve(hex) {\n        hex = ensureBytes('ristrettoHash', hex, 64);\n        const r1 = bytes255ToNumberLE(hex.slice(0, 32));\n        const R1 = calcElligatorRistrettoMap(r1);\n        const r2 = bytes255ToNumberLE(hex.slice(32, 64));\n        const R2 = calcElligatorRistrettoMap(r2);\n        return new RistPoint(R1.add(R2));\n    }\n    /**\n     * Converts ristretto-encoded string to ristretto point.\n     * https://ristretto.group/formulas/decoding.html\n     * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n     */\n    static fromHex(hex) {\n        hex = ensureBytes('ristrettoHex', hex, 32);\n        const { a, d } = ed25519.CURVE;\n        const P = ed25519.CURVE.Fp.ORDER;\n        const mod = ed25519.CURVE.Fp.create;\n        const emsg = 'RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint';\n        const s = bytes255ToNumberLE(hex);\n        // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n        // 3. Check that s is non-negative, or else abort\n        if (!equalBytes(numberToBytesLE(s, 32), hex) || isNegativeLE(s, P))\n            throw new Error(emsg);\n        const s2 = mod(s * s);\n        const u1 = mod(_1n + a * s2); // 4 (a is -1)\n        const u2 = mod(_1n - a * s2); // 5\n        const u1_2 = mod(u1 * u1);\n        const u2_2 = mod(u2 * u2);\n        const v = mod(a * d * u1_2 - u2_2); // 6\n        const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n        const Dx = mod(I * u2); // 8\n        const Dy = mod(I * Dx * v); // 9\n        let x = mod((s + s) * Dx); // 10\n        if (isNegativeLE(x, P))\n            x = mod(-x); // 10\n        const y = mod(u1 * Dy); // 11\n        const t = mod(x * y); // 12\n        if (!isValid || isNegativeLE(t, P) || y === _0n)\n            throw new Error(emsg);\n        return new RistPoint(new ed25519.ExtendedPoint(x, y, _1n, t));\n    }\n    /**\n     * Encodes ristretto point to Uint8Array.\n     * https://ristretto.group/formulas/encoding.html\n     */\n    toRawBytes() {\n        let { ex: x, ey: y, ez: z, et: t } = this.ep;\n        const P = ed25519.CURVE.Fp.ORDER;\n        const mod = ed25519.CURVE.Fp.create;\n        const u1 = mod(mod(z + y) * mod(z - y)); // 1\n        const u2 = mod(x * y); // 2\n        // Square root always exists\n        const u2sq = mod(u2 * u2);\n        const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n        const D1 = mod(invsqrt * u1); // 4\n        const D2 = mod(invsqrt * u2); // 5\n        const zInv = mod(D1 * D2 * t); // 6\n        let D; // 7\n        if (isNegativeLE(t * zInv, P)) {\n            let _x = mod(y * SQRT_M1);\n            let _y = mod(x * SQRT_M1);\n            x = _x;\n            y = _y;\n            D = mod(D1 * INVSQRT_A_MINUS_D);\n        }\n        else {\n            D = D2; // 8\n        }\n        if (isNegativeLE(x * zInv, P))\n            y = mod(-y); // 9\n        let s = mod((z - y) * D); // 10 (check footer's note, no sqrt(-a))\n        if (isNegativeLE(s, P))\n            s = mod(-s);\n        return numberToBytesLE(s, 32); // 11\n    }\n    toHex() {\n        return bytesToHex(this.toRawBytes());\n    }\n    toString() {\n        return this.toHex();\n    }\n    // Compare one point to another.\n    equals(other) {\n        assertRstPoint(other);\n        const { ex: X1, ey: Y1 } = this.ep;\n        const { ex: X2, ey: Y2 } = other.ep;\n        const mod = ed25519.CURVE.Fp.create;\n        // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n        const one = mod(X1 * Y2) === mod(Y1 * X2);\n        const two = mod(Y1 * Y2) === mod(X1 * X2);\n        return one || two;\n    }\n    add(other) {\n        assertRstPoint(other);\n        return new RistPoint(this.ep.add(other.ep));\n    }\n    subtract(other) {\n        assertRstPoint(other);\n        return new RistPoint(this.ep.subtract(other.ep));\n    }\n    multiply(scalar) {\n        return new RistPoint(this.ep.multiply(scalar));\n    }\n    multiplyUnsafe(scalar) {\n        return new RistPoint(this.ep.multiplyUnsafe(scalar));\n    }\n    double() {\n        return new RistPoint(this.ep.double());\n    }\n    negate() {\n        return new RistPoint(this.ep.negate());\n    }\n}\nexport const RistrettoPoint = /* @__PURE__ */ (() => {\n    if (!RistPoint.BASE)\n        RistPoint.BASE = new RistPoint(ed25519.ExtendedPoint.BASE);\n    if (!RistPoint.ZERO)\n        RistPoint.ZERO = new RistPoint(ed25519.ExtendedPoint.ZERO);\n    return RistPoint;\n})();\n// Hashing to ristretto255. https://www.rfc-editor.org/rfc/rfc9380#appendix-B\nexport const hashToRistretto255 = (msg, options) => {\n    const d = options.DST;\n    const DST = typeof d === 'string' ? utf8ToBytes(d) : d;\n    const uniform_bytes = expand_message_xmd(msg, DST, 64, sha512);\n    const P = RistPoint.hashToCurve(uniform_bytes);\n    return P;\n};\nexport const hash_to_ristretto255 = hashToRistretto255; // legacy\n//# sourceMappingURL=ed25519.js.map","/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n    constructor(failure, failures) {\n        let cached;\n        const { message, explanation, ...rest } = failure;\n        const { path } = failure;\n        const msg = path.length === 0 ? message : `At path: ${path.join('.')} -- ${message}`;\n        super(explanation ?? msg);\n        if (explanation != null)\n            this.cause = msg;\n        Object.assign(this, rest);\n        this.name = this.constructor.name;\n        this.failures = () => {\n            return (cached ?? (cached = [failure, ...failures()]));\n        };\n    }\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n    return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\nfunction isObject(x) {\n    return typeof x === 'object' && x != null;\n}\n/**\n * Check if a value is a non-array object.\n */\nfunction isNonArrayObject(x) {\n    return isObject(x) && !Array.isArray(x);\n}\n/**\n * Check if a value is a plain object.\n */\nfunction isPlainObject(x) {\n    if (Object.prototype.toString.call(x) !== '[object Object]') {\n        return false;\n    }\n    const prototype = Object.getPrototypeOf(x);\n    return prototype === null || prototype === Object.prototype;\n}\n/**\n * Return a value as a printable string.\n */\nfunction print(value) {\n    if (typeof value === 'symbol') {\n        return value.toString();\n    }\n    return typeof value === 'string' ? JSON.stringify(value) : `${value}`;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\nfunction shiftIterator(input) {\n    const { done, value } = input.next();\n    return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\nfunction toFailure(result, context, struct, value) {\n    if (result === true) {\n        return;\n    }\n    else if (result === false) {\n        result = {};\n    }\n    else if (typeof result === 'string') {\n        result = { message: result };\n    }\n    const { path, branch } = context;\n    const { type } = struct;\n    const { refinement, message = `Expected a value of type \\`${type}\\`${refinement ? ` with refinement \\`${refinement}\\`` : ''}, but received: \\`${print(value)}\\``, } = result;\n    return {\n        value,\n        type,\n        refinement,\n        key: path[path.length - 1],\n        path,\n        branch,\n        ...result,\n        message,\n    };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\nfunction* toFailures(result, context, struct, value) {\n    if (!isIterable(result)) {\n        result = [result];\n    }\n    for (const r of result) {\n        const failure = toFailure(r, context, struct, value);\n        if (failure) {\n            yield failure;\n        }\n    }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\nfunction* run(value, struct, options = {}) {\n    const { path = [], branch = [value], coerce = false, mask = false } = options;\n    const ctx = { path, branch, mask };\n    if (coerce) {\n        value = struct.coercer(value, ctx);\n    }\n    let status = 'valid';\n    for (const failure of struct.validator(value, ctx)) {\n        failure.explanation = options.message;\n        status = 'not_valid';\n        yield [failure, undefined];\n    }\n    for (let [k, v, s] of struct.entries(value, ctx)) {\n        const ts = run(v, s, {\n            path: k === undefined ? path : [...path, k],\n            branch: k === undefined ? branch : [...branch, v],\n            coerce,\n            mask,\n            message: options.message,\n        });\n        for (const t of ts) {\n            if (t[0]) {\n                status = t[0].refinement != null ? 'not_refined' : 'not_valid';\n                yield [t[0], undefined];\n            }\n            else if (coerce) {\n                v = t[1];\n                if (k === undefined) {\n                    value = v;\n                }\n                else if (value instanceof Map) {\n                    value.set(k, v);\n                }\n                else if (value instanceof Set) {\n                    value.add(v);\n                }\n                else if (isObject(value)) {\n                    if (v !== undefined || k in value)\n                        value[k] = v;\n                }\n            }\n        }\n    }\n    if (status !== 'not_valid') {\n        for (const failure of struct.refiner(value, ctx)) {\n            failure.explanation = options.message;\n            status = 'not_refined';\n            yield [failure, undefined];\n        }\n    }\n    if (status === 'valid') {\n        yield [undefined, value];\n    }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\nclass Struct {\n    constructor(props) {\n        const { type, schema, validator, refiner, coercer = (value) => value, entries = function* () { }, } = props;\n        this.type = type;\n        this.schema = schema;\n        this.entries = entries;\n        this.coercer = coercer;\n        if (validator) {\n            this.validator = (value, context) => {\n                const result = validator(value, context);\n                return toFailures(result, context, this, value);\n            };\n        }\n        else {\n            this.validator = () => [];\n        }\n        if (refiner) {\n            this.refiner = (value, context) => {\n                const result = refiner(value, context);\n                return toFailures(result, context, this, value);\n            };\n        }\n        else {\n            this.refiner = () => [];\n        }\n    }\n    /**\n     * Assert that a value passes the struct's validation, throwing if it doesn't.\n     */\n    assert(value, message) {\n        return assert(value, this, message);\n    }\n    /**\n     * Create a value with the struct's coercion logic, then validate it.\n     */\n    create(value, message) {\n        return create(value, this, message);\n    }\n    /**\n     * Check if a value passes the struct's validation.\n     */\n    is(value) {\n        return is(value, this);\n    }\n    /**\n     * Mask a value, coercing and validating it, but returning only the subset of\n     * properties defined by the struct's schema. Masking applies recursively to\n     * props of `object` structs only.\n     */\n    mask(value, message) {\n        return mask(value, this, message);\n    }\n    /**\n     * Validate a value with the struct's validation logic, returning a tuple\n     * representing the result.\n     *\n     * You may optionally pass `true` for the `coerce` argument to coerce\n     * the value before attempting to validate it. If you do, the result will\n     * contain the coerced result when successful. Also, `mask` will turn on\n     * masking of the unknown `object` props recursively if passed.\n     */\n    validate(value, options = {}) {\n        return validate(value, this, options);\n    }\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\nfunction assert(value, struct, message) {\n    const result = validate(value, struct, { message });\n    if (result[0]) {\n        throw result[0];\n    }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\nfunction create(value, struct, message) {\n    const result = validate(value, struct, { coerce: true, message });\n    if (result[0]) {\n        throw result[0];\n    }\n    else {\n        return result[1];\n    }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\nfunction mask(value, struct, message) {\n    const result = validate(value, struct, { coerce: true, mask: true, message });\n    if (result[0]) {\n        throw result[0];\n    }\n    else {\n        return result[1];\n    }\n}\n/**\n * Check if a value passes a struct.\n */\nfunction is(value, struct) {\n    const result = validate(value, struct);\n    return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\nfunction validate(value, struct, options = {}) {\n    const tuples = run(value, struct, options);\n    const tuple = shiftIterator(tuples);\n    if (tuple[0]) {\n        const error = new StructError(tuple[0], function* () {\n            for (const t of tuples) {\n                if (t[0]) {\n                    yield t[0];\n                }\n            }\n        });\n        return [error, undefined];\n    }\n    else {\n        const v = tuple[1];\n        return [undefined, v];\n    }\n}\n\nfunction assign(...Structs) {\n    const isType = Structs[0].type === 'type';\n    const schemas = Structs.map((s) => s.schema);\n    const schema = Object.assign({}, ...schemas);\n    return isType ? type(schema) : object(schema);\n}\n/**\n * Define a new struct type with a custom validation function.\n */\nfunction define(name, validator) {\n    return new Struct({ type: name, schema: null, validator });\n}\n/**\n * Create a new struct based on an existing struct, but the value is allowed to\n * be `undefined`. `log` will be called if the value is not `undefined`.\n */\nfunction deprecated(struct, log) {\n    return new Struct({\n        ...struct,\n        refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx),\n        validator(value, ctx) {\n            if (value === undefined) {\n                return true;\n            }\n            else {\n                log(value, ctx);\n                return struct.validator(value, ctx);\n            }\n        },\n    });\n}\n/**\n * Create a struct with dynamic validation logic.\n *\n * The callback will receive the value currently being validated, and must\n * return a struct object to validate it with. This can be useful to model\n * validation logic that changes based on its input.\n */\nfunction dynamic(fn) {\n    return new Struct({\n        type: 'dynamic',\n        schema: null,\n        *entries(value, ctx) {\n            const struct = fn(value, ctx);\n            yield* struct.entries(value, ctx);\n        },\n        validator(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.validator(value, ctx);\n        },\n        coercer(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.coercer(value, ctx);\n        },\n        refiner(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.refiner(value, ctx);\n        },\n    });\n}\n/**\n * Create a struct with lazily evaluated validation logic.\n *\n * The first time validation is run with the struct, the callback will be called\n * and must return a struct object to use. This is useful for cases where you\n * want to have self-referential structs for nested data structures to avoid a\n * circular definition problem.\n */\nfunction lazy(fn) {\n    let struct;\n    return new Struct({\n        type: 'lazy',\n        schema: null,\n        *entries(value, ctx) {\n            struct ?? (struct = fn());\n            yield* struct.entries(value, ctx);\n        },\n        validator(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.validator(value, ctx);\n        },\n        coercer(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.coercer(value, ctx);\n        },\n        refiner(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.refiner(value, ctx);\n        },\n    });\n}\n/**\n * Create a new struct based on an existing object struct, but excluding\n * specific properties.\n *\n * Like TypeScript's `Omit` utility.\n */\nfunction omit(struct, keys) {\n    const { schema } = struct;\n    const subschema = { ...schema };\n    for (const key of keys) {\n        delete subschema[key];\n    }\n    switch (struct.type) {\n        case 'type':\n            return type(subschema);\n        default:\n            return object(subschema);\n    }\n}\n/**\n * Create a new struct based on an existing object struct, but with all of its\n * properties allowed to be `undefined`.\n *\n * Like TypeScript's `Partial` utility.\n */\nfunction partial(struct) {\n    const isStruct = struct instanceof Struct;\n    const schema = isStruct ? { ...struct.schema } : { ...struct };\n    for (const key in schema) {\n        schema[key] = optional(schema[key]);\n    }\n    if (isStruct && struct.type === 'type') {\n        return type(schema);\n    }\n    return object(schema);\n}\n/**\n * Create a new struct based on an existing object struct, but only including\n * specific properties.\n *\n * Like TypeScript's `Pick` utility.\n */\nfunction pick(struct, keys) {\n    const { schema } = struct;\n    const subschema = {};\n    for (const key of keys) {\n        subschema[key] = schema[key];\n    }\n    switch (struct.type) {\n        case 'type':\n            return type(subschema);\n        default:\n            return object(subschema);\n    }\n}\n/**\n * Define a new struct type with a custom validation function.\n *\n * @deprecated This function has been renamed to `define`.\n */\nfunction struct(name, validator) {\n    console.warn('superstruct@0.11 - The `struct` helper has been renamed to `define`.');\n    return define(name, validator);\n}\n\n/**\n * Ensure that any value passes validation.\n */\nfunction any() {\n    return define('any', () => true);\n}\nfunction array(Element) {\n    return new Struct({\n        type: 'array',\n        schema: Element,\n        *entries(value) {\n            if (Element && Array.isArray(value)) {\n                for (const [i, v] of value.entries()) {\n                    yield [i, v, Element];\n                }\n            }\n        },\n        coercer(value) {\n            return Array.isArray(value) ? value.slice() : value;\n        },\n        validator(value) {\n            return (Array.isArray(value) ||\n                `Expected an array value, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a bigint.\n */\nfunction bigint() {\n    return define('bigint', (value) => {\n        return typeof value === 'bigint';\n    });\n}\n/**\n * Ensure that a value is a boolean.\n */\nfunction boolean() {\n    return define('boolean', (value) => {\n        return typeof value === 'boolean';\n    });\n}\n/**\n * Ensure that a value is a valid `Date`.\n *\n * Note: this also ensures that the value is *not* an invalid `Date` object,\n * which can occur when parsing a date fails but still returns a `Date`.\n */\nfunction date() {\n    return define('date', (value) => {\n        return ((value instanceof Date && !isNaN(value.getTime())) ||\n            `Expected a valid \\`Date\\` object, but received: ${print(value)}`);\n    });\n}\nfunction enums(values) {\n    const schema = {};\n    const description = values.map((v) => print(v)).join();\n    for (const key of values) {\n        schema[key] = key;\n    }\n    return new Struct({\n        type: 'enums',\n        schema,\n        validator(value) {\n            return (values.includes(value) ||\n                `Expected one of \\`${description}\\`, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a function.\n */\nfunction func() {\n    return define('func', (value) => {\n        return (typeof value === 'function' ||\n            `Expected a function, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is an instance of a specific class.\n */\nfunction instance(Class) {\n    return define('instance', (value) => {\n        return (value instanceof Class ||\n            `Expected a \\`${Class.name}\\` instance, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is an integer.\n */\nfunction integer() {\n    return define('integer', (value) => {\n        return ((typeof value === 'number' && !isNaN(value) && Number.isInteger(value)) ||\n            `Expected an integer, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value matches all of a set of types.\n */\nfunction intersection(Structs) {\n    return new Struct({\n        type: 'intersection',\n        schema: null,\n        *entries(value, ctx) {\n            for (const S of Structs) {\n                yield* S.entries(value, ctx);\n            }\n        },\n        *validator(value, ctx) {\n            for (const S of Structs) {\n                yield* S.validator(value, ctx);\n            }\n        },\n        *refiner(value, ctx) {\n            for (const S of Structs) {\n                yield* S.refiner(value, ctx);\n            }\n        },\n    });\n}\nfunction literal(constant) {\n    const description = print(constant);\n    const t = typeof constant;\n    return new Struct({\n        type: 'literal',\n        schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n        validator(value) {\n            return (value === constant ||\n                `Expected the literal \\`${description}\\`, but received: ${print(value)}`);\n        },\n    });\n}\nfunction map(Key, Value) {\n    return new Struct({\n        type: 'map',\n        schema: null,\n        *entries(value) {\n            if (Key && Value && value instanceof Map) {\n                for (const [k, v] of value.entries()) {\n                    yield [k, k, Key];\n                    yield [k, v, Value];\n                }\n            }\n        },\n        coercer(value) {\n            return value instanceof Map ? new Map(value) : value;\n        },\n        validator(value) {\n            return (value instanceof Map ||\n                `Expected a \\`Map\\` object, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that no value ever passes validation.\n */\nfunction never() {\n    return define('never', () => false);\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\nfunction nullable(struct) {\n    return new Struct({\n        ...struct,\n        validator: (value, ctx) => value === null || struct.validator(value, ctx),\n        refiner: (value, ctx) => value === null || struct.refiner(value, ctx),\n    });\n}\n/**\n * Ensure that a value is a number.\n */\nfunction number() {\n    return define('number', (value) => {\n        return ((typeof value === 'number' && !isNaN(value)) ||\n            `Expected a number, but received: ${print(value)}`);\n    });\n}\nfunction object(schema) {\n    const knowns = schema ? Object.keys(schema) : [];\n    const Never = never();\n    return new Struct({\n        type: 'object',\n        schema: schema ? schema : null,\n        *entries(value) {\n            if (schema && isObject(value)) {\n                const unknowns = new Set(Object.keys(value));\n                for (const key of knowns) {\n                    unknowns.delete(key);\n                    yield [key, value[key], schema[key]];\n                }\n                for (const key of unknowns) {\n                    yield [key, value[key], Never];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value, ctx) {\n            if (!isNonArrayObject(value)) {\n                return value;\n            }\n            const coerced = { ...value };\n            // The `object` struct has special behaviour enabled by the mask flag.\n            // When masking, properties that are not in the schema are deleted from\n            // the coerced object instead of eventually failing validaiton.\n            if (ctx.mask && schema) {\n                for (const key in coerced) {\n                    if (schema[key] === undefined) {\n                        delete coerced[key];\n                    }\n                }\n            }\n            return coerced;\n        },\n    });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\nfunction optional(struct) {\n    return new Struct({\n        ...struct,\n        validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n        refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx),\n    });\n}\n/**\n * Ensure that a value is an object with keys and values of specific types, but\n * without ensuring any specific shape of properties.\n *\n * Like TypeScript's `Record` utility.\n */\nfunction record(Key, Value) {\n    return new Struct({\n        type: 'record',\n        schema: null,\n        *entries(value) {\n            if (isObject(value)) {\n                for (const k in value) {\n                    const v = value[k];\n                    yield [k, k, Key];\n                    yield [k, v, Value];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return isNonArrayObject(value) ? { ...value } : value;\n        },\n    });\n}\n/**\n * Ensure that a value is a `RegExp`.\n *\n * Note: this does not test the value against the regular expression! For that\n * you need to use the `pattern()` refinement.\n */\nfunction regexp() {\n    return define('regexp', (value) => {\n        return value instanceof RegExp;\n    });\n}\nfunction set(Element) {\n    return new Struct({\n        type: 'set',\n        schema: null,\n        *entries(value) {\n            if (Element && value instanceof Set) {\n                for (const v of value) {\n                    yield [v, v, Element];\n                }\n            }\n        },\n        coercer(value) {\n            return value instanceof Set ? new Set(value) : value;\n        },\n        validator(value) {\n            return (value instanceof Set ||\n                `Expected a \\`Set\\` object, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a string.\n */\nfunction string() {\n    return define('string', (value) => {\n        return (typeof value === 'string' ||\n            `Expected a string, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is a tuple of a specific length, and that each of its\n * elements is of a specific type.\n */\nfunction tuple(Structs) {\n    const Never = never();\n    return new Struct({\n        type: 'tuple',\n        schema: null,\n        *entries(value) {\n            if (Array.isArray(value)) {\n                const length = Math.max(Structs.length, value.length);\n                for (let i = 0; i < length; i++) {\n                    yield [i, value[i], Structs[i] || Never];\n                }\n            }\n        },\n        validator(value) {\n            return (Array.isArray(value) ||\n                `Expected an array, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return Array.isArray(value) ? value.slice() : value;\n        },\n    });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\nfunction type(schema) {\n    const keys = Object.keys(schema);\n    return new Struct({\n        type: 'type',\n        schema,\n        *entries(value) {\n            if (isObject(value)) {\n                for (const k of keys) {\n                    yield [k, value[k], schema[k]];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return isNonArrayObject(value) ? { ...value } : value;\n        },\n    });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\nfunction union(Structs) {\n    const description = Structs.map((s) => s.type).join(' | ');\n    return new Struct({\n        type: 'union',\n        schema: null,\n        coercer(value, ctx) {\n            for (const S of Structs) {\n                const [error, coerced] = S.validate(value, {\n                    coerce: true,\n                    mask: ctx.mask,\n                });\n                if (!error) {\n                    return coerced;\n                }\n            }\n            return value;\n        },\n        validator(value, ctx) {\n            const failures = [];\n            for (const S of Structs) {\n                const [...tuples] = run(value, S, ctx);\n                const [first] = tuples;\n                if (!first[0]) {\n                    return [];\n                }\n                else {\n                    for (const [failure] of tuples) {\n                        if (failure) {\n                            failures.push(failure);\n                        }\n                    }\n                }\n            }\n            return [\n                `Expected the value to satisfy a union of \\`${description}\\`, but received: ${print(value)}`,\n                ...failures,\n            ];\n        },\n    });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\nfunction unknown() {\n    return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction coerce(struct, condition, coercer) {\n    return new Struct({\n        ...struct,\n        coercer: (value, ctx) => {\n            return is(value, condition)\n                ? struct.coercer(coercer(value, ctx), ctx)\n                : struct.coercer(value, ctx);\n        },\n    });\n}\n/**\n * Augment a struct to replace `undefined` values with a default.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction defaulted(struct, fallback, options = {}) {\n    return coerce(struct, unknown(), (x) => {\n        const f = typeof fallback === 'function' ? fallback() : fallback;\n        if (x === undefined) {\n            return f;\n        }\n        if (!options.strict && isPlainObject(x) && isPlainObject(f)) {\n            const ret = { ...x };\n            let changed = false;\n            for (const key in f) {\n                if (ret[key] === undefined) {\n                    ret[key] = f[key];\n                    changed = true;\n                }\n            }\n            if (changed) {\n                return ret;\n            }\n        }\n        return x;\n    });\n}\n/**\n * Augment a struct to trim string inputs.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction trimmed(struct) {\n    return coerce(struct, string(), (x) => x.trim());\n}\n\n/**\n * Ensure that a string, array, map, or set is empty.\n */\nfunction empty(struct) {\n    return refine(struct, 'empty', (value) => {\n        const size = getSize(value);\n        return (size === 0 ||\n            `Expected an empty ${struct.type} but received one with a size of \\`${size}\\``);\n    });\n}\nfunction getSize(value) {\n    if (value instanceof Map || value instanceof Set) {\n        return value.size;\n    }\n    else {\n        return value.length;\n    }\n}\n/**\n * Ensure that a number or date is below a threshold.\n */\nfunction max(struct, threshold, options = {}) {\n    const { exclusive } = options;\n    return refine(struct, 'max', (value) => {\n        return exclusive\n            ? value < threshold\n            : value <= threshold ||\n                `Expected a ${struct.type} less than ${exclusive ? '' : 'or equal to '}${threshold} but received \\`${value}\\``;\n    });\n}\n/**\n * Ensure that a number or date is above a threshold.\n */\nfunction min(struct, threshold, options = {}) {\n    const { exclusive } = options;\n    return refine(struct, 'min', (value) => {\n        return exclusive\n            ? value > threshold\n            : value >= threshold ||\n                `Expected a ${struct.type} greater than ${exclusive ? '' : 'or equal to '}${threshold} but received \\`${value}\\``;\n    });\n}\n/**\n * Ensure that a string, array, map or set is not empty.\n */\nfunction nonempty(struct) {\n    return refine(struct, 'nonempty', (value) => {\n        const size = getSize(value);\n        return (size > 0 || `Expected a nonempty ${struct.type} but received an empty one`);\n    });\n}\n/**\n * Ensure that a string matches a regular expression.\n */\nfunction pattern(struct, regexp) {\n    return refine(struct, 'pattern', (value) => {\n        return (regexp.test(value) ||\n            `Expected a ${struct.type} matching \\`/${regexp.source}/\\` but received \"${value}\"`);\n    });\n}\n/**\n * Ensure that a string, array, number, date, map, or set has a size (or length, or time) between `min` and `max`.\n */\nfunction size(struct, min, max = min) {\n    const expected = `Expected a ${struct.type}`;\n    const of = min === max ? `of \\`${min}\\`` : `between \\`${min}\\` and \\`${max}\\``;\n    return refine(struct, 'size', (value) => {\n        if (typeof value === 'number' || value instanceof Date) {\n            return ((min <= value && value <= max) ||\n                `${expected} ${of} but received \\`${value}\\``);\n        }\n        else if (value instanceof Map || value instanceof Set) {\n            const { size } = value;\n            return ((min <= size && size <= max) ||\n                `${expected} with a size ${of} but received one with a size of \\`${size}\\``);\n        }\n        else {\n            const { length } = value;\n            return ((min <= length && length <= max) ||\n                `${expected} with a length ${of} but received one with a length of \\`${length}\\``);\n        }\n    });\n}\n/**\n * Augment a `Struct` to add an additional refinement to the validation.\n *\n * The refiner function is guaranteed to receive a value of the struct's type,\n * because the struct's existing validation will already have passed. This\n * allows you to layer additional validation on top of existing structs.\n */\nfunction refine(struct, name, refiner) {\n    return new Struct({\n        ...struct,\n        *refiner(value, ctx) {\n            yield* struct.refiner(value, ctx);\n            const result = refiner(value, ctx);\n            const failures = toFailures(result, ctx, struct, value);\n            for (const failure of failures) {\n                yield { ...failure, refinement: name };\n            }\n        },\n    });\n}\n\nexport { Struct, StructError, any, array, assert, assign, bigint, boolean, coerce, create, date, defaulted, define, deprecated, dynamic, empty, enums, func, instance, integer, intersection, is, lazy, literal, map, mask, max, min, never, nonempty, nullable, number, object, omit, optional, partial, pattern, pick, record, refine, regexp, set, size, string, struct, trimmed, tuple, type, union, unknown, validate };\n//# sourceMappingURL=index.mjs.map\n","import EventEmitter from './index.js'\n\nexport { EventEmitter }\nexport default EventEmitter\n","import { Buffer } from 'buffer';\nimport { EventEmitter } from 'eventemitter3';\n\n// node_modules/esbuild-plugin-polyfill-node/polyfills/buffer.js\nvar WebSocketBrowserImpl = class extends EventEmitter {\n  socket;\n  /** Instantiate a WebSocket class\n  * @constructor\n  * @param {String} address - url to a websocket server\n  * @param {(Object)} options - websocket options\n  * @param {(String|Array)} protocols - a list of protocols\n  * @return {WebSocketBrowserImpl} - returns a WebSocket instance\n  */\n  constructor(address, options, protocols) {\n    super();\n    this.socket = new window.WebSocket(address, protocols);\n    this.socket.onopen = () => this.emit(\"open\");\n    this.socket.onmessage = (event) => this.emit(\"message\", event.data);\n    this.socket.onerror = (error) => this.emit(\"error\", error);\n    this.socket.onclose = (event) => {\n      this.emit(\"close\", event.code, event.reason);\n    };\n  }\n  /**\n  * Sends data through a websocket connection\n  * @method\n  * @param {(String|Object)} data - data to be sent via websocket\n  * @param {Object} optionsOrCallback - ws options\n  * @param {Function} callback - a callback called once the data is sent\n  * @return {Undefined}\n  */\n  send(data, optionsOrCallback, callback) {\n    const cb = callback || optionsOrCallback;\n    try {\n      this.socket.send(data);\n      cb();\n    } catch (error) {\n      cb(error);\n    }\n  }\n  /**\n  * Closes an underlying socket\n  * @method\n  * @param {Number} code - status code explaining why the connection is being closed\n  * @param {String} reason - a description why the connection is closing\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  close(code, reason) {\n    this.socket.close(code, reason);\n  }\n  addEventListener(type, listener, options) {\n    this.socket.addEventListener(type, listener, options);\n  }\n};\nfunction WebSocket(address, options) {\n  return new WebSocketBrowserImpl(address, options);\n}\n\n// src/lib/utils.ts\nvar DefaultDataPack = class {\n  encode(value) {\n    return JSON.stringify(value);\n  }\n  decode(value) {\n    return JSON.parse(value);\n  }\n};\n\n// src/lib/client.ts\nvar CommonClient = class extends EventEmitter {\n  address;\n  rpc_id;\n  queue;\n  options;\n  autoconnect;\n  ready;\n  reconnect;\n  reconnect_timer_id;\n  reconnect_interval;\n  max_reconnects;\n  rest_options;\n  current_reconnects;\n  generate_request_id;\n  socket;\n  webSocketFactory;\n  dataPack;\n  /**\n  * Instantiate a Client class.\n  * @constructor\n  * @param {webSocketFactory} webSocketFactory - factory method for WebSocket\n  * @param {String} address - url to a websocket server\n  * @param {Object} options - ws options object with reconnect parameters\n  * @param {Function} generate_request_id - custom generation request Id\n  * @param {DataPack} dataPack - data pack contains encoder and decoder\n  * @return {CommonClient}\n  */\n  constructor(webSocketFactory, address = \"ws://localhost:8080\", {\n    autoconnect = true,\n    reconnect = true,\n    reconnect_interval = 1e3,\n    max_reconnects = 5,\n    ...rest_options\n  } = {}, generate_request_id, dataPack) {\n    super();\n    this.webSocketFactory = webSocketFactory;\n    this.queue = {};\n    this.rpc_id = 0;\n    this.address = address;\n    this.autoconnect = autoconnect;\n    this.ready = false;\n    this.reconnect = reconnect;\n    this.reconnect_timer_id = void 0;\n    this.reconnect_interval = reconnect_interval;\n    this.max_reconnects = max_reconnects;\n    this.rest_options = rest_options;\n    this.current_reconnects = 0;\n    this.generate_request_id = generate_request_id || (() => ++this.rpc_id);\n    if (!dataPack) this.dataPack = new DefaultDataPack();\n    else this.dataPack = dataPack;\n    if (this.autoconnect)\n      this._connect(this.address, {\n        autoconnect: this.autoconnect,\n        reconnect: this.reconnect,\n        reconnect_interval: this.reconnect_interval,\n        max_reconnects: this.max_reconnects,\n        ...this.rest_options\n      });\n  }\n  /**\n  * Connects to a defined server if not connected already.\n  * @method\n  * @return {Undefined}\n  */\n  connect() {\n    if (this.socket) return;\n    this._connect(this.address, {\n      autoconnect: this.autoconnect,\n      reconnect: this.reconnect,\n      reconnect_interval: this.reconnect_interval,\n      max_reconnects: this.max_reconnects,\n      ...this.rest_options\n    });\n  }\n  /**\n  * Calls a registered RPC method on server.\n  * @method\n  * @param {String} method - RPC method name\n  * @param {Object|Array} params - optional method parameters\n  * @param {Number} timeout - RPC reply timeout value\n  * @param {Object} ws_opts - options passed to ws\n  * @return {Promise}\n  */\n  call(method, params, timeout, ws_opts) {\n    if (!ws_opts && \"object\" === typeof timeout) {\n      ws_opts = timeout;\n      timeout = null;\n    }\n    return new Promise((resolve, reject) => {\n      if (!this.ready) return reject(new Error(\"socket not ready\"));\n      const rpc_id = this.generate_request_id(method, params);\n      const message = {\n        jsonrpc: \"2.0\",\n        method,\n        params: params || void 0,\n        id: rpc_id\n      };\n      this.socket.send(this.dataPack.encode(message), ws_opts, (error) => {\n        if (error) return reject(error);\n        this.queue[rpc_id] = { promise: [resolve, reject] };\n        if (timeout) {\n          this.queue[rpc_id].timeout = setTimeout(() => {\n            delete this.queue[rpc_id];\n            reject(new Error(\"reply timeout\"));\n          }, timeout);\n        }\n      });\n    });\n  }\n  /**\n  * Logins with the other side of the connection.\n  * @method\n  * @param {Object} params - Login credentials object\n  * @return {Promise}\n  */\n  async login(params) {\n    const resp = await this.call(\"rpc.login\", params);\n    if (!resp) throw new Error(\"authentication failed\");\n    return resp;\n  }\n  /**\n  * Fetches a list of client's methods registered on server.\n  * @method\n  * @return {Array}\n  */\n  async listMethods() {\n    return await this.call(\"__listMethods\");\n  }\n  /**\n  * Sends a JSON-RPC 2.0 notification to server.\n  * @method\n  * @param {String} method - RPC method name\n  * @param {Object} params - optional method parameters\n  * @return {Promise}\n  */\n  notify(method, params) {\n    return new Promise((resolve, reject) => {\n      if (!this.ready) return reject(new Error(\"socket not ready\"));\n      const message = {\n        jsonrpc: \"2.0\",\n        method,\n        params\n      };\n      this.socket.send(this.dataPack.encode(message), (error) => {\n        if (error) return reject(error);\n        resolve();\n      });\n    });\n  }\n  /**\n  * Subscribes for a defined event.\n  * @method\n  * @param {String|Array} event - event name\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  async subscribe(event) {\n    if (typeof event === \"string\") event = [event];\n    const result = await this.call(\"rpc.on\", event);\n    if (typeof event === \"string\" && result[event] !== \"ok\")\n      throw new Error(\n        \"Failed subscribing to an event '\" + event + \"' with: \" + result[event]\n      );\n    return result;\n  }\n  /**\n  * Unsubscribes from a defined event.\n  * @method\n  * @param {String|Array} event - event name\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  async unsubscribe(event) {\n    if (typeof event === \"string\") event = [event];\n    const result = await this.call(\"rpc.off\", event);\n    if (typeof event === \"string\" && result[event] !== \"ok\")\n      throw new Error(\"Failed unsubscribing from an event with: \" + result);\n    return result;\n  }\n  /**\n  * Closes a WebSocket connection gracefully.\n  * @method\n  * @param {Number} code - socket close code\n  * @param {String} data - optional data to be sent before closing\n  * @return {Undefined}\n  */\n  close(code, data) {\n    this.socket.close(code || 1e3, data);\n  }\n  /**\n  * Enable / disable automatic reconnection.\n  * @method\n  * @param {Boolean} reconnect - enable / disable reconnection\n  * @return {Undefined}\n  */\n  setAutoReconnect(reconnect) {\n    this.reconnect = reconnect;\n  }\n  /**\n  * Set the interval between reconnection attempts.\n  * @method\n  * @param {Number} interval - reconnection interval in milliseconds\n  * @return {Undefined}\n  */\n  setReconnectInterval(interval) {\n    this.reconnect_interval = interval;\n  }\n  /**\n  * Set the maximum number of reconnection attempts.\n  * @method\n  * @param {Number} max_reconnects - maximum reconnection attempts\n  * @return {Undefined}\n  */\n  setMaxReconnects(max_reconnects) {\n    this.max_reconnects = max_reconnects;\n  }\n  /**\n  * Connection/Message handler.\n  * @method\n  * @private\n  * @param {String} address - WebSocket API address\n  * @param {Object} options - ws options object\n  * @return {Undefined}\n  */\n  _connect(address, options) {\n    clearTimeout(this.reconnect_timer_id);\n    this.socket = this.webSocketFactory(address, options);\n    this.socket.addEventListener(\"open\", () => {\n      this.ready = true;\n      this.emit(\"open\");\n      this.current_reconnects = 0;\n    });\n    this.socket.addEventListener(\"message\", ({ data: message }) => {\n      if (message instanceof ArrayBuffer)\n        message = Buffer.from(message).toString();\n      try {\n        message = this.dataPack.decode(message);\n      } catch (error) {\n        return;\n      }\n      if (message.notification && this.listeners(message.notification).length) {\n        if (!Object.keys(message.params).length)\n          return this.emit(message.notification);\n        const args = [message.notification];\n        if (message.params.constructor === Object) args.push(message.params);\n        else\n          for (let i = 0; i < message.params.length; i++)\n            args.push(message.params[i]);\n        return Promise.resolve().then(() => {\n          this.emit.apply(this, args);\n        });\n      }\n      if (!this.queue[message.id]) {\n        if (message.method) {\n          return Promise.resolve().then(() => {\n            this.emit(message.method, message?.params);\n          });\n        }\n        return;\n      }\n      if (\"error\" in message === \"result\" in message)\n        this.queue[message.id].promise[1](\n          new Error(\n            'Server response malformed. Response must include either \"result\" or \"error\", but not both.'\n          )\n        );\n      if (this.queue[message.id].timeout)\n        clearTimeout(this.queue[message.id].timeout);\n      if (message.error) this.queue[message.id].promise[1](message.error);\n      else this.queue[message.id].promise[0](message.result);\n      delete this.queue[message.id];\n    });\n    this.socket.addEventListener(\"error\", (error) => this.emit(\"error\", error));\n    this.socket.addEventListener(\"close\", ({ code, reason }) => {\n      if (this.ready)\n        setTimeout(() => this.emit(\"close\", code, reason), 0);\n      this.ready = false;\n      this.socket = void 0;\n      if (code === 1e3) return;\n      this.current_reconnects++;\n      if (this.reconnect && (this.max_reconnects > this.current_reconnects || this.max_reconnects === 0))\n        this.reconnect_timer_id = setTimeout(\n          () => this._connect(address, options),\n          this.reconnect_interval\n        );\n    });\n  }\n};\n\n// src/index.browser.ts\nvar Client = class extends CommonClient {\n  constructor(address = \"ws://localhost:8080\", {\n    autoconnect = true,\n    reconnect = true,\n    reconnect_interval = 1e3,\n    max_reconnects = 5\n  } = {}, generate_request_id) {\n    super(\n      WebSocket,\n      address,\n      {\n        autoconnect,\n        reconnect,\n        reconnect_interval,\n        max_reconnects\n      },\n      generate_request_id\n    );\n  }\n};\n\nexport { Client, CommonClient, DefaultDataPack, WebSocket };\n//# sourceMappingURL=out.js.map\n//# sourceMappingURL=index.browser.mjs.map","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport { Hash, u32, toBytes, wrapConstructor, wrapXOFConstructorWithOpts, isLE, byteSwap32, } from './utils.js';\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n// Various per round constants calculations\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = [];\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nconst _7n = /* @__PURE__ */ BigInt(7);\nconst _256n = /* @__PURE__ */ BigInt(256);\nconst _0x71n = /* @__PURE__ */ BigInt(0x71);\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    let t = _0n;\n    for (let j = 0; j < 7; j++) {\n        R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n        if (R & _2n)\n            t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n    }\n    _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    B.fill(0);\n}\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        // Can be passed from user as dkLen\n        number(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        if (0 >= this.blockLen || this.blockLen >= 200)\n            throw new Error('Sha3 supports only keccak-f1600 function');\n        this.state = new Uint8Array(200);\n        this.state32 = u32(this.state);\n    }\n    keccak() {\n        if (!isLE)\n            byteSwap32(this.state32);\n        keccakP(this.state32, this.rounds);\n        if (!isLE)\n            byteSwap32(this.state32);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        exists(this);\n        const { blockLen, state } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        exists(this, false);\n        bytes(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        number(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        output(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        this.state.fill(0);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        assertHash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        assertExists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        assertExists(this);\n        assertBytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport { validateBasic, wNAF } from './curve.js';\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\n        // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n        // since we always use positive integers here. It must always be empty:\n        // - add zero byte if exists\n        // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        ut.abytes(data);\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (ut.isBytes(key))\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = mod.mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            if (this.is0()) {\n                // (0, 1, 0) aka ZERO is invalid in most contexts.\n                // In BLS, ZERO can be serialized, so we allow it.\n                // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n                if (CURVE.allowInfinityPoint && !Fp.is0(this.py))\n                    return;\n                throw new Error('bad point: ZERO');\n            }\n            // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n            const { x, y } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.is0();\n            // If invZ was 0, we return zero point. However we still want to execute\n            // all operations, so we replace invZ with a random number, 1.\n            if (iz == null)\n                iz = is0 ? Fp.ONE : Fp.inv(z);\n            const ax = Fp.mul(x, iz);\n            const ay = Fp.mul(y, iz);\n            const zz = Fp.mul(z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y;\n                try {\n                    y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                }\n                catch (sqrtError) {\n                    const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                    throw new Error('Point is not on curve' + suffix);\n                }\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = mod.getMinHashLength(CURVE.n);\n            return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = ut.isBytes(item);\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null && ent !== false) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || ut.isBytes(sg)) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n        randomBytes,\n    };\n}\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { createCurve } from './_shortw_utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n    const P = secp256k1P;\n    // prettier-ignore\n    const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n    // prettier-ignore\n    const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n    const b2 = (y * y * y) % P; // x^3, 11\n    const b3 = (b2 * b2 * y) % P; // x^7\n    const b6 = (pow2(b3, _3n, P) * b3) % P;\n    const b9 = (pow2(b6, _3n, P) * b3) % P;\n    const b11 = (pow2(b9, _2n, P) * b2) % P;\n    const b22 = (pow2(b11, _11n, P) * b11) % P;\n    const b44 = (pow2(b22, _22n, P) * b22) % P;\n    const b88 = (pow2(b44, _44n, P) * b44) % P;\n    const b176 = (pow2(b88, _88n, P) * b88) % P;\n    const b220 = (pow2(b176, _44n, P) * b44) % P;\n    const b223 = (pow2(b220, _3n, P) * b3) % P;\n    const t1 = (pow2(b223, _23n, P) * b22) % P;\n    const t2 = (pow2(t1, _6n, P) * b2) % P;\n    const root = pow2(t2, _2n, P);\n    if (!Fp.eql(Fp.sqr(root), y))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nexport const secp256k1 = createCurve({\n    a: BigInt(0), // equation params: a, b\n    b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n    Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n    n: secp256k1N, // Curve order, total count of valid points in the field\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1), // Cofactor\n    lowS: true, // Allow only low-S signatures by default in sign() and verify()\n    /**\n     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n     */\n    endo: {\n        beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n        splitScalar: (k) => {\n            const n = secp256k1N;\n            const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n            const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n            const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n            const b2 = a1;\n            const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n            const c1 = divNearest(b2 * k, n);\n            const c2 = divNearest(-b1 * k, n);\n            let k1 = mod(k - c1 * a1 - c2 * a2, n);\n            let k2 = mod(-c1 * b1 - c2 * b2, n);\n            const k1neg = k1 > POW_2_128;\n            const k2neg = k2 > POW_2_128;\n            if (k1neg)\n                k1 = n - k1;\n            if (k2neg)\n                k2 = n - k2;\n            if (k1 > POW_2_128 || k2 > POW_2_128) {\n                throw new Error('splitScalar: Endomorphism failed, k=' + k);\n            }\n            return { k1neg, k1, k2neg, k2 };\n        },\n    },\n}, sha256);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\nconst fe = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1N;\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n    let tagP = TAGGED_HASH_PREFIXES[tag];\n    if (tagP === undefined) {\n        const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n        tagP = concatBytes(tagH, tagH);\n        TAGGED_HASH_PREFIXES[tag] = tagP;\n    }\n    return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n    let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n    const scalar = p.hasEvenY() ? d_ : modN(-d_);\n    return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n    if (!fe(x))\n        throw new Error('bad x: need 0 < x < p'); // Fail if x ≥ p.\n    const xx = modP(x * x);\n    const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n    let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n    if (y % _2n !== _0n)\n        y = modP(-y); // Return the unique point P such that x(P) = x and\n    const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n    p.assertValidity();\n    return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n    return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n    const m = ensureBytes('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ bytesToNumberBE(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n    const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n    const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n    if (k_ === _0n)\n        throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n    const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n    const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n    sig.set(rx, 0);\n    sig.set(numTo32b(modN(k + e * d)), 32);\n    // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n    if (!schnorrVerify(sig, m, px))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n    const sig = ensureBytes('signature', signature, 64);\n    const m = ensureBytes('message', message);\n    const pub = ensureBytes('publicKey', publicKey, 32);\n    try {\n        const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n        if (!fe(r))\n            return false;\n        const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!ge(s))\n            return false;\n        const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n        if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\n    }\n}\nexport const schnorr = /* @__PURE__ */ (() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE,\n        bytesToNumberBE,\n        taggedHash,\n        mod,\n    },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\n    // xNum\n    [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n    ],\n    // xDen\n    [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n    // yNum\n    [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n    ],\n    // yDen\n    [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n].map((i) => i.map((j) => BigInt(j)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(Fp.create(scalars[0]));\n    return isoMap(x, y);\n}, {\n    DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n    encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n    p: Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha256,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","import { Buffer } from 'buffer';\nimport { ed25519 } from '@noble/curves/ed25519';\nimport BN from 'bn.js';\nimport bs58 from 'bs58';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { serialize, deserialize, deserializeUnchecked } from 'borsh';\nimport * as BufferLayout from '@solana/buffer-layout';\nimport { blob } from '@solana/buffer-layout';\nimport { toBigIntLE, toBufferLE } from 'bigint-buffer';\nimport { coerce, instance, string, tuple, literal, unknown, type, number, array, nullable, optional, boolean, record, union, create, any, assert as assert$1 } from 'superstruct';\nimport RpcClient from 'jayson/lib/client/browser';\nimport { CommonClient, WebSocket } from 'rpc-websockets';\nimport { keccak_256 } from '@noble/hashes/sha3';\nimport { secp256k1 } from '@noble/curves/secp256k1';\n\n/**\n * A 64 byte secret key, the first 32 bytes of which is the\n * private scalar and the last 32 bytes is the public key.\n * Read more: https://blog.mozilla.org/warner/2011/11/29/ed25519-keys/\n */\n\n/**\n * Ed25519 Keypair\n */\n\nconst generatePrivateKey = ed25519.utils.randomPrivateKey;\nconst generateKeypair = () => {\n  const privateScalar = ed25519.utils.randomPrivateKey();\n  const publicKey = getPublicKey(privateScalar);\n  const secretKey = new Uint8Array(64);\n  secretKey.set(privateScalar);\n  secretKey.set(publicKey, 32);\n  return {\n    publicKey,\n    secretKey\n  };\n};\nconst getPublicKey = ed25519.getPublicKey;\nfunction isOnCurve(publicKey) {\n  try {\n    ed25519.ExtendedPoint.fromHex(publicKey);\n    return true;\n  } catch {\n    return false;\n  }\n}\nconst sign = (message, secretKey) => ed25519.sign(message, secretKey.slice(0, 32));\nconst verify = ed25519.verify;\n\nconst toBuffer = arr => {\n  if (Buffer.isBuffer(arr)) {\n    return arr;\n  } else if (arr instanceof Uint8Array) {\n    return Buffer.from(arr.buffer, arr.byteOffset, arr.byteLength);\n  } else {\n    return Buffer.from(arr);\n  }\n};\n\n// Class wrapping a plain object\nclass Struct {\n  constructor(properties) {\n    Object.assign(this, properties);\n  }\n  encode() {\n    return Buffer.from(serialize(SOLANA_SCHEMA, this));\n  }\n  static decode(data) {\n    return deserialize(SOLANA_SCHEMA, this, data);\n  }\n  static decodeUnchecked(data) {\n    return deserializeUnchecked(SOLANA_SCHEMA, this, data);\n  }\n}\n\n// Class representing a Rust-compatible enum, since enums are only strings or\n// numbers in pure JS\nclass Enum extends Struct {\n  constructor(properties) {\n    super(properties);\n    this.enum = '';\n    if (Object.keys(properties).length !== 1) {\n      throw new Error('Enum can only take single value');\n    }\n    Object.keys(properties).map(key => {\n      this.enum = key;\n    });\n  }\n}\nconst SOLANA_SCHEMA = new Map();\n\nvar _PublicKey;\n\n/**\n * Maximum length of derived pubkey seed\n */\nconst MAX_SEED_LENGTH = 32;\n\n/**\n * Size of public key in bytes\n */\nconst PUBLIC_KEY_LENGTH = 32;\n\n/**\n * Value to be converted into public key\n */\n\n/**\n * JSON object representation of PublicKey class\n */\n\nfunction isPublicKeyData(value) {\n  return value._bn !== undefined;\n}\n\n// local counter used by PublicKey.unique()\nlet uniquePublicKeyCounter = 1;\n\n/**\n * A public key\n */\nclass PublicKey extends Struct {\n  /**\n   * Create a new PublicKey object\n   * @param value ed25519 public key as buffer or base-58 encoded string\n   */\n  constructor(value) {\n    super({});\n    /** @internal */\n    this._bn = void 0;\n    if (isPublicKeyData(value)) {\n      this._bn = value._bn;\n    } else {\n      if (typeof value === 'string') {\n        // assume base 58 encoding by default\n        const decoded = bs58.decode(value);\n        if (decoded.length != PUBLIC_KEY_LENGTH) {\n          throw new Error(`Invalid public key input`);\n        }\n        this._bn = new BN(decoded);\n      } else {\n        this._bn = new BN(value);\n      }\n      if (this._bn.byteLength() > PUBLIC_KEY_LENGTH) {\n        throw new Error(`Invalid public key input`);\n      }\n    }\n  }\n\n  /**\n   * Returns a unique PublicKey for tests and benchmarks using a counter\n   */\n  static unique() {\n    const key = new PublicKey(uniquePublicKeyCounter);\n    uniquePublicKeyCounter += 1;\n    return new PublicKey(key.toBuffer());\n  }\n\n  /**\n   * Default public key value. The base58-encoded string representation is all ones (as seen below)\n   * The underlying BN number is 32 bytes that are all zeros\n   */\n\n  /**\n   * Checks if two publicKeys are equal\n   */\n  equals(publicKey) {\n    return this._bn.eq(publicKey._bn);\n  }\n\n  /**\n   * Return the base-58 representation of the public key\n   */\n  toBase58() {\n    return bs58.encode(this.toBytes());\n  }\n  toJSON() {\n    return this.toBase58();\n  }\n\n  /**\n   * Return the byte array representation of the public key in big endian\n   */\n  toBytes() {\n    const buf = this.toBuffer();\n    return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\n  }\n\n  /**\n   * Return the Buffer representation of the public key in big endian\n   */\n  toBuffer() {\n    const b = this._bn.toArrayLike(Buffer);\n    if (b.length === PUBLIC_KEY_LENGTH) {\n      return b;\n    }\n    const zeroPad = Buffer.alloc(32);\n    b.copy(zeroPad, 32 - b.length);\n    return zeroPad;\n  }\n  get [Symbol.toStringTag]() {\n    return `PublicKey(${this.toString()})`;\n  }\n\n  /**\n   * Return the base-58 representation of the public key\n   */\n  toString() {\n    return this.toBase58();\n  }\n\n  /**\n   * Derive a public key from another key, a seed, and a program ID.\n   * The program ID will also serve as the owner of the public key, giving\n   * it permission to write data to the account.\n   */\n  /* eslint-disable require-await */\n  static async createWithSeed(fromPublicKey, seed, programId) {\n    const buffer = Buffer.concat([fromPublicKey.toBuffer(), Buffer.from(seed), programId.toBuffer()]);\n    const publicKeyBytes = sha256(buffer);\n    return new PublicKey(publicKeyBytes);\n  }\n\n  /**\n   * Derive a program address from seeds and a program ID.\n   */\n  /* eslint-disable require-await */\n  static createProgramAddressSync(seeds, programId) {\n    let buffer = Buffer.alloc(0);\n    seeds.forEach(function (seed) {\n      if (seed.length > MAX_SEED_LENGTH) {\n        throw new TypeError(`Max seed length exceeded`);\n      }\n      buffer = Buffer.concat([buffer, toBuffer(seed)]);\n    });\n    buffer = Buffer.concat([buffer, programId.toBuffer(), Buffer.from('ProgramDerivedAddress')]);\n    const publicKeyBytes = sha256(buffer);\n    if (isOnCurve(publicKeyBytes)) {\n      throw new Error(`Invalid seeds, address must fall off the curve`);\n    }\n    return new PublicKey(publicKeyBytes);\n  }\n\n  /**\n   * Async version of createProgramAddressSync\n   * For backwards compatibility\n   *\n   * @deprecated Use {@link createProgramAddressSync} instead\n   */\n  /* eslint-disable require-await */\n  static async createProgramAddress(seeds, programId) {\n    return this.createProgramAddressSync(seeds, programId);\n  }\n\n  /**\n   * Find a valid program address\n   *\n   * Valid program addresses must fall off the ed25519 curve.  This function\n   * iterates a nonce until it finds one that when combined with the seeds\n   * results in a valid program address.\n   */\n  static findProgramAddressSync(seeds, programId) {\n    let nonce = 255;\n    let address;\n    while (nonce != 0) {\n      try {\n        const seedsWithNonce = seeds.concat(Buffer.from([nonce]));\n        address = this.createProgramAddressSync(seedsWithNonce, programId);\n      } catch (err) {\n        if (err instanceof TypeError) {\n          throw err;\n        }\n        nonce--;\n        continue;\n      }\n      return [address, nonce];\n    }\n    throw new Error(`Unable to find a viable program address nonce`);\n  }\n\n  /**\n   * Async version of findProgramAddressSync\n   * For backwards compatibility\n   *\n   * @deprecated Use {@link findProgramAddressSync} instead\n   */\n  static async findProgramAddress(seeds, programId) {\n    return this.findProgramAddressSync(seeds, programId);\n  }\n\n  /**\n   * Check that a pubkey is on the ed25519 curve.\n   */\n  static isOnCurve(pubkeyData) {\n    const pubkey = new PublicKey(pubkeyData);\n    return isOnCurve(pubkey.toBytes());\n  }\n}\n_PublicKey = PublicKey;\nPublicKey.default = new _PublicKey('11111111111111111111111111111111');\nSOLANA_SCHEMA.set(PublicKey, {\n  kind: 'struct',\n  fields: [['_bn', 'u256']]\n});\n\n/**\n * An account key pair (public and secret keys).\n *\n * @deprecated since v1.10.0, please use {@link Keypair} instead.\n */\nclass Account {\n  /**\n   * Create a new Account object\n   *\n   * If the secretKey parameter is not provided a new key pair is randomly\n   * created for the account\n   *\n   * @param secretKey Secret key for the account\n   */\n  constructor(secretKey) {\n    /** @internal */\n    this._publicKey = void 0;\n    /** @internal */\n    this._secretKey = void 0;\n    if (secretKey) {\n      const secretKeyBuffer = toBuffer(secretKey);\n      if (secretKey.length !== 64) {\n        throw new Error('bad secret key size');\n      }\n      this._publicKey = secretKeyBuffer.slice(32, 64);\n      this._secretKey = secretKeyBuffer.slice(0, 32);\n    } else {\n      this._secretKey = toBuffer(generatePrivateKey());\n      this._publicKey = toBuffer(getPublicKey(this._secretKey));\n    }\n  }\n\n  /**\n   * The public key for this account\n   */\n  get publicKey() {\n    return new PublicKey(this._publicKey);\n  }\n\n  /**\n   * The **unencrypted** secret key for this account. The first 32 bytes\n   * is the private scalar and the last 32 bytes is the public key.\n   * Read more: https://blog.mozilla.org/warner/2011/11/29/ed25519-keys/\n   */\n  get secretKey() {\n    return Buffer.concat([this._secretKey, this._publicKey], 64);\n  }\n}\n\nconst BPF_LOADER_DEPRECATED_PROGRAM_ID = new PublicKey('BPFLoader1111111111111111111111111111111111');\n\n/**\n * Maximum over-the-wire size of a Transaction\n *\n * 1280 is IPv6 minimum MTU\n * 40 bytes is the size of the IPv6 header\n * 8 bytes is the size of the fragment header\n */\nconst PACKET_DATA_SIZE = 1280 - 40 - 8;\nconst VERSION_PREFIX_MASK = 0x7f;\nconst SIGNATURE_LENGTH_IN_BYTES = 64;\n\nclass TransactionExpiredBlockheightExceededError extends Error {\n  constructor(signature) {\n    super(`Signature ${signature} has expired: block height exceeded.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredBlockheightExceededError.prototype, 'name', {\n  value: 'TransactionExpiredBlockheightExceededError'\n});\nclass TransactionExpiredTimeoutError extends Error {\n  constructor(signature, timeoutSeconds) {\n    super(`Transaction was not confirmed in ${timeoutSeconds.toFixed(2)} seconds. It is ` + 'unknown if it succeeded or failed. Check signature ' + `${signature} using the Solana Explorer or CLI tools.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredTimeoutError.prototype, 'name', {\n  value: 'TransactionExpiredTimeoutError'\n});\nclass TransactionExpiredNonceInvalidError extends Error {\n  constructor(signature) {\n    super(`Signature ${signature} has expired: the nonce is no longer valid.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredNonceInvalidError.prototype, 'name', {\n  value: 'TransactionExpiredNonceInvalidError'\n});\n\nclass MessageAccountKeys {\n  constructor(staticAccountKeys, accountKeysFromLookups) {\n    this.staticAccountKeys = void 0;\n    this.accountKeysFromLookups = void 0;\n    this.staticAccountKeys = staticAccountKeys;\n    this.accountKeysFromLookups = accountKeysFromLookups;\n  }\n  keySegments() {\n    const keySegments = [this.staticAccountKeys];\n    if (this.accountKeysFromLookups) {\n      keySegments.push(this.accountKeysFromLookups.writable);\n      keySegments.push(this.accountKeysFromLookups.readonly);\n    }\n    return keySegments;\n  }\n  get(index) {\n    for (const keySegment of this.keySegments()) {\n      if (index < keySegment.length) {\n        return keySegment[index];\n      } else {\n        index -= keySegment.length;\n      }\n    }\n    return;\n  }\n  get length() {\n    return this.keySegments().flat().length;\n  }\n  compileInstructions(instructions) {\n    // Bail early if any account indexes would overflow a u8\n    const U8_MAX = 255;\n    if (this.length > U8_MAX + 1) {\n      throw new Error('Account index overflow encountered during compilation');\n    }\n    const keyIndexMap = new Map();\n    this.keySegments().flat().forEach((key, index) => {\n      keyIndexMap.set(key.toBase58(), index);\n    });\n    const findKeyIndex = key => {\n      const keyIndex = keyIndexMap.get(key.toBase58());\n      if (keyIndex === undefined) throw new Error('Encountered an unknown instruction account key during compilation');\n      return keyIndex;\n    };\n    return instructions.map(instruction => {\n      return {\n        programIdIndex: findKeyIndex(instruction.programId),\n        accountKeyIndexes: instruction.keys.map(meta => findKeyIndex(meta.pubkey)),\n        data: instruction.data\n      };\n    });\n  }\n}\n\n/**\n * Layout for a public key\n */\nconst publicKey = (property = 'publicKey') => {\n  return BufferLayout.blob(32, property);\n};\n\n/**\n * Layout for a signature\n */\nconst signature = (property = 'signature') => {\n  return BufferLayout.blob(64, property);\n};\n/**\n * Layout for a Rust String type\n */\nconst rustString = (property = 'string') => {\n  const rsl = BufferLayout.struct([BufferLayout.u32('length'), BufferLayout.u32('lengthPadding'), BufferLayout.blob(BufferLayout.offset(BufferLayout.u32(), -8), 'chars')], property);\n  const _decode = rsl.decode.bind(rsl);\n  const _encode = rsl.encode.bind(rsl);\n  const rslShim = rsl;\n  rslShim.decode = (b, offset) => {\n    const data = _decode(b, offset);\n    return data['chars'].toString();\n  };\n  rslShim.encode = (str, b, offset) => {\n    const data = {\n      chars: Buffer.from(str, 'utf8')\n    };\n    return _encode(data, b, offset);\n  };\n  rslShim.alloc = str => {\n    return BufferLayout.u32().span + BufferLayout.u32().span + Buffer.from(str, 'utf8').length;\n  };\n  return rslShim;\n};\n\n/**\n * Layout for an Authorized object\n */\nconst authorized = (property = 'authorized') => {\n  return BufferLayout.struct([publicKey('staker'), publicKey('withdrawer')], property);\n};\n\n/**\n * Layout for a Lockup object\n */\nconst lockup = (property = 'lockup') => {\n  return BufferLayout.struct([BufferLayout.ns64('unixTimestamp'), BufferLayout.ns64('epoch'), publicKey('custodian')], property);\n};\n\n/**\n *  Layout for a VoteInit object\n */\nconst voteInit = (property = 'voteInit') => {\n  return BufferLayout.struct([publicKey('nodePubkey'), publicKey('authorizedVoter'), publicKey('authorizedWithdrawer'), BufferLayout.u8('commission')], property);\n};\n\n/**\n *  Layout for a VoteAuthorizeWithSeedArgs object\n */\nconst voteAuthorizeWithSeedArgs = (property = 'voteAuthorizeWithSeedArgs') => {\n  return BufferLayout.struct([BufferLayout.u32('voteAuthorizationType'), publicKey('currentAuthorityDerivedKeyOwnerPubkey'), rustString('currentAuthorityDerivedKeySeed'), publicKey('newAuthorized')], property);\n};\nfunction getAlloc(type, fields) {\n  const getItemAlloc = item => {\n    if (item.span >= 0) {\n      return item.span;\n    } else if (typeof item.alloc === 'function') {\n      return item.alloc(fields[item.property]);\n    } else if ('count' in item && 'elementLayout' in item) {\n      const field = fields[item.property];\n      if (Array.isArray(field)) {\n        return field.length * getItemAlloc(item.elementLayout);\n      }\n    } else if ('fields' in item) {\n      // This is a `Structure` whose size needs to be recursively measured.\n      return getAlloc({\n        layout: item\n      }, fields[item.property]);\n    }\n    // Couldn't determine allocated size of layout\n    return 0;\n  };\n  let alloc = 0;\n  type.layout.fields.forEach(item => {\n    alloc += getItemAlloc(item);\n  });\n  return alloc;\n}\n\nfunction decodeLength(bytes) {\n  let len = 0;\n  let size = 0;\n  for (;;) {\n    let elem = bytes.shift();\n    len |= (elem & 0x7f) << size * 7;\n    size += 1;\n    if ((elem & 0x80) === 0) {\n      break;\n    }\n  }\n  return len;\n}\nfunction encodeLength(bytes, len) {\n  let rem_len = len;\n  for (;;) {\n    let elem = rem_len & 0x7f;\n    rem_len >>= 7;\n    if (rem_len == 0) {\n      bytes.push(elem);\n      break;\n    } else {\n      elem |= 0x80;\n      bytes.push(elem);\n    }\n  }\n}\n\nfunction assert (condition, message) {\n  if (!condition) {\n    throw new Error(message || 'Assertion failed');\n  }\n}\n\nclass CompiledKeys {\n  constructor(payer, keyMetaMap) {\n    this.payer = void 0;\n    this.keyMetaMap = void 0;\n    this.payer = payer;\n    this.keyMetaMap = keyMetaMap;\n  }\n  static compile(instructions, payer) {\n    const keyMetaMap = new Map();\n    const getOrInsertDefault = pubkey => {\n      const address = pubkey.toBase58();\n      let keyMeta = keyMetaMap.get(address);\n      if (keyMeta === undefined) {\n        keyMeta = {\n          isSigner: false,\n          isWritable: false,\n          isInvoked: false\n        };\n        keyMetaMap.set(address, keyMeta);\n      }\n      return keyMeta;\n    };\n    const payerKeyMeta = getOrInsertDefault(payer);\n    payerKeyMeta.isSigner = true;\n    payerKeyMeta.isWritable = true;\n    for (const ix of instructions) {\n      getOrInsertDefault(ix.programId).isInvoked = true;\n      for (const accountMeta of ix.keys) {\n        const keyMeta = getOrInsertDefault(accountMeta.pubkey);\n        keyMeta.isSigner ||= accountMeta.isSigner;\n        keyMeta.isWritable ||= accountMeta.isWritable;\n      }\n    }\n    return new CompiledKeys(payer, keyMetaMap);\n  }\n  getMessageComponents() {\n    const mapEntries = [...this.keyMetaMap.entries()];\n    assert(mapEntries.length <= 256, 'Max static account keys length exceeded');\n    const writableSigners = mapEntries.filter(([, meta]) => meta.isSigner && meta.isWritable);\n    const readonlySigners = mapEntries.filter(([, meta]) => meta.isSigner && !meta.isWritable);\n    const writableNonSigners = mapEntries.filter(([, meta]) => !meta.isSigner && meta.isWritable);\n    const readonlyNonSigners = mapEntries.filter(([, meta]) => !meta.isSigner && !meta.isWritable);\n    const header = {\n      numRequiredSignatures: writableSigners.length + readonlySigners.length,\n      numReadonlySignedAccounts: readonlySigners.length,\n      numReadonlyUnsignedAccounts: readonlyNonSigners.length\n    };\n\n    // sanity checks\n    {\n      assert(writableSigners.length > 0, 'Expected at least one writable signer key');\n      const [payerAddress] = writableSigners[0];\n      assert(payerAddress === this.payer.toBase58(), 'Expected first writable signer key to be the fee payer');\n    }\n    const staticAccountKeys = [...writableSigners.map(([address]) => new PublicKey(address)), ...readonlySigners.map(([address]) => new PublicKey(address)), ...writableNonSigners.map(([address]) => new PublicKey(address)), ...readonlyNonSigners.map(([address]) => new PublicKey(address))];\n    return [header, staticAccountKeys];\n  }\n  extractTableLookup(lookupTable) {\n    const [writableIndexes, drainedWritableKeys] = this.drainKeysFoundInLookupTable(lookupTable.state.addresses, keyMeta => !keyMeta.isSigner && !keyMeta.isInvoked && keyMeta.isWritable);\n    const [readonlyIndexes, drainedReadonlyKeys] = this.drainKeysFoundInLookupTable(lookupTable.state.addresses, keyMeta => !keyMeta.isSigner && !keyMeta.isInvoked && !keyMeta.isWritable);\n\n    // Don't extract lookup if no keys were found\n    if (writableIndexes.length === 0 && readonlyIndexes.length === 0) {\n      return;\n    }\n    return [{\n      accountKey: lookupTable.key,\n      writableIndexes,\n      readonlyIndexes\n    }, {\n      writable: drainedWritableKeys,\n      readonly: drainedReadonlyKeys\n    }];\n  }\n\n  /** @internal */\n  drainKeysFoundInLookupTable(lookupTableEntries, keyMetaFilter) {\n    const lookupTableIndexes = new Array();\n    const drainedKeys = new Array();\n    for (const [address, keyMeta] of this.keyMetaMap.entries()) {\n      if (keyMetaFilter(keyMeta)) {\n        const key = new PublicKey(address);\n        const lookupTableIndex = lookupTableEntries.findIndex(entry => entry.equals(key));\n        if (lookupTableIndex >= 0) {\n          assert(lookupTableIndex < 256, 'Max lookup table index exceeded');\n          lookupTableIndexes.push(lookupTableIndex);\n          drainedKeys.push(key);\n          this.keyMetaMap.delete(address);\n        }\n      }\n    }\n    return [lookupTableIndexes, drainedKeys];\n  }\n}\n\nconst END_OF_BUFFER_ERROR_MESSAGE = 'Reached end of buffer unexpectedly';\n\n/**\n * Delegates to `Array#shift`, but throws if the array is zero-length.\n */\nfunction guardedShift(byteArray) {\n  if (byteArray.length === 0) {\n    throw new Error(END_OF_BUFFER_ERROR_MESSAGE);\n  }\n  return byteArray.shift();\n}\n\n/**\n * Delegates to `Array#splice`, but throws if the section being spliced out extends past the end of\n * the array.\n */\nfunction guardedSplice(byteArray, ...args) {\n  const [start] = args;\n  if (args.length === 2 // Implies that `deleteCount` was supplied\n  ? start + (args[1] ?? 0) > byteArray.length : start >= byteArray.length) {\n    throw new Error(END_OF_BUFFER_ERROR_MESSAGE);\n  }\n  return byteArray.splice(...args);\n}\n\n/**\n * An instruction to execute by a program\n *\n * @property {number} programIdIndex\n * @property {number[]} accounts\n * @property {string} data\n */\n\n/**\n * Message constructor arguments\n */\n\n/**\n * List of instructions to be processed atomically\n */\nclass Message {\n  constructor(args) {\n    this.header = void 0;\n    this.accountKeys = void 0;\n    this.recentBlockhash = void 0;\n    this.instructions = void 0;\n    this.indexToProgramIds = new Map();\n    this.header = args.header;\n    this.accountKeys = args.accountKeys.map(account => new PublicKey(account));\n    this.recentBlockhash = args.recentBlockhash;\n    this.instructions = args.instructions;\n    this.instructions.forEach(ix => this.indexToProgramIds.set(ix.programIdIndex, this.accountKeys[ix.programIdIndex]));\n  }\n  get version() {\n    return 'legacy';\n  }\n  get staticAccountKeys() {\n    return this.accountKeys;\n  }\n  get compiledInstructions() {\n    return this.instructions.map(ix => ({\n      programIdIndex: ix.programIdIndex,\n      accountKeyIndexes: ix.accounts,\n      data: bs58.decode(ix.data)\n    }));\n  }\n  get addressTableLookups() {\n    return [];\n  }\n  getAccountKeys() {\n    return new MessageAccountKeys(this.staticAccountKeys);\n  }\n  static compile(args) {\n    const compiledKeys = CompiledKeys.compile(args.instructions, args.payerKey);\n    const [header, staticAccountKeys] = compiledKeys.getMessageComponents();\n    const accountKeys = new MessageAccountKeys(staticAccountKeys);\n    const instructions = accountKeys.compileInstructions(args.instructions).map(ix => ({\n      programIdIndex: ix.programIdIndex,\n      accounts: ix.accountKeyIndexes,\n      data: bs58.encode(ix.data)\n    }));\n    return new Message({\n      header,\n      accountKeys: staticAccountKeys,\n      recentBlockhash: args.recentBlockhash,\n      instructions\n    });\n  }\n  isAccountSigner(index) {\n    return index < this.header.numRequiredSignatures;\n  }\n  isAccountWritable(index) {\n    const numSignedAccounts = this.header.numRequiredSignatures;\n    if (index >= this.header.numRequiredSignatures) {\n      const unsignedAccountIndex = index - numSignedAccounts;\n      const numUnsignedAccounts = this.accountKeys.length - numSignedAccounts;\n      const numWritableUnsignedAccounts = numUnsignedAccounts - this.header.numReadonlyUnsignedAccounts;\n      return unsignedAccountIndex < numWritableUnsignedAccounts;\n    } else {\n      const numWritableSignedAccounts = numSignedAccounts - this.header.numReadonlySignedAccounts;\n      return index < numWritableSignedAccounts;\n    }\n  }\n  isProgramId(index) {\n    return this.indexToProgramIds.has(index);\n  }\n  programIds() {\n    return [...this.indexToProgramIds.values()];\n  }\n  nonProgramIds() {\n    return this.accountKeys.filter((_, index) => !this.isProgramId(index));\n  }\n  serialize() {\n    const numKeys = this.accountKeys.length;\n    let keyCount = [];\n    encodeLength(keyCount, numKeys);\n    const instructions = this.instructions.map(instruction => {\n      const {\n        accounts,\n        programIdIndex\n      } = instruction;\n      const data = Array.from(bs58.decode(instruction.data));\n      let keyIndicesCount = [];\n      encodeLength(keyIndicesCount, accounts.length);\n      let dataCount = [];\n      encodeLength(dataCount, data.length);\n      return {\n        programIdIndex,\n        keyIndicesCount: Buffer.from(keyIndicesCount),\n        keyIndices: accounts,\n        dataLength: Buffer.from(dataCount),\n        data\n      };\n    });\n    let instructionCount = [];\n    encodeLength(instructionCount, instructions.length);\n    let instructionBuffer = Buffer.alloc(PACKET_DATA_SIZE);\n    Buffer.from(instructionCount).copy(instructionBuffer);\n    let instructionBufferLength = instructionCount.length;\n    instructions.forEach(instruction => {\n      const instructionLayout = BufferLayout.struct([BufferLayout.u8('programIdIndex'), BufferLayout.blob(instruction.keyIndicesCount.length, 'keyIndicesCount'), BufferLayout.seq(BufferLayout.u8('keyIndex'), instruction.keyIndices.length, 'keyIndices'), BufferLayout.blob(instruction.dataLength.length, 'dataLength'), BufferLayout.seq(BufferLayout.u8('userdatum'), instruction.data.length, 'data')]);\n      const length = instructionLayout.encode(instruction, instructionBuffer, instructionBufferLength);\n      instructionBufferLength += length;\n    });\n    instructionBuffer = instructionBuffer.slice(0, instructionBufferLength);\n    const signDataLayout = BufferLayout.struct([BufferLayout.blob(1, 'numRequiredSignatures'), BufferLayout.blob(1, 'numReadonlySignedAccounts'), BufferLayout.blob(1, 'numReadonlyUnsignedAccounts'), BufferLayout.blob(keyCount.length, 'keyCount'), BufferLayout.seq(publicKey('key'), numKeys, 'keys'), publicKey('recentBlockhash')]);\n    const transaction = {\n      numRequiredSignatures: Buffer.from([this.header.numRequiredSignatures]),\n      numReadonlySignedAccounts: Buffer.from([this.header.numReadonlySignedAccounts]),\n      numReadonlyUnsignedAccounts: Buffer.from([this.header.numReadonlyUnsignedAccounts]),\n      keyCount: Buffer.from(keyCount),\n      keys: this.accountKeys.map(key => toBuffer(key.toBytes())),\n      recentBlockhash: bs58.decode(this.recentBlockhash)\n    };\n    let signData = Buffer.alloc(2048);\n    const length = signDataLayout.encode(transaction, signData);\n    instructionBuffer.copy(signData, length);\n    return signData.slice(0, length + instructionBuffer.length);\n  }\n\n  /**\n   * Decode a compiled message into a Message object.\n   */\n  static from(buffer) {\n    // Slice up wire data\n    let byteArray = [...buffer];\n    const numRequiredSignatures = guardedShift(byteArray);\n    if (numRequiredSignatures !== (numRequiredSignatures & VERSION_PREFIX_MASK)) {\n      throw new Error('Versioned messages must be deserialized with VersionedMessage.deserialize()');\n    }\n    const numReadonlySignedAccounts = guardedShift(byteArray);\n    const numReadonlyUnsignedAccounts = guardedShift(byteArray);\n    const accountCount = decodeLength(byteArray);\n    let accountKeys = [];\n    for (let i = 0; i < accountCount; i++) {\n      const account = guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH);\n      accountKeys.push(new PublicKey(Buffer.from(account)));\n    }\n    const recentBlockhash = guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH);\n    const instructionCount = decodeLength(byteArray);\n    let instructions = [];\n    for (let i = 0; i < instructionCount; i++) {\n      const programIdIndex = guardedShift(byteArray);\n      const accountCount = decodeLength(byteArray);\n      const accounts = guardedSplice(byteArray, 0, accountCount);\n      const dataLength = decodeLength(byteArray);\n      const dataSlice = guardedSplice(byteArray, 0, dataLength);\n      const data = bs58.encode(Buffer.from(dataSlice));\n      instructions.push({\n        programIdIndex,\n        accounts,\n        data\n      });\n    }\n    const messageArgs = {\n      header: {\n        numRequiredSignatures,\n        numReadonlySignedAccounts,\n        numReadonlyUnsignedAccounts\n      },\n      recentBlockhash: bs58.encode(Buffer.from(recentBlockhash)),\n      accountKeys,\n      instructions\n    };\n    return new Message(messageArgs);\n  }\n}\n\n/**\n * Message constructor arguments\n */\n\nclass MessageV0 {\n  constructor(args) {\n    this.header = void 0;\n    this.staticAccountKeys = void 0;\n    this.recentBlockhash = void 0;\n    this.compiledInstructions = void 0;\n    this.addressTableLookups = void 0;\n    this.header = args.header;\n    this.staticAccountKeys = args.staticAccountKeys;\n    this.recentBlockhash = args.recentBlockhash;\n    this.compiledInstructions = args.compiledInstructions;\n    this.addressTableLookups = args.addressTableLookups;\n  }\n  get version() {\n    return 0;\n  }\n  get numAccountKeysFromLookups() {\n    let count = 0;\n    for (const lookup of this.addressTableLookups) {\n      count += lookup.readonlyIndexes.length + lookup.writableIndexes.length;\n    }\n    return count;\n  }\n  getAccountKeys(args) {\n    let accountKeysFromLookups;\n    if (args && 'accountKeysFromLookups' in args && args.accountKeysFromLookups) {\n      if (this.numAccountKeysFromLookups != args.accountKeysFromLookups.writable.length + args.accountKeysFromLookups.readonly.length) {\n        throw new Error('Failed to get account keys because of a mismatch in the number of account keys from lookups');\n      }\n      accountKeysFromLookups = args.accountKeysFromLookups;\n    } else if (args && 'addressLookupTableAccounts' in args && args.addressLookupTableAccounts) {\n      accountKeysFromLookups = this.resolveAddressTableLookups(args.addressLookupTableAccounts);\n    } else if (this.addressTableLookups.length > 0) {\n      throw new Error('Failed to get account keys because address table lookups were not resolved');\n    }\n    return new MessageAccountKeys(this.staticAccountKeys, accountKeysFromLookups);\n  }\n  isAccountSigner(index) {\n    return index < this.header.numRequiredSignatures;\n  }\n  isAccountWritable(index) {\n    const numSignedAccounts = this.header.numRequiredSignatures;\n    const numStaticAccountKeys = this.staticAccountKeys.length;\n    if (index >= numStaticAccountKeys) {\n      const lookupAccountKeysIndex = index - numStaticAccountKeys;\n      const numWritableLookupAccountKeys = this.addressTableLookups.reduce((count, lookup) => count + lookup.writableIndexes.length, 0);\n      return lookupAccountKeysIndex < numWritableLookupAccountKeys;\n    } else if (index >= this.header.numRequiredSignatures) {\n      const unsignedAccountIndex = index - numSignedAccounts;\n      const numUnsignedAccounts = numStaticAccountKeys - numSignedAccounts;\n      const numWritableUnsignedAccounts = numUnsignedAccounts - this.header.numReadonlyUnsignedAccounts;\n      return unsignedAccountIndex < numWritableUnsignedAccounts;\n    } else {\n      const numWritableSignedAccounts = numSignedAccounts - this.header.numReadonlySignedAccounts;\n      return index < numWritableSignedAccounts;\n    }\n  }\n  resolveAddressTableLookups(addressLookupTableAccounts) {\n    const accountKeysFromLookups = {\n      writable: [],\n      readonly: []\n    };\n    for (const tableLookup of this.addressTableLookups) {\n      const tableAccount = addressLookupTableAccounts.find(account => account.key.equals(tableLookup.accountKey));\n      if (!tableAccount) {\n        throw new Error(`Failed to find address lookup table account for table key ${tableLookup.accountKey.toBase58()}`);\n      }\n      for (const index of tableLookup.writableIndexes) {\n        if (index < tableAccount.state.addresses.length) {\n          accountKeysFromLookups.writable.push(tableAccount.state.addresses[index]);\n        } else {\n          throw new Error(`Failed to find address for index ${index} in address lookup table ${tableLookup.accountKey.toBase58()}`);\n        }\n      }\n      for (const index of tableLookup.readonlyIndexes) {\n        if (index < tableAccount.state.addresses.length) {\n          accountKeysFromLookups.readonly.push(tableAccount.state.addresses[index]);\n        } else {\n          throw new Error(`Failed to find address for index ${index} in address lookup table ${tableLookup.accountKey.toBase58()}`);\n        }\n      }\n    }\n    return accountKeysFromLookups;\n  }\n  static compile(args) {\n    const compiledKeys = CompiledKeys.compile(args.instructions, args.payerKey);\n    const addressTableLookups = new Array();\n    const accountKeysFromLookups = {\n      writable: new Array(),\n      readonly: new Array()\n    };\n    const lookupTableAccounts = args.addressLookupTableAccounts || [];\n    for (const lookupTable of lookupTableAccounts) {\n      const extractResult = compiledKeys.extractTableLookup(lookupTable);\n      if (extractResult !== undefined) {\n        const [addressTableLookup, {\n          writable,\n          readonly\n        }] = extractResult;\n        addressTableLookups.push(addressTableLookup);\n        accountKeysFromLookups.writable.push(...writable);\n        accountKeysFromLookups.readonly.push(...readonly);\n      }\n    }\n    const [header, staticAccountKeys] = compiledKeys.getMessageComponents();\n    const accountKeys = new MessageAccountKeys(staticAccountKeys, accountKeysFromLookups);\n    const compiledInstructions = accountKeys.compileInstructions(args.instructions);\n    return new MessageV0({\n      header,\n      staticAccountKeys,\n      recentBlockhash: args.recentBlockhash,\n      compiledInstructions,\n      addressTableLookups\n    });\n  }\n  serialize() {\n    const encodedStaticAccountKeysLength = Array();\n    encodeLength(encodedStaticAccountKeysLength, this.staticAccountKeys.length);\n    const serializedInstructions = this.serializeInstructions();\n    const encodedInstructionsLength = Array();\n    encodeLength(encodedInstructionsLength, this.compiledInstructions.length);\n    const serializedAddressTableLookups = this.serializeAddressTableLookups();\n    const encodedAddressTableLookupsLength = Array();\n    encodeLength(encodedAddressTableLookupsLength, this.addressTableLookups.length);\n    const messageLayout = BufferLayout.struct([BufferLayout.u8('prefix'), BufferLayout.struct([BufferLayout.u8('numRequiredSignatures'), BufferLayout.u8('numReadonlySignedAccounts'), BufferLayout.u8('numReadonlyUnsignedAccounts')], 'header'), BufferLayout.blob(encodedStaticAccountKeysLength.length, 'staticAccountKeysLength'), BufferLayout.seq(publicKey(), this.staticAccountKeys.length, 'staticAccountKeys'), publicKey('recentBlockhash'), BufferLayout.blob(encodedInstructionsLength.length, 'instructionsLength'), BufferLayout.blob(serializedInstructions.length, 'serializedInstructions'), BufferLayout.blob(encodedAddressTableLookupsLength.length, 'addressTableLookupsLength'), BufferLayout.blob(serializedAddressTableLookups.length, 'serializedAddressTableLookups')]);\n    const serializedMessage = new Uint8Array(PACKET_DATA_SIZE);\n    const MESSAGE_VERSION_0_PREFIX = 1 << 7;\n    const serializedMessageLength = messageLayout.encode({\n      prefix: MESSAGE_VERSION_0_PREFIX,\n      header: this.header,\n      staticAccountKeysLength: new Uint8Array(encodedStaticAccountKeysLength),\n      staticAccountKeys: this.staticAccountKeys.map(key => key.toBytes()),\n      recentBlockhash: bs58.decode(this.recentBlockhash),\n      instructionsLength: new Uint8Array(encodedInstructionsLength),\n      serializedInstructions,\n      addressTableLookupsLength: new Uint8Array(encodedAddressTableLookupsLength),\n      serializedAddressTableLookups\n    }, serializedMessage);\n    return serializedMessage.slice(0, serializedMessageLength);\n  }\n  serializeInstructions() {\n    let serializedLength = 0;\n    const serializedInstructions = new Uint8Array(PACKET_DATA_SIZE);\n    for (const instruction of this.compiledInstructions) {\n      const encodedAccountKeyIndexesLength = Array();\n      encodeLength(encodedAccountKeyIndexesLength, instruction.accountKeyIndexes.length);\n      const encodedDataLength = Array();\n      encodeLength(encodedDataLength, instruction.data.length);\n      const instructionLayout = BufferLayout.struct([BufferLayout.u8('programIdIndex'), BufferLayout.blob(encodedAccountKeyIndexesLength.length, 'encodedAccountKeyIndexesLength'), BufferLayout.seq(BufferLayout.u8(), instruction.accountKeyIndexes.length, 'accountKeyIndexes'), BufferLayout.blob(encodedDataLength.length, 'encodedDataLength'), BufferLayout.blob(instruction.data.length, 'data')]);\n      serializedLength += instructionLayout.encode({\n        programIdIndex: instruction.programIdIndex,\n        encodedAccountKeyIndexesLength: new Uint8Array(encodedAccountKeyIndexesLength),\n        accountKeyIndexes: instruction.accountKeyIndexes,\n        encodedDataLength: new Uint8Array(encodedDataLength),\n        data: instruction.data\n      }, serializedInstructions, serializedLength);\n    }\n    return serializedInstructions.slice(0, serializedLength);\n  }\n  serializeAddressTableLookups() {\n    let serializedLength = 0;\n    const serializedAddressTableLookups = new Uint8Array(PACKET_DATA_SIZE);\n    for (const lookup of this.addressTableLookups) {\n      const encodedWritableIndexesLength = Array();\n      encodeLength(encodedWritableIndexesLength, lookup.writableIndexes.length);\n      const encodedReadonlyIndexesLength = Array();\n      encodeLength(encodedReadonlyIndexesLength, lookup.readonlyIndexes.length);\n      const addressTableLookupLayout = BufferLayout.struct([publicKey('accountKey'), BufferLayout.blob(encodedWritableIndexesLength.length, 'encodedWritableIndexesLength'), BufferLayout.seq(BufferLayout.u8(), lookup.writableIndexes.length, 'writableIndexes'), BufferLayout.blob(encodedReadonlyIndexesLength.length, 'encodedReadonlyIndexesLength'), BufferLayout.seq(BufferLayout.u8(), lookup.readonlyIndexes.length, 'readonlyIndexes')]);\n      serializedLength += addressTableLookupLayout.encode({\n        accountKey: lookup.accountKey.toBytes(),\n        encodedWritableIndexesLength: new Uint8Array(encodedWritableIndexesLength),\n        writableIndexes: lookup.writableIndexes,\n        encodedReadonlyIndexesLength: new Uint8Array(encodedReadonlyIndexesLength),\n        readonlyIndexes: lookup.readonlyIndexes\n      }, serializedAddressTableLookups, serializedLength);\n    }\n    return serializedAddressTableLookups.slice(0, serializedLength);\n  }\n  static deserialize(serializedMessage) {\n    let byteArray = [...serializedMessage];\n    const prefix = guardedShift(byteArray);\n    const maskedPrefix = prefix & VERSION_PREFIX_MASK;\n    assert(prefix !== maskedPrefix, `Expected versioned message but received legacy message`);\n    const version = maskedPrefix;\n    assert(version === 0, `Expected versioned message with version 0 but found version ${version}`);\n    const header = {\n      numRequiredSignatures: guardedShift(byteArray),\n      numReadonlySignedAccounts: guardedShift(byteArray),\n      numReadonlyUnsignedAccounts: guardedShift(byteArray)\n    };\n    const staticAccountKeys = [];\n    const staticAccountKeysLength = decodeLength(byteArray);\n    for (let i = 0; i < staticAccountKeysLength; i++) {\n      staticAccountKeys.push(new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH)));\n    }\n    const recentBlockhash = bs58.encode(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n    const instructionCount = decodeLength(byteArray);\n    const compiledInstructions = [];\n    for (let i = 0; i < instructionCount; i++) {\n      const programIdIndex = guardedShift(byteArray);\n      const accountKeyIndexesLength = decodeLength(byteArray);\n      const accountKeyIndexes = guardedSplice(byteArray, 0, accountKeyIndexesLength);\n      const dataLength = decodeLength(byteArray);\n      const data = new Uint8Array(guardedSplice(byteArray, 0, dataLength));\n      compiledInstructions.push({\n        programIdIndex,\n        accountKeyIndexes,\n        data\n      });\n    }\n    const addressTableLookupsCount = decodeLength(byteArray);\n    const addressTableLookups = [];\n    for (let i = 0; i < addressTableLookupsCount; i++) {\n      const accountKey = new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n      const writableIndexesLength = decodeLength(byteArray);\n      const writableIndexes = guardedSplice(byteArray, 0, writableIndexesLength);\n      const readonlyIndexesLength = decodeLength(byteArray);\n      const readonlyIndexes = guardedSplice(byteArray, 0, readonlyIndexesLength);\n      addressTableLookups.push({\n        accountKey,\n        writableIndexes,\n        readonlyIndexes\n      });\n    }\n    return new MessageV0({\n      header,\n      staticAccountKeys,\n      recentBlockhash,\n      compiledInstructions,\n      addressTableLookups\n    });\n  }\n}\n\n// eslint-disable-next-line no-redeclare\nconst VersionedMessage = {\n  deserializeMessageVersion(serializedMessage) {\n    const prefix = serializedMessage[0];\n    const maskedPrefix = prefix & VERSION_PREFIX_MASK;\n\n    // if the highest bit of the prefix is not set, the message is not versioned\n    if (maskedPrefix === prefix) {\n      return 'legacy';\n    }\n\n    // the lower 7 bits of the prefix indicate the message version\n    return maskedPrefix;\n  },\n  deserialize: serializedMessage => {\n    const version = VersionedMessage.deserializeMessageVersion(serializedMessage);\n    if (version === 'legacy') {\n      return Message.from(serializedMessage);\n    }\n    if (version === 0) {\n      return MessageV0.deserialize(serializedMessage);\n    } else {\n      throw new Error(`Transaction message version ${version} deserialization is not supported`);\n    }\n  }\n};\n\n/** @internal */\n\n/**\n * Transaction signature as base-58 encoded string\n */\n\nlet TransactionStatus = /*#__PURE__*/function (TransactionStatus) {\n  TransactionStatus[TransactionStatus[\"BLOCKHEIGHT_EXCEEDED\"] = 0] = \"BLOCKHEIGHT_EXCEEDED\";\n  TransactionStatus[TransactionStatus[\"PROCESSED\"] = 1] = \"PROCESSED\";\n  TransactionStatus[TransactionStatus[\"TIMED_OUT\"] = 2] = \"TIMED_OUT\";\n  TransactionStatus[TransactionStatus[\"NONCE_INVALID\"] = 3] = \"NONCE_INVALID\";\n  return TransactionStatus;\n}({});\n\n/**\n * Default (empty) signature\n */\nconst DEFAULT_SIGNATURE = Buffer.alloc(SIGNATURE_LENGTH_IN_BYTES).fill(0);\n\n/**\n * Account metadata used to define instructions\n */\n\n/**\n * List of TransactionInstruction object fields that may be initialized at construction\n */\n\n/**\n * Configuration object for Transaction.serialize()\n */\n\n/**\n * @internal\n */\n\n/**\n * Transaction Instruction class\n */\nclass TransactionInstruction {\n  constructor(opts) {\n    /**\n     * Public keys to include in this transaction\n     * Boolean represents whether this pubkey needs to sign the transaction\n     */\n    this.keys = void 0;\n    /**\n     * Program Id to execute\n     */\n    this.programId = void 0;\n    /**\n     * Program input\n     */\n    this.data = Buffer.alloc(0);\n    this.programId = opts.programId;\n    this.keys = opts.keys;\n    if (opts.data) {\n      this.data = opts.data;\n    }\n  }\n\n  /**\n   * @internal\n   */\n  toJSON() {\n    return {\n      keys: this.keys.map(({\n        pubkey,\n        isSigner,\n        isWritable\n      }) => ({\n        pubkey: pubkey.toJSON(),\n        isSigner,\n        isWritable\n      })),\n      programId: this.programId.toJSON(),\n      data: [...this.data]\n    };\n  }\n}\n\n/**\n * Pair of signature and corresponding public key\n */\n\n/**\n * List of Transaction object fields that may be initialized at construction\n */\n\n// For backward compatibility; an unfortunate consequence of being\n// forced to over-export types by the documentation generator.\n// See https://github.com/solana-labs/solana/pull/25820\n\n/**\n * Blockhash-based transactions have a lifetime that are defined by\n * the blockhash they include. Any transaction whose blockhash is\n * too old will be rejected.\n */\n\n/**\n * Use these options to construct a durable nonce transaction.\n */\n\n/**\n * Nonce information to be used to build an offline Transaction.\n */\n\n/**\n * @internal\n */\n\n/**\n * Transaction class\n */\nclass Transaction {\n  /**\n   * The first (payer) Transaction signature\n   *\n   * @returns {Buffer | null} Buffer of payer's signature\n   */\n  get signature() {\n    if (this.signatures.length > 0) {\n      return this.signatures[0].signature;\n    }\n    return null;\n  }\n\n  /**\n   * The transaction fee payer\n   */\n\n  // Construct a transaction with a blockhash and lastValidBlockHeight\n\n  // Construct a transaction using a durable nonce\n\n  /**\n   * @deprecated `TransactionCtorFields` has been deprecated and will be removed in a future version.\n   * Please supply a `TransactionBlockhashCtor` instead.\n   */\n\n  /**\n   * Construct an empty Transaction\n   */\n  constructor(opts) {\n    /**\n     * Signatures for the transaction.  Typically created by invoking the\n     * `sign()` method\n     */\n    this.signatures = [];\n    this.feePayer = void 0;\n    /**\n     * The instructions to atomically execute\n     */\n    this.instructions = [];\n    /**\n     * A recent transaction id. Must be populated by the caller\n     */\n    this.recentBlockhash = void 0;\n    /**\n     * the last block chain can advance to before tx is declared expired\n     * */\n    this.lastValidBlockHeight = void 0;\n    /**\n     * Optional Nonce information. If populated, transaction will use a durable\n     * Nonce hash instead of a recentBlockhash. Must be populated by the caller\n     */\n    this.nonceInfo = void 0;\n    /**\n     * If this is a nonce transaction this represents the minimum slot from which\n     * to evaluate if the nonce has advanced when attempting to confirm the\n     * transaction. This protects against a case where the transaction confirmation\n     * logic loads the nonce account from an old slot and assumes the mismatch in\n     * nonce value implies that the nonce has been advanced.\n     */\n    this.minNonceContextSlot = void 0;\n    /**\n     * @internal\n     */\n    this._message = void 0;\n    /**\n     * @internal\n     */\n    this._json = void 0;\n    if (!opts) {\n      return;\n    }\n    if (opts.feePayer) {\n      this.feePayer = opts.feePayer;\n    }\n    if (opts.signatures) {\n      this.signatures = opts.signatures;\n    }\n    if (Object.prototype.hasOwnProperty.call(opts, 'nonceInfo')) {\n      const {\n        minContextSlot,\n        nonceInfo\n      } = opts;\n      this.minNonceContextSlot = minContextSlot;\n      this.nonceInfo = nonceInfo;\n    } else if (Object.prototype.hasOwnProperty.call(opts, 'lastValidBlockHeight')) {\n      const {\n        blockhash,\n        lastValidBlockHeight\n      } = opts;\n      this.recentBlockhash = blockhash;\n      this.lastValidBlockHeight = lastValidBlockHeight;\n    } else {\n      const {\n        recentBlockhash,\n        nonceInfo\n      } = opts;\n      if (nonceInfo) {\n        this.nonceInfo = nonceInfo;\n      }\n      this.recentBlockhash = recentBlockhash;\n    }\n  }\n\n  /**\n   * @internal\n   */\n  toJSON() {\n    return {\n      recentBlockhash: this.recentBlockhash || null,\n      feePayer: this.feePayer ? this.feePayer.toJSON() : null,\n      nonceInfo: this.nonceInfo ? {\n        nonce: this.nonceInfo.nonce,\n        nonceInstruction: this.nonceInfo.nonceInstruction.toJSON()\n      } : null,\n      instructions: this.instructions.map(instruction => instruction.toJSON()),\n      signers: this.signatures.map(({\n        publicKey\n      }) => {\n        return publicKey.toJSON();\n      })\n    };\n  }\n\n  /**\n   * Add one or more instructions to this Transaction\n   *\n   * @param {Array< Transaction | TransactionInstruction | TransactionInstructionCtorFields >} items - Instructions to add to the Transaction\n   */\n  add(...items) {\n    if (items.length === 0) {\n      throw new Error('No instructions');\n    }\n    items.forEach(item => {\n      if ('instructions' in item) {\n        this.instructions = this.instructions.concat(item.instructions);\n      } else if ('data' in item && 'programId' in item && 'keys' in item) {\n        this.instructions.push(item);\n      } else {\n        this.instructions.push(new TransactionInstruction(item));\n      }\n    });\n    return this;\n  }\n\n  /**\n   * Compile transaction data\n   */\n  compileMessage() {\n    if (this._message && JSON.stringify(this.toJSON()) === JSON.stringify(this._json)) {\n      return this._message;\n    }\n    let recentBlockhash;\n    let instructions;\n    if (this.nonceInfo) {\n      recentBlockhash = this.nonceInfo.nonce;\n      if (this.instructions[0] != this.nonceInfo.nonceInstruction) {\n        instructions = [this.nonceInfo.nonceInstruction, ...this.instructions];\n      } else {\n        instructions = this.instructions;\n      }\n    } else {\n      recentBlockhash = this.recentBlockhash;\n      instructions = this.instructions;\n    }\n    if (!recentBlockhash) {\n      throw new Error('Transaction recentBlockhash required');\n    }\n    if (instructions.length < 1) {\n      console.warn('No instructions provided');\n    }\n    let feePayer;\n    if (this.feePayer) {\n      feePayer = this.feePayer;\n    } else if (this.signatures.length > 0 && this.signatures[0].publicKey) {\n      // Use implicit fee payer\n      feePayer = this.signatures[0].publicKey;\n    } else {\n      throw new Error('Transaction fee payer required');\n    }\n    for (let i = 0; i < instructions.length; i++) {\n      if (instructions[i].programId === undefined) {\n        throw new Error(`Transaction instruction index ${i} has undefined program id`);\n      }\n    }\n    const programIds = [];\n    const accountMetas = [];\n    instructions.forEach(instruction => {\n      instruction.keys.forEach(accountMeta => {\n        accountMetas.push({\n          ...accountMeta\n        });\n      });\n      const programId = instruction.programId.toString();\n      if (!programIds.includes(programId)) {\n        programIds.push(programId);\n      }\n    });\n\n    // Append programID account metas\n    programIds.forEach(programId => {\n      accountMetas.push({\n        pubkey: new PublicKey(programId),\n        isSigner: false,\n        isWritable: false\n      });\n    });\n\n    // Cull duplicate account metas\n    const uniqueMetas = [];\n    accountMetas.forEach(accountMeta => {\n      const pubkeyString = accountMeta.pubkey.toString();\n      const uniqueIndex = uniqueMetas.findIndex(x => {\n        return x.pubkey.toString() === pubkeyString;\n      });\n      if (uniqueIndex > -1) {\n        uniqueMetas[uniqueIndex].isWritable = uniqueMetas[uniqueIndex].isWritable || accountMeta.isWritable;\n        uniqueMetas[uniqueIndex].isSigner = uniqueMetas[uniqueIndex].isSigner || accountMeta.isSigner;\n      } else {\n        uniqueMetas.push(accountMeta);\n      }\n    });\n\n    // Sort. Prioritizing first by signer, then by writable\n    uniqueMetas.sort(function (x, y) {\n      if (x.isSigner !== y.isSigner) {\n        // Signers always come before non-signers\n        return x.isSigner ? -1 : 1;\n      }\n      if (x.isWritable !== y.isWritable) {\n        // Writable accounts always come before read-only accounts\n        return x.isWritable ? -1 : 1;\n      }\n      // Otherwise, sort by pubkey, stringwise.\n      const options = {\n        localeMatcher: 'best fit',\n        usage: 'sort',\n        sensitivity: 'variant',\n        ignorePunctuation: false,\n        numeric: false,\n        caseFirst: 'lower'\n      };\n      return x.pubkey.toBase58().localeCompare(y.pubkey.toBase58(), 'en', options);\n    });\n\n    // Move fee payer to the front\n    const feePayerIndex = uniqueMetas.findIndex(x => {\n      return x.pubkey.equals(feePayer);\n    });\n    if (feePayerIndex > -1) {\n      const [payerMeta] = uniqueMetas.splice(feePayerIndex, 1);\n      payerMeta.isSigner = true;\n      payerMeta.isWritable = true;\n      uniqueMetas.unshift(payerMeta);\n    } else {\n      uniqueMetas.unshift({\n        pubkey: feePayer,\n        isSigner: true,\n        isWritable: true\n      });\n    }\n\n    // Disallow unknown signers\n    for (const signature of this.signatures) {\n      const uniqueIndex = uniqueMetas.findIndex(x => {\n        return x.pubkey.equals(signature.publicKey);\n      });\n      if (uniqueIndex > -1) {\n        if (!uniqueMetas[uniqueIndex].isSigner) {\n          uniqueMetas[uniqueIndex].isSigner = true;\n          console.warn('Transaction references a signature that is unnecessary, ' + 'only the fee payer and instruction signer accounts should sign a transaction. ' + 'This behavior is deprecated and will throw an error in the next major version release.');\n        }\n      } else {\n        throw new Error(`unknown signer: ${signature.publicKey.toString()}`);\n      }\n    }\n    let numRequiredSignatures = 0;\n    let numReadonlySignedAccounts = 0;\n    let numReadonlyUnsignedAccounts = 0;\n\n    // Split out signing from non-signing keys and count header values\n    const signedKeys = [];\n    const unsignedKeys = [];\n    uniqueMetas.forEach(({\n      pubkey,\n      isSigner,\n      isWritable\n    }) => {\n      if (isSigner) {\n        signedKeys.push(pubkey.toString());\n        numRequiredSignatures += 1;\n        if (!isWritable) {\n          numReadonlySignedAccounts += 1;\n        }\n      } else {\n        unsignedKeys.push(pubkey.toString());\n        if (!isWritable) {\n          numReadonlyUnsignedAccounts += 1;\n        }\n      }\n    });\n    const accountKeys = signedKeys.concat(unsignedKeys);\n    const compiledInstructions = instructions.map(instruction => {\n      const {\n        data,\n        programId\n      } = instruction;\n      return {\n        programIdIndex: accountKeys.indexOf(programId.toString()),\n        accounts: instruction.keys.map(meta => accountKeys.indexOf(meta.pubkey.toString())),\n        data: bs58.encode(data)\n      };\n    });\n    compiledInstructions.forEach(instruction => {\n      assert(instruction.programIdIndex >= 0);\n      instruction.accounts.forEach(keyIndex => assert(keyIndex >= 0));\n    });\n    return new Message({\n      header: {\n        numRequiredSignatures,\n        numReadonlySignedAccounts,\n        numReadonlyUnsignedAccounts\n      },\n      accountKeys,\n      recentBlockhash,\n      instructions: compiledInstructions\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _compile() {\n    const message = this.compileMessage();\n    const signedKeys = message.accountKeys.slice(0, message.header.numRequiredSignatures);\n    if (this.signatures.length === signedKeys.length) {\n      const valid = this.signatures.every((pair, index) => {\n        return signedKeys[index].equals(pair.publicKey);\n      });\n      if (valid) return message;\n    }\n    this.signatures = signedKeys.map(publicKey => ({\n      signature: null,\n      publicKey\n    }));\n    return message;\n  }\n\n  /**\n   * Get a buffer of the Transaction data that need to be covered by signatures\n   */\n  serializeMessage() {\n    return this._compile().serialize();\n  }\n\n  /**\n   * Get the estimated fee associated with a transaction\n   *\n   * @param {Connection} connection Connection to RPC Endpoint.\n   *\n   * @returns {Promise<number | null>} The estimated fee for the transaction\n   */\n  async getEstimatedFee(connection) {\n    return (await connection.getFeeForMessage(this.compileMessage())).value;\n  }\n\n  /**\n   * Specify the public keys which will be used to sign the Transaction.\n   * The first signer will be used as the transaction fee payer account.\n   *\n   * Signatures can be added with either `partialSign` or `addSignature`\n   *\n   * @deprecated Deprecated since v0.84.0. Only the fee payer needs to be\n   * specified and it can be set in the Transaction constructor or with the\n   * `feePayer` property.\n   */\n  setSigners(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n    const seen = new Set();\n    this.signatures = signers.filter(publicKey => {\n      const key = publicKey.toString();\n      if (seen.has(key)) {\n        return false;\n      } else {\n        seen.add(key);\n        return true;\n      }\n    }).map(publicKey => ({\n      signature: null,\n      publicKey\n    }));\n  }\n\n  /**\n   * Sign the Transaction with the specified signers. Multiple signatures may\n   * be applied to a Transaction. The first signature is considered \"primary\"\n   * and is used identify and confirm transactions.\n   *\n   * If the Transaction `feePayer` is not set, the first signer will be used\n   * as the transaction fee payer account.\n   *\n   * Transaction fields should not be modified after the first call to `sign`,\n   * as doing so may invalidate the signature and cause the Transaction to be\n   * rejected.\n   *\n   * The Transaction must be assigned a valid `recentBlockhash` before invoking this method\n   *\n   * @param {Array<Signer>} signers Array of signers that will sign the transaction\n   */\n  sign(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n\n    // Dedupe signers\n    const seen = new Set();\n    const uniqueSigners = [];\n    for (const signer of signers) {\n      const key = signer.publicKey.toString();\n      if (seen.has(key)) {\n        continue;\n      } else {\n        seen.add(key);\n        uniqueSigners.push(signer);\n      }\n    }\n    this.signatures = uniqueSigners.map(signer => ({\n      signature: null,\n      publicKey: signer.publicKey\n    }));\n    const message = this._compile();\n    this._partialSign(message, ...uniqueSigners);\n  }\n\n  /**\n   * Partially sign a transaction with the specified accounts. All accounts must\n   * correspond to either the fee payer or a signer account in the transaction\n   * instructions.\n   *\n   * All the caveats from the `sign` method apply to `partialSign`\n   *\n   * @param {Array<Signer>} signers Array of signers that will sign the transaction\n   */\n  partialSign(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n\n    // Dedupe signers\n    const seen = new Set();\n    const uniqueSigners = [];\n    for (const signer of signers) {\n      const key = signer.publicKey.toString();\n      if (seen.has(key)) {\n        continue;\n      } else {\n        seen.add(key);\n        uniqueSigners.push(signer);\n      }\n    }\n    const message = this._compile();\n    this._partialSign(message, ...uniqueSigners);\n  }\n\n  /**\n   * @internal\n   */\n  _partialSign(message, ...signers) {\n    const signData = message.serialize();\n    signers.forEach(signer => {\n      const signature = sign(signData, signer.secretKey);\n      this._addSignature(signer.publicKey, toBuffer(signature));\n    });\n  }\n\n  /**\n   * Add an externally created signature to a transaction. The public key\n   * must correspond to either the fee payer or a signer account in the transaction\n   * instructions.\n   *\n   * @param {PublicKey} pubkey Public key that will be added to the transaction.\n   * @param {Buffer} signature An externally created signature to add to the transaction.\n   */\n  addSignature(pubkey, signature) {\n    this._compile(); // Ensure signatures array is populated\n    this._addSignature(pubkey, signature);\n  }\n\n  /**\n   * @internal\n   */\n  _addSignature(pubkey, signature) {\n    assert(signature.length === 64);\n    const index = this.signatures.findIndex(sigpair => pubkey.equals(sigpair.publicKey));\n    if (index < 0) {\n      throw new Error(`unknown signer: ${pubkey.toString()}`);\n    }\n    this.signatures[index].signature = Buffer.from(signature);\n  }\n\n  /**\n   * Verify signatures of a Transaction\n   * Optional parameter specifies if we're expecting a fully signed Transaction or a partially signed one.\n   * If no boolean is provided, we expect a fully signed Transaction by default.\n   *\n   * @param {boolean} [requireAllSignatures=true] Require a fully signed Transaction\n   */\n  verifySignatures(requireAllSignatures = true) {\n    const signatureErrors = this._getMessageSignednessErrors(this.serializeMessage(), requireAllSignatures);\n    return !signatureErrors;\n  }\n\n  /**\n   * @internal\n   */\n  _getMessageSignednessErrors(message, requireAllSignatures) {\n    const errors = {};\n    for (const {\n      signature,\n      publicKey\n    } of this.signatures) {\n      if (signature === null) {\n        if (requireAllSignatures) {\n          (errors.missing ||= []).push(publicKey);\n        }\n      } else {\n        if (!verify(signature, message, publicKey.toBytes())) {\n          (errors.invalid ||= []).push(publicKey);\n        }\n      }\n    }\n    return errors.invalid || errors.missing ? errors : undefined;\n  }\n\n  /**\n   * Serialize the Transaction in the wire format.\n   *\n   * @param {Buffer} [config] Config of transaction.\n   *\n   * @returns {Buffer} Signature of transaction in wire format.\n   */\n  serialize(config) {\n    const {\n      requireAllSignatures,\n      verifySignatures\n    } = Object.assign({\n      requireAllSignatures: true,\n      verifySignatures: true\n    }, config);\n    const signData = this.serializeMessage();\n    if (verifySignatures) {\n      const sigErrors = this._getMessageSignednessErrors(signData, requireAllSignatures);\n      if (sigErrors) {\n        let errorMessage = 'Signature verification failed.';\n        if (sigErrors.invalid) {\n          errorMessage += `\\nInvalid signature for public key${sigErrors.invalid.length === 1 ? '' : '(s)'} [\\`${sigErrors.invalid.map(p => p.toBase58()).join('`, `')}\\`].`;\n        }\n        if (sigErrors.missing) {\n          errorMessage += `\\nMissing signature for public key${sigErrors.missing.length === 1 ? '' : '(s)'} [\\`${sigErrors.missing.map(p => p.toBase58()).join('`, `')}\\`].`;\n        }\n        throw new Error(errorMessage);\n      }\n    }\n    return this._serialize(signData);\n  }\n\n  /**\n   * @internal\n   */\n  _serialize(signData) {\n    const {\n      signatures\n    } = this;\n    const signatureCount = [];\n    encodeLength(signatureCount, signatures.length);\n    const transactionLength = signatureCount.length + signatures.length * 64 + signData.length;\n    const wireTransaction = Buffer.alloc(transactionLength);\n    assert(signatures.length < 256);\n    Buffer.from(signatureCount).copy(wireTransaction, 0);\n    signatures.forEach(({\n      signature\n    }, index) => {\n      if (signature !== null) {\n        assert(signature.length === 64, `signature has invalid length`);\n        Buffer.from(signature).copy(wireTransaction, signatureCount.length + index * 64);\n      }\n    });\n    signData.copy(wireTransaction, signatureCount.length + signatures.length * 64);\n    assert(wireTransaction.length <= PACKET_DATA_SIZE, `Transaction too large: ${wireTransaction.length} > ${PACKET_DATA_SIZE}`);\n    return wireTransaction;\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get keys() {\n    assert(this.instructions.length === 1);\n    return this.instructions[0].keys.map(keyObj => keyObj.pubkey);\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get programId() {\n    assert(this.instructions.length === 1);\n    return this.instructions[0].programId;\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get data() {\n    assert(this.instructions.length === 1);\n    return this.instructions[0].data;\n  }\n\n  /**\n   * Parse a wire transaction into a Transaction object.\n   *\n   * @param {Buffer | Uint8Array | Array<number>} buffer Signature of wire Transaction\n   *\n   * @returns {Transaction} Transaction associated with the signature\n   */\n  static from(buffer) {\n    // Slice up wire data\n    let byteArray = [...buffer];\n    const signatureCount = decodeLength(byteArray);\n    let signatures = [];\n    for (let i = 0; i < signatureCount; i++) {\n      const signature = guardedSplice(byteArray, 0, SIGNATURE_LENGTH_IN_BYTES);\n      signatures.push(bs58.encode(Buffer.from(signature)));\n    }\n    return Transaction.populate(Message.from(byteArray), signatures);\n  }\n\n  /**\n   * Populate Transaction object from message and signatures\n   *\n   * @param {Message} message Message of transaction\n   * @param {Array<string>} signatures List of signatures to assign to the transaction\n   *\n   * @returns {Transaction} The populated Transaction\n   */\n  static populate(message, signatures = []) {\n    const transaction = new Transaction();\n    transaction.recentBlockhash = message.recentBlockhash;\n    if (message.header.numRequiredSignatures > 0) {\n      transaction.feePayer = message.accountKeys[0];\n    }\n    signatures.forEach((signature, index) => {\n      const sigPubkeyPair = {\n        signature: signature == bs58.encode(DEFAULT_SIGNATURE) ? null : bs58.decode(signature),\n        publicKey: message.accountKeys[index]\n      };\n      transaction.signatures.push(sigPubkeyPair);\n    });\n    message.instructions.forEach(instruction => {\n      const keys = instruction.accounts.map(account => {\n        const pubkey = message.accountKeys[account];\n        return {\n          pubkey,\n          isSigner: transaction.signatures.some(keyObj => keyObj.publicKey.toString() === pubkey.toString()) || message.isAccountSigner(account),\n          isWritable: message.isAccountWritable(account)\n        };\n      });\n      transaction.instructions.push(new TransactionInstruction({\n        keys,\n        programId: message.accountKeys[instruction.programIdIndex],\n        data: bs58.decode(instruction.data)\n      }));\n    });\n    transaction._message = message;\n    transaction._json = transaction.toJSON();\n    return transaction;\n  }\n}\n\nclass TransactionMessage {\n  constructor(args) {\n    this.payerKey = void 0;\n    this.instructions = void 0;\n    this.recentBlockhash = void 0;\n    this.payerKey = args.payerKey;\n    this.instructions = args.instructions;\n    this.recentBlockhash = args.recentBlockhash;\n  }\n  static decompile(message, args) {\n    const {\n      header,\n      compiledInstructions,\n      recentBlockhash\n    } = message;\n    const {\n      numRequiredSignatures,\n      numReadonlySignedAccounts,\n      numReadonlyUnsignedAccounts\n    } = header;\n    const numWritableSignedAccounts = numRequiredSignatures - numReadonlySignedAccounts;\n    assert(numWritableSignedAccounts > 0, 'Message header is invalid');\n    const numWritableUnsignedAccounts = message.staticAccountKeys.length - numRequiredSignatures - numReadonlyUnsignedAccounts;\n    assert(numWritableUnsignedAccounts >= 0, 'Message header is invalid');\n    const accountKeys = message.getAccountKeys(args);\n    const payerKey = accountKeys.get(0);\n    if (payerKey === undefined) {\n      throw new Error('Failed to decompile message because no account keys were found');\n    }\n    const instructions = [];\n    for (const compiledIx of compiledInstructions) {\n      const keys = [];\n      for (const keyIndex of compiledIx.accountKeyIndexes) {\n        const pubkey = accountKeys.get(keyIndex);\n        if (pubkey === undefined) {\n          throw new Error(`Failed to find key for account key index ${keyIndex}`);\n        }\n        const isSigner = keyIndex < numRequiredSignatures;\n        let isWritable;\n        if (isSigner) {\n          isWritable = keyIndex < numWritableSignedAccounts;\n        } else if (keyIndex < accountKeys.staticAccountKeys.length) {\n          isWritable = keyIndex - numRequiredSignatures < numWritableUnsignedAccounts;\n        } else {\n          isWritable = keyIndex - accountKeys.staticAccountKeys.length <\n          // accountKeysFromLookups cannot be undefined because we already found a pubkey for this index above\n          accountKeys.accountKeysFromLookups.writable.length;\n        }\n        keys.push({\n          pubkey,\n          isSigner: keyIndex < header.numRequiredSignatures,\n          isWritable\n        });\n      }\n      const programId = accountKeys.get(compiledIx.programIdIndex);\n      if (programId === undefined) {\n        throw new Error(`Failed to find program id for program id index ${compiledIx.programIdIndex}`);\n      }\n      instructions.push(new TransactionInstruction({\n        programId,\n        data: toBuffer(compiledIx.data),\n        keys\n      }));\n    }\n    return new TransactionMessage({\n      payerKey,\n      instructions,\n      recentBlockhash\n    });\n  }\n  compileToLegacyMessage() {\n    return Message.compile({\n      payerKey: this.payerKey,\n      recentBlockhash: this.recentBlockhash,\n      instructions: this.instructions\n    });\n  }\n  compileToV0Message(addressLookupTableAccounts) {\n    return MessageV0.compile({\n      payerKey: this.payerKey,\n      recentBlockhash: this.recentBlockhash,\n      instructions: this.instructions,\n      addressLookupTableAccounts\n    });\n  }\n}\n\n/**\n * Versioned transaction class\n */\nclass VersionedTransaction {\n  get version() {\n    return this.message.version;\n  }\n  constructor(message, signatures) {\n    this.signatures = void 0;\n    this.message = void 0;\n    if (signatures !== undefined) {\n      assert(signatures.length === message.header.numRequiredSignatures, 'Expected signatures length to be equal to the number of required signatures');\n      this.signatures = signatures;\n    } else {\n      const defaultSignatures = [];\n      for (let i = 0; i < message.header.numRequiredSignatures; i++) {\n        defaultSignatures.push(new Uint8Array(SIGNATURE_LENGTH_IN_BYTES));\n      }\n      this.signatures = defaultSignatures;\n    }\n    this.message = message;\n  }\n  serialize() {\n    const serializedMessage = this.message.serialize();\n    const encodedSignaturesLength = Array();\n    encodeLength(encodedSignaturesLength, this.signatures.length);\n    const transactionLayout = BufferLayout.struct([BufferLayout.blob(encodedSignaturesLength.length, 'encodedSignaturesLength'), BufferLayout.seq(signature(), this.signatures.length, 'signatures'), BufferLayout.blob(serializedMessage.length, 'serializedMessage')]);\n    const serializedTransaction = new Uint8Array(2048);\n    const serializedTransactionLength = transactionLayout.encode({\n      encodedSignaturesLength: new Uint8Array(encodedSignaturesLength),\n      signatures: this.signatures,\n      serializedMessage\n    }, serializedTransaction);\n    return serializedTransaction.slice(0, serializedTransactionLength);\n  }\n  static deserialize(serializedTransaction) {\n    let byteArray = [...serializedTransaction];\n    const signatures = [];\n    const signaturesLength = decodeLength(byteArray);\n    for (let i = 0; i < signaturesLength; i++) {\n      signatures.push(new Uint8Array(guardedSplice(byteArray, 0, SIGNATURE_LENGTH_IN_BYTES)));\n    }\n    const message = VersionedMessage.deserialize(new Uint8Array(byteArray));\n    return new VersionedTransaction(message, signatures);\n  }\n  sign(signers) {\n    const messageData = this.message.serialize();\n    const signerPubkeys = this.message.staticAccountKeys.slice(0, this.message.header.numRequiredSignatures);\n    for (const signer of signers) {\n      const signerIndex = signerPubkeys.findIndex(pubkey => pubkey.equals(signer.publicKey));\n      assert(signerIndex >= 0, `Cannot sign with non signer key ${signer.publicKey.toBase58()}`);\n      this.signatures[signerIndex] = sign(messageData, signer.secretKey);\n    }\n  }\n  addSignature(publicKey, signature) {\n    assert(signature.byteLength === 64, 'Signature must be 64 bytes long');\n    const signerPubkeys = this.message.staticAccountKeys.slice(0, this.message.header.numRequiredSignatures);\n    const signerIndex = signerPubkeys.findIndex(pubkey => pubkey.equals(publicKey));\n    assert(signerIndex >= 0, `Can not add signature; \\`${publicKey.toBase58()}\\` is not required to sign this transaction`);\n    this.signatures[signerIndex] = signature;\n  }\n}\n\n// TODO: These constants should be removed in favor of reading them out of a\n// Syscall account\n\n/**\n * @internal\n */\nconst NUM_TICKS_PER_SECOND = 160;\n\n/**\n * @internal\n */\nconst DEFAULT_TICKS_PER_SLOT = 64;\n\n/**\n * @internal\n */\nconst NUM_SLOTS_PER_SECOND = NUM_TICKS_PER_SECOND / DEFAULT_TICKS_PER_SLOT;\n\n/**\n * @internal\n */\nconst MS_PER_SLOT = 1000 / NUM_SLOTS_PER_SECOND;\n\nconst SYSVAR_CLOCK_PUBKEY = new PublicKey('SysvarC1ock11111111111111111111111111111111');\nconst SYSVAR_EPOCH_SCHEDULE_PUBKEY = new PublicKey('SysvarEpochSchedu1e111111111111111111111111');\nconst SYSVAR_INSTRUCTIONS_PUBKEY = new PublicKey('Sysvar1nstructions1111111111111111111111111');\nconst SYSVAR_RECENT_BLOCKHASHES_PUBKEY = new PublicKey('SysvarRecentB1ockHashes11111111111111111111');\nconst SYSVAR_RENT_PUBKEY = new PublicKey('SysvarRent111111111111111111111111111111111');\nconst SYSVAR_REWARDS_PUBKEY = new PublicKey('SysvarRewards111111111111111111111111111111');\nconst SYSVAR_SLOT_HASHES_PUBKEY = new PublicKey('SysvarS1otHashes111111111111111111111111111');\nconst SYSVAR_SLOT_HISTORY_PUBKEY = new PublicKey('SysvarS1otHistory11111111111111111111111111');\nconst SYSVAR_STAKE_HISTORY_PUBKEY = new PublicKey('SysvarStakeHistory1111111111111111111111111');\n\nclass SendTransactionError extends Error {\n  constructor({\n    action,\n    signature,\n    transactionMessage,\n    logs\n  }) {\n    const maybeLogsOutput = logs ? `Logs: \\n${JSON.stringify(logs.slice(-10), null, 2)}. ` : '';\n    const guideText = '\\nCatch the `SendTransactionError` and call `getLogs()` on it for full details.';\n    let message;\n    switch (action) {\n      case 'send':\n        message = `Transaction ${signature} resulted in an error. \\n` + `${transactionMessage}. ` + maybeLogsOutput + guideText;\n        break;\n      case 'simulate':\n        message = `Simulation failed. \\nMessage: ${transactionMessage}. \\n` + maybeLogsOutput + guideText;\n        break;\n      default:\n        {\n          message = `Unknown action '${(a => a)(action)}'`;\n        }\n    }\n    super(message);\n    this.signature = void 0;\n    this.transactionMessage = void 0;\n    this.transactionLogs = void 0;\n    this.signature = signature;\n    this.transactionMessage = transactionMessage;\n    this.transactionLogs = logs ? logs : undefined;\n  }\n  get transactionError() {\n    return {\n      message: this.transactionMessage,\n      logs: Array.isArray(this.transactionLogs) ? this.transactionLogs : undefined\n    };\n  }\n\n  /* @deprecated Use `await getLogs()` instead */\n  get logs() {\n    const cachedLogs = this.transactionLogs;\n    if (cachedLogs != null && typeof cachedLogs === 'object' && 'then' in cachedLogs) {\n      return undefined;\n    }\n    return cachedLogs;\n  }\n  async getLogs(connection) {\n    if (!Array.isArray(this.transactionLogs)) {\n      this.transactionLogs = new Promise((resolve, reject) => {\n        connection.getTransaction(this.signature).then(tx => {\n          if (tx && tx.meta && tx.meta.logMessages) {\n            const logs = tx.meta.logMessages;\n            this.transactionLogs = logs;\n            resolve(logs);\n          } else {\n            reject(new Error('Log messages not found'));\n          }\n        }).catch(reject);\n      });\n    }\n    return await this.transactionLogs;\n  }\n}\n\n// Keep in sync with client/src/rpc_custom_errors.rs\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaJSONRPCErrorCode = {\n  JSON_RPC_SERVER_ERROR_BLOCK_CLEANED_UP: -32001,\n  JSON_RPC_SERVER_ERROR_SEND_TRANSACTION_PREFLIGHT_FAILURE: -32002,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_VERIFICATION_FAILURE: -32003,\n  JSON_RPC_SERVER_ERROR_BLOCK_NOT_AVAILABLE: -32004,\n  JSON_RPC_SERVER_ERROR_NODE_UNHEALTHY: -32005,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_PRECOMPILE_VERIFICATION_FAILURE: -32006,\n  JSON_RPC_SERVER_ERROR_SLOT_SKIPPED: -32007,\n  JSON_RPC_SERVER_ERROR_NO_SNAPSHOT: -32008,\n  JSON_RPC_SERVER_ERROR_LONG_TERM_STORAGE_SLOT_SKIPPED: -32009,\n  JSON_RPC_SERVER_ERROR_KEY_EXCLUDED_FROM_SECONDARY_INDEX: -32010,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_HISTORY_NOT_AVAILABLE: -32011,\n  JSON_RPC_SCAN_ERROR: -32012,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_LEN_MISMATCH: -32013,\n  JSON_RPC_SERVER_ERROR_BLOCK_STATUS_NOT_AVAILABLE_YET: -32014,\n  JSON_RPC_SERVER_ERROR_UNSUPPORTED_TRANSACTION_VERSION: -32015,\n  JSON_RPC_SERVER_ERROR_MIN_CONTEXT_SLOT_NOT_REACHED: -32016\n};\nclass SolanaJSONRPCError extends Error {\n  constructor({\n    code,\n    message,\n    data\n  }, customMessage) {\n    super(customMessage != null ? `${customMessage}: ${message}` : message);\n    this.code = void 0;\n    this.data = void 0;\n    this.code = code;\n    this.data = data;\n    this.name = 'SolanaJSONRPCError';\n  }\n}\n\n/**\n * Sign, send and confirm a transaction.\n *\n * If `commitment` option is not specified, defaults to 'max' commitment.\n *\n * @param {Connection} connection\n * @param {Transaction} transaction\n * @param {Array<Signer>} signers\n * @param {ConfirmOptions} [options]\n * @returns {Promise<TransactionSignature>}\n */\nasync function sendAndConfirmTransaction(connection, transaction, signers, options) {\n  const sendOptions = options && {\n    skipPreflight: options.skipPreflight,\n    preflightCommitment: options.preflightCommitment || options.commitment,\n    maxRetries: options.maxRetries,\n    minContextSlot: options.minContextSlot\n  };\n  const signature = await connection.sendTransaction(transaction, signers, sendOptions);\n  let status;\n  if (transaction.recentBlockhash != null && transaction.lastValidBlockHeight != null) {\n    status = (await connection.confirmTransaction({\n      abortSignal: options?.abortSignal,\n      signature: signature,\n      blockhash: transaction.recentBlockhash,\n      lastValidBlockHeight: transaction.lastValidBlockHeight\n    }, options && options.commitment)).value;\n  } else if (transaction.minNonceContextSlot != null && transaction.nonceInfo != null) {\n    const {\n      nonceInstruction\n    } = transaction.nonceInfo;\n    const nonceAccountPubkey = nonceInstruction.keys[0].pubkey;\n    status = (await connection.confirmTransaction({\n      abortSignal: options?.abortSignal,\n      minContextSlot: transaction.minNonceContextSlot,\n      nonceAccountPubkey,\n      nonceValue: transaction.nonceInfo.nonce,\n      signature\n    }, options && options.commitment)).value;\n  } else {\n    if (options?.abortSignal != null) {\n      console.warn('sendAndConfirmTransaction(): A transaction with a deprecated confirmation strategy was ' + 'supplied along with an `abortSignal`. Only transactions having `lastValidBlockHeight` ' + 'or a combination of `nonceInfo` and `minNonceContextSlot` are abortable.');\n    }\n    status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n  }\n  if (status.err) {\n    if (signature != null) {\n      throw new SendTransactionError({\n        action: 'send',\n        signature: signature,\n        transactionMessage: `Status: (${JSON.stringify(status)})`\n      });\n    }\n    throw new Error(`Transaction ${signature} failed (${JSON.stringify(status)})`);\n  }\n  return signature;\n}\n\n// zzz\nfunction sleep(ms) {\n  return new Promise(resolve => setTimeout(resolve, ms));\n}\n\n/**\n * @internal\n */\n\n/**\n * Populate a buffer of instruction data using an InstructionType\n * @internal\n */\nfunction encodeData(type, fields) {\n  const allocLength = type.layout.span >= 0 ? type.layout.span : getAlloc(type, fields);\n  const data = Buffer.alloc(allocLength);\n  const layoutFields = Object.assign({\n    instruction: type.index\n  }, fields);\n  type.layout.encode(layoutFields, data);\n  return data;\n}\n\n/**\n * Decode instruction data buffer using an InstructionType\n * @internal\n */\nfunction decodeData$1(type, buffer) {\n  let data;\n  try {\n    data = type.layout.decode(buffer);\n  } catch (err) {\n    throw new Error('invalid instruction; ' + err);\n  }\n  if (data.instruction !== type.index) {\n    throw new Error(`invalid instruction; instruction index mismatch ${data.instruction} != ${type.index}`);\n  }\n  return data;\n}\n\n/**\n * https://github.com/solana-labs/solana/blob/90bedd7e067b5b8f3ddbb45da00a4e9cabb22c62/sdk/src/fee_calculator.rs#L7-L11\n *\n * @internal\n */\nconst FeeCalculatorLayout = BufferLayout.nu64('lamportsPerSignature');\n\n/**\n * Calculator for transaction fees.\n *\n * @deprecated Deprecated since Solana v1.8.0.\n */\n\n/**\n * See https://github.com/solana-labs/solana/blob/0ea2843ec9cdc517572b8e62c959f41b55cf4453/sdk/src/nonce_state.rs#L29-L32\n *\n * @internal\n */\nconst NonceAccountLayout = BufferLayout.struct([BufferLayout.u32('version'), BufferLayout.u32('state'), publicKey('authorizedPubkey'), publicKey('nonce'), BufferLayout.struct([FeeCalculatorLayout], 'feeCalculator')]);\nconst NONCE_ACCOUNT_LENGTH = NonceAccountLayout.span;\n\n/**\n * A durable nonce is a 32 byte value encoded as a base58 string.\n */\n\n/**\n * NonceAccount class\n */\nclass NonceAccount {\n  /**\n   * @internal\n   */\n  constructor(args) {\n    this.authorizedPubkey = void 0;\n    this.nonce = void 0;\n    this.feeCalculator = void 0;\n    this.authorizedPubkey = args.authorizedPubkey;\n    this.nonce = args.nonce;\n    this.feeCalculator = args.feeCalculator;\n  }\n\n  /**\n   * Deserialize NonceAccount from the account data.\n   *\n   * @param buffer account data\n   * @return NonceAccount\n   */\n  static fromAccountData(buffer) {\n    const nonceAccount = NonceAccountLayout.decode(toBuffer(buffer), 0);\n    return new NonceAccount({\n      authorizedPubkey: new PublicKey(nonceAccount.authorizedPubkey),\n      nonce: new PublicKey(nonceAccount.nonce).toString(),\n      feeCalculator: nonceAccount.feeCalculator\n    });\n  }\n}\n\nconst encodeDecode = layout => {\n  const decode = layout.decode.bind(layout);\n  const encode = layout.encode.bind(layout);\n  return {\n    decode,\n    encode\n  };\n};\nconst bigInt = length => property => {\n  const layout = blob(length, property);\n  const {\n    encode,\n    decode\n  } = encodeDecode(layout);\n  const bigIntLayout = layout;\n  bigIntLayout.decode = (buffer, offset) => {\n    const src = decode(buffer, offset);\n    return toBigIntLE(Buffer.from(src));\n  };\n  bigIntLayout.encode = (bigInt, buffer, offset) => {\n    const src = toBufferLE(bigInt, length);\n    return encode(src, buffer, offset);\n  };\n  return bigIntLayout;\n};\nconst u64 = bigInt(8);\n\n/**\n * Create account system transaction params\n */\n\n/**\n * Transfer system transaction params\n */\n\n/**\n * Assign system transaction params\n */\n\n/**\n * Create account with seed system transaction params\n */\n\n/**\n * Create nonce account system transaction params\n */\n\n/**\n * Create nonce account with seed system transaction params\n */\n\n/**\n * Initialize nonce account system instruction params\n */\n\n/**\n * Advance nonce account system instruction params\n */\n\n/**\n * Withdraw nonce account system transaction params\n */\n\n/**\n * Authorize nonce account system transaction params\n */\n\n/**\n * Allocate account system transaction params\n */\n\n/**\n * Allocate account with seed system transaction params\n */\n\n/**\n * Assign account with seed system transaction params\n */\n\n/**\n * Transfer with seed system transaction params\n */\n\n/** Decoded transfer system transaction instruction */\n\n/** Decoded transferWithSeed system transaction instruction */\n\n/**\n * System Instruction class\n */\nclass SystemInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a system instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = BufferLayout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(SYSTEM_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a SystemInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode a create account system instruction and retrieve the instruction params.\n   */\n  static decodeCreateAccount(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      lamports,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Create, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      newAccountPubkey: instruction.keys[1].pubkey,\n      lamports,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a transfer system instruction and retrieve the instruction params.\n   */\n  static decodeTransfer(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      lamports\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Transfer, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a transfer with seed system instruction and retrieve the instruction params.\n   */\n  static decodeTransferWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports,\n      seed,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.TransferWithSeed, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      basePubkey: instruction.keys[1].pubkey,\n      toPubkey: instruction.keys[2].pubkey,\n      lamports,\n      seed,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an allocate system instruction and retrieve the instruction params.\n   */\n  static decodeAllocate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      space\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Allocate, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      space\n    };\n  }\n\n  /**\n   * Decode an allocate with seed system instruction and retrieve the instruction params.\n   */\n  static decodeAllocateWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      base,\n      seed,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AllocateWithSeed, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an assign system instruction and retrieve the instruction params.\n   */\n  static decodeAssign(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Assign, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an assign with seed system instruction and retrieve the instruction params.\n   */\n  static decodeAssignWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      base,\n      seed,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AssignWithSeed, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a create account with seed system instruction and retrieve the instruction params.\n   */\n  static decodeCreateWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      base,\n      seed,\n      lamports,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.CreateWithSeed, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      newAccountPubkey: instruction.keys[1].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      lamports,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a nonce initialize system instruction and retrieve the instruction params.\n   */\n  static decodeNonceInitialize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      authorized\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.InitializeNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: new PublicKey(authorized)\n    };\n  }\n\n  /**\n   * Decode a nonce advance system instruction and retrieve the instruction params.\n   */\n  static decodeNonceAdvance(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AdvanceNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey\n    };\n  }\n\n  /**\n   * Decode a nonce withdraw system instruction and retrieve the instruction params.\n   */\n  static decodeNonceWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 5);\n    const {\n      lamports\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.WithdrawNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a nonce authorize system instruction and retrieve the instruction params.\n   */\n  static decodeNonceAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      authorized\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AuthorizeNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[1].pubkey,\n      newAuthorizedPubkey: new PublicKey(authorized)\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(SystemProgram.programId)) {\n      throw new Error('invalid instruction; programId is not SystemProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid SystemInstructionType's\n */\n\n/**\n * An enumeration of valid system InstructionType's\n * @internal\n */\nconst SYSTEM_INSTRUCTION_LAYOUTS = Object.freeze({\n  Create: {\n    index: 0,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('lamports'), BufferLayout.ns64('space'), publicKey('programId')])\n  },\n  Assign: {\n    index: 1,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('programId')])\n  },\n  Transfer: {\n    index: 2,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), u64('lamports')])\n  },\n  CreateWithSeed: {\n    index: 3,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('base'), rustString('seed'), BufferLayout.ns64('lamports'), BufferLayout.ns64('space'), publicKey('programId')])\n  },\n  AdvanceNonceAccount: {\n    index: 4,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  WithdrawNonceAccount: {\n    index: 5,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('lamports')])\n  },\n  InitializeNonceAccount: {\n    index: 6,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('authorized')])\n  },\n  AuthorizeNonceAccount: {\n    index: 7,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('authorized')])\n  },\n  Allocate: {\n    index: 8,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('space')])\n  },\n  AllocateWithSeed: {\n    index: 9,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('base'), rustString('seed'), BufferLayout.ns64('space'), publicKey('programId')])\n  },\n  AssignWithSeed: {\n    index: 10,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('base'), rustString('seed'), publicKey('programId')])\n  },\n  TransferWithSeed: {\n    index: 11,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), u64('lamports'), rustString('seed'), publicKey('programId')])\n  },\n  UpgradeNonceAccount: {\n    index: 12,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  }\n});\n\n/**\n * Factory class for transactions to interact with the System program\n */\nclass SystemProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the System program\n   */\n\n  /**\n   * Generate a transaction instruction that creates a new account\n   */\n  static createAccount(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.Create;\n    const data = encodeData(type, {\n      lamports: params.lamports,\n      space: params.space,\n      programId: toBuffer(params.programId.toBuffer())\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.fromPubkey,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: params.newAccountPubkey,\n        isSigner: true,\n        isWritable: true\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that transfers lamports from one account to another\n   */\n  static transfer(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.TransferWithSeed;\n      data = encodeData(type, {\n        lamports: BigInt(params.lamports),\n        seed: params.seed,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.fromPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Transfer;\n      data = encodeData(type, {\n        lamports: BigInt(params.lamports)\n      });\n      keys = [{\n        pubkey: params.fromPubkey,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that assigns an account to a program\n   */\n  static assign(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.AssignWithSeed;\n      data = encodeData(type, {\n        base: toBuffer(params.basePubkey.toBuffer()),\n        seed: params.seed,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Assign;\n      data = encodeData(type, {\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: true,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that creates a new account at\n   *   an address generated with `from`, a seed, and programId\n   */\n  static createAccountWithSeed(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.CreateWithSeed;\n    const data = encodeData(type, {\n      base: toBuffer(params.basePubkey.toBuffer()),\n      seed: params.seed,\n      lamports: params.lamports,\n      space: params.space,\n      programId: toBuffer(params.programId.toBuffer())\n    });\n    let keys = [{\n      pubkey: params.fromPubkey,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: params.newAccountPubkey,\n      isSigner: false,\n      isWritable: true\n    }];\n    if (params.basePubkey != params.fromPubkey) {\n      keys.push({\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction that creates a new Nonce account\n   */\n  static createNonceAccount(params) {\n    const transaction = new Transaction();\n    if ('basePubkey' in params && 'seed' in params) {\n      transaction.add(SystemProgram.createAccountWithSeed({\n        fromPubkey: params.fromPubkey,\n        newAccountPubkey: params.noncePubkey,\n        basePubkey: params.basePubkey,\n        seed: params.seed,\n        lamports: params.lamports,\n        space: NONCE_ACCOUNT_LENGTH,\n        programId: this.programId\n      }));\n    } else {\n      transaction.add(SystemProgram.createAccount({\n        fromPubkey: params.fromPubkey,\n        newAccountPubkey: params.noncePubkey,\n        lamports: params.lamports,\n        space: NONCE_ACCOUNT_LENGTH,\n        programId: this.programId\n      }));\n    }\n    const initParams = {\n      noncePubkey: params.noncePubkey,\n      authorizedPubkey: params.authorizedPubkey\n    };\n    transaction.add(this.nonceInitialize(initParams));\n    return transaction;\n  }\n\n  /**\n   * Generate an instruction to initialize a Nonce account\n   */\n  static nonceInitialize(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.InitializeNonceAccount;\n    const data = encodeData(type, {\n      authorized: toBuffer(params.authorizedPubkey.toBuffer())\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate an instruction to advance the nonce in a Nonce account\n   */\n  static nonceAdvance(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.AdvanceNonceAccount;\n    const data = encodeData(type);\n    const instructionData = {\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a transaction instruction that withdraws lamports from a Nonce account\n   */\n  static nonceWithdraw(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.WithdrawNonceAccount;\n    const data = encodeData(type, {\n      lamports: params.lamports\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that authorizes a new PublicKey as the authority\n   * on a Nonce account.\n   */\n  static nonceAuthorize(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.AuthorizeNonceAccount;\n    const data = encodeData(type, {\n      authorized: toBuffer(params.newAuthorizedPubkey.toBuffer())\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that allocates space in an account without funding\n   */\n  static allocate(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.AllocateWithSeed;\n      data = encodeData(type, {\n        base: toBuffer(params.basePubkey.toBuffer()),\n        seed: params.seed,\n        space: params.space,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Allocate;\n      data = encodeData(type, {\n        space: params.space\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: true,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n}\nSystemProgram.programId = new PublicKey('11111111111111111111111111111111');\n\n// Keep program chunks under PACKET_DATA_SIZE, leaving enough room for the\n// rest of the Transaction fields\n//\n// TODO: replace 300 with a proper constant for the size of the other\n// Transaction fields\nconst CHUNK_SIZE = PACKET_DATA_SIZE - 300;\n\n/**\n * Program loader interface\n */\nclass Loader {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Amount of program data placed in each load Transaction\n   */\n\n  /**\n   * Minimum number of signatures required to load a program not including\n   * retries\n   *\n   * Can be used to calculate transaction fees\n   */\n  static getMinNumSignatures(dataLength) {\n    return 2 * (\n    // Every transaction requires two signatures (payer + program)\n    Math.ceil(dataLength / Loader.chunkSize) + 1 +\n    // Add one for Create transaction\n    1) // Add one for Finalize transaction\n    ;\n  }\n\n  /**\n   * Loads a generic program\n   *\n   * @param connection The connection to use\n   * @param payer System account that pays to load the program\n   * @param program Account to load the program into\n   * @param programId Public key that identifies the loader\n   * @param data Program octets\n   * @return true if program was loaded successfully, false if program was already loaded\n   */\n  static async load(connection, payer, program, programId, data) {\n    {\n      const balanceNeeded = await connection.getMinimumBalanceForRentExemption(data.length);\n\n      // Fetch program account info to check if it has already been created\n      const programInfo = await connection.getAccountInfo(program.publicKey, 'confirmed');\n      let transaction = null;\n      if (programInfo !== null) {\n        if (programInfo.executable) {\n          console.error('Program load failed, account is already executable');\n          return false;\n        }\n        if (programInfo.data.length !== data.length) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.allocate({\n            accountPubkey: program.publicKey,\n            space: data.length\n          }));\n        }\n        if (!programInfo.owner.equals(programId)) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.assign({\n            accountPubkey: program.publicKey,\n            programId\n          }));\n        }\n        if (programInfo.lamports < balanceNeeded) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.transfer({\n            fromPubkey: payer.publicKey,\n            toPubkey: program.publicKey,\n            lamports: balanceNeeded - programInfo.lamports\n          }));\n        }\n      } else {\n        transaction = new Transaction().add(SystemProgram.createAccount({\n          fromPubkey: payer.publicKey,\n          newAccountPubkey: program.publicKey,\n          lamports: balanceNeeded > 0 ? balanceNeeded : 1,\n          space: data.length,\n          programId\n        }));\n      }\n\n      // If the account is already created correctly, skip this step\n      // and proceed directly to loading instructions\n      if (transaction !== null) {\n        await sendAndConfirmTransaction(connection, transaction, [payer, program], {\n          commitment: 'confirmed'\n        });\n      }\n    }\n    const dataLayout = BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.u32('offset'), BufferLayout.u32('bytesLength'), BufferLayout.u32('bytesLengthPadding'), BufferLayout.seq(BufferLayout.u8('byte'), BufferLayout.offset(BufferLayout.u32(), -8), 'bytes')]);\n    const chunkSize = Loader.chunkSize;\n    let offset = 0;\n    let array = data;\n    let transactions = [];\n    while (array.length > 0) {\n      const bytes = array.slice(0, chunkSize);\n      const data = Buffer.alloc(chunkSize + 16);\n      dataLayout.encode({\n        instruction: 0,\n        // Load instruction\n        offset,\n        bytes: bytes,\n        bytesLength: 0,\n        bytesLengthPadding: 0\n      }, data);\n      const transaction = new Transaction().add({\n        keys: [{\n          pubkey: program.publicKey,\n          isSigner: true,\n          isWritable: true\n        }],\n        programId,\n        data\n      });\n      transactions.push(sendAndConfirmTransaction(connection, transaction, [payer, program], {\n        commitment: 'confirmed'\n      }));\n\n      // Delay between sends in an attempt to reduce rate limit errors\n      if (connection._rpcEndpoint.includes('solana.com')) {\n        const REQUESTS_PER_SECOND = 4;\n        await sleep(1000 / REQUESTS_PER_SECOND);\n      }\n      offset += chunkSize;\n      array = array.slice(chunkSize);\n    }\n    await Promise.all(transactions);\n\n    // Finalize the account loaded with program data for execution\n    {\n      const dataLayout = BufferLayout.struct([BufferLayout.u32('instruction')]);\n      const data = Buffer.alloc(dataLayout.span);\n      dataLayout.encode({\n        instruction: 1 // Finalize instruction\n      }, data);\n      const transaction = new Transaction().add({\n        keys: [{\n          pubkey: program.publicKey,\n          isSigner: true,\n          isWritable: true\n        }, {\n          pubkey: SYSVAR_RENT_PUBKEY,\n          isSigner: false,\n          isWritable: false\n        }],\n        programId,\n        data\n      });\n      const deployCommitment = 'processed';\n      const finalizeSignature = await connection.sendTransaction(transaction, [payer, program], {\n        preflightCommitment: deployCommitment\n      });\n      const {\n        context,\n        value\n      } = await connection.confirmTransaction({\n        signature: finalizeSignature,\n        lastValidBlockHeight: transaction.lastValidBlockHeight,\n        blockhash: transaction.recentBlockhash\n      }, deployCommitment);\n      if (value.err) {\n        throw new Error(`Transaction ${finalizeSignature} failed (${JSON.stringify(value)})`);\n      }\n      // We prevent programs from being usable until the slot after their deployment.\n      // See https://github.com/solana-labs/solana/pull/29654\n      while (true // eslint-disable-line no-constant-condition\n      ) {\n        try {\n          const currentSlot = await connection.getSlot({\n            commitment: deployCommitment\n          });\n          if (currentSlot > context.slot) {\n            break;\n          }\n        } catch {\n          /* empty */\n        }\n        await new Promise(resolve => setTimeout(resolve, Math.round(MS_PER_SLOT / 2)));\n      }\n    }\n\n    // success\n    return true;\n  }\n}\nLoader.chunkSize = CHUNK_SIZE;\n\n/**\n * @deprecated Deprecated since Solana v1.17.20.\n */\nconst BPF_LOADER_PROGRAM_ID = new PublicKey('BPFLoader2111111111111111111111111111111111');\n\n/**\n * Factory class for transactions to interact with a program loader\n *\n * @deprecated Deprecated since Solana v1.17.20.\n */\nclass BpfLoader {\n  /**\n   * Minimum number of signatures required to load a program not including\n   * retries\n   *\n   * Can be used to calculate transaction fees\n   */\n  static getMinNumSignatures(dataLength) {\n    return Loader.getMinNumSignatures(dataLength);\n  }\n\n  /**\n   * Load a SBF program\n   *\n   * @param connection The connection to use\n   * @param payer Account that will pay program loading fees\n   * @param program Account to load the program into\n   * @param elf The entire ELF containing the SBF program\n   * @param loaderProgramId The program id of the BPF loader to use\n   * @return true if program was loaded successfully, false if program was already loaded\n   */\n  static load(connection, payer, program, elf, loaderProgramId) {\n    return Loader.load(connection, payer, program, loaderProgramId, elf);\n  }\n}\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\nvar objToString = Object.prototype.toString;\nvar objKeys = Object.keys || function(obj) {\n\t\tvar keys = [];\n\t\tfor (var name in obj) {\n\t\t\tkeys.push(name);\n\t\t}\n\t\treturn keys;\n\t};\n\nfunction stringify(val, isArrayProp) {\n\tvar i, max, str, keys, key, propVal, toStr;\n\tif (val === true) {\n\t\treturn \"true\";\n\t}\n\tif (val === false) {\n\t\treturn \"false\";\n\t}\n\tswitch (typeof val) {\n\t\tcase \"object\":\n\t\t\tif (val === null) {\n\t\t\t\treturn null;\n\t\t\t} else if (val.toJSON && typeof val.toJSON === \"function\") {\n\t\t\t\treturn stringify(val.toJSON(), isArrayProp);\n\t\t\t} else {\n\t\t\t\ttoStr = objToString.call(val);\n\t\t\t\tif (toStr === \"[object Array]\") {\n\t\t\t\t\tstr = '[';\n\t\t\t\t\tmax = val.length - 1;\n\t\t\t\t\tfor(i = 0; i < max; i++) {\n\t\t\t\t\t\tstr += stringify(val[i], true) + ',';\n\t\t\t\t\t}\n\t\t\t\t\tif (max > -1) {\n\t\t\t\t\t\tstr += stringify(val[i], true);\n\t\t\t\t\t}\n\t\t\t\t\treturn str + ']';\n\t\t\t\t} else if (toStr === \"[object Object]\") {\n\t\t\t\t\t// only object is left\n\t\t\t\t\tkeys = objKeys(val).sort();\n\t\t\t\t\tmax = keys.length;\n\t\t\t\t\tstr = \"\";\n\t\t\t\t\ti = 0;\n\t\t\t\t\twhile (i < max) {\n\t\t\t\t\t\tkey = keys[i];\n\t\t\t\t\t\tpropVal = stringify(val[key], false);\n\t\t\t\t\t\tif (propVal !== undefined) {\n\t\t\t\t\t\t\tif (str) {\n\t\t\t\t\t\t\t\tstr += ',';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstr += JSON.stringify(key) + ':' + propVal;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t\treturn '{' + str + '}';\n\t\t\t\t} else {\n\t\t\t\t\treturn JSON.stringify(val);\n\t\t\t\t}\n\t\t\t}\n\t\tcase \"function\":\n\t\tcase \"undefined\":\n\t\t\treturn isArrayProp ? null : undefined;\n\t\tcase \"string\":\n\t\t\treturn JSON.stringify(val);\n\t\tdefault:\n\t\t\treturn isFinite(val) ? val : null;\n\t}\n}\n\nvar fastStableStringify = function(val) {\n\tvar returnVal = stringify(val, false);\n\tif (returnVal !== undefined) {\n\t\treturn ''+ returnVal;\n\t}\n};\n\nvar fastStableStringify$1 = /*@__PURE__*/getDefaultExportFromCjs(fastStableStringify);\n\nconst MINIMUM_SLOT_PER_EPOCH = 32;\n\n// Returns the number of trailing zeros in the binary representation of self.\nfunction trailingZeros(n) {\n  let trailingZeros = 0;\n  while (n > 1) {\n    n /= 2;\n    trailingZeros++;\n  }\n  return trailingZeros;\n}\n\n// Returns the smallest power of two greater than or equal to n\nfunction nextPowerOfTwo(n) {\n  if (n === 0) return 1;\n  n--;\n  n |= n >> 1;\n  n |= n >> 2;\n  n |= n >> 4;\n  n |= n >> 8;\n  n |= n >> 16;\n  n |= n >> 32;\n  return n + 1;\n}\n\n/**\n * Epoch schedule\n * (see https://docs.solana.com/terminology#epoch)\n * Can be retrieved with the {@link Connection.getEpochSchedule} method\n */\nclass EpochSchedule {\n  constructor(slotsPerEpoch, leaderScheduleSlotOffset, warmup, firstNormalEpoch, firstNormalSlot) {\n    /** The maximum number of slots in each epoch */\n    this.slotsPerEpoch = void 0;\n    /** The number of slots before beginning of an epoch to calculate a leader schedule for that epoch */\n    this.leaderScheduleSlotOffset = void 0;\n    /** Indicates whether epochs start short and grow */\n    this.warmup = void 0;\n    /** The first epoch with `slotsPerEpoch` slots */\n    this.firstNormalEpoch = void 0;\n    /** The first slot of `firstNormalEpoch` */\n    this.firstNormalSlot = void 0;\n    this.slotsPerEpoch = slotsPerEpoch;\n    this.leaderScheduleSlotOffset = leaderScheduleSlotOffset;\n    this.warmup = warmup;\n    this.firstNormalEpoch = firstNormalEpoch;\n    this.firstNormalSlot = firstNormalSlot;\n  }\n  getEpoch(slot) {\n    return this.getEpochAndSlotIndex(slot)[0];\n  }\n  getEpochAndSlotIndex(slot) {\n    if (slot < this.firstNormalSlot) {\n      const epoch = trailingZeros(nextPowerOfTwo(slot + MINIMUM_SLOT_PER_EPOCH + 1)) - trailingZeros(MINIMUM_SLOT_PER_EPOCH) - 1;\n      const epochLen = this.getSlotsInEpoch(epoch);\n      const slotIndex = slot - (epochLen - MINIMUM_SLOT_PER_EPOCH);\n      return [epoch, slotIndex];\n    } else {\n      const normalSlotIndex = slot - this.firstNormalSlot;\n      const normalEpochIndex = Math.floor(normalSlotIndex / this.slotsPerEpoch);\n      const epoch = this.firstNormalEpoch + normalEpochIndex;\n      const slotIndex = normalSlotIndex % this.slotsPerEpoch;\n      return [epoch, slotIndex];\n    }\n  }\n  getFirstSlotInEpoch(epoch) {\n    if (epoch <= this.firstNormalEpoch) {\n      return (Math.pow(2, epoch) - 1) * MINIMUM_SLOT_PER_EPOCH;\n    } else {\n      return (epoch - this.firstNormalEpoch) * this.slotsPerEpoch + this.firstNormalSlot;\n    }\n  }\n  getLastSlotInEpoch(epoch) {\n    return this.getFirstSlotInEpoch(epoch) + this.getSlotsInEpoch(epoch) - 1;\n  }\n  getSlotsInEpoch(epoch) {\n    if (epoch < this.firstNormalEpoch) {\n      return Math.pow(2, epoch + trailingZeros(MINIMUM_SLOT_PER_EPOCH));\n    } else {\n      return this.slotsPerEpoch;\n    }\n  }\n}\n\nvar fetchImpl = globalThis.fetch;\n\nclass RpcWebSocketClient extends CommonClient {\n  constructor(address, options, generate_request_id) {\n    const webSocketFactory = url => {\n      const rpc = WebSocket(url, {\n        autoconnect: true,\n        max_reconnects: 5,\n        reconnect: true,\n        reconnect_interval: 1000,\n        ...options\n      });\n      if ('socket' in rpc) {\n        this.underlyingSocket = rpc.socket;\n      } else {\n        this.underlyingSocket = rpc;\n      }\n      return rpc;\n    };\n    super(webSocketFactory, address, options, generate_request_id);\n    this.underlyingSocket = void 0;\n  }\n  call(...args) {\n    const readyState = this.underlyingSocket?.readyState;\n    if (readyState === 1 /* WebSocket.OPEN */) {\n      return super.call(...args);\n    }\n    return Promise.reject(new Error('Tried to call a JSON-RPC method `' + args[0] + '` but the socket was not `CONNECTING` or `OPEN` (`readyState` was ' + readyState + ')'));\n  }\n  notify(...args) {\n    const readyState = this.underlyingSocket?.readyState;\n    if (readyState === 1 /* WebSocket.OPEN */) {\n      return super.notify(...args);\n    }\n    return Promise.reject(new Error('Tried to send a JSON-RPC notification `' + args[0] + '` but the socket was not `CONNECTING` or `OPEN` (`readyState` was ' + readyState + ')'));\n  }\n}\n\n/**\n * @internal\n */\n\n/**\n * Decode account data buffer using an AccountType\n * @internal\n */\nfunction decodeData(type, data) {\n  let decoded;\n  try {\n    decoded = type.layout.decode(data);\n  } catch (err) {\n    throw new Error('invalid instruction; ' + err);\n  }\n  if (decoded.typeIndex !== type.index) {\n    throw new Error(`invalid account data; account type mismatch ${decoded.typeIndex} != ${type.index}`);\n  }\n  return decoded;\n}\n\n/// The serialized size of lookup table metadata\nconst LOOKUP_TABLE_META_SIZE = 56;\nclass AddressLookupTableAccount {\n  constructor(args) {\n    this.key = void 0;\n    this.state = void 0;\n    this.key = args.key;\n    this.state = args.state;\n  }\n  isActive() {\n    const U64_MAX = BigInt('0xffffffffffffffff');\n    return this.state.deactivationSlot === U64_MAX;\n  }\n  static deserialize(accountData) {\n    const meta = decodeData(LookupTableMetaLayout, accountData);\n    const serializedAddressesLen = accountData.length - LOOKUP_TABLE_META_SIZE;\n    assert(serializedAddressesLen >= 0, 'lookup table is invalid');\n    assert(serializedAddressesLen % 32 === 0, 'lookup table is invalid');\n    const numSerializedAddresses = serializedAddressesLen / 32;\n    const {\n      addresses\n    } = BufferLayout.struct([BufferLayout.seq(publicKey(), numSerializedAddresses, 'addresses')]).decode(accountData.slice(LOOKUP_TABLE_META_SIZE));\n    return {\n      deactivationSlot: meta.deactivationSlot,\n      lastExtendedSlot: meta.lastExtendedSlot,\n      lastExtendedSlotStartIndex: meta.lastExtendedStartIndex,\n      authority: meta.authority.length !== 0 ? new PublicKey(meta.authority[0]) : undefined,\n      addresses: addresses.map(address => new PublicKey(address))\n    };\n  }\n}\nconst LookupTableMetaLayout = {\n  index: 1,\n  layout: BufferLayout.struct([BufferLayout.u32('typeIndex'), u64('deactivationSlot'), BufferLayout.nu64('lastExtendedSlot'), BufferLayout.u8('lastExtendedStartIndex'), BufferLayout.u8(),\n  // option\n  BufferLayout.seq(publicKey(), BufferLayout.offset(BufferLayout.u8(), -1), 'authority')])\n};\n\nconst URL_RE = /^[^:]+:\\/\\/([^:[]+|\\[[^\\]]+\\])(:\\d+)?(.*)/i;\nfunction makeWebsocketUrl(endpoint) {\n  const matches = endpoint.match(URL_RE);\n  if (matches == null) {\n    throw TypeError(`Failed to validate endpoint URL \\`${endpoint}\\``);\n  }\n  const [_,\n  // eslint-disable-line @typescript-eslint/no-unused-vars\n  hostish, portWithColon, rest] = matches;\n  const protocol = endpoint.startsWith('https:') ? 'wss:' : 'ws:';\n  const startPort = portWithColon == null ? null : parseInt(portWithColon.slice(1), 10);\n  const websocketPort =\n  // Only shift the port by +1 as a convention for ws(s) only if given endpoint\n  // is explicitly specifying the endpoint port (HTTP-based RPC), assuming\n  // we're directly trying to connect to agave-validator's ws listening port.\n  // When the endpoint omits the port, we're connecting to the protocol\n  // default ports: http(80) or https(443) and it's assumed we're behind a reverse\n  // proxy which manages WebSocket upgrade and backend port redirection.\n  startPort == null ? '' : `:${startPort + 1}`;\n  return `${protocol}//${hostish}${websocketPort}${rest}`;\n}\n\nconst PublicKeyFromString = coerce(instance(PublicKey), string(), value => new PublicKey(value));\nconst RawAccountDataResult = tuple([string(), literal('base64')]);\nconst BufferFromRawAccountData = coerce(instance(Buffer), RawAccountDataResult, value => Buffer.from(value[0], 'base64'));\n\n/**\n * Attempt to use a recent blockhash for up to 30 seconds\n * @internal\n */\nconst BLOCKHASH_CACHE_TIMEOUT_MS = 30 * 1000;\n\n/**\n * HACK.\n * Copied from rpc-websockets/dist/lib/client.\n * Otherwise, `yarn build` fails with:\n * https://gist.github.com/steveluscher/c057eca81d479ef705cdb53162f9971d\n */\n\n/** @internal */\n/** @internal */\n/** @internal */\n/** @internal */\n\n/** @internal */\n/**\n * @internal\n * Every subscription contains the args used to open the subscription with\n * the server, and a list of callers interested in notifications.\n */\n\n/**\n * @internal\n * A subscription may be in various states of connectedness. Only when it is\n * fully connected will it have a server subscription id associated with it.\n * This id can be returned to the server to unsubscribe the client entirely.\n */\n\n/**\n * A type that encapsulates a subscription's RPC method\n * names and notification (callback) signature.\n */\n\n/**\n * @internal\n * Utility type that keeps tagged unions intact while omitting properties.\n */\n\n/**\n * @internal\n * This type represents a single subscribable 'topic.' It's made up of:\n *\n * - The args used to open the subscription with the server,\n * - The state of the subscription, in terms of its connectedness, and\n * - The set of callbacks to call when the server publishes notifications\n *\n * This record gets indexed by `SubscriptionConfigHash` and is used to\n * set up subscriptions, fan out notifications, and track subscription state.\n */\n\n/**\n * @internal\n */\n\n/**\n * Extra contextual information for RPC responses\n */\n\n/**\n * Options for sending transactions\n */\n\n/**\n * Options for confirming transactions\n */\n\n/**\n * Options for getConfirmedSignaturesForAddress2\n */\n\n/**\n * Options for getSignaturesForAddress\n */\n\n/**\n * RPC Response with extra contextual information\n */\n\n/**\n * A strategy for confirming transactions that uses the last valid\n * block height for a given blockhash to check for transaction expiration.\n */\n\n/**\n * A strategy for confirming durable nonce transactions.\n */\n\n/**\n * Properties shared by all transaction confirmation strategies\n */\n\n/**\n * This type represents all transaction confirmation strategies\n */\n\n/* @internal */\nfunction assertEndpointUrl(putativeUrl) {\n  if (/^https?:/.test(putativeUrl) === false) {\n    throw new TypeError('Endpoint URL must start with `http:` or `https:`.');\n  }\n  return putativeUrl;\n}\n\n/** @internal */\nfunction extractCommitmentFromConfig(commitmentOrConfig) {\n  let commitment;\n  let config;\n  if (typeof commitmentOrConfig === 'string') {\n    commitment = commitmentOrConfig;\n  } else if (commitmentOrConfig) {\n    const {\n      commitment: specifiedCommitment,\n      ...specifiedConfig\n    } = commitmentOrConfig;\n    commitment = specifiedCommitment;\n    config = specifiedConfig;\n  }\n  return {\n    commitment,\n    config\n  };\n}\n\n/**\n * @internal\n */\nfunction createRpcResult(result) {\n  return union([type({\n    jsonrpc: literal('2.0'),\n    id: string(),\n    result\n  }), type({\n    jsonrpc: literal('2.0'),\n    id: string(),\n    error: type({\n      code: unknown(),\n      message: string(),\n      data: optional(any())\n    })\n  })]);\n}\nconst UnknownRpcResult = createRpcResult(unknown());\n\n/**\n * @internal\n */\nfunction jsonRpcResult(schema) {\n  return coerce(createRpcResult(schema), UnknownRpcResult, value => {\n    if ('error' in value) {\n      return value;\n    } else {\n      return {\n        ...value,\n        result: create(value.result, schema)\n      };\n    }\n  });\n}\n\n/**\n * @internal\n */\nfunction jsonRpcResultAndContext(value) {\n  return jsonRpcResult(type({\n    context: type({\n      slot: number()\n    }),\n    value\n  }));\n}\n\n/**\n * @internal\n */\nfunction notificationResultAndContext(value) {\n  return type({\n    context: type({\n      slot: number()\n    }),\n    value\n  });\n}\n\n/**\n * @internal\n */\nfunction versionedMessageFromResponse(version, response) {\n  if (version === 0) {\n    return new MessageV0({\n      header: response.header,\n      staticAccountKeys: response.accountKeys.map(accountKey => new PublicKey(accountKey)),\n      recentBlockhash: response.recentBlockhash,\n      compiledInstructions: response.instructions.map(ix => ({\n        programIdIndex: ix.programIdIndex,\n        accountKeyIndexes: ix.accounts,\n        data: bs58.decode(ix.data)\n      })),\n      addressTableLookups: response.addressTableLookups\n    });\n  } else {\n    return new Message(response);\n  }\n}\n\n/**\n * The level of commitment desired when querying state\n * <pre>\n *   'processed': Query the most recent block which has reached 1 confirmation by the connected node\n *   'confirmed': Query the most recent block which has reached 1 confirmation by the cluster\n *   'finalized': Query the most recent block which has been finalized by the cluster\n * </pre>\n */\n\n// Deprecated as of v1.5.5\n\n/**\n * A subset of Commitment levels, which are at least optimistically confirmed\n * <pre>\n *   'confirmed': Query the most recent block which has reached 1 confirmation by the cluster\n *   'finalized': Query the most recent block which has been finalized by the cluster\n * </pre>\n */\n\n/**\n * Filter for largest accounts query\n * <pre>\n *   'circulating':    Return the largest accounts that are part of the circulating supply\n *   'nonCirculating': Return the largest accounts that are not part of the circulating supply\n * </pre>\n */\n\n/**\n * Configuration object for changing `getAccountInfo` query behavior\n */\n\n/**\n * Configuration object for changing `getBalance` query behavior\n */\n\n/**\n * Configuration object for changing `getBlock` query behavior\n */\n\n/**\n * Configuration object for changing `getBlock` query behavior\n */\n\n/**\n * Configuration object for changing `getStakeMinimumDelegation` query behavior\n */\n\n/**\n * Configuration object for changing `getBlockHeight` query behavior\n */\n\n/**\n * Configuration object for changing `getEpochInfo` query behavior\n */\n\n/**\n * Configuration object for changing `getInflationReward` query behavior\n */\n\n/**\n * Configuration object for changing `getLatestBlockhash` query behavior\n */\n\n/**\n * Configuration object for changing `isBlockhashValid` query behavior\n */\n\n/**\n * Configuration object for changing `getSlot` query behavior\n */\n\n/**\n * Configuration object for changing `getSlotLeader` query behavior\n */\n\n/**\n * Configuration object for changing `getTransaction` query behavior\n */\n\n/**\n * Configuration object for changing `getTransaction` query behavior\n */\n\n/**\n * Configuration object for changing `getLargestAccounts` query behavior\n */\n\n/**\n * Configuration object for changing `getSupply` request behavior\n */\n\n/**\n * Configuration object for changing query behavior\n */\n\n/**\n * Information describing a cluster node\n */\n\n/**\n * Information describing a vote account\n */\n\n/**\n * A collection of cluster vote accounts\n */\n\n/**\n * Network Inflation\n * (see https://docs.solana.com/implemented-proposals/ed_overview)\n */\n\nconst GetInflationGovernorResult = type({\n  foundation: number(),\n  foundationTerm: number(),\n  initial: number(),\n  taper: number(),\n  terminal: number()\n});\n\n/**\n * The inflation reward for an epoch\n */\n\n/**\n * Expected JSON RPC response for the \"getInflationReward\" message\n */\nconst GetInflationRewardResult = jsonRpcResult(array(nullable(type({\n  epoch: number(),\n  effectiveSlot: number(),\n  amount: number(),\n  postBalance: number(),\n  commission: optional(nullable(number()))\n}))));\n\n/**\n * Configuration object for changing `getRecentPrioritizationFees` query behavior\n */\n\n/**\n * Expected JSON RPC response for the \"getRecentPrioritizationFees\" message\n */\nconst GetRecentPrioritizationFeesResult = array(type({\n  slot: number(),\n  prioritizationFee: number()\n}));\n/**\n * Expected JSON RPC response for the \"getInflationRate\" message\n */\nconst GetInflationRateResult = type({\n  total: number(),\n  validator: number(),\n  foundation: number(),\n  epoch: number()\n});\n\n/**\n * Information about the current epoch\n */\n\nconst GetEpochInfoResult = type({\n  epoch: number(),\n  slotIndex: number(),\n  slotsInEpoch: number(),\n  absoluteSlot: number(),\n  blockHeight: optional(number()),\n  transactionCount: optional(number())\n});\nconst GetEpochScheduleResult = type({\n  slotsPerEpoch: number(),\n  leaderScheduleSlotOffset: number(),\n  warmup: boolean(),\n  firstNormalEpoch: number(),\n  firstNormalSlot: number()\n});\n\n/**\n * Leader schedule\n * (see https://docs.solana.com/terminology#leader-schedule)\n */\n\nconst GetLeaderScheduleResult = record(string(), array(number()));\n\n/**\n * Transaction error or null\n */\nconst TransactionErrorResult = nullable(union([type({}), string()]));\n\n/**\n * Signature status for a transaction\n */\nconst SignatureStatusResult = type({\n  err: TransactionErrorResult\n});\n\n/**\n * Transaction signature received notification\n */\nconst SignatureReceivedResult = literal('receivedSignature');\n\n/**\n * Version info for a node\n */\n\nconst VersionResult = type({\n  'solana-core': string(),\n  'feature-set': optional(number())\n});\nconst ParsedInstructionStruct = type({\n  program: string(),\n  programId: PublicKeyFromString,\n  parsed: unknown()\n});\nconst PartiallyDecodedInstructionStruct = type({\n  programId: PublicKeyFromString,\n  accounts: array(PublicKeyFromString),\n  data: string()\n});\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n  err: nullable(union([type({}), string()])),\n  logs: nullable(array(string())),\n  accounts: optional(nullable(array(nullable(type({\n    executable: boolean(),\n    owner: string(),\n    lamports: number(),\n    data: array(string()),\n    rentEpoch: optional(number())\n  }))))),\n  unitsConsumed: optional(number()),\n  returnData: optional(nullable(type({\n    programId: string(),\n    data: tuple([string(), literal('base64')])\n  }))),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(union([ParsedInstructionStruct, PartiallyDecodedInstructionStruct]))\n  }))))\n}));\n\n/**\n * Metadata for a parsed confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link ParsedTransactionMeta} instead.\n */\n\n/**\n * Collection of addresses loaded by a transaction using address table lookups\n */\n\n/**\n * Metadata for a parsed transaction on the ledger\n */\n\n/**\n * Metadata for a confirmed transaction on the ledger\n */\n\n/**\n * A processed transaction from the RPC API\n */\n\n/**\n * A processed transaction from the RPC API\n */\n\n/**\n * A processed transaction message from the RPC API\n */\n\n/**\n * A confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0.\n */\n\n/**\n * A partially decoded transaction instruction\n */\n\n/**\n * A parsed transaction message account\n */\n\n/**\n * A parsed transaction instruction\n */\n\n/**\n * A parsed address table lookup\n */\n\n/**\n * A parsed transaction message\n */\n\n/**\n * A parsed transaction\n */\n\n/**\n * A parsed and confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link ParsedTransactionWithMeta} instead.\n */\n\n/**\n * A parsed transaction on the ledger with meta\n */\n\n/**\n * A processed block fetched from the RPC API\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `none`\n */\n\n/**\n * A block with parsed transactions\n */\n\n/**\n * A block with parsed transactions where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A block with parsed transactions where the `transactionDetails` mode is `none`\n */\n\n/**\n * A processed block fetched from the RPC API\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `none`\n */\n\n/**\n * A confirmed block on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0.\n */\n\n/**\n * A Block on the ledger with signatures only\n */\n\n/**\n * recent block production information\n */\n\n/**\n * Expected JSON RPC response for the \"getBlockProduction\" message\n */\nconst BlockProductionResponseStruct = jsonRpcResultAndContext(type({\n  byIdentity: record(string(), array(number())),\n  range: type({\n    firstSlot: number(),\n    lastSlot: number()\n  })\n}));\n\n/**\n * A performance sample\n */\n\nfunction createRpcClient(url, httpHeaders, customFetch, fetchMiddleware, disableRetryOnRateLimit, httpAgent) {\n  const fetch = customFetch ? customFetch : fetchImpl;\n  let agent;\n  {\n    if (httpAgent != null) {\n      console.warn('You have supplied an `httpAgent` when creating a `Connection` in a browser environment.' + 'It has been ignored; `httpAgent` is only used in Node environments.');\n    }\n  }\n  let fetchWithMiddleware;\n  if (fetchMiddleware) {\n    fetchWithMiddleware = async (info, init) => {\n      const modifiedFetchArgs = await new Promise((resolve, reject) => {\n        try {\n          fetchMiddleware(info, init, (modifiedInfo, modifiedInit) => resolve([modifiedInfo, modifiedInit]));\n        } catch (error) {\n          reject(error);\n        }\n      });\n      return await fetch(...modifiedFetchArgs);\n    };\n  }\n  const clientBrowser = new RpcClient(async (request, callback) => {\n    const options = {\n      method: 'POST',\n      body: request,\n      agent,\n      headers: Object.assign({\n        'Content-Type': 'application/json'\n      }, httpHeaders || {}, COMMON_HTTP_HEADERS)\n    };\n    try {\n      let too_many_requests_retries = 5;\n      let res;\n      let waitTime = 500;\n      for (;;) {\n        if (fetchWithMiddleware) {\n          res = await fetchWithMiddleware(url, options);\n        } else {\n          res = await fetch(url, options);\n        }\n        if (res.status !== 429 /* Too many requests */) {\n          break;\n        }\n        if (disableRetryOnRateLimit === true) {\n          break;\n        }\n        too_many_requests_retries -= 1;\n        if (too_many_requests_retries === 0) {\n          break;\n        }\n        console.error(`Server responded with ${res.status} ${res.statusText}.  Retrying after ${waitTime}ms delay...`);\n        await sleep(waitTime);\n        waitTime *= 2;\n      }\n      const text = await res.text();\n      if (res.ok) {\n        callback(null, text);\n      } else {\n        callback(new Error(`${res.status} ${res.statusText}: ${text}`));\n      }\n    } catch (err) {\n      if (err instanceof Error) callback(err);\n    }\n  }, {});\n  return clientBrowser;\n}\nfunction createRpcRequest(client) {\n  return (method, args) => {\n    return new Promise((resolve, reject) => {\n      client.request(method, args, (err, response) => {\n        if (err) {\n          reject(err);\n          return;\n        }\n        resolve(response);\n      });\n    });\n  };\n}\nfunction createRpcBatchRequest(client) {\n  return requests => {\n    return new Promise((resolve, reject) => {\n      // Do nothing if requests is empty\n      if (requests.length === 0) resolve([]);\n      const batch = requests.map(params => {\n        return client.request(params.methodName, params.args);\n      });\n      client.request(batch, (err, response) => {\n        if (err) {\n          reject(err);\n          return;\n        }\n        resolve(response);\n      });\n    });\n  };\n}\n\n/**\n * Expected JSON RPC response for the \"getInflationGovernor\" message\n */\nconst GetInflationGovernorRpcResult = jsonRpcResult(GetInflationGovernorResult);\n\n/**\n * Expected JSON RPC response for the \"getInflationRate\" message\n */\nconst GetInflationRateRpcResult = jsonRpcResult(GetInflationRateResult);\n\n/**\n * Expected JSON RPC response for the \"getRecentPrioritizationFees\" message\n */\nconst GetRecentPrioritizationFeesRpcResult = jsonRpcResult(GetRecentPrioritizationFeesResult);\n\n/**\n * Expected JSON RPC response for the \"getEpochInfo\" message\n */\nconst GetEpochInfoRpcResult = jsonRpcResult(GetEpochInfoResult);\n\n/**\n * Expected JSON RPC response for the \"getEpochSchedule\" message\n */\nconst GetEpochScheduleRpcResult = jsonRpcResult(GetEpochScheduleResult);\n\n/**\n * Expected JSON RPC response for the \"getLeaderSchedule\" message\n */\nconst GetLeaderScheduleRpcResult = jsonRpcResult(GetLeaderScheduleResult);\n\n/**\n * Expected JSON RPC response for the \"minimumLedgerSlot\" and \"getFirstAvailableBlock\" messages\n */\nconst SlotRpcResult = jsonRpcResult(number());\n\n/**\n * Supply\n */\n\n/**\n * Expected JSON RPC response for the \"getSupply\" message\n */\nconst GetSupplyRpcResult = jsonRpcResultAndContext(type({\n  total: number(),\n  circulating: number(),\n  nonCirculating: number(),\n  nonCirculatingAccounts: array(PublicKeyFromString)\n}));\n\n/**\n * Token amount object which returns a token amount in different formats\n * for various client use cases.\n */\n\n/**\n * Expected JSON RPC structure for token amounts\n */\nconst TokenAmountResult = type({\n  amount: string(),\n  uiAmount: nullable(number()),\n  decimals: number(),\n  uiAmountString: optional(string())\n});\n\n/**\n * Token address and balance.\n */\n\n/**\n * Expected JSON RPC response for the \"getTokenLargestAccounts\" message\n */\nconst GetTokenLargestAccountsResult = jsonRpcResultAndContext(array(type({\n  address: PublicKeyFromString,\n  amount: string(),\n  uiAmount: nullable(number()),\n  decimals: number(),\n  uiAmountString: optional(string())\n})));\n\n/**\n * Expected JSON RPC response for the \"getTokenAccountsByOwner\" message\n */\nconst GetTokenAccountsByOwner = jsonRpcResultAndContext(array(type({\n  pubkey: PublicKeyFromString,\n  account: type({\n    executable: boolean(),\n    owner: PublicKeyFromString,\n    lamports: number(),\n    data: BufferFromRawAccountData,\n    rentEpoch: number()\n  })\n})));\nconst ParsedAccountDataResult = type({\n  program: string(),\n  parsed: unknown(),\n  space: number()\n});\n\n/**\n * Expected JSON RPC response for the \"getTokenAccountsByOwner\" message with parsed data\n */\nconst GetParsedTokenAccountsByOwner = jsonRpcResultAndContext(array(type({\n  pubkey: PublicKeyFromString,\n  account: type({\n    executable: boolean(),\n    owner: PublicKeyFromString,\n    lamports: number(),\n    data: ParsedAccountDataResult,\n    rentEpoch: number()\n  })\n})));\n\n/**\n * Pair of an account address and its balance\n */\n\n/**\n * Expected JSON RPC response for the \"getLargestAccounts\" message\n */\nconst GetLargestAccountsRpcResult = jsonRpcResultAndContext(array(type({\n  lamports: number(),\n  address: PublicKeyFromString\n})));\n\n/**\n * @internal\n */\nconst AccountInfoResult = type({\n  executable: boolean(),\n  owner: PublicKeyFromString,\n  lamports: number(),\n  data: BufferFromRawAccountData,\n  rentEpoch: number()\n});\n\n/**\n * @internal\n */\nconst KeyedAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: AccountInfoResult\n});\nconst ParsedOrRawAccountData = coerce(union([instance(Buffer), ParsedAccountDataResult]), union([RawAccountDataResult, ParsedAccountDataResult]), value => {\n  if (Array.isArray(value)) {\n    return create(value, BufferFromRawAccountData);\n  } else {\n    return value;\n  }\n});\n\n/**\n * @internal\n */\nconst ParsedAccountInfoResult = type({\n  executable: boolean(),\n  owner: PublicKeyFromString,\n  lamports: number(),\n  data: ParsedOrRawAccountData,\n  rentEpoch: number()\n});\nconst KeyedParsedAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: ParsedAccountInfoResult\n});\n\n/**\n * @internal\n */\nconst StakeActivationResult = type({\n  state: union([literal('active'), literal('inactive'), literal('activating'), literal('deactivating')]),\n  active: number(),\n  inactive: number()\n});\n\n/**\n * Expected JSON RPC response for the \"getConfirmedSignaturesForAddress2\" message\n */\n\nconst GetConfirmedSignaturesForAddress2RpcResult = jsonRpcResult(array(type({\n  signature: string(),\n  slot: number(),\n  err: TransactionErrorResult,\n  memo: nullable(string()),\n  blockTime: optional(nullable(number()))\n})));\n\n/**\n * Expected JSON RPC response for the \"getSignaturesForAddress\" message\n */\nconst GetSignaturesForAddressRpcResult = jsonRpcResult(array(type({\n  signature: string(),\n  slot: number(),\n  err: TransactionErrorResult,\n  memo: nullable(string()),\n  blockTime: optional(nullable(number()))\n})));\n\n/***\n * Expected JSON RPC response for the \"accountNotification\" message\n */\nconst AccountNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(AccountInfoResult)\n});\n\n/**\n * @internal\n */\nconst ProgramAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: AccountInfoResult\n});\n\n/***\n * Expected JSON RPC response for the \"programNotification\" message\n */\nconst ProgramAccountNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(ProgramAccountInfoResult)\n});\n\n/**\n * @internal\n */\nconst SlotInfoResult = type({\n  parent: number(),\n  slot: number(),\n  root: number()\n});\n\n/**\n * Expected JSON RPC response for the \"slotNotification\" message\n */\nconst SlotNotificationResult = type({\n  subscription: number(),\n  result: SlotInfoResult\n});\n\n/**\n * Slot updates which can be used for tracking the live progress of a cluster.\n * - `\"firstShredReceived\"`: connected node received the first shred of a block.\n * Indicates that a new block that is being produced.\n * - `\"completed\"`: connected node has received all shreds of a block. Indicates\n * a block was recently produced.\n * - `\"optimisticConfirmation\"`: block was optimistically confirmed by the\n * cluster. It is not guaranteed that an optimistic confirmation notification\n * will be sent for every finalized blocks.\n * - `\"root\"`: the connected node rooted this block.\n * - `\"createdBank\"`: the connected node has started validating this block.\n * - `\"frozen\"`: the connected node has validated this block.\n * - `\"dead\"`: the connected node failed to validate this block.\n */\n\n/**\n * @internal\n */\nconst SlotUpdateResult = union([type({\n  type: union([literal('firstShredReceived'), literal('completed'), literal('optimisticConfirmation'), literal('root')]),\n  slot: number(),\n  timestamp: number()\n}), type({\n  type: literal('createdBank'),\n  parent: number(),\n  slot: number(),\n  timestamp: number()\n}), type({\n  type: literal('frozen'),\n  slot: number(),\n  timestamp: number(),\n  stats: type({\n    numTransactionEntries: number(),\n    numSuccessfulTransactions: number(),\n    numFailedTransactions: number(),\n    maxTransactionsPerEntry: number()\n  })\n}), type({\n  type: literal('dead'),\n  slot: number(),\n  timestamp: number(),\n  err: string()\n})]);\n\n/**\n * Expected JSON RPC response for the \"slotsUpdatesNotification\" message\n */\nconst SlotUpdateNotificationResult = type({\n  subscription: number(),\n  result: SlotUpdateResult\n});\n\n/**\n * Expected JSON RPC response for the \"signatureNotification\" message\n */\nconst SignatureNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(union([SignatureStatusResult, SignatureReceivedResult]))\n});\n\n/**\n * Expected JSON RPC response for the \"rootNotification\" message\n */\nconst RootNotificationResult = type({\n  subscription: number(),\n  result: number()\n});\nconst ContactInfoResult = type({\n  pubkey: string(),\n  gossip: nullable(string()),\n  tpu: nullable(string()),\n  rpc: nullable(string()),\n  version: nullable(string())\n});\nconst VoteAccountInfoResult = type({\n  votePubkey: string(),\n  nodePubkey: string(),\n  activatedStake: number(),\n  epochVoteAccount: boolean(),\n  epochCredits: array(tuple([number(), number(), number()])),\n  commission: number(),\n  lastVote: number(),\n  rootSlot: nullable(number())\n});\n\n/**\n * Expected JSON RPC response for the \"getVoteAccounts\" message\n */\nconst GetVoteAccounts = jsonRpcResult(type({\n  current: array(VoteAccountInfoResult),\n  delinquent: array(VoteAccountInfoResult)\n}));\nconst ConfirmationStatus = union([literal('processed'), literal('confirmed'), literal('finalized')]);\nconst SignatureStatusResponse = type({\n  slot: number(),\n  confirmations: nullable(number()),\n  err: TransactionErrorResult,\n  confirmationStatus: optional(ConfirmationStatus)\n});\n\n/**\n * Expected JSON RPC response for the \"getSignatureStatuses\" message\n */\nconst GetSignatureStatusesRpcResult = jsonRpcResultAndContext(array(nullable(SignatureStatusResponse)));\n\n/**\n * Expected JSON RPC response for the \"getMinimumBalanceForRentExemption\" message\n */\nconst GetMinimumBalanceForRentExemptionRpcResult = jsonRpcResult(number());\nconst AddressTableLookupStruct = type({\n  accountKey: PublicKeyFromString,\n  writableIndexes: array(number()),\n  readonlyIndexes: array(number())\n});\nconst ConfirmedTransactionResult = type({\n  signatures: array(string()),\n  message: type({\n    accountKeys: array(string()),\n    header: type({\n      numRequiredSignatures: number(),\n      numReadonlySignedAccounts: number(),\n      numReadonlyUnsignedAccounts: number()\n    }),\n    instructions: array(type({\n      accounts: array(number()),\n      data: string(),\n      programIdIndex: number()\n    })),\n    recentBlockhash: string(),\n    addressTableLookups: optional(array(AddressTableLookupStruct))\n  })\n});\nconst AnnotatedAccountKey = type({\n  pubkey: PublicKeyFromString,\n  signer: boolean(),\n  writable: boolean(),\n  source: optional(union([literal('transaction'), literal('lookupTable')]))\n});\nconst ConfirmedTransactionAccountsModeResult = type({\n  accountKeys: array(AnnotatedAccountKey),\n  signatures: array(string())\n});\nconst ParsedInstructionResult = type({\n  parsed: unknown(),\n  program: string(),\n  programId: PublicKeyFromString\n});\nconst RawInstructionResult = type({\n  accounts: array(PublicKeyFromString),\n  data: string(),\n  programId: PublicKeyFromString\n});\nconst InstructionResult = union([RawInstructionResult, ParsedInstructionResult]);\nconst UnknownInstructionResult = union([type({\n  parsed: unknown(),\n  program: string(),\n  programId: string()\n}), type({\n  accounts: array(string()),\n  data: string(),\n  programId: string()\n})]);\nconst ParsedOrRawInstruction = coerce(InstructionResult, UnknownInstructionResult, value => {\n  if ('accounts' in value) {\n    return create(value, RawInstructionResult);\n  } else {\n    return create(value, ParsedInstructionResult);\n  }\n});\n\n/**\n * @internal\n */\nconst ParsedConfirmedTransactionResult = type({\n  signatures: array(string()),\n  message: type({\n    accountKeys: array(AnnotatedAccountKey),\n    instructions: array(ParsedOrRawInstruction),\n    recentBlockhash: string(),\n    addressTableLookups: optional(nullable(array(AddressTableLookupStruct)))\n  })\n});\nconst TokenBalanceResult = type({\n  accountIndex: number(),\n  mint: string(),\n  owner: optional(string()),\n  uiTokenAmount: TokenAmountResult\n});\nconst LoadedAddressesResult = type({\n  writable: array(PublicKeyFromString),\n  readonly: array(PublicKeyFromString)\n});\n\n/**\n * @internal\n */\nconst ConfirmedTransactionMetaResult = type({\n  err: TransactionErrorResult,\n  fee: number(),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(type({\n      accounts: array(number()),\n      data: string(),\n      programIdIndex: number()\n    }))\n  })))),\n  preBalances: array(number()),\n  postBalances: array(number()),\n  logMessages: optional(nullable(array(string()))),\n  preTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  postTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  loadedAddresses: optional(LoadedAddressesResult),\n  computeUnitsConsumed: optional(number())\n});\n\n/**\n * @internal\n */\nconst ParsedConfirmedTransactionMetaResult = type({\n  err: TransactionErrorResult,\n  fee: number(),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(ParsedOrRawInstruction)\n  })))),\n  preBalances: array(number()),\n  postBalances: array(number()),\n  logMessages: optional(nullable(array(string()))),\n  preTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  postTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  loadedAddresses: optional(LoadedAddressesResult),\n  computeUnitsConsumed: optional(number())\n});\nconst TransactionVersionStruct = union([literal(0), literal('legacy')]);\n\n/** @internal */\nconst RewardsResult = type({\n  pubkey: string(),\n  lamports: number(),\n  postBalance: nullable(number()),\n  rewardType: nullable(string()),\n  commission: optional(nullable(number()))\n});\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message\n */\nconst GetBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionResult,\n    meta: nullable(ConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message when `transactionDetails` is `none`\n */\nconst GetNoneModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message when `transactionDetails` is `accounts`\n */\nconst GetAccountsModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionAccountsModeResult,\n    meta: nullable(ConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message\n */\nconst GetParsedBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ParsedConfirmedTransactionResult,\n    meta: nullable(ParsedConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message  when `transactionDetails` is `accounts`\n */\nconst GetParsedAccountsModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionAccountsModeResult,\n    meta: nullable(ParsedConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message  when `transactionDetails` is `none`\n */\nconst GetParsedNoneModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getConfirmedBlock\" message\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link GetBlockRpcResult} instead.\n */\nconst GetConfirmedBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionResult,\n    meta: nullable(ConfirmedTransactionMetaResult)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message\n */\nconst GetBlockSignaturesRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  signatures: array(string()),\n  blockTime: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getTransaction\" message\n */\nconst GetTransactionRpcResult = jsonRpcResult(nullable(type({\n  slot: number(),\n  meta: nullable(ConfirmedTransactionMetaResult),\n  blockTime: optional(nullable(number())),\n  transaction: ConfirmedTransactionResult,\n  version: optional(TransactionVersionStruct)\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getTransaction\" message\n */\nconst GetParsedTransactionRpcResult = jsonRpcResult(nullable(type({\n  slot: number(),\n  transaction: ParsedConfirmedTransactionResult,\n  meta: nullable(ParsedConfirmedTransactionMetaResult),\n  blockTime: optional(nullable(number())),\n  version: optional(TransactionVersionStruct)\n})));\n\n/**\n * Expected JSON RPC response for the \"getRecentBlockhash\" message\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link GetLatestBlockhashRpcResult} instead.\n */\nconst GetRecentBlockhashAndContextRpcResult = jsonRpcResultAndContext(type({\n  blockhash: string(),\n  feeCalculator: type({\n    lamportsPerSignature: number()\n  })\n}));\n\n/**\n * Expected JSON RPC response for the \"getLatestBlockhash\" message\n */\nconst GetLatestBlockhashRpcResult = jsonRpcResultAndContext(type({\n  blockhash: string(),\n  lastValidBlockHeight: number()\n}));\n\n/**\n * Expected JSON RPC response for the \"isBlockhashValid\" message\n */\nconst IsBlockhashValidRpcResult = jsonRpcResultAndContext(boolean());\nconst PerfSampleResult = type({\n  slot: number(),\n  numTransactions: number(),\n  numSlots: number(),\n  samplePeriodSecs: number()\n});\n\n/*\n * Expected JSON RPC response for \"getRecentPerformanceSamples\" message\n */\nconst GetRecentPerformanceSamplesRpcResult = jsonRpcResult(array(PerfSampleResult));\n\n/**\n * Expected JSON RPC response for the \"getFeeCalculatorForBlockhash\" message\n */\nconst GetFeeCalculatorRpcResult = jsonRpcResultAndContext(nullable(type({\n  feeCalculator: type({\n    lamportsPerSignature: number()\n  })\n})));\n\n/**\n * Expected JSON RPC response for the \"requestAirdrop\" message\n */\nconst RequestAirdropRpcResult = jsonRpcResult(string());\n\n/**\n * Expected JSON RPC response for the \"sendTransaction\" message\n */\nconst SendTransactionRpcResult = jsonRpcResult(string());\n\n/**\n * Information about the latest slot being processed by a node\n */\n\n/**\n * Parsed account data\n */\n\n/**\n * Stake Activation data\n */\n\n/**\n * Data slice argument for getProgramAccounts\n */\n\n/**\n * Memory comparison filter for getProgramAccounts\n */\n\n/**\n * Data size comparison filter for getProgramAccounts\n */\n\n/**\n * A filter object for getProgramAccounts\n */\n\n/**\n * Configuration object for getProgramAccounts requests\n */\n\n/**\n * Configuration object for getParsedProgramAccounts\n */\n\n/**\n * Configuration object for getMultipleAccounts\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getNonce`\n */\n\n/**\n * Configuration object for `getNonceAndContext`\n */\n\n/**\n * Information describing an account\n */\n\n/**\n * Account information identified by pubkey\n */\n\n/**\n * Callback function for account change notifications\n */\n\n/**\n * Callback function for program account change notifications\n */\n\n/**\n * Callback function for slot change notifications\n */\n\n/**\n * Callback function for slot update notifications\n */\n\n/**\n * Callback function for signature status notifications\n */\n\n/**\n * Signature status notification with transaction result\n */\n\n/**\n * Signature received notification\n */\n\n/**\n * Callback function for signature notifications\n */\n\n/**\n * Signature subscription options\n */\n\n/**\n * Callback function for root change notifications\n */\n\n/**\n * @internal\n */\nconst LogsResult = type({\n  err: TransactionErrorResult,\n  logs: array(string()),\n  signature: string()\n});\n\n/**\n * Logs result.\n */\n\n/**\n * Expected JSON RPC response for the \"logsNotification\" message.\n */\nconst LogsNotificationResult = type({\n  result: notificationResultAndContext(LogsResult),\n  subscription: number()\n});\n\n/**\n * Filter for log subscriptions.\n */\n\n/**\n * Callback function for log notifications.\n */\n\n/**\n * Signature result\n */\n\n/**\n * Transaction error\n */\n\n/**\n * Transaction confirmation status\n * <pre>\n *   'processed': Transaction landed in a block which has reached 1 confirmation by the connected node\n *   'confirmed': Transaction landed in a block which has reached 1 confirmation by the cluster\n *   'finalized': Transaction landed in a block which has been finalized by the cluster\n * </pre>\n */\n\n/**\n * Signature status\n */\n\n/**\n * A confirmed signature with its status\n */\n\n/**\n * An object defining headers to be passed to the RPC server\n */\n\n/**\n * The type of the JavaScript `fetch()` API\n */\n\n/**\n * A callback used to augment the outgoing HTTP request\n */\n\n/**\n * Configuration for instantiating a Connection\n */\n\n/** @internal */\nconst COMMON_HTTP_HEADERS = {\n  'solana-client': `js/${\"0.0.0-development\" }`\n};\n\n/**\n * A connection to a fullnode JSON RPC endpoint\n */\nclass Connection {\n  /**\n   * Establish a JSON RPC connection\n   *\n   * @param endpoint URL to the fullnode JSON RPC endpoint\n   * @param commitmentOrConfig optional default commitment level or optional ConnectionConfig configuration object\n   */\n  constructor(endpoint, _commitmentOrConfig) {\n    /** @internal */\n    this._commitment = void 0;\n    /** @internal */\n    this._confirmTransactionInitialTimeout = void 0;\n    /** @internal */\n    this._rpcEndpoint = void 0;\n    /** @internal */\n    this._rpcWsEndpoint = void 0;\n    /** @internal */\n    this._rpcClient = void 0;\n    /** @internal */\n    this._rpcRequest = void 0;\n    /** @internal */\n    this._rpcBatchRequest = void 0;\n    /** @internal */\n    this._rpcWebSocket = void 0;\n    /** @internal */\n    this._rpcWebSocketConnected = false;\n    /** @internal */\n    this._rpcWebSocketHeartbeat = null;\n    /** @internal */\n    this._rpcWebSocketIdleTimeout = null;\n    /** @internal\n     * A number that we increment every time an active connection closes.\n     * Used to determine whether the same socket connection that was open\n     * when an async operation started is the same one that's active when\n     * its continuation fires.\n     *\n     */\n    this._rpcWebSocketGeneration = 0;\n    /** @internal */\n    this._disableBlockhashCaching = false;\n    /** @internal */\n    this._pollingBlockhash = false;\n    /** @internal */\n    this._blockhashInfo = {\n      latestBlockhash: null,\n      lastFetch: 0,\n      transactionSignatures: [],\n      simulatedSignatures: []\n    };\n    /** @internal */\n    this._nextClientSubscriptionId = 0;\n    /** @internal */\n    this._subscriptionDisposeFunctionsByClientSubscriptionId = {};\n    /** @internal */\n    this._subscriptionHashByClientSubscriptionId = {};\n    /** @internal */\n    this._subscriptionStateChangeCallbacksByHash = {};\n    /** @internal */\n    this._subscriptionCallbacksByServerSubscriptionId = {};\n    /** @internal */\n    this._subscriptionsByHash = {};\n    /**\n     * Special case.\n     * After a signature is processed, RPCs automatically dispose of the\n     * subscription on the server side. We need to track which of these\n     * subscriptions have been disposed in such a way, so that we know\n     * whether the client is dealing with a not-yet-processed signature\n     * (in which case we must tear down the server subscription) or an\n     * already-processed signature (in which case the client can simply\n     * clear out the subscription locally without telling the server).\n     *\n     * NOTE: There is a proposal to eliminate this special case, here:\n     * https://github.com/solana-labs/solana/issues/18892\n     */\n    /** @internal */\n    this._subscriptionsAutoDisposedByRpc = new Set();\n    /*\n     * Returns the current block height of the node\n     */\n    this.getBlockHeight = (() => {\n      const requestPromises = {};\n      return async commitmentOrConfig => {\n        const {\n          commitment,\n          config\n        } = extractCommitmentFromConfig(commitmentOrConfig);\n        const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n        const requestHash = fastStableStringify$1(args);\n        requestPromises[requestHash] = requestPromises[requestHash] ?? (async () => {\n          try {\n            const unsafeRes = await this._rpcRequest('getBlockHeight', args);\n            const res = create(unsafeRes, jsonRpcResult(number()));\n            if ('error' in res) {\n              throw new SolanaJSONRPCError(res.error, 'failed to get block height information');\n            }\n            return res.result;\n          } finally {\n            delete requestPromises[requestHash];\n          }\n        })();\n        return await requestPromises[requestHash];\n      };\n    })();\n    let wsEndpoint;\n    let httpHeaders;\n    let fetch;\n    let fetchMiddleware;\n    let disableRetryOnRateLimit;\n    let httpAgent;\n    if (_commitmentOrConfig && typeof _commitmentOrConfig === 'string') {\n      this._commitment = _commitmentOrConfig;\n    } else if (_commitmentOrConfig) {\n      this._commitment = _commitmentOrConfig.commitment;\n      this._confirmTransactionInitialTimeout = _commitmentOrConfig.confirmTransactionInitialTimeout;\n      wsEndpoint = _commitmentOrConfig.wsEndpoint;\n      httpHeaders = _commitmentOrConfig.httpHeaders;\n      fetch = _commitmentOrConfig.fetch;\n      fetchMiddleware = _commitmentOrConfig.fetchMiddleware;\n      disableRetryOnRateLimit = _commitmentOrConfig.disableRetryOnRateLimit;\n      httpAgent = _commitmentOrConfig.httpAgent;\n    }\n    this._rpcEndpoint = assertEndpointUrl(endpoint);\n    this._rpcWsEndpoint = wsEndpoint || makeWebsocketUrl(endpoint);\n    this._rpcClient = createRpcClient(endpoint, httpHeaders, fetch, fetchMiddleware, disableRetryOnRateLimit, httpAgent);\n    this._rpcRequest = createRpcRequest(this._rpcClient);\n    this._rpcBatchRequest = createRpcBatchRequest(this._rpcClient);\n    this._rpcWebSocket = new RpcWebSocketClient(this._rpcWsEndpoint, {\n      autoconnect: false,\n      max_reconnects: Infinity\n    });\n    this._rpcWebSocket.on('open', this._wsOnOpen.bind(this));\n    this._rpcWebSocket.on('error', this._wsOnError.bind(this));\n    this._rpcWebSocket.on('close', this._wsOnClose.bind(this));\n    this._rpcWebSocket.on('accountNotification', this._wsOnAccountNotification.bind(this));\n    this._rpcWebSocket.on('programNotification', this._wsOnProgramAccountNotification.bind(this));\n    this._rpcWebSocket.on('slotNotification', this._wsOnSlotNotification.bind(this));\n    this._rpcWebSocket.on('slotsUpdatesNotification', this._wsOnSlotUpdatesNotification.bind(this));\n    this._rpcWebSocket.on('signatureNotification', this._wsOnSignatureNotification.bind(this));\n    this._rpcWebSocket.on('rootNotification', this._wsOnRootNotification.bind(this));\n    this._rpcWebSocket.on('logsNotification', this._wsOnLogsNotification.bind(this));\n  }\n\n  /**\n   * The default commitment used for requests\n   */\n  get commitment() {\n    return this._commitment;\n  }\n\n  /**\n   * The RPC endpoint\n   */\n  get rpcEndpoint() {\n    return this._rpcEndpoint;\n  }\n\n  /**\n   * Fetch the balance for the specified public key, return with context\n   */\n  async getBalanceAndContext(publicKey, commitmentOrConfig) {\n    /** @internal */\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getBalance', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get balance for ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the balance for the specified public key\n   */\n  async getBalance(publicKey, commitmentOrConfig) {\n    return await this.getBalanceAndContext(publicKey, commitmentOrConfig).then(x => x.value).catch(e => {\n      throw new Error('failed to get balance of account ' + publicKey.toBase58() + ': ' + e);\n    });\n  }\n\n  /**\n   * Fetch the estimated production time of a block\n   */\n  async getBlockTime(slot) {\n    const unsafeRes = await this._rpcRequest('getBlockTime', [slot]);\n    const res = create(unsafeRes, jsonRpcResult(nullable(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get block time for slot ${slot}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the lowest slot that the node has information about in its ledger.\n   * This value may increase over time if the node is configured to purge older ledger data\n   */\n  async getMinimumLedgerSlot() {\n    const unsafeRes = await this._rpcRequest('minimumLedgerSlot', []);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get minimum ledger slot');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the slot of the lowest confirmed block that has not been purged from the ledger\n   */\n  async getFirstAvailableBlock() {\n    const unsafeRes = await this._rpcRequest('getFirstAvailableBlock', []);\n    const res = create(unsafeRes, SlotRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get first available block');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch information about the current supply\n   */\n  async getSupply(config) {\n    let configArg = {};\n    if (typeof config === 'string') {\n      configArg = {\n        commitment: config\n      };\n    } else if (config) {\n      configArg = {\n        ...config,\n        commitment: config && config.commitment || this.commitment\n      };\n    } else {\n      configArg = {\n        commitment: this.commitment\n      };\n    }\n    const unsafeRes = await this._rpcRequest('getSupply', [configArg]);\n    const res = create(unsafeRes, GetSupplyRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get supply');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current supply of a token mint\n   */\n  async getTokenSupply(tokenMintAddress, commitment) {\n    const args = this._buildArgs([tokenMintAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenSupply', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(TokenAmountResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token supply');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current balance of a token account\n   */\n  async getTokenAccountBalance(tokenAddress, commitment) {\n    const args = this._buildArgs([tokenAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenAccountBalance', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(TokenAmountResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token account balance');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the token accounts owned by the specified account\n   *\n   * @return {Promise<RpcResponseAndContext<GetProgramAccountsResponse>}\n   */\n  async getTokenAccountsByOwner(ownerAddress, filter, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    let _args = [ownerAddress.toBase58()];\n    if ('mint' in filter) {\n      _args.push({\n        mint: filter.mint.toBase58()\n      });\n    } else {\n      _args.push({\n        programId: filter.programId.toBase58()\n      });\n    }\n    const args = this._buildArgs(_args, commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getTokenAccountsByOwner', args);\n    const res = create(unsafeRes, GetTokenAccountsByOwner);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get token accounts owned by account ${ownerAddress.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed token accounts owned by the specified account\n   *\n   * @return {Promise<RpcResponseAndContext<Array<{pubkey: PublicKey, account: AccountInfo<ParsedAccountData>}>>>}\n   */\n  async getParsedTokenAccountsByOwner(ownerAddress, filter, commitment) {\n    let _args = [ownerAddress.toBase58()];\n    if ('mint' in filter) {\n      _args.push({\n        mint: filter.mint.toBase58()\n      });\n    } else {\n      _args.push({\n        programId: filter.programId.toBase58()\n      });\n    }\n    const args = this._buildArgs(_args, commitment, 'jsonParsed');\n    const unsafeRes = await this._rpcRequest('getTokenAccountsByOwner', args);\n    const res = create(unsafeRes, GetParsedTokenAccountsByOwner);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get token accounts owned by account ${ownerAddress.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the 20 largest accounts with their current balances\n   */\n  async getLargestAccounts(config) {\n    const arg = {\n      ...config,\n      commitment: config && config.commitment || this.commitment\n    };\n    const args = arg.filter || arg.commitment ? [arg] : [];\n    const unsafeRes = await this._rpcRequest('getLargestAccounts', args);\n    const res = create(unsafeRes, GetLargestAccountsRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get largest accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the 20 largest token accounts with their current balances\n   * for a given mint.\n   */\n  async getTokenLargestAccounts(mintAddress, commitment) {\n    const args = this._buildArgs([mintAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenLargestAccounts', args);\n    const res = create(unsafeRes, GetTokenLargestAccountsResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token largest accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for the specified public key, return with context\n   */\n  async getAccountInfoAndContext(publicKey, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getAccountInfo', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(AccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info about account ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed account info for the specified public key\n   */\n  async getParsedAccountInfo(publicKey, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getAccountInfo', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(ParsedAccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info about account ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for the specified public key\n   */\n  async getAccountInfo(publicKey, commitmentOrConfig) {\n    try {\n      const res = await this.getAccountInfoAndContext(publicKey, commitmentOrConfig);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get info about account ' + publicKey.toBase58() + ': ' + e);\n    }\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys, return with context\n   */\n  async getMultipleParsedAccounts(publicKeys, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const keys = publicKeys.map(key => key.toBase58());\n    const args = this._buildArgs([keys], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getMultipleAccounts', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(array(nullable(ParsedAccountInfoResult))));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info for accounts ${keys}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys, return with context\n   */\n  async getMultipleAccountsInfoAndContext(publicKeys, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const keys = publicKeys.map(key => key.toBase58());\n    const args = this._buildArgs([keys], commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getMultipleAccounts', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(array(nullable(AccountInfoResult))));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info for accounts ${keys}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys\n   */\n  async getMultipleAccountsInfo(publicKeys, commitmentOrConfig) {\n    const res = await this.getMultipleAccountsInfoAndContext(publicKeys, commitmentOrConfig);\n    return res.value;\n  }\n\n  /**\n   * Returns epoch activation information for a stake account that has been delegated\n   *\n   * @deprecated Deprecated since RPC v1.18; will be removed in a future version.\n   */\n  async getStakeActivation(publicKey, commitmentOrConfig, epoch) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, undefined /* encoding */, {\n      ...config,\n      epoch: epoch != null ? epoch : config?.epoch\n    });\n    const unsafeRes = await this._rpcRequest('getStakeActivation', args);\n    const res = create(unsafeRes, jsonRpcResult(StakeActivationResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get Stake Activation ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the accounts owned by the specified program id\n   *\n   * @return {Promise<Array<{pubkey: PublicKey, account: AccountInfo<Buffer>}>>}\n   */\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async getProgramAccounts(programId, configOrCommitment) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(configOrCommitment);\n    const {\n      encoding,\n      ...configWithoutEncoding\n    } = config || {};\n    const args = this._buildArgs([programId.toBase58()], commitment, encoding || 'base64', configWithoutEncoding);\n    const unsafeRes = await this._rpcRequest('getProgramAccounts', args);\n    const baseSchema = array(KeyedAccountInfoResult);\n    const res = configWithoutEncoding.withContext === true ? create(unsafeRes, jsonRpcResultAndContext(baseSchema)) : create(unsafeRes, jsonRpcResult(baseSchema));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get accounts owned by program ${programId.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch and parse all the accounts owned by the specified program id\n   *\n   * @return {Promise<Array<{pubkey: PublicKey, account: AccountInfo<Buffer | ParsedAccountData>}>>}\n   */\n  async getParsedProgramAccounts(programId, configOrCommitment) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(configOrCommitment);\n    const args = this._buildArgs([programId.toBase58()], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getProgramAccounts', args);\n    const res = create(unsafeRes, jsonRpcResult(array(KeyedParsedAccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get accounts owned by program ${programId.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /** @deprecated Instead, call `confirmTransaction` and pass in {@link TransactionConfirmationStrategy} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async confirmTransaction(strategy, commitment) {\n    let rawSignature;\n    if (typeof strategy == 'string') {\n      rawSignature = strategy;\n    } else {\n      const config = strategy;\n      if (config.abortSignal?.aborted) {\n        return Promise.reject(config.abortSignal.reason);\n      }\n      rawSignature = config.signature;\n    }\n    let decodedSignature;\n    try {\n      decodedSignature = bs58.decode(rawSignature);\n    } catch (err) {\n      throw new Error('signature must be base58 encoded: ' + rawSignature);\n    }\n    assert(decodedSignature.length === 64, 'signature has invalid length');\n    if (typeof strategy === 'string') {\n      return await this.confirmTransactionUsingLegacyTimeoutStrategy({\n        commitment: commitment || this.commitment,\n        signature: rawSignature\n      });\n    } else if ('lastValidBlockHeight' in strategy) {\n      return await this.confirmTransactionUsingBlockHeightExceedanceStrategy({\n        commitment: commitment || this.commitment,\n        strategy\n      });\n    } else {\n      return await this.confirmTransactionUsingDurableNonceStrategy({\n        commitment: commitment || this.commitment,\n        strategy\n      });\n    }\n  }\n  getCancellationPromise(signal) {\n    return new Promise((_, reject) => {\n      if (signal == null) {\n        return;\n      }\n      if (signal.aborted) {\n        reject(signal.reason);\n      } else {\n        signal.addEventListener('abort', () => {\n          reject(signal.reason);\n        });\n      }\n    });\n  }\n  getTransactionConfirmationPromise({\n    commitment,\n    signature\n  }) {\n    let signatureSubscriptionId;\n    let disposeSignatureSubscriptionStateChangeObserver;\n    let done = false;\n    const confirmationPromise = new Promise((resolve, reject) => {\n      try {\n        signatureSubscriptionId = this.onSignature(signature, (result, context) => {\n          signatureSubscriptionId = undefined;\n          const response = {\n            context,\n            value: result\n          };\n          resolve({\n            __type: TransactionStatus.PROCESSED,\n            response\n          });\n        }, commitment);\n        const subscriptionSetupPromise = new Promise(resolveSubscriptionSetup => {\n          if (signatureSubscriptionId == null) {\n            resolveSubscriptionSetup();\n          } else {\n            disposeSignatureSubscriptionStateChangeObserver = this._onSubscriptionStateChange(signatureSubscriptionId, nextState => {\n              if (nextState === 'subscribed') {\n                resolveSubscriptionSetup();\n              }\n            });\n          }\n        });\n        (async () => {\n          await subscriptionSetupPromise;\n          if (done) return;\n          const response = await this.getSignatureStatus(signature);\n          if (done) return;\n          if (response == null) {\n            return;\n          }\n          const {\n            context,\n            value\n          } = response;\n          if (value == null) {\n            return;\n          }\n          if (value?.err) {\n            reject(value.err);\n          } else {\n            switch (commitment) {\n              case 'confirmed':\n              case 'single':\n              case 'singleGossip':\n                {\n                  if (value.confirmationStatus === 'processed') {\n                    return;\n                  }\n                  break;\n                }\n              case 'finalized':\n              case 'max':\n              case 'root':\n                {\n                  if (value.confirmationStatus === 'processed' || value.confirmationStatus === 'confirmed') {\n                    return;\n                  }\n                  break;\n                }\n              // exhaust enums to ensure full coverage\n              case 'processed':\n              case 'recent':\n            }\n            done = true;\n            resolve({\n              __type: TransactionStatus.PROCESSED,\n              response: {\n                context,\n                value\n              }\n            });\n          }\n        })();\n      } catch (err) {\n        reject(err);\n      }\n    });\n    const abortConfirmation = () => {\n      if (disposeSignatureSubscriptionStateChangeObserver) {\n        disposeSignatureSubscriptionStateChangeObserver();\n        disposeSignatureSubscriptionStateChangeObserver = undefined;\n      }\n      if (signatureSubscriptionId != null) {\n        this.removeSignatureListener(signatureSubscriptionId);\n        signatureSubscriptionId = undefined;\n      }\n    };\n    return {\n      abortConfirmation,\n      confirmationPromise\n    };\n  }\n  async confirmTransactionUsingBlockHeightExceedanceStrategy({\n    commitment,\n    strategy: {\n      abortSignal,\n      lastValidBlockHeight,\n      signature\n    }\n  }) {\n    let done = false;\n    const expiryPromise = new Promise(resolve => {\n      const checkBlockHeight = async () => {\n        try {\n          const blockHeight = await this.getBlockHeight(commitment);\n          return blockHeight;\n        } catch (_e) {\n          return -1;\n        }\n      };\n      (async () => {\n        let currentBlockHeight = await checkBlockHeight();\n        if (done) return;\n        while (currentBlockHeight <= lastValidBlockHeight) {\n          await sleep(1000);\n          if (done) return;\n          currentBlockHeight = await checkBlockHeight();\n          if (done) return;\n        }\n        resolve({\n          __type: TransactionStatus.BLOCKHEIGHT_EXCEEDED\n        });\n      })();\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    const cancellationPromise = this.getCancellationPromise(abortSignal);\n    let result;\n    try {\n      const outcome = await Promise.race([cancellationPromise, confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        throw new TransactionExpiredBlockheightExceededError(signature);\n      }\n    } finally {\n      done = true;\n      abortConfirmation();\n    }\n    return result;\n  }\n  async confirmTransactionUsingDurableNonceStrategy({\n    commitment,\n    strategy: {\n      abortSignal,\n      minContextSlot,\n      nonceAccountPubkey,\n      nonceValue,\n      signature\n    }\n  }) {\n    let done = false;\n    const expiryPromise = new Promise(resolve => {\n      let currentNonceValue = nonceValue;\n      let lastCheckedSlot = null;\n      const getCurrentNonceValue = async () => {\n        try {\n          const {\n            context,\n            value: nonceAccount\n          } = await this.getNonceAndContext(nonceAccountPubkey, {\n            commitment,\n            minContextSlot\n          });\n          lastCheckedSlot = context.slot;\n          return nonceAccount?.nonce;\n        } catch (e) {\n          // If for whatever reason we can't reach/read the nonce\n          // account, just keep using the last-known value.\n          return currentNonceValue;\n        }\n      };\n      (async () => {\n        currentNonceValue = await getCurrentNonceValue();\n        if (done) return;\n        while (true // eslint-disable-line no-constant-condition\n        ) {\n          if (nonceValue !== currentNonceValue) {\n            resolve({\n              __type: TransactionStatus.NONCE_INVALID,\n              slotInWhichNonceDidAdvance: lastCheckedSlot\n            });\n            return;\n          }\n          await sleep(2000);\n          if (done) return;\n          currentNonceValue = await getCurrentNonceValue();\n          if (done) return;\n        }\n      })();\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    const cancellationPromise = this.getCancellationPromise(abortSignal);\n    let result;\n    try {\n      const outcome = await Promise.race([cancellationPromise, confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        // Double check that the transaction is indeed unconfirmed.\n        let signatureStatus;\n        while (true // eslint-disable-line no-constant-condition\n        ) {\n          const status = await this.getSignatureStatus(signature);\n          if (status == null) {\n            break;\n          }\n          if (status.context.slot < (outcome.slotInWhichNonceDidAdvance ?? minContextSlot)) {\n            await sleep(400);\n            continue;\n          }\n          signatureStatus = status;\n          break;\n        }\n        if (signatureStatus?.value) {\n          const commitmentForStatus = commitment || 'finalized';\n          const {\n            confirmationStatus\n          } = signatureStatus.value;\n          switch (commitmentForStatus) {\n            case 'processed':\n            case 'recent':\n              if (confirmationStatus !== 'processed' && confirmationStatus !== 'confirmed' && confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            case 'confirmed':\n            case 'single':\n            case 'singleGossip':\n              if (confirmationStatus !== 'confirmed' && confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            case 'finalized':\n            case 'max':\n            case 'root':\n              if (confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            default:\n              // Exhaustive switch.\n              // eslint-disable-next-line @typescript-eslint/no-unused-vars\n              (_ => {})(commitmentForStatus);\n          }\n          result = {\n            context: signatureStatus.context,\n            value: {\n              err: signatureStatus.value.err\n            }\n          };\n        } else {\n          throw new TransactionExpiredNonceInvalidError(signature);\n        }\n      }\n    } finally {\n      done = true;\n      abortConfirmation();\n    }\n    return result;\n  }\n  async confirmTransactionUsingLegacyTimeoutStrategy({\n    commitment,\n    signature\n  }) {\n    let timeoutId;\n    const expiryPromise = new Promise(resolve => {\n      let timeoutMs = this._confirmTransactionInitialTimeout || 60 * 1000;\n      switch (commitment) {\n        case 'processed':\n        case 'recent':\n        case 'single':\n        case 'confirmed':\n        case 'singleGossip':\n          {\n            timeoutMs = this._confirmTransactionInitialTimeout || 30 * 1000;\n            break;\n          }\n      }\n      timeoutId = setTimeout(() => resolve({\n        __type: TransactionStatus.TIMED_OUT,\n        timeoutMs\n      }), timeoutMs);\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    let result;\n    try {\n      const outcome = await Promise.race([confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        throw new TransactionExpiredTimeoutError(signature, outcome.timeoutMs / 1000);\n      }\n    } finally {\n      clearTimeout(timeoutId);\n      abortConfirmation();\n    }\n    return result;\n  }\n\n  /**\n   * Return the list of nodes that are currently participating in the cluster\n   */\n  async getClusterNodes() {\n    const unsafeRes = await this._rpcRequest('getClusterNodes', []);\n    const res = create(unsafeRes, jsonRpcResult(array(ContactInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get cluster nodes');\n    }\n    return res.result;\n  }\n\n  /**\n   * Return the list of nodes that are currently participating in the cluster\n   */\n  async getVoteAccounts(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getVoteAccounts', args);\n    const res = create(unsafeRes, GetVoteAccounts);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get vote accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current slot that the node is processing\n   */\n  async getSlot(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getSlot', args);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current slot leader of the cluster\n   */\n  async getSlotLeader(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getSlotLeader', args);\n    const res = create(unsafeRes, jsonRpcResult(string()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot leader');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch `limit` number of slot leaders starting from `startSlot`\n   *\n   * @param startSlot fetch slot leaders starting from this slot\n   * @param limit number of slot leaders to return\n   */\n  async getSlotLeaders(startSlot, limit) {\n    const args = [startSlot, limit];\n    const unsafeRes = await this._rpcRequest('getSlotLeaders', args);\n    const res = create(unsafeRes, jsonRpcResult(array(PublicKeyFromString)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot leaders');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current status of a signature\n   */\n  async getSignatureStatus(signature, config) {\n    const {\n      context,\n      value: values\n    } = await this.getSignatureStatuses([signature], config);\n    assert(values.length === 1);\n    const value = values[0];\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the current statuses of a batch of signatures\n   */\n  async getSignatureStatuses(signatures, config) {\n    const params = [signatures];\n    if (config) {\n      params.push(config);\n    }\n    const unsafeRes = await this._rpcRequest('getSignatureStatuses', params);\n    const res = create(unsafeRes, GetSignatureStatusesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get signature status');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current transaction count of the cluster\n   */\n  async getTransactionCount(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getTransactionCount', args);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction count');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current total currency supply of the cluster in lamports\n   *\n   * @deprecated Deprecated since RPC v1.2.8. Please use {@link getSupply} instead.\n   */\n  async getTotalSupply(commitment) {\n    const result = await this.getSupply({\n      commitment,\n      excludeNonCirculatingAccountsList: true\n    });\n    return result.value.total;\n  }\n\n  /**\n   * Fetch the cluster InflationGovernor parameters\n   */\n  async getInflationGovernor(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getInflationGovernor', args);\n    const res = create(unsafeRes, GetInflationGovernorRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the inflation reward for a list of addresses for an epoch\n   */\n  async getInflationReward(addresses, epoch, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([addresses.map(pubkey => pubkey.toBase58())], commitment, undefined /* encoding */, {\n      ...config,\n      epoch: epoch != null ? epoch : config?.epoch\n    });\n    const unsafeRes = await this._rpcRequest('getInflationReward', args);\n    const res = create(unsafeRes, GetInflationRewardResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation reward');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the specific inflation values for the current epoch\n   */\n  async getInflationRate() {\n    const unsafeRes = await this._rpcRequest('getInflationRate', []);\n    const res = create(unsafeRes, GetInflationRateRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation rate');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the Epoch Info parameters\n   */\n  async getEpochInfo(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getEpochInfo', args);\n    const res = create(unsafeRes, GetEpochInfoRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get epoch info');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the Epoch Schedule parameters\n   */\n  async getEpochSchedule() {\n    const unsafeRes = await this._rpcRequest('getEpochSchedule', []);\n    const res = create(unsafeRes, GetEpochScheduleRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get epoch schedule');\n    }\n    const epochSchedule = res.result;\n    return new EpochSchedule(epochSchedule.slotsPerEpoch, epochSchedule.leaderScheduleSlotOffset, epochSchedule.warmup, epochSchedule.firstNormalEpoch, epochSchedule.firstNormalSlot);\n  }\n\n  /**\n   * Fetch the leader schedule for the current epoch\n   * @return {Promise<RpcResponseAndContext<LeaderSchedule>>}\n   */\n  async getLeaderSchedule() {\n    const unsafeRes = await this._rpcRequest('getLeaderSchedule', []);\n    const res = create(unsafeRes, GetLeaderScheduleRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get leader schedule');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the minimum balance needed to exempt an account of `dataLength`\n   * size from rent\n   */\n  async getMinimumBalanceForRentExemption(dataLength, commitment) {\n    const args = this._buildArgs([dataLength], commitment);\n    const unsafeRes = await this._rpcRequest('getMinimumBalanceForRentExemption', args);\n    const res = create(unsafeRes, GetMinimumBalanceForRentExemptionRpcResult);\n    if ('error' in res) {\n      console.warn('Unable to fetch minimum balance for rent exemption');\n      return 0;\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a recent blockhash from the cluster, return with context\n   * @return {Promise<RpcResponseAndContext<{blockhash: Blockhash, feeCalculator: FeeCalculator}>>}\n   *\n   * @deprecated Deprecated since RPC v1.9.0. Please use {@link getLatestBlockhash} instead.\n   */\n  async getRecentBlockhashAndContext(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getRecentBlockhash', args);\n    const res = create(unsafeRes, GetRecentBlockhashAndContextRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch recent performance samples\n   * @return {Promise<Array<PerfSample>>}\n   */\n  async getRecentPerformanceSamples(limit) {\n    const unsafeRes = await this._rpcRequest('getRecentPerformanceSamples', limit ? [limit] : []);\n    const res = create(unsafeRes, GetRecentPerformanceSamplesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent performance samples');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the fee calculator for a recent blockhash from the cluster, return with context\n   *\n   * @deprecated Deprecated since RPC v1.9.0. Please use {@link getFeeForMessage} instead.\n   */\n  async getFeeCalculatorForBlockhash(blockhash, commitment) {\n    const args = this._buildArgs([blockhash], commitment);\n    const unsafeRes = await this._rpcRequest('getFeeCalculatorForBlockhash', args);\n    const res = create(unsafeRes, GetFeeCalculatorRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get fee calculator');\n    }\n    const {\n      context,\n      value\n    } = res.result;\n    return {\n      context,\n      value: value !== null ? value.feeCalculator : null\n    };\n  }\n\n  /**\n   * Fetch the fee for a message from the cluster, return with context\n   */\n  async getFeeForMessage(message, commitment) {\n    const wireMessage = toBuffer(message.serialize()).toString('base64');\n    const args = this._buildArgs([wireMessage], commitment);\n    const unsafeRes = await this._rpcRequest('getFeeForMessage', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get fee for message');\n    }\n    if (res.result === null) {\n      throw new Error('invalid blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a list of prioritization fees from recent blocks.\n   */\n  async getRecentPrioritizationFees(config) {\n    const accounts = config?.lockedWritableAccounts?.map(key => key.toBase58());\n    const args = accounts?.length ? [accounts] : [];\n    const unsafeRes = await this._rpcRequest('getRecentPrioritizationFees', args);\n    const res = create(unsafeRes, GetRecentPrioritizationFeesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent prioritization fees');\n    }\n    return res.result;\n  }\n  /**\n   * Fetch a recent blockhash from the cluster\n   * @return {Promise<{blockhash: Blockhash, feeCalculator: FeeCalculator}>}\n   *\n   * @deprecated Deprecated since RPC v1.8.0. Please use {@link getLatestBlockhash} instead.\n   */\n  async getRecentBlockhash(commitment) {\n    try {\n      const res = await this.getRecentBlockhashAndContext(commitment);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get recent blockhash: ' + e);\n    }\n  }\n\n  /**\n   * Fetch the latest blockhash from the cluster\n   * @return {Promise<BlockhashWithExpiryBlockHeight>}\n   */\n  async getLatestBlockhash(commitmentOrConfig) {\n    try {\n      const res = await this.getLatestBlockhashAndContext(commitmentOrConfig);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get recent blockhash: ' + e);\n    }\n  }\n\n  /**\n   * Fetch the latest blockhash from the cluster\n   * @return {Promise<BlockhashWithExpiryBlockHeight>}\n   */\n  async getLatestBlockhashAndContext(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getLatestBlockhash', args);\n    const res = create(unsafeRes, GetLatestBlockhashRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get latest blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Returns whether a blockhash is still valid or not\n   */\n  async isBlockhashValid(blockhash, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgs([blockhash], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('isBlockhashValid', args);\n    const res = create(unsafeRes, IsBlockhashValidRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to determine if the blockhash `' + blockhash + '`is valid');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the node version\n   */\n  async getVersion() {\n    const unsafeRes = await this._rpcRequest('getVersion', []);\n    const res = create(unsafeRes, jsonRpcResult(VersionResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get version');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the genesis hash\n   */\n  async getGenesisHash() {\n    const unsafeRes = await this._rpcRequest('getGenesisHash', []);\n    const res = create(unsafeRes, jsonRpcResult(string()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get genesis hash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a processed block from the cluster.\n   *\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a processed block from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a processed block from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getBlock(slot, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    try {\n      switch (config?.transactionDetails) {\n        case 'accounts':\n          {\n            const res = create(unsafeRes, GetAccountsModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        case 'none':\n          {\n            const res = create(unsafeRes, GetNoneModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        default:\n          {\n            const res = create(unsafeRes, GetBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            const {\n              result\n            } = res;\n            return result ? {\n              ...result,\n              transactions: result.transactions.map(({\n                transaction,\n                meta,\n                version\n              }) => ({\n                meta,\n                transaction: {\n                  ...transaction,\n                  message: versionedMessageFromResponse(version, transaction.message)\n                },\n                version\n              }))\n            } : null;\n          }\n      }\n    } catch (e) {\n      throw new SolanaJSONRPCError(e, 'failed to get confirmed block');\n    }\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed or finalized block\n   */\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async getParsedBlock(slot, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    try {\n      switch (config?.transactionDetails) {\n        case 'accounts':\n          {\n            const res = create(unsafeRes, GetParsedAccountsModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        case 'none':\n          {\n            const res = create(unsafeRes, GetParsedNoneModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        default:\n          {\n            const res = create(unsafeRes, GetParsedBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n      }\n    } catch (e) {\n      throw new SolanaJSONRPCError(e, 'failed to get block');\n    }\n  }\n  /*\n   * Returns recent block production information from the current or previous epoch\n   */\n  async getBlockProduction(configOrCommitment) {\n    let extra;\n    let commitment;\n    if (typeof configOrCommitment === 'string') {\n      commitment = configOrCommitment;\n    } else if (configOrCommitment) {\n      const {\n        commitment: c,\n        ...rest\n      } = configOrCommitment;\n      commitment = c;\n      extra = rest;\n    }\n    const args = this._buildArgs([], commitment, 'base64', extra);\n    const unsafeRes = await this._rpcRequest('getBlockProduction', args);\n    const res = create(unsafeRes, BlockProductionResponseStruct);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get block production information');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   *\n   * @deprecated Instead, call `getTransaction` using a\n   * `GetVersionedTransactionConfig` by setting the\n   * `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getTransaction(signature, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getTransaction', args);\n    const res = create(unsafeRes, GetTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    const result = res.result;\n    if (!result) return result;\n    return {\n      ...result,\n      transaction: {\n        ...result.transaction,\n        message: versionedMessageFromResponse(result.version, result.transaction.message)\n      }\n    };\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed or finalized transaction\n   */\n  async getParsedTransaction(signature, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getTransaction', args);\n    const res = create(unsafeRes, GetParsedTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed transaction details for a batch of confirmed transactions\n   */\n  async getParsedTransactions(signatures, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed', config);\n      return {\n        methodName: 'getTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetParsedTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get transactions');\n      }\n      return res.result;\n    });\n    return res;\n  }\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link TransactionResponse}.\n   *\n   * @deprecated Instead, call `getTransactions` using a\n   * `GetVersionedTransactionConfig` by setting the\n   * `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link\n   * VersionedTransactionResponse}.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link\n   * VersionedTransactionResponse}.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getTransactions(signatures, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, undefined /* encoding */, config);\n      return {\n        methodName: 'getTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get transactions');\n      }\n      const result = res.result;\n      if (!result) return result;\n      return {\n        ...result,\n        transaction: {\n          ...result.transaction,\n          message: versionedMessageFromResponse(result.version, result.transaction.message)\n        }\n      };\n    });\n    return res;\n  }\n\n  /**\n   * Fetch a list of Transactions and transaction statuses from the cluster\n   * for a confirmed block.\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getBlock} instead.\n   */\n  async getConfirmedBlock(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment);\n    const unsafeRes = await this._rpcRequest('getConfirmedBlock', args);\n    const res = create(unsafeRes, GetConfirmedBlockRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Confirmed block ' + slot + ' not found');\n    }\n    const block = {\n      ...result,\n      transactions: result.transactions.map(({\n        transaction,\n        meta\n      }) => {\n        const message = new Message(transaction.message);\n        return {\n          meta,\n          transaction: {\n            ...transaction,\n            message\n          }\n        };\n      })\n    };\n    return {\n      ...block,\n      transactions: block.transactions.map(({\n        transaction,\n        meta\n      }) => {\n        return {\n          meta,\n          transaction: Transaction.populate(transaction.message, transaction.signatures)\n        };\n      })\n    };\n  }\n\n  /**\n   * Fetch confirmed blocks between two slots\n   */\n  async getBlocks(startSlot, endSlot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed(endSlot !== undefined ? [startSlot, endSlot] : [startSlot], commitment);\n    const unsafeRes = await this._rpcRequest('getBlocks', args);\n    const res = create(unsafeRes, jsonRpcResult(array(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get blocks');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a list of Signatures from the cluster for a block, excluding rewards\n   */\n  async getBlockSignatures(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined, {\n      transactionDetails: 'signatures',\n      rewards: false\n    });\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    const res = create(unsafeRes, GetBlockSignaturesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Block ' + slot + ' not found');\n    }\n    return result;\n  }\n\n  /**\n   * Fetch a list of Signatures from the cluster for a confirmed block, excluding rewards\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getBlockSignatures} instead.\n   */\n  async getConfirmedBlockSignatures(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined, {\n      transactionDetails: 'signatures',\n      rewards: false\n    });\n    const unsafeRes = await this._rpcRequest('getConfirmedBlock', args);\n    const res = create(unsafeRes, GetBlockSignaturesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Confirmed block ' + slot + ' not found');\n    }\n    return result;\n  }\n\n  /**\n   * Fetch a transaction details for a confirmed transaction\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getTransaction} instead.\n   */\n  async getConfirmedTransaction(signature, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment);\n    const unsafeRes = await this._rpcRequest('getConfirmedTransaction', args);\n    const res = create(unsafeRes, GetTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    const result = res.result;\n    if (!result) return result;\n    const message = new Message(result.transaction.message);\n    const signatures = result.transaction.signatures;\n    return {\n      ...result,\n      transaction: Transaction.populate(message, signatures)\n    };\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed transaction\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getParsedTransaction} instead.\n   */\n  async getParsedConfirmedTransaction(signature, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed');\n    const unsafeRes = await this._rpcRequest('getConfirmedTransaction', args);\n    const res = create(unsafeRes, GetParsedTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed transaction');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed transaction details for a batch of confirmed transactions\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getParsedTransactions} instead.\n   */\n  async getParsedConfirmedTransactions(signatures, commitment) {\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed');\n      return {\n        methodName: 'getConfirmedTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetParsedTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get confirmed transactions');\n      }\n      return res.result;\n    });\n    return res;\n  }\n\n  /**\n   * Fetch a list of all the confirmed signatures for transactions involving an address\n   * within a specified slot range. Max range allowed is 10,000 slots.\n   *\n   * @deprecated Deprecated since RPC v1.3. Please use {@link getConfirmedSignaturesForAddress2} instead.\n   *\n   * @param address queried address\n   * @param startSlot start slot, inclusive\n   * @param endSlot end slot, inclusive\n   */\n  async getConfirmedSignaturesForAddress(address, startSlot, endSlot) {\n    let options = {};\n    let firstAvailableBlock = await this.getFirstAvailableBlock();\n    while (!('until' in options)) {\n      startSlot--;\n      if (startSlot <= 0 || startSlot < firstAvailableBlock) {\n        break;\n      }\n      try {\n        const block = await this.getConfirmedBlockSignatures(startSlot, 'finalized');\n        if (block.signatures.length > 0) {\n          options.until = block.signatures[block.signatures.length - 1].toString();\n        }\n      } catch (err) {\n        if (err instanceof Error && err.message.includes('skipped')) {\n          continue;\n        } else {\n          throw err;\n        }\n      }\n    }\n    let highestConfirmedRoot = await this.getSlot('finalized');\n    while (!('before' in options)) {\n      endSlot++;\n      if (endSlot > highestConfirmedRoot) {\n        break;\n      }\n      try {\n        const block = await this.getConfirmedBlockSignatures(endSlot);\n        if (block.signatures.length > 0) {\n          options.before = block.signatures[block.signatures.length - 1].toString();\n        }\n      } catch (err) {\n        if (err instanceof Error && err.message.includes('skipped')) {\n          continue;\n        } else {\n          throw err;\n        }\n      }\n    }\n    const confirmedSignatureInfo = await this.getConfirmedSignaturesForAddress2(address, options);\n    return confirmedSignatureInfo.map(info => info.signature);\n  }\n\n  /**\n   * Returns confirmed signatures for transactions involving an\n   * address backwards in time from the provided signature or most recent confirmed block\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getSignaturesForAddress} instead.\n   */\n  async getConfirmedSignaturesForAddress2(address, options, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([address.toBase58()], commitment, undefined, options);\n    const unsafeRes = await this._rpcRequest('getConfirmedSignaturesForAddress2', args);\n    const res = create(unsafeRes, GetConfirmedSignaturesForAddress2RpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed signatures for address');\n    }\n    return res.result;\n  }\n\n  /**\n   * Returns confirmed signatures for transactions involving an\n   * address backwards in time from the provided signature or most recent confirmed block\n   *\n   *\n   * @param address queried address\n   * @param options\n   */\n  async getSignaturesForAddress(address, options, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([address.toBase58()], commitment, undefined, options);\n    const unsafeRes = await this._rpcRequest('getSignaturesForAddress', args);\n    const res = create(unsafeRes, GetSignaturesForAddressRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get signatures for address');\n    }\n    return res.result;\n  }\n  async getAddressLookupTable(accountKey, config) {\n    const {\n      context,\n      value: accountInfo\n    } = await this.getAccountInfoAndContext(accountKey, config);\n    let value = null;\n    if (accountInfo !== null) {\n      value = new AddressLookupTableAccount({\n        key: accountKey,\n        state: AddressLookupTableAccount.deserialize(accountInfo.data)\n      });\n    }\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the contents of a Nonce account from the cluster, return with context\n   */\n  async getNonceAndContext(nonceAccount, commitmentOrConfig) {\n    const {\n      context,\n      value: accountInfo\n    } = await this.getAccountInfoAndContext(nonceAccount, commitmentOrConfig);\n    let value = null;\n    if (accountInfo !== null) {\n      value = NonceAccount.fromAccountData(accountInfo.data);\n    }\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the contents of a Nonce account from the cluster\n   */\n  async getNonce(nonceAccount, commitmentOrConfig) {\n    return await this.getNonceAndContext(nonceAccount, commitmentOrConfig).then(x => x.value).catch(e => {\n      throw new Error('failed to get nonce for account ' + nonceAccount.toBase58() + ': ' + e);\n    });\n  }\n\n  /**\n   * Request an allocation of lamports to the specified address\n   *\n   * ```typescript\n   * import { Connection, PublicKey, LAMPORTS_PER_SOL } from \"@solana/web3.js\";\n   *\n   * (async () => {\n   *   const connection = new Connection(\"https://api.testnet.solana.com\", \"confirmed\");\n   *   const myAddress = new PublicKey(\"2nr1bHFT86W9tGnyvmYW4vcHKsQB3sVQfnddasz4kExM\");\n   *   const signature = await connection.requestAirdrop(myAddress, LAMPORTS_PER_SOL);\n   *   await connection.confirmTransaction(signature);\n   * })();\n   * ```\n   */\n  async requestAirdrop(to, lamports) {\n    const unsafeRes = await this._rpcRequest('requestAirdrop', [to.toBase58(), lamports]);\n    const res = create(unsafeRes, RequestAirdropRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `airdrop to ${to.toBase58()} failed`);\n    }\n    return res.result;\n  }\n\n  /**\n   * @internal\n   */\n  async _blockhashWithExpiryBlockHeight(disableCache) {\n    if (!disableCache) {\n      // Wait for polling to finish\n      while (this._pollingBlockhash) {\n        await sleep(100);\n      }\n      const timeSinceFetch = Date.now() - this._blockhashInfo.lastFetch;\n      const expired = timeSinceFetch >= BLOCKHASH_CACHE_TIMEOUT_MS;\n      if (this._blockhashInfo.latestBlockhash !== null && !expired) {\n        return this._blockhashInfo.latestBlockhash;\n      }\n    }\n    return await this._pollNewBlockhash();\n  }\n\n  /**\n   * @internal\n   */\n  async _pollNewBlockhash() {\n    this._pollingBlockhash = true;\n    try {\n      const startTime = Date.now();\n      const cachedLatestBlockhash = this._blockhashInfo.latestBlockhash;\n      const cachedBlockhash = cachedLatestBlockhash ? cachedLatestBlockhash.blockhash : null;\n      for (let i = 0; i < 50; i++) {\n        const latestBlockhash = await this.getLatestBlockhash('finalized');\n        if (cachedBlockhash !== latestBlockhash.blockhash) {\n          this._blockhashInfo = {\n            latestBlockhash,\n            lastFetch: Date.now(),\n            transactionSignatures: [],\n            simulatedSignatures: []\n          };\n          return latestBlockhash;\n        }\n\n        // Sleep for approximately half a slot\n        await sleep(MS_PER_SLOT / 2);\n      }\n      throw new Error(`Unable to obtain a new blockhash after ${Date.now() - startTime}ms`);\n    } finally {\n      this._pollingBlockhash = false;\n    }\n  }\n\n  /**\n   * get the stake minimum delegation\n   */\n  async getStakeMinimumDelegation(config) {\n    const {\n      commitment,\n      config: configArg\n    } = extractCommitmentFromConfig(config);\n    const args = this._buildArgs([], commitment, 'base64', configArg);\n    const unsafeRes = await this._rpcRequest('getStakeMinimumDelegation', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get stake minimum delegation`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Simulate a transaction\n   *\n   * @deprecated Instead, call {@link simulateTransaction} with {@link\n   * VersionedTransaction} and {@link SimulateTransactionConfig} parameters\n   */\n\n  /**\n   * Simulate a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Simulate a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async simulateTransaction(transactionOrMessage, configOrSigners, includeAccounts) {\n    if ('message' in transactionOrMessage) {\n      const versionedTx = transactionOrMessage;\n      const wireTransaction = versionedTx.serialize();\n      const encodedTransaction = Buffer.from(wireTransaction).toString('base64');\n      if (Array.isArray(configOrSigners) || includeAccounts !== undefined) {\n        throw new Error('Invalid arguments');\n      }\n      const config = configOrSigners || {};\n      config.encoding = 'base64';\n      if (!('commitment' in config)) {\n        config.commitment = this.commitment;\n      }\n      if (configOrSigners && typeof configOrSigners === 'object' && 'innerInstructions' in configOrSigners) {\n        config.innerInstructions = configOrSigners.innerInstructions;\n      }\n      const args = [encodedTransaction, config];\n      const unsafeRes = await this._rpcRequest('simulateTransaction', args);\n      const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n      if ('error' in res) {\n        throw new Error('failed to simulate transaction: ' + res.error.message);\n      }\n      return res.result;\n    }\n    let transaction;\n    if (transactionOrMessage instanceof Transaction) {\n      let originalTx = transactionOrMessage;\n      transaction = new Transaction();\n      transaction.feePayer = originalTx.feePayer;\n      transaction.instructions = transactionOrMessage.instructions;\n      transaction.nonceInfo = originalTx.nonceInfo;\n      transaction.signatures = originalTx.signatures;\n    } else {\n      transaction = Transaction.populate(transactionOrMessage);\n      // HACK: this function relies on mutating the populated transaction\n      transaction._message = transaction._json = undefined;\n    }\n    if (configOrSigners !== undefined && !Array.isArray(configOrSigners)) {\n      throw new Error('Invalid arguments');\n    }\n    const signers = configOrSigners;\n    if (transaction.nonceInfo && signers) {\n      transaction.sign(...signers);\n    } else {\n      let disableCache = this._disableBlockhashCaching;\n      for (;;) {\n        const latestBlockhash = await this._blockhashWithExpiryBlockHeight(disableCache);\n        transaction.lastValidBlockHeight = latestBlockhash.lastValidBlockHeight;\n        transaction.recentBlockhash = latestBlockhash.blockhash;\n        if (!signers) break;\n        transaction.sign(...signers);\n        if (!transaction.signature) {\n          throw new Error('!signature'); // should never happen\n        }\n        const signature = transaction.signature.toString('base64');\n        if (!this._blockhashInfo.simulatedSignatures.includes(signature) && !this._blockhashInfo.transactionSignatures.includes(signature)) {\n          // The signature of this transaction has not been seen before with the\n          // current recentBlockhash, all done. Let's break\n          this._blockhashInfo.simulatedSignatures.push(signature);\n          break;\n        } else {\n          // This transaction would be treated as duplicate (its derived signature\n          // matched to one of already recorded signatures).\n          // So, we must fetch a new blockhash for a different signature by disabling\n          // our cache not to wait for the cache expiration (BLOCKHASH_CACHE_TIMEOUT_MS).\n          disableCache = true;\n        }\n      }\n    }\n    const message = transaction._compile();\n    const signData = message.serialize();\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString('base64');\n    const config = {\n      encoding: 'base64',\n      commitment: this.commitment\n    };\n    if (includeAccounts) {\n      const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map(key => key.toBase58());\n      config['accounts'] = {\n        encoding: 'base64',\n        addresses\n      };\n    }\n    if (signers) {\n      config.sigVerify = true;\n    }\n    if (configOrSigners && typeof configOrSigners === 'object' && 'innerInstructions' in configOrSigners) {\n      config.innerInstructions = configOrSigners.innerInstructions;\n    }\n    const args = [encodedTransaction, config];\n    const unsafeRes = await this._rpcRequest('simulateTransaction', args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if ('error' in res) {\n      let logs;\n      if ('data' in res.error) {\n        logs = res.error.data.logs;\n        if (logs && Array.isArray(logs)) {\n          const traceIndent = '\\n    ';\n          const logTrace = traceIndent + logs.join(traceIndent);\n          console.error(res.error.message, logTrace);\n        }\n      }\n      throw new SendTransactionError({\n        action: 'simulate',\n        signature: '',\n        transactionMessage: res.error.message,\n        logs: logs\n      });\n    }\n    return res.result;\n  }\n\n  /**\n   * Sign and send a transaction\n   *\n   * @deprecated Instead, call {@link sendTransaction} with a {@link\n   * VersionedTransaction}\n   */\n\n  /**\n   * Send a signed transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Sign and send a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async sendTransaction(transaction, signersOrOptions, options) {\n    if ('version' in transaction) {\n      if (signersOrOptions && Array.isArray(signersOrOptions)) {\n        throw new Error('Invalid arguments');\n      }\n      const wireTransaction = transaction.serialize();\n      return await this.sendRawTransaction(wireTransaction, signersOrOptions);\n    }\n    if (signersOrOptions === undefined || !Array.isArray(signersOrOptions)) {\n      throw new Error('Invalid arguments');\n    }\n    const signers = signersOrOptions;\n    if (transaction.nonceInfo) {\n      transaction.sign(...signers);\n    } else {\n      let disableCache = this._disableBlockhashCaching;\n      for (;;) {\n        const latestBlockhash = await this._blockhashWithExpiryBlockHeight(disableCache);\n        transaction.lastValidBlockHeight = latestBlockhash.lastValidBlockHeight;\n        transaction.recentBlockhash = latestBlockhash.blockhash;\n        transaction.sign(...signers);\n        if (!transaction.signature) {\n          throw new Error('!signature'); // should never happen\n        }\n        const signature = transaction.signature.toString('base64');\n        if (!this._blockhashInfo.transactionSignatures.includes(signature)) {\n          // The signature of this transaction has not been seen before with the\n          // current recentBlockhash, all done. Let's break\n          this._blockhashInfo.transactionSignatures.push(signature);\n          break;\n        } else {\n          // This transaction would be treated as duplicate (its derived signature\n          // matched to one of already recorded signatures).\n          // So, we must fetch a new blockhash for a different signature by disabling\n          // our cache not to wait for the cache expiration (BLOCKHASH_CACHE_TIMEOUT_MS).\n          disableCache = true;\n        }\n      }\n    }\n    const wireTransaction = transaction.serialize();\n    return await this.sendRawTransaction(wireTransaction, options);\n  }\n\n  /**\n   * Send a transaction that has already been signed and serialized into the\n   * wire format\n   */\n  async sendRawTransaction(rawTransaction, options) {\n    const encodedTransaction = toBuffer(rawTransaction).toString('base64');\n    const result = await this.sendEncodedTransaction(encodedTransaction, options);\n    return result;\n  }\n\n  /**\n   * Send a transaction that has already been signed, serialized into the\n   * wire format, and encoded as a base64 string\n   */\n  async sendEncodedTransaction(encodedTransaction, options) {\n    const config = {\n      encoding: 'base64'\n    };\n    const skipPreflight = options && options.skipPreflight;\n    const preflightCommitment = skipPreflight === true ? 'processed' // FIXME Remove when https://github.com/anza-xyz/agave/pull/483 is deployed.\n    : options && options.preflightCommitment || this.commitment;\n    if (options && options.maxRetries != null) {\n      config.maxRetries = options.maxRetries;\n    }\n    if (options && options.minContextSlot != null) {\n      config.minContextSlot = options.minContextSlot;\n    }\n    if (skipPreflight) {\n      config.skipPreflight = skipPreflight;\n    }\n    if (preflightCommitment) {\n      config.preflightCommitment = preflightCommitment;\n    }\n    const args = [encodedTransaction, config];\n    const unsafeRes = await this._rpcRequest('sendTransaction', args);\n    const res = create(unsafeRes, SendTransactionRpcResult);\n    if ('error' in res) {\n      let logs = undefined;\n      if ('data' in res.error) {\n        logs = res.error.data.logs;\n      }\n      throw new SendTransactionError({\n        action: skipPreflight ? 'send' : 'simulate',\n        signature: '',\n        transactionMessage: res.error.message,\n        logs: logs\n      });\n    }\n    return res.result;\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnOpen() {\n    this._rpcWebSocketConnected = true;\n    this._rpcWebSocketHeartbeat = setInterval(() => {\n      // Ping server every 5s to prevent idle timeouts\n      (async () => {\n        try {\n          await this._rpcWebSocket.notify('ping');\n          // eslint-disable-next-line no-empty\n        } catch {}\n      })();\n    }, 5000);\n    this._updateSubscriptions();\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnError(err) {\n    this._rpcWebSocketConnected = false;\n    console.error('ws error:', err.message);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnClose(code) {\n    this._rpcWebSocketConnected = false;\n    this._rpcWebSocketGeneration = (this._rpcWebSocketGeneration + 1) % Number.MAX_SAFE_INTEGER;\n    if (this._rpcWebSocketIdleTimeout) {\n      clearTimeout(this._rpcWebSocketIdleTimeout);\n      this._rpcWebSocketIdleTimeout = null;\n    }\n    if (this._rpcWebSocketHeartbeat) {\n      clearInterval(this._rpcWebSocketHeartbeat);\n      this._rpcWebSocketHeartbeat = null;\n    }\n    if (code === 1000) {\n      // explicit close, check if any subscriptions have been made since close\n      this._updateSubscriptions();\n      return;\n    }\n\n    // implicit close, prepare subscriptions for auto-reconnect\n    this._subscriptionCallbacksByServerSubscriptionId = {};\n    Object.entries(this._subscriptionsByHash).forEach(([hash, subscription]) => {\n      this._setSubscription(hash, {\n        ...subscription,\n        state: 'pending'\n      });\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _setSubscription(hash, nextSubscription) {\n    const prevState = this._subscriptionsByHash[hash]?.state;\n    this._subscriptionsByHash[hash] = nextSubscription;\n    if (prevState !== nextSubscription.state) {\n      const stateChangeCallbacks = this._subscriptionStateChangeCallbacksByHash[hash];\n      if (stateChangeCallbacks) {\n        stateChangeCallbacks.forEach(cb => {\n          try {\n            cb(nextSubscription.state);\n            // eslint-disable-next-line no-empty\n          } catch {}\n        });\n      }\n    }\n  }\n\n  /**\n   * @internal\n   */\n  _onSubscriptionStateChange(clientSubscriptionId, callback) {\n    const hash = this._subscriptionHashByClientSubscriptionId[clientSubscriptionId];\n    if (hash == null) {\n      return () => {};\n    }\n    const stateChangeCallbacks = this._subscriptionStateChangeCallbacksByHash[hash] ||= new Set();\n    stateChangeCallbacks.add(callback);\n    return () => {\n      stateChangeCallbacks.delete(callback);\n      if (stateChangeCallbacks.size === 0) {\n        delete this._subscriptionStateChangeCallbacksByHash[hash];\n      }\n    };\n  }\n\n  /**\n   * @internal\n   */\n  async _updateSubscriptions() {\n    if (Object.keys(this._subscriptionsByHash).length === 0) {\n      if (this._rpcWebSocketConnected) {\n        this._rpcWebSocketConnected = false;\n        this._rpcWebSocketIdleTimeout = setTimeout(() => {\n          this._rpcWebSocketIdleTimeout = null;\n          try {\n            this._rpcWebSocket.close();\n          } catch (err) {\n            // swallow error if socket has already been closed.\n            if (err instanceof Error) {\n              console.log(`Error when closing socket connection: ${err.message}`);\n            }\n          }\n        }, 500);\n      }\n      return;\n    }\n    if (this._rpcWebSocketIdleTimeout !== null) {\n      clearTimeout(this._rpcWebSocketIdleTimeout);\n      this._rpcWebSocketIdleTimeout = null;\n      this._rpcWebSocketConnected = true;\n    }\n    if (!this._rpcWebSocketConnected) {\n      this._rpcWebSocket.connect();\n      return;\n    }\n    const activeWebSocketGeneration = this._rpcWebSocketGeneration;\n    const isCurrentConnectionStillActive = () => {\n      return activeWebSocketGeneration === this._rpcWebSocketGeneration;\n    };\n    await Promise.all(\n    // Don't be tempted to change this to `Object.entries`. We call\n    // `_updateSubscriptions` recursively when processing the state,\n    // so it's important that we look up the *current* version of\n    // each subscription, every time we process a hash.\n    Object.keys(this._subscriptionsByHash).map(async hash => {\n      const subscription = this._subscriptionsByHash[hash];\n      if (subscription === undefined) {\n        // This entry has since been deleted. Skip.\n        return;\n      }\n      switch (subscription.state) {\n        case 'pending':\n        case 'unsubscribed':\n          if (subscription.callbacks.size === 0) {\n            /**\n             * You can end up here when:\n             *\n             * - a subscription has recently unsubscribed\n             *   without having new callbacks added to it\n             *   while the unsubscribe was in flight, or\n             * - when a pending subscription has its\n             *   listeners removed before a request was\n             *   sent to the server.\n             *\n             * Being that nobody is interested in this\n             * subscription any longer, delete it.\n             */\n            delete this._subscriptionsByHash[hash];\n            if (subscription.state === 'unsubscribed') {\n              delete this._subscriptionCallbacksByServerSubscriptionId[subscription.serverSubscriptionId];\n            }\n            await this._updateSubscriptions();\n            return;\n          }\n          await (async () => {\n            const {\n              args,\n              method\n            } = subscription;\n            try {\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'subscribing'\n              });\n              const serverSubscriptionId = await this._rpcWebSocket.call(method, args);\n              this._setSubscription(hash, {\n                ...subscription,\n                serverSubscriptionId,\n                state: 'subscribed'\n              });\n              this._subscriptionCallbacksByServerSubscriptionId[serverSubscriptionId] = subscription.callbacks;\n              await this._updateSubscriptions();\n            } catch (e) {\n              if (e instanceof Error) {\n                console.error(`${method} error for argument`, args, e.message);\n              }\n              if (!isCurrentConnectionStillActive()) {\n                return;\n              }\n              // TODO: Maybe add an 'errored' state or a retry limit?\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'pending'\n              });\n              await this._updateSubscriptions();\n            }\n          })();\n          break;\n        case 'subscribed':\n          if (subscription.callbacks.size === 0) {\n            // By the time we successfully set up a subscription\n            // with the server, the client stopped caring about it.\n            // Tear it down now.\n            await (async () => {\n              const {\n                serverSubscriptionId,\n                unsubscribeMethod\n              } = subscription;\n              if (this._subscriptionsAutoDisposedByRpc.has(serverSubscriptionId)) {\n                /**\n                 * Special case.\n                 * If we're dealing with a subscription that has been auto-\n                 * disposed by the RPC, then we can skip the RPC call to\n                 * tear down the subscription here.\n                 *\n                 * NOTE: There is a proposal to eliminate this special case, here:\n                 * https://github.com/solana-labs/solana/issues/18892\n                 */\n                this._subscriptionsAutoDisposedByRpc.delete(serverSubscriptionId);\n              } else {\n                this._setSubscription(hash, {\n                  ...subscription,\n                  state: 'unsubscribing'\n                });\n                this._setSubscription(hash, {\n                  ...subscription,\n                  state: 'unsubscribing'\n                });\n                try {\n                  await this._rpcWebSocket.call(unsubscribeMethod, [serverSubscriptionId]);\n                } catch (e) {\n                  if (e instanceof Error) {\n                    console.error(`${unsubscribeMethod} error:`, e.message);\n                  }\n                  if (!isCurrentConnectionStillActive()) {\n                    return;\n                  }\n                  // TODO: Maybe add an 'errored' state or a retry limit?\n                  this._setSubscription(hash, {\n                    ...subscription,\n                    state: 'subscribed'\n                  });\n                  await this._updateSubscriptions();\n                  return;\n                }\n              }\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'unsubscribed'\n              });\n              await this._updateSubscriptions();\n            })();\n          }\n          break;\n      }\n    }));\n  }\n\n  /**\n   * @internal\n   */\n  _handleServerNotification(serverSubscriptionId, callbackArgs) {\n    const callbacks = this._subscriptionCallbacksByServerSubscriptionId[serverSubscriptionId];\n    if (callbacks === undefined) {\n      return;\n    }\n    callbacks.forEach(cb => {\n      try {\n        cb(\n        // I failed to find a way to convince TypeScript that `cb` is of type\n        // `TCallback` which is certainly compatible with `Parameters<TCallback>`.\n        // See https://github.com/microsoft/TypeScript/issues/47615\n        // @ts-ignore\n        ...callbackArgs);\n      } catch (e) {\n        console.error(e);\n      }\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnAccountNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, AccountNotificationResult);\n    this._handleServerNotification(subscription, [result.value, result.context]);\n  }\n\n  /**\n   * @internal\n   */\n  _makeSubscription(subscriptionConfig,\n  /**\n   * When preparing `args` for a call to `_makeSubscription`, be sure\n   * to carefully apply a default `commitment` property, if necessary.\n   *\n   * - If the user supplied a `commitment` use that.\n   * - Otherwise, if the `Connection::commitment` is set, use that.\n   * - Otherwise, set it to the RPC server default: `finalized`.\n   *\n   * This is extremely important to ensure that these two fundamentally\n   * identical subscriptions produce the same identifying hash:\n   *\n   * - A subscription made without specifying a commitment.\n   * - A subscription made where the commitment specified is the same\n   *   as the default applied to the subscription above.\n   *\n   * Example; these two subscriptions must produce the same hash:\n   *\n   * - An `accountSubscribe` subscription for `'PUBKEY'`\n   * - An `accountSubscribe` subscription for `'PUBKEY'` with commitment\n   *   `'finalized'`.\n   *\n   * See the 'making a subscription with defaulted params omitted' test\n   * in `connection-subscriptions.ts` for more.\n   */\n  args) {\n    const clientSubscriptionId = this._nextClientSubscriptionId++;\n    const hash = fastStableStringify$1([subscriptionConfig.method, args]);\n    const existingSubscription = this._subscriptionsByHash[hash];\n    if (existingSubscription === undefined) {\n      this._subscriptionsByHash[hash] = {\n        ...subscriptionConfig,\n        args,\n        callbacks: new Set([subscriptionConfig.callback]),\n        state: 'pending'\n      };\n    } else {\n      existingSubscription.callbacks.add(subscriptionConfig.callback);\n    }\n    this._subscriptionHashByClientSubscriptionId[clientSubscriptionId] = hash;\n    this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId] = async () => {\n      delete this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId];\n      delete this._subscriptionHashByClientSubscriptionId[clientSubscriptionId];\n      const subscription = this._subscriptionsByHash[hash];\n      assert(subscription !== undefined, `Could not find a \\`Subscription\\` when tearing down client subscription #${clientSubscriptionId}`);\n      subscription.callbacks.delete(subscriptionConfig.callback);\n      await this._updateSubscriptions();\n    };\n    this._updateSubscriptions();\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Register a callback to be invoked whenever the specified account changes\n   *\n   * @param publicKey Public key of the account to monitor\n   * @param callback Function to invoke whenever the account is changed\n   * @param config\n   * @return subscription id\n   */\n\n  /** @deprecated Instead, pass in an {@link AccountSubscriptionConfig} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  onAccountChange(publicKey, callback, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment || this._commitment || 'finalized',\n    // Apply connection/server default.\n    'base64', config);\n    return this._makeSubscription({\n      callback,\n      method: 'accountSubscribe',\n      unsubscribeMethod: 'accountUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister an account notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeAccountChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'account change');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnProgramAccountNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, ProgramAccountNotificationResult);\n    this._handleServerNotification(subscription, [{\n      accountId: result.value.pubkey,\n      accountInfo: result.value.account\n    }, result.context]);\n  }\n\n  /**\n   * Register a callback to be invoked whenever accounts owned by the\n   * specified program change\n   *\n   * @param programId Public key of the program to monitor\n   * @param callback Function to invoke whenever the account is changed\n   * @param config\n   * @return subscription id\n   */\n\n  /** @deprecated Instead, pass in a {@link ProgramAccountSubscriptionConfig} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  onProgramAccountChange(programId, callback, commitmentOrConfig, maybeFilters) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([programId.toBase58()], commitment || this._commitment || 'finalized',\n    // Apply connection/server default.\n    'base64' /* encoding */, config ? config : maybeFilters ? {\n      filters: maybeFilters\n    } : undefined /* extra */);\n    return this._makeSubscription({\n      callback,\n      method: 'programSubscribe',\n      unsubscribeMethod: 'programUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister an account notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeProgramAccountChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'program account change');\n  }\n\n  /**\n   * Registers a callback to be invoked whenever logs are emitted.\n   */\n  onLogs(filter, callback, commitment) {\n    const args = this._buildArgs([typeof filter === 'object' ? {\n      mentions: [filter.toString()]\n    } : filter], commitment || this._commitment || 'finalized' // Apply connection/server default.\n    );\n    return this._makeSubscription({\n      callback,\n      method: 'logsSubscribe',\n      unsubscribeMethod: 'logsUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister a logs callback.\n   *\n   * @param clientSubscriptionId client subscription id to deregister.\n   */\n  async removeOnLogsListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'logs');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnLogsNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, LogsNotificationResult);\n    this._handleServerNotification(subscription, [result.value, result.context]);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSlotNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SlotNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon slot changes\n   *\n   * @param callback Function to invoke whenever the slot changes\n   * @return subscription id\n   */\n  onSlotChange(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'slotSubscribe',\n      unsubscribeMethod: 'slotUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a slot notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSlotChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'slot change');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSlotUpdatesNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SlotUpdateNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon slot updates. {@link SlotUpdate}'s\n   * may be useful to track live progress of a cluster.\n   *\n   * @param callback Function to invoke whenever the slot updates\n   * @return subscription id\n   */\n  onSlotUpdate(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'slotsUpdatesSubscribe',\n      unsubscribeMethod: 'slotsUpdatesUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a slot update notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSlotUpdateListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'slot update');\n  }\n\n  /**\n   * @internal\n   */\n\n  async _unsubscribeClientSubscription(clientSubscriptionId, subscriptionName) {\n    const dispose = this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId];\n    if (dispose) {\n      await dispose();\n    } else {\n      console.warn('Ignored unsubscribe request because an active subscription with id ' + `\\`${clientSubscriptionId}\\` for '${subscriptionName}' events ` + 'could not be found.');\n    }\n  }\n  _buildArgs(args, override, encoding, extra) {\n    const commitment = override || this._commitment;\n    if (commitment || encoding || extra) {\n      let options = {};\n      if (encoding) {\n        options.encoding = encoding;\n      }\n      if (commitment) {\n        options.commitment = commitment;\n      }\n      if (extra) {\n        options = Object.assign(options, extra);\n      }\n      args.push(options);\n    }\n    return args;\n  }\n\n  /**\n   * @internal\n   */\n  _buildArgsAtLeastConfirmed(args, override, encoding, extra) {\n    const commitment = override || this._commitment;\n    if (commitment && !['confirmed', 'finalized'].includes(commitment)) {\n      throw new Error('Using Connection with default commitment: `' + this._commitment + '`, but method requires at least `confirmed`');\n    }\n    return this._buildArgs(args, override, encoding, extra);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSignatureNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SignatureNotificationResult);\n    if (result.value !== 'receivedSignature') {\n      /**\n       * Special case.\n       * After a signature is processed, RPCs automatically dispose of the\n       * subscription on the server side. We need to track which of these\n       * subscriptions have been disposed in such a way, so that we know\n       * whether the client is dealing with a not-yet-processed signature\n       * (in which case we must tear down the server subscription) or an\n       * already-processed signature (in which case the client can simply\n       * clear out the subscription locally without telling the server).\n       *\n       * NOTE: There is a proposal to eliminate this special case, here:\n       * https://github.com/solana-labs/solana/issues/18892\n       */\n      this._subscriptionsAutoDisposedByRpc.add(subscription);\n    }\n    this._handleServerNotification(subscription, result.value === 'receivedSignature' ? [{\n      type: 'received'\n    }, result.context] : [{\n      type: 'status',\n      result: result.value\n    }, result.context]);\n  }\n\n  /**\n   * Register a callback to be invoked upon signature updates\n   *\n   * @param signature Transaction signature string in base 58\n   * @param callback Function to invoke on signature notifications\n   * @param commitment Specify the commitment level signature must reach before notification\n   * @return subscription id\n   */\n  onSignature(signature, callback, commitment) {\n    const args = this._buildArgs([signature], commitment || this._commitment || 'finalized' // Apply connection/server default.\n    );\n    const clientSubscriptionId = this._makeSubscription({\n      callback: (notification, context) => {\n        if (notification.type === 'status') {\n          callback(notification.result, context);\n          // Signatures subscriptions are auto-removed by the RPC service\n          // so no need to explicitly send an unsubscribe message.\n          try {\n            this.removeSignatureListener(clientSubscriptionId);\n            // eslint-disable-next-line no-empty\n          } catch (_err) {\n            // Already removed.\n          }\n        }\n      },\n      method: 'signatureSubscribe',\n      unsubscribeMethod: 'signatureUnsubscribe'\n    }, args);\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Register a callback to be invoked when a transaction is\n   * received and/or processed.\n   *\n   * @param signature Transaction signature string in base 58\n   * @param callback Function to invoke on signature notifications\n   * @param options Enable received notifications and set the commitment\n   *   level that signature must reach before notification\n   * @return subscription id\n   */\n  onSignatureWithOptions(signature, callback, options) {\n    const {\n      commitment,\n      ...extra\n    } = {\n      ...options,\n      commitment: options && options.commitment || this._commitment || 'finalized' // Apply connection/server default.\n    };\n    const args = this._buildArgs([signature], commitment, undefined /* encoding */, extra);\n    const clientSubscriptionId = this._makeSubscription({\n      callback: (notification, context) => {\n        callback(notification, context);\n        // Signatures subscriptions are auto-removed by the RPC service\n        // so no need to explicitly send an unsubscribe message.\n        try {\n          this.removeSignatureListener(clientSubscriptionId);\n          // eslint-disable-next-line no-empty\n        } catch (_err) {\n          // Already removed.\n        }\n      },\n      method: 'signatureSubscribe',\n      unsubscribeMethod: 'signatureUnsubscribe'\n    }, args);\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Deregister a signature notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSignatureListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'signature result');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnRootNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, RootNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon root changes\n   *\n   * @param callback Function to invoke whenever the root changes\n   * @return subscription id\n   */\n  onRootChange(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'rootSubscribe',\n      unsubscribeMethod: 'rootUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a root notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeRootChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'root change');\n  }\n}\n\n/**\n * Keypair signer interface\n */\n\n/**\n * An account keypair used for signing transactions.\n */\nclass Keypair {\n  /**\n   * Create a new keypair instance.\n   * Generate random keypair if no {@link Ed25519Keypair} is provided.\n   *\n   * @param {Ed25519Keypair} keypair ed25519 keypair\n   */\n  constructor(keypair) {\n    this._keypair = void 0;\n    this._keypair = keypair ?? generateKeypair();\n  }\n\n  /**\n   * Generate a new random keypair\n   *\n   * @returns {Keypair} Keypair\n   */\n  static generate() {\n    return new Keypair(generateKeypair());\n  }\n\n  /**\n   * Create a keypair from a raw secret key byte array.\n   *\n   * This method should only be used to recreate a keypair from a previously\n   * generated secret key. Generating keypairs from a random seed should be done\n   * with the {@link Keypair.fromSeed} method.\n   *\n   * @throws error if the provided secret key is invalid and validation is not skipped.\n   *\n   * @param secretKey secret key byte array\n   * @param options skip secret key validation\n   *\n   * @returns {Keypair} Keypair\n   */\n  static fromSecretKey(secretKey, options) {\n    if (secretKey.byteLength !== 64) {\n      throw new Error('bad secret key size');\n    }\n    const publicKey = secretKey.slice(32, 64);\n    if (!options || !options.skipValidation) {\n      const privateScalar = secretKey.slice(0, 32);\n      const computedPublicKey = getPublicKey(privateScalar);\n      for (let ii = 0; ii < 32; ii++) {\n        if (publicKey[ii] !== computedPublicKey[ii]) {\n          throw new Error('provided secretKey is invalid');\n        }\n      }\n    }\n    return new Keypair({\n      publicKey,\n      secretKey\n    });\n  }\n\n  /**\n   * Generate a keypair from a 32 byte seed.\n   *\n   * @param seed seed byte array\n   *\n   * @returns {Keypair} Keypair\n   */\n  static fromSeed(seed) {\n    const publicKey = getPublicKey(seed);\n    const secretKey = new Uint8Array(64);\n    secretKey.set(seed);\n    secretKey.set(publicKey, 32);\n    return new Keypair({\n      publicKey,\n      secretKey\n    });\n  }\n\n  /**\n   * The public key for this keypair\n   *\n   * @returns {PublicKey} PublicKey\n   */\n  get publicKey() {\n    return new PublicKey(this._keypair.publicKey);\n  }\n\n  /**\n   * The raw secret key for this keypair\n   * @returns {Uint8Array} Secret key in an array of Uint8 bytes\n   */\n  get secretKey() {\n    return new Uint8Array(this._keypair.secretKey);\n  }\n}\n\n/**\n * An enumeration of valid LookupTableInstructionType's\n */\n\n/**\n * An enumeration of valid address lookup table InstructionType's\n * @internal\n */\nconst LOOKUP_TABLE_INSTRUCTION_LAYOUTS = Object.freeze({\n  CreateLookupTable: {\n    index: 0,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), u64('recentSlot'), BufferLayout.u8('bumpSeed')])\n  },\n  FreezeLookupTable: {\n    index: 1,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  ExtendLookupTable: {\n    index: 2,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), u64(), BufferLayout.seq(publicKey(), BufferLayout.offset(BufferLayout.u32(), -8), 'addresses')])\n  },\n  DeactivateLookupTable: {\n    index: 3,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  CloseLookupTable: {\n    index: 4,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  }\n});\nclass AddressLookupTableInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = BufferLayout.u32('instruction');\n    const index = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [layoutType, layout] of Object.entries(LOOKUP_TABLE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == index) {\n        type = layoutType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Invalid Instruction. Should be a LookupTable Instruction');\n    }\n    return type;\n  }\n  static decodeCreateLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 4);\n    const {\n      recentSlot\n    } = decodeData$1(LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CreateLookupTable, instruction.data);\n    return {\n      authority: instruction.keys[1].pubkey,\n      payer: instruction.keys[2].pubkey,\n      recentSlot: Number(recentSlot)\n    };\n  }\n  static decodeExtendLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    if (instruction.keys.length < 2) {\n      throw new Error(`invalid instruction; found ${instruction.keys.length} keys, expected at least 2`);\n    }\n    const {\n      addresses\n    } = decodeData$1(LOOKUP_TABLE_INSTRUCTION_LAYOUTS.ExtendLookupTable, instruction.data);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey,\n      payer: instruction.keys.length > 2 ? instruction.keys[2].pubkey : undefined,\n      addresses: addresses.map(buffer => new PublicKey(buffer))\n    };\n  }\n  static decodeCloseLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 3);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey,\n      recipient: instruction.keys[2].pubkey\n    };\n  }\n  static decodeFreezeLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 2);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey\n    };\n  }\n  static decodeDeactivateLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 2);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(AddressLookupTableProgram.programId)) {\n      throw new Error('invalid instruction; programId is not AddressLookupTable Program');\n    }\n  }\n  /**\n   * @internal\n   */\n  static checkKeysLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\nclass AddressLookupTableProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n  static createLookupTable(params) {\n    const [lookupTableAddress, bumpSeed] = PublicKey.findProgramAddressSync([params.authority.toBuffer(), toBufferLE(BigInt(params.recentSlot), 8)], this.programId);\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CreateLookupTable;\n    const data = encodeData(type, {\n      recentSlot: BigInt(params.recentSlot),\n      bumpSeed: bumpSeed\n    });\n    const keys = [{\n      pubkey: lookupTableAddress,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: params.payer,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: SystemProgram.programId,\n      isSigner: false,\n      isWritable: false\n    }];\n    return [new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    }), lookupTableAddress];\n  }\n  static freezeLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.FreezeLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static extendLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.ExtendLookupTable;\n    const data = encodeData(type, {\n      addresses: params.addresses.map(addr => addr.toBytes())\n    });\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (params.payer) {\n      keys.push({\n        pubkey: params.payer,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: SystemProgram.programId,\n        isSigner: false,\n        isWritable: false\n      });\n    }\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static deactivateLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.DeactivateLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static closeLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CloseLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: params.recipient,\n      isSigner: false,\n      isWritable: true\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n}\nAddressLookupTableProgram.programId = new PublicKey('AddressLookupTab1e1111111111111111111111111');\n\n/**\n * Compute Budget Instruction class\n */\nclass ComputeBudgetInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a compute budget instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = BufferLayout.u8('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a ComputeBudgetInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode request units compute budget instruction and retrieve the instruction params.\n   */\n  static decodeRequestUnits(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      units,\n      additionalFee\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestUnits, instruction.data);\n    return {\n      units,\n      additionalFee\n    };\n  }\n\n  /**\n   * Decode request heap frame compute budget instruction and retrieve the instruction params.\n   */\n  static decodeRequestHeapFrame(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      bytes\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestHeapFrame, instruction.data);\n    return {\n      bytes\n    };\n  }\n\n  /**\n   * Decode set compute unit limit compute budget instruction and retrieve the instruction params.\n   */\n  static decodeSetComputeUnitLimit(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      units\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitLimit, instruction.data);\n    return {\n      units\n    };\n  }\n\n  /**\n   * Decode set compute unit price compute budget instruction and retrieve the instruction params.\n   */\n  static decodeSetComputeUnitPrice(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      microLamports\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitPrice, instruction.data);\n    return {\n      microLamports\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(ComputeBudgetProgram.programId)) {\n      throw new Error('invalid instruction; programId is not ComputeBudgetProgram');\n    }\n  }\n}\n\n/**\n * An enumeration of valid ComputeBudgetInstructionType's\n */\n\n/**\n * Request units instruction params\n */\n\n/**\n * Request heap frame instruction params\n */\n\n/**\n * Set compute unit limit instruction params\n */\n\n/**\n * Set compute unit price instruction params\n */\n\n/**\n * An enumeration of valid ComputeBudget InstructionType's\n * @internal\n */\nconst COMPUTE_BUDGET_INSTRUCTION_LAYOUTS = Object.freeze({\n  RequestUnits: {\n    index: 0,\n    layout: BufferLayout.struct([BufferLayout.u8('instruction'), BufferLayout.u32('units'), BufferLayout.u32('additionalFee')])\n  },\n  RequestHeapFrame: {\n    index: 1,\n    layout: BufferLayout.struct([BufferLayout.u8('instruction'), BufferLayout.u32('bytes')])\n  },\n  SetComputeUnitLimit: {\n    index: 2,\n    layout: BufferLayout.struct([BufferLayout.u8('instruction'), BufferLayout.u32('units')])\n  },\n  SetComputeUnitPrice: {\n    index: 3,\n    layout: BufferLayout.struct([BufferLayout.u8('instruction'), u64('microLamports')])\n  }\n});\n\n/**\n * Factory class for transaction instructions to interact with the Compute Budget program\n */\nclass ComputeBudgetProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Compute Budget program\n   */\n\n  /**\n   * @deprecated Instead, call {@link setComputeUnitLimit} and/or {@link setComputeUnitPrice}\n   */\n  static requestUnits(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestUnits;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static requestHeapFrame(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestHeapFrame;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static setComputeUnitLimit(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitLimit;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static setComputeUnitPrice(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitPrice;\n    const data = encodeData(type, {\n      microLamports: BigInt(params.microLamports)\n    });\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n}\nComputeBudgetProgram.programId = new PublicKey('ComputeBudget111111111111111111111111111111');\n\nconst PRIVATE_KEY_BYTES$1 = 64;\nconst PUBLIC_KEY_BYTES$1 = 32;\nconst SIGNATURE_BYTES = 64;\n\n/**\n * Params for creating an ed25519 instruction using a public key\n */\n\n/**\n * Params for creating an ed25519 instruction using a private key\n */\n\nconst ED25519_INSTRUCTION_LAYOUT = BufferLayout.struct([BufferLayout.u8('numSignatures'), BufferLayout.u8('padding'), BufferLayout.u16('signatureOffset'), BufferLayout.u16('signatureInstructionIndex'), BufferLayout.u16('publicKeyOffset'), BufferLayout.u16('publicKeyInstructionIndex'), BufferLayout.u16('messageDataOffset'), BufferLayout.u16('messageDataSize'), BufferLayout.u16('messageInstructionIndex')]);\nclass Ed25519Program {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the ed25519 program\n   */\n\n  /**\n   * Create an ed25519 instruction with a public key and signature. The\n   * public key must be a buffer that is 32 bytes long, and the signature\n   * must be a buffer of 64 bytes.\n   */\n  static createInstructionWithPublicKey(params) {\n    const {\n      publicKey,\n      message,\n      signature,\n      instructionIndex\n    } = params;\n    assert(publicKey.length === PUBLIC_KEY_BYTES$1, `Public Key must be ${PUBLIC_KEY_BYTES$1} bytes but received ${publicKey.length} bytes`);\n    assert(signature.length === SIGNATURE_BYTES, `Signature must be ${SIGNATURE_BYTES} bytes but received ${signature.length} bytes`);\n    const publicKeyOffset = ED25519_INSTRUCTION_LAYOUT.span;\n    const signatureOffset = publicKeyOffset + publicKey.length;\n    const messageDataOffset = signatureOffset + signature.length;\n    const numSignatures = 1;\n    const instructionData = Buffer.alloc(messageDataOffset + message.length);\n    const index = instructionIndex == null ? 0xffff // An index of `u16::MAX` makes it default to the current instruction.\n    : instructionIndex;\n    ED25519_INSTRUCTION_LAYOUT.encode({\n      numSignatures,\n      padding: 0,\n      signatureOffset,\n      signatureInstructionIndex: index,\n      publicKeyOffset,\n      publicKeyInstructionIndex: index,\n      messageDataOffset,\n      messageDataSize: message.length,\n      messageInstructionIndex: index\n    }, instructionData);\n    instructionData.fill(publicKey, publicKeyOffset);\n    instructionData.fill(signature, signatureOffset);\n    instructionData.fill(message, messageDataOffset);\n    return new TransactionInstruction({\n      keys: [],\n      programId: Ed25519Program.programId,\n      data: instructionData\n    });\n  }\n\n  /**\n   * Create an ed25519 instruction with a private key. The private key\n   * must be a buffer that is 64 bytes long.\n   */\n  static createInstructionWithPrivateKey(params) {\n    const {\n      privateKey,\n      message,\n      instructionIndex\n    } = params;\n    assert(privateKey.length === PRIVATE_KEY_BYTES$1, `Private key must be ${PRIVATE_KEY_BYTES$1} bytes but received ${privateKey.length} bytes`);\n    try {\n      const keypair = Keypair.fromSecretKey(privateKey);\n      const publicKey = keypair.publicKey.toBytes();\n      const signature = sign(message, keypair.secretKey);\n      return this.createInstructionWithPublicKey({\n        publicKey,\n        message,\n        signature,\n        instructionIndex\n      });\n    } catch (error) {\n      throw new Error(`Error creating instruction; ${error}`);\n    }\n  }\n}\nEd25519Program.programId = new PublicKey('Ed25519SigVerify111111111111111111111111111');\n\nconst ecdsaSign = (msgHash, privKey) => {\n  const signature = secp256k1.sign(msgHash, privKey);\n  return [signature.toCompactRawBytes(), signature.recovery];\n};\nsecp256k1.utils.isValidPrivateKey;\nconst publicKeyCreate = secp256k1.getPublicKey;\n\nconst PRIVATE_KEY_BYTES = 32;\nconst ETHEREUM_ADDRESS_BYTES = 20;\nconst PUBLIC_KEY_BYTES = 64;\nconst SIGNATURE_OFFSETS_SERIALIZED_SIZE = 11;\n\n/**\n * Params for creating an secp256k1 instruction using a public key\n */\n\n/**\n * Params for creating an secp256k1 instruction using an Ethereum address\n */\n\n/**\n * Params for creating an secp256k1 instruction using a private key\n */\n\nconst SECP256K1_INSTRUCTION_LAYOUT = BufferLayout.struct([BufferLayout.u8('numSignatures'), BufferLayout.u16('signatureOffset'), BufferLayout.u8('signatureInstructionIndex'), BufferLayout.u16('ethAddressOffset'), BufferLayout.u8('ethAddressInstructionIndex'), BufferLayout.u16('messageDataOffset'), BufferLayout.u16('messageDataSize'), BufferLayout.u8('messageInstructionIndex'), BufferLayout.blob(20, 'ethAddress'), BufferLayout.blob(64, 'signature'), BufferLayout.u8('recoveryId')]);\nclass Secp256k1Program {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the secp256k1 program\n   */\n\n  /**\n   * Construct an Ethereum address from a secp256k1 public key buffer.\n   * @param {Buffer} publicKey a 64 byte secp256k1 public key buffer\n   */\n  static publicKeyToEthAddress(publicKey) {\n    assert(publicKey.length === PUBLIC_KEY_BYTES, `Public key must be ${PUBLIC_KEY_BYTES} bytes but received ${publicKey.length} bytes`);\n    try {\n      return Buffer.from(keccak_256(toBuffer(publicKey))).slice(-ETHEREUM_ADDRESS_BYTES);\n    } catch (error) {\n      throw new Error(`Error constructing Ethereum address: ${error}`);\n    }\n  }\n\n  /**\n   * Create an secp256k1 instruction with a public key. The public key\n   * must be a buffer that is 64 bytes long.\n   */\n  static createInstructionWithPublicKey(params) {\n    const {\n      publicKey,\n      message,\n      signature,\n      recoveryId,\n      instructionIndex\n    } = params;\n    return Secp256k1Program.createInstructionWithEthAddress({\n      ethAddress: Secp256k1Program.publicKeyToEthAddress(publicKey),\n      message,\n      signature,\n      recoveryId,\n      instructionIndex\n    });\n  }\n\n  /**\n   * Create an secp256k1 instruction with an Ethereum address. The address\n   * must be a hex string or a buffer that is 20 bytes long.\n   */\n  static createInstructionWithEthAddress(params) {\n    const {\n      ethAddress: rawAddress,\n      message,\n      signature,\n      recoveryId,\n      instructionIndex = 0\n    } = params;\n    let ethAddress;\n    if (typeof rawAddress === 'string') {\n      if (rawAddress.startsWith('0x')) {\n        ethAddress = Buffer.from(rawAddress.substr(2), 'hex');\n      } else {\n        ethAddress = Buffer.from(rawAddress, 'hex');\n      }\n    } else {\n      ethAddress = rawAddress;\n    }\n    assert(ethAddress.length === ETHEREUM_ADDRESS_BYTES, `Address must be ${ETHEREUM_ADDRESS_BYTES} bytes but received ${ethAddress.length} bytes`);\n    const dataStart = 1 + SIGNATURE_OFFSETS_SERIALIZED_SIZE;\n    const ethAddressOffset = dataStart;\n    const signatureOffset = dataStart + ethAddress.length;\n    const messageDataOffset = signatureOffset + signature.length + 1;\n    const numSignatures = 1;\n    const instructionData = Buffer.alloc(SECP256K1_INSTRUCTION_LAYOUT.span + message.length);\n    SECP256K1_INSTRUCTION_LAYOUT.encode({\n      numSignatures,\n      signatureOffset,\n      signatureInstructionIndex: instructionIndex,\n      ethAddressOffset,\n      ethAddressInstructionIndex: instructionIndex,\n      messageDataOffset,\n      messageDataSize: message.length,\n      messageInstructionIndex: instructionIndex,\n      signature: toBuffer(signature),\n      ethAddress: toBuffer(ethAddress),\n      recoveryId\n    }, instructionData);\n    instructionData.fill(toBuffer(message), SECP256K1_INSTRUCTION_LAYOUT.span);\n    return new TransactionInstruction({\n      keys: [],\n      programId: Secp256k1Program.programId,\n      data: instructionData\n    });\n  }\n\n  /**\n   * Create an secp256k1 instruction with a private key. The private key\n   * must be a buffer that is 32 bytes long.\n   */\n  static createInstructionWithPrivateKey(params) {\n    const {\n      privateKey: pkey,\n      message,\n      instructionIndex\n    } = params;\n    assert(pkey.length === PRIVATE_KEY_BYTES, `Private key must be ${PRIVATE_KEY_BYTES} bytes but received ${pkey.length} bytes`);\n    try {\n      const privateKey = toBuffer(pkey);\n      const publicKey = publicKeyCreate(privateKey, false /* isCompressed */).slice(1); // throw away leading byte\n      const messageHash = Buffer.from(keccak_256(toBuffer(message)));\n      const [signature, recoveryId] = ecdsaSign(messageHash, privateKey);\n      return this.createInstructionWithPublicKey({\n        publicKey,\n        message,\n        signature,\n        recoveryId,\n        instructionIndex\n      });\n    } catch (error) {\n      throw new Error(`Error creating instruction; ${error}`);\n    }\n  }\n}\nSecp256k1Program.programId = new PublicKey('KeccakSecp256k11111111111111111111111111111');\n\nvar _Lockup;\n\n/**\n * Address of the stake config account which configures the rate\n * of stake warmup and cooldown as well as the slashing penalty.\n */\nconst STAKE_CONFIG_ID = new PublicKey('StakeConfig11111111111111111111111111111111');\n\n/**\n * Stake account authority info\n */\nclass Authorized {\n  /**\n   * Create a new Authorized object\n   * @param staker the stake authority\n   * @param withdrawer the withdraw authority\n   */\n  constructor(staker, withdrawer) {\n    /** stake authority */\n    this.staker = void 0;\n    /** withdraw authority */\n    this.withdrawer = void 0;\n    this.staker = staker;\n    this.withdrawer = withdrawer;\n  }\n}\n/**\n * Stake account lockup info\n */\nclass Lockup {\n  /**\n   * Create a new Lockup object\n   */\n  constructor(unixTimestamp, epoch, custodian) {\n    /** Unix timestamp of lockup expiration */\n    this.unixTimestamp = void 0;\n    /** Epoch of lockup expiration */\n    this.epoch = void 0;\n    /** Lockup custodian authority */\n    this.custodian = void 0;\n    this.unixTimestamp = unixTimestamp;\n    this.epoch = epoch;\n    this.custodian = custodian;\n  }\n\n  /**\n   * Default, inactive Lockup value\n   */\n}\n_Lockup = Lockup;\nLockup.default = new _Lockup(0, 0, PublicKey.default);\n/**\n * Create stake account transaction params\n */\n/**\n * Create stake account with seed transaction params\n */\n/**\n * Initialize stake instruction params\n */\n/**\n * Delegate stake instruction params\n */\n/**\n * Authorize stake instruction params\n */\n/**\n * Authorize stake instruction params using a derived key\n */\n/**\n * Split stake instruction params\n */\n/**\n * Split with seed transaction params\n */\n/**\n * Withdraw stake instruction params\n */\n/**\n * Deactivate stake instruction params\n */\n/**\n * Merge stake instruction params\n */\n/**\n * Stake Instruction class\n */\nclass StakeInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a stake instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = BufferLayout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(STAKE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a StakeInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode a initialize stake instruction and retrieve the instruction params.\n   */\n  static decodeInitialize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      authorized,\n      lockup\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Initialize, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorized: new Authorized(new PublicKey(authorized.staker), new PublicKey(authorized.withdrawer)),\n      lockup: new Lockup(lockup.unixTimestamp, lockup.epoch, new PublicKey(lockup.custodian))\n    };\n  }\n\n  /**\n   * Decode a delegate stake instruction and retrieve the instruction params.\n   */\n  static decodeDelegate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 6);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Delegate, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      votePubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[5].pubkey\n    };\n  }\n\n  /**\n   * Decode an authorize stake instruction and retrieve the instruction params.\n   */\n  static decodeAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      newAuthorized,\n      stakeAuthorizationType\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Authorize, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      stakeAuthorizationType: {\n        index: stakeAuthorizationType\n      }\n    };\n    if (instruction.keys.length > 3) {\n      o.custodianPubkey = instruction.keys[3].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode an authorize-with-seed stake instruction and retrieve the instruction params.\n   */\n  static decodeAuthorizeWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      newAuthorized,\n      stakeAuthorizationType,\n      authoritySeed,\n      authorityOwner\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorityBase: instruction.keys[1].pubkey,\n      authoritySeed: authoritySeed,\n      authorityOwner: new PublicKey(authorityOwner),\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      stakeAuthorizationType: {\n        index: stakeAuthorizationType\n      }\n    };\n    if (instruction.keys.length > 3) {\n      o.custodianPubkey = instruction.keys[3].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode a split stake instruction and retrieve the instruction params.\n   */\n  static decodeSplit(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Split, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      splitStakePubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a merge stake instruction and retrieve the instruction params.\n   */\n  static decodeMerge(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Merge, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      sourceStakePubKey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey\n    };\n  }\n\n  /**\n   * Decode a withdraw stake instruction and retrieve the instruction params.\n   */\n  static decodeWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 5);\n    const {\n      lamports\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Withdraw, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey,\n      lamports\n    };\n    if (instruction.keys.length > 5) {\n      o.custodianPubkey = instruction.keys[5].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode a deactivate stake instruction and retrieve the instruction params.\n   */\n  static decodeDeactivate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Deactivate, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(StakeProgram.programId)) {\n      throw new Error('invalid instruction; programId is not StakeProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid StakeInstructionType's\n */\n\n/**\n * An enumeration of valid stake InstructionType's\n * @internal\n */\nconst STAKE_INSTRUCTION_LAYOUTS = Object.freeze({\n  Initialize: {\n    index: 0,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), authorized(), lockup()])\n  },\n  Authorize: {\n    index: 1,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('newAuthorized'), BufferLayout.u32('stakeAuthorizationType')])\n  },\n  Delegate: {\n    index: 2,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  Split: {\n    index: 3,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('lamports')])\n  },\n  Withdraw: {\n    index: 4,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('lamports')])\n  },\n  Deactivate: {\n    index: 5,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  Merge: {\n    index: 7,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  AuthorizeWithSeed: {\n    index: 8,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('newAuthorized'), BufferLayout.u32('stakeAuthorizationType'), rustString('authoritySeed'), publicKey('authorityOwner')])\n  }\n});\n\n/**\n * Stake authorization type\n */\n\n/**\n * An enumeration of valid StakeAuthorizationLayout's\n */\nconst StakeAuthorizationLayout = Object.freeze({\n  Staker: {\n    index: 0\n  },\n  Withdrawer: {\n    index: 1\n  }\n});\n\n/**\n * Factory class for transactions to interact with the Stake program\n */\nclass StakeProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Stake program\n   */\n\n  /**\n   * Generate an Initialize instruction to add to a Stake Create transaction\n   */\n  static initialize(params) {\n    const {\n      stakePubkey,\n      authorized,\n      lockup: maybeLockup\n    } = params;\n    const lockup = maybeLockup || Lockup.default;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Initialize;\n    const data = encodeData(type, {\n      authorized: {\n        staker: toBuffer(authorized.staker.toBuffer()),\n        withdrawer: toBuffer(authorized.withdrawer.toBuffer())\n      },\n      lockup: {\n        unixTimestamp: lockup.unixTimestamp,\n        epoch: lockup.epoch,\n        custodian: toBuffer(lockup.custodian.toBuffer())\n      }\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a Transaction that creates a new Stake account at\n   *   an address generated with `from`, a seed, and the Stake programId\n   */\n  static createAccountWithSeed(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccountWithSeed({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.stakePubkey,\n      basePubkey: params.basePubkey,\n      seed: params.seed,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    const {\n      stakePubkey,\n      authorized,\n      lockup\n    } = params;\n    return transaction.add(this.initialize({\n      stakePubkey,\n      authorized,\n      lockup\n    }));\n  }\n\n  /**\n   * Generate a Transaction that creates a new Stake account\n   */\n  static createAccount(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.stakePubkey,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    const {\n      stakePubkey,\n      authorized,\n      lockup\n    } = params;\n    return transaction.add(this.initialize({\n      stakePubkey,\n      authorized,\n      lockup\n    }));\n  }\n\n  /**\n   * Generate a Transaction that delegates Stake tokens to a validator\n   * Vote PublicKey. This transaction can also be used to redelegate Stake\n   * to a new validator Vote PublicKey.\n   */\n  static delegate(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      votePubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Delegate;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: votePubkey,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: STAKE_CONFIG_ID,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that authorizes a new PublicKey as Staker\n   * or Withdrawer on the Stake account.\n   */\n  static authorize(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      newAuthorizedPubkey,\n      stakeAuthorizationType,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Authorize;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      stakeAuthorizationType: stakeAuthorizationType.index\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that authorizes a new PublicKey as Staker\n   * or Withdrawer on the Stake account.\n   */\n  static authorizeWithSeed(params) {\n    const {\n      stakePubkey,\n      authorityBase,\n      authoritySeed,\n      authorityOwner,\n      newAuthorizedPubkey,\n      stakeAuthorizationType,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      stakeAuthorizationType: stakeAuthorizationType.index,\n      authoritySeed: authoritySeed,\n      authorityOwner: toBuffer(authorityOwner.toBuffer())\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorityBase,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * @internal\n   */\n  static splitInstruction(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      lamports\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Split;\n    const data = encodeData(type, {\n      lamports\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: splitStakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that splits Stake tokens into another stake account\n   */\n  static split(params,\n  // Compute the cost of allocating the new stake account in lamports\n  rentExemptReserve) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.authorizedPubkey,\n      newAccountPubkey: params.splitStakePubkey,\n      lamports: rentExemptReserve,\n      space: this.space,\n      programId: this.programId\n    }));\n    return transaction.add(this.splitInstruction(params));\n  }\n\n  /**\n   * Generate a Transaction that splits Stake tokens into another account\n   * derived from a base public key and seed\n   */\n  static splitWithSeed(params,\n  // If this stake account is new, compute the cost of allocating it in lamports\n  rentExemptReserve) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      basePubkey,\n      seed,\n      lamports\n    } = params;\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.allocate({\n      accountPubkey: splitStakePubkey,\n      basePubkey,\n      seed,\n      space: this.space,\n      programId: this.programId\n    }));\n    if (rentExemptReserve && rentExemptReserve > 0) {\n      transaction.add(SystemProgram.transfer({\n        fromPubkey: params.authorizedPubkey,\n        toPubkey: splitStakePubkey,\n        lamports: rentExemptReserve\n      }));\n    }\n    return transaction.add(this.splitInstruction({\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      lamports\n    }));\n  }\n\n  /**\n   * Generate a Transaction that merges Stake accounts.\n   */\n  static merge(params) {\n    const {\n      stakePubkey,\n      sourceStakePubKey,\n      authorizedPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Merge;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: sourceStakePubKey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that withdraws deactivated Stake tokens.\n   */\n  static withdraw(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      toPubkey,\n      lamports,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Withdraw;\n    const data = encodeData(type, {\n      lamports\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: toPubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that deactivates Stake tokens.\n   */\n  static deactivate(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Deactivate;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n}\nStakeProgram.programId = new PublicKey('Stake11111111111111111111111111111111111111');\n/**\n * Max space of a Stake account\n *\n * This is generated from the solana-stake-program StakeState struct as\n * `StakeStateV2::size_of()`:\n * https://docs.rs/solana-stake-program/latest/solana_stake_program/stake_state/enum.StakeStateV2.html\n */\nStakeProgram.space = 200;\n\n/**\n * Vote account info\n */\nclass VoteInit {\n  /** [0, 100] */\n\n  constructor(nodePubkey, authorizedVoter, authorizedWithdrawer, commission) {\n    this.nodePubkey = void 0;\n    this.authorizedVoter = void 0;\n    this.authorizedWithdrawer = void 0;\n    this.commission = void 0;\n    this.nodePubkey = nodePubkey;\n    this.authorizedVoter = authorizedVoter;\n    this.authorizedWithdrawer = authorizedWithdrawer;\n    this.commission = commission;\n  }\n}\n\n/**\n * Create vote account transaction params\n */\n\n/**\n * InitializeAccount instruction params\n */\n\n/**\n * Authorize instruction params\n */\n\n/**\n * AuthorizeWithSeed instruction params\n */\n\n/**\n * Withdraw from vote account transaction params\n */\n\n/**\n * Update validator identity (node pubkey) vote account instruction params.\n */\n\n/**\n * Vote Instruction class\n */\nclass VoteInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a vote instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = BufferLayout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(VOTE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a VoteInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode an initialize vote instruction and retrieve the instruction params.\n   */\n  static decodeInitializeAccount(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 4);\n    const {\n      voteInit\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.InitializeAccount, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      nodePubkey: instruction.keys[3].pubkey,\n      voteInit: new VoteInit(new PublicKey(voteInit.nodePubkey), new PublicKey(voteInit.authorizedVoter), new PublicKey(voteInit.authorizedWithdrawer), voteInit.commission)\n    };\n  }\n\n  /**\n   * Decode an authorize instruction and retrieve the instruction params.\n   */\n  static decodeAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      newAuthorized,\n      voteAuthorizationType\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.Authorize, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      voteAuthorizationType: {\n        index: voteAuthorizationType\n      }\n    };\n  }\n\n  /**\n   * Decode an authorize instruction and retrieve the instruction params.\n   */\n  static decodeAuthorizeWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      voteAuthorizeWithSeedArgs: {\n        currentAuthorityDerivedKeyOwnerPubkey,\n        currentAuthorityDerivedKeySeed,\n        newAuthorized,\n        voteAuthorizationType\n      }\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed, instruction.data);\n    return {\n      currentAuthorityDerivedKeyBasePubkey: instruction.keys[2].pubkey,\n      currentAuthorityDerivedKeyOwnerPubkey: new PublicKey(currentAuthorityDerivedKeyOwnerPubkey),\n      currentAuthorityDerivedKeySeed: currentAuthorityDerivedKeySeed,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      voteAuthorizationType: {\n        index: voteAuthorizationType\n      },\n      votePubkey: instruction.keys[0].pubkey\n    };\n  }\n\n  /**\n   * Decode a withdraw instruction and retrieve the instruction params.\n   */\n  static decodeWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.Withdraw, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      authorizedWithdrawerPubkey: instruction.keys[2].pubkey,\n      lamports,\n      toPubkey: instruction.keys[1].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(VoteProgram.programId)) {\n      throw new Error('invalid instruction; programId is not VoteProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid VoteInstructionType's\n */\n\n/** @internal */\n\nconst VOTE_INSTRUCTION_LAYOUTS = Object.freeze({\n  InitializeAccount: {\n    index: 0,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), voteInit()])\n  },\n  Authorize: {\n    index: 1,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), publicKey('newAuthorized'), BufferLayout.u32('voteAuthorizationType')])\n  },\n  Withdraw: {\n    index: 3,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), BufferLayout.ns64('lamports')])\n  },\n  UpdateValidatorIdentity: {\n    index: 4,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction')])\n  },\n  AuthorizeWithSeed: {\n    index: 10,\n    layout: BufferLayout.struct([BufferLayout.u32('instruction'), voteAuthorizeWithSeedArgs()])\n  }\n});\n\n/**\n * VoteAuthorize type\n */\n\n/**\n * An enumeration of valid VoteAuthorization layouts.\n */\nconst VoteAuthorizationLayout = Object.freeze({\n  Voter: {\n    index: 0\n  },\n  Withdrawer: {\n    index: 1\n  }\n});\n\n/**\n * Factory class for transactions to interact with the Vote program\n */\nclass VoteProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Vote program\n   */\n\n  /**\n   * Generate an Initialize instruction.\n   */\n  static initializeAccount(params) {\n    const {\n      votePubkey,\n      nodePubkey,\n      voteInit\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.InitializeAccount;\n    const data = encodeData(type, {\n      voteInit: {\n        nodePubkey: toBuffer(voteInit.nodePubkey.toBuffer()),\n        authorizedVoter: toBuffer(voteInit.authorizedVoter.toBuffer()),\n        authorizedWithdrawer: toBuffer(voteInit.authorizedWithdrawer.toBuffer()),\n        commission: voteInit.commission\n      }\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: votePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: nodePubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a transaction that creates a new Vote account.\n   */\n  static createAccount(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.votePubkey,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    return transaction.add(this.initializeAccount({\n      votePubkey: params.votePubkey,\n      nodePubkey: params.voteInit.nodePubkey,\n      voteInit: params.voteInit\n    }));\n  }\n\n  /**\n   * Generate a transaction that authorizes a new Voter or Withdrawer on the Vote account.\n   */\n  static authorize(params) {\n    const {\n      votePubkey,\n      authorizedPubkey,\n      newAuthorizedPubkey,\n      voteAuthorizationType\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.Authorize;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      voteAuthorizationType: voteAuthorizationType.index\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction that authorizes a new Voter or Withdrawer on the Vote account\n   * where the current Voter or Withdrawer authority is a derived key.\n   */\n  static authorizeWithSeed(params) {\n    const {\n      currentAuthorityDerivedKeyBasePubkey,\n      currentAuthorityDerivedKeyOwnerPubkey,\n      currentAuthorityDerivedKeySeed,\n      newAuthorizedPubkey,\n      voteAuthorizationType,\n      votePubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed;\n    const data = encodeData(type, {\n      voteAuthorizeWithSeedArgs: {\n        currentAuthorityDerivedKeyOwnerPubkey: toBuffer(currentAuthorityDerivedKeyOwnerPubkey.toBuffer()),\n        currentAuthorityDerivedKeySeed: currentAuthorityDerivedKeySeed,\n        newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n        voteAuthorizationType: voteAuthorizationType.index\n      }\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: currentAuthorityDerivedKeyBasePubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction to withdraw from a Vote account.\n   */\n  static withdraw(params) {\n    const {\n      votePubkey,\n      authorizedWithdrawerPubkey,\n      lamports,\n      toPubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.Withdraw;\n    const data = encodeData(type, {\n      lamports\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: toPubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorizedWithdrawerPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction to withdraw safely from a Vote account.\n   *\n   * This function was created as a safeguard for vote accounts running validators, `safeWithdraw`\n   * checks that the withdraw amount will not exceed the specified balance while leaving enough left\n   * to cover rent. If you wish to close the vote account by withdrawing the full amount, call the\n   * `withdraw` method directly.\n   */\n  static safeWithdraw(params, currentVoteAccountBalance, rentExemptMinimum) {\n    if (params.lamports > currentVoteAccountBalance - rentExemptMinimum) {\n      throw new Error('Withdraw will leave vote account with insufficient funds.');\n    }\n    return VoteProgram.withdraw(params);\n  }\n\n  /**\n   * Generate a transaction to update the validator identity (node pubkey) of a Vote account.\n   */\n  static updateValidatorIdentity(params) {\n    const {\n      votePubkey,\n      authorizedWithdrawerPubkey,\n      nodePubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.UpdateValidatorIdentity;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: nodePubkey,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: authorizedWithdrawerPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n}\nVoteProgram.programId = new PublicKey('Vote111111111111111111111111111111111111111');\n/**\n * Max space of a Vote account\n *\n * This is generated from the solana-vote-program VoteState struct as\n * `VoteState::size_of()`:\n * https://docs.rs/solana-vote-program/1.9.5/solana_vote_program/vote_state/struct.VoteState.html#method.size_of\n *\n * KEEP IN SYNC WITH `VoteState::size_of()` in https://github.com/solana-labs/solana/blob/a474cb24b9238f5edcc982f65c0b37d4a1046f7e/sdk/program/src/vote/state/mod.rs#L340-L342\n */\nVoteProgram.space = 3762;\n\nconst VALIDATOR_INFO_KEY = new PublicKey('Va1idator1nfo111111111111111111111111111111');\n\n/**\n * @internal\n */\n\n/**\n * Info used to identity validators.\n */\n\nconst InfoString = type({\n  name: string(),\n  website: optional(string()),\n  details: optional(string()),\n  iconUrl: optional(string()),\n  keybaseUsername: optional(string())\n});\n\n/**\n * ValidatorInfo class\n */\nclass ValidatorInfo {\n  /**\n   * Construct a valid ValidatorInfo\n   *\n   * @param key validator public key\n   * @param info validator information\n   */\n  constructor(key, info) {\n    /**\n     * validator public key\n     */\n    this.key = void 0;\n    /**\n     * validator information\n     */\n    this.info = void 0;\n    this.key = key;\n    this.info = info;\n  }\n\n  /**\n   * Deserialize ValidatorInfo from the config account data. Exactly two config\n   * keys are required in the data.\n   *\n   * @param buffer config account data\n   * @return null if info was not found\n   */\n  static fromConfigData(buffer) {\n    let byteArray = [...buffer];\n    const configKeyCount = decodeLength(byteArray);\n    if (configKeyCount !== 2) return null;\n    const configKeys = [];\n    for (let i = 0; i < 2; i++) {\n      const publicKey = new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n      const isSigner = guardedShift(byteArray) === 1;\n      configKeys.push({\n        publicKey,\n        isSigner\n      });\n    }\n    if (configKeys[0].publicKey.equals(VALIDATOR_INFO_KEY)) {\n      if (configKeys[1].isSigner) {\n        const rawInfo = rustString().decode(Buffer.from(byteArray));\n        const info = JSON.parse(rawInfo);\n        assert$1(info, InfoString);\n        return new ValidatorInfo(configKeys[1].publicKey, info);\n      }\n    }\n    return null;\n  }\n}\n\nconst VOTE_PROGRAM_ID = new PublicKey('Vote111111111111111111111111111111111111111');\n\n/**\n * History of how many credits earned by the end of each epoch\n */\n\n/**\n * See https://github.com/solana-labs/solana/blob/8a12ed029cfa38d4a45400916c2463fb82bbec8c/programs/vote_api/src/vote_state.rs#L68-L88\n *\n * @internal\n */\nconst VoteAccountLayout = BufferLayout.struct([publicKey('nodePubkey'), publicKey('authorizedWithdrawer'), BufferLayout.u8('commission'), BufferLayout.nu64(),\n// votes.length\nBufferLayout.seq(BufferLayout.struct([BufferLayout.nu64('slot'), BufferLayout.u32('confirmationCount')]), BufferLayout.offset(BufferLayout.u32(), -8), 'votes'), BufferLayout.u8('rootSlotValid'), BufferLayout.nu64('rootSlot'), BufferLayout.nu64(),\n// authorizedVoters.length\nBufferLayout.seq(BufferLayout.struct([BufferLayout.nu64('epoch'), publicKey('authorizedVoter')]), BufferLayout.offset(BufferLayout.u32(), -8), 'authorizedVoters'), BufferLayout.struct([BufferLayout.seq(BufferLayout.struct([publicKey('authorizedPubkey'), BufferLayout.nu64('epochOfLastAuthorizedSwitch'), BufferLayout.nu64('targetEpoch')]), 32, 'buf'), BufferLayout.nu64('idx'), BufferLayout.u8('isEmpty')], 'priorVoters'), BufferLayout.nu64(),\n// epochCredits.length\nBufferLayout.seq(BufferLayout.struct([BufferLayout.nu64('epoch'), BufferLayout.nu64('credits'), BufferLayout.nu64('prevCredits')]), BufferLayout.offset(BufferLayout.u32(), -8), 'epochCredits'), BufferLayout.struct([BufferLayout.nu64('slot'), BufferLayout.nu64('timestamp')], 'lastTimestamp')]);\n/**\n * VoteAccount class\n */\nclass VoteAccount {\n  /**\n   * @internal\n   */\n  constructor(args) {\n    this.nodePubkey = void 0;\n    this.authorizedWithdrawer = void 0;\n    this.commission = void 0;\n    this.rootSlot = void 0;\n    this.votes = void 0;\n    this.authorizedVoters = void 0;\n    this.priorVoters = void 0;\n    this.epochCredits = void 0;\n    this.lastTimestamp = void 0;\n    this.nodePubkey = args.nodePubkey;\n    this.authorizedWithdrawer = args.authorizedWithdrawer;\n    this.commission = args.commission;\n    this.rootSlot = args.rootSlot;\n    this.votes = args.votes;\n    this.authorizedVoters = args.authorizedVoters;\n    this.priorVoters = args.priorVoters;\n    this.epochCredits = args.epochCredits;\n    this.lastTimestamp = args.lastTimestamp;\n  }\n\n  /**\n   * Deserialize VoteAccount from the account data.\n   *\n   * @param buffer account data\n   * @return VoteAccount\n   */\n  static fromAccountData(buffer) {\n    const versionOffset = 4;\n    const va = VoteAccountLayout.decode(toBuffer(buffer), versionOffset);\n    let rootSlot = va.rootSlot;\n    if (!va.rootSlotValid) {\n      rootSlot = null;\n    }\n    return new VoteAccount({\n      nodePubkey: new PublicKey(va.nodePubkey),\n      authorizedWithdrawer: new PublicKey(va.authorizedWithdrawer),\n      commission: va.commission,\n      votes: va.votes,\n      rootSlot,\n      authorizedVoters: va.authorizedVoters.map(parseAuthorizedVoter),\n      priorVoters: getPriorVoters(va.priorVoters),\n      epochCredits: va.epochCredits,\n      lastTimestamp: va.lastTimestamp\n    });\n  }\n}\nfunction parseAuthorizedVoter({\n  authorizedVoter,\n  epoch\n}) {\n  return {\n    epoch,\n    authorizedVoter: new PublicKey(authorizedVoter)\n  };\n}\nfunction parsePriorVoters({\n  authorizedPubkey,\n  epochOfLastAuthorizedSwitch,\n  targetEpoch\n}) {\n  return {\n    authorizedPubkey: new PublicKey(authorizedPubkey),\n    epochOfLastAuthorizedSwitch,\n    targetEpoch\n  };\n}\nfunction getPriorVoters({\n  buf,\n  idx,\n  isEmpty\n}) {\n  if (isEmpty) {\n    return [];\n  }\n  return [...buf.slice(idx + 1).map(parsePriorVoters), ...buf.slice(0, idx).map(parsePriorVoters)];\n}\n\nconst endpoint = {\n  http: {\n    devnet: 'http://api.devnet.solana.com',\n    testnet: 'http://api.testnet.solana.com',\n    'mainnet-beta': 'http://api.mainnet-beta.solana.com/'\n  },\n  https: {\n    devnet: 'https://api.devnet.solana.com',\n    testnet: 'https://api.testnet.solana.com',\n    'mainnet-beta': 'https://api.mainnet-beta.solana.com/'\n  }\n};\n/**\n * Retrieves the RPC API URL for the specified cluster\n * @param {Cluster} [cluster=\"devnet\"] - The cluster name of the RPC API URL to use. Possible options: 'devnet' | 'testnet' | 'mainnet-beta'\n * @param {boolean} [tls=\"http\"] - Use TLS when connecting to cluster.\n *\n * @returns {string} URL string of the RPC endpoint\n */\nfunction clusterApiUrl(cluster, tls) {\n  const key = tls === false ? 'http' : 'https';\n  if (!cluster) {\n    return endpoint[key]['devnet'];\n  }\n  const url = endpoint[key][cluster];\n  if (!url) {\n    throw new Error(`Unknown ${key} cluster: ${cluster}`);\n  }\n  return url;\n}\n\n/**\n * Send and confirm a raw transaction\n *\n * If `commitment` option is not specified, defaults to 'max' commitment.\n *\n * @param {Connection} connection\n * @param {Buffer} rawTransaction\n * @param {TransactionConfirmationStrategy} confirmationStrategy\n * @param {ConfirmOptions} [options]\n * @returns {Promise<TransactionSignature>}\n */\n\n/**\n * @deprecated Calling `sendAndConfirmRawTransaction()` without a `confirmationStrategy`\n * is no longer supported and will be removed in a future version.\n */\n// eslint-disable-next-line no-redeclare\n\n// eslint-disable-next-line no-redeclare\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, confirmationStrategyOrConfirmOptions, maybeConfirmOptions) {\n  let confirmationStrategy;\n  let options;\n  if (confirmationStrategyOrConfirmOptions && Object.prototype.hasOwnProperty.call(confirmationStrategyOrConfirmOptions, 'lastValidBlockHeight')) {\n    confirmationStrategy = confirmationStrategyOrConfirmOptions;\n    options = maybeConfirmOptions;\n  } else if (confirmationStrategyOrConfirmOptions && Object.prototype.hasOwnProperty.call(confirmationStrategyOrConfirmOptions, 'nonceValue')) {\n    confirmationStrategy = confirmationStrategyOrConfirmOptions;\n    options = maybeConfirmOptions;\n  } else {\n    options = confirmationStrategyOrConfirmOptions;\n  }\n  const sendOptions = options && {\n    skipPreflight: options.skipPreflight,\n    preflightCommitment: options.preflightCommitment || options.commitment,\n    minContextSlot: options.minContextSlot\n  };\n  const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n  const commitment = options && options.commitment;\n  const confirmationPromise = confirmationStrategy ? connection.confirmTransaction(confirmationStrategy, commitment) : connection.confirmTransaction(signature, commitment);\n  const status = (await confirmationPromise).value;\n  if (status.err) {\n    if (signature != null) {\n      throw new SendTransactionError({\n        action: sendOptions?.skipPreflight ? 'send' : 'simulate',\n        signature: signature,\n        transactionMessage: `Status: (${JSON.stringify(status)})`\n      });\n    }\n    throw new Error(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n  }\n  return signature;\n}\n\n/**\n * There are 1-billion lamports in one SOL\n */\nconst LAMPORTS_PER_SOL = 1000000000;\n\nexport { Account, AddressLookupTableAccount, AddressLookupTableInstruction, AddressLookupTableProgram, Authorized, BLOCKHASH_CACHE_TIMEOUT_MS, BPF_LOADER_DEPRECATED_PROGRAM_ID, BPF_LOADER_PROGRAM_ID, BpfLoader, COMPUTE_BUDGET_INSTRUCTION_LAYOUTS, ComputeBudgetInstruction, ComputeBudgetProgram, Connection, Ed25519Program, Enum, EpochSchedule, FeeCalculatorLayout, Keypair, LAMPORTS_PER_SOL, LOOKUP_TABLE_INSTRUCTION_LAYOUTS, Loader, Lockup, MAX_SEED_LENGTH, Message, MessageAccountKeys, MessageV0, NONCE_ACCOUNT_LENGTH, NonceAccount, PACKET_DATA_SIZE, PUBLIC_KEY_LENGTH, PublicKey, SIGNATURE_LENGTH_IN_BYTES, SOLANA_SCHEMA, STAKE_CONFIG_ID, STAKE_INSTRUCTION_LAYOUTS, SYSTEM_INSTRUCTION_LAYOUTS, SYSVAR_CLOCK_PUBKEY, SYSVAR_EPOCH_SCHEDULE_PUBKEY, SYSVAR_INSTRUCTIONS_PUBKEY, SYSVAR_RECENT_BLOCKHASHES_PUBKEY, SYSVAR_RENT_PUBKEY, SYSVAR_REWARDS_PUBKEY, SYSVAR_SLOT_HASHES_PUBKEY, SYSVAR_SLOT_HISTORY_PUBKEY, SYSVAR_STAKE_HISTORY_PUBKEY, Secp256k1Program, SendTransactionError, SolanaJSONRPCError, SolanaJSONRPCErrorCode, StakeAuthorizationLayout, StakeInstruction, StakeProgram, Struct, SystemInstruction, SystemProgram, Transaction, TransactionExpiredBlockheightExceededError, TransactionExpiredNonceInvalidError, TransactionExpiredTimeoutError, TransactionInstruction, TransactionMessage, TransactionStatus, VALIDATOR_INFO_KEY, VERSION_PREFIX_MASK, VOTE_PROGRAM_ID, ValidatorInfo, VersionedMessage, VersionedTransaction, VoteAccount, VoteAuthorizationLayout, VoteInit, VoteInstruction, VoteProgram, clusterApiUrl, sendAndConfirmRawTransaction, sendAndConfirmTransaction };\n//# sourceMappingURL=index.browser.esm.js.map\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MAX_U256 = exports.MAX_U64 = exports.Rounding = exports.TEN = exports.ONE = exports.ZERO = void 0;\nconst tslib_1 = require(\"tslib\");\nconst jsbi_1 = tslib_1.__importDefault(require(\"jsbi\"));\n/**\n * Zero bigint.\n */\nexports.ZERO = jsbi_1.default.BigInt(0);\n/**\n * One bigint.\n */\nexports.ONE = jsbi_1.default.BigInt(1);\n/**\n * 10 bigint.\n */\nexports.TEN = jsbi_1.default.BigInt(10);\nvar Rounding;\n(function (Rounding) {\n    Rounding[Rounding[\"ROUND_DOWN\"] = 0] = \"ROUND_DOWN\";\n    Rounding[Rounding[\"ROUND_HALF_UP\"] = 1] = \"ROUND_HALF_UP\";\n    Rounding[Rounding[\"ROUND_UP\"] = 2] = \"ROUND_UP\";\n})(Rounding = exports.Rounding || (exports.Rounding = {}));\nexports.MAX_U64 = jsbi_1.default.BigInt(\"0xffffffffffffffff\");\nexports.MAX_U256 = jsbi_1.default.BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n//# sourceMappingURL=constants.js.map","\"use strict\";\n/*\n *  toFormat v2.0.0\n *  Adds a toFormat instance method to big.js or decimal.js\n *  Copyright (c) 2017 Michael Mclaughlin\n *  MIT Licence\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.formatBig = exports.formatDecimal = exports.DEFAULT_DISPLAY_NUMBER_FORMAT = exports.DEFAULT_NUMBER_FORMAT = exports.toSignificantRounding = void 0;\nconst tslib_1 = require(\"tslib\");\nconst big_js_1 = tslib_1.__importDefault(require(\"big.js\"));\nconst decimal_js_light_1 = tslib_1.__importDefault(require(\"decimal.js-light\"));\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst constants_js_1 = require(\"./constants.js\");\nexports.toSignificantRounding = {\n    [constants_js_1.Rounding.ROUND_DOWN]: decimal_js_light_1.default.ROUND_DOWN,\n    [constants_js_1.Rounding.ROUND_HALF_UP]: decimal_js_light_1.default.ROUND_HALF_UP,\n    [constants_js_1.Rounding.ROUND_UP]: decimal_js_light_1.default.ROUND_UP,\n};\nconst toFixedRounding = {\n    [constants_js_1.Rounding.ROUND_DOWN]: big_js_1.default.roundDown,\n    [constants_js_1.Rounding.ROUND_HALF_UP]: big_js_1.default.roundHalfUp,\n    [constants_js_1.Rounding.ROUND_UP]: big_js_1.default.roundUp,\n};\n/**\n * Default number format. (no grouping)\n */\nexports.DEFAULT_NUMBER_FORMAT = {\n    decimalSeparator: \".\",\n    groupSeparator: \"\",\n    groupSize: 3,\n    rounding: constants_js_1.Rounding.ROUND_DOWN,\n};\n/**\n * Default number format display.\n */\nexports.DEFAULT_DISPLAY_NUMBER_FORMAT = {\n    ...exports.DEFAULT_NUMBER_FORMAT,\n    groupSeparator: \",\",\n};\nconst formatNum = (num, isNegative, roundingMethod, decimalPlaces, { decimalSeparator = exports.DEFAULT_NUMBER_FORMAT.decimalSeparator, groupSeparator = exports.DEFAULT_NUMBER_FORMAT.groupSeparator, groupSize = exports.DEFAULT_NUMBER_FORMAT.groupSize, rounding = exports.DEFAULT_NUMBER_FORMAT.rounding, } = exports.DEFAULT_NUMBER_FORMAT) => {\n    const decInternal = num;\n    if (!decInternal.e && decInternal.e !== 0) {\n        return num.toString(); // Infinity/NaN\n    }\n    const [integerPart, fractionPart] = num\n        .toFixed(decimalPlaces, roundingMethod === \"fixed\"\n        ? toFixedRounding[rounding]\n        : exports.toSignificantRounding[rounding])\n        .split(\".\");\n    (0, tiny_invariant_1.default)(integerPart);\n    let displayIntegerPart = integerPart;\n    if (groupSeparator) {\n        // integer digits\n        const intd = isNegative ? integerPart.slice(1) : integerPart;\n        // number of integer digits\n        const nd = intd.length;\n        if (groupSize > 0 && nd > 0) {\n            let i = nd % groupSize || groupSize;\n            displayIntegerPart = intd.slice(0, i);\n            for (; i < nd; i += groupSize) {\n                displayIntegerPart += groupSeparator + intd.slice(i, i + groupSize);\n            }\n            if (isNegative) {\n                displayIntegerPart = \"-\" + displayIntegerPart;\n            }\n        }\n    }\n    if (fractionPart) {\n        return displayIntegerPart + (decimalSeparator !== null && decimalSeparator !== void 0 ? decimalSeparator : \"\") + fractionPart;\n    }\n    else {\n        return displayIntegerPart;\n    }\n};\n/*\n *  Returns a string representing the value of this big number in fixed-point notation to `dp`\n *  decimal places using rounding mode `rm`, and formatted according to the properties of the\n * `fmt`, `this.format` and `this.constructor.format` objects, in that order of precedence.\n *\n *  Example:\n *\n *  x = new Decimal('123456789.987654321')\n *\n *  // Add a format object to the constructor...\n *  Decimal.format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ',',\n *    groupSize: 3,\n *    secondaryGroupSize: 0,\n *    fractionGroupSeparator: '',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 0\n *  }\n *\n *  x.toFormat();                // 123,456,789.987654321\n *  x.toFormat(2, 1);            // 123,456,789.98\n *\n *  // And/or add a format object to the big number itself...\n *  x.format = {\n *    decimalSeparator: ',',\n *    groupSeparator: '',\n *  }\n *\n *  x.toFormat();                // 123456789,987654321\n *\n *  format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ' ',\n *    groupSize: 3,\n *    fractionGroupSeparator: ' ',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 5\n *  }\n *  // And/or pass a format object to the method call.\n *  x.toFormat(format);          // 123 456 789.98765 4321\n *  x.toFormat(4, format);       // 123 456 789.9877\n *  x.toFormat(2, 1, format);    // 123 456 789.98\n *\n *  [dp] {number} Decimal places. Integer.\n *  [rm] {number} Rounding mode. Integer, 0 to 8. (Ignored if using big.js.)\n *  [fmt] {Object} A format object.\n *\n */\nconst formatDecimal = (dec, decimalPlaces, fmt = exports.DEFAULT_NUMBER_FORMAT) => {\n    return formatNum(dec, dec.isNegative(), \"significant\", decimalPlaces, fmt);\n};\nexports.formatDecimal = formatDecimal;\n/*\n *  Returns a string representing the value of this big number in fixed-point notation to `dp`\n *  decimal places using rounding mode `rm`, and formatted according to the properties of the\n * `fmt`, `this.format` and `this.constructor.format` objects, in that order of precedence.\n *\n *  Example:\n *\n *  x = new Decimal('123456789.987654321')\n *\n *  // Add a format object to the constructor...\n *  Decimal.format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ',',\n *    groupSize: 3,\n *    secondaryGroupSize: 0,\n *    fractionGroupSeparator: '',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 0\n *  }\n *\n *  x.toFormat();                // 123,456,789.987654321\n *  x.toFormat(2, 1);            // 123,456,789.98\n *\n *  // And/or add a format object to the big number itself...\n *  x.format = {\n *    decimalSeparator: ',',\n *    groupSeparator: '',\n *  }\n *\n *  x.toFormat();                // 123456789,987654321\n *\n *  format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ' ',\n *    groupSize: 3,\n *    fractionGroupSeparator: ' ',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 5\n *  }\n *  // And/or pass a format object to the method call.\n *  x.toFormat(format);          // 123 456 789.98765 4321\n *  x.toFormat(4, format);       // 123 456 789.9877\n *  x.toFormat(2, 1, format);    // 123 456 789.98\n *\n *  [dp] {number} Decimal places. Integer.\n *  [rm] {number} Rounding mode. Integer, 0 to 8. (Ignored if using big.js.)\n *  [fmt] {Object} A format object.\n *\n */\nconst formatBig = (big, decimalPlaces, fmt = exports.DEFAULT_NUMBER_FORMAT) => {\n    return formatNum(big, big.s === -1, \"fixed\", decimalPlaces, fmt);\n};\nexports.formatBig = formatBig;\n//# sourceMappingURL=format.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Fraction = exports.fractionFromObject = void 0;\nconst tslib_1 = require(\"tslib\");\nconst big_js_1 = tslib_1.__importDefault(require(\"big.js\"));\nconst decimal_js_light_1 = tslib_1.__importDefault(require(\"decimal.js-light\"));\nconst jsbi_1 = tslib_1.__importDefault(require(\"jsbi\"));\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst constants_js_1 = require(\"./constants.js\");\nconst format_js_1 = require(\"./format.js\");\nconst utils_js_1 = require(\"./utils.js\");\n/**\n * Attempts to parse a {@link Fraction}.\n * @param fractionish Fraction or BigintIsh.\n * @returns\n */\nconst tryParseFraction = (fractionish) => {\n    if (Fraction.isFraction(fractionish)) {\n        return fractionish;\n    }\n    try {\n        return new Fraction((0, utils_js_1.parseBigintIsh)(fractionish));\n    }\n    catch (e) {\n        if (e instanceof Error) {\n            throw new Error(`Could not parse fraction: ${e.message}`);\n        }\n        throw new Error(`Could not parse fraction`);\n    }\n};\n/**\n * Creates a {@link Fraction} from a {@link FractionObject}.\n * @param param0\n * @returns\n */\nconst fractionFromObject = ({ numeratorStr, denominatorStr, }) => {\n    return new Fraction(numeratorStr, denominatorStr);\n};\nexports.fractionFromObject = fractionFromObject;\n/**\n * Number with an integer numerator and denominator.\n */\nclass Fraction {\n    constructor(numerator, denominator = constants_js_1.ONE) {\n        this.isFraction = true;\n        this.numerator = (0, utils_js_1.parseBigintIsh)(numerator);\n        this.denominator = (0, utils_js_1.parseBigintIsh)(denominator);\n    }\n    get numeratorStr() {\n        return this.numerator.toString();\n    }\n    get denominatorStr() {\n        return this.numerator.toString();\n    }\n    /**\n     * Ensures the other object is of this {@link Fraction} type.\n     * @param other\n     * @returns\n     */\n    static fromObject(other) {\n        if (other instanceof Fraction) {\n            return other;\n        }\n        return (0, exports.fractionFromObject)(other);\n    }\n    /**\n     * JSON representation of the {@link Fraction}.\n     */\n    toJSON() {\n        return {\n            isFraction: true,\n            numeratorStr: this.numerator.toString(),\n            denominatorStr: this.denominator.toString(),\n        };\n    }\n    /**\n     * Returns true if the other object is a {@link Fraction}.\n     *\n     * @param other\n     * @returns\n     */\n    static isFraction(other) {\n        return (typeof other === \"object\" &&\n            other !== null &&\n            \"numerator\" in other &&\n            \"denominator\" in other);\n    }\n    /**\n     * Compares this {@link Fraction} to the other {@link Fraction}.\n     */\n    compareTo(other) {\n        if (this.equalTo(other)) {\n            return 0;\n        }\n        return this.greaterThan(other) ? 1 : -1;\n    }\n    /**\n     * Parses a {@link Fraction} from a float.\n     * @param number Number to parse.\n     * @param decimals Number of decimals of precision. (default 10)\n     * @returns Fraction\n     */\n    static fromNumber(number, decimals = 10) {\n        const multiplier = Math.pow(10, decimals);\n        return new Fraction(Math.floor(number * multiplier), multiplier);\n    }\n    /**\n     * Performs floor division.\n     */\n    get quotient() {\n        return jsbi_1.default.divide(this.numerator, this.denominator);\n    }\n    /**\n     * Remainder after floor division.\n     */\n    get remainder() {\n        return new Fraction(jsbi_1.default.remainder(this.numerator, this.denominator), this.denominator);\n    }\n    /**\n     * Swaps the numerator and denominator of the {@link Fraction}.\n     * @returns\n     */\n    invert() {\n        return new Fraction(this.denominator, this.numerator);\n    }\n    add(other) {\n        const otherParsed = tryParseFraction(other);\n        if (jsbi_1.default.equal(this.denominator, otherParsed.denominator)) {\n            return new Fraction(jsbi_1.default.add(this.numerator, otherParsed.numerator), this.denominator);\n        }\n        return new Fraction(jsbi_1.default.add(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator)), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    subtract(other) {\n        const otherParsed = tryParseFraction(other);\n        if (jsbi_1.default.equal(this.denominator, otherParsed.denominator)) {\n            return new Fraction(jsbi_1.default.subtract(this.numerator, otherParsed.numerator), this.denominator);\n        }\n        return new Fraction(jsbi_1.default.subtract(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator)), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    lessThan(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.lessThan(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    equalTo(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.equal(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    greaterThan(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.greaterThan(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    multiply(other) {\n        const otherParsed = tryParseFraction(other);\n        return new Fraction(jsbi_1.default.multiply(this.numerator, otherParsed.numerator), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    /**\n     * Divides this {@link Fraction} by another {@link Fraction}.\n     */\n    divide(other) {\n        const otherParsed = tryParseFraction(other);\n        return new Fraction(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(this.denominator, otherParsed.numerator));\n    }\n    /**\n     * Converts this {@link Fraction} to a string with the specified significant digits.\n     * @param significantDigits\n     * @param format\n     * @param rounding\n     * @returns\n     */\n    toSignificant(significantDigits, format = { groupSeparator: \"\" }, rounding = constants_js_1.Rounding.ROUND_HALF_UP) {\n        (0, tiny_invariant_1.default)(Number.isInteger(significantDigits), `${significantDigits} is not an integer.`);\n        (0, tiny_invariant_1.default)(significantDigits > 0, `${significantDigits} is not positive.`);\n        decimal_js_light_1.default.set({\n            precision: significantDigits + 1,\n            rounding: format_js_1.toSignificantRounding[rounding],\n        });\n        const quotient = new decimal_js_light_1.default(this.numerator.toString())\n            .div(this.denominator.toString())\n            .toSignificantDigits(significantDigits);\n        return (0, format_js_1.formatDecimal)(quotient, quotient.decimalPlaces(), {\n            ...format,\n            rounding,\n        });\n    }\n    toFixed(decimalPlaces, format = { groupSeparator: \"\" }, rounding = constants_js_1.Rounding.ROUND_HALF_UP) {\n        (0, tiny_invariant_1.default)(Number.isInteger(decimalPlaces), `${decimalPlaces} is not an integer.`);\n        (0, tiny_invariant_1.default)(decimalPlaces >= 0, `${decimalPlaces} is negative.`);\n        return (0, format_js_1.formatBig)(new big_js_1.default(this.numerator.toString()).div(this.denominator.toString()), decimalPlaces, { ...format, rounding });\n    }\n    /**\n     * Helper method for converting any super class back to a fraction\n     */\n    get asFraction() {\n        return new Fraction(this.numerator, this.denominator);\n    }\n    /**\n     * Gets the value of this {@link Fraction} as a number.\n     */\n    get asNumber() {\n        if (jsbi_1.default.equal(this.denominator, constants_js_1.ZERO)) {\n            return jsbi_1.default.greaterThan(this.numerator, constants_js_1.ZERO)\n                ? Number.POSITIVE_INFINITY\n                : jsbi_1.default.lessThan(this.numerator, constants_js_1.ZERO)\n                    ? Number.NEGATIVE_INFINITY\n                    : Number.NaN;\n        }\n        const result = jsbi_1.default.toNumber(this.numerator) / jsbi_1.default.toNumber(this.denominator);\n        if (!Number.isNaN(result)) {\n            return result;\n        }\n        return parseFloat(this.toFixed(10));\n    }\n    /**\n     * Returns true if this number (the numerator) is equal to zero and the denominator is non-zero.\n     * @returns\n     */\n    isZero() {\n        return jsbi_1.default.EQ(this.numerator, constants_js_1.ZERO) && jsbi_1.default.NE(this.denominator, constants_js_1.ZERO);\n    }\n    /**\n     * Returns true if this number (the numerator) is not equal to zero.\n     * @returns\n     */\n    isNonZero() {\n        return !this.isZero();\n    }\n}\nexports.Fraction = Fraction;\nFraction.ZERO = new Fraction(0);\nFraction.ONE = new Fraction(1);\n//# sourceMappingURL=fraction.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tslib_1 = require(\"tslib\");\ntslib_1.__exportStar(require(\"./constants.js\"), exports);\ntslib_1.__exportStar(require(\"./fraction.js\"), exports);\ntslib_1.__exportStar(require(\"./percent.js\"), exports);\ntslib_1.__exportStar(require(\"./price.js\"), exports);\ntslib_1.__exportStar(require(\"./token.js\"), exports);\ntslib_1.__exportStar(require(\"./tokenAmount.js\"), exports);\ntslib_1.__exportStar(require(\"./utils.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Percent = void 0;\nconst fraction_js_1 = require(\"./fraction.js\");\nconst ONE_HUNDRED = new fraction_js_1.Fraction(100);\n/**\n * Converts a fraction to a percent\n * @param fraction the fraction to convert\n */\nfunction toPercent(fraction) {\n    return new Percent(fraction.numerator, fraction.denominator);\n}\nclass Percent extends fraction_js_1.Fraction {\n    constructor() {\n        super(...arguments);\n        /**\n         * This boolean prevents a fraction from being interpreted as a Percent\n         */\n        this.isPercent = true;\n    }\n    /**\n     * Parses a {@link Percent} from a float.\n     * @param number Number to parse. (100% is 1.00)\n     * @param decimals Number of decimals of precision. (default 10)\n     * @returns Percent\n     */\n    static fromNumber(number, decimals = 10) {\n        const frac = fraction_js_1.Fraction.fromNumber(number, decimals);\n        return new Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Constructs an {@link Percent} from a {@link PercentObject}.\n     * @param other\n     * @returns\n     */\n    static fromObject(other) {\n        if (other instanceof Percent) {\n            return other;\n        }\n        return toPercent(fraction_js_1.Fraction.fromObject(other));\n    }\n    /**\n     * JSON representation of the {@link Percent}.\n     */\n    toJSON() {\n        return {\n            ...super.toJSON(),\n            isPercent: true,\n        };\n    }\n    /**\n     * Creates a {@link Percent} from a {@link Fraction}.\n     */\n    static fromFraction(fraction) {\n        return toPercent(fraction);\n    }\n    /**\n     * Parses a {@link Percent} from a given number of bps.\n     * @returns Percent\n     */\n    static fromBPS(bps) {\n        return new Percent(bps, 10000);\n    }\n    add(other) {\n        return toPercent(super.add(other));\n    }\n    subtract(other) {\n        return toPercent(super.subtract(other));\n    }\n    multiply(other) {\n        return toPercent(super.multiply(other));\n    }\n    divide(other) {\n        return toPercent(super.divide(other));\n    }\n    /**\n     * Swaps the numerator and denominator of the {@link Percent}.\n     * @returns\n     */\n    invert() {\n        return new Percent(this.denominator, this.numerator);\n    }\n    toSignificant(significantDigits = 5, format, rounding) {\n        return super\n            .multiply(ONE_HUNDRED)\n            .toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = 2, format, rounding) {\n        return super.multiply(ONE_HUNDRED).toFixed(decimalPlaces, format, rounding);\n    }\n    /**\n     * Returns true if the other object is a {@link Percent}.\n     *\n     * @param other\n     * @returns\n     */\n    static isPercent(other) {\n        return (fraction_js_1.Fraction.isFraction(other) &&\n            (other === null || other === void 0 ? void 0 : other.isPercent) === true);\n    }\n}\nexports.Percent = Percent;\n/**\n * Zero percent.\n */\nPercent.ZERO = new Percent(0);\n/**\n * 1%\n */\nPercent.ONE = new Percent(1, 100);\n/**\n * 100% (1/1)\n */\nPercent.ONE_HUNDRED = new Percent(1);\n//# sourceMappingURL=percent.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Price = void 0;\nconst tslib_1 = require(\"tslib\");\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst fraction_js_1 = require(\"./fraction.js\");\nconst utils_js_1 = require(\"./utils.js\");\nclass Price extends fraction_js_1.Fraction {\n    /**\n     * Constructs a Price.\n     *\n     * denominator and numerator _must_ be raw, i.e. in the native representation\n     *\n     * @param denominator Units of base currency. E.g. 1 BTC would be 1_00000000\n     * @param numerator Units of quote currency. E.g. $30k at 6 decimals would be 30_000_000000\n     */\n    constructor(baseCurrency, quoteCurrency, denominator, numerator) {\n        super((0, utils_js_1.parseBigintIsh)(numerator), (0, utils_js_1.parseBigintIsh)(denominator));\n        this.baseCurrency = baseCurrency;\n        this.quoteCurrency = quoteCurrency;\n        this.scalar = new fraction_js_1.Fraction((0, utils_js_1.makeDecimalMultiplier)(baseCurrency.decimals), (0, utils_js_1.makeDecimalMultiplier)(quoteCurrency.decimals));\n    }\n    get raw() {\n        return new fraction_js_1.Fraction(this.numerator, this.denominator);\n    }\n    get adjusted() {\n        return super.multiply(this.scalar);\n    }\n    invert() {\n        return this.new(this.quoteCurrency, this.baseCurrency, this.numerator, this.denominator);\n    }\n    multiply(other) {\n        (0, tiny_invariant_1.default)(this.quoteCurrency.equals(other.baseCurrency), `multiply token mismatch: ${this.quoteCurrency.toString()} !== ${other.baseCurrency.toString()}`);\n        const fraction = super.multiply(other);\n        return this.new(this.baseCurrency, other.quoteCurrency, fraction.denominator, fraction.numerator);\n    }\n    // performs floor division on overflow\n    quote(tokenAmount) {\n        (0, tiny_invariant_1.default)(tokenAmount.token.equals(this.baseCurrency), `quote token mismatch: ${tokenAmount.token.toString()} !== ${this.baseCurrency.toString()}`);\n        return tokenAmount.new(this.quoteCurrency, super.multiply(tokenAmount.raw).quotient);\n    }\n    toSignificant(significantDigits = 6, format, rounding) {\n        return this.adjusted.toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = 4, format, rounding) {\n        return this.adjusted.toFixed(decimalPlaces, format, rounding);\n    }\n    /**\n     * Returns the price in terms of the quote currency.\n     * @param format\n     * @param rounding\n     * @returns\n     */\n    toFixedQuote(format = { groupSeparator: \"\" }, rounding) {\n        return this.toFixed(this.quoteCurrency.decimals, format, rounding);\n    }\n    get asNumber() {\n        return this.adjusted.asNumber;\n    }\n}\nexports.Price = Price;\n//# sourceMappingURL=price.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n//# sourceMappingURL=token.js.map","\"use strict\";\nvar _a, _b;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TokenAmount = exports.stripTrailingZeroes = exports.validateU256 = exports.validateU64 = exports.TokenAmountUnderflow = exports.TokenAmountOverflow = exports.parseAmountFromString = exports.DEFAULT_GROUP_SEPARATOR = exports.DEFAULT_DECIMAL_SEPARATOR = exports.DEFAULT_LOCALE_GROUP_SEPARATOR = exports.DEFAULT_LOCALE_DECIMAL_SEPARATOR = exports.getGroupSeparator = exports.getDecimalSeparator = exports.getSeparator = void 0;\nconst tslib_1 = require(\"tslib\");\nconst big_js_1 = tslib_1.__importDefault(require(\"big.js\"));\nconst jsbi_1 = tslib_1.__importDefault(require(\"jsbi\"));\nconst tiny_invariant_1 = tslib_1.__importDefault(require(\"tiny-invariant\"));\nconst constants_js_1 = require(\"./constants.js\");\nconst format_js_1 = require(\"./format.js\");\nconst fraction_js_1 = require(\"./fraction.js\");\nconst percent_js_1 = require(\"./percent.js\");\nconst utils_js_1 = require(\"./utils.js\");\n/**\n * Gets the separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param separatorType\n * @param locale\n * @returns\n */\nconst getSeparator = (separatorType, locale) => {\n    var _a;\n    const numberWithDecimalSeparator = 1000.1;\n    return (_a = Intl.NumberFormat(locale)\n        .formatToParts(numberWithDecimalSeparator)\n        .find((part) => part.type === separatorType)) === null || _a === void 0 ? void 0 : _a.value;\n};\nexports.getSeparator = getSeparator;\n/**\n * Gets the decimal separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param locale\n * @returns\n */\nconst getDecimalSeparator = (locale) => {\n    return (0, exports.getSeparator)(\"decimal\", locale);\n};\nexports.getDecimalSeparator = getDecimalSeparator;\n/**\n * Gets the group separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param locale\n * @returns\n */\nconst getGroupSeparator = (locale) => {\n    return (0, exports.getSeparator)(\"group\", locale);\n};\nexports.getGroupSeparator = getGroupSeparator;\n/**\n * The decimal separator of the default locale.\n */\nexports.DEFAULT_LOCALE_DECIMAL_SEPARATOR = (_a = (0, exports.getDecimalSeparator)()) !== null && _a !== void 0 ? _a : \".\";\n/**\n * The group separator of the default locale.\n */\nexports.DEFAULT_LOCALE_GROUP_SEPARATOR = (_b = (0, exports.getGroupSeparator)()) !== null && _b !== void 0 ? _b : \",\";\n/**\n * The default decimal separator.\n */\nexports.DEFAULT_DECIMAL_SEPARATOR = \".\";\n/**\n * The default group separator.\n */\nexports.DEFAULT_GROUP_SEPARATOR = \",\";\n/**\n * Parses a token amount from a decimal representation.\n * @param token\n * @param uiAmount\n * @returns\n */\nconst parseAmountFromString = (token, uiAmount, decimalSeparator = exports.DEFAULT_DECIMAL_SEPARATOR, groupSeparator = exports.DEFAULT_GROUP_SEPARATOR) => {\n    const parts = uiAmount.split(decimalSeparator);\n    if (parts.length === 0) {\n        throw new Error(\"empty number\");\n    }\n    const [wholeRaw, fractionRaw] = parts;\n    const whole = wholeRaw\n        ? jsbi_1.default.BigInt(wholeRaw.split(groupSeparator).join(\"\"))\n        : constants_js_1.ZERO;\n    const fraction = fractionRaw\n        ? jsbi_1.default.BigInt(fractionRaw.slice(0, token.decimals) +\n            Array(token.decimals).fill(\"0\").slice(fractionRaw.length).join(\"\"))\n        : constants_js_1.ZERO;\n    const combined = jsbi_1.default.add(jsbi_1.default.multiply(whole, (0, utils_js_1.makeDecimalMultiplier)(token.decimals)), fraction);\n    return combined;\n};\nexports.parseAmountFromString = parseAmountFromString;\n/**\n * Thrown when a token amount overflows.\n */\nclass TokenAmountOverflow extends RangeError {\n    constructor(type, amount) {\n        super(`Token amount overflows ${type}: ${amount.toString()}`);\n    }\n}\nexports.TokenAmountOverflow = TokenAmountOverflow;\n/**\n * Thrown when a token amount underflows.\n */\nclass TokenAmountUnderflow extends RangeError {\n    constructor(amount) {\n        super(`Token amount must be greater than zero: ${amount.toString()}`);\n    }\n}\nexports.TokenAmountUnderflow = TokenAmountUnderflow;\n/**\n * Validates that a number falls within the range of u64.\n * @param value\n */\nfunction validateU64(value) {\n    if (!jsbi_1.default.greaterThanOrEqual(value, constants_js_1.ZERO)) {\n        throw new TokenAmountUnderflow(value);\n    }\n    if (!jsbi_1.default.lessThanOrEqual(value, constants_js_1.MAX_U64)) {\n        throw new TokenAmountOverflow(\"u64\", value);\n    }\n}\nexports.validateU64 = validateU64;\n/**\n * Validates that a number falls within the range of u256.\n * @param value\n */\nfunction validateU256(value) {\n    if (!jsbi_1.default.greaterThanOrEqual(value, constants_js_1.ZERO)) {\n        throw new TokenAmountUnderflow(value);\n    }\n    if (!jsbi_1.default.lessThanOrEqual(value, constants_js_1.MAX_U256)) {\n        throw new TokenAmountOverflow(\"u256\", value);\n    }\n}\nexports.validateU256 = validateU256;\nconst stripTrailingZeroes = (num) => {\n    const [head, tail, ...rest] = num.split(\".\");\n    if (rest.length > 0 || !head) {\n        console.warn(`Invalid number passed to stripTrailingZeroes: ${num}`);\n        return num;\n    }\n    if (!tail) {\n        return num;\n    }\n    const newTail = tail.replace(/0+$/, \"\");\n    return newTail === \"\" ? head : `${head}.${newTail}`;\n};\nexports.stripTrailingZeroes = stripTrailingZeroes;\n/**\n * Represents a quantity of tokens.\n */\nclass TokenAmount extends fraction_js_1.Fraction {\n    /**\n     * amount _must_ be raw, i.e. in the native representation\n     */\n    constructor(token, amount, validate) {\n        const parsedAmount = (0, utils_js_1.parseBigintIsh)(amount);\n        validate === null || validate === void 0 ? void 0 : validate(parsedAmount);\n        super(parsedAmount, (0, utils_js_1.makeDecimalMultiplier)(token.decimals));\n        this.token = token;\n        this.token = token;\n    }\n    withAmount(amount) {\n        return this.new(this.token, amount);\n    }\n    get raw() {\n        return this.numerator;\n    }\n    toSignificant(significantDigits = 6, format, rounding = constants_js_1.Rounding.ROUND_DOWN) {\n        return super.toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = this.token.decimals, format, rounding = constants_js_1.Rounding.ROUND_DOWN) {\n        (0, tiny_invariant_1.default)(decimalPlaces <= this.token.decimals, \"DECIMALS\");\n        return super.toFixed(decimalPlaces, format, rounding);\n    }\n    toExact(format = { groupSeparator: \"\" }) {\n        return (0, format_js_1.formatBig)(new big_js_1.default(this.numerator.toString()).div(this.denominator.toString()), this.token.decimals, format);\n    }\n    add(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `add token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        return this.withAmount(jsbi_1.default.add(this.raw, other.raw));\n    }\n    subtract(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `subtract token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        return this.withAmount(jsbi_1.default.subtract(this.raw, other.raw));\n    }\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @returns\n     */\n    percentOf(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `percentOf token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        const frac = this.divide(other);\n        return new percent_js_1.Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @returns\n     */\n    divideBy(other) {\n        const frac = this.divide(other);\n        return new percent_js_1.Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Multiplies this token amount by a fraction.\n     * WARNING: this loses precision\n     * @param percent\n     * @returns\n     */\n    scale(fraction) {\n        return this.withAmount(fraction.asFraction.multiply(this.raw).toFixed(0));\n    }\n    /**\n     * Reduces this token amount by a percent.\n     * WARNING: this loses precision\n     * @param percent\n     * @returns\n     */\n    reduceBy(percent) {\n        return this.scale(percent_js_1.Percent.ONE_HUNDRED.subtract(percent));\n    }\n    /**\n     * Formats the token amount quantity with units.\n     *\n     * This function is not locale-specific: it hardcodes \"en-US\"-like behavior.\n     *\n     * @returns\n     */\n    formatUnits() {\n        return `${(0, exports.stripTrailingZeroes)(this.toExact({\n            groupSeparator: exports.DEFAULT_GROUP_SEPARATOR,\n            groupSize: 3,\n            decimalSeparator: exports.DEFAULT_DECIMAL_SEPARATOR,\n        }))} ${this.token.symbol}`;\n    }\n    /**\n     * Formats this number using Intl.NumberFormatOptions\n     * @param param0\n     * @returns\n     */\n    format({ numberFormatOptions, locale } = {}) {\n        return `${numberFormatOptions !== undefined\n            ? this.asNumber.toLocaleString(locale, numberFormatOptions)\n            : (0, exports.stripTrailingZeroes)(this.toFixed(this.token.decimals))}`;\n    }\n    /**\n     * Gets the value of this {@link TokenAmount} as a number.\n     */\n    get asNumber() {\n        return parseFloat(this.toExact());\n    }\n    /**\n     * Returns true if the other object is a {@link TokenAmount}.\n     *\n     * @param other\n     * @returns\n     */\n    static isTokenAmount(other) {\n        return (fraction_js_1.Fraction.isFraction(other) &&\n            !!(other === null || other === void 0 ? void 0 : other.token));\n    }\n    // ----------------------------------------------------------------\n    // DEPRECATED FUNCTIONS\n    // ----------------------------------------------------------------\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @deprecated use {@link percentOf}\n     * @returns\n     */\n    divideByAmount(other) {\n        return this.percentOf(other);\n    }\n    /**\n     * Multiplies this token amount by a fraction.\n     * WARNING: this loses precision\n     * @param percent\n     * @deprecated use {@link scale}\n     * @returns\n     */\n    multiplyBy(fraction) {\n        return this.scale(fraction);\n    }\n}\nexports.TokenAmount = TokenAmount;\n//# sourceMappingURL=tokenAmount.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.makeDecimalMultiplier = exports.parseBigintIsh = exports.isBN = void 0;\nconst tslib_1 = require(\"tslib\");\nconst jsbi_1 = tslib_1.__importDefault(require(\"jsbi\"));\nconst constants_js_1 = require(\"./constants.js\");\nconst BN_WORD_SIZE = 26;\n/**\n * Checks if an object is a BN.\n */\nconst isBN = (num) => {\n    return (num !== null &&\n        typeof num === \"object\" &&\n        num.constructor.wordSize === BN_WORD_SIZE &&\n        Array.isArray(num.words));\n};\nexports.isBN = isBN;\n/**\n * Parses a {@link BigintIsh} into a {@link JSBI}.\n * @param bigintIsh\n * @returns\n */\nfunction parseBigintIsh(bigintIsh) {\n    return bigintIsh instanceof jsbi_1.default\n        ? bigintIsh\n        : typeof bigintIsh === \"string\" || typeof bigintIsh === \"number\"\n            ? jsbi_1.default.BigInt(bigintIsh)\n            : typeof bigintIsh === \"bigint\" || (0, exports.isBN)(bigintIsh)\n                ? jsbi_1.default.BigInt(bigintIsh.toString())\n                : jsbi_1.default.BigInt(bigintIsh);\n}\nexports.parseBigintIsh = parseBigintIsh;\nconst decimalMultipliersCache = {};\n/**\n * Creates the multiplier for an amount of decimals.\n * @param decimals\n * @returns\n */\nconst makeDecimalMultiplier = (decimals) => {\n    const cached = decimalMultipliersCache[decimals];\n    if (cached) {\n        return cached;\n    }\n    if (decimals <= 18) {\n        return (decimalMultipliersCache[decimals] = jsbi_1.default.BigInt(10 ** decimals));\n    }\n    return (decimalMultipliersCache[decimals] = jsbi_1.default.exponentiate(constants_js_1.TEN, jsbi_1.default.BigInt(decimals)));\n};\nexports.makeDecimalMultiplier = makeDecimalMultiplier;\n//# sourceMappingURL=utils.js.map","// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b\n\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nvar _require = require('./internal/errors'),\n  _require$codes = _require.codes,\n  ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT,\n  ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n  ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE,\n  ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE,\n  ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS;\nvar AssertionError = require('./internal/assert/assertion_error');\nvar _require2 = require('util/'),\n  inspect = _require2.inspect;\nvar _require$types = require('util/').types,\n  isPromise = _require$types.isPromise,\n  isRegExp = _require$types.isRegExp;\nvar objectAssign = require('object.assign/polyfill')();\nvar objectIs = require('object-is/polyfill')();\nvar RegExpPrototypeTest = require('call-bind/callBound')('RegExp.prototype.test');\nvar errorCache = new Map();\nvar isDeepEqual;\nvar isDeepStrictEqual;\nvar parseExpressionAt;\nvar findNodeAround;\nvar decoder;\nfunction lazyLoadComparison() {\n  var comparison = require('./internal/util/comparisons');\n  isDeepEqual = comparison.isDeepEqual;\n  isDeepStrictEqual = comparison.isDeepStrictEqual;\n}\n\n// Escape control characters but not \\n and \\t to keep the line breaks and\n// indentation intact.\n// eslint-disable-next-line no-control-regex\nvar escapeSequencesRegExp = /[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f]/g;\nvar meta = [\"\\\\u0000\", \"\\\\u0001\", \"\\\\u0002\", \"\\\\u0003\", \"\\\\u0004\", \"\\\\u0005\", \"\\\\u0006\", \"\\\\u0007\", '\\\\b', '', '', \"\\\\u000b\", '\\\\f', '', \"\\\\u000e\", \"\\\\u000f\", \"\\\\u0010\", \"\\\\u0011\", \"\\\\u0012\", \"\\\\u0013\", \"\\\\u0014\", \"\\\\u0015\", \"\\\\u0016\", \"\\\\u0017\", \"\\\\u0018\", \"\\\\u0019\", \"\\\\u001a\", \"\\\\u001b\", \"\\\\u001c\", \"\\\\u001d\", \"\\\\u001e\", \"\\\\u001f\"];\nvar escapeFn = function escapeFn(str) {\n  return meta[str.charCodeAt(0)];\n};\nvar warned = false;\n\n// The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\nvar NO_EXCEPTION_SENTINEL = {};\n\n// All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction innerFail(obj) {\n  if (obj.message instanceof Error) throw obj.message;\n  throw new AssertionError(obj);\n}\nfunction fail(actual, expected, message, operator, stackStartFn) {\n  var argsLen = arguments.length;\n  var internalMessage;\n  if (argsLen === 0) {\n    internalMessage = 'Failed';\n  } else if (argsLen === 1) {\n    message = actual;\n    actual = undefined;\n  } else {\n    if (warned === false) {\n      warned = true;\n      var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console);\n      warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094');\n    }\n    if (argsLen === 2) operator = '!=';\n  }\n  if (message instanceof Error) throw message;\n  var errArgs = {\n    actual: actual,\n    expected: expected,\n    operator: operator === undefined ? 'fail' : operator,\n    stackStartFn: stackStartFn || fail\n  };\n  if (message !== undefined) {\n    errArgs.message = message;\n  }\n  var err = new AssertionError(errArgs);\n  if (internalMessage) {\n    err.message = internalMessage;\n    err.generatedMessage = true;\n  }\n  throw err;\n}\nassert.fail = fail;\n\n// The AssertionError is defined in internal/error.\nassert.AssertionError = AssertionError;\nfunction innerOk(fn, argLen, value, message) {\n  if (!value) {\n    var generatedMessage = false;\n    if (argLen === 0) {\n      generatedMessage = true;\n      message = 'No value argument passed to `assert.ok()`';\n    } else if (message instanceof Error) {\n      throw message;\n    }\n    var err = new AssertionError({\n      actual: value,\n      expected: true,\n      message: message,\n      operator: '==',\n      stackStartFn: fn\n    });\n    err.generatedMessage = generatedMessage;\n    throw err;\n  }\n}\n\n// Pure assertion tests whether a value is truthy, as determined\n// by !!value.\nfunction ok() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n  innerOk.apply(void 0, [ok, args.length].concat(args));\n}\nassert.ok = ok;\n\n// The equality assertion tests shallow, coercive equality with ==.\n/* eslint-disable no-restricted-properties */\nassert.equal = function equal(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  // eslint-disable-next-line eqeqeq\n  if (actual != expected) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: '==',\n      stackStartFn: equal\n    });\n  }\n};\n\n// The non-equality assertion tests for whether two objects are not\n// equal with !=.\nassert.notEqual = function notEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  // eslint-disable-next-line eqeqeq\n  if (actual == expected) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: '!=',\n      stackStartFn: notEqual\n    });\n  }\n};\n\n// The equivalence assertion tests a deep equality relation.\nassert.deepEqual = function deepEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (!isDeepEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'deepEqual',\n      stackStartFn: deepEqual\n    });\n  }\n};\n\n// The non-equivalence assertion tests for any deep inequality.\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (isDeepEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notDeepEqual',\n      stackStartFn: notDeepEqual\n    });\n  }\n};\n/* eslint-enable */\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (!isDeepStrictEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'deepStrictEqual',\n      stackStartFn: deepStrictEqual\n    });\n  }\n};\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (isDeepStrictEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notDeepStrictEqual',\n      stackStartFn: notDeepStrictEqual\n    });\n  }\n}\nassert.strictEqual = function strictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (!objectIs(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'strictEqual',\n      stackStartFn: strictEqual\n    });\n  }\n};\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (objectIs(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notStrictEqual',\n      stackStartFn: notStrictEqual\n    });\n  }\n};\nvar Comparison = /*#__PURE__*/_createClass(function Comparison(obj, keys, actual) {\n  var _this = this;\n  _classCallCheck(this, Comparison);\n  keys.forEach(function (key) {\n    if (key in obj) {\n      if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && RegExpPrototypeTest(obj[key], actual[key])) {\n        _this[key] = actual[key];\n      } else {\n        _this[key] = obj[key];\n      }\n    }\n  });\n});\nfunction compareExceptionKey(actual, expected, key, message, keys, fn) {\n  if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) {\n    if (!message) {\n      // Create placeholder objects to create a nice output.\n      var a = new Comparison(actual, keys);\n      var b = new Comparison(expected, keys, actual);\n      var err = new AssertionError({\n        actual: a,\n        expected: b,\n        operator: 'deepStrictEqual',\n        stackStartFn: fn\n      });\n      err.actual = actual;\n      err.expected = expected;\n      err.operator = fn.name;\n      throw err;\n    }\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: fn.name,\n      stackStartFn: fn\n    });\n  }\n}\nfunction expectedException(actual, expected, msg, fn) {\n  if (typeof expected !== 'function') {\n    if (isRegExp(expected)) return RegExpPrototypeTest(expected, actual);\n    // assert.doesNotThrow does not accept objects.\n    if (arguments.length === 2) {\n      throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected);\n    }\n\n    // Handle primitives properly.\n    if (_typeof(actual) !== 'object' || actual === null) {\n      var err = new AssertionError({\n        actual: actual,\n        expected: expected,\n        message: msg,\n        operator: 'deepStrictEqual',\n        stackStartFn: fn\n      });\n      err.operator = fn.name;\n      throw err;\n    }\n    var keys = Object.keys(expected);\n    // Special handle errors to make sure the name and the message are compared\n    // as well.\n    if (expected instanceof Error) {\n      keys.push('name', 'message');\n    } else if (keys.length === 0) {\n      throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object');\n    }\n    if (isDeepEqual === undefined) lazyLoadComparison();\n    keys.forEach(function (key) {\n      if (typeof actual[key] === 'string' && isRegExp(expected[key]) && RegExpPrototypeTest(expected[key], actual[key])) {\n        return;\n      }\n      compareExceptionKey(actual, expected, key, msg, keys, fn);\n    });\n    return true;\n  }\n  // Guard instanceof against arrow functions as they don't have a prototype.\n  if (expected.prototype !== undefined && actual instanceof expected) {\n    return true;\n  }\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n  return expected.call({}, actual) === true;\n}\nfunction getActual(fn) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn);\n  }\n  try {\n    fn();\n  } catch (e) {\n    return e;\n  }\n  return NO_EXCEPTION_SENTINEL;\n}\nfunction checkIsPromise(obj) {\n  // Accept native ES6 promises and promises that are implemented in a similar\n  // way. Do not accept thenables that use a function as `obj` and that have no\n  // `catch` handler.\n\n  // TODO: thenables are checked up until they have the correct methods,\n  // but according to documentation, the `then` method should receive\n  // the `fulfill` and `reject` arguments as well or it may be never resolved.\n\n  return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function';\n}\nfunction waitForActual(promiseFn) {\n  return Promise.resolve().then(function () {\n    var resultPromise;\n    if (typeof promiseFn === 'function') {\n      // Return a rejected promise if `promiseFn` throws synchronously.\n      resultPromise = promiseFn();\n      // Fail in case no promise is returned.\n      if (!checkIsPromise(resultPromise)) {\n        throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise);\n      }\n    } else if (checkIsPromise(promiseFn)) {\n      resultPromise = promiseFn;\n    } else {\n      throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn);\n    }\n    return Promise.resolve().then(function () {\n      return resultPromise;\n    }).then(function () {\n      return NO_EXCEPTION_SENTINEL;\n    }).catch(function (e) {\n      return e;\n    });\n  });\n}\nfunction expectsError(stackStartFn, actual, error, message) {\n  if (typeof error === 'string') {\n    if (arguments.length === 4) {\n      throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n    }\n    if (_typeof(actual) === 'object' && actual !== null) {\n      if (actual.message === error) {\n        throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error message \\\"\".concat(actual.message, \"\\\" is identical to the message.\"));\n      }\n    } else if (actual === error) {\n      throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error \\\"\".concat(actual, \"\\\" is identical to the message.\"));\n    }\n    message = error;\n    error = undefined;\n  } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n  }\n  if (actual === NO_EXCEPTION_SENTINEL) {\n    var details = '';\n    if (error && error.name) {\n      details += \" (\".concat(error.name, \")\");\n    }\n    details += message ? \": \".concat(message) : '.';\n    var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception';\n    innerFail({\n      actual: undefined,\n      expected: error,\n      operator: stackStartFn.name,\n      message: \"Missing expected \".concat(fnType).concat(details),\n      stackStartFn: stackStartFn\n    });\n  }\n  if (error && !expectedException(actual, error, message, stackStartFn)) {\n    throw actual;\n  }\n}\nfunction expectsNoError(stackStartFn, actual, error, message) {\n  if (actual === NO_EXCEPTION_SENTINEL) return;\n  if (typeof error === 'string') {\n    message = error;\n    error = undefined;\n  }\n  if (!error || expectedException(actual, error)) {\n    var details = message ? \": \".concat(message) : '.';\n    var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception';\n    innerFail({\n      actual: actual,\n      expected: error,\n      operator: stackStartFn.name,\n      message: \"Got unwanted \".concat(fnType).concat(details, \"\\n\") + \"Actual message: \\\"\".concat(actual && actual.message, \"\\\"\"),\n      stackStartFn: stackStartFn\n    });\n  }\n  throw actual;\n}\nassert.throws = function throws(promiseFn) {\n  for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n    args[_key2 - 1] = arguments[_key2];\n  }\n  expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args));\n};\nassert.rejects = function rejects(promiseFn) {\n  for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n    args[_key3 - 1] = arguments[_key3];\n  }\n  return waitForActual(promiseFn).then(function (result) {\n    return expectsError.apply(void 0, [rejects, result].concat(args));\n  });\n};\nassert.doesNotThrow = function doesNotThrow(fn) {\n  for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n    args[_key4 - 1] = arguments[_key4];\n  }\n  expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args));\n};\nassert.doesNotReject = function doesNotReject(fn) {\n  for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {\n    args[_key5 - 1] = arguments[_key5];\n  }\n  return waitForActual(fn).then(function (result) {\n    return expectsNoError.apply(void 0, [doesNotReject, result].concat(args));\n  });\n};\nassert.ifError = function ifError(err) {\n  if (err !== null && err !== undefined) {\n    var message = 'ifError got unwanted exception: ';\n    if (_typeof(err) === 'object' && typeof err.message === 'string') {\n      if (err.message.length === 0 && err.constructor) {\n        message += err.constructor.name;\n      } else {\n        message += err.message;\n      }\n    } else {\n      message += inspect(err);\n    }\n    var newErr = new AssertionError({\n      actual: err,\n      expected: null,\n      operator: 'ifError',\n      message: message,\n      stackStartFn: ifError\n    });\n\n    // Make sure we actually have a stack trace!\n    var origStack = err.stack;\n    if (typeof origStack === 'string') {\n      // This will remove any duplicated frames from the error frames taken\n      // from within `ifError` and add the original error frames to the newly\n      // created ones.\n      var tmp2 = origStack.split('\\n');\n      tmp2.shift();\n      // Filter all frames existing in err.stack.\n      var tmp1 = newErr.stack.split('\\n');\n      for (var i = 0; i < tmp2.length; i++) {\n        // Find the first occurrence of the frame.\n        var pos = tmp1.indexOf(tmp2[i]);\n        if (pos !== -1) {\n          // Only keep new frames.\n          tmp1 = tmp1.slice(0, pos);\n          break;\n        }\n      }\n      newErr.stack = \"\".concat(tmp1.join('\\n'), \"\\n\").concat(tmp2.join('\\n'));\n    }\n    throw newErr;\n  }\n};\n\n// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a871df3dfb8ea663ef5e1f8f62701ec51384ecb\nfunction internalMatch(string, regexp, message, fn, fnName) {\n  if (!isRegExp(regexp)) {\n    throw new ERR_INVALID_ARG_TYPE('regexp', 'RegExp', regexp);\n  }\n  var match = fnName === 'match';\n  if (typeof string !== 'string' || RegExpPrototypeTest(regexp, string) !== match) {\n    if (message instanceof Error) {\n      throw message;\n    }\n    var generatedMessage = !message;\n\n    // 'The input was expected to not match the regular expression ' +\n    message = message || (typeof string !== 'string' ? 'The \"string\" argument must be of type string. Received type ' + \"\".concat(_typeof(string), \" (\").concat(inspect(string), \")\") : (match ? 'The input did not match the regular expression ' : 'The input was expected to not match the regular expression ') + \"\".concat(inspect(regexp), \". Input:\\n\\n\").concat(inspect(string), \"\\n\"));\n    var err = new AssertionError({\n      actual: string,\n      expected: regexp,\n      message: message,\n      operator: fnName,\n      stackStartFn: fn\n    });\n    err.generatedMessage = generatedMessage;\n    throw err;\n  }\n}\nassert.match = function match(string, regexp, message) {\n  internalMatch(string, regexp, message, match, 'match');\n};\nassert.doesNotMatch = function doesNotMatch(string, regexp, message) {\n  internalMatch(string, regexp, message, doesNotMatch, 'doesNotMatch');\n};\n\n// Expose a strict only variant of assert\nfunction strict() {\n  for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n    args[_key6] = arguments[_key6];\n  }\n  innerOk.apply(void 0, [strict, args.length].concat(args));\n}\nassert.strict = objectAssign(strict, assert, {\n  equal: assert.strictEqual,\n  deepEqual: assert.deepStrictEqual,\n  notEqual: assert.notStrictEqual,\n  notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;","// Currently in sync with Node.js lib/internal/assert/assertion_error.js\n// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c\n\n'use strict';\n\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct.bind(); } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nvar _require = require('util/'),\n  inspect = _require.inspect;\nvar _require2 = require('../errors'),\n  ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE;\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n  return str.substring(this_len - search.length, this_len) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat\nfunction repeat(str, count) {\n  count = Math.floor(count);\n  if (str.length == 0 || count == 0) return '';\n  var maxCount = str.length * count;\n  count = Math.floor(Math.log(count) / Math.log(2));\n  while (count) {\n    str += str;\n    count--;\n  }\n  str += str.substring(0, maxCount - str.length);\n  return str;\n}\nvar blue = '';\nvar green = '';\nvar red = '';\nvar white = '';\nvar kReadableOperator = {\n  deepStrictEqual: 'Expected values to be strictly deep-equal:',\n  strictEqual: 'Expected values to be strictly equal:',\n  strictEqualObject: 'Expected \"actual\" to be reference-equal to \"expected\":',\n  deepEqual: 'Expected values to be loosely deep-equal:',\n  equal: 'Expected values to be loosely equal:',\n  notDeepStrictEqual: 'Expected \"actual\" not to be strictly deep-equal to:',\n  notStrictEqual: 'Expected \"actual\" to be strictly unequal to:',\n  notStrictEqualObject: 'Expected \"actual\" not to be reference-equal to \"expected\":',\n  notDeepEqual: 'Expected \"actual\" not to be loosely deep-equal to:',\n  notEqual: 'Expected \"actual\" to be loosely unequal to:',\n  notIdentical: 'Values identical but not reference-equal:'\n};\n\n// Comparing short primitives should just show === / !== instead of using the\n// diff.\nvar kMaxShortLength = 10;\nfunction copyError(source) {\n  var keys = Object.keys(source);\n  var target = Object.create(Object.getPrototypeOf(source));\n  keys.forEach(function (key) {\n    target[key] = source[key];\n  });\n  Object.defineProperty(target, 'message', {\n    value: source.message\n  });\n  return target;\n}\nfunction inspectValue(val) {\n  // The util.inspect default values could be changed. This makes sure the\n  // error messages contain the necessary information nevertheless.\n  return inspect(val, {\n    compact: false,\n    customInspect: false,\n    depth: 1000,\n    maxArrayLength: Infinity,\n    // Assert compares only enumerable properties (with a few exceptions).\n    showHidden: false,\n    // Having a long line as error is better than wrapping the line for\n    // comparison for now.\n    // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we\n    // have meta information about the inspected properties (i.e., know where\n    // in what line the property starts and ends).\n    breakLength: Infinity,\n    // Assert does not detect proxies currently.\n    showProxy: false,\n    sorted: true,\n    // Inspect getters as we also check them when comparing entries.\n    getters: true\n  });\n}\nfunction createErrDiff(actual, expected, operator) {\n  var other = '';\n  var res = '';\n  var lastPos = 0;\n  var end = '';\n  var skipped = false;\n  var actualInspected = inspectValue(actual);\n  var actualLines = actualInspected.split('\\n');\n  var expectedLines = inspectValue(expected).split('\\n');\n  var i = 0;\n  var indicator = '';\n\n  // In case both values are objects explicitly mark them as not reference equal\n  // for the `strictEqual` operator.\n  if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) {\n    operator = 'strictEqualObject';\n  }\n\n  // If \"actual\" and \"expected\" fit on a single line and they are not strictly\n  // equal, check further special handling.\n  if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) {\n    var inputLength = actualLines[0].length + expectedLines[0].length;\n    // If the character length of \"actual\" and \"expected\" together is less than\n    // kMaxShortLength and if neither is an object and at least one of them is\n    // not `zero`, use the strict equal comparison to visualize the output.\n    if (inputLength <= kMaxShortLength) {\n      if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) {\n        // -0 === +0\n        return \"\".concat(kReadableOperator[operator], \"\\n\\n\") + \"\".concat(actualLines[0], \" !== \").concat(expectedLines[0], \"\\n\");\n      }\n    } else if (operator !== 'strictEqualObject') {\n      // If the stderr is a tty and the input length is lower than the current\n      // columns per line, add a mismatch indicator below the output. If it is\n      // not a tty, use a default value of 80 characters.\n      var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80;\n      if (inputLength < maxLength) {\n        while (actualLines[0][i] === expectedLines[0][i]) {\n          i++;\n        }\n        // Ignore the first characters.\n        if (i > 2) {\n          // Add position indicator for the first mismatch in case it is a\n          // single line and the input length is less than the column length.\n          indicator = \"\\n  \".concat(repeat(' ', i), \"^\");\n          i = 0;\n        }\n      }\n    }\n  }\n\n  // Remove all ending lines that match (this optimizes the output for\n  // readability by reducing the number of total changed lines).\n  var a = actualLines[actualLines.length - 1];\n  var b = expectedLines[expectedLines.length - 1];\n  while (a === b) {\n    if (i++ < 2) {\n      end = \"\\n  \".concat(a).concat(end);\n    } else {\n      other = a;\n    }\n    actualLines.pop();\n    expectedLines.pop();\n    if (actualLines.length === 0 || expectedLines.length === 0) break;\n    a = actualLines[actualLines.length - 1];\n    b = expectedLines[expectedLines.length - 1];\n  }\n  var maxLines = Math.max(actualLines.length, expectedLines.length);\n  // Strict equal with identical objects that are not identical by reference.\n  // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() })\n  if (maxLines === 0) {\n    // We have to get the result again. The lines were all removed before.\n    var _actualLines = actualInspected.split('\\n');\n\n    // Only remove lines in case it makes sense to collapse those.\n    // TODO: Accept env to always show the full error.\n    if (_actualLines.length > 30) {\n      _actualLines[26] = \"\".concat(blue, \"...\").concat(white);\n      while (_actualLines.length > 27) {\n        _actualLines.pop();\n      }\n    }\n    return \"\".concat(kReadableOperator.notIdentical, \"\\n\\n\").concat(_actualLines.join('\\n'), \"\\n\");\n  }\n  if (i > 3) {\n    end = \"\\n\".concat(blue, \"...\").concat(white).concat(end);\n    skipped = true;\n  }\n  if (other !== '') {\n    end = \"\\n  \".concat(other).concat(end);\n    other = '';\n  }\n  var printedLines = 0;\n  var msg = kReadableOperator[operator] + \"\\n\".concat(green, \"+ actual\").concat(white, \" \").concat(red, \"- expected\").concat(white);\n  var skippedMsg = \" \".concat(blue, \"...\").concat(white, \" Lines skipped\");\n  for (i = 0; i < maxLines; i++) {\n    // Only extra expected lines exist\n    var cur = i - lastPos;\n    if (actualLines.length < i + 1) {\n      // If the last diverging line is more than one line above and the\n      // current line is at least line three, add some of the former lines and\n      // also add dots to indicate skipped entries.\n      if (cur > 1 && i > 2) {\n        if (cur > 4) {\n          res += \"\\n\".concat(blue, \"...\").concat(white);\n          skipped = true;\n        } else if (cur > 3) {\n          res += \"\\n  \".concat(expectedLines[i - 2]);\n          printedLines++;\n        }\n        res += \"\\n  \".concat(expectedLines[i - 1]);\n        printedLines++;\n      }\n      // Mark the current line as the last diverging one.\n      lastPos = i;\n      // Add the expected line to the cache.\n      other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLines[i]);\n      printedLines++;\n      // Only extra actual lines exist\n    } else if (expectedLines.length < i + 1) {\n      // If the last diverging line is more than one line above and the\n      // current line is at least line three, add some of the former lines and\n      // also add dots to indicate skipped entries.\n      if (cur > 1 && i > 2) {\n        if (cur > 4) {\n          res += \"\\n\".concat(blue, \"...\").concat(white);\n          skipped = true;\n        } else if (cur > 3) {\n          res += \"\\n  \".concat(actualLines[i - 2]);\n          printedLines++;\n        }\n        res += \"\\n  \".concat(actualLines[i - 1]);\n        printedLines++;\n      }\n      // Mark the current line as the last diverging one.\n      lastPos = i;\n      // Add the actual line to the result.\n      res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLines[i]);\n      printedLines++;\n      // Lines diverge\n    } else {\n      var expectedLine = expectedLines[i];\n      var actualLine = actualLines[i];\n      // If the lines diverge, specifically check for lines that only diverge by\n      // a trailing comma. In that case it is actually identical and we should\n      // mark it as such.\n      var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine);\n      // If the expected line has a trailing comma but is otherwise identical,\n      // add a comma at the end of the actual line. Otherwise the output could\n      // look weird as in:\n      //\n      //   [\n      //     1         // No comma at the end!\n      // +   2\n      //   ]\n      //\n      if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) {\n        divergingLines = false;\n        actualLine += ',';\n      }\n      if (divergingLines) {\n        // If the last diverging line is more than one line above and the\n        // current line is at least line three, add some of the former lines and\n        // also add dots to indicate skipped entries.\n        if (cur > 1 && i > 2) {\n          if (cur > 4) {\n            res += \"\\n\".concat(blue, \"...\").concat(white);\n            skipped = true;\n          } else if (cur > 3) {\n            res += \"\\n  \".concat(actualLines[i - 2]);\n            printedLines++;\n          }\n          res += \"\\n  \".concat(actualLines[i - 1]);\n          printedLines++;\n        }\n        // Mark the current line as the last diverging one.\n        lastPos = i;\n        // Add the actual line to the result and cache the expected diverging\n        // line so consecutive diverging lines show up as +++--- and not +-+-+-.\n        res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLine);\n        other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLine);\n        printedLines += 2;\n        // Lines are identical\n      } else {\n        // Add all cached information to the result before adding other things\n        // and reset the cache.\n        res += other;\n        other = '';\n        // If the last diverging line is exactly one line above or if it is the\n        // very first line, add the line to the result.\n        if (cur === 1 || i === 0) {\n          res += \"\\n  \".concat(actualLine);\n          printedLines++;\n        }\n      }\n    }\n    // Inspected object to big (Show ~20 rows max)\n    if (printedLines > 20 && i < maxLines - 2) {\n      return \"\".concat(msg).concat(skippedMsg, \"\\n\").concat(res, \"\\n\").concat(blue, \"...\").concat(white).concat(other, \"\\n\") + \"\".concat(blue, \"...\").concat(white);\n    }\n  }\n  return \"\".concat(msg).concat(skipped ? skippedMsg : '', \"\\n\").concat(res).concat(other).concat(end).concat(indicator);\n}\nvar AssertionError = /*#__PURE__*/function (_Error, _inspect$custom) {\n  _inherits(AssertionError, _Error);\n  var _super = _createSuper(AssertionError);\n  function AssertionError(options) {\n    var _this;\n    _classCallCheck(this, AssertionError);\n    if (_typeof(options) !== 'object' || options === null) {\n      throw new ERR_INVALID_ARG_TYPE('options', 'Object', options);\n    }\n    var message = options.message,\n      operator = options.operator,\n      stackStartFn = options.stackStartFn;\n    var actual = options.actual,\n      expected = options.expected;\n    var limit = Error.stackTraceLimit;\n    Error.stackTraceLimit = 0;\n    if (message != null) {\n      _this = _super.call(this, String(message));\n    } else {\n      if (process.stderr && process.stderr.isTTY) {\n        // Reset on each call to make sure we handle dynamically set environment\n        // variables correct.\n        if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) {\n          blue = \"\\x1B[34m\";\n          green = \"\\x1B[32m\";\n          white = \"\\x1B[39m\";\n          red = \"\\x1B[31m\";\n        } else {\n          blue = '';\n          green = '';\n          white = '';\n          red = '';\n        }\n      }\n      // Prevent the error stack from being visible by duplicating the error\n      // in a very close way to the original in case both sides are actually\n      // instances of Error.\n      if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) {\n        actual = copyError(actual);\n        expected = copyError(expected);\n      }\n      if (operator === 'deepStrictEqual' || operator === 'strictEqual') {\n        _this = _super.call(this, createErrDiff(actual, expected, operator));\n      } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') {\n        // In case the objects are equal but the operator requires unequal, show\n        // the first object and say A equals B\n        var base = kReadableOperator[operator];\n        var res = inspectValue(actual).split('\\n');\n\n        // In case \"actual\" is an object, it should not be reference equal.\n        if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) {\n          base = kReadableOperator.notStrictEqualObject;\n        }\n\n        // Only remove lines in case it makes sense to collapse those.\n        // TODO: Accept env to always show the full error.\n        if (res.length > 30) {\n          res[26] = \"\".concat(blue, \"...\").concat(white);\n          while (res.length > 27) {\n            res.pop();\n          }\n        }\n\n        // Only print a single input.\n        if (res.length === 1) {\n          _this = _super.call(this, \"\".concat(base, \" \").concat(res[0]));\n        } else {\n          _this = _super.call(this, \"\".concat(base, \"\\n\\n\").concat(res.join('\\n'), \"\\n\"));\n        }\n      } else {\n        var _res = inspectValue(actual);\n        var other = '';\n        var knownOperators = kReadableOperator[operator];\n        if (operator === 'notDeepEqual' || operator === 'notEqual') {\n          _res = \"\".concat(kReadableOperator[operator], \"\\n\\n\").concat(_res);\n          if (_res.length > 1024) {\n            _res = \"\".concat(_res.slice(0, 1021), \"...\");\n          }\n        } else {\n          other = \"\".concat(inspectValue(expected));\n          if (_res.length > 512) {\n            _res = \"\".concat(_res.slice(0, 509), \"...\");\n          }\n          if (other.length > 512) {\n            other = \"\".concat(other.slice(0, 509), \"...\");\n          }\n          if (operator === 'deepEqual' || operator === 'equal') {\n            _res = \"\".concat(knownOperators, \"\\n\\n\").concat(_res, \"\\n\\nshould equal\\n\\n\");\n          } else {\n            other = \" \".concat(operator, \" \").concat(other);\n          }\n        }\n        _this = _super.call(this, \"\".concat(_res).concat(other));\n      }\n    }\n    Error.stackTraceLimit = limit;\n    _this.generatedMessage = !message;\n    Object.defineProperty(_assertThisInitialized(_this), 'name', {\n      value: 'AssertionError [ERR_ASSERTION]',\n      enumerable: false,\n      writable: true,\n      configurable: true\n    });\n    _this.code = 'ERR_ASSERTION';\n    _this.actual = actual;\n    _this.expected = expected;\n    _this.operator = operator;\n    if (Error.captureStackTrace) {\n      // eslint-disable-next-line no-restricted-syntax\n      Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn);\n    }\n    // Create error message including the error code in the name.\n    _this.stack;\n    // Reset the name.\n    _this.name = 'AssertionError';\n    return _possibleConstructorReturn(_this);\n  }\n  _createClass(AssertionError, [{\n    key: \"toString\",\n    value: function toString() {\n      return \"\".concat(this.name, \" [\").concat(this.code, \"]: \").concat(this.message);\n    }\n  }, {\n    key: _inspect$custom,\n    value: function value(recurseTimes, ctx) {\n      // This limits the `actual` and `expected` property default inspection to\n      // the minimum depth. Otherwise those values would be too verbose compared\n      // to the actual error message which contains a combined view of these two\n      // input values.\n      return inspect(this, _objectSpread(_objectSpread({}, ctx), {}, {\n        customInspect: false,\n        depth: 0\n      }));\n    }\n  }]);\n  return AssertionError;\n}( /*#__PURE__*/_wrapNativeSuper(Error), inspect.custom);\nmodule.exports = AssertionError;","// Currently in sync with Node.js lib/internal/errors.js\n// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f\n\n/* eslint node-core/documented-errors: \"error\" */\n/* eslint node-core/alphabetize-errors: \"error\" */\n/* eslint node-core/prefer-util-format-errors: \"error\" */\n\n'use strict';\n\n// The whole point behind this internal module is to allow Node.js to no\n// longer be forced to treat every error message change as a semver-major\n// change. The NodeError classes here all expose a `code` property whose\n// value statically and permanently identifies the error. While the error\n// message may change, the code should not.\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nvar codes = {};\n\n// Lazy loaded\nvar assert;\nvar util;\nfunction createErrorType(code, message, Base) {\n  if (!Base) {\n    Base = Error;\n  }\n  function getMessage(arg1, arg2, arg3) {\n    if (typeof message === 'string') {\n      return message;\n    } else {\n      return message(arg1, arg2, arg3);\n    }\n  }\n  var NodeError = /*#__PURE__*/function (_Base) {\n    _inherits(NodeError, _Base);\n    var _super = _createSuper(NodeError);\n    function NodeError(arg1, arg2, arg3) {\n      var _this;\n      _classCallCheck(this, NodeError);\n      _this = _super.call(this, getMessage(arg1, arg2, arg3));\n      _this.code = code;\n      return _this;\n    }\n    return _createClass(NodeError);\n  }(Base);\n  codes[code] = NodeError;\n}\n\n// https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\nfunction oneOf(expected, thing) {\n  if (Array.isArray(expected)) {\n    var len = expected.length;\n    expected = expected.map(function (i) {\n      return String(i);\n    });\n    if (len > 2) {\n      return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n    } else if (len === 2) {\n      return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n    } else {\n      return \"of \".concat(thing, \" \").concat(expected[0]);\n    }\n  } else {\n    return \"of \".concat(thing, \" \").concat(String(expected));\n  }\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\nfunction startsWith(str, search, pos) {\n  return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n  return str.substring(this_len - search.length, this_len) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\nfunction includes(str, search, start) {\n  if (typeof start !== 'number') {\n    start = 0;\n  }\n  if (start + search.length > str.length) {\n    return false;\n  } else {\n    return str.indexOf(search, start) !== -1;\n  }\n}\ncreateErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The \"%s\" argument is ambiguous. %s', TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n  if (assert === undefined) assert = require('../assert');\n  assert(typeof name === 'string', \"'name' must be a string\");\n\n  // determiner: 'must be' or 'must not be'\n  var determiner;\n  if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n    determiner = 'must not be';\n    expected = expected.replace(/^not /, '');\n  } else {\n    determiner = 'must be';\n  }\n  var msg;\n  if (endsWith(name, ' argument')) {\n    // For cases like 'first argument'\n    msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  } else {\n    var type = includes(name, '.') ? 'property' : 'argument';\n    msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  }\n\n  // TODO(BridgeAR): Improve the output by showing `null` and similar.\n  msg += \". Received type \".concat(_typeof(actual));\n  return msg;\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_VALUE', function (name, value) {\n  var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid';\n  if (util === undefined) util = require('util/');\n  var inspected = util.inspect(value);\n  if (inspected.length > 128) {\n    inspected = \"\".concat(inspected.slice(0, 128), \"...\");\n  }\n  return \"The argument '\".concat(name, \"' \").concat(reason, \". Received \").concat(inspected);\n}, TypeError, RangeError);\ncreateErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) {\n  var type;\n  if (value && value.constructor && value.constructor.name) {\n    type = \"instance of \".concat(value.constructor.name);\n  } else {\n    type = \"type \".concat(_typeof(value));\n  }\n  return \"Expected \".concat(input, \" to be returned from the \\\"\").concat(name, \"\\\"\") + \" function but got \".concat(type, \".\");\n}, TypeError);\ncreateErrorType('ERR_MISSING_ARGS', function () {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n  if (assert === undefined) assert = require('../assert');\n  assert(args.length > 0, 'At least one arg needs to be specified');\n  var msg = 'The ';\n  var len = args.length;\n  args = args.map(function (a) {\n    return \"\\\"\".concat(a, \"\\\"\");\n  });\n  switch (len) {\n    case 1:\n      msg += \"\".concat(args[0], \" argument\");\n      break;\n    case 2:\n      msg += \"\".concat(args[0], \" and \").concat(args[1], \" arguments\");\n      break;\n    default:\n      msg += args.slice(0, len - 1).join(', ');\n      msg += \", and \".concat(args[len - 1], \" arguments\");\n      break;\n  }\n  return \"\".concat(msg, \" must be specified\");\n}, TypeError);\nmodule.exports.codes = codes;","// Currently in sync with Node.js lib/internal/util/comparisons.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nvar regexFlagsSupported = /a/g.flags !== undefined;\nvar arrayFromSet = function arrayFromSet(set) {\n  var array = [];\n  set.forEach(function (value) {\n    return array.push(value);\n  });\n  return array;\n};\nvar arrayFromMap = function arrayFromMap(map) {\n  var array = [];\n  map.forEach(function (value, key) {\n    return array.push([key, value]);\n  });\n  return array;\n};\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () {\n  return [];\n};\nvar numberIsNaN = Number.isNaN ? Number.isNaN : require('is-nan');\nfunction uncurryThis(f) {\n  return f.call.bind(f);\n}\nvar hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\nvar propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable);\nvar objectToString = uncurryThis(Object.prototype.toString);\nvar _require$types = require('util/').types,\n  isAnyArrayBuffer = _require$types.isAnyArrayBuffer,\n  isArrayBufferView = _require$types.isArrayBufferView,\n  isDate = _require$types.isDate,\n  isMap = _require$types.isMap,\n  isRegExp = _require$types.isRegExp,\n  isSet = _require$types.isSet,\n  isNativeError = _require$types.isNativeError,\n  isBoxedPrimitive = _require$types.isBoxedPrimitive,\n  isNumberObject = _require$types.isNumberObject,\n  isStringObject = _require$types.isStringObject,\n  isBooleanObject = _require$types.isBooleanObject,\n  isBigIntObject = _require$types.isBigIntObject,\n  isSymbolObject = _require$types.isSymbolObject,\n  isFloat32Array = _require$types.isFloat32Array,\n  isFloat64Array = _require$types.isFloat64Array;\nfunction isNonIndex(key) {\n  if (key.length === 0 || key.length > 10) return true;\n  for (var i = 0; i < key.length; i++) {\n    var code = key.charCodeAt(i);\n    if (code < 48 || code > 57) return true;\n  }\n  // The maximum size for an array is 2 ** 32 -1.\n  return key.length === 10 && key >= Math.pow(2, 32);\n}\nfunction getOwnNonIndexProperties(value) {\n  return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value)));\n}\n\n// Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license  MIT\n */\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n  var x = a.length;\n  var y = b.length;\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nvar ONLY_ENUMERABLE = undefined;\nvar kStrict = true;\nvar kLoose = false;\nvar kNoIterator = 0;\nvar kIsArray = 1;\nvar kIsSet = 2;\nvar kIsMap = 3;\n\n// Check if they have the same source and flags\nfunction areSimilarRegExps(a, b) {\n  return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b);\n}\nfunction areSimilarFloatArrays(a, b) {\n  if (a.byteLength !== b.byteLength) {\n    return false;\n  }\n  for (var offset = 0; offset < a.byteLength; offset++) {\n    if (a[offset] !== b[offset]) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction areSimilarTypedArrays(a, b) {\n  if (a.byteLength !== b.byteLength) {\n    return false;\n  }\n  return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0;\n}\nfunction areEqualArrayBuffers(buf1, buf2) {\n  return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0;\n}\nfunction isEqualBoxedPrimitive(val1, val2) {\n  if (isNumberObject(val1)) {\n    return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2));\n  }\n  if (isStringObject(val1)) {\n    return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2);\n  }\n  if (isBooleanObject(val1)) {\n    return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2);\n  }\n  if (isBigIntObject(val1)) {\n    return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2);\n  }\n  return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2);\n}\n\n// Notes: Type tags are historical [[Class]] properties that can be set by\n// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS\n// and retrieved using Object.prototype.toString.call(obj) in JS\n// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring\n// for a list of tags pre-defined in the spec.\n// There are some unspecified tags in the wild too (e.g. typed array tags).\n// Since tags can be altered, they only serve fast failures\n//\n// Typed arrays and buffers are checked by comparing the content in their\n// underlying ArrayBuffer. This optimization requires that it's\n// reasonable to interpret their underlying memory in the same way,\n// which is checked by comparing their type tags.\n// (e.g. a Uint8Array and a Uint16Array with the same memory content\n// could still be different because they will be interpreted differently).\n//\n// For strict comparison, objects should have\n// a) The same built-in type tags\n// b) The same prototypes.\n\nfunction innerDeepEqual(val1, val2, strict, memos) {\n  // All identical values are equivalent, as determined by ===.\n  if (val1 === val2) {\n    if (val1 !== 0) return true;\n    return strict ? objectIs(val1, val2) : true;\n  }\n\n  // Check more closely if val1 and val2 are equal.\n  if (strict) {\n    if (_typeof(val1) !== 'object') {\n      return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2);\n    }\n    if (_typeof(val2) !== 'object' || val1 === null || val2 === null) {\n      return false;\n    }\n    if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) {\n      return false;\n    }\n  } else {\n    if (val1 === null || _typeof(val1) !== 'object') {\n      if (val2 === null || _typeof(val2) !== 'object') {\n        // eslint-disable-next-line eqeqeq\n        return val1 == val2;\n      }\n      return false;\n    }\n    if (val2 === null || _typeof(val2) !== 'object') {\n      return false;\n    }\n  }\n  var val1Tag = objectToString(val1);\n  var val2Tag = objectToString(val2);\n  if (val1Tag !== val2Tag) {\n    return false;\n  }\n  if (Array.isArray(val1)) {\n    // Check for sparse arrays and general fast path\n    if (val1.length !== val2.length) {\n      return false;\n    }\n    var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n    var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n    if (keys1.length !== keys2.length) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsArray, keys1);\n  }\n  // [browserify] This triggers on certain types in IE (Map/Set) so we don't\n  // wan't to early return out of the rest of the checks. However we can check\n  // if the second value is one of these values and the first isn't.\n  if (val1Tag === '[object Object]') {\n    // return keyCheck(val1, val2, strict, memos, kNoIterator);\n    if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) {\n      return false;\n    }\n  }\n  if (isDate(val1)) {\n    if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) {\n      return false;\n    }\n  } else if (isRegExp(val1)) {\n    if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) {\n      return false;\n    }\n  } else if (isNativeError(val1) || val1 instanceof Error) {\n    // Do not compare the stack as it might differ even though the error itself\n    // is otherwise identical.\n    if (val1.message !== val2.message || val1.name !== val2.name) {\n      return false;\n    }\n  } else if (isArrayBufferView(val1)) {\n    if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) {\n      if (!areSimilarFloatArrays(val1, val2)) {\n        return false;\n      }\n    } else if (!areSimilarTypedArrays(val1, val2)) {\n      return false;\n    }\n    // Buffer.compare returns true, so val1.length === val2.length. If they both\n    // only contain numeric keys, we don't need to exam further than checking\n    // the symbols.\n    var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n    var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n    if (_keys.length !== _keys2.length) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kNoIterator, _keys);\n  } else if (isSet(val1)) {\n    if (!isSet(val2) || val1.size !== val2.size) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsSet);\n  } else if (isMap(val1)) {\n    if (!isMap(val2) || val1.size !== val2.size) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsMap);\n  } else if (isAnyArrayBuffer(val1)) {\n    if (!areEqualArrayBuffers(val1, val2)) {\n      return false;\n    }\n  } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) {\n    return false;\n  }\n  return keyCheck(val1, val2, strict, memos, kNoIterator);\n}\nfunction getEnumerables(val, keys) {\n  return keys.filter(function (k) {\n    return propertyIsEnumerable(val, k);\n  });\n}\nfunction keyCheck(val1, val2, strict, memos, iterationType, aKeys) {\n  // For all remaining Object pairs, including Array, objects and Maps,\n  // equivalence is determined by having:\n  // a) The same number of owned enumerable properties\n  // b) The same set of keys/indexes (although not necessarily the same order)\n  // c) Equivalent values for every corresponding key/index\n  // d) For Sets and Maps, equal contents\n  // Note: this accounts for both named and indexed properties on Arrays.\n  if (arguments.length === 5) {\n    aKeys = Object.keys(val1);\n    var bKeys = Object.keys(val2);\n\n    // The pair must have the same number of owned properties.\n    if (aKeys.length !== bKeys.length) {\n      return false;\n    }\n  }\n\n  // Cheap key test\n  var i = 0;\n  for (; i < aKeys.length; i++) {\n    if (!hasOwnProperty(val2, aKeys[i])) {\n      return false;\n    }\n  }\n  if (strict && arguments.length === 5) {\n    var symbolKeysA = objectGetOwnPropertySymbols(val1);\n    if (symbolKeysA.length !== 0) {\n      var count = 0;\n      for (i = 0; i < symbolKeysA.length; i++) {\n        var key = symbolKeysA[i];\n        if (propertyIsEnumerable(val1, key)) {\n          if (!propertyIsEnumerable(val2, key)) {\n            return false;\n          }\n          aKeys.push(key);\n          count++;\n        } else if (propertyIsEnumerable(val2, key)) {\n          return false;\n        }\n      }\n      var symbolKeysB = objectGetOwnPropertySymbols(val2);\n      if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) {\n        return false;\n      }\n    } else {\n      var _symbolKeysB = objectGetOwnPropertySymbols(val2);\n      if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) {\n        return false;\n      }\n    }\n  }\n  if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) {\n    return true;\n  }\n\n  // Use memos to handle cycles.\n  if (memos === undefined) {\n    memos = {\n      val1: new Map(),\n      val2: new Map(),\n      position: 0\n    };\n  } else {\n    // We prevent up to two map.has(x) calls by directly retrieving the value\n    // and checking for undefined. The map can only contain numbers, so it is\n    // safe to check for undefined only.\n    var val2MemoA = memos.val1.get(val1);\n    if (val2MemoA !== undefined) {\n      var val2MemoB = memos.val2.get(val2);\n      if (val2MemoB !== undefined) {\n        return val2MemoA === val2MemoB;\n      }\n    }\n    memos.position++;\n  }\n  memos.val1.set(val1, memos.position);\n  memos.val2.set(val2, memos.position);\n  var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType);\n  memos.val1.delete(val1);\n  memos.val2.delete(val2);\n  return areEq;\n}\nfunction setHasEqualElement(set, val1, strict, memo) {\n  // Go looking.\n  var setValues = arrayFromSet(set);\n  for (var i = 0; i < setValues.length; i++) {\n    var val2 = setValues[i];\n    if (innerDeepEqual(val1, val2, strict, memo)) {\n      // Remove the matching element to make sure we do not check that again.\n      set.delete(val2);\n      return true;\n    }\n  }\n  return false;\n}\n\n// See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using\n// Sadly it is not possible to detect corresponding values properly in case the\n// type is a string, number, bigint or boolean. The reason is that those values\n// can match lots of different string values (e.g., 1n == '+00001').\nfunction findLooseMatchingPrimitives(prim) {\n  switch (_typeof(prim)) {\n    case 'undefined':\n      return null;\n    case 'object':\n      // Only pass in null as object!\n      return undefined;\n    case 'symbol':\n      return false;\n    case 'string':\n      prim = +prim;\n    // Loose equal entries exist only if the string is possible to convert to\n    // a regular number and not NaN.\n    // Fall through\n    case 'number':\n      if (numberIsNaN(prim)) {\n        return false;\n      }\n  }\n  return true;\n}\nfunction setMightHaveLoosePrim(a, b, prim) {\n  var altValue = findLooseMatchingPrimitives(prim);\n  if (altValue != null) return altValue;\n  return b.has(altValue) && !a.has(altValue);\n}\nfunction mapMightHaveLoosePrim(a, b, prim, item, memo) {\n  var altValue = findLooseMatchingPrimitives(prim);\n  if (altValue != null) {\n    return altValue;\n  }\n  var curB = b.get(altValue);\n  if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) {\n    return false;\n  }\n  return !a.has(altValue) && innerDeepEqual(item, curB, false, memo);\n}\nfunction setEquiv(a, b, strict, memo) {\n  // This is a lazily initiated Set of entries which have to be compared\n  // pairwise.\n  var set = null;\n  var aValues = arrayFromSet(a);\n  for (var i = 0; i < aValues.length; i++) {\n    var val = aValues[i];\n    // Note: Checking for the objects first improves the performance for object\n    // heavy sets but it is a minor slow down for primitives. As they are fast\n    // to check this improves the worst case scenario instead.\n    if (_typeof(val) === 'object' && val !== null) {\n      if (set === null) {\n        set = new Set();\n      }\n      // If the specified value doesn't exist in the second set its an not null\n      // object (or non strict only: a not matching primitive) we'll need to go\n      // hunting for something thats deep-(strict-)equal to it. To make this\n      // O(n log n) complexity we have to copy these values in a new set first.\n      set.add(val);\n    } else if (!b.has(val)) {\n      if (strict) return false;\n\n      // Fast path to detect missing string, symbol, undefined and null values.\n      if (!setMightHaveLoosePrim(a, b, val)) {\n        return false;\n      }\n      if (set === null) {\n        set = new Set();\n      }\n      set.add(val);\n    }\n  }\n  if (set !== null) {\n    var bValues = arrayFromSet(b);\n    for (var _i = 0; _i < bValues.length; _i++) {\n      var _val = bValues[_i];\n      // We have to check if a primitive value is already\n      // matching and only if it's not, go hunting for it.\n      if (_typeof(_val) === 'object' && _val !== null) {\n        if (!setHasEqualElement(set, _val, strict, memo)) return false;\n      } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) {\n        return false;\n      }\n    }\n    return set.size === 0;\n  }\n  return true;\n}\nfunction mapHasEqualEntry(set, map, key1, item1, strict, memo) {\n  // To be able to handle cases like:\n  //   Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']])\n  // ... we need to consider *all* matching keys, not just the first we find.\n  var setValues = arrayFromSet(set);\n  for (var i = 0; i < setValues.length; i++) {\n    var key2 = setValues[i];\n    if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) {\n      set.delete(key2);\n      return true;\n    }\n  }\n  return false;\n}\nfunction mapEquiv(a, b, strict, memo) {\n  var set = null;\n  var aEntries = arrayFromMap(a);\n  for (var i = 0; i < aEntries.length; i++) {\n    var _aEntries$i = _slicedToArray(aEntries[i], 2),\n      key = _aEntries$i[0],\n      item1 = _aEntries$i[1];\n    if (_typeof(key) === 'object' && key !== null) {\n      if (set === null) {\n        set = new Set();\n      }\n      set.add(key);\n    } else {\n      // By directly retrieving the value we prevent another b.has(key) check in\n      // almost all possible cases.\n      var item2 = b.get(key);\n      if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) {\n        if (strict) return false;\n        // Fast path to detect missing string, symbol, undefined and null\n        // keys.\n        if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false;\n        if (set === null) {\n          set = new Set();\n        }\n        set.add(key);\n      }\n    }\n  }\n  if (set !== null) {\n    var bEntries = arrayFromMap(b);\n    for (var _i2 = 0; _i2 < bEntries.length; _i2++) {\n      var _bEntries$_i = _slicedToArray(bEntries[_i2], 2),\n        _key = _bEntries$_i[0],\n        item = _bEntries$_i[1];\n      if (_typeof(_key) === 'object' && _key !== null) {\n        if (!mapHasEqualEntry(set, a, _key, item, strict, memo)) return false;\n      } else if (!strict && (!a.has(_key) || !innerDeepEqual(a.get(_key), item, false, memo)) && !mapHasEqualEntry(set, a, _key, item, false, memo)) {\n        return false;\n      }\n    }\n    return set.size === 0;\n  }\n  return true;\n}\nfunction objEquiv(a, b, strict, keys, memos, iterationType) {\n  // Sets and maps don't have their entries accessible via normal object\n  // properties.\n  var i = 0;\n  if (iterationType === kIsSet) {\n    if (!setEquiv(a, b, strict, memos)) {\n      return false;\n    }\n  } else if (iterationType === kIsMap) {\n    if (!mapEquiv(a, b, strict, memos)) {\n      return false;\n    }\n  } else if (iterationType === kIsArray) {\n    for (; i < a.length; i++) {\n      if (hasOwnProperty(a, i)) {\n        if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) {\n          return false;\n        }\n      } else if (hasOwnProperty(b, i)) {\n        return false;\n      } else {\n        // Array is sparse.\n        var keysA = Object.keys(a);\n        for (; i < keysA.length; i++) {\n          var key = keysA[i];\n          if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) {\n            return false;\n          }\n        }\n        if (keysA.length !== Object.keys(b).length) {\n          return false;\n        }\n        return true;\n      }\n    }\n  }\n\n  // The pair must have equivalent values for every corresponding key.\n  // Possibly expensive deep test:\n  for (i = 0; i < keys.length; i++) {\n    var _key2 = keys[i];\n    if (!innerDeepEqual(a[_key2], b[_key2], strict, memos)) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction isDeepEqual(val1, val2) {\n  return innerDeepEqual(val1, val2, kLoose);\n}\nfunction isDeepStrictEqual(val1, val2) {\n  return innerDeepEqual(val1, val2, kStrict);\n}\nmodule.exports = {\n  isDeepEqual: isDeepEqual,\n  isDeepStrictEqual: isDeepStrictEqual\n};","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n    if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return _Buffer.alloc(0) }\n    var psz = 0\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (psz < source.length) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n    vch.fill(0x00, 0, zeroes)\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","/*\r\n *  big.js v6.2.1\r\n *  A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\r\n *  Copyright (c) 2022 Michael Mclaughlin\r\n *  https://github.com/MikeMcl/big.js/LICENCE.md\r\n */\r\n;(function (GLOBAL) {\r\n  'use strict';\r\n  var Big,\r\n\r\n\r\n/************************************** EDITABLE DEFAULTS *****************************************/\r\n\r\n\r\n    // The default values below must be integers within the stated ranges.\r\n\r\n    /*\r\n     * The maximum number of decimal places (DP) of the results of operations involving division:\r\n     * div and sqrt, and pow with negative exponents.\r\n     */\r\n    DP = 20,            // 0 to MAX_DP\r\n\r\n    /*\r\n     * The rounding mode (RM) used when rounding to the above decimal places.\r\n     *\r\n     *  0  Towards zero (i.e. truncate, no rounding).       (ROUND_DOWN)\r\n     *  1  To nearest neighbour. If equidistant, round up.  (ROUND_HALF_UP)\r\n     *  2  To nearest neighbour. If equidistant, to even.   (ROUND_HALF_EVEN)\r\n     *  3  Away from zero.                                  (ROUND_UP)\r\n     */\r\n    RM = 1,             // 0, 1, 2 or 3\r\n\r\n    // The maximum value of DP and Big.DP.\r\n    MAX_DP = 1E6,       // 0 to 1000000\r\n\r\n    // The maximum magnitude of the exponent argument to the pow method.\r\n    MAX_POWER = 1E6,    // 1 to 1000000\r\n\r\n    /*\r\n     * The negative exponent (NE) at and beneath which toString returns exponential notation.\r\n     * (JavaScript numbers: -7)\r\n     * -1000000 is the minimum recommended exponent value of a Big.\r\n     */\r\n    NE = -7,            // 0 to -1000000\r\n\r\n    /*\r\n     * The positive exponent (PE) at and above which toString returns exponential notation.\r\n     * (JavaScript numbers: 21)\r\n     * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\r\n     */\r\n    PE = 21,            // 0 to 1000000\r\n\r\n    /*\r\n     * When true, an error will be thrown if a primitive number is passed to the Big constructor,\r\n     * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\r\n     * primitive number without a loss of precision.\r\n     */\r\n    STRICT = false,     // true or false\r\n\r\n\r\n/**************************************************************************************************/\r\n\r\n\r\n    // Error messages.\r\n    NAME = '[big.js] ',\r\n    INVALID = NAME + 'Invalid ',\r\n    INVALID_DP = INVALID + 'decimal places',\r\n    INVALID_RM = INVALID + 'rounding mode',\r\n    DIV_BY_ZERO = NAME + 'Division by zero',\r\n\r\n    // The shared prototype object.\r\n    P = {},\r\n    UNDEFINED = void 0,\r\n    NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\r\n\r\n\r\n  /*\r\n   * Create and return a Big constructor.\r\n   */\r\n  function _Big_() {\r\n\r\n    /*\r\n     * The Big constructor and exported function.\r\n     * Create and return a new instance of a Big number object.\r\n     *\r\n     * n {number|string|Big} A numeric value.\r\n     */\r\n    function Big(n) {\r\n      var x = this;\r\n\r\n      // Enable constructor usage without new.\r\n      if (!(x instanceof Big)) return n === UNDEFINED ? _Big_() : new Big(n);\r\n\r\n      // Duplicate.\r\n      if (n instanceof Big) {\r\n        x.s = n.s;\r\n        x.e = n.e;\r\n        x.c = n.c.slice();\r\n      } else {\r\n        if (typeof n !== 'string') {\r\n          if (Big.strict === true && typeof n !== 'bigint') {\r\n            throw TypeError(INVALID + 'value');\r\n          }\r\n\r\n          // Minus zero?\r\n          n = n === 0 && 1 / n < 0 ? '-0' : String(n);\r\n        }\r\n\r\n        parse(x, n);\r\n      }\r\n\r\n      // Retain a reference to this Big constructor.\r\n      // Shadow Big.prototype.constructor which points to Object.\r\n      x.constructor = Big;\r\n    }\r\n\r\n    Big.prototype = P;\r\n    Big.DP = DP;\r\n    Big.RM = RM;\r\n    Big.NE = NE;\r\n    Big.PE = PE;\r\n    Big.strict = STRICT;\r\n    Big.roundDown = 0;\r\n    Big.roundHalfUp = 1;\r\n    Big.roundHalfEven = 2;\r\n    Big.roundUp = 3;\r\n\r\n    return Big;\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the number or string value passed to a Big constructor.\r\n   *\r\n   * x {Big} A Big number instance.\r\n   * n {number|string} A numeric value.\r\n   */\r\n  function parse(x, n) {\r\n    var e, i, nl;\r\n\r\n    if (!NUMERIC.test(n)) {\r\n      throw Error(INVALID + 'number');\r\n    }\r\n\r\n    // Determine sign.\r\n    x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\r\n\r\n    // Decimal point?\r\n    if ((e = n.indexOf('.')) > -1) n = n.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = n.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +n.slice(i + 1);\r\n      n = n.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = n.length;\r\n    }\r\n\r\n    nl = n.length;\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\r\n\r\n    if (i == nl) {\r\n\r\n      // Zero.\r\n      x.c = [x.e = 0];\r\n    } else {\r\n\r\n      // Determine trailing zeros.\r\n      for (; nl > 0 && n.charAt(--nl) == '0';);\r\n      x.e = e - i - 1;\r\n      x.c = [];\r\n\r\n      // Convert string to array of digits without leading/trailing zeros.\r\n      for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round Big x to a maximum of sd significant digits using rounding mode rm.\r\n   *\r\n   * x {Big} The Big to round.\r\n   * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\r\n   * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   * [more] {boolean} Whether the result of division was truncated.\r\n   */\r\n  function round(x, sd, rm, more) {\r\n    var xc = x.c;\r\n\r\n    if (rm === UNDEFINED) rm = x.constructor.RM;\r\n    if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\r\n      throw Error(INVALID_RM);\r\n    }\r\n\r\n    if (sd < 1) {\r\n      more =\r\n        rm === 3 && (more || !!xc[0]) || sd === 0 && (\r\n        rm === 1 && xc[0] >= 5 ||\r\n        rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED))\r\n      );\r\n\r\n      xc.length = 1;\r\n\r\n      if (more) {\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        x.e = x.e - sd + 1;\r\n        xc[0] = 1;\r\n      } else {\r\n\r\n        // Zero.\r\n        xc[0] = x.e = 0;\r\n      }\r\n    } else if (sd < xc.length) {\r\n\r\n      // xc[sd] is the digit after the digit that may be rounded up.\r\n      more =\r\n        rm === 1 && xc[sd] >= 5 ||\r\n        rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\r\n          (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\r\n        rm === 3 && (more || !!xc[0]);\r\n\r\n      // Remove any digits after the required precision.\r\n      xc.length = sd;\r\n\r\n      // Round up?\r\n      if (more) {\r\n\r\n        // Rounding up may mean the previous digit has to be rounded up.\r\n        for (; ++xc[--sd] > 9;) {\r\n          xc[sd] = 0;\r\n          if (sd === 0) {\r\n            ++x.e;\r\n            xc.unshift(1);\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // Remove trailing zeros.\r\n      for (sd = xc.length; !xc[--sd];) xc.pop();\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of Big x in normal or exponential notation.\r\n   * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\r\n   */\r\n  function stringify(x, doExponential, isNonzero) {\r\n    var e = x.e,\r\n      s = x.c.join(''),\r\n      n = s.length;\r\n\r\n    // Exponential notation?\r\n    if (doExponential) {\r\n      s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\r\n\r\n    // Normal notation.\r\n    } else if (e < 0) {\r\n      for (; ++e;) s = '0' + s;\r\n      s = '0.' + s;\r\n    } else if (e > 0) {\r\n      if (++e > n) {\r\n        for (e -= n; e--;) s += '0';\r\n      } else if (e < n) {\r\n        s = s.slice(0, e) + '.' + s.slice(e);\r\n      }\r\n    } else if (n > 1) {\r\n      s = s.charAt(0) + '.' + s.slice(1);\r\n    }\r\n\r\n    return x.s < 0 && isNonzero ? '-' + s : s;\r\n  }\r\n\r\n\r\n  // Prototype/instance methods\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the absolute value of this Big.\r\n   */\r\n  P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return 1 if the value of this Big is greater than the value of Big y,\r\n   *       -1 if the value of this Big is less than the value of Big y, or\r\n   *        0 if they have the same value.\r\n   */\r\n  P.cmp = function (y) {\r\n    var isneg,\r\n      x = this,\r\n      xc = x.c,\r\n      yc = (y = new x.constructor(y)).c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) return !xc[0] ? !yc[0] ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    isneg = i < 0;\r\n\r\n    // Compare exponents.\r\n    if (k != l) return k > l ^ isneg ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = -1; ++i < j;) {\r\n      if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ isneg ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\r\n   * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n   */\r\n  P.div = function (y) {\r\n    var x = this,\r\n      Big = x.constructor,\r\n      a = x.c,                  // dividend\r\n      b = (y = new Big(y)).c,   // divisor\r\n      k = x.s == y.s ? 1 : -1,\r\n      dp = Big.DP;\r\n\r\n    if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n\r\n    // Divisor is zero?\r\n    if (!b[0]) {\r\n      throw Error(DIV_BY_ZERO);\r\n    }\r\n\r\n    // Dividend is 0? Return +-0.\r\n    if (!a[0]) {\r\n      y.s = k;\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    var bl, bt, n, cmp, ri,\r\n      bz = b.slice(),\r\n      ai = bl = b.length,\r\n      al = a.length,\r\n      r = a.slice(0, bl),   // remainder\r\n      rl = r.length,\r\n      q = y,                // quotient\r\n      qc = q.c = [],\r\n      qi = 0,\r\n      p = dp + (q.e = x.e - y.e) + 1;    // precision of the result\r\n\r\n    q.s = k;\r\n    k = p < 0 ? 0 : p;\r\n\r\n    // Create version of divisor with leading zero.\r\n    bz.unshift(0);\r\n\r\n    // Add zeros to make remainder as long as divisor.\r\n    for (; rl++ < bl;) r.push(0);\r\n\r\n    do {\r\n\r\n      // n is how many times the divisor goes into current remainder.\r\n      for (n = 0; n < 10; n++) {\r\n\r\n        // Compare divisor and remainder.\r\n        if (bl != (rl = r.length)) {\r\n          cmp = bl > rl ? 1 : -1;\r\n        } else {\r\n          for (ri = -1, cmp = 0; ++ri < bl;) {\r\n            if (b[ri] != r[ri]) {\r\n              cmp = b[ri] > r[ri] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        // If divisor < remainder, subtract divisor from remainder.\r\n        if (cmp < 0) {\r\n\r\n          // Remainder can't be more than 1 digit longer than divisor.\r\n          // Equalise lengths using divisor with extra leading zero?\r\n          for (bt = rl == bl ? b : bz; rl;) {\r\n            if (r[--rl] < bt[rl]) {\r\n              ri = rl;\r\n              for (; ri && !r[--ri];) r[ri] = 9;\r\n              --r[ri];\r\n              r[rl] += 10;\r\n            }\r\n            r[rl] -= bt[rl];\r\n          }\r\n\r\n          for (; !r[0];) r.shift();\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n\r\n      // Add the digit n to the result array.\r\n      qc[qi++] = cmp ? n : ++n;\r\n\r\n      // Update the remainder.\r\n      if (r[0] && cmp) r[rl] = a[ai] || 0;\r\n      else r = [a[ai]];\r\n\r\n    } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\r\n\r\n    // Leading zero? Do not remove if result is simply zero (qi == 1).\r\n    if (!qc[0] && qi != 1) {\r\n\r\n      // There can't be more than one zero.\r\n      qc.shift();\r\n      q.e--;\r\n      p--;\r\n    }\r\n\r\n    // Round?\r\n    if (qi > p) round(q, p, Big.RM, r[0] !== UNDEFINED);\r\n\r\n    return q;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\r\n   */\r\n  P.eq = function (y) {\r\n    return this.cmp(y) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is greater than the value of Big y, otherwise return\r\n   * false.\r\n   */\r\n  P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\r\n   * return false.\r\n   */\r\n  P.gte = function (y) {\r\n    return this.cmp(y) > -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is less than the value of Big y, otherwise return false.\r\n   */\r\n  P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\r\n   * return false.\r\n   */\r\n  P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big minus the value of Big y.\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var i, j, t, xlty,\r\n      x = this,\r\n      Big = x.constructor,\r\n      a = x.s,\r\n      b = (y = new Big(y)).s;\r\n\r\n    // Signs differ?\r\n    if (a != b) {\r\n      y.s = -b;\r\n      return x.plus(y);\r\n    }\r\n\r\n    var xc = x.c.slice(),\r\n      xe = x.e,\r\n      yc = y.c,\r\n      ye = y.e;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) {\r\n      if (yc[0]) {\r\n        y.s = -b;\r\n      } else if (xc[0]) {\r\n        y = new Big(x);\r\n      } else {\r\n        y.s = 1;\r\n      }\r\n      return y;\r\n    }\r\n\r\n    // Determine which is the bigger number. Prepend zeros to equalise exponents.\r\n    if (a = xe - ye) {\r\n\r\n      if (xlty = a < 0) {\r\n        a = -a;\r\n        t = xc;\r\n      } else {\r\n        ye = xe;\r\n        t = yc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (b = a; b--;) t.push(0);\r\n      t.reverse();\r\n    } else {\r\n\r\n      // Exponents equal. Check digit by digit.\r\n      j = ((xlty = xc.length < yc.length) ? xc : yc).length;\r\n\r\n      for (a = b = 0; b < j; b++) {\r\n        if (xc[b] != yc[b]) {\r\n          xlty = xc[b] < yc[b];\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    // x < y? Point xc to the array of the bigger number.\r\n    if (xlty) {\r\n      t = xc;\r\n      xc = yc;\r\n      yc = t;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    /*\r\n     * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\r\n     * needs to start at yc.length.\r\n     */\r\n    if ((b = (j = yc.length) - (i = xc.length)) > 0) for (; b--;) xc[i++] = 0;\r\n\r\n    // Subtract yc from xc.\r\n    for (b = i; j > a;) {\r\n      if (xc[--j] < yc[j]) {\r\n        for (i = j; i && !xc[--i];) xc[i] = 9;\r\n        --xc[i];\r\n        xc[j] += 10;\r\n      }\r\n\r\n      xc[j] -= yc[j];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xc[--b] === 0;) xc.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xc[0] === 0;) {\r\n      xc.shift();\r\n      --ye;\r\n    }\r\n\r\n    if (!xc[0]) {\r\n\r\n      // n - n = +0\r\n      y.s = 1;\r\n\r\n      // Result must be zero.\r\n      xc = [ye = 0];\r\n    }\r\n\r\n    y.c = xc;\r\n    y.e = ye;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big modulo the value of Big y.\r\n   */\r\n  P.mod = function (y) {\r\n    var ygtx,\r\n      x = this,\r\n      Big = x.constructor,\r\n      a = x.s,\r\n      b = (y = new Big(y)).s;\r\n\r\n    if (!y.c[0]) {\r\n      throw Error(DIV_BY_ZERO);\r\n    }\r\n\r\n    x.s = y.s = 1;\r\n    ygtx = y.cmp(x) == 1;\r\n    x.s = a;\r\n    y.s = b;\r\n\r\n    if (ygtx) return new Big(x);\r\n\r\n    a = Big.DP;\r\n    b = Big.RM;\r\n    Big.DP = Big.RM = 0;\r\n    x = x.div(y);\r\n    Big.DP = a;\r\n    Big.RM = b;\r\n\r\n    return this.minus(x.times(y));\r\n  };\r\n  \r\n  \r\n  /*\r\n   * Return a new Big whose value is the value of this Big negated.\r\n   */\r\n  P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big plus the value of Big y.\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var e, k, t,\r\n      x = this,\r\n      Big = x.constructor;\r\n\r\n    y = new Big(y);\r\n\r\n    // Signs differ?\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    var xe = x.e,\r\n      xc = x.c,\r\n      ye = y.e,\r\n      yc = y.c;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) {\r\n      if (!yc[0]) {\r\n        if (xc[0]) {\r\n          y = new Big(x);\r\n        } else {\r\n          y.s = x.s;\r\n        }\r\n      }\r\n      return y;\r\n    }\r\n\r\n    xc = xc.slice();\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    // Note: reverse faster than unshifts.\r\n    if (e = xe - ye) {\r\n      if (e > 0) {\r\n        ye = xe;\r\n        t = yc;\r\n      } else {\r\n        e = -e;\r\n        t = xc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (; e--;) t.push(0);\r\n      t.reverse();\r\n    }\r\n\r\n    // Point xc to the longer array.\r\n    if (xc.length - yc.length < 0) {\r\n      t = yc;\r\n      yc = xc;\r\n      xc = t;\r\n    }\r\n\r\n    e = yc.length;\r\n\r\n    // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\r\n    for (k = 0; e; xc[e] %= 10) k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\r\n\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n\r\n    if (k) {\r\n      xc.unshift(k);\r\n      ++ye;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (e = xc.length; xc[--e] === 0;) xc.pop();\r\n\r\n    y.c = xc;\r\n    y.e = ye;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a Big whose value is the value of this Big raised to the power n.\r\n   * If n is negative, round to a maximum of Big.DP decimal places using rounding\r\n   * mode Big.RM.\r\n   *\r\n   * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\r\n   */\r\n  P.pow = function (n) {\r\n    var x = this,\r\n      one = new x.constructor('1'),\r\n      y = one,\r\n      isneg = n < 0;\r\n\r\n    if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\r\n      throw Error(INVALID + 'exponent');\r\n    }\r\n\r\n    if (isneg) n = -n;\r\n\r\n    for (;;) {\r\n      if (n & 1) y = y.times(x);\r\n      n >>= 1;\r\n      if (!n) break;\r\n      x = x.times(x);\r\n    }\r\n\r\n    return isneg ? one.div(y) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\r\n   * significant digits using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.prec = function (sd, rm) {\r\n    if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n      throw Error(INVALID + 'precision');\r\n    }\r\n    return round(new this.constructor(this), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\r\n   * using rounding mode rm, or Big.RM if rm is not specified.\r\n   * If dp is negative, round to an integer which is a multiple of 10**-dp.\r\n   * If dp is not specified, round to 0 decimal places.\r\n   *\r\n   * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.round = function (dp, rm) {\r\n    if (dp === UNDEFINED) dp = 0;\r\n    else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n    return round(new this.constructor(this), dp + this.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the square root of the value of this Big, rounded, if\r\n   * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n   */\r\n  P.sqrt = function () {\r\n    var r, c, t,\r\n      x = this,\r\n      Big = x.constructor,\r\n      s = x.s,\r\n      e = x.e,\r\n      half = new Big('0.5');\r\n\r\n    // Zero?\r\n    if (!x.c[0]) return new Big(x);\r\n\r\n    // Negative?\r\n    if (s < 0) {\r\n      throw Error(NAME + 'No square root');\r\n    }\r\n\r\n    // Estimate.\r\n    s = Math.sqrt(x + '');\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\r\n    if (s === 0 || s === 1 / 0) {\r\n      c = x.c.join('');\r\n      if (!(c.length + e & 1)) c += '0';\r\n      s = Math.sqrt(c);\r\n      e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\r\n      r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\r\n    } else {\r\n      r = new Big(s + '');\r\n    }\r\n\r\n    e = r.e + (Big.DP += 4);\r\n\r\n    // Newton-Raphson iteration.\r\n    do {\r\n      t = r;\r\n      r = half.times(t.plus(x.div(t)));\r\n    } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\r\n\r\n    return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big times the value of Big y.\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var c,\r\n      x = this,\r\n      Big = x.constructor,\r\n      xc = x.c,\r\n      yc = (y = new Big(y)).c,\r\n      a = xc.length,\r\n      b = yc.length,\r\n      i = x.e,\r\n      j = y.e;\r\n\r\n    // Determine sign of result.\r\n    y.s = x.s == y.s ? 1 : -1;\r\n\r\n    // Return signed 0 if either 0.\r\n    if (!xc[0] || !yc[0]) {\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    // Initialise exponent of result as x.e + y.e.\r\n    y.e = i + j;\r\n\r\n    // If array xc has fewer digits than yc, swap xc and yc, and lengths.\r\n    if (a < b) {\r\n      c = xc;\r\n      xc = yc;\r\n      yc = c;\r\n      j = a;\r\n      a = b;\r\n      b = j;\r\n    }\r\n\r\n    // Initialise coefficient array of result with zeros.\r\n    for (c = new Array(j = a + b); j--;) c[j] = 0;\r\n\r\n    // Multiply.\r\n\r\n    // i is initially xc.length.\r\n    for (i = b; i--;) {\r\n      b = 0;\r\n\r\n      // a is yc.length.\r\n      for (j = a + i; j > i;) {\r\n\r\n        // Current sum of products at this digit position, plus carry.\r\n        b = c[j] + yc[i] * xc[j - i - 1] + b;\r\n        c[j--] = b % 10;\r\n\r\n        // carry\r\n        b = b / 10 | 0;\r\n      }\r\n\r\n      c[j] = b;\r\n    }\r\n\r\n    // Increment result exponent if there is a final carry, otherwise remove leading zero.\r\n    if (b) ++y.e;\r\n    else c.shift();\r\n\r\n    // Remove trailing zeros.\r\n    for (i = c.length; !c[--i];) c.pop();\r\n    y.c = c;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big in exponential notation rounded to dp fixed\r\n   * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var x = this,\r\n      n = x.c[0];\r\n\r\n    if (dp !== UNDEFINED) {\r\n      if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n        throw Error(INVALID_DP);\r\n      }\r\n      x = round(new x.constructor(x), ++dp, rm);\r\n      for (; x.c.length < dp;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, true, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big in normal notation rounded to dp fixed\r\n   * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var x = this,\r\n      n = x.c[0];\r\n\r\n    if (dp !== UNDEFINED) {\r\n      if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n        throw Error(INVALID_DP);\r\n      }\r\n      x = round(new x.constructor(x), dp + x.e + 1, rm);\r\n\r\n      // x.e may have changed if the value is rounded up.\r\n      for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, false, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big.\r\n   * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n   * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n   * Omit the sign for negative zero.\r\n   */\r\n  P.toJSON = P.toString = function () {\r\n    var x = this,\r\n      Big = x.constructor;\r\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Big as a primitve number.\r\n   */\r\n  P.toNumber = function () {\r\n    var n = Number(stringify(this, true, true));\r\n    if (this.constructor.strict === true && !this.eq(n.toString())) {\r\n      throw Error(NAME + 'Imprecise conversion');\r\n    }\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big rounded to sd significant digits using\r\n   * rounding mode rm, or Big.RM if rm is not specified.\r\n   * Use exponential notation if sd is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var x = this,\r\n      Big = x.constructor,\r\n      n = x.c[0];\r\n\r\n    if (sd !== UNDEFINED) {\r\n      if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n        throw Error(INVALID + 'precision');\r\n      }\r\n      x = round(new Big(x), sd, rm);\r\n      for (; x.c.length < sd;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big.\r\n   * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n   * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n   * Include the sign for negative zero.\r\n   */\r\n  P.valueOf = function () {\r\n    var x = this,\r\n      Big = x.constructor;\r\n    if (Big.strict === true) {\r\n      throw Error(NAME + 'valueOf disallowed');\r\n    }\r\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\r\n  };\r\n\r\n\r\n  // Export\r\n\r\n\r\n  Big = _Big_();\r\n\r\n  Big['default'] = Big.Big = Big;\r\n\r\n  //AMD.\r\n  if (typeof define === 'function' && define.amd) {\r\n    define(function () { return Big; });\r\n\r\n  // Node and other CommonJS-like environments that support module.exports.\r\n  } else if (typeof module !== 'undefined' && module.exports) {\r\n    module.exports = Big;\r\n\r\n  //Browser.\r\n  } else {\r\n    GLOBAL.Big = Big;\r\n  }\r\n})(this);\r\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nlet converter;\n/**\n * Convert a little-endian buffer into a BigInt.\n * @param buf The little-endian buffer to convert\n * @returns A BigInt with the little-endian representation of buf.\n */\nfunction toBigIntLE(buf) {\n    {\n        const reversed = Buffer.from(buf);\n        reversed.reverse();\n        const hex = reversed.toString('hex');\n        if (hex.length === 0) {\n            return BigInt(0);\n        }\n        return BigInt(`0x${hex}`);\n    }\n    return converter.toBigInt(buf, false);\n}\nexports.toBigIntLE = toBigIntLE;\n/**\n * Convert a big-endian buffer into a BigInt\n * @param buf The big-endian buffer to convert.\n * @returns A BigInt with the big-endian representation of buf.\n */\nfunction toBigIntBE(buf) {\n    {\n        const hex = buf.toString('hex');\n        if (hex.length === 0) {\n            return BigInt(0);\n        }\n        return BigInt(`0x${hex}`);\n    }\n    return converter.toBigInt(buf, true);\n}\nexports.toBigIntBE = toBigIntBE;\n/**\n * Convert a BigInt to a little-endian buffer.\n * @param num   The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A little-endian buffer representation of num.\n */\nfunction toBufferLE(num, width) {\n    {\n        const hex = num.toString(16);\n        const buffer = Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n        buffer.reverse();\n        return buffer;\n    }\n    // Allocation is done here, since it is slower using napi in C\n    return converter.fromBigInt(num, Buffer.allocUnsafe(width), false);\n}\nexports.toBufferLE = toBufferLE;\n/**\n * Convert a BigInt to a big-endian buffer.\n * @param num   The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A big-endian buffer representation of num.\n */\nfunction toBufferBE(num, width) {\n    {\n        const hex = num.toString(16);\n        return Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n    }\n    return converter.fromBigInt(num, Buffer.allocUnsafe(width), true);\n}\nexports.toBufferBE = toBufferBE;\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v9.1.2\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                       // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        prefix: '',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        groupSeparator: ',',\r\n        decimalSeparator: '.',\r\n        fractionGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',        // non-breaking space\r\n        suffix: ''\r\n      },\r\n\r\n      // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n      // '-', '.', whitespace, or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n      alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * v {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(v, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor call without `new`.\r\n      if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n      if (b == null) {\r\n\r\n        if (v && v._isBigNumber === true) {\r\n          x.s = v.s;\r\n\r\n          if (!v.c || v.e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else if (v.e < MIN_EXP) {\r\n            x.c = [x.e = 0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.c = v.c.slice();\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n          // Fast path for integers, where n < 2147483648 (2**31).\r\n          if (v === ~~v) {\r\n            for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n            if (e > MAX_EXP) {\r\n              x.c = x.e = null;\r\n            } else {\r\n              x.e = e;\r\n              x.c = [v];\r\n            }\r\n\r\n            return;\r\n          }\r\n\r\n          str = String(v);\r\n        } else {\r\n\r\n          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n          x = new BigNumber(v);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        str = String(v);\r\n\r\n        if (isNum = typeof v == 'number') {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + v);\r\n          }\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp, so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, String(v), isNum, b);\r\n          }\r\n        }\r\n\r\n        // Prevent later check for length on converted number.\r\n        isNum = false;\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      if (str = str.slice(i, ++len)) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * v));\r\n        }\r\n\r\n         // Overflow?\r\n        if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            i = LOG_BASE - (str = str.slice(i)).length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *     prefix                 {string}\r\n     *     groupSize              {number}\r\n     *     secondaryGroupSize     {number}\r\n     *     groupSeparator         {string}\r\n     *     decimalSeparator       {string}\r\n     *     fractionGroupSize      {number}\r\n     *     fractionGroupSeparator {string}\r\n     *     suffix                 {string}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if less than two characters,\r\n            // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n            if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n              alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n     *\r\n     * v {any}\r\n     *\r\n     * '[BigNumber Error] Invalid BigNumber: {v}'\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      if (!v || v._isBigNumber !== true) return false;\r\n      if (!BigNumber.DEBUG) return true;\r\n\r\n      var i, n,\r\n        c = v.c,\r\n        e = v.e,\r\n        s = v.s;\r\n\r\n      out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n          // If the first element is zero, the BigNumber value must be zero.\r\n          if (c[0] === 0) {\r\n            if (e === 0 && c.length === 1) return true;\r\n            break out;\r\n          }\r\n\r\n          // Calculate number of digits that c[0] should have, based on the exponent.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (i < 1) i += LOG_BASE;\r\n\r\n          // Calculate number of digits of c[0].\r\n          //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n          if (String(c[0]).length == i) {\r\n\r\n            for (i = 0; i < c.length; i++) {\r\n              n = c[i];\r\n              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n            }\r\n\r\n            // Last element cannot be zero, unless it is the only element.\r\n            if (n !== 0) return true;\r\n          }\r\n        }\r\n\r\n      // Infinity/NaN\r\n      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n        return true;\r\n      }\r\n\r\n      throw Error\r\n        (bignumberError + 'Invalid BigNumber: ' + v);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, -1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the sum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.sum = function () {\r\n      var i = 1,\r\n        args = arguments,\r\n        sum = new BigNumber(args[0]);\r\n      for (; i < args.length;) sum = sum.plus(args[i++]);\r\n      return sum;\r\n    };\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    // If any number is NaN, return NaN.\r\n    function maxOrMin(args, n) {\r\n      var k, y,\r\n        i = 1,\r\n        x = new BigNumber(args[0]);\r\n\r\n      for (; i < args.length; i++) {\r\n        y = new BigNumber(args[i]);\r\n        if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {\r\n          x = y;\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.s = null;\r\n        }\r\n\r\n        x.c = x.e = null;\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    function valueOf(n) {\r\n      var str,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        if (nIsNeg) n.s = 1;\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        i = Math.abs(+valueOf(n));\r\n        nIsOdd = i % 2;\r\n      }\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (i) {\r\n          i = mathfloor(i / 2);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        } else {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n\r\n          if (n.e > 14) {\r\n            nIsOdd = isOdd(n);\r\n          } else {\r\n            i = +valueOf(n);\r\n            if (i === 0) break;\r\n            nIsOdd = i % 2;\r\n          }\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) {\r\n        t = xc;\r\n        xc = yc;\r\n        yc = t;\r\n        y.s = -y.s;\r\n      }\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) {\r\n        zc = xc;\r\n        xc = yc;\r\n        yc = zc;\r\n        i = xcL;\r\n        xcL = ycL;\r\n        ycL = i;\r\n      }\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) {\r\n        t = yc;\r\n        yc = xc;\r\n        xc = t;\r\n        b = a;\r\n      }\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+valueOf(x));\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(+n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '5e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the format or FORMAT object (see BigNumber.set).\r\n     *\r\n     * The formatting object may contain some or all of the properties shown below.\r\n     *\r\n     * FORMAT = {\r\n     *   prefix: '',\r\n     *   groupSize: 3,\r\n     *   secondaryGroupSize: 0,\r\n     *   groupSeparator: ',',\r\n     *   decimalSeparator: '.',\r\n     *   fractionGroupSize: 0,\r\n     *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n     *   suffix: ''\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     * [format] {object} Formatting options. See FORMAT pbject above.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     * '[BigNumber Error] Argument not an object: {format}'\r\n     */\r\n    P.toFormat = function (dp, rm, format) {\r\n      var str,\r\n        x = this;\r\n\r\n      if (format == null) {\r\n        if (dp != null && rm && typeof rm == 'object') {\r\n          format = rm;\r\n          rm = null;\r\n        } else if (dp && typeof dp == 'object') {\r\n          format = dp;\r\n          dp = rm = null;\r\n        } else {\r\n          format = FORMAT;\r\n        }\r\n      } else if (typeof format != 'object') {\r\n        throw Error\r\n          (bignumberError + 'Argument not an object: ' + format);\r\n      }\r\n\r\n      str = x.toFixed(dp, rm);\r\n\r\n      if (x.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +format.groupSize,\r\n          g2 = +format.secondaryGroupSize,\r\n          groupSeparator = format.groupSeparator || '',\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = x.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) {\r\n          i = g1;\r\n          g1 = g2;\r\n          g2 = i;\r\n          len -= i;\r\n        }\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + (format.fractionGroupSeparator || ''))\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return (format.prefix || '') + str + (format.suffix || '');\r\n    };\r\n\r\n\r\n    /*\r\n     * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n     * fraction with an integer numerator and an integer denominator.\r\n     * The denominator will be a positive non-zero value less than or equal to the specified\r\n     * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n     * the lowest value necessary to represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n        }\r\n      }\r\n\r\n      if (!xc) return new BigNumber(x);\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e = e * 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n          div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n      MAX_EXP = exp;\r\n\r\n      return r;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +valueOf(this);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(coeffToString(n.c), e)\r\n           : toFixedPoint(coeffToString(n.c), e, '0');\r\n        } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n          n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n          str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      return valueOf(this);\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n  // These functions don't need access to variables,\r\n  // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== mathfloor(n)) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + String(n));\r\n    }\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    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","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.deserializeUnchecked = exports.deserialize = exports.serialize = exports.BinaryReader = exports.BinaryWriter = exports.BorshError = exports.baseDecode = exports.baseEncode = void 0;\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nconst bs58_1 = __importDefault(require(\"bs58\"));\n// TODO: Make sure this polyfill not included when not required\nconst encoding = __importStar(require(\"text-encoding-utf-8\"));\nconst ResolvedTextDecoder = typeof TextDecoder !== \"function\" ? encoding.TextDecoder : TextDecoder;\nconst textDecoder = new ResolvedTextDecoder(\"utf-8\", { fatal: true });\nfunction baseEncode(value) {\n    if (typeof value === \"string\") {\n        value = Buffer.from(value, \"utf8\");\n    }\n    return bs58_1.default.encode(Buffer.from(value));\n}\nexports.baseEncode = baseEncode;\nfunction baseDecode(value) {\n    return Buffer.from(bs58_1.default.decode(value));\n}\nexports.baseDecode = baseDecode;\nconst INITIAL_LENGTH = 1024;\nclass BorshError extends Error {\n    constructor(message) {\n        super(message);\n        this.fieldPath = [];\n        this.originalMessage = message;\n    }\n    addToFieldPath(fieldName) {\n        this.fieldPath.splice(0, 0, fieldName);\n        // NOTE: Modifying message directly as jest doesn't use .toString()\n        this.message = this.originalMessage + \": \" + this.fieldPath.join(\".\");\n    }\n}\nexports.BorshError = BorshError;\n/// Binary encoder.\nclass BinaryWriter {\n    constructor() {\n        this.buf = Buffer.alloc(INITIAL_LENGTH);\n        this.length = 0;\n    }\n    maybeResize() {\n        if (this.buf.length < 16 + this.length) {\n            this.buf = Buffer.concat([this.buf, Buffer.alloc(INITIAL_LENGTH)]);\n        }\n    }\n    writeU8(value) {\n        this.maybeResize();\n        this.buf.writeUInt8(value, this.length);\n        this.length += 1;\n    }\n    writeU16(value) {\n        this.maybeResize();\n        this.buf.writeUInt16LE(value, this.length);\n        this.length += 2;\n    }\n    writeU32(value) {\n        this.maybeResize();\n        this.buf.writeUInt32LE(value, this.length);\n        this.length += 4;\n    }\n    writeU64(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 8)));\n    }\n    writeU128(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 16)));\n    }\n    writeU256(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 32)));\n    }\n    writeU512(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 64)));\n    }\n    writeBuffer(buffer) {\n        // Buffer.from is needed as this.buf.subarray can return plain Uint8Array in browser\n        this.buf = Buffer.concat([\n            Buffer.from(this.buf.subarray(0, this.length)),\n            buffer,\n            Buffer.alloc(INITIAL_LENGTH),\n        ]);\n        this.length += buffer.length;\n    }\n    writeString(str) {\n        this.maybeResize();\n        const b = Buffer.from(str, \"utf8\");\n        this.writeU32(b.length);\n        this.writeBuffer(b);\n    }\n    writeFixedArray(array) {\n        this.writeBuffer(Buffer.from(array));\n    }\n    writeArray(array, fn) {\n        this.maybeResize();\n        this.writeU32(array.length);\n        for (const elem of array) {\n            this.maybeResize();\n            fn(elem);\n        }\n    }\n    toArray() {\n        return this.buf.subarray(0, this.length);\n    }\n}\nexports.BinaryWriter = BinaryWriter;\nfunction handlingRangeError(target, propertyKey, propertyDescriptor) {\n    const originalMethod = propertyDescriptor.value;\n    propertyDescriptor.value = function (...args) {\n        try {\n            return originalMethod.apply(this, args);\n        }\n        catch (e) {\n            if (e instanceof RangeError) {\n                const code = e.code;\n                if ([\"ERR_BUFFER_OUT_OF_BOUNDS\", \"ERR_OUT_OF_RANGE\"].indexOf(code) >= 0) {\n                    throw new BorshError(\"Reached the end of buffer when deserializing\");\n                }\n            }\n            throw e;\n        }\n    };\n}\nclass BinaryReader {\n    constructor(buf) {\n        this.buf = buf;\n        this.offset = 0;\n    }\n    readU8() {\n        const value = this.buf.readUInt8(this.offset);\n        this.offset += 1;\n        return value;\n    }\n    readU16() {\n        const value = this.buf.readUInt16LE(this.offset);\n        this.offset += 2;\n        return value;\n    }\n    readU32() {\n        const value = this.buf.readUInt32LE(this.offset);\n        this.offset += 4;\n        return value;\n    }\n    readU64() {\n        const buf = this.readBuffer(8);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU128() {\n        const buf = this.readBuffer(16);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU256() {\n        const buf = this.readBuffer(32);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU512() {\n        const buf = this.readBuffer(64);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readBuffer(len) {\n        if (this.offset + len > this.buf.length) {\n            throw new BorshError(`Expected buffer length ${len} isn't within bounds`);\n        }\n        const result = this.buf.slice(this.offset, this.offset + len);\n        this.offset += len;\n        return result;\n    }\n    readString() {\n        const len = this.readU32();\n        const buf = this.readBuffer(len);\n        try {\n            // NOTE: Using TextDecoder to fail on invalid UTF-8\n            return textDecoder.decode(buf);\n        }\n        catch (e) {\n            throw new BorshError(`Error decoding UTF-8 string: ${e}`);\n        }\n    }\n    readFixedArray(len) {\n        return new Uint8Array(this.readBuffer(len));\n    }\n    readArray(fn) {\n        const len = this.readU32();\n        const result = Array();\n        for (let i = 0; i < len; ++i) {\n            result.push(fn());\n        }\n        return result;\n    }\n}\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU8\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU16\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU32\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU64\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU128\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU256\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU512\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readString\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readFixedArray\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readArray\", null);\nexports.BinaryReader = BinaryReader;\nfunction capitalizeFirstLetter(string) {\n    return string.charAt(0).toUpperCase() + string.slice(1);\n}\nfunction serializeField(schema, fieldName, value, fieldType, writer) {\n    try {\n        // TODO: Handle missing values properly (make sure they never result in just skipped write)\n        if (typeof fieldType === \"string\") {\n            writer[`write${capitalizeFirstLetter(fieldType)}`](value);\n        }\n        else if (fieldType instanceof Array) {\n            if (typeof fieldType[0] === \"number\") {\n                if (value.length !== fieldType[0]) {\n                    throw new BorshError(`Expecting byte array of length ${fieldType[0]}, but got ${value.length} bytes`);\n                }\n                writer.writeFixedArray(value);\n            }\n            else if (fieldType.length === 2 && typeof fieldType[1] === \"number\") {\n                if (value.length !== fieldType[1]) {\n                    throw new BorshError(`Expecting byte array of length ${fieldType[1]}, but got ${value.length} bytes`);\n                }\n                for (let i = 0; i < fieldType[1]; i++) {\n                    serializeField(schema, null, value[i], fieldType[0], writer);\n                }\n            }\n            else {\n                writer.writeArray(value, (item) => {\n                    serializeField(schema, fieldName, item, fieldType[0], writer);\n                });\n            }\n        }\n        else if (fieldType.kind !== undefined) {\n            switch (fieldType.kind) {\n                case \"option\": {\n                    if (value === null || value === undefined) {\n                        writer.writeU8(0);\n                    }\n                    else {\n                        writer.writeU8(1);\n                        serializeField(schema, fieldName, value, fieldType.type, writer);\n                    }\n                    break;\n                }\n                case \"map\": {\n                    writer.writeU32(value.size);\n                    value.forEach((val, key) => {\n                        serializeField(schema, fieldName, key, fieldType.key, writer);\n                        serializeField(schema, fieldName, val, fieldType.value, writer);\n                    });\n                    break;\n                }\n                default:\n                    throw new BorshError(`FieldType ${fieldType} unrecognized`);\n            }\n        }\n        else {\n            serializeStruct(schema, value, writer);\n        }\n    }\n    catch (error) {\n        if (error instanceof BorshError) {\n            error.addToFieldPath(fieldName);\n        }\n        throw error;\n    }\n}\nfunction serializeStruct(schema, obj, writer) {\n    if (typeof obj.borshSerialize === \"function\") {\n        obj.borshSerialize(writer);\n        return;\n    }\n    const structSchema = schema.get(obj.constructor);\n    if (!structSchema) {\n        throw new BorshError(`Class ${obj.constructor.name} is missing in schema`);\n    }\n    if (structSchema.kind === \"struct\") {\n        structSchema.fields.map(([fieldName, fieldType]) => {\n            serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n        });\n    }\n    else if (structSchema.kind === \"enum\") {\n        const name = obj[structSchema.field];\n        for (let idx = 0; idx < structSchema.values.length; ++idx) {\n            const [fieldName, fieldType] = structSchema.values[idx];\n            if (fieldName === name) {\n                writer.writeU8(idx);\n                serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n                break;\n            }\n        }\n    }\n    else {\n        throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${obj.constructor.name}`);\n    }\n}\n/// Serialize given object using schema of the form:\n/// { class_name -> [ [field_name, field_type], .. ], .. }\nfunction serialize(schema, obj, Writer = BinaryWriter) {\n    const writer = new Writer();\n    serializeStruct(schema, obj, writer);\n    return writer.toArray();\n}\nexports.serialize = serialize;\nfunction deserializeField(schema, fieldName, fieldType, reader) {\n    try {\n        if (typeof fieldType === \"string\") {\n            return reader[`read${capitalizeFirstLetter(fieldType)}`]();\n        }\n        if (fieldType instanceof Array) {\n            if (typeof fieldType[0] === \"number\") {\n                return reader.readFixedArray(fieldType[0]);\n            }\n            else if (typeof fieldType[1] === \"number\") {\n                const arr = [];\n                for (let i = 0; i < fieldType[1]; i++) {\n                    arr.push(deserializeField(schema, null, fieldType[0], reader));\n                }\n                return arr;\n            }\n            else {\n                return reader.readArray(() => deserializeField(schema, fieldName, fieldType[0], reader));\n            }\n        }\n        if (fieldType.kind === \"option\") {\n            const option = reader.readU8();\n            if (option) {\n                return deserializeField(schema, fieldName, fieldType.type, reader);\n            }\n            return undefined;\n        }\n        if (fieldType.kind === \"map\") {\n            let map = new Map();\n            const length = reader.readU32();\n            for (let i = 0; i < length; i++) {\n                const key = deserializeField(schema, fieldName, fieldType.key, reader);\n                const val = deserializeField(schema, fieldName, fieldType.value, reader);\n                map.set(key, val);\n            }\n            return map;\n        }\n        return deserializeStruct(schema, fieldType, reader);\n    }\n    catch (error) {\n        if (error instanceof BorshError) {\n            error.addToFieldPath(fieldName);\n        }\n        throw error;\n    }\n}\nfunction deserializeStruct(schema, classType, reader) {\n    if (typeof classType.borshDeserialize === \"function\") {\n        return classType.borshDeserialize(reader);\n    }\n    const structSchema = schema.get(classType);\n    if (!structSchema) {\n        throw new BorshError(`Class ${classType.name} is missing in schema`);\n    }\n    if (structSchema.kind === \"struct\") {\n        const result = {};\n        for (const [fieldName, fieldType] of schema.get(classType).fields) {\n            result[fieldName] = deserializeField(schema, fieldName, fieldType, reader);\n        }\n        return new classType(result);\n    }\n    if (structSchema.kind === \"enum\") {\n        const idx = reader.readU8();\n        if (idx >= structSchema.values.length) {\n            throw new BorshError(`Enum index: ${idx} is out of range`);\n        }\n        const [fieldName, fieldType] = structSchema.values[idx];\n        const fieldValue = deserializeField(schema, fieldName, fieldType, reader);\n        return new classType({ [fieldName]: fieldValue });\n    }\n    throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${classType.constructor.name}`);\n}\n/// Deserializes object from bytes using schema.\nfunction deserialize(schema, classType, buffer, Reader = BinaryReader) {\n    const reader = new Reader(buffer);\n    const result = deserializeStruct(schema, classType, reader);\n    if (reader.offset < buffer.length) {\n        throw new BorshError(`Unexpected ${buffer.length - reader.offset} bytes after deserialized data`);\n    }\n    return result;\n}\nexports.deserialize = deserialize;\n/// Deserializes object from bytes using schema, without checking the length read\nfunction deserializeUnchecked(schema, classType, buffer, Reader = BinaryReader) {\n    const reader = new Reader(buffer);\n    return deserializeStruct(schema, classType, reader);\n}\nexports.deserializeUnchecked = deserializeUnchecked;\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","const basex = require('base-x')\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (source instanceof Uint8Array) {\n    } else if (ArrayBuffer.isView(source)) {\n      source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n    } else if (Array.isArray(source)) {\n      source = Uint8Array.from(source)\n    }\n    if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return new Uint8Array() }\n    var psz = 0\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (source[psz]) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = new Uint8Array(zeroes + (size - it4))\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n","/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Support for translating between Buffer instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n *   format} with {@link module:Layout.u8|8-bit}, {@link\n *   module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n *   {@link module:Layout.u32|32-bit}, {@link\n *   module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n *   format} with {@link module:Layout.u16be|16-bit}, {@link\n *   module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n *   {@link module:Layout.u40be|40-bit}, and {@link\n *   module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n *   format} with {@link module:Layout.s8|8-bit}, {@link\n *   module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n *   {@link module:Layout.s32|32-bit}, {@link\n *   module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n *   with {@link module:Layout.s16be|16-bit}, {@link\n *   module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n *   {@link module:Layout.s40be|40-bit}, and {@link\n *   module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n *   less than 2^53) or nearby integral Number in {@link\n *   module:Layout.nu64|unsigned little-endian}, {@link\n *   module:Layout.nu64be|unsigned big-endian}, {@link\n *   module:Layout.ns64|signed little-endian}, and {@link\n *   module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n *   module:Layout.f32|little-endian} and {@link\n *   module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n *   module:Layout.f64|little-endian} and {@link\n *   module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n *   encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n *   module:Layout~Layout|Layout}, with JavaScript representation as\n *   an Array and constant or data-dependent {@link\n *   module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n *   heterogeneous sequence of {@link module:Layout~Layout|Layout}\n *   instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n *   module:Layout~VariantLayout|variant layouts} over a fixed\n *   (padded) or variable (not padded) span of bytes, using an\n *   unsigned integer at the start of the data or a separate {@link\n *   module:Layout.unionLayoutDiscriminator|layout element} to\n *   determine which layout to use when interpreting the buffer\n *   contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n *   of individual {@link\n *   module:Layout~BitStructure#addField|BitField}s packed into an 8,\n *   16, 24, or 32-bit unsigned integer starting at the least- or\n *   most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n *   module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n\n'use strict';\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nexports.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\nexports.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n  if ('function' !== typeof Class) {\n    throw new TypeError('Class must be constructor');\n  }\n  if (Class.hasOwnProperty('layout_')) {\n    throw new Error('Class is already bound to a layout');\n  }\n  if (!(layout && (layout instanceof Layout))) {\n    throw new TypeError('layout must be a Layout');\n  }\n  if (layout.hasOwnProperty('boundConstructor_')) {\n    throw new Error('layout is already bound to a constructor');\n  }\n  Class.layout_ = layout;\n  layout.boundConstructor_ = Class;\n  layout.makeDestinationObject = (() => new Class());\n  Object.defineProperty(Class.prototype, 'encode', {\n    value: function(b, offset) {\n      return layout.encode(this, b, offset);\n    },\n    writable: true,\n  });\n  Object.defineProperty(Class, 'decode', {\n    value: function(b, offset) {\n      return layout.decode(b, offset);\n    },\n    writable: true,\n  });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n  constructor(elementSpan, property) {\n    if (undefined === elementSpan) {\n      elementSpan = 1;\n    }\n    if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n      throw new TypeError('elementSpan must be a (positive) integer');\n    }\n    super(-1, property);\n\n    /** The layout for individual elements of the sequence.  The value\n     * must be a positive integer.  If not provided, the value will be\n     * 1. */\n    this.elementSpan = elementSpan;\n  }\n\n  /** @override */\n  isCount() {\n    return true;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rem = b.length - offset;\n    return Math.floor(rem / this.elementSpan);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    return 0;\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readUInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatLE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatBE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleLE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleBE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n  constructor(elementLayout, count, property) {\n    if (!(elementLayout instanceof Layout)) {\n      throw new TypeError('elementLayout must be a Layout');\n    }\n    if (!(((count instanceof ExternalLayout) && count.isCount())\n          || (Number.isInteger(count) && (0 <= count)))) {\n      throw new TypeError('count must be non-negative integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n    let span = -1;\n    if ((!(count instanceof ExternalLayout))\n        && (0 < elementLayout.span)) {\n      span = count * elementLayout.span;\n    }\n\n    super(span, property);\n\n    /** The layout for individual elements of the sequence. */\n    this.elementLayout = elementLayout;\n\n    /** The number of elements in the sequence.\n     *\n     * This will be either a non-negative integer or an instance of\n     * {@link ExternalLayout} for which {@link\n     * ExternalLayout#isCount|isCount()} is `true`. */\n    this.count = count;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    if (0 < this.elementLayout.span) {\n      span = count * this.elementLayout.span;\n    } else {\n      let idx = 0;\n      while (idx < count) {\n        span += this.elementLayout.getSpan(b, offset + span);\n        ++idx;\n      }\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rv = [];\n    let i = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    while (i < count) {\n      rv.push(this.elementLayout.decode(b, offset));\n      offset += this.elementLayout.getSpan(b, offset);\n      i += 1;\n    }\n    return rv;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n   *\n   * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n   * the unused space in the buffer is left unchanged.  If `src` is\n   * longer than {@link Sequence#count|count} the unneeded elements are\n   * ignored.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const elo = this.elementLayout;\n    const span = src.reduce((span, v) => {\n      return span + elo.encode(v, b, offset + span);\n    }, 0);\n    if (this.count instanceof ExternalLayout) {\n      this.count.encode(src.length, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n  if (0 > v) {\n    v += 0x100000000;\n  }\n  return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n  constructor(word, msb, property) {\n    if (!((word instanceof UInt)\n          || (word instanceof UIntBE))) {\n      throw new TypeError('word must be a UInt or UIntBE layout');\n    }\n    if (('string' === typeof msb)\n        && (undefined === property)) {\n      property = msb;\n      msb = undefined;\n    }\n    if (4 < word.span) {\n      throw new RangeError('word cannot exceed 32 bits');\n    }\n    super(word.span, property);\n\n    /** The layout used for the packed value.  {@link BitField}\n     * instances are packed sequentially depending on {@link\n     * BitStructure#msb|msb}. */\n    this.word = word;\n\n    /** Whether the bit sequences are packed starting at the most\n     * significant bit growing down (`true`), or the least significant\n     * bit growing up (`false`).\n     *\n     * **NOTE** Regardless of this value, the least significant bit of\n     * any {@link BitField} value is the least significant bit of the\n     * corresponding section of the packed value. */\n    this.msb = !!msb;\n\n    /** The sequence of {@link BitField} layouts that comprise the\n     * packed structure.\n     *\n     * **NOTE** The array remains mutable to allow fields to be {@link\n     * BitStructure#addField|added} after construction.  Users should\n     * not manipulate the content of this property.*/\n    this.fields = [];\n\n    /* Storage for the value.  Capture a variable instead of using an\n     * instance property because we don't want anything to change the\n     * value without going through the mutator. */\n    let value = 0;\n    this._packedSetValue = function(v) {\n      value = fixBitwiseResult(v);\n      return this;\n    };\n    this._packedGetValue = function() {\n      return value;\n    };\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(value);\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the packed\n   * value is left unmodified.  Unused bits are also left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          fd.encode(fv);\n        }\n      }\n    }\n    return this.word.encode(this._packedGetValue(), b, offset);\n  }\n\n  /** Register a new bitfield with a containing bit structure.  The\n   * resulting bitfield is returned.\n   *\n   * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {BitField} */\n  addField(bits, property) {\n    const bf = new BitField(this, bits, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /** As with {@link BitStructure#addField|addField} for single-bit\n   * fields with `boolean` value representation.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {Boolean} */\n  addBoolean(property) {\n    // This is my Boolean, not the Javascript one.\n    // eslint-disable-next-line no-new-wrappers\n    const bf = new Boolean(this, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /**\n   * Get access to the bit field for a given property.\n   *\n   * @param {String} property - the bit field of interest.\n   *\n   * @return {BitField} - the field associated with `property`, or\n   * undefined if there is no such property.\n   */\n  fieldFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n  constructor(container, bits, property) {\n    if (!(container instanceof BitStructure)) {\n      throw new TypeError('container must be a BitStructure');\n    }\n    if ((!Number.isInteger(bits)) || (0 >= bits)) {\n      throw new TypeError('bits must be positive integer');\n    }\n    const totalBits = 8 * container.span;\n    const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n    if ((bits + usedBits) > totalBits) {\n      throw new Error('bits too long for span remainder ('\n                      + (totalBits - usedBits) + ' of '\n                      + totalBits + ' remain)');\n    }\n\n    /** The {@link BitStructure} instance to which this bit field\n     * belongs. */\n    this.container = container;\n\n    /** The span of this value in bits. */\n    this.bits = bits;\n\n    /** A mask of {@link BitField#bits|bits} bits isolating value bits\n     * that fit within the field.\n     *\n     * That is, it masks a value that has not yet been shifted into\n     * position within its containing packed integer. */\n    this.valueMask = (1 << bits) - 1;\n    if (32 === bits) { // shifted value out of range\n      this.valueMask = 0xFFFFFFFF;\n    }\n\n    /** The offset of the value within the containing packed unsigned\n     * integer.  The least significant bit of the packed value is at\n     * offset zero, regardless of bit ordering used. */\n    this.start = usedBits;\n    if (this.container.msb) {\n      this.start = totalBits - usedBits - bits;\n    }\n\n    /** A mask of {@link BitField#bits|bits} isolating the field value\n     * within the containing packed unsigned integer. */\n    this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n    /** The property name used when this bitfield is represented in an\n     * Object.\n     *\n     * Intended to be functionally equivalent to {@link\n     * Layout#property}.\n     *\n     * If left undefined the corresponding span of bits will be\n     * treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field. */\n  decode() {\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(word & this.wordMask);\n    const value = wordValue >>> this.start;\n    return value;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field.\n   *\n   * **NOTE** This is not a specialization of {@link\n   * Layout#encode|Layout.encode} and there is no return value. */\n  encode(value) {\n    if ((!Number.isInteger(value))\n        || (value !== fixBitwiseResult(value & this.valueMask))) {\n      throw new TypeError(nameWithProperty('BitField.encode', this)\n                          + ' value must be integer not exceeding ' + this.valueMask);\n    }\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(value << this.start);\n    this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n                                   | wordValue);\n  };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n  constructor(container, property) {\n    super(container, 1, property);\n  }\n\n  /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n   *\n   * @returns {boolean} */\n  decode(b, offset) {\n    return !!BitField.prototype.decode.call(this, b, offset);\n  }\n\n  /** @override */\n  encode(value) {\n    if ('boolean' === typeof value) {\n      // BitField requires integer values\n      value = +value;\n    }\n    return BitField.prototype.encode.call(this, value);\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n  constructor(property) {\n    super(-1, property);\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let idx = offset;\n    while ((idx < b.length) && (0 !== b[idx])) {\n      idx += 1;\n    }\n    return 1 + idx - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    return b.slice(offset, offset + span - 1).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    b[offset + span] = 0;\n    return span + 1;\n  }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n  constructor(maxSpan, property) {\n    if (('string' === typeof maxSpan)\n        && (undefined === property)) {\n      property = maxSpan;\n      maxSpan = undefined;\n    }\n    if (undefined === maxSpan) {\n      maxSpan = -1;\n    } else if (!Number.isInteger(maxSpan)) {\n      throw new TypeError('maxSpan must be an integer');\n    }\n\n    super(-1, property);\n\n    /** The maximum span of the layout in bytes.\n     *\n     * Positive values are generally expected.  Zero is abnormal.\n     * Attempts to encode or decode a value that exceeds this length\n     * will throw a `RangeError`.\n     *\n     * A negative value indicates that there is no bound on the length\n     * of the content. */\n    this.maxSpan = maxSpan;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.length - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    return b.slice(offset, offset + span).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    return span;\n  }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n  constructor(value, property) {\n    super(0, property);\n\n    /** The value produced by this constant when the layout is {@link\n     * Constant#decode|decoded}.\n     *\n     * Any JavaScript value including `null` and `undefined` is\n     * permitted.\n     *\n     * **WARNING** If `value` passed in the constructor was not\n     * frozen, it is possible for users of decoded values to change\n     * the content of the value. */\n    this.value = value;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    return this.value;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    /* Constants take no space */\n    return 0;\n  }\n}\n\nexports.ExternalLayout = ExternalLayout;\nexports.GreedyCount = GreedyCount;\nexports.OffsetLayout = OffsetLayout;\nexports.UInt = UInt;\nexports.UIntBE = UIntBE;\nexports.Int = Int;\nexports.IntBE = IntBE;\nexports.Float = Float;\nexports.FloatBE = FloatBE;\nexports.Double = Double;\nexports.DoubleBE = DoubleBE;\nexports.Sequence = Sequence;\nexports.Structure = Structure;\nexports.UnionDiscriminator = UnionDiscriminator;\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nexports.Union = Union;\nexports.VariantLayout = VariantLayout;\nexports.BitStructure = BitStructure;\nexports.BitField = BitField;\nexports.Boolean = Boolean;\nexports.Blob = Blob;\nexports.CString = CString;\nexports.UTF8 = UTF8;\nexports.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nexports.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nexports.const = ((value, property) => new Constant(value, property));\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\nvar setFunctionLength = require('set-function-length');\n\nvar $TypeError = require('es-errors/type');\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $defineProperty = require('es-define-property');\nvar $max = GetIntrinsic('%Math.max%');\n\nmodule.exports = function callBind(originalFunction) {\n\tif (typeof originalFunction !== 'function') {\n\t\tthrow new $TypeError('a function is required');\n\t}\n\tvar func = $reflectApply(bind, $call, arguments);\n\treturn setFunctionLength(\n\t\tfunc,\n\t\t1 + $max(0, originalFunction.length - (arguments.length - 1)),\n\t\ttrue\n\t);\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\nconst preserveCamelCase = string => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && /[a-zA-Z]/.test(character) && character.toUpperCase() === character) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && /[a-zA-Z]/.test(character) && character.toLowerCase() === character) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = character.toLowerCase() === character && character.toUpperCase() !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = character.toUpperCase() === character && character.toLowerCase() !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = Object.assign({\n\t\tpascalCase: false\n\t}, options);\n\n\tconst postProcess = x => options.pascalCase ? x.charAt(0).toUpperCase() + x.slice(1) : x;\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? input.toUpperCase() : input.toLowerCase();\n\t}\n\n\tconst hasUpperCase = input !== input.toLowerCase();\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input);\n\t}\n\n\tinput = input\n\t\t.replace(/^[_.\\- ]+/, '')\n\t\t.toLowerCase()\n\t\t.replace(/[_.\\- ]+(\\w|$)/g, (_, p1) => p1.toUpperCase())\n\t\t.replace(/\\d+(\\w|$)/g, m => m.toUpperCase());\n\n\treturn postProcess(input);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports.default = camelCase;\n","/*! decimal.js-light v2.5.1 https://github.com/MikeMcl/decimal.js-light/LICENCE */\r\n;(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js-light v2.5.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js-light\r\n   *  Copyright (c) 2020 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Expat Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  var MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    Decimal = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed during run-time using `Decimal.config`.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used by default by `toInteger`, `toDecimalPlaces`, `toExponential`,\r\n      // `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -MAX_E\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to MAX_E\r\n\r\n      // The natural logarithm of 10.\r\n      // 115 digits\r\n      LN10: '2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286'\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    exponentOutOfRange = decimalError + 'Exponent out of range: ',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    ONE,\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n    MAX_E = mathfloor(MAX_SAFE_INTEGER / LOG_BASE),    // 1286742750677284\r\n\r\n    // Decimal.prototype object\r\n    P = {};\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue                       abs\r\n   *  comparedTo                          cmp\r\n   *  decimalPlaces                       dp\r\n   *  dividedBy                           div\r\n   *  dividedToIntegerBy                  idiv\r\n   *  equals                              eq\r\n   *  exponent\r\n   *  greaterThan                         gt\r\n   *  greaterThanOrEqualTo                gte\r\n   *  isInteger                           isint\r\n   *  isNegative                          isneg\r\n   *  isPositive                          ispos\r\n   *  isZero\r\n   *  lessThan                            lt\r\n   *  lessThanOrEqualTo                   lte\r\n   *  logarithm                           log\r\n   *  minus                               sub\r\n   *  modulo                              mod\r\n   *  naturalExponential                  exp\r\n   *  naturalLogarithm                    ln\r\n   *  negated                             neg\r\n   *  plus                                add\r\n   *  precision                           sd\r\n   *  squareRoot                          sqrt\r\n   *  times                               mul\r\n   *  toDecimalPlaces                     todp\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toInteger                           toint\r\n   *  toNumber\r\n   *  toPower                             pow\r\n   *  toPrecision\r\n   *  toSignificantDigits                 tosd\r\n   *  toString\r\n   *  valueOf                             val\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this;\r\n\r\n    y = new x.constructor(y);\r\n\r\n    // Signs differ?\r\n    if (x.s !== y.s) return x.s || -y.s;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ x.s < 0 ? 1 : -1;\r\n\r\n    xdL = x.d.length;\r\n    ydL = y.d.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (x.d[i] !== y.d[i]) return x.d[i] > y.d[i] ^ x.s < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ x.s < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var x = this,\r\n      w = x.d.length - 1,\r\n      dp = (w - x.e) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = x.d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) dp--;\r\n\r\n    return dp < 0 ? 0 : dp;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(divide(x, new Ctor(y), 0, 1), Ctor.precision);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return !this.cmp(y);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the (base 10) exponent value of this Decimal (this.e is the base 10000000 exponent).\r\n   *\r\n   */\r\n  P.exponent = function () {\r\n    return getBase10Exponent(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    return this.cmp(y) >= 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isint = function () {\r\n    return this.e > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isneg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.ispos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return this.s === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   * If no base is specified, return log[10](x).\r\n   *\r\n   * log[base](x) = ln(x) / ln(base)\r\n   *\r\n   * The maximum error of the result is 1 ulp (unit in the last place).\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var r,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      wpr = pr + 5;\r\n\r\n    // Default base is 10.\r\n    if (base === void 0) {\r\n      base = new Ctor(10);\r\n    } else {\r\n      base = new Ctor(base);\r\n\r\n      // log[-b](x) = NaN\r\n      // log[0](x)  = NaN\r\n      // log[1](x)  = NaN\r\n      if (base.s < 1 || base.eq(ONE)) throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    // log[b](-x) = NaN\r\n    // log[b](0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // log[b](1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    external = false;\r\n    r = divide(ln(x, wpr), ln(base, wpr), wpr);\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? subtract(x, y) : add(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // x % 0 = NaN\r\n    if (!y.s) throw Error(decimalError + 'NaN');\r\n\r\n    // Return x if x is 0.\r\n    if (!x.s) return round(new Ctor(x), pr);\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n    q = divide(x, y, 0, 1).times(y);\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return exp(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return ln(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s || 0;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? add(x, y) : subtract(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var e, sd, w,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    e = getBase10Exponent(x) + 1;\r\n    w = x.d.length - 1;\r\n    sd = w * LOG_BASE + 1;\r\n    w = x.d[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) sd--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = x.d[0]; w >= 10; w /= 10) sd++;\r\n    }\r\n\r\n    return z && e > sd ? e : sd;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var e, n, pr, r, s, t, wpr,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative or zero?\r\n    if (x.s < 1) {\r\n      if (!x.s) return new Ctor(0);\r\n\r\n      // sqrt(-x) = NaN\r\n      throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    e = getBase10Exponent(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    pr = Ctor.precision;\r\n    s = wpr = pr + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, wpr + 2)).times(0.5);\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === (n = digitsToString(r.d)).slice(0, wpr)) {\r\n        n = n.slice(wpr - 3, wpr + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (s == wpr && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          round(t, pr + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        } else if (n != '9999') {\r\n          break;\r\n        }\r\n\r\n        wpr += 4;\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal times `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    // Return 0 if either is 0.\r\n    if (!x.s || !y.s) return new Ctor(0);\r\n\r\n    y.s *= x.s;\r\n    e = x.e + y.e;\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = e;\r\n\r\n    return external ? round(y, Ctor.precision) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.todp = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return round(x, dp + getBase10Exponent(x) + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = toString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), dp + 1, rm);\r\n      str = toString(x, true, dp + 1);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) return toString(x);\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = round(new Ctor(x), dp + getBase10Exponent(x) + 1, rm);\r\n    str = toString(y.abs(), false, dp + getBase10Exponent(y) + 1);\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isneg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.toInteger = P.toint = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(new Ctor(x), getBase10Exponent(x) + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * The maximum error is 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, sign, yIsInt,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      guard = 12,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // pow(x, 0) = 1\r\n    if (!y.s) return new Ctor(ONE);\r\n\r\n    x = new Ctor(x);\r\n\r\n    // pow(0, y > 0) = 0\r\n    // pow(0, y < 0) = Infinity\r\n    if (!x.s) {\r\n      if (y.s < 1) throw Error(decimalError + 'Infinity');\r\n      return x;\r\n    }\r\n\r\n    // pow(1, y) = 1\r\n    if (x.eq(ONE)) return x;\r\n\r\n    pr = Ctor.precision;\r\n\r\n    // pow(x, 1) = x\r\n    if (y.eq(ONE)) return round(x, pr);\r\n\r\n    e = y.e;\r\n    k = y.d.length - 1;\r\n    yIsInt = e >= k;\r\n    sign = x.s;\r\n\r\n    if (!yIsInt) {\r\n\r\n      // pow(x < 0, y non-integer) = NaN\r\n      if (sign < 0) throw Error(decimalError + 'NaN');\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    } else if ((k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = new Ctor(ONE);\r\n\r\n      // Max k of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      e = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n      external = false;\r\n\r\n      for (;;) {\r\n        if (k % 2) {\r\n          r = r.times(x);\r\n          truncate(r.d, e);\r\n        }\r\n\r\n        k = mathfloor(k / 2);\r\n        if (k === 0) break;\r\n\r\n        x = x.times(x);\r\n        truncate(x.d, e);\r\n      }\r\n\r\n      external = true;\r\n\r\n      return y.s < 0 ? new Ctor(ONE).div(r) : round(r, pr);\r\n    }\r\n\r\n    // Result is negative if x is negative and the last digit of integer y is odd.\r\n    sign = sign < 0 && y.d[Math.max(e, k)] & 1 ? -1 : 1;\r\n\r\n    x.s = 1;\r\n    external = false;\r\n    r = y.times(ln(x, pr + guard));\r\n    external = true;\r\n    r = exp(r);\r\n    r.s = sign;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var e, str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), sd, rm);\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, sd <= e || e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.tosd = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return round(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = P.valueOf = P.val = P.toJSON = function () {\r\n    var x = this,\r\n      e = getBase10Exponent(x),\r\n      Ctor = x.constructor;\r\n\r\n    return toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  add                 P.minus, P.plus\r\n   *  checkInt32          P.todp, P.toExponential, P.toFixed, P.toPrecision, P.tosd\r\n   *  digitsToString      P.log, P.sqrt, P.pow, toString, exp, ln\r\n   *  divide              P.div, P.idiv, P.log, P.mod, P.sqrt, exp, ln\r\n   *  exp                 P.exp, P.pow\r\n   *  getBase10Exponent   P.exponent, P.sd, P.toint, P.sqrt, P.todp, P.toFixed, P.toPrecision,\r\n   *                      P.toString, divide, round, toString, exp, ln\r\n   *  getLn10             P.log, ln\r\n   *  getZeroString       digitsToString, toString\r\n   *  ln                  P.log, P.ln, P.pow, exp\r\n   *  parseDecimal        Decimal\r\n   *  round               P.abs, P.idiv, P.log, P.minus, P.mod, P.neg, P.plus, P.toint, P.sqrt,\r\n   *                      P.times, P.todp, P.toExponential, P.toFixed, P.pow, P.toPrecision, P.tosd,\r\n   *                      divide, getLn10, exp, ln\r\n   *  subtract            P.minus, P.plus\r\n   *  toString            P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf\r\n   *  truncate            P.pow\r\n   *\r\n   *  Throws:             P.log, P.mod, P.sd, P.sqrt, P.pow,  checkInt32, divide, round,\r\n   *                      getLn10, exp, ln, parseDecimal, Decimal, config\r\n   */\r\n\r\n\r\n  function add(x, y) {\r\n    var carry, d, e, i, k, len, xd, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // If either is zero...\r\n    if (!x.s || !y.s) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!y.s) y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    k = x.e;\r\n    e = y.e;\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % BASE | 0;\r\n        carry = temp / BASE | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * BASE + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, dp) {\r\n      var cmp, e, i, k, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either 0?\r\n      if (!x.s) return new Ctor(x);\r\n      if (!y.s) throw Error(decimalError + 'Division by zero');\r\n\r\n      e = x.e - y.e;\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      for (i = 0; yd[i] == (xd[i] || 0); ) ++i;\r\n      if (yd[i] > (xd[i] || 0)) --e;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n      } else if (dp) {\r\n        sd = pr + (getBase10Exponent(x) - getBase10Exponent(y)) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) return new Ctor(0);\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / LOG_BASE + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * BASE + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= BASE/2\r\n        k = BASE / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k);\r\n          xd = multiplyInteger(xd, k);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= BASE / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * BASE + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= BASE) k = BASE - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n\r\n      q.e = e;\r\n\r\n      return round(q, dp ? pr + getBase10Exponent(q) + 1 : pr);\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` truncated to `sd`\r\n   * significant digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   */\r\n  function exp(x, sd) {\r\n    var denominator, guard, pow, sum, t, wpr,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    if (getBase10Exponent(x) > 16) throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n\r\n    // exp(0) = 1\r\n    if (!x.s) return new Ctor(ONE);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    while (x.abs().gte(0.1)) {\r\n      x = x.times(t);    // x = x / 2^5\r\n      k += 5;\r\n    }\r\n\r\n    // Estimate the precision increase necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(ONE);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = round(pow.times(x), wpr);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        while (k--) sum = round(sum.times(sum), wpr);\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(x) {\r\n    var e = x.e * LOG_BASE,\r\n      w = x.d[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for (; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n\r\n    if (sd > Ctor.LN10.sd()) {\r\n\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(decimalError + 'LN10 precision limit exceeded');\r\n    }\r\n\r\n    return round(new Ctor(Ctor.LN10), sd);\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` truncated to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(n) is non-terminating (n != 1)\r\n   *\r\n   */\r\n  function ln(y, sd) {\r\n    var c, c0, denominator, e, numerator, sum, t, wpr, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // ln(-x) = NaN\r\n    // ln(0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // ln(1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    if (x.eq(10)) {\r\n      if (sd == null) external = true;\r\n      return getLn10(Ctor, wpr);\r\n    }\r\n\r\n    wpr += guard;\r\n    Ctor.precision = wpr;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n    e = getBase10Exponent(x);\r\n\r\n    if (Math.abs(e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = getBase10Exponent(x);\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = ln(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n\r\n      Ctor.precision = pr;\r\n      return sd == null ? (external = true, round(x, pr)) : x;\r\n    }\r\n\r\n    // x is reduced to a value near 1.\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(ONE), x.plus(ONE), wpr);\r\n    x2 = round(x.times(x), wpr);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = round(numerator.times(x2), wpr);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr);\r\n\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48;) ++i;\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48;) --len;\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      e = e - i - 1;\r\n      x.e = mathfloor(e / LOG_BASE);\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external && (x.e > MAX_E || x.e < -MAX_E)) throw Error(exponentOutOfRange + e);\r\n    } else {\r\n\r\n      // Zero.\r\n      x.s = 0;\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits, using rounding mode `rm` if present (truncate otherwise).\r\n   */\r\n   function round(x, sd, rm) {\r\n    var i, j, k, n, rd, doRound, w, xdi,\r\n      xd = x.d;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd which contains the rounding digit, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // n: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (n = 1, k = xd[0]; k >= 10; k /= 10) n++;\r\n    i = sd - n;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) return x;\r\n      w = k = xd[xdi];\r\n\r\n      // Get the number of digits of w.\r\n      for (n = 1; k >= 10; k /= 10) n++;\r\n\r\n      // Get the index of rd within w.\r\n      i %= LOG_BASE;\r\n\r\n      // Get the index of rd within w, adjusted for leading zeros.\r\n      // The number of leading zeros of w is given by LOG_BASE - n.\r\n      j = i - LOG_BASE + n;\r\n    }\r\n\r\n    if (rm !== void 0) {\r\n      k = mathpow(10, n - j - 1);\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / k % 10 | 0;\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      doRound = sd < 0 || xd[xdi + 1] !== void 0 || w % k;\r\n\r\n      // The expression `w % mathpow(10, n - j - 1)` returns all the digits of w to the right of the\r\n      // digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression will give\r\n      // 714.\r\n\r\n      doRound = rm < 4\r\n        ? (rd || doRound) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || doRound || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, n - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n    }\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      if (doRound) {\r\n        k = getBase10Exponent(x);\r\n        xd.length = 1;\r\n\r\n        // Convert sd to decimal places.\r\n        sd = sd - k - 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = mathfloor(-sd / LOG_BASE) || 0;\r\n      } else {\r\n        xd.length = 1;\r\n\r\n        // Zero.\r\n        xd[0] = x.e = x.s = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, n - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (doRound) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n          if ((xd[0] += k) == BASE) {\r\n            xd[0] = 1;\r\n            ++x.e;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n\r\n    if (external && (x.e > MAX_E || x.e < -MAX_E)) {\r\n      throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function subtract(x, y) {\r\n    var d, e, i, j, k, len, xd, xe, xLTy, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // Return y negated if x is zero.\r\n    // Return x if y is zero and x is non-zero.\r\n    if (!x.s || !y.s) {\r\n      if (y.s) y.s = -y.s;\r\n      else y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are non-zero numbers with the same sign.\r\n\r\n    e = y.e;\r\n    xe = x.e;\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of zeros\r\n      // needing to be prepended, but this can be avoided while still ensuring correct rounding by\r\n      // limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to xd if shorter.\r\n    // Don't add zeros to yd if shorter as subtraction only needs to start at yd length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(0);\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    //return external && xd.length >= pr / LOG_BASE ? round(y, pr) : y;\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function toString(x, isExp, sd) {\r\n    var k,\r\n      e = getBase10Exponent(x),\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (e < 0 ? 'e' : 'e+') + e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  clone\r\n   *  config/set\r\n   */\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * value {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(value) {\r\n      var x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(value);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (value instanceof Decimal) {\r\n        x.s = value.s;\r\n        x.e = value.e;\r\n        x.d = (value = value.d) ? value.slice() : value;\r\n        return;\r\n      }\r\n\r\n      if (typeof value === 'number') {\r\n\r\n        // Reject Infinity/NaN.\r\n        if (value * 0 !== 0) {\r\n          throw Error(invalidArgument + value);\r\n        }\r\n\r\n        if (value > 0) {\r\n          x.s = 1;\r\n        } else if (value < 0) {\r\n          value = -value;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 0;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (value === ~~value && value < 1e7) {\r\n          x.e = 0;\r\n          x.d = [value];\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, value.toString());\r\n      } else if (typeof value !== 'string') {\r\n        throw Error(invalidArgument + value);\r\n      }\r\n\r\n      // Minus sign?\r\n      if (value.charCodeAt(0) === 45) {\r\n        value = value.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      if (isDecimal.test(value)) parseDecimal(x, value);\r\n      else throw Error(invalidArgument + value);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n\r\n    Decimal.clone = clone;\r\n    Decimal.config = Decimal.set = config;\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'LN10'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') {\r\n      throw Error(decimalError + 'Object expected');\r\n    }\r\n    var i, p, v,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -1 / 0, 0,\r\n        'toExpPos', 0, 1 / 0\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if ((v = obj[p = ps[i]]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if ((v = obj[p = 'LN10']) !== void 0) {\r\n        if (v == Math.LN10) this[p] = new this(v);\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(Decimal);\r\n\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Internal constant.\r\n  ONE = new Decimal(1);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () {\r\n      return Decimal;\r\n    });\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = Decimal;\r\n\r\n    // Browser.\r\n  } else {\r\n    if (!globalScope) {\r\n      globalScope = typeof self != 'undefined' && self && self.self == self\r\n        ? self : Function('return this')();\r\n    }\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*!\r\n   *  decimal.js v10.4.3\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The maximum exponent magnitude.\r\n    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\n  var EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n    MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n    // Base conversion alphabet.\r\n    NUMERALS = '0123456789abcdef',\r\n\r\n    // The natural logarithm of 10 (1025 digits).\r\n    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n    // Pi (1025 digits).\r\n    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    DEFAULTS = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used when rounding to `precision`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n      // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN  6 The IEEE 754 remainder function.\r\n      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n      //\r\n      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n      // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n      // be used, but they may not give useful results.\r\n      modulo: 1,                             // 0 to 9\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // JavaScript numbers: -324  (5e-324)\r\n      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      crypto: false                          // true/false\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    Decimal, inexact, noConflict, quadrant,\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n    cryptoUnavailable = decimalError + 'crypto unavailable',\r\n    tag = '[object Decimal]',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n    isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n    isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n    LN10_PRECISION = LN10.length - 1,\r\n    PI_PRECISION = PI.length - 1,\r\n\r\n    // Decimal.prototype object\r\n    P = { toStringTag: tag };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\r\n   *  clampedTo                 clamp\r\n   *  comparedTo                cmp\r\n   *  cosine                    cos\r\n   *  cubeRoot                  cbrt\r\n   *  decimalPlaces             dp\r\n   *  dividedBy                 div\r\n   *  dividedToIntegerBy        divToInt\r\n   *  equals                    eq\r\n   *  floor\r\n   *  greaterThan               gt\r\n   *  greaterThanOrEqualTo      gte\r\n   *  hyperbolicCosine          cosh\r\n   *  hyperbolicSine            sinh\r\n   *  hyperbolicTangent         tanh\r\n   *  inverseCosine             acos\r\n   *  inverseHyperbolicCosine   acosh\r\n   *  inverseHyperbolicSine     asinh\r\n   *  inverseHyperbolicTangent  atanh\r\n   *  inverseSine               asin\r\n   *  inverseTangent            atan\r\n   *  isFinite\r\n   *  isInteger                 isInt\r\n   *  isNaN\r\n   *  isNegative                isNeg\r\n   *  isPositive                isPos\r\n   *  isZero\r\n   *  lessThan                  lt\r\n   *  lessThanOrEqualTo         lte\r\n   *  logarithm                 log\r\n   *  [maximum]                 [max]\r\n   *  [minimum]                 [min]\r\n   *  minus                     sub\r\n   *  modulo                    mod\r\n   *  naturalExponential        exp\r\n   *  naturalLogarithm          ln\r\n   *  negated                   neg\r\n   *  plus                      add\r\n   *  precision                 sd\r\n   *  round\r\n   *  sine                      sin\r\n   *  squareRoot                sqrt\r\n   *  tangent                   tan\r\n   *  times                     mul\r\n   *  toBinary\r\n   *  toDecimalPlaces           toDP\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toFraction\r\n   *  toHexadecimal             toHex\r\n   *  toNearest\r\n   *  toNumber\r\n   *  toOctal\r\n   *  toPower                   pow\r\n   *  toPrecision\r\n   *  toSignificantDigits       toSD\r\n   *  toString\r\n   *  truncated                 trunc\r\n   *  valueOf                   toJSON\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s < 0) x.s = 1;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of positive Infinity.\r\n   *\r\n   */\r\n  P.ceil = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n   * delineated by `min` and `max`.\r\n   *\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  P.clampedTo = P.clamp = function (min, max) {\r\n    var k,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n    min = new Ctor(min);\r\n    max = new Ctor(max);\r\n    if (!min.s || !max.s) return new Ctor(NaN);\r\n    if (min.gt(max)) throw Error(invalidArgument + max);\r\n    k = x.cmp(min);\r\n    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value,\r\n   *   NaN  if the value of either Decimal is NaN.\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this,\r\n      xd = x.d,\r\n      yd = (y = new x.constructor(y)).d,\r\n      xs = x.s,\r\n      ys = y.s;\r\n\r\n    // Either NaN or ±Infinity?\r\n    if (!xd || !yd) {\r\n      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Either zero?\r\n    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n    // Signs differ?\r\n    if (xs !== ys) return xs;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * cos(0)         = 1\r\n   * cos(-0)        = 1\r\n   * cos(Infinity)  = NaN\r\n   * cos(-Infinity) = NaN\r\n   * cos(NaN)       = NaN\r\n   *\r\n   */\r\n  P.cosine = P.cos = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.d) return new Ctor(NaN);\r\n\r\n    // cos(0) = cos(-0) = 1\r\n    if (!x.d[0]) return new Ctor(1);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *\r\n   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   *  cbrt(0)  =  0\r\n   *  cbrt(-0) = -0\r\n   *  cbrt(1)  =  1\r\n   *  cbrt(-1) = -1\r\n   *  cbrt(N)  =  N\r\n   *  cbrt(-I) = -I\r\n   *  cbrt(I)  =  I\r\n   *\r\n   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n   *\r\n   */\r\n  P.cubeRoot = P.cbrt = function () {\r\n    var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n     // Math.cbrt underflow/overflow?\r\n     // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n    if (!s || Math.abs(s) == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      e = x.e;\r\n\r\n      // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n      s = mathpow(n, 1 / 3);\r\n\r\n      // Rarely, e may be one less than the result exponent value.\r\n      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n      r.s = x.s;\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Halley's method.\r\n    // TODO? Compare Newton's method.\r\n    for (;;) {\r\n      t = r;\r\n      t3 = t.times(t).times(t);\r\n      t3plusx = t3.plus(x);\r\n      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n        // , i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var w,\r\n      d = this.d,\r\n      n = NaN;\r\n\r\n    if (d) {\r\n      w = d.length - 1;\r\n      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      w = d[w];\r\n      if (w) for (; w % 10 == 0; w /= 10) n--;\r\n      if (n < 0) n = 0;\r\n    }\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.divToInt = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return this.cmp(y) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of negative Infinity.\r\n   *\r\n   */\r\n  P.floor = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 3);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    var k = this.cmp(y);\r\n    return k == 1 || k === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [1, Infinity]\r\n   *\r\n   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n   *\r\n   * cosh(0)         = 1\r\n   * cosh(-0)        = 1\r\n   * cosh(Infinity)  = Infinity\r\n   * cosh(-Infinity) = Infinity\r\n   * cosh(NaN)       = NaN\r\n   *\r\n   *  x        time taken (ms)   result\r\n   * 1000      9                 9.8503555700852349694e+433\r\n   * 10000     25                4.4034091128314607936e+4342\r\n   * 100000    171               1.4033316802130615897e+43429\r\n   * 1000000   3817              1.5166076984010437725e+434294\r\n   * 10000000  abandoned after 2 minute wait\r\n   *\r\n   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicCosine = P.cosh = function () {\r\n    var k, n, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      one = new Ctor(1);\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n    if (x.isZero()) return one;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    // TODO? Estimation reused from cosine() and may not be optimal here.\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      n = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      n = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n    // Reverse argument reduction\r\n    var cosh2_x,\r\n      i = k,\r\n      d8 = new Ctor(8);\r\n    for (; i--;) {\r\n      cosh2_x = x.times(x);\r\n      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n    }\r\n\r\n    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n   *\r\n   * sinh(0)         = 0\r\n   * sinh(-0)        = -0\r\n   * sinh(Infinity)  = Infinity\r\n   * sinh(-Infinity) = -Infinity\r\n   * sinh(NaN)       = NaN\r\n   *\r\n   * x        time taken (ms)\r\n   * 10       2 ms\r\n   * 100      5 ms\r\n   * 1000     14 ms\r\n   * 10000    82 ms\r\n   * 100000   886 ms            1.4033316802130615897e+43429\r\n   * 200000   2613 ms\r\n   * 300000   5407 ms\r\n   * 400000   8824 ms\r\n   * 500000   13026 ms          8.7080643612718084129e+217146\r\n   * 1000000  48543 ms\r\n   *\r\n   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicSine = P.sinh = function () {\r\n    var k, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n    } else {\r\n\r\n      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n      // 3 multiplications and 1 addition\r\n\r\n      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n      // 4 multiplications and 2 additions\r\n\r\n      // Estimate the optimum number of times to use the argument reduction.\r\n      k = 1.4 * Math.sqrt(len);\r\n      k = k > 16 ? 16 : k | 0;\r\n\r\n      x = x.times(1 / tinyPow(5, k));\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n      // Reverse argument reduction\r\n      var sinh2_x,\r\n        d5 = new Ctor(5),\r\n        d16 = new Ctor(16),\r\n        d20 = new Ctor(20);\r\n      for (; k--;) {\r\n        sinh2_x = x.times(x);\r\n        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n      }\r\n    }\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * tanh(x) = sinh(x) / cosh(x)\r\n   *\r\n   * tanh(0)         = 0\r\n   * tanh(-0)        = -0\r\n   * tanh(Infinity)  = 1\r\n   * tanh(-Infinity) = -1\r\n   * tanh(NaN)       = NaN\r\n   *\r\n   */\r\n  P.hyperbolicTangent = P.tanh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 7;\r\n    Ctor.rounding = 1;\r\n\r\n    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n   * this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [0, pi]\r\n   *\r\n   * acos(x) = pi/2 - asin(x)\r\n   *\r\n   * acos(0)       = pi/2\r\n   * acos(-0)      = pi/2\r\n   * acos(1)       = 0\r\n   * acos(-1)      = pi\r\n   * acos(1/2)     = pi/3\r\n   * acos(-1/2)    = 2*pi/3\r\n   * acos(|x| > 1) = NaN\r\n   * acos(NaN)     = NaN\r\n   *\r\n   */\r\n  P.inverseCosine = P.acos = function () {\r\n    var halfPi,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      k = x.abs().cmp(1),\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n      return k === 0\r\n        // |x| is 1\r\n        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n        // |x| > 1 or x is NaN\r\n        : new Ctor(NaN);\r\n    }\r\n\r\n    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.asin();\r\n    halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return halfPi.minus(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [1, Infinity]\r\n   * Range: [0, Infinity]\r\n   *\r\n   * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n   *\r\n   * acosh(x < 1)     = NaN\r\n   * acosh(NaN)       = NaN\r\n   * acosh(Infinity)  = Infinity\r\n   * acosh(-Infinity) = NaN\r\n   * acosh(0)         = NaN\r\n   * acosh(-0)        = NaN\r\n   * acosh(1)         = 0\r\n   * acosh(-1)        = NaN\r\n   *\r\n   */\r\n  P.inverseHyperbolicCosine = P.acosh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n    if (!x.isFinite()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n   *\r\n   * asinh(NaN)       = NaN\r\n   * asinh(Infinity)  = Infinity\r\n   * asinh(-Infinity) = -Infinity\r\n   * asinh(0)         = 0\r\n   * asinh(-0)        = -0\r\n   *\r\n   */\r\n  P.inverseHyperbolicSine = P.asinh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n   *\r\n   * atanh(|x| > 1)   = NaN\r\n   * atanh(NaN)       = NaN\r\n   * atanh(Infinity)  = NaN\r\n   * atanh(-Infinity) = NaN\r\n   * atanh(0)         = 0\r\n   * atanh(-0)        = -0\r\n   * atanh(1)         = Infinity\r\n   * atanh(-1)        = -Infinity\r\n   *\r\n   */\r\n  P.inverseHyperbolicTangent = P.atanh = function () {\r\n    var pr, rm, wpr, xsd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    xsd = x.sd();\r\n\r\n    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n    Ctor.precision = wpr = xsd - x.e;\r\n\r\n    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n    Ctor.precision = pr + 4;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.ln();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(0.5);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n   *\r\n   * asin(0)       = 0\r\n   * asin(-0)      = -0\r\n   * asin(1/2)     = pi/6\r\n   * asin(-1/2)    = -pi/6\r\n   * asin(1)       = pi/2\r\n   * asin(-1)      = -pi/2\r\n   * asin(|x| > 1) = NaN\r\n   * asin(NaN)     = NaN\r\n   *\r\n   * TODO? Compare performance of Taylor series.\r\n   *\r\n   */\r\n  P.inverseSine = P.asin = function () {\r\n    var halfPi, k,\r\n      pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    k = x.abs().cmp(1);\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n\r\n      // |x| is 1\r\n      if (k === 0) {\r\n        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        halfPi.s = x.s;\r\n        return halfPi;\r\n      }\r\n\r\n      // |x| > 1 or x is NaN\r\n      return new Ctor(NaN);\r\n    }\r\n\r\n    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n   *\r\n   * atan(0)         = 0\r\n   * atan(-0)        = -0\r\n   * atan(1)         = pi/4\r\n   * atan(-1)        = -pi/4\r\n   * atan(Infinity)  = pi/2\r\n   * atan(-Infinity) = -pi/2\r\n   * atan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.inverseTangent = P.atan = function () {\r\n    var i, j, k, n, px, t, r, wpr, x2,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (!x.isFinite()) {\r\n      if (!x.s) return new Ctor(NaN);\r\n      if (pr + 4 <= PI_PRECISION) {\r\n        r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        r.s = x.s;\r\n        return r;\r\n      }\r\n    } else if (x.isZero()) {\r\n      return new Ctor(x);\r\n    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n\r\n    Ctor.precision = wpr = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n    // Argument reduction\r\n    // Ensure |x| < 0.42\r\n    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n    k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n    external = false;\r\n\r\n    j = Math.ceil(wpr / LOG_BASE);\r\n    n = 1;\r\n    x2 = x.times(x);\r\n    r = new Ctor(x);\r\n    px = x;\r\n\r\n    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n    for (; i !== -1;) {\r\n      px = px.times(x2);\r\n      t = r.minus(px.div(n += 2));\r\n\r\n      px = px.times(x2);\r\n      r = t.plus(px.div(n += 2));\r\n\r\n      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n    }\r\n\r\n    if (k) r = r.times(2 << (k - 1));\r\n\r\n    external = true;\r\n\r\n    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n   *\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.d;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isInt = function () {\r\n    return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is NaN, otherwise return false.\r\n   *\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isNeg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.isPos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.d && this.d[0] === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * If no base is specified, return log[10](arg).\r\n   *\r\n   * log[base](arg) = ln(arg) / ln(base)\r\n   *\r\n   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n   * otherwise:\r\n   *\r\n   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n   * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n   *\r\n   * log[-b](a)       = NaN\r\n   * log[0](a)        = NaN\r\n   * log[1](a)        = NaN\r\n   * log[NaN](a)      = NaN\r\n   * log[Infinity](a) = NaN\r\n   * log[b](0)        = -Infinity\r\n   * log[b](-0)       = -Infinity\r\n   * log[b](-a)       = NaN\r\n   * log[b](1)        = 0\r\n   * log[b](Infinity) = Infinity\r\n   * log[b](NaN)      = NaN\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var isBase10, d, denominator, k, inf, num, sd, r,\r\n      arg = this,\r\n      Ctor = arg.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding,\r\n      guard = 5;\r\n\r\n    // Default base is 10.\r\n    if (base == null) {\r\n      base = new Ctor(10);\r\n      isBase10 = true;\r\n    } else {\r\n      base = new Ctor(base);\r\n      d = base.d;\r\n\r\n      // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n      isBase10 = base.eq(10);\r\n    }\r\n\r\n    d = arg.d;\r\n\r\n    // Is arg negative, non-finite, 0 or 1?\r\n    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n    }\r\n\r\n    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n    // integer power of 10.\r\n    if (isBase10) {\r\n      if (d.length > 1) {\r\n        inf = true;\r\n      } else {\r\n        for (k = d[0]; k % 10 === 0;) k /= 10;\r\n        inf = k !== 1;\r\n      }\r\n    }\r\n\r\n    external = false;\r\n    sd = pr + guard;\r\n    num = naturalLogarithm(arg, sd);\r\n    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n    // The result will have 5 rounding digits.\r\n    r = divide(num, denominator, sd, 1);\r\n\r\n    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n    // calculate 10 further digits.\r\n    //\r\n    // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n    // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n    // further digits, the last 14 are nines, round up and assume the result is exact.\r\n    // Also assume the result is exact if the last 14 are zero.\r\n    //\r\n    // Example of a result that will be incorrectly rounded:\r\n    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n    // place is still 2.6.\r\n    if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n      do {\r\n        sd += 10;\r\n        num = naturalLogarithm(arg, sd);\r\n        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n        r = divide(num, denominator, sd, 1);\r\n\r\n        if (!inf) {\r\n\r\n          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n            r = finalise(r, pr + 1, 0);\r\n          }\r\n\r\n          break;\r\n        }\r\n      } while (checkRoundingDigits(r.d, k += 10, rm));\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.max = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'lt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.min = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'gt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return y negated if x is finite and y is ±Infinity.\r\n      else if (x.d) y.s = -y.s;\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with different signs.\r\n      // Return NaN if both are ±Infinity with the same sign.\r\n      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n    // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.plus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return y negated if x is zero and y is non-zero.\r\n      if (yd[0]) y.s = -y.s;\r\n\r\n      // Return x if y is zero and x is non-zero.\r\n      else if (xd[0]) y = new Ctor(x);\r\n\r\n      // Return zero if both are zero.\r\n      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n      else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    e = mathfloor(y.e / LOG_BASE);\r\n    xe = mathfloor(x.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of\r\n      // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n      // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to `xd` if shorter.\r\n    // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * The result depends on the modulo mode.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n    // Return x if y is ±Infinity or x is ±0.\r\n    if (!y.d || x.d && !x.d[0]) {\r\n      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n    }\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n\r\n    if (Ctor.modulo == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // result = x - q * y    where  0 <= result < abs(y)\r\n      q = divide(x, y.abs(), 0, 3, 1);\r\n      q.s *= y.s;\r\n    } else {\r\n      q = divide(x, y, 0, Ctor.modulo, 1);\r\n    }\r\n\r\n    q = q.times(y);\r\n\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return naturalExponential(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return naturalLogarithm(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with the same sign.\r\n      // Return NaN if both are ±Infinity with different signs.\r\n      // Return y if x is finite and y is ±Infinity.\r\n      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n     // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!yd[0]) y = new Ctor(x);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    k = mathfloor(x.e / LOG_BASE);\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var k,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    if (x.d) {\r\n      k = getPrecision(x.d);\r\n      if (z && x.e + 1 > k) k = x.e + 1;\r\n    } else {\r\n      k = NaN;\r\n    }\r\n\r\n    return k;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.round = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   *\r\n   * sin(0)         = 0\r\n   * sin(-0)        = -0\r\n   * sin(Infinity)  = NaN\r\n   * sin(-Infinity) = NaN\r\n   * sin(NaN)       = NaN\r\n   *\r\n   */\r\n  P.sine = P.sin = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N)  =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I)  =  I\r\n   *  sqrt(0)  =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, sd, r, rep, t,\r\n      x = this,\r\n      d = x.d,\r\n      e = x.e,\r\n      s = x.s,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !d || !d[0]) {\r\n      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n    }\r\n\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(d);\r\n\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * tan(0)         = 0\r\n   * tan(-0)        = -0\r\n   * tan(Infinity)  = NaN\r\n   * tan(-Infinity) = NaN\r\n   * tan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.tangent = P.tan = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.sin();\r\n    x.s = 1;\r\n    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    y.s *= x.s;\r\n\r\n     // If either is NaN, ±Infinity or ±0...\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n        // Return NaN if either is NaN.\r\n        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n        ? NaN\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        // Return ±0 if either is ±0.\r\n        : !xd || !yd ? y.s / 0 : y.s * 0);\r\n    }\r\n\r\n    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = getBase10Exponent(r, e);\r\n\r\n    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toBinary = function (sd, rm) {\r\n    return toStringBinary(this, 2, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return finalise(x, dp + x.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), dp + 1, rm);\r\n      str = finiteToString(x, true, dp + 1);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n      str = finiteToString(y, false, dp + y.e + 1);\r\n    }\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n   * numerator and an integer denominator.\r\n   *\r\n   * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n   * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n   * value necessary to represent the number exactly.\r\n   *\r\n   * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n   *\r\n   */\r\n  P.toFraction = function (maxD) {\r\n    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n      x = this,\r\n      xd = x.d,\r\n      Ctor = x.constructor;\r\n\r\n    if (!xd) return new Ctor(x);\r\n\r\n    n1 = d0 = new Ctor(1);\r\n    d1 = n0 = new Ctor(0);\r\n\r\n    d = new Ctor(d1);\r\n    e = d.e = getPrecision(xd) - x.e - 1;\r\n    k = e % LOG_BASE;\r\n    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n    if (maxD == null) {\r\n\r\n      // d is 10**e, the minimum max-denominator needed.\r\n      maxD = e > 0 ? d : n1;\r\n    } else {\r\n      n = new Ctor(maxD);\r\n      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n    }\r\n\r\n    external = false;\r\n    n = new Ctor(digitsToString(xd));\r\n    pr = Ctor.precision;\r\n    Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n    for (;;)  {\r\n      q = divide(n, d, 0, 1, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.cmp(maxD) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      d2 = n1;\r\n      n1 = n0.plus(q.times(d2));\r\n      n0 = d2;\r\n      d2 = d;\r\n      d = n.minus(q.times(d2));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n        ? [n1, d1] : [n0, d0];\r\n\r\n    Ctor.precision = pr;\r\n    external = true;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toHexadecimal = P.toHex = function (sd, rm) {\r\n    return toStringBinary(this, 16, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n   *\r\n   * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n   * or `y` is NaN, in which case the return value will be also be NaN.\r\n   *\r\n   * The return value is not affected by the value of `precision`.\r\n   *\r\n   * y {number|string|Decimal} The magnitude to round to a multiple of.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toNearest() rounding mode not an integer: {rm}'\r\n   * 'toNearest() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toNearest = function (y, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (y == null) {\r\n\r\n      // If x is not finite, return x.\r\n      if (!x.d) return x;\r\n\r\n      y = new Ctor(1);\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      y = new Ctor(y);\r\n      if (rm === void 0) {\r\n        rm = Ctor.rounding;\r\n      } else {\r\n        checkInt32(rm, 0, 8);\r\n      }\r\n\r\n      // If x is not finite, return x if y is not NaN, else NaN.\r\n      if (!x.d) return y.s ? x : y;\r\n\r\n      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n      if (!y.d) {\r\n        if (y.s) y.s = x.s;\r\n        return y;\r\n      }\r\n    }\r\n\r\n    // If y is not zero, calculate the nearest multiple of y to x.\r\n    if (y.d[0]) {\r\n      external = false;\r\n      x = divide(x, y, 0, rm, 1).times(y);\r\n      external = true;\r\n      finalise(x);\r\n\r\n    // If y is zero, return zero with the sign of x.\r\n    } else {\r\n      y.s = x.s;\r\n      x = y;\r\n    }\r\n\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   * Zero keeps its sign.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toOctal = function (sd, rm) {\r\n    return toStringBinary(this, 8, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n   * to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * ECMAScript compliant.\r\n   *\r\n   *   pow(x, NaN)                           = NaN\r\n   *   pow(x, ±0)                            = 1\r\n\r\n   *   pow(NaN, non-zero)                    = NaN\r\n   *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n   *   pow(abs(x) > 1, -Infinity)            = +0\r\n   *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n   *   pow(abs(x) < 1, +Infinity)            = +0\r\n   *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n   *   pow(+Infinity, y > 0)                 = +Infinity\r\n   *   pow(+Infinity, y < 0)                 = +0\r\n   *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n   *   pow(-Infinity, even integer > 0)      = +Infinity\r\n   *   pow(-Infinity, odd integer < 0)       = -0\r\n   *   pow(-Infinity, even integer < 0)      = +0\r\n   *   pow(+0, y > 0)                        = +0\r\n   *   pow(+0, y < 0)                        = +Infinity\r\n   *   pow(-0, odd integer > 0)              = -0\r\n   *   pow(-0, even integer > 0)             = +0\r\n   *   pow(-0, odd integer < 0)              = -Infinity\r\n   *   pow(-0, even integer < 0)             = +Infinity\r\n   *   pow(finite x < 0, finite non-integer) = NaN\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n   * probability of an incorrectly rounded result\r\n   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n   * i.e. 1 in 250,000,000,000,000\r\n   *\r\n   * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, rm, s,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // Either ±Infinity, NaN or ±0?\r\n    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (x.eq(1)) return x;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n    // y exponent\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = intPow(Ctor, x, k, pr);\r\n      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n    }\r\n\r\n    s = x.s;\r\n\r\n    // if x is negative\r\n    if (s < 0) {\r\n\r\n      // if y is not an integer\r\n      if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n      // Result is positive if x is negative and the last digit of integer y is even.\r\n      if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n      // if x.eq(-1)\r\n      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n        x.s = s;\r\n        return x;\r\n      }\r\n    }\r\n\r\n    // Estimate result exponent.\r\n    // x^y = 10^e,  where e = y * log10(x)\r\n    // log10(x) = log10(x_significand) + x_exponent\r\n    // log10(x_significand) = ln(x_significand) / ln(10)\r\n    k = mathpow(+x, yn);\r\n    e = k == 0 || !isFinite(k)\r\n      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n      : new Ctor(k + '').e;\r\n\r\n    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n    // Overflow/underflow?\r\n    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n    external = false;\r\n    Ctor.rounding = x.s = 1;\r\n\r\n    // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n    // new Decimal(2.32456).pow('2087987436534566.46411')\r\n    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n    k = Math.min(12, (e + '').length);\r\n\r\n    // r = x^y = exp(y*ln(x))\r\n    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n    if (r.d) {\r\n\r\n      // Truncate to the required precision plus five rounding digits.\r\n      r = finalise(r, pr + 5, 1);\r\n\r\n      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n      // the result.\r\n      if (checkRoundingDigits(r.d, pr, rm)) {\r\n        e = pr + 10;\r\n\r\n        // Truncate to the increased precision plus five rounding digits.\r\n        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n      }\r\n    }\r\n\r\n    r.s = s;\r\n    external = true;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), sd, rm);\r\n      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toSD() digits out of range: {sd}'\r\n   * 'toSD() digits not an integer: {sd}'\r\n   * 'toSD() rounding mode not an integer: {rm}'\r\n   * 'toSD() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.toSD = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return finalise(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n   *\r\n   */\r\n  P.truncated = P.trunc = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   * Unlike `toString`, negative zero will include the minus sign.\r\n   *\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n   *                           finiteToString, naturalExponential, naturalLogarithm\r\n   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n   *  convertBase              toStringBinary, parseOther\r\n   *  cos                      P.cos\r\n   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n   *                           taylorSeries, atan2, parseOther\r\n   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n   *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n   *                           naturalLogarithm, ceil, floor, round, trunc\r\n   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n   *                           toStringBinary\r\n   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n   *  getLn10                  P.logarithm, naturalLogarithm\r\n   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n   *  getPrecision             P.precision, P.toFraction\r\n   *  getZeroString            digitsToString, finiteToString\r\n   *  intPow                   P.toPower, parseOther\r\n   *  isOdd                    toLessThanHalfPi\r\n   *  maxOrMin                 max, min\r\n   *  naturalExponential       P.naturalExponential, P.toPower\r\n   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n   *                           P.toPower, naturalExponential\r\n   *  nonFiniteToString        finiteToString, toStringBinary\r\n   *  parseDecimal             Decimal\r\n   *  parseOther               Decimal\r\n   *  sin                      P.sin\r\n   *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n   *  toLessThanHalfPi         P.cos, P.sin\r\n   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n   *  truncate                 intPow\r\n   *\r\n   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n   *                           naturalLogarithm, config, parseOther, random, Decimal\r\n   */\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n   * `repeating == null` if caller is `log` or `pow`,\r\n   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n   */\r\n  function checkRoundingDigits(d, i, rm, repeating) {\r\n    var di, k, r, rd;\r\n\r\n    // Get the length of the first word of the array d.\r\n    for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n    // Is the rounding digit in the first word of d?\r\n    if (--i < 0) {\r\n      i += LOG_BASE;\r\n      di = 0;\r\n    } else {\r\n      di = Math.ceil((i + 1) / LOG_BASE);\r\n      i %= LOG_BASE;\r\n    }\r\n\r\n    // i is the index (0 - 6) of the rounding digit.\r\n    // E.g. if within the word 3487563 the first rounding digit is 5,\r\n    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n    k = mathpow(10, LOG_BASE - i);\r\n    rd = d[di] % k | 0;\r\n\r\n    if (repeating == null) {\r\n      if (i < 3) {\r\n        if (i == 0) rd = rd / 100 | 0;\r\n        else if (i == 1) rd = rd / 10 | 0;\r\n        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n      } else {\r\n        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n      }\r\n    } else {\r\n      if (i < 4) {\r\n        if (i == 0) rd = rd / 1000 | 0;\r\n        else if (i == 1) rd = rd / 100 | 0;\r\n        else if (i == 2) rd = rd / 10 | 0;\r\n        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n      } else {\r\n        r = ((repeating || rm < 4) && rd + 1 == k ||\r\n        (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  // Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n  // Eg. convertBase('255', 10, 16) returns [15, 15].\r\n  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\n  function convertBase(str, baseIn, baseOut) {\r\n    var j,\r\n      arr = [0],\r\n      arrL,\r\n      i = 0,\r\n      strL = str.length;\r\n\r\n    for (; i < strL;) {\r\n      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n      arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n      for (j = 0; j < arr.length; j++) {\r\n        if (arr[j] > baseOut - 1) {\r\n          if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n          arr[j + 1] += arr[j] / baseOut | 0;\r\n          arr[j] %= baseOut;\r\n        }\r\n      }\r\n    }\r\n\r\n    return arr.reverse();\r\n  }\r\n\r\n\r\n  /*\r\n   * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function cosine(Ctor, x) {\r\n    var k, len, y;\r\n\r\n    if (x.isZero()) return x;\r\n\r\n    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    len = x.d.length;\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      y = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      y = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    Ctor.precision += k;\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n    // Reverse argument reduction\r\n    for (var i = k; i--;) {\r\n      var cos2x = x.times(x);\r\n      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n    }\r\n\r\n    Ctor.precision -= k;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Perform division in the specified base.\r\n   */\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k, base) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % base | 0;\r\n        carry = temp / base | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL, base) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * base + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, rm, dp, base) {\r\n      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n        yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either NaN, Infinity or 0?\r\n      if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n      }\r\n\r\n      if (base) {\r\n        logBase = 1;\r\n        e = x.e - y.e;\r\n      } else {\r\n        base = BASE;\r\n        logBase = LOG_BASE;\r\n        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n      }\r\n\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n      for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n      if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n        rm = Ctor.rounding;\r\n      } else if (dp) {\r\n        sd = pr + (x.e - y.e) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) {\r\n        qd.push(1);\r\n        more = true;\r\n      } else {\r\n\r\n        // Convert precision in number of base 10 digits to base 1e7 digits.\r\n        sd = sd / logBase + 2 | 0;\r\n        i = 0;\r\n\r\n        // divisor < 1e7\r\n        if (yL == 1) {\r\n          k = 0;\r\n          yd = yd[0];\r\n          sd++;\r\n\r\n          // k is the carry.\r\n          for (; (i < xL || k) && sd--; i++) {\r\n            t = k * base + (xd[i] || 0);\r\n            qd[i] = t / yd | 0;\r\n            k = t % yd | 0;\r\n          }\r\n\r\n          more = k || i < xL;\r\n\r\n        // divisor >= 1e7\r\n        } else {\r\n\r\n          // Normalise xd and yd so highest order digit of yd is >= base/2\r\n          k = base / (yd[0] + 1) | 0;\r\n\r\n          if (k > 1) {\r\n            yd = multiplyInteger(yd, k, base);\r\n            xd = multiplyInteger(xd, k, base);\r\n            yL = yd.length;\r\n            xL = xd.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xd.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL;) rem[remL++] = 0;\r\n\r\n          yz = yd.slice();\r\n          yz.unshift(0);\r\n          yd0 = yd[0];\r\n\r\n          if (yd[1] >= base / 2) ++yd0;\r\n\r\n          do {\r\n            k = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yd, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, k.\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // k will be how many times the divisor goes into the current remainder.\r\n              k = rem0 / yd0 | 0;\r\n\r\n              //  Algorithm:\r\n              //  1. product = divisor * trial digit (k)\r\n              //  2. if product > remainder: product -= divisor, k--\r\n              //  3. remainder -= product\r\n              //  4. if product was < remainder at 2:\r\n              //    5. compare new remainder and divisor\r\n              //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n              if (k > 1) {\r\n                if (k >= base) k = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiplyInteger(yd, k, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                cmp = compare(prod, rem, prodL, remL);\r\n\r\n                // product > remainder.\r\n                if (cmp == 1) {\r\n                  k--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n                }\r\n              } else {\r\n\r\n                // cmp is -1.\r\n                // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n                // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n                if (k == 0) cmp = k = 1;\r\n                prod = yd.slice();\r\n              }\r\n\r\n              prodL = prod.length;\r\n              if (prodL < remL) prod.unshift(0);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n\r\n              // If product was < previous remainder.\r\n              if (cmp == -1) {\r\n                remL = rem.length;\r\n\r\n                // Compare divisor and new remainder.\r\n                cmp = compare(yd, rem, yL, remL);\r\n\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                if (cmp < 1) {\r\n                  k++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yd, remL, base);\r\n                }\r\n              }\r\n\r\n              remL = rem.length;\r\n            } else if (cmp === 0) {\r\n              k++;\r\n              rem = [0];\r\n            }    // if cmp === 1, k will be 0\r\n\r\n            // Add the next digit, k, to the result array.\r\n            qd[i++] = k;\r\n\r\n            // Update the remainder.\r\n            if (cmp && rem[0]) {\r\n              rem[remL++] = xd[xi] || 0;\r\n            } else {\r\n              rem = [xd[xi]];\r\n              remL = 1;\r\n            }\r\n\r\n          } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n          more = rem[0] !== void 0;\r\n        }\r\n\r\n        // Leading zero?\r\n        if (!qd[0]) qd.shift();\r\n      }\r\n\r\n      // logBase is 1 when divide is being used for base conversion.\r\n      if (logBase == 1) {\r\n        q.e = e;\r\n        inexact = more;\r\n      } else {\r\n\r\n        // To calculate q.e, first get the number of digits of qd[0].\r\n        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n        q.e = i + e * logBase - 1;\r\n\r\n        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n   * Check for over/under-flow.\r\n   */\r\n   function finalise(x, sd, rm, isTruncated) {\r\n    var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n      Ctor = x.constructor;\r\n\r\n    // Don't round if sd is null or undefined.\r\n    out: if (sd != null) {\r\n      xd = x.d;\r\n\r\n      // Infinity/NaN.\r\n      if (!xd) return x;\r\n\r\n      // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      // w: the word of xd containing rd, a base 1e7 number.\r\n      // xdi: the index of w within xd.\r\n      // digits: the number of digits of w.\r\n      // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n      // they had leading zeros)\r\n      // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n      // Get the length of the first word of the digits array xd.\r\n      for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n      i = sd - digits;\r\n\r\n      // Is the rounding digit in the first word of xd?\r\n      if (i < 0) {\r\n        i += LOG_BASE;\r\n        j = sd;\r\n        w = xd[xdi = 0];\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      } else {\r\n        xdi = Math.ceil((i + 1) / LOG_BASE);\r\n        k = xd.length;\r\n        if (xdi >= k) {\r\n          if (isTruncated) {\r\n\r\n            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n            for (; k++ <= xdi;) xd.push(0);\r\n            w = rd = 0;\r\n            digits = 1;\r\n            i %= LOG_BASE;\r\n            j = i - LOG_BASE + 1;\r\n          } else {\r\n            break out;\r\n          }\r\n        } else {\r\n          w = k = xd[xdi];\r\n\r\n          // Get the number of digits of w.\r\n          for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n          // Get the index of rd within w.\r\n          i %= LOG_BASE;\r\n\r\n          // Get the index of rd within w, adjusted for leading zeros.\r\n          // The number of leading zeros of w is given by LOG_BASE - digits.\r\n          j = i - LOG_BASE + digits;\r\n\r\n          // Get the rounding digit at index j of w.\r\n          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n        }\r\n      }\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      isTruncated = isTruncated || sd < 0 ||\r\n        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n      // will give 714.\r\n\r\n      roundUp = rm < 4\r\n        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n\r\n      if (sd < 1 || !xd[0]) {\r\n        xd.length = 0;\r\n        if (roundUp) {\r\n\r\n          // Convert sd to decimal places.\r\n          sd -= x.e + 1;\r\n\r\n          // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n          xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n          x.e = -sd || 0;\r\n        } else {\r\n\r\n          // Zero.\r\n          xd[0] = x.e = 0;\r\n        }\r\n\r\n        return x;\r\n      }\r\n\r\n      // Remove excess digits.\r\n      if (i == 0) {\r\n        xd.length = xdi;\r\n        k = 1;\r\n        xdi--;\r\n      } else {\r\n        xd.length = xdi + 1;\r\n        k = mathpow(10, LOG_BASE - i);\r\n\r\n        // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n        // j > 0 means i > number of leading zeros of w.\r\n        xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n      }\r\n\r\n      if (roundUp) {\r\n        for (;;) {\r\n\r\n          // Is the digit to be rounded up in the first word of xd?\r\n          if (xdi == 0) {\r\n\r\n            // i will be the length of xd[0] before k is added.\r\n            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n            j = xd[0] += k;\r\n            for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n            // if i != k the length has increased.\r\n            if (i != k) {\r\n              x.e++;\r\n              if (xd[0] == BASE) xd[0] = 1;\r\n            }\r\n\r\n            break;\r\n          } else {\r\n            xd[xdi] += k;\r\n            if (xd[xdi] != BASE) break;\r\n            xd[xdi--] = 0;\r\n            k = 1;\r\n          }\r\n        }\r\n      }\r\n\r\n      // Remove trailing zeros.\r\n      for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n    }\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > Ctor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < Ctor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // Ctor.underflow = true;\r\n      } // else Ctor.underflow = false;\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function finiteToString(x, isExp, sd) {\r\n    if (!x.isFinite()) return nonFiniteToString(x);\r\n    var k,\r\n      e = x.e,\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(digits, e) {\r\n    var w = digits[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n    if (sd > LN10_PRECISION) {\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(precisionLimitExceeded);\r\n    }\r\n    return finalise(new Ctor(LN10), sd, 1, true);\r\n  }\r\n\r\n\r\n  function getPi(Ctor, sd, rm) {\r\n    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n    return finalise(new Ctor(PI), sd, rm, true);\r\n  }\r\n\r\n\r\n  function getPrecision(digits) {\r\n    var w = digits.length - 1,\r\n      len = w * LOG_BASE + 1;\r\n\r\n    w = digits[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) len--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = digits[0]; w >= 10; w /= 10) len++;\r\n    }\r\n\r\n    return len;\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n   * integer of type number.\r\n   *\r\n   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n   *\r\n   */\r\n  function intPow(Ctor, x, n, pr) {\r\n    var isTruncated,\r\n      r = new Ctor(1),\r\n\r\n      // Max n of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n    external = false;\r\n\r\n    for (;;) {\r\n      if (n % 2) {\r\n        r = r.times(x);\r\n        if (truncate(r.d, k)) isTruncated = true;\r\n      }\r\n\r\n      n = mathfloor(n / 2);\r\n      if (n === 0) {\r\n\r\n        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n        n = r.d.length - 1;\r\n        if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n        break;\r\n      }\r\n\r\n      x = x.times(x);\r\n      truncate(x.d, k);\r\n    }\r\n\r\n    external = true;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  function isOdd(n) {\r\n    return n.d[n.d.length - 1] & 1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n   */\r\n  function maxOrMin(Ctor, args, ltgt) {\r\n    var y,\r\n      x = new Ctor(args[0]),\r\n      i = 0;\r\n\r\n    for (; ++i < args.length;) {\r\n      y = new Ctor(args[i]);\r\n      if (!y.s) {\r\n        x = y;\r\n        break;\r\n      } else if (x[ltgt](y)) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(Infinity)  = Infinity\r\n   *  exp(-Infinity) = 0\r\n   *  exp(NaN)       = NaN\r\n   *  exp(±0)        = 1\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   *  The result will always be correctly rounded.\r\n   *\r\n   */\r\n  function naturalExponential(x, sd) {\r\n    var denominator, guard, j, pow, sum, t, wpr,\r\n      rep = 0,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // 0/NaN/Infinity?\r\n    if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n      return new Ctor(x.d\r\n        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n        : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    // while abs(x) >= 0.1\r\n    while (x.e > -2) {\r\n\r\n      // x = x / 2^5\r\n      x = x.times(t);\r\n      k += 5;\r\n    }\r\n\r\n    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n    // necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(1);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = finalise(pow.times(x), wpr, 1);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        j = k;\r\n        while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n        // Check to see if the first 4 rounding digits are [49]999.\r\n        // If so, repeat the summation with a higher precision, otherwise\r\n        // e.g. with precision: 18, rounding: 1\r\n        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n\r\n          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += 10;\r\n            denominator = pow = t = new Ctor(1);\r\n            i = 0;\r\n            rep++;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(-n)        = NaN\r\n   *  ln(0)         = -Infinity\r\n   *  ln(-0)        = -Infinity\r\n   *  ln(1)         = 0\r\n   *  ln(Infinity)  = Infinity\r\n   *  ln(-Infinity) = NaN\r\n   *  ln(NaN)       = NaN\r\n   *\r\n   *  ln(n) (n != 1) is non-terminating.\r\n   *\r\n   */\r\n  function naturalLogarithm(y, sd) {\r\n    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // Is x negative or Infinity, NaN, 0 or 1?\r\n    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    Ctor.precision = wpr += guard;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n\r\n    if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = x.e;\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n      Ctor.precision = pr;\r\n\r\n      return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n    }\r\n\r\n    // x1 is x reduced to a value near 1.\r\n    x1 = x;\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n    x2 = finalise(x.times(x), wpr, 1);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = finalise(numerator.times(x2), wpr, 1);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n        // been repeated previously) and the first 4 rounding digits 9999?\r\n        // If so, restart the summation with a higher precision, otherwise\r\n        // e.g. with precision: 12, rounding: 1\r\n        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += guard;\r\n            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n            x2 = finalise(x.times(x), wpr, 1);\r\n            denominator = rep = 1;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  // ±Infinity, NaN.\r\n  function nonFiniteToString(x) {\r\n    // Unsigned.\r\n    return String(x.s * x.s / 0);\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      x.e = e = e - i - 1;\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external) {\r\n\r\n        // Overflow?\r\n        if (x.e > x.constructor.maxE) {\r\n\r\n          // Infinity.\r\n          x.d = null;\r\n          x.e = NaN;\r\n\r\n        // Underflow?\r\n        } else if (x.e < x.constructor.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n          // x.constructor.underflow = true;\r\n        } // else x.constructor.underflow = false;\r\n      }\r\n    } else {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n   */\r\n  function parseOther(x, str) {\r\n    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n    if (str.indexOf('_') > -1) {\r\n      str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n      if (isDecimal.test(str)) return parseDecimal(x, str);\r\n    } else if (str === 'Infinity' || str === 'NaN') {\r\n      if (!+str) x.s = NaN;\r\n      x.e = NaN;\r\n      x.d = null;\r\n      return x;\r\n    }\r\n\r\n    if (isHex.test(str))  {\r\n      base = 16;\r\n      str = str.toLowerCase();\r\n    } else if (isBinary.test(str))  {\r\n      base = 2;\r\n    } else if (isOctal.test(str))  {\r\n      base = 8;\r\n    } else {\r\n      throw Error(invalidArgument + str);\r\n    }\r\n\r\n    // Is there a binary exponent part?\r\n    i = str.search(/p/i);\r\n\r\n    if (i > 0) {\r\n      p = +str.slice(i + 1);\r\n      str = str.substring(2, i);\r\n    } else {\r\n      str = str.slice(2);\r\n    }\r\n\r\n    // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n    // fraction part will be restored.\r\n    i = str.indexOf('.');\r\n    isFloat = i >= 0;\r\n    Ctor = x.constructor;\r\n\r\n    if (isFloat) {\r\n      str = str.replace('.', '');\r\n      len = str.length;\r\n      i = len - i;\r\n\r\n      // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n      divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n    }\r\n\r\n    xd = convertBase(str, base, BASE);\r\n    xe = xd.length - 1;\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xe; xd[i] === 0; --i) xd.pop();\r\n    if (i < 0) return new Ctor(x.s * 0);\r\n    x.e = getBase10Exponent(xd, xe);\r\n    x.d = xd;\r\n    external = false;\r\n\r\n    // At what precision to perform the division to ensure exact conversion?\r\n    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n    // Therefore using 4 * the number of digits of str will always be enough.\r\n    if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n    // Multiply by the binary exponent part if present.\r\n    if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n    external = true;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function sine(Ctor, x) {\r\n    var k,\r\n      len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n    }\r\n\r\n    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x);\r\n\r\n    // Reverse argument reduction\r\n    var sin2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sin2_x = x.times(x);\r\n      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\n  function taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n    var j, t, u, x2,\r\n      i = 1,\r\n      pr = Ctor.precision,\r\n      k = Math.ceil(pr / LOG_BASE);\r\n\r\n    external = false;\r\n    x2 = x.times(x);\r\n    u = new Ctor(y);\r\n\r\n    for (;;) {\r\n      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      t = u.plus(y);\r\n\r\n      if (t.d[k] !== void 0) {\r\n        for (j = k; t.d[j] === u.d[j] && j--;);\r\n        if (j == -1) break;\r\n      }\r\n\r\n      j = u;\r\n      u = y;\r\n      y = t;\r\n      t = j;\r\n      i++;\r\n    }\r\n\r\n    external = true;\r\n    t.d.length = k + 1;\r\n\r\n    return t;\r\n  }\r\n\r\n\r\n  // Exponent e must be positive and non-zero.\r\n  function tinyPow(b, e) {\r\n    var n = b;\r\n    while (--e) n *= b;\r\n    return n;\r\n  }\r\n\r\n\r\n  // Return the absolute value of `x` reduced to less than or equal to half pi.\r\n  function toLessThanHalfPi(Ctor, x) {\r\n    var t,\r\n      isNeg = x.s < 0,\r\n      pi = getPi(Ctor, Ctor.precision, 1),\r\n      halfPi = pi.times(0.5);\r\n\r\n    x = x.abs();\r\n\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isNeg ? 4 : 1;\r\n      return x;\r\n    }\r\n\r\n    t = x.divToInt(pi);\r\n\r\n    if (t.isZero()) {\r\n      quadrant = isNeg ? 3 : 2;\r\n    } else {\r\n      x = x.minus(t.times(pi));\r\n\r\n      // 0 <= x < pi\r\n      if (x.lte(halfPi)) {\r\n        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n        return x;\r\n      }\r\n\r\n      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n    }\r\n\r\n    return x.minus(pi).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return the value of Decimal `x` as a string in base `baseOut`.\r\n   *\r\n   * If the optional `sd` argument is present include a binary exponent suffix.\r\n   */\r\n  function toStringBinary(x, baseOut, sd, rm) {\r\n    var base, e, i, k, len, roundUp, str, xd, y,\r\n      Ctor = x.constructor,\r\n      isExp = sd !== void 0;\r\n\r\n    if (isExp) {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    } else {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    }\r\n\r\n    if (!x.isFinite()) {\r\n      str = nonFiniteToString(x);\r\n    } else {\r\n      str = finiteToString(x);\r\n      i = str.indexOf('.');\r\n\r\n      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n      // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n      // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n      if (isExp) {\r\n        base = 2;\r\n        if (baseOut == 16) {\r\n          sd = sd * 4 - 3;\r\n        } else if (baseOut == 8) {\r\n          sd = sd * 3 - 2;\r\n        }\r\n      } else {\r\n        base = baseOut;\r\n      }\r\n\r\n      // Convert the number as an integer then divide the result by its base raised to a power such\r\n      // that the fraction part will be restored.\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        str = str.replace('.', '');\r\n        y = new Ctor(1);\r\n        y.e = str.length - i;\r\n        y.d = convertBase(finiteToString(y), 10, base);\r\n        y.e = y.d.length;\r\n      }\r\n\r\n      xd = convertBase(str, 10, base);\r\n      e = len = xd.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xd[--len] == 0;) xd.pop();\r\n\r\n      if (!xd[0]) {\r\n        str = isExp ? '0p+0' : '0';\r\n      } else {\r\n        if (i < 0) {\r\n          e--;\r\n        } else {\r\n          x = new Ctor(x);\r\n          x.d = xd;\r\n          x.e = e;\r\n          x = divide(x, y, sd, rm, 0, base);\r\n          xd = x.d;\r\n          e = x.e;\r\n          roundUp = inexact;\r\n        }\r\n\r\n        // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        i = xd[sd];\r\n        k = base / 2;\r\n        roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n        roundUp = rm < 4\r\n          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n            rm === (x.s < 0 ? 8 : 7));\r\n\r\n        xd.length = sd;\r\n\r\n        if (roundUp) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (; ++xd[--sd] > base - 1;) {\r\n            xd[sd] = 0;\r\n            if (!sd) {\r\n              ++e;\r\n              xd.unshift(1);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n        // Add binary exponent suffix?\r\n        if (isExp) {\r\n          if (len > 1) {\r\n            if (baseOut == 16 || baseOut == 8) {\r\n              i = baseOut == 16 ? 4 : 3;\r\n              for (--len; len % i; len++) str += '0';\r\n              xd = convertBase(str, base, baseOut);\r\n              for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n              // xd[0] will always be be 1\r\n              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n            } else {\r\n              str = str.charAt(0) + '.' + str.slice(1);\r\n            }\r\n          }\r\n\r\n          str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n        } else if (e < 0) {\r\n          for (; ++e;) str = '0' + str;\r\n          str = '0.' + str;\r\n        } else {\r\n          if (++e > len) for (e -= len; e-- ;) str += '0';\r\n          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n        }\r\n      }\r\n\r\n      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  abs\r\n   *  acos\r\n   *  acosh\r\n   *  add\r\n   *  asin\r\n   *  asinh\r\n   *  atan\r\n   *  atanh\r\n   *  atan2\r\n   *  cbrt\r\n   *  ceil\r\n   *  clamp\r\n   *  clone\r\n   *  config\r\n   *  cos\r\n   *  cosh\r\n   *  div\r\n   *  exp\r\n   *  floor\r\n   *  hypot\r\n   *  ln\r\n   *  log\r\n   *  log2\r\n   *  log10\r\n   *  max\r\n   *  min\r\n   *  mod\r\n   *  mul\r\n   *  pow\r\n   *  random\r\n   *  round\r\n   *  set\r\n   *  sign\r\n   *  sin\r\n   *  sinh\r\n   *  sqrt\r\n   *  sub\r\n   *  sum\r\n   *  tan\r\n   *  tanh\r\n   *  trunc\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function abs(x) {\r\n    return new this(x).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function acos(x) {\r\n    return new this(x).acos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function acosh(x) {\r\n    return new this(x).acosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function add(x, y) {\r\n    return new this(x).plus(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function asin(x) {\r\n    return new this(x).asin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function asinh(x) {\r\n    return new this(x).asinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function atan(x) {\r\n    return new this(x).atan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function atanh(x) {\r\n    return new this(x).atanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi, pi]\r\n   *\r\n   * y {number|string|Decimal} The y-coordinate.\r\n   * x {number|string|Decimal} The x-coordinate.\r\n   *\r\n   * atan2(±0, -0)               = ±pi\r\n   * atan2(±0, +0)               = ±0\r\n   * atan2(±0, -x)               = ±pi for x > 0\r\n   * atan2(±0, x)                = ±0 for x > 0\r\n   * atan2(-y, ±0)               = -pi/2 for y > 0\r\n   * atan2(y, ±0)                = pi/2 for y > 0\r\n   * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n   * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n   * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n   * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n   * atan2(±Infinity, +Infinity) = ±pi/4\r\n   * atan2(NaN, x) = NaN\r\n   * atan2(y, NaN) = NaN\r\n   *\r\n   */\r\n  function atan2(y, x) {\r\n    y = new this(y);\r\n    x = new this(x);\r\n    var r,\r\n      pr = this.precision,\r\n      rm = this.rounding,\r\n      wpr = pr + 4;\r\n\r\n    // Either NaN\r\n    if (!y.s || !x.s) {\r\n      r = new this(NaN);\r\n\r\n    // Both ±Infinity\r\n    } else if (!y.d && !x.d) {\r\n      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n      r.s = y.s;\r\n\r\n    // x is ±Infinity or y is ±0\r\n    } else if (!x.d || y.isZero()) {\r\n      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n      r.s = y.s;\r\n\r\n    // y is ±Infinity or x is ±0\r\n    } else if (!y.d || x.isZero()) {\r\n      r = getPi(this, wpr, 1).times(0.5);\r\n      r.s = y.s;\r\n\r\n    // Both non-zero and finite\r\n    } else if (x.s < 0) {\r\n      this.precision = wpr;\r\n      this.rounding = 1;\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n      x = getPi(this, wpr, 1);\r\n      this.precision = pr;\r\n      this.rounding = rm;\r\n      r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n    } else {\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function cbrt(x) {\r\n    return new this(x).cbrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ceil(x) {\r\n    return finalise(x = new this(x), x.e + 1, 2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  function clamp(x, min, max) {\r\n    return new this(x).clamp(min, max);\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *   maxE       {number}\r\n   *   minE       {number}\r\n   *   modulo     {number}\r\n   *   crypto     {boolean|number}\r\n   *   defaults   {true}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n    var i, p, v,\r\n      useDefaults = obj.defaults === true,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -EXP_LIMIT, 0,\r\n        'toExpPos', 0, EXP_LIMIT,\r\n        'maxE', 0, EXP_LIMIT,\r\n        'minE', -EXP_LIMIT, 0,\r\n        'modulo', 0, 9\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n      if ((v = obj[p]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (v === true || v === false || v === 0 || v === 1) {\r\n        if (v) {\r\n          if (typeof crypto != 'undefined' && crypto &&\r\n            (crypto.getRandomValues || crypto.randomBytes)) {\r\n            this[p] = true;\r\n          } else {\r\n            throw Error(cryptoUnavailable);\r\n          }\r\n        } else {\r\n          this[p] = false;\r\n        }\r\n      } else {\r\n        throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cos(x) {\r\n    return new this(x).cos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cosh(x) {\r\n    return new this(x).cosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * v {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(v) {\r\n      var e, i, t,\r\n        x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (isDecimalInstance(v)) {\r\n        x.s = v.s;\r\n\r\n        if (external) {\r\n          if (!v.d || v.e > Decimal.maxE) {\r\n\r\n            // Infinity.\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (v.e < Decimal.minE) {\r\n\r\n            // Zero.\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.d = v.d.slice();\r\n          }\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d ? v.d.slice() : v.d;\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      t = typeof v;\r\n\r\n      if (t === 'number') {\r\n        if (v === 0) {\r\n          x.s = 1 / v < 0 ? -1 : 1;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        if (v < 0) {\r\n          v = -v;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 1;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (v === ~~v && v < 1e7) {\r\n          for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n          if (external) {\r\n            if (e > Decimal.maxE) {\r\n              x.e = NaN;\r\n              x.d = null;\r\n            } else if (e < Decimal.minE) {\r\n              x.e = 0;\r\n              x.d = [0];\r\n            } else {\r\n              x.e = e;\r\n              x.d = [v];\r\n            }\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n\r\n          return;\r\n\r\n        // Infinity, NaN.\r\n        } else if (v * 0 !== 0) {\r\n          if (!v) x.s = NaN;\r\n          x.e = NaN;\r\n          x.d = null;\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, v.toString());\r\n\r\n      } else if (t !== 'string') {\r\n        throw Error(invalidArgument + v);\r\n      }\r\n\r\n      // Minus sign?\r\n      if ((i = v.charCodeAt(0)) === 45) {\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        // Plus sign?\r\n        if (i === 43) v = v.slice(1);\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n    Decimal.EUCLID = 9;\r\n\r\n    Decimal.config = Decimal.set = config;\r\n    Decimal.clone = clone;\r\n    Decimal.isDecimal = isDecimalInstance;\r\n\r\n    Decimal.abs = abs;\r\n    Decimal.acos = acos;\r\n    Decimal.acosh = acosh;        // ES6\r\n    Decimal.add = add;\r\n    Decimal.asin = asin;\r\n    Decimal.asinh = asinh;        // ES6\r\n    Decimal.atan = atan;\r\n    Decimal.atanh = atanh;        // ES6\r\n    Decimal.atan2 = atan2;\r\n    Decimal.cbrt = cbrt;          // ES6\r\n    Decimal.ceil = ceil;\r\n    Decimal.clamp = clamp;\r\n    Decimal.cos = cos;\r\n    Decimal.cosh = cosh;          // ES6\r\n    Decimal.div = div;\r\n    Decimal.exp = exp;\r\n    Decimal.floor = floor;\r\n    Decimal.hypot = hypot;        // ES6\r\n    Decimal.ln = ln;\r\n    Decimal.log = log;\r\n    Decimal.log10 = log10;        // ES6\r\n    Decimal.log2 = log2;          // ES6\r\n    Decimal.max = max;\r\n    Decimal.min = min;\r\n    Decimal.mod = mod;\r\n    Decimal.mul = mul;\r\n    Decimal.pow = pow;\r\n    Decimal.random = random;\r\n    Decimal.round = round;\r\n    Decimal.sign = sign;          // ES6\r\n    Decimal.sin = sin;\r\n    Decimal.sinh = sinh;          // ES6\r\n    Decimal.sqrt = sqrt;\r\n    Decimal.sub = sub;\r\n    Decimal.sum = sum;\r\n    Decimal.tan = tan;\r\n    Decimal.tanh = tanh;          // ES6\r\n    Decimal.trunc = trunc;        // ES6\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      if (obj.defaults !== true) {\r\n        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n      }\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function div(x, y) {\r\n    return new this(x).div(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The power to which to raise the base of the natural log.\r\n   *\r\n   */\r\n  function exp(x) {\r\n    return new this(x).exp();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function floor(x) {\r\n    return finalise(x = new this(x), x.e + 1, 3);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function hypot() {\r\n    var i, n,\r\n      t = new this(0);\r\n\r\n    external = false;\r\n\r\n    for (i = 0; i < arguments.length;) {\r\n      n = new this(arguments[i++]);\r\n      if (!n.d) {\r\n        if (n.s) {\r\n          external = true;\r\n          return new this(1 / 0);\r\n        }\r\n        t = n;\r\n      } else if (t.d) {\r\n        t = t.plus(n.times(n));\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return t.sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  function isDecimalInstance(obj) {\r\n    return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ln(x) {\r\n    return new this(x).ln();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * log[y](x)\r\n   *\r\n   * x {number|string|Decimal} The argument of the logarithm.\r\n   * y {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  function log(x, y) {\r\n    return new this(x).log(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log2(x) {\r\n    return new this(x).log(2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log10(x) {\r\n    return new this(x).log(10);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function max() {\r\n    return maxOrMin(this, arguments, 'lt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function min() {\r\n    return maxOrMin(this, arguments, 'gt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mod(x, y) {\r\n    return new this(x).mod(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mul(x, y) {\r\n    return new this(x).mul(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The base.\r\n   * y {number|string|Decimal} The exponent.\r\n   *\r\n   */\r\n  function pow(x, y) {\r\n    return new this(x).pow(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n   * are produced).\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n   *\r\n   */\r\n  function random(sd) {\r\n    var d, e, k, n,\r\n      i = 0,\r\n      r = new this(1),\r\n      rd = [];\r\n\r\n    if (sd === void 0) sd = this.precision;\r\n    else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    k = Math.ceil(sd / LOG_BASE);\r\n\r\n    if (!this.crypto) {\r\n      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n    // Browsers supporting crypto.getRandomValues.\r\n    } else if (crypto.getRandomValues) {\r\n      d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n      for (; i < k;) {\r\n        n = d[i];\r\n\r\n        // 0 <= n < 4294967296\r\n        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n        if (n >= 4.29e9) {\r\n          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n        } else {\r\n\r\n          // 0 <= n <= 4289999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd[i++] = n % 1e7;\r\n        }\r\n      }\r\n\r\n    // Node.js supporting crypto.randomBytes.\r\n    } else if (crypto.randomBytes) {\r\n\r\n      // buffer\r\n      d = crypto.randomBytes(k *= 4);\r\n\r\n      for (; i < k;) {\r\n\r\n        // 0 <= n < 2147483648\r\n        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n        if (n >= 2.14e9) {\r\n          crypto.randomBytes(4).copy(d, i);\r\n        } else {\r\n\r\n          // 0 <= n <= 2139999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd.push(n % 1e7);\r\n          i += 4;\r\n        }\r\n      }\r\n\r\n      i = k / 4;\r\n    } else {\r\n      throw Error(cryptoUnavailable);\r\n    }\r\n\r\n    k = rd[--i];\r\n    sd %= LOG_BASE;\r\n\r\n    // Convert trailing digits to zeros according to sd.\r\n    if (k && sd) {\r\n      n = mathpow(10, LOG_BASE - sd);\r\n      rd[i] = (k / n | 0) * n;\r\n    }\r\n\r\n    // Remove trailing words which are zero.\r\n    for (; rd[i] === 0; i--) rd.pop();\r\n\r\n    // Zero?\r\n    if (i < 0) {\r\n      e = 0;\r\n      rd = [0];\r\n    } else {\r\n      e = -1;\r\n\r\n      // Remove leading words which are zero and adjust exponent accordingly.\r\n      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n      // Count the digits of the first word of rd to determine leading zeros.\r\n      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n      // Adjust the exponent for leading zeros of the first word of rd.\r\n      if (k < LOG_BASE) e -= LOG_BASE - k;\r\n    }\r\n\r\n    r.e = e;\r\n    r.d = rd;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n   *\r\n   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function round(x) {\r\n    return finalise(x = new this(x), x.e + 1, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if x > 0,\r\n   *  -1    if x < 0,\r\n   *   0    if x is 0,\r\n   *  -0    if x is -0,\r\n   *   NaN  otherwise\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sign(x) {\r\n    x = new this(x);\r\n    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sin(x) {\r\n    return new this(x).sin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sinh(x) {\r\n    return new this(x).sinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sqrt(x) {\r\n    return new this(x).sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function sub(x, y) {\r\n    return new this(x).sub(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * Only the result is rounded, not the intermediate calculations.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function sum() {\r\n    var i = 0,\r\n      args = arguments,\r\n      x = new this(args[i]);\r\n\r\n    external = false;\r\n    for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n    external = true;\r\n\r\n    return finalise(x, this.precision, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tan(x) {\r\n    return new this(x).tan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tanh(x) {\r\n    return new this(x).tanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` truncated to an integer.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function trunc(x) {\r\n    return finalise(x = new this(x), x.e + 1, 1);\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(DEFAULTS);\r\n  Decimal.prototype.constructor = Decimal;\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Create the internal constants from their string values.\r\n  LN10 = new Decimal(LN10);\r\n  PI = new Decimal(PI);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () {\r\n      return Decimal;\r\n    });\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {\r\n      P[Symbol['for']('nodejs.util.inspect.custom')] = P.toString;\r\n      P[Symbol.toStringTag] = 'Decimal';\r\n    }\r\n\r\n    module.exports = Decimal;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalScope) {\r\n      globalScope = typeof self != 'undefined' && self && self.self == self ? self : window;\r\n    }\r\n\r\n    noConflict = globalScope.Decimal;\r\n    Decimal.noConflict = function () {\r\n      globalScope.Decimal = noConflict;\r\n      return Decimal;\r\n    };\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\n\nvar gopd = require('gopd');\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n","'use strict';\n\nvar keys = require('object-keys');\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar defineDataProperty = require('define-data-property');\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar supportsDescriptors = require('has-property-descriptors')();\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object) {\n\t\tif (predicate === true) {\n\t\t\tif (object[name] === value) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} else if (!isFunction(predicate) || !predicate()) {\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (supportsDescriptors) {\n\t\tdefineDataProperty(object, name, value, true);\n\t} else {\n\t\tdefineDataProperty(object, name, value);\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n","'use strict';\n\nfunction assign(obj, props) {\n    for (const key in props) {\n        Object.defineProperty(obj, key, {\n            value: props[key],\n            enumerable: true,\n            configurable: true,\n        });\n    }\n\n    return obj;\n}\n\nfunction createError(err, code, props) {\n    if (!err || typeof err === 'string') {\n        throw new TypeError('Please pass an Error to err-code');\n    }\n\n    if (!props) {\n        props = {};\n    }\n\n    if (typeof code === 'object') {\n        props = code;\n        code = undefined;\n    }\n\n    if (code != null) {\n        props.code = code;\n    }\n\n    try {\n        return assign(err, props);\n    } catch (_) {\n        props.message = err.message;\n        props.stack = err.stack;\n\n        const ErrClass = function () {};\n\n        ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n        return assign(new ErrClass(), props);\n    }\n}\n\nmodule.exports = createError;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\n/** @type {import('.')} */\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true) || false;\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = false;\n\t}\n}\n\nmodule.exports = $defineProperty;\n","'use strict';\n\n/** @type {import('./eval')} */\nmodule.exports = EvalError;\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Error;\n","'use strict';\n\n/** @type {import('./range')} */\nmodule.exports = RangeError;\n","'use strict';\n\n/** @type {import('./ref')} */\nmodule.exports = ReferenceError;\n","'use strict';\n\n/** @type {import('./syntax')} */\nmodule.exports = SyntaxError;\n","'use strict';\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\n","'use strict';\n\n/** @type {import('./uri')} */\nmodule.exports = URIError;\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","'use strict';\n\nvar isCallable = require('is-callable');\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n    for (var i = 0, len = array.length; i < len; i++) {\n        if (hasOwnProperty.call(array, i)) {\n            if (receiver == null) {\n                iterator(array[i], i, array);\n            } else {\n                iterator.call(receiver, array[i], i, array);\n            }\n        }\n    }\n};\n\nvar forEachString = function forEachString(string, iterator, receiver) {\n    for (var i = 0, len = string.length; i < len; i++) {\n        // no such thing as a sparse string.\n        if (receiver == null) {\n            iterator(string.charAt(i), i, string);\n        } else {\n            iterator.call(receiver, string.charAt(i), i, string);\n        }\n    }\n};\n\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n    for (var k in object) {\n        if (hasOwnProperty.call(object, k)) {\n            if (receiver == null) {\n                iterator(object[k], k, object);\n            } else {\n                iterator.call(receiver, object[k], k, object);\n            }\n        }\n    }\n};\n\nvar forEach = function forEach(list, iterator, thisArg) {\n    if (!isCallable(iterator)) {\n        throw new TypeError('iterator must be a function');\n    }\n\n    var receiver;\n    if (arguments.length >= 3) {\n        receiver = thisArg;\n    }\n\n    if (toStr.call(list) === '[object Array]') {\n        forEachArray(list, iterator, receiver);\n    } else if (typeof list === 'string') {\n        forEachString(list, iterator, receiver);\n    } else {\n        forEachObject(list, iterator, receiver);\n    }\n};\n\nmodule.exports = forEach;\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar toStr = Object.prototype.toString;\nvar max = Math.max;\nvar funcType = '[object Function]';\n\nvar concatty = function concatty(a, b) {\n    var arr = [];\n\n    for (var i = 0; i < a.length; i += 1) {\n        arr[i] = a[i];\n    }\n    for (var j = 0; j < b.length; j += 1) {\n        arr[j + a.length] = b[j];\n    }\n\n    return arr;\n};\n\nvar slicy = function slicy(arrLike, offset) {\n    var arr = [];\n    for (var i = offset || 0, j = 0; i < arrLike.length; i += 1, j += 1) {\n        arr[j] = arrLike[i];\n    }\n    return arr;\n};\n\nvar joiny = function (arr, joiner) {\n    var str = '';\n    for (var i = 0; i < arr.length; i += 1) {\n        str += arr[i];\n        if (i + 1 < arr.length) {\n            str += joiner;\n        }\n    }\n    return str;\n};\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.apply(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slicy(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                concatty(args, arguments)\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        }\n        return target.apply(\n            that,\n            concatty(args, arguments)\n        );\n\n    };\n\n    var boundLength = max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs[i] = '$' + i;\n    }\n\n    bound = Function('binder', 'return function (' + joiny(boundArgs, ',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\nvar undefined;\n\nvar $Error = require('es-errors');\nvar $EvalError = require('es-errors/eval');\nvar $RangeError = require('es-errors/range');\nvar $ReferenceError = require('es-errors/ref');\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\nvar $URIError = require('es-errors/uri');\n\nvar $Function = Function;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\nvar hasProto = require('has-proto')();\n\nvar getProto = Object.getPrototypeOf || (\n\thasProto\n\t\t? function (x) { return x.__proto__; } // eslint-disable-line no-proto\n\t\t: null\n);\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t__proto__: null,\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': $Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': $EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': $RangeError,\n\t'%ReferenceError%': $ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': $URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t__proto__: null,\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('hasown');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\nvar $exec = bind.call(Function.call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\treturn !!$defineProperty;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!$defineProperty) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n","'use strict';\n\nvar test = {\n\t__proto__: null,\n\tfoo: {}\n};\n\nvar $Object = Object;\n\n/** @type {import('.')} */\nmodule.exports = function hasProto() {\n\t// @ts-expect-error: TS errors on an inherited property for some reason\n\treturn { __proto__: test }.foo === test.foo\n\t\t&& !(test instanceof $Object);\n};\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar call = Function.prototype.call;\nvar $hasOwn = Object.prototype.hasOwnProperty;\nvar bind = require('function-bind');\n\n/** @type {import('.')} */\nmodule.exports = bind.call(call, $hasOwn);\n","'use strict';\n\nvar reactIs = require('react-is');\n\n/**\n * Copyright 2015, Yahoo! Inc.\n * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.\n */\nvar REACT_STATICS = {\n  childContextTypes: true,\n  contextType: true,\n  contextTypes: true,\n  defaultProps: true,\n  displayName: true,\n  getDefaultProps: true,\n  getDerivedStateFromError: true,\n  getDerivedStateFromProps: true,\n  mixins: true,\n  propTypes: true,\n  type: true\n};\nvar KNOWN_STATICS = {\n  name: true,\n  length: true,\n  prototype: true,\n  caller: true,\n  callee: true,\n  arguments: true,\n  arity: true\n};\nvar FORWARD_REF_STATICS = {\n  '$$typeof': true,\n  render: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true\n};\nvar MEMO_STATICS = {\n  '$$typeof': true,\n  compare: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true,\n  type: true\n};\nvar TYPE_STATICS = {};\nTYPE_STATICS[reactIs.ForwardRef] = FORWARD_REF_STATICS;\nTYPE_STATICS[reactIs.Memo] = MEMO_STATICS;\n\nfunction getStatics(component) {\n  // React v16.11 and below\n  if (reactIs.isMemo(component)) {\n    return MEMO_STATICS;\n  } // React v16.12 and above\n\n\n  return TYPE_STATICS[component['$$typeof']] || REACT_STATICS;\n}\n\nvar defineProperty = Object.defineProperty;\nvar getOwnPropertyNames = Object.getOwnPropertyNames;\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\nvar getPrototypeOf = Object.getPrototypeOf;\nvar objectPrototype = Object.prototype;\nfunction hoistNonReactStatics(targetComponent, sourceComponent, blacklist) {\n  if (typeof sourceComponent !== 'string') {\n    // don't hoist over string (html) components\n    if (objectPrototype) {\n      var inheritedComponent = getPrototypeOf(sourceComponent);\n\n      if (inheritedComponent && inheritedComponent !== objectPrototype) {\n        hoistNonReactStatics(targetComponent, inheritedComponent, blacklist);\n      }\n    }\n\n    var keys = getOwnPropertyNames(sourceComponent);\n\n    if (getOwnPropertySymbols) {\n      keys = keys.concat(getOwnPropertySymbols(sourceComponent));\n    }\n\n    var targetStatics = getStatics(targetComponent);\n    var sourceStatics = getStatics(sourceComponent);\n\n    for (var i = 0; i < keys.length; ++i) {\n      var key = keys[i];\n\n      if (!KNOWN_STATICS[key] && !(blacklist && blacklist[key]) && !(sourceStatics && sourceStatics[key]) && !(targetStatics && targetStatics[key])) {\n        var descriptor = getOwnPropertyDescriptor(sourceComponent, key);\n\n        try {\n          // Avoid failures from read-only properties\n          defineProperty(targetComponent, key, descriptor);\n        } catch (e) {}\n      }\n    }\n  }\n\n  return targetComponent;\n}\n\nmodule.exports = hoistNonReactStatics;\n","/** @license React v16.13.1\n * react-is.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';var b=\"function\"===typeof Symbol&&Symbol.for,c=b?Symbol.for(\"react.element\"):60103,d=b?Symbol.for(\"react.portal\"):60106,e=b?Symbol.for(\"react.fragment\"):60107,f=b?Symbol.for(\"react.strict_mode\"):60108,g=b?Symbol.for(\"react.profiler\"):60114,h=b?Symbol.for(\"react.provider\"):60109,k=b?Symbol.for(\"react.context\"):60110,l=b?Symbol.for(\"react.async_mode\"):60111,m=b?Symbol.for(\"react.concurrent_mode\"):60111,n=b?Symbol.for(\"react.forward_ref\"):60112,p=b?Symbol.for(\"react.suspense\"):60113,q=b?\nSymbol.for(\"react.suspense_list\"):60120,r=b?Symbol.for(\"react.memo\"):60115,t=b?Symbol.for(\"react.lazy\"):60116,v=b?Symbol.for(\"react.block\"):60121,w=b?Symbol.for(\"react.fundamental\"):60117,x=b?Symbol.for(\"react.responder\"):60118,y=b?Symbol.for(\"react.scope\"):60119;\nfunction z(a){if(\"object\"===typeof a&&null!==a){var u=a.$$typeof;switch(u){case c:switch(a=a.type,a){case l:case m:case e:case g:case f:case p:return a;default:switch(a=a&&a.$$typeof,a){case k:case n:case t:case r:case h:return a;default:return u}}case d:return u}}}function A(a){return z(a)===m}exports.AsyncMode=l;exports.ConcurrentMode=m;exports.ContextConsumer=k;exports.ContextProvider=h;exports.Element=c;exports.ForwardRef=n;exports.Fragment=e;exports.Lazy=t;exports.Memo=r;exports.Portal=d;\nexports.Profiler=g;exports.StrictMode=f;exports.Suspense=p;exports.isAsyncMode=function(a){return A(a)||z(a)===l};exports.isConcurrentMode=A;exports.isContextConsumer=function(a){return z(a)===k};exports.isContextProvider=function(a){return z(a)===h};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===c};exports.isForwardRef=function(a){return z(a)===n};exports.isFragment=function(a){return z(a)===e};exports.isLazy=function(a){return z(a)===t};\nexports.isMemo=function(a){return z(a)===r};exports.isPortal=function(a){return z(a)===d};exports.isProfiler=function(a){return z(a)===g};exports.isStrictMode=function(a){return z(a)===f};exports.isSuspense=function(a){return z(a)===p};\nexports.isValidElementType=function(a){return\"string\"===typeof a||\"function\"===typeof a||a===e||a===m||a===g||a===f||a===p||a===q||\"object\"===typeof a&&null!==a&&(a.$$typeof===t||a.$$typeof===r||a.$$typeof===h||a.$$typeof===k||a.$$typeof===n||a.$$typeof===w||a.$$typeof===x||a.$$typeof===y||a.$$typeof===v)};exports.typeOf=z;\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-is.production.min.js');\n} else {\n  module.exports = require('./cjs/react-is.development.js');\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      ctor.prototype = Object.create(superCtor.prototype, {\n        constructor: {\n          value: ctor,\n          enumerable: false,\n          writable: true,\n          configurable: true\n        }\n      })\n    }\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    if (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}\n","'use strict';\n\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n","'use strict';\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n","'use strict';\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n","'use strict';\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function isNaN(value) {\n\treturn value !== value;\n};\n","'use strict';\n\nvar callBind = require('call-bind');\nvar define = require('define-properties');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Number);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\tif (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) {\n\t\treturn Number.isNaN;\n\t}\n\treturn implementation;\n};\n","'use strict';\n\nvar define = require('define-properties');\nvar getPolyfill = require('./polyfill');\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function shimNumberIsNaN() {\n\tvar polyfill = getPolyfill();\n\tdefine(Number, { isNaN: polyfill }, {\n\t\tisNaN: function testIsNaN() {\n\t\t\treturn Number.isNaN !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar whichTypedArray = require('which-typed-array');\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\n};\n","'use strict';\n\nconst uuid = require('uuid').v4;\nconst generateRequest = require('../../generateRequest');\n\n/**\n * Constructor for a Jayson Browser Client that does not depend any node.js core libraries\n * @class ClientBrowser\n * @param {Function} callServer Method that calls the server, receives the stringified request and a regular node-style callback\n * @param {Object} [options]\n * @param {Function} [options.reviver] Reviver function for JSON\n * @param {Function} [options.replacer] Replacer function for JSON\n * @param {Number} [options.version=2] JSON-RPC version to use (1|2)\n * @param {Function} [options.generator] Function to use for generating request IDs\n *  @param {Boolean} [options.notificationIdNull=false] When true, version 2 requests will set id to null instead of omitting it\n * @return {ClientBrowser}\n */\nconst ClientBrowser = function(callServer, options) {\n  if(!(this instanceof ClientBrowser)) {\n    return new ClientBrowser(callServer, options);\n  }\n\n  if (!options) {\n    options = {};\n  }\n\n  this.options = {\n    reviver: typeof options.reviver !== 'undefined' ? options.reviver : null,\n    replacer: typeof options.replacer !== 'undefined' ? options.replacer : null,\n    generator: typeof options.generator !== 'undefined' ? options.generator : function() { return uuid(); },\n    version: typeof options.version !== 'undefined' ? options.version : 2,\n    notificationIdNull: typeof options.notificationIdNull === 'boolean' ? options.notificationIdNull : false,\n  };\n\n  this.callServer = callServer;\n};\n\nmodule.exports = ClientBrowser;\n\n/**\n *  Creates a request and dispatches it if given a callback.\n *  @param {String|Array} method A batch request if passed an Array, or a method name if passed a String\n *  @param {Array|Object} [params] Parameters for the method\n *  @param {String|Number} [id] Optional id. If undefined an id will be generated. If null it creates a notification request\n *  @param {Function} [callback] Request callback. If specified, executes the request rather than only returning it.\n *  @throws {TypeError} Invalid parameters\n *  @return {Object} JSON-RPC 1.0 or 2.0 compatible request\n */\nClientBrowser.prototype.request = function(method, params, id, callback) {\n  const self = this;\n  let request = null;\n\n  // is this a batch request?\n  const isBatch = Array.isArray(method) && typeof params === 'function';\n\n  if (this.options.version === 1 && isBatch) {\n    throw new TypeError('JSON-RPC 1.0 does not support batching');\n  }\n\n  // is this a raw request?\n  const isRaw = !isBatch && method && typeof method === 'object' && typeof params === 'function';\n\n  if(isBatch || isRaw) {\n    callback = params;\n    request = method;\n  } else {\n    if(typeof id === 'function') {\n      callback = id;\n      // specifically undefined because \"null\" is a notification request\n      id = undefined;\n    }\n\n    const hasCallback = typeof callback === 'function';\n\n    try {\n      request = generateRequest(method, params, id, {\n        generator: this.options.generator,\n        version: this.options.version,\n        notificationIdNull: this.options.notificationIdNull,\n      });\n    } catch(err) {\n      if(hasCallback) {\n        return callback(err);\n      }\n      throw err;\n    }\n\n    // no callback means we should just return a raw request\n    if(!hasCallback) {\n      return request;\n    }\n\n  }\n\n  let message;\n  try {\n    message = JSON.stringify(request, this.options.replacer);\n  } catch(err) {\n    return callback(err);\n  }\n\n  this.callServer(message, function(err, response) {\n    self._parseResponse(err, response, callback);\n  });\n\n  // always return the raw request\n  return request;\n};\n\n/**\n * Parses a response from a server\n * @param {Object} err Error to pass on that is unrelated to the actual response\n * @param {String} responseText JSON-RPC 1.0 or 2.0 response\n * @param {Function} callback Callback that will receive different arguments depending on the amount of parameters\n * @private\n */\nClientBrowser.prototype._parseResponse = function(err, responseText, callback) {\n  if(err) {\n    callback(err);\n    return;\n  }\n\n  if(!responseText) {\n    // empty response text, assume that is correct because it could be a\n    // notification which jayson does not give any body for\n    return callback();\n  }\n\n  let response;\n  try {\n    response = JSON.parse(responseText, this.options.reviver);\n  } catch(err) {\n    return callback(err);\n  }\n\n  if(callback.length === 3) {\n    // if callback length is 3, we split callback arguments on error and response\n\n    // is batch response?\n    if(Array.isArray(response)) {\n\n      // neccesary to split strictly on validity according to spec here\n      const isError = function(res) {\n        return typeof res.error !== 'undefined';\n      };\n\n      const isNotError = function (res) {\n        return !isError(res);\n      };\n\n      return callback(null, response.filter(isError), response.filter(isNotError));\n    \n    } else {\n\n      // split regardless of validity\n      return callback(null, response.error, response.result);\n    \n    }\n  \n  }\n\n  callback(null, response);\n};\n","'use strict';\n\nconst uuid = require('uuid').v4;\n\n/**\n *  Generates a JSON-RPC 1.0 or 2.0 request\n *  @param {String} method Name of method to call\n *  @param {Array|Object} params Array of parameters passed to the method as specified, or an object of parameter names and corresponding value\n *  @param {String|Number|null} [id] Request ID can be a string, number, null for explicit notification or left out for automatic generation\n *  @param {Object} [options]\n *  @param {Number} [options.version=2] JSON-RPC version to use (1 or 2)\n *  @param {Boolean} [options.notificationIdNull=false] When true, version 2 requests will set id to null instead of omitting it\n *  @param {Function} [options.generator] Passed the request, and the options object and is expected to return a request ID\n *  @throws {TypeError} If any of the parameters are invalid\n *  @return {Object} A JSON-RPC 1.0 or 2.0 request\n *  @memberOf Utils\n */\nconst generateRequest = function(method, params, id, options) {\n  if(typeof method !== 'string') {\n    throw new TypeError(method + ' must be a string');\n  }\n\n  options = options || {};\n\n  // check valid version provided\n  const version = typeof options.version === 'number' ? options.version : 2;\n  if (version !== 1 && version !== 2) {\n    throw new TypeError(version + ' must be 1 or 2');\n  }\n\n  const request = {\n    method: method\n  };\n\n  if(version === 2) {\n    request.jsonrpc = '2.0';\n  }\n\n  if(params) {\n    // params given, but invalid?\n    if(typeof params !== 'object' && !Array.isArray(params)) {\n      throw new TypeError(params + ' must be an object, array or omitted');\n    }\n    request.params = params;\n  }\n\n  // if id was left out, generate one (null means explicit notification)\n  if(typeof(id) === 'undefined') {\n    const generator = typeof options.generator === 'function' ? options.generator : function() { return uuid(); };\n    request.id = generator(request, options);\n  } else if (version === 2 && id === null) {\n    // we have a version 2 notification\n    if (options.notificationIdNull) {\n      request.id = null; // id will not be set at all unless option provided\n    }\n  } else {\n    request.id = id;\n  }\n\n  return request;\n};\n\nmodule.exports = generateRequest;\n","/**\n * [js-sha256]{@link https://github.com/emn178/js-sha256}\n *\n * @version 0.9.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2014-2017\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n  'use strict';\n\n  var ERROR = 'input is invalid type';\n  var WINDOW = typeof window === 'object';\n  var root = WINDOW ? window : {};\n  if (root.JS_SHA256_NO_WINDOW) {\n    WINDOW = false;\n  }\n  var WEB_WORKER = !WINDOW && typeof self === 'object';\n  var NODE_JS = !root.JS_SHA256_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n  if (NODE_JS) {\n    root = global;\n  } else if (WEB_WORKER) {\n    root = self;\n  }\n  var COMMON_JS = !root.JS_SHA256_NO_COMMON_JS && typeof module === 'object' && module.exports;\n  var AMD = typeof define === 'function' && define.amd;\n  var ARRAY_BUFFER = !root.JS_SHA256_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n  var HEX_CHARS = '0123456789abcdef'.split('');\n  var EXTRA = [-2147483648, 8388608, 32768, 128];\n  var SHIFT = [24, 16, 8, 0];\n  var K = [\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n  ];\n  var OUTPUT_TYPES = ['hex', 'array', 'digest', 'arrayBuffer'];\n\n  var blocks = [];\n\n  if (root.JS_SHA256_NO_NODE_JS || !Array.isArray) {\n    Array.isArray = function (obj) {\n      return Object.prototype.toString.call(obj) === '[object Array]';\n    };\n  }\n\n  if (ARRAY_BUFFER && (root.JS_SHA256_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {\n    ArrayBuffer.isView = function (obj) {\n      return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n    };\n  }\n\n  var createOutputMethod = function (outputType, is224) {\n    return function (message) {\n      return new Sha256(is224, true).update(message)[outputType]();\n    };\n  };\n\n  var createMethod = function (is224) {\n    var method = createOutputMethod('hex', is224);\n    if (NODE_JS) {\n      method = nodeWrap(method, is224);\n    }\n    method.create = function () {\n      return new Sha256(is224);\n    };\n    method.update = function (message) {\n      return method.create().update(message);\n    };\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createOutputMethod(type, is224);\n    }\n    return method;\n  };\n\n  var nodeWrap = function (method, is224) {\n    var crypto = eval(\"require('crypto')\");\n    var Buffer = eval(\"require('buffer').Buffer\");\n    var algorithm = is224 ? 'sha224' : 'sha256';\n    var nodeMethod = function (message) {\n      if (typeof message === 'string') {\n        return crypto.createHash(algorithm).update(message, 'utf8').digest('hex');\n      } else {\n        if (message === null || message === undefined) {\n          throw new Error(ERROR);\n        } else if (message.constructor === ArrayBuffer) {\n          message = new Uint8Array(message);\n        }\n      }\n      if (Array.isArray(message) || ArrayBuffer.isView(message) ||\n        message.constructor === Buffer) {\n        return crypto.createHash(algorithm).update(new Buffer(message)).digest('hex');\n      } else {\n        return method(message);\n      }\n    };\n    return nodeMethod;\n  };\n\n  var createHmacOutputMethod = function (outputType, is224) {\n    return function (key, message) {\n      return new HmacSha256(key, is224, true).update(message)[outputType]();\n    };\n  };\n\n  var createHmacMethod = function (is224) {\n    var method = createHmacOutputMethod('hex', is224);\n    method.create = function (key) {\n      return new HmacSha256(key, is224);\n    };\n    method.update = function (key, message) {\n      return method.create(key).update(message);\n    };\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createHmacOutputMethod(type, is224);\n    }\n    return method;\n  };\n\n  function Sha256(is224, sharedMemory) {\n    if (sharedMemory) {\n      blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n        blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n        blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n        blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n      this.blocks = blocks;\n    } else {\n      this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n    }\n\n    if (is224) {\n      this.h0 = 0xc1059ed8;\n      this.h1 = 0x367cd507;\n      this.h2 = 0x3070dd17;\n      this.h3 = 0xf70e5939;\n      this.h4 = 0xffc00b31;\n      this.h5 = 0x68581511;\n      this.h6 = 0x64f98fa7;\n      this.h7 = 0xbefa4fa4;\n    } else { // 256\n      this.h0 = 0x6a09e667;\n      this.h1 = 0xbb67ae85;\n      this.h2 = 0x3c6ef372;\n      this.h3 = 0xa54ff53a;\n      this.h4 = 0x510e527f;\n      this.h5 = 0x9b05688c;\n      this.h6 = 0x1f83d9ab;\n      this.h7 = 0x5be0cd19;\n    }\n\n    this.block = this.start = this.bytes = this.hBytes = 0;\n    this.finalized = this.hashed = false;\n    this.first = true;\n    this.is224 = is224;\n  }\n\n  Sha256.prototype.update = function (message) {\n    if (this.finalized) {\n      return;\n    }\n    var notString, type = typeof message;\n    if (type !== 'string') {\n      if (type === 'object') {\n        if (message === null) {\n          throw new Error(ERROR);\n        } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n          message = new Uint8Array(message);\n        } else if (!Array.isArray(message)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {\n            throw new Error(ERROR);\n          }\n        }\n      } else {\n        throw new Error(ERROR);\n      }\n      notString = true;\n    }\n    var code, index = 0, i, length = message.length, blocks = this.blocks;\n\n    while (index < length) {\n      if (this.hashed) {\n        this.hashed = false;\n        blocks[0] = this.block;\n        blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n          blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n          blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n          blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n      }\n\n      if (notString) {\n        for (i = this.start; index < length && i < 64; ++index) {\n          blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n        }\n      } else {\n        for (i = this.start; index < length && i < 64; ++index) {\n          code = message.charCodeAt(index);\n          if (code < 0x80) {\n            blocks[i >> 2] |= code << SHIFT[i++ & 3];\n          } else if (code < 0x800) {\n            blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else if (code < 0xd800 || code >= 0xe000) {\n            blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else {\n            code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n            blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          }\n        }\n      }\n\n      this.lastByteIndex = i;\n      this.bytes += i - this.start;\n      if (i >= 64) {\n        this.block = blocks[16];\n        this.start = i - 64;\n        this.hash();\n        this.hashed = true;\n      } else {\n        this.start = i;\n      }\n    }\n    if (this.bytes > 4294967295) {\n      this.hBytes += this.bytes / 4294967296 << 0;\n      this.bytes = this.bytes % 4294967296;\n    }\n    return this;\n  };\n\n  Sha256.prototype.finalize = function () {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    var blocks = this.blocks, i = this.lastByteIndex;\n    blocks[16] = this.block;\n    blocks[i >> 2] |= EXTRA[i & 3];\n    this.block = blocks[16];\n    if (i >= 56) {\n      if (!this.hashed) {\n        this.hash();\n      }\n      blocks[0] = this.block;\n      blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n        blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n        blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n        blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n    }\n    blocks[14] = this.hBytes << 3 | this.bytes >>> 29;\n    blocks[15] = this.bytes << 3;\n    this.hash();\n  };\n\n  Sha256.prototype.hash = function () {\n    var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4, f = this.h5, g = this.h6,\n      h = this.h7, blocks = this.blocks, j, s0, s1, maj, t1, t2, ch, ab, da, cd, bc;\n\n    for (j = 16; j < 64; ++j) {\n      // rightrotate\n      t1 = blocks[j - 15];\n      s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);\n      t1 = blocks[j - 2];\n      s1 = ((t1 >>> 17) | (t1 << 15)) ^ ((t1 >>> 19) | (t1 << 13)) ^ (t1 >>> 10);\n      blocks[j] = blocks[j - 16] + s0 + blocks[j - 7] + s1 << 0;\n    }\n\n    bc = b & c;\n    for (j = 0; j < 64; j += 4) {\n      if (this.first) {\n        if (this.is224) {\n          ab = 300032;\n          t1 = blocks[0] - 1413257819;\n          h = t1 - 150054599 << 0;\n          d = t1 + 24177077 << 0;\n        } else {\n          ab = 704751109;\n          t1 = blocks[0] - 210244248;\n          h = t1 - 1521486534 << 0;\n          d = t1 + 143694565 << 0;\n        }\n        this.first = false;\n      } else {\n        s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));\n        s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));\n        ab = a & b;\n        maj = ab ^ (a & c) ^ bc;\n        ch = (e & f) ^ (~e & g);\n        t1 = h + s1 + ch + K[j] + blocks[j];\n        t2 = s0 + maj;\n        h = d + t1 << 0;\n        d = t1 + t2 << 0;\n      }\n      s0 = ((d >>> 2) | (d << 30)) ^ ((d >>> 13) | (d << 19)) ^ ((d >>> 22) | (d << 10));\n      s1 = ((h >>> 6) | (h << 26)) ^ ((h >>> 11) | (h << 21)) ^ ((h >>> 25) | (h << 7));\n      da = d & a;\n      maj = da ^ (d & b) ^ ab;\n      ch = (h & e) ^ (~h & f);\n      t1 = g + s1 + ch + K[j + 1] + blocks[j + 1];\n      t2 = s0 + maj;\n      g = c + t1 << 0;\n      c = t1 + t2 << 0;\n      s0 = ((c >>> 2) | (c << 30)) ^ ((c >>> 13) | (c << 19)) ^ ((c >>> 22) | (c << 10));\n      s1 = ((g >>> 6) | (g << 26)) ^ ((g >>> 11) | (g << 21)) ^ ((g >>> 25) | (g << 7));\n      cd = c & d;\n      maj = cd ^ (c & a) ^ da;\n      ch = (g & h) ^ (~g & e);\n      t1 = f + s1 + ch + K[j + 2] + blocks[j + 2];\n      t2 = s0 + maj;\n      f = b + t1 << 0;\n      b = t1 + t2 << 0;\n      s0 = ((b >>> 2) | (b << 30)) ^ ((b >>> 13) | (b << 19)) ^ ((b >>> 22) | (b << 10));\n      s1 = ((f >>> 6) | (f << 26)) ^ ((f >>> 11) | (f << 21)) ^ ((f >>> 25) | (f << 7));\n      bc = b & c;\n      maj = bc ^ (b & d) ^ cd;\n      ch = (f & g) ^ (~f & h);\n      t1 = e + s1 + ch + K[j + 3] + blocks[j + 3];\n      t2 = s0 + maj;\n      e = a + t1 << 0;\n      a = t1 + t2 << 0;\n    }\n\n    this.h0 = this.h0 + a << 0;\n    this.h1 = this.h1 + b << 0;\n    this.h2 = this.h2 + c << 0;\n    this.h3 = this.h3 + d << 0;\n    this.h4 = this.h4 + e << 0;\n    this.h5 = this.h5 + f << 0;\n    this.h6 = this.h6 + g << 0;\n    this.h7 = this.h7 + h << 0;\n  };\n\n  Sha256.prototype.hex = function () {\n    this.finalize();\n\n    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,\n      h6 = this.h6, h7 = this.h7;\n\n    var hex = HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +\n      HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +\n      HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F] +\n      HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F] +\n      HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F] +\n      HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F] +\n      HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F] +\n      HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F] +\n      HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F] +\n      HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F] +\n      HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F] +\n      HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F] +\n      HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F] +\n      HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F] +\n      HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F] +\n      HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F] +\n      HEX_CHARS[(h4 >> 28) & 0x0F] + HEX_CHARS[(h4 >> 24) & 0x0F] +\n      HEX_CHARS[(h4 >> 20) & 0x0F] + HEX_CHARS[(h4 >> 16) & 0x0F] +\n      HEX_CHARS[(h4 >> 12) & 0x0F] + HEX_CHARS[(h4 >> 8) & 0x0F] +\n      HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F] +\n      HEX_CHARS[(h5 >> 28) & 0x0F] + HEX_CHARS[(h5 >> 24) & 0x0F] +\n      HEX_CHARS[(h5 >> 20) & 0x0F] + HEX_CHARS[(h5 >> 16) & 0x0F] +\n      HEX_CHARS[(h5 >> 12) & 0x0F] + HEX_CHARS[(h5 >> 8) & 0x0F] +\n      HEX_CHARS[(h5 >> 4) & 0x0F] + HEX_CHARS[h5 & 0x0F] +\n      HEX_CHARS[(h6 >> 28) & 0x0F] + HEX_CHARS[(h6 >> 24) & 0x0F] +\n      HEX_CHARS[(h6 >> 20) & 0x0F] + HEX_CHARS[(h6 >> 16) & 0x0F] +\n      HEX_CHARS[(h6 >> 12) & 0x0F] + HEX_CHARS[(h6 >> 8) & 0x0F] +\n      HEX_CHARS[(h6 >> 4) & 0x0F] + HEX_CHARS[h6 & 0x0F];\n    if (!this.is224) {\n      hex += HEX_CHARS[(h7 >> 28) & 0x0F] + HEX_CHARS[(h7 >> 24) & 0x0F] +\n        HEX_CHARS[(h7 >> 20) & 0x0F] + HEX_CHARS[(h7 >> 16) & 0x0F] +\n        HEX_CHARS[(h7 >> 12) & 0x0F] + HEX_CHARS[(h7 >> 8) & 0x0F] +\n        HEX_CHARS[(h7 >> 4) & 0x0F] + HEX_CHARS[h7 & 0x0F];\n    }\n    return hex;\n  };\n\n  Sha256.prototype.toString = Sha256.prototype.hex;\n\n  Sha256.prototype.digest = function () {\n    this.finalize();\n\n    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,\n      h6 = this.h6, h7 = this.h7;\n\n    var arr = [\n      (h0 >> 24) & 0xFF, (h0 >> 16) & 0xFF, (h0 >> 8) & 0xFF, h0 & 0xFF,\n      (h1 >> 24) & 0xFF, (h1 >> 16) & 0xFF, (h1 >> 8) & 0xFF, h1 & 0xFF,\n      (h2 >> 24) & 0xFF, (h2 >> 16) & 0xFF, (h2 >> 8) & 0xFF, h2 & 0xFF,\n      (h3 >> 24) & 0xFF, (h3 >> 16) & 0xFF, (h3 >> 8) & 0xFF, h3 & 0xFF,\n      (h4 >> 24) & 0xFF, (h4 >> 16) & 0xFF, (h4 >> 8) & 0xFF, h4 & 0xFF,\n      (h5 >> 24) & 0xFF, (h5 >> 16) & 0xFF, (h5 >> 8) & 0xFF, h5 & 0xFF,\n      (h6 >> 24) & 0xFF, (h6 >> 16) & 0xFF, (h6 >> 8) & 0xFF, h6 & 0xFF\n    ];\n    if (!this.is224) {\n      arr.push((h7 >> 24) & 0xFF, (h7 >> 16) & 0xFF, (h7 >> 8) & 0xFF, h7 & 0xFF);\n    }\n    return arr;\n  };\n\n  Sha256.prototype.array = Sha256.prototype.digest;\n\n  Sha256.prototype.arrayBuffer = function () {\n    this.finalize();\n\n    var buffer = new ArrayBuffer(this.is224 ? 28 : 32);\n    var dataView = new DataView(buffer);\n    dataView.setUint32(0, this.h0);\n    dataView.setUint32(4, this.h1);\n    dataView.setUint32(8, this.h2);\n    dataView.setUint32(12, this.h3);\n    dataView.setUint32(16, this.h4);\n    dataView.setUint32(20, this.h5);\n    dataView.setUint32(24, this.h6);\n    if (!this.is224) {\n      dataView.setUint32(28, this.h7);\n    }\n    return buffer;\n  };\n\n  function HmacSha256(key, is224, sharedMemory) {\n    var i, type = typeof key;\n    if (type === 'string') {\n      var bytes = [], length = key.length, index = 0, code;\n      for (i = 0; i < length; ++i) {\n        code = key.charCodeAt(i);\n        if (code < 0x80) {\n          bytes[index++] = code;\n        } else if (code < 0x800) {\n          bytes[index++] = (0xc0 | (code >> 6));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        } else if (code < 0xd800 || code >= 0xe000) {\n          bytes[index++] = (0xe0 | (code >> 12));\n          bytes[index++] = (0x80 | ((code >> 6) & 0x3f));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        } else {\n          code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));\n          bytes[index++] = (0xf0 | (code >> 18));\n          bytes[index++] = (0x80 | ((code >> 12) & 0x3f));\n          bytes[index++] = (0x80 | ((code >> 6) & 0x3f));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        }\n      }\n      key = bytes;\n    } else {\n      if (type === 'object') {\n        if (key === null) {\n          throw new Error(ERROR);\n        } else if (ARRAY_BUFFER && key.constructor === ArrayBuffer) {\n          key = new Uint8Array(key);\n        } else if (!Array.isArray(key)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(key)) {\n            throw new Error(ERROR);\n          }\n        }\n      } else {\n        throw new Error(ERROR);\n      }\n    }\n\n    if (key.length > 64) {\n      key = (new Sha256(is224, true)).update(key).array();\n    }\n\n    var oKeyPad = [], iKeyPad = [];\n    for (i = 0; i < 64; ++i) {\n      var b = key[i] || 0;\n      oKeyPad[i] = 0x5c ^ b;\n      iKeyPad[i] = 0x36 ^ b;\n    }\n\n    Sha256.call(this, is224, sharedMemory);\n\n    this.update(iKeyPad);\n    this.oKeyPad = oKeyPad;\n    this.inner = true;\n    this.sharedMemory = sharedMemory;\n  }\n  HmacSha256.prototype = new Sha256();\n\n  HmacSha256.prototype.finalize = function () {\n    Sha256.prototype.finalize.call(this);\n    if (this.inner) {\n      this.inner = false;\n      var innerHash = this.array();\n      Sha256.call(this, this.is224, this.sharedMemory);\n      this.update(this.oKeyPad);\n      this.update(innerHash);\n      Sha256.prototype.finalize.call(this);\n    }\n  };\n\n  var exports = createMethod();\n  exports.sha256 = exports;\n  exports.sha224 = createMethod(true);\n  exports.sha256.hmac = createHmacMethod();\n  exports.sha224.hmac = createHmacMethod(true);\n\n  if (COMMON_JS) {\n    module.exports = exports;\n  } else {\n    root.sha256 = exports.sha256;\n    root.sha224 = exports.sha224;\n    if (AMD) {\n      define(function () {\n        return exports;\n      });\n    }\n  }\n})();\n","/**\n * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.9.3\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2023\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n  'use strict';\n\n  var INPUT_ERROR = 'input is invalid type';\n  var FINALIZE_ERROR = 'finalize already called';\n  var WINDOW = typeof window === 'object';\n  var root = WINDOW ? window : {};\n  if (root.JS_SHA3_NO_WINDOW) {\n    WINDOW = false;\n  }\n  var WEB_WORKER = !WINDOW && typeof self === 'object';\n  var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n  if (NODE_JS) {\n    root = global;\n  } else if (WEB_WORKER) {\n    root = self;\n  }\n  var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;\n  var AMD = typeof define === 'function' && define.amd;\n  var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n  var HEX_CHARS = '0123456789abcdef'.split('');\n  var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n  var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n  var KECCAK_PADDING = [1, 256, 65536, 16777216];\n  var PADDING = [6, 1536, 393216, 100663296];\n  var SHIFT = [0, 8, 16, 24];\n  var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n    0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n    2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n    2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n    2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n  var BITS = [224, 256, 384, 512];\n  var SHAKE_BITS = [128, 256];\n  var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n  var CSHAKE_BYTEPAD = {\n    '128': 168,\n    '256': 136\n  };\n\n\n  var isArray = root.JS_SHA3_NO_NODE_JS || !Array.isArray\n    ? function (obj) {\n        return Object.prototype.toString.call(obj) === '[object Array]';\n      }\n    : Array.isArray;\n\n  var isView = (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView))\n    ? function (obj) {\n        return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n      }\n    : ArrayBuffer.isView;\n\n  // [message: string, isString: bool]\n  var formatMessage = function (message) {\n    var type = typeof message;\n    if (type === 'string') {\n      return [message, true];\n    }\n    if (type !== 'object' || message === null) {\n      throw new Error(INPUT_ERROR);\n    }\n    if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n      return [new Uint8Array(message), false];\n    }\n    if (!isArray(message) && !isView(message)) {\n      throw new Error(INPUT_ERROR);\n    }\n    return [message, false];\n  }\n\n  var empty = function (message) {\n    return formatMessage(message)[0].length === 0;\n  };\n\n  var cloneArray = function (array) {\n    var newArray = [];\n    for (var i = 0; i < array.length; ++i) {\n      newArray[i] = array[i];\n    }\n    return newArray;\n  }\n\n  var createOutputMethod = function (bits, padding, outputType) {\n    return function (message) {\n      return new Keccak(bits, padding, bits).update(message)[outputType]();\n    };\n  };\n\n  var createShakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits) {\n      return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n    };\n  };\n\n  var createCshakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits, n, s) {\n      return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n    };\n  };\n\n  var createKmacOutputMethod = function (bits, padding, outputType) {\n    return function (key, message, outputBits, s) {\n      return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n    };\n  };\n\n  var createOutputMethods = function (method, createMethod, bits, padding) {\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createMethod(bits, padding, type);\n    }\n    return method;\n  };\n\n  var createMethod = function (bits, padding) {\n    var method = createOutputMethod(bits, padding, 'hex');\n    method.create = function () {\n      return new Keccak(bits, padding, bits);\n    };\n    method.update = function (message) {\n      return method.create().update(message);\n    };\n    return createOutputMethods(method, createOutputMethod, bits, padding);\n  };\n\n  var createShakeMethod = function (bits, padding) {\n    var method = createShakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits) {\n      return new Keccak(bits, padding, outputBits);\n    };\n    method.update = function (message, outputBits) {\n      return method.create(outputBits).update(message);\n    };\n    return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n  };\n\n  var createCshakeMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createCshakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits, n, s) {\n      if (empty(n) && empty(s)) {\n        return methods['shake' + bits].create(outputBits);\n      } else {\n        return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n      }\n    };\n    method.update = function (message, outputBits, n, s) {\n      return method.create(outputBits, n, s).update(message);\n    };\n    return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n  };\n\n  var createKmacMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createKmacOutputMethod(bits, padding, 'hex');\n    method.create = function (key, outputBits, s) {\n      return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n    };\n    method.update = function (key, message, outputBits, s) {\n      return method.create(key, outputBits, s).update(message);\n    };\n    return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n  };\n\n  var algorithms = [\n    { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n    { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n    { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n  ];\n\n  var methods = {}, methodNames = [];\n\n  for (var i = 0; i < algorithms.length; ++i) {\n    var algorithm = algorithms[i];\n    var bits = algorithm.bits;\n    for (var j = 0; j < bits.length; ++j) {\n      var methodName = algorithm.name + '_' + bits[j];\n      methodNames.push(methodName);\n      methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n      if (algorithm.name !== 'sha3') {\n        var newMethodName = algorithm.name + bits[j];\n        methodNames.push(newMethodName);\n        methods[newMethodName] = methods[methodName];\n      }\n    }\n  }\n\n  function Keccak(bits, padding, outputBits) {\n    this.blocks = [];\n    this.s = [];\n    this.padding = padding;\n    this.outputBits = outputBits;\n    this.reset = true;\n    this.finalized = false;\n    this.block = 0;\n    this.start = 0;\n    this.blockCount = (1600 - (bits << 1)) >> 5;\n    this.byteCount = this.blockCount << 2;\n    this.outputBlocks = outputBits >> 5;\n    this.extraBytes = (outputBits & 31) >> 3;\n\n    for (var i = 0; i < 50; ++i) {\n      this.s[i] = 0;\n    }\n  }\n\n  Keccak.prototype.update = function (message) {\n    if (this.finalized) {\n      throw new Error(FINALIZE_ERROR);\n    }\n    var result = formatMessage(message);\n    message = result[0];\n    var isString = result[1];\n    var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n      blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n    while (index < length) {\n      if (this.reset) {\n        this.reset = false;\n        blocks[0] = this.block;\n        for (i = 1; i < blockCount + 1; ++i) {\n          blocks[i] = 0;\n        }\n      }\n      if (isString) {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          code = message.charCodeAt(index);\n          if (code < 0x80) {\n            blocks[i >> 2] |= code << SHIFT[i++ & 3];\n          } else if (code < 0x800) {\n            blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else if (code < 0xd800 || code >= 0xe000) {\n            blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else {\n            code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n            blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          }\n        }\n      } else {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n        }\n      }\n      this.lastByteIndex = i;\n      if (i >= byteCount) {\n        this.start = i - byteCount;\n        this.block = blocks[blockCount];\n        for (i = 0; i < blockCount; ++i) {\n          s[i] ^= blocks[i];\n        }\n        f(s);\n        this.reset = true;\n      } else {\n        this.start = i;\n      }\n    }\n    return this;\n  };\n\n  Keccak.prototype.encode = function (x, right) {\n    var o = x & 255, n = 1;\n    var bytes = [o];\n    x = x >> 8;\n    o = x & 255;\n    while (o > 0) {\n      bytes.unshift(o);\n      x = x >> 8;\n      o = x & 255;\n      ++n;\n    }\n    if (right) {\n      bytes.push(n);\n    } else {\n      bytes.unshift(n);\n    }\n    this.update(bytes);\n    return bytes.length;\n  };\n\n  Keccak.prototype.encodeString = function (str) {\n    var result = formatMessage(str);\n    str = result[0];\n    var isString = result[1];\n    var bytes = 0, length = str.length;\n    if (isString) {\n      for (var i = 0; i < str.length; ++i) {\n        var code = str.charCodeAt(i);\n        if (code < 0x80) {\n          bytes += 1;\n        } else if (code < 0x800) {\n          bytes += 2;\n        } else if (code < 0xd800 || code >= 0xe000) {\n          bytes += 3;\n        } else {\n          code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n          bytes += 4;\n        }\n      }\n    } else {\n      bytes = length;\n    }\n    bytes += this.encode(bytes * 8);\n    this.update(str);\n    return bytes;\n  };\n\n  Keccak.prototype.bytepad = function (strs, w) {\n    var bytes = this.encode(w);\n    for (var i = 0; i < strs.length; ++i) {\n      bytes += this.encodeString(strs[i]);\n    }\n    var paddingBytes = (w - bytes % w) % w;\n    var zeros = [];\n    zeros.length = paddingBytes;\n    this.update(zeros);\n    return this;\n  };\n\n  Keccak.prototype.finalize = function () {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n    blocks[i >> 2] |= this.padding[i & 3];\n    if (this.lastByteIndex === this.byteCount) {\n      blocks[0] = blocks[blockCount];\n      for (i = 1; i < blockCount + 1; ++i) {\n        blocks[i] = 0;\n      }\n    }\n    blocks[blockCount - 1] |= 0x80000000;\n    for (i = 0; i < blockCount; ++i) {\n      s[i] ^= blocks[i];\n    }\n    f(s);\n  };\n\n  Keccak.prototype.toString = Keccak.prototype.hex = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var hex = '', block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        block = s[i];\n        hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n          HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n          HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n          HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n        i = 0;\n      }\n    }\n    if (extraBytes) {\n      block = s[i];\n      hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n      if (extraBytes > 1) {\n        hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n      }\n      if (extraBytes > 2) {\n        hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n      }\n    }\n    return hex;\n  };\n\n  Keccak.prototype.arrayBuffer = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var bytes = this.outputBits >> 3;\n    var buffer;\n    if (extraBytes) {\n      buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n    } else {\n      buffer = new ArrayBuffer(bytes);\n    }\n    var array = new Uint32Array(buffer);\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        array[j] = s[i];\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      array[j] = s[i];\n      buffer = buffer.slice(0, bytes);\n    }\n    return buffer;\n  };\n\n  Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n  Keccak.prototype.digest = Keccak.prototype.array = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var array = [], offset, block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        offset = j << 2;\n        block = s[i];\n        array[offset] = block & 0xFF;\n        array[offset + 1] = (block >> 8) & 0xFF;\n        array[offset + 2] = (block >> 16) & 0xFF;\n        array[offset + 3] = (block >> 24) & 0xFF;\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      offset = j << 2;\n      block = s[i];\n      array[offset] = block & 0xFF;\n      if (extraBytes > 1) {\n        array[offset + 1] = (block >> 8) & 0xFF;\n      }\n      if (extraBytes > 2) {\n        array[offset + 2] = (block >> 16) & 0xFF;\n      }\n    }\n    return array;\n  };\n\n  function Kmac(bits, padding, outputBits) {\n    Keccak.call(this, bits, padding, outputBits);\n  }\n\n  Kmac.prototype = new Keccak();\n\n  Kmac.prototype.finalize = function () {\n    this.encode(this.outputBits, true);\n    return Keccak.prototype.finalize.call(this);\n  };\n\n  var f = function (s) {\n    var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n      b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n      b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n      b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n    for (n = 0; n < 48; n += 2) {\n      c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n      c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n      c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n      c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n      c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n      c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n      c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n      c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n      c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n      c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n      h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n      l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n      s[0] ^= h;\n      s[1] ^= l;\n      s[10] ^= h;\n      s[11] ^= l;\n      s[20] ^= h;\n      s[21] ^= l;\n      s[30] ^= h;\n      s[31] ^= l;\n      s[40] ^= h;\n      s[41] ^= l;\n      h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n      l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n      s[2] ^= h;\n      s[3] ^= l;\n      s[12] ^= h;\n      s[13] ^= l;\n      s[22] ^= h;\n      s[23] ^= l;\n      s[32] ^= h;\n      s[33] ^= l;\n      s[42] ^= h;\n      s[43] ^= l;\n      h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n      l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n      s[4] ^= h;\n      s[5] ^= l;\n      s[14] ^= h;\n      s[15] ^= l;\n      s[24] ^= h;\n      s[25] ^= l;\n      s[34] ^= h;\n      s[35] ^= l;\n      s[44] ^= h;\n      s[45] ^= l;\n      h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n      l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n      s[6] ^= h;\n      s[7] ^= l;\n      s[16] ^= h;\n      s[17] ^= l;\n      s[26] ^= h;\n      s[27] ^= l;\n      s[36] ^= h;\n      s[37] ^= l;\n      s[46] ^= h;\n      s[47] ^= l;\n      h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n      l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n      s[8] ^= h;\n      s[9] ^= l;\n      s[18] ^= h;\n      s[19] ^= l;\n      s[28] ^= h;\n      s[29] ^= l;\n      s[38] ^= h;\n      s[39] ^= l;\n      s[48] ^= h;\n      s[49] ^= l;\n\n      b0 = s[0];\n      b1 = s[1];\n      b32 = (s[11] << 4) | (s[10] >>> 28);\n      b33 = (s[10] << 4) | (s[11] >>> 28);\n      b14 = (s[20] << 3) | (s[21] >>> 29);\n      b15 = (s[21] << 3) | (s[20] >>> 29);\n      b46 = (s[31] << 9) | (s[30] >>> 23);\n      b47 = (s[30] << 9) | (s[31] >>> 23);\n      b28 = (s[40] << 18) | (s[41] >>> 14);\n      b29 = (s[41] << 18) | (s[40] >>> 14);\n      b20 = (s[2] << 1) | (s[3] >>> 31);\n      b21 = (s[3] << 1) | (s[2] >>> 31);\n      b2 = (s[13] << 12) | (s[12] >>> 20);\n      b3 = (s[12] << 12) | (s[13] >>> 20);\n      b34 = (s[22] << 10) | (s[23] >>> 22);\n      b35 = (s[23] << 10) | (s[22] >>> 22);\n      b16 = (s[33] << 13) | (s[32] >>> 19);\n      b17 = (s[32] << 13) | (s[33] >>> 19);\n      b48 = (s[42] << 2) | (s[43] >>> 30);\n      b49 = (s[43] << 2) | (s[42] >>> 30);\n      b40 = (s[5] << 30) | (s[4] >>> 2);\n      b41 = (s[4] << 30) | (s[5] >>> 2);\n      b22 = (s[14] << 6) | (s[15] >>> 26);\n      b23 = (s[15] << 6) | (s[14] >>> 26);\n      b4 = (s[25] << 11) | (s[24] >>> 21);\n      b5 = (s[24] << 11) | (s[25] >>> 21);\n      b36 = (s[34] << 15) | (s[35] >>> 17);\n      b37 = (s[35] << 15) | (s[34] >>> 17);\n      b18 = (s[45] << 29) | (s[44] >>> 3);\n      b19 = (s[44] << 29) | (s[45] >>> 3);\n      b10 = (s[6] << 28) | (s[7] >>> 4);\n      b11 = (s[7] << 28) | (s[6] >>> 4);\n      b42 = (s[17] << 23) | (s[16] >>> 9);\n      b43 = (s[16] << 23) | (s[17] >>> 9);\n      b24 = (s[26] << 25) | (s[27] >>> 7);\n      b25 = (s[27] << 25) | (s[26] >>> 7);\n      b6 = (s[36] << 21) | (s[37] >>> 11);\n      b7 = (s[37] << 21) | (s[36] >>> 11);\n      b38 = (s[47] << 24) | (s[46] >>> 8);\n      b39 = (s[46] << 24) | (s[47] >>> 8);\n      b30 = (s[8] << 27) | (s[9] >>> 5);\n      b31 = (s[9] << 27) | (s[8] >>> 5);\n      b12 = (s[18] << 20) | (s[19] >>> 12);\n      b13 = (s[19] << 20) | (s[18] >>> 12);\n      b44 = (s[29] << 7) | (s[28] >>> 25);\n      b45 = (s[28] << 7) | (s[29] >>> 25);\n      b26 = (s[38] << 8) | (s[39] >>> 24);\n      b27 = (s[39] << 8) | (s[38] >>> 24);\n      b8 = (s[48] << 14) | (s[49] >>> 18);\n      b9 = (s[49] << 14) | (s[48] >>> 18);\n\n      s[0] = b0 ^ (~b2 & b4);\n      s[1] = b1 ^ (~b3 & b5);\n      s[10] = b10 ^ (~b12 & b14);\n      s[11] = b11 ^ (~b13 & b15);\n      s[20] = b20 ^ (~b22 & b24);\n      s[21] = b21 ^ (~b23 & b25);\n      s[30] = b30 ^ (~b32 & b34);\n      s[31] = b31 ^ (~b33 & b35);\n      s[40] = b40 ^ (~b42 & b44);\n      s[41] = b41 ^ (~b43 & b45);\n      s[2] = b2 ^ (~b4 & b6);\n      s[3] = b3 ^ (~b5 & b7);\n      s[12] = b12 ^ (~b14 & b16);\n      s[13] = b13 ^ (~b15 & b17);\n      s[22] = b22 ^ (~b24 & b26);\n      s[23] = b23 ^ (~b25 & b27);\n      s[32] = b32 ^ (~b34 & b36);\n      s[33] = b33 ^ (~b35 & b37);\n      s[42] = b42 ^ (~b44 & b46);\n      s[43] = b43 ^ (~b45 & b47);\n      s[4] = b4 ^ (~b6 & b8);\n      s[5] = b5 ^ (~b7 & b9);\n      s[14] = b14 ^ (~b16 & b18);\n      s[15] = b15 ^ (~b17 & b19);\n      s[24] = b24 ^ (~b26 & b28);\n      s[25] = b25 ^ (~b27 & b29);\n      s[34] = b34 ^ (~b36 & b38);\n      s[35] = b35 ^ (~b37 & b39);\n      s[44] = b44 ^ (~b46 & b48);\n      s[45] = b45 ^ (~b47 & b49);\n      s[6] = b6 ^ (~b8 & b0);\n      s[7] = b7 ^ (~b9 & b1);\n      s[16] = b16 ^ (~b18 & b10);\n      s[17] = b17 ^ (~b19 & b11);\n      s[26] = b26 ^ (~b28 & b20);\n      s[27] = b27 ^ (~b29 & b21);\n      s[36] = b36 ^ (~b38 & b30);\n      s[37] = b37 ^ (~b39 & b31);\n      s[46] = b46 ^ (~b48 & b40);\n      s[47] = b47 ^ (~b49 & b41);\n      s[8] = b8 ^ (~b0 & b2);\n      s[9] = b9 ^ (~b1 & b3);\n      s[18] = b18 ^ (~b10 & b12);\n      s[19] = b19 ^ (~b11 & b13);\n      s[28] = b28 ^ (~b20 & b22);\n      s[29] = b29 ^ (~b21 & b23);\n      s[38] = b38 ^ (~b30 & b32);\n      s[39] = b39 ^ (~b31 & b33);\n      s[48] = b48 ^ (~b40 & b42);\n      s[49] = b49 ^ (~b41 & b43);\n\n      s[0] ^= RC[n];\n      s[1] ^= RC[n + 1];\n    }\n  };\n\n  if (COMMON_JS) {\n    module.exports = methods;\n  } else {\n    for (i = 0; i < methodNames.length; ++i) {\n      root[methodNames[i]] = methods[methodNames[i]];\n    }\n    if (AMD) {\n      define(function () {\n        return methods;\n      });\n    }\n  }\n})();\n","(function(i,_){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=_():\"function\"==typeof define&&define.amd?define(_):(i=i||self,i.JSBI=_())})(this,function(){'use strict';var i=Math.imul,_=Math.clz32,t=Math.abs,e=Math.max,g=Math.floor;class o extends Array{constructor(i,_){if(super(i),this.sign=_,i>o.__kMaxLength)throw new RangeError(\"Maximum BigInt size exceeded\")}static BigInt(i){var _=Number.isFinite;if(\"number\"==typeof i){if(0===i)return o.__zero();if(o.__isOneDigitInt(i))return 0>i?o.__oneDigit(-i,!0):o.__oneDigit(i,!1);if(!_(i)||g(i)!==i)throw new RangeError(\"The number \"+i+\" cannot be converted to BigInt because it is not an integer\");return o.__fromDouble(i)}if(\"string\"==typeof i){const _=o.__fromString(i);if(null===_)throw new SyntaxError(\"Cannot convert \"+i+\" to a BigInt\");return _}if(\"boolean\"==typeof i)return!0===i?o.__oneDigit(1,!1):o.__zero();if(\"object\"==typeof i){if(i.constructor===o)return i;const _=o.__toPrimitive(i);return o.BigInt(_)}throw new TypeError(\"Cannot convert \"+i+\" to a BigInt\")}toDebugString(){const i=[\"BigInt[\"];for(const _ of this)i.push((_?(_>>>0).toString(16):_)+\", \");return i.push(\"]\"),i.join(\"\")}toString(i=10){if(2>i||36<i)throw new RangeError(\"toString() radix argument must be between 2 and 36\");return 0===this.length?\"0\":0==(i&i-1)?o.__toStringBasePowerOfTwo(this,i):o.__toStringGeneric(this,i,!1)}static toNumber(i){const _=i.length;if(0===_)return 0;if(1===_){const _=i.__unsignedDigit(0);return i.sign?-_:_}const t=i.__digit(_-1),e=o.__clz30(t),n=30*_-e;if(1024<n)return i.sign?-Infinity:1/0;let g=n-1,s=t,l=_-1;const r=e+3;let a=32===r?0:s<<r;a>>>=12;const u=r-12;let d=12<=r?0:s<<20+r,h=20+r;for(0<u&&0<l&&(l--,s=i.__digit(l),a|=s>>>30-u,d=s<<u+2,h=u+2);0<h&&0<l;)l--,s=i.__digit(l),d|=30<=h?s<<h-30:s>>>30-h,h-=30;const m=o.__decideRounding(i,h,l,s);if((1===m||0===m&&1==(1&d))&&(d=d+1>>>0,0===d&&(a++,0!=a>>>20&&(a=0,g++,1023<g))))return i.sign?-Infinity:1/0;const b=i.sign?-2147483648:0;return g=g+1023<<20,o.__kBitConversionInts[1]=b|g|a,o.__kBitConversionInts[0]=d,o.__kBitConversionDouble[0]}static unaryMinus(i){if(0===i.length)return i;const _=i.__copy();return _.sign=!i.sign,_}static bitwiseNot(i){return i.sign?o.__absoluteSubOne(i).__trim():o.__absoluteAddOne(i,!0)}static exponentiate(i,_){if(_.sign)throw new RangeError(\"Exponent must be positive\");if(0===_.length)return o.__oneDigit(1,!1);if(0===i.length)return i;if(1===i.length&&1===i.__digit(0))return i.sign&&0==(1&_.__digit(0))?o.unaryMinus(i):i;if(1<_.length)throw new RangeError(\"BigInt too big\");let t=_.__unsignedDigit(0);if(1===t)return i;if(t>=o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");if(1===i.length&&2===i.__digit(0)){const _=1+(0|t/30),e=i.sign&&0!=(1&t),n=new o(_,e);n.__initializeDigits();const g=1<<t%30;return n.__setDigit(_-1,g),n}let e=null,n=i;for(0!=(1&t)&&(e=i),t>>=1;0!==t;t>>=1)n=o.multiply(n,n),0!=(1&t)&&(null===e?e=n:e=o.multiply(e,n));return e}static multiply(_,t){if(0===_.length)return _;if(0===t.length)return t;let i=_.length+t.length;30<=_.__clzmsd()+t.__clzmsd()&&i--;const e=new o(i,_.sign!==t.sign);e.__initializeDigits();for(let n=0;n<_.length;n++)o.__multiplyAccumulate(t,_.__digit(n),e,n);return e.__trim()}static divide(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return o.__zero();const t=i.sign!==_.sign,e=_.__unsignedDigit(0);let n;if(1===_.length&&32767>=e){if(1===e)return t===i.sign?i:o.unaryMinus(i);n=o.__absoluteDivSmall(i,e,null)}else n=o.__absoluteDivLarge(i,_,!0,!1);return n.sign=t,n.__trim()}static remainder(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return i;const t=_.__unsignedDigit(0);if(1===_.length&&32767>=t){if(1===t)return o.__zero();const _=o.__absoluteModSmall(i,t);return 0===_?o.__zero():o.__oneDigit(_,i.sign)}const e=o.__absoluteDivLarge(i,_,!1,!0);return e.sign=i.sign,e.__trim()}static add(i,_){const t=i.sign;return t===_.sign?o.__absoluteAdd(i,_,t):0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t)}static subtract(i,_){const t=i.sign;return t===_.sign?0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t):o.__absoluteAdd(i,_,t)}static leftShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__rightShiftByAbsolute(i,_):o.__leftShiftByAbsolute(i,_)}static signedRightShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__leftShiftByAbsolute(i,_):o.__rightShiftByAbsolute(i,_)}static unsignedRightShift(){throw new TypeError(\"BigInts have no unsigned right shift; use >> instead\")}static lessThan(i,_){return 0>o.__compareToBigInt(i,_)}static lessThanOrEqual(i,_){return 0>=o.__compareToBigInt(i,_)}static greaterThan(i,_){return 0<o.__compareToBigInt(i,_)}static greaterThanOrEqual(i,_){return 0<=o.__compareToBigInt(i,_)}static equal(_,t){if(_.sign!==t.sign)return!1;if(_.length!==t.length)return!1;for(let e=0;e<_.length;e++)if(_.__digit(e)!==t.__digit(e))return!1;return!0}static notEqual(i,_){return!o.equal(i,_)}static bitwiseAnd(i,_){if(!i.sign&&!_.sign)return o.__absoluteAnd(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length)+1;let n=o.__absoluteSubOne(i,t);const g=o.__absoluteSubOne(_);return n=o.__absoluteOr(n,g,n),o.__absoluteAddOne(n,!0,n).__trim()}return i.sign&&([i,_]=[_,i]),o.__absoluteAndNot(i,o.__absoluteSubOne(_)).__trim()}static bitwiseXor(i,_){if(!i.sign&&!_.sign)return o.__absoluteXor(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length),n=o.__absoluteSubOne(i,t),g=o.__absoluteSubOne(_);return o.__absoluteXor(n,g,n).__trim()}const t=e(i.length,_.length)+1;i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteXor(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static bitwiseOr(i,_){const t=e(i.length,_.length);if(!i.sign&&!_.sign)return o.__absoluteOr(i,_).__trim();if(i.sign&&_.sign){let e=o.__absoluteSubOne(i,t);const n=o.__absoluteSubOne(_);return e=o.__absoluteAnd(e,n,e),o.__absoluteAddOne(e,!0,e).__trim()}i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteAndNot(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static asIntN(_,t){if(0===t.length)return t;if(_=g(_),0>_)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===_)return o.__zero();if(_>=o.__kMaxLengthBits)return t;const e=0|(_+29)/30;if(t.length<e)return t;const s=t.__unsignedDigit(e-1),l=1<<(_-1)%30;if(t.length===e&&s<l)return t;if(!((s&l)===l))return o.__truncateToNBits(_,t);if(!t.sign)return o.__truncateAndSubFromPowerOfTwo(_,t,!0);if(0==(s&l-1)){for(let n=e-2;0<=n;n--)if(0!==t.__digit(n))return o.__truncateAndSubFromPowerOfTwo(_,t,!1);return t.length===e&&s===l?t:o.__truncateToNBits(_,t)}return o.__truncateAndSubFromPowerOfTwo(_,t,!1)}static asUintN(i,_){if(0===_.length)return _;if(i=g(i),0>i)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===i)return o.__zero();if(_.sign){if(i>o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");return o.__truncateAndSubFromPowerOfTwo(i,_,!1)}if(i>=o.__kMaxLengthBits)return _;const t=0|(i+29)/30;if(_.length<t)return _;const e=i%30;if(_.length==t){if(0===e)return _;const i=_.__digit(t-1);if(0==i>>>e)return _}return o.__truncateToNBits(i,_)}static ADD(i,_){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i)return\"string\"!=typeof _&&(_=_.toString()),i+_;if(\"string\"==typeof _)return i.toString()+_;if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)&&o.__isBigInt(_))return o.add(i,_);if(\"number\"==typeof i&&\"number\"==typeof _)return i+_;throw new TypeError(\"Cannot mix BigInt and other types, use explicit conversions\")}static LT(i,_){return o.__compare(i,_,0)}static LE(i,_){return o.__compare(i,_,1)}static GT(i,_){return o.__compare(i,_,2)}static GE(i,_){return o.__compare(i,_,3)}static EQ(i,_){for(;;){if(o.__isBigInt(i))return o.__isBigInt(_)?o.equal(i,_):o.EQ(_,i);if(\"number\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"string\"==typeof i){if(o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.equal(i,_);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"boolean\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,+i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"symbol\"==typeof i){if(o.__isBigInt(_))return!1;if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"object\"==typeof i){if(\"object\"==typeof _&&_.constructor!==o)return i==_;i=o.__toPrimitive(i)}else return i==_}}static NE(i,_){return!o.EQ(i,_)}static __zero(){return new o(0,!1)}static __oneDigit(i,_){const t=new o(1,_);return t.__setDigit(0,i),t}__copy(){const _=new o(this.length,this.sign);for(let t=0;t<this.length;t++)_[t]=this[t];return _}__trim(){let i=this.length,_=this[i-1];for(;0===_;)i--,_=this[i-1],this.pop();return 0===i&&(this.sign=!1),this}__initializeDigits(){for(let _=0;_<this.length;_++)this[_]=0}static __decideRounding(i,_,t,e){if(0<_)return-1;let n;if(0>_)n=-_-1;else{if(0===t)return-1;t--,e=i.__digit(t),n=29}let g=1<<n;if(0==(e&g))return-1;if(g-=1,0!=(e&g))return 1;for(;0<t;)if(t--,0!==i.__digit(t))return 1;return 0}static __fromDouble(i){o.__kBitConversionDouble[0]=i;const _=2047&o.__kBitConversionInts[1]>>>20,t=_-1023,e=(0|t/30)+1,n=new o(e,0>i);let g=1048575&o.__kBitConversionInts[1]|1048576,s=o.__kBitConversionInts[0];const l=20,r=t%30;let a,u=0;if(20>r){const i=l-r;u=i+32,a=g>>>i,g=g<<32-i|s>>>i,s<<=32-i}else if(20===r)u=32,a=g,g=s,s=0;else{const i=r-l;u=32-i,a=g<<i|s>>>32-i,g=s<<i,s=0}n.__setDigit(e-1,a);for(let _=e-2;0<=_;_--)0<u?(u-=30,a=g>>>2,g=g<<30|s>>>2,s<<=30):a=0,n.__setDigit(_,a);return n.__trim()}static __isWhitespace(i){return!!(13>=i&&9<=i)||(159>=i?32==i:131071>=i?160==i||5760==i:196607>=i?(i&=131071,10>=i||40==i||41==i||47==i||95==i||4096==i):65279==i)}static __fromString(i,_=0){let t=0;const e=i.length;let n=0;if(n===e)return o.__zero();let g=i.charCodeAt(n);for(;o.__isWhitespace(g);){if(++n===e)return o.__zero();g=i.charCodeAt(n)}if(43===g){if(++n===e)return null;g=i.charCodeAt(n),t=1}else if(45===g){if(++n===e)return null;g=i.charCodeAt(n),t=-1}if(0===_){if(_=10,48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(_=16,++n===e)return null;g=i.charCodeAt(n)}else if(79===g||111===g){if(_=8,++n===e)return null;g=i.charCodeAt(n)}else if(66===g||98===g){if(_=2,++n===e)return null;g=i.charCodeAt(n)}}}else if(16===_&&48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(++n===e)return null;g=i.charCodeAt(n)}}if(0!=t&&10!==_)return null;for(;48===g;){if(++n===e)return o.__zero();g=i.charCodeAt(n)}const s=e-n;let l=o.__kMaxBitsPerChar[_],r=o.__kBitsPerCharTableMultiplier-1;if(s>1073741824/l)return null;const a=l*s+r>>>o.__kBitsPerCharTableShift,u=new o(0|(a+29)/30,!1),h=10>_?_:10,b=10<_?_-10:0;if(0==(_&_-1)){l>>=o.__kBitsPerCharTableShift;const _=[],t=[];let s=!1;do{let o=0,r=0;for(;;){let _;if(g-48>>>0<h)_=g-48;else if((32|g)-97>>>0<b)_=(32|g)-87;else{s=!0;break}if(r+=l,o=o<<l|_,++n===e){s=!0;break}if(g=i.charCodeAt(n),30<r+l)break}_.push(o),t.push(r)}while(!s);o.__fillFromParts(u,_,t)}else{u.__initializeDigits();let t=!1,s=0;do{let a=0,D=1;for(;;){let o;if(g-48>>>0<h)o=g-48;else if((32|g)-97>>>0<b)o=(32|g)-87;else{t=!0;break}const l=D*_;if(1073741823<l)break;if(D=l,a=a*_+o,s++,++n===e){t=!0;break}g=i.charCodeAt(n)}r=30*o.__kBitsPerCharTableMultiplier-1;const c=0|(l*s+r>>>o.__kBitsPerCharTableShift)/30;u.__inplaceMultiplyAdd(D,a,c)}while(!t)}if(n!==e){if(!o.__isWhitespace(g))return null;for(n++;n<e;n++)if(g=i.charCodeAt(n),!o.__isWhitespace(g))return null}return u.sign=-1==t,u.__trim()}static __fillFromParts(_,t,e){let n=0,g=0,o=0;for(let s=t.length-1;0<=s;s--){const i=t[s],l=e[s];g|=i<<o,o+=l,30===o?(_.__setDigit(n++,g),o=0,g=0):30<o&&(_.__setDigit(n++,1073741823&g),o-=30,g=i>>>l-o)}if(0!==g){if(n>=_.length)throw new Error(\"implementation bug\");_.__setDigit(n++,g)}for(;n<_.length;n++)_.__setDigit(n,0)}static __toStringBasePowerOfTwo(_,i){const t=_.length;let e=i-1;e=(85&e>>>1)+(85&e),e=(51&e>>>2)+(51&e),e=(15&e>>>4)+(15&e);const n=e,g=i-1,s=_.__digit(t-1),l=o.__clz30(s);let r=0|(30*t-l+n-1)/n;if(_.sign&&r++,268435456<r)throw new Error(\"string too long\");const a=Array(r);let u=r-1,d=0,h=0;for(let e=0;e<t-1;e++){const i=_.__digit(e),t=(d|i<<h)&g;a[u--]=o.__kConversionChars[t];const s=n-h;for(d=i>>>s,h=30-s;h>=n;)a[u--]=o.__kConversionChars[d&g],d>>>=n,h-=n}const m=(d|s<<h)&g;for(a[u--]=o.__kConversionChars[m],d=s>>>n-h;0!==d;)a[u--]=o.__kConversionChars[d&g],d>>>=n;if(_.sign&&(a[u--]=\"-\"),-1!=u)throw new Error(\"implementation bug\");return a.join(\"\")}static __toStringGeneric(_,i,t){const e=_.length;if(0===e)return\"\";if(1===e){let e=_.__unsignedDigit(0).toString(i);return!1===t&&_.sign&&(e=\"-\"+e),e}const n=30*e-o.__clz30(_.__digit(e-1)),g=o.__kMaxBitsPerChar[i],s=g-1;let l=n*o.__kBitsPerCharTableMultiplier;l+=s-1,l=0|l/s;const r=l+1>>1,a=o.exponentiate(o.__oneDigit(i,!1),o.__oneDigit(r,!1));let u,d;const h=a.__unsignedDigit(0);if(1===a.length&&32767>=h){u=new o(_.length,!1),u.__initializeDigits();let t=0;for(let e=2*_.length-1;0<=e;e--){const i=t<<15|_.__halfDigit(e);u.__setHalfDigit(e,0|i/h),t=0|i%h}d=t.toString(i)}else{const t=o.__absoluteDivLarge(_,a,!0,!0);u=t.quotient;const e=t.remainder.__trim();d=o.__toStringGeneric(e,i,!0)}u.__trim();let m=o.__toStringGeneric(u,i,!0);for(;d.length<r;)d=\"0\"+d;return!1===t&&_.sign&&(m=\"-\"+m),m+d}static __unequalSign(i){return i?-1:1}static __absoluteGreater(i){return i?-1:1}static __absoluteLess(i){return i?1:-1}static __compareToBigInt(i,_){const t=i.sign;if(t!==_.sign)return o.__unequalSign(t);const e=o.__absoluteCompare(i,_);return 0<e?o.__absoluteGreater(t):0>e?o.__absoluteLess(t):0}static __compareToNumber(i,_){if(o.__isOneDigitInt(_)){const e=i.sign,n=0>_;if(e!==n)return o.__unequalSign(e);if(0===i.length){if(n)throw new Error(\"implementation bug\");return 0===_?0:-1}if(1<i.length)return o.__absoluteGreater(e);const g=t(_),s=i.__unsignedDigit(0);return s>g?o.__absoluteGreater(e):s<g?o.__absoluteLess(e):0}return o.__compareToDouble(i,_)}static __compareToDouble(i,_){if(_!==_)return _;if(_===1/0)return-1;if(_===-Infinity)return 1;const t=i.sign;if(t!==0>_)return o.__unequalSign(t);if(0===_)throw new Error(\"implementation bug: should be handled elsewhere\");if(0===i.length)return-1;o.__kBitConversionDouble[0]=_;const e=2047&o.__kBitConversionInts[1]>>>20;if(2047==e)throw new Error(\"implementation bug: handled elsewhere\");const n=e-1023;if(0>n)return o.__absoluteGreater(t);const g=i.length;let s=i.__digit(g-1);const l=o.__clz30(s),r=30*g-l,a=n+1;if(r<a)return o.__absoluteLess(t);if(r>a)return o.__absoluteGreater(t);let u=1048576|1048575&o.__kBitConversionInts[1],d=o.__kBitConversionInts[0];const h=20,m=29-l;if(m!==(0|(r-1)%30))throw new Error(\"implementation bug\");let b,D=0;if(20>m){const i=h-m;D=i+32,b=u>>>i,u=u<<32-i|d>>>i,d<<=32-i}else if(20===m)D=32,b=u,u=d,d=0;else{const i=m-h;D=32-i,b=u<<i|d>>>32-i,u=d<<i,d=0}if(s>>>=0,b>>>=0,s>b)return o.__absoluteGreater(t);if(s<b)return o.__absoluteLess(t);for(let e=g-2;0<=e;e--){0<D?(D-=30,b=u>>>2,u=u<<30|d>>>2,d<<=30):b=0;const _=i.__unsignedDigit(e);if(_>b)return o.__absoluteGreater(t);if(_<b)return o.__absoluteLess(t)}if(0!==u||0!==d){if(0===D)throw new Error(\"implementation bug\");return o.__absoluteLess(t)}return 0}static __equalToNumber(i,_){return o.__isOneDigitInt(_)?0===_?0===i.length:1===i.length&&i.sign===0>_&&i.__unsignedDigit(0)===t(_):0===o.__compareToDouble(i,_)}static __comparisonResultToBool(i,_){return 0===_?0>i:1===_?0>=i:2===_?0<i:3===_?0<=i:void 0}static __compare(i,_,t){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i&&\"string\"==typeof _)switch(t){case 0:return i<_;case 1:return i<=_;case 2:return i>_;case 3:return i>=_;}if(o.__isBigInt(i)&&\"string\"==typeof _)return _=o.__fromString(_),null!==_&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"string\"==typeof i&&o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)){if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return o.__comparisonResultToBool(o.__compareToNumber(i,_),t)}if(\"number\"!=typeof i)throw new Error(\"implementation bug\");if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToNumber(_,i),2^t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return 0===t?i<_:1===t?i<=_:2===t?i>_:3===t?i>=_:void 0}__clzmsd(){return o.__clz30(this.__digit(this.length-1))}static __absoluteAdd(_,t,e){if(_.length<t.length)return o.__absoluteAdd(t,_,e);if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);let n=_.length;(0===_.__clzmsd()||t.length===_.length&&0===t.__clzmsd())&&n++;const g=new o(n,e);let s=0,l=0;for(;l<t.length;l++){const i=_.__digit(l)+t.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}for(;l<_.length;l++){const i=_.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}return l<g.length&&g.__setDigit(l,s),g.__trim()}static __absoluteSub(_,t,e){if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);const n=new o(_.length,e);let g=0,s=0;for(;s<t.length;s++){const i=_.__digit(s)-t.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}for(;s<_.length;s++){const i=_.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}return n.__trim()}static __absoluteAddOne(_,i,t=null){const e=_.length;null===t?t=new o(e,i):t.sign=i;let n=1;for(let g=0;g<e;g++){const i=_.__digit(g)+n;n=i>>>30,t.__setDigit(g,1073741823&i)}return 0!=n&&t.__setDigitGrow(e,1),t}static __absoluteSubOne(_,t){const e=_.length;t=t||e;const n=new o(t,!1);let g=1;for(let o=0;o<e;o++){const i=_.__digit(o)-g;g=1&i>>>30,n.__setDigit(o,1073741823&i)}if(0!=g)throw new Error(\"implementation bug\");for(let g=e;g<t;g++)n.__setDigit(g,0);return n}static __absoluteAnd(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=s;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&t.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteAndNot(_,t,e=null){const n=_.length,g=t.length;let s=g;n<g&&(s=n);let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&~t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteOr(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)|t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteXor(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)^t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteCompare(_,t){const e=_.length-t.length;if(0!=e)return e;let n=_.length-1;for(;0<=n&&_.__digit(n)===t.__digit(n);)n--;return 0>n?0:_.__unsignedDigit(n)>t.__unsignedDigit(n)?1:-1}static __multiplyAccumulate(_,t,e,n){if(0===t)return;const g=32767&t,s=t>>>15;let l=0,r=0;for(let a,u=0;u<_.length;u++,n++){a=e.__digit(n);const i=_.__digit(u),t=32767&i,d=i>>>15,h=o.__imul(t,g),m=o.__imul(t,s),b=o.__imul(d,g),D=o.__imul(d,s);a+=r+h+l,l=a>>>30,a&=1073741823,a+=((32767&m)<<15)+((32767&b)<<15),l+=a>>>30,r=D+(m>>>15)+(b>>>15),e.__setDigit(n,1073741823&a)}for(;0!=l||0!==r;n++){let i=e.__digit(n);i+=l+r,r=0,l=i>>>30,e.__setDigit(n,1073741823&i)}}static __internalMultiplyAdd(_,t,e,g,s){let l=e,a=0;for(let n=0;n<g;n++){const i=_.__digit(n),e=o.__imul(32767&i,t),g=o.__imul(i>>>15,t),u=e+((32767&g)<<15)+a+l;l=u>>>30,a=g>>>15,s.__setDigit(n,1073741823&u)}if(s.length>g)for(s.__setDigit(g++,l+a);g<s.length;)s.__setDigit(g++,0);else if(0!==l+a)throw new Error(\"implementation bug\")}__inplaceMultiplyAdd(i,_,t){t>this.length&&(t=this.length);const e=32767&i,n=i>>>15;let g=0,s=_;for(let l=0;l<t;l++){const i=this.__digit(l),_=32767&i,t=i>>>15,r=o.__imul(_,e),a=o.__imul(_,n),u=o.__imul(t,e),d=o.__imul(t,n);let h=s+r+g;g=h>>>30,h&=1073741823,h+=((32767&a)<<15)+((32767&u)<<15),g+=h>>>30,s=d+(a>>>15)+(u>>>15),this.__setDigit(l,1073741823&h)}if(0!=g||0!==s)throw new Error(\"implementation bug\")}static __absoluteDivSmall(_,t,e=null){null===e&&(e=new o(_.length,!1));let n=0;for(let g,o=2*_.length-1;0<=o;o-=2){g=(n<<15|_.__halfDigit(o))>>>0;const i=0|g/t;n=0|g%t,g=(n<<15|_.__halfDigit(o-1))>>>0;const s=0|g/t;n=0|g%t,e.__setDigit(o>>>1,i<<15|s)}return e}static __absoluteModSmall(_,t){let e=0;for(let n=2*_.length-1;0<=n;n--){const i=(e<<15|_.__halfDigit(n))>>>0;e=0|i%t}return e}static __absoluteDivLarge(i,_,t,e){const g=_.__halfDigitLength(),n=_.length,s=i.__halfDigitLength()-g;let l=null;t&&(l=new o(s+2>>>1,!1),l.__initializeDigits());const r=new o(g+2>>>1,!1);r.__initializeDigits();const a=o.__clz15(_.__halfDigit(g-1));0<a&&(_=o.__specialLeftShift(_,a,0));const d=o.__specialLeftShift(i,a,1),u=_.__halfDigit(g-1);let h=0;for(let a,m=s;0<=m;m--){a=32767;const i=d.__halfDigit(m+g);if(i!==u){const t=(i<<15|d.__halfDigit(m+g-1))>>>0;a=0|t/u;let e=0|t%u;const n=_.__halfDigit(g-2),s=d.__halfDigit(m+g-2);for(;o.__imul(a,n)>>>0>(e<<16|s)>>>0&&(a--,e+=u,!(32767<e)););}o.__internalMultiplyAdd(_,a,0,n,r);let e=d.__inplaceSub(r,m,g+1);0!==e&&(e=d.__inplaceAdd(_,m,g),d.__setHalfDigit(m+g,32767&d.__halfDigit(m+g)+e),a--),t&&(1&m?h=a<<15:l.__setDigit(m>>>1,h|a))}if(e)return d.__inplaceRightShift(a),t?{quotient:l,remainder:d}:d;if(t)return l;throw new Error(\"unreachable\")}static __clz15(i){return o.__clz30(i)-15}__inplaceAdd(_,t,e){let n=0;for(let g=0;g<e;g++){const i=this.__halfDigit(t+g)+_.__halfDigit(g)+n;n=i>>>15,this.__setHalfDigit(t+g,32767&i)}return n}__inplaceSub(_,t,e){let n=0;if(1&t){t>>=1;let g=this.__digit(t),o=32767&g,s=0;for(;s<e-1>>>1;s++){const i=_.__digit(s),e=(g>>>15)-(32767&i)-n;n=1&e>>>15,this.__setDigit(t+s,(32767&e)<<15|32767&o),g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15}const i=_.__digit(s),l=(g>>>15)-(32767&i)-n;n=1&l>>>15,this.__setDigit(t+s,(32767&l)<<15|32767&o);if(t+s+1>=this.length)throw new RangeError(\"out of bounds\");0==(1&e)&&(g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15,this.__setDigit(t+_.length,1073709056&g|32767&o))}else{t>>=1;let g=0;for(;g<_.length-1;g++){const i=this.__digit(t+g),e=_.__digit(g),o=(32767&i)-(32767&e)-n;n=1&o>>>15;const s=(i>>>15)-(e>>>15)-n;n=1&s>>>15,this.__setDigit(t+g,(32767&s)<<15|32767&o)}const i=this.__digit(t+g),o=_.__digit(g),s=(32767&i)-(32767&o)-n;n=1&s>>>15;let l=0;0==(1&e)&&(l=(i>>>15)-(o>>>15)-n,n=1&l>>>15),this.__setDigit(t+g,(32767&l)<<15|32767&s)}return n}__inplaceRightShift(_){if(0===_)return;let t=this.__digit(0)>>>_;const e=this.length-1;for(let n=0;n<e;n++){const i=this.__digit(n+1);this.__setDigit(n,1073741823&i<<30-_|t),t=i>>>_}this.__setDigit(e,t)}static __specialLeftShift(_,t,e){const g=_.length,n=new o(g+e,!1);if(0===t){for(let t=0;t<g;t++)n.__setDigit(t,_.__digit(t));return 0<e&&n.__setDigit(g,0),n}let s=0;for(let o=0;o<g;o++){const i=_.__digit(o);n.__setDigit(o,1073741823&i<<t|s),s=i>>>30-t}return 0<e&&n.__setDigit(g,s),n}static __leftShiftByAbsolute(_,i){const t=o.__toShiftAmount(i);if(0>t)throw new RangeError(\"BigInt too big\");const e=0|t/30,n=t%30,g=_.length,s=0!==n&&0!=_.__digit(g-1)>>>30-n,l=g+e+(s?1:0),r=new o(l,_.sign);if(0===n){let t=0;for(;t<e;t++)r.__setDigit(t,0);for(;t<l;t++)r.__setDigit(t,_.__digit(t-e))}else{let t=0;for(let _=0;_<e;_++)r.__setDigit(_,0);for(let o=0;o<g;o++){const i=_.__digit(o);r.__setDigit(o+e,1073741823&i<<n|t),t=i>>>30-n}if(s)r.__setDigit(g+e,t);else if(0!==t)throw new Error(\"implementation bug\")}return r.__trim()}static __rightShiftByAbsolute(_,i){const t=_.length,e=_.sign,n=o.__toShiftAmount(i);if(0>n)return o.__rightShiftByMaximum(e);const g=0|n/30,s=n%30;let l=t-g;if(0>=l)return o.__rightShiftByMaximum(e);let r=!1;if(e){if(0!=(_.__digit(g)&(1<<s)-1))r=!0;else for(let t=0;t<g;t++)if(0!==_.__digit(t)){r=!0;break}}if(r&&0===s){const i=_.__digit(t-1);0==~i&&l++}let a=new o(l,e);if(0===s){a.__setDigit(l-1,0);for(let e=g;e<t;e++)a.__setDigit(e-g,_.__digit(e))}else{let e=_.__digit(g)>>>s;const n=t-g-1;for(let t=0;t<n;t++){const i=_.__digit(t+g+1);a.__setDigit(t,1073741823&i<<30-s|e),e=i>>>s}a.__setDigit(n,e)}return r&&(a=o.__absoluteAddOne(a,!0,a)),a.__trim()}static __rightShiftByMaximum(i){return i?o.__oneDigit(1,!0):o.__zero()}static __toShiftAmount(i){if(1<i.length)return-1;const _=i.__unsignedDigit(0);return _>o.__kMaxLengthBits?-1:_}static __toPrimitive(i,_=\"default\"){if(\"object\"!=typeof i)return i;if(i.constructor===o)return i;if(\"undefined\"!=typeof Symbol&&\"symbol\"==typeof Symbol.toPrimitive){const t=i[Symbol.toPrimitive];if(t){const i=t(_);if(\"object\"!=typeof i)return i;throw new TypeError(\"Cannot convert object to primitive value\")}}const t=i.valueOf;if(t){const _=t.call(i);if(\"object\"!=typeof _)return _}const e=i.toString;if(e){const _=e.call(i);if(\"object\"!=typeof _)return _}throw new TypeError(\"Cannot convert object to primitive value\")}static __toNumeric(i){return o.__isBigInt(i)?i:+i}static __isBigInt(i){return\"object\"==typeof i&&null!==i&&i.constructor===o}static __truncateToNBits(i,_){const t=0|(i+29)/30,e=new o(t,_.sign),n=t-1;for(let t=0;t<n;t++)e.__setDigit(t,_.__digit(t));let g=_.__digit(n);if(0!=i%30){const _=32-i%30;g=g<<_>>>_}return e.__setDigit(n,g),e.__trim()}static __truncateAndSubFromPowerOfTwo(_,t,e){var n=Math.min;const g=0|(_+29)/30,s=new o(g,e);let l=0;const r=g-1;let a=0;for(const i=n(r,t.length);l<i;l++){const i=0-t.__digit(l)-a;a=1&i>>>30,s.__setDigit(l,1073741823&i)}for(;l<r;l++)s.__setDigit(l,0|1073741823&-a);let u=r<t.length?t.__digit(r):0;const d=_%30;let h;if(0==d)h=0-u-a,h&=1073741823;else{const i=32-d;u=u<<i>>>i;const _=1<<32-i;h=_-u-a,h&=_-1}return s.__setDigit(r,h),s.__trim()}__digit(_){return this[_]}__unsignedDigit(_){return this[_]>>>0}__setDigit(_,i){this[_]=0|i}__setDigitGrow(_,i){this[_]=0|i}__halfDigitLength(){const i=this.length;return 32767>=this.__unsignedDigit(i-1)?2*i-1:2*i}__halfDigit(_){return 32767&this[_>>>1]>>>15*(1&_)}__setHalfDigit(_,i){const t=_>>>1,e=this.__digit(t),n=1&_?32767&e|i<<15:1073709056&e|32767&i;this.__setDigit(t,n)}static __digitPow(i,_){let t=1;for(;0<_;)1&_&&(t*=i),_>>>=1,i*=i;return t}static __isOneDigitInt(i){return(1073741823&i)===i}}return o.__kMaxLength=33554432,o.__kMaxLengthBits=o.__kMaxLength<<5,o.__kMaxBitsPerChar=[0,0,32,51,64,75,83,90,96,102,107,111,115,119,122,126,128,131,134,136,139,141,143,145,147,149,151,153,154,156,158,159,160,162,163,165,166],o.__kBitsPerCharTableShift=5,o.__kBitsPerCharTableMultiplier=1<<o.__kBitsPerCharTableShift,o.__kConversionChars=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"],o.__kBitConversionBuffer=new ArrayBuffer(8),o.__kBitConversionDouble=new Float64Array(o.__kBitConversionBuffer),o.__kBitConversionInts=new Int32Array(o.__kBitConversionBuffer),o.__clz30=_?function(i){return _(i)-2}:function(i){var _=Math.LN2,t=Math.log;return 0===i?30:0|29-(0|t(i>>>0)/_)},o.__imul=i||function(i,_){return 0|i*_},o});\n//# sourceMappingURL=jsbi-umd.js.map\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        result = wait - timeSinceLastCall;\n\n    return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = debounce;\n","\"use strict\";\nmodule.exports = function() {\n    return Object.assign;\n};\n\n//# sourceMappingURL=polyfill.js.map","\n    (window.__NEXT_P = window.__NEXT_P || []).push([\n      \"/_app\",\n      function () {\n        return require(\"private-next-pages/_app.tsx\");\n      }\n    ]);\n    if(module.hot) {\n      module.hot.dispose(function () {\n        window.__NEXT_P.push([\"/_app\"])\n      });\n    }\n  ","const isBrowser = typeof document !== \"undefined\";\n\nexport { isBrowser };\n","import { useLayoutEffect, useEffect } from 'react';\nimport { isBrowser } from './is-browser.mjs';\n\nconst useIsomorphicLayoutEffect = isBrowser ? useLayoutEffect : useEffect;\n\nexport { useIsomorphicLayoutEffect };\n","import { useRef } from 'react';\nimport { useIsomorphicLayoutEffect } from './use-isomorphic-effect.mjs';\n\nfunction useIsMounted() {\n    const isMounted = useRef(false);\n    useIsomorphicLayoutEffect(() => {\n        isMounted.current = true;\n        return () => {\n            isMounted.current = false;\n        };\n    }, []);\n    return isMounted;\n}\n\nexport { useIsMounted };\n","const noop = (any) => any;\n\nexport { noop };\n","const MotionGlobalConfig = {\n    skipAnimations: false,\n    useManualTiming: false,\n};\n\nexport { MotionGlobalConfig };\n","class Queue {\n    constructor() {\n        this.order = [];\n        this.scheduled = new Set();\n    }\n    add(process) {\n        if (!this.scheduled.has(process)) {\n            this.scheduled.add(process);\n            this.order.push(process);\n            return true;\n        }\n    }\n    remove(process) {\n        const index = this.order.indexOf(process);\n        if (index !== -1) {\n            this.order.splice(index, 1);\n            this.scheduled.delete(process);\n        }\n    }\n    clear() {\n        this.order.length = 0;\n        this.scheduled.clear();\n    }\n}\nfunction createRenderStep(runNextFrame) {\n    /**\n     * We create and reuse two queues, one to queue jobs for the current frame\n     * and one for the next. We reuse to avoid triggering GC after x frames.\n     */\n    let thisFrame = new Queue();\n    let nextFrame = new Queue();\n    let numToRun = 0;\n    /**\n     * Track whether we're currently processing jobs in this step. This way\n     * we can decide whether to schedule new jobs for this frame or next.\n     */\n    let isProcessing = false;\n    let flushNextFrame = false;\n    /**\n     * A set of processes which were marked keepAlive when scheduled.\n     */\n    const toKeepAlive = new WeakSet();\n    const step = {\n        /**\n         * Schedule a process to run on the next frame.\n         */\n        schedule: (callback, keepAlive = false, immediate = false) => {\n            const addToCurrentFrame = immediate && isProcessing;\n            const queue = addToCurrentFrame ? thisFrame : nextFrame;\n            if (keepAlive)\n                toKeepAlive.add(callback);\n            if (queue.add(callback) && addToCurrentFrame && isProcessing) {\n                // If we're adding it to the currently running queue, update its measured size\n                numToRun = thisFrame.order.length;\n            }\n            return callback;\n        },\n        /**\n         * Cancel the provided callback from running on the next frame.\n         */\n        cancel: (callback) => {\n            nextFrame.remove(callback);\n            toKeepAlive.delete(callback);\n        },\n        /**\n         * Execute all schedule callbacks.\n         */\n        process: (frameData) => {\n            /**\n             * If we're already processing we've probably been triggered by a flushSync\n             * inside an existing process. Instead of executing, mark flushNextFrame\n             * as true and ensure we flush the following frame at the end of this one.\n             */\n            if (isProcessing) {\n                flushNextFrame = true;\n                return;\n            }\n            isProcessing = true;\n            [thisFrame, nextFrame] = [nextFrame, thisFrame];\n            // Clear the next frame queue\n            nextFrame.clear();\n            // Execute this frame\n            numToRun = thisFrame.order.length;\n            if (numToRun) {\n                for (let i = 0; i < numToRun; i++) {\n                    const callback = thisFrame.order[i];\n                    if (toKeepAlive.has(callback)) {\n                        step.schedule(callback);\n                        runNextFrame();\n                    }\n                    callback(frameData);\n                }\n            }\n            isProcessing = false;\n            if (flushNextFrame) {\n                flushNextFrame = false;\n                step.process(frameData);\n            }\n        },\n    };\n    return step;\n}\n\nexport { createRenderStep };\n","import { MotionGlobalConfig } from '../utils/GlobalConfig.mjs';\nimport { createRenderStep } from './render-step.mjs';\n\nconst stepsOrder = [\n    \"read\", // Read\n    \"resolveKeyframes\", // Write/Read/Write/Read\n    \"update\", // Compute\n    \"preRender\", // Compute\n    \"render\", // Write\n    \"postRender\", // Compute\n];\nconst maxElapsed = 40;\nfunction createRenderBatcher(scheduleNextBatch, allowKeepAlive) {\n    let runNextFrame = false;\n    let useDefaultElapsed = true;\n    const state = {\n        delta: 0,\n        timestamp: 0,\n        isProcessing: false,\n    };\n    const steps = stepsOrder.reduce((acc, key) => {\n        acc[key] = createRenderStep(() => (runNextFrame = true));\n        return acc;\n    }, {});\n    const processStep = (stepId) => {\n        steps[stepId].process(state);\n    };\n    const processBatch = () => {\n        const timestamp = MotionGlobalConfig.useManualTiming\n            ? state.timestamp\n            : performance.now();\n        runNextFrame = false;\n        state.delta = useDefaultElapsed\n            ? 1000 / 60\n            : Math.max(Math.min(timestamp - state.timestamp, maxElapsed), 1);\n        state.timestamp = timestamp;\n        state.isProcessing = true;\n        stepsOrder.forEach(processStep);\n        state.isProcessing = false;\n        if (runNextFrame && allowKeepAlive) {\n            useDefaultElapsed = false;\n            scheduleNextBatch(processBatch);\n        }\n    };\n    const wake = () => {\n        runNextFrame = true;\n        useDefaultElapsed = true;\n        if (!state.isProcessing) {\n            scheduleNextBatch(processBatch);\n        }\n    };\n    const schedule = stepsOrder.reduce((acc, key) => {\n        const step = steps[key];\n        acc[key] = (process, keepAlive = false, immediate = false) => {\n            if (!runNextFrame)\n                wake();\n            return step.schedule(process, keepAlive, immediate);\n        };\n        return acc;\n    }, {});\n    const cancel = (process) => stepsOrder.forEach((key) => steps[key].cancel(process));\n    return { schedule, cancel, state, steps };\n}\n\nexport { createRenderBatcher, stepsOrder };\n","import { noop } from '../utils/noop.mjs';\nimport { createRenderBatcher } from './batcher.mjs';\n\nconst { schedule: frame, cancel: cancelFrame, state: frameData, steps, } = createRenderBatcher(typeof requestAnimationFrame !== \"undefined\" ? requestAnimationFrame : noop, true);\n\nexport { cancelFrame, frame, frameData, steps };\n","import { useState, useCallback } from 'react';\nimport { useIsMounted } from './use-is-mounted.mjs';\nimport { frame } from '../frameloop/frame.mjs';\n\nfunction useForceUpdate() {\n    const isMounted = useIsMounted();\n    const [forcedRenderCount, setForcedRenderCount] = useState(0);\n    const forceRender = useCallback(() => {\n        isMounted.current && setForcedRenderCount(forcedRenderCount + 1);\n    }, [forcedRenderCount]);\n    /**\n     * Defer this to the end of the next animation frame in case there are multiple\n     * synchronous calls.\n     */\n    const deferredForceRender = useCallback(() => frame.postRender(forceRender), [forceRender]);\n    return [deferredForceRender, forcedRenderCount];\n}\n\nexport { useForceUpdate };\n","import { createContext } from 'react';\n\n/**\n * @public\n */\nconst PresenceContext = createContext(null);\n\nexport { PresenceContext };\n","import { useRef } from 'react';\n\n/**\n * Creates a constant value over the lifecycle of a component.\n *\n * Even if `useMemo` is provided an empty array as its final argument, it doesn't offer\n * a guarantee that it won't re-run for performance reasons later on. By using `useConstant`\n * you can ensure that initialisers don't execute twice or more.\n */\nfunction useConstant(init) {\n    const ref = useRef(null);\n    if (ref.current === null) {\n        ref.current = init();\n    }\n    return ref.current;\n}\n\nexport { useConstant };\n","import { createContext } from 'react';\n\n/**\n * @public\n */\nconst MotionConfigContext = createContext({\n    transformPagePoint: (p) => p,\n    isStatic: false,\n    reducedMotion: \"never\",\n});\n\nexport { MotionConfigContext };\n","import { jsx } from 'react/jsx-runtime';\nimport * as React from 'react';\nimport { useId, useRef, useContext, useInsertionEffect } from 'react';\nimport { MotionConfigContext } from '../../context/MotionConfigContext.mjs';\n\n/**\n * Measurement functionality has to be within a separate component\n * to leverage snapshot lifecycle.\n */\nclass PopChildMeasure extends React.Component {\n    getSnapshotBeforeUpdate(prevProps) {\n        const element = this.props.childRef.current;\n        if (element && prevProps.isPresent && !this.props.isPresent) {\n            const size = this.props.sizeRef.current;\n            size.height = element.offsetHeight || 0;\n            size.width = element.offsetWidth || 0;\n            size.top = element.offsetTop;\n            size.left = element.offsetLeft;\n        }\n        return null;\n    }\n    /**\n     * Required with getSnapshotBeforeUpdate to stop React complaining.\n     */\n    componentDidUpdate() { }\n    render() {\n        return this.props.children;\n    }\n}\nfunction PopChild({ children, isPresent }) {\n    const id = useId();\n    const ref = useRef(null);\n    const size = useRef({\n        width: 0,\n        height: 0,\n        top: 0,\n        left: 0,\n    });\n    const { nonce } = useContext(MotionConfigContext);\n    /**\n     * We create and inject a style block so we can apply this explicit\n     * sizing in a non-destructive manner by just deleting the style block.\n     *\n     * We can't apply size via render as the measurement happens\n     * in getSnapshotBeforeUpdate (post-render), likewise if we apply the\n     * styles directly on the DOM node, we might be overwriting\n     * styles set via the style prop.\n     */\n    useInsertionEffect(() => {\n        const { width, height, top, left } = size.current;\n        if (isPresent || !ref.current || !width || !height)\n            return;\n        ref.current.dataset.motionPopId = id;\n        const style = document.createElement(\"style\");\n        if (nonce)\n            style.nonce = nonce;\n        document.head.appendChild(style);\n        if (style.sheet) {\n            style.sheet.insertRule(`\n          [data-motion-pop-id=\"${id}\"] {\n            position: absolute !important;\n            width: ${width}px !important;\n            height: ${height}px !important;\n            top: ${top}px !important;\n            left: ${left}px !important;\n          }\n        `);\n        }\n        return () => {\n            document.head.removeChild(style);\n        };\n    }, [isPresent]);\n    return (jsx(PopChildMeasure, { isPresent: isPresent, childRef: ref, sizeRef: size, children: React.cloneElement(children, { ref }) }));\n}\n\nexport { PopChild };\n","import { jsx } from 'react/jsx-runtime';\nimport * as React from 'react';\nimport { useId, useMemo } from 'react';\nimport { PresenceContext } from '../../context/PresenceContext.mjs';\nimport { useConstant } from '../../utils/use-constant.mjs';\nimport { PopChild } from './PopChild.mjs';\n\nconst PresenceChild = ({ children, initial, isPresent, onExitComplete, custom, presenceAffectsLayout, mode, }) => {\n    const presenceChildren = useConstant(newChildrenMap);\n    const id = useId();\n    const context = useMemo(() => ({\n        id,\n        initial,\n        isPresent,\n        custom,\n        onExitComplete: (childId) => {\n            presenceChildren.set(childId, true);\n            for (const isComplete of presenceChildren.values()) {\n                if (!isComplete)\n                    return; // can stop searching when any is incomplete\n            }\n            onExitComplete && onExitComplete();\n        },\n        register: (childId) => {\n            presenceChildren.set(childId, false);\n            return () => presenceChildren.delete(childId);\n        },\n    }), \n    /**\n     * If the presence of a child affects the layout of the components around it,\n     * we want to make a new context value to ensure they get re-rendered\n     * so they can detect that layout change.\n     */\n    presenceAffectsLayout ? [Math.random()] : [isPresent]);\n    useMemo(() => {\n        presenceChildren.forEach((_, key) => presenceChildren.set(key, false));\n    }, [isPresent]);\n    /**\n     * If there's no `motion` components to fire exit animations, we want to remove this\n     * component immediately.\n     */\n    React.useEffect(() => {\n        !isPresent &&\n            !presenceChildren.size &&\n            onExitComplete &&\n            onExitComplete();\n    }, [isPresent]);\n    if (mode === \"popLayout\") {\n        children = jsx(PopChild, { isPresent: isPresent, children: children });\n    }\n    return (jsx(PresenceContext.Provider, { value: context, children: children }));\n};\nfunction newChildrenMap() {\n    return new Map();\n}\n\nexport { PresenceChild };\n","import { createContext } from 'react';\n\nconst LayoutGroupContext = createContext({});\n\nexport { LayoutGroupContext };\n","import { useEffect } from 'react';\n\nfunction useUnmountEffect(callback) {\n    return useEffect(() => () => callback(), []);\n}\n\nexport { useUnmountEffect };\n","import { noop } from './noop.mjs';\n\nlet warning = noop;\nlet invariant = noop;\nif (process.env.NODE_ENV !== \"production\") {\n    warning = (check, message) => {\n        if (!check && typeof console !== \"undefined\") {\n            console.warn(message);\n        }\n    };\n    invariant = (check, message) => {\n        if (!check) {\n            throw new Error(message);\n        }\n    };\n}\n\nexport { invariant, warning };\n","import { jsx, Fragment } from 'react/jsx-runtime';\nimport { useContext, useRef, cloneElement, Children, isValidElement } from 'react';\nimport { useForceUpdate } from '../../utils/use-force-update.mjs';\nimport { useIsMounted } from '../../utils/use-is-mounted.mjs';\nimport { PresenceChild } from './PresenceChild.mjs';\nimport { LayoutGroupContext } from '../../context/LayoutGroupContext.mjs';\nimport { useIsomorphicLayoutEffect } from '../../utils/use-isomorphic-effect.mjs';\nimport { useUnmountEffect } from '../../utils/use-unmount-effect.mjs';\nimport { invariant } from '../../utils/errors.mjs';\n\nconst getChildKey = (child) => child.key || \"\";\nfunction updateChildLookup(children, allChildren) {\n    children.forEach((child) => {\n        const key = getChildKey(child);\n        allChildren.set(key, child);\n    });\n}\nfunction onlyElements(children) {\n    const filtered = [];\n    // We use forEach here instead of map as map mutates the component key by preprending `.$`\n    Children.forEach(children, (child) => {\n        if (isValidElement(child))\n            filtered.push(child);\n    });\n    return filtered;\n}\n/**\n * `AnimatePresence` enables the animation of components that have been removed from the tree.\n *\n * When adding/removing more than a single child, every child **must** be given a unique `key` prop.\n *\n * Any `motion` components that have an `exit` property defined will animate out when removed from\n * the tree.\n *\n * ```jsx\n * import { motion, AnimatePresence } from 'framer-motion'\n *\n * export const Items = ({ items }) => (\n *   <AnimatePresence>\n *     {items.map(item => (\n *       <motion.div\n *         key={item.id}\n *         initial={{ opacity: 0 }}\n *         animate={{ opacity: 1 }}\n *         exit={{ opacity: 0 }}\n *       />\n *     ))}\n *   </AnimatePresence>\n * )\n * ```\n *\n * You can sequence exit animations throughout a tree using variants.\n *\n * If a child contains multiple `motion` components with `exit` props, it will only unmount the child\n * once all `motion` components have finished animating out. Likewise, any components using\n * `usePresence` all need to call `safeToRemove`.\n *\n * @public\n */\nconst AnimatePresence = ({ children, custom, initial = true, onExitComplete, exitBeforeEnter, presenceAffectsLayout = true, mode = \"sync\", }) => {\n    invariant(!exitBeforeEnter, \"Replace exitBeforeEnter with mode='wait'\");\n    // We want to force a re-render once all exiting animations have finished. We\n    // either use a local forceRender function, or one from a parent context if it exists.\n    const forceRender = useContext(LayoutGroupContext).forceRender || useForceUpdate()[0];\n    const isMounted = useIsMounted();\n    // Filter out any children that aren't ReactElements. We can only track ReactElements with a props.key\n    const filteredChildren = onlyElements(children);\n    let childrenToRender = filteredChildren;\n    const exitingChildren = useRef(new Map()).current;\n    // Keep a living record of the children we're actually rendering so we\n    // can diff to figure out which are entering and exiting\n    const presentChildren = useRef(childrenToRender);\n    // A lookup table to quickly reference components by key\n    const allChildren = useRef(new Map()).current;\n    // If this is the initial component render, just deal with logic surrounding whether\n    // we play onMount animations or not.\n    const isInitialRender = useRef(true);\n    useIsomorphicLayoutEffect(() => {\n        isInitialRender.current = false;\n        updateChildLookup(filteredChildren, allChildren);\n        presentChildren.current = childrenToRender;\n    });\n    useUnmountEffect(() => {\n        isInitialRender.current = true;\n        allChildren.clear();\n        exitingChildren.clear();\n    });\n    if (isInitialRender.current) {\n        return (jsx(Fragment, { children: childrenToRender.map((child) => (jsx(PresenceChild, { isPresent: true, initial: initial ? undefined : false, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)))) }));\n    }\n    // If this is a subsequent render, deal with entering and exiting children\n    childrenToRender = [...childrenToRender];\n    // Diff the keys of the currently-present and target children to update our\n    // exiting list.\n    const presentKeys = presentChildren.current.map(getChildKey);\n    const targetKeys = filteredChildren.map(getChildKey);\n    // Diff the present children with our target children and mark those that are exiting\n    const numPresent = presentKeys.length;\n    for (let i = 0; i < numPresent; i++) {\n        const key = presentKeys[i];\n        if (targetKeys.indexOf(key) === -1 && !exitingChildren.has(key)) {\n            exitingChildren.set(key, undefined);\n        }\n    }\n    // If we currently have exiting children, and we're deferring rendering incoming children\n    // until after all current children have exiting, empty the childrenToRender array\n    if (mode === \"wait\" && exitingChildren.size) {\n        childrenToRender = [];\n    }\n    // Loop through all currently exiting components and clone them to overwrite `animate`\n    // with any `exit` prop they might have defined.\n    exitingChildren.forEach((component, key) => {\n        // If this component is actually entering again, early return\n        if (targetKeys.indexOf(key) !== -1)\n            return;\n        const child = allChildren.get(key);\n        if (!child)\n            return;\n        const insertionIndex = presentKeys.indexOf(key);\n        let exitingComponent = component;\n        if (!exitingComponent) {\n            const onExit = () => {\n                // clean up the exiting children map\n                exitingChildren.delete(key);\n                // compute the keys of children that were rendered once but are no longer present\n                // this could happen in case of too many fast consequent renderings\n                // @link https://github.com/framer/motion/issues/2023\n                const leftOverKeys = Array.from(allChildren.keys()).filter((childKey) => !targetKeys.includes(childKey));\n                // clean up the all children map\n                leftOverKeys.forEach((leftOverKey) => allChildren.delete(leftOverKey));\n                // make sure to render only the children that are actually visible\n                presentChildren.current = filteredChildren.filter((presentChild) => {\n                    const presentChildKey = getChildKey(presentChild);\n                    return (\n                    // filter out the node exiting\n                    presentChildKey === key ||\n                        // filter out the leftover children\n                        leftOverKeys.includes(presentChildKey));\n                });\n                // Defer re-rendering until all exiting children have indeed left\n                if (!exitingChildren.size) {\n                    if (isMounted.current === false)\n                        return;\n                    forceRender();\n                    onExitComplete && onExitComplete();\n                }\n            };\n            exitingComponent = (jsx(PresenceChild, { isPresent: false, onExitComplete: onExit, custom: custom, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)));\n            exitingChildren.set(key, exitingComponent);\n        }\n        childrenToRender.splice(insertionIndex, 0, exitingComponent);\n    });\n    // Add `MotionContext` even to children that don't need it to ensure we're rendering\n    // the same tree between renders\n    childrenToRender = childrenToRender.map((child) => {\n        const key = child.key;\n        return exitingChildren.has(key) ? (child) : (jsx(PresenceChild, { isPresent: true, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)));\n    });\n    if (process.env.NODE_ENV !== \"production\" &&\n        mode === \"wait\" &&\n        childrenToRender.length > 1) {\n        console.warn(`You're attempting to animate multiple children within AnimatePresence, but its mode is set to \"wait\". This will lead to odd visual behaviour.`);\n    }\n    return (jsx(Fragment, { children: exitingChildren.size\n            ? childrenToRender\n            : childrenToRender.map((child) => cloneElement(child)) }));\n};\n\nexport { AnimatePresence };\n","import { useState, useCallback, useLayoutEffect, useEffect, useRef, useMemo, useReducer } from 'react';\nimport debounce from 'lodash.debounce';\n\n// src/useBoolean/useBoolean.ts\nfunction useBoolean(defaultValue) {\n  const [value, setValue] = useState(!!defaultValue);\n  const setTrue = useCallback(() => {\n    setValue(true);\n  }, []);\n  const setFalse = useCallback(() => {\n    setValue(false);\n  }, []);\n  const toggle = useCallback(() => {\n    setValue((x) => !x);\n  }, []);\n  return { value, setValue, setTrue, setFalse, toggle };\n}\nvar useIsomorphicLayoutEffect = typeof window !== \"undefined\" ? useLayoutEffect : useEffect;\n\n// src/useEventListener/useEventListener.ts\nfunction useEventListener(eventName, handler, element, options) {\n  const savedHandler = useRef(handler);\n  useIsomorphicLayoutEffect(() => {\n    savedHandler.current = handler;\n  }, [handler]);\n  useEffect(() => {\n    const targetElement = (element == null ? void 0 : element.current) ?? window;\n    if (!(targetElement && targetElement.addEventListener))\n      return;\n    const listener = (event) => {\n      savedHandler.current(event);\n    };\n    targetElement.addEventListener(eventName, listener, options);\n    return () => {\n      targetElement.removeEventListener(eventName, listener, options);\n    };\n  }, [eventName, element, options]);\n}\n\n// src/useClickAnyWhere/useClickAnyWhere.ts\nfunction useClickAnyWhere(handler) {\n  useEventListener(\"click\", (event) => {\n    handler(event);\n  });\n}\nfunction useCopyToClipboard() {\n  const [copiedText, setCopiedText] = useState(null);\n  const copy = useCallback(async (text) => {\n    if (!(navigator == null ? void 0 : navigator.clipboard)) {\n      console.warn(\"Clipboard not supported\");\n      return false;\n    }\n    try {\n      await navigator.clipboard.writeText(text);\n      setCopiedText(text);\n      return true;\n    } catch (error) {\n      console.warn(\"Copy failed\", error);\n      setCopiedText(null);\n      return false;\n    }\n  }, []);\n  return [copiedText, copy];\n}\nfunction useCounter(initialValue) {\n  const [count, setCount] = useState(initialValue ?? 0);\n  const increment = () => {\n    setCount((x) => x + 1);\n  };\n  const decrement = () => {\n    setCount((x) => x - 1);\n  };\n  const reset = () => {\n    setCount(initialValue ?? 0);\n  };\n  return {\n    count,\n    increment,\n    decrement,\n    reset,\n    setCount\n  };\n}\nfunction useInterval(callback, delay) {\n  const savedCallback = useRef(callback);\n  useIsomorphicLayoutEffect(() => {\n    savedCallback.current = callback;\n  }, [callback]);\n  useEffect(() => {\n    if (delay === null) {\n      return;\n    }\n    const id = setInterval(() => {\n      savedCallback.current();\n    }, delay);\n    return () => {\n      clearInterval(id);\n    };\n  }, [delay]);\n}\n\n// src/useCountdown/useCountdown.ts\nfunction useCountdown(countdownOptions) {\n  let isDeprecated = false;\n  let countStart, intervalMs, isIncrement, countStop;\n  if (\"seconds\" in countdownOptions) {\n    console.warn(\n      \"[useCountdown:DEPRECATED] new interface is already available (see https://usehooks-ts.com/react-hook/use-countdown), the old version will retire on usehooks-ts@3.\"\n    );\n    isDeprecated = true;\n    countStart = countdownOptions.seconds;\n    intervalMs = countdownOptions.interval;\n    isIncrement = countdownOptions.isIncrement;\n  } else {\n    ({ countStart, intervalMs, isIncrement, countStop } = countdownOptions);\n  }\n  intervalMs = intervalMs ?? 1e3;\n  isIncrement = isIncrement ?? false;\n  countStop = countStop ?? 0;\n  const {\n    count,\n    increment,\n    decrement,\n    reset: resetCounter\n  } = useCounter(countStart);\n  const {\n    value: isCountdownRunning,\n    setTrue: startCountdown,\n    setFalse: stopCountdown\n  } = useBoolean(false);\n  const resetCountdown = () => {\n    stopCountdown();\n    resetCounter();\n  };\n  const countdownCallback = useCallback(() => {\n    if (count === countStop) {\n      stopCountdown();\n      return;\n    }\n    if (isIncrement) {\n      increment();\n    } else {\n      decrement();\n    }\n  }, [count, countStop, decrement, increment, isIncrement, stopCountdown]);\n  useInterval(countdownCallback, isCountdownRunning ? intervalMs : null);\n  return isDeprecated ? [\n    count,\n    {\n      start: startCountdown,\n      stop: stopCountdown,\n      reset: resetCountdown\n    }\n  ] : [\n    count,\n    {\n      startCountdown,\n      stopCountdown,\n      resetCountdown\n    }\n  ];\n}\nfunction useEventCallback(fn) {\n  const ref = useRef(() => {\n    throw new Error(\"Cannot call an event handler while rendering.\");\n  });\n  useIsomorphicLayoutEffect(() => {\n    ref.current = fn;\n  }, [fn]);\n  return useCallback((...args) => ref.current(...args), [ref]);\n}\n\n// src/useLocalStorage/useLocalStorage.ts\nvar IS_SERVER = typeof window === \"undefined\";\nfunction useLocalStorage(key, initialValue, options = {}) {\n  const { initializeWithValue = true } = options;\n  const serializer = useCallback(\n    (value) => {\n      if (options.serializer) {\n        return options.serializer(value);\n      }\n      return JSON.stringify(value);\n    },\n    [options]\n  );\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      const defaultValue = initialValue instanceof Function ? initialValue() : initialValue;\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return defaultValue;\n      }\n      return parsed;\n    },\n    [options, initialValue]\n  );\n  const readValue = useCallback(() => {\n    const initialValueToUse = initialValue instanceof Function ? initialValue() : initialValue;\n    if (IS_SERVER) {\n      return initialValueToUse;\n    }\n    try {\n      const raw = window.localStorage.getItem(key);\n      return raw ? deserializer(raw) : initialValueToUse;\n    } catch (error) {\n      console.warn(`Error reading localStorage key \\u201C${key}\\u201D:`, error);\n      return initialValueToUse;\n    }\n  }, [initialValue, key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return initialValue instanceof Function ? initialValue() : initialValue;\n  });\n  const setValue = useEventCallback((value) => {\n    if (IS_SERVER) {\n      console.warn(\n        `Tried setting localStorage key \\u201C${key}\\u201D even though environment is not a client`\n      );\n    }\n    try {\n      const newValue = value instanceof Function ? value(readValue()) : value;\n      window.localStorage.setItem(key, serializer(newValue));\n      setStoredValue(newValue);\n      window.dispatchEvent(new StorageEvent(\"local-storage\", { key }));\n    } catch (error) {\n      console.warn(`Error setting localStorage key \\u201C${key}\\u201D:`, error);\n    }\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"local-storage\", handleStorageChange);\n  return [storedValue, setValue];\n}\nvar IS_SERVER2 = typeof window === \"undefined\";\nfunction useMediaQuery(query, options) {\n  const defaultValue = typeof options === \"boolean\" ? options : (options == null ? void 0 : options.defaultValue) ?? false;\n  const initializeWithValue = typeof options === \"boolean\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const getMatches = (query2) => {\n    if (IS_SERVER2) {\n      return defaultValue;\n    }\n    return window.matchMedia(query2).matches;\n  };\n  const [matches, setMatches] = useState(() => {\n    if (initializeWithValue) {\n      return getMatches(query);\n    }\n    return defaultValue;\n  });\n  function handleChange() {\n    setMatches(getMatches(query));\n  }\n  useIsomorphicLayoutEffect(() => {\n    const matchMedia = window.matchMedia(query);\n    handleChange();\n    if (matchMedia.addListener) {\n      matchMedia.addListener(handleChange);\n    } else {\n      matchMedia.addEventListener(\"change\", handleChange);\n    }\n    return () => {\n      if (matchMedia.removeListener) {\n        matchMedia.removeListener(handleChange);\n      } else {\n        matchMedia.removeEventListener(\"change\", handleChange);\n      }\n    };\n  }, [query]);\n  return matches;\n}\n\n// src/useDarkMode/useDarkMode.ts\nvar COLOR_SCHEME_QUERY = \"(prefers-color-scheme: dark)\";\nvar LOCAL_STORAGE_KEY = \"usehooks-ts-dark-mode\";\nfunction useDarkMode(options, localStorageKeyProps = LOCAL_STORAGE_KEY) {\n  const counter = useRef(0);\n  counter.current++;\n  const defaultValue = typeof options === \"boolean\" ? options : options == null ? void 0 : options.defaultValue;\n  const localStorageKey = typeof options === \"boolean\" ? localStorageKeyProps ?? LOCAL_STORAGE_KEY : (options == null ? void 0 : options.localStorageKey) ?? LOCAL_STORAGE_KEY;\n  const initializeWithValue = typeof options === \"boolean\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const isDarkOS = useMediaQuery(COLOR_SCHEME_QUERY, {\n    initializeWithValue,\n    defaultValue\n  });\n  const [isDarkMode, setDarkMode] = useLocalStorage(\n    localStorageKey,\n    defaultValue ?? isDarkOS ?? false,\n    { initializeWithValue }\n  );\n  useIsomorphicLayoutEffect(() => {\n    if (isDarkOS !== isDarkMode) {\n      setDarkMode(isDarkOS);\n    }\n  }, [isDarkOS]);\n  return {\n    isDarkMode,\n    toggle: () => {\n      setDarkMode((prev) => !prev);\n    },\n    enable: () => {\n      setDarkMode(true);\n    },\n    disable: () => {\n      setDarkMode(false);\n    },\n    set: (value) => {\n      setDarkMode(value);\n    }\n  };\n}\nfunction useDebounce(value, delay) {\n  const [debouncedValue, setDebouncedValue] = useState(value);\n  useEffect(() => {\n    const timer = setTimeout(() => {\n      setDebouncedValue(value);\n    }, delay ?? 500);\n    return () => {\n      clearTimeout(timer);\n    };\n  }, [value, delay]);\n  return debouncedValue;\n}\nfunction useUnmount(func) {\n  const funcRef = useRef(func);\n  funcRef.current = func;\n  useEffect(\n    () => () => {\n      funcRef.current();\n    },\n    []\n  );\n}\n\n// src/useDebounceCallback/useDebounceCallback.ts\nfunction useDebounceCallback(func, delay = 500, options) {\n  const debouncedFunc = useRef();\n  useUnmount(() => {\n    if (debouncedFunc.current) {\n      debouncedFunc.current.cancel();\n    }\n  });\n  const debounced = useMemo(() => {\n    const debouncedFuncInstance = debounce(func, delay, options);\n    const wrappedFunc = (...args) => {\n      return debouncedFuncInstance(...args);\n    };\n    wrappedFunc.cancel = () => {\n      debouncedFuncInstance.cancel();\n    };\n    wrappedFunc.isPending = () => {\n      return !!debouncedFunc.current;\n    };\n    wrappedFunc.flush = () => {\n      return debouncedFuncInstance.flush();\n    };\n    return wrappedFunc;\n  }, [func, delay, options]);\n  useEffect(() => {\n    debouncedFunc.current = debounce(func, delay, options);\n  }, [func, delay, options]);\n  return debounced;\n}\nfunction useDebounceValue(initialValue, delay, options) {\n  const eq = (options == null ? void 0 : options.equalityFn) ?? ((left, right) => left === right);\n  const unwrappedInitialValue = initialValue instanceof Function ? initialValue() : initialValue;\n  const [debouncedValue, setDebouncedValue] = useState(unwrappedInitialValue);\n  const previousValueRef = useRef(unwrappedInitialValue);\n  const updateDebouncedValue = useDebounceCallback(\n    setDebouncedValue,\n    delay,\n    options\n  );\n  if (!eq(previousValueRef.current, unwrappedInitialValue)) {\n    updateDebouncedValue(unwrappedInitialValue);\n    previousValueRef.current = unwrappedInitialValue;\n  }\n  return [debouncedValue, updateDebouncedValue];\n}\nfunction useDocumentTitle(title, options = {}) {\n  const { preserveTitleOnUnmount = true } = options;\n  const defaultTitle = useRef(null);\n  useIsomorphicLayoutEffect(() => {\n    defaultTitle.current = window.document.title;\n  }, []);\n  useIsomorphicLayoutEffect(() => {\n    window.document.title = title;\n  }, [title]);\n  useUnmount(() => {\n    if (!preserveTitleOnUnmount && defaultTitle.current) {\n      window.document.title = defaultTitle.current;\n    }\n  });\n}\nfunction useEffectOnce(effect) {\n  useEffect(effect, []);\n}\nfunction useElementSize(options = {}) {\n  const { initializeWithValue = true } = options;\n  const [ref, setRef] = useState(null);\n  const readValue = useCallback(() => {\n    return {\n      width: (ref == null ? void 0 : ref.offsetWidth) ?? void 0,\n      height: (ref == null ? void 0 : ref.offsetHeight) ?? void 0\n    };\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  const [size, setSize] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return { width: void 0, height: void 0 };\n  });\n  const handleSize = useCallback(() => {\n    setSize(readValue());\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  useEventListener(\"resize\", handleSize);\n  useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  const result = [setRef, size];\n  result.ref = result[0];\n  result.width = size.width;\n  result.height = size.height;\n  return result;\n}\nfunction useFetch(url, options) {\n  const cache = useRef({});\n  const cancelRequest = useRef(false);\n  const initialState = {\n    error: void 0,\n    data: void 0\n  };\n  const fetchReducer = (state2, action) => {\n    switch (action.type) {\n      case \"loading\":\n        return { ...initialState };\n      case \"fetched\":\n        return { ...initialState, data: action.payload };\n      case \"error\":\n        return { ...initialState, error: action.payload };\n      default:\n        return state2;\n    }\n  };\n  const [state, dispatch] = useReducer(fetchReducer, initialState);\n  useEffect(() => {\n    if (!url)\n      return;\n    cancelRequest.current = false;\n    const fetchData = async () => {\n      dispatch({ type: \"loading\" });\n      const currentCache = cache.current[url];\n      if (currentCache) {\n        dispatch({ type: \"fetched\", payload: currentCache });\n        return;\n      }\n      try {\n        const response = await fetch(url, options);\n        if (!response.ok) {\n          throw new Error(response.statusText);\n        }\n        const data = await response.json();\n        cache.current[url] = data;\n        if (cancelRequest.current)\n          return;\n        dispatch({ type: \"fetched\", payload: data });\n      } catch (error) {\n        if (cancelRequest.current)\n          return;\n        dispatch({ type: \"error\", payload: error });\n      }\n    };\n    void fetchData();\n    return () => {\n      cancelRequest.current = true;\n    };\n  }, [url]);\n  return state;\n}\nfunction useHover(elementRef) {\n  const [value, setValue] = useState(false);\n  const handleMouseEnter = () => {\n    setValue(true);\n  };\n  const handleMouseLeave = () => {\n    setValue(false);\n  };\n  useEventListener(\"mouseenter\", handleMouseEnter, elementRef);\n  useEventListener(\"mouseleave\", handleMouseLeave, elementRef);\n  return value;\n}\nfunction useImageOnLoad() {\n  const [isLoaded, setIsLoaded] = useState(false);\n  const handleImageOnLoad = () => {\n    setIsLoaded(true);\n  };\n  const css = {\n    // Thumbnail style.\n    thumbnail: {\n      visibility: isLoaded ? \"hidden\" : \"visible\",\n      filter: \"blur(8px)\",\n      transition: \"visibility 0ms ease-out 500ms\"\n    },\n    // Full image style.\n    fullSize: {\n      opacity: isLoaded ? 1 : 0,\n      transition: \"opacity 500ms ease-in 0ms\"\n    }\n  };\n  return { handleImageOnLoad, css };\n}\nfunction useIntersectionObserver(optionsOrLegacyRef, legacyOptions) {\n  var _a;\n  const isLegacySignature = \"current\" in optionsOrLegacyRef;\n  const options = isLegacySignature ? legacyOptions : optionsOrLegacyRef;\n  const {\n    threshold = 0,\n    root = null,\n    rootMargin = \"0%\",\n    freezeOnceVisible = false,\n    initialIsIntersecting = false\n  } = options ?? {};\n  const [newRef, setNewRef] = useState(null);\n  const ref = isLegacySignature ? optionsOrLegacyRef.current : newRef;\n  const [state, setState] = useState(() => ({\n    isIntersecting: initialIsIntersecting,\n    entry: void 0\n  }));\n  const callbackRef = useRef();\n  callbackRef.current = options == null ? void 0 : options.onChange;\n  const frozen = ((_a = state.entry) == null ? void 0 : _a.isIntersecting) && freezeOnceVisible;\n  useEffect(() => {\n    if (!ref)\n      return;\n    if (!(\"IntersectionObserver\" in window))\n      return;\n    if (frozen)\n      return;\n    let unobserve;\n    const observer = new IntersectionObserver(\n      (entries) => {\n        const thresholds = Array.isArray(observer.thresholds) ? observer.thresholds : [observer.thresholds];\n        entries.forEach((entry) => {\n          const isIntersecting = entry.isIntersecting && thresholds.some((threshold2) => entry.intersectionRatio >= threshold2);\n          setState({ isIntersecting, entry });\n          if (callbackRef.current) {\n            callbackRef.current(isIntersecting, entry);\n          }\n          if (isIntersecting && freezeOnceVisible && unobserve) {\n            unobserve();\n            unobserve = void 0;\n          }\n        });\n      },\n      { threshold, root, rootMargin }\n    );\n    observer.observe(ref);\n    return () => {\n      observer.disconnect();\n    };\n  }, [\n    ref,\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n    JSON.stringify(threshold),\n    root,\n    rootMargin,\n    frozen,\n    freezeOnceVisible\n  ]);\n  const prevRef = useRef(null);\n  useEffect(() => {\n    var _a2;\n    if (!ref && ((_a2 = state.entry) == null ? void 0 : _a2.target) && !freezeOnceVisible && !frozen && prevRef.current !== state.entry.target) {\n      prevRef.current = state.entry.target;\n      setState({ isIntersecting: initialIsIntersecting, entry: void 0 });\n    }\n  }, [ref, state.entry, freezeOnceVisible, frozen, initialIsIntersecting]);\n  if (isLegacySignature) {\n    return state.entry;\n  }\n  const result = [\n    setNewRef,\n    !!state.isIntersecting,\n    state.entry\n  ];\n  result.ref = result[0];\n  result.isIntersecting = result[1];\n  result.entry = result[2];\n  return result;\n}\nfunction useIsClient() {\n  const [isClient, setClient] = useState(false);\n  useEffect(() => {\n    setClient(true);\n  }, []);\n  return isClient;\n}\nfunction useIsFirstRender() {\n  const isFirst = useRef(true);\n  if (isFirst.current) {\n    isFirst.current = false;\n    return true;\n  }\n  return isFirst.current;\n}\nfunction useIsMounted() {\n  const isMounted = useRef(false);\n  useEffect(() => {\n    isMounted.current = true;\n    return () => {\n      isMounted.current = false;\n    };\n  }, []);\n  return useCallback(() => isMounted.current, []);\n}\nfunction useLockedBody(initialLocked = false, rootId = \"___gatsby\") {\n  const [locked, setLocked] = useState(initialLocked);\n  useIsomorphicLayoutEffect(() => {\n    if (!locked) {\n      return;\n    }\n    const originalOverflow = document.body.style.overflow;\n    const originalPaddingRight = document.body.style.paddingRight;\n    document.body.style.overflow = \"hidden\";\n    const root = document.getElementById(rootId);\n    const scrollBarWidth = root ? root.offsetWidth - root.scrollWidth : 0;\n    if (scrollBarWidth) {\n      document.body.style.paddingRight = `${scrollBarWidth}px`;\n    }\n    return () => {\n      document.body.style.overflow = originalOverflow;\n      if (scrollBarWidth) {\n        document.body.style.paddingRight = originalPaddingRight;\n      }\n    };\n  }, [locked]);\n  useEffect(() => {\n    if (locked !== initialLocked) {\n      setLocked(initialLocked);\n    }\n  }, [initialLocked]);\n  return [locked, setLocked];\n}\nfunction useMap(initialState = /* @__PURE__ */ new Map()) {\n  const [map, setMap] = useState(new Map(initialState));\n  const actions = {\n    set: useCallback((key, value) => {\n      setMap((prev) => {\n        const copy = new Map(prev);\n        copy.set(key, value);\n        return copy;\n      });\n    }, []),\n    setAll: useCallback((entries) => {\n      setMap(() => new Map(entries));\n    }, []),\n    remove: useCallback((key) => {\n      setMap((prev) => {\n        const copy = new Map(prev);\n        copy.delete(key);\n        return copy;\n      });\n    }, []),\n    reset: useCallback(() => {\n      setMap(() => /* @__PURE__ */ new Map());\n    }, [])\n  };\n  return [map, actions];\n}\n\n// src/useOnClickOutside/useOnClickOutside.ts\nfunction useOnClickOutside(ref, handler, eventType = \"mousedown\") {\n  useEventListener(eventType, (event) => {\n    const target = event.target;\n    if (!target || !target.isConnected) {\n      return;\n    }\n    const isOutside = Array.isArray(ref) ? ref.every((r) => r.current && !r.current.contains(target)) : ref.current && !ref.current.contains(target);\n    if (isOutside) {\n      handler(event);\n    }\n  });\n}\nvar IS_SERVER3 = typeof window === \"undefined\";\nfunction useReadLocalStorage(key, options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER3) {\n    initializeWithValue = false;\n  }\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return null;\n      }\n      return parsed;\n    },\n    [options]\n  );\n  const readValue = useCallback(() => {\n    if (IS_SERVER3) {\n      return null;\n    }\n    try {\n      const raw = window.localStorage.getItem(key);\n      return raw ? deserializer(raw) : null;\n    } catch (error) {\n      console.warn(`Error reading localStorage key \\u201C${key}\\u201D:`, error);\n      return null;\n    }\n  }, [key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return void 0;\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"local-storage\", handleStorageChange);\n  return storedValue;\n}\nvar initialSize = {\n  width: void 0,\n  height: void 0\n};\nfunction useResizeObserver(options) {\n  const { ref, box = \"content-box\" } = options;\n  const [{ width, height }, setSize] = useState(initialSize);\n  const isMounted = useIsMounted();\n  const previousSize = useRef({ ...initialSize });\n  const onResize = useRef(void 0);\n  onResize.current = options == null ? void 0 : options.onResize;\n  useEffect(() => {\n    if (!(ref == null ? void 0 : ref.current))\n      return;\n    if (typeof window === \"undefined\" || !(\"ResizeObserver\" in window))\n      return;\n    const observer = new ResizeObserver(([entry]) => {\n      const boxProp = box === \"border-box\" ? \"borderBoxSize\" : box === \"device-pixel-content-box\" ? \"devicePixelContentBoxSize\" : \"contentBoxSize\";\n      const newWidth = extractSize(entry, boxProp, \"inlineSize\");\n      const newHeight = extractSize(entry, boxProp, \"blockSize\");\n      const hasChanged = previousSize.current.width !== newWidth || previousSize.current.height !== newHeight;\n      if (hasChanged) {\n        const newSize = { width: newWidth, height: newHeight };\n        previousSize.current.width = newWidth;\n        previousSize.current.height = newHeight;\n        if (onResize == null ? void 0 : onResize.current) {\n          onResize.current(newSize);\n        } else {\n          if (isMounted()) {\n            setSize(newSize);\n          }\n        }\n      }\n    });\n    observer.observe(ref.current, { box });\n    return () => {\n      observer.disconnect();\n    };\n  }, [box, ref, isMounted]);\n  return { width, height };\n}\nfunction extractSize(entry, box, sizeType) {\n  if (!entry[box]) {\n    if (box === \"contentBoxSize\") {\n      return entry.contentRect[sizeType === \"inlineSize\" ? \"width\" : \"height\"];\n    }\n    return void 0;\n  }\n  return Array.isArray(entry[box]) ? entry[box][0][sizeType] : (\n    // @ts-ignore Support Firefox's non-standard behavior\n    entry[box][sizeType]\n  );\n}\nvar IS_SERVER4 = typeof window === \"undefined\";\nfunction useScreen(options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER4) {\n    initializeWithValue = false;\n  }\n  const readScreen = () => {\n    if (IS_SERVER4) {\n      return void 0;\n    }\n    return window.screen;\n  };\n  const [screen, setScreen] = useState(() => {\n    if (initializeWithValue) {\n      return readScreen();\n    }\n    return void 0;\n  });\n  const debouncedSetScreen = useDebounceCallback(\n    setScreen,\n    options == null ? void 0 : options.debounceDelay\n  );\n  function handleSize() {\n    const newScreen = readScreen();\n    const setSize = (options == null ? void 0 : options.debounceDelay) ? debouncedSetScreen : setScreen;\n    if (newScreen) {\n      const {\n        width,\n        height,\n        availHeight,\n        availWidth,\n        colorDepth,\n        orientation,\n        pixelDepth\n      } = newScreen;\n      setSize({\n        width,\n        height,\n        availHeight,\n        availWidth,\n        colorDepth,\n        orientation,\n        pixelDepth\n      });\n    }\n  }\n  useEventListener(\"resize\", handleSize);\n  useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, []);\n  return screen;\n}\nvar cachedScriptStatuses = /* @__PURE__ */ new Map();\nfunction getScriptNode(src) {\n  const node = document.querySelector(\n    `script[src=\"${src}\"]`\n  );\n  const status = node == null ? void 0 : node.getAttribute(\"data-status\");\n  return {\n    node,\n    status\n  };\n}\nfunction useScript(src, options) {\n  const [status, setStatus] = useState(() => {\n    if (!src || (options == null ? void 0 : options.shouldPreventLoad)) {\n      return \"idle\";\n    }\n    if (typeof window === \"undefined\") {\n      return \"loading\";\n    }\n    return cachedScriptStatuses.get(src) ?? \"loading\";\n  });\n  useEffect(() => {\n    if (!src || (options == null ? void 0 : options.shouldPreventLoad)) {\n      return;\n    }\n    const cachedScriptStatus = cachedScriptStatuses.get(src);\n    if (cachedScriptStatus === \"ready\" || cachedScriptStatus === \"error\") {\n      setStatus(cachedScriptStatus);\n      return;\n    }\n    const script = getScriptNode(src);\n    let scriptNode = script.node;\n    if (!scriptNode) {\n      scriptNode = document.createElement(\"script\");\n      scriptNode.src = src;\n      scriptNode.async = true;\n      if (options == null ? void 0 : options.id) {\n        scriptNode.id = options.id;\n      }\n      scriptNode.setAttribute(\"data-status\", \"loading\");\n      document.body.appendChild(scriptNode);\n      const setAttributeFromEvent = (event) => {\n        const scriptStatus = event.type === \"load\" ? \"ready\" : \"error\";\n        scriptNode == null ? void 0 : scriptNode.setAttribute(\"data-status\", scriptStatus);\n      };\n      scriptNode.addEventListener(\"load\", setAttributeFromEvent);\n      scriptNode.addEventListener(\"error\", setAttributeFromEvent);\n    } else {\n      setStatus(script.status ?? cachedScriptStatus ?? \"loading\");\n    }\n    const setStateFromEvent = (event) => {\n      const newStatus = event.type === \"load\" ? \"ready\" : \"error\";\n      setStatus(newStatus);\n      cachedScriptStatuses.set(src, newStatus);\n    };\n    scriptNode.addEventListener(\"load\", setStateFromEvent);\n    scriptNode.addEventListener(\"error\", setStateFromEvent);\n    return () => {\n      if (scriptNode) {\n        scriptNode.removeEventListener(\"load\", setStateFromEvent);\n        scriptNode.removeEventListener(\"error\", setStateFromEvent);\n      }\n      if (scriptNode && (options == null ? void 0 : options.removeOnUnmount)) {\n        scriptNode.remove();\n        cachedScriptStatuses.delete(src);\n      }\n    };\n  }, [src, options == null ? void 0 : options.shouldPreventLoad, options == null ? void 0 : options.removeOnUnmount, options == null ? void 0 : options.id]);\n  return status;\n}\nvar IS_SERVER5 = typeof window === \"undefined\";\nfunction useScrollLock(options = {}) {\n  const { autoLock = true, lockTarget, widthReflow = true } = options;\n  const [isLocked, setIsLocked] = useState(false);\n  const target = useRef(null);\n  const originalStyle = useRef(null);\n  const lock = () => {\n    if (target.current) {\n      const { overflow, paddingRight } = target.current.style;\n      originalStyle.current = { overflow, paddingRight };\n      if (widthReflow) {\n        const offsetWidth = target.current === document.body ? window.innerWidth : target.current.offsetWidth;\n        const currentPaddingRight = parseInt(window.getComputedStyle(target.current).paddingRight, 10) || 0;\n        const scrollbarWidth = offsetWidth - target.current.scrollWidth;\n        target.current.style.paddingRight = `${scrollbarWidth + currentPaddingRight}px`;\n      }\n      target.current.style.overflow = \"hidden\";\n      setIsLocked(true);\n    }\n  };\n  const unlock = () => {\n    if (target.current && originalStyle.current) {\n      target.current.style.overflow = originalStyle.current.overflow;\n      if (widthReflow) {\n        target.current.style.paddingRight = originalStyle.current.paddingRight;\n      }\n    }\n    setIsLocked(false);\n  };\n  useIsomorphicLayoutEffect(() => {\n    if (IS_SERVER5)\n      return;\n    if (lockTarget) {\n      target.current = typeof lockTarget === \"string\" ? document.querySelector(lockTarget) : lockTarget;\n    }\n    if (!target.current) {\n      target.current = document.body;\n    }\n    if (autoLock) {\n      lock();\n    }\n    return () => {\n      unlock();\n    };\n  }, [autoLock, lockTarget, widthReflow]);\n  return { isLocked, lock, unlock };\n}\nvar IS_SERVER6 = typeof window === \"undefined\";\nfunction useSessionStorage(key, initialValue, options = {}) {\n  const { initializeWithValue = true } = options;\n  const serializer = useCallback(\n    (value) => {\n      if (options.serializer) {\n        return options.serializer(value);\n      }\n      return JSON.stringify(value);\n    },\n    [options]\n  );\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      const defaultValue = initialValue instanceof Function ? initialValue() : initialValue;\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return defaultValue;\n      }\n      return parsed;\n    },\n    [options, initialValue]\n  );\n  const readValue = useCallback(() => {\n    const initialValueToUse = initialValue instanceof Function ? initialValue() : initialValue;\n    if (IS_SERVER6) {\n      return initialValueToUse;\n    }\n    try {\n      const raw = window.sessionStorage.getItem(key);\n      return raw ? deserializer(raw) : initialValueToUse;\n    } catch (error) {\n      console.warn(`Error reading sessionStorage key \\u201C${key}\\u201D:`, error);\n      return initialValueToUse;\n    }\n  }, [initialValue, key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return initialValue instanceof Function ? initialValue() : initialValue;\n  });\n  const setValue = useEventCallback((value) => {\n    if (IS_SERVER6) {\n      console.warn(\n        `Tried setting sessionStorage key \\u201C${key}\\u201D even though environment is not a client`\n      );\n    }\n    try {\n      const newValue = value instanceof Function ? value(readValue()) : value;\n      window.sessionStorage.setItem(key, serializer(newValue));\n      setStoredValue(newValue);\n      window.dispatchEvent(new StorageEvent(\"session-storage\", { key }));\n    } catch (error) {\n      console.warn(`Error setting sessionStorage key \\u201C${key}\\u201D:`, error);\n    }\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"session-storage\", handleStorageChange);\n  return [storedValue, setValue];\n}\n\n// src/useSsr/useSsr.ts\nfunction useSsr() {\n  var _a;\n  const isDOM = (\n    // eslint-disable-next-line @typescript-eslint/prefer-optional-chain\n    typeof window !== \"undefined\" && !!((_a = window == null ? void 0 : window.document) == null ? void 0 : _a.documentElement)\n  );\n  return {\n    isBrowser: isDOM,\n    isServer: !isDOM\n  };\n}\nfunction useStep(maxStep) {\n  const [currentStep, setCurrentStep] = useState(1);\n  const canGoToNextStep = currentStep + 1 <= maxStep;\n  const canGoToPrevStep = currentStep - 1 > 0;\n  const setStep = useCallback(\n    (step) => {\n      const newStep = step instanceof Function ? step(currentStep) : step;\n      if (newStep >= 1 && newStep <= maxStep) {\n        setCurrentStep(newStep);\n        return;\n      }\n      throw new Error(\"Step not valid\");\n    },\n    [maxStep, currentStep]\n  );\n  const goToNextStep = useCallback(() => {\n    if (canGoToNextStep) {\n      setCurrentStep((step) => step + 1);\n    }\n  }, [canGoToNextStep]);\n  const goToPrevStep = useCallback(() => {\n    if (canGoToPrevStep) {\n      setCurrentStep((step) => step - 1);\n    }\n  }, [canGoToPrevStep]);\n  const reset = useCallback(() => {\n    setCurrentStep(1);\n  }, []);\n  return [\n    currentStep,\n    {\n      goToNextStep,\n      goToPrevStep,\n      canGoToNextStep,\n      canGoToPrevStep,\n      setStep,\n      reset\n    }\n  ];\n}\n\n// src/useTernaryDarkMode/useTernaryDarkMode.ts\nvar COLOR_SCHEME_QUERY2 = \"(prefers-color-scheme: dark)\";\nvar LOCAL_STORAGE_KEY2 = \"usehooks-ts-ternary-dark-mode\";\nfunction useTernaryDarkMode(options) {\n  const defaultValue = typeof options === \"string\" ? \"system\" : (options == null ? void 0 : options.defaultValue) ?? \"system\";\n  const localStorageKey = typeof options === \"string\" ? options : (options == null ? void 0 : options.localStorageKey) ?? LOCAL_STORAGE_KEY2;\n  const initializeWithValue = typeof options === \"string\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const isDarkOS = useMediaQuery(COLOR_SCHEME_QUERY2, { initializeWithValue });\n  const [mode, setMode] = useLocalStorage(localStorageKey, defaultValue, {\n    initializeWithValue\n  });\n  const isDarkMode = mode === \"dark\" || mode === \"system\" && isDarkOS;\n  const toggleTernaryDarkMode = () => {\n    const modes = [\"light\", \"system\", \"dark\"];\n    setMode((prevMode) => {\n      const nextIndex = (modes.indexOf(prevMode) + 1) % modes.length;\n      return modes[nextIndex];\n    });\n  };\n  return {\n    isDarkMode,\n    ternaryDarkMode: mode,\n    setTernaryDarkMode: setMode,\n    toggleTernaryDarkMode\n  };\n}\nfunction useTimeout(callback, delay) {\n  const savedCallback = useRef(callback);\n  useIsomorphicLayoutEffect(() => {\n    savedCallback.current = callback;\n  }, [callback]);\n  useEffect(() => {\n    if (!delay && delay !== 0) {\n      return;\n    }\n    const id = setTimeout(() => {\n      savedCallback.current();\n    }, delay);\n    return () => {\n      clearTimeout(id);\n    };\n  }, [delay]);\n}\nfunction useToggle(defaultValue) {\n  const [value, setValue] = useState(!!defaultValue);\n  const toggle = useCallback(() => {\n    setValue((x) => !x);\n  }, []);\n  return [value, toggle, setValue];\n}\nfunction useUpdateEffect(effect, deps) {\n  const isFirst = useIsFirstRender();\n  useEffect(() => {\n    if (!isFirst) {\n      return effect();\n    }\n  }, deps);\n}\nvar IS_SERVER7 = typeof window === \"undefined\";\nfunction useWindowSize(options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER7) {\n    initializeWithValue = false;\n  }\n  const [windowSize, setWindowSize] = useState(() => {\n    if (initializeWithValue) {\n      return {\n        width: window.innerWidth,\n        height: window.innerHeight\n      };\n    }\n    return {\n      width: void 0,\n      height: void 0\n    };\n  });\n  const debouncedSetWindowSize = useDebounceCallback(\n    setWindowSize,\n    options == null ? void 0 : options.debounceDelay\n  );\n  function handleSize() {\n    const setSize = (options == null ? void 0 : options.debounceDelay) ? debouncedSetWindowSize : setWindowSize;\n    setSize({\n      width: window.innerWidth,\n      height: window.innerHeight\n    });\n  }\n  useEventListener(\"resize\", handleSize);\n  useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, []);\n  return windowSize;\n}\n\nexport { useBoolean, useClickAnyWhere, useCopyToClipboard, useCountdown, useCounter, useDarkMode, useDebounce, useDebounceCallback, useDebounceValue, useDocumentTitle, useEffectOnce, useElementSize, useEventCallback, useEventListener, useFetch, useHover, useImageOnLoad, useIntersectionObserver, useInterval, useIsClient, useIsFirstRender, useIsMounted, useIsomorphicLayoutEffect, useLocalStorage, useLockedBody, useMap, useMediaQuery, useOnClickOutside, useReadLocalStorage, useResizeObserver, useScreen, useScript, useScrollLock, useSessionStorage, useSsr, useStep, useTernaryDarkMode, useTimeout, useToggle, useUnmount, useUpdateEffect, useWindowSize };\n","/* eslint-disable no-console */\nimport {\n  Dispatch,\n  SetStateAction,\n  useCallback,\n  useEffect,\n  useState,\n} from 'react'\n\nimport { useEventCallback, useEventListener } from 'usehooks-ts'\n\ndeclare global {\n  interface WindowEventMap {\n    'local-storage': CustomEvent;\n  }\n}\n\ntype SetValue<T> = Dispatch<SetStateAction<T>>\n\nfunction useLocalStorage<T>(key: string, initialValue: T): [T, SetValue<T>] {\n  const readValue = useCallback((): T => {\n    if (typeof window === 'undefined') {\n      return initialValue\n    }\n\n    try {\n      const item = window.localStorage.getItem(key)\n      return item ? (JSON.parse(item) as T) : initialValue\n    } catch (error) {\n      console.warn(`Error reading localStorage key “${key}”:`, error)\n      return initialValue\n    }\n  }, [initialValue, key])\n\n  const [storedValue, setStoredValue] = useState<T>(readValue)\n\n  const setValue: SetValue<T> = useEventCallback((value) => {\n    // Prevent build error \"window is undefined\" but keeps working\n    if (typeof window === 'undefined') {\n      console.warn(\n        `Tried setting localStorage key “${key}” even though environment is not a client`,\n      )\n    }\n\n    try {\n      const newValue = value instanceof Function ? value(storedValue) : value\n      window.localStorage.setItem(key, JSON.stringify(newValue))\n      setStoredValue(newValue)\n      window.dispatchEvent(new Event('local-storage'))\n    } catch (error) {\n      console.warn(`Error setting localStorage key “${key}”:`, error)\n    }\n  })\n\n  useEffect(() => {\n    setStoredValue(readValue())\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, [])\n\n  const handleStorageChange = useCallback(\n    (event: StorageEvent | CustomEvent) => {\n      if ((event as StorageEvent)?.key && (event as StorageEvent).key !== key) {\n        return\n      }\n      setStoredValue(readValue())\n    },\n    [key, readValue],\n  )\n\n  useEventListener('storage', handleStorageChange)\n  useEventListener('local-storage', handleStorageChange)\n\n  return [storedValue, setValue]\n}\n\nexport default useLocalStorage\n","import * as React from 'react';\nconst ThemeContext = /*#__PURE__*/React.createContext(null);\nif (process.env.NODE_ENV !== 'production') {\n  ThemeContext.displayName = 'ThemeContext';\n}\nexport default ThemeContext;","import * as React from 'react';\nimport ThemeContext from './ThemeContext';\nexport default function useTheme() {\n  const theme = React.useContext(ThemeContext);\n  if (process.env.NODE_ENV !== 'production') {\n    // eslint-disable-next-line react-hooks/rules-of-hooks\n    React.useDebugValue(theme);\n  }\n  return theme;\n}","const hasSymbol = typeof Symbol === 'function' && Symbol.for;\nexport default hasSymbol ? Symbol.for('mui.nested') : '__THEME_NESTED__';","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { exactProp } from '@mui/utils';\nimport ThemeContext from '../useTheme/ThemeContext';\nimport useTheme from '../useTheme';\nimport nested from './nested';\n\n// To support composition of theme.\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nfunction mergeOuterLocalTheme(outerTheme, localTheme) {\n  if (typeof localTheme === 'function') {\n    const mergedTheme = localTheme(outerTheme);\n    if (process.env.NODE_ENV !== 'production') {\n      if (!mergedTheme) {\n        console.error(['MUI: You should return an object from your theme function, i.e.', '<ThemeProvider theme={() => ({})} />'].join('\\n'));\n      }\n    }\n    return mergedTheme;\n  }\n  return _extends({}, outerTheme, localTheme);\n}\n\n/**\n * This component takes a `theme` prop.\n * It makes the `theme` available down the React tree thanks to React context.\n * This component should preferably be used at **the root of your component tree**.\n */\nfunction ThemeProvider(props) {\n  const {\n    children,\n    theme: localTheme\n  } = props;\n  const outerTheme = useTheme();\n  if (process.env.NODE_ENV !== 'production') {\n    if (outerTheme === null && typeof localTheme === 'function') {\n      console.error(['MUI: You are providing a theme function prop to the ThemeProvider component:', '<ThemeProvider theme={outerTheme => outerTheme} />', '', 'However, no outer theme is present.', 'Make sure a theme is already injected higher in the React tree ' + 'or provide a theme object.'].join('\\n'));\n    }\n  }\n  const theme = React.useMemo(() => {\n    const output = outerTheme === null ? localTheme : mergeOuterLocalTheme(outerTheme, localTheme);\n    if (output != null) {\n      output[nested] = outerTheme !== null;\n    }\n    return output;\n  }, [localTheme, outerTheme]);\n  return /*#__PURE__*/_jsx(ThemeContext.Provider, {\n    value: theme,\n    children: children\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? ThemeProvider.propTypes = {\n  /**\n   * Your component tree.\n   */\n  children: PropTypes.node,\n  /**\n   * A theme object. You can provide a function to extend the outer theme.\n   */\n  theme: PropTypes.oneOfType([PropTypes.object, PropTypes.func]).isRequired\n} : void 0;\nif (process.env.NODE_ENV !== 'production') {\n  process.env.NODE_ENV !== \"production\" ? ThemeProvider.propTypes = exactProp(ThemeProvider.propTypes) : void 0;\n}\nexport default ThemeProvider;","'use client';\n\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { ThemeProvider as MuiThemeProvider, useTheme as usePrivateTheme } from '@mui/private-theming';\nimport exactProp from '@mui/utils/exactProp';\nimport { ThemeContext as StyledEngineThemeContext } from '@mui/styled-engine';\nimport useThemeWithoutDefault from '../useThemeWithoutDefault';\nimport RtlProvider from '../RtlProvider';\nimport DefaultPropsProvider from '../DefaultPropsProvider';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nconst EMPTY_THEME = {};\nfunction useThemeScoping(themeId, upperTheme, localTheme, isPrivate = false) {\n  return React.useMemo(() => {\n    const resolvedTheme = themeId ? upperTheme[themeId] || upperTheme : upperTheme;\n    if (typeof localTheme === 'function') {\n      const mergedTheme = localTheme(resolvedTheme);\n      const result = themeId ? _extends({}, upperTheme, {\n        [themeId]: mergedTheme\n      }) : mergedTheme;\n      // must return a function for the private theme to NOT merge with the upper theme.\n      // see the test case \"use provided theme from a callback\" in ThemeProvider.test.js\n      if (isPrivate) {\n        return () => result;\n      }\n      return result;\n    }\n    return themeId ? _extends({}, upperTheme, {\n      [themeId]: localTheme\n    }) : _extends({}, upperTheme, localTheme);\n  }, [themeId, upperTheme, localTheme, isPrivate]);\n}\n\n/**\n * This component makes the `theme` available down the React tree.\n * It should preferably be used at **the root of your component tree**.\n *\n * <ThemeProvider theme={theme}> // existing use case\n * <ThemeProvider theme={{ id: theme }}> // theme scoping\n */\nfunction ThemeProvider(props) {\n  const {\n    children,\n    theme: localTheme,\n    themeId\n  } = props;\n  const upperTheme = useThemeWithoutDefault(EMPTY_THEME);\n  const upperPrivateTheme = usePrivateTheme() || EMPTY_THEME;\n  if (process.env.NODE_ENV !== 'production') {\n    if (upperTheme === null && typeof localTheme === 'function' || themeId && upperTheme && !upperTheme[themeId] && typeof localTheme === 'function') {\n      console.error(['MUI: You are providing a theme function prop to the ThemeProvider component:', '<ThemeProvider theme={outerTheme => outerTheme} />', '', 'However, no outer theme is present.', 'Make sure a theme is already injected higher in the React tree ' + 'or provide a theme object.'].join('\\n'));\n    }\n  }\n  const engineTheme = useThemeScoping(themeId, upperTheme, localTheme);\n  const privateTheme = useThemeScoping(themeId, upperPrivateTheme, localTheme, true);\n  const rtlValue = engineTheme.direction === 'rtl';\n  return /*#__PURE__*/_jsx(MuiThemeProvider, {\n    theme: privateTheme,\n    children: /*#__PURE__*/_jsx(StyledEngineThemeContext.Provider, {\n      value: engineTheme,\n      children: /*#__PURE__*/_jsx(RtlProvider, {\n        value: rtlValue,\n        children: /*#__PURE__*/_jsx(DefaultPropsProvider, {\n          value: engineTheme == null ? void 0 : engineTheme.components,\n          children: children\n        })\n      })\n    })\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? ThemeProvider.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │    To update them, edit the d.ts file and run `pnpm proptypes`.     │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * Your component tree.\n   */\n  children: PropTypes.node,\n  /**\n   * A theme object. You can provide a function to extend the outer theme.\n   */\n  theme: PropTypes.oneOfType([PropTypes.func, PropTypes.object]).isRequired,\n  /**\n   * The design system's unique id for getting the corresponded theme when there are multiple design systems.\n   */\n  themeId: PropTypes.string\n} : void 0;\nif (process.env.NODE_ENV !== 'production') {\n  process.env.NODE_ENV !== \"production\" ? ThemeProvider.propTypes = exactProp(ThemeProvider.propTypes) : void 0;\n}\nexport default ThemeProvider;","'use client';\n\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nconst _excluded = [\"theme\"];\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { ThemeProvider as SystemThemeProvider } from '@mui/system';\nimport THEME_ID from './identifier';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nexport default function ThemeProvider(_ref) {\n  let {\n      theme: themeInput\n    } = _ref,\n    props = _objectWithoutPropertiesLoose(_ref, _excluded);\n  const scopedTheme = themeInput[THEME_ID];\n  return /*#__PURE__*/_jsx(SystemThemeProvider, _extends({}, props, {\n    themeId: scopedTheme ? THEME_ID : undefined,\n    theme: scopedTheme || themeInput\n  }));\n}\nprocess.env.NODE_ENV !== \"production\" ? ThemeProvider.propTypes = {\n  /**\n   * Your component tree.\n   */\n  children: PropTypes.node,\n  /**\n   * A theme object. You can provide a function to extend the outer theme.\n   */\n  theme: PropTypes.oneOfType([PropTypes.object, PropTypes.func]).isRequired\n} : void 0;","'use client';\n\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { useDefaultProps } from '../DefaultPropsProvider';\nimport GlobalStyles from '../GlobalStyles';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nimport { jsxs as _jsxs } from \"react/jsx-runtime\";\nexport const html = (theme, enableColorScheme) => _extends({\n  WebkitFontSmoothing: 'antialiased',\n  // Antialiasing.\n  MozOsxFontSmoothing: 'grayscale',\n  // Antialiasing.\n  // Change from `box-sizing: content-box` so that `width`\n  // is not affected by `padding` or `border`.\n  boxSizing: 'border-box',\n  // Fix font resize problem in iOS\n  WebkitTextSizeAdjust: '100%'\n}, enableColorScheme && !theme.vars && {\n  colorScheme: theme.palette.mode\n});\nexport const body = theme => _extends({\n  color: (theme.vars || theme).palette.text.primary\n}, theme.typography.body1, {\n  backgroundColor: (theme.vars || theme).palette.background.default,\n  '@media print': {\n    // Save printer ink.\n    backgroundColor: (theme.vars || theme).palette.common.white\n  }\n});\nexport const styles = (theme, enableColorScheme = false) => {\n  var _theme$components;\n  const colorSchemeStyles = {};\n  if (enableColorScheme && theme.colorSchemes) {\n    Object.entries(theme.colorSchemes).forEach(([key, scheme]) => {\n      var _scheme$palette;\n      colorSchemeStyles[theme.getColorSchemeSelector(key).replace(/\\s*&/, '')] = {\n        colorScheme: (_scheme$palette = scheme.palette) == null ? void 0 : _scheme$palette.mode\n      };\n    });\n  }\n  let defaultStyles = _extends({\n    html: html(theme, enableColorScheme),\n    '*, *::before, *::after': {\n      boxSizing: 'inherit'\n    },\n    'strong, b': {\n      fontWeight: theme.typography.fontWeightBold\n    },\n    body: _extends({\n      margin: 0\n    }, body(theme), {\n      // Add support for document.body.requestFullScreen().\n      // Other elements, if background transparent, are not supported.\n      '&::backdrop': {\n        backgroundColor: (theme.vars || theme).palette.background.default\n      }\n    })\n  }, colorSchemeStyles);\n  const themeOverrides = (_theme$components = theme.components) == null || (_theme$components = _theme$components.MuiCssBaseline) == null ? void 0 : _theme$components.styleOverrides;\n  if (themeOverrides) {\n    defaultStyles = [defaultStyles, themeOverrides];\n  }\n  return defaultStyles;\n};\n\n/**\n * Kickstart an elegant, consistent, and simple baseline to build upon.\n */\nfunction CssBaseline(inProps) {\n  const props = useDefaultProps({\n    props: inProps,\n    name: 'MuiCssBaseline'\n  });\n  const {\n    children,\n    enableColorScheme = false\n  } = props;\n  return /*#__PURE__*/_jsxs(React.Fragment, {\n    children: [/*#__PURE__*/_jsx(GlobalStyles, {\n      styles: theme => styles(theme, enableColorScheme)\n    }), children]\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? CssBaseline.propTypes /* remove-proptypes */ = {\n  // ┌────────────────────────────── Warning ──────────────────────────────┐\n  // │ These PropTypes are generated from the TypeScript type definitions. │\n  // │    To update them, edit the d.ts file and run `pnpm proptypes`.     │\n  // └─────────────────────────────────────────────────────────────────────┘\n  /**\n   * You can wrap a node.\n   */\n  children: PropTypes.node,\n  /**\n   * Enable `color-scheme` CSS property to use `theme.palette.mode`.\n   * For more details, check out https://developer.mozilla.org/en-US/docs/Web/CSS/color-scheme\n   * For browser support, check out https://caniuse.com/?search=color-scheme\n   * @default false\n   */\n  enableColorScheme: PropTypes.bool\n} : void 0;\nexport default CssBaseline;","import type { PaletteMode, ThemeOptions } from '@mui/material';\n\nconst breakpoints = {\n  values: {\n    xs: 0,\n    sm: 640,\n    md: 810,\n    lg: 1200,\n    xl: 1500,\n  },\n};\n\nconst fontFamily = 'Inter Variable';\nconst typography = {\n  fontFamily: fontFamily,\n  h1: {\n    fontFamily: fontFamily,\n  },\n  h2: {\n    fontFamily: fontFamily,\n  },\n  h3: {\n    fontFamily: fontFamily,\n  },\n  h4: {\n    fontFamily: fontFamily,\n  },\n  h5: {\n    fontFamily: fontFamily,\n  },\n  h6: {\n    fontFamily: fontFamily,\n    fontWeight: 700,\n  },\n};\n\nconst settings = {\n  light: {\n    palette: {\n      mode: 'light',\n      background: {\n        default: '#FFFFFF',\n      },\n      primary: {\n        main: '#00782A',\n      },\n      secondary: {\n        main: '#F5A302',\n      },\n      text: {\n        primary: '#000000',\n        secondary: '#F5A302',\n      },\n    },\n    typography,\n    components: {},\n    breakpoints,\n  },\n};\n\nconst getThemeOptions = (mode: PaletteMode) =>\n  settings['light'] as ThemeOptions;\n\nexport default getThemeOptions;\n","import {\n  createContext,\n  ReactElement,\n  useEffect,\n  useMemo,\n  useState,\n} from 'react';\n\nimport useLocalStorage from '@/hooks/use-local-storage';\nimport type {\n  PaletteMode,\n  ThemeOptions,\n} from '@mui/material';\nimport {\n  createTheme,\n  CssBaseline,\n  ThemeProvider,\n} from '@mui/material';\n\nimport getThemeOptions from './options';\n\ninterface ThemeContextValues {\n  themeMode: PaletteMode;\n  themeOptions: ThemeOptions;\n  toggleThemeMode: (newMode?: PaletteMode) => void;\n}\n\nconst ThemeContext = createContext({} as ThemeContextValues)\n\nconst localStorageThemeModeKeyName = 'THEME_MODE'\n\nfunction Provider({ children }: HocProps): ReactElement {\n  const preferredMode = 'light'\n  const [savedThemeMode, setSavedThemeMode] = useLocalStorage(localStorageThemeModeKeyName, preferredMode)\n  const [mode, setMode] = useState((savedThemeMode as PaletteMode) ?? preferredMode)\n\n  const contextValues = useMemo(() => {\n    const themeOptions = createTheme(getThemeOptions(mode))\n    return {\n      themeMode: mode,\n      themeOptions,\n      toggleThemeMode: (newMode?: PaletteMode) => {\n        setMode(\n          (prevMode: PaletteMode) =>\n            (newMode as PaletteMode) ?? (prevMode === 'light' ? 'dark' : 'light'),\n        )\n      },\n    }\n  }, [mode])\n\n  useEffect(() => {\n    document.documentElement.setAttribute('data-theme', mode)\n    if (mode === 'dark') {\n      document.documentElement.classList.add('dark')\n    } else {\n      document.documentElement.classList.remove('dark')\n    }\n    setSavedThemeMode(mode)\n  }, [mode, setSavedThemeMode])\n\n  return (\n    <ThemeContext.Provider value={contextValues}>\n      <ThemeProvider theme={contextValues.themeOptions}>\n        <CssBaseline />\n        {children}\n      </ThemeProvider>\n    </ThemeContext.Provider>\n  )\n}\n\nexport default Provider\n","export var WalletAdapterNetwork;\n(function (WalletAdapterNetwork) {\n    WalletAdapterNetwork[\"Mainnet\"] = \"mainnet-beta\";\n    WalletAdapterNetwork[\"Testnet\"] = \"testnet\";\n    WalletAdapterNetwork[\"Devnet\"] = \"devnet\";\n})(WalletAdapterNetwork || (WalletAdapterNetwork = {}));\n//# sourceMappingURL=types.js.map","import { createContext, useContext } from 'react';\nexport const ConnectionContext = createContext({});\nexport function useConnection() {\n    return useContext(ConnectionContext);\n}\n//# sourceMappingURL=useConnection.js.map","import { Connection } from '@solana/web3.js';\nimport React, { useMemo } from 'react';\nimport { ConnectionContext } from './useConnection.js';\nexport const ConnectionProvider = ({ children, endpoint, config = { commitment: 'confirmed' }, }) => {\n    const connection = useMemo(() => new Connection(endpoint, config), [endpoint, config]);\n    return React.createElement(ConnectionContext.Provider, { value: { connection } }, children);\n};\n//# sourceMappingURL=ConnectionProvider.js.map","export class WalletError extends Error {\n    // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n    constructor(message, error) {\n        super(message);\n        this.error = error;\n    }\n}\nexport class WalletNotReadyError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotReadyError';\n    }\n}\nexport class WalletLoadError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletLoadError';\n    }\n}\nexport class WalletConfigError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletConfigError';\n    }\n}\nexport class WalletConnectionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletConnectionError';\n    }\n}\nexport class WalletDisconnectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletDisconnectedError';\n    }\n}\nexport class WalletDisconnectionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletDisconnectionError';\n    }\n}\nexport class WalletAccountError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletAccountError';\n    }\n}\nexport class WalletPublicKeyError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletPublicKeyError';\n    }\n}\nexport class WalletKeypairError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletKeypairError';\n    }\n}\nexport class WalletNotConnectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotConnectedError';\n    }\n}\nexport class WalletSendTransactionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSendTransactionError';\n    }\n}\nexport class WalletSignTransactionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignTransactionError';\n    }\n}\nexport class WalletSignMessageError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignMessageError';\n    }\n}\nexport class WalletSignInError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignInError';\n    }\n}\nexport class WalletTimeoutError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletTimeoutError';\n    }\n}\nexport class WalletWindowBlockedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletWindowBlockedError';\n    }\n}\nexport class WalletWindowClosedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletWindowClosedError';\n    }\n}\n//# sourceMappingURL=errors.js.map","import EventEmitter from 'eventemitter3';\nimport { WalletNotConnectedError } from './errors.js';\nexport { EventEmitter };\n/**\n * A wallet's readiness describes a series of states that the wallet can be in,\n * depending on what kind of wallet it is. An installable wallet (eg. a browser\n * extension like Phantom) might be `Installed` if we've found the Phantom API\n * in the global scope, or `NotDetected` otherwise. A loadable, zero-install\n * runtime (eg. Torus Wallet) might simply signal that it's `Loadable`. Use this\n * metadata to personalize the wallet list for each user (eg. to show their\n * installed wallets first).\n */\nexport var WalletReadyState;\n(function (WalletReadyState) {\n    /**\n     * User-installable wallets can typically be detected by scanning for an API\n     * that they've injected into the global context. If such an API is present,\n     * we consider the wallet to have been installed.\n     */\n    WalletReadyState[\"Installed\"] = \"Installed\";\n    WalletReadyState[\"NotDetected\"] = \"NotDetected\";\n    /**\n     * Loadable wallets are always available to you. Since you can load them at\n     * any time, it's meaningless to say that they have been detected.\n     */\n    WalletReadyState[\"Loadable\"] = \"Loadable\";\n    /**\n     * If a wallet is not supported on a given platform (eg. server-rendering, or\n     * mobile) then it will stay in the `Unsupported` state.\n     */\n    WalletReadyState[\"Unsupported\"] = \"Unsupported\";\n})(WalletReadyState || (WalletReadyState = {}));\nexport class BaseWalletAdapter extends EventEmitter {\n    get connected() {\n        return !!this.publicKey;\n    }\n    async autoConnect() {\n        await this.connect();\n    }\n    async prepareTransaction(transaction, connection, options = {}) {\n        const publicKey = this.publicKey;\n        if (!publicKey)\n            throw new WalletNotConnectedError();\n        transaction.feePayer = transaction.feePayer || publicKey;\n        transaction.recentBlockhash =\n            transaction.recentBlockhash ||\n                (await connection.getLatestBlockhash({\n                    commitment: options.preflightCommitment,\n                    minContextSlot: options.minContextSlot,\n                })).blockhash;\n        return transaction;\n    }\n}\nexport function scopePollingDetectionStrategy(detect) {\n    // Early return when server-side rendering\n    if (typeof window === 'undefined' || typeof document === 'undefined')\n        return;\n    const disposers = [];\n    function detectAndDispose() {\n        const detected = detect();\n        if (detected) {\n            for (const dispose of disposers) {\n                dispose();\n            }\n        }\n    }\n    // Strategy #1: Try detecting every second.\n    const interval = \n    // TODO: #334 Replace with idle callback strategy.\n    setInterval(detectAndDispose, 1000);\n    disposers.push(() => clearInterval(interval));\n    // Strategy #2: Detect as soon as the DOM becomes 'ready'/'interactive'.\n    if (\n    // Implies that `DOMContentLoaded` has not yet fired.\n    document.readyState === 'loading') {\n        document.addEventListener('DOMContentLoaded', detectAndDispose, { once: true });\n        disposers.push(() => document.removeEventListener('DOMContentLoaded', detectAndDispose));\n    }\n    // Strategy #3: Detect after the `window` has fully loaded.\n    if (\n    // If the `complete` state has been reached, we're too late.\n    document.readyState !== 'complete') {\n        window.addEventListener('load', detectAndDispose, { once: true });\n        disposers.push(() => window.removeEventListener('load', detectAndDispose));\n    }\n    // Strategy #4: Detect synchronously, now.\n    detectAndDispose();\n}\n/**\n * Users on iOS can be redirected into a wallet's in-app browser automatically,\n * if that wallet has a universal link configured to do so\n * But should not be redirected from within a webview, eg. if they're already\n * inside a wallet's browser\n * This function can be used to identify users who are on iOS and can be redirected\n *\n * @returns true if the user can be redirected\n */\nexport function isIosAndRedirectable() {\n    // SSR: return false\n    if (!navigator)\n        return false;\n    const userAgent = navigator.userAgent.toLowerCase();\n    // if on iOS the user agent will contain either iPhone or iPad\n    // caveat: if requesting desktop site then this won't work\n    const isIos = userAgent.includes('iphone') || userAgent.includes('ipad');\n    // if in a webview then it will not include Safari\n    // note that other iOS browsers also include Safari\n    // so we will redirect only if Safari is also included\n    const isSafari = userAgent.includes('safari');\n    return isIos && isSafari;\n}\n//# sourceMappingURL=adapter.js.map","export function isVersionedTransaction(transaction) {\n    return 'version' in transaction;\n}\n//# sourceMappingURL=transaction.js.map","import { BaseWalletAdapter, } from './adapter.js';\nimport { WalletSendTransactionError, WalletSignTransactionError } from './errors.js';\nimport { isVersionedTransaction } from './transaction.js';\nexport class BaseSignerWalletAdapter extends BaseWalletAdapter {\n    async sendTransaction(transaction, connection, options = {}) {\n        let emit = true;\n        try {\n            if (isVersionedTransaction(transaction)) {\n                if (!this.supportedTransactionVersions)\n                    throw new WalletSendTransactionError(`Sending versioned transactions isn't supported by this wallet`);\n                if (!this.supportedTransactionVersions.has(transaction.version))\n                    throw new WalletSendTransactionError(`Sending transaction version ${transaction.version} isn't supported by this wallet`);\n                try {\n                    transaction = await this.signTransaction(transaction);\n                    const rawTransaction = transaction.serialize();\n                    return await connection.sendRawTransaction(rawTransaction, options);\n                }\n                catch (error) {\n                    // If the error was thrown by `signTransaction`, rethrow it and don't emit a duplicate event\n                    if (error instanceof WalletSignTransactionError) {\n                        emit = false;\n                        throw error;\n                    }\n                    throw new WalletSendTransactionError(error?.message, error);\n                }\n            }\n            else {\n                try {\n                    const { signers, ...sendOptions } = options;\n                    transaction = await this.prepareTransaction(transaction, connection, sendOptions);\n                    signers?.length && transaction.partialSign(...signers);\n                    transaction = await this.signTransaction(transaction);\n                    const rawTransaction = transaction.serialize();\n                    return await connection.sendRawTransaction(rawTransaction, sendOptions);\n                }\n                catch (error) {\n                    // If the error was thrown by `signTransaction`, rethrow it and don't emit a duplicate event\n                    if (error instanceof WalletSignTransactionError) {\n                        emit = false;\n                        throw error;\n                    }\n                    throw new WalletSendTransactionError(error?.message, error);\n                }\n            }\n        }\n        catch (error) {\n            if (emit) {\n                this.emit('error', error);\n            }\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        for (const transaction of transactions) {\n            if (isVersionedTransaction(transaction)) {\n                if (!this.supportedTransactionVersions)\n                    throw new WalletSignTransactionError(`Signing versioned transactions isn't supported by this wallet`);\n                if (!this.supportedTransactionVersions.has(transaction.version))\n                    throw new WalletSignTransactionError(`Signing transaction version ${transaction.version} isn't supported by this wallet`);\n            }\n        }\n        const signedTransactions = [];\n        for (const transaction of transactions) {\n            signedTransactions.push(await this.signTransaction(transaction));\n        }\n        return signedTransactions;\n    }\n}\nexport class BaseMessageSignerWalletAdapter extends BaseSignerWalletAdapter {\n}\nexport class BaseSignInMessageSignerWalletAdapter extends BaseMessageSignerWalletAdapter {\n}\n//# sourceMappingURL=signer.js.map","import { verifyMessageSignature } from './signMessage.js';\nimport { arraysEqual } from './util.js';\n/**\n * TODO: docs\n */\nexport function verifySignIn(input, output) {\n    const { signedMessage, signature, account: { publicKey }, } = output;\n    const message = deriveSignInMessage(input, output);\n    return !!message && verifyMessageSignature({ message, signedMessage, signature, publicKey });\n}\n/**\n * TODO: docs\n */\nexport function deriveSignInMessage(input, output) {\n    const text = deriveSignInMessageText(input, output);\n    if (!text)\n        return null;\n    return new TextEncoder().encode(text);\n}\n/**\n * TODO: docs\n */\nexport function deriveSignInMessageText(input, output) {\n    const parsed = parseSignInMessage(output.signedMessage);\n    if (!parsed)\n        return null;\n    if (input.domain && input.domain !== parsed.domain)\n        return null;\n    if (input.address && input.address !== parsed.address)\n        return null;\n    if (input.statement !== parsed.statement)\n        return null;\n    if (input.uri !== parsed.uri)\n        return null;\n    if (input.version !== parsed.version)\n        return null;\n    if (input.chainId !== parsed.chainId)\n        return null;\n    if (input.nonce !== parsed.nonce)\n        return null;\n    if (input.issuedAt !== parsed.issuedAt)\n        return null;\n    if (input.expirationTime !== parsed.expirationTime)\n        return null;\n    if (input.notBefore !== parsed.notBefore)\n        return null;\n    if (input.requestId !== parsed.requestId)\n        return null;\n    if (input.resources) {\n        if (!parsed.resources)\n            return null;\n        if (!arraysEqual(input.resources, parsed.resources))\n            return null;\n    }\n    else if (parsed.resources)\n        return null;\n    return createSignInMessageText(parsed);\n}\n/**\n * TODO: docs\n */\nexport function parseSignInMessage(message) {\n    const text = new TextDecoder().decode(message);\n    return parseSignInMessageText(text);\n}\n// TODO: implement https://github.com/solana-labs/solana/blob/master/docs/src/proposals/off-chain-message-signing.md\nconst DOMAIN = '(?<domain>[^\\\\n]+?) wants you to sign in with your Solana account:\\\\n';\nconst ADDRESS = '(?<address>[^\\\\n]+)(?:\\\\n|$)';\nconst STATEMENT = '(?:\\\\n(?<statement>[\\\\S\\\\s]*?)(?:\\\\n|$))??';\nconst URI = '(?:\\\\nURI: (?<uri>[^\\\\n]+))?';\nconst VERSION = '(?:\\\\nVersion: (?<version>[^\\\\n]+))?';\nconst CHAIN_ID = '(?:\\\\nChain ID: (?<chainId>[^\\\\n]+))?';\nconst NONCE = '(?:\\\\nNonce: (?<nonce>[^\\\\n]+))?';\nconst ISSUED_AT = '(?:\\\\nIssued At: (?<issuedAt>[^\\\\n]+))?';\nconst EXPIRATION_TIME = '(?:\\\\nExpiration Time: (?<expirationTime>[^\\\\n]+))?';\nconst NOT_BEFORE = '(?:\\\\nNot Before: (?<notBefore>[^\\\\n]+))?';\nconst REQUEST_ID = '(?:\\\\nRequest ID: (?<requestId>[^\\\\n]+))?';\nconst RESOURCES = '(?:\\\\nResources:(?<resources>(?:\\\\n- [^\\\\n]+)*))?';\nconst FIELDS = `${URI}${VERSION}${CHAIN_ID}${NONCE}${ISSUED_AT}${EXPIRATION_TIME}${NOT_BEFORE}${REQUEST_ID}${RESOURCES}`;\nconst MESSAGE = new RegExp(`^${DOMAIN}${ADDRESS}${STATEMENT}${FIELDS}\\\\n*$`);\n/**\n * TODO: docs\n */\nexport function parseSignInMessageText(text) {\n    const match = MESSAGE.exec(text);\n    if (!match)\n        return null;\n    const groups = match.groups;\n    if (!groups)\n        return null;\n    return {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        domain: groups.domain,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        address: groups.address,\n        statement: groups.statement,\n        uri: groups.uri,\n        version: groups.version,\n        nonce: groups.nonce,\n        chainId: groups.chainId,\n        issuedAt: groups.issuedAt,\n        expirationTime: groups.expirationTime,\n        notBefore: groups.notBefore,\n        requestId: groups.requestId,\n        resources: groups.resources?.split('\\n- ').slice(1),\n    };\n}\n/**\n * TODO: docs\n */\nexport function createSignInMessage(input) {\n    const text = createSignInMessageText(input);\n    return new TextEncoder().encode(text);\n}\n/**\n * TODO: docs\n */\nexport function createSignInMessageText(input) {\n    // ${domain} wants you to sign in with your Solana account:\n    // ${address}\n    //\n    // ${statement}\n    //\n    // URI: ${uri}\n    // Version: ${version}\n    // Chain ID: ${chain}\n    // Nonce: ${nonce}\n    // Issued At: ${issued-at}\n    // Expiration Time: ${expiration-time}\n    // Not Before: ${not-before}\n    // Request ID: ${request-id}\n    // Resources:\n    // - ${resources[0]}\n    // - ${resources[1]}\n    // ...\n    // - ${resources[n]}\n    let message = `${input.domain} wants you to sign in with your Solana account:\\n`;\n    message += `${input.address}`;\n    if (input.statement) {\n        message += `\\n\\n${input.statement}`;\n    }\n    const fields = [];\n    if (input.uri) {\n        fields.push(`URI: ${input.uri}`);\n    }\n    if (input.version) {\n        fields.push(`Version: ${input.version}`);\n    }\n    if (input.chainId) {\n        fields.push(`Chain ID: ${input.chainId}`);\n    }\n    if (input.nonce) {\n        fields.push(`Nonce: ${input.nonce}`);\n    }\n    if (input.issuedAt) {\n        fields.push(`Issued At: ${input.issuedAt}`);\n    }\n    if (input.expirationTime) {\n        fields.push(`Expiration Time: ${input.expirationTime}`);\n    }\n    if (input.notBefore) {\n        fields.push(`Not Before: ${input.notBefore}`);\n    }\n    if (input.requestId) {\n        fields.push(`Request ID: ${input.requestId}`);\n    }\n    if (input.resources) {\n        fields.push(`Resources:`);\n        for (const resource of input.resources) {\n            fields.push(`- ${resource}`);\n        }\n    }\n    if (fields.length) {\n        message += `\\n\\n${fields.join('\\n')}`;\n    }\n    return message;\n}\n//# sourceMappingURL=signIn.js.map","import { createSignInMessageText } from '@solana/wallet-standard-util';\n\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaMobileWalletAdapterErrorCode = {\n    ERROR_ASSOCIATION_PORT_OUT_OF_RANGE: 'ERROR_ASSOCIATION_PORT_OUT_OF_RANGE',\n    ERROR_FORBIDDEN_WALLET_BASE_URL: 'ERROR_FORBIDDEN_WALLET_BASE_URL',\n    ERROR_SECURE_CONTEXT_REQUIRED: 'ERROR_SECURE_CONTEXT_REQUIRED',\n    ERROR_SESSION_CLOSED: 'ERROR_SESSION_CLOSED',\n    ERROR_SESSION_TIMEOUT: 'ERROR_SESSION_TIMEOUT',\n    ERROR_WALLET_NOT_FOUND: 'ERROR_WALLET_NOT_FOUND',\n    ERROR_INVALID_PROTOCOL_VERSION: 'ERROR_INVALID_PROTOCOL_VERSION',\n};\nclass SolanaMobileWalletAdapterError extends Error {\n    constructor(...args) {\n        const [code, message, data] = args;\n        super(message);\n        this.code = code;\n        this.data = data;\n        this.name = 'SolanaMobileWalletAdapterError';\n    }\n}\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaMobileWalletAdapterProtocolErrorCode = {\n    // Keep these in sync with `mobilewalletadapter/common/ProtocolContract.java`.\n    ERROR_AUTHORIZATION_FAILED: -1,\n    ERROR_INVALID_PAYLOADS: -2,\n    ERROR_NOT_SIGNED: -3,\n    ERROR_NOT_SUBMITTED: -4,\n    ERROR_TOO_MANY_PAYLOADS: -5,\n    ERROR_ATTEST_ORIGIN_ANDROID: -100,\n};\nclass SolanaMobileWalletAdapterProtocolError extends Error {\n    constructor(...args) {\n        const [jsonRpcMessageId, code, message, data] = args;\n        super(message);\n        this.code = code;\n        this.data = data;\n        this.jsonRpcMessageId = jsonRpcMessageId;\n        this.name = 'SolanaMobileWalletAdapterProtocolError';\n    }\n}\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction createHelloReq(ecdhPublicKey, associationKeypairPrivateKey) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const publicKeyBuffer = yield crypto.subtle.exportKey('raw', ecdhPublicKey);\n        const signatureBuffer = yield crypto.subtle.sign({ hash: 'SHA-256', name: 'ECDSA' }, associationKeypairPrivateKey, publicKeyBuffer);\n        const response = new Uint8Array(publicKeyBuffer.byteLength + signatureBuffer.byteLength);\n        response.set(new Uint8Array(publicKeyBuffer), 0);\n        response.set(new Uint8Array(signatureBuffer), publicKeyBuffer.byteLength);\n        return response;\n    });\n}\n\nfunction encode(input) {\n    return window.btoa(input);\n}\n\nfunction createSIWSMessage(payload) {\n    return createSignInMessageText(payload);\n}\nfunction createSIWSMessageBase64(payload) {\n    return encode(createSIWSMessage(payload));\n}\n\n// optional features\nconst SolanaSignTransactions = 'solana:signTransactions';\nconst SolanaCloneAuthorization = 'solana:cloneAuthorization';\nconst SolanaSignInWithSolana = 'solana:signInWithSolana';\n\n/**\n * Creates a {@link MobileWallet} proxy that handles backwards compatibility and API to RPC conversion.\n *\n * @param protocolVersion the protocol version in use for this session/request\n * @param protocolRequestHandler callback function that handles sending the RPC request to the wallet endpoint.\n * @returns a {@link MobileWallet} proxy\n */\nfunction createMobileWalletProxy(protocolVersion, protocolRequestHandler) {\n    return new Proxy({}, {\n        get(target, p) {\n            if (target[p] == null) {\n                target[p] = function (inputParams) {\n                    return __awaiter(this, void 0, void 0, function* () {\n                        const { method, params } = handleMobileWalletRequest(p, inputParams, protocolVersion);\n                        const result = yield protocolRequestHandler(method, params);\n                        // if the request tried to sign in but the wallet did not return a sign in result, fallback on message signing\n                        if (method === 'authorize' && params.sign_in_payload && !result.sign_in_result) {\n                            result['sign_in_result'] = yield signInFallback(params.sign_in_payload, result, protocolRequestHandler);\n                        }\n                        return handleMobileWalletResponse(p, result, protocolVersion);\n                    });\n                };\n            }\n            return target[p];\n        },\n        defineProperty() {\n            return false;\n        },\n        deleteProperty() {\n            return false;\n        },\n    });\n}\n/**\n * Handles all {@link MobileWallet} API requests and determines the correct MWA RPC method and params to call.\n * This handles backwards compatibility, based on the provided @protocolVersion.\n *\n * @param methodName the name of {@link MobileWallet} method that was called\n * @param methodParams the parameters that were passed to the method\n * @param protocolVersion the protocol version in use for this session/request\n * @returns the RPC request method and params that should be sent to the wallet endpoint\n */\nfunction handleMobileWalletRequest(methodName, methodParams, protocolVersion) {\n    let params = methodParams;\n    let method = methodName\n        .toString()\n        .replace(/[A-Z]/g, (letter) => `_${letter.toLowerCase()}`)\n        .toLowerCase();\n    switch (methodName) {\n        case 'authorize': {\n            let { chain } = params;\n            if (protocolVersion === 'legacy') {\n                switch (chain) {\n                    case 'solana:testnet': {\n                        chain = 'testnet';\n                        break;\n                    }\n                    case 'solana:devnet': {\n                        chain = 'devnet';\n                        break;\n                    }\n                    case 'solana:mainnet': {\n                        chain = 'mainnet-beta';\n                        break;\n                    }\n                    default: {\n                        chain = params.cluster;\n                    }\n                }\n                params.cluster = chain;\n            }\n            else {\n                switch (chain) {\n                    case 'testnet':\n                    case 'devnet': {\n                        chain = `solana:${chain}`;\n                        break;\n                    }\n                    case 'mainnet-beta': {\n                        chain = 'solana:mainnet';\n                        break;\n                    }\n                }\n                params.chain = chain;\n            }\n        }\n        case 'reauthorize': {\n            const { auth_token, identity } = params;\n            if (auth_token) {\n                switch (protocolVersion) {\n                    case 'legacy': {\n                        method = 'reauthorize';\n                        params = { auth_token: auth_token, identity: identity };\n                        break;\n                    }\n                    default: {\n                        method = 'authorize';\n                        break;\n                    }\n                }\n            }\n            break;\n        }\n    }\n    return { method, params };\n}\n/**\n * Handles all {@link MobileWallet} API responses and modifies the response for backwards compatibility, if needed\n *\n * @param method the {@link MobileWallet} method that was called\n * @param response the original response that was returned by the method call\n * @param protocolVersion the protocol version in use for this session/request\n * @returns the possibly modified response\n */\nfunction handleMobileWalletResponse(method, response, protocolVersion) {\n    switch (method) {\n        case 'getCapabilities': {\n            const capabilities = response;\n            switch (protocolVersion) {\n                case 'legacy': {\n                    const features = [SolanaSignTransactions];\n                    if (capabilities.supports_clone_authorization === true) {\n                        features.push(SolanaCloneAuthorization);\n                    }\n                    return Object.assign(Object.assign({}, capabilities), { features: features });\n                }\n                case 'v1': {\n                    return Object.assign(Object.assign({}, capabilities), { supports_sign_and_send_transactions: true, supports_clone_authorization: capabilities.features.includes(SolanaCloneAuthorization) });\n                }\n            }\n        }\n    }\n    return response;\n}\nfunction signInFallback(signInPayload, authorizationResult, protocolRequestHandler) {\n    var _a;\n    return __awaiter(this, void 0, void 0, function* () {\n        const domain = (_a = signInPayload.domain) !== null && _a !== void 0 ? _a : window.location.host;\n        const address = authorizationResult.accounts[0].address;\n        const siwsMessage = createSIWSMessageBase64(Object.assign(Object.assign({}, signInPayload), { domain, address }));\n        const signMessageResult = yield protocolRequestHandler('sign_messages', {\n            addresses: [address],\n            payloads: [siwsMessage]\n        });\n        const signInResult = {\n            address: address,\n            signed_message: siwsMessage,\n            signature: signMessageResult.signed_payloads[0].slice(siwsMessage.length)\n        };\n        return signInResult;\n    });\n}\n\nconst SEQUENCE_NUMBER_BYTES = 4;\nfunction createSequenceNumberVector(sequenceNumber) {\n    if (sequenceNumber >= 4294967296) {\n        throw new Error('Outbound sequence number overflow. The maximum sequence number is 32-bytes.');\n    }\n    const byteArray = new ArrayBuffer(SEQUENCE_NUMBER_BYTES);\n    const view = new DataView(byteArray);\n    view.setUint32(0, sequenceNumber, /* littleEndian */ false);\n    return new Uint8Array(byteArray);\n}\n\nconst INITIALIZATION_VECTOR_BYTES = 12;\nconst ENCODED_PUBLIC_KEY_LENGTH_BYTES = 65;\nfunction encryptMessage(plaintext, sequenceNumber, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const sequenceNumberVector = createSequenceNumberVector(sequenceNumber);\n        const initializationVector = new Uint8Array(INITIALIZATION_VECTOR_BYTES);\n        crypto.getRandomValues(initializationVector);\n        const ciphertext = yield crypto.subtle.encrypt(getAlgorithmParams(sequenceNumberVector, initializationVector), sharedSecret, new TextEncoder().encode(plaintext));\n        const response = new Uint8Array(sequenceNumberVector.byteLength + initializationVector.byteLength + ciphertext.byteLength);\n        response.set(new Uint8Array(sequenceNumberVector), 0);\n        response.set(new Uint8Array(initializationVector), sequenceNumberVector.byteLength);\n        response.set(new Uint8Array(ciphertext), sequenceNumberVector.byteLength + initializationVector.byteLength);\n        return response;\n    });\n}\nfunction decryptMessage(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const sequenceNumberVector = message.slice(0, SEQUENCE_NUMBER_BYTES);\n        const initializationVector = message.slice(SEQUENCE_NUMBER_BYTES, SEQUENCE_NUMBER_BYTES + INITIALIZATION_VECTOR_BYTES);\n        const ciphertext = message.slice(SEQUENCE_NUMBER_BYTES + INITIALIZATION_VECTOR_BYTES);\n        const plaintextBuffer = yield crypto.subtle.decrypt(getAlgorithmParams(sequenceNumberVector, initializationVector), sharedSecret, ciphertext);\n        const plaintext = getUtf8Decoder().decode(plaintextBuffer);\n        return plaintext;\n    });\n}\nfunction getAlgorithmParams(sequenceNumber, initializationVector) {\n    return {\n        additionalData: sequenceNumber,\n        iv: initializationVector,\n        name: 'AES-GCM',\n        tagLength: 128, // 16 byte tag => 128 bits\n    };\n}\nlet _utf8Decoder;\nfunction getUtf8Decoder() {\n    if (_utf8Decoder === undefined) {\n        _utf8Decoder = new TextDecoder('utf-8');\n    }\n    return _utf8Decoder;\n}\n\nfunction generateAssociationKeypair() {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield crypto.subtle.generateKey({\n            name: 'ECDSA',\n            namedCurve: 'P-256',\n        }, false /* extractable */, ['sign'] /* keyUsages */);\n    });\n}\n\nfunction generateECDHKeypair() {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield crypto.subtle.generateKey({\n            name: 'ECDH',\n            namedCurve: 'P-256',\n        }, false /* extractable */, ['deriveKey', 'deriveBits'] /* keyUsages */);\n    });\n}\n\nfunction encryptJsonRpcMessage(jsonRpcMessage, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = JSON.stringify(jsonRpcMessage);\n        const sequenceNumber = jsonRpcMessage.id;\n        return encryptMessage(plaintext, sequenceNumber, sharedSecret);\n    });\n}\nfunction decryptJsonRpcMessage(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = yield decryptMessage(message, sharedSecret);\n        const jsonRpcMessage = JSON.parse(plaintext);\n        if (Object.hasOwnProperty.call(jsonRpcMessage, 'error')) {\n            throw new SolanaMobileWalletAdapterProtocolError(jsonRpcMessage.id, jsonRpcMessage.error.code, jsonRpcMessage.error.message);\n        }\n        return jsonRpcMessage;\n    });\n}\n\nfunction parseHelloRsp(payloadBuffer, // The X9.62-encoded wallet endpoint ephemeral ECDH public keypoint.\nassociationPublicKey, ecdhPrivateKey) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const [associationPublicKeyBuffer, walletPublicKey] = yield Promise.all([\n            crypto.subtle.exportKey('raw', associationPublicKey),\n            crypto.subtle.importKey('raw', payloadBuffer.slice(0, ENCODED_PUBLIC_KEY_LENGTH_BYTES), { name: 'ECDH', namedCurve: 'P-256' }, false /* extractable */, [] /* keyUsages */),\n        ]);\n        const sharedSecret = yield crypto.subtle.deriveBits({ name: 'ECDH', public: walletPublicKey }, ecdhPrivateKey, 256);\n        const ecdhSecretKey = yield crypto.subtle.importKey('raw', sharedSecret, 'HKDF', false /* extractable */, ['deriveKey'] /* keyUsages */);\n        const aesKeyMaterialVal = yield crypto.subtle.deriveKey({\n            name: 'HKDF',\n            hash: 'SHA-256',\n            salt: new Uint8Array(associationPublicKeyBuffer),\n            info: new Uint8Array(),\n        }, ecdhSecretKey, { name: 'AES-GCM', length: 128 }, false /* extractable */, ['encrypt', 'decrypt']);\n        return aesKeyMaterialVal;\n    });\n}\n\nfunction parseSessionProps(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = yield decryptMessage(message, sharedSecret);\n        const jsonProperties = JSON.parse(plaintext);\n        let protocolVersion = 'legacy';\n        if (Object.hasOwnProperty.call(jsonProperties, 'v')) {\n            switch (jsonProperties.v) {\n                case 1:\n                case '1':\n                case 'v1':\n                    protocolVersion = 'v1';\n                    break;\n                case 'legacy':\n                    protocolVersion = 'legacy';\n                    break;\n                default:\n                    throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_INVALID_PROTOCOL_VERSION, `Unknown/unsupported protocol version: ${jsonProperties.v}`);\n            }\n        }\n        return ({\n            protocol_version: protocolVersion\n        });\n    });\n}\n\nfunction getRandomAssociationPort() {\n    return assertAssociationPort(49152 + Math.floor(Math.random() * (65535 - 49152 + 1)));\n}\nfunction assertAssociationPort(port) {\n    if (port < 49152 || port > 65535) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_ASSOCIATION_PORT_OUT_OF_RANGE, `Association port number must be between 49152 and 65535. ${port} given.`, { port });\n    }\n    return port;\n}\n\n// https://stackoverflow.com/a/9458996/802047\nfunction arrayBufferToBase64String(buffer) {\n    let binary = '';\n    const bytes = new Uint8Array(buffer);\n    const len = bytes.byteLength;\n    for (let ii = 0; ii < len; ii++) {\n        binary += String.fromCharCode(bytes[ii]);\n    }\n    return window.btoa(binary);\n}\n\nfunction getStringWithURLUnsafeCharactersReplaced(unsafeBase64EncodedString) {\n    return unsafeBase64EncodedString.replace(/[/+=]/g, (m) => ({\n        '/': '_',\n        '+': '-',\n        '=': '.',\n    }[m]));\n}\n\nconst INTENT_NAME = 'solana-wallet';\nfunction getPathParts(pathString) {\n    return (pathString\n        // Strip leading and trailing slashes\n        .replace(/(^\\/+|\\/+$)/g, '')\n        // Return an array of directories\n        .split('/'));\n}\nfunction getIntentURL(methodPathname, intentUrlBase) {\n    let baseUrl = null;\n    if (intentUrlBase) {\n        try {\n            baseUrl = new URL(intentUrlBase);\n        }\n        catch (_a) { } // eslint-disable-line no-empty\n        if ((baseUrl === null || baseUrl === void 0 ? void 0 : baseUrl.protocol) !== 'https:') {\n            throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Base URLs supplied by wallets must be valid `https` URLs');\n        }\n    }\n    baseUrl || (baseUrl = new URL(`${INTENT_NAME}:/`));\n    const pathname = methodPathname.startsWith('/')\n        ? // Method is an absolute path. Replace it wholesale.\n            methodPathname\n        : // Method is a relative path. Merge it with the existing one.\n            [...getPathParts(baseUrl.pathname), ...getPathParts(methodPathname)].join('/');\n    return new URL(pathname, baseUrl);\n}\nfunction getAssociateAndroidIntentURL(associationPublicKey, putativePort, associationURLBase, protocolVersions = ['v1']) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const associationPort = assertAssociationPort(putativePort);\n        const exportedKey = yield crypto.subtle.exportKey('raw', associationPublicKey);\n        const encodedKey = arrayBufferToBase64String(exportedKey);\n        const url = getIntentURL('v1/associate/local', associationURLBase);\n        url.searchParams.set('association', getStringWithURLUnsafeCharactersReplaced(encodedKey));\n        url.searchParams.set('port', `${associationPort}`);\n        protocolVersions.forEach((version) => {\n            url.searchParams.set('v', version);\n        });\n        return url;\n    });\n}\n\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst Browser = {\n    Firefox: 0,\n    Other: 1,\n};\nfunction assertUnreachable(x) {\n    return x;\n}\nfunction getBrowser() {\n    return navigator.userAgent.indexOf('Firefox/') !== -1 ? Browser.Firefox : Browser.Other;\n}\nfunction getDetectionPromise() {\n    // Chrome and others silently fail if a custom protocol is not supported.\n    // For these, we wait to see if the browser is navigated away from in\n    // a reasonable amount of time (ie. the native wallet opened).\n    return new Promise((resolve, reject) => {\n        function cleanup() {\n            clearTimeout(timeoutId);\n            window.removeEventListener('blur', handleBlur);\n        }\n        function handleBlur() {\n            cleanup();\n            resolve();\n        }\n        window.addEventListener('blur', handleBlur);\n        const timeoutId = setTimeout(() => {\n            cleanup();\n            reject();\n        }, 2000);\n    });\n}\nlet _frame = null;\nfunction launchUrlThroughHiddenFrame(url) {\n    if (_frame == null) {\n        _frame = document.createElement('iframe');\n        _frame.style.display = 'none';\n        document.body.appendChild(_frame);\n    }\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    _frame.contentWindow.location.href = url.toString();\n}\nfunction startSession(associationPublicKey, associationURLBase) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const randomAssociationPort = getRandomAssociationPort();\n        const associationUrl = yield getAssociateAndroidIntentURL(associationPublicKey, randomAssociationPort, associationURLBase);\n        if (associationUrl.protocol === 'https:') {\n            // The association URL is an Android 'App Link' or iOS 'Universal Link'.\n            // These are regular web URLs that are designed to launch an app if it\n            // is installed or load the actual target webpage if not.\n            window.location.assign(associationUrl);\n        }\n        else {\n            // The association URL has a custom protocol (eg. `solana-wallet:`)\n            try {\n                const browser = getBrowser();\n                switch (browser) {\n                    case Browser.Firefox:\n                        // If a custom protocol is not supported in Firefox, it throws.\n                        launchUrlThroughHiddenFrame(associationUrl);\n                        // If we reached this line, it's supported.\n                        break;\n                    case Browser.Other: {\n                        const detectionPromise = getDetectionPromise();\n                        window.location.assign(associationUrl);\n                        yield detectionPromise;\n                        break;\n                    }\n                    default:\n                        assertUnreachable(browser);\n                }\n            }\n            catch (e) {\n                throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_WALLET_NOT_FOUND, 'Found no installed wallet that supports the mobile wallet protocol.');\n            }\n        }\n        return randomAssociationPort;\n    });\n}\n\nconst WEBSOCKET_CONNECTION_CONFIG = {\n    /**\n     * 300 milliseconds is a generally accepted threshold for what someone\n     * would consider an acceptable response time for a user interface\n     * after having performed a low-attention tapping task. We set the initial\n     * interval at which we wait for the wallet to set up the websocket at\n     * half this, as per the Nyquist frequency, with a progressive backoff\n     * sequence from there. The total wait time is 30s, which allows for the\n     * user to be presented with a disambiguation dialog, select a wallet, and\n     * for the wallet app to subsequently start.\n     */\n    retryDelayScheduleMs: [150, 150, 200, 500, 500, 750, 750, 1000],\n    timeoutMs: 30000,\n};\nconst WEBSOCKET_PROTOCOL = 'com.solana.mobilewalletadapter.v1';\nfunction assertSecureContext() {\n    if (typeof window === 'undefined' || window.isSecureContext !== true) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SECURE_CONTEXT_REQUIRED, 'The mobile wallet adapter protocol must be used in a secure context (`https`).');\n    }\n}\nfunction assertSecureEndpointSpecificURI(walletUriBase) {\n    let url;\n    try {\n        url = new URL(walletUriBase);\n    }\n    catch (_a) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Invalid base URL supplied by wallet');\n    }\n    if (url.protocol !== 'https:') {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Base URLs supplied by wallets must be valid `https` URLs');\n    }\n}\nfunction getSequenceNumberFromByteArray(byteArray) {\n    const view = new DataView(byteArray);\n    return view.getUint32(0, /* littleEndian */ false);\n}\nfunction transact(callback, config) {\n    return __awaiter(this, void 0, void 0, function* () {\n        assertSecureContext();\n        const associationKeypair = yield generateAssociationKeypair();\n        const sessionPort = yield startSession(associationKeypair.publicKey, config === null || config === void 0 ? void 0 : config.baseUri);\n        const websocketURL = `ws://localhost:${sessionPort}/solana-wallet`;\n        let connectionStartTime;\n        const getNextRetryDelayMs = (() => {\n            const schedule = [...WEBSOCKET_CONNECTION_CONFIG.retryDelayScheduleMs];\n            return () => (schedule.length > 1 ? schedule.shift() : schedule[0]);\n        })();\n        let nextJsonRpcMessageId = 1;\n        let lastKnownInboundSequenceNumber = 0;\n        let state = { __type: 'disconnected' };\n        return new Promise((resolve, reject) => {\n            let socket;\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            const jsonRpcResponsePromises = {};\n            const handleOpen = () => __awaiter(this, void 0, void 0, function* () {\n                if (state.__type !== 'connecting') {\n                    console.warn('Expected adapter state to be `connecting` at the moment the websocket opens. ' +\n                        `Got \\`${state.__type}\\`.`);\n                    return;\n                }\n                const { associationKeypair } = state;\n                socket.removeEventListener('open', handleOpen);\n                const ecdhKeypair = yield generateECDHKeypair();\n                socket.send(yield createHelloReq(ecdhKeypair.publicKey, associationKeypair.privateKey));\n                state = {\n                    __type: 'hello_req_sent',\n                    associationPublicKey: associationKeypair.publicKey,\n                    ecdhPrivateKey: ecdhKeypair.privateKey,\n                };\n            });\n            const handleClose = (evt) => {\n                if (evt.wasClean) {\n                    state = { __type: 'disconnected' };\n                }\n                else {\n                    reject(new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SESSION_CLOSED, `The wallet session dropped unexpectedly (${evt.code}: ${evt.reason}).`, { closeEvent: evt }));\n                }\n                disposeSocket();\n            };\n            const handleError = (_evt) => __awaiter(this, void 0, void 0, function* () {\n                disposeSocket();\n                if (Date.now() - connectionStartTime >= WEBSOCKET_CONNECTION_CONFIG.timeoutMs) {\n                    reject(new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SESSION_TIMEOUT, `Failed to connect to the wallet websocket on port ${sessionPort}.`));\n                }\n                else {\n                    yield new Promise((resolve) => {\n                        const retryDelayMs = getNextRetryDelayMs();\n                        retryWaitTimeoutId = window.setTimeout(resolve, retryDelayMs);\n                    });\n                    attemptSocketConnection();\n                }\n            });\n            const handleMessage = (evt) => __awaiter(this, void 0, void 0, function* () {\n                const responseBuffer = yield evt.data.arrayBuffer();\n                switch (state.__type) {\n                    case 'connected':\n                        try {\n                            const sequenceNumberVector = responseBuffer.slice(0, SEQUENCE_NUMBER_BYTES);\n                            const sequenceNumber = getSequenceNumberFromByteArray(sequenceNumberVector);\n                            if (sequenceNumber !== (lastKnownInboundSequenceNumber + 1)) {\n                                throw new Error('Encrypted message has invalid sequence number');\n                            }\n                            lastKnownInboundSequenceNumber = sequenceNumber;\n                            const jsonRpcMessage = yield decryptJsonRpcMessage(responseBuffer, state.sharedSecret);\n                            const responsePromise = jsonRpcResponsePromises[jsonRpcMessage.id];\n                            delete jsonRpcResponsePromises[jsonRpcMessage.id];\n                            responsePromise.resolve(jsonRpcMessage.result);\n                        }\n                        catch (e) {\n                            if (e instanceof SolanaMobileWalletAdapterProtocolError) {\n                                const responsePromise = jsonRpcResponsePromises[e.jsonRpcMessageId];\n                                delete jsonRpcResponsePromises[e.jsonRpcMessageId];\n                                responsePromise.reject(e);\n                            }\n                            else {\n                                throw e;\n                            }\n                        }\n                        break;\n                    case 'hello_req_sent': {\n                        const sharedSecret = yield parseHelloRsp(responseBuffer, state.associationPublicKey, state.ecdhPrivateKey);\n                        const sessionPropertiesBuffer = responseBuffer.slice(ENCODED_PUBLIC_KEY_LENGTH_BYTES);\n                        const sessionProperties = sessionPropertiesBuffer.byteLength !== 0\n                            ? yield (() => __awaiter(this, void 0, void 0, function* () {\n                                const sequenceNumberVector = sessionPropertiesBuffer.slice(0, SEQUENCE_NUMBER_BYTES);\n                                const sequenceNumber = getSequenceNumberFromByteArray(sequenceNumberVector);\n                                if (sequenceNumber !== (lastKnownInboundSequenceNumber + 1)) {\n                                    throw new Error('Encrypted message has invalid sequence number');\n                                }\n                                lastKnownInboundSequenceNumber = sequenceNumber;\n                                return parseSessionProps(sessionPropertiesBuffer, sharedSecret);\n                            }))() : { protocol_version: 'legacy' };\n                        state = { __type: 'connected', sharedSecret, sessionProperties };\n                        const wallet = createMobileWalletProxy(sessionProperties.protocol_version, (method, params) => __awaiter(this, void 0, void 0, function* () {\n                            const id = nextJsonRpcMessageId++;\n                            socket.send(yield encryptJsonRpcMessage({\n                                id,\n                                jsonrpc: '2.0',\n                                method,\n                                params: params !== null && params !== void 0 ? params : {},\n                            }, sharedSecret));\n                            return new Promise((resolve, reject) => {\n                                jsonRpcResponsePromises[id] = {\n                                    resolve(result) {\n                                        switch (method) {\n                                            case 'authorize':\n                                            case 'reauthorize': {\n                                                const { wallet_uri_base } = result;\n                                                if (wallet_uri_base != null) {\n                                                    try {\n                                                        assertSecureEndpointSpecificURI(wallet_uri_base);\n                                                    }\n                                                    catch (e) {\n                                                        reject(e);\n                                                        return;\n                                                    }\n                                                }\n                                                break;\n                                            }\n                                        }\n                                        resolve(result);\n                                    },\n                                    reject,\n                                };\n                            });\n                        }));\n                        try {\n                            resolve(yield callback(wallet));\n                        }\n                        catch (e) {\n                            reject(e);\n                        }\n                        finally {\n                            disposeSocket();\n                            socket.close();\n                        }\n                        break;\n                    }\n                }\n            });\n            let disposeSocket;\n            let retryWaitTimeoutId;\n            const attemptSocketConnection = () => {\n                if (disposeSocket) {\n                    disposeSocket();\n                }\n                state = { __type: 'connecting', associationKeypair };\n                if (connectionStartTime === undefined) {\n                    connectionStartTime = Date.now();\n                }\n                socket = new WebSocket(websocketURL, [WEBSOCKET_PROTOCOL]);\n                socket.addEventListener('open', handleOpen);\n                socket.addEventListener('close', handleClose);\n                socket.addEventListener('error', handleError);\n                socket.addEventListener('message', handleMessage);\n                disposeSocket = () => {\n                    window.clearTimeout(retryWaitTimeoutId);\n                    socket.removeEventListener('open', handleOpen);\n                    socket.removeEventListener('close', handleClose);\n                    socket.removeEventListener('error', handleError);\n                    socket.removeEventListener('message', handleMessage);\n                };\n            };\n            attemptSocketConnection();\n        });\n    });\n}\n\nexport { SolanaCloneAuthorization, SolanaMobileWalletAdapterError, SolanaMobileWalletAdapterErrorCode, SolanaMobileWalletAdapterProtocolError, SolanaMobileWalletAdapterProtocolErrorCode, SolanaSignInWithSolana, SolanaSignTransactions, transact };\n","import { VersionedMessage, Transaction, VersionedTransaction, SIGNATURE_LENGTH_IN_BYTES } from '@solana/web3.js';\nimport { transact as transact$1 } from '@solana-mobile/mobile-wallet-adapter-protocol';\nimport bs58 from 'bs58';\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nfunction __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction fromUint8Array(byteArray) {\n    return window.btoa(String.fromCharCode.call(null, ...byteArray));\n}\nfunction toUint8Array(base64EncodedByteArray) {\n    return new Uint8Array(window\n        .atob(base64EncodedByteArray)\n        .split('')\n        .map((c) => c.charCodeAt(0)));\n}\n\nfunction getPayloadFromTransaction(transaction) {\n    const serializedTransaction = 'version' in transaction\n        ? transaction.serialize()\n        : transaction.serialize({\n            requireAllSignatures: false,\n            verifySignatures: false,\n        });\n    const payload = fromUint8Array(serializedTransaction);\n    return payload;\n}\nfunction getTransactionFromWireMessage(byteArray) {\n    const numSignatures = byteArray[0];\n    const messageOffset = numSignatures * SIGNATURE_LENGTH_IN_BYTES + 1;\n    const version = VersionedMessage.deserializeMessageVersion(byteArray.slice(messageOffset, byteArray.length));\n    if (version === 'legacy') {\n        return Transaction.from(byteArray);\n    }\n    else {\n        return VersionedTransaction.deserialize(byteArray);\n    }\n}\nfunction transact(callback, config) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const augmentedCallback = (wallet) => {\n            const augmentedAPI = new Proxy({}, {\n                get(target, p) {\n                    if (target[p] == null) {\n                        switch (p) {\n                            case 'signAndSendTransactions':\n                                target[p] = function (_a) {\n                                    var { minContextSlot, commitment, skipPreflight, maxRetries, waitForCommitmentToSendNextTransaction, transactions } = _a, rest = __rest(_a, [\"minContextSlot\", \"commitment\", \"skipPreflight\", \"maxRetries\", \"waitForCommitmentToSendNextTransaction\", \"transactions\"]);\n                                    return __awaiter(this, void 0, void 0, function* () {\n                                        const payloads = transactions.map(getPayloadFromTransaction);\n                                        const options = {\n                                            min_context_slot: minContextSlot,\n                                            commitment: commitment,\n                                            skip_preflight: skipPreflight,\n                                            max_retries: maxRetries,\n                                            wait_for_commitment_to_send_next_transaction: waitForCommitmentToSendNextTransaction\n                                        };\n                                        const { signatures: base64EncodedSignatures } = yield wallet.signAndSendTransactions(Object.assign(Object.assign(Object.assign({}, rest), (Object.values(options).some(element => element != null)\n                                            ? { options: options }\n                                            : null)), { payloads }));\n                                        const signatures = base64EncodedSignatures.map(toUint8Array).map(bs58.encode);\n                                        return signatures;\n                                    });\n                                };\n                                break;\n                            case 'signMessages':\n                                target[p] = function (_a) {\n                                    var { payloads } = _a, rest = __rest(_a, [\"payloads\"]);\n                                    return __awaiter(this, void 0, void 0, function* () {\n                                        const base64EncodedPayloads = payloads.map(fromUint8Array);\n                                        const { signed_payloads: base64EncodedSignedMessages } = yield wallet.signMessages(Object.assign(Object.assign({}, rest), { payloads: base64EncodedPayloads }));\n                                        const signedMessages = base64EncodedSignedMessages.map(toUint8Array);\n                                        return signedMessages;\n                                    });\n                                };\n                                break;\n                            case 'signTransactions':\n                                target[p] = function (_a) {\n                                    var { transactions } = _a, rest = __rest(_a, [\"transactions\"]);\n                                    return __awaiter(this, void 0, void 0, function* () {\n                                        const payloads = transactions.map(getPayloadFromTransaction);\n                                        const { signed_payloads: base64EncodedCompiledTransactions } = yield wallet.signTransactions(Object.assign(Object.assign({}, rest), { payloads }));\n                                        const compiledTransactions = base64EncodedCompiledTransactions.map(toUint8Array);\n                                        const signedTransactions = compiledTransactions.map(getTransactionFromWireMessage);\n                                        return signedTransactions;\n                                    });\n                                };\n                                break;\n                            default: {\n                                target[p] = wallet[p];\n                                break;\n                            }\n                        }\n                    }\n                    return target[p];\n                },\n                defineProperty() {\n                    return false;\n                },\n                deleteProperty() {\n                    return false;\n                },\n            });\n            return callback(augmentedAPI);\n        };\n        return yield transact$1(augmentedCallback, config);\n    });\n}\n\nexport { transact };\n","import { BaseSignInMessageSignerWalletAdapter, WalletReadyState, WalletPublicKeyError, WalletNotReadyError, WalletConnectionError, WalletDisconnectedError, WalletNotConnectedError, WalletSignTransactionError, WalletSendTransactionError, WalletSignMessageError } from '@solana/wallet-adapter-base';\nimport { PublicKey } from '@solana/web3.js';\nimport { transact } from '@solana-mobile/mobile-wallet-adapter-protocol-web3js';\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction toUint8Array(base64EncodedByteArray) {\n    return new Uint8Array(window\n        .atob(base64EncodedByteArray)\n        .split('')\n        .map((c) => c.charCodeAt(0)));\n}\n\nfunction getIsSupported() {\n    return (typeof window !== 'undefined' &&\n        window.isSecureContext &&\n        typeof document !== 'undefined' &&\n        /android/i.test(navigator.userAgent));\n}\n\nconst SolanaMobileWalletAdapterWalletName = 'Mobile Wallet Adapter';\nconst SIGNATURE_LENGTH_IN_BYTES = 64;\nfunction getPublicKeyFromAddress(address) {\n    const publicKeyByteArray = toUint8Array(address);\n    return new PublicKey(publicKeyByteArray);\n}\nfunction isVersionedTransaction(transaction) {\n    return 'version' in transaction;\n}\nclass SolanaMobileWalletAdapter extends BaseSignInMessageSignerWalletAdapter {\n    constructor(config) {\n        var _a;\n        super();\n        this.supportedTransactionVersions = new Set(\n        // FIXME(#244): We can't actually know what versions are supported until we know which wallet we're talking to.\n        ['legacy', 0]);\n        this.name = SolanaMobileWalletAdapterWalletName;\n        this.url = 'https://solanamobile.com/wallets';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjI4IiB3aWR0aD0iMjgiIHZpZXdCb3g9Ii0zIDAgMjggMjgiIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+PGcgZmlsbD0iI0RDQjhGRiI+PHBhdGggZD0iTTE3LjQgMTcuNEgxNXYyLjRoMi40di0yLjRabTEuMi05LjZoLTIuNHYyLjRoMi40VjcuOFoiLz48cGF0aCBkPSJNMjEuNiAzVjBoLTIuNHYzaC0zLjZWMGgtMi40djNoLTIuNHY2LjZINC41YTIuMSAyLjEgMCAxIDEgMC00LjJoMi43VjNINC41QTQuNSA0LjUgMCAwIDAgMCA3LjVWMjRoMjEuNnYtNi42aC0yLjR2NC4ySDIuNFYxMS41Yy41LjMgMS4yLjQgMS44LjVoNy41QTYuNiA2LjYgMCAwIDAgMjQgOVYzaC0yLjRabTAgNS43YTQuMiA0LjIgMCAxIDEtOC40IDBWNS40aDguNHYzLjNaIi8+PC9nPjwvc3ZnPg==';\n        this._connecting = false;\n        /**\n         * Every time the connection is recycled in some way (eg. `disconnect()` is called)\n         * increment this and use it to make sure that `transact` calls from the previous\n         * 'generation' don't continue to do work and throw exceptions.\n         */\n        this._connectionGeneration = 0;\n        this._readyState = getIsSupported() ? WalletReadyState.Loadable : WalletReadyState.Unsupported;\n        this._authorizationResultCache = config.authorizationResultCache;\n        this._addressSelector = config.addressSelector;\n        this._appIdentity = config.appIdentity;\n        this._chain = (_a = config.chain) !== null && _a !== void 0 ? _a : config.cluster;\n        this._onWalletNotFound = config.onWalletNotFound;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            this._authorizationResultCache.get().then((authorizationResult) => {\n                if (authorizationResult) {\n                    // Having a prior authorization result is, right now, the best\n                    // indication that a mobile wallet is installed. There is no API\n                    // we can use to test for whether the association URI is supported.\n                    this.declareWalletAsInstalled();\n                }\n            });\n        }\n    }\n    get publicKey() {\n        if (this._publicKey == null && this._selectedAddress != null) {\n            try {\n                this._publicKey = getPublicKeyFromAddress(this._selectedAddress);\n            }\n            catch (e) {\n                throw new WalletPublicKeyError((e instanceof Error && (e === null || e === void 0 ? void 0 : e.message)) || 'Unknown error', e);\n            }\n        }\n        return this._publicKey ? this._publicKey : null;\n    }\n    get connected() {\n        return !!this._authorizationResult;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    declareWalletAsInstalled() {\n        if (this._readyState !== WalletReadyState.Installed) {\n            this.emit('readyStateChange', (this._readyState = WalletReadyState.Installed));\n        }\n    }\n    runWithGuard(callback) {\n        return __awaiter(this, void 0, void 0, function* () {\n            try {\n                return yield callback();\n            }\n            catch (e) {\n                this.emit('error', e);\n                throw e;\n            }\n        });\n    }\n    /** @deprecated Use `autoConnect()` instead. */\n    autoConnect_DO_NOT_USE_OR_YOU_WILL_BE_FIRED() {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.autoConnect();\n        });\n    }\n    autoConnect() {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (this.connecting || this.connected) {\n                return;\n            }\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    const cachedAuthorizationResult = yield this._authorizationResultCache.get();\n                    if (cachedAuthorizationResult) {\n                        // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                        this.handleAuthorizationResult(cachedAuthorizationResult);\n                    }\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n    connect() {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (this.connecting || this.connected) {\n                return;\n            }\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    yield this.performAuthorization();\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n    performAuthorization(signInPayload) {\n        return __awaiter(this, void 0, void 0, function* () {\n            try {\n                const cachedAuthorizationResult = yield this._authorizationResultCache.get();\n                if (cachedAuthorizationResult) {\n                    // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                    this.handleAuthorizationResult(cachedAuthorizationResult);\n                    return cachedAuthorizationResult;\n                }\n                return yield this.transact((wallet) => __awaiter(this, void 0, void 0, function* () {\n                    const authorizationResult = yield wallet.authorize({\n                        chain: this._chain,\n                        identity: this._appIdentity,\n                        sign_in_payload: signInPayload,\n                    });\n                    // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                    Promise.all([\n                        this._authorizationResultCache.set(authorizationResult),\n                        this.handleAuthorizationResult(authorizationResult),\n                    ]);\n                    return authorizationResult;\n                }));\n            }\n            catch (e) {\n                throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n            }\n        });\n    }\n    handleAuthorizationResult(authorizationResult) {\n        var _a;\n        return __awaiter(this, void 0, void 0, function* () {\n            const didPublicKeysChange = \n            // Case 1: We started from having no authorization.\n            this._authorizationResult == null ||\n                // Case 2: The number of authorized accounts changed.\n                ((_a = this._authorizationResult) === null || _a === void 0 ? void 0 : _a.accounts.length) !== authorizationResult.accounts.length ||\n                // Case 3: The new list of addresses isn't exactly the same as the old list, in the same order.\n                this._authorizationResult.accounts.some((account, ii) => account.address !== authorizationResult.accounts[ii].address);\n            this._authorizationResult = authorizationResult;\n            this.declareWalletAsInstalled();\n            if (didPublicKeysChange) {\n                const nextSelectedAddress = yield this._addressSelector.select(authorizationResult.accounts.map(({ address }) => address));\n                if (nextSelectedAddress !== this._selectedAddress) {\n                    this._selectedAddress = nextSelectedAddress;\n                    delete this._publicKey;\n                    this.emit('connect', \n                    // Having just set `this._selectedAddress`, `this.publicKey` is definitely non-null\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    this.publicKey);\n                }\n            }\n        });\n    }\n    performReauthorization(wallet, authToken) {\n        return __awaiter(this, void 0, void 0, function* () {\n            try {\n                const authorizationResult = yield wallet.authorize({\n                    auth_token: authToken,\n                    identity: this._appIdentity,\n                });\n                // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                Promise.all([\n                    this._authorizationResultCache.set(authorizationResult),\n                    this.handleAuthorizationResult(authorizationResult),\n                ]);\n            }\n            catch (e) {\n                this.disconnect();\n                throw new WalletDisconnectedError((e instanceof Error && (e === null || e === void 0 ? void 0 : e.message)) || 'Unknown error', e);\n            }\n        });\n    }\n    disconnect() {\n        return __awaiter(this, void 0, void 0, function* () {\n            this._authorizationResultCache.clear(); // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n            this._connecting = false;\n            this._connectionGeneration++;\n            delete this._authorizationResult;\n            delete this._publicKey;\n            delete this._selectedAddress;\n            this.emit('disconnect');\n        });\n    }\n    transact(callback) {\n        var _a;\n        return __awaiter(this, void 0, void 0, function* () {\n            const walletUriBase = (_a = this._authorizationResult) === null || _a === void 0 ? void 0 : _a.wallet_uri_base;\n            const config = walletUriBase ? { baseUri: walletUriBase } : undefined;\n            const currentConnectionGeneration = this._connectionGeneration;\n            try {\n                return yield transact(callback, config);\n            }\n            catch (e) {\n                if (this._connectionGeneration !== currentConnectionGeneration) {\n                    yield new Promise(() => { }); // Never resolve.\n                }\n                if (e instanceof Error &&\n                    e.name === 'SolanaMobileWalletAdapterError' &&\n                    e.code === 'ERROR_WALLET_NOT_FOUND') {\n                    yield this._onWalletNotFound(this);\n                }\n                throw e;\n            }\n        });\n    }\n    assertIsAuthorized() {\n        if (!this._authorizationResult || !this._selectedAddress)\n            throw new WalletNotConnectedError();\n        return {\n            authToken: this._authorizationResult.auth_token,\n            selectedAddress: this._selectedAddress,\n        };\n    }\n    performSignTransactions(transactions) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { authToken } = this.assertIsAuthorized();\n            try {\n                return yield this.transact((wallet) => __awaiter(this, void 0, void 0, function* () {\n                    yield this.performReauthorization(wallet, authToken);\n                    const signedTransactions = yield wallet.signTransactions({\n                        transactions,\n                    });\n                    return signedTransactions;\n                }));\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error === null || error === void 0 ? void 0 : error.message, error);\n            }\n        });\n    }\n    sendTransaction(transaction, connection, options) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                const { authToken } = this.assertIsAuthorized();\n                const minContextSlot = options === null || options === void 0 ? void 0 : options.minContextSlot;\n                try {\n                    return yield this.transact((wallet) => __awaiter(this, void 0, void 0, function* () {\n                        function getTargetCommitment() {\n                            let targetCommitment;\n                            switch (connection.commitment) {\n                                case 'confirmed':\n                                case 'finalized':\n                                case 'processed':\n                                    targetCommitment = connection.commitment;\n                                    break;\n                                default:\n                                    targetCommitment = 'finalized';\n                            }\n                            let targetPreflightCommitment;\n                            switch (options === null || options === void 0 ? void 0 : options.preflightCommitment) {\n                                case 'confirmed':\n                                case 'finalized':\n                                case 'processed':\n                                    targetPreflightCommitment = options.preflightCommitment;\n                                    break;\n                                case undefined:\n                                    targetPreflightCommitment = targetCommitment;\n                                    break;\n                                default:\n                                    targetPreflightCommitment = 'finalized';\n                            }\n                            const preflightCommitmentScore = targetPreflightCommitment === 'finalized'\n                                ? 2\n                                : targetPreflightCommitment === 'confirmed'\n                                    ? 1\n                                    : 0;\n                            const targetCommitmentScore = targetCommitment === 'finalized' ? 2 : targetCommitment === 'confirmed' ? 1 : 0;\n                            return preflightCommitmentScore < targetCommitmentScore\n                                ? targetPreflightCommitment\n                                : targetCommitment;\n                        }\n                        const [capabilities, _1, _2] = yield Promise.all([\n                            wallet.getCapabilities(),\n                            this.performReauthorization(wallet, authToken),\n                            isVersionedTransaction(transaction)\n                                ? null\n                                : /**\n                                   * Unlike versioned transactions, legacy `Transaction` objects\n                                   * may not have an associated `feePayer` or `recentBlockhash`.\n                                   * This code exists to patch them up in case they are missing.\n                                   */\n                                    (() => __awaiter(this, void 0, void 0, function* () {\n                                        var _a;\n                                        transaction.feePayer || (transaction.feePayer = (_a = this.publicKey) !== null && _a !== void 0 ? _a : undefined);\n                                        if (transaction.recentBlockhash == null) {\n                                            const { blockhash } = yield connection.getLatestBlockhash({\n                                                commitment: getTargetCommitment(),\n                                            });\n                                            transaction.recentBlockhash = blockhash;\n                                        }\n                                    }))(),\n                        ]);\n                        if (capabilities.supports_sign_and_send_transactions) {\n                            const signatures = yield wallet.signAndSendTransactions({\n                                minContextSlot,\n                                transactions: [transaction],\n                            });\n                            return signatures[0];\n                        }\n                        else {\n                            const [signedTransaction] = yield wallet.signTransactions({\n                                transactions: [transaction],\n                            });\n                            if (isVersionedTransaction(signedTransaction)) {\n                                return yield connection.sendTransaction(signedTransaction);\n                            }\n                            else {\n                                const serializedTransaction = signedTransaction.serialize();\n                                return yield connection.sendRawTransaction(serializedTransaction, Object.assign(Object.assign({}, options), { preflightCommitment: getTargetCommitment() }));\n                            }\n                        }\n                    }));\n                }\n                catch (error) {\n                    throw new WalletSendTransactionError(error === null || error === void 0 ? void 0 : error.message, error);\n                }\n            }));\n        });\n    }\n    signTransaction(transaction) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                const [signedTransaction] = yield this.performSignTransactions([transaction]);\n                return signedTransaction;\n            }));\n        });\n    }\n    signAllTransactions(transactions) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                const signedTransactions = yield this.performSignTransactions(transactions);\n                return signedTransactions;\n            }));\n        });\n    }\n    signMessage(message) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                const { authToken, selectedAddress } = this.assertIsAuthorized();\n                try {\n                    return yield this.transact((wallet) => __awaiter(this, void 0, void 0, function* () {\n                        yield this.performReauthorization(wallet, authToken);\n                        const [signedMessage] = yield wallet.signMessages({\n                            addresses: [selectedAddress],\n                            payloads: [message],\n                        });\n                        const signature = signedMessage.slice(-SIGNATURE_LENGTH_IN_BYTES);\n                        return signature;\n                    }));\n                }\n                catch (error) {\n                    throw new WalletSignMessageError(error === null || error === void 0 ? void 0 : error.message, error);\n                }\n            }));\n        });\n    }\n    signIn(input) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => __awaiter(this, void 0, void 0, function* () {\n                var _a, _b;\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    const authorizationResult = yield this.performAuthorization(Object.assign(Object.assign({}, input), { domain: (_a = input === null || input === void 0 ? void 0 : input.domain) !== null && _a !== void 0 ? _a : window.location.host }));\n                    if (!authorizationResult.sign_in_result) {\n                        throw new Error(\"Sign in failed, no sign in result returned by wallet\");\n                    }\n                    const signedInAddress = authorizationResult.sign_in_result.address;\n                    const signedInAccount = Object.assign(Object.assign({}, (_b = authorizationResult.accounts.find(acc => acc.address == signedInAddress)) !== null && _b !== void 0 ? _b : {\n                        address: signedInAddress\n                    }), { publicKey: toUint8Array(signedInAddress) });\n                    return {\n                        account: signedInAccount,\n                        signedMessage: toUint8Array(authorizationResult.sign_in_result.signed_message),\n                        signature: toUint8Array(authorizationResult.sign_in_result.signature)\n                    };\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n}\n\nfunction createDefaultAddressSelector() {\n    return {\n        select(addresses) {\n            return __awaiter(this, void 0, void 0, function* () {\n                return addresses[0];\n            });\n        },\n    };\n}\n\nconst CACHE_KEY = 'SolanaMobileWalletAdapterDefaultAuthorizationCache';\nfunction createDefaultAuthorizationResultCache() {\n    let storage;\n    try {\n        storage = window.localStorage;\n        // eslint-disable-next-line no-empty\n    }\n    catch (_a) { }\n    return {\n        clear() {\n            return __awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    storage.removeItem(CACHE_KEY);\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n        get() {\n            return __awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    return JSON.parse(storage.getItem(CACHE_KEY)) || undefined;\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n        set(authorizationResult) {\n            return __awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    storage.setItem(CACHE_KEY, JSON.stringify(authorizationResult));\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n    };\n}\n\nfunction defaultWalletNotFoundHandler(mobileWalletAdapter) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (typeof window !== 'undefined') {\n            window.location.assign(mobileWalletAdapter.url);\n        }\n    });\n}\nfunction createDefaultWalletNotFoundHandler() {\n    return defaultWalletNotFoundHandler;\n}\n\nexport { SolanaMobileWalletAdapter, SolanaMobileWalletAdapterWalletName, createDefaultAddressSelector, createDefaultAuthorizationResultCache, createDefaultWalletNotFoundHandler };\n","/** Name of the feature. */\nexport const StandardConnect = 'standard:connect';\n/**\n * @deprecated Use {@link StandardConnect} instead.\n *\n * @group Deprecated\n */\nexport const Connect = StandardConnect;\n//# sourceMappingURL=connect.js.map","/** Name of the feature. */\nexport const StandardEvents = 'standard:events';\n/**\n * @deprecated Use {@link StandardEvents} instead.\n *\n * @group Deprecated\n */\nexport const Events = StandardEvents;\n//# sourceMappingURL=events.js.map","import { SolanaSignAndSendTransaction, SolanaSignTransaction, } from '@solana/wallet-standard-features';\nimport { StandardConnect, StandardEvents, } from '@wallet-standard/features';\nexport function isWalletAdapterCompatibleStandardWallet(wallet) {\n    return (StandardConnect in wallet.features &&\n        StandardEvents in wallet.features &&\n        (SolanaSignAndSendTransaction in wallet.features || SolanaSignTransaction in wallet.features));\n}\n//# sourceMappingURL=standard.js.map","import { isWalletAdapterCompatibleStandardWallet, } from '@solana/wallet-adapter-base';\n/**\n * @deprecated Use `isWalletAdapterCompatibleStandardWallet` from `@solana/wallet-adapter-base` instead.\n *\n * @group Deprecated\n */\nexport const isWalletAdapterCompatibleWallet = isWalletAdapterCompatibleStandardWallet;\n//# sourceMappingURL=types.js.map","/** Name of the feature. */\nexport const SolanaSignIn = 'solana:signIn';\n//# sourceMappingURL=signIn.js.map","/** Solana Mainnet (beta) cluster, e.g. https://api.mainnet-beta.solana.com */\nexport const SOLANA_MAINNET_CHAIN = 'solana:mainnet';\n/** Solana Devnet cluster, e.g. https://api.devnet.solana.com */\nexport const SOLANA_DEVNET_CHAIN = 'solana:devnet';\n/** Solana Testnet cluster, e.g. https://api.testnet.solana.com */\nexport const SOLANA_TESTNET_CHAIN = 'solana:testnet';\n/** Solana Localnet cluster, e.g. http://localhost:8899 */\nexport const SOLANA_LOCALNET_CHAIN = 'solana:localnet';\n/** Array of all Solana clusters */\nexport const SOLANA_CHAINS = [\n    SOLANA_MAINNET_CHAIN,\n    SOLANA_DEVNET_CHAIN,\n    SOLANA_TESTNET_CHAIN,\n    SOLANA_LOCALNET_CHAIN,\n];\n/**\n * Check if a chain corresponds with one of the Solana clusters.\n */\nexport function isSolanaChain(chain) {\n    return SOLANA_CHAINS.includes(chain);\n}\n//# sourceMappingURL=index.js.map","import { SOLANA_DEVNET_CHAIN, SOLANA_LOCALNET_CHAIN, SOLANA_MAINNET_CHAIN, SOLANA_TESTNET_CHAIN, } from '@solana/wallet-standard-chains';\n/** TODO: docs */\nexport const MAINNET_ENDPOINT = 'https://api.mainnet-beta.solana.com';\n/** TODO: docs */\nexport const DEVNET_ENDPOINT = 'https://api.devnet.solana.com';\n/** TODO: docs */\nexport const TESTNET_ENDPOINT = 'https://api.testnet.solana.com';\n/** TODO: docs */\nexport const LOCALNET_ENDPOINT = 'http://localhost:8899';\n/**\n * TODO: docs\n */\nexport function getChainForEndpoint(endpoint) {\n    if (endpoint.includes(MAINNET_ENDPOINT))\n        return SOLANA_MAINNET_CHAIN;\n    if (/\\bdevnet\\b/i.test(endpoint))\n        return SOLANA_DEVNET_CHAIN;\n    if (/\\btestnet\\b/i.test(endpoint))\n        return SOLANA_TESTNET_CHAIN;\n    if (/\\blocalhost\\b/i.test(endpoint) || /\\b127\\.0\\.0\\.1\\b/.test(endpoint))\n        return SOLANA_LOCALNET_CHAIN;\n    return SOLANA_MAINNET_CHAIN;\n}\n/**\n * TODO: docs\n */\nexport function getEndpointForChain(chain, endpoint) {\n    if (endpoint)\n        return endpoint;\n    if (chain === SOLANA_MAINNET_CHAIN)\n        return MAINNET_ENDPOINT;\n    if (chain === SOLANA_DEVNET_CHAIN)\n        return DEVNET_ENDPOINT;\n    if (chain === SOLANA_TESTNET_CHAIN)\n        return TESTNET_ENDPOINT;\n    if (chain === SOLANA_LOCALNET_CHAIN)\n        return LOCALNET_ENDPOINT;\n    return MAINNET_ENDPOINT;\n}\n//# sourceMappingURL=endpoint.js.map","/**\n * TODO: docs\n */\nexport function getCommitment(commitment) {\n    switch (commitment) {\n        case 'processed':\n        case 'confirmed':\n        case 'finalized':\n        case undefined:\n            return commitment;\n        case 'recent':\n            return 'processed';\n        case 'single':\n        case 'singleGossip':\n            return 'confirmed';\n        case 'max':\n        case 'root':\n            return 'finalized';\n        default:\n            return undefined;\n    }\n}\n//# sourceMappingURL=commitment.js.map","/** Name of the feature. */\nexport const StandardDisconnect = 'standard:disconnect';\n/**\n * @deprecated Use {@link StandardDisconnect} instead.\n *\n * @group Deprecated\n */\nexport const Disconnect = StandardDisconnect;\n//# sourceMappingURL=disconnect.js.map","var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _ReadonlyWalletAccount_address, _ReadonlyWalletAccount_publicKey, _ReadonlyWalletAccount_chains, _ReadonlyWalletAccount_features, _ReadonlyWalletAccount_label, _ReadonlyWalletAccount_icon;\n/**\n * Base implementation of a {@link \"@wallet-standard/base\".WalletAccount} to be used or extended by a\n * {@link \"@wallet-standard/base\".Wallet}.\n *\n * `WalletAccount` properties must be read-only. This class enforces this by making all properties\n * [truly private](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes/Private_class_fields) and\n * read-only, using getters for access, returning copies instead of references, and calling\n * [Object.freeze](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/freeze)\n * on the instance.\n *\n * @group Account\n */\nexport class ReadonlyWalletAccount {\n    /**\n     * Create and freeze a read-only account.\n     *\n     * @param account Account to copy properties from.\n     */\n    constructor(account) {\n        _ReadonlyWalletAccount_address.set(this, void 0);\n        _ReadonlyWalletAccount_publicKey.set(this, void 0);\n        _ReadonlyWalletAccount_chains.set(this, void 0);\n        _ReadonlyWalletAccount_features.set(this, void 0);\n        _ReadonlyWalletAccount_label.set(this, void 0);\n        _ReadonlyWalletAccount_icon.set(this, void 0);\n        if (new.target === ReadonlyWalletAccount) {\n            Object.freeze(this);\n        }\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_address, account.address, \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_publicKey, account.publicKey.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_chains, account.chains.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_features, account.features.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_label, account.label, \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_icon, account.icon, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.address | WalletAccount::address} */\n    get address() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_address, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.publicKey | WalletAccount::publicKey} */\n    get publicKey() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_publicKey, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.chains | WalletAccount::chains} */\n    get chains() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_chains, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.features | WalletAccount::features} */\n    get features() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_features, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.label | WalletAccount::label} */\n    get label() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_label, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.icon | WalletAccount::icon} */\n    get icon() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_icon, \"f\");\n    }\n}\n_ReadonlyWalletAccount_address = new WeakMap(), _ReadonlyWalletAccount_publicKey = new WeakMap(), _ReadonlyWalletAccount_chains = new WeakMap(), _ReadonlyWalletAccount_features = new WeakMap(), _ReadonlyWalletAccount_label = new WeakMap(), _ReadonlyWalletAccount_icon = new WeakMap();\n/**\n * Efficiently compare {@link Indexed} arrays (e.g. `Array` and `Uint8Array`).\n *\n * @param a An array.\n * @param b Another array.\n *\n * @return `true` if the arrays have the same length and elements, `false` otherwise.\n *\n * @group Util\n */\nexport function arraysEqual(a, b) {\n    if (a === b)\n        return true;\n    const length = a.length;\n    if (length !== b.length)\n        return false;\n    for (let i = 0; i < length; i++) {\n        if (a[i] !== b[i])\n            return false;\n    }\n    return true;\n}\n/**\n * Efficiently compare byte arrays, using {@link arraysEqual}.\n *\n * @param a A byte array.\n * @param b Another byte array.\n *\n * @return `true` if the byte arrays have the same length and bytes, `false` otherwise.\n *\n * @group Util\n */\nexport function bytesEqual(a, b) {\n    return arraysEqual(a, b);\n}\n/**\n * Efficiently concatenate byte arrays without modifying them.\n *\n * @param first  A byte array.\n * @param others Additional byte arrays.\n *\n * @return New byte array containing the concatenation of all the byte arrays.\n *\n * @group Util\n */\nexport function concatBytes(first, ...others) {\n    const length = others.reduce((length, bytes) => length + bytes.length, first.length);\n    const bytes = new Uint8Array(length);\n    bytes.set(first, 0);\n    for (const other of others) {\n        bytes.set(other, bytes.length);\n    }\n    return bytes;\n}\n/**\n * Create a new object with a subset of fields from a source object.\n *\n * @param source Object to pick fields from.\n * @param keys   Names of fields to pick.\n *\n * @return New object with only the picked fields.\n *\n * @group Util\n */\nexport function pick(source, ...keys) {\n    const picked = {};\n    for (const key of keys) {\n        picked[key] = source[key];\n    }\n    return picked;\n}\n/**\n * Call a callback function, catch an error if it throws, and log the error without rethrowing.\n *\n * @param callback Function to call.\n *\n * @group Util\n */\nexport function guard(callback) {\n    try {\n        callback();\n    }\n    catch (error) {\n        console.error(error);\n    }\n}\n//# sourceMappingURL=util.js.map","var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _StandardWalletAdapter_instances, _StandardWalletAdapter_account, _StandardWalletAdapter_publicKey, _StandardWalletAdapter_connecting, _StandardWalletAdapter_disconnecting, _StandardWalletAdapter_off, _StandardWalletAdapter_supportedTransactionVersions, _StandardWalletAdapter_wallet, _StandardWalletAdapter_readyState, _StandardWalletAdapter_connect, _StandardWalletAdapter_connected, _StandardWalletAdapter_disconnected, _StandardWalletAdapter_reset, _StandardWalletAdapter_changed, _StandardWalletAdapter_signTransaction, _StandardWalletAdapter_signAllTransactions, _StandardWalletAdapter_signMessage, _StandardWalletAdapter_signIn;\nimport { BaseWalletAdapter, isVersionedTransaction, WalletAccountError, WalletConfigError, WalletConnectionError, WalletDisconnectedError, WalletDisconnectionError, WalletError, WalletNotConnectedError, WalletNotReadyError, WalletPublicKeyError, WalletReadyState, WalletSendTransactionError, WalletSignInError, WalletSignMessageError, WalletSignTransactionError, } from '@solana/wallet-adapter-base';\nimport { SolanaSignAndSendTransaction, SolanaSignIn, SolanaSignMessage, SolanaSignTransaction, } from '@solana/wallet-standard-features';\nimport { getChainForEndpoint, getCommitment } from '@solana/wallet-standard-util';\nimport { PublicKey, Transaction, VersionedTransaction } from '@solana/web3.js';\nimport { StandardConnect, StandardDisconnect, StandardEvents, } from '@wallet-standard/features';\nimport { arraysEqual } from '@wallet-standard/wallet';\nimport bs58 from 'bs58';\n/** TODO: docs */\nexport class StandardWalletAdapter extends BaseWalletAdapter {\n    constructor({ wallet }) {\n        super();\n        _StandardWalletAdapter_instances.add(this);\n        _StandardWalletAdapter_account.set(this, void 0);\n        _StandardWalletAdapter_publicKey.set(this, void 0);\n        _StandardWalletAdapter_connecting.set(this, void 0);\n        _StandardWalletAdapter_disconnecting.set(this, void 0);\n        _StandardWalletAdapter_off.set(this, void 0);\n        _StandardWalletAdapter_supportedTransactionVersions.set(this, void 0);\n        _StandardWalletAdapter_wallet.set(this, void 0);\n        _StandardWalletAdapter_readyState.set(this, typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.Installed);\n        _StandardWalletAdapter_changed.set(this, (properties) => {\n            // If accounts have changed on the wallet, reflect this on the adapter.\n            if ('accounts' in properties) {\n                const account = __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts[0];\n                // If the adapter isn't connected, or is disconnecting, or the first account hasn't changed, do nothing.\n                if (__classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\") && !__classPrivateFieldGet(this, _StandardWalletAdapter_disconnecting, \"f\") && account !== __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")) {\n                    // If there's a connected account, connect the adapter. Otherwise, disconnect it.\n                    if (account) {\n                        // Connect the adapter.\n                        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, account);\n                    }\n                    else {\n                        // Emit an error because the wallet spontaneously disconnected.\n                        this.emit('error', new WalletDisconnectedError());\n                        // Disconnect the adapter.\n                        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_disconnected).call(this);\n                    }\n                }\n            }\n            // After reflecting account changes, if features have changed on the wallet, reflect this on the adapter.\n            if ('features' in properties) {\n                __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n            }\n        });\n        __classPrivateFieldSet(this, _StandardWalletAdapter_wallet, wallet, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_off, __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardEvents].on('change', __classPrivateFieldGet(this, _StandardWalletAdapter_changed, \"f\")), \"f\");\n        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    }\n    get name() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").name;\n    }\n    get url() {\n        return 'https://github.com/solana-labs/wallet-standard';\n    }\n    get icon() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").icon;\n    }\n    get readyState() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_readyState, \"f\");\n    }\n    get publicKey() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_publicKey, \"f\");\n    }\n    get connecting() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_connecting, \"f\");\n    }\n    get supportedTransactionVersions() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_supportedTransactionVersions, \"f\");\n    }\n    get wallet() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\");\n    }\n    get standard() {\n        return true;\n    }\n    destroy() {\n        __classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n        __classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n        const off = __classPrivateFieldGet(this, _StandardWalletAdapter_off, \"f\");\n        if (off) {\n            __classPrivateFieldSet(this, _StandardWalletAdapter_off, null, \"f\");\n            off();\n        }\n    }\n    async autoConnect() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connect).call(this, { silent: true });\n    }\n    async connect() {\n        return __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connect).call(this);\n    }\n    async disconnect() {\n        if (StandardDisconnect in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n            try {\n                __classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, true, \"f\");\n                await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardDisconnect].disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n            finally {\n                __classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n            }\n        }\n        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_disconnected).call(this);\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const account = __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n            if (!account)\n                throw new WalletNotConnectedError();\n            let feature;\n            if (SolanaSignAndSendTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n                if (account.features.includes(SolanaSignAndSendTransaction)) {\n                    feature = SolanaSignAndSendTransaction;\n                }\n                else if (SolanaSignTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features &&\n                    account.features.includes(SolanaSignTransaction)) {\n                    feature = SolanaSignTransaction;\n                }\n                else {\n                    throw new WalletAccountError();\n                }\n            }\n            else if (SolanaSignTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n                if (!account.features.includes(SolanaSignTransaction))\n                    throw new WalletAccountError();\n                feature = SolanaSignTransaction;\n            }\n            else {\n                throw new WalletConfigError();\n            }\n            const chain = getChainForEndpoint(connection.rpcEndpoint);\n            if (!account.chains.includes(chain))\n                throw new WalletSendTransactionError();\n            try {\n                const { signers, ...sendOptions } = options;\n                let serializedTransaction;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                    serializedTransaction = transaction.serialize();\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                    serializedTransaction = new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    }));\n                }\n                if (feature === SolanaSignAndSendTransaction) {\n                    const [output] = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignAndSendTransaction].signAndSendTransaction({\n                        account,\n                        chain,\n                        transaction: serializedTransaction,\n                        options: {\n                            preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                            skipPreflight: sendOptions.skipPreflight,\n                            maxRetries: sendOptions.maxRetries,\n                            minContextSlot: sendOptions.minContextSlot,\n                        },\n                    });\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    return bs58.encode(output.signature);\n                }\n                else {\n                    const [output] = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignTransaction].signTransaction({\n                        account,\n                        chain,\n                        transaction: serializedTransaction,\n                        options: {\n                            preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                            minContextSlot: sendOptions.minContextSlot,\n                        },\n                    });\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    return await connection.sendRawTransaction(output.signedTransaction, {\n                        ...sendOptions,\n                        preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                    });\n                }\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n_StandardWalletAdapter_account = new WeakMap(), _StandardWalletAdapter_publicKey = new WeakMap(), _StandardWalletAdapter_connecting = new WeakMap(), _StandardWalletAdapter_disconnecting = new WeakMap(), _StandardWalletAdapter_off = new WeakMap(), _StandardWalletAdapter_supportedTransactionVersions = new WeakMap(), _StandardWalletAdapter_wallet = new WeakMap(), _StandardWalletAdapter_readyState = new WeakMap(), _StandardWalletAdapter_changed = new WeakMap(), _StandardWalletAdapter_instances = new WeakSet(), _StandardWalletAdapter_connect = async function _StandardWalletAdapter_connect(input) {\n    try {\n        if (this.connected || this.connecting)\n            return;\n        if (__classPrivateFieldGet(this, _StandardWalletAdapter_readyState, \"f\") !== WalletReadyState.Installed)\n            throw new WalletNotReadyError();\n        __classPrivateFieldSet(this, _StandardWalletAdapter_connecting, true, \"f\");\n        if (!__classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts.length) {\n            try {\n                await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardConnect].connect(input);\n            }\n            catch (error) {\n                throw new WalletConnectionError(error?.message, error);\n            }\n        }\n        const account = __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts[0];\n        if (!account)\n            throw new WalletAccountError();\n        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, account);\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n    finally {\n        __classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n    }\n}, _StandardWalletAdapter_connected = function _StandardWalletAdapter_connected(account) {\n    let publicKey;\n    try {\n        // Use account.address instead of account.publicKey since address could be a PDA\n        publicKey = new PublicKey(account.address);\n    }\n    catch (error) {\n        throw new WalletPublicKeyError(error?.message, error);\n    }\n    __classPrivateFieldSet(this, _StandardWalletAdapter_account, account, \"f\");\n    __classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, publicKey, \"f\");\n    __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    this.emit('connect', publicKey);\n}, _StandardWalletAdapter_disconnected = function _StandardWalletAdapter_disconnected() {\n    __classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n    __classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n    __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    this.emit('disconnect');\n}, _StandardWalletAdapter_reset = function _StandardWalletAdapter_reset() {\n    const supportedTransactionVersions = SolanaSignAndSendTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features\n        ? __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignAndSendTransaction].supportedTransactionVersions\n        : __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignTransaction].supportedTransactionVersions;\n    __classPrivateFieldSet(this, _StandardWalletAdapter_supportedTransactionVersions, arraysEqual(supportedTransactionVersions, ['legacy'])\n        ? null\n        : new Set(supportedTransactionVersions), \"f\");\n    if (SolanaSignTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features && __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")?.features.includes(SolanaSignTransaction)) {\n        this.signTransaction = __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signTransaction);\n        this.signAllTransactions = __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signAllTransactions);\n    }\n    else {\n        delete this.signTransaction;\n        delete this.signAllTransactions;\n    }\n    if (SolanaSignMessage in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features && __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")?.features.includes(SolanaSignMessage)) {\n        this.signMessage = __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signMessage);\n    }\n    else {\n        delete this.signMessage;\n    }\n    if (SolanaSignIn in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n        this.signIn = __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signIn);\n    }\n    else {\n        delete this.signIn;\n    }\n}, _StandardWalletAdapter_signTransaction = async function _StandardWalletAdapter_signTransaction(transaction) {\n    try {\n        const account = __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(SolanaSignTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(SolanaSignTransaction))\n            throw new WalletAccountError();\n        try {\n            const signedTransactions = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignTransaction].signTransaction({\n                account,\n                transaction: isVersionedTransaction(transaction)\n                    ? transaction.serialize()\n                    : new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    })),\n            });\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const serializedTransaction = signedTransactions[0].signedTransaction;\n            return (isVersionedTransaction(transaction)\n                ? VersionedTransaction.deserialize(serializedTransaction)\n                : Transaction.from(serializedTransaction));\n        }\n        catch (error) {\n            if (error instanceof WalletError)\n                throw error;\n            throw new WalletSignTransactionError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signAllTransactions = async function _StandardWalletAdapter_signAllTransactions(transactions) {\n    try {\n        const account = __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(SolanaSignTransaction in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(SolanaSignTransaction))\n            throw new WalletAccountError();\n        try {\n            const signedTransactions = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignTransaction].signTransaction(...transactions.map((transaction) => ({\n                account,\n                transaction: isVersionedTransaction(transaction)\n                    ? transaction.serialize()\n                    : new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    })),\n            })));\n            return transactions.map((transaction, index) => {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                const signedTransaction = signedTransactions[index].signedTransaction;\n                return (isVersionedTransaction(transaction)\n                    ? VersionedTransaction.deserialize(signedTransaction)\n                    : Transaction.from(signedTransaction));\n            });\n        }\n        catch (error) {\n            throw new WalletSignTransactionError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signMessage = async function _StandardWalletAdapter_signMessage(message) {\n    try {\n        const account = __classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(SolanaSignMessage in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(SolanaSignMessage))\n            throw new WalletAccountError();\n        try {\n            const signedMessages = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignMessage].signMessage({\n                account,\n                message,\n            });\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            return signedMessages[0].signature;\n        }\n        catch (error) {\n            throw new WalletSignMessageError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signIn = async function _StandardWalletAdapter_signIn(input = {}) {\n    try {\n        if (!(SolanaSignIn in __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        let output;\n        try {\n            [output] = await __classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignIn].signIn(input);\n        }\n        catch (error) {\n            throw new WalletSignInError(error?.message, error);\n        }\n        if (!output)\n            throw new WalletSignInError();\n        __classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, output.account);\n        return output;\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n};\n//# sourceMappingURL=adapter.js.map","var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _AppReadyEvent_detail;\nlet wallets = undefined;\nconst registered = new Set();\nconst listeners = {};\n/**\n * Get an API for {@link Wallets.get | getting}, {@link Wallets.on | listening for}, and\n * {@link Wallets.register | registering} {@link \"@wallet-standard/base\".Wallet | Wallets}.\n *\n * When called for the first time --\n *\n * This dispatches a {@link \"@wallet-standard/base\".WindowAppReadyEvent} to notify each Wallet that the app is ready\n * to register it.\n *\n * This also adds a listener for {@link \"@wallet-standard/base\".WindowRegisterWalletEvent} to listen for a notification\n * from each Wallet that the Wallet is ready to be registered by the app.\n *\n * This combination of event dispatch and listener guarantees that each Wallet will be registered synchronously as soon\n * as the app is ready whether the app loads before or after each Wallet.\n *\n * @return API for getting, listening for, and registering Wallets.\n *\n * @group App\n */\nexport function getWallets() {\n    if (wallets)\n        return wallets;\n    wallets = Object.freeze({ register, get, on });\n    if (typeof window === 'undefined')\n        return wallets;\n    const api = Object.freeze({ register });\n    try {\n        window.addEventListener('wallet-standard:register-wallet', ({ detail: callback }) => callback(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:register-wallet event listener could not be added\\n', error);\n    }\n    try {\n        window.dispatchEvent(new AppReadyEvent(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:app-ready event could not be dispatched\\n', error);\n    }\n    return wallets;\n}\nfunction register(...wallets) {\n    // Filter out wallets that have already been registered.\n    // This prevents the same wallet from being registered twice, but it also prevents wallets from being\n    // unregistered by reusing a reference to the wallet to obtain the unregister function for it.\n    wallets = wallets.filter((wallet) => !registered.has(wallet));\n    // If there are no new wallets to register, just return a no-op unregister function.\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    if (!wallets.length)\n        return () => { };\n    wallets.forEach((wallet) => registered.add(wallet));\n    listeners['register']?.forEach((listener) => guard(() => listener(...wallets)));\n    // Return a function that unregisters the registered wallets.\n    return function unregister() {\n        wallets.forEach((wallet) => registered.delete(wallet));\n        listeners['unregister']?.forEach((listener) => guard(() => listener(...wallets)));\n    };\n}\nfunction get() {\n    return [...registered];\n}\nfunction on(event, listener) {\n    listeners[event]?.push(listener) || (listeners[event] = [listener]);\n    // Return a function that removes the event listener.\n    return function off() {\n        listeners[event] = listeners[event]?.filter((existingListener) => listener !== existingListener);\n    };\n}\nfunction guard(callback) {\n    try {\n        callback();\n    }\n    catch (error) {\n        console.error(error);\n    }\n}\nclass AppReadyEvent extends Event {\n    constructor(api) {\n        super('wallet-standard:app-ready', {\n            bubbles: false,\n            cancelable: false,\n            composed: false,\n        });\n        _AppReadyEvent_detail.set(this, void 0);\n        __classPrivateFieldSet(this, _AppReadyEvent_detail, api, \"f\");\n    }\n    get detail() {\n        return __classPrivateFieldGet(this, _AppReadyEvent_detail, \"f\");\n    }\n    get type() {\n        return 'wallet-standard:app-ready';\n    }\n    /** @deprecated */\n    preventDefault() {\n        throw new Error('preventDefault cannot be called');\n    }\n    /** @deprecated */\n    stopImmediatePropagation() {\n        throw new Error('stopImmediatePropagation cannot be called');\n    }\n    /** @deprecated */\n    stopPropagation() {\n        throw new Error('stopPropagation cannot be called');\n    }\n}\n_AppReadyEvent_detail = new WeakMap();\n/**\n * @deprecated Use {@link getWallets} instead.\n *\n * @group Deprecated\n */\nexport function DEPRECATED_getWallets() {\n    if (wallets)\n        return wallets;\n    wallets = getWallets();\n    if (typeof window === 'undefined')\n        return wallets;\n    const callbacks = window.navigator.wallets || [];\n    if (!Array.isArray(callbacks)) {\n        console.error('window.navigator.wallets is not an array');\n        return wallets;\n    }\n    const { register } = wallets;\n    const push = (...callbacks) => callbacks.forEach((callback) => guard(() => callback({ register })));\n    try {\n        Object.defineProperty(window.navigator, 'wallets', {\n            value: Object.freeze({ push }),\n        });\n    }\n    catch (error) {\n        console.error('window.navigator.wallets could not be set');\n        return wallets;\n    }\n    push(...callbacks);\n    return wallets;\n}\n//# sourceMappingURL=wallets.js.map","import { isWalletAdapterCompatibleWallet, StandardWalletAdapter } from '@solana/wallet-standard-wallet-adapter-base';\nimport { DEPRECATED_getWallets } from '@wallet-standard/app';\nimport { useEffect, useMemo, useRef, useState } from 'react';\nexport function useStandardWalletAdapters(adapters) {\n    const warnings = useConstant(() => new Set());\n    const { get, on } = useConstant(() => DEPRECATED_getWallets());\n    const [standardAdapters, setStandardAdapters] = useState(() => wrapWalletsWithAdapters(get()));\n    useEffect(() => {\n        const listeners = [\n            on('register', (...wallets) => setStandardAdapters((standardAdapters) => [...standardAdapters, ...wrapWalletsWithAdapters(wallets)])),\n            on('unregister', (...wallets) => setStandardAdapters((standardAdapters) => standardAdapters.filter((standardAdapter) => wallets.some((wallet) => wallet === standardAdapter.wallet)))),\n        ];\n        return () => listeners.forEach((off) => off());\n    }, [on]);\n    const prevStandardAdapters = usePrevious(standardAdapters);\n    useEffect(() => {\n        if (!prevStandardAdapters)\n            return;\n        const currentAdapters = new Set(standardAdapters);\n        const removedAdapters = new Set(prevStandardAdapters.filter((previousAdapter) => !currentAdapters.has(previousAdapter)));\n        removedAdapters.forEach((adapter) => adapter.destroy());\n    }, [prevStandardAdapters, standardAdapters]);\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n    useEffect(() => () => standardAdapters.forEach((adapter) => adapter.destroy()), []);\n    return useMemo(() => [\n        ...standardAdapters,\n        ...adapters.filter(({ name }) => {\n            if (standardAdapters.some((standardAdapter) => standardAdapter.name === name)) {\n                if (!warnings.has(name)) {\n                    warnings.add(name);\n                    console.warn(`${name} was registered as a Standard Wallet. The Wallet Adapter for ${name} can be removed from your app.`);\n                }\n                return false;\n            }\n            return true;\n        }),\n    ], [standardAdapters, adapters, warnings]);\n}\nfunction useConstant(fn) {\n    const ref = useRef();\n    if (!ref.current) {\n        ref.current = { value: fn() };\n    }\n    return ref.current.value;\n}\nfunction usePrevious(state) {\n    const ref = useRef();\n    useEffect(() => {\n        ref.current = state;\n    });\n    return ref.current;\n}\nfunction wrapWalletsWithAdapters(wallets) {\n    return wallets.filter(isWalletAdapterCompatibleWallet).map((wallet) => new StandardWalletAdapter({ wallet }));\n}\n//# sourceMappingURL=useStandardWalletAdapters.js.map","import { SolanaMobileWalletAdapterWalletName } from '@solana-mobile/wallet-adapter-mobile';\nimport { WalletReadyState } from '@solana/wallet-adapter-base';\nexport var Environment;\n(function (Environment) {\n    Environment[Environment[\"DESKTOP_WEB\"] = 0] = \"DESKTOP_WEB\";\n    Environment[Environment[\"MOBILE_WEB\"] = 1] = \"MOBILE_WEB\";\n})(Environment || (Environment = {}));\nfunction isWebView(userAgentString) {\n    return /(WebView|Version\\/.+(Chrome)\\/(\\d+)\\.(\\d+)\\.(\\d+)\\.(\\d+)|; wv\\).+(Chrome)\\/(\\d+)\\.(\\d+)\\.(\\d+)\\.(\\d+))/i.test(userAgentString);\n}\nexport default function getEnvironment({ adapters, userAgentString }) {\n    if (adapters.some((adapter) => adapter.name !== SolanaMobileWalletAdapterWalletName &&\n        adapter.readyState === WalletReadyState.Installed)) {\n        /**\n         * There are only two ways a browser extension adapter should be able to reach `Installed` status:\n         *\n         *     1. Its browser extension is installed.\n         *     2. The app is running on a mobile wallet's in-app browser.\n         *\n         * In either case, we consider the environment to be desktop-like.\n         */\n        return Environment.DESKTOP_WEB;\n    }\n    if (userAgentString &&\n        // Step 1: Check whether we're on a platform that supports MWA at all.\n        /android/i.test(userAgentString) &&\n        // Step 2: Determine that we are *not* running in a WebView.\n        !isWebView(userAgentString)) {\n        return Environment.MOBILE_WEB;\n    }\n    else {\n        return Environment.DESKTOP_WEB;\n    }\n}\n//# sourceMappingURL=getEnvironment.js.map","export default function getInferredClusterFromEndpoint(endpoint) {\n    if (!endpoint) {\n        return 'mainnet-beta';\n    }\n    if (/devnet/i.test(endpoint)) {\n        return 'devnet';\n    }\n    else if (/testnet/i.test(endpoint)) {\n        return 'testnet';\n    }\n    else {\n        return 'mainnet-beta';\n    }\n}\n//# sourceMappingURL=getInferredClusterFromEndpoint.js.map","import { useEffect, useRef, useState } from 'react';\nexport function useLocalStorage(key, defaultState) {\n    const state = useState(() => {\n        try {\n            const value = localStorage.getItem(key);\n            if (value)\n                return JSON.parse(value);\n        }\n        catch (error) {\n            if (typeof window !== 'undefined') {\n                console.error(error);\n            }\n        }\n        return defaultState;\n    });\n    const value = state[0];\n    const isFirstRenderRef = useRef(true);\n    useEffect(() => {\n        if (isFirstRenderRef.current) {\n            isFirstRenderRef.current = false;\n            return;\n        }\n        try {\n            if (value === null) {\n                localStorage.removeItem(key);\n            }\n            else {\n                localStorage.setItem(key, JSON.stringify(value));\n            }\n        }\n        catch (error) {\n            if (typeof window !== 'undefined') {\n                console.error(error);\n            }\n        }\n    }, [value, key]);\n    return state;\n}\n//# sourceMappingURL=useLocalStorage.js.map","import { WalletError } from '@solana/wallet-adapter-base';\nexport class WalletNotSelectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotSelectedError';\n    }\n}\n//# sourceMappingURL=errors.js.map","import { WalletNotConnectedError, WalletNotReadyError, WalletReadyState, } from '@solana/wallet-adapter-base';\nimport React, { useCallback, useEffect, useMemo, useRef, useState } from 'react';\nimport { WalletNotSelectedError } from './errors.js';\nimport { WalletContext } from './useWallet.js';\nexport function WalletProviderBase({ children, wallets: adapters, adapter, isUnloadingRef, onAutoConnectRequest, onConnectError, onError, onSelectWallet, }) {\n    const isConnectingRef = useRef(false);\n    const [connecting, setConnecting] = useState(false);\n    const isDisconnectingRef = useRef(false);\n    const [disconnecting, setDisconnecting] = useState(false);\n    const [publicKey, setPublicKey] = useState(() => adapter?.publicKey ?? null);\n    const [connected, setConnected] = useState(() => adapter?.connected ?? false);\n    /**\n     * Store the error handlers as refs so that a change in the\n     * custom error handler does not recompute other dependencies.\n     */\n    const onErrorRef = useRef(onError);\n    useEffect(() => {\n        onErrorRef.current = onError;\n        return () => {\n            onErrorRef.current = undefined;\n        };\n    }, [onError]);\n    const handleErrorRef = useRef((error, adapter) => {\n        if (!isUnloadingRef.current) {\n            if (onErrorRef.current) {\n                onErrorRef.current(error, adapter);\n            }\n            else {\n                console.error(error, adapter);\n                if (error instanceof WalletNotReadyError && typeof window !== 'undefined' && adapter) {\n                    window.open(adapter.url, '_blank');\n                }\n            }\n        }\n        return error;\n    });\n    // Wrap adapters to conform to the `Wallet` interface\n    const [wallets, setWallets] = useState(() => adapters\n        .map((adapter) => ({\n        adapter,\n        readyState: adapter.readyState,\n    }))\n        .filter(({ readyState }) => readyState !== WalletReadyState.Unsupported));\n    // When the adapters change, start to listen for changes to their `readyState`\n    useEffect(() => {\n        // When the adapters change, wrap them to conform to the `Wallet` interface\n        setWallets((wallets) => adapters\n            .map((adapter, index) => {\n            const wallet = wallets[index];\n            // If the wallet hasn't changed, return the same instance\n            return wallet && wallet.adapter === adapter && wallet.readyState === adapter.readyState\n                ? wallet\n                : {\n                    adapter: adapter,\n                    readyState: adapter.readyState,\n                };\n        })\n            .filter(({ readyState }) => readyState !== WalletReadyState.Unsupported));\n        function handleReadyStateChange(readyState) {\n            setWallets((prevWallets) => {\n                const index = prevWallets.findIndex(({ adapter }) => adapter === this);\n                if (index === -1)\n                    return prevWallets;\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                const { adapter } = prevWallets[index];\n                return [\n                    ...prevWallets.slice(0, index),\n                    { adapter, readyState },\n                    ...prevWallets.slice(index + 1),\n                ].filter(({ readyState }) => readyState !== WalletReadyState.Unsupported);\n            });\n        }\n        adapters.forEach((adapter) => adapter.on('readyStateChange', handleReadyStateChange, adapter));\n        return () => {\n            adapters.forEach((adapter) => adapter.off('readyStateChange', handleReadyStateChange, adapter));\n        };\n    }, [adapter, adapters]);\n    const wallet = useMemo(() => wallets.find((wallet) => wallet.adapter === adapter) ?? null, [adapter, wallets]);\n    // Setup and teardown event listeners when the adapter changes\n    useEffect(() => {\n        if (!adapter)\n            return;\n        const handleConnect = (publicKey) => {\n            setPublicKey(publicKey);\n            isConnectingRef.current = false;\n            setConnecting(false);\n            setConnected(true);\n            isDisconnectingRef.current = false;\n            setDisconnecting(false);\n        };\n        const handleDisconnect = () => {\n            if (isUnloadingRef.current)\n                return;\n            setPublicKey(null);\n            isConnectingRef.current = false;\n            setConnecting(false);\n            setConnected(false);\n            isDisconnectingRef.current = false;\n            setDisconnecting(false);\n        };\n        const handleError = (error) => {\n            handleErrorRef.current(error, adapter);\n        };\n        adapter.on('connect', handleConnect);\n        adapter.on('disconnect', handleDisconnect);\n        adapter.on('error', handleError);\n        return () => {\n            adapter.off('connect', handleConnect);\n            adapter.off('disconnect', handleDisconnect);\n            adapter.off('error', handleError);\n            handleDisconnect();\n        };\n    }, [adapter, isUnloadingRef]);\n    // When the adapter changes, clear the `autoConnect` tracking flag\n    const didAttemptAutoConnectRef = useRef(false);\n    useEffect(() => {\n        return () => {\n            didAttemptAutoConnectRef.current = false;\n        };\n    }, [adapter]);\n    // If auto-connect is enabled, request to connect when the adapter changes and is ready\n    useEffect(() => {\n        if (didAttemptAutoConnectRef.current ||\n            isConnectingRef.current ||\n            connected ||\n            !onAutoConnectRequest ||\n            !(wallet?.readyState === WalletReadyState.Installed || wallet?.readyState === WalletReadyState.Loadable))\n            return;\n        isConnectingRef.current = true;\n        setConnecting(true);\n        didAttemptAutoConnectRef.current = true;\n        (async function () {\n            try {\n                await onAutoConnectRequest();\n            }\n            catch {\n                onConnectError();\n                // Drop the error. It will be caught by `handleError` anyway.\n            }\n            finally {\n                setConnecting(false);\n                isConnectingRef.current = false;\n            }\n        })();\n    }, [connected, onAutoConnectRequest, onConnectError, wallet]);\n    // Send a transaction using the provided connection\n    const sendTransaction = useCallback(async (transaction, connection, options) => {\n        if (!adapter)\n            throw handleErrorRef.current(new WalletNotSelectedError());\n        if (!connected)\n            throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n        return await adapter.sendTransaction(transaction, connection, options);\n    }, [adapter, connected]);\n    // Sign a transaction if the wallet supports it\n    const signTransaction = useMemo(() => adapter && 'signTransaction' in adapter\n        ? async (transaction) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signTransaction(transaction);\n        }\n        : undefined, [adapter, connected]);\n    // Sign multiple transactions if the wallet supports it\n    const signAllTransactions = useMemo(() => adapter && 'signAllTransactions' in adapter\n        ? async (transactions) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signAllTransactions(transactions);\n        }\n        : undefined, [adapter, connected]);\n    // Sign an arbitrary message if the wallet supports it\n    const signMessage = useMemo(() => adapter && 'signMessage' in adapter\n        ? async (message) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signMessage(message);\n        }\n        : undefined, [adapter, connected]);\n    // Sign in if the wallet supports it\n    const signIn = useMemo(() => adapter && 'signIn' in adapter\n        ? async (input) => {\n            return await adapter.signIn(input);\n        }\n        : undefined, [adapter]);\n    const handleConnect = useCallback(async () => {\n        if (isConnectingRef.current || isDisconnectingRef.current || wallet?.adapter.connected)\n            return;\n        if (!wallet)\n            throw handleErrorRef.current(new WalletNotSelectedError());\n        const { adapter, readyState } = wallet;\n        if (!(readyState === WalletReadyState.Installed || readyState === WalletReadyState.Loadable))\n            throw handleErrorRef.current(new WalletNotReadyError(), adapter);\n        isConnectingRef.current = true;\n        setConnecting(true);\n        try {\n            await adapter.connect();\n        }\n        catch (e) {\n            onConnectError();\n            throw e;\n        }\n        finally {\n            setConnecting(false);\n            isConnectingRef.current = false;\n        }\n    }, [onConnectError, wallet]);\n    const handleDisconnect = useCallback(async () => {\n        if (isDisconnectingRef.current)\n            return;\n        if (!adapter)\n            return;\n        isDisconnectingRef.current = true;\n        setDisconnecting(true);\n        try {\n            await adapter.disconnect();\n        }\n        finally {\n            setDisconnecting(false);\n            isDisconnectingRef.current = false;\n        }\n    }, [adapter]);\n    return (React.createElement(WalletContext.Provider, { value: {\n            autoConnect: !!onAutoConnectRequest,\n            wallets,\n            wallet,\n            publicKey,\n            connected,\n            connecting,\n            disconnecting,\n            select: onSelectWallet,\n            connect: handleConnect,\n            disconnect: handleDisconnect,\n            sendTransaction,\n            signTransaction,\n            signAllTransactions,\n            signMessage,\n            signIn,\n        } }, children));\n}\n//# sourceMappingURL=WalletProviderBase.js.map","import { createDefaultAddressSelector, createDefaultAuthorizationResultCache, createDefaultWalletNotFoundHandler, SolanaMobileWalletAdapter, SolanaMobileWalletAdapterWalletName, } from '@solana-mobile/wallet-adapter-mobile';\nimport { useStandardWalletAdapters } from '@solana/wallet-standard-wallet-adapter-react';\nimport React, { useCallback, useEffect, useMemo, useRef } from 'react';\nimport getEnvironment, { Environment } from './getEnvironment.js';\nimport getInferredClusterFromEndpoint from './getInferredClusterFromEndpoint.js';\nimport { useConnection } from './useConnection.js';\nimport { useLocalStorage } from './useLocalStorage.js';\nimport { WalletProviderBase } from './WalletProviderBase.js';\nlet _userAgent;\nfunction getUserAgent() {\n    if (_userAgent === undefined) {\n        _userAgent = globalThis.navigator?.userAgent ?? null;\n    }\n    return _userAgent;\n}\nfunction getIsMobile(adapters) {\n    const userAgentString = getUserAgent();\n    return getEnvironment({ adapters, userAgentString }) === Environment.MOBILE_WEB;\n}\nfunction getUriForAppIdentity() {\n    const location = globalThis.location;\n    if (!location)\n        return;\n    return `${location.protocol}//${location.host}`;\n}\nexport function WalletProvider({ children, wallets: adapters, autoConnect, localStorageKey = 'walletName', onError, }) {\n    const { connection } = useConnection();\n    const adaptersWithStandardAdapters = useStandardWalletAdapters(adapters);\n    const mobileWalletAdapter = useMemo(() => {\n        if (!getIsMobile(adaptersWithStandardAdapters)) {\n            return null;\n        }\n        const existingMobileWalletAdapter = adaptersWithStandardAdapters.find((adapter) => adapter.name === SolanaMobileWalletAdapterWalletName);\n        if (existingMobileWalletAdapter) {\n            return existingMobileWalletAdapter;\n        }\n        return new SolanaMobileWalletAdapter({\n            addressSelector: createDefaultAddressSelector(),\n            appIdentity: {\n                uri: getUriForAppIdentity(),\n            },\n            authorizationResultCache: createDefaultAuthorizationResultCache(),\n            cluster: getInferredClusterFromEndpoint(connection?.rpcEndpoint),\n            onWalletNotFound: createDefaultWalletNotFoundHandler(),\n        });\n    }, [adaptersWithStandardAdapters, connection?.rpcEndpoint]);\n    const adaptersWithMobileWalletAdapter = useMemo(() => {\n        if (mobileWalletAdapter == null || adaptersWithStandardAdapters.indexOf(mobileWalletAdapter) !== -1) {\n            return adaptersWithStandardAdapters;\n        }\n        return [mobileWalletAdapter, ...adaptersWithStandardAdapters];\n    }, [adaptersWithStandardAdapters, mobileWalletAdapter]);\n    const [walletName, setWalletName] = useLocalStorage(localStorageKey, getIsMobile(adaptersWithStandardAdapters) ? SolanaMobileWalletAdapterWalletName : null);\n    const adapter = useMemo(() => adaptersWithMobileWalletAdapter.find((a) => a.name === walletName) ?? null, [adaptersWithMobileWalletAdapter, walletName]);\n    const changeWallet = useCallback((nextWalletName) => {\n        if (walletName === nextWalletName)\n            return;\n        if (adapter &&\n            // Selecting a wallet other than the mobile wallet adapter is not\n            // sufficient reason to call `disconnect` on the mobile wallet adapter.\n            // Calling `disconnect` on the mobile wallet adapter causes the entire\n            // authorization store to be wiped.\n            adapter.name !== SolanaMobileWalletAdapterWalletName) {\n            adapter.disconnect();\n        }\n        setWalletName(nextWalletName);\n    }, [adapter, setWalletName, walletName]);\n    useEffect(() => {\n        if (!adapter)\n            return;\n        function handleDisconnect() {\n            if (isUnloadingRef.current)\n                return;\n            // Leave the adapter selected in the event of a disconnection.\n            if (walletName === SolanaMobileWalletAdapterWalletName && getIsMobile(adaptersWithStandardAdapters))\n                return;\n            setWalletName(null);\n        }\n        adapter.on('disconnect', handleDisconnect);\n        return () => {\n            adapter.off('disconnect', handleDisconnect);\n        };\n    }, [adapter, adaptersWithStandardAdapters, setWalletName, walletName]);\n    const hasUserSelectedAWallet = useRef(false);\n    const handleAutoConnectRequest = useMemo(() => {\n        if (!autoConnect || !adapter)\n            return;\n        return async () => {\n            // If autoConnect is true or returns true, use the default autoConnect behavior.\n            if (autoConnect === true || (await autoConnect(adapter))) {\n                if (hasUserSelectedAWallet.current) {\n                    await adapter.connect();\n                }\n                else {\n                    await adapter.autoConnect();\n                }\n            }\n        };\n    }, [autoConnect, adapter]);\n    const isUnloadingRef = useRef(false);\n    useEffect(() => {\n        if (walletName === SolanaMobileWalletAdapterWalletName && getIsMobile(adaptersWithStandardAdapters)) {\n            isUnloadingRef.current = false;\n            return;\n        }\n        function handleBeforeUnload() {\n            isUnloadingRef.current = true;\n        }\n        /**\n         * Some wallets fire disconnection events when the window unloads. Since there's no way to\n         * distinguish between a disconnection event received because a user initiated it, and one\n         * that was received because they've closed the window, we have to track window unload\n         * events themselves. Downstream components use this information to decide whether to act\n         * upon or drop wallet events and errors.\n         */\n        window.addEventListener('beforeunload', handleBeforeUnload);\n        return () => {\n            window.removeEventListener('beforeunload', handleBeforeUnload);\n        };\n    }, [adaptersWithStandardAdapters, walletName]);\n    const handleConnectError = useCallback(() => {\n        if (adapter && adapter.name !== SolanaMobileWalletAdapterWalletName) {\n            // If any error happens while connecting, unset the adapter.\n            changeWallet(null);\n        }\n    }, [adapter, changeWallet]);\n    const selectWallet = useCallback((walletName) => {\n        hasUserSelectedAWallet.current = true;\n        changeWallet(walletName);\n    }, [changeWallet]);\n    return (React.createElement(WalletProviderBase, { wallets: adaptersWithMobileWalletAdapter, adapter: adapter, isUnloadingRef: isUnloadingRef, onAutoConnectRequest: handleAutoConnectRequest, onConnectError: handleConnectError, onError: onError, onSelectWallet: selectWallet }, children));\n}\n//# sourceMappingURL=WalletProvider.js.map","import React, { useLayoutEffect, useRef } from 'react';\nexport const Collapse = ({ id, children, expanded = false }) => {\n    const ref = useRef(null);\n    const instant = useRef(true);\n    const transition = 'height 250ms ease-out';\n    const openCollapse = () => {\n        const node = ref.current;\n        if (!node)\n            return;\n        requestAnimationFrame(() => {\n            node.style.height = node.scrollHeight + 'px';\n        });\n    };\n    const closeCollapse = () => {\n        const node = ref.current;\n        if (!node)\n            return;\n        requestAnimationFrame(() => {\n            node.style.height = node.offsetHeight + 'px';\n            node.style.overflow = 'hidden';\n            requestAnimationFrame(() => {\n                node.style.height = '0';\n            });\n        });\n    };\n    useLayoutEffect(() => {\n        if (expanded) {\n            openCollapse();\n        }\n        else {\n            closeCollapse();\n        }\n    }, [expanded]);\n    useLayoutEffect(() => {\n        const node = ref.current;\n        if (!node)\n            return;\n        function handleComplete() {\n            if (!node)\n                return;\n            node.style.overflow = expanded ? 'initial' : 'hidden';\n            if (expanded) {\n                node.style.height = 'auto';\n            }\n        }\n        function handleTransitionEnd(event) {\n            if (node && event.target === node && event.propertyName === 'height') {\n                handleComplete();\n            }\n        }\n        if (instant.current) {\n            handleComplete();\n            instant.current = false;\n        }\n        node.addEventListener('transitionend', handleTransitionEnd);\n        return () => node.removeEventListener('transitionend', handleTransitionEnd);\n    }, [expanded]);\n    return (React.createElement(\"div\", { className: \"wallet-adapter-collapse\", id: id, ref: ref, role: \"region\", style: { height: 0, transition: instant.current ? undefined : transition } }, children));\n};\n//# sourceMappingURL=Collapse.js.map","import React from 'react';\nexport const Button = (props) => {\n    return (React.createElement(\"button\", { className: `wallet-adapter-button ${props.className || ''}`, disabled: props.disabled, style: props.style, onClick: props.onClick, tabIndex: props.tabIndex || 0, type: \"button\" },\n        props.startIcon && React.createElement(\"i\", { className: \"wallet-adapter-button-start-icon\" }, props.startIcon),\n        props.children,\n        props.endIcon && React.createElement(\"i\", { className: \"wallet-adapter-button-end-icon\" }, props.endIcon)));\n};\n//# sourceMappingURL=Button.js.map","import React from 'react';\nexport const WalletIcon = ({ wallet, ...props }) => {\n    return wallet && React.createElement(\"img\", { src: wallet.adapter.icon, alt: `${wallet.adapter.name} icon`, ...props });\n};\n//# sourceMappingURL=WalletIcon.js.map","import { WalletReadyState } from '@solana/wallet-adapter-base';\nimport React from 'react';\nimport { Button } from './Button.js';\nimport { WalletIcon } from './WalletIcon.js';\nexport const WalletListItem = ({ handleClick, tabIndex, wallet }) => {\n    return (React.createElement(\"li\", null,\n        React.createElement(Button, { onClick: handleClick, startIcon: React.createElement(WalletIcon, { wallet: wallet }), tabIndex: tabIndex },\n            wallet.adapter.name,\n            wallet.readyState === WalletReadyState.Installed && React.createElement(\"span\", null, \"Detected\"))));\n};\n//# sourceMappingURL=WalletListItem.js.map","import React from 'react';\nexport const WalletSVG = () => {\n    return (React.createElement(\"svg\", { width: \"97\", height: \"96\", viewBox: \"0 0 97 96\", fill: \"none\", xmlns: \"http://www.w3.org/2000/svg\" },\n        React.createElement(\"circle\", { cx: \"48.5\", cy: \"48\", r: \"48\", fill: \"url(#paint0_linear_880_5115)\", fillOpacity: \"0.1\" }),\n        React.createElement(\"circle\", { cx: \"48.5\", cy: \"48\", r: \"47\", stroke: \"url(#paint1_linear_880_5115)\", strokeOpacity: \"0.4\", strokeWidth: \"2\" }),\n        React.createElement(\"g\", { clipPath: \"url(#clip0_880_5115)\" },\n            React.createElement(\"path\", { d: \"M65.5769 28.1523H31.4231C27.6057 28.1523 24.5 31.258 24.5 35.0754V60.9215C24.5 64.7389 27.6057 67.8446 31.4231 67.8446H65.5769C69.3943 67.8446 72.5 64.7389 72.5 60.9215V35.0754C72.5 31.258 69.3943 28.1523 65.5769 28.1523ZM69.7308 52.1523H59.5769C57.2865 52.1523 55.4231 50.289 55.4231 47.9985C55.4231 45.708 57.2864 43.8446 59.5769 43.8446H69.7308V52.1523ZM69.7308 41.0754H59.5769C55.7595 41.0754 52.6539 44.1811 52.6539 47.9985C52.6539 51.8159 55.7595 54.9215 59.5769 54.9215H69.7308V60.9215C69.7308 63.2119 67.8674 65.0754 65.5769 65.0754H31.4231C29.1327 65.0754 27.2692 63.212 27.2692 60.9215V35.0754C27.2692 32.785 29.1326 30.9215 31.4231 30.9215H65.5769C67.8673 30.9215 69.7308 32.7849 69.7308 35.0754V41.0754Z\", fill: \"url(#paint2_linear_880_5115)\" }),\n            React.createElement(\"path\", { d: \"M61.4231 46.6172H59.577C58.8123 46.6172 58.1924 47.2371 58.1924 48.0018C58.1924 48.7665 58.8123 49.3863 59.577 49.3863H61.4231C62.1878 49.3863 62.8077 48.7664 62.8077 48.0018C62.8077 47.2371 62.1878 46.6172 61.4231 46.6172Z\", fill: \"url(#paint3_linear_880_5115)\" })),\n        React.createElement(\"defs\", null,\n            React.createElement(\"linearGradient\", { id: \"paint0_linear_880_5115\", x1: \"3.41664\", y1: \"98.0933\", x2: \"103.05\", y2: \"8.42498\", gradientUnits: \"userSpaceOnUse\" },\n                React.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                React.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                React.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                React.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                React.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                React.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            React.createElement(\"linearGradient\", { id: \"paint1_linear_880_5115\", x1: \"3.41664\", y1: \"98.0933\", x2: \"103.05\", y2: \"8.42498\", gradientUnits: \"userSpaceOnUse\" },\n                React.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                React.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                React.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                React.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                React.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                React.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            React.createElement(\"linearGradient\", { id: \"paint2_linear_880_5115\", x1: \"25.9583\", y1: \"68.7101\", x2: \"67.2337\", y2: \"23.7879\", gradientUnits: \"userSpaceOnUse\" },\n                React.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                React.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                React.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                React.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                React.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                React.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            React.createElement(\"linearGradient\", { id: \"paint3_linear_880_5115\", x1: \"58.3326\", y1: \"49.4467\", x2: \"61.0002\", y2: \"45.4453\", gradientUnits: \"userSpaceOnUse\" },\n                React.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                React.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                React.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                React.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                React.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                React.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            React.createElement(\"clipPath\", { id: \"clip0_880_5115\" },\n                React.createElement(\"rect\", { width: \"48\", height: \"48\", fill: \"white\", transform: \"translate(24.5 24)\" })))));\n};\n//# sourceMappingURL=WalletSVG.js.map","import { WalletReadyState } from '@solana/wallet-adapter-base';\nimport { useWallet } from '@solana/wallet-adapter-react';\nimport React, { useCallback, useLayoutEffect, useMemo, useRef, useState } from 'react';\nimport { createPortal } from 'react-dom';\nimport { Collapse } from './Collapse.js';\nimport { WalletListItem } from './WalletListItem.js';\nimport { WalletSVG } from './WalletSVG.js';\nimport { useWalletModal } from './useWalletModal.js';\nexport const WalletModal = ({ className = '', container = 'body' }) => {\n    const ref = useRef(null);\n    const { wallets, select } = useWallet();\n    const { setVisible } = useWalletModal();\n    const [expanded, setExpanded] = useState(false);\n    const [fadeIn, setFadeIn] = useState(false);\n    const [portal, setPortal] = useState(null);\n    const [listedWallets, collapsedWallets] = useMemo(() => {\n        const installed = [];\n        const notInstalled = [];\n        for (const wallet of wallets) {\n            if (wallet.readyState === WalletReadyState.Installed) {\n                installed.push(wallet);\n            }\n            else {\n                notInstalled.push(wallet);\n            }\n        }\n        return installed.length ? [installed, notInstalled] : [notInstalled, []];\n    }, [wallets]);\n    const hideModal = useCallback(() => {\n        setFadeIn(false);\n        setTimeout(() => setVisible(false), 150);\n    }, [setVisible]);\n    const handleClose = useCallback((event) => {\n        event.preventDefault();\n        hideModal();\n    }, [hideModal]);\n    const handleWalletClick = useCallback((event, walletName) => {\n        select(walletName);\n        handleClose(event);\n    }, [select, handleClose]);\n    const handleCollapseClick = useCallback(() => setExpanded(!expanded), [expanded]);\n    const handleTabKey = useCallback((event) => {\n        const node = ref.current;\n        if (!node)\n            return;\n        // here we query all focusable elements\n        const focusableElements = node.querySelectorAll('button');\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const firstElement = focusableElements[0];\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const lastElement = focusableElements[focusableElements.length - 1];\n        if (event.shiftKey) {\n            // if going backward by pressing tab and firstElement is active, shift focus to last focusable element\n            if (document.activeElement === firstElement) {\n                lastElement.focus();\n                event.preventDefault();\n            }\n        }\n        else {\n            // if going forward by pressing tab and lastElement is active, shift focus to first focusable element\n            if (document.activeElement === lastElement) {\n                firstElement.focus();\n                event.preventDefault();\n            }\n        }\n    }, [ref]);\n    useLayoutEffect(() => {\n        const handleKeyDown = (event) => {\n            if (event.key === 'Escape') {\n                hideModal();\n            }\n            else if (event.key === 'Tab') {\n                handleTabKey(event);\n            }\n        };\n        // Get original overflow\n        const { overflow } = window.getComputedStyle(document.body);\n        // Hack to enable fade in animation after mount\n        setTimeout(() => setFadeIn(true), 0);\n        // Prevent scrolling on mount\n        document.body.style.overflow = 'hidden';\n        // Listen for keydown events\n        window.addEventListener('keydown', handleKeyDown, false);\n        return () => {\n            // Re-enable scrolling when component unmounts\n            document.body.style.overflow = overflow;\n            window.removeEventListener('keydown', handleKeyDown, false);\n        };\n    }, [hideModal, handleTabKey]);\n    useLayoutEffect(() => setPortal(document.querySelector(container)), [container]);\n    return (portal &&\n        createPortal(React.createElement(\"div\", { \"aria-labelledby\": \"wallet-adapter-modal-title\", \"aria-modal\": \"true\", className: `wallet-adapter-modal ${fadeIn && 'wallet-adapter-modal-fade-in'} ${className}`, ref: ref, role: \"dialog\" },\n            React.createElement(\"div\", { className: \"wallet-adapter-modal-container\" },\n                React.createElement(\"div\", { className: \"wallet-adapter-modal-wrapper\" },\n                    React.createElement(\"button\", { onClick: handleClose, className: \"wallet-adapter-modal-button-close\" },\n                        React.createElement(\"svg\", { width: \"14\", height: \"14\" },\n                            React.createElement(\"path\", { d: \"M14 12.461 8.3 6.772l5.234-5.233L12.006 0 6.772 5.234 1.54 0 0 1.539l5.234 5.233L0 12.006l1.539 1.528L6.772 8.3l5.69 5.7L14 12.461z\" }))),\n                    listedWallets.length ? (React.createElement(React.Fragment, null,\n                        React.createElement(\"h1\", { className: \"wallet-adapter-modal-title\" }, \"Connect a wallet on Solana to continue\"),\n                        React.createElement(\"ul\", { className: \"wallet-adapter-modal-list\" },\n                            listedWallets.map((wallet) => (React.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), wallet: wallet }))),\n                            collapsedWallets.length ? (React.createElement(Collapse, { expanded: expanded, id: \"wallet-adapter-modal-collapse\" }, collapsedWallets.map((wallet) => (React.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), tabIndex: expanded ? 0 : -1, wallet: wallet }))))) : null),\n                        collapsedWallets.length ? (React.createElement(\"button\", { className: \"wallet-adapter-modal-list-more\", onClick: handleCollapseClick, tabIndex: 0 },\n                            React.createElement(\"span\", null,\n                                expanded ? 'Less ' : 'More ',\n                                \"options\"),\n                            React.createElement(\"svg\", { width: \"13\", height: \"7\", viewBox: \"0 0 13 7\", xmlns: \"http://www.w3.org/2000/svg\", className: `${expanded ? 'wallet-adapter-modal-list-more-icon-rotate' : ''}` },\n                                React.createElement(\"path\", { d: \"M0.71418 1.626L5.83323 6.26188C5.91574 6.33657 6.0181 6.39652 6.13327 6.43762C6.24844 6.47872 6.37371 6.5 6.50048 6.5C6.62725 6.5 6.75252 6.47872 6.8677 6.43762C6.98287 6.39652 7.08523 6.33657 7.16774 6.26188L12.2868 1.626C12.7753 1.1835 12.3703 0.5 11.6195 0.5H1.37997C0.629216 0.5 0.224175 1.1835 0.71418 1.626Z\" })))) : null)) : (React.createElement(React.Fragment, null,\n                        React.createElement(\"h1\", { className: \"wallet-adapter-modal-title\" }, \"You'll need a wallet on Solana to continue\"),\n                        React.createElement(\"div\", { className: \"wallet-adapter-modal-middle\" },\n                            React.createElement(WalletSVG, null)),\n                        collapsedWallets.length ? (React.createElement(React.Fragment, null,\n                            React.createElement(\"button\", { className: \"wallet-adapter-modal-list-more\", onClick: handleCollapseClick, tabIndex: 0 },\n                                React.createElement(\"span\", null,\n                                    expanded ? 'Hide ' : 'Already have a wallet? View ',\n                                    \"options\"),\n                                React.createElement(\"svg\", { width: \"13\", height: \"7\", viewBox: \"0 0 13 7\", xmlns: \"http://www.w3.org/2000/svg\", className: `${expanded ? 'wallet-adapter-modal-list-more-icon-rotate' : ''}` },\n                                    React.createElement(\"path\", { d: \"M0.71418 1.626L5.83323 6.26188C5.91574 6.33657 6.0181 6.39652 6.13327 6.43762C6.24844 6.47872 6.37371 6.5 6.50048 6.5C6.62725 6.5 6.75252 6.47872 6.8677 6.43762C6.98287 6.39652 7.08523 6.33657 7.16774 6.26188L12.2868 1.626C12.7753 1.1835 12.3703 0.5 11.6195 0.5H1.37997C0.629216 0.5 0.224175 1.1835 0.71418 1.626Z\" }))),\n                            React.createElement(Collapse, { expanded: expanded, id: \"wallet-adapter-modal-collapse\" },\n                                React.createElement(\"ul\", { className: \"wallet-adapter-modal-list\" }, collapsedWallets.map((wallet) => (React.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), tabIndex: expanded ? 0 : -1, wallet: wallet }))))))) : null)))),\n            React.createElement(\"div\", { className: \"wallet-adapter-modal-overlay\", onMouseDown: handleClose })), portal));\n};\n//# sourceMappingURL=WalletModal.js.map","import React, { useState } from 'react';\nimport { WalletModalContext } from './useWalletModal.js';\nimport { WalletModal } from './WalletModal.js';\nexport const WalletModalProvider = ({ children, ...props }) => {\n    const [visible, setVisible] = useState(false);\n    return (React.createElement(WalletModalContext.Provider, { value: {\n            visible,\n            setVisible,\n        } },\n        children,\n        visible && React.createElement(WalletModal, { ...props })));\n};\n//# sourceMappingURL=WalletModalProvider.js.map","import { BaseMessageSignerWalletAdapter, isIosAndRedirectable, isVersionedTransaction, scopePollingDetectionStrategy, WalletAccountError, WalletConnectionError, WalletDisconnectedError, WalletDisconnectionError, WalletError, WalletNotConnectedError, WalletNotReadyError, WalletPublicKeyError, WalletReadyState, WalletSendTransactionError, WalletSignMessageError, WalletSignTransactionError, } from '@solana/wallet-adapter-base';\nimport { PublicKey } from '@solana/web3.js';\nexport const PhantomWalletName = 'Phantom';\nexport class PhantomWalletAdapter extends BaseMessageSignerWalletAdapter {\n    constructor(config = {}) {\n        super();\n        this.name = PhantomWalletName;\n        this.url = 'https://phantom.app';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHdpZHRoPSIxMDgiIGhlaWdodD0iMTA4IiB2aWV3Qm94PSIwIDAgMTA4IDEwOCIgZmlsbD0ibm9uZSI+CjxyZWN0IHdpZHRoPSIxMDgiIGhlaWdodD0iMTA4IiByeD0iMjYiIGZpbGw9IiNBQjlGRjIiLz4KPHBhdGggZmlsbC1ydWxlPSJldmVub2RkIiBjbGlwLXJ1bGU9ImV2ZW5vZGQiIGQ9Ik00Ni41MjY3IDY5LjkyMjlDNDIuMDA1NCA3Ni44NTA5IDM0LjQyOTIgODUuNjE4MiAyNC4zNDggODUuNjE4MkMxOS41ODI0IDg1LjYxODIgMTUgODMuNjU2MyAxNSA3NS4xMzQyQzE1IDUzLjQzMDUgNDQuNjMyNiAxOS44MzI3IDcyLjEyNjggMTkuODMyN0M4Ny43NjggMTkuODMyNyA5NCAzMC42ODQ2IDk0IDQzLjAwNzlDOTQgNTguODI1OCA4My43MzU1IDc2LjkxMjIgNzMuNTMyMSA3Ni45MTIyQzcwLjI5MzkgNzYuOTEyMiA2OC43MDUzIDc1LjEzNDIgNjguNzA1MyA3Mi4zMTRDNjguNzA1MyA3MS41NzgzIDY4LjgyNzUgNzAuNzgxMiA2OS4wNzE5IDY5LjkyMjlDNjUuNTg5MyA3NS44Njk5IDU4Ljg2ODUgODEuMzg3OCA1Mi41NzU0IDgxLjM4NzhDNDcuOTkzIDgxLjM4NzggNDUuNjcxMyA3OC41MDYzIDQ1LjY3MTMgNzQuNDU5OEM0NS42NzEzIDcyLjk4ODQgNDUuOTc2OCA3MS40NTU2IDQ2LjUyNjcgNjkuOTIyOVpNODMuNjc2MSA0Mi41Nzk0QzgzLjY3NjEgNDYuMTcwNCA4MS41NTc1IDQ3Ljk2NTggNzkuMTg3NSA0Ny45NjU4Qzc2Ljc4MTYgNDcuOTY1OCA3NC42OTg5IDQ2LjE3MDQgNzQuNjk4OSA0Mi41Nzk0Qzc0LjY5ODkgMzguOTg4NSA3Ni43ODE2IDM3LjE5MzEgNzkuMTg3NSAzNy4xOTMxQzgxLjU1NzUgMzcuMTkzMSA4My42NzYxIDM4Ljk4ODUgODMuNjc2MSA0Mi41Nzk0Wk03MC4yMTAzIDQyLjU3OTVDNzAuMjEwMyA0Ni4xNzA0IDY4LjA5MTYgNDcuOTY1OCA2NS43MjE2IDQ3Ljk2NThDNjMuMzE1NyA0Ny45NjU4IDYxLjIzMyA0Ni4xNzA0IDYxLjIzMyA0Mi41Nzk1QzYxLjIzMyAzOC45ODg1IDYzLjMxNTcgMzcuMTkzMSA2NS43MjE2IDM3LjE5MzFDNjguMDkxNiAzNy4xOTMxIDcwLjIxMDMgMzguOTg4NSA3MC4yMTAzIDQyLjU3OTVaIiBmaWxsPSIjRkZGREY4Ii8+Cjwvc3ZnPg==';\n        this.supportedTransactionVersions = new Set(['legacy', 0]);\n        this._readyState = typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.NotDetected;\n        this._disconnected = () => {\n            const wallet = this._wallet;\n            if (wallet) {\n                wallet.off('disconnect', this._disconnected);\n                wallet.off('accountChanged', this._accountChanged);\n                this._wallet = null;\n                this._publicKey = null;\n                this.emit('error', new WalletDisconnectedError());\n                this.emit('disconnect');\n            }\n        };\n        this._accountChanged = (newPublicKey) => {\n            const publicKey = this._publicKey;\n            if (!publicKey)\n                return;\n            try {\n                newPublicKey = new PublicKey(newPublicKey.toBytes());\n            }\n            catch (error) {\n                this.emit('error', new WalletPublicKeyError(error?.message, error));\n                return;\n            }\n            if (publicKey.equals(newPublicKey))\n                return;\n            this._publicKey = newPublicKey;\n            this.emit('connect', newPublicKey);\n        };\n        this._connecting = false;\n        this._wallet = null;\n        this._publicKey = null;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            if (isIosAndRedirectable()) {\n                // when in iOS (not webview), set Phantom as loadable instead of checking for install\n                this._readyState = WalletReadyState.Loadable;\n                this.emit('readyStateChange', this._readyState);\n            }\n            else {\n                scopePollingDetectionStrategy(() => {\n                    if (window.phantom?.solana?.isPhantom || window.solana?.isPhantom) {\n                        this._readyState = WalletReadyState.Installed;\n                        this.emit('readyStateChange', this._readyState);\n                        return true;\n                    }\n                    return false;\n                });\n            }\n        }\n    }\n    get publicKey() {\n        return this._publicKey;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    async autoConnect() {\n        // Skip autoconnect in the Loadable state\n        // We can't redirect to a universal link without user input\n        if (this.readyState === WalletReadyState.Installed) {\n            await this.connect();\n        }\n    }\n    async connect() {\n        try {\n            if (this.connected || this.connecting)\n                return;\n            if (this.readyState === WalletReadyState.Loadable) {\n                // redirect to the Phantom /browse universal link\n                // this will open the current URL in the Phantom in-wallet browser\n                const url = encodeURIComponent(window.location.href);\n                const ref = encodeURIComponent(window.location.origin);\n                window.location.href = `https://phantom.app/ul/browse/${url}?ref=${ref}`;\n                return;\n            }\n            if (this.readyState !== WalletReadyState.Installed)\n                throw new WalletNotReadyError();\n            this._connecting = true;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const wallet = window.phantom?.solana || window.solana;\n            if (!wallet.isConnected) {\n                try {\n                    await wallet.connect();\n                }\n                catch (error) {\n                    throw new WalletConnectionError(error?.message, error);\n                }\n            }\n            if (!wallet.publicKey)\n                throw new WalletAccountError();\n            let publicKey;\n            try {\n                publicKey = new PublicKey(wallet.publicKey.toBytes());\n            }\n            catch (error) {\n                throw new WalletPublicKeyError(error?.message, error);\n            }\n            wallet.on('disconnect', this._disconnected);\n            wallet.on('accountChanged', this._accountChanged);\n            this._wallet = wallet;\n            this._publicKey = publicKey;\n            this.emit('connect', publicKey);\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n        finally {\n            this._connecting = false;\n        }\n    }\n    async disconnect() {\n        const wallet = this._wallet;\n        if (wallet) {\n            wallet.off('disconnect', this._disconnected);\n            wallet.off('accountChanged', this._accountChanged);\n            this._wallet = null;\n            this._publicKey = null;\n            try {\n                await wallet.disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n        }\n        this.emit('disconnect');\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signers, ...sendOptions } = options;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                }\n                sendOptions.preflightCommitment = sendOptions.preflightCommitment || connection.commitment;\n                const { signature } = await wallet.signAndSendTransaction(transaction, sendOptions);\n                return signature;\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signTransaction(transaction) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signTransaction(transaction)) || transaction;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signAllTransactions(transactions)) || transactions;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signMessage(message) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signature } = await wallet.signMessage(message);\n                return signature;\n            }\n            catch (error) {\n                throw new WalletSignMessageError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n//# sourceMappingURL=adapter.js.map","var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _RegisterWalletEvent_detail;\n/**\n * Register a {@link \"@wallet-standard/base\".Wallet} as a Standard Wallet with the app.\n *\n * This dispatches a {@link \"@wallet-standard/base\".WindowRegisterWalletEvent} to notify the app that the Wallet is\n * ready to be registered.\n *\n * This also adds a listener for {@link \"@wallet-standard/base\".WindowAppReadyEvent} to listen for a notification from\n * the app that the app is ready to register the Wallet.\n *\n * This combination of event dispatch and listener guarantees that the Wallet will be registered synchronously as soon\n * as the app is ready whether the Wallet loads before or after the app.\n *\n * @param wallet Wallet to register.\n *\n * @group Wallet\n */\nexport function registerWallet(wallet) {\n    const callback = ({ register }) => register(wallet);\n    try {\n        window.dispatchEvent(new RegisterWalletEvent(callback));\n    }\n    catch (error) {\n        console.error('wallet-standard:register-wallet event could not be dispatched\\n', error);\n    }\n    try {\n        window.addEventListener('wallet-standard:app-ready', ({ detail: api }) => callback(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:app-ready event listener could not be added\\n', error);\n    }\n}\nclass RegisterWalletEvent extends Event {\n    constructor(callback) {\n        super('wallet-standard:register-wallet', {\n            bubbles: false,\n            cancelable: false,\n            composed: false,\n        });\n        _RegisterWalletEvent_detail.set(this, void 0);\n        __classPrivateFieldSet(this, _RegisterWalletEvent_detail, callback, \"f\");\n    }\n    get detail() {\n        return __classPrivateFieldGet(this, _RegisterWalletEvent_detail, \"f\");\n    }\n    get type() {\n        return 'wallet-standard:register-wallet';\n    }\n    /** @deprecated */\n    preventDefault() {\n        throw new Error('preventDefault cannot be called');\n    }\n    /** @deprecated */\n    stopImmediatePropagation() {\n        throw new Error('stopImmediatePropagation cannot be called');\n    }\n    /** @deprecated */\n    stopPropagation() {\n        throw new Error('stopPropagation cannot be called');\n    }\n}\n_RegisterWalletEvent_detail = new WeakMap();\n/**\n * @deprecated Use {@link registerWallet} instead.\n *\n * @group Deprecated\n */\nexport function DEPRECATED_registerWallet(wallet) {\n    var _a;\n    registerWallet(wallet);\n    try {\n        ((_a = window.navigator).wallets || (_a.wallets = [])).push(({ register }) => register(wallet));\n    }\n    catch (error) {\n        console.error('window.navigator.wallets could not be pushed\\n', error);\n    }\n}\n//# sourceMappingURL=register.js.map","/** @internal */\nexport const icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjMxIiB2aWV3Qm94PSIwIDAgMzEgMzEiIHdpZHRoPSIzMSIgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIiB4bWxuczp4bGluaz0iaHR0cDovL3d3dy53My5vcmcvMTk5OS94bGluayI+PGxpbmVhckdyYWRpZW50IGlkPSJhIiBncmFkaWVudFVuaXRzPSJ1c2VyU3BhY2VPblVzZSIgeDE9IjIwLjI1IiB4Mj0iMjYuNTcxIiB5MT0iMjcuMTczIiB5Mj0iMTkuODU4Ij48c3RvcCBvZmZzZXQ9Ii4wOCIgc3RvcC1jb2xvcj0iIzk5NDVmZiIvPjxzdG9wIG9mZnNldD0iLjMiIHN0b3AtY29sb3I9IiM4NzUyZjMiLz48c3RvcCBvZmZzZXQ9Ii41IiBzdG9wLWNvbG9yPSIjNTQ5N2Q1Ii8+PHN0b3Agb2Zmc2V0PSIuNiIgc3RvcC1jb2xvcj0iIzQzYjRjYSIvPjxzdG9wIG9mZnNldD0iLjcyIiBzdG9wLWNvbG9yPSIjMjhlMGI5Ii8+PHN0b3Agb2Zmc2V0PSIuOTciIHN0b3AtY29sb3I9IiMxOWZiOWIiLz48L2xpbmVhckdyYWRpZW50PjxnIHN0cm9rZS1saW5lam9pbj0icm91bmQiIHN0cm9rZS13aWR0aD0iLjA5NCI+PHBhdGggZD0ibTI2LjEwOSAzLjY0My05LjM2OSA2Ljk1OSAxLjczMy00LjEwNSA3LjYzNy0yLjg1M3oiIGZpbGw9IiNlMjc2MWIiIHN0cm9rZT0iI2UyNzYxYiIvPjxnIGZpbGw9IiNlNDc2MWIiIHN0cm9rZT0iI2U0NzYxYiI+PHBhdGggZD0ibTQuNDgxIDMuNjQzIDkuMjk0IDcuMDI0LTEuNjQ4LTQuMTcxem0xOC4yNTggMTYuMTMtMi40OTUgMy44MjMgNS4zMzkgMS40NjkgMS41MzUtNS4yMDctNC4zNzgtLjA4NXptLTE5LjI0Ny4wODUgMS41MjUgNS4yMDcgNS4zMzktMS40NjktMi40OTUtMy44MjN6Ii8+PHBhdGggZD0ibTEwLjA1NSAxMy4zMTMtMS40ODggMi4yNTEgNS4zMDEuMjM1LS4xODgtNS42OTd6bTEwLjQ4IDAtMy42NzItMy4yNzctLjEyMiA1Ljc2MyA1LjI5Mi0uMjM1LTEuNDk3LTIuMjUxem0tMTAuMTc4IDEwLjI4MyAzLjE4My0xLjU1NC0yLjc0OS0yLjE0Ny0uNDMzIDMuNzAxem02LjY5NS0xLjU1NCAzLjE5MiAxLjU1NC0uNDQzLTMuNzAxeiIvPjwvZz48cGF0aCBkPSJtMjAuMjQ0IDIzLjU5Ni0zLjE5Mi0xLjU1NC4yNTQgMi4wODEtLjAyOC44NzZ6bS05Ljg4NyAwIDIuOTY2IDEuNDAzLS4wMTktLjg3Ni4yMzUtMi4wODEtMy4xODMgMS41NTR6IiBmaWxsPSIjZDdjMWIzIiBzdHJva2U9IiNkN2MxYjMiLz48cGF0aCBkPSJtMTMuMzY5IDE4LjUyMS0yLjY1NS0uNzgxIDEuODc0LS44NTd6bTMuODUxIDAgLjc4MS0xLjYzOCAxLjg4My44NTctMi42NjUuNzgxeiIgZmlsbD0iIzIzMzQ0NyIgc3Ryb2tlPSIjMjMzNDQ3Ii8+PHBhdGggZD0ibTEwLjM1NyAyMy41OTYuNDUyLTMuODIzLTIuOTQ3LjA4NXptOS40MzUtMy44MjMuNDUyIDMuODIzIDIuNDk1LTMuNzM4em0yLjI0MS00LjIwOS01LjI5Mi4yMzUuNDkgMi43MjEuNzgyLTEuNjM4IDEuODgzLjg1N3ptLTExLjMxOCAyLjE3NSAxLjg4My0uODU3Ljc3MiAxLjYzOC40OTktMi43MjEtNS4zMDEtLjIzNXoiIGZpbGw9IiNjZDYxMTYiIHN0cm9rZT0iI2NkNjExNiIvPjxwYXRoIGQ9Im04LjU2NyAxNS41NjQgMi4yMjIgNC4zMzEtLjA3NS0yLjE1NnptMTEuMzI4IDIuMTc1LS4wOTQgMi4xNTYgMi4yMzItNC4zMzEtMi4xMzcgMi4xNzV6bS02LjAyNi0xLjk0LS40OTkgMi43MjEuNjIxIDMuMjExLjE0MS00LjIyOC0uMjY0LTEuNzA0em0yLjg3MiAwLS4yNTQgMS42OTUuMTEzIDQuMjM3LjYzMS0zLjIxMXoiIGZpbGw9IiNlNDc1MWYiIHN0cm9rZT0iI2U0NzUxZiIvPjxwYXRoIGQ9Im0xNy4yMyAxOC41Mi0uNjMxIDMuMjExLjQ1Mi4zMTEgMi43NS0yLjE0Ny4wOTQtMi4xNTZ6bS02LjUxNi0uNzgxLjA3NSAyLjE1NiAyLjc1IDIuMTQ3LjQ1Mi0uMzExLS42MjItMy4yMTF6IiBmaWxsPSIjZjY4NTFiIiBzdHJva2U9IiNmNjg1MWIiLz48cGF0aCBkPSJtMTcuMjc3IDI0Ljk5OS4wMjgtLjg3Ni0uMjM1LS4yMDdoLTMuNTVsLS4yMTcuMjA3LjAxOS44NzYtMi45NjYtMS40MDMgMS4wMzYuODQ4IDIuMSAxLjQ1OWgzLjYwNmwyLjEwOS0xLjQ1OSAxLjAzNi0uODQ4eiIgZmlsbD0iI2MwYWQ5ZSIgc3Ryb2tlPSIjYzBhZDllIi8+PHBhdGggZD0ibTE3LjA1MSAyMi4wNDItLjQ1Mi0uMzExaC0yLjYwOGwtLjQ1Mi4zMTEtLjIzNSAyLjA4MS4yMTctLjIwN2gzLjU1bC4yMzUuMjA3LS4yNTQtMi4wODF6IiBmaWxsPSIjMTYxNjE2IiBzdHJva2U9IiMxNjE2MTYiLz48cGF0aCBkPSJtMjYuNTA1IDExLjA1My44LTMuODQyLTEuMTk2LTMuNTY5LTkuMDU4IDYuNzIzIDMuNDg0IDIuOTQ3IDQuOTI1IDEuNDQxIDEuMDkyLTEuMjcxLS40NzEtLjMzOS43NTMtLjY4Ny0uNTg0LS40NTIuNzUzLS41NzQtLjQ5OS0uMzc3em0tMjMuMjExLTMuODQxLjggMy44NDItLjUwOC4zNzcuNzUzLjU3NC0uNTc0LjQ1Mi43NTMuNjg3LS40NzEuMzM5IDEuMDgzIDEuMjcxIDQuOTI1LTEuNDQxIDMuNDg0LTIuOTQ3LTkuMDU5LTYuNzIzeiIgZmlsbD0iIzc2M2QxNiIgc3Ryb2tlPSIjNzYzZDE2Ii8+PHBhdGggZD0ibTI1LjQ2IDE0Ljc1NC00LjkyNS0xLjQ0MSAxLjQ5NyAyLjI1MS0yLjIzMiA0LjMzMSAyLjkzOC0uMDM4aDQuMzc4bC0xLjY1Ny01LjEwNHptLTE1LjQwNS0xLjQ0MS00LjkyNSAxLjQ0MS0xLjYzOCA1LjEwNGg0LjM2OWwyLjkyOC4wMzgtMi4yMjItNC4zMzEgMS40ODgtMi4yNTF6bTYuNjg1IDIuNDg2LjMxMS01LjQzMyAxLjQzMS0zLjg3aC02LjM1NmwxLjQxMyAzLjg3LjMyOSA1LjQzMy4xMTMgMS43MTQuMDA5IDQuMjE5aDIuNjFsLjAxOS00LjIxOS4xMjItMS43MTR6IiBmaWxsPSIjZjY4NTFiIiBzdHJva2U9IiNmNjg1MWIiLz48L2c+PGNpcmNsZSBjeD0iMjMuNSIgY3k9IjIzLjUiIGZpbGw9IiMwMDAiIHI9IjYuNSIvPjxwYXRoIGQ9Im0yNy40NzMgMjUuNTQ1LTEuMzEgMS4zNjhjLS4wMjkuMDMtLjA2My4wNTMtLjEwMS4wN2EuMzEuMzEgMCAwIDEgLS4xMjEuMDI0aC02LjIwOWMtLjAzIDAtLjA1OS0uMDA4LS4wODMtLjAyNGEuMTUuMTUgMCAwIDEgLS4wNTYtLjA2NWMtLjAxMi0uMDI2LS4wMTUtLjA1Ni0uMDEtLjA4NHMuMDE4LS4wNTUuMDM5LS4wNzZsMS4zMTEtMS4zNjhjLjAyOC0uMDMuMDYzLS4wNTMuMTAxLS4wNjlhLjMxLjMxIDAgMCAxIC4xMjEtLjAyNWg2LjIwOGMuMDMgMCAuMDU5LjAwOC4wODMuMDI0YS4xNS4xNSAwIDAgMSAuMDU2LjA2NWMuMDEyLjAyNi4wMTUuMDU2LjAxLjA4NHMtLjAxOC4wNTUtLjAzOS4wNzZ6bS0xLjMxLTIuNzU2Yy0uMDI5LS4wMy0uMDYzLS4wNTMtLjEwMS0uMDdhLjMxLjMxIDAgMCAwIC0uMTIxLS4wMjRoLTYuMjA5Yy0uMDMgMC0uMDU5LjAwOC0uMDgzLjAyNHMtLjA0NC4wMzgtLjA1Ni4wNjUtLjAxNS4wNTYtLjAxLjA4NC4wMTguMDU1LjAzOS4wNzZsMS4zMTEgMS4zNjhjLjAyOC4wMy4wNjMuMDUzLjEwMS4wNjlhLjMxLjMxIDAgMCAwIC4xMjEuMDI1aDYuMjA4Yy4wMyAwIC4wNTktLjAwOC4wODMtLjAyNGEuMTUuMTUgMCAwIDAgLjA1Ni0uMDY1Yy4wMTItLjAyNi4wMTUtLjA1Ni4wMS0uMDg0cy0uMDE4LS4wNTUtLjAzOS0uMDc2em0tNi40MzEtLjk4M2g2LjIwOWEuMzEuMzEgMCAwIDAgLjEyMS0uMDI0Yy4wMzgtLjAxNi4wNzMtLjA0LjEwMS0uMDdsMS4zMS0xLjM2OGMuMDItLjAyMS4wMzQtLjA0Ny4wMzktLjA3NnMuMDAxLS4wNTgtLjAxLS4wODRhLjE1LjE1IDAgMCAwIC0uMDU2LS4wNjVjLS4wMjUtLjAxNi0uMDU0LS4wMjQtLjA4My0uMDI0aC02LjIwOGEuMzEuMzEgMCAwIDAgLS4xMjEuMDI1Yy0uMDM4LjAxNi0uMDcyLjA0LS4xMDEuMDY5bC0xLjMxIDEuMzY4Yy0uMDIuMDIxLS4wMzQuMDQ3LS4wMzkuMDc2cy0uMDAxLjA1OC4wMS4wODQuMDMxLjA0OS4wNTYuMDY1LjA1NC4wMjQuMDgzLjAyNHoiIGZpbGw9InVybCgjYSkiLz48L3N2Zz4=';\n//# sourceMappingURL=icon.js.map","var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar _SolflareMetaMaskWallet_instances, _SolflareMetaMaskWallet_listeners, _SolflareMetaMaskWallet_version, _SolflareMetaMaskWallet_name, _SolflareMetaMaskWallet_icon, _SolflareMetaMaskWallet_solflareMetaMask, _SolflareMetaMaskWallet_on, _SolflareMetaMaskWallet_emit, _SolflareMetaMaskWallet_off, _SolflareMetaMaskWallet_connect, _SolflareMetaMaskWallet_disconnect, _SolflareMetaMaskWallet_signAndSendTransaction, _SolflareMetaMaskWallet_signTransaction, _SolflareMetaMaskWallet_signMessage;\nimport { WalletNotConnectedError } from '@solana/wallet-adapter-base';\nimport { SOLANA_DEVNET_CHAIN, SOLANA_MAINNET_CHAIN, SOLANA_TESTNET_CHAIN } from '@solana/wallet-standard-chains';\nimport { SolanaSignAndSendTransaction, SolanaSignMessage, SolanaSignTransaction, } from '@solana/wallet-standard-features';\nimport { StandardConnect, StandardDisconnect, StandardEvents, } from '@wallet-standard/features';\nimport { icon } from './icon.js';\nexport class SolflareMetaMaskWallet {\n    constructor() {\n        _SolflareMetaMaskWallet_instances.add(this);\n        _SolflareMetaMaskWallet_listeners.set(this, {});\n        _SolflareMetaMaskWallet_version.set(this, '1.0.0');\n        _SolflareMetaMaskWallet_name.set(this, 'MetaMask');\n        _SolflareMetaMaskWallet_icon.set(this, icon);\n        _SolflareMetaMaskWallet_solflareMetaMask.set(this, null);\n        _SolflareMetaMaskWallet_on.set(this, (event, listener) => {\n            __classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.push(listener) || (__classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event] = [listener]);\n            return () => __classPrivateFieldGet(this, _SolflareMetaMaskWallet_instances, \"m\", _SolflareMetaMaskWallet_off).call(this, event, listener);\n        });\n        _SolflareMetaMaskWallet_connect.set(this, async () => {\n            if (!__classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\")) {\n                let SolflareMetaMaskClass;\n                try {\n                    SolflareMetaMaskClass = (await import('@solflare-wallet/metamask-sdk')).default;\n                }\n                catch (error) {\n                    throw new Error('Unable to load Solflare MetaMask SDK');\n                }\n                __classPrivateFieldSet(this, _SolflareMetaMaskWallet_solflareMetaMask, new SolflareMetaMaskClass(), \"f\");\n                __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").on('standard_change', (properties) => __classPrivateFieldGet(this, _SolflareMetaMaskWallet_instances, \"m\", _SolflareMetaMaskWallet_emit).call(this, 'change', properties));\n            }\n            if (!this.accounts.length) {\n                await __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").connect();\n            }\n            return { accounts: this.accounts };\n        });\n        _SolflareMetaMaskWallet_disconnect.set(this, async () => {\n            if (!__classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                return;\n            await __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").disconnect();\n        });\n        _SolflareMetaMaskWallet_signAndSendTransaction.set(this, async (...inputs) => {\n            if (!__classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignAndSendTransaction(...inputs);\n        });\n        _SolflareMetaMaskWallet_signTransaction.set(this, async (...inputs) => {\n            if (!__classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignTransaction(...inputs);\n        });\n        _SolflareMetaMaskWallet_signMessage.set(this, async (...inputs) => {\n            if (!__classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignMessage(...inputs);\n        });\n    }\n    get version() {\n        return __classPrivateFieldGet(this, _SolflareMetaMaskWallet_version, \"f\");\n    }\n    get name() {\n        return __classPrivateFieldGet(this, _SolflareMetaMaskWallet_name, \"f\");\n    }\n    get icon() {\n        return __classPrivateFieldGet(this, _SolflareMetaMaskWallet_icon, \"f\");\n    }\n    get chains() {\n        return [SOLANA_MAINNET_CHAIN, SOLANA_DEVNET_CHAIN, SOLANA_TESTNET_CHAIN];\n    }\n    get features() {\n        return {\n            [StandardConnect]: {\n                version: '1.0.0',\n                connect: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_connect, \"f\"),\n            },\n            [StandardDisconnect]: {\n                version: '1.0.0',\n                disconnect: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_disconnect, \"f\"),\n            },\n            [StandardEvents]: {\n                version: '1.0.0',\n                on: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_on, \"f\"),\n            },\n            [SolanaSignAndSendTransaction]: {\n                version: '1.0.0',\n                supportedTransactionVersions: ['legacy', 0],\n                signAndSendTransaction: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_signAndSendTransaction, \"f\"),\n            },\n            [SolanaSignTransaction]: {\n                version: '1.0.0',\n                supportedTransactionVersions: ['legacy', 0],\n                signTransaction: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_signTransaction, \"f\"),\n            },\n            [SolanaSignMessage]: {\n                version: '1.0.0',\n                signMessage: __classPrivateFieldGet(this, _SolflareMetaMaskWallet_signMessage, \"f\"),\n            },\n        };\n    }\n    get accounts() {\n        return __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\") ? __classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardAccounts : [];\n    }\n}\n_SolflareMetaMaskWallet_listeners = new WeakMap(), _SolflareMetaMaskWallet_version = new WeakMap(), _SolflareMetaMaskWallet_name = new WeakMap(), _SolflareMetaMaskWallet_icon = new WeakMap(), _SolflareMetaMaskWallet_solflareMetaMask = new WeakMap(), _SolflareMetaMaskWallet_on = new WeakMap(), _SolflareMetaMaskWallet_connect = new WeakMap(), _SolflareMetaMaskWallet_disconnect = new WeakMap(), _SolflareMetaMaskWallet_signAndSendTransaction = new WeakMap(), _SolflareMetaMaskWallet_signTransaction = new WeakMap(), _SolflareMetaMaskWallet_signMessage = new WeakMap(), _SolflareMetaMaskWallet_instances = new WeakSet(), _SolflareMetaMaskWallet_emit = function _SolflareMetaMaskWallet_emit(event, ...args) {\n    // eslint-disable-next-line prefer-spread\n    __classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.forEach((listener) => listener.apply(null, args));\n}, _SolflareMetaMaskWallet_off = function _SolflareMetaMaskWallet_off(event, listener) {\n    __classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event] = __classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.filter((existingListener) => listener !== existingListener);\n};\n//# sourceMappingURL=wallet.js.map","import { registerWallet } from '@wallet-standard/wallet';\nimport { SolflareMetaMaskWallet } from './wallet.js';\nlet registered = false;\nfunction register() {\n    if (registered)\n        return;\n    registerWallet(new SolflareMetaMaskWallet());\n    registered = true;\n}\n/** @internal */\nexport async function detectAndRegisterSolflareMetaMaskWallet() {\n    const id = 'solflare-detect-metamask';\n    function postMessage() {\n        window.postMessage({\n            target: 'metamask-contentscript',\n            data: {\n                name: 'metamask-provider',\n                data: {\n                    id,\n                    jsonrpc: '2.0',\n                    method: 'wallet_getSnaps',\n                },\n            },\n        }, window.location.origin);\n    }\n    function onMessage(event) {\n        const message = event.data;\n        if (message?.target === 'metamask-inpage' && message.data?.name === 'metamask-provider') {\n            if (message.data.data?.id === id) {\n                window.removeEventListener('message', onMessage);\n                if (!message.data.data.error) {\n                    register();\n                }\n            }\n            else {\n                postMessage();\n            }\n        }\n    }\n    window.addEventListener('message', onMessage);\n    window.setTimeout(() => window.removeEventListener('message', onMessage), 5000);\n    postMessage();\n}\n//# sourceMappingURL=detect.js.map","import { BaseMessageSignerWalletAdapter, WalletConfigError, WalletConnectionError, WalletDisconnectedError, WalletDisconnectionError, WalletError, WalletLoadError, WalletNotConnectedError, WalletNotReadyError, WalletPublicKeyError, WalletReadyState, WalletSendTransactionError, WalletSignMessageError, WalletSignTransactionError, isIosAndRedirectable, isVersionedTransaction, scopePollingDetectionStrategy, } from '@solana/wallet-adapter-base';\nimport { PublicKey } from '@solana/web3.js';\nimport { detectAndRegisterSolflareMetaMaskWallet } from './metamask/detect.js';\nexport const SolflareWalletName = 'Solflare';\nexport class SolflareWalletAdapter extends BaseMessageSignerWalletAdapter {\n    constructor(config = {}) {\n        super();\n        this.name = SolflareWalletName;\n        this.url = 'https://solflare.com';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjUwIiB2aWV3Qm94PSIwIDAgNTAgNTAiIHdpZHRoPSI1MCIgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIiB4bWxuczp4bGluaz0iaHR0cDovL3d3dy53My5vcmcvMTk5OS94bGluayI+PGxpbmVhckdyYWRpZW50IGlkPSJhIj48c3RvcCBvZmZzZXQ9IjAiIHN0b3AtY29sb3I9IiNmZmMxMGIiLz48c3RvcCBvZmZzZXQ9IjEiIHN0b3AtY29sb3I9IiNmYjNmMmUiLz48L2xpbmVhckdyYWRpZW50PjxsaW5lYXJHcmFkaWVudCBpZD0iYiIgZ3JhZGllbnRVbml0cz0idXNlclNwYWNlT25Vc2UiIHgxPSI2LjQ3ODM1IiB4Mj0iMzQuOTEwNyIgeGxpbms6aHJlZj0iI2EiIHkxPSI3LjkyIiB5Mj0iMzMuNjU5MyIvPjxyYWRpYWxHcmFkaWVudCBpZD0iYyIgY3g9IjAiIGN5PSIwIiBncmFkaWVudFRyYW5zZm9ybT0ibWF0cml4KDQuOTkyMTg4MzIgMTIuMDYzODc5NjMgLTEyLjE4MTEzNjU1IDUuMDQwNzEwNzQgMjIuNTIwMiAyMC42MTgzKSIgZ3JhZGllbnRVbml0cz0idXNlclNwYWNlT25Vc2UiIHI9IjEiIHhsaW5rOmhyZWY9IiNhIi8+PHBhdGggZD0ibTI1LjE3MDggNDcuOTEwNGMuNTI1IDAgLjk1MDcuNDIxLjk1MDcuOTQwM3MtLjQyNTcuOTQwMi0uOTUwNy45NDAyLS45NTA3LS40MjA5LS45NTA3LS45NDAyLjQyNTctLjk0MDMuOTUwNy0uOTQwM3ptLTEuMDMyOC00NC45MTU2NWMuNDY0Ni4wMzgzNi44Mzk4LjM5MDQuOTAyNy44NDY4MWwxLjEzMDcgOC4yMTU3NGMuMzc5OCAyLjcxNDMgMy42NTM1IDMuODkwNCA1LjY3NDMgMi4wNDU5bDExLjMyOTEtMTAuMzExNThjLjI3MzMtLjI0ODczLjY5ODktLjIzMTQ5Ljk1MDcuMDM4NTEuMjMwOS4yNDc3Mi4yMzc5LjYyNjk3LjAxNjEuODgyNzdsLTkuODc5MSAxMS4zOTU4Yy0xLjgxODcgMi4wOTQyLS40NzY4IDUuMzY0MyAyLjI5NTYgNS41OTc4bDguNzE2OC44NDAzYy40MzQxLjA0MTguNzUxNy40MjM0LjcwOTMuODUyNC0uMDM0OS4zNTM3LS4zMDc0LjYzOTUtLjY2MjguNjk0OWwtOS4xNTk0IDEuNDMwMmMtMi42NTkzLjM2MjUtMy44NjM2IDMuNTExNy0yLjEzMzkgNS41NTc2bDMuMjIgMy43OTYxYy4yNTk0LjMwNTguMjE4OC43NjE1LS4wOTA4IDEuMDE3OC0uMjYyMi4yMTcyLS42NDE5LjIyNTYtLjkxMzguMDIwM2wtMy45Njk0LTIuOTk3OGMtMi4xNDIxLTEuNjEwOS01LjIyOTctLjI0MTctNS40NTYxIDIuNDI0M2wtLjg3NDcgMTAuMzk3NmMtLjAzNjIuNDI5NS0uNDE3OC43NDg3LS44NTI1LjcxMy0uMzY5LS4wMzAzLS42NjcxLS4zMDk3LS43MTcxLS42NzIxbC0xLjM4NzEtMTAuMDQzN2MtLjM3MTctMi43MTQ0LTMuNjQ1NC0zLjg5MDQtNS42NzQzLTIuMDQ1OWwtMTIuMDUxOTUgMTAuOTc0Yy0uMjQ5NDcuMjI3MS0uNjM4MDkuMjExNC0uODY4LS4wMzUtLjIxMDk0LS4yMjYyLS4yMTczNS0uNTcyNC0uMDE0OTMtLjgwNmwxMC41MTgxOC0xMi4xMzg1YzEuODE4Ny0yLjA5NDIuNDg0OS01LjM2NDQtMi4yODc2LTUuNTk3OGwtOC43MTg3Mi0uODQwNWMtLjQzNDEzLS4wNDE4LS43NTE3Mi0uNDIzNS0uNzA5MzYtLjg1MjQuMDM0OTMtLjM1MzcuMzA3MzktLjYzOTQuNjYyNy0uNjk1bDkuMTUzMzgtMS40Mjk5YzIuNjU5NC0uMzYyNSAzLjg3MTgtMy41MTE3IDIuMTQyMS01LjU1NzZsLTIuMTkyLTIuNTg0MWMtLjMyMTctLjM3OTItLjI3MTMtLjk0NDMuMTEyNi0xLjI2MjEuMzI1My0uMjY5NC43OTYzLS4yNzk3IDEuMTMzNC0uMDI0OWwyLjY5MTggMi4wMzQ3YzIuMTQyMSAxLjYxMDkgNS4yMjk3LjI0MTcgNS40NTYxLTIuNDI0M2wuNzI0MS04LjU1OTk4Yy4wNDU3LS41NDA4LjUyNjUtLjk0MjU3IDEuMDczOS0uODk3Mzd6bS0yMy4xODczMyAyMC40Mzk2NWMuNTI1MDQgMCAuOTUwNjcuNDIxLjk1MDY3Ljk0MDNzLS40MjU2My45NDAzLS45NTA2Ny45NDAzYy0uNTI1MDQxIDAtLjk1MDY3LS40MjEtLjk1MDY3LS45NDAzcy40MjU2MjktLjk0MDMuOTUwNjctLjk0MDN6bTQ3LjY3OTczLS45NTQ3Yy41MjUgMCAuOTUwNy40MjEuOTUwNy45NDAzcy0uNDI1Ny45NDAyLS45NTA3Ljk0MDItLjk1MDctLjQyMDktLjk1MDctLjk0MDIuNDI1Ny0uOTQwMy45NTA3LS45NDAzem0tMjQuNjI5Ni0yMi40Nzk3Yy41MjUgMCAuOTUwNi40MjA5NzMuOTUwNi45NDAyNyAwIC41MTkzLS40MjU2Ljk0MDI3LS45NTA2Ljk0MDI3LS41MjUxIDAtLjk1MDctLjQyMDk3LS45NTA3LS45NDAyNyAwLS41MTkyOTcuNDI1Ni0uOTQwMjcuOTUwNy0uOTQwMjd6IiBmaWxsPSJ1cmwoI2IpIi8+PHBhdGggZD0ibTI0LjU3MSAzMi43NzkyYzQuOTU5NiAwIDguOTgwMi0zLjk3NjUgOC45ODAyLTguODgxOSAwLTQuOTA1My00LjAyMDYtOC44ODE5LTguOTgwMi04Ljg4MTlzLTguOTgwMiAzLjk3NjYtOC45ODAyIDguODgxOWMwIDQuOTA1NCA0LjAyMDYgOC44ODE5IDguOTgwMiA4Ljg4MTl6IiBmaWxsPSJ1cmwoI2MpIi8+PC9zdmc+';\n        this.supportedTransactionVersions = new Set(['legacy', 0]);\n        this._readyState = typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.Loadable;\n        this._disconnected = () => {\n            const wallet = this._wallet;\n            if (wallet) {\n                wallet.off('disconnect', this._disconnected);\n                this._wallet = null;\n                this._publicKey = null;\n                this.emit('error', new WalletDisconnectedError());\n                this.emit('disconnect');\n            }\n        };\n        this._accountChanged = (newPublicKey) => {\n            if (!newPublicKey)\n                return;\n            const publicKey = this._publicKey;\n            if (!publicKey)\n                return;\n            try {\n                newPublicKey = new PublicKey(newPublicKey.toBytes());\n            }\n            catch (error) {\n                this.emit('error', new WalletPublicKeyError(error?.message, error));\n                return;\n            }\n            if (publicKey.equals(newPublicKey))\n                return;\n            this._publicKey = newPublicKey;\n            this.emit('connect', newPublicKey);\n        };\n        this._connecting = false;\n        this._publicKey = null;\n        this._wallet = null;\n        this._config = config;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            scopePollingDetectionStrategy(() => {\n                if (window.solflare?.isSolflare || window.SolflareApp) {\n                    this._readyState = WalletReadyState.Installed;\n                    this.emit('readyStateChange', this._readyState);\n                    return true;\n                }\n                return false;\n            });\n            detectAndRegisterSolflareMetaMaskWallet();\n        }\n    }\n    get publicKey() {\n        return this._publicKey;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get connected() {\n        return !!this._wallet?.connected;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    async autoConnect() {\n        // Skip autoconnect in the Loadable state on iOS\n        // We can't redirect to a universal link without user input\n        if (!(this.readyState === WalletReadyState.Loadable && isIosAndRedirectable())) {\n            await this.connect();\n        }\n    }\n    async connect() {\n        try {\n            if (this.connected || this.connecting)\n                return;\n            if (this._readyState !== WalletReadyState.Loadable && this._readyState !== WalletReadyState.Installed)\n                throw new WalletNotReadyError();\n            // redirect to the Solflare /browse universal link\n            // this will open the current URL in the Solflare in-wallet browser\n            if (this.readyState === WalletReadyState.Loadable && isIosAndRedirectable()) {\n                const url = encodeURIComponent(window.location.href);\n                const ref = encodeURIComponent(window.location.origin);\n                window.location.href = `https://solflare.com/ul/v1/browse/${url}?ref=${ref}`;\n                return;\n            }\n            let SolflareClass;\n            try {\n                SolflareClass = (await import('@solflare-wallet/sdk')).default;\n            }\n            catch (error) {\n                throw new WalletLoadError(error?.message, error);\n            }\n            let wallet;\n            try {\n                wallet = new SolflareClass({ network: this._config.network });\n            }\n            catch (error) {\n                throw new WalletConfigError(error?.message, error);\n            }\n            this._connecting = true;\n            if (!wallet.connected) {\n                try {\n                    await wallet.connect();\n                }\n                catch (error) {\n                    throw new WalletConnectionError(error?.message, error);\n                }\n            }\n            if (!wallet.publicKey)\n                throw new WalletConnectionError();\n            let publicKey;\n            try {\n                publicKey = new PublicKey(wallet.publicKey.toBytes());\n            }\n            catch (error) {\n                throw new WalletPublicKeyError(error?.message, error);\n            }\n            wallet.on('disconnect', this._disconnected);\n            wallet.on('accountChanged', this._accountChanged);\n            this._wallet = wallet;\n            this._publicKey = publicKey;\n            this.emit('connect', publicKey);\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n        finally {\n            this._connecting = false;\n        }\n    }\n    async disconnect() {\n        const wallet = this._wallet;\n        if (wallet) {\n            wallet.off('disconnect', this._disconnected);\n            wallet.off('accountChanged', this._accountChanged);\n            this._wallet = null;\n            this._publicKey = null;\n            try {\n                await wallet.disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n        }\n        this.emit('disconnect');\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signers, ...sendOptions } = options;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                }\n                sendOptions.preflightCommitment = sendOptions.preflightCommitment || connection.commitment;\n                return await wallet.signAndSendTransaction(transaction, sendOptions);\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signTransaction(transaction) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signTransaction(transaction)) || transaction;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signAllTransactions(transactions)) || transactions;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signMessage(message) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return await wallet.signMessage(message, 'utf8');\n            }\n            catch (error) {\n                throw new WalletSignMessageError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n//# sourceMappingURL=adapter.js.map","import '@solana/wallet-adapter-react-ui/styles.css';\n\n// Default styles that can be overridden by your app\nimport React, { useMemo } from 'react';\n\nimport { WalletAdapterNetwork } from '@solana/wallet-adapter-base';\nimport {\n  ConnectionProvider,\n  WalletProvider,\n} from '@solana/wallet-adapter-react';\nimport { WalletModalProvider } from '@solana/wallet-adapter-react-ui';\nimport {\n  PhantomWalletAdapter,\n  SolflareWalletAdapter,\n} from '@solana/wallet-adapter-wallets';\nimport { clusterApiUrl } from '@solana/web3.js';\n\nconst Provider = ({ children }: HocProps) => {\n  const network = WalletAdapterNetwork.Devnet;\n\n  // You can also provide a custom RPC endpoint.\n  const endpoint = useMemo(() => clusterApiUrl(network), [network]);\n\n  const wallets = useMemo(\n    () => [\n        new PhantomWalletAdapter(),\n        new SolflareWalletAdapter()\n    ],\n    [network]\n);\n\n  return (\n    <ConnectionProvider endpoint={endpoint}>\n      <WalletProvider wallets={wallets} autoConnect>\n        <WalletModalProvider>\n          {children}\n        </WalletModalProvider>\n      </WalletProvider>\n    </ConnectionProvider>\n  )\n}\n\nexport default Provider\n","import createCache from '@emotion/cache'\n\nconst isBrowser = typeof document !== 'undefined'\n\n// On the client side, Create a meta tag at the top of the <head> and set it as insertionPoint.\n// This assures that MUI styles are loaded first.\n// It allows developers to easily override MUI styles with other styling solutions, like CSS modules.\nconst createEmotionCache = () => {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  let insertionPoint: any\n\n  if (isBrowser) {\n    const emotionInsertionPoint = document.querySelector(\n      'meta[name=\"emotion-insertion-point\"]',\n    )\n    insertionPoint = emotionInsertionPoint ?? undefined\n  }\n\n  return createCache({ key: 'mui-style', prepend: true, insertionPoint })\n}\n\nexport { createEmotionCache }\n","import '@fontsource-variable/inter';\nimport '@fontsource/rubik-mono-one';\nimport '@/root/src/styles/global.scss';\n\nimport { useMemo } from 'react';\n\nimport { AnimatePresence } from 'framer-motion';\nimport { AppProps } from 'next/app';\nimport Head from 'next/head';\nimport PropTypes from 'prop-types';\nimport {\n  Hydrate,\n  QueryClient,\n  QueryClientProvider,\n} from 'react-query';\nimport { ReactQueryDevtools } from 'react-query/devtools';\n\nimport { SolanaProvider } from '@/providers/solana';\nimport ThemeProvider from '@/providers/theme';\nimport WalletProvider from '@/providers/wallet';\nimport { createEmotionCache } from '@/utils/create-emotion-cache';\nimport {\n  CacheProvider,\n  EmotionCache,\n} from '@emotion/react';\n\n// Client-side cache, shared for the whole session of the user in the browser.\nconst clientSideEmotionCache = createEmotionCache();\n\ninterface MyAppProps extends AppProps {\n  emotionCache: EmotionCache;\n}\n\nexport default function MyApp(props: MyAppProps) {\n  const { Component, emotionCache = clientSideEmotionCache, pageProps } = props;\n  const queryClient = useMemo(() => new QueryClient(), []);\n\n  return (\n    <AnimatePresence mode=\"wait\">\n      <CacheProvider value={emotionCache}>\n        <Head>\n          <title>Airdrop</title>\n          <meta\n            name=\"viewport\"\n            content=\"width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1\"\n          />\n        </Head>\n        <QueryClientProvider client={queryClient}>\n          <Hydrate state={pageProps.dehydratedState}>\n            <ThemeProvider>\n              <WalletProvider>\n                <SolanaProvider>\n                  <Component {...pageProps} />\n                </SolanaProvider>\n                <ReactQueryDevtools initialIsOpen={false} />\n              </WalletProvider>\n            </ThemeProvider>\n          </Hydrate>\n        </QueryClientProvider>\n      </CacheProvider>\n    </AnimatePresence>\n  );\n}\n\nMyApp.propTypes = {\n  Component: PropTypes.elementType.isRequired,\n  emotionCache: PropTypes.object,\n  pageProps: PropTypes.object.isRequired,\n};\n","export type MerkleDistributor = {\n  version: '0.0.1';\n  name: 'merkle_distributor';\n  instructions: [\n    {\n      name: 'newDistributor';\n      docs: [\n        'READ THE FOLLOWING:',\n        '',\n        'This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.',\n        '',\n        'An attack could look like:',\n        '- A legitimate user opens a new distributor.',\n        '- Someone observes the call to this instruction.',\n        '- They replace the clawback_receiver, admin, or time parameters with their own.',\n        '',\n        'One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.',\n        'Then the attacker can steal all funds from the distributor to their own clawback_receiver account.',\n        '',\n        'HOW TO AVOID:',\n        '- When you call into this instruction, ensure your transaction succeeds.',\n        '- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and',\n        'assert the parameters are what you expect, most importantly the clawback_receiver and admin.',\n        '- If your transaction fails, double check the value on-chain matches what you expect.',\n      ];\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['[MerkleDistributor].'];\n          pda: {\n            seeds: [\n              {\n                kind: 'const';\n                type: 'string';\n                value: 'MerkleDistributor';\n              },\n              {\n                kind: 'account';\n                type: 'publicKey';\n                account: 'Mint';\n                path: 'mint';\n              },\n              {\n                kind: 'arg';\n                type: 'u64';\n                path: 'version';\n              },\n            ];\n          };\n        },\n        {\n          name: 'clawbackReceiver';\n          isMut: false;\n          isSigner: false;\n          docs: ['Clawback receiver token account'];\n        },\n        {\n          name: 'mint';\n          isMut: false;\n          isSigner: false;\n          docs: ['The mint to distribute.'];\n        },\n        {\n          name: 'tokenVault';\n          isMut: true;\n          isSigner: false;\n          docs: ['Token vault'];\n        },\n        {\n          name: 'admin';\n          isMut: true;\n          isSigner: true;\n          docs: [\n            'Admin wallet, responsible for creating the distributor and paying for the transaction.',\n            'Also has the authority to set the clawback receiver and change itself.',\n          ];\n        },\n        {\n          name: 'systemProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['The [System] program.'];\n        },\n        {\n          name: 'associatedTokenProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['The [Associated Token] program.'];\n        },\n        {\n          name: 'tokenProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['The [Token] program.'];\n        },\n      ];\n      args: [\n        {\n          name: 'version';\n          type: 'u64';\n        },\n        {\n          name: 'root';\n          type: {\n            array: ['u8', 32];\n          };\n        },\n        {\n          name: 'maxTotalClaim';\n          type: 'u64';\n        },\n        {\n          name: 'maxNumNodes';\n          type: 'u64';\n        },\n        {\n          name: 'startTs';\n          type: 'i64';\n        },\n        {\n          name: 'endTs';\n          type: 'i64';\n        },\n      ];\n    },\n    {\n      name: 'newClaim';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'claimStatus';\n          isMut: true;\n          isSigner: false;\n          docs: ['Claim status PDA'];\n          pda: {\n            seeds: [\n              {\n                kind: 'const';\n                type: 'string';\n                value: 'ClaimStatus';\n              },\n              {\n                kind: 'account';\n                type: 'publicKey';\n                path: 'claimant';\n              },\n              {\n                kind: 'account';\n                type: 'publicKey';\n                account: 'MerkleDistributor';\n                path: 'distributor';\n              },\n            ];\n          };\n        },\n        {\n          name: 'from';\n          isMut: true;\n          isSigner: false;\n          docs: ['Distributor ATA containing the tokens to distribute.'];\n        },\n        {\n          name: 'to';\n          isMut: true;\n          isSigner: false;\n          docs: ['Account to send the claimed tokens to.'];\n        },\n        {\n          name: 'claimant';\n          isMut: true;\n          isSigner: true;\n          docs: ['Who is claiming the tokens.'];\n        },\n        {\n          name: 'tokenProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['SPL [Token] program.'];\n        },\n        {\n          name: 'systemProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['The [System] program.'];\n        },\n      ];\n      args: [\n        {\n          name: 'index';\n          type: 'u64';\n        },\n        {\n          name: 'amount';\n          type: 'u64';\n        },\n        {\n          name: 'proof';\n          type: {\n            vec: {\n              array: ['u8', 32];\n            };\n          };\n        },\n      ];\n    },\n    {\n      name: 'clawback';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'from';\n          isMut: true;\n          isSigner: false;\n          docs: ['Distributor ATA containing the tokens to distribute.'];\n        },\n        {\n          name: 'to';\n          isMut: true;\n          isSigner: false;\n          docs: ['The Clawback token account.'];\n        },\n        {\n          name: 'claimant';\n          isMut: false;\n          isSigner: true;\n          docs: ['Claimant account', 'Anyone can claw back the funds'];\n        },\n        {\n          name: 'systemProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['The [System] program.'];\n        },\n        {\n          name: 'tokenProgram';\n          isMut: false;\n          isSigner: false;\n          docs: ['SPL [Token] program.'];\n        },\n      ];\n      args: [\n        {\n          name: 'amount';\n          type: 'u64';\n        },\n      ];\n    },\n    {\n      name: 'setClawbackReceiver';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'newClawbackAccount';\n          isMut: false;\n          isSigner: false;\n          docs: ['New clawback account'];\n        },\n        {\n          name: 'admin';\n          isMut: true;\n          isSigner: true;\n          docs: ['Admin signer'];\n        },\n      ];\n      args: [];\n    },\n    {\n      name: 'setAdmin';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'admin';\n          isMut: true;\n          isSigner: true;\n          docs: ['Admin signer'];\n        },\n        {\n          name: 'newAdmin';\n          isMut: true;\n          isSigner: false;\n          docs: ['New admin account'];\n        },\n      ];\n      args: [];\n    },\n    {\n      name: 'setTimestamp';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'admin';\n          isMut: true;\n          isSigner: true;\n          docs: ['Admin signer'];\n        },\n      ];\n      args: [\n        {\n          name: 'startTs';\n          type: 'i64';\n        },\n        {\n          name: 'endTs';\n          type: 'i64';\n        },\n      ];\n    },\n    {\n      name: 'setMerkleRoot';\n      accounts: [\n        {\n          name: 'distributor';\n          isMut: true;\n          isSigner: false;\n          docs: ['The [MerkleDistributor].'];\n        },\n        {\n          name: 'admin';\n          isMut: true;\n          isSigner: true;\n          docs: ['Admin signer'];\n        },\n      ];\n      args: [\n        {\n          name: 'root';\n          type: {\n            array: ['u8', 32];\n          };\n        },\n      ];\n    },\n  ];\n  accounts: [\n    {\n      name: 'claimStatus';\n      docs: ['Holds whether or not a claimant has claimed tokens.'];\n      type: {\n        kind: 'struct';\n        fields: [\n          {\n            name: 'isClaimed';\n            docs: ['If true, the tokens have been claimed.'];\n            type: 'bool';\n          },\n          {\n            name: 'claimant';\n            docs: ['Authority that claimed the tokens.'];\n            type: 'publicKey';\n          },\n          {\n            name: 'claimedAt';\n            docs: ['When the tokens were claimed.'];\n            type: 'i64';\n          },\n          {\n            name: 'amount';\n            docs: ['Amount of tokens claimed.'];\n            type: 'u64';\n          },\n        ];\n      };\n    },\n    {\n      name: 'merkleDistributor';\n      docs: ['State for the account which distributes tokens.'];\n      type: {\n        kind: 'struct';\n        fields: [\n          {\n            name: 'bump';\n            docs: ['Bump seed.'];\n            type: 'u8';\n          },\n          {\n            name: 'version';\n            docs: ['Version of the airdrop'];\n            type: 'u64';\n          },\n          {\n            name: 'root';\n            docs: ['The 256-bit merkle root.'];\n            type: {\n              array: ['u8', 32];\n            };\n          },\n          {\n            name: 'mint';\n            docs: ['[Mint] of the token to be distributed.'];\n            type: 'publicKey';\n          },\n          {\n            name: 'tokenVault';\n            docs: ['Token Address of the vault'];\n            type: 'publicKey';\n          },\n          {\n            name: 'maxTotalClaim';\n            docs: [\n              'Maximum number of tokens that can ever be claimed from this [MerkleDistributor].',\n            ];\n            type: 'u64';\n          },\n          {\n            name: 'maxNumNodes';\n            docs: ['Maximum number of nodes in [MerkleDistributor].'];\n            type: 'u64';\n          },\n          {\n            name: 'totalAmountClaimed';\n            docs: ['Total amount of tokens that have been claimed.'];\n            type: 'u64';\n          },\n          {\n            name: 'numNodesClaimed';\n            docs: ['Number of nodes that have been claimed.'];\n            type: 'u64';\n          },\n          {\n            name: 'startTs';\n            docs: ['Claim time start (Unix Timestamp)'];\n            type: 'i64';\n          },\n          {\n            name: 'endTs';\n            docs: ['Claim time end (Unix Timestamp)'];\n            type: 'i64';\n          },\n          {\n            name: 'clawbackReceiver';\n            docs: ['Clawback receiver'];\n            type: 'publicKey';\n          },\n          {\n            name: 'admin';\n            docs: ['Admin wallet'];\n            type: 'publicKey';\n          },\n        ];\n      };\n    },\n  ];\n  events: [\n    {\n      name: 'NewClaimEvent';\n      fields: [\n        {\n          name: 'claimant';\n          type: 'publicKey';\n          index: false;\n        },\n        {\n          name: 'timestamp';\n          type: 'i64';\n          index: false;\n        },\n      ];\n    },\n    {\n      name: 'ClaimedEvent';\n      fields: [\n        {\n          name: 'claimant';\n          type: 'publicKey';\n          index: false;\n        },\n        {\n          name: 'amount';\n          type: 'u64';\n          index: false;\n        },\n      ];\n    },\n  ];\n  errors: [\n    {\n      code: 6000;\n      name: 'InvalidProof';\n      msg: 'Invalid Merkle proof';\n    },\n    {\n      code: 6001;\n      name: 'ExceededMaxClaim';\n      msg: 'Exceeded maximum claim amount';\n    },\n    {\n      code: 6002;\n      name: 'MaxNodesExceeded';\n      msg: 'Exceeded maximum node count';\n    },\n    {\n      code: 6003;\n      name: 'Unauthorized';\n      msg: 'Account is not authorized to execute this instruction';\n    },\n    {\n      code: 6004;\n      name: 'OwnerMismatch';\n      msg: 'Token account owner did not match intended owner';\n    },\n    {\n      code: 6005;\n      name: 'SameClawbackReceiver';\n      msg: 'New and old Clawback receivers are identical';\n    },\n    {\n      code: 6006;\n      name: 'SameAdmin';\n      msg: 'New and old admin are identical';\n    },\n    {\n      code: 6007;\n      name: 'ClaimExpired';\n      msg: 'Claim window expired';\n    },\n    {\n      code: 6008;\n      name: 'ArithmeticError';\n      msg: 'Arithmetic Error (overflow/underflow)';\n    },\n    {\n      code: 6009;\n      name: 'StartTimestampAfterEnd';\n      msg: 'Start Timestamp cannot be after end Timestamp';\n    },\n    {\n      code: 6010;\n      name: 'TimestampsNotInFuture';\n      msg: 'Timestamps cannot be in the past';\n    },\n    {\n      code: 6011;\n      name: 'DistributionAlreadyStarted';\n      msg: 'Distribution already started';\n    },\n    {\n      code: 6012;\n      name: 'InsufficientClawbackAmount';\n      msg: 'Insufficient clawback amount';\n    },\n  ];\n};\n\nexport const IDL: MerkleDistributor = {\n  version: '0.0.1',\n  name: 'merkle_distributor',\n  instructions: [\n    {\n      name: 'newDistributor',\n      docs: [\n        'READ THE FOLLOWING:',\n        '',\n        'This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.',\n        '',\n        'An attack could look like:',\n        '- A legitimate user opens a new distributor.',\n        '- Someone observes the call to this instruction.',\n        '- They replace the clawback_receiver, admin, or time parameters with their own.',\n        '',\n        'One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.',\n        'Then the attacker can steal all funds from the distributor to their own clawback_receiver account.',\n        '',\n        'HOW TO AVOID:',\n        '- When you call into this instruction, ensure your transaction succeeds.',\n        '- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and',\n        'assert the parameters are what you expect, most importantly the clawback_receiver and admin.',\n        '- If your transaction fails, double check the value on-chain matches what you expect.',\n      ],\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['[MerkleDistributor].'],\n          pda: {\n            seeds: [\n              {\n                kind: 'const',\n                type: 'string',\n                value: 'MerkleDistributor',\n              },\n              {\n                kind: 'account',\n                type: 'publicKey',\n                account: 'Mint',\n                path: 'mint',\n              },\n              {\n                kind: 'arg',\n                type: 'u64',\n                path: 'version',\n              },\n            ],\n          },\n        },\n        {\n          name: 'clawbackReceiver',\n          isMut: false,\n          isSigner: false,\n          docs: ['Clawback receiver token account'],\n        },\n        {\n          name: 'mint',\n          isMut: false,\n          isSigner: false,\n          docs: ['The mint to distribute.'],\n        },\n        {\n          name: 'tokenVault',\n          isMut: true,\n          isSigner: false,\n          docs: ['Token vault'],\n        },\n        {\n          name: 'admin',\n          isMut: true,\n          isSigner: true,\n          docs: [\n            'Admin wallet, responsible for creating the distributor and paying for the transaction.',\n            'Also has the authority to set the clawback receiver and change itself.',\n          ],\n        },\n        {\n          name: 'systemProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['The [System] program.'],\n        },\n        {\n          name: 'associatedTokenProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['The [Associated Token] program.'],\n        },\n        {\n          name: 'tokenProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['The [Token] program.'],\n        },\n      ],\n      args: [\n        {\n          name: 'version',\n          type: 'u64',\n        },\n        {\n          name: 'root',\n          type: {\n            array: ['u8', 32],\n          },\n        },\n        {\n          name: 'maxTotalClaim',\n          type: 'u64',\n        },\n        {\n          name: 'maxNumNodes',\n          type: 'u64',\n        },\n        {\n          name: 'startTs',\n          type: 'i64',\n        },\n        {\n          name: 'endTs',\n          type: 'i64',\n        },\n      ],\n    },\n    {\n      name: 'newClaim',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'claimStatus',\n          isMut: true,\n          isSigner: false,\n          docs: ['Claim status PDA'],\n          pda: {\n            seeds: [\n              {\n                kind: 'const',\n                type: 'string',\n                value: 'ClaimStatus',\n              },\n              {\n                kind: 'account',\n                type: 'publicKey',\n                path: 'claimant',\n              },\n              {\n                kind: 'account',\n                type: 'publicKey',\n                account: 'MerkleDistributor',\n                path: 'distributor',\n              },\n            ],\n          },\n        },\n        {\n          name: 'from',\n          isMut: true,\n          isSigner: false,\n          docs: ['Distributor ATA containing the tokens to distribute.'],\n        },\n        {\n          name: 'to',\n          isMut: true,\n          isSigner: false,\n          docs: ['Account to send the claimed tokens to.'],\n        },\n        {\n          name: 'claimant',\n          isMut: true,\n          isSigner: true,\n          docs: ['Who is claiming the tokens.'],\n        },\n        {\n          name: 'tokenProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['SPL [Token] program.'],\n        },\n        {\n          name: 'systemProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['The [System] program.'],\n        },\n      ],\n      args: [\n        {\n          name: 'index',\n          type: 'u64',\n        },\n        {\n          name: 'amount',\n          type: 'u64',\n        },\n        {\n          name: 'proof',\n          type: {\n            vec: {\n              array: ['u8', 32],\n            },\n          },\n        },\n      ],\n    },\n    {\n      name: 'clawback',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'from',\n          isMut: true,\n          isSigner: false,\n          docs: ['Distributor ATA containing the tokens to distribute.'],\n        },\n        {\n          name: 'to',\n          isMut: true,\n          isSigner: false,\n          docs: ['The Clawback token account.'],\n        },\n        {\n          name: 'claimant',\n          isMut: false,\n          isSigner: true,\n          docs: ['Claimant account', 'Anyone can claw back the funds'],\n        },\n        {\n          name: 'systemProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['The [System] program.'],\n        },\n        {\n          name: 'tokenProgram',\n          isMut: false,\n          isSigner: false,\n          docs: ['SPL [Token] program.'],\n        },\n      ],\n      args: [\n        {\n          name: 'amount',\n          type: 'u64',\n        },\n      ],\n    },\n    {\n      name: 'setClawbackReceiver',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'newClawbackAccount',\n          isMut: false,\n          isSigner: false,\n          docs: ['New clawback account'],\n        },\n        {\n          name: 'admin',\n          isMut: true,\n          isSigner: true,\n          docs: ['Admin signer'],\n        },\n      ],\n      args: [],\n    },\n    {\n      name: 'setAdmin',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'admin',\n          isMut: true,\n          isSigner: true,\n          docs: ['Admin signer'],\n        },\n        {\n          name: 'newAdmin',\n          isMut: true,\n          isSigner: false,\n          docs: ['New admin account'],\n        },\n      ],\n      args: [],\n    },\n    {\n      name: 'setTimestamp',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'admin',\n          isMut: true,\n          isSigner: true,\n          docs: ['Admin signer'],\n        },\n      ],\n      args: [\n        {\n          name: 'startTs',\n          type: 'i64',\n        },\n        {\n          name: 'endTs',\n          type: 'i64',\n        },\n      ],\n    },\n    {\n      name: 'setMerkleRoot',\n      accounts: [\n        {\n          name: 'distributor',\n          isMut: true,\n          isSigner: false,\n          docs: ['The [MerkleDistributor].'],\n        },\n        {\n          name: 'admin',\n          isMut: true,\n          isSigner: true,\n          docs: ['Admin signer'],\n        },\n      ],\n      args: [\n        {\n          name: 'root',\n          type: {\n            array: ['u8', 32],\n          },\n        },\n      ],\n    },\n  ],\n  accounts: [\n    {\n      name: 'claimStatus',\n      docs: ['Holds whether or not a claimant has claimed tokens.'],\n      type: {\n        kind: 'struct',\n        fields: [\n          {\n            name: 'isClaimed',\n            docs: ['If true, the tokens have been claimed.'],\n            type: 'bool',\n          },\n          {\n            name: 'claimant',\n            docs: ['Authority that claimed the tokens.'],\n            type: 'publicKey',\n          },\n          {\n            name: 'claimedAt',\n            docs: ['When the tokens were claimed.'],\n            type: 'i64',\n          },\n          {\n            name: 'amount',\n            docs: ['Amount of tokens claimed.'],\n            type: 'u64',\n          },\n        ],\n      },\n    },\n    {\n      name: 'merkleDistributor',\n      docs: ['State for the account which distributes tokens.'],\n      type: {\n        kind: 'struct',\n        fields: [\n          {\n            name: 'bump',\n            docs: ['Bump seed.'],\n            type: 'u8',\n          },\n          {\n            name: 'version',\n            docs: ['Version of the airdrop'],\n            type: 'u64',\n          },\n          {\n            name: 'root',\n            docs: ['The 256-bit merkle root.'],\n            type: {\n              array: ['u8', 32],\n            },\n          },\n          {\n            name: 'mint',\n            docs: ['[Mint] of the token to be distributed.'],\n            type: 'publicKey',\n          },\n          {\n            name: 'tokenVault',\n            docs: ['Token Address of the vault'],\n            type: 'publicKey',\n          },\n          {\n            name: 'maxTotalClaim',\n            docs: [\n              'Maximum number of tokens that can ever be claimed from this [MerkleDistributor].',\n            ],\n            type: 'u64',\n          },\n          {\n            name: 'maxNumNodes',\n            docs: ['Maximum number of nodes in [MerkleDistributor].'],\n            type: 'u64',\n          },\n          {\n            name: 'totalAmountClaimed',\n            docs: ['Total amount of tokens that have been claimed.'],\n            type: 'u64',\n          },\n          {\n            name: 'numNodesClaimed',\n            docs: ['Number of nodes that have been claimed.'],\n            type: 'u64',\n          },\n          {\n            name: 'startTs',\n            docs: ['Claim time start (Unix Timestamp)'],\n            type: 'i64',\n          },\n          {\n            name: 'endTs',\n            docs: ['Claim time end (Unix Timestamp)'],\n            type: 'i64',\n          },\n          {\n            name: 'clawbackReceiver',\n            docs: ['Clawback receiver'],\n            type: 'publicKey',\n          },\n          {\n            name: 'admin',\n            docs: ['Admin wallet'],\n            type: 'publicKey',\n          },\n        ],\n      },\n    },\n  ],\n  events: [\n    {\n      name: 'NewClaimEvent',\n      fields: [\n        {\n          name: 'claimant',\n          type: 'publicKey',\n          index: false,\n        },\n        {\n          name: 'timestamp',\n          type: 'i64',\n          index: false,\n        },\n      ],\n    },\n    {\n      name: 'ClaimedEvent',\n      fields: [\n        {\n          name: 'claimant',\n          type: 'publicKey',\n          index: false,\n        },\n        {\n          name: 'amount',\n          type: 'u64',\n          index: false,\n        },\n      ],\n    },\n  ],\n  errors: [\n    {\n      code: 6000,\n      name: 'InvalidProof',\n      msg: 'Invalid Merkle proof',\n    },\n    {\n      code: 6001,\n      name: 'ExceededMaxClaim',\n      msg: 'Exceeded maximum claim amount',\n    },\n    {\n      code: 6002,\n      name: 'MaxNodesExceeded',\n      msg: 'Exceeded maximum node count',\n    },\n    {\n      code: 6003,\n      name: 'Unauthorized',\n      msg: 'Account is not authorized to execute this instruction',\n    },\n    {\n      code: 6004,\n      name: 'OwnerMismatch',\n      msg: 'Token account owner did not match intended owner',\n    },\n    {\n      code: 6005,\n      name: 'SameClawbackReceiver',\n      msg: 'New and old Clawback receivers are identical',\n    },\n    {\n      code: 6006,\n      name: 'SameAdmin',\n      msg: 'New and old admin are identical',\n    },\n    {\n      code: 6007,\n      name: 'ClaimExpired',\n      msg: 'Claim window expired',\n    },\n    {\n      code: 6008,\n      name: 'ArithmeticError',\n      msg: 'Arithmetic Error (overflow/underflow)',\n    },\n    {\n      code: 6009,\n      name: 'StartTimestampAfterEnd',\n      msg: 'Start Timestamp cannot be after end Timestamp',\n    },\n    {\n      code: 6010,\n      name: 'TimestampsNotInFuture',\n      msg: 'Timestamps cannot be in the past',\n    },\n    {\n      code: 6011,\n      name: 'DistributionAlreadyStarted',\n      msg: 'Distribution already started',\n    },\n    {\n      code: 6012,\n      name: 'InsufficientClawbackAmount',\n      msg: 'Insufficient clawback amount',\n    },\n  ],\n};\n","import React, {\n  ReactNode,\n  useContext,\n  useEffect,\n  useState,\n} from 'react';\n\nimport {\n  IDL,\n  MerkleDistributor,\n} from '@/types/merkle_distributor';\nimport { BN } from '@coral-xyz/anchor';\nimport NodeWallet from '@coral-xyz/anchor/dist/cjs/nodewallet';\nimport {\n  AnchorProvider,\n  Program,\n} from '@project-serum/anchor';\nimport {\n  Context,\n  DistributorClient,\n  PDA,\n  PDAInfo,\n} from '@renec-foundation/distributor-sdk';\nimport { useWallet } from '@solana/wallet-adapter-react';\nimport {\n  Connection,\n  Keypair,\n  PublicKey,\n} from '@solana/web3.js';\n\nconst defaultSolanaContext = {\n  connection: null as Connection | null,\n  provider: null as AnchorProvider | null,\n  program: null as Program<MerkleDistributor> | null,\n  ctx: null as Context | null,\n  distributorClient: null as DistributorClient | null,\n  mintPublicKey: new PublicKey('11111111111111111111111111111111'),\n  merkleTreeVersion: 1,\n  distributor: null as PDAInfo | null,\n  publicKey: null as PublicKey | null,\n  connected: false,\n  connect: async () => {},\n  disconnect: async () => {},\n};\n\nconst SolanaContext = React.createContext(defaultSolanaContext);\n\ninterface SolanaProviderProps {\n  children: ReactNode;\n}\nexport const SolanaProvider: React.FC<SolanaProviderProps> = ({ children }) => {\n  const {\n    connect,\n    disconnect,\n    connected,\n    publicKey: userPublicKey,\n    signTransaction,\n    signAllTransactions,\n  } = useWallet();\n  const defaultKeypair = Keypair.generate();\n  const defaultWallet = new NodeWallet(defaultKeypair);\n  const [publicKey, setPublicKey] = useState<PublicKey>(\n    defaultKeypair.publicKey,\n  );\n  const connectionUrl = process.env.NEXT_PUBLIC_SOLANA_CONNECTION_URL;\n  if (!connectionUrl) {\n    throw new Error('NEXT_PUBLIC_SOLANA_CONNECTION_URL is not defined');\n  }\n  const connection = new Connection(connectionUrl, 'confirmed');\n  const [provider, setProvider] = useState<AnchorProvider>(\n    new AnchorProvider(connection, defaultWallet, {}),\n  );\n\n  const programAddress = process.env.NEXT_PUBLIC_PROGRAM_ADDRESS;\n  if (!programAddress) {\n    throw new Error('NEXT_PUBLIC_PROGRAM_ADDRESS is not defined');\n  }\n  const programId = new PublicKey(programAddress);\n  const program = new Program<MerkleDistributor>(IDL, programId, provider);\n\n  const ctx = Context.withProvider(provider, new PublicKey(program.programId));\n\n  const distributorClient = new DistributorClient(\n    ctx,\n    new PDA(program.programId),\n  );\n\n  const mintAddress = process.env.NEXT_PUBLIC_MINT_ADDRESS; // TODO move to useEffect if get mintAddress from database\n  if (!mintAddress) {\n    throw new Error('NEXT_PUBLIC_MINT_ADDRESS is not defined');\n  }\n  const mintPublicKey = new PublicKey(mintAddress);\n\n  const merkleTreeVersion = parseInt(\n    process.env.NEXT_PUBLIC_MERKLE_TREE_VERSION ?? '1',\n    10,\n  );\n\n  const distributor = distributorClient.pda.distributor(\n    mintPublicKey,\n    new BN(merkleTreeVersion),\n  );\n\n  useEffect(() => {\n    if (connected && userPublicKey) {\n      setPublicKey(userPublicKey);\n      setProvider(\n        new AnchorProvider(\n          connection,\n          {\n            publicKey: userPublicKey,\n            signTransaction: signTransaction!,\n            signAllTransactions: signAllTransactions!,\n          },\n          {},\n        ),\n      );\n    } else {\n      setPublicKey(defaultKeypair.publicKey);\n      setProvider(new AnchorProvider(connection, defaultWallet, {}));\n    }\n  }, [connected, userPublicKey]);\n\n  const handleConnect = async () => {\n    await connect();\n  };\n\n  const handleDisconnect = async () => {\n    await disconnect();\n  };\n\n  const value = {\n    connection,\n    provider,\n    program,\n    ctx,\n    distributorClient,\n    mintPublicKey,\n    merkleTreeVersion,\n    distributor,\n    publicKey,\n    connected,\n    connect: handleConnect,\n    disconnect: handleDisconnect,\n  };\n\n  return (\n    <SolanaContext.Provider value={value}>{children}</SolanaContext.Provider>\n  );\n};\n\nexport const useSolana = () => useContext(SolanaContext);\n","// extracted by mini-css-extract-plugin","// extracted by mini-css-extract-plugin","// extracted by mini-css-extract-plugin","// extracted by mini-css-extract-plugin","module.exports = require('./dist/shared/lib/head')\n","'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n","'use strict';\n\nvar define = require('define-properties');\nvar callBind = require('call-bind');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n","'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n","'use strict';\n\nvar slice = Array.prototype.slice;\nvar isArgs = require('./isArguments');\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : require('./implementation');\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n","'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","'use strict';\n\nvar errcode = require('err-code');\nvar retry = require('retry');\n\nvar hasOwn = Object.prototype.hasOwnProperty;\n\nfunction isRetryError(err) {\n    return err && err.code === 'EPROMISERETRY' && hasOwn.call(err, 'retried');\n}\n\nfunction promiseRetry(fn, options) {\n    var temp;\n    var operation;\n\n    if (typeof fn === 'object' && typeof options === 'function') {\n        // Swap options and fn when using alternate signature (options, fn)\n        temp = options;\n        options = fn;\n        fn = temp;\n    }\n\n    operation = retry.operation(options);\n\n    return new Promise(function (resolve, reject) {\n        operation.attempt(function (number) {\n            Promise.resolve()\n            .then(function () {\n                return fn(function (err) {\n                    if (isRetryError(err)) {\n                        err = err.retried;\n                    }\n\n                    throw errcode(new Error('Retrying'), 'EPROMISERETRY', { retried: err });\n                }, number);\n            })\n            .then(resolve, function (err) {\n                if (isRetryError(err)) {\n                    err = err.retried;\n\n                    if (operation.retry(err || new Error())) {\n                        return;\n                    }\n                }\n\n                reject(err);\n            });\n        });\n    });\n}\n\nmodule.exports = promiseRetry;\n","module.exports = require('./lib/retry');","var RetryOperation = require('./retry_operation');\n\nexports.operation = function(options) {\n  var timeouts = exports.timeouts(options);\n  return new RetryOperation(timeouts, {\n      forever: options && options.forever,\n      unref: options && options.unref,\n      maxRetryTime: options && options.maxRetryTime\n  });\n};\n\nexports.timeouts = function(options) {\n  if (options instanceof Array) {\n    return [].concat(options);\n  }\n\n  var opts = {\n    retries: 10,\n    factor: 2,\n    minTimeout: 1 * 1000,\n    maxTimeout: Infinity,\n    randomize: false\n  };\n  for (var key in options) {\n    opts[key] = options[key];\n  }\n\n  if (opts.minTimeout > opts.maxTimeout) {\n    throw new Error('minTimeout is greater than maxTimeout');\n  }\n\n  var timeouts = [];\n  for (var i = 0; i < opts.retries; i++) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  if (options && options.forever && !timeouts.length) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  // sort the array numerically ascending\n  timeouts.sort(function(a,b) {\n    return a - b;\n  });\n\n  return timeouts;\n};\n\nexports.createTimeout = function(attempt, opts) {\n  var random = (opts.randomize)\n    ? (Math.random() + 1)\n    : 1;\n\n  var timeout = Math.round(random * opts.minTimeout * Math.pow(opts.factor, attempt));\n  timeout = Math.min(timeout, opts.maxTimeout);\n\n  return timeout;\n};\n\nexports.wrap = function(obj, options, methods) {\n  if (options instanceof Array) {\n    methods = options;\n    options = null;\n  }\n\n  if (!methods) {\n    methods = [];\n    for (var key in obj) {\n      if (typeof obj[key] === 'function') {\n        methods.push(key);\n      }\n    }\n  }\n\n  for (var i = 0; i < methods.length; i++) {\n    var method   = methods[i];\n    var original = obj[method];\n\n    obj[method] = function retryWrapper(original) {\n      var op       = exports.operation(options);\n      var args     = Array.prototype.slice.call(arguments, 1);\n      var callback = args.pop();\n\n      args.push(function(err) {\n        if (op.retry(err)) {\n          return;\n        }\n        if (err) {\n          arguments[0] = op.mainError();\n        }\n        callback.apply(this, arguments);\n      });\n\n      op.attempt(function() {\n        original.apply(obj, args);\n      });\n    }.bind(obj, original);\n    obj[method].options = options;\n  }\n};\n","function RetryOperation(timeouts, options) {\n  // Compatibility for the old (timeouts, retryForever) signature\n  if (typeof options === 'boolean') {\n    options = { forever: options };\n  }\n\n  this._originalTimeouts = JSON.parse(JSON.stringify(timeouts));\n  this._timeouts = timeouts;\n  this._options = options || {};\n  this._maxRetryTime = options && options.maxRetryTime || Infinity;\n  this._fn = null;\n  this._errors = [];\n  this._attempts = 1;\n  this._operationTimeout = null;\n  this._operationTimeoutCb = null;\n  this._timeout = null;\n  this._operationStart = null;\n\n  if (this._options.forever) {\n    this._cachedTimeouts = this._timeouts.slice(0);\n  }\n}\nmodule.exports = RetryOperation;\n\nRetryOperation.prototype.reset = function() {\n  this._attempts = 1;\n  this._timeouts = this._originalTimeouts;\n}\n\nRetryOperation.prototype.stop = function() {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  this._timeouts       = [];\n  this._cachedTimeouts = null;\n};\n\nRetryOperation.prototype.retry = function(err) {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  if (!err) {\n    return false;\n  }\n  var currentTime = new Date().getTime();\n  if (err && currentTime - this._operationStart >= this._maxRetryTime) {\n    this._errors.unshift(new Error('RetryOperation timeout occurred'));\n    return false;\n  }\n\n  this._errors.push(err);\n\n  var timeout = this._timeouts.shift();\n  if (timeout === undefined) {\n    if (this._cachedTimeouts) {\n      // retry forever, only keep last error\n      this._errors.splice(this._errors.length - 1, this._errors.length);\n      this._timeouts = this._cachedTimeouts.slice(0);\n      timeout = this._timeouts.shift();\n    } else {\n      return false;\n    }\n  }\n\n  var self = this;\n  var timer = setTimeout(function() {\n    self._attempts++;\n\n    if (self._operationTimeoutCb) {\n      self._timeout = setTimeout(function() {\n        self._operationTimeoutCb(self._attempts);\n      }, self._operationTimeout);\n\n      if (self._options.unref) {\n          self._timeout.unref();\n      }\n    }\n\n    self._fn(self._attempts);\n  }, timeout);\n\n  if (this._options.unref) {\n      timer.unref();\n  }\n\n  return true;\n};\n\nRetryOperation.prototype.attempt = function(fn, timeoutOps) {\n  this._fn = fn;\n\n  if (timeoutOps) {\n    if (timeoutOps.timeout) {\n      this._operationTimeout = timeoutOps.timeout;\n    }\n    if (timeoutOps.cb) {\n      this._operationTimeoutCb = timeoutOps.cb;\n    }\n  }\n\n  var self = this;\n  if (this._operationTimeoutCb) {\n    this._timeout = setTimeout(function() {\n      self._operationTimeoutCb();\n    }, self._operationTimeout);\n  }\n\n  this._operationStart = new Date().getTime();\n\n  this._fn(this._attempts);\n};\n\nRetryOperation.prototype.try = function(fn) {\n  console.log('Using RetryOperation.try() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = function(fn) {\n  console.log('Using RetryOperation.start() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = RetryOperation.prototype.try;\n\nRetryOperation.prototype.errors = function() {\n  return this._errors;\n};\n\nRetryOperation.prototype.attempts = function() {\n  return this._attempts;\n};\n\nRetryOperation.prototype.mainError = function() {\n  if (this._errors.length === 0) {\n    return null;\n  }\n\n  var counts = {};\n  var mainError = null;\n  var mainErrorCount = 0;\n\n  for (var i = 0; i < this._errors.length; i++) {\n    var error = this._errors[i];\n    var message = error.message;\n    var count = (counts[message] || 0) + 1;\n\n    counts[message] = count;\n\n    if (count >= mainErrorCount) {\n      mainError = error;\n      mainErrorCount = count;\n    }\n  }\n\n  return mainError;\n};\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n  function shim(props, propName, componentName, location, propFullName, secret) {\n    if (secret === ReactPropTypesSecret) {\n      // It is still safe when called from React.\n      return;\n    }\n    var err = new Error(\n      'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n      'Use PropTypes.checkPropTypes() to call them. ' +\n      'Read more at http://fb.me/use-check-prop-types'\n    );\n    err.name = 'Invariant Violation';\n    throw err;\n  };\n  shim.isRequired = shim;\n  function getShim() {\n    return shim;\n  };\n  // Important!\n  // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n  var ReactPropTypes = {\n    array: shim,\n    bigint: shim,\n    bool: shim,\n    func: shim,\n    number: shim,\n    object: shim,\n    string: shim,\n    symbol: shim,\n\n    any: shim,\n    arrayOf: getShim,\n    element: shim,\n    elementType: shim,\n    instanceOf: getShim,\n    node: shim,\n    objectOf: getShim,\n    oneOf: getShim,\n    oneOfType: getShim,\n    shape: getShim,\n    exact: getShim,\n\n    checkPropTypes: emptyFunctionWithReset,\n    resetWarningCache: emptyFunction\n  };\n\n  ReactPropTypes.PropTypes = ReactPropTypes;\n\n  return ReactPropTypes;\n};\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n","if (process.env.NODE_ENV !== 'development') {\n  module.exports = {\n    ReactQueryDevtools: function () {\n      return null\n    },\n    ReactQueryDevtoolsPanel: function () {\n      return null\n    },\n  }\n} else {\n  module.exports = require('./development')\n}\n","import _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { Subscribable } from './subscribable';\nimport { isServer } from './utils';\nexport var FocusManager = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(FocusManager, _Subscribable);\n\n  function FocusManager() {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n\n    _this.setup = function (onFocus) {\n      var _window;\n\n      if (!isServer && ((_window = window) == null ? void 0 : _window.addEventListener)) {\n        var listener = function listener() {\n          return onFocus();\n        }; // Listen to visibillitychange and focus\n\n\n        window.addEventListener('visibilitychange', listener, false);\n        window.addEventListener('focus', listener, false);\n        return function () {\n          // Be sure to unsubscribe if a new handler is set\n          window.removeEventListener('visibilitychange', listener);\n          window.removeEventListener('focus', listener);\n        };\n      }\n    };\n\n    return _this;\n  }\n\n  var _proto = FocusManager.prototype;\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (!this.cleanup) {\n      this.setEventListener(this.setup);\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.hasListeners()) {\n      var _this$cleanup;\n\n      (_this$cleanup = this.cleanup) == null ? void 0 : _this$cleanup.call(this);\n      this.cleanup = undefined;\n    }\n  };\n\n  _proto.setEventListener = function setEventListener(setup) {\n    var _this$cleanup2,\n        _this2 = this;\n\n    this.setup = setup;\n    (_this$cleanup2 = this.cleanup) == null ? void 0 : _this$cleanup2.call(this);\n    this.cleanup = setup(function (focused) {\n      if (typeof focused === 'boolean') {\n        _this2.setFocused(focused);\n      } else {\n        _this2.onFocus();\n      }\n    });\n  };\n\n  _proto.setFocused = function setFocused(focused) {\n    this.focused = focused;\n\n    if (focused) {\n      this.onFocus();\n    }\n  };\n\n  _proto.onFocus = function onFocus() {\n    this.listeners.forEach(function (listener) {\n      listener();\n    });\n  };\n\n  _proto.isFocused = function isFocused() {\n    if (typeof this.focused === 'boolean') {\n      return this.focused;\n    } // document global can be unavailable in react native\n\n\n    if (typeof document === 'undefined') {\n      return true;\n    }\n\n    return [undefined, 'visible', 'prerender'].includes(document.visibilityState);\n  };\n\n  return FocusManager;\n}(Subscribable);\nexport var focusManager = new FocusManager();","export { CancelledError } from './retryer';\nexport { QueryCache } from './queryCache';\nexport { QueryClient } from './queryClient';\nexport { QueryObserver } from './queryObserver';\nexport { QueriesObserver } from './queriesObserver';\nexport { InfiniteQueryObserver } from './infiniteQueryObserver';\nexport { MutationCache } from './mutationCache';\nexport { MutationObserver } from './mutationObserver';\nexport { setLogger } from './logger';\nexport { notifyManager } from './notifyManager';\nexport { focusManager } from './focusManager';\nexport { onlineManager } from './onlineManager';\nexport { hashQueryKey, isError } from './utils';\nexport { isCancelledError } from './retryer';\nexport { dehydrate, hydrate } from './hydration'; // Types\n\nexport * from './types';","// TYPES\n// FUNCTIONS\nvar logger = console;\nexport function getLogger() {\n  return logger;\n}\nexport function setLogger(newLogger) {\n  logger = newLogger;\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport { getLogger } from './logger';\nimport { notifyManager } from './notifyManager';\nimport { Retryer } from './retryer';\nimport { noop } from './utils'; // TYPES\n\n// CLASS\nexport var Mutation = /*#__PURE__*/function () {\n  function Mutation(config) {\n    this.options = _extends({}, config.defaultOptions, config.options);\n    this.mutationId = config.mutationId;\n    this.mutationCache = config.mutationCache;\n    this.observers = [];\n    this.state = config.state || getDefaultState();\n    this.meta = config.meta;\n  }\n\n  var _proto = Mutation.prototype;\n\n  _proto.setState = function setState(state) {\n    this.dispatch({\n      type: 'setState',\n      state: state\n    });\n  };\n\n  _proto.addObserver = function addObserver(observer) {\n    if (this.observers.indexOf(observer) === -1) {\n      this.observers.push(observer);\n    }\n  };\n\n  _proto.removeObserver = function removeObserver(observer) {\n    this.observers = this.observers.filter(function (x) {\n      return x !== observer;\n    });\n  };\n\n  _proto.cancel = function cancel() {\n    if (this.retryer) {\n      this.retryer.cancel();\n      return this.retryer.promise.then(noop).catch(noop);\n    }\n\n    return Promise.resolve();\n  };\n\n  _proto.continue = function _continue() {\n    if (this.retryer) {\n      this.retryer.continue();\n      return this.retryer.promise;\n    }\n\n    return this.execute();\n  };\n\n  _proto.execute = function execute() {\n    var _this = this;\n\n    var data;\n    var restored = this.state.status === 'loading';\n    var promise = Promise.resolve();\n\n    if (!restored) {\n      this.dispatch({\n        type: 'loading',\n        variables: this.options.variables\n      });\n      promise = promise.then(function () {\n        // Notify cache callback\n        _this.mutationCache.config.onMutate == null ? void 0 : _this.mutationCache.config.onMutate(_this.state.variables, _this);\n      }).then(function () {\n        return _this.options.onMutate == null ? void 0 : _this.options.onMutate(_this.state.variables);\n      }).then(function (context) {\n        if (context !== _this.state.context) {\n          _this.dispatch({\n            type: 'loading',\n            context: context,\n            variables: _this.state.variables\n          });\n        }\n      });\n    }\n\n    return promise.then(function () {\n      return _this.executeMutation();\n    }).then(function (result) {\n      data = result; // Notify cache callback\n\n      _this.mutationCache.config.onSuccess == null ? void 0 : _this.mutationCache.config.onSuccess(data, _this.state.variables, _this.state.context, _this);\n    }).then(function () {\n      return _this.options.onSuccess == null ? void 0 : _this.options.onSuccess(data, _this.state.variables, _this.state.context);\n    }).then(function () {\n      return _this.options.onSettled == null ? void 0 : _this.options.onSettled(data, null, _this.state.variables, _this.state.context);\n    }).then(function () {\n      _this.dispatch({\n        type: 'success',\n        data: data\n      });\n\n      return data;\n    }).catch(function (error) {\n      // Notify cache callback\n      _this.mutationCache.config.onError == null ? void 0 : _this.mutationCache.config.onError(error, _this.state.variables, _this.state.context, _this); // Log error\n\n      getLogger().error(error);\n      return Promise.resolve().then(function () {\n        return _this.options.onError == null ? void 0 : _this.options.onError(error, _this.state.variables, _this.state.context);\n      }).then(function () {\n        return _this.options.onSettled == null ? void 0 : _this.options.onSettled(undefined, error, _this.state.variables, _this.state.context);\n      }).then(function () {\n        _this.dispatch({\n          type: 'error',\n          error: error\n        });\n\n        throw error;\n      });\n    });\n  };\n\n  _proto.executeMutation = function executeMutation() {\n    var _this2 = this,\n        _this$options$retry;\n\n    this.retryer = new Retryer({\n      fn: function fn() {\n        if (!_this2.options.mutationFn) {\n          return Promise.reject('No mutationFn found');\n        }\n\n        return _this2.options.mutationFn(_this2.state.variables);\n      },\n      onFail: function onFail() {\n        _this2.dispatch({\n          type: 'failed'\n        });\n      },\n      onPause: function onPause() {\n        _this2.dispatch({\n          type: 'pause'\n        });\n      },\n      onContinue: function onContinue() {\n        _this2.dispatch({\n          type: 'continue'\n        });\n      },\n      retry: (_this$options$retry = this.options.retry) != null ? _this$options$retry : 0,\n      retryDelay: this.options.retryDelay\n    });\n    return this.retryer.promise;\n  };\n\n  _proto.dispatch = function dispatch(action) {\n    var _this3 = this;\n\n    this.state = reducer(this.state, action);\n    notifyManager.batch(function () {\n      _this3.observers.forEach(function (observer) {\n        observer.onMutationUpdate(action);\n      });\n\n      _this3.mutationCache.notify(_this3);\n    });\n  };\n\n  return Mutation;\n}();\nexport function getDefaultState() {\n  return {\n    context: undefined,\n    data: undefined,\n    error: null,\n    failureCount: 0,\n    isPaused: false,\n    status: 'idle',\n    variables: undefined\n  };\n}\n\nfunction reducer(state, action) {\n  switch (action.type) {\n    case 'failed':\n      return _extends({}, state, {\n        failureCount: state.failureCount + 1\n      });\n\n    case 'pause':\n      return _extends({}, state, {\n        isPaused: true\n      });\n\n    case 'continue':\n      return _extends({}, state, {\n        isPaused: false\n      });\n\n    case 'loading':\n      return _extends({}, state, {\n        context: action.context,\n        data: undefined,\n        error: null,\n        isPaused: false,\n        status: 'loading',\n        variables: action.variables\n      });\n\n    case 'success':\n      return _extends({}, state, {\n        data: action.data,\n        error: null,\n        status: 'success',\n        isPaused: false\n      });\n\n    case 'error':\n      return _extends({}, state, {\n        data: undefined,\n        error: action.error,\n        failureCount: state.failureCount + 1,\n        isPaused: false,\n        status: 'error'\n      });\n\n    case 'setState':\n      return _extends({}, state, action.state);\n\n    default:\n      return state;\n  }\n}","import { scheduleMicrotask } from './utils'; // TYPES\n\n// CLASS\nexport var NotifyManager = /*#__PURE__*/function () {\n  function NotifyManager() {\n    this.queue = [];\n    this.transactions = 0;\n\n    this.notifyFn = function (callback) {\n      callback();\n    };\n\n    this.batchNotifyFn = function (callback) {\n      callback();\n    };\n  }\n\n  var _proto = NotifyManager.prototype;\n\n  _proto.batch = function batch(callback) {\n    var result;\n    this.transactions++;\n\n    try {\n      result = callback();\n    } finally {\n      this.transactions--;\n\n      if (!this.transactions) {\n        this.flush();\n      }\n    }\n\n    return result;\n  };\n\n  _proto.schedule = function schedule(callback) {\n    var _this = this;\n\n    if (this.transactions) {\n      this.queue.push(callback);\n    } else {\n      scheduleMicrotask(function () {\n        _this.notifyFn(callback);\n      });\n    }\n  }\n  /**\n   * All calls to the wrapped function will be batched.\n   */\n  ;\n\n  _proto.batchCalls = function batchCalls(callback) {\n    var _this2 = this;\n\n    return function () {\n      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n\n      _this2.schedule(function () {\n        callback.apply(void 0, args);\n      });\n    };\n  };\n\n  _proto.flush = function flush() {\n    var _this3 = this;\n\n    var queue = this.queue;\n    this.queue = [];\n\n    if (queue.length) {\n      scheduleMicrotask(function () {\n        _this3.batchNotifyFn(function () {\n          queue.forEach(function (callback) {\n            _this3.notifyFn(callback);\n          });\n        });\n      });\n    }\n  }\n  /**\n   * Use this method to set a custom notify function.\n   * This can be used to for example wrap notifications with `React.act` while running tests.\n   */\n  ;\n\n  _proto.setNotifyFunction = function setNotifyFunction(fn) {\n    this.notifyFn = fn;\n  }\n  /**\n   * Use this method to set a custom function to batch notifications together into a single tick.\n   * By default React Query will use the batch function provided by ReactDOM or React Native.\n   */\n  ;\n\n  _proto.setBatchNotifyFunction = function setBatchNotifyFunction(fn) {\n    this.batchNotifyFn = fn;\n  };\n\n  return NotifyManager;\n}(); // SINGLETON\n\nexport var notifyManager = new NotifyManager();","import _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { Subscribable } from './subscribable';\nimport { isServer } from './utils';\nexport var OnlineManager = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(OnlineManager, _Subscribable);\n\n  function OnlineManager() {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n\n    _this.setup = function (onOnline) {\n      var _window;\n\n      if (!isServer && ((_window = window) == null ? void 0 : _window.addEventListener)) {\n        var listener = function listener() {\n          return onOnline();\n        }; // Listen to online\n\n\n        window.addEventListener('online', listener, false);\n        window.addEventListener('offline', listener, false);\n        return function () {\n          // Be sure to unsubscribe if a new handler is set\n          window.removeEventListener('online', listener);\n          window.removeEventListener('offline', listener);\n        };\n      }\n    };\n\n    return _this;\n  }\n\n  var _proto = OnlineManager.prototype;\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (!this.cleanup) {\n      this.setEventListener(this.setup);\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.hasListeners()) {\n      var _this$cleanup;\n\n      (_this$cleanup = this.cleanup) == null ? void 0 : _this$cleanup.call(this);\n      this.cleanup = undefined;\n    }\n  };\n\n  _proto.setEventListener = function setEventListener(setup) {\n    var _this$cleanup2,\n        _this2 = this;\n\n    this.setup = setup;\n    (_this$cleanup2 = this.cleanup) == null ? void 0 : _this$cleanup2.call(this);\n    this.cleanup = setup(function (online) {\n      if (typeof online === 'boolean') {\n        _this2.setOnline(online);\n      } else {\n        _this2.onOnline();\n      }\n    });\n  };\n\n  _proto.setOnline = function setOnline(online) {\n    this.online = online;\n\n    if (online) {\n      this.onOnline();\n    }\n  };\n\n  _proto.onOnline = function onOnline() {\n    this.listeners.forEach(function (listener) {\n      listener();\n    });\n  };\n\n  _proto.isOnline = function isOnline() {\n    if (typeof this.online === 'boolean') {\n      return this.online;\n    }\n\n    if (typeof navigator === 'undefined' || typeof navigator.onLine === 'undefined') {\n      return true;\n    }\n\n    return navigator.onLine;\n  };\n\n  return OnlineManager;\n}(Subscribable);\nexport var onlineManager = new OnlineManager();","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport { getAbortController, functionalUpdate, isValidTimeout, noop, replaceEqualDeep, timeUntilStale, ensureQueryKeyArray } from './utils';\nimport { notifyManager } from './notifyManager';\nimport { getLogger } from './logger';\nimport { Retryer, isCancelledError } from './retryer'; // TYPES\n\n// CLASS\nexport var Query = /*#__PURE__*/function () {\n  function Query(config) {\n    this.abortSignalConsumed = false;\n    this.hadObservers = false;\n    this.defaultOptions = config.defaultOptions;\n    this.setOptions(config.options);\n    this.observers = [];\n    this.cache = config.cache;\n    this.queryKey = config.queryKey;\n    this.queryHash = config.queryHash;\n    this.initialState = config.state || this.getDefaultState(this.options);\n    this.state = this.initialState;\n    this.meta = config.meta;\n    this.scheduleGc();\n  }\n\n  var _proto = Query.prototype;\n\n  _proto.setOptions = function setOptions(options) {\n    var _this$options$cacheTi;\n\n    this.options = _extends({}, this.defaultOptions, options);\n    this.meta = options == null ? void 0 : options.meta; // Default to 5 minutes if not cache time is set\n\n    this.cacheTime = Math.max(this.cacheTime || 0, (_this$options$cacheTi = this.options.cacheTime) != null ? _this$options$cacheTi : 5 * 60 * 1000);\n  };\n\n  _proto.setDefaultOptions = function setDefaultOptions(options) {\n    this.defaultOptions = options;\n  };\n\n  _proto.scheduleGc = function scheduleGc() {\n    var _this = this;\n\n    this.clearGcTimeout();\n\n    if (isValidTimeout(this.cacheTime)) {\n      this.gcTimeout = setTimeout(function () {\n        _this.optionalRemove();\n      }, this.cacheTime);\n    }\n  };\n\n  _proto.clearGcTimeout = function clearGcTimeout() {\n    if (this.gcTimeout) {\n      clearTimeout(this.gcTimeout);\n      this.gcTimeout = undefined;\n    }\n  };\n\n  _proto.optionalRemove = function optionalRemove() {\n    if (!this.observers.length) {\n      if (this.state.isFetching) {\n        if (this.hadObservers) {\n          this.scheduleGc();\n        }\n      } else {\n        this.cache.remove(this);\n      }\n    }\n  };\n\n  _proto.setData = function setData(updater, options) {\n    var _this$options$isDataE, _this$options;\n\n    var prevData = this.state.data; // Get the new data\n\n    var data = functionalUpdate(updater, prevData); // Use prev data if an isDataEqual function is defined and returns `true`\n\n    if ((_this$options$isDataE = (_this$options = this.options).isDataEqual) == null ? void 0 : _this$options$isDataE.call(_this$options, prevData, data)) {\n      data = prevData;\n    } else if (this.options.structuralSharing !== false) {\n      // Structurally share data between prev and new data if needed\n      data = replaceEqualDeep(prevData, data);\n    } // Set data and mark it as cached\n\n\n    this.dispatch({\n      data: data,\n      type: 'success',\n      dataUpdatedAt: options == null ? void 0 : options.updatedAt\n    });\n    return data;\n  };\n\n  _proto.setState = function setState(state, setStateOptions) {\n    this.dispatch({\n      type: 'setState',\n      state: state,\n      setStateOptions: setStateOptions\n    });\n  };\n\n  _proto.cancel = function cancel(options) {\n    var _this$retryer;\n\n    var promise = this.promise;\n    (_this$retryer = this.retryer) == null ? void 0 : _this$retryer.cancel(options);\n    return promise ? promise.then(noop).catch(noop) : Promise.resolve();\n  };\n\n  _proto.destroy = function destroy() {\n    this.clearGcTimeout();\n    this.cancel({\n      silent: true\n    });\n  };\n\n  _proto.reset = function reset() {\n    this.destroy();\n    this.setState(this.initialState);\n  };\n\n  _proto.isActive = function isActive() {\n    return this.observers.some(function (observer) {\n      return observer.options.enabled !== false;\n    });\n  };\n\n  _proto.isFetching = function isFetching() {\n    return this.state.isFetching;\n  };\n\n  _proto.isStale = function isStale() {\n    return this.state.isInvalidated || !this.state.dataUpdatedAt || this.observers.some(function (observer) {\n      return observer.getCurrentResult().isStale;\n    });\n  };\n\n  _proto.isStaleByTime = function isStaleByTime(staleTime) {\n    if (staleTime === void 0) {\n      staleTime = 0;\n    }\n\n    return this.state.isInvalidated || !this.state.dataUpdatedAt || !timeUntilStale(this.state.dataUpdatedAt, staleTime);\n  };\n\n  _proto.onFocus = function onFocus() {\n    var _this$retryer2;\n\n    var observer = this.observers.find(function (x) {\n      return x.shouldFetchOnWindowFocus();\n    });\n\n    if (observer) {\n      observer.refetch();\n    } // Continue fetch if currently paused\n\n\n    (_this$retryer2 = this.retryer) == null ? void 0 : _this$retryer2.continue();\n  };\n\n  _proto.onOnline = function onOnline() {\n    var _this$retryer3;\n\n    var observer = this.observers.find(function (x) {\n      return x.shouldFetchOnReconnect();\n    });\n\n    if (observer) {\n      observer.refetch();\n    } // Continue fetch if currently paused\n\n\n    (_this$retryer3 = this.retryer) == null ? void 0 : _this$retryer3.continue();\n  };\n\n  _proto.addObserver = function addObserver(observer) {\n    if (this.observers.indexOf(observer) === -1) {\n      this.observers.push(observer);\n      this.hadObservers = true; // Stop the query from being garbage collected\n\n      this.clearGcTimeout();\n      this.cache.notify({\n        type: 'observerAdded',\n        query: this,\n        observer: observer\n      });\n    }\n  };\n\n  _proto.removeObserver = function removeObserver(observer) {\n    if (this.observers.indexOf(observer) !== -1) {\n      this.observers = this.observers.filter(function (x) {\n        return x !== observer;\n      });\n\n      if (!this.observers.length) {\n        // If the transport layer does not support cancellation\n        // we'll let the query continue so the result can be cached\n        if (this.retryer) {\n          if (this.retryer.isTransportCancelable || this.abortSignalConsumed) {\n            this.retryer.cancel({\n              revert: true\n            });\n          } else {\n            this.retryer.cancelRetry();\n          }\n        }\n\n        if (this.cacheTime) {\n          this.scheduleGc();\n        } else {\n          this.cache.remove(this);\n        }\n      }\n\n      this.cache.notify({\n        type: 'observerRemoved',\n        query: this,\n        observer: observer\n      });\n    }\n  };\n\n  _proto.getObserversCount = function getObserversCount() {\n    return this.observers.length;\n  };\n\n  _proto.invalidate = function invalidate() {\n    if (!this.state.isInvalidated) {\n      this.dispatch({\n        type: 'invalidate'\n      });\n    }\n  };\n\n  _proto.fetch = function fetch(options, fetchOptions) {\n    var _this2 = this,\n        _this$options$behavio,\n        _context$fetchOptions,\n        _abortController$abor;\n\n    if (this.state.isFetching) {\n      if (this.state.dataUpdatedAt && (fetchOptions == null ? void 0 : fetchOptions.cancelRefetch)) {\n        // Silently cancel current fetch if the user wants to cancel refetches\n        this.cancel({\n          silent: true\n        });\n      } else if (this.promise) {\n        var _this$retryer4;\n\n        // make sure that retries that were potentially cancelled due to unmounts can continue\n        (_this$retryer4 = this.retryer) == null ? void 0 : _this$retryer4.continueRetry(); // Return current promise if we are already fetching\n\n        return this.promise;\n      }\n    } // Update config if passed, otherwise the config from the last execution is used\n\n\n    if (options) {\n      this.setOptions(options);\n    } // Use the options from the first observer with a query function if no function is found.\n    // This can happen when the query is hydrated or created with setQueryData.\n\n\n    if (!this.options.queryFn) {\n      var observer = this.observers.find(function (x) {\n        return x.options.queryFn;\n      });\n\n      if (observer) {\n        this.setOptions(observer.options);\n      }\n    }\n\n    var queryKey = ensureQueryKeyArray(this.queryKey);\n    var abortController = getAbortController(); // Create query function context\n\n    var queryFnContext = {\n      queryKey: queryKey,\n      pageParam: undefined,\n      meta: this.meta\n    };\n    Object.defineProperty(queryFnContext, 'signal', {\n      enumerable: true,\n      get: function get() {\n        if (abortController) {\n          _this2.abortSignalConsumed = true;\n          return abortController.signal;\n        }\n\n        return undefined;\n      }\n    }); // Create fetch function\n\n    var fetchFn = function fetchFn() {\n      if (!_this2.options.queryFn) {\n        return Promise.reject('Missing queryFn');\n      }\n\n      _this2.abortSignalConsumed = false;\n      return _this2.options.queryFn(queryFnContext);\n    }; // Trigger behavior hook\n\n\n    var context = {\n      fetchOptions: fetchOptions,\n      options: this.options,\n      queryKey: queryKey,\n      state: this.state,\n      fetchFn: fetchFn,\n      meta: this.meta\n    };\n\n    if ((_this$options$behavio = this.options.behavior) == null ? void 0 : _this$options$behavio.onFetch) {\n      var _this$options$behavio2;\n\n      (_this$options$behavio2 = this.options.behavior) == null ? void 0 : _this$options$behavio2.onFetch(context);\n    } // Store state in case the current fetch needs to be reverted\n\n\n    this.revertState = this.state; // Set to fetching state if not already in it\n\n    if (!this.state.isFetching || this.state.fetchMeta !== ((_context$fetchOptions = context.fetchOptions) == null ? void 0 : _context$fetchOptions.meta)) {\n      var _context$fetchOptions2;\n\n      this.dispatch({\n        type: 'fetch',\n        meta: (_context$fetchOptions2 = context.fetchOptions) == null ? void 0 : _context$fetchOptions2.meta\n      });\n    } // Try to fetch the data\n\n\n    this.retryer = new Retryer({\n      fn: context.fetchFn,\n      abort: abortController == null ? void 0 : (_abortController$abor = abortController.abort) == null ? void 0 : _abortController$abor.bind(abortController),\n      onSuccess: function onSuccess(data) {\n        _this2.setData(data); // Notify cache callback\n\n\n        _this2.cache.config.onSuccess == null ? void 0 : _this2.cache.config.onSuccess(data, _this2); // Remove query after fetching if cache time is 0\n\n        if (_this2.cacheTime === 0) {\n          _this2.optionalRemove();\n        }\n      },\n      onError: function onError(error) {\n        // Optimistically update state if needed\n        if (!(isCancelledError(error) && error.silent)) {\n          _this2.dispatch({\n            type: 'error',\n            error: error\n          });\n        }\n\n        if (!isCancelledError(error)) {\n          // Notify cache callback\n          _this2.cache.config.onError == null ? void 0 : _this2.cache.config.onError(error, _this2); // Log error\n\n          getLogger().error(error);\n        } // Remove query after fetching if cache time is 0\n\n\n        if (_this2.cacheTime === 0) {\n          _this2.optionalRemove();\n        }\n      },\n      onFail: function onFail() {\n        _this2.dispatch({\n          type: 'failed'\n        });\n      },\n      onPause: function onPause() {\n        _this2.dispatch({\n          type: 'pause'\n        });\n      },\n      onContinue: function onContinue() {\n        _this2.dispatch({\n          type: 'continue'\n        });\n      },\n      retry: context.options.retry,\n      retryDelay: context.options.retryDelay\n    });\n    this.promise = this.retryer.promise;\n    return this.promise;\n  };\n\n  _proto.dispatch = function dispatch(action) {\n    var _this3 = this;\n\n    this.state = this.reducer(this.state, action);\n    notifyManager.batch(function () {\n      _this3.observers.forEach(function (observer) {\n        observer.onQueryUpdate(action);\n      });\n\n      _this3.cache.notify({\n        query: _this3,\n        type: 'queryUpdated',\n        action: action\n      });\n    });\n  };\n\n  _proto.getDefaultState = function getDefaultState(options) {\n    var data = typeof options.initialData === 'function' ? options.initialData() : options.initialData;\n    var hasInitialData = typeof options.initialData !== 'undefined';\n    var initialDataUpdatedAt = hasInitialData ? typeof options.initialDataUpdatedAt === 'function' ? options.initialDataUpdatedAt() : options.initialDataUpdatedAt : 0;\n    var hasData = typeof data !== 'undefined';\n    return {\n      data: data,\n      dataUpdateCount: 0,\n      dataUpdatedAt: hasData ? initialDataUpdatedAt != null ? initialDataUpdatedAt : Date.now() : 0,\n      error: null,\n      errorUpdateCount: 0,\n      errorUpdatedAt: 0,\n      fetchFailureCount: 0,\n      fetchMeta: null,\n      isFetching: false,\n      isInvalidated: false,\n      isPaused: false,\n      status: hasData ? 'success' : 'idle'\n    };\n  };\n\n  _proto.reducer = function reducer(state, action) {\n    var _action$meta, _action$dataUpdatedAt;\n\n    switch (action.type) {\n      case 'failed':\n        return _extends({}, state, {\n          fetchFailureCount: state.fetchFailureCount + 1\n        });\n\n      case 'pause':\n        return _extends({}, state, {\n          isPaused: true\n        });\n\n      case 'continue':\n        return _extends({}, state, {\n          isPaused: false\n        });\n\n      case 'fetch':\n        return _extends({}, state, {\n          fetchFailureCount: 0,\n          fetchMeta: (_action$meta = action.meta) != null ? _action$meta : null,\n          isFetching: true,\n          isPaused: false\n        }, !state.dataUpdatedAt && {\n          error: null,\n          status: 'loading'\n        });\n\n      case 'success':\n        return _extends({}, state, {\n          data: action.data,\n          dataUpdateCount: state.dataUpdateCount + 1,\n          dataUpdatedAt: (_action$dataUpdatedAt = action.dataUpdatedAt) != null ? _action$dataUpdatedAt : Date.now(),\n          error: null,\n          fetchFailureCount: 0,\n          isFetching: false,\n          isInvalidated: false,\n          isPaused: false,\n          status: 'success'\n        });\n\n      case 'error':\n        var error = action.error;\n\n        if (isCancelledError(error) && error.revert && this.revertState) {\n          return _extends({}, this.revertState);\n        }\n\n        return _extends({}, state, {\n          error: error,\n          errorUpdateCount: state.errorUpdateCount + 1,\n          errorUpdatedAt: Date.now(),\n          fetchFailureCount: state.fetchFailureCount + 1,\n          isFetching: false,\n          isPaused: false,\n          status: 'error'\n        });\n\n      case 'invalidate':\n        return _extends({}, state, {\n          isInvalidated: true\n        });\n\n      case 'setState':\n        return _extends({}, state, action.state);\n\n      default:\n        return state;\n    }\n  };\n\n  return Query;\n}();","import _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { hashQueryKeyByOptions, matchQuery, parseFilterArgs } from './utils';\nimport { Query } from './query';\nimport { notifyManager } from './notifyManager';\nimport { Subscribable } from './subscribable';\n// CLASS\nexport var QueryCache = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(QueryCache, _Subscribable);\n\n  function QueryCache(config) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.config = config || {};\n    _this.queries = [];\n    _this.queriesMap = {};\n    return _this;\n  }\n\n  var _proto = QueryCache.prototype;\n\n  _proto.build = function build(client, options, state) {\n    var _options$queryHash;\n\n    var queryKey = options.queryKey;\n    var queryHash = (_options$queryHash = options.queryHash) != null ? _options$queryHash : hashQueryKeyByOptions(queryKey, options);\n    var query = this.get(queryHash);\n\n    if (!query) {\n      query = new Query({\n        cache: this,\n        queryKey: queryKey,\n        queryHash: queryHash,\n        options: client.defaultQueryOptions(options),\n        state: state,\n        defaultOptions: client.getQueryDefaults(queryKey),\n        meta: options.meta\n      });\n      this.add(query);\n    }\n\n    return query;\n  };\n\n  _proto.add = function add(query) {\n    if (!this.queriesMap[query.queryHash]) {\n      this.queriesMap[query.queryHash] = query;\n      this.queries.push(query);\n      this.notify({\n        type: 'queryAdded',\n        query: query\n      });\n    }\n  };\n\n  _proto.remove = function remove(query) {\n    var queryInMap = this.queriesMap[query.queryHash];\n\n    if (queryInMap) {\n      query.destroy();\n      this.queries = this.queries.filter(function (x) {\n        return x !== query;\n      });\n\n      if (queryInMap === query) {\n        delete this.queriesMap[query.queryHash];\n      }\n\n      this.notify({\n        type: 'queryRemoved',\n        query: query\n      });\n    }\n  };\n\n  _proto.clear = function clear() {\n    var _this2 = this;\n\n    notifyManager.batch(function () {\n      _this2.queries.forEach(function (query) {\n        _this2.remove(query);\n      });\n    });\n  };\n\n  _proto.get = function get(queryHash) {\n    return this.queriesMap[queryHash];\n  };\n\n  _proto.getAll = function getAll() {\n    return this.queries;\n  };\n\n  _proto.find = function find(arg1, arg2) {\n    var _parseFilterArgs = parseFilterArgs(arg1, arg2),\n        filters = _parseFilterArgs[0];\n\n    if (typeof filters.exact === 'undefined') {\n      filters.exact = true;\n    }\n\n    return this.queries.find(function (query) {\n      return matchQuery(filters, query);\n    });\n  };\n\n  _proto.findAll = function findAll(arg1, arg2) {\n    var _parseFilterArgs2 = parseFilterArgs(arg1, arg2),\n        filters = _parseFilterArgs2[0];\n\n    return Object.keys(filters).length > 0 ? this.queries.filter(function (query) {\n      return matchQuery(filters, query);\n    }) : this.queries;\n  };\n\n  _proto.notify = function notify(event) {\n    var _this3 = this;\n\n    notifyManager.batch(function () {\n      _this3.listeners.forEach(function (listener) {\n        listener(event);\n      });\n    });\n  };\n\n  _proto.onFocus = function onFocus() {\n    var _this4 = this;\n\n    notifyManager.batch(function () {\n      _this4.queries.forEach(function (query) {\n        query.onFocus();\n      });\n    });\n  };\n\n  _proto.onOnline = function onOnline() {\n    var _this5 = this;\n\n    notifyManager.batch(function () {\n      _this5.queries.forEach(function (query) {\n        query.onOnline();\n      });\n    });\n  };\n\n  return QueryCache;\n}(Subscribable);","import _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { notifyManager } from './notifyManager';\nimport { Mutation } from './mutation';\nimport { matchMutation, noop } from './utils';\nimport { Subscribable } from './subscribable'; // TYPES\n\n// CLASS\nexport var MutationCache = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(MutationCache, _Subscribable);\n\n  function MutationCache(config) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.config = config || {};\n    _this.mutations = [];\n    _this.mutationId = 0;\n    return _this;\n  }\n\n  var _proto = MutationCache.prototype;\n\n  _proto.build = function build(client, options, state) {\n    var mutation = new Mutation({\n      mutationCache: this,\n      mutationId: ++this.mutationId,\n      options: client.defaultMutationOptions(options),\n      state: state,\n      defaultOptions: options.mutationKey ? client.getMutationDefaults(options.mutationKey) : undefined,\n      meta: options.meta\n    });\n    this.add(mutation);\n    return mutation;\n  };\n\n  _proto.add = function add(mutation) {\n    this.mutations.push(mutation);\n    this.notify(mutation);\n  };\n\n  _proto.remove = function remove(mutation) {\n    this.mutations = this.mutations.filter(function (x) {\n      return x !== mutation;\n    });\n    mutation.cancel();\n    this.notify(mutation);\n  };\n\n  _proto.clear = function clear() {\n    var _this2 = this;\n\n    notifyManager.batch(function () {\n      _this2.mutations.forEach(function (mutation) {\n        _this2.remove(mutation);\n      });\n    });\n  };\n\n  _proto.getAll = function getAll() {\n    return this.mutations;\n  };\n\n  _proto.find = function find(filters) {\n    if (typeof filters.exact === 'undefined') {\n      filters.exact = true;\n    }\n\n    return this.mutations.find(function (mutation) {\n      return matchMutation(filters, mutation);\n    });\n  };\n\n  _proto.findAll = function findAll(filters) {\n    return this.mutations.filter(function (mutation) {\n      return matchMutation(filters, mutation);\n    });\n  };\n\n  _proto.notify = function notify(mutation) {\n    var _this3 = this;\n\n    notifyManager.batch(function () {\n      _this3.listeners.forEach(function (listener) {\n        listener(mutation);\n      });\n    });\n  };\n\n  _proto.onFocus = function onFocus() {\n    this.resumePausedMutations();\n  };\n\n  _proto.onOnline = function onOnline() {\n    this.resumePausedMutations();\n  };\n\n  _proto.resumePausedMutations = function resumePausedMutations() {\n    var pausedMutations = this.mutations.filter(function (x) {\n      return x.state.isPaused;\n    });\n    return notifyManager.batch(function () {\n      return pausedMutations.reduce(function (promise, mutation) {\n        return promise.then(function () {\n          return mutation.continue().catch(noop);\n        });\n      }, Promise.resolve());\n    });\n  };\n\n  return MutationCache;\n}(Subscribable);","import { isCancelable } from './retryer';\nimport { getAbortController } from './utils';\nexport function infiniteQueryBehavior() {\n  return {\n    onFetch: function onFetch(context) {\n      context.fetchFn = function () {\n        var _context$fetchOptions, _context$fetchOptions2, _context$fetchOptions3, _context$fetchOptions4, _context$state$data, _context$state$data2;\n\n        var refetchPage = (_context$fetchOptions = context.fetchOptions) == null ? void 0 : (_context$fetchOptions2 = _context$fetchOptions.meta) == null ? void 0 : _context$fetchOptions2.refetchPage;\n        var fetchMore = (_context$fetchOptions3 = context.fetchOptions) == null ? void 0 : (_context$fetchOptions4 = _context$fetchOptions3.meta) == null ? void 0 : _context$fetchOptions4.fetchMore;\n        var pageParam = fetchMore == null ? void 0 : fetchMore.pageParam;\n        var isFetchingNextPage = (fetchMore == null ? void 0 : fetchMore.direction) === 'forward';\n        var isFetchingPreviousPage = (fetchMore == null ? void 0 : fetchMore.direction) === 'backward';\n        var oldPages = ((_context$state$data = context.state.data) == null ? void 0 : _context$state$data.pages) || [];\n        var oldPageParams = ((_context$state$data2 = context.state.data) == null ? void 0 : _context$state$data2.pageParams) || [];\n        var abortController = getAbortController();\n        var abortSignal = abortController == null ? void 0 : abortController.signal;\n        var newPageParams = oldPageParams;\n        var cancelled = false; // Get query function\n\n        var queryFn = context.options.queryFn || function () {\n          return Promise.reject('Missing queryFn');\n        };\n\n        var buildNewPages = function buildNewPages(pages, param, page, previous) {\n          newPageParams = previous ? [param].concat(newPageParams) : [].concat(newPageParams, [param]);\n          return previous ? [page].concat(pages) : [].concat(pages, [page]);\n        }; // Create function to fetch a page\n\n\n        var fetchPage = function fetchPage(pages, manual, param, previous) {\n          if (cancelled) {\n            return Promise.reject('Cancelled');\n          }\n\n          if (typeof param === 'undefined' && !manual && pages.length) {\n            return Promise.resolve(pages);\n          }\n\n          var queryFnContext = {\n            queryKey: context.queryKey,\n            signal: abortSignal,\n            pageParam: param,\n            meta: context.meta\n          };\n          var queryFnResult = queryFn(queryFnContext);\n          var promise = Promise.resolve(queryFnResult).then(function (page) {\n            return buildNewPages(pages, param, page, previous);\n          });\n\n          if (isCancelable(queryFnResult)) {\n            var promiseAsAny = promise;\n            promiseAsAny.cancel = queryFnResult.cancel;\n          }\n\n          return promise;\n        };\n\n        var promise; // Fetch first page?\n\n        if (!oldPages.length) {\n          promise = fetchPage([]);\n        } // Fetch next page?\n        else if (isFetchingNextPage) {\n            var manual = typeof pageParam !== 'undefined';\n            var param = manual ? pageParam : getNextPageParam(context.options, oldPages);\n            promise = fetchPage(oldPages, manual, param);\n          } // Fetch previous page?\n          else if (isFetchingPreviousPage) {\n              var _manual = typeof pageParam !== 'undefined';\n\n              var _param = _manual ? pageParam : getPreviousPageParam(context.options, oldPages);\n\n              promise = fetchPage(oldPages, _manual, _param, true);\n            } // Refetch pages\n            else {\n                (function () {\n                  newPageParams = [];\n                  var manual = typeof context.options.getNextPageParam === 'undefined';\n                  var shouldFetchFirstPage = refetchPage && oldPages[0] ? refetchPage(oldPages[0], 0, oldPages) : true; // Fetch first page\n\n                  promise = shouldFetchFirstPage ? fetchPage([], manual, oldPageParams[0]) : Promise.resolve(buildNewPages([], oldPageParams[0], oldPages[0])); // Fetch remaining pages\n\n                  var _loop = function _loop(i) {\n                    promise = promise.then(function (pages) {\n                      var shouldFetchNextPage = refetchPage && oldPages[i] ? refetchPage(oldPages[i], i, oldPages) : true;\n\n                      if (shouldFetchNextPage) {\n                        var _param2 = manual ? oldPageParams[i] : getNextPageParam(context.options, pages);\n\n                        return fetchPage(pages, manual, _param2);\n                      }\n\n                      return Promise.resolve(buildNewPages(pages, oldPageParams[i], oldPages[i]));\n                    });\n                  };\n\n                  for (var i = 1; i < oldPages.length; i++) {\n                    _loop(i);\n                  }\n                })();\n              }\n\n        var finalPromise = promise.then(function (pages) {\n          return {\n            pages: pages,\n            pageParams: newPageParams\n          };\n        });\n        var finalPromiseAsAny = finalPromise;\n\n        finalPromiseAsAny.cancel = function () {\n          cancelled = true;\n          abortController == null ? void 0 : abortController.abort();\n\n          if (isCancelable(promise)) {\n            promise.cancel();\n          }\n        };\n\n        return finalPromise;\n      };\n    }\n  };\n}\nexport function getNextPageParam(options, pages) {\n  return options.getNextPageParam == null ? void 0 : options.getNextPageParam(pages[pages.length - 1], pages);\n}\nexport function getPreviousPageParam(options, pages) {\n  return options.getPreviousPageParam == null ? void 0 : options.getPreviousPageParam(pages[0], pages);\n}\n/**\n * Checks if there is a next page.\n * Returns `undefined` if it cannot be determined.\n */\n\nexport function hasNextPage(options, pages) {\n  if (options.getNextPageParam && Array.isArray(pages)) {\n    var nextPageParam = getNextPageParam(options, pages);\n    return typeof nextPageParam !== 'undefined' && nextPageParam !== null && nextPageParam !== false;\n  }\n}\n/**\n * Checks if there is a previous page.\n * Returns `undefined` if it cannot be determined.\n */\n\nexport function hasPreviousPage(options, pages) {\n  if (options.getPreviousPageParam && Array.isArray(pages)) {\n    var previousPageParam = getPreviousPageParam(options, pages);\n    return typeof previousPageParam !== 'undefined' && previousPageParam !== null && previousPageParam !== false;\n  }\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport { hashQueryKey, noop, parseFilterArgs, parseQueryArgs, partialMatchKey, hashQueryKeyByOptions } from './utils';\nimport { QueryCache } from './queryCache';\nimport { MutationCache } from './mutationCache';\nimport { focusManager } from './focusManager';\nimport { onlineManager } from './onlineManager';\nimport { notifyManager } from './notifyManager';\nimport { infiniteQueryBehavior } from './infiniteQueryBehavior';\n// CLASS\nexport var QueryClient = /*#__PURE__*/function () {\n  function QueryClient(config) {\n    if (config === void 0) {\n      config = {};\n    }\n\n    this.queryCache = config.queryCache || new QueryCache();\n    this.mutationCache = config.mutationCache || new MutationCache();\n    this.defaultOptions = config.defaultOptions || {};\n    this.queryDefaults = [];\n    this.mutationDefaults = [];\n  }\n\n  var _proto = QueryClient.prototype;\n\n  _proto.mount = function mount() {\n    var _this = this;\n\n    this.unsubscribeFocus = focusManager.subscribe(function () {\n      if (focusManager.isFocused() && onlineManager.isOnline()) {\n        _this.mutationCache.onFocus();\n\n        _this.queryCache.onFocus();\n      }\n    });\n    this.unsubscribeOnline = onlineManager.subscribe(function () {\n      if (focusManager.isFocused() && onlineManager.isOnline()) {\n        _this.mutationCache.onOnline();\n\n        _this.queryCache.onOnline();\n      }\n    });\n  };\n\n  _proto.unmount = function unmount() {\n    var _this$unsubscribeFocu, _this$unsubscribeOnli;\n\n    (_this$unsubscribeFocu = this.unsubscribeFocus) == null ? void 0 : _this$unsubscribeFocu.call(this);\n    (_this$unsubscribeOnli = this.unsubscribeOnline) == null ? void 0 : _this$unsubscribeOnli.call(this);\n  };\n\n  _proto.isFetching = function isFetching(arg1, arg2) {\n    var _parseFilterArgs = parseFilterArgs(arg1, arg2),\n        filters = _parseFilterArgs[0];\n\n    filters.fetching = true;\n    return this.queryCache.findAll(filters).length;\n  };\n\n  _proto.isMutating = function isMutating(filters) {\n    return this.mutationCache.findAll(_extends({}, filters, {\n      fetching: true\n    })).length;\n  };\n\n  _proto.getQueryData = function getQueryData(queryKey, filters) {\n    var _this$queryCache$find;\n\n    return (_this$queryCache$find = this.queryCache.find(queryKey, filters)) == null ? void 0 : _this$queryCache$find.state.data;\n  };\n\n  _proto.getQueriesData = function getQueriesData(queryKeyOrFilters) {\n    return this.getQueryCache().findAll(queryKeyOrFilters).map(function (_ref) {\n      var queryKey = _ref.queryKey,\n          state = _ref.state;\n      var data = state.data;\n      return [queryKey, data];\n    });\n  };\n\n  _proto.setQueryData = function setQueryData(queryKey, updater, options) {\n    var parsedOptions = parseQueryArgs(queryKey);\n    var defaultedOptions = this.defaultQueryOptions(parsedOptions);\n    return this.queryCache.build(this, defaultedOptions).setData(updater, options);\n  };\n\n  _proto.setQueriesData = function setQueriesData(queryKeyOrFilters, updater, options) {\n    var _this2 = this;\n\n    return notifyManager.batch(function () {\n      return _this2.getQueryCache().findAll(queryKeyOrFilters).map(function (_ref2) {\n        var queryKey = _ref2.queryKey;\n        return [queryKey, _this2.setQueryData(queryKey, updater, options)];\n      });\n    });\n  };\n\n  _proto.getQueryState = function getQueryState(queryKey, filters) {\n    var _this$queryCache$find2;\n\n    return (_this$queryCache$find2 = this.queryCache.find(queryKey, filters)) == null ? void 0 : _this$queryCache$find2.state;\n  };\n\n  _proto.removeQueries = function removeQueries(arg1, arg2) {\n    var _parseFilterArgs2 = parseFilterArgs(arg1, arg2),\n        filters = _parseFilterArgs2[0];\n\n    var queryCache = this.queryCache;\n    notifyManager.batch(function () {\n      queryCache.findAll(filters).forEach(function (query) {\n        queryCache.remove(query);\n      });\n    });\n  };\n\n  _proto.resetQueries = function resetQueries(arg1, arg2, arg3) {\n    var _this3 = this;\n\n    var _parseFilterArgs3 = parseFilterArgs(arg1, arg2, arg3),\n        filters = _parseFilterArgs3[0],\n        options = _parseFilterArgs3[1];\n\n    var queryCache = this.queryCache;\n\n    var refetchFilters = _extends({}, filters, {\n      active: true\n    });\n\n    return notifyManager.batch(function () {\n      queryCache.findAll(filters).forEach(function (query) {\n        query.reset();\n      });\n      return _this3.refetchQueries(refetchFilters, options);\n    });\n  };\n\n  _proto.cancelQueries = function cancelQueries(arg1, arg2, arg3) {\n    var _this4 = this;\n\n    var _parseFilterArgs4 = parseFilterArgs(arg1, arg2, arg3),\n        filters = _parseFilterArgs4[0],\n        _parseFilterArgs4$ = _parseFilterArgs4[1],\n        cancelOptions = _parseFilterArgs4$ === void 0 ? {} : _parseFilterArgs4$;\n\n    if (typeof cancelOptions.revert === 'undefined') {\n      cancelOptions.revert = true;\n    }\n\n    var promises = notifyManager.batch(function () {\n      return _this4.queryCache.findAll(filters).map(function (query) {\n        return query.cancel(cancelOptions);\n      });\n    });\n    return Promise.all(promises).then(noop).catch(noop);\n  };\n\n  _proto.invalidateQueries = function invalidateQueries(arg1, arg2, arg3) {\n    var _ref3,\n        _filters$refetchActiv,\n        _filters$refetchInact,\n        _this5 = this;\n\n    var _parseFilterArgs5 = parseFilterArgs(arg1, arg2, arg3),\n        filters = _parseFilterArgs5[0],\n        options = _parseFilterArgs5[1];\n\n    var refetchFilters = _extends({}, filters, {\n      // if filters.refetchActive is not provided and filters.active is explicitly false,\n      // e.g. invalidateQueries({ active: false }), we don't want to refetch active queries\n      active: (_ref3 = (_filters$refetchActiv = filters.refetchActive) != null ? _filters$refetchActiv : filters.active) != null ? _ref3 : true,\n      inactive: (_filters$refetchInact = filters.refetchInactive) != null ? _filters$refetchInact : false\n    });\n\n    return notifyManager.batch(function () {\n      _this5.queryCache.findAll(filters).forEach(function (query) {\n        query.invalidate();\n      });\n\n      return _this5.refetchQueries(refetchFilters, options);\n    });\n  };\n\n  _proto.refetchQueries = function refetchQueries(arg1, arg2, arg3) {\n    var _this6 = this;\n\n    var _parseFilterArgs6 = parseFilterArgs(arg1, arg2, arg3),\n        filters = _parseFilterArgs6[0],\n        options = _parseFilterArgs6[1];\n\n    var promises = notifyManager.batch(function () {\n      return _this6.queryCache.findAll(filters).map(function (query) {\n        return query.fetch(undefined, _extends({}, options, {\n          meta: {\n            refetchPage: filters == null ? void 0 : filters.refetchPage\n          }\n        }));\n      });\n    });\n    var promise = Promise.all(promises).then(noop);\n\n    if (!(options == null ? void 0 : options.throwOnError)) {\n      promise = promise.catch(noop);\n    }\n\n    return promise;\n  };\n\n  _proto.fetchQuery = function fetchQuery(arg1, arg2, arg3) {\n    var parsedOptions = parseQueryArgs(arg1, arg2, arg3);\n    var defaultedOptions = this.defaultQueryOptions(parsedOptions); // https://github.com/tannerlinsley/react-query/issues/652\n\n    if (typeof defaultedOptions.retry === 'undefined') {\n      defaultedOptions.retry = false;\n    }\n\n    var query = this.queryCache.build(this, defaultedOptions);\n    return query.isStaleByTime(defaultedOptions.staleTime) ? query.fetch(defaultedOptions) : Promise.resolve(query.state.data);\n  };\n\n  _proto.prefetchQuery = function prefetchQuery(arg1, arg2, arg3) {\n    return this.fetchQuery(arg1, arg2, arg3).then(noop).catch(noop);\n  };\n\n  _proto.fetchInfiniteQuery = function fetchInfiniteQuery(arg1, arg2, arg3) {\n    var parsedOptions = parseQueryArgs(arg1, arg2, arg3);\n    parsedOptions.behavior = infiniteQueryBehavior();\n    return this.fetchQuery(parsedOptions);\n  };\n\n  _proto.prefetchInfiniteQuery = function prefetchInfiniteQuery(arg1, arg2, arg3) {\n    return this.fetchInfiniteQuery(arg1, arg2, arg3).then(noop).catch(noop);\n  };\n\n  _proto.cancelMutations = function cancelMutations() {\n    var _this7 = this;\n\n    var promises = notifyManager.batch(function () {\n      return _this7.mutationCache.getAll().map(function (mutation) {\n        return mutation.cancel();\n      });\n    });\n    return Promise.all(promises).then(noop).catch(noop);\n  };\n\n  _proto.resumePausedMutations = function resumePausedMutations() {\n    return this.getMutationCache().resumePausedMutations();\n  };\n\n  _proto.executeMutation = function executeMutation(options) {\n    return this.mutationCache.build(this, options).execute();\n  };\n\n  _proto.getQueryCache = function getQueryCache() {\n    return this.queryCache;\n  };\n\n  _proto.getMutationCache = function getMutationCache() {\n    return this.mutationCache;\n  };\n\n  _proto.getDefaultOptions = function getDefaultOptions() {\n    return this.defaultOptions;\n  };\n\n  _proto.setDefaultOptions = function setDefaultOptions(options) {\n    this.defaultOptions = options;\n  };\n\n  _proto.setQueryDefaults = function setQueryDefaults(queryKey, options) {\n    var result = this.queryDefaults.find(function (x) {\n      return hashQueryKey(queryKey) === hashQueryKey(x.queryKey);\n    });\n\n    if (result) {\n      result.defaultOptions = options;\n    } else {\n      this.queryDefaults.push({\n        queryKey: queryKey,\n        defaultOptions: options\n      });\n    }\n  };\n\n  _proto.getQueryDefaults = function getQueryDefaults(queryKey) {\n    var _this$queryDefaults$f;\n\n    return queryKey ? (_this$queryDefaults$f = this.queryDefaults.find(function (x) {\n      return partialMatchKey(queryKey, x.queryKey);\n    })) == null ? void 0 : _this$queryDefaults$f.defaultOptions : undefined;\n  };\n\n  _proto.setMutationDefaults = function setMutationDefaults(mutationKey, options) {\n    var result = this.mutationDefaults.find(function (x) {\n      return hashQueryKey(mutationKey) === hashQueryKey(x.mutationKey);\n    });\n\n    if (result) {\n      result.defaultOptions = options;\n    } else {\n      this.mutationDefaults.push({\n        mutationKey: mutationKey,\n        defaultOptions: options\n      });\n    }\n  };\n\n  _proto.getMutationDefaults = function getMutationDefaults(mutationKey) {\n    var _this$mutationDefault;\n\n    return mutationKey ? (_this$mutationDefault = this.mutationDefaults.find(function (x) {\n      return partialMatchKey(mutationKey, x.mutationKey);\n    })) == null ? void 0 : _this$mutationDefault.defaultOptions : undefined;\n  };\n\n  _proto.defaultQueryOptions = function defaultQueryOptions(options) {\n    if (options == null ? void 0 : options._defaulted) {\n      return options;\n    }\n\n    var defaultedOptions = _extends({}, this.defaultOptions.queries, this.getQueryDefaults(options == null ? void 0 : options.queryKey), options, {\n      _defaulted: true\n    });\n\n    if (!defaultedOptions.queryHash && defaultedOptions.queryKey) {\n      defaultedOptions.queryHash = hashQueryKeyByOptions(defaultedOptions.queryKey, defaultedOptions);\n    }\n\n    return defaultedOptions;\n  };\n\n  _proto.defaultQueryObserverOptions = function defaultQueryObserverOptions(options) {\n    return this.defaultQueryOptions(options);\n  };\n\n  _proto.defaultMutationOptions = function defaultMutationOptions(options) {\n    if (options == null ? void 0 : options._defaulted) {\n      return options;\n    }\n\n    return _extends({}, this.defaultOptions.mutations, this.getMutationDefaults(options == null ? void 0 : options.mutationKey), options, {\n      _defaulted: true\n    });\n  };\n\n  _proto.clear = function clear() {\n    this.queryCache.clear();\n    this.mutationCache.clear();\n  };\n\n  return QueryClient;\n}();","import { focusManager } from './focusManager';\nimport { onlineManager } from './onlineManager';\nimport { sleep } from './utils';\n\nfunction defaultRetryDelay(failureCount) {\n  return Math.min(1000 * Math.pow(2, failureCount), 30000);\n}\n\nexport function isCancelable(value) {\n  return typeof (value == null ? void 0 : value.cancel) === 'function';\n}\nexport var CancelledError = function CancelledError(options) {\n  this.revert = options == null ? void 0 : options.revert;\n  this.silent = options == null ? void 0 : options.silent;\n};\nexport function isCancelledError(value) {\n  return value instanceof CancelledError;\n} // CLASS\n\nexport var Retryer = function Retryer(config) {\n  var _this = this;\n\n  var cancelRetry = false;\n  var cancelFn;\n  var continueFn;\n  var promiseResolve;\n  var promiseReject;\n  this.abort = config.abort;\n\n  this.cancel = function (cancelOptions) {\n    return cancelFn == null ? void 0 : cancelFn(cancelOptions);\n  };\n\n  this.cancelRetry = function () {\n    cancelRetry = true;\n  };\n\n  this.continueRetry = function () {\n    cancelRetry = false;\n  };\n\n  this.continue = function () {\n    return continueFn == null ? void 0 : continueFn();\n  };\n\n  this.failureCount = 0;\n  this.isPaused = false;\n  this.isResolved = false;\n  this.isTransportCancelable = false;\n  this.promise = new Promise(function (outerResolve, outerReject) {\n    promiseResolve = outerResolve;\n    promiseReject = outerReject;\n  });\n\n  var resolve = function resolve(value) {\n    if (!_this.isResolved) {\n      _this.isResolved = true;\n      config.onSuccess == null ? void 0 : config.onSuccess(value);\n      continueFn == null ? void 0 : continueFn();\n      promiseResolve(value);\n    }\n  };\n\n  var reject = function reject(value) {\n    if (!_this.isResolved) {\n      _this.isResolved = true;\n      config.onError == null ? void 0 : config.onError(value);\n      continueFn == null ? void 0 : continueFn();\n      promiseReject(value);\n    }\n  };\n\n  var pause = function pause() {\n    return new Promise(function (continueResolve) {\n      continueFn = continueResolve;\n      _this.isPaused = true;\n      config.onPause == null ? void 0 : config.onPause();\n    }).then(function () {\n      continueFn = undefined;\n      _this.isPaused = false;\n      config.onContinue == null ? void 0 : config.onContinue();\n    });\n  }; // Create loop function\n\n\n  var run = function run() {\n    // Do nothing if already resolved\n    if (_this.isResolved) {\n      return;\n    }\n\n    var promiseOrValue; // Execute query\n\n    try {\n      promiseOrValue = config.fn();\n    } catch (error) {\n      promiseOrValue = Promise.reject(error);\n    } // Create callback to cancel this fetch\n\n\n    cancelFn = function cancelFn(cancelOptions) {\n      if (!_this.isResolved) {\n        reject(new CancelledError(cancelOptions));\n        _this.abort == null ? void 0 : _this.abort(); // Cancel transport if supported\n\n        if (isCancelable(promiseOrValue)) {\n          try {\n            promiseOrValue.cancel();\n          } catch (_unused) {}\n        }\n      }\n    }; // Check if the transport layer support cancellation\n\n\n    _this.isTransportCancelable = isCancelable(promiseOrValue);\n    Promise.resolve(promiseOrValue).then(resolve).catch(function (error) {\n      var _config$retry, _config$retryDelay;\n\n      // Stop if the fetch is already resolved\n      if (_this.isResolved) {\n        return;\n      } // Do we need to retry the request?\n\n\n      var retry = (_config$retry = config.retry) != null ? _config$retry : 3;\n      var retryDelay = (_config$retryDelay = config.retryDelay) != null ? _config$retryDelay : defaultRetryDelay;\n      var delay = typeof retryDelay === 'function' ? retryDelay(_this.failureCount, error) : retryDelay;\n      var shouldRetry = retry === true || typeof retry === 'number' && _this.failureCount < retry || typeof retry === 'function' && retry(_this.failureCount, error);\n\n      if (cancelRetry || !shouldRetry) {\n        // We are done if the query does not need to be retried\n        reject(error);\n        return;\n      }\n\n      _this.failureCount++; // Notify on fail\n\n      config.onFail == null ? void 0 : config.onFail(_this.failureCount, error); // Delay\n\n      sleep(delay) // Pause if the document is not visible or when the device is offline\n      .then(function () {\n        if (!focusManager.isFocused() || !onlineManager.isOnline()) {\n          return pause();\n        }\n      }).then(function () {\n        if (cancelRetry) {\n          reject(error);\n        } else {\n          run();\n        }\n      });\n    });\n  }; // Start loop\n\n\n  run();\n};","export var Subscribable = /*#__PURE__*/function () {\n  function Subscribable() {\n    this.listeners = [];\n  }\n\n  var _proto = Subscribable.prototype;\n\n  _proto.subscribe = function subscribe(listener) {\n    var _this = this;\n\n    var callback = listener || function () {\n      return undefined;\n    };\n\n    this.listeners.push(callback);\n    this.onSubscribe();\n    return function () {\n      _this.listeners = _this.listeners.filter(function (x) {\n        return x !== callback;\n      });\n\n      _this.onUnsubscribe();\n    };\n  };\n\n  _proto.hasListeners = function hasListeners() {\n    return this.listeners.length > 0;\n  };\n\n  _proto.onSubscribe = function onSubscribe() {// Do nothing\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {// Do nothing\n  };\n\n  return Subscribable;\n}();",null,"import _extends from \"@babel/runtime/helpers/esm/extends\";\n// TYPES\n// UTILS\nexport var isServer = typeof window === 'undefined';\nexport function noop() {\n  return undefined;\n}\nexport function functionalUpdate(updater, input) {\n  return typeof updater === 'function' ? updater(input) : updater;\n}\nexport function isValidTimeout(value) {\n  return typeof value === 'number' && value >= 0 && value !== Infinity;\n}\nexport function ensureQueryKeyArray(value) {\n  return Array.isArray(value) ? value : [value];\n}\nexport function difference(array1, array2) {\n  return array1.filter(function (x) {\n    return array2.indexOf(x) === -1;\n  });\n}\nexport function replaceAt(array, index, value) {\n  var copy = array.slice(0);\n  copy[index] = value;\n  return copy;\n}\nexport function timeUntilStale(updatedAt, staleTime) {\n  return Math.max(updatedAt + (staleTime || 0) - Date.now(), 0);\n}\nexport function parseQueryArgs(arg1, arg2, arg3) {\n  if (!isQueryKey(arg1)) {\n    return arg1;\n  }\n\n  if (typeof arg2 === 'function') {\n    return _extends({}, arg3, {\n      queryKey: arg1,\n      queryFn: arg2\n    });\n  }\n\n  return _extends({}, arg2, {\n    queryKey: arg1\n  });\n}\nexport function parseMutationArgs(arg1, arg2, arg3) {\n  if (isQueryKey(arg1)) {\n    if (typeof arg2 === 'function') {\n      return _extends({}, arg3, {\n        mutationKey: arg1,\n        mutationFn: arg2\n      });\n    }\n\n    return _extends({}, arg2, {\n      mutationKey: arg1\n    });\n  }\n\n  if (typeof arg1 === 'function') {\n    return _extends({}, arg2, {\n      mutationFn: arg1\n    });\n  }\n\n  return _extends({}, arg1);\n}\nexport function parseFilterArgs(arg1, arg2, arg3) {\n  return isQueryKey(arg1) ? [_extends({}, arg2, {\n    queryKey: arg1\n  }), arg3] : [arg1 || {}, arg2];\n}\nexport function parseMutationFilterArgs(arg1, arg2) {\n  return isQueryKey(arg1) ? _extends({}, arg2, {\n    mutationKey: arg1\n  }) : arg1;\n}\nexport function mapQueryStatusFilter(active, inactive) {\n  if (active === true && inactive === true || active == null && inactive == null) {\n    return 'all';\n  } else if (active === false && inactive === false) {\n    return 'none';\n  } else {\n    // At this point, active|inactive can only be true|false or false|true\n    // so, when only one value is provided, the missing one has to be the negated value\n    var isActive = active != null ? active : !inactive;\n    return isActive ? 'active' : 'inactive';\n  }\n}\nexport function matchQuery(filters, query) {\n  var active = filters.active,\n      exact = filters.exact,\n      fetching = filters.fetching,\n      inactive = filters.inactive,\n      predicate = filters.predicate,\n      queryKey = filters.queryKey,\n      stale = filters.stale;\n\n  if (isQueryKey(queryKey)) {\n    if (exact) {\n      if (query.queryHash !== hashQueryKeyByOptions(queryKey, query.options)) {\n        return false;\n      }\n    } else if (!partialMatchKey(query.queryKey, queryKey)) {\n      return false;\n    }\n  }\n\n  var queryStatusFilter = mapQueryStatusFilter(active, inactive);\n\n  if (queryStatusFilter === 'none') {\n    return false;\n  } else if (queryStatusFilter !== 'all') {\n    var isActive = query.isActive();\n\n    if (queryStatusFilter === 'active' && !isActive) {\n      return false;\n    }\n\n    if (queryStatusFilter === 'inactive' && isActive) {\n      return false;\n    }\n  }\n\n  if (typeof stale === 'boolean' && query.isStale() !== stale) {\n    return false;\n  }\n\n  if (typeof fetching === 'boolean' && query.isFetching() !== fetching) {\n    return false;\n  }\n\n  if (predicate && !predicate(query)) {\n    return false;\n  }\n\n  return true;\n}\nexport function matchMutation(filters, mutation) {\n  var exact = filters.exact,\n      fetching = filters.fetching,\n      predicate = filters.predicate,\n      mutationKey = filters.mutationKey;\n\n  if (isQueryKey(mutationKey)) {\n    if (!mutation.options.mutationKey) {\n      return false;\n    }\n\n    if (exact) {\n      if (hashQueryKey(mutation.options.mutationKey) !== hashQueryKey(mutationKey)) {\n        return false;\n      }\n    } else if (!partialMatchKey(mutation.options.mutationKey, mutationKey)) {\n      return false;\n    }\n  }\n\n  if (typeof fetching === 'boolean' && mutation.state.status === 'loading' !== fetching) {\n    return false;\n  }\n\n  if (predicate && !predicate(mutation)) {\n    return false;\n  }\n\n  return true;\n}\nexport function hashQueryKeyByOptions(queryKey, options) {\n  var hashFn = (options == null ? void 0 : options.queryKeyHashFn) || hashQueryKey;\n  return hashFn(queryKey);\n}\n/**\n * Default query keys hash function.\n */\n\nexport function hashQueryKey(queryKey) {\n  var asArray = ensureQueryKeyArray(queryKey);\n  return stableValueHash(asArray);\n}\n/**\n * Hashes the value into a stable hash.\n */\n\nexport function stableValueHash(value) {\n  return JSON.stringify(value, function (_, val) {\n    return isPlainObject(val) ? Object.keys(val).sort().reduce(function (result, key) {\n      result[key] = val[key];\n      return result;\n    }, {}) : val;\n  });\n}\n/**\n * Checks if key `b` partially matches with key `a`.\n */\n\nexport function partialMatchKey(a, b) {\n  return partialDeepEqual(ensureQueryKeyArray(a), ensureQueryKeyArray(b));\n}\n/**\n * Checks if `b` partially matches with `a`.\n */\n\nexport function partialDeepEqual(a, b) {\n  if (a === b) {\n    return true;\n  }\n\n  if (typeof a !== typeof b) {\n    return false;\n  }\n\n  if (a && b && typeof a === 'object' && typeof b === 'object') {\n    return !Object.keys(b).some(function (key) {\n      return !partialDeepEqual(a[key], b[key]);\n    });\n  }\n\n  return false;\n}\n/**\n * This function returns `a` if `b` is deeply equal.\n * If not, it will replace any deeply equal children of `b` with those of `a`.\n * This can be used for structural sharing between JSON values for example.\n */\n\nexport function replaceEqualDeep(a, b) {\n  if (a === b) {\n    return a;\n  }\n\n  var array = Array.isArray(a) && Array.isArray(b);\n\n  if (array || isPlainObject(a) && isPlainObject(b)) {\n    var aSize = array ? a.length : Object.keys(a).length;\n    var bItems = array ? b : Object.keys(b);\n    var bSize = bItems.length;\n    var copy = array ? [] : {};\n    var equalItems = 0;\n\n    for (var i = 0; i < bSize; i++) {\n      var key = array ? i : bItems[i];\n      copy[key] = replaceEqualDeep(a[key], b[key]);\n\n      if (copy[key] === a[key]) {\n        equalItems++;\n      }\n    }\n\n    return aSize === bSize && equalItems === aSize ? a : copy;\n  }\n\n  return b;\n}\n/**\n * Shallow compare objects. Only works with objects that always have the same properties.\n */\n\nexport function shallowEqualObjects(a, b) {\n  if (a && !b || b && !a) {\n    return false;\n  }\n\n  for (var key in a) {\n    if (a[key] !== b[key]) {\n      return false;\n    }\n  }\n\n  return true;\n} // Copied from: https://github.com/jonschlinkert/is-plain-object\n\nexport function isPlainObject(o) {\n  if (!hasObjectPrototype(o)) {\n    return false;\n  } // If has modified constructor\n\n\n  var ctor = o.constructor;\n\n  if (typeof ctor === 'undefined') {\n    return true;\n  } // If has modified prototype\n\n\n  var prot = ctor.prototype;\n\n  if (!hasObjectPrototype(prot)) {\n    return false;\n  } // If constructor does not have an Object-specific method\n\n\n  if (!prot.hasOwnProperty('isPrototypeOf')) {\n    return false;\n  } // Most likely a plain Object\n\n\n  return true;\n}\n\nfunction hasObjectPrototype(o) {\n  return Object.prototype.toString.call(o) === '[object Object]';\n}\n\nexport function isQueryKey(value) {\n  return typeof value === 'string' || Array.isArray(value);\n}\nexport function isError(value) {\n  return value instanceof Error;\n}\nexport function sleep(timeout) {\n  return new Promise(function (resolve) {\n    setTimeout(resolve, timeout);\n  });\n}\n/**\n * Schedules a microtask.\n * This can be useful to schedule state updates after rendering.\n */\n\nexport function scheduleMicrotask(callback) {\n  Promise.resolve().then(callback).catch(function (error) {\n    return setTimeout(function () {\n      throw error;\n    });\n  });\n}\nexport function getAbortController() {\n  if (typeof AbortController === 'function') {\n    return new AbortController();\n  }\n}","export * from './core';\nexport * from './react';","import ReactDOM from 'react-dom';\nexport var unstable_batchedUpdates = ReactDOM.unstable_batchedUpdates;","import { notifyManager } from '../core';\nimport { unstable_batchedUpdates } from './reactBatchedUpdates';\nnotifyManager.setBatchNotifyFunction(unstable_batchedUpdates);","export var logger = console;","import { setLogger } from '../core';\nimport { logger } from './logger';\nsetLogger(logger);","import React from 'react';\nvar defaultContext = /*#__PURE__*/React.createContext(undefined);\nvar QueryClientSharingContext = /*#__PURE__*/React.createContext(false); // if contextSharing is on, we share the first and at least one\n// instance of the context across the window\n// to ensure that if React Query is used across\n// different bundles or microfrontends they will\n// all use the same **instance** of context, regardless\n// of module scoping.\n\nfunction getQueryClientContext(contextSharing) {\n  if (contextSharing && typeof window !== 'undefined') {\n    if (!window.ReactQueryClientContext) {\n      window.ReactQueryClientContext = defaultContext;\n    }\n\n    return window.ReactQueryClientContext;\n  }\n\n  return defaultContext;\n}\n\nexport var useQueryClient = function useQueryClient() {\n  var queryClient = React.useContext(getQueryClientContext(React.useContext(QueryClientSharingContext)));\n\n  if (!queryClient) {\n    throw new Error('No QueryClient set, use QueryClientProvider to set one');\n  }\n\n  return queryClient;\n};\nexport var QueryClientProvider = function QueryClientProvider(_ref) {\n  var client = _ref.client,\n      _ref$contextSharing = _ref.contextSharing,\n      contextSharing = _ref$contextSharing === void 0 ? false : _ref$contextSharing,\n      children = _ref.children;\n  React.useEffect(function () {\n    client.mount();\n    return function () {\n      client.unmount();\n    };\n  }, [client]);\n  var Context = getQueryClientContext(contextSharing);\n  return /*#__PURE__*/React.createElement(QueryClientSharingContext.Provider, {\n    value: contextSharing\n  }, /*#__PURE__*/React.createElement(Context.Provider, {\n    value: client\n  }, children));\n};","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { getDefaultState } from './mutation';\nimport { notifyManager } from './notifyManager';\nimport { Subscribable } from './subscribable';\n// CLASS\nexport var MutationObserver = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(MutationObserver, _Subscribable);\n\n  function MutationObserver(client, options) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.client = client;\n\n    _this.setOptions(options);\n\n    _this.bindMethods();\n\n    _this.updateResult();\n\n    return _this;\n  }\n\n  var _proto = MutationObserver.prototype;\n\n  _proto.bindMethods = function bindMethods() {\n    this.mutate = this.mutate.bind(this);\n    this.reset = this.reset.bind(this);\n  };\n\n  _proto.setOptions = function setOptions(options) {\n    this.options = this.client.defaultMutationOptions(options);\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.listeners.length) {\n      var _this$currentMutation;\n\n      (_this$currentMutation = this.currentMutation) == null ? void 0 : _this$currentMutation.removeObserver(this);\n    }\n  };\n\n  _proto.onMutationUpdate = function onMutationUpdate(action) {\n    this.updateResult(); // Determine which callbacks to trigger\n\n    var notifyOptions = {\n      listeners: true\n    };\n\n    if (action.type === 'success') {\n      notifyOptions.onSuccess = true;\n    } else if (action.type === 'error') {\n      notifyOptions.onError = true;\n    }\n\n    this.notify(notifyOptions);\n  };\n\n  _proto.getCurrentResult = function getCurrentResult() {\n    return this.currentResult;\n  };\n\n  _proto.reset = function reset() {\n    this.currentMutation = undefined;\n    this.updateResult();\n    this.notify({\n      listeners: true\n    });\n  };\n\n  _proto.mutate = function mutate(variables, options) {\n    this.mutateOptions = options;\n\n    if (this.currentMutation) {\n      this.currentMutation.removeObserver(this);\n    }\n\n    this.currentMutation = this.client.getMutationCache().build(this.client, _extends({}, this.options, {\n      variables: typeof variables !== 'undefined' ? variables : this.options.variables\n    }));\n    this.currentMutation.addObserver(this);\n    return this.currentMutation.execute();\n  };\n\n  _proto.updateResult = function updateResult() {\n    var state = this.currentMutation ? this.currentMutation.state : getDefaultState();\n\n    var result = _extends({}, state, {\n      isLoading: state.status === 'loading',\n      isSuccess: state.status === 'success',\n      isError: state.status === 'error',\n      isIdle: state.status === 'idle',\n      mutate: this.mutate,\n      reset: this.reset\n    });\n\n    this.currentResult = result;\n  };\n\n  _proto.notify = function notify(options) {\n    var _this2 = this;\n\n    notifyManager.batch(function () {\n      // First trigger the mutate callbacks\n      if (_this2.mutateOptions) {\n        if (options.onSuccess) {\n          _this2.mutateOptions.onSuccess == null ? void 0 : _this2.mutateOptions.onSuccess(_this2.currentResult.data, _this2.currentResult.variables, _this2.currentResult.context);\n          _this2.mutateOptions.onSettled == null ? void 0 : _this2.mutateOptions.onSettled(_this2.currentResult.data, null, _this2.currentResult.variables, _this2.currentResult.context);\n        } else if (options.onError) {\n          _this2.mutateOptions.onError == null ? void 0 : _this2.mutateOptions.onError(_this2.currentResult.error, _this2.currentResult.variables, _this2.currentResult.context);\n          _this2.mutateOptions.onSettled == null ? void 0 : _this2.mutateOptions.onSettled(undefined, _this2.currentResult.error, _this2.currentResult.variables, _this2.currentResult.context);\n        }\n      } // Then trigger the listeners\n\n\n      if (options.listeners) {\n        _this2.listeners.forEach(function (listener) {\n          listener(_this2.currentResult);\n        });\n      }\n    });\n  };\n\n  return MutationObserver;\n}(Subscribable);","export function shouldThrowError(suspense, _useErrorBoundary, params) {\n  // Allow useErrorBoundary function to override throwing behavior on a per-error basis\n  if (typeof _useErrorBoundary === 'function') {\n    return _useErrorBoundary.apply(void 0, params);\n  } // Allow useErrorBoundary to override suspense's throwing behavior\n\n\n  if (typeof _useErrorBoundary === 'boolean') return _useErrorBoundary; // If suspense is enabled default to throwing errors\n\n  return !!suspense;\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport React from 'react';\nimport { notifyManager } from '../core/notifyManager';\nimport { noop, parseMutationArgs } from '../core/utils';\nimport { MutationObserver } from '../core/mutationObserver';\nimport { useQueryClient } from './QueryClientProvider';\nimport { shouldThrowError } from './utils'; // HOOK\n\nexport function useMutation(arg1, arg2, arg3) {\n  var mountedRef = React.useRef(false);\n\n  var _React$useState = React.useState(0),\n      forceUpdate = _React$useState[1];\n\n  var options = parseMutationArgs(arg1, arg2, arg3);\n  var queryClient = useQueryClient();\n  var obsRef = React.useRef();\n\n  if (!obsRef.current) {\n    obsRef.current = new MutationObserver(queryClient, options);\n  } else {\n    obsRef.current.setOptions(options);\n  }\n\n  var currentResult = obsRef.current.getCurrentResult();\n  React.useEffect(function () {\n    mountedRef.current = true;\n    var unsubscribe = obsRef.current.subscribe(notifyManager.batchCalls(function () {\n      if (mountedRef.current) {\n        forceUpdate(function (x) {\n          return x + 1;\n        });\n      }\n    }));\n    return function () {\n      mountedRef.current = false;\n      unsubscribe();\n    };\n  }, []);\n  var mutate = React.useCallback(function (variables, mutateOptions) {\n    obsRef.current.mutate(variables, mutateOptions).catch(noop);\n  }, []);\n\n  if (currentResult.error && shouldThrowError(undefined, obsRef.current.options.useErrorBoundary, [currentResult.error])) {\n    throw currentResult.error;\n  }\n\n  return _extends({}, currentResult, {\n    mutate: mutate,\n    mutateAsync: currentResult.mutate\n  });\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _inheritsLoose from \"@babel/runtime/helpers/esm/inheritsLoose\";\nimport { isServer, isValidTimeout, noop, replaceEqualDeep, shallowEqualObjects, timeUntilStale } from './utils';\nimport { notifyManager } from './notifyManager';\nimport { focusManager } from './focusManager';\nimport { Subscribable } from './subscribable';\nimport { getLogger } from './logger';\nimport { isCancelledError } from './retryer';\nexport var QueryObserver = /*#__PURE__*/function (_Subscribable) {\n  _inheritsLoose(QueryObserver, _Subscribable);\n\n  function QueryObserver(client, options) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.client = client;\n    _this.options = options;\n    _this.trackedProps = [];\n    _this.selectError = null;\n\n    _this.bindMethods();\n\n    _this.setOptions(options);\n\n    return _this;\n  }\n\n  var _proto = QueryObserver.prototype;\n\n  _proto.bindMethods = function bindMethods() {\n    this.remove = this.remove.bind(this);\n    this.refetch = this.refetch.bind(this);\n  };\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (this.listeners.length === 1) {\n      this.currentQuery.addObserver(this);\n\n      if (shouldFetchOnMount(this.currentQuery, this.options)) {\n        this.executeFetch();\n      }\n\n      this.updateTimers();\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.listeners.length) {\n      this.destroy();\n    }\n  };\n\n  _proto.shouldFetchOnReconnect = function shouldFetchOnReconnect() {\n    return shouldFetchOn(this.currentQuery, this.options, this.options.refetchOnReconnect);\n  };\n\n  _proto.shouldFetchOnWindowFocus = function shouldFetchOnWindowFocus() {\n    return shouldFetchOn(this.currentQuery, this.options, this.options.refetchOnWindowFocus);\n  };\n\n  _proto.destroy = function destroy() {\n    this.listeners = [];\n    this.clearTimers();\n    this.currentQuery.removeObserver(this);\n  };\n\n  _proto.setOptions = function setOptions(options, notifyOptions) {\n    var prevOptions = this.options;\n    var prevQuery = this.currentQuery;\n    this.options = this.client.defaultQueryObserverOptions(options);\n\n    if (typeof this.options.enabled !== 'undefined' && typeof this.options.enabled !== 'boolean') {\n      throw new Error('Expected enabled to be a boolean');\n    } // Keep previous query key if the user does not supply one\n\n\n    if (!this.options.queryKey) {\n      this.options.queryKey = prevOptions.queryKey;\n    }\n\n    this.updateQuery();\n    var mounted = this.hasListeners(); // Fetch if there are subscribers\n\n    if (mounted && shouldFetchOptionally(this.currentQuery, prevQuery, this.options, prevOptions)) {\n      this.executeFetch();\n    } // Update result\n\n\n    this.updateResult(notifyOptions); // Update stale interval if needed\n\n    if (mounted && (this.currentQuery !== prevQuery || this.options.enabled !== prevOptions.enabled || this.options.staleTime !== prevOptions.staleTime)) {\n      this.updateStaleTimeout();\n    }\n\n    var nextRefetchInterval = this.computeRefetchInterval(); // Update refetch interval if needed\n\n    if (mounted && (this.currentQuery !== prevQuery || this.options.enabled !== prevOptions.enabled || nextRefetchInterval !== this.currentRefetchInterval)) {\n      this.updateRefetchInterval(nextRefetchInterval);\n    }\n  };\n\n  _proto.getOptimisticResult = function getOptimisticResult(options) {\n    var defaultedOptions = this.client.defaultQueryObserverOptions(options);\n    var query = this.client.getQueryCache().build(this.client, defaultedOptions);\n    return this.createResult(query, defaultedOptions);\n  };\n\n  _proto.getCurrentResult = function getCurrentResult() {\n    return this.currentResult;\n  };\n\n  _proto.trackResult = function trackResult(result, defaultedOptions) {\n    var _this2 = this;\n\n    var trackedResult = {};\n\n    var trackProp = function trackProp(key) {\n      if (!_this2.trackedProps.includes(key)) {\n        _this2.trackedProps.push(key);\n      }\n    };\n\n    Object.keys(result).forEach(function (key) {\n      Object.defineProperty(trackedResult, key, {\n        configurable: false,\n        enumerable: true,\n        get: function get() {\n          trackProp(key);\n          return result[key];\n        }\n      });\n    });\n\n    if (defaultedOptions.useErrorBoundary || defaultedOptions.suspense) {\n      trackProp('error');\n    }\n\n    return trackedResult;\n  };\n\n  _proto.getNextResult = function getNextResult(options) {\n    var _this3 = this;\n\n    return new Promise(function (resolve, reject) {\n      var unsubscribe = _this3.subscribe(function (result) {\n        if (!result.isFetching) {\n          unsubscribe();\n\n          if (result.isError && (options == null ? void 0 : options.throwOnError)) {\n            reject(result.error);\n          } else {\n            resolve(result);\n          }\n        }\n      });\n    });\n  };\n\n  _proto.getCurrentQuery = function getCurrentQuery() {\n    return this.currentQuery;\n  };\n\n  _proto.remove = function remove() {\n    this.client.getQueryCache().remove(this.currentQuery);\n  };\n\n  _proto.refetch = function refetch(options) {\n    return this.fetch(_extends({}, options, {\n      meta: {\n        refetchPage: options == null ? void 0 : options.refetchPage\n      }\n    }));\n  };\n\n  _proto.fetchOptimistic = function fetchOptimistic(options) {\n    var _this4 = this;\n\n    var defaultedOptions = this.client.defaultQueryObserverOptions(options);\n    var query = this.client.getQueryCache().build(this.client, defaultedOptions);\n    return query.fetch().then(function () {\n      return _this4.createResult(query, defaultedOptions);\n    });\n  };\n\n  _proto.fetch = function fetch(fetchOptions) {\n    var _this5 = this;\n\n    return this.executeFetch(fetchOptions).then(function () {\n      _this5.updateResult();\n\n      return _this5.currentResult;\n    });\n  };\n\n  _proto.executeFetch = function executeFetch(fetchOptions) {\n    // Make sure we reference the latest query as the current one might have been removed\n    this.updateQuery(); // Fetch\n\n    var promise = this.currentQuery.fetch(this.options, fetchOptions);\n\n    if (!(fetchOptions == null ? void 0 : fetchOptions.throwOnError)) {\n      promise = promise.catch(noop);\n    }\n\n    return promise;\n  };\n\n  _proto.updateStaleTimeout = function updateStaleTimeout() {\n    var _this6 = this;\n\n    this.clearStaleTimeout();\n\n    if (isServer || this.currentResult.isStale || !isValidTimeout(this.options.staleTime)) {\n      return;\n    }\n\n    var time = timeUntilStale(this.currentResult.dataUpdatedAt, this.options.staleTime); // The timeout is sometimes triggered 1 ms before the stale time expiration.\n    // To mitigate this issue we always add 1 ms to the timeout.\n\n    var timeout = time + 1;\n    this.staleTimeoutId = setTimeout(function () {\n      if (!_this6.currentResult.isStale) {\n        _this6.updateResult();\n      }\n    }, timeout);\n  };\n\n  _proto.computeRefetchInterval = function computeRefetchInterval() {\n    var _this$options$refetch;\n\n    return typeof this.options.refetchInterval === 'function' ? this.options.refetchInterval(this.currentResult.data, this.currentQuery) : (_this$options$refetch = this.options.refetchInterval) != null ? _this$options$refetch : false;\n  };\n\n  _proto.updateRefetchInterval = function updateRefetchInterval(nextInterval) {\n    var _this7 = this;\n\n    this.clearRefetchInterval();\n    this.currentRefetchInterval = nextInterval;\n\n    if (isServer || this.options.enabled === false || !isValidTimeout(this.currentRefetchInterval) || this.currentRefetchInterval === 0) {\n      return;\n    }\n\n    this.refetchIntervalId = setInterval(function () {\n      if (_this7.options.refetchIntervalInBackground || focusManager.isFocused()) {\n        _this7.executeFetch();\n      }\n    }, this.currentRefetchInterval);\n  };\n\n  _proto.updateTimers = function updateTimers() {\n    this.updateStaleTimeout();\n    this.updateRefetchInterval(this.computeRefetchInterval());\n  };\n\n  _proto.clearTimers = function clearTimers() {\n    this.clearStaleTimeout();\n    this.clearRefetchInterval();\n  };\n\n  _proto.clearStaleTimeout = function clearStaleTimeout() {\n    if (this.staleTimeoutId) {\n      clearTimeout(this.staleTimeoutId);\n      this.staleTimeoutId = undefined;\n    }\n  };\n\n  _proto.clearRefetchInterval = function clearRefetchInterval() {\n    if (this.refetchIntervalId) {\n      clearInterval(this.refetchIntervalId);\n      this.refetchIntervalId = undefined;\n    }\n  };\n\n  _proto.createResult = function createResult(query, options) {\n    var prevQuery = this.currentQuery;\n    var prevOptions = this.options;\n    var prevResult = this.currentResult;\n    var prevResultState = this.currentResultState;\n    var prevResultOptions = this.currentResultOptions;\n    var queryChange = query !== prevQuery;\n    var queryInitialState = queryChange ? query.state : this.currentQueryInitialState;\n    var prevQueryResult = queryChange ? this.currentResult : this.previousQueryResult;\n    var state = query.state;\n    var dataUpdatedAt = state.dataUpdatedAt,\n        error = state.error,\n        errorUpdatedAt = state.errorUpdatedAt,\n        isFetching = state.isFetching,\n        status = state.status;\n    var isPreviousData = false;\n    var isPlaceholderData = false;\n    var data; // Optimistically set result in fetching state if needed\n\n    if (options.optimisticResults) {\n      var mounted = this.hasListeners();\n      var fetchOnMount = !mounted && shouldFetchOnMount(query, options);\n      var fetchOptionally = mounted && shouldFetchOptionally(query, prevQuery, options, prevOptions);\n\n      if (fetchOnMount || fetchOptionally) {\n        isFetching = true;\n\n        if (!dataUpdatedAt) {\n          status = 'loading';\n        }\n      }\n    } // Keep previous data if needed\n\n\n    if (options.keepPreviousData && !state.dataUpdateCount && (prevQueryResult == null ? void 0 : prevQueryResult.isSuccess) && status !== 'error') {\n      data = prevQueryResult.data;\n      dataUpdatedAt = prevQueryResult.dataUpdatedAt;\n      status = prevQueryResult.status;\n      isPreviousData = true;\n    } // Select data if needed\n    else if (options.select && typeof state.data !== 'undefined') {\n        // Memoize select result\n        if (prevResult && state.data === (prevResultState == null ? void 0 : prevResultState.data) && options.select === this.selectFn) {\n          data = this.selectResult;\n        } else {\n          try {\n            this.selectFn = options.select;\n            data = options.select(state.data);\n\n            if (options.structuralSharing !== false) {\n              data = replaceEqualDeep(prevResult == null ? void 0 : prevResult.data, data);\n            }\n\n            this.selectResult = data;\n            this.selectError = null;\n          } catch (selectError) {\n            getLogger().error(selectError);\n            this.selectError = selectError;\n          }\n        }\n      } // Use query data\n      else {\n          data = state.data;\n        } // Show placeholder data if needed\n\n\n    if (typeof options.placeholderData !== 'undefined' && typeof data === 'undefined' && (status === 'loading' || status === 'idle')) {\n      var placeholderData; // Memoize placeholder data\n\n      if ((prevResult == null ? void 0 : prevResult.isPlaceholderData) && options.placeholderData === (prevResultOptions == null ? void 0 : prevResultOptions.placeholderData)) {\n        placeholderData = prevResult.data;\n      } else {\n        placeholderData = typeof options.placeholderData === 'function' ? options.placeholderData() : options.placeholderData;\n\n        if (options.select && typeof placeholderData !== 'undefined') {\n          try {\n            placeholderData = options.select(placeholderData);\n\n            if (options.structuralSharing !== false) {\n              placeholderData = replaceEqualDeep(prevResult == null ? void 0 : prevResult.data, placeholderData);\n            }\n\n            this.selectError = null;\n          } catch (selectError) {\n            getLogger().error(selectError);\n            this.selectError = selectError;\n          }\n        }\n      }\n\n      if (typeof placeholderData !== 'undefined') {\n        status = 'success';\n        data = placeholderData;\n        isPlaceholderData = true;\n      }\n    }\n\n    if (this.selectError) {\n      error = this.selectError;\n      data = this.selectResult;\n      errorUpdatedAt = Date.now();\n      status = 'error';\n    }\n\n    var result = {\n      status: status,\n      isLoading: status === 'loading',\n      isSuccess: status === 'success',\n      isError: status === 'error',\n      isIdle: status === 'idle',\n      data: data,\n      dataUpdatedAt: dataUpdatedAt,\n      error: error,\n      errorUpdatedAt: errorUpdatedAt,\n      failureCount: state.fetchFailureCount,\n      errorUpdateCount: state.errorUpdateCount,\n      isFetched: state.dataUpdateCount > 0 || state.errorUpdateCount > 0,\n      isFetchedAfterMount: state.dataUpdateCount > queryInitialState.dataUpdateCount || state.errorUpdateCount > queryInitialState.errorUpdateCount,\n      isFetching: isFetching,\n      isRefetching: isFetching && status !== 'loading',\n      isLoadingError: status === 'error' && state.dataUpdatedAt === 0,\n      isPlaceholderData: isPlaceholderData,\n      isPreviousData: isPreviousData,\n      isRefetchError: status === 'error' && state.dataUpdatedAt !== 0,\n      isStale: isStale(query, options),\n      refetch: this.refetch,\n      remove: this.remove\n    };\n    return result;\n  };\n\n  _proto.shouldNotifyListeners = function shouldNotifyListeners(result, prevResult) {\n    if (!prevResult) {\n      return true;\n    }\n\n    var _this$options = this.options,\n        notifyOnChangeProps = _this$options.notifyOnChangeProps,\n        notifyOnChangePropsExclusions = _this$options.notifyOnChangePropsExclusions;\n\n    if (!notifyOnChangeProps && !notifyOnChangePropsExclusions) {\n      return true;\n    }\n\n    if (notifyOnChangeProps === 'tracked' && !this.trackedProps.length) {\n      return true;\n    }\n\n    var includedProps = notifyOnChangeProps === 'tracked' ? this.trackedProps : notifyOnChangeProps;\n    return Object.keys(result).some(function (key) {\n      var typedKey = key;\n      var changed = result[typedKey] !== prevResult[typedKey];\n      var isIncluded = includedProps == null ? void 0 : includedProps.some(function (x) {\n        return x === key;\n      });\n      var isExcluded = notifyOnChangePropsExclusions == null ? void 0 : notifyOnChangePropsExclusions.some(function (x) {\n        return x === key;\n      });\n      return changed && !isExcluded && (!includedProps || isIncluded);\n    });\n  };\n\n  _proto.updateResult = function updateResult(notifyOptions) {\n    var prevResult = this.currentResult;\n    this.currentResult = this.createResult(this.currentQuery, this.options);\n    this.currentResultState = this.currentQuery.state;\n    this.currentResultOptions = this.options; // Only notify if something has changed\n\n    if (shallowEqualObjects(this.currentResult, prevResult)) {\n      return;\n    } // Determine which callbacks to trigger\n\n\n    var defaultNotifyOptions = {\n      cache: true\n    };\n\n    if ((notifyOptions == null ? void 0 : notifyOptions.listeners) !== false && this.shouldNotifyListeners(this.currentResult, prevResult)) {\n      defaultNotifyOptions.listeners = true;\n    }\n\n    this.notify(_extends({}, defaultNotifyOptions, notifyOptions));\n  };\n\n  _proto.updateQuery = function updateQuery() {\n    var query = this.client.getQueryCache().build(this.client, this.options);\n\n    if (query === this.currentQuery) {\n      return;\n    }\n\n    var prevQuery = this.currentQuery;\n    this.currentQuery = query;\n    this.currentQueryInitialState = query.state;\n    this.previousQueryResult = this.currentResult;\n\n    if (this.hasListeners()) {\n      prevQuery == null ? void 0 : prevQuery.removeObserver(this);\n      query.addObserver(this);\n    }\n  };\n\n  _proto.onQueryUpdate = function onQueryUpdate(action) {\n    var notifyOptions = {};\n\n    if (action.type === 'success') {\n      notifyOptions.onSuccess = true;\n    } else if (action.type === 'error' && !isCancelledError(action.error)) {\n      notifyOptions.onError = true;\n    }\n\n    this.updateResult(notifyOptions);\n\n    if (this.hasListeners()) {\n      this.updateTimers();\n    }\n  };\n\n  _proto.notify = function notify(notifyOptions) {\n    var _this8 = this;\n\n    notifyManager.batch(function () {\n      // First trigger the configuration callbacks\n      if (notifyOptions.onSuccess) {\n        _this8.options.onSuccess == null ? void 0 : _this8.options.onSuccess(_this8.currentResult.data);\n        _this8.options.onSettled == null ? void 0 : _this8.options.onSettled(_this8.currentResult.data, null);\n      } else if (notifyOptions.onError) {\n        _this8.options.onError == null ? void 0 : _this8.options.onError(_this8.currentResult.error);\n        _this8.options.onSettled == null ? void 0 : _this8.options.onSettled(undefined, _this8.currentResult.error);\n      } // Then trigger the listeners\n\n\n      if (notifyOptions.listeners) {\n        _this8.listeners.forEach(function (listener) {\n          listener(_this8.currentResult);\n        });\n      } // Then the cache listeners\n\n\n      if (notifyOptions.cache) {\n        _this8.client.getQueryCache().notify({\n          query: _this8.currentQuery,\n          type: 'observerResultsUpdated'\n        });\n      }\n    });\n  };\n\n  return QueryObserver;\n}(Subscribable);\n\nfunction shouldLoadOnMount(query, options) {\n  return options.enabled !== false && !query.state.dataUpdatedAt && !(query.state.status === 'error' && options.retryOnMount === false);\n}\n\nfunction shouldFetchOnMount(query, options) {\n  return shouldLoadOnMount(query, options) || query.state.dataUpdatedAt > 0 && shouldFetchOn(query, options, options.refetchOnMount);\n}\n\nfunction shouldFetchOn(query, options, field) {\n  if (options.enabled !== false) {\n    var value = typeof field === 'function' ? field(query) : field;\n    return value === 'always' || value !== false && isStale(query, options);\n  }\n\n  return false;\n}\n\nfunction shouldFetchOptionally(query, prevQuery, options, prevOptions) {\n  return options.enabled !== false && (query !== prevQuery || prevOptions.enabled === false) && (!options.suspense || query.state.status !== 'error') && isStale(query, options);\n}\n\nfunction isStale(query, options) {\n  return query.isStaleByTime(options.staleTime);\n}","import React from 'react'; // CONTEXT\n\nfunction createValue() {\n  var _isReset = false;\n  return {\n    clearReset: function clearReset() {\n      _isReset = false;\n    },\n    reset: function reset() {\n      _isReset = true;\n    },\n    isReset: function isReset() {\n      return _isReset;\n    }\n  };\n}\n\nvar QueryErrorResetBoundaryContext = /*#__PURE__*/React.createContext(createValue()); // HOOK\n\nexport var useQueryErrorResetBoundary = function useQueryErrorResetBoundary() {\n  return React.useContext(QueryErrorResetBoundaryContext);\n}; // COMPONENT\n\nexport var QueryErrorResetBoundary = function QueryErrorResetBoundary(_ref) {\n  var children = _ref.children;\n  var value = React.useMemo(function () {\n    return createValue();\n  }, []);\n  return /*#__PURE__*/React.createElement(QueryErrorResetBoundaryContext.Provider, {\n    value: value\n  }, typeof children === 'function' ? children(value) : children);\n};","import React from 'react';\nimport { notifyManager } from '../core/notifyManager';\nimport { useQueryErrorResetBoundary } from './QueryErrorResetBoundary';\nimport { useQueryClient } from './QueryClientProvider';\nimport { shouldThrowError } from './utils';\nexport function useBaseQuery(options, Observer) {\n  var mountedRef = React.useRef(false);\n\n  var _React$useState = React.useState(0),\n      forceUpdate = _React$useState[1];\n\n  var queryClient = useQueryClient();\n  var errorResetBoundary = useQueryErrorResetBoundary();\n  var defaultedOptions = queryClient.defaultQueryObserverOptions(options); // Make sure results are optimistically set in fetching state before subscribing or updating options\n\n  defaultedOptions.optimisticResults = true; // Include callbacks in batch renders\n\n  if (defaultedOptions.onError) {\n    defaultedOptions.onError = notifyManager.batchCalls(defaultedOptions.onError);\n  }\n\n  if (defaultedOptions.onSuccess) {\n    defaultedOptions.onSuccess = notifyManager.batchCalls(defaultedOptions.onSuccess);\n  }\n\n  if (defaultedOptions.onSettled) {\n    defaultedOptions.onSettled = notifyManager.batchCalls(defaultedOptions.onSettled);\n  }\n\n  if (defaultedOptions.suspense) {\n    // Always set stale time when using suspense to prevent\n    // fetching again when directly mounting after suspending\n    if (typeof defaultedOptions.staleTime !== 'number') {\n      defaultedOptions.staleTime = 1000;\n    } // Set cache time to 1 if the option has been set to 0\n    // when using suspense to prevent infinite loop of fetches\n\n\n    if (defaultedOptions.cacheTime === 0) {\n      defaultedOptions.cacheTime = 1;\n    }\n  }\n\n  if (defaultedOptions.suspense || defaultedOptions.useErrorBoundary) {\n    // Prevent retrying failed query if the error boundary has not been reset yet\n    if (!errorResetBoundary.isReset()) {\n      defaultedOptions.retryOnMount = false;\n    }\n  }\n\n  var _React$useState2 = React.useState(function () {\n    return new Observer(queryClient, defaultedOptions);\n  }),\n      observer = _React$useState2[0];\n\n  var result = observer.getOptimisticResult(defaultedOptions);\n  React.useEffect(function () {\n    mountedRef.current = true;\n    errorResetBoundary.clearReset();\n    var unsubscribe = observer.subscribe(notifyManager.batchCalls(function () {\n      if (mountedRef.current) {\n        forceUpdate(function (x) {\n          return x + 1;\n        });\n      }\n    })); // Update result to make sure we did not miss any query updates\n    // between creating the observer and subscribing to it.\n\n    observer.updateResult();\n    return function () {\n      mountedRef.current = false;\n      unsubscribe();\n    };\n  }, [errorResetBoundary, observer]);\n  React.useEffect(function () {\n    // Do not notify on updates because of changes in the options because\n    // these changes should already be reflected in the optimistic result.\n    observer.setOptions(defaultedOptions, {\n      listeners: false\n    });\n  }, [defaultedOptions, observer]); // Handle suspense\n\n  if (defaultedOptions.suspense && result.isLoading) {\n    throw observer.fetchOptimistic(defaultedOptions).then(function (_ref) {\n      var data = _ref.data;\n      defaultedOptions.onSuccess == null ? void 0 : defaultedOptions.onSuccess(data);\n      defaultedOptions.onSettled == null ? void 0 : defaultedOptions.onSettled(data, null);\n    }).catch(function (error) {\n      errorResetBoundary.clearReset();\n      defaultedOptions.onError == null ? void 0 : defaultedOptions.onError(error);\n      defaultedOptions.onSettled == null ? void 0 : defaultedOptions.onSettled(undefined, error);\n    });\n  } // Handle error boundary\n\n\n  if (result.isError && !errorResetBoundary.isReset() && !result.isFetching && shouldThrowError(defaultedOptions.suspense, defaultedOptions.useErrorBoundary, [result.error, observer.getCurrentQuery()])) {\n    throw result.error;\n  } // Handle result property usage tracking\n\n\n  if (defaultedOptions.notifyOnChangeProps === 'tracked') {\n    result = observer.trackResult(result, defaultedOptions);\n  }\n\n  return result;\n}","import { QueryObserver } from '../core';\nimport { parseQueryArgs } from '../core/utils';\nimport { useBaseQuery } from './useBaseQuery'; // HOOK\n\nexport function useQuery(arg1, arg2, arg3) {\n  var parsedOptions = parseQueryArgs(arg1, arg2, arg3);\n  return useBaseQuery(parsedOptions, QueryObserver);\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\n\n// TYPES\n// FUNCTIONS\nfunction dehydrateMutation(mutation) {\n  return {\n    mutationKey: mutation.options.mutationKey,\n    state: mutation.state\n  };\n} // Most config is not dehydrated but instead meant to configure again when\n// consuming the de/rehydrated data, typically with useQuery on the client.\n// Sometimes it might make sense to prefetch data on the server and include\n// in the html-payload, but not consume it on the initial render.\n\n\nfunction dehydrateQuery(query) {\n  return {\n    state: query.state,\n    queryKey: query.queryKey,\n    queryHash: query.queryHash\n  };\n}\n\nfunction defaultShouldDehydrateMutation(mutation) {\n  return mutation.state.isPaused;\n}\n\nfunction defaultShouldDehydrateQuery(query) {\n  return query.state.status === 'success';\n}\n\nexport function dehydrate(client, options) {\n  var _options, _options2;\n\n  options = options || {};\n  var mutations = [];\n  var queries = [];\n\n  if (((_options = options) == null ? void 0 : _options.dehydrateMutations) !== false) {\n    var shouldDehydrateMutation = options.shouldDehydrateMutation || defaultShouldDehydrateMutation;\n    client.getMutationCache().getAll().forEach(function (mutation) {\n      if (shouldDehydrateMutation(mutation)) {\n        mutations.push(dehydrateMutation(mutation));\n      }\n    });\n  }\n\n  if (((_options2 = options) == null ? void 0 : _options2.dehydrateQueries) !== false) {\n    var shouldDehydrateQuery = options.shouldDehydrateQuery || defaultShouldDehydrateQuery;\n    client.getQueryCache().getAll().forEach(function (query) {\n      if (shouldDehydrateQuery(query)) {\n        queries.push(dehydrateQuery(query));\n      }\n    });\n  }\n\n  return {\n    mutations: mutations,\n    queries: queries\n  };\n}\nexport function hydrate(client, dehydratedState, options) {\n  if (typeof dehydratedState !== 'object' || dehydratedState === null) {\n    return;\n  }\n\n  var mutationCache = client.getMutationCache();\n  var queryCache = client.getQueryCache();\n  var mutations = dehydratedState.mutations || [];\n  var queries = dehydratedState.queries || [];\n  mutations.forEach(function (dehydratedMutation) {\n    var _options$defaultOptio;\n\n    mutationCache.build(client, _extends({}, options == null ? void 0 : (_options$defaultOptio = options.defaultOptions) == null ? void 0 : _options$defaultOptio.mutations, {\n      mutationKey: dehydratedMutation.mutationKey\n    }), dehydratedMutation.state);\n  });\n  queries.forEach(function (dehydratedQuery) {\n    var _options$defaultOptio2;\n\n    var query = queryCache.get(dehydratedQuery.queryHash); // Do not hydrate if an existing query exists with newer data\n\n    if (query) {\n      if (query.state.dataUpdatedAt < dehydratedQuery.state.dataUpdatedAt) {\n        query.setState(dehydratedQuery.state);\n      }\n\n      return;\n    } // Restore query\n\n\n    queryCache.build(client, _extends({}, options == null ? void 0 : (_options$defaultOptio2 = options.defaultOptions) == null ? void 0 : _options$defaultOptio2.queries, {\n      queryKey: dehydratedQuery.queryKey,\n      queryHash: dehydratedQuery.queryHash\n    }), dehydratedQuery.state);\n  });\n}","import React from 'react';\nimport { hydrate } from '../core';\nimport { useQueryClient } from './QueryClientProvider';\nexport function useHydrate(state, options) {\n  var queryClient = useQueryClient();\n  var optionsRef = React.useRef(options);\n  optionsRef.current = options; // Running hydrate again with the same queries is safe,\n  // it wont overwrite or initialize existing queries,\n  // relying on useMemo here is only a performance optimization.\n  // hydrate can and should be run *during* render here for SSR to work properly\n\n  React.useMemo(function () {\n    if (state) {\n      hydrate(queryClient, state, optionsRef.current);\n    }\n  }, [queryClient, state]);\n}\nexport var Hydrate = function Hydrate(_ref) {\n  var children = _ref.children,\n      options = _ref.options,\n      state = _ref.state;\n  useHydrate(state, options);\n  return children;\n};","// Side effects\nimport './setBatchUpdatesFn';\nimport './setLogger';\nexport { QueryClientProvider, useQueryClient } from './QueryClientProvider';\nexport { QueryErrorResetBoundary, useQueryErrorResetBoundary } from './QueryErrorResetBoundary';\nexport { useIsFetching } from './useIsFetching';\nexport { useIsMutating } from './useIsMutating';\nexport { useMutation } from './useMutation';\nexport { useQuery } from './useQuery';\nexport { useQueries } from './useQueries';\nexport { useInfiniteQuery } from './useInfiniteQuery';\nexport { useHydrate, Hydrate } from './Hydrate'; // Types\n\nexport * from './types';","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n  for (var key in src) {\n    dst[key] = src[key]\n  }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n  module.exports = buffer\n} else {\n  // Copy properties from require('buffer')\n  copyProps(buffer, exports)\n  exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n  if (typeof arg === 'number') {\n    throw new TypeError('Argument must not be a number')\n  }\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  var buf = Buffer(size)\n  if (fill !== undefined) {\n    if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n  } else {\n    buf.fill(0)\n  }\n  return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return buffer.SlowBuffer(size)\n}\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar define = require('define-data-property');\nvar hasDescriptors = require('has-property-descriptors')();\nvar gOPD = require('gopd');\n\nvar $TypeError = require('es-errors/type');\nvar $floor = GetIntrinsic('%Math.floor%');\n\n/** @type {import('.')} */\nmodule.exports = function setFunctionLength(fn, length) {\n\tif (typeof fn !== 'function') {\n\t\tthrow new $TypeError('`fn` is not a function');\n\t}\n\tif (typeof length !== 'number' || length < 0 || length > 0xFFFFFFFF || $floor(length) !== length) {\n\t\tthrow new $TypeError('`length` must be a positive 32-bit integer');\n\t}\n\n\tvar loose = arguments.length > 2 && !!arguments[2];\n\n\tvar functionLengthIsConfigurable = true;\n\tvar functionLengthIsWritable = true;\n\tif ('length' in fn && gOPD) {\n\t\tvar desc = gOPD(fn, 'length');\n\t\tif (desc && !desc.configurable) {\n\t\t\tfunctionLengthIsConfigurable = false;\n\t\t}\n\t\tif (desc && !desc.writable) {\n\t\t\tfunctionLengthIsWritable = false;\n\t\t}\n\t}\n\n\tif (functionLengthIsConfigurable || functionLengthIsWritable || !loose) {\n\t\tif (hasDescriptors) {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length, true, true);\n\t\t} else {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length);\n\t\t}\n\t}\n\treturn fn;\n};\n","'use strict';\n\nvar isProduction = process.env.NODE_ENV === 'production';\nvar prefix = 'Invariant failed';\nfunction invariant(condition, message) {\n    if (condition) {\n        return;\n    }\n    if (isProduction) {\n        throw new Error(prefix);\n    }\n    var provided = typeof message === 'function' ? message() : message;\n    var value = provided ? \"\".concat(prefix, \": \").concat(provided) : prefix;\n    throw new Error(value);\n}\n\nmodule.exports = invariant;\n","module.exports = function isBuffer(arg) {\n  return arg && typeof arg === 'object'\n    && typeof arg.copy === 'function'\n    && typeof arg.fill === 'function'\n    && typeof arg.readUInt8 === 'function';\n}","// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nvar isArgumentsObject = require('is-arguments');\nvar isGeneratorFunction = require('is-generator-function');\nvar whichTypedArray = require('which-typed-array');\nvar isTypedArray = require('is-typed-array');\n\nfunction uncurryThis(f) {\n  return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n  var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n  var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n  if (typeof value !== 'object') {\n    return false;\n  }\n  try {\n    prototypeValueOf(value);\n    return true;\n  } catch(e) {\n    return false;\n  }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n  if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n    return ArrayBuffer.isView(value);\n  }\n\n  return (\n    isTypedArray(value) ||\n    isDataView(value)\n  );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n  return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n  return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n  return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n  return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n  return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n  return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n  return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n  return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n  return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n  return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n  return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n  return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n  typeof Map !== 'undefined' &&\n  isMapToString(new Map())\n);\n\nfunction isMap(value) {\n  if (typeof Map === 'undefined') {\n    return false;\n  }\n\n  return isMapToString.working\n    ? isMapToString(value)\n    : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n  return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n  typeof Set !== 'undefined' &&\n  isSetToString(new Set())\n);\nfunction isSet(value) {\n  if (typeof Set === 'undefined') {\n    return false;\n  }\n\n  return isSetToString.working\n    ? isSetToString(value)\n    : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n  return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n  typeof WeakMap !== 'undefined' &&\n  isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n  if (typeof WeakMap === 'undefined') {\n    return false;\n  }\n\n  return isWeakMapToString.working\n    ? isWeakMapToString(value)\n    : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n  return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n  typeof WeakSet !== 'undefined' &&\n  isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n  return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n  return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n  if (typeof ArrayBuffer === 'undefined') {\n    return false;\n  }\n\n  return isArrayBufferToString.working\n    ? isArrayBufferToString(value)\n    : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n  return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  typeof DataView !== 'undefined' &&\n  isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n  if (typeof DataView === 'undefined') {\n    return false;\n  }\n\n  return isDataViewToString.working\n    ? isDataViewToString(value)\n    : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n  return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n  if (typeof SharedArrayBufferCopy === 'undefined') {\n    return false;\n  }\n\n  if (typeof isSharedArrayBufferToString.working === 'undefined') {\n    isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n  }\n\n  return isSharedArrayBufferToString.working\n    ? isSharedArrayBufferToString(value)\n    : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n  return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n  return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n  return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n  return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n  return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n  return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n  return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n  return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n  return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n  return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n  return (\n    isNumberObject(value) ||\n    isStringObject(value) ||\n    isBooleanObject(value) ||\n    isBigIntObject(value) ||\n    isSymbolObject(value)\n  );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n  return typeof Uint8Array !== 'undefined' && (\n    isArrayBuffer(value) ||\n    isSharedArrayBuffer(value)\n  );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n  Object.defineProperty(exports, method, {\n    enumerable: false,\n    value: function() {\n      throw new Error(method + ' is not supported in userland');\n    }\n  });\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\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n  function getOwnPropertyDescriptors(obj) {\n    var keys = Object.keys(obj);\n    var descriptors = {};\n    for (var i = 0; i < keys.length; i++) {\n      descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n    }\n    return descriptors;\n  };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n  if (typeof process !== 'undefined' && process.noDeprecation === true) {\n    return fn;\n  }\n\n  // Allow for deprecating things in the process of starting up.\n  if (typeof process === 'undefined') {\n    return function() {\n      return exports.deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n  var debugEnv = process.env.NODE_DEBUG;\n  debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n    .replace(/\\*/g, '.*')\n    .replace(/,/g, '$|^')\n    .toUpperCase();\n  debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (debugEnvRegex.test(set)) {\n      var pid = process.pid;\n      debugs[set] = function() {\n        var msg = exports.format.apply(exports, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    exports._extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== exports.inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').slice(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.slice(1, -1);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = require('./support/types');\n\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n  return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n  return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n  if (typeof original !== 'function')\n    throw new TypeError('The \"original\" argument must be of type Function');\n\n  if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n    var fn = original[kCustomPromisifiedSymbol];\n    if (typeof fn !== 'function') {\n      throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n    }\n    Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n      value: fn, enumerable: false, writable: false, configurable: true\n    });\n    return fn;\n  }\n\n  function fn() {\n    var promiseResolve, promiseReject;\n    var promise = new Promise(function (resolve, reject) {\n      promiseResolve = resolve;\n      promiseReject = reject;\n    });\n\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n    args.push(function (err, value) {\n      if (err) {\n        promiseReject(err);\n      } else {\n        promiseResolve(value);\n      }\n    });\n\n    try {\n      original.apply(this, args);\n    } catch (err) {\n      promiseReject(err);\n    }\n\n    return promise;\n  }\n\n  Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n  if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n    value: fn, enumerable: false, writable: false, configurable: true\n  });\n  return Object.defineProperties(\n    fn,\n    getOwnPropertyDescriptors(original)\n  );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n  // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n  // Because `null` is a special error value in callbacks which means \"no error\n  // occurred\", we error-wrap so the callback consumer can distinguish between\n  // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n  if (!reason) {\n    var newReason = new Error('Promise was rejected with a falsy value');\n    newReason.reason = reason;\n    reason = newReason;\n  }\n  return cb(reason);\n}\n\nfunction callbackify(original) {\n  if (typeof original !== 'function') {\n    throw new TypeError('The \"original\" argument must be of type Function');\n  }\n\n  // We DO NOT return the promise as it gives the user a false sense that\n  // the promise is actually somehow related to the callback's execution\n  // and that the callback throwing will reject the promise.\n  function callbackified() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n\n    var maybeCb = args.pop();\n    if (typeof maybeCb !== 'function') {\n      throw new TypeError('The last argument must be of type Function');\n    }\n    var self = this;\n    var cb = function() {\n      return maybeCb.apply(self, arguments);\n    };\n    // In true node style we process the callback on `nextTick` with all the\n    // implications (stack, `uncaughtException`, `async_hooks`)\n    original.apply(this, args)\n      .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n            function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n  }\n\n  Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n  Object.defineProperties(callbackified,\n                          getOwnPropertyDescriptors(original));\n  return callbackified;\n}\nexports.callbackify = callbackify;\n","// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nvar getRandomValues;\nvar rnds8 = new Uint8Array(16);\nexport default function rng() {\n  // lazy load so that environments that need to polyfill have a chance to do so\n  if (!getRandomValues) {\n    // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation. Also,\n    // find the complete implementation of crypto (msCrypto) on IE11.\n    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto) || typeof msCrypto !== 'undefined' && typeof msCrypto.getRandomValues === 'function' && msCrypto.getRandomValues.bind(msCrypto);\n\n    if (!getRandomValues) {\n      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n    }\n  }\n\n  return getRandomValues(rnds8);\n}","export default /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i;","import REGEX from './regex.js';\n\nfunction validate(uuid) {\n  return typeof uuid === 'string' && REGEX.test(uuid);\n}\n\nexport default validate;","import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nvar byteToHex = [];\n\nfor (var i = 0; i < 256; ++i) {\n  byteToHex.push((i + 0x100).toString(16).substr(1));\n}\n\nfunction stringify(arr) {\n  var offset = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  // Note: Be careful editing this code!  It's been tuned for performance\n  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n  var uuid = (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase(); // Consistency check for valid UUID.  If this throws, it's likely due to one\n  // of the following:\n  // - One or more input array values don't map to a hex octet (leading to\n  // \"undefined\" in the uuid)\n  // - Invalid input values for the RFC `version` or `variant` fields\n\n  if (!validate(uuid)) {\n    throw TypeError('Stringified UUID is invalid');\n  }\n\n  return uuid;\n}\n\nexport default stringify;","import rng from './rng.js';\nimport stringify from './stringify.js';\n\nfunction v4(options, buf, offset) {\n  options = options || {};\n  var rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (var i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return stringify(rnds);\n}\n\nexport default v4;","export { default as v1 } from './v1.js';\nexport { default as v3 } from './v3.js';\nexport { default as v4 } from './v4.js';\nexport { default as v5 } from './v5.js';\nexport { default as NIL } from './nil.js';\nexport { default as version } from './version.js';\nexport { default as validate } from './validate.js';\nexport { default as stringify } from './stringify.js';\nexport { default as parse } from './parse.js';","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBind = require('call-bind');\nvar callBound = require('call-bind/callBound');\nvar gOPD = require('gopd');\n\n/** @type {(O: object) => string} */\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\n\n/** @type {<T = unknown>(array: readonly T[], value: unknown) => number} */\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n/** @typedef {(receiver: import('.').TypedArray) => string | typeof Uint8Array.prototype.slice.call | typeof Uint8Array.prototype.set.call} Getter */\n/** @type {{ [k in `\\$${import('.').TypedArrayName}`]?: Getter } & { __proto__: null }} */\nvar cache = { __proto__: null };\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr) {\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(descriptor.get);\n\t\t}\n\t});\n} else {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tvar fn = arr.slice || arr.set;\n\t\tif (fn) {\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(fn);\n\t\t}\n\t});\n}\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\t/** @type {ReturnType<typeof tryAllTypedArrays>} */ var found = false;\n\tforEach(\n\t\t// eslint-disable-next-line no-extra-parens\n\t\t/** @type {Record<`\\$${TypedArrayName}`, Getter>} */ /** @type {any} */ (cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */\n\t\tfunction (getter, typedArray) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t// @ts-expect-error TODO: fix\n\t\t\t\t\tif ('$' + getter(value) === typedArray) {\n\t\t\t\t\t\tfound = $slice(typedArray, 1);\n\t\t\t\t\t}\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar trySlices = function tryAllSlices(value) {\n\t/** @type {ReturnType<typeof tryAllSlices>} */ var found = false;\n\tforEach(\n\t\t// eslint-disable-next-line no-extra-parens\n\t\t/** @type {Record<`\\$${TypedArrayName}`, Getter>} */ /** @type {any} */ (cache),\n\t\t/** @type {(getter: typeof cache, name: `\\$${import('.').TypedArrayName}`) => void} */ function (getter, name) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error TODO: fix\n\t\t\t\t\tgetter(value);\n\t\t\t\t\tfound = $slice(name, 1);\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {import('.')} */\nmodule.exports = function whichTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\t/** @type {string} */\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\tif ($indexOf(typedArrays, tag) > -1) {\n\t\t\treturn tag;\n\t\t}\n\t\tif (tag !== 'Object') {\n\t\t\treturn false;\n\t\t}\n\t\t// node < 0.6 hits here on real Typed Arrays\n\t\treturn trySlices(value);\n\t}\n\tif (!gOPD) { return null; } // unknown engine\n\treturn tryTypedArrays(value);\n};\n","/* (ignored) */","/* (ignored) */","function _interopRequireDefault(e) {\n  return e && e.__esModule ? e : {\n    \"default\": e\n  };\n}\nmodule.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeDecode = void 0;\nconst encodeDecode = (layout) => {\n    const decode = layout.decode.bind(layout);\n    const encode = layout.encode.bind(layout);\n    return { decode, encode };\n};\nexports.encodeDecode = encodeDecode;\n//# sourceMappingURL=base.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.u256be = exports.u256 = exports.u192be = exports.u192 = exports.u128be = exports.u128 = exports.u64be = exports.u64 = exports.bigIntBE = exports.bigInt = void 0;\nconst buffer_layout_1 = require(\"@solana/buffer-layout\");\nconst bigint_buffer_1 = require(\"bigint-buffer\");\nconst base_1 = require(\"./base\");\nconst bigInt = (length) => (property) => {\n    const layout = (0, buffer_layout_1.blob)(length, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const bigIntLayout = layout;\n    bigIntLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return (0, bigint_buffer_1.toBigIntLE)(Buffer.from(src));\n    };\n    bigIntLayout.encode = (bigInt, buffer, offset) => {\n        const src = (0, bigint_buffer_1.toBufferLE)(bigInt, length);\n        return encode(src, buffer, offset);\n    };\n    return bigIntLayout;\n};\nexports.bigInt = bigInt;\nconst bigIntBE = (length) => (property) => {\n    const layout = (0, buffer_layout_1.blob)(length, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const bigIntLayout = layout;\n    bigIntLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return (0, bigint_buffer_1.toBigIntBE)(Buffer.from(src));\n    };\n    bigIntLayout.encode = (bigInt, buffer, offset) => {\n        const src = (0, bigint_buffer_1.toBufferBE)(bigInt, length);\n        return encode(src, buffer, offset);\n    };\n    return bigIntLayout;\n};\nexports.bigIntBE = bigIntBE;\nexports.u64 = (0, exports.bigInt)(8);\nexports.u64be = (0, exports.bigIntBE)(8);\nexports.u128 = (0, exports.bigInt)(16);\nexports.u128be = (0, exports.bigIntBE)(16);\nexports.u192 = (0, exports.bigInt)(24);\nexports.u192be = (0, exports.bigIntBE)(24);\nexports.u256 = (0, exports.bigInt)(32);\nexports.u256be = (0, exports.bigIntBE)(32);\n//# sourceMappingURL=bigint.js.map","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decimal = exports.WAD = void 0;\nconst bignumber_js_1 = __importDefault(require(\"bignumber.js\"));\nconst base_1 = require(\"./base\");\nconst bigint_1 = require(\"./bigint\");\nexports.WAD = new bignumber_js_1.default('1e+18');\nconst decimal = (property) => {\n    const layout = (0, bigint_1.u128)(property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const decimalLayout = layout;\n    decimalLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset).toString();\n        return new bignumber_js_1.default(src).div(exports.WAD);\n    };\n    decimalLayout.encode = (decimal, buffer, offset) => {\n        const src = BigInt(decimal.times(exports.WAD).integerValue().toString());\n        return encode(src, buffer, offset);\n    };\n    return decimalLayout;\n};\nexports.decimal = decimal;\n//# sourceMappingURL=decimal.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./base\"), exports);\n__exportStar(require(\"./bigint\"), exports);\n__exportStar(require(\"./decimal\"), exports);\n__exportStar(require(\"./native\"), exports);\n__exportStar(require(\"./web3\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.bool = void 0;\nconst buffer_layout_1 = require(\"@solana/buffer-layout\");\nconst base_1 = require(\"./base\");\nconst bool = (property) => {\n    const layout = (0, buffer_layout_1.u8)(property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const boolLayout = layout;\n    boolLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return !!src;\n    };\n    boolLayout.encode = (bool, buffer, offset) => {\n        const src = Number(bool);\n        return encode(src, buffer, offset);\n    };\n    return boolLayout;\n};\nexports.bool = bool;\n//# sourceMappingURL=native.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.publicKey = void 0;\nconst buffer_layout_1 = require(\"@solana/buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst base_1 = require(\"./base\");\nconst publicKey = (property) => {\n    const layout = (0, buffer_layout_1.blob)(32, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const publicKeyLayout = layout;\n    publicKeyLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return new web3_js_1.PublicKey(src);\n    };\n    publicKeyLayout.encode = (publicKey, buffer, offset) => {\n        const src = publicKey.toBuffer();\n        return encode(src, buffer, offset);\n    };\n    return publicKeyLayout;\n};\nexports.publicKey = publicKey;\n//# sourceMappingURL=web3.js.map","'use strict';\n\nvar possibleNames = require('possible-typed-array-names');\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\n/** @type {import('.')} */\nmodule.exports = function availableTypedArrays() {\n\tvar /** @type {ReturnType<typeof availableTypedArrays>} */ out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\t// @ts-expect-error\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","function _extends() {\n  return _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","function _setPrototypeOf(t, e) {\n  return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {\n    return t.__proto__ = e, t;\n  }, _setPrototypeOf(t, e);\n}\nexport { _setPrototypeOf as default };","import setPrototypeOf from \"./setPrototypeOf.js\";\nfunction _inheritsLoose(t, o) {\n  t.prototype = Object.create(o.prototype), t.prototype.constructor = t, setPrototypeOf(t, o);\n}\nexport { _inheritsLoose as default };","function _objectWithoutPropertiesLoose(r, e) {\n  if (null == r) return {};\n  var t = {};\n  for (var n in r) if ({}.hasOwnProperty.call(r, n)) {\n    if (e.indexOf(n) >= 0) continue;\n    t[n] = r[n];\n  }\n  return t;\n}\nexport { _objectWithoutPropertiesLoose as default };","function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(h.outputLen);\n    number(h.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Choice: a ? b : c\nexport const Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nexport const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        exists(this);\n        output(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_md.js.map","import { HashMD, Chi, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends HashMD {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = SHA256_IV[0] | 0;\n        this.B = SHA256_IV[1] | 0;\n        this.C = SHA256_IV[2] | 0;\n        this.D = SHA256_IV[3] | 0;\n        this.E = SHA256_IV[4] | 0;\n        this.F = SHA256_IV[5] | 0;\n        this.G = SHA256_IV[6] | 0;\n        this.H = SHA256_IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n) => n : (n) => byteSwap(n);\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import { createContext, useContext } from 'react';\nconst DEFAULT_CONTEXT = {\n    setVisible(_open) {\n        console.error(constructMissingProviderErrorMessage('call', 'setVisible'));\n    },\n    visible: false,\n};\nObject.defineProperty(DEFAULT_CONTEXT, 'visible', {\n    get() {\n        console.error(constructMissingProviderErrorMessage('read', 'visible'));\n        return false;\n    },\n});\nfunction constructMissingProviderErrorMessage(action, valueName) {\n    return ('You have tried to ' +\n        ` ${action} \"${valueName}\"` +\n        ' on a WalletModalContext without providing one.' +\n        ' Make sure to render a WalletModalProvider' +\n        ' as an ancestor of the component that uses ' +\n        'WalletModalContext');\n}\nexport const WalletModalContext = createContext(DEFAULT_CONTEXT);\nexport function useWalletModal() {\n    return useContext(WalletModalContext);\n}\n//# sourceMappingURL=useWalletModal.js.map","import { createContext, useContext } from 'react';\nconst EMPTY_ARRAY = [];\nconst DEFAULT_CONTEXT = {\n    autoConnect: false,\n    connecting: false,\n    connected: false,\n    disconnecting: false,\n    select() {\n        logMissingProviderError('call', 'select');\n    },\n    connect() {\n        return Promise.reject(logMissingProviderError('call', 'connect'));\n    },\n    disconnect() {\n        return Promise.reject(logMissingProviderError('call', 'disconnect'));\n    },\n    sendTransaction() {\n        return Promise.reject(logMissingProviderError('call', 'sendTransaction'));\n    },\n    signTransaction() {\n        return Promise.reject(logMissingProviderError('call', 'signTransaction'));\n    },\n    signAllTransactions() {\n        return Promise.reject(logMissingProviderError('call', 'signAllTransactions'));\n    },\n    signMessage() {\n        return Promise.reject(logMissingProviderError('call', 'signMessage'));\n    },\n    signIn() {\n        return Promise.reject(logMissingProviderError('call', 'signIn'));\n    },\n};\nObject.defineProperty(DEFAULT_CONTEXT, 'wallets', {\n    get() {\n        logMissingProviderError('read', 'wallets');\n        return EMPTY_ARRAY;\n    },\n});\nObject.defineProperty(DEFAULT_CONTEXT, 'wallet', {\n    get() {\n        logMissingProviderError('read', 'wallet');\n        return null;\n    },\n});\nObject.defineProperty(DEFAULT_CONTEXT, 'publicKey', {\n    get() {\n        logMissingProviderError('read', 'publicKey');\n        return null;\n    },\n});\nfunction logMissingProviderError(action, property) {\n    const error = new Error(`You have tried to ${action} \"${property}\" on a WalletContext without providing one. ` +\n        'Make sure to render a WalletProvider as an ancestor of the component that uses WalletContext.');\n    console.error(error);\n    return error;\n}\nexport const WalletContext = createContext(DEFAULT_CONTEXT);\nexport function useWallet() {\n    return useContext(WalletContext);\n}\n//# sourceMappingURL=useWallet.js.map","/** Name of the feature. */\nexport const SolanaSignAndSendTransaction = 'solana:signAndSendTransaction';\n//# sourceMappingURL=signAndSendTransaction.js.map","/** Name of the feature. */\nexport const SolanaSignMessage = 'solana:signMessage';\n//# sourceMappingURL=signMessage.js.map","/** Name of the feature. */\nexport const SolanaSignTransaction = 'solana:signTransaction';\n//# sourceMappingURL=signTransaction.js.map","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","'use strict';\n\n// This is free and unencumbered software released into the public domain.\n// See LICENSE.md for more information.\n\n//\n// Utilities\n//\n\n/**\n * @param {number} a The number to test.\n * @param {number} min The minimum value in the range, inclusive.\n * @param {number} max The maximum value in the range, inclusive.\n * @return {boolean} True if a >= min and a <= max.\n */\nfunction inRange(a, min, max) {\n  return min <= a && a <= max;\n}\n\n/**\n * @param {*} o\n * @return {Object}\n */\nfunction ToDictionary(o) {\n  if (o === undefined) return {};\n  if (o === Object(o)) return o;\n  throw TypeError('Could not convert argument to dictionary');\n}\n\n/**\n * @param {string} string Input string of UTF-16 code units.\n * @return {!Array.<number>} Code points.\n */\nfunction stringToCodePoints(string) {\n  // https://heycam.github.io/webidl/#dfn-obtain-unicode\n\n  // 1. Let S be the DOMString value.\n  var s = String(string);\n\n  // 2. Let n be the length of S.\n  var n = s.length;\n\n  // 3. Initialize i to 0.\n  var i = 0;\n\n  // 4. Initialize U to be an empty sequence of Unicode characters.\n  var u = [];\n\n  // 5. While i < n:\n  while (i < n) {\n\n    // 1. Let c be the code unit in S at index i.\n    var c = s.charCodeAt(i);\n\n    // 2. Depending on the value of c:\n\n    // c < 0xD800 or c > 0xDFFF\n    if (c < 0xD800 || c > 0xDFFF) {\n      // Append to U the Unicode character with code point c.\n      u.push(c);\n    }\n\n    // 0xDC00 ≤ c ≤ 0xDFFF\n    else if (0xDC00 <= c && c <= 0xDFFF) {\n      // Append to U a U+FFFD REPLACEMENT CHARACTER.\n      u.push(0xFFFD);\n    }\n\n    // 0xD800 ≤ c ≤ 0xDBFF\n    else if (0xD800 <= c && c <= 0xDBFF) {\n      // 1. If i = n−1, then append to U a U+FFFD REPLACEMENT\n      // CHARACTER.\n      if (i === n - 1) {\n        u.push(0xFFFD);\n      }\n      // 2. Otherwise, i < n−1:\n      else {\n        // 1. Let d be the code unit in S at index i+1.\n        var d = string.charCodeAt(i + 1);\n\n        // 2. If 0xDC00 ≤ d ≤ 0xDFFF, then:\n        if (0xDC00 <= d && d <= 0xDFFF) {\n          // 1. Let a be c & 0x3FF.\n          var a = c & 0x3FF;\n\n          // 2. Let b be d & 0x3FF.\n          var b = d & 0x3FF;\n\n          // 3. Append to U the Unicode character with code point\n          // 2^16+2^10*a+b.\n          u.push(0x10000 + (a << 10) + b);\n\n          // 4. Set i to i+1.\n          i += 1;\n        }\n\n        // 3. Otherwise, d < 0xDC00 or d > 0xDFFF. Append to U a\n        // U+FFFD REPLACEMENT CHARACTER.\n        else  {\n          u.push(0xFFFD);\n        }\n      }\n    }\n\n    // 3. Set i to i+1.\n    i += 1;\n  }\n\n  // 6. Return U.\n  return u;\n}\n\n/**\n * @param {!Array.<number>} code_points Array of code points.\n * @return {string} string String of UTF-16 code units.\n */\nfunction codePointsToString(code_points) {\n  var s = '';\n  for (var i = 0; i < code_points.length; ++i) {\n    var cp = code_points[i];\n    if (cp <= 0xFFFF) {\n      s += String.fromCharCode(cp);\n    } else {\n      cp -= 0x10000;\n      s += String.fromCharCode((cp >> 10) + 0xD800,\n                               (cp & 0x3FF) + 0xDC00);\n    }\n  }\n  return s;\n}\n\n\n//\n// Implementation of Encoding specification\n// https://encoding.spec.whatwg.org/\n//\n\n//\n// 3. Terminology\n//\n\n/**\n * End-of-stream is a special token that signifies no more tokens\n * are in the stream.\n * @const\n */ var end_of_stream = -1;\n\n/**\n * A stream represents an ordered sequence of tokens.\n *\n * @constructor\n * @param {!(Array.<number>|Uint8Array)} tokens Array of tokens that provide the\n * stream.\n */\nfunction Stream(tokens) {\n  /** @type {!Array.<number>} */\n  this.tokens = [].slice.call(tokens);\n}\n\nStream.prototype = {\n  /**\n   * @return {boolean} True if end-of-stream has been hit.\n   */\n  endOfStream: function() {\n    return !this.tokens.length;\n  },\n\n  /**\n   * When a token is read from a stream, the first token in the\n   * stream must be returned and subsequently removed, and\n   * end-of-stream must be returned otherwise.\n   *\n   * @return {number} Get the next token from the stream, or\n   * end_of_stream.\n   */\n   read: function() {\n    if (!this.tokens.length)\n      return end_of_stream;\n     return this.tokens.shift();\n   },\n\n  /**\n   * When one or more tokens are prepended to a stream, those tokens\n   * must be inserted, in given order, before the first token in the\n   * stream.\n   *\n   * @param {(number|!Array.<number>)} token The token(s) to prepend to the stream.\n   */\n  prepend: function(token) {\n    if (Array.isArray(token)) {\n      var tokens = /**@type {!Array.<number>}*/(token);\n      while (tokens.length)\n        this.tokens.unshift(tokens.pop());\n    } else {\n      this.tokens.unshift(token);\n    }\n  },\n\n  /**\n   * When one or more tokens are pushed to a stream, those tokens\n   * must be inserted, in given order, after the last token in the\n   * stream.\n   *\n   * @param {(number|!Array.<number>)} token The tokens(s) to prepend to the stream.\n   */\n  push: function(token) {\n    if (Array.isArray(token)) {\n      var tokens = /**@type {!Array.<number>}*/(token);\n      while (tokens.length)\n        this.tokens.push(tokens.shift());\n    } else {\n      this.tokens.push(token);\n    }\n  }\n};\n\n//\n// 4. Encodings\n//\n\n// 4.1 Encoders and decoders\n\n/** @const */\nvar finished = -1;\n\n/**\n * @param {boolean} fatal If true, decoding errors raise an exception.\n * @param {number=} opt_code_point Override the standard fallback code point.\n * @return {number} The code point to insert on a decoding error.\n */\nfunction decoderError(fatal, opt_code_point) {\n  if (fatal)\n    throw TypeError('Decoder error');\n  return opt_code_point || 0xFFFD;\n}\n\n/** @interface */\nfunction Decoder() {}\nDecoder.prototype = {\n  /**\n   * @param {Stream} stream The stream of bytes being decoded.\n   * @param {number} bite The next byte read from the stream.\n   * @return {?(number|!Array.<number>)} The next code point(s)\n   *     decoded, or null if not enough data exists in the input\n   *     stream to decode a complete code point, or |finished|.\n   */\n  handler: function(stream, bite) {}\n};\n\n/** @interface */\nfunction Encoder() {}\nEncoder.prototype = {\n  /**\n   * @param {Stream} stream The stream of code points being encoded.\n   * @param {number} code_point Next code point read from the stream.\n   * @return {(number|!Array.<number>)} Byte(s) to emit, or |finished|.\n   */\n  handler: function(stream, code_point) {}\n};\n\n//\n// 7. API\n//\n\n/** @const */ var DEFAULT_ENCODING = 'utf-8';\n\n// 7.1 Interface TextDecoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n *     defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextDecoder(encoding, options) {\n  if (!(this instanceof TextDecoder)) {\n    return new TextDecoder(encoding, options);\n  }\n  encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n  if (encoding !== DEFAULT_ENCODING) {\n    throw new Error('Encoding not supported. Only utf-8 is supported');\n  }\n  options = ToDictionary(options);\n\n  /** @private @type {boolean} */\n  this._streaming = false;\n  /** @private @type {boolean} */\n  this._BOMseen = false;\n  /** @private @type {?Decoder} */\n  this._decoder = null;\n  /** @private @type {boolean} */\n  this._fatal = Boolean(options['fatal']);\n  /** @private @type {boolean} */\n  this._ignoreBOM = Boolean(options['ignoreBOM']);\n\n  Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n  Object.defineProperty(this, 'fatal', {value: this._fatal});\n  Object.defineProperty(this, 'ignoreBOM', {value: this._ignoreBOM});\n}\n\nTextDecoder.prototype = {\n  /**\n   * @param {ArrayBufferView=} input The buffer of bytes to decode.\n   * @param {Object=} options\n   * @return {string} The decoded string.\n   */\n  decode: function decode(input, options) {\n    var bytes;\n    if (typeof input === 'object' && input instanceof ArrayBuffer) {\n      bytes = new Uint8Array(input);\n    } else if (typeof input === 'object' && 'buffer' in input &&\n               input.buffer instanceof ArrayBuffer) {\n      bytes = new Uint8Array(input.buffer,\n                             input.byteOffset,\n                             input.byteLength);\n    } else {\n      bytes = new Uint8Array(0);\n    }\n\n    options = ToDictionary(options);\n\n    if (!this._streaming) {\n      this._decoder = new UTF8Decoder({fatal: this._fatal});\n      this._BOMseen = false;\n    }\n    this._streaming = Boolean(options['stream']);\n\n    var input_stream = new Stream(bytes);\n\n    var code_points = [];\n\n    /** @type {?(number|!Array.<number>)} */\n    var result;\n\n    while (!input_stream.endOfStream()) {\n      result = this._decoder.handler(input_stream, input_stream.read());\n      if (result === finished)\n        break;\n      if (result === null)\n        continue;\n      if (Array.isArray(result))\n        code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n      else\n        code_points.push(result);\n    }\n    if (!this._streaming) {\n      do {\n        result = this._decoder.handler(input_stream, input_stream.read());\n        if (result === finished)\n          break;\n        if (result === null)\n          continue;\n        if (Array.isArray(result))\n          code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n        else\n          code_points.push(result);\n      } while (!input_stream.endOfStream());\n      this._decoder = null;\n    }\n\n    if (code_points.length) {\n      // If encoding is one of utf-8, utf-16be, and utf-16le, and\n      // ignore BOM flag and BOM seen flag are unset, run these\n      // subsubsteps:\n      if (['utf-8'].indexOf(this.encoding) !== -1 &&\n          !this._ignoreBOM && !this._BOMseen) {\n        // If token is U+FEFF, set BOM seen flag.\n        if (code_points[0] === 0xFEFF) {\n          this._BOMseen = true;\n          code_points.shift();\n        } else {\n          // Otherwise, if token is not end-of-stream, set BOM seen\n          // flag and append token to output.\n          this._BOMseen = true;\n        }\n      }\n    }\n\n    return codePointsToString(code_points);\n  }\n};\n\n// 7.2 Interface TextEncoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n *     defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextEncoder(encoding, options) {\n  if (!(this instanceof TextEncoder))\n    return new TextEncoder(encoding, options);\n  encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n  if (encoding !== DEFAULT_ENCODING) {\n    throw new Error('Encoding not supported. Only utf-8 is supported');\n  }\n  options = ToDictionary(options);\n\n  /** @private @type {boolean} */\n  this._streaming = false;\n  /** @private @type {?Encoder} */\n  this._encoder = null;\n  /** @private @type {{fatal: boolean}} */\n  this._options = {fatal: Boolean(options['fatal'])};\n\n  Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n}\n\nTextEncoder.prototype = {\n  /**\n   * @param {string=} opt_string The string to encode.\n   * @param {Object=} options\n   * @return {Uint8Array} Encoded bytes, as a Uint8Array.\n   */\n  encode: function encode(opt_string, options) {\n    opt_string = opt_string ? String(opt_string) : '';\n    options = ToDictionary(options);\n\n    // NOTE: This option is nonstandard. None of the encodings\n    // permitted for encoding (i.e. UTF-8, UTF-16) are stateful,\n    // so streaming is not necessary.\n    if (!this._streaming)\n      this._encoder = new UTF8Encoder(this._options);\n    this._streaming = Boolean(options['stream']);\n\n    var bytes = [];\n    var input_stream = new Stream(stringToCodePoints(opt_string));\n    /** @type {?(number|!Array.<number>)} */\n    var result;\n    while (!input_stream.endOfStream()) {\n      result = this._encoder.handler(input_stream, input_stream.read());\n      if (result === finished)\n        break;\n      if (Array.isArray(result))\n        bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n      else\n        bytes.push(result);\n    }\n    if (!this._streaming) {\n      while (true) {\n        result = this._encoder.handler(input_stream, input_stream.read());\n        if (result === finished)\n          break;\n        if (Array.isArray(result))\n          bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n        else\n          bytes.push(result);\n      }\n      this._encoder = null;\n    }\n    return new Uint8Array(bytes);\n  }\n};\n\n//\n// 8. The encoding\n//\n\n// 8.1 utf-8\n\n/**\n * @constructor\n * @implements {Decoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Decoder(options) {\n  var fatal = options.fatal;\n\n  // utf-8's decoder's has an associated utf-8 code point, utf-8\n  // bytes seen, and utf-8 bytes needed (all initially 0), a utf-8\n  // lower boundary (initially 0x80), and a utf-8 upper boundary\n  // (initially 0xBF).\n  var /** @type {number} */ utf8_code_point = 0,\n      /** @type {number} */ utf8_bytes_seen = 0,\n      /** @type {number} */ utf8_bytes_needed = 0,\n      /** @type {number} */ utf8_lower_boundary = 0x80,\n      /** @type {number} */ utf8_upper_boundary = 0xBF;\n\n  /**\n   * @param {Stream} stream The stream of bytes being decoded.\n   * @param {number} bite The next byte read from the stream.\n   * @return {?(number|!Array.<number>)} The next code point(s)\n   *     decoded, or null if not enough data exists in the input\n   *     stream to decode a complete code point.\n   */\n  this.handler = function(stream, bite) {\n    // 1. If byte is end-of-stream and utf-8 bytes needed is not 0,\n    // set utf-8 bytes needed to 0 and return error.\n    if (bite === end_of_stream && utf8_bytes_needed !== 0) {\n      utf8_bytes_needed = 0;\n      return decoderError(fatal);\n    }\n\n    // 2. If byte is end-of-stream, return finished.\n    if (bite === end_of_stream)\n      return finished;\n\n    // 3. If utf-8 bytes needed is 0, based on byte:\n    if (utf8_bytes_needed === 0) {\n\n      // 0x00 to 0x7F\n      if (inRange(bite, 0x00, 0x7F)) {\n        // Return a code point whose value is byte.\n        return bite;\n      }\n\n      // 0xC2 to 0xDF\n      if (inRange(bite, 0xC2, 0xDF)) {\n        // Set utf-8 bytes needed to 1 and utf-8 code point to byte\n        // − 0xC0.\n        utf8_bytes_needed = 1;\n        utf8_code_point = bite - 0xC0;\n      }\n\n      // 0xE0 to 0xEF\n      else if (inRange(bite, 0xE0, 0xEF)) {\n        // 1. If byte is 0xE0, set utf-8 lower boundary to 0xA0.\n        if (bite === 0xE0)\n          utf8_lower_boundary = 0xA0;\n        // 2. If byte is 0xED, set utf-8 upper boundary to 0x9F.\n        if (bite === 0xED)\n          utf8_upper_boundary = 0x9F;\n        // 3. Set utf-8 bytes needed to 2 and utf-8 code point to\n        // byte − 0xE0.\n        utf8_bytes_needed = 2;\n        utf8_code_point = bite - 0xE0;\n      }\n\n      // 0xF0 to 0xF4\n      else if (inRange(bite, 0xF0, 0xF4)) {\n        // 1. If byte is 0xF0, set utf-8 lower boundary to 0x90.\n        if (bite === 0xF0)\n          utf8_lower_boundary = 0x90;\n        // 2. If byte is 0xF4, set utf-8 upper boundary to 0x8F.\n        if (bite === 0xF4)\n          utf8_upper_boundary = 0x8F;\n        // 3. Set utf-8 bytes needed to 3 and utf-8 code point to\n        // byte − 0xF0.\n        utf8_bytes_needed = 3;\n        utf8_code_point = bite - 0xF0;\n      }\n\n      // Otherwise\n      else {\n        // Return error.\n        return decoderError(fatal);\n      }\n\n      // Then (byte is in the range 0xC2 to 0xF4) set utf-8 code\n      // point to utf-8 code point << (6 × utf-8 bytes needed) and\n      // return continue.\n      utf8_code_point = utf8_code_point << (6 * utf8_bytes_needed);\n      return null;\n    }\n\n    // 4. If byte is not in the range utf-8 lower boundary to utf-8\n    // upper boundary, run these substeps:\n    if (!inRange(bite, utf8_lower_boundary, utf8_upper_boundary)) {\n\n      // 1. Set utf-8 code point, utf-8 bytes needed, and utf-8\n      // bytes seen to 0, set utf-8 lower boundary to 0x80, and set\n      // utf-8 upper boundary to 0xBF.\n      utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n      utf8_lower_boundary = 0x80;\n      utf8_upper_boundary = 0xBF;\n\n      // 2. Prepend byte to stream.\n      stream.prepend(bite);\n\n      // 3. Return error.\n      return decoderError(fatal);\n    }\n\n    // 5. Set utf-8 lower boundary to 0x80 and utf-8 upper boundary\n    // to 0xBF.\n    utf8_lower_boundary = 0x80;\n    utf8_upper_boundary = 0xBF;\n\n    // 6. Increase utf-8 bytes seen by one and set utf-8 code point\n    // to utf-8 code point + (byte − 0x80) << (6 × (utf-8 bytes\n    // needed − utf-8 bytes seen)).\n    utf8_bytes_seen += 1;\n    utf8_code_point += (bite - 0x80) << (6 * (utf8_bytes_needed - utf8_bytes_seen));\n\n    // 7. If utf-8 bytes seen is not equal to utf-8 bytes needed,\n    // continue.\n    if (utf8_bytes_seen !== utf8_bytes_needed)\n      return null;\n\n    // 8. Let code point be utf-8 code point.\n    var code_point = utf8_code_point;\n\n    // 9. Set utf-8 code point, utf-8 bytes needed, and utf-8 bytes\n    // seen to 0.\n    utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n\n    // 10. Return a code point whose value is code point.\n    return code_point;\n  };\n}\n\n/**\n * @constructor\n * @implements {Encoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Encoder(options) {\n  var fatal = options.fatal;\n  /**\n   * @param {Stream} stream Input stream.\n   * @param {number} code_point Next code point read from the stream.\n   * @return {(number|!Array.<number>)} Byte(s) to emit.\n   */\n  this.handler = function(stream, code_point) {\n    // 1. If code point is end-of-stream, return finished.\n    if (code_point === end_of_stream)\n      return finished;\n\n    // 2. If code point is in the range U+0000 to U+007F, return a\n    // byte whose value is code point.\n    if (inRange(code_point, 0x0000, 0x007f))\n      return code_point;\n\n    // 3. Set count and offset based on the range code point is in:\n    var count, offset;\n    // U+0080 to U+07FF:    1 and 0xC0\n    if (inRange(code_point, 0x0080, 0x07FF)) {\n      count = 1;\n      offset = 0xC0;\n    }\n    // U+0800 to U+FFFF:    2 and 0xE0\n    else if (inRange(code_point, 0x0800, 0xFFFF)) {\n      count = 2;\n      offset = 0xE0;\n    }\n    // U+10000 to U+10FFFF: 3 and 0xF0\n    else if (inRange(code_point, 0x10000, 0x10FFFF)) {\n      count = 3;\n      offset = 0xF0;\n    }\n\n    // 4.Let bytes be a byte sequence whose first byte is (code\n    // point >> (6 × count)) + offset.\n    var bytes = [(code_point >> (6 * count)) + offset];\n\n    // 5. Run these substeps while count is greater than 0:\n    while (count > 0) {\n\n      // 1. Set temp to code point >> (6 × (count − 1)).\n      var temp = code_point >> (6 * (count - 1));\n\n      // 2. Append to bytes 0x80 | (temp & 0x3F).\n      bytes.push(0x80 | (temp & 0x3F));\n\n      // 3. Decrease count by one.\n      count -= 1;\n    }\n\n    // 6. Return bytes bytes, in order.\n    return bytes;\n  };\n}\n\nexport {TextEncoder, TextDecoder};\n","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n};\n","(self[\"webpackChunk_N_E\"] = self[\"webpackChunk_N_E\"] || []).push([[888],{\n\n/***/ 9828:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"BN\": function() { return /* reexport default from dynamic */ bn_js__WEBPACK_IMPORTED_MODULE_2___default.a; }\n/* harmony export */ });\n/* unused harmony exports AccountClient, AnchorError, AnchorProvider, BorshAccountsCoder, BorshCoder, BorshEventCoder, BorshInstructionCoder, DISCRIMINATOR_SIZE, EventManager, EventParser, IdlError, LangErrorCode, LangErrorMessage, MethodsBuilderFactory, Native, Program, ProgramError, ProgramErrorStack, SystemCoder, getProvider, parseIdlErrors, setProvider, splitArgsAndCtx, toInstruction, translateAddress, translateError, utils, validateAccounts */\n/* harmony import */ var buffer__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8764);\n/* harmony import */ var _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6737);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(3550);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(bn_js__WEBPACK_IMPORTED_MODULE_2__);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(8633);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(bs58__WEBPACK_IMPORTED_MODULE_3__);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(4037);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(camelcase__WEBPACK_IMPORTED_MODULE_4__);\n/* harmony import */ var _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(5970);\n/* harmony import */ var _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__);\n/* harmony import */ var _noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(7748);\n/* harmony import */ var pako__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(7885);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(6729);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_7___default = /*#__PURE__*/__webpack_require__.n(eventemitter3__WEBPACK_IMPORTED_MODULE_7__);\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\n\n\n\n\n\n\n\n\n\n\n\n\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\n\nfunction encode$3(data) {\n    return data.reduce((str, byte) => str + byte.toString(16).padStart(2, \"0\"), \"0x\");\n}\nfunction decode$3(data) {\n    if (data.indexOf(\"0x\") === 0) {\n        data = data.substr(2);\n    }\n    if (data.length % 2 === 1) {\n        data = \"0\" + data;\n    }\n    let key = data.match(/.{2}/g);\n    if (key === null) {\n        return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([]);\n    }\n    return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(key.map((byte) => parseInt(byte, 16)));\n}\n\nvar hex = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$3,\n    decode: decode$3\n});\n\nfunction decode$2(array) {\n    const decoder = new TextDecoder(\"utf-8\") // Browser https://caniuse.com/textencoder.\n        ; // Node.\n    return decoder.decode(array);\n}\nfunction encode$2(input) {\n    const encoder = new TextEncoder() // Browser.\n        ; // Node.\n    return encoder.encode(input);\n}\n\nvar utf8 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    decode: decode$2,\n    encode: encode$2\n});\n\nfunction encode$1(data) {\n    return bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(data);\n}\nfunction decode$1(data) {\n    return bs58__WEBPACK_IMPORTED_MODULE_3___default().decode(data);\n}\n\nvar bs58 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$1,\n    decode: decode$1\n});\n\nfunction encode(data) {\n    return data.toString(\"base64\");\n}\nfunction decode(data) {\n    return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(data, \"base64\");\n}\n\nvar base64 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode,\n    decode: decode\n});\n\nvar index$1 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hex: hex,\n    utf8: utf8,\n    bs58: bs58,\n    base64: base64\n});\n\nfunction isCompositeAccounts(accountItem) {\n    return \"accounts\" in accountItem;\n}\n// Deterministic IDL address as a function of the program id.\nasync function idlAddress(programId) {\n    const base = (await PublicKey.findProgramAddress([], programId))[0];\n    return await PublicKey.createWithSeed(base, seed(), programId);\n}\n// Seed for generating the idlAddress.\nfunction seed() {\n    return \"anchor:idl\";\n}\nconst IDL_ACCOUNT_LAYOUT = _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(\"authority\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.vecU8(\"data\"),\n]);\nfunction decodeIdlAccount(data) {\n    return IDL_ACCOUNT_LAYOUT.decode(data);\n}\n/**\n * Convert the given IDL to camelCase.\n *\n * The IDL is generated from Rust which has different conventions compared to\n * JS/TS, e.g. instruction names in Rust are snake_case.\n *\n * The conversion happens automatically for programs, however, if you are using\n * internals such as `BorshInstructionCoder` and you only have the original\n * (not camelCase) IDL, you might need to use this function.\n *\n * @param idl IDL to convert to camelCase\n * @returns camelCase version of the IDL\n */\nfunction convertIdlToCamelCase(idl) {\n    const KEYS_TO_CONVERT = [\"name\", \"path\", \"account\", \"relations\", \"generic\"];\n    // `my_account.field` is getting converted to `myAccountField` but we\n    // need `myAccount.field`.\n    const toCamelCase = (s) => s.split(\".\").map(camelCase).join(\".\");\n    const recursivelyConvertNamesToCamelCase = (obj) => {\n        for (const key in obj) {\n            const val = obj[key];\n            if (KEYS_TO_CONVERT.includes(key)) {\n                obj[key] = Array.isArray(val) ? val.map(toCamelCase) : toCamelCase(val);\n            }\n            else if (typeof val === \"object\") {\n                recursivelyConvertNamesToCamelCase(val);\n            }\n        }\n    };\n    const camelCasedIdl = structuredClone(idl);\n    recursivelyConvertNamesToCamelCase(camelCasedIdl);\n    return camelCasedIdl;\n}\n/** Conveniently handle all defined field kinds with proper type support. */\nfunction handleDefinedFields(fields, unitCb, namedCb, tupleCb) {\n    // Unit\n    if (!(fields === null || fields === void 0 ? void 0 : fields.length))\n        return unitCb();\n    // Named\n    if (fields[0].name) {\n        return namedCb(fields);\n    }\n    // Tuple\n    return tupleCb(fields);\n}\n\nfunction parseIdlErrors(idl) {\n    const errors = new Map();\n    if (idl.errors) {\n        idl.errors.forEach((e) => {\n            var _a;\n            let msg = (_a = e.msg) !== null && _a !== void 0 ? _a : e.name;\n            errors.set(e.code, msg);\n        });\n    }\n    return errors;\n}\nfunction toInstruction(idlIx, ...args) {\n    if (idlIx.args.length != args.length) {\n        throw new Error(\"Invalid argument length\");\n    }\n    const ix = {};\n    let idx = 0;\n    idlIx.args.forEach((ixArg) => {\n        ix[ixArg.name] = args[idx];\n        idx += 1;\n    });\n    return ix;\n}\n// Throws error if any account required for the `ix` is not given.\nfunction validateAccounts(ixAccounts, accounts = {}) {\n    ixAccounts.forEach((acc) => {\n        if (isCompositeAccounts(acc)) {\n            validateAccounts(acc.accounts, accounts[acc.name]);\n        }\n        else {\n            if (!accounts[acc.name]) {\n                throw new Error(`Account \\`${acc.name}\\` not provided.`);\n            }\n        }\n    });\n}\n// Translates an address to a Pubkey.\nfunction translateAddress(address) {\n    return address instanceof _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey ? address : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(address);\n}\n\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n  constructor(failure, failures) {\n    let cached;\n    const {\n      message,\n      ...rest\n    } = failure;\n    const {\n      path\n    } = failure;\n    const msg = path.length === 0 ? message : \"At path: \" + path.join('.') + \" -- \" + message;\n    super(msg);\n    this.value = void 0;\n    this.key = void 0;\n    this.type = void 0;\n    this.refinement = void 0;\n    this.path = void 0;\n    this.branch = void 0;\n    this.failures = void 0;\n    Object.assign(this, rest);\n    this.name = this.constructor.name;\n\n    this.failures = () => {\n      var _cached;\n\n      return (_cached = cached) != null ? _cached : cached = [failure, ...failures()];\n    };\n  }\n\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n  return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\n\n\nfunction isObject(x) {\n  return typeof x === 'object' && x != null;\n}\n/**\n * Return a value as a printable string.\n */\n\nfunction print(value) {\n  return typeof value === 'string' ? JSON.stringify(value) : \"\" + value;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\n\nfunction shiftIterator(input) {\n  const {\n    done,\n    value\n  } = input.next();\n  return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\n\nfunction toFailure(result, context, struct, value) {\n  if (result === true) {\n    return;\n  } else if (result === false) {\n    result = {};\n  } else if (typeof result === 'string') {\n    result = {\n      message: result\n    };\n  }\n\n  const {\n    path,\n    branch\n  } = context;\n  const {\n    type\n  } = struct;\n  const {\n    refinement,\n    message = \"Expected a value of type `\" + type + \"`\" + (refinement ? \" with refinement `\" + refinement + \"`\" : '') + \", but received: `\" + print(value) + \"`\"\n  } = result;\n  return {\n    value,\n    type,\n    refinement,\n    key: path[path.length - 1],\n    path,\n    branch,\n    ...result,\n    message\n  };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\n\nfunction* toFailures(result, context, struct, value) {\n  if (!isIterable(result)) {\n    result = [result];\n  }\n\n  for (const r of result) {\n    const failure = toFailure(r, context, struct, value);\n\n    if (failure) {\n      yield failure;\n    }\n  }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\n\nfunction* run(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const {\n    path = [],\n    branch = [value],\n    coerce = false,\n    mask = false\n  } = options;\n  const ctx = {\n    path,\n    branch\n  };\n\n  if (coerce) {\n    value = struct.coercer(value, ctx);\n\n    if (mask && struct.type !== 'type' && isObject(struct.schema) && isObject(value) && !Array.isArray(value)) {\n      for (const key in value) {\n        if (struct.schema[key] === undefined) {\n          delete value[key];\n        }\n      }\n    }\n  }\n\n  let valid = true;\n\n  for (const failure of struct.validator(value, ctx)) {\n    valid = false;\n    yield [failure, undefined];\n  }\n\n  for (let [k, v, s] of struct.entries(value, ctx)) {\n    const ts = run(v, s, {\n      path: k === undefined ? path : [...path, k],\n      branch: k === undefined ? branch : [...branch, v],\n      coerce,\n      mask\n    });\n\n    for (const t of ts) {\n      if (t[0]) {\n        valid = false;\n        yield [t[0], undefined];\n      } else if (coerce) {\n        v = t[1];\n\n        if (k === undefined) {\n          value = v;\n        } else if (value instanceof Map) {\n          value.set(k, v);\n        } else if (value instanceof Set) {\n          value.add(v);\n        } else if (isObject(value)) {\n          value[k] = v;\n        }\n      }\n    }\n  }\n\n  if (valid) {\n    for (const failure of struct.refiner(value, ctx)) {\n      valid = false;\n      yield [failure, undefined];\n    }\n  }\n\n  if (valid) {\n    yield [undefined, value];\n  }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\n\nclass Struct {\n  constructor(props) {\n    this.TYPE = void 0;\n    this.type = void 0;\n    this.schema = void 0;\n    this.coercer = void 0;\n    this.validator = void 0;\n    this.refiner = void 0;\n    this.entries = void 0;\n    const {\n      type,\n      schema,\n      validator,\n      refiner,\n      coercer = value => value,\n      entries = function* () {}\n    } = props;\n    this.type = type;\n    this.schema = schema;\n    this.entries = entries;\n    this.coercer = coercer;\n\n    if (validator) {\n      this.validator = (value, context) => {\n        const result = validator(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.validator = () => [];\n    }\n\n    if (refiner) {\n      this.refiner = (value, context) => {\n        const result = refiner(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.refiner = () => [];\n    }\n  }\n  /**\n   * Assert that a value passes the struct's validation, throwing if it doesn't.\n   */\n\n\n  assert(value) {\n    return assert(value, this);\n  }\n  /**\n   * Create a value with the struct's coercion logic, then validate it.\n   */\n\n\n  create(value) {\n    return create(value, this);\n  }\n  /**\n   * Check if a value passes the struct's validation.\n   */\n\n\n  is(value) {\n    return is(value, this);\n  }\n  /**\n   * Mask a value, coercing and validating it, but returning only the subset of\n   * properties defined by the struct's schema.\n   */\n\n\n  mask(value) {\n    return mask(value, this);\n  }\n  /**\n   * Validate a value with the struct's validation logic, returning a tuple\n   * representing the result.\n   *\n   * You may optionally pass `true` for the `withCoercion` argument to coerce\n   * the value before attempting to validate it. If you do, the result will\n   * contain the coerced result when successful.\n   */\n\n\n  validate(value, options) {\n    if (options === void 0) {\n      options = {};\n    }\n\n    return validate(value, this, options);\n  }\n\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\n\nfunction assert(value, struct) {\n  const result = validate(value, struct);\n\n  if (result[0]) {\n    throw result[0];\n  }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\n\nfunction create(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\n\nfunction mask(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true,\n    mask: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Check if a value passes a struct.\n */\n\nfunction is(value, struct) {\n  const result = validate(value, struct);\n  return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\n\nfunction validate(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const tuples = run(value, struct, options);\n  const tuple = shiftIterator(tuples);\n\n  if (tuple[0]) {\n    const error = new StructError(tuple[0], function* () {\n      for (const t of tuples) {\n        if (t[0]) {\n          yield t[0];\n        }\n      }\n    });\n    return [error, undefined];\n  } else {\n    const v = tuple[1];\n    return [undefined, v];\n  }\n}\n/**\n * Define a new struct type with a custom validation function.\n */\n\nfunction define(name, validator) {\n  return new Struct({\n    type: name,\n    schema: null,\n    validator\n  });\n}\n\n/**\n * Ensure that any value passes validation.\n */\n\nfunction any() {\n  return define('any', () => true);\n}\nfunction array(Element) {\n  return new Struct({\n    type: 'array',\n    schema: Element,\n\n    *entries(value) {\n      if (Element && Array.isArray(value)) {\n        for (const [i, v] of value.entries()) {\n          yield [i, v, Element];\n        }\n      }\n    },\n\n    coercer(value) {\n      return Array.isArray(value) ? value.slice() : value;\n    },\n\n    validator(value) {\n      return Array.isArray(value) || \"Expected an array value, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value is a boolean.\n */\n\nfunction boolean() {\n  return define('boolean', value => {\n    return typeof value === 'boolean';\n  });\n}\nfunction literal(constant) {\n  const description = print(constant);\n  const t = typeof constant;\n  return new Struct({\n    type: 'literal',\n    schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n\n    validator(value) {\n      return value === constant || \"Expected the literal `\" + description + \"`, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\n\nfunction nullable(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === null || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === null || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a number.\n */\n\nfunction number() {\n  return define('number', value => {\n    return typeof value === 'number' && !isNaN(value) || \"Expected a number, but received: \" + print(value);\n  });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\n\nfunction optional(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a string.\n */\n\nfunction string() {\n  return define('string', value => {\n    return typeof value === 'string' || \"Expected a string, but received: \" + print(value);\n  });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\n\nfunction type(schema) {\n  const keys = Object.keys(schema);\n  return new Struct({\n    type: 'type',\n    schema,\n\n    *entries(value) {\n      if (isObject(value)) {\n        for (const k of keys) {\n          yield [k, value[k], schema[k]];\n        }\n      }\n    },\n\n    validator(value) {\n      return isObject(value) || \"Expected an object, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\n\nfunction union$1(Structs) {\n  const description = Structs.map(s => s.type).join(' | ');\n  return new Struct({\n    type: 'union',\n    schema: null,\n\n    coercer(value, ctx) {\n      const firstMatch = Structs.find(s => {\n        const [e] = s.validate(value, {\n          coerce: true\n        });\n        return !e;\n      }) || unknown();\n      return firstMatch.coercer(value, ctx);\n    },\n\n    validator(value, ctx) {\n      const failures = [];\n\n      for (const S of Structs) {\n        const [...tuples] = run(value, S, ctx);\n        const [first] = tuples;\n\n        if (!first[0]) {\n          return [];\n        } else {\n          for (const [failure] of tuples) {\n            if (failure) {\n              failures.push(failure);\n            }\n          }\n        }\n      }\n\n      return [\"Expected the value to satisfy a union of `\" + description + \"`, but received: \" + print(value), ...failures];\n    }\n\n  });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\n\nfunction unknown() {\n  return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\n\nfunction coerce(struct, condition, coercer) {\n  return new Struct({ ...struct,\n    coercer: (value, ctx) => {\n      return is(value, condition) ? struct.coercer(coercer(value, ctx), ctx) : struct.coercer(value, ctx);\n    }\n  });\n}\n\n/**\n * Sends a transaction to a program with the given accounts and instruction\n * data.\n */\nasync function invoke(programId, accounts, data, provider) {\n    programId = translateAddress(programId);\n    if (!provider) {\n        provider = getProvider();\n    }\n    const tx = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.Transaction();\n    tx.add(new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.TransactionInstruction({\n        programId,\n        keys: accounts !== null && accounts !== void 0 ? accounts : [],\n        data,\n    }));\n    if (provider.sendAndConfirm === undefined) {\n        throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n    }\n    return await provider.sendAndConfirm(tx, []);\n}\nconst GET_MULTIPLE_ACCOUNTS_LIMIT = 99;\nasync function getMultipleAccounts(connection, publicKeys, commitment) {\n    const results = await getMultipleAccountsAndContext(connection, publicKeys, commitment);\n    return results.map((result) => {\n        return result\n            ? { publicKey: result.publicKey, account: result.account }\n            : null;\n    });\n}\nasync function getMultipleAccountsAndContext(connection, publicKeys, commitment) {\n    if (publicKeys.length <= GET_MULTIPLE_ACCOUNTS_LIMIT) {\n        return await getMultipleAccountsAndContextCore(connection, publicKeys, commitment);\n    }\n    else {\n        const batches = chunks(publicKeys, GET_MULTIPLE_ACCOUNTS_LIMIT);\n        const results = await Promise.all(batches.map((batch) => getMultipleAccountsAndContextCore(connection, batch, commitment)));\n        return results.flat();\n    }\n}\nasync function getMultipleAccountsAndContextCore(connection, publicKeys, commitmentOverride) {\n    const commitment = commitmentOverride !== null && commitmentOverride !== void 0 ? commitmentOverride : connection.commitment;\n    const { value: accountInfos, context } = await connection.getMultipleAccountsInfoAndContext(publicKeys, commitment);\n    const accounts = accountInfos.map((account, idx) => {\n        if (account === null) {\n            return null;\n        }\n        return {\n            publicKey: publicKeys[idx],\n            account,\n            context,\n        };\n    });\n    return accounts;\n}\n// copy from @solana/web3.js that has a commitment param\nasync function simulateTransaction(connection, transaction, signers, commitment, includeAccounts) {\n    var _a;\n    if (signers && signers.length > 0) {\n        transaction.sign(...signers);\n    }\n    // @ts-expect-error\n    const message = transaction._compile();\n    const signData = message.serialize();\n    // @ts-expect-error\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = {\n        encoding: \"base64\",\n        commitment: commitment !== null && commitment !== void 0 ? commitment : connection.commitment,\n    };\n    if (includeAccounts) {\n        const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map((key) => key.toBase58());\n        config[\"accounts\"] = {\n            encoding: \"base64\",\n            addresses,\n        };\n    }\n    if (signers && signers.length > 0) {\n        config.sigVerify = true;\n    }\n    const args = [encodedTransaction, config];\n    // @ts-expect-error\n    const unsafeRes = await connection._rpcRequest(\"simulateTransaction\", args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if (\"error\" in res) {\n        let logs;\n        if (\"data\" in res.error) {\n            logs = (_a = res.error.data) === null || _a === void 0 ? void 0 : _a.logs;\n            if (logs && Array.isArray(logs)) {\n                const traceIndent = \"\\n    \";\n                const logTrace = traceIndent + logs.join(traceIndent);\n                console.error(res.error.message, logTrace);\n            }\n        }\n        throw new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(\"failed to simulate transaction: \" + res.error.message, logs);\n    }\n    return res.result;\n}\n// copy from @solana/web3.js\nfunction jsonRpcResult(schema) {\n    return coerce(createRpcResult(schema), UnknownRpcResult, (value) => {\n        if (\"error\" in value) {\n            return value;\n        }\n        else {\n            return {\n                ...value,\n                result: create(value.result, schema),\n            };\n        }\n    });\n}\n// copy from @solana/web3.js\nconst UnknownRpcResult = createRpcResult(unknown());\n// copy from @solana/web3.js\nfunction createRpcResult(result) {\n    return union$1([\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            result,\n        }),\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            error: type({\n                code: unknown(),\n                message: string(),\n                data: optional(any()),\n            }),\n        }),\n    ]);\n}\n// copy from @solana/web3.js\nfunction jsonRpcResultAndContext(value) {\n    return jsonRpcResult(type({\n        context: type({\n            slot: number(),\n        }),\n        value,\n    }));\n}\n// copy from @solana/web3.js\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n    err: nullable(union$1([type({}), string()])),\n    logs: nullable(array(string())),\n    accounts: optional(nullable(array(nullable(type({\n        executable: boolean(),\n        owner: string(),\n        lamports: number(),\n        data: array(string()),\n        rentEpoch: optional(number()),\n    }))))),\n    unitsConsumed: optional(number()),\n}));\n\nvar rpc = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    invoke: invoke,\n    getMultipleAccounts: getMultipleAccounts,\n    getMultipleAccountsAndContext: getMultipleAccountsAndContext,\n    simulateTransaction: simulateTransaction\n});\n\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n */\nclass AnchorProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, wallet, opts = AnchorProvider.defaultOptions()) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.publicKey = wallet === null || wallet === void 0 ? void 0 : wallet.publicKey;\n    }\n    static defaultOptions() {\n        return {\n            preflightCommitment: \"processed\",\n            commitment: \"processed\",\n        };\n    }\n    /**\n     * Returns a `Provider` with a wallet read from the local filesystem.\n     *\n     * @param url  The network cluster url.\n     * @param opts The default transaction confirmation options.\n     *\n     * (This api is for Node only.)\n     */\n    static local(url, opts = AnchorProvider.defaultOptions()) {\n        {\n            throw new Error(`Provider local is not available on browser.`);\n        }\n    }\n    /**\n     * Returns a `Provider` read from the `ANCHOR_PROVIDER_URL` environment\n     * variable\n     *\n     * (This api is for Node only.)\n     */\n    static env() {\n        {\n            throw new Error(`Provider env is not available on browser.`);\n        }\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sendAndConfirm(tx, signers, opts) {\n        var _a, _b, _c, _d;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n            }\n        }\n        else {\n            tx.feePayer = (_a = tx.feePayer) !== null && _a !== void 0 ? _a : this.wallet.publicKey;\n            tx.recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n            if (signers) {\n                for (const signer of signers) {\n                    tx.partialSign(signer);\n                }\n            }\n        }\n        tx = await this.wallet.signTransaction(tx);\n        const rawTx = tx.serialize();\n        try {\n            return await sendAndConfirmRawTransaction(this.connection, rawTx, opts);\n        }\n        catch (err) {\n            // thrown if the underlying 'confirmTransaction' encounters a failed tx\n            // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n            if (err instanceof ConfirmError) {\n                // choose the shortest available commitment for 'getTransaction'\n                // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                // commitment `sendAndConfirmRawTransaction` used\n                const txSig = encode$1(isVersionedTransaction(tx)\n                    ? ((_b = tx.signatures) === null || _b === void 0 ? void 0 : _b[0]) || new Uint8Array()\n                    : (_c = tx.signature) !== null && _c !== void 0 ? _c : new Uint8Array());\n                const maxVer = isVersionedTransaction(tx) ? 0 : undefined;\n                const failedTx = await this.connection.getTransaction(txSig, {\n                    commitment: \"confirmed\",\n                    maxSupportedTransactionVersion: maxVer,\n                });\n                if (!failedTx) {\n                    throw err;\n                }\n                else {\n                    const logs = (_d = failedTx.meta) === null || _d === void 0 ? void 0 : _d.logMessages;\n                    throw !logs ? err : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(err.message, logs);\n                }\n            }\n            else {\n                throw err;\n            }\n        }\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     * All transactions need to be of the same type, it doesn't support a mix of `VersionedTransaction`s and `Transaction`s.\n     *\n     * @param txWithSigners Array of transactions and signers.\n     * @param opts          Transaction confirmation options.\n     */\n    async sendAll(txWithSigners, opts) {\n        var _a, _b, _c;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        const recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n        let txs = txWithSigners.map((r) => {\n            var _a, _b;\n            if (isVersionedTransaction(r.tx)) {\n                let tx = r.tx;\n                if (r.signers) {\n                    tx.sign(r.signers);\n                }\n                return tx;\n            }\n            else {\n                let tx = r.tx;\n                let signers = (_a = r.signers) !== null && _a !== void 0 ? _a : [];\n                tx.feePayer = (_b = tx.feePayer) !== null && _b !== void 0 ? _b : this.wallet.publicKey;\n                tx.recentBlockhash = recentBlockhash;\n                signers.forEach((kp) => {\n                    tx.partialSign(kp);\n                });\n                return tx;\n            }\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        const sigs = [];\n        for (let k = 0; k < txs.length; k += 1) {\n            const tx = signedTxs[k];\n            const rawTx = tx.serialize();\n            try {\n                sigs.push(await sendAndConfirmRawTransaction(this.connection, rawTx, opts));\n            }\n            catch (err) {\n                // thrown if the underlying 'confirmTransaction' encounters a failed tx\n                // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n                if (err instanceof ConfirmError) {\n                    // choose the shortest available commitment for 'getTransaction'\n                    // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                    // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                    // commitment `sendAndConfirmRawTransaction` used\n                    const txSig = encode$1(isVersionedTransaction(tx)\n                        ? ((_a = tx.signatures) === null || _a === void 0 ? void 0 : _a[0]) || new Uint8Array()\n                        : (_b = tx.signature) !== null && _b !== void 0 ? _b : new Uint8Array());\n                    const maxVer = isVersionedTransaction(tx) ? 0 : undefined;\n                    const failedTx = await this.connection.getTransaction(txSig, {\n                        commitment: \"confirmed\",\n                        maxSupportedTransactionVersion: maxVer,\n                    });\n                    if (!failedTx) {\n                        throw err;\n                    }\n                    else {\n                        const logs = (_c = failedTx.meta) === null || _c === void 0 ? void 0 : _c.logMessages;\n                        throw !logs ? err : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(err.message, logs);\n                    }\n                }\n                else {\n                    throw err;\n                }\n            }\n        }\n        return sigs;\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction. If unset, the transaction\n     *                will be simulated with the \"sigVerify: false\" option. This\n     *                allows for simulation of transactions without asking the\n     *                wallet for a signature.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, commitment, includeAccounts) {\n        let recentBlockhash = (await this.connection.getLatestBlockhash(commitment !== null && commitment !== void 0 ? commitment : this.connection.commitment)).blockhash;\n        let result;\n        if (isVersionedTransaction(tx)) {\n            if (signers && signers.length > 0) {\n                tx.sign(signers);\n                tx = await this.wallet.signTransaction(tx);\n            }\n            // Doesn't support includeAccounts which has been changed to something\n            // else in later versions of this function.\n            result = await this.connection.simulateTransaction(tx, { commitment });\n        }\n        else {\n            tx.feePayer = tx.feePayer || this.wallet.publicKey;\n            tx.recentBlockhash = recentBlockhash;\n            if (signers && signers.length > 0) {\n                tx = await this.wallet.signTransaction(tx);\n            }\n            result = await simulateTransaction(this.connection, tx, signers, commitment, includeAccounts);\n        }\n        if (result.value.err) {\n            throw new SimulateError(result.value);\n        }\n        return result.value;\n    }\n}\nclass SimulateError extends Error {\n    constructor(simulationResponse, message) {\n        super(message);\n        this.simulationResponse = simulationResponse;\n    }\n}\n// Copy of Connection.sendAndConfirmRawTransaction that throws\n// a better error if 'confirmTransaction` returns an error status\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, options) {\n    const sendOptions = options && {\n        skipPreflight: options.skipPreflight,\n        preflightCommitment: options.preflightCommitment || options.commitment,\n    };\n    const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n    const status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n    if (status.err) {\n        throw new ConfirmError(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n    }\n    return signature;\n}\nclass ConfirmError extends Error {\n    constructor(message) {\n        super(message);\n    }\n}\n/**\n * Sets the default provider on the client.\n */\nfunction setProvider(provider) {\n    _provider = provider;\n}\n/**\n * Returns the default provider being used by the client.\n */\nfunction getProvider() {\n    if (_provider === null) {\n        return AnchorProvider.local();\n    }\n    return _provider;\n}\n// Global provider used as the default when a provider is not given.\nlet _provider = null;\n\nvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof __webpack_require__.g !== 'undefined' ? __webpack_require__.g : typeof self !== 'undefined' ? self : {};\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\nvar dist = {};\n\n// Instruction errors.\nObject.defineProperty(dist, \"__esModule\", { value: true });\nvar ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = ANCHOR_ERROR__REQUIRE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_VIOLATED = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = dist.ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = ANCHOR_ERROR__CONSTRAINT_SPACE = dist.ANCHOR_ERROR__CONSTRAINT_SPACE = ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = ANCHOR_ERROR__CONSTRAINT_ZERO = dist.ANCHOR_ERROR__CONSTRAINT_ZERO = ANCHOR_ERROR__CONSTRAINT_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_ADDRESS = ANCHOR_ERROR__CONSTRAINT_CLOSE = dist.ANCHOR_ERROR__CONSTRAINT_CLOSE = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = ANCHOR_ERROR__CONSTRAINT_STATE = dist.ANCHOR_ERROR__CONSTRAINT_STATE = ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = dist.ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = ANCHOR_ERROR__CONSTRAINT_SEEDS = dist.ANCHOR_ERROR__CONSTRAINT_SEEDS = ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = dist.ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = ANCHOR_ERROR__CONSTRAINT_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_OWNER = ANCHOR_ERROR__CONSTRAINT_RAW = dist.ANCHOR_ERROR__CONSTRAINT_RAW = ANCHOR_ERROR__CONSTRAINT_SIGNER = dist.ANCHOR_ERROR__CONSTRAINT_SIGNER = ANCHOR_ERROR__CONSTRAINT_HAS_ONE = dist.ANCHOR_ERROR__CONSTRAINT_HAS_ONE = ANCHOR_ERROR__CONSTRAINT_MUT = dist.ANCHOR_ERROR__CONSTRAINT_MUT = ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = dist.ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = dist.ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = dist.ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = ANCHOR_ERROR__IDL_INSTRUCTION_STUB = dist.ANCHOR_ERROR__IDL_INSTRUCTION_STUB = ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = dist.ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = ANCHOR_ERROR__INSTRUCTION_MISSING = dist.ANCHOR_ERROR__INSTRUCTION_MISSING = void 0;\nvar ANCHOR_ERROR__DEPRECATED = dist.ANCHOR_ERROR__DEPRECATED = ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = dist.ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = dist.ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = dist.ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = dist.ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = dist.ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = dist.ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = dist.ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = dist.ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = dist.ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = dist.ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = dist.ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = ANCHOR_ERROR__INVALID_PROGRAM_ID = dist.ANCHOR_ERROR__INVALID_PROGRAM_ID = ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = dist.ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = dist.ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = dist.ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = ANCHOR_ERROR__REQUIRE_GT_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GT_VIOLATED = ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = void 0;\n/** 8 byte instruction identifier not provided. */\nvar ANCHOR_ERROR__INSTRUCTION_MISSING = dist.ANCHOR_ERROR__INSTRUCTION_MISSING = 100;\n/** Fallback functions are not supported. */\nvar ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = dist.ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND = 101;\n/** The program could not deserialize the given instruction. */\nvar ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE = 102;\n/** The program could not serialize the given instruction. */\nvar ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE = 103;\n// IDL instruction errors.\n/** The program was compiled without idl instructions. */\nvar ANCHOR_ERROR__IDL_INSTRUCTION_STUB = dist.ANCHOR_ERROR__IDL_INSTRUCTION_STUB = 1000;\n/** The transaction was given an invalid program for the IDL instruction. */\nvar ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = dist.ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM = 1001;\n/** IDL account must be empty in order to resize, try closing first. */\nvar ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = dist.ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY = 1002;\n// Event instructions.\n/** The program was compiled without `event-cpi` feature. */\nvar ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = dist.ANCHOR_ERROR__EVENT_INSTRUCTION_STUB = 1500;\n// Constraint errors.\n/** A mut constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MUT = dist.ANCHOR_ERROR__CONSTRAINT_MUT = 2000;\n/** A has one constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_HAS_ONE = dist.ANCHOR_ERROR__CONSTRAINT_HAS_ONE = 2001;\n/** A signer constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SIGNER = dist.ANCHOR_ERROR__CONSTRAINT_SIGNER = 2002;\n/** A raw constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_RAW = dist.ANCHOR_ERROR__CONSTRAINT_RAW = 2003;\n/** An owner constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_OWNER = 2004;\n/** A rent exemption constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = dist.ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT = 2005;\n/** A seeds constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SEEDS = dist.ANCHOR_ERROR__CONSTRAINT_SEEDS = 2006;\n/** An executable constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = dist.ANCHOR_ERROR__CONSTRAINT_EXECUTABLE = 2007;\n/** Deprecated Error, feel free to replace with something else. */\nvar ANCHOR_ERROR__CONSTRAINT_STATE = dist.ANCHOR_ERROR__CONSTRAINT_STATE = 2008;\n/** An associated constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED = 2009;\n/** An associated init constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT = 2010;\n/** A close constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_CLOSE = dist.ANCHOR_ERROR__CONSTRAINT_CLOSE = 2011;\n/** An address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_ADDRESS = 2012;\n/** Expected zero account discriminant. */\nvar ANCHOR_ERROR__CONSTRAINT_ZERO = dist.ANCHOR_ERROR__CONSTRAINT_ZERO = 2013;\n/** A token mint constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT = 2014;\n/** A token owner constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER = 2015;\n/** A mint mint authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY = 2016;\n/** A mint freeze authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY = 2017;\n/** A mint decimals constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS = 2018;\n/** A space constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_SPACE = dist.ANCHOR_ERROR__CONSTRAINT_SPACE = 2019;\n/** A required account for the constraint is None. */\nvar ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = dist.ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE = 2020;\n/** A token account token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM = 2021;\n/** A mint token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM = 2022;\n/** An associated token account token program constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = dist.ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM = 2023;\n/** A group pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION = 2024;\n/** A group pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY = 2025;\n/** A group pointer extension group address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS = 2026;\n/** A group member pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION = 2027;\n/** A group member pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY = 2028;\n/** A group member pointer extension group address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS = 2029;\n/** A metadata pointer extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION = 2030;\n/** A metadata pointer extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY = 2031;\n/** A metadata pointer extension metadata address constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = dist.ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS = 2032;\n/** A close authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION = 2033;\n/** A close authority extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY = 2034;\n/** A permanent delegate extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION = 2035;\n/** A permanent delegate extension delegate constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = dist.ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE = 2036;\n/** A transfer hook extension constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION = 2037;\n/** A transfer hook extension authority constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY = 2038;\n/** A transfer hook extension transfer hook program id constraint was violated. */\nvar ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = dist.ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID = 2039;\n// Require errors.\n/** A require expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_VIOLATED = 2500;\n/** A require_eq expression was violated. */\nANCHOR_ERROR__REQUIRE_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_EQ_VIOLATED = 2501;\n/** A require_keys_eq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED = 2502;\n/** A require_neq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED = 2503;\n/** A require_keys_neq expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED = 2504;\n/** A require_gt expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_GT_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GT_VIOLATED = 2505;\n/** A require_gte expression was violated. */\nvar ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = dist.ANCHOR_ERROR__REQUIRE_GTE_VIOLATED = 2506;\n// Account errors.\n/** The account discriminator was already set on this account. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET = 3000;\n/** No 8 byte discriminator was found on the account. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND = 3001;\n/** 8 byte discriminator did not match what was expected. */\nvar ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH = 3002;\n/** Failed to deserialize the account. */\nvar ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE = 3003;\n/** Failed to serialize the account. */\nvar ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = dist.ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE = 3004;\n/** Not enough account keys given to the instruction. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = dist.ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS = 3005;\n/** The given account is not mutable. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = dist.ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE = 3006;\n/** The given account is owned by a different program than expected. */\nvar ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = dist.ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM = 3007;\n/** Program ID was not as expected. */\nvar ANCHOR_ERROR__INVALID_PROGRAM_ID = dist.ANCHOR_ERROR__INVALID_PROGRAM_ID = 3008;\n/** Program account is not executable. */\nvar ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = dist.ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE = 3009;\n/** The given account did not sign. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = dist.ANCHOR_ERROR__ACCOUNT_NOT_SIGNER = 3010;\n/** The given account is not owned by the system program. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = dist.ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED = 3011;\n/** The program expected this account to be already initialized. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = dist.ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED = 3012;\n/** The given account is not a program data account. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = dist.ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA = 3013;\n/** The given account is not the associated token account. */\nvar ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = dist.ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT = 3014;\n/** The given public key does not match the required sysvar. */\nvar ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = dist.ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH = 3015;\n/** The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit. */\nvar ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = dist.ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT = 3016;\n/** The account was duplicated for more than one reallocation. */\nvar ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = dist.ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS = 3017;\n// Miscellaneous errors.\n/** The declared program id does not match the actual program id. */\nvar ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = dist.ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH = 4100;\n/** You cannot/should not initialize the payer account as a program account. */\nvar ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = dist.ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT = 4101;\n/** The program could not perform the numeric conversion, out of range integral type conversion attempted. */\nvar ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = dist.ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION = 4102;\n// Deprecated errors.\n/** The API being used is deprecated and should no longer be used. */\nANCHOR_ERROR__DEPRECATED = dist.ANCHOR_ERROR__DEPRECATED = 5000;\n\nconst _AVAILABLE_FEATURES = new Set([\"debug-logs\"]);\nconst _FEATURES = new Map();\nfunction set(key) {\n    if (!_AVAILABLE_FEATURES.has(key)) {\n        throw new Error(\"Invalid feature\");\n    }\n    _FEATURES.set(key, true);\n}\nfunction isSet(key) {\n    return _FEATURES.get(key) !== undefined;\n}\n\nvar features = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    set: set,\n    isSet: isSet\n});\n\nclass IdlError extends Error {\n    constructor(message) {\n        super(message);\n        this.name = \"IdlError\";\n    }\n}\nclass ProgramErrorStack {\n    constructor(stack) {\n        this.stack = stack;\n    }\n    static parse(logs) {\n        var _a;\n        const programKeyRegex = /^Program (\\w*) invoke/;\n        const successRegex = /^Program \\w* success/;\n        const programStack = [];\n        for (let i = 0; i < logs.length; i++) {\n            if (successRegex.exec(logs[i])) {\n                programStack.pop();\n                continue;\n            }\n            const programKey = (_a = programKeyRegex.exec(logs[i])) === null || _a === void 0 ? void 0 : _a[1];\n            if (!programKey) {\n                continue;\n            }\n            programStack.push(new PublicKey(programKey));\n        }\n        return new ProgramErrorStack(programStack);\n    }\n}\nclass AnchorError extends Error {\n    constructor(errorCode, errorMessage, errorLogs, logs, origin, comparedValues) {\n        super(errorLogs.join(\"\\n\").replace(\"Program log: \", \"\"));\n        this.errorLogs = errorLogs;\n        this.logs = logs;\n        this.error = { errorCode, errorMessage, comparedValues, origin };\n        this._programErrorStack = ProgramErrorStack.parse(logs);\n    }\n    static parse(logs) {\n        if (!logs) {\n            return null;\n        }\n        const anchorErrorLogIndex = logs.findIndex((log) => log.startsWith(\"Program log: AnchorError\"));\n        if (anchorErrorLogIndex === -1) {\n            return null;\n        }\n        const anchorErrorLog = logs[anchorErrorLogIndex];\n        const errorLogs = [anchorErrorLog];\n        let comparedValues;\n        if (anchorErrorLogIndex + 1 < logs.length) {\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left:\n            // <Pubkey>\n            // Right:\n            // <Pubkey>\n            if (logs[anchorErrorLogIndex + 1] === \"Program log: Left:\") {\n                const pubkeyRegex = /^Program log: (.*)$/;\n                const leftPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 2])[1];\n                const rightPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 4])[1];\n                comparedValues = [\n                    new PublicKey(leftPubkey),\n                    new PublicKey(rightPubkey),\n                ];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 5));\n            }\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left: <value>\n            // Right: <value>\n            else if (logs[anchorErrorLogIndex + 1].startsWith(\"Program log: Left:\")) {\n                const valueRegex = /^Program log: (Left|Right): (.*)$/;\n                const leftValue = valueRegex.exec(logs[anchorErrorLogIndex + 1])[2];\n                const rightValue = valueRegex.exec(logs[anchorErrorLogIndex + 2])[2];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 3));\n                comparedValues = [leftValue, rightValue];\n            }\n        }\n        const regexNoInfo = /^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const noInfoAnchorErrorLog = regexNoInfo.exec(anchorErrorLog);\n        const regexFileLine = /^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const fileLineAnchorErrorLog = regexFileLine.exec(anchorErrorLog);\n        const regexAccountName = /^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const accountNameAnchorErrorLog = regexAccountName.exec(anchorErrorLog);\n        if (noInfoAnchorErrorLog) {\n            const [errorCodeString, errorNumber, errorMessage] = noInfoAnchorErrorLog.slice(1, 4);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, undefined, comparedValues);\n        }\n        else if (fileLineAnchorErrorLog) {\n            const [file, line, errorCodeString, errorNumber, errorMessage] = fileLineAnchorErrorLog.slice(1, 6);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            const fileLine = { file, line: parseInt(line) };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, fileLine, comparedValues);\n        }\n        else if (accountNameAnchorErrorLog) {\n            const [accountName, errorCodeString, errorNumber, errorMessage] = accountNameAnchorErrorLog.slice(1, 5);\n            const origin = accountName;\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, origin, comparedValues);\n        }\n        else {\n            return null;\n        }\n    }\n    get program() {\n        return this._programErrorStack.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        return this._programErrorStack.stack;\n    }\n    toString() {\n        return this.message;\n    }\n}\n// An error from a user defined program.\nclass ProgramError extends Error {\n    constructor(code, msg, logs) {\n        super();\n        this.code = code;\n        this.msg = msg;\n        this.logs = logs;\n        if (logs) {\n            this._programErrorStack = ProgramErrorStack.parse(logs);\n        }\n    }\n    static parse(err, idlErrors) {\n        const errString = err.toString();\n        // TODO: don't rely on the error string. web3.js should preserve the error\n        //       code information instead of giving us an untyped string.\n        let unparsedErrorCode;\n        if (errString.includes(\"custom program error:\")) {\n            let components = errString.split(\"custom program error: \");\n            if (components.length !== 2) {\n                return null;\n            }\n            else {\n                unparsedErrorCode = components[1];\n            }\n        }\n        else {\n            const matches = errString.match(/\"Custom\":([0-9]+)}/g);\n            if (!matches || matches.length > 1) {\n                return null;\n            }\n            unparsedErrorCode = matches[0].match(/([0-9]+)/g)[0];\n        }\n        let errorCode;\n        try {\n            errorCode = parseInt(unparsedErrorCode);\n        }\n        catch (parseErr) {\n            return null;\n        }\n        // Parse user error.\n        let errorMsg = idlErrors.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Parse framework internal error.\n        errorMsg = LangErrorMessage.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Unable to parse the error. Just return the untranslated error.\n        return null;\n    }\n    get program() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack;\n    }\n    toString() {\n        return this.msg;\n    }\n}\nfunction translateError(err, idlErrors) {\n    if (isSet(\"debug-logs\")) {\n        console.log(\"Translating error:\", err);\n    }\n    const anchorError = AnchorError.parse(err.logs);\n    if (anchorError) {\n        return anchorError;\n    }\n    const programError = ProgramError.parse(err, idlErrors);\n    if (programError) {\n        return programError;\n    }\n    if (err.logs) {\n        const handler = {\n            get: function (target, prop) {\n                if (prop === \"programErrorStack\") {\n                    return target.programErrorStack.stack;\n                }\n                else if (prop === \"program\") {\n                    return target.programErrorStack.stack[err.programErrorStack.stack.length - 1];\n                }\n                else {\n                    // this is the normal way to return all other props\n                    // without modifying them.\n                    // @ts-expect-error\n                    return Reflect.get(...arguments);\n                }\n            },\n        };\n        err.programErrorStack = ProgramErrorStack.parse(err.logs);\n        return new Proxy(err, handler);\n    }\n    return err;\n}\nconst LangErrorCode = {\n    // Instructions.\n    InstructionMissing: ANCHOR_ERROR__INSTRUCTION_MISSING,\n    InstructionFallbackNotFound: ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND,\n    InstructionDidNotDeserialize: ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE,\n    InstructionDidNotSerialize: ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE,\n    // IDL instructions.\n    IdlInstructionStub: ANCHOR_ERROR__IDL_INSTRUCTION_STUB,\n    IdlInstructionInvalidProgram: ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM,\n    IdlAccountNotEmpty: ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY,\n    // Event instructions.\n    EventInstructionStub: ANCHOR_ERROR__EVENT_INSTRUCTION_STUB,\n    // Constraints.\n    ConstraintMut: ANCHOR_ERROR__CONSTRAINT_MUT,\n    ConstraintHasOne: ANCHOR_ERROR__CONSTRAINT_HAS_ONE,\n    ConstraintSigner: ANCHOR_ERROR__CONSTRAINT_SIGNER,\n    ConstraintRaw: ANCHOR_ERROR__CONSTRAINT_RAW,\n    ConstraintOwner: ANCHOR_ERROR__CONSTRAINT_OWNER,\n    ConstraintRentExempt: ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT,\n    ConstraintSeeds: ANCHOR_ERROR__CONSTRAINT_SEEDS,\n    ConstraintExecutable: ANCHOR_ERROR__CONSTRAINT_EXECUTABLE,\n    ConstraintState: ANCHOR_ERROR__CONSTRAINT_STATE,\n    ConstraintAssociated: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED,\n    ConstraintAssociatedInit: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT,\n    ConstraintClose: ANCHOR_ERROR__CONSTRAINT_CLOSE,\n    ConstraintAddress: ANCHOR_ERROR__CONSTRAINT_ADDRESS,\n    ConstraintZero: ANCHOR_ERROR__CONSTRAINT_ZERO,\n    ConstraintTokenMint: ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT,\n    ConstraintTokenOwner: ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER,\n    ConstraintMintMintAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY,\n    ConstraintMintFreezeAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY,\n    ConstraintMintDecimals: ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS,\n    ConstraintSpace: ANCHOR_ERROR__CONSTRAINT_SPACE,\n    ConstraintAccountIsNone: ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE,\n    ConstraintTokenTokenProgram: ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM,\n    ConstraintMintTokenProgram: ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM,\n    ConstraintAssociatedTokenTokenProgram: ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM,\n    ConstraintMintGroupPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION,\n    ConstraintMintGroupPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintGroupPointerExtensionGroupAddress: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS,\n    ConstraintMintGroupMemberPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION,\n    ConstraintMintGroupMemberPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintGroupMemberPointerExtensionMemberAddress: ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS,\n    ConstraintMintMetadataPointerExtension: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION,\n    ConstraintMintMetadataPointerExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY,\n    ConstraintMintMetadataPointerExtensionMetadataAddress: ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS,\n    ConstraintMintCloseAuthorityExtension: ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION,\n    ConstraintMintCloseAuthorityExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY,\n    ConstraintMintPermanentDelegateExtension: ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION,\n    ConstraintMintPermanentDelegateExtensionDelegate: ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE,\n    ConstraintMintTransferHookExtension: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION,\n    ConstraintMintTransferHookExtensionAuthority: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY,\n    ConstraintMintTransferHookExtensionProgramId: ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID,\n    // Require.\n    RequireViolated: ANCHOR_ERROR__REQUIRE_VIOLATED,\n    RequireEqViolated: ANCHOR_ERROR__REQUIRE_EQ_VIOLATED,\n    RequireKeysEqViolated: ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED,\n    RequireNeqViolated: ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED,\n    RequireKeysNeqViolated: ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED,\n    RequireGtViolated: ANCHOR_ERROR__REQUIRE_GT_VIOLATED,\n    RequireGteViolated: ANCHOR_ERROR__REQUIRE_GTE_VIOLATED,\n    // Accounts.\n    AccountDiscriminatorAlreadySet: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET,\n    AccountDiscriminatorNotFound: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND,\n    AccountDiscriminatorMismatch: ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH,\n    AccountDidNotDeserialize: ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE,\n    AccountDidNotSerialize: ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE,\n    AccountNotEnoughKeys: ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS,\n    AccountNotMutable: ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE,\n    AccountOwnedByWrongProgram: ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM,\n    InvalidProgramId: ANCHOR_ERROR__INVALID_PROGRAM_ID,\n    InvalidProgramExecutable: ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE,\n    AccountNotSigner: ANCHOR_ERROR__ACCOUNT_NOT_SIGNER,\n    AccountNotSystemOwned: ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED,\n    AccountNotInitialized: ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED,\n    AccountNotProgramData: ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA,\n    AccountNotAssociatedTokenAccount: ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT,\n    AccountSysvarMismatch: ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH,\n    AccountReallocExceedsLimit: ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT,\n    AccountDuplicateReallocs: ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS,\n    // Miscellaneous\n    DeclaredProgramIdMismatch: ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH,\n    TryingToInitPayerAsProgramAccount: ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT,\n    InvalidNumericConversion: ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION,\n    // Used for APIs that shouldn't be used anymore.\n    Deprecated: ANCHOR_ERROR__DEPRECATED,\n};\nconst LangErrorMessage = new Map([\n    // Instructions.\n    [\n        LangErrorCode.InstructionMissing,\n        \"8 byte instruction identifier not provided\",\n    ],\n    [\n        LangErrorCode.InstructionFallbackNotFound,\n        \"Fallback functions are not supported\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotDeserialize,\n        \"The program could not deserialize the given instruction\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotSerialize,\n        \"The program could not serialize the given instruction\",\n    ],\n    // Idl instructions.\n    [\n        LangErrorCode.IdlInstructionStub,\n        \"The program was compiled without idl instructions\",\n    ],\n    [\n        LangErrorCode.IdlInstructionInvalidProgram,\n        \"The transaction was given an invalid program for the IDL instruction\",\n    ],\n    [\n        LangErrorCode.IdlAccountNotEmpty,\n        \"IDL account must be empty in order to resize, try closing first\",\n    ],\n    // Event instructions.\n    [\n        LangErrorCode.EventInstructionStub,\n        \"The program was compiled without `event-cpi` feature\",\n    ],\n    // Constraints.\n    [LangErrorCode.ConstraintMut, \"A mut constraint was violated\"],\n    [LangErrorCode.ConstraintHasOne, \"A has one constraint was violated\"],\n    [LangErrorCode.ConstraintSigner, \"A signer constraint was violated\"],\n    [LangErrorCode.ConstraintRaw, \"A raw constraint was violated\"],\n    [LangErrorCode.ConstraintOwner, \"An owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintRentExempt,\n        \"A rent exemption constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSeeds, \"A seeds constraint was violated\"],\n    [LangErrorCode.ConstraintExecutable, \"An executable constraint was violated\"],\n    [\n        LangErrorCode.ConstraintState,\n        \"Deprecated Error, feel free to replace with something else\",\n    ],\n    [LangErrorCode.ConstraintAssociated, \"An associated constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAssociatedInit,\n        \"An associated init constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintClose, \"A close constraint was violated\"],\n    [LangErrorCode.ConstraintAddress, \"An address constraint was violated\"],\n    [LangErrorCode.ConstraintZero, \"Expected zero account discriminant\"],\n    [LangErrorCode.ConstraintTokenMint, \"A token mint constraint was violated\"],\n    [LangErrorCode.ConstraintTokenOwner, \"A token owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintMintMintAuthority,\n        \"A mint mint authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintFreezeAuthority,\n        \"A mint freeze authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintDecimals,\n        \"A mint decimals constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSpace, \"A space constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAccountIsNone,\n        \"A required account for the constraint is None\",\n    ],\n    [\n        LangErrorCode.ConstraintTokenTokenProgram,\n        \"A token account token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTokenProgram,\n        \"A mint token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintAssociatedTokenTokenProgram,\n        \"An associated token account token program constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtension,\n        \"A group pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtensionAuthority,\n        \"A group pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupPointerExtensionGroupAddress,\n        \"A group pointer extension group address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtension,\n        \"A group member pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtensionAuthority,\n        \"A group member pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintGroupMemberPointerExtensionMemberAddress,\n        \"A group member pointer extension group address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtension,\n        \"A metadata pointer extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtensionAuthority,\n        \"A metadata pointer extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintMetadataPointerExtensionMetadataAddress,\n        \"A metadata pointer extension metadata address constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintCloseAuthorityExtension,\n        \"A close authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintCloseAuthorityExtensionAuthority,\n        \"A close authority extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintPermanentDelegateExtension,\n        \"A permanent delegate extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintPermanentDelegateExtensionDelegate,\n        \"A permanent delegate extension delegate constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtension,\n        \"A transfer hook extension constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtensionAuthority,\n        \"A transfer hook extension authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintTransferHookExtensionProgramId,\n        \"A transfer hook extension transfer hook program id constraint was violated\",\n    ],\n    // Require.\n    [LangErrorCode.RequireViolated, \"A require expression was violated\"],\n    [LangErrorCode.RequireEqViolated, \"A require_eq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysEqViolated,\n        \"A require_keys_eq expression was violated\",\n    ],\n    [LangErrorCode.RequireNeqViolated, \"A require_neq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysNeqViolated,\n        \"A require_keys_neq expression was violated\",\n    ],\n    [LangErrorCode.RequireGtViolated, \"A require_gt expression was violated\"],\n    [LangErrorCode.RequireGteViolated, \"A require_gte expression was violated\"],\n    // Accounts.\n    [\n        LangErrorCode.AccountDiscriminatorAlreadySet,\n        \"The account discriminator was already set on this account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorNotFound,\n        \"No 8 byte discriminator was found on the account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorMismatch,\n        \"8 byte discriminator did not match what was expected\",\n    ],\n    [LangErrorCode.AccountDidNotDeserialize, \"Failed to deserialize the account\"],\n    [LangErrorCode.AccountDidNotSerialize, \"Failed to serialize the account\"],\n    [\n        LangErrorCode.AccountNotEnoughKeys,\n        \"Not enough account keys given to the instruction\",\n    ],\n    [LangErrorCode.AccountNotMutable, \"The given account is not mutable\"],\n    [\n        LangErrorCode.AccountOwnedByWrongProgram,\n        \"The given account is owned by a different program than expected\",\n    ],\n    [LangErrorCode.InvalidProgramId, \"Program ID was not as expected\"],\n    [LangErrorCode.InvalidProgramExecutable, \"Program account is not executable\"],\n    [LangErrorCode.AccountNotSigner, \"The given account did not sign\"],\n    [\n        LangErrorCode.AccountNotSystemOwned,\n        \"The given account is not owned by the system program\",\n    ],\n    [\n        LangErrorCode.AccountNotInitialized,\n        \"The program expected this account to be already initialized\",\n    ],\n    [\n        LangErrorCode.AccountNotProgramData,\n        \"The given account is not a program data account\",\n    ],\n    [\n        LangErrorCode.AccountNotAssociatedTokenAccount,\n        \"The given account is not the associated token account\",\n    ],\n    [\n        LangErrorCode.AccountSysvarMismatch,\n        \"The given public key does not match the required sysvar\",\n    ],\n    [\n        LangErrorCode.AccountReallocExceedsLimit,\n        \"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\",\n    ],\n    [\n        LangErrorCode.AccountDuplicateReallocs,\n        \"The account was duplicated for more than one reallocation\",\n    ],\n    // Miscellaneous\n    [\n        LangErrorCode.DeclaredProgramIdMismatch,\n        \"The declared program id does not match the actual program id\",\n    ],\n    [\n        LangErrorCode.TryingToInitPayerAsProgramAccount,\n        \"You cannot/should not initialize the payer account as a program account\",\n    ],\n    [\n        LangErrorCode.InvalidNumericConversion,\n        \"The program could not perform the numeric conversion, out of range integral type conversion attempted\",\n    ],\n    // Deprecated\n    [\n        LangErrorCode.Deprecated,\n        \"The API being used is deprecated and should no longer be used\",\n    ],\n]);\n\nclass IdlCoder {\n    static fieldLayout(field, types = [], genericArgs) {\n        const fieldName = field.name;\n        switch (field.type) {\n            case \"bool\": {\n                return borsh.bool(fieldName);\n            }\n            case \"u8\": {\n                return borsh.u8(fieldName);\n            }\n            case \"i8\": {\n                return borsh.i8(fieldName);\n            }\n            case \"u16\": {\n                return borsh.u16(fieldName);\n            }\n            case \"i16\": {\n                return borsh.i16(fieldName);\n            }\n            case \"u32\": {\n                return borsh.u32(fieldName);\n            }\n            case \"i32\": {\n                return borsh.i32(fieldName);\n            }\n            case \"f32\": {\n                return borsh.f32(fieldName);\n            }\n            case \"u64\": {\n                return borsh.u64(fieldName);\n            }\n            case \"i64\": {\n                return borsh.i64(fieldName);\n            }\n            case \"f64\": {\n                return borsh.f64(fieldName);\n            }\n            case \"u128\": {\n                return borsh.u128(fieldName);\n            }\n            case \"i128\": {\n                return borsh.i128(fieldName);\n            }\n            case \"u256\": {\n                return borsh.u256(fieldName);\n            }\n            case \"i256\": {\n                return borsh.i256(fieldName);\n            }\n            case \"bytes\": {\n                return borsh.vecU8(fieldName);\n            }\n            case \"string\": {\n                return borsh.str(fieldName);\n            }\n            case \"pubkey\": {\n                return borsh.publicKey(fieldName);\n            }\n            default: {\n                if (\"option\" in field.type) {\n                    return borsh.option(IdlCoder.fieldLayout({ type: field.type.option }, types, genericArgs), fieldName);\n                }\n                if (\"vec\" in field.type) {\n                    return borsh.vec(IdlCoder.fieldLayout({ type: field.type.vec }, types, genericArgs), fieldName);\n                }\n                if (\"array\" in field.type) {\n                    let [type, len] = field.type.array;\n                    len = IdlCoder.resolveArrayLen(len, genericArgs);\n                    return borsh.array(IdlCoder.fieldLayout({ type }, types, genericArgs), len, fieldName);\n                }\n                if (\"defined\" in field.type) {\n                    if (!types) {\n                        throw new IdlError(\"User defined types not provided\");\n                    }\n                    const definedName = field.type.defined.name;\n                    const typeDef = types.find((t) => t.name === definedName);\n                    if (!typeDef) {\n                        throw new IdlError(`Type not found: ${field.name}`);\n                    }\n                    return IdlCoder.typeDefLayout({\n                        typeDef,\n                        types,\n                        genericArgs: genericArgs !== null && genericArgs !== void 0 ? genericArgs : field.type.defined.generics,\n                        name: fieldName,\n                    });\n                }\n                if (\"generic\" in field.type) {\n                    const genericArg = genericArgs === null || genericArgs === void 0 ? void 0 : genericArgs.at(0);\n                    if ((genericArg === null || genericArg === void 0 ? void 0 : genericArg.kind) !== \"type\") {\n                        throw new IdlError(`Invalid generic field: ${field.name}`);\n                    }\n                    return IdlCoder.fieldLayout({ ...field, type: genericArg.type }, types);\n                }\n                throw new IdlError(`Not yet implemented: ${JSON.stringify(field.type)}`);\n            }\n        }\n    }\n    /**\n     * Get the type layout of the given defined type(struct or enum).\n     */\n    static typeDefLayout({ typeDef, types, name, genericArgs, }) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const fieldLayouts = handleDefinedFields(typeDef.type.fields, () => [], (fields) => fields.map((f) => {\n                    const genArgs = genericArgs\n                        ? IdlCoder.resolveGenericArgs({\n                            type: f.type,\n                            typeDef,\n                            genericArgs,\n                        })\n                        : genericArgs;\n                    return IdlCoder.fieldLayout(f, types, genArgs);\n                }), (fields) => fields.map((f, i) => {\n                    const genArgs = genericArgs\n                        ? IdlCoder.resolveGenericArgs({\n                            type: f,\n                            typeDef,\n                            genericArgs,\n                        })\n                        : genericArgs;\n                    return IdlCoder.fieldLayout({ name: i.toString(), type: f }, types, genArgs);\n                }));\n                return borsh.struct(fieldLayouts, name);\n            }\n            case \"enum\": {\n                const variants = typeDef.type.variants.map((variant) => {\n                    const fieldLayouts = handleDefinedFields(variant.fields, () => [], (fields) => fields.map((f) => {\n                        const genArgs = genericArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type: f.type,\n                                typeDef,\n                                genericArgs,\n                            })\n                            : genericArgs;\n                        return IdlCoder.fieldLayout(f, types, genArgs);\n                    }), (fields) => fields.map((f, i) => {\n                        const genArgs = genericArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type: f,\n                                typeDef,\n                                genericArgs,\n                            })\n                            : genericArgs;\n                        return IdlCoder.fieldLayout({ name: i.toString(), type: f }, types, genArgs);\n                    }));\n                    return borsh.struct(fieldLayouts, variant.name);\n                });\n                if (name !== undefined) {\n                    // Buffer-layout lib requires the name to be null (on construction)\n                    // when used as a field.\n                    return borsh.rustEnum(variants).replicate(name);\n                }\n                return borsh.rustEnum(variants, name);\n            }\n            case \"type\": {\n                return IdlCoder.fieldLayout({ type: typeDef.type.alias, name }, types);\n            }\n        }\n    }\n    /**\n     * Get the type of the size in bytes. Returns `1` for variable length types.\n     */\n    static typeSize(ty, idl, genericArgs) {\n        var _a;\n        switch (ty) {\n            case \"bool\":\n                return 1;\n            case \"u8\":\n                return 1;\n            case \"i8\":\n                return 1;\n            case \"i16\":\n                return 2;\n            case \"u16\":\n                return 2;\n            case \"u32\":\n                return 4;\n            case \"i32\":\n                return 4;\n            case \"f32\":\n                return 4;\n            case \"u64\":\n                return 8;\n            case \"i64\":\n                return 8;\n            case \"f64\":\n                return 8;\n            case \"u128\":\n                return 16;\n            case \"i128\":\n                return 16;\n            case \"u256\":\n                return 32;\n            case \"i256\":\n                return 32;\n            case \"bytes\":\n                return 1;\n            case \"string\":\n                return 1;\n            case \"pubkey\":\n                return 32;\n            default:\n                if (\"option\" in ty) {\n                    return 1 + IdlCoder.typeSize(ty.option, idl, genericArgs);\n                }\n                if (\"coption\" in ty) {\n                    return 4 + IdlCoder.typeSize(ty.coption, idl, genericArgs);\n                }\n                if (\"vec\" in ty) {\n                    return 1;\n                }\n                if (\"array\" in ty) {\n                    let [type, len] = ty.array;\n                    len = IdlCoder.resolveArrayLen(len, genericArgs);\n                    return IdlCoder.typeSize(type, idl, genericArgs) * len;\n                }\n                if (\"defined\" in ty) {\n                    const typeDef = (_a = idl.types) === null || _a === void 0 ? void 0 : _a.find((t) => t.name === ty.defined.name);\n                    if (!typeDef) {\n                        throw new IdlError(`Type not found: ${JSON.stringify(ty)}`);\n                    }\n                    const typeSize = (type) => {\n                        const genArgs = genericArgs !== null && genericArgs !== void 0 ? genericArgs : ty.defined.generics;\n                        const args = genArgs\n                            ? IdlCoder.resolveGenericArgs({\n                                type,\n                                typeDef,\n                                genericArgs: genArgs,\n                            })\n                            : genArgs;\n                        return IdlCoder.typeSize(type, idl, args);\n                    };\n                    switch (typeDef.type.kind) {\n                        case \"struct\": {\n                            return handleDefinedFields(typeDef.type.fields, () => [0], (fields) => fields.map((f) => typeSize(f.type)), (fields) => fields.map((f) => typeSize(f))).reduce((acc, size) => acc + size, 0);\n                        }\n                        case \"enum\": {\n                            const variantSizes = typeDef.type.variants.map((variant) => {\n                                return handleDefinedFields(variant.fields, () => [0], (fields) => fields.map((f) => typeSize(f.type)), (fields) => fields.map((f) => typeSize(f))).reduce((acc, size) => acc + size, 0);\n                            });\n                            return Math.max(...variantSizes) + 1;\n                        }\n                        case \"type\": {\n                            return IdlCoder.typeSize(typeDef.type.alias, idl, genericArgs);\n                        }\n                    }\n                }\n                if (\"generic\" in ty) {\n                    const genericArg = genericArgs === null || genericArgs === void 0 ? void 0 : genericArgs.at(0);\n                    if ((genericArg === null || genericArg === void 0 ? void 0 : genericArg.kind) !== \"type\") {\n                        throw new IdlError(`Invalid generic: ${ty.generic}`);\n                    }\n                    return IdlCoder.typeSize(genericArg.type, idl, genericArgs);\n                }\n                throw new Error(`Invalid type ${JSON.stringify(ty)}`);\n        }\n    }\n    /**\n     * Resolve the generic array length or return the constant-sized array length.\n     */\n    static resolveArrayLen(len, genericArgs) {\n        if (typeof len === \"number\")\n            return len;\n        if (genericArgs) {\n            const genericLen = genericArgs.find((g) => g.kind === \"const\");\n            if ((genericLen === null || genericLen === void 0 ? void 0 : genericLen.kind) === \"const\") {\n                len = +genericLen.value;\n            }\n        }\n        if (typeof len !== \"number\") {\n            throw new IdlError(\"Generic array length did not resolve\");\n        }\n        return len;\n    }\n    /**\n     * Recursively resolve generic arguments i.e. replace all generics with the\n     * actual type that they hold based on the initial `genericArgs` given.\n     */\n    static resolveGenericArgs({ type, typeDef, genericArgs, isDefined, }) {\n        if (typeof type !== \"object\")\n            return null;\n        for (const index in typeDef.generics) {\n            const defGeneric = typeDef.generics[index];\n            if (\"generic\" in type && defGeneric.name === type.generic) {\n                return [genericArgs[index]];\n            }\n            if (\"option\" in type) {\n                const args = IdlCoder.resolveGenericArgs({\n                    type: type.option,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (!args || !isDefined)\n                    return args;\n                if (args[0].kind === \"type\") {\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { option: args[0].type },\n                        },\n                    ];\n                }\n            }\n            if (\"vec\" in type) {\n                const args = IdlCoder.resolveGenericArgs({\n                    type: type.vec,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (!args || !isDefined)\n                    return args;\n                if (args[0].kind === \"type\") {\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { vec: args[0].type },\n                        },\n                    ];\n                }\n            }\n            if (\"array\" in type) {\n                const [elTy, len] = type.array;\n                const isGenericLen = typeof len === \"object\";\n                const args = IdlCoder.resolveGenericArgs({\n                    type: elTy,\n                    typeDef,\n                    genericArgs,\n                    isDefined,\n                });\n                if (args) {\n                    // Has generic type, also check for generic length\n                    for (const i in typeDef.generics.slice(+index)) {\n                        const curIndex = +index + +i;\n                        if (isGenericLen &&\n                            typeDef.generics[curIndex].name === len.generic) {\n                            args.push(genericArgs[curIndex]);\n                        }\n                    }\n                    if (!isDefined)\n                        return args;\n                    if (args[0].kind === \"type\" && args[1].kind === \"const\") {\n                        return [\n                            {\n                                kind: \"type\",\n                                type: { array: [args[0].type, +args[1].value] },\n                            },\n                        ];\n                    }\n                }\n                // Only generic len\n                if (isGenericLen && defGeneric.name === len.generic) {\n                    const arg = genericArgs[index];\n                    if (!isDefined)\n                        return [arg];\n                    return [\n                        {\n                            kind: \"type\",\n                            type: { array: [elTy, +arg.value] },\n                        },\n                    ];\n                }\n                // Non-generic\n                return null;\n            }\n            if (\"defined\" in type) {\n                if (!type.defined.generics)\n                    return null;\n                return type.defined.generics\n                    .flatMap((g) => {\n                    switch (g.kind) {\n                        case \"type\":\n                            return IdlCoder.resolveGenericArgs({\n                                type: g.type,\n                                typeDef,\n                                genericArgs,\n                                isDefined: true,\n                            });\n                        case \"const\":\n                            return [g];\n                    }\n                })\n                    .filter((g) => g !== null);\n            }\n        }\n        return null;\n    }\n}\n\n/**\n * Encodes and decodes program instructions.\n */\nclass BorshInstructionCoder {\n    constructor(idl) {\n        this.idl = idl;\n        const ixLayouts = idl.instructions.map((ix) => {\n            const name = ix.name;\n            const fieldLayouts = ix.args.map((arg) => IdlCoder.fieldLayout(arg, idl.types));\n            const layout = borsh.struct(fieldLayouts, name);\n            return [name, { discriminator: ix.discriminator, layout }];\n        });\n        this.ixLayouts = new Map(ixLayouts);\n        const sighashLayouts = ixLayouts.map(([name, { discriminator, layout }]) => {\n            return [bs58$1.encode(discriminator), { name, layout }];\n        });\n        this.sighashLayouts = new Map(sighashLayouts);\n    }\n    /**\n     * Encodes a program instruction.\n     */\n    encode(ixName, ix) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const encoder = this.ixLayouts.get(ixName);\n        if (!encoder) {\n            throw new Error(`Unknown method: ${ixName}`);\n        }\n        const len = encoder.layout.encode(ix, buffer);\n        const data = buffer.slice(0, len);\n        return Buffer$1.concat([Buffer$1.from(encoder.discriminator), data]);\n    }\n    /**\n     * Decodes a program instruction.\n     */\n    decode(ix, encoding = \"hex\") {\n        if (typeof ix === \"string\") {\n            ix = encoding === \"hex\" ? Buffer$1.from(ix, \"hex\") : bs58$1.decode(ix);\n        }\n        const disc = ix.slice(0, DISCRIMINATOR_SIZE);\n        const data = ix.slice(DISCRIMINATOR_SIZE);\n        const decoder = this.sighashLayouts.get(bs58$1.encode(disc));\n        if (!decoder) {\n            return null;\n        }\n        return {\n            name: decoder.name,\n            data: decoder.layout.decode(data),\n        };\n    }\n    /**\n     * Returns a formatted table of all the fields in the given instruction data.\n     */\n    format(ix, accountMetas) {\n        return InstructionFormatter.format(ix, accountMetas, this.idl);\n    }\n}\nclass InstructionFormatter {\n    static format(ix, accountMetas, idl) {\n        const idlIx = idl.instructions.find((i) => ix.name === i.name);\n        if (!idlIx) {\n            console.error(\"Invalid instruction given\");\n            return null;\n        }\n        const args = idlIx.args.map((idlField) => {\n            return {\n                name: idlField.name,\n                type: InstructionFormatter.formatIdlType(idlField.type),\n                data: InstructionFormatter.formatIdlData(idlField, ix.data[idlField.name], idl.types),\n            };\n        });\n        const flatIdlAccounts = InstructionFormatter.flattenIdlAccounts(idlIx.accounts);\n        const accounts = accountMetas.map((meta, idx) => {\n            if (idx < flatIdlAccounts.length) {\n                return {\n                    name: flatIdlAccounts[idx].name,\n                    ...meta,\n                };\n            }\n            // \"Remaining accounts\" are unnamed in Anchor.\n            else {\n                return {\n                    name: undefined,\n                    ...meta,\n                };\n            }\n        });\n        return {\n            args,\n            accounts,\n        };\n    }\n    static formatIdlType(idlType) {\n        if (typeof idlType === \"string\") {\n            return idlType;\n        }\n        if (\"option\" in idlType) {\n            return `Option<${this.formatIdlType(idlType.option)}>`;\n        }\n        if (\"coption\" in idlType) {\n            return `COption<${this.formatIdlType(idlType.coption)}>`;\n        }\n        if (\"vec\" in idlType) {\n            return `Vec<${this.formatIdlType(idlType.vec)}>`;\n        }\n        if (\"array\" in idlType) {\n            return `Array<${idlType.array[0]}; ${idlType.array[1]}>`;\n        }\n        if (\"defined\" in idlType) {\n            const name = idlType.defined.name;\n            if (idlType.defined.generics) {\n                const generics = idlType.defined.generics\n                    .map((g) => {\n                    switch (g.kind) {\n                        case \"type\":\n                            return InstructionFormatter.formatIdlType(g.type);\n                        case \"const\":\n                            return g.value;\n                    }\n                })\n                    .join(\", \");\n                return `${name}<${generics}>`;\n            }\n            return name;\n        }\n        throw new Error(`Unknown IDL type: ${idlType}`);\n    }\n    static formatIdlData(idlField, data, types) {\n        if (typeof idlField.type === \"string\") {\n            return data.toString();\n        }\n        if (\"vec\" in idlField.type) {\n            return (\"[\" +\n                data\n                    .map((d) => this.formatIdlData({ name: \"\", type: idlField.type.vec }, d, types))\n                    .join(\", \") +\n                \"]\");\n        }\n        if (\"option\" in idlField.type) {\n            return data === null\n                ? \"null\"\n                : this.formatIdlData({ name: \"\", type: idlField.type.option }, data, types);\n        }\n        if (\"defined\" in idlField.type) {\n            if (!types) {\n                throw new Error(\"User defined types not provided\");\n            }\n            const definedName = idlField.type.defined.name;\n            const typeDef = types.find((t) => t.name === definedName);\n            if (!typeDef) {\n                throw new Error(`Type not found: ${definedName}`);\n            }\n            return InstructionFormatter.formatIdlDataDefined(typeDef, data, types);\n        }\n        return \"unknown\";\n    }\n    static formatIdlDataDefined(typeDef, data, types) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                return (\"{ \" +\n                    handleDefinedFields(typeDef.type.fields, () => \"\", (fields) => {\n                        return Object.entries(data)\n                            .map(([key, val]) => {\n                            const field = fields.find((f) => f.name === key);\n                            if (!field) {\n                                throw new Error(`Field not found: ${key}`);\n                            }\n                            return (key +\n                                \": \" +\n                                InstructionFormatter.formatIdlData(field, val, types));\n                        })\n                            .join(\", \");\n                    }, (fields) => {\n                        return Object.entries(data)\n                            .map(([key, val]) => {\n                            return (key +\n                                \": \" +\n                                InstructionFormatter.formatIdlData({ name: \"\", type: fields[key] }, val, types));\n                        })\n                            .join(\", \");\n                    }) +\n                    \" }\");\n            }\n            case \"enum\": {\n                const variantName = Object.keys(data)[0];\n                const variant = typeDef.type.variants.find((v) => v.name === variantName);\n                if (!variant) {\n                    throw new Error(`Unable to find variant: ${variantName}`);\n                }\n                const enumValue = data[variantName];\n                return handleDefinedFields(variant.fields, () => variantName, (fields) => {\n                    const namedFields = Object.keys(enumValue)\n                        .map((f) => {\n                        const fieldData = enumValue[f];\n                        const idlField = fields.find((v) => v.name === f);\n                        if (!idlField) {\n                            throw new Error(`Field not found: ${f}`);\n                        }\n                        return (f +\n                            \": \" +\n                            InstructionFormatter.formatIdlData(idlField, fieldData, types));\n                    })\n                        .join(\", \");\n                    return `${variantName} { ${namedFields} }`;\n                }, (fields) => {\n                    const tupleFields = Object.entries(enumValue)\n                        .map(([key, val]) => {\n                        return (key +\n                            \": \" +\n                            InstructionFormatter.formatIdlData({ name: \"\", type: fields[key] }, val, types));\n                    })\n                        .join(\", \");\n                    return `${variantName} { ${tupleFields} }`;\n                });\n            }\n            case \"type\": {\n                return InstructionFormatter.formatIdlType(typeDef.type.alias);\n            }\n        }\n    }\n    static flattenIdlAccounts(accounts, prefix) {\n        return accounts\n            .map((account) => {\n            const accName = sentenceCase(account.name);\n            if (account.hasOwnProperty(\"accounts\")) {\n                const newPrefix = prefix ? `${prefix} > ${accName}` : accName;\n                return InstructionFormatter.flattenIdlAccounts(account.accounts, newPrefix);\n            }\n            else {\n                return {\n                    ...account,\n                    name: prefix ? `${prefix} > ${accName}` : accName,\n                };\n            }\n        })\n            .flat();\n    }\n}\nfunction sentenceCase(field) {\n    const result = field.replace(/([A-Z])/g, \" $1\");\n    return result.charAt(0).toUpperCase() + result.slice(1);\n}\n\n/**\n * Number of bytes in anchor discriminators\n */\nconst DISCRIMINATOR_SIZE = 8;\n\n/**\n * Encodes and decodes account objects.\n */\nclass BorshAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n        if (!idl.accounts) {\n            this.accountLayouts = new Map();\n            return;\n        }\n        const types = idl.types;\n        if (!types) {\n            throw new Error(\"Accounts require `idl.types`\");\n        }\n        const layouts = idl.accounts.map((acc) => {\n            const typeDef = types.find((ty) => ty.name === acc.name);\n            if (!typeDef) {\n                throw new Error(`Account not found: ${acc.name}`);\n            }\n            return [acc.name, IdlCoder.typeDefLayout({ typeDef, types })];\n        });\n        this.accountLayouts = new Map(layouts);\n    }\n    async encode(accountName, account) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        const len = layout.encode(account, buffer);\n        const accountData = buffer.slice(0, len);\n        const discriminator = this.accountDiscriminator(accountName);\n        return Buffer$1.concat([discriminator, accountData]);\n    }\n    decode(accountName, data) {\n        // Assert the account discriminator is correct.\n        const discriminator = this.accountDiscriminator(accountName);\n        if (discriminator.compare(data.slice(0, DISCRIMINATOR_SIZE))) {\n            throw new Error(\"Invalid account discriminator\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeAny(data) {\n        const discriminator = data.slice(0, DISCRIMINATOR_SIZE);\n        const accountName = Array.from(this.accountLayouts.keys()).find((key) => this.accountDiscriminator(key).equals(discriminator));\n        if (!accountName) {\n            throw new Error(\"Account not found\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeUnchecked(accountName, acc) {\n        // Chop off the discriminator before decoding.\n        const data = acc.subarray(DISCRIMINATOR_SIZE);\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        return layout.decode(data);\n    }\n    memcmp(accountName, appendData) {\n        const discriminator = this.accountDiscriminator(accountName);\n        return {\n            offset: 0,\n            bytes: bs58$1.encode(appendData ? Buffer$1.concat([discriminator, appendData]) : discriminator),\n        };\n    }\n    size(accountName) {\n        return (DISCRIMINATOR_SIZE +\n            IdlCoder.typeSize({ defined: { name: accountName } }, this.idl));\n    }\n    /**\n     * Calculates and returns a unique 8 byte discriminator prepended to all anchor accounts.\n     *\n     * @param name The name of the account to calculate the discriminator.\n     */\n    accountDiscriminator(name) {\n        var _a;\n        const account = (_a = this.idl.accounts) === null || _a === void 0 ? void 0 : _a.find((acc) => acc.name === name);\n        if (!account) {\n            throw new Error(`Account not found: ${name}`);\n        }\n        return Buffer$1.from(account.discriminator);\n    }\n}\n\nclass BorshEventCoder {\n    constructor(idl) {\n        var _a;\n        if (!idl.events) {\n            this.layouts = new Map();\n            return;\n        }\n        const types = idl.types;\n        if (!types) {\n            throw new Error(\"Events require `idl.types`\");\n        }\n        const layouts = idl.events.map((ev) => {\n            const typeDef = types.find((ty) => ty.name === ev.name);\n            if (!typeDef) {\n                throw new Error(`Event not found: ${ev.name}`);\n            }\n            return [ev.name, IdlCoder.typeDefLayout({ typeDef, types })];\n        });\n        this.layouts = new Map(layouts);\n        this.discriminators = new Map(((_a = idl.events) !== null && _a !== void 0 ? _a : []).map((ev) => [\n            encode(Buffer$1.from(ev.discriminator)),\n            ev.name,\n        ]));\n    }\n    decode(log) {\n        let logArr;\n        // This will throw if log length is not a multiple of 4.\n        try {\n            logArr = decode(log);\n        }\n        catch (e) {\n            return null;\n        }\n        const disc = encode(logArr.slice(0, 8));\n        // Only deserialize if the discriminator implies a proper event.\n        const eventName = this.discriminators.get(disc);\n        if (!eventName) {\n            return null;\n        }\n        const layout = this.layouts.get(eventName);\n        if (!layout) {\n            throw new Error(`Unknown event: ${eventName}`);\n        }\n        const data = layout.decode(logArr.slice(8));\n        return { data, name: eventName };\n    }\n}\n\n/**\n * Encodes and decodes user-defined types.\n */\nclass BorshTypesCoder {\n    constructor(idl) {\n        const types = idl.types;\n        if (!types) {\n            this.typeLayouts = new Map();\n            return;\n        }\n        const layouts = types\n            .filter((ty) => !ty.generics)\n            .map((ty) => [\n            ty.name,\n            IdlCoder.typeDefLayout({ typeDef: ty, types }),\n        ]);\n        this.typeLayouts = new Map(layouts);\n    }\n    encode(name, type) {\n        const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.typeLayouts.get(name);\n        if (!layout) {\n            throw new Error(`Unknown type: ${name}`);\n        }\n        const len = layout.encode(type, buffer);\n        return buffer.slice(0, len);\n    }\n    decode(name, data) {\n        const layout = this.typeLayouts.get(name);\n        if (!layout) {\n            throw new Error(`Unknown type: ${name}`);\n        }\n        return layout.decode(data);\n    }\n}\n\n/**\n * BorshCoder is the default Coder for Anchor programs implementing the\n * borsh based serialization interface.\n */\nclass BorshCoder {\n    constructor(idl) {\n        this.instruction = new BorshInstructionCoder(idl);\n        this.accounts = new BorshAccountsCoder(idl);\n        this.events = new BorshEventCoder(idl);\n        this.types = new BorshTypesCoder(idl);\n    }\n}\n\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nvar Layout_2 = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob$1 extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/** Factory for {@link OffsetLayout}. */\nvar offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = (property => new UInt(4, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nvar nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nvar ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link Union} values. */\nvar union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = ((length, property) => new Blob$1(length, property));\n\nclass SystemInstructionCoder {\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    constructor(_) { }\n    encode(ixName, ix) {\n        switch (ixName) {\n            case \"createAccount\": {\n                return encodeCreateAccount(ix);\n            }\n            case \"assign\": {\n                return encodeAssign(ix);\n            }\n            case \"transfer\": {\n                return encodeTransfer(ix);\n            }\n            case \"createAccountWithSeed\": {\n                return encodeCreateAccountWithSeed(ix);\n            }\n            case \"advanceNonceAccount\": {\n                return encodeAdvanceNonceAccount(ix);\n            }\n            case \"withdrawNonceAccount\": {\n                return encodeWithdrawNonceAccount(ix);\n            }\n            case \"initializeNonceAccount\": {\n                return encodeInitializeNonceAccount(ix);\n            }\n            case \"authorizeNonceAccount\": {\n                return encodeAuthorizeNonceAccount(ix);\n            }\n            case \"allocate\": {\n                return encodeAllocate(ix);\n            }\n            case \"allocateWithSeed\": {\n                return encodeAllocateWithSeed(ix);\n            }\n            case \"assignWithSeed\": {\n                return encodeAssignWithSeed(ix);\n            }\n            case \"transferWithSeed\": {\n                return encodeTransferWithSeed(ix);\n            }\n            default: {\n                throw new Error(`Invalid instruction: ${ixName}`);\n            }\n        }\n    }\n    encodeState(_ixName, _ix) {\n        throw new Error(\"System does not have state\");\n    }\n}\nclass RustStringLayout extends Layout_2 {\n    constructor(property) {\n        super(-1, property);\n        this.property = property;\n        this.layout = struct([\n            u32(\"length\"),\n            u32(\"lengthPadding\"),\n            blob(offset(u32(), -8), \"chars\"),\n        ], this.property);\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span;\n        }\n        const data = {\n            chars: Buffer.from(src, \"utf8\"),\n        };\n        return this.layout.encode(data, b, offset);\n    }\n    decode(b, offset = 0) {\n        const data = this.layout.decode(b, offset);\n        return data[\"chars\"].toString();\n    }\n    getSpan(b, offset = 0) {\n        return (u32().span +\n            u32().span +\n            new (bn_js__WEBPACK_IMPORTED_MODULE_2___default())(new Uint8Array(b).slice(offset, offset + 4), 10, \"le\").toNumber());\n    }\n}\nfunction rustStringLayout(property) {\n    return new RustStringLayout(property);\n}\nfunction publicKey$2(property) {\n    return blob(32, property);\n}\nfunction encodeCreateAccount({ lamports, space, owner }) {\n    return encodeData({\n        createAccount: { lamports, space, owner: owner.toBuffer() },\n    });\n}\nfunction encodeAssign({ owner }) {\n    return encodeData({\n        assign: { owner: owner.toBuffer() },\n    });\n}\nfunction encodeTransfer({ lamports }) {\n    return encodeData({\n        transfer: { lamports },\n    });\n}\nfunction encodeCreateAccountWithSeed({ base, seed, lamports, space, owner, }) {\n    return encodeData({\n        createAccountWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            lamports,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(3).span + seed.length);\n}\nfunction encodeInitializeNonceAccount({ authorized }) {\n    return encodeData({\n        initializeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAdvanceNonceAccount({ authorized }) {\n    return encodeData({\n        advanceNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeWithdrawNonceAccount({ lamports }) {\n    return encodeData({\n        withdrawNonceAccount: { lamports },\n    });\n}\nfunction encodeAuthorizeNonceAccount({ authorized }) {\n    return encodeData({\n        authorizeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAllocate({ space }) {\n    return encodeData({\n        allocate: { space },\n    });\n}\nfunction encodeAllocateWithSeed({ base, seed, space, owner }) {\n    return encodeData({\n        allocateWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(9).span + seed.length);\n}\nfunction encodeAssignWithSeed({ base, seed, owner }) {\n    return encodeData({\n        assignWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(10).span + seed.length);\n}\nfunction encodeTransferWithSeed({ lamports, seed, owner }) {\n    return encodeData({\n        transferWithSeed: {\n            lamports,\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(11).span + seed.length);\n}\nconst LAYOUT = union(u32(\"instruction\"));\nLAYOUT.addVariant(0, struct([\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccount\");\nLAYOUT.addVariant(1, struct([publicKey$2(\"owner\")]), \"assign\");\nLAYOUT.addVariant(2, struct([ns64(\"lamports\")]), \"transfer\");\nLAYOUT.addVariant(3, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccountWithSeed\");\nLAYOUT.addVariant(4, struct([publicKey$2(\"authorized\")]), \"advanceNonceAccount\");\nLAYOUT.addVariant(5, struct([ns64(\"lamports\")]), \"withdrawNonceAccount\");\nLAYOUT.addVariant(6, struct([publicKey$2(\"authorized\")]), \"initializeNonceAccount\");\nLAYOUT.addVariant(7, struct([publicKey$2(\"authorized\")]), \"authorizeNonceAccount\");\nLAYOUT.addVariant(8, struct([ns64(\"space\")]), \"allocate\");\nLAYOUT.addVariant(9, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"allocateWithSeed\");\nLAYOUT.addVariant(10, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"assignWithSeed\");\nLAYOUT.addVariant(11, struct([\n    ns64(\"lamports\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"transferWithSeed\");\nfunction encodeData(instruction, maxSpan) {\n    const b = Buffer.alloc(maxSpan !== null && maxSpan !== void 0 ? maxSpan : instructionMaxSpan);\n    const span = LAYOUT.encode(instruction, b);\n    if (maxSpan === undefined) {\n        return b.slice(0, span);\n    }\n    return b;\n}\nconst instructionMaxSpan = Math.max(...Object.values(LAYOUT.registry).map((r) => r.span));\n\nclass SystemAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        switch (accountName) {\n            case \"nonce\": {\n                const buffer = Buffer.alloc(NONCE_ACCOUNT_LENGTH);\n                const len = NONCE_ACCOUNT_LAYOUT.encode(account, buffer);\n                return buffer.slice(0, len);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    decode(accountName, ix) {\n        return this.decodeUnchecked(accountName, ix);\n    }\n    decodeUnchecked(accountName, ix) {\n        switch (accountName) {\n            case \"nonce\": {\n                return decodeNonceAccount(ix);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    // TODO: this won't use the appendData.\n    memcmp(accountName, _appendData) {\n        switch (accountName) {\n            case \"nonce\": {\n                return {\n                    dataSize: NONCE_ACCOUNT_LENGTH,\n                };\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    size(accountName) {\n        return IdlCoder.typeSize({ defined: { name: accountName } }, this.idl);\n    }\n}\nfunction decodeNonceAccount(ix) {\n    return NONCE_ACCOUNT_LAYOUT.decode(ix);\n}\nclass WrappedLayout$1 extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey$1(property) {\n    return new WrappedLayout$1(blob(32), (b) => new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(b), (key) => key.toBuffer(), property);\n}\nconst NONCE_ACCOUNT_LAYOUT = struct([\n    u32(\"version\"),\n    u32(\"state\"),\n    publicKey$1(\"authorizedPubkey\"),\n    publicKey$1(\"nonce\"),\n    struct([nu64(\"lamportsPerSignature\")], \"feeCalculator\"),\n]);\n\nclass SystemEventsCoder {\n    constructor(_idl) { }\n    decode(_log) {\n        throw new Error(\"System program does not have events\");\n    }\n}\n\nclass SystemTypesCoder {\n    constructor(_idl) { }\n    encode(_name, _type) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n    decode(_name, _typeData) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n}\n\n/**\n * Coder for the System program.\n */\nclass SystemCoder {\n    constructor(idl) {\n        this.instruction = new SystemInstructionCoder(idl);\n        this.accounts = new SystemAccountsCoder(idl);\n        this.events = new SystemEventsCoder(idl);\n        this.types = new SystemTypesCoder(idl);\n    }\n}\n\nfunction hash(data) {\n    return new TextDecoder().decode((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(data));\n}\n\nvar sha256 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hash: hash\n});\n\n// Sync version of web3.PublicKey.createWithSeed.\nfunction createWithSeedSync(fromPublicKey, seed, programId) {\n    const buffer = buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([\n        fromPublicKey.toBuffer(),\n        buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(seed),\n        programId.toBuffer(),\n    ]);\n    return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(buffer));\n}\n\nvar pubkey = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    createWithSeedSync: createWithSeedSync\n});\n\nconst TOKEN_PROGRAM_ID = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");\nconst ASSOCIATED_PROGRAM_ID = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\nfunction associatedAddress({ mint, owner, }) {\n    return _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddressSync([owner.toBuffer(), TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], ASSOCIATED_PROGRAM_ID)[0];\n}\n\nvar token = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    TOKEN_PROGRAM_ID: TOKEN_PROGRAM_ID,\n    ASSOCIATED_PROGRAM_ID: ASSOCIATED_PROGRAM_ID,\n    associatedAddress: associatedAddress\n});\n\nvar browserPonyfill = {exports: {}};\n\n(function (module, exports) {\nvar global = typeof self !== 'undefined' ? self : commonjsGlobal;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException;\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\n((function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}))({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch; // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch; // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch; // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers;\nexports.Request = ctx.Request;\nexports.Response = ctx.Response;\nmodule.exports = exports;\n}(browserPonyfill, browserPonyfill.exports));\n\nvar fetch = /*@__PURE__*/getDefaultExportFromCjs(browserPonyfill.exports);\n\n/**\n * Returns a verified build from the anchor registry. null if no such\n * verified build exists, e.g., if the program has been upgraded since the\n * last verified build.\n */\nasync function verifiedBuild(connection, programId, limit = 5) {\n    const url = `https://api.apr.dev/api/v0/program/${programId.toString()}/latest?limit=${limit}`;\n    const [programData, latestBuildsResp] = await Promise.all([\n        fetchData(connection, programId),\n        fetch(url),\n    ]);\n    // Filter out all non successful builds.\n    const latestBuilds = (await latestBuildsResp.json()).filter((b) => !b.aborted && b.state === \"Built\" && b.verified === \"Verified\");\n    if (latestBuilds.length === 0) {\n        return null;\n    }\n    // Get the latest build.\n    const build = latestBuilds[0];\n    // Has the program been upgraded since the last build?\n    if (programData.slot.toNumber() !== build.verified_slot) {\n        return null;\n    }\n    // Success.\n    return build;\n}\n/**\n * Returns the program data account for this program, containing the\n * metadata for this program, e.g., the upgrade authority.\n */\nasync function fetchData(connection, programId) {\n    const accountInfo = await connection.getAccountInfo(programId);\n    if (accountInfo === null) {\n        throw new Error(\"program account not found\");\n    }\n    const { program } = decodeUpgradeableLoaderState(accountInfo.data);\n    const programdataAccountInfo = await connection.getAccountInfo(program.programdataAddress);\n    if (programdataAccountInfo === null) {\n        throw new Error(\"program data account not found\");\n    }\n    const { programData } = decodeUpgradeableLoaderState(programdataAccountInfo.data);\n    return programData;\n}\nconst UPGRADEABLE_LOADER_STATE_LAYOUT = _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.rustEnum([\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([], \"uninitialized\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.option(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(), \"authorityAddress\")], \"buffer\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(\"programdataAddress\")], \"program\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([\n        _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u64(\"slot\"),\n        _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.option(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(), \"upgradeAuthorityAddress\"),\n    ], \"programData\"),\n], undefined, _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u32());\nfunction decodeUpgradeableLoaderState(data) {\n    return UPGRADEABLE_LOADER_STATE_LAYOUT.decode(data);\n}\n\nvar registry = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    verifiedBuild: verifiedBuild,\n    fetchData: fetchData,\n    decodeUpgradeableLoaderState: decodeUpgradeableLoaderState\n});\n\nvar index = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    sha256: sha256,\n    rpc: rpc,\n    publicKey: pubkey,\n    bytes: index$1,\n    token: token,\n    features: features,\n    registry: registry\n});\n\nfunction splitArgsAndCtx(idlIx, args) {\n    var _a, _b;\n    let options = {};\n    const inputLen = idlIx.args ? idlIx.args.length : 0;\n    if (args.length > inputLen) {\n        if (args.length !== inputLen + 1) {\n            throw new Error(`provided too many arguments ${args} to instruction ${idlIx === null || idlIx === void 0 ? void 0 : idlIx.name} expecting: ${(_b = (_a = idlIx.args) === null || _a === void 0 ? void 0 : _a.map((a) => a.name)) !== null && _b !== void 0 ? _b : []}`);\n        }\n        options = args.pop();\n    }\n    return [args, options];\n}\n\nclass InstructionNamespaceFactory {\n    static build(idlIx, encodeFn, programId) {\n        if (idlIx.name === \"_inner\") {\n            throw new IdlError(\"the _inner name is reserved\");\n        }\n        const ix = (...args) => {\n            const [ixArgs, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            validateAccounts(idlIx.accounts, ctx.accounts);\n            validateInstruction(idlIx, ...args);\n            const keys = ix.accounts(ctx.accounts);\n            if (ctx.remainingAccounts !== undefined) {\n                keys.push(...ctx.remainingAccounts);\n            }\n            if (isSet(\"debug-logs\")) {\n                console.log(\"Outgoing account metas:\", keys);\n            }\n            return new TransactionInstruction({\n                keys,\n                programId,\n                data: encodeFn(idlIx.name, toInstruction(idlIx, ...ixArgs)),\n            });\n        };\n        // Utility fn for ordering the accounts for this instruction.\n        ix[\"accounts\"] = (accs) => {\n            return InstructionNamespaceFactory.accountsArray(accs, idlIx.accounts, programId, idlIx.name);\n        };\n        return ix;\n    }\n    static accountsArray(ctx, accounts, programId, ixName) {\n        if (!ctx) {\n            return [];\n        }\n        return accounts\n            .map((acc) => {\n            if (isCompositeAccounts(acc)) {\n                const rpcAccs = ctx[acc.name];\n                return InstructionNamespaceFactory.accountsArray(rpcAccs, acc.accounts, programId, ixName).flat();\n            }\n            let pubkey;\n            try {\n                pubkey = translateAddress(ctx[acc.name]);\n            }\n            catch (err) {\n                throw new Error(`Wrong input type for account \"${acc.name}\" in the instruction accounts object${ixName !== undefined ? ' for instruction \"' + ixName + '\"' : \"\"}. Expected PublicKey or string.`);\n            }\n            const isOptional = acc.optional && pubkey.equals(programId);\n            const isWritable = Boolean(acc.writable && !isOptional);\n            const isSigner = Boolean(acc.signer && !isOptional);\n            return {\n                pubkey,\n                isWritable,\n                isSigner,\n            };\n        })\n            .flat();\n    }\n}\n// Throws error if any argument required for the `ix` is not given.\nfunction validateInstruction(ix, ...args) {\n    // todo\n}\n\nclass TransactionFactory {\n    static build(idlIx, ixFn) {\n        const txFn = (...args) => {\n            var _a, _b, _c;\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            const tx = new Transaction();\n            if (ctx.preInstructions && ctx.instructions) {\n                throw new Error(\"instructions is deprecated, use preInstructions\");\n            }\n            (_a = ctx.preInstructions) === null || _a === void 0 ? void 0 : _a.forEach((ix) => tx.add(ix));\n            (_b = ctx.instructions) === null || _b === void 0 ? void 0 : _b.forEach((ix) => tx.add(ix));\n            tx.add(ixFn(...args));\n            (_c = ctx.postInstructions) === null || _c === void 0 ? void 0 : _c.forEach((ix) => tx.add(ix));\n            return tx;\n        };\n        return txFn;\n    }\n}\n\nclass RpcFactory {\n    static build(idlIx, txFn, idlErrors, provider) {\n        const rpc = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            if (provider.sendAndConfirm === undefined) {\n                throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n            }\n            try {\n                return await provider.sendAndConfirm(tx, (_a = ctx.signers) !== null && _a !== void 0 ? _a : [], ctx.options);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n        };\n        return rpc;\n    }\n}\n\nclass AccountFactory {\n    static build(idl, coder, programId, provider) {\n        var _a;\n        return ((_a = idl.accounts) !== null && _a !== void 0 ? _a : []).reduce((accountFns, acc) => {\n            accountFns[acc.name] = new AccountClient(idl, acc, programId, provider, coder);\n            return accountFns;\n        }, {});\n    }\n}\nclass AccountClient {\n    /**\n     * Returns the number of bytes in this account.\n     */\n    get size() {\n        return this._size;\n    }\n    /**\n     * Returns the program ID owning all accounts.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * Returns the client's wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * Returns the coder.\n     */\n    get coder() {\n        return this._coder;\n    }\n    constructor(idl, idlAccount, programId, provider, coder) {\n        this._idlAccount = idlAccount;\n        this._programId = programId;\n        this._provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._size = this._coder.accounts.size(idlAccount.name);\n    }\n    /**\n     * Returns a deserialized account, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullable(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullableAndContext(address, commitment) {\n        const accountInfo = await this.getAccountInfoAndContext(address, commitment);\n        const { value, context } = accountInfo;\n        return {\n            data: value && value.data.length !== 0\n                ? this._coder.accounts.decode(this._idlAccount.name, value.data)\n                : null,\n            context,\n        };\n    }\n    /**\n     * Returns a deserialized account.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetch(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist or has no data ${address.toString()}`);\n        }\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchAndContext(address, commitment) {\n        const { data, context } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist ${address.toString()}`);\n        }\n        return { data, context };\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultiple(addresses, commitment) {\n        const accounts = await this.fetchMultipleAndContext(addresses, commitment);\n        return accounts.map((account) => (account ? account.data : null));\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultipleAndContext(addresses, commitment) {\n        const accounts = await getMultipleAccountsAndContext(this._provider.connection, addresses.map((address) => translateAddress(address)), commitment);\n        // Decode accounts where discriminator is correct, null otherwise\n        return accounts.map((result) => {\n            if (result == null) {\n                return null;\n            }\n            const { account, context } = result;\n            return {\n                data: this._coder.accounts.decode(this._idlAccount.name, account.data),\n                context,\n            };\n        });\n    }\n    /**\n     * Returns all instances of this account type for the program.\n     *\n     * @param filters User-provided filters to narrow the results from `connection.getProgramAccounts`.\n     *\n     *                When filters are not defined this method returns all\n     *                the account instances.\n     *\n     *                When filters are of type `Buffer`, the filters are appended\n     *                after the discriminator.\n     *\n     *                When filters are of type `GetProgramAccountsFilter[]`,\n     *                filters are appended after the discriminator filter.\n     */\n    async all(filters) {\n        const filter = this.coder.accounts.memcmp(this._idlAccount.name, filters instanceof Buffer ? filters : undefined);\n        const coderFilters = [];\n        if ((filter === null || filter === void 0 ? void 0 : filter.offset) != undefined && (filter === null || filter === void 0 ? void 0 : filter.bytes) != undefined) {\n            coderFilters.push({\n                memcmp: { offset: filter.offset, bytes: filter.bytes },\n            });\n        }\n        if ((filter === null || filter === void 0 ? void 0 : filter.dataSize) != undefined) {\n            coderFilters.push({ dataSize: filter.dataSize });\n        }\n        let resp = await this._provider.connection.getProgramAccounts(this._programId, {\n            commitment: this._provider.connection.commitment,\n            filters: [...coderFilters, ...(Array.isArray(filters) ? filters : [])],\n        });\n        return resp.map(({ pubkey, account }) => {\n            return {\n                publicKey: pubkey,\n                account: this._coder.accounts.decode(this._idlAccount.name, account.data),\n            };\n        });\n    }\n    /**\n     * Returns an `EventEmitter` emitting a \"change\" event whenever the account\n     * changes.\n     */\n    subscribe(address, commitment) {\n        const sub = subscriptions.get(address.toString());\n        if (sub) {\n            return sub.ee;\n        }\n        const ee = new EventEmitter();\n        address = translateAddress(address);\n        const listener = this._provider.connection.onAccountChange(address, (acc) => {\n            const account = this._coder.accounts.decode(this._idlAccount.name, acc.data);\n            ee.emit(\"change\", account);\n        }, commitment);\n        subscriptions.set(address.toString(), {\n            ee,\n            listener,\n        });\n        return ee;\n    }\n    /**\n     * Unsubscribes from the account at the given address.\n     */\n    async unsubscribe(address) {\n        let sub = subscriptions.get(address.toString());\n        if (!sub) {\n            console.warn(\"Address is not subscribed\");\n            return;\n        }\n        if (subscriptions) {\n            await this._provider.connection\n                .removeAccountChangeListener(sub.listener)\n                .then(() => {\n                subscriptions.delete(address.toString());\n            })\n                .catch(console.error);\n        }\n    }\n    /**\n     * Returns an instruction for creating this account.\n     */\n    async createInstruction(signer, sizeOverride) {\n        const size = this.size;\n        if (this._provider.publicKey === undefined) {\n            throw new Error(\"This function requires the Provider interface implementor to have a 'publicKey' field.\");\n        }\n        return SystemProgram.createAccount({\n            fromPubkey: this._provider.publicKey,\n            newAccountPubkey: signer.publicKey,\n            space: sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size,\n            lamports: await this._provider.connection.getMinimumBalanceForRentExemption(sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size),\n            programId: this._programId,\n        });\n    }\n    async getAccountInfo(address, commitment) {\n        return await this._provider.connection.getAccountInfo(translateAddress(address), commitment);\n    }\n    async getAccountInfoAndContext(address, commitment) {\n        return await this._provider.connection.getAccountInfoAndContext(translateAddress(address), commitment);\n    }\n}\n// Tracks all subscriptions.\nconst subscriptions = new Map();\n\nconst PROGRAM_LOG = \"Program log: \";\nconst PROGRAM_DATA = \"Program data: \";\nconst PROGRAM_LOG_START_INDEX = PROGRAM_LOG.length;\nconst PROGRAM_DATA_START_INDEX = PROGRAM_DATA.length;\nclass EventManager {\n    constructor(programId, provider, coder) {\n        this._programId = programId;\n        this._provider = provider;\n        this._eventParser = new EventParser(programId, coder);\n        this._eventCallbacks = new Map();\n        this._eventListeners = new Map();\n        this._listenerIdCount = 0;\n    }\n    addEventListener(eventName, callback) {\n        var _a;\n        let listener = this._listenerIdCount;\n        this._listenerIdCount += 1;\n        // Store the listener into the event map.\n        if (!this._eventListeners.has(eventName)) {\n            this._eventListeners.set(eventName, []);\n        }\n        this._eventListeners.set(eventName, ((_a = this._eventListeners.get(eventName)) !== null && _a !== void 0 ? _a : []).concat(listener));\n        // Store the callback into the listener map.\n        this._eventCallbacks.set(listener, [eventName, callback]);\n        // Create the subscription singleton, if needed.\n        if (this._onLogsSubscriptionId !== undefined) {\n            return listener;\n        }\n        this._onLogsSubscriptionId = this._provider.connection.onLogs(this._programId, (logs, ctx) => {\n            if (logs.err) {\n                return;\n            }\n            for (const event of this._eventParser.parseLogs(logs.logs)) {\n                const allListeners = this._eventListeners.get(event.name);\n                if (allListeners) {\n                    allListeners.forEach((listener) => {\n                        const listenerCb = this._eventCallbacks.get(listener);\n                        if (listenerCb) {\n                            const [, callback] = listenerCb;\n                            callback(event.data, ctx.slot, logs.signature);\n                        }\n                    });\n                }\n            }\n        });\n        return listener;\n    }\n    async removeEventListener(listener) {\n        // Get the callback.\n        const callback = this._eventCallbacks.get(listener);\n        if (!callback) {\n            throw new Error(`Event listener ${listener} doesn't exist!`);\n        }\n        const [eventName] = callback;\n        // Get the listeners.\n        let listeners = this._eventListeners.get(eventName);\n        if (!listeners) {\n            throw new Error(`Event listeners don't exist for ${eventName}!`);\n        }\n        // Update both maps.\n        this._eventCallbacks.delete(listener);\n        listeners = listeners.filter((l) => l !== listener);\n        this._eventListeners.set(eventName, listeners);\n        if (listeners.length === 0) {\n            this._eventListeners.delete(eventName);\n        }\n        // Kill the websocket connection if all listeners have been removed.\n        if (this._eventCallbacks.size === 0) {\n            if (this._eventListeners.size !== 0) {\n                throw new Error(`Expected event listeners size to be 0 but got ${this._eventListeners.size}`);\n            }\n            if (this._onLogsSubscriptionId !== undefined) {\n                await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId);\n                this._onLogsSubscriptionId = undefined;\n            }\n        }\n    }\n}\nclass EventParser {\n    constructor(programId, coder) {\n        this.coder = coder;\n        this.programId = programId;\n    }\n    // Each log given, represents an array of messages emitted by\n    // a single transaction, which can execute many different programs across\n    // CPI boundaries. However, the subscription is only interested in the\n    // events emitted by *this* program. In achieving this, we keep track of the\n    // program execution context by parsing each log and looking for a CPI\n    // `invoke` call. If one exists, we know a new program is executing. So we\n    // push the programId onto a stack and switch the program context. This\n    // allows us to track, for a given log, which program was executing during\n    // its emission, thereby allowing us to know if a given log event was\n    // emitted by *this* program. If it was, then we parse the raw string and\n    // emit the event if the string matches the event being subscribed to.\n    *parseLogs(logs, errorOnDecodeFailure = false) {\n        const logScanner = new LogScanner(logs);\n        const execution = new ExecutionContext();\n        let log = logScanner.next();\n        while (log !== null) {\n            let [event, newProgram, didPop] = this.handleLog(execution, log, errorOnDecodeFailure);\n            if (event) {\n                yield event;\n            }\n            if (newProgram) {\n                execution.push(newProgram);\n            }\n            if (didPop) {\n                execution.pop();\n            }\n            log = logScanner.next();\n        }\n    }\n    // Main log handler. Returns a three element array of the event, the\n    // next program that was invoked for CPI, and a boolean indicating if\n    // a program has completed execution (and thus should be popped off the\n    // execution stack).\n    handleLog(execution, log, errorOnDecodeFailure) {\n        // Executing program is this program.\n        if (execution.stack.length > 0 &&\n            execution.program() === this.programId.toString()) {\n            return this.handleProgramLog(log, errorOnDecodeFailure);\n        }\n        // Executing program is not this program.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs from *this* program.\n    handleProgramLog(log, errorOnDecodeFailure) {\n        // This is a `msg!` log or a `sol_log_data` log.\n        if (log.startsWith(PROGRAM_LOG) || log.startsWith(PROGRAM_DATA)) {\n            const logStr = log.startsWith(PROGRAM_LOG)\n                ? log.slice(PROGRAM_LOG_START_INDEX)\n                : log.slice(PROGRAM_DATA_START_INDEX);\n            const event = this.coder.events.decode(logStr);\n            if (errorOnDecodeFailure && event === null) {\n                throw new Error(`Unable to decode event ${logStr}`);\n            }\n            return [event, null, false];\n        }\n        // System log.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs when the current program being executing is *not* this.\n    handleSystemLog(log) {\n        // System component.\n        const logStart = log.split(\":\")[0];\n        // Did the program finish executing?\n        if (logStart.match(/^Program (.*) success/g) !== null) {\n            return [null, true];\n            // Recursive call.\n        }\n        else if (logStart.startsWith(`Program ${this.programId.toString()} invoke`)) {\n            return [this.programId.toString(), false];\n        }\n        // CPI call.\n        else if (logStart.includes(\"invoke\")) {\n            return [\"cpi\", false]; // Any string will do.\n        }\n        else {\n            return [null, false];\n        }\n    }\n}\n// Stack frame execution context, allowing one to track what program is\n// executing for a given log.\nclass ExecutionContext {\n    constructor() {\n        this.stack = [];\n    }\n    program() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        return this.stack[this.stack.length - 1];\n    }\n    push(newProgram) {\n        this.stack.push(newProgram);\n    }\n    pop() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        this.stack.pop();\n    }\n}\nclass LogScanner {\n    constructor(logs) {\n        this.logs = logs;\n    }\n    next() {\n        if (this.logs.length === 0) {\n            return null;\n        }\n        let l = this.logs[0];\n        this.logs = this.logs.slice(1);\n        return l;\n    }\n}\n\nclass SimulateFactory {\n    static build(idlIx, txFn, idlErrors, provider, coder, programId, idl) {\n        const simulate = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            let resp = undefined;\n            if (provider.simulate === undefined) {\n                throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");\n            }\n            try {\n                resp = await provider.simulate(tx, ctx.signers, (_a = ctx.options) === null || _a === void 0 ? void 0 : _a.commitment);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n            if (resp === undefined) {\n                throw new Error(\"Unable to simulate transaction\");\n            }\n            const logs = resp.logs;\n            if (!logs) {\n                throw new Error(\"Simulated logs not found\");\n            }\n            const events = [];\n            if (idl.events) {\n                let parser = new EventParser(programId, coder);\n                for (const event of parser.parseLogs(logs)) {\n                    events.push(event);\n                }\n            }\n            return { events, raw: logs };\n        };\n        return simulate;\n    }\n}\n\nfunction uint64(property) {\n    return new WrappedLayout(blob(8), (b) => u64.fromBuffer(b), (n) => n.toBuffer(), property);\n}\nfunction publicKey(property) {\n    return new WrappedLayout(blob(32), (b) => new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(b), (key) => key.toBuffer(), property);\n}\nfunction coption(layout, property) {\n    return new COptionLayout(layout, property);\n}\nclass WrappedLayout extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nclass COptionLayout extends Layout_2 {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = u32();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span + this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 4) + 4;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 4);\n        }\n        throw new Error(\"Invalid coption \" + this.layout.property);\n    }\n    getSpan(b, offset = 0) {\n        return this.layout.getSpan(b, offset + 4) + 4;\n    }\n}\nclass u64 extends (bn_js__WEBPACK_IMPORTED_MODULE_2___default()) {\n    /**\n     * Convert to Buffer representation\n     */\n    toBuffer() {\n        const a = super.toArray().reverse();\n        const b = Buffer.from(a);\n        if (b.length === 8) {\n            return b;\n        }\n        if (b.length >= 8) {\n            throw new Error(\"u64 too large\");\n        }\n        const zeroPad = Buffer.alloc(8);\n        b.copy(zeroPad);\n        return zeroPad;\n    }\n    /**\n     * Construct a u64 from Buffer representation\n     */\n    static fromBuffer(buffer) {\n        if (buffer.length !== 8) {\n            throw new Error(`Invalid buffer length: ${buffer.length}`);\n        }\n        return new u64([...buffer]\n            .reverse()\n            .map((i) => `00${i.toString(16)}`.slice(-2))\n            .join(\"\"), 16);\n    }\n}\nconst TOKEN_ACCOUNT_LAYOUT = struct([\n    publicKey(\"mint\"),\n    publicKey(\"owner\"),\n    uint64(\"amount\"),\n    coption(publicKey(), \"delegate\"),\n    ((p) => {\n        const U = union(u8(\"discriminator\"), null, p);\n        U.addVariant(0, struct([]), \"uninitialized\");\n        U.addVariant(1, struct([]), \"initialized\");\n        U.addVariant(2, struct([]), \"frozen\");\n        return U;\n    })(\"state\"),\n    coption(uint64(), \"isNative\"),\n    uint64(\"delegatedAmount\"),\n    coption(publicKey(), \"closeAuthority\"),\n]);\nfunction decodeTokenAccount(b) {\n    return TOKEN_ACCOUNT_LAYOUT.decode(b);\n}\n\n// Populates a given accounts context with PDAs and common missing accounts.\nclass AccountsResolver {\n    constructor(_args, _accounts, _provider, _programId, _idlIx, accountNamespace, _idlTypes, _customResolver) {\n        this._args = _args;\n        this._accounts = _accounts;\n        this._provider = _provider;\n        this._programId = _programId;\n        this._idlIx = _idlIx;\n        this._idlTypes = _idlTypes;\n        this._customResolver = _customResolver;\n        this._accountStore = new AccountStore(_provider, accountNamespace, _programId);\n    }\n    args(args) {\n        this._args = args;\n    }\n    // Note: We serially resolve PDAs one by one rather than doing them\n    //       in parallel because there can be dependencies between\n    //       addresses. That is, one PDA can be used as a seed in another.\n    async resolve() {\n        this.resolveEventCpi(this._idlIx.accounts);\n        this.resolveConst(this._idlIx.accounts);\n        // Auto populate pdas and relations until we stop finding new accounts\n        let depth = 0;\n        while ((await this.resolvePdasAndRelations(this._idlIx.accounts)) +\n            (await this.resolveCustom()) >\n            0) {\n            depth++;\n            if (depth === 16) {\n                throw new Error(\"Reached maximum depth for account resolution\");\n            }\n        }\n    }\n    resolveOptionals(accounts) {\n        Object.assign(this._accounts, this.resolveOptionalsHelper(accounts, this._idlIx.accounts));\n    }\n    get(path) {\n        // Only return if pubkey\n        const ret = path.reduce((acc, subPath) => acc && acc[subPath], this._accounts);\n        if (ret && ret.toBase58) {\n            return ret;\n        }\n    }\n    set(path, value) {\n        let cur = this._accounts;\n        path.forEach((p, i) => {\n            var _a;\n            const isLast = i === path.length - 1;\n            if (isLast) {\n                cur[p] = value;\n            }\n            cur[p] = (_a = cur[p]) !== null && _a !== void 0 ? _a : {};\n            cur = cur[p];\n        });\n    }\n    resolveOptionalsHelper(partialAccounts, accounts) {\n        const nestedAccountsGeneric = {};\n        // Looping through accountItem array instead of on partialAccounts, so\n        // we only traverse array once\n        for (const accountItem of accounts) {\n            const accountName = accountItem.name;\n            const partialAccount = partialAccounts[accountName];\n            // Skip if the account isn't included (thus would be undefined)\n            if (partialAccount === undefined)\n                continue;\n            if (isPartialAccounts(partialAccount)) {\n                // is compound accounts, recurse one level deeper\n                if (isCompositeAccounts(accountItem)) {\n                    nestedAccountsGeneric[accountName] = this.resolveOptionalsHelper(partialAccount, accountItem[\"accounts\"]);\n                }\n                else {\n                    // Here we try our best to recover gracefully. If there are optionals we can't check, we will fail then.\n                    nestedAccountsGeneric[accountName] = flattenPartialAccounts(partialAccount, true);\n                }\n            }\n            else {\n                // if not compound accounts, do null/optional check and proceed\n                if (partialAccount !== null) {\n                    nestedAccountsGeneric[accountName] = translateAddress(partialAccount);\n                }\n                else if (accountItem[\"optional\"]) {\n                    nestedAccountsGeneric[accountName] = this._programId;\n                }\n            }\n        }\n        return nestedAccountsGeneric;\n    }\n    async resolveCustom() {\n        if (this._customResolver) {\n            const { accounts, resolved } = await this._customResolver({\n                args: this._args,\n                accounts: this._accounts,\n                provider: this._provider,\n                programId: this._programId,\n                idlIx: this._idlIx,\n            });\n            this._accounts = accounts;\n            return resolved;\n        }\n        return 0;\n    }\n    /**\n     * Resolve event CPI accounts `eventAuthority` and `program`.\n     *\n     * Accounts will only be resolved if they are declared next to each other to\n     * reduce the chance of name collision.\n     */\n    resolveEventCpi(accounts, path = []) {\n        for (const i in accounts) {\n            const accountOrAccounts = accounts[i];\n            if (isCompositeAccounts(accountOrAccounts)) {\n                this.resolveEventCpi(accountOrAccounts.accounts, [\n                    ...path,\n                    accountOrAccounts.name,\n                ]);\n            }\n            // Validate next index exists\n            const nextIndex = +i + 1;\n            if (nextIndex === accounts.length)\n                return;\n            const currentName = accounts[i].name;\n            const nextName = accounts[nextIndex].name;\n            // Populate event CPI accounts if they exist\n            if (currentName === \"eventAuthority\" && nextName === \"program\") {\n                const currentPath = [...path, currentName];\n                const nextPath = [...path, nextName];\n                if (!this.get(currentPath)) {\n                    this.set(currentPath, PublicKey.findProgramAddressSync([Buffer.from(\"__event_authority\")], this._programId)[0]);\n                }\n                if (!this.get(nextPath)) {\n                    this.set(nextPath, this._programId);\n                }\n                return;\n            }\n        }\n    }\n    resolveConst(accounts, path = []) {\n        for (const accountOrAccounts of accounts) {\n            const name = accountOrAccounts.name;\n            if (isCompositeAccounts(accountOrAccounts)) {\n                this.resolveConst(accountOrAccounts.accounts, [...path, name]);\n            }\n            else {\n                const account = accountOrAccounts;\n                if ((account.signer || account.address) && !this.get([...path, name])) {\n                    // Default signers to the provider\n                    if (account.signer) {\n                        // @ts-expect-error\n                        if (!this._provider.wallet) {\n                            throw new Error(\"This function requires the `Provider` interface implementor to have a `wallet` field.\");\n                        }\n                        // @ts-expect-error\n                        this.set([...path, name], this._provider.wallet.publicKey);\n                    }\n                    // Set based on `address` field\n                    if (account.address) {\n                        this.set([...path, name], translateAddress(account.address));\n                    }\n                }\n            }\n        }\n    }\n    async resolvePdasAndRelations(accounts, path = []) {\n        let found = 0;\n        for (const accountOrAccounts of accounts) {\n            const name = accountOrAccounts.name;\n            if (isCompositeAccounts(accountOrAccounts)) {\n                found += await this.resolvePdasAndRelations(accountOrAccounts.accounts, [...path, name]);\n            }\n            else {\n                const account = accountOrAccounts;\n                if ((account.pda || account.relations) && !this.get([...path, name])) {\n                    found++;\n                    // Accounts might not get resolved successfully if a seed depends on\n                    // another seed to be resolved *and* the accounts for resolution are\n                    // out of order. In this case, skip the accounts that throw in order\n                    // to resolve those accounts later.\n                    try {\n                        if (account.pda) {\n                            const seeds = await Promise.all(account.pda.seeds.map((seed) => this.toBuffer(seed, path)));\n                            if (seeds.some((seed) => !seed)) {\n                                continue;\n                            }\n                            const programId = await this.parseProgramId(account, path);\n                            const [pubkey] = PublicKey.findProgramAddressSync(seeds, programId);\n                            this.set([...path, name], pubkey);\n                        }\n                    }\n                    catch { }\n                    try {\n                        if (account.relations) {\n                            const accountKey = this.get([...path, account.relations[0]]);\n                            if (accountKey) {\n                                const account = await this._accountStore.fetchAccount({\n                                    publicKey: accountKey,\n                                });\n                                this.set([...path, name], account[name]);\n                            }\n                        }\n                    }\n                    catch { }\n                }\n            }\n        }\n        return found;\n    }\n    async parseProgramId(account, path = []) {\n        var _a;\n        if (!((_a = account.pda) === null || _a === void 0 ? void 0 : _a.program)) {\n            return this._programId;\n        }\n        const buf = await this.toBuffer(account.pda.program, path);\n        if (!buf) {\n            throw new Error(`Program seed not resolved: ${account.name}`);\n        }\n        return new PublicKey(buf);\n    }\n    async toBuffer(seed, path = []) {\n        switch (seed.kind) {\n            case \"const\":\n                return this.toBufferConst(seed);\n            case \"arg\":\n                return await this.toBufferArg(seed);\n            case \"account\":\n                return await this.toBufferAccount(seed, path);\n            default:\n                throw new Error(`Unexpected seed: ${seed}`);\n        }\n    }\n    toBufferConst(seed) {\n        return this.toBufferValue(\"bytes\", seed.value);\n    }\n    async toBufferArg(seed) {\n        const [name, ...path] = seed.path.split(\".\");\n        const index = this._idlIx.args.findIndex((arg) => arg.name === name);\n        if (index === -1) {\n            throw new Error(`Unable to find argument for seed: ${name}`);\n        }\n        const value = path.reduce((acc, path) => (acc !== null && acc !== void 0 ? acc : {})[path], this._args[index]);\n        if (value === undefined) {\n            return;\n        }\n        const type = this.getType(this._idlIx.args[index].type, path);\n        return this.toBufferValue(type, value);\n    }\n    async toBufferAccount(seed, path = []) {\n        const [name, ...paths] = seed.path.split(\".\");\n        const fieldPubkey = this.get([...path, name]);\n        if (!fieldPubkey)\n            return;\n        // The seed is a pubkey of the account.\n        if (!paths.length) {\n            return this.toBufferValue(\"pubkey\", fieldPubkey);\n        }\n        if (!seed.account) {\n            throw new Error(`Seed account is required in order to resolve type: ${seed.path}`);\n        }\n        // The key is account data.\n        //\n        // Fetch and deserialize it.\n        const account = await this._accountStore.fetchAccount({\n            publicKey: fieldPubkey,\n            name: seed.account,\n        });\n        // Dereference all fields in the path to get the field value\n        // used in the seed.\n        let accountValue = account;\n        let currentPaths = paths;\n        while (currentPaths.length > 0) {\n            accountValue = accountValue[currentPaths[0]];\n            currentPaths = currentPaths.slice(1);\n        }\n        if (accountValue === undefined)\n            return;\n        const type = this.getType({ defined: { name: seed.account } }, paths);\n        return this.toBufferValue(type, accountValue);\n    }\n    /**\n     * Converts the given idl valaue into a Buffer. The values here must be\n     * primitives, e.g. no structs.\n     */\n    toBufferValue(type, value) {\n        switch (type) {\n            case \"u8\":\n            case \"i8\":\n                return Buffer.from([value]);\n            case \"u16\":\n            case \"i16\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 2);\n            case \"u32\":\n            case \"i32\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 4);\n            case \"u64\":\n            case \"i64\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 8);\n            case \"u128\":\n            case \"i128\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 16);\n            case \"u256\":\n            case \"i256\":\n                return new BN(value).toArrayLike(Buffer, \"le\", 32);\n            case \"string\":\n                return Buffer.from(value);\n            case \"pubkey\":\n                return value.toBuffer();\n            case \"bytes\":\n                return Buffer.from(value);\n            default:\n                if (type === null || type === void 0 ? void 0 : type.array) {\n                    return Buffer.from(value);\n                }\n                throw new Error(`Unexpected seed type: ${type}`);\n        }\n    }\n    /**\n     * Recursively get the type at some path of either a primitive or a user\n     * defined struct.\n     */\n    getType(type, path = []) {\n        var _a;\n        const typeName = (_a = type === null || type === void 0 ? void 0 : type.defined) === null || _a === void 0 ? void 0 : _a.name;\n        if (typeName) {\n            // Handle token account separately\n            if (typeName === \"tokenAccount\") {\n                switch (path.at(0)) {\n                    case \"mint\":\n                    case \"owner\":\n                        return \"pubkey\";\n                    case \"amount\":\n                    case \"delagatedAmount\":\n                        return \"u64\";\n                    default:\n                        throw new Error(`Unknown token account path: ${path}`);\n                }\n            }\n            const definedType = this._idlTypes.find((t) => t.name === typeName);\n            if (!definedType) {\n                throw new Error(`Type not found: ${typeName}`);\n            }\n            // Only named structs are supported\n            const [fieldName, ...subPath] = path;\n            const fields = definedType.type\n                .fields;\n            const field = fields.find((field) => field.name === fieldName);\n            if (!field) {\n                throw new Error(`Field not found: ${fieldName}`);\n            }\n            return this.getType(field.type, subPath);\n        }\n        return type;\n    }\n}\n// TODO: this should be configurable to avoid unnecessary requests.\nclass AccountStore {\n    constructor(_provider, accounts, programId) {\n        this._provider = _provider;\n        this._cache = new Map();\n        this._idls = {};\n        this._idls[programId.toBase58()] = accounts;\n    }\n    async fetchAccount({ publicKey, name, }) {\n        const address = publicKey.toBase58();\n        if (!this._cache.has(address)) {\n            const accountInfo = await this._provider.connection.getAccountInfo(publicKey);\n            if (accountInfo === null) {\n                throw new Error(`Account not found: ${address}`);\n            }\n            if (name === \"tokenAccount\") {\n                const account = decodeTokenAccount(accountInfo.data);\n                this._cache.set(address, account);\n            }\n            else {\n                const accounts = await this.getAccountsNs(accountInfo.owner);\n                if (accounts) {\n                    const accountNs = Object.values(accounts)[0];\n                    if (accountNs) {\n                        const account = accountNs.coder.accounts.decodeAny(accountInfo.data);\n                        this._cache.set(address, account);\n                    }\n                }\n            }\n        }\n        return this._cache.get(address);\n    }\n    async getAccountsNs(programId) {\n        const programIdStr = programId.toBase58();\n        if (!this._idls[programIdStr]) {\n            const idl = await Program.fetchIdl(programId, this._provider);\n            if (idl) {\n                const program = new Program(idl, this._provider);\n                this._idls[programIdStr] = program.account;\n            }\n        }\n        return this._idls[programIdStr];\n    }\n}\n\nclass MethodsBuilderFactory {\n    static build(provider, programId, idlIx, ixFn, txFn, rpcFn, simulateFn, viewFn, accountNamespace, idlTypes, customResolver) {\n        return (...args) => new MethodsBuilder(args, ixFn, txFn, rpcFn, simulateFn, viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n}\nfunction isPartialAccounts(partialAccount) {\n    return (typeof partialAccount === \"object\" &&\n        partialAccount !== null &&\n        !(\"_bn\" in partialAccount) // Ensures not a pubkey\n    );\n}\nfunction flattenPartialAccounts(partialAccounts, throwOnNull) {\n    const toReturn = {};\n    for (const accountName in partialAccounts) {\n        const account = partialAccounts[accountName];\n        if (account === null) {\n            if (throwOnNull)\n                throw new Error(\"Failed to resolve optionals due to IDL type mismatch with input accounts!\");\n            continue;\n        }\n        toReturn[accountName] = isPartialAccounts(account)\n            ? flattenPartialAccounts(account, true)\n            : translateAddress(account);\n    }\n    return toReturn;\n}\nclass MethodsBuilder {\n    constructor(_args, _ixFn, _txFn, _rpcFn, _simulateFn, _viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver) {\n        this._args = _args;\n        this._ixFn = _ixFn;\n        this._txFn = _txFn;\n        this._rpcFn = _rpcFn;\n        this._simulateFn = _simulateFn;\n        this._viewFn = _viewFn;\n        this._accounts = {};\n        this._remainingAccounts = [];\n        this._signers = [];\n        this._preInstructions = [];\n        this._postInstructions = [];\n        this._resolveAccounts = true;\n        this._accountsResolver = new AccountsResolver(_args, this._accounts, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n    args(args) {\n        this._args = args;\n        this._accountsResolver.args(args);\n    }\n    /**\n     * Set instruction accounts with account resolution.\n     *\n     * This method only accepts accounts that cannot be resolved.\n     *\n     * See {@link accountsPartial} for overriding the account resolution or\n     * {@link accountsStrict} for strictly specifying all accounts.\n     */\n    accounts(accounts) {\n        // @ts-ignore\n        return this.accountsPartial(accounts);\n    }\n    /**\n     * Set instruction accounts with account resolution.\n     *\n     * There is no functional difference between this method and {@link accounts}\n     * method, the only difference is this method allows specifying all accounts\n     * even if they can be resolved. On the other hand, {@link accounts} method\n     * doesn't accept accounts that can be resolved.\n     */\n    accountsPartial(accounts) {\n        this._resolveAccounts = true;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    /**\n     * Set instruction accounts without account resolution.\n     *\n     * All accounts strictly need to be specified when this method is used.\n     *\n     * See {@link accounts} and {@link accountsPartial} methods for automatically\n     * resolving accounts.\n     */\n    accountsStrict(accounts) {\n        this._resolveAccounts = false;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    signers(signers) {\n        this._signers = this._signers.concat(signers);\n        return this;\n    }\n    remainingAccounts(accounts) {\n        this._remainingAccounts = this._remainingAccounts.concat(accounts);\n        return this;\n    }\n    preInstructions(ixs, prepend = false) {\n        if (prepend) {\n            this._preInstructions = ixs.concat(this._preInstructions);\n        }\n        else {\n            this._preInstructions = this._preInstructions.concat(ixs);\n        }\n        return this;\n    }\n    postInstructions(ixs) {\n        this._postInstructions = this._postInstructions.concat(ixs);\n        return this;\n    }\n    /**\n     * Get the public keys of the instruction accounts.\n     *\n     * The return type is an object with account names as keys and their public\n     * keys as their values.\n     *\n     * Note that an account key is `undefined` if the account hasn't yet been\n     * specified or resolved.\n     */\n    async pubkeys() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._accounts;\n    }\n    async rpc(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._rpcFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async rpcAndKeys(options) {\n        const pubkeys = await this.pubkeys();\n        return {\n            pubkeys: pubkeys,\n            signature: await this.rpc(options),\n        };\n    }\n    async view(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        if (!this._viewFn) {\n            throw new Error(\"Method does not support views\");\n        }\n        // @ts-ignore\n        return this._viewFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async simulate(options) {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._simulateFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options,\n        });\n    }\n    async instruction() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._ixFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n    /**\n     * Convenient shortcut to get instructions and pubkeys via:\n     *\n     * ```ts\n     * const { pubkeys, instructions } = await method.prepare();\n     * ```\n     */\n    async prepare() {\n        return {\n            instruction: await this.instruction(),\n            pubkeys: await this.pubkeys(),\n            signers: this._signers,\n        };\n    }\n    async transaction() {\n        if (this._resolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._txFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n}\n\nclass ViewFactory {\n    static build(programId, idlIx, simulateFn, idl) {\n        const isWritable = idlIx.accounts.find((a) => a.writable);\n        const hasReturn = !!idlIx.returns;\n        if (isWritable || !hasReturn)\n            return;\n        const view = async (...args) => {\n            let simulationResult = await simulateFn(...args);\n            const returnPrefix = `Program return: ${programId} `;\n            let returnLog = simulationResult.raw.find((l) => l.startsWith(returnPrefix));\n            if (!returnLog) {\n                throw new Error(\"View expected return log\");\n            }\n            let returnData = decode(returnLog.slice(returnPrefix.length));\n            let returnType = idlIx.returns;\n            if (!returnType) {\n                throw new Error(\"View expected return type\");\n            }\n            const coder = IdlCoder.fieldLayout({ type: returnType }, idl.types);\n            return coder.decode(returnData);\n        };\n        return view;\n    }\n}\n\nclass NamespaceFactory {\n    /**\n     * Generates all namespaces for a given program.\n     */\n    static build(idl, coder, programId, provider, getCustomResolver) {\n        const rpc = {};\n        const instruction = {};\n        const transaction = {};\n        const simulate = {};\n        const methods = {};\n        const view = {};\n        const idlErrors = parseIdlErrors(idl);\n        const account = idl.accounts\n            ? AccountFactory.build(idl, coder, programId, provider)\n            : {};\n        idl.instructions.forEach((idlIx) => {\n            const ixItem = InstructionNamespaceFactory.build(idlIx, (ixName, ix) => coder.instruction.encode(ixName, ix), programId);\n            const txItem = TransactionFactory.build(idlIx, ixItem);\n            const rpcItem = RpcFactory.build(idlIx, txItem, idlErrors, provider);\n            const simulateItem = SimulateFactory.build(idlIx, txItem, idlErrors, provider, coder, programId, idl);\n            const viewItem = ViewFactory.build(programId, idlIx, simulateItem, idl);\n            const methodItem = MethodsBuilderFactory.build(provider, programId, idlIx, ixItem, txItem, rpcItem, simulateItem, viewItem, account, idl.types || [], getCustomResolver === null || getCustomResolver === void 0 ? void 0 : getCustomResolver(idlIx));\n            const name = idlIx.name;\n            instruction[name] = ixItem;\n            transaction[name] = txItem;\n            rpc[name] = rpcItem;\n            simulate[name] = simulateItem;\n            methods[name] = methodItem;\n            if (viewItem) {\n                view[name] = viewItem;\n            }\n        });\n        return [\n            rpc,\n            instruction,\n            transaction,\n            account,\n            simulate,\n            methods,\n            view,\n        ];\n    }\n}\n\n/**\n * ## Program\n *\n * Program provides the IDL deserialized client representation of an Anchor\n * program.\n *\n * This API is the one stop shop for all things related to communicating with\n * on-chain programs. Among other things, one can send transactions, fetch\n * deserialized accounts, decode instruction data, subscribe to account\n * changes, and listen to events.\n *\n * In addition to field accessors and methods, the object provides a set of\n * dynamically generated properties, also known as namespaces, that\n * map one-to-one to program methods and accounts. These namespaces generally\n *  can be used as follows:\n *\n * ## Usage\n *\n * ```javascript\n * program.<namespace>.<program-specific-method>\n * ```\n *\n * API specifics are namespace dependent. The examples used in the documentation\n * below will refer to the two counter examples found\n * [here](https://github.com/coral-xyz/anchor#examples).\n */\nclass Program {\n    /**\n     * Address of the program.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * IDL in camelCase format to work in TypeScript.\n     *\n     * See {@link rawIdl} field if you need the original IDL.\n     */\n    get idl() {\n        return this._idl;\n    }\n    /**\n     * Raw IDL i.e. the original IDL without camelCase conversion.\n     *\n     * See {@link idl} field if you need the camelCased version of the IDL.\n     */\n    get rawIdl() {\n        return this._rawIdl;\n    }\n    /**\n     * Coder for serializing requests.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * @param idl       The interface definition.\n     * @param provider  The network and wallet context to use. If not provided\n     *                  then uses [[getProvider]].\n     * @param getCustomResolver A function that returns a custom account resolver\n     *                          for the given instruction. This is useful for resolving\n     *                          public keys of missing accounts when building instructions\n     */\n    constructor(idl, provider = getProvider(), coder, getCustomResolver) {\n        const camelCasedIdl = convertIdlToCamelCase(idl);\n        // Fields.\n        this._idl = camelCasedIdl;\n        this._rawIdl = idl;\n        this._provider = provider;\n        this._programId = translateAddress(idl.address);\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(camelCasedIdl);\n        this._events = new EventManager(this._programId, provider, this._coder);\n        // Dynamic namespaces.\n        const [rpc, instruction, transaction, account, simulate, methods, views] = NamespaceFactory.build(camelCasedIdl, this._coder, this._programId, provider, getCustomResolver);\n        this.rpc = rpc;\n        this.instruction = instruction;\n        this.transaction = transaction;\n        this.account = account;\n        this.simulate = simulate;\n        this.methods = methods;\n        this.views = views;\n    }\n    /**\n     * Generates a Program client by fetching the IDL from the network.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async at(address, provider) {\n        const programId = translateAddress(address);\n        const idl = await Program.fetchIdl(programId, provider);\n        if (!idl) {\n            throw new Error(`IDL not found for program: ${address.toString()}`);\n        }\n        return new Program(idl, provider);\n    }\n    /**\n     * Fetches an idl from the blockchain.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async fetchIdl(address, provider) {\n        provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        const programId = translateAddress(address);\n        const idlAddr = await idlAddress(programId);\n        const accountInfo = await provider.connection.getAccountInfo(idlAddr);\n        if (!accountInfo) {\n            return null;\n        }\n        // Chop off account discriminator.\n        let idlAccount = decodeIdlAccount(accountInfo.data.slice(8));\n        const inflatedIdl = inflate(idlAccount.data);\n        return JSON.parse(decode$2(inflatedIdl));\n    }\n    /**\n     * Invokes the given callback every time the given event is emitted.\n     *\n     * @param eventName The PascalCase name of the event, provided by the IDL.\n     * @param callback  The function to invoke whenever the event is emitted from\n     *                  program logs.\n     */\n    addEventListener(eventName, callback) {\n        return this._events.addEventListener(eventName, callback);\n    }\n    /**\n     * Unsubscribes from the given eventName.\n     */\n    async removeEventListener(listener) {\n        return await this._events.removeEventListener(listener);\n    }\n}\n\nnew _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"11111111111111111111111111111111\");\nfunction program(provider) {\n    return new Program(IDL, provider, coder());\n}\nfunction coder() {\n    return new SystemCoder(IDL);\n}\nconst IDL = {\n    address: \"11111111111111111111111111111111\",\n    metadata: {\n        name: \"systemProgram\",\n        version: \"0.1.0\",\n        spec: \"0.1.0\",\n    },\n    instructions: [\n        {\n            name: \"advanceNonceAccount\",\n            discriminator: [4, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"allocate\",\n            discriminator: [8, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"allocateWithSeed\",\n            discriminator: [9, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"account\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"assign\",\n            discriminator: [1, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"assignWithSeed\",\n            discriminator: [10, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"account\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"authorizeNonceAccount\",\n            discriminator: [7, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"createAccount\",\n            discriminator: [0, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"createAccountWithSeed\",\n            discriminator: [3, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"pubkey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"initializeNonceAccount\",\n            discriminator: [6, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"rent\",\n                    address: \"SysvarRent111111111111111111111111111111111\",\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"transfer\",\n            discriminator: [2, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"transferWithSeed\",\n            discriminator: [11, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"from\",\n                    writable: true,\n                },\n                {\n                    name: \"base\",\n                    signer: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"pubkey\",\n                },\n            ],\n        },\n        {\n            name: \"withdrawNonceAccount\",\n            discriminator: [5, 0, 0, 0],\n            accounts: [\n                {\n                    name: \"nonce\",\n                    writable: true,\n                },\n                {\n                    name: \"to\",\n                    writable: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                },\n                {\n                    name: \"rent\",\n                    address: \"SysvarRent111111111111111111111111111111111\",\n                },\n                {\n                    name: \"authorized\",\n                    signer: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n    ],\n    accounts: [\n        {\n            name: \"nonce\",\n            discriminator: [],\n        },\n    ],\n    types: [\n        {\n            name: \"feeCalculator\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"lamportsPerSignature\",\n                        type: \"u64\",\n                    },\n                ],\n            },\n        },\n        {\n            name: \"nonce\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"version\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"state\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"authorizedPubkey\",\n                        type: \"pubkey\",\n                    },\n                    {\n                        name: \"nonce\",\n                        type: \"pubkey\",\n                    },\n                    {\n                        name: \"feeCalculator\",\n                        type: {\n                            defined: {\n                                name: \"feeCalculator\",\n                            },\n                        },\n                    },\n                ],\n            },\n        },\n    ],\n};\n\nclass Native {\n    static system(provider) {\n        return program(provider);\n    }\n}\n\n\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 3909:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\nvar __webpack_unused_export__;\n\n__webpack_unused_export__ = ({ value: true });\nconst buffer_1 = __webpack_require__(8764);\nconst web3_js_1 = __webpack_require__(6737);\nconst common_js_1 = __webpack_require__(7070);\n/**\n * Node only wallet.\n */\nclass NodeWallet {\n    constructor(payer) {\n        this.payer = payer;\n    }\n    static local() {\n        const process = __webpack_require__(4155);\n        if (!process.env.ANCHOR_WALLET || process.env.ANCHOR_WALLET === \"\") {\n            throw new Error(\"expected environment variable `ANCHOR_WALLET` is not set.\");\n        }\n        const payer = web3_js_1.Keypair.fromSecretKey(buffer_1.Buffer.from(JSON.parse((__webpack_require__(6793).readFileSync)(process.env.ANCHOR_WALLET, {\n            encoding: \"utf-8\",\n        }))));\n        return new NodeWallet(payer);\n    }\n    async signTransaction(tx) {\n        if ((0, common_js_1.isVersionedTransaction)(tx)) {\n            tx.sign([this.payer]);\n        }\n        else {\n            tx.partialSign(this.payer);\n        }\n        return tx;\n    }\n    async signAllTransactions(txs) {\n        return txs.map((t) => {\n            if ((0, common_js_1.isVersionedTransaction)(t)) {\n                t.sign([this.payer]);\n            }\n            else {\n                t.partialSign(this.payer);\n            }\n            return t;\n        });\n    }\n    get publicKey() {\n        return this.payer.publicKey;\n    }\n}\nexports.Z = NodeWallet;\n//# sourceMappingURL=nodewallet.js.map\n\n/***/ }),\n\n/***/ 7070:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var process = __webpack_require__(4155);\n\nvar _a;\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.isVersionedTransaction = exports.chunks = exports.isBrowser = void 0;\n/**\n * Returns true if being run inside a web browser,\n * false if in a Node process or electron app.\n */\nexports.isBrowser = process.env.ANCHOR_BROWSER ||\n    (typeof window !== \"undefined\" && !((_a = window.process) === null || _a === void 0 ? void 0 : _a.hasOwnProperty(\"type\")));\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\nexports.chunks = chunks;\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\nexports.isVersionedTransaction = isVersionedTransaction;\n//# sourceMappingURL=common.js.map\n\n/***/ }),\n\n/***/ 8633:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar basex = __webpack_require__(8162)\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 4037:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nconst UPPERCASE = /[\\p{Lu}]/u;\nconst LOWERCASE = /[\\p{Ll}]/u;\nconst LEADING_CAPITAL = /^[\\p{Lu}](?![\\p{Lu}])/gu;\nconst IDENTIFIER = /([\\p{Alpha}\\p{N}_]|$)/u;\nconst SEPARATORS = /[_.\\- ]+/;\n\nconst LEADING_SEPARATORS = new RegExp('^' + SEPARATORS.source);\nconst SEPARATORS_AND_IDENTIFIER = new RegExp(SEPARATORS.source + IDENTIFIER.source, 'gu');\nconst NUMBERS_AND_IDENTIFIER = new RegExp('\\\\d+' + IDENTIFIER.source, 'gu');\n\nconst preserveCamelCase = (string, toLowerCase, toUpperCase) => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && UPPERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && LOWERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = toLowerCase(character) === character && toUpperCase(character) !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = toUpperCase(character) === character && toLowerCase(character) !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst preserveConsecutiveUppercase = (input, toLowerCase) => {\n\tLEADING_CAPITAL.lastIndex = 0;\n\n\treturn input.replace(LEADING_CAPITAL, m1 => toLowerCase(m1));\n};\n\nconst postProcess = (input, toUpperCase) => {\n\tSEPARATORS_AND_IDENTIFIER.lastIndex = 0;\n\tNUMBERS_AND_IDENTIFIER.lastIndex = 0;\n\n\treturn input.replace(SEPARATORS_AND_IDENTIFIER, (_, identifier) => toUpperCase(identifier))\n\t\t.replace(NUMBERS_AND_IDENTIFIER, m => toUpperCase(m));\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = {\n\t\tpascalCase: false,\n\t\tpreserveConsecutiveUppercase: false,\n\t\t...options\n\t};\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tconst toLowerCase = options.locale === false ?\n\t\tstring => string.toLowerCase() :\n\t\tstring => string.toLocaleLowerCase(options.locale);\n\tconst toUpperCase = options.locale === false ?\n\t\tstring => string.toUpperCase() :\n\t\tstring => string.toLocaleUpperCase(options.locale);\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? toUpperCase(input) : toLowerCase(input);\n\t}\n\n\tconst hasUpperCase = input !== toLowerCase(input);\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input, toLowerCase, toUpperCase);\n\t}\n\n\tinput = input.replace(LEADING_SEPARATORS, '');\n\n\tif (options.preserveConsecutiveUppercase) {\n\t\tinput = preserveConsecutiveUppercase(input, toLowerCase);\n\t} else {\n\t\tinput = toLowerCase(input);\n\t}\n\n\tif (options.pascalCase) {\n\t\tinput = toUpperCase(input.charAt(0)) + input.slice(1);\n\t}\n\n\treturn postProcess(input, toUpperCase);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports[\"default\"] = camelCase;\n\n\n/***/ }),\n\n/***/ 5970:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = __webpack_require__(698);\nconst web3_js_1 = __webpack_require__(6737);\nconst bn_js_1 = __importDefault(__webpack_require__(3550));\nvar buffer_layout_2 = __webpack_require__(698);\nObject.defineProperty(exports, \"u8\", ({ enumerable: true, get: function () { return buffer_layout_2.u8; } }));\nObject.defineProperty(exports, \"i8\", ({ enumerable: true, get: function () { return buffer_layout_2.s8; } }));\nObject.defineProperty(exports, \"u16\", ({ enumerable: true, get: function () { return buffer_layout_2.u16; } }));\nObject.defineProperty(exports, \"i16\", ({ enumerable: true, get: function () { return buffer_layout_2.s16; } }));\nObject.defineProperty(exports, \"u32\", ({ enumerable: true, get: function () { return buffer_layout_2.u32; } }));\nObject.defineProperty(exports, \"i32\", ({ enumerable: true, get: function () { return buffer_layout_2.s32; } }));\nObject.defineProperty(exports, \"f32\", ({ enumerable: true, get: function () { return buffer_layout_2.f32; } }));\nObject.defineProperty(exports, \"f64\", ({ enumerable: true, get: function () { return buffer_layout_2.f64; } }));\nObject.defineProperty(exports, \"struct\", ({ enumerable: true, get: function () { return buffer_layout_2.struct; } }));\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = (0, buffer_layout_1.blob)(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n    return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n    return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = (0, buffer_layout_1.u8)();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = (0, buffer_layout_1.struct)([\n        u64(\"tag\"),\n        layout.replicate(\"data\"),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error(\"Invalid tag, expected: \" +\n                tag.toString(\"hex\") +\n                \", got: \" +\n                receivedTag.toString(\"hex\"));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = (0, buffer_layout_1.struct)([\n        (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 8417:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ createCache; }\n});\n\n;// CONCATENATED MODULE: ./node_modules/@emotion/sheet/dist/emotion-sheet.browser.esm.js\n/*\n\nBased off glamor's StyleSheet, thanks Sunil ❤️\n\nhigh performance StyleSheet for css-in-js systems\n\n- uses multiple style tags behind the scenes for millions of rules\n- uses `insertRule` for appending in production for *much* faster performance\n\n// usage\n\nimport { StyleSheet } from '@emotion/sheet'\n\nlet styleSheet = new StyleSheet({ key: '', container: document.head })\n\nstyleSheet.insert('#box { border: 1px solid red; }')\n- appends a css rule into the stylesheet\n\nstyleSheet.flush()\n- empties the stylesheet of all its contents\n\n*/\n// $FlowFixMe\nfunction sheetForTag(tag) {\n  if (tag.sheet) {\n    // $FlowFixMe\n    return tag.sheet;\n  } // this weirdness brought to you by firefox\n\n  /* istanbul ignore next */\n\n\n  for (var i = 0; i < document.styleSheets.length; i++) {\n    if (document.styleSheets[i].ownerNode === tag) {\n      // $FlowFixMe\n      return document.styleSheets[i];\n    }\n  }\n}\n\nfunction createStyleElement(options) {\n  var tag = document.createElement('style');\n  tag.setAttribute('data-emotion', options.key);\n\n  if (options.nonce !== undefined) {\n    tag.setAttribute('nonce', options.nonce);\n  }\n\n  tag.appendChild(document.createTextNode(''));\n  tag.setAttribute('data-s', '');\n  return tag;\n}\n\nvar StyleSheet = /*#__PURE__*/function () {\n  // Using Node instead of HTMLElement since container may be a ShadowRoot\n  function StyleSheet(options) {\n    var _this = this;\n\n    this._insertTag = function (tag) {\n      var before;\n\n      if (_this.tags.length === 0) {\n        if (_this.insertionPoint) {\n          before = _this.insertionPoint.nextSibling;\n        } else if (_this.prepend) {\n          before = _this.container.firstChild;\n        } else {\n          before = _this.before;\n        }\n      } else {\n        before = _this.tags[_this.tags.length - 1].nextSibling;\n      }\n\n      _this.container.insertBefore(tag, before);\n\n      _this.tags.push(tag);\n    };\n\n    this.isSpeedy = options.speedy === undefined ? \"production\" === 'production' : options.speedy;\n    this.tags = [];\n    this.ctr = 0;\n    this.nonce = options.nonce; // key is the value of the data-emotion attribute, it's used to identify different sheets\n\n    this.key = options.key;\n    this.container = options.container;\n    this.prepend = options.prepend;\n    this.insertionPoint = options.insertionPoint;\n    this.before = null;\n  }\n\n  var _proto = StyleSheet.prototype;\n\n  _proto.hydrate = function hydrate(nodes) {\n    nodes.forEach(this._insertTag);\n  };\n\n  _proto.insert = function insert(rule) {\n    // the max length is how many rules we have per style tag, it's 65000 in speedy mode\n    // it's 1 in dev because we insert source maps that map a single rule to a location\n    // and you can only have one source map per style tag\n    if (this.ctr % (this.isSpeedy ? 65000 : 1) === 0) {\n      this._insertTag(createStyleElement(this));\n    }\n\n    var tag = this.tags[this.tags.length - 1];\n\n    if (false) { var isImportRule; }\n\n    if (this.isSpeedy) {\n      var sheet = sheetForTag(tag);\n\n      try {\n        // this is the ultrafast version, works across browsers\n        // the big drawback is that the css won't be editable in devtools\n        sheet.insertRule(rule, sheet.cssRules.length);\n      } catch (e) {\n        if (false) {}\n      }\n    } else {\n      tag.appendChild(document.createTextNode(rule));\n    }\n\n    this.ctr++;\n  };\n\n  _proto.flush = function flush() {\n    // $FlowFixMe\n    this.tags.forEach(function (tag) {\n      return tag.parentNode && tag.parentNode.removeChild(tag);\n    });\n    this.tags = [];\n    this.ctr = 0;\n\n    if (false) {}\n  };\n\n  return StyleSheet;\n}();\n\n\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Utility.js\n/**\n * @param {number}\n * @return {number}\n */\nvar abs = Math.abs\n\n/**\n * @param {number}\n * @return {string}\n */\nvar Utility_from = String.fromCharCode\n\n/**\n * @param {object}\n * @return {object}\n */\nvar Utility_assign = Object.assign\n\n/**\n * @param {string} value\n * @param {number} length\n * @return {number}\n */\nfunction hash (value, length) {\n\treturn Utility_charat(value, 0) ^ 45 ? (((((((length << 2) ^ Utility_charat(value, 0)) << 2) ^ Utility_charat(value, 1)) << 2) ^ Utility_charat(value, 2)) << 2) ^ Utility_charat(value, 3) : 0\n}\n\n/**\n * @param {string} value\n * @return {string}\n */\nfunction trim (value) {\n\treturn value.trim()\n}\n\n/**\n * @param {string} value\n * @param {RegExp} pattern\n * @return {string?}\n */\nfunction Utility_match (value, pattern) {\n\treturn (value = pattern.exec(value)) ? value[0] : value\n}\n\n/**\n * @param {string} value\n * @param {(string|RegExp)} pattern\n * @param {string} replacement\n * @return {string}\n */\nfunction Utility_replace (value, pattern, replacement) {\n\treturn value.replace(pattern, replacement)\n}\n\n/**\n * @param {string} value\n * @param {string} search\n * @return {number}\n */\nfunction indexof (value, search) {\n\treturn value.indexOf(search)\n}\n\n/**\n * @param {string} value\n * @param {number} index\n * @return {number}\n */\nfunction Utility_charat (value, index) {\n\treturn value.charCodeAt(index) | 0\n}\n\n/**\n * @param {string} value\n * @param {number} begin\n * @param {number} end\n * @return {string}\n */\nfunction Utility_substr (value, begin, end) {\n\treturn value.slice(begin, end)\n}\n\n/**\n * @param {string} value\n * @return {number}\n */\nfunction Utility_strlen (value) {\n\treturn value.length\n}\n\n/**\n * @param {any[]} value\n * @return {number}\n */\nfunction Utility_sizeof (value) {\n\treturn value.length\n}\n\n/**\n * @param {any} value\n * @param {any[]} array\n * @return {any}\n */\nfunction Utility_append (value, array) {\n\treturn array.push(value), value\n}\n\n/**\n * @param {string[]} array\n * @param {function} callback\n * @return {string}\n */\nfunction Utility_combine (array, callback) {\n\treturn array.map(callback).join('')\n}\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Tokenizer.js\n\n\nvar line = 1\nvar column = 1\nvar Tokenizer_length = 0\nvar position = 0\nvar character = 0\nvar characters = ''\n\n/**\n * @param {string} value\n * @param {object | null} root\n * @param {object | null} parent\n * @param {string} type\n * @param {string[] | string} props\n * @param {object[] | string} children\n * @param {number} length\n */\nfunction node (value, root, parent, type, props, children, length) {\n\treturn {value: value, root: root, parent: parent, type: type, props: props, children: children, line: line, column: column, length: length, return: ''}\n}\n\n/**\n * @param {object} root\n * @param {object} props\n * @return {object}\n */\nfunction Tokenizer_copy (root, props) {\n\treturn Utility_assign(node('', null, null, '', null, null, 0), root, {length: -root.length}, props)\n}\n\n/**\n * @return {number}\n */\nfunction Tokenizer_char () {\n\treturn character\n}\n\n/**\n * @return {number}\n */\nfunction prev () {\n\tcharacter = position > 0 ? Utility_charat(characters, --position) : 0\n\n\tif (column--, character === 10)\n\t\tcolumn = 1, line--\n\n\treturn character\n}\n\n/**\n * @return {number}\n */\nfunction next () {\n\tcharacter = position < Tokenizer_length ? Utility_charat(characters, position++) : 0\n\n\tif (column++, character === 10)\n\t\tcolumn = 1, line++\n\n\treturn character\n}\n\n/**\n * @return {number}\n */\nfunction peek () {\n\treturn Utility_charat(characters, position)\n}\n\n/**\n * @return {number}\n */\nfunction caret () {\n\treturn position\n}\n\n/**\n * @param {number} begin\n * @param {number} end\n * @return {string}\n */\nfunction slice (begin, end) {\n\treturn Utility_substr(characters, begin, end)\n}\n\n/**\n * @param {number} type\n * @return {number}\n */\nfunction token (type) {\n\tswitch (type) {\n\t\t// \\0 \\t \\n \\r \\s whitespace token\n\t\tcase 0: case 9: case 10: case 13: case 32:\n\t\t\treturn 5\n\t\t// ! + , / > @ ~ isolate token\n\t\tcase 33: case 43: case 44: case 47: case 62: case 64: case 126:\n\t\t// ; { } breakpoint token\n\t\tcase 59: case 123: case 125:\n\t\t\treturn 4\n\t\t// : accompanied token\n\t\tcase 58:\n\t\t\treturn 3\n\t\t// \" ' ( [ opening delimit token\n\t\tcase 34: case 39: case 40: case 91:\n\t\t\treturn 2\n\t\t// ) ] closing delimit token\n\t\tcase 41: case 93:\n\t\t\treturn 1\n\t}\n\n\treturn 0\n}\n\n/**\n * @param {string} value\n * @return {any[]}\n */\nfunction alloc (value) {\n\treturn line = column = 1, Tokenizer_length = Utility_strlen(characters = value), position = 0, []\n}\n\n/**\n * @param {any} value\n * @return {any}\n */\nfunction dealloc (value) {\n\treturn characters = '', value\n}\n\n/**\n * @param {number} type\n * @return {string}\n */\nfunction delimit (type) {\n\treturn trim(slice(position - 1, delimiter(type === 91 ? type + 2 : type === 40 ? type + 1 : type)))\n}\n\n/**\n * @param {string} value\n * @return {string[]}\n */\nfunction Tokenizer_tokenize (value) {\n\treturn dealloc(tokenizer(alloc(value)))\n}\n\n/**\n * @param {number} type\n * @return {string}\n */\nfunction whitespace (type) {\n\twhile (character = peek())\n\t\tif (character < 33)\n\t\t\tnext()\n\t\telse\n\t\t\tbreak\n\n\treturn token(type) > 2 || token(character) > 3 ? '' : ' '\n}\n\n/**\n * @param {string[]} children\n * @return {string[]}\n */\nfunction tokenizer (children) {\n\twhile (next())\n\t\tswitch (token(character)) {\n\t\t\tcase 0: append(identifier(position - 1), children)\n\t\t\t\tbreak\n\t\t\tcase 2: append(delimit(character), children)\n\t\t\t\tbreak\n\t\t\tdefault: append(from(character), children)\n\t\t}\n\n\treturn children\n}\n\n/**\n * @param {number} index\n * @param {number} count\n * @return {string}\n */\nfunction escaping (index, count) {\n\twhile (--count && next())\n\t\t// not 0-9 A-F a-f\n\t\tif (character < 48 || character > 102 || (character > 57 && character < 65) || (character > 70 && character < 97))\n\t\t\tbreak\n\n\treturn slice(index, caret() + (count < 6 && peek() == 32 && next() == 32))\n}\n\n/**\n * @param {number} type\n * @return {number}\n */\nfunction delimiter (type) {\n\twhile (next())\n\t\tswitch (character) {\n\t\t\t// ] ) \" '\n\t\t\tcase type:\n\t\t\t\treturn position\n\t\t\t// \" '\n\t\t\tcase 34: case 39:\n\t\t\t\tif (type !== 34 && type !== 39)\n\t\t\t\t\tdelimiter(character)\n\t\t\t\tbreak\n\t\t\t// (\n\t\t\tcase 40:\n\t\t\t\tif (type === 41)\n\t\t\t\t\tdelimiter(type)\n\t\t\t\tbreak\n\t\t\t// \\\n\t\t\tcase 92:\n\t\t\t\tnext()\n\t\t\t\tbreak\n\t\t}\n\n\treturn position\n}\n\n/**\n * @param {number} type\n * @param {number} index\n * @return {number}\n */\nfunction commenter (type, index) {\n\twhile (next())\n\t\t// //\n\t\tif (type + character === 47 + 10)\n\t\t\tbreak\n\t\t// /*\n\t\telse if (type + character === 42 + 42 && peek() === 47)\n\t\t\tbreak\n\n\treturn '/*' + slice(index, position - 1) + '*' + Utility_from(type === 47 ? type : next())\n}\n\n/**\n * @param {number} index\n * @return {string}\n */\nfunction identifier (index) {\n\twhile (!token(peek()))\n\t\tnext()\n\n\treturn slice(index, position)\n}\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Enum.js\nvar Enum_MS = '-ms-'\nvar Enum_MOZ = '-moz-'\nvar Enum_WEBKIT = '-webkit-'\n\nvar COMMENT = 'comm'\nvar Enum_RULESET = 'rule'\nvar Enum_DECLARATION = 'decl'\n\nvar PAGE = '@page'\nvar MEDIA = '@media'\nvar IMPORT = '@import'\nvar CHARSET = '@charset'\nvar VIEWPORT = '@viewport'\nvar SUPPORTS = '@supports'\nvar DOCUMENT = '@document'\nvar NAMESPACE = '@namespace'\nvar Enum_KEYFRAMES = '@keyframes'\nvar FONT_FACE = '@font-face'\nvar COUNTER_STYLE = '@counter-style'\nvar FONT_FEATURE_VALUES = '@font-feature-values'\nvar LAYER = '@layer'\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Serializer.js\n\n\n\n/**\n * @param {object[]} children\n * @param {function} callback\n * @return {string}\n */\nfunction Serializer_serialize (children, callback) {\n\tvar output = ''\n\tvar length = Utility_sizeof(children)\n\n\tfor (var i = 0; i < length; i++)\n\t\toutput += callback(children[i], i, children, callback) || ''\n\n\treturn output\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n * @param {function} callback\n * @return {string}\n */\nfunction stringify (element, index, children, callback) {\n\tswitch (element.type) {\n\t\tcase LAYER: if (element.children.length) break\n\t\tcase IMPORT: case Enum_DECLARATION: return element.return = element.return || element.value\n\t\tcase COMMENT: return ''\n\t\tcase Enum_KEYFRAMES: return element.return = element.value + '{' + Serializer_serialize(element.children, callback) + '}'\n\t\tcase Enum_RULESET: element.value = element.props.join(',')\n\t}\n\n\treturn Utility_strlen(children = Serializer_serialize(element.children, callback)) ? element.return = element.value + '{' + children + '}' : ''\n}\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Middleware.js\n\n\n\n\n\n\n/**\n * @param {function[]} collection\n * @return {function}\n */\nfunction middleware (collection) {\n\tvar length = Utility_sizeof(collection)\n\n\treturn function (element, index, children, callback) {\n\t\tvar output = ''\n\n\t\tfor (var i = 0; i < length; i++)\n\t\t\toutput += collection[i](element, index, children, callback) || ''\n\n\t\treturn output\n\t}\n}\n\n/**\n * @param {function} callback\n * @return {function}\n */\nfunction rulesheet (callback) {\n\treturn function (element) {\n\t\tif (!element.root)\n\t\t\tif (element = element.return)\n\t\t\t\tcallback(element)\n\t}\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n * @param {function} callback\n */\nfunction prefixer (element, index, children, callback) {\n\tif (element.length > -1)\n\t\tif (!element.return)\n\t\t\tswitch (element.type) {\n\t\t\t\tcase DECLARATION: element.return = prefix(element.value, element.length, children)\n\t\t\t\t\treturn\n\t\t\t\tcase KEYFRAMES:\n\t\t\t\t\treturn serialize([copy(element, {value: replace(element.value, '@', '@' + WEBKIT)})], callback)\n\t\t\t\tcase RULESET:\n\t\t\t\t\tif (element.length)\n\t\t\t\t\t\treturn combine(element.props, function (value) {\n\t\t\t\t\t\t\tswitch (match(value, /(::plac\\w+|:read-\\w+)/)) {\n\t\t\t\t\t\t\t\t// :read-(only|write)\n\t\t\t\t\t\t\t\tcase ':read-only': case ':read-write':\n\t\t\t\t\t\t\t\t\treturn serialize([copy(element, {props: [replace(value, /:(read-\\w+)/, ':' + MOZ + '$1')]})], callback)\n\t\t\t\t\t\t\t\t// :placeholder\n\t\t\t\t\t\t\t\tcase '::placeholder':\n\t\t\t\t\t\t\t\t\treturn serialize([\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, ':' + WEBKIT + 'input-$1')]}),\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, ':' + MOZ + '$1')]}),\n\t\t\t\t\t\t\t\t\t\tcopy(element, {props: [replace(value, /:(plac\\w+)/, MS + 'input-$1')]})\n\t\t\t\t\t\t\t\t\t], callback)\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\treturn ''\n\t\t\t\t\t\t})\n\t\t\t}\n}\n\n/**\n * @param {object} element\n * @param {number} index\n * @param {object[]} children\n */\nfunction namespace (element) {\n\tswitch (element.type) {\n\t\tcase RULESET:\n\t\t\telement.props = element.props.map(function (value) {\n\t\t\t\treturn combine(tokenize(value), function (value, index, children) {\n\t\t\t\t\tswitch (charat(value, 0)) {\n\t\t\t\t\t\t// \\f\n\t\t\t\t\t\tcase 12:\n\t\t\t\t\t\t\treturn substr(value, 1, strlen(value))\n\t\t\t\t\t\t// \\0 ( + > ~\n\t\t\t\t\t\tcase 0: case 40: case 43: case 62: case 126:\n\t\t\t\t\t\t\treturn value\n\t\t\t\t\t\t// :\n\t\t\t\t\t\tcase 58:\n\t\t\t\t\t\t\tif (children[++index] === 'global')\n\t\t\t\t\t\t\t\tchildren[index] = '', children[++index] = '\\f' + substr(children[index], index = 1, -1)\n\t\t\t\t\t\t// \\s\n\t\t\t\t\t\tcase 32:\n\t\t\t\t\t\t\treturn index === 1 ? '' : value\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tswitch (index) {\n\t\t\t\t\t\t\t\tcase 0: element = value\n\t\t\t\t\t\t\t\t\treturn sizeof(children) > 1 ? '' : value\n\t\t\t\t\t\t\t\tcase index = sizeof(children) - 1: case 2:\n\t\t\t\t\t\t\t\t\treturn index === 2 ? value + element + element : value + element\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\treturn value\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t})\n\t}\n}\n\n;// CONCATENATED MODULE: ./node_modules/stylis/src/Parser.js\n\n\n\n\n/**\n * @param {string} value\n * @return {object[]}\n */\nfunction compile (value) {\n\treturn dealloc(parse('', null, null, null, [''], value = alloc(value), 0, [0], value))\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {string[]} rule\n * @param {string[]} rules\n * @param {string[]} rulesets\n * @param {number[]} pseudo\n * @param {number[]} points\n * @param {string[]} declarations\n * @return {object}\n */\nfunction parse (value, root, parent, rule, rules, rulesets, pseudo, points, declarations) {\n\tvar index = 0\n\tvar offset = 0\n\tvar length = pseudo\n\tvar atrule = 0\n\tvar property = 0\n\tvar previous = 0\n\tvar variable = 1\n\tvar scanning = 1\n\tvar ampersand = 1\n\tvar character = 0\n\tvar type = ''\n\tvar props = rules\n\tvar children = rulesets\n\tvar reference = rule\n\tvar characters = type\n\n\twhile (scanning)\n\t\tswitch (previous = character, character = next()) {\n\t\t\t// (\n\t\t\tcase 40:\n\t\t\t\tif (previous != 108 && Utility_charat(characters, length - 1) == 58) {\n\t\t\t\t\tif (indexof(characters += Utility_replace(delimit(character), '&', '&\\f'), '&\\f') != -1)\n\t\t\t\t\t\tampersand = -1\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t// \" ' [\n\t\t\tcase 34: case 39: case 91:\n\t\t\t\tcharacters += delimit(character)\n\t\t\t\tbreak\n\t\t\t// \\t \\n \\r \\s\n\t\t\tcase 9: case 10: case 13: case 32:\n\t\t\t\tcharacters += whitespace(previous)\n\t\t\t\tbreak\n\t\t\t// \\\n\t\t\tcase 92:\n\t\t\t\tcharacters += escaping(caret() - 1, 7)\n\t\t\t\tcontinue\n\t\t\t// /\n\t\t\tcase 47:\n\t\t\t\tswitch (peek()) {\n\t\t\t\t\tcase 42: case 47:\n\t\t\t\t\t\tUtility_append(comment(commenter(next(), caret()), root, parent), declarations)\n\t\t\t\t\t\tbreak\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcharacters += '/'\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t// {\n\t\t\tcase 123 * variable:\n\t\t\t\tpoints[index++] = Utility_strlen(characters) * ampersand\n\t\t\t// } ; \\0\n\t\t\tcase 125 * variable: case 59: case 0:\n\t\t\t\tswitch (character) {\n\t\t\t\t\t// \\0 }\n\t\t\t\t\tcase 0: case 125: scanning = 0\n\t\t\t\t\t// ;\n\t\t\t\t\tcase 59 + offset: if (ampersand == -1) characters = Utility_replace(characters, /\\f/g, '')\n\t\t\t\t\t\tif (property > 0 && (Utility_strlen(characters) - length))\n\t\t\t\t\t\t\tUtility_append(property > 32 ? declaration(characters + ';', rule, parent, length - 1) : declaration(Utility_replace(characters, ' ', '') + ';', rule, parent, length - 2), declarations)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// @ ;\n\t\t\t\t\tcase 59: characters += ';'\n\t\t\t\t\t// { rule/at-rule\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tUtility_append(reference = ruleset(characters, root, parent, index, offset, rules, points, type, props = [], children = [], length), rulesets)\n\n\t\t\t\t\t\tif (character === 123)\n\t\t\t\t\t\t\tif (offset === 0)\n\t\t\t\t\t\t\t\tparse(characters, root, reference, reference, props, rulesets, length, points, children)\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tswitch (atrule === 99 && Utility_charat(characters, 3) === 110 ? 100 : atrule) {\n\t\t\t\t\t\t\t\t\t// d l m s\n\t\t\t\t\t\t\t\t\tcase 100: case 108: case 109: case 115:\n\t\t\t\t\t\t\t\t\t\tparse(value, reference, reference, rule && Utility_append(ruleset(value, reference, reference, 0, 0, rules, points, type, rules, props = [], length), children), rules, children, length, points, rule ? props : children)\n\t\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\tparse(characters, reference, reference, reference, [''], children, 0, points, children)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tindex = offset = property = 0, variable = ampersand = 1, type = characters = '', length = pseudo\n\t\t\t\tbreak\n\t\t\t// :\n\t\t\tcase 58:\n\t\t\t\tlength = 1 + Utility_strlen(characters), property = previous\n\t\t\tdefault:\n\t\t\t\tif (variable < 1)\n\t\t\t\t\tif (character == 123)\n\t\t\t\t\t\t--variable\n\t\t\t\t\telse if (character == 125 && variable++ == 0 && prev() == 125)\n\t\t\t\t\t\tcontinue\n\n\t\t\t\tswitch (characters += Utility_from(character), character * variable) {\n\t\t\t\t\t// &\n\t\t\t\t\tcase 38:\n\t\t\t\t\t\tampersand = offset > 0 ? 1 : (characters += '\\f', -1)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// ,\n\t\t\t\t\tcase 44:\n\t\t\t\t\t\tpoints[index++] = (Utility_strlen(characters) - 1) * ampersand, ampersand = 1\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// @\n\t\t\t\t\tcase 64:\n\t\t\t\t\t\t// -\n\t\t\t\t\t\tif (peek() === 45)\n\t\t\t\t\t\t\tcharacters += delimit(next())\n\n\t\t\t\t\t\tatrule = peek(), offset = length = Utility_strlen(type = characters += identifier(caret())), character++\n\t\t\t\t\t\tbreak\n\t\t\t\t\t// -\n\t\t\t\t\tcase 45:\n\t\t\t\t\t\tif (previous === 45 && Utility_strlen(characters) == 2)\n\t\t\t\t\t\t\tvariable = 0\n\t\t\t\t}\n\t\t}\n\n\treturn rulesets\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {number} index\n * @param {number} offset\n * @param {string[]} rules\n * @param {number[]} points\n * @param {string} type\n * @param {string[]} props\n * @param {string[]} children\n * @param {number} length\n * @return {object}\n */\nfunction ruleset (value, root, parent, index, offset, rules, points, type, props, children, length) {\n\tvar post = offset - 1\n\tvar rule = offset === 0 ? rules : ['']\n\tvar size = Utility_sizeof(rule)\n\n\tfor (var i = 0, j = 0, k = 0; i < index; ++i)\n\t\tfor (var x = 0, y = Utility_substr(value, post + 1, post = abs(j = points[i])), z = value; x < size; ++x)\n\t\t\tif (z = trim(j > 0 ? rule[x] + ' ' + y : Utility_replace(y, /&\\f/g, rule[x])))\n\t\t\t\tprops[k++] = z\n\n\treturn node(value, root, parent, offset === 0 ? Enum_RULESET : type, props, children, length)\n}\n\n/**\n * @param {number} value\n * @param {object} root\n * @param {object?} parent\n * @return {object}\n */\nfunction comment (value, root, parent) {\n\treturn node(value, root, parent, COMMENT, Utility_from(Tokenizer_char()), Utility_substr(value, 2, -2), 0)\n}\n\n/**\n * @param {string} value\n * @param {object} root\n * @param {object?} parent\n * @param {number} length\n * @return {object}\n */\nfunction declaration (value, root, parent, length) {\n\treturn node(value, root, parent, Enum_DECLARATION, Utility_substr(value, 0, length), Utility_substr(value, length + 1, -1), length)\n}\n\n;// CONCATENATED MODULE: ./node_modules/@emotion/cache/dist/emotion-cache.browser.esm.js\n\n\n\n\n\nvar identifierWithPointTracking = function identifierWithPointTracking(begin, points, index) {\n  var previous = 0;\n  var character = 0;\n\n  while (true) {\n    previous = character;\n    character = peek(); // &\\f\n\n    if (previous === 38 && character === 12) {\n      points[index] = 1;\n    }\n\n    if (token(character)) {\n      break;\n    }\n\n    next();\n  }\n\n  return slice(begin, position);\n};\n\nvar toRules = function toRules(parsed, points) {\n  // pretend we've started with a comma\n  var index = -1;\n  var character = 44;\n\n  do {\n    switch (token(character)) {\n      case 0:\n        // &\\f\n        if (character === 38 && peek() === 12) {\n          // this is not 100% correct, we don't account for literal sequences here - like for example quoted strings\n          // stylis inserts \\f after & to know when & where it should replace this sequence with the context selector\n          // and when it should just concatenate the outer and inner selectors\n          // it's very unlikely for this sequence to actually appear in a different context, so we just leverage this fact here\n          points[index] = 1;\n        }\n\n        parsed[index] += identifierWithPointTracking(position - 1, points, index);\n        break;\n\n      case 2:\n        parsed[index] += delimit(character);\n        break;\n\n      case 4:\n        // comma\n        if (character === 44) {\n          // colon\n          parsed[++index] = peek() === 58 ? '&\\f' : '';\n          points[index] = parsed[index].length;\n          break;\n        }\n\n      // fallthrough\n\n      default:\n        parsed[index] += Utility_from(character);\n    }\n  } while (character = next());\n\n  return parsed;\n};\n\nvar getRules = function getRules(value, points) {\n  return dealloc(toRules(alloc(value), points));\n}; // WeakSet would be more appropriate, but only WeakMap is supported in IE11\n\n\nvar fixedElements = /* #__PURE__ */new WeakMap();\nvar compat = function compat(element) {\n  if (element.type !== 'rule' || !element.parent || // positive .length indicates that this rule contains pseudo\n  // negative .length indicates that this rule has been already prefixed\n  element.length < 1) {\n    return;\n  }\n\n  var value = element.value,\n      parent = element.parent;\n  var isImplicitRule = element.column === parent.column && element.line === parent.line;\n\n  while (parent.type !== 'rule') {\n    parent = parent.parent;\n    if (!parent) return;\n  } // short-circuit for the simplest case\n\n\n  if (element.props.length === 1 && value.charCodeAt(0) !== 58\n  /* colon */\n  && !fixedElements.get(parent)) {\n    return;\n  } // if this is an implicitly inserted rule (the one eagerly inserted at the each new nested level)\n  // then the props has already been manipulated beforehand as they that array is shared between it and its \"rule parent\"\n\n\n  if (isImplicitRule) {\n    return;\n  }\n\n  fixedElements.set(element, true);\n  var points = [];\n  var rules = getRules(value, points);\n  var parentRules = parent.props;\n\n  for (var i = 0, k = 0; i < rules.length; i++) {\n    for (var j = 0; j < parentRules.length; j++, k++) {\n      element.props[k] = points[i] ? rules[i].replace(/&\\f/g, parentRules[j]) : parentRules[j] + \" \" + rules[i];\n    }\n  }\n};\nvar removeLabel = function removeLabel(element) {\n  if (element.type === 'decl') {\n    var value = element.value;\n\n    if ( // charcode for l\n    value.charCodeAt(0) === 108 && // charcode for b\n    value.charCodeAt(2) === 98) {\n      // this ignores label\n      element[\"return\"] = '';\n      element.value = '';\n    }\n  }\n};\nvar ignoreFlag = 'emotion-disable-server-rendering-unsafe-selector-warning-please-do-not-use-this-the-warning-exists-for-a-reason';\n\nvar isIgnoringComment = function isIgnoringComment(element) {\n  return element.type === 'comm' && element.children.indexOf(ignoreFlag) > -1;\n};\n\nvar createUnsafeSelectorsAlarm = function createUnsafeSelectorsAlarm(cache) {\n  return function (element, index, children) {\n    if (element.type !== 'rule' || cache.compat) return;\n    var unsafePseudoClasses = element.value.match(/(:first|:nth|:nth-last)-child/g);\n\n    if (unsafePseudoClasses) {\n      var isNested = !!element.parent; // in nested rules comments become children of the \"auto-inserted\" rule and that's always the `element.parent`\n      //\n      // considering this input:\n      // .a {\n      //   .b /* comm */ {}\n      //   color: hotpink;\n      // }\n      // we get output corresponding to this:\n      // .a {\n      //   & {\n      //     /* comm */\n      //     color: hotpink;\n      //   }\n      //   .b {}\n      // }\n\n      var commentContainer = isNested ? element.parent.children : // global rule at the root level\n      children;\n\n      for (var i = commentContainer.length - 1; i >= 0; i--) {\n        var node = commentContainer[i];\n\n        if (node.line < element.line) {\n          break;\n        } // it is quite weird but comments are *usually* put at `column: element.column - 1`\n        // so we seek *from the end* for the node that is earlier than the rule's `element` and check that\n        // this will also match inputs like this:\n        // .a {\n        //   /* comm */\n        //   .b {}\n        // }\n        //\n        // but that is fine\n        //\n        // it would be the easiest to change the placement of the comment to be the first child of the rule:\n        // .a {\n        //   .b { /* comm */ }\n        // }\n        // with such inputs we wouldn't have to search for the comment at all\n        // TODO: consider changing this comment placement in the next major version\n\n\n        if (node.column < element.column) {\n          if (isIgnoringComment(node)) {\n            return;\n          }\n\n          break;\n        }\n      }\n\n      unsafePseudoClasses.forEach(function (unsafePseudoClass) {\n        console.error(\"The pseudo class \\\"\" + unsafePseudoClass + \"\\\" is potentially unsafe when doing server-side rendering. Try changing it to \\\"\" + unsafePseudoClass.split('-child')[0] + \"-of-type\\\".\");\n      });\n    }\n  };\n};\n\nvar isImportRule = function isImportRule(element) {\n  return element.type.charCodeAt(1) === 105 && element.type.charCodeAt(0) === 64;\n};\n\nvar isPrependedWithRegularRules = function isPrependedWithRegularRules(index, children) {\n  for (var i = index - 1; i >= 0; i--) {\n    if (!isImportRule(children[i])) {\n      return true;\n    }\n  }\n\n  return false;\n}; // use this to remove incorrect elements from further processing\n// so they don't get handed to the `sheet` (or anything else)\n// as that could potentially lead to additional logs which in turn could be overhelming to the user\n\n\nvar nullifyElement = function nullifyElement(element) {\n  element.type = '';\n  element.value = '';\n  element[\"return\"] = '';\n  element.children = '';\n  element.props = '';\n};\n\nvar incorrectImportAlarm = function incorrectImportAlarm(element, index, children) {\n  if (!isImportRule(element)) {\n    return;\n  }\n\n  if (element.parent) {\n    console.error(\"`@import` rules can't be nested inside other rules. Please move it to the top level and put it before regular rules. Keep in mind that they can only be used within global styles.\");\n    nullifyElement(element);\n  } else if (isPrependedWithRegularRules(index, children)) {\n    console.error(\"`@import` rules can't be after other rules. Please put your `@import` rules before your other rules.\");\n    nullifyElement(element);\n  }\n};\n\n/* eslint-disable no-fallthrough */\n\nfunction emotion_cache_browser_esm_prefix(value, length) {\n  switch (hash(value, length)) {\n    // color-adjust\n    case 5103:\n      return Enum_WEBKIT + 'print-' + value + value;\n    // animation, animation-(delay|direction|duration|fill-mode|iteration-count|name|play-state|timing-function)\n\n    case 5737:\n    case 4201:\n    case 3177:\n    case 3433:\n    case 1641:\n    case 4457:\n    case 2921: // text-decoration, filter, clip-path, backface-visibility, column, box-decoration-break\n\n    case 5572:\n    case 6356:\n    case 5844:\n    case 3191:\n    case 6645:\n    case 3005: // mask, mask-image, mask-(mode|clip|size), mask-(repeat|origin), mask-position, mask-composite,\n\n    case 6391:\n    case 5879:\n    case 5623:\n    case 6135:\n    case 4599:\n    case 4855: // background-clip, columns, column-(count|fill|gap|rule|rule-color|rule-style|rule-width|span|width)\n\n    case 4215:\n    case 6389:\n    case 5109:\n    case 5365:\n    case 5621:\n    case 3829:\n      return Enum_WEBKIT + value + value;\n    // appearance, user-select, transform, hyphens, text-size-adjust\n\n    case 5349:\n    case 4246:\n    case 4810:\n    case 6968:\n    case 2756:\n      return Enum_WEBKIT + value + Enum_MOZ + value + Enum_MS + value + value;\n    // flex, flex-direction\n\n    case 6828:\n    case 4268:\n      return Enum_WEBKIT + value + Enum_MS + value + value;\n    // order\n\n    case 6165:\n      return Enum_WEBKIT + value + Enum_MS + 'flex-' + value + value;\n    // align-items\n\n    case 5187:\n      return Enum_WEBKIT + value + Utility_replace(value, /(\\w+).+(:[^]+)/, Enum_WEBKIT + 'box-$1$2' + Enum_MS + 'flex-$1$2') + value;\n    // align-self\n\n    case 5443:\n      return Enum_WEBKIT + value + Enum_MS + 'flex-item-' + Utility_replace(value, /flex-|-self/, '') + value;\n    // align-content\n\n    case 4675:\n      return Enum_WEBKIT + value + Enum_MS + 'flex-line-pack' + Utility_replace(value, /align-content|flex-|-self/, '') + value;\n    // flex-shrink\n\n    case 5548:\n      return Enum_WEBKIT + value + Enum_MS + Utility_replace(value, 'shrink', 'negative') + value;\n    // flex-basis\n\n    case 5292:\n      return Enum_WEBKIT + value + Enum_MS + Utility_replace(value, 'basis', 'preferred-size') + value;\n    // flex-grow\n\n    case 6060:\n      return Enum_WEBKIT + 'box-' + Utility_replace(value, '-grow', '') + Enum_WEBKIT + value + Enum_MS + Utility_replace(value, 'grow', 'positive') + value;\n    // transition\n\n    case 4554:\n      return Enum_WEBKIT + Utility_replace(value, /([^-])(transform)/g, '$1' + Enum_WEBKIT + '$2') + value;\n    // cursor\n\n    case 6187:\n      return Utility_replace(Utility_replace(Utility_replace(value, /(zoom-|grab)/, Enum_WEBKIT + '$1'), /(image-set)/, Enum_WEBKIT + '$1'), value, '') + value;\n    // background, background-image\n\n    case 5495:\n    case 3959:\n      return Utility_replace(value, /(image-set\\([^]*)/, Enum_WEBKIT + '$1' + '$`$1');\n    // justify-content\n\n    case 4968:\n      return Utility_replace(Utility_replace(value, /(.+:)(flex-)?(.*)/, Enum_WEBKIT + 'box-pack:$3' + Enum_MS + 'flex-pack:$3'), /s.+-b[^;]+/, 'justify') + Enum_WEBKIT + value + value;\n    // (margin|padding)-inline-(start|end)\n\n    case 4095:\n    case 3583:\n    case 4068:\n    case 2532:\n      return Utility_replace(value, /(.+)-inline(.+)/, Enum_WEBKIT + '$1$2') + value;\n    // (min|max)?(width|height|inline-size|block-size)\n\n    case 8116:\n    case 7059:\n    case 5753:\n    case 5535:\n    case 5445:\n    case 5701:\n    case 4933:\n    case 4677:\n    case 5533:\n    case 5789:\n    case 5021:\n    case 4765:\n      // stretch, max-content, min-content, fill-available\n      if (Utility_strlen(value) - 1 - length > 6) switch (Utility_charat(value, length + 1)) {\n        // (m)ax-content, (m)in-content\n        case 109:\n          // -\n          if (Utility_charat(value, length + 4) !== 45) break;\n        // (f)ill-available, (f)it-content\n\n        case 102:\n          return Utility_replace(value, /(.+:)(.+)-([^]+)/, '$1' + Enum_WEBKIT + '$2-$3' + '$1' + Enum_MOZ + (Utility_charat(value, length + 3) == 108 ? '$3' : '$2-$3')) + value;\n        // (s)tretch\n\n        case 115:\n          return ~indexof(value, 'stretch') ? emotion_cache_browser_esm_prefix(Utility_replace(value, 'stretch', 'fill-available'), length) + value : value;\n      }\n      break;\n    // position: sticky\n\n    case 4949:\n      // (s)ticky?\n      if (Utility_charat(value, length + 1) !== 115) break;\n    // display: (flex|inline-flex)\n\n    case 6444:\n      switch (Utility_charat(value, Utility_strlen(value) - 3 - (~indexof(value, '!important') && 10))) {\n        // stic(k)y\n        case 107:\n          return Utility_replace(value, ':', ':' + Enum_WEBKIT) + value;\n        // (inline-)?fl(e)x\n\n        case 101:\n          return Utility_replace(value, /(.+:)([^;!]+)(;|!.+)?/, '$1' + Enum_WEBKIT + (Utility_charat(value, 14) === 45 ? 'inline-' : '') + 'box$3' + '$1' + Enum_WEBKIT + '$2$3' + '$1' + Enum_MS + '$2box$3') + value;\n      }\n\n      break;\n    // writing-mode\n\n    case 5936:\n      switch (Utility_charat(value, length + 11)) {\n        // vertical-l(r)\n        case 114:\n          return Enum_WEBKIT + value + Enum_MS + Utility_replace(value, /[svh]\\w+-[tblr]{2}/, 'tb') + value;\n        // vertical-r(l)\n\n        case 108:\n          return Enum_WEBKIT + value + Enum_MS + Utility_replace(value, /[svh]\\w+-[tblr]{2}/, 'tb-rl') + value;\n        // horizontal(-)tb\n\n        case 45:\n          return Enum_WEBKIT + value + Enum_MS + Utility_replace(value, /[svh]\\w+-[tblr]{2}/, 'lr') + value;\n      }\n\n      return Enum_WEBKIT + value + Enum_MS + value + value;\n  }\n\n  return value;\n}\n\nvar emotion_cache_browser_esm_prefixer = function prefixer(element, index, children, callback) {\n  if (element.length > -1) if (!element[\"return\"]) switch (element.type) {\n    case Enum_DECLARATION:\n      element[\"return\"] = emotion_cache_browser_esm_prefix(element.value, element.length);\n      break;\n\n    case Enum_KEYFRAMES:\n      return Serializer_serialize([Tokenizer_copy(element, {\n        value: Utility_replace(element.value, '@', '@' + Enum_WEBKIT)\n      })], callback);\n\n    case Enum_RULESET:\n      if (element.length) return Utility_combine(element.props, function (value) {\n        switch (Utility_match(value, /(::plac\\w+|:read-\\w+)/)) {\n          // :read-(only|write)\n          case ':read-only':\n          case ':read-write':\n            return Serializer_serialize([Tokenizer_copy(element, {\n              props: [Utility_replace(value, /:(read-\\w+)/, ':' + Enum_MOZ + '$1')]\n            })], callback);\n          // :placeholder\n\n          case '::placeholder':\n            return Serializer_serialize([Tokenizer_copy(element, {\n              props: [Utility_replace(value, /:(plac\\w+)/, ':' + Enum_WEBKIT + 'input-$1')]\n            }), Tokenizer_copy(element, {\n              props: [Utility_replace(value, /:(plac\\w+)/, ':' + Enum_MOZ + '$1')]\n            }), Tokenizer_copy(element, {\n              props: [Utility_replace(value, /:(plac\\w+)/, Enum_MS + 'input-$1')]\n            })], callback);\n        }\n\n        return '';\n      });\n  }\n};\n\nvar defaultStylisPlugins = [emotion_cache_browser_esm_prefixer];\n\nvar createCache = function createCache(options) {\n  var key = options.key;\n\n  if (false) {}\n\n  if (key === 'css') {\n    var ssrStyles = document.querySelectorAll(\"style[data-emotion]:not([data-s])\"); // get SSRed styles out of the way of React's hydration\n    // document.head is a safe place to move them to(though note document.head is not necessarily the last place they will be)\n    // note this very very intentionally targets all style elements regardless of the key to ensure\n    // that creating a cache works inside of render of a React component\n\n    Array.prototype.forEach.call(ssrStyles, function (node) {\n      // we want to only move elements which have a space in the data-emotion attribute value\n      // because that indicates that it is an Emotion 11 server-side rendered style elements\n      // while we will already ignore Emotion 11 client-side inserted styles because of the :not([data-s]) part in the selector\n      // Emotion 10 client-side inserted styles did not have data-s (but importantly did not have a space in their data-emotion attributes)\n      // so checking for the space ensures that loading Emotion 11 after Emotion 10 has inserted some styles\n      // will not result in the Emotion 10 styles being destroyed\n      var dataEmotionAttribute = node.getAttribute('data-emotion');\n\n      if (dataEmotionAttribute.indexOf(' ') === -1) {\n        return;\n      }\n      document.head.appendChild(node);\n      node.setAttribute('data-s', '');\n    });\n  }\n\n  var stylisPlugins = options.stylisPlugins || defaultStylisPlugins;\n\n  if (false) {}\n\n  var inserted = {};\n  var container;\n  var nodesToHydrate = [];\n\n  {\n    container = options.container || document.head;\n    Array.prototype.forEach.call( // this means we will ignore elements which don't have a space in them which\n    // means that the style elements we're looking at are only Emotion 11 server-rendered style elements\n    document.querySelectorAll(\"style[data-emotion^=\\\"\" + key + \" \\\"]\"), function (node) {\n      var attrib = node.getAttribute(\"data-emotion\").split(' '); // $FlowFixMe\n\n      for (var i = 1; i < attrib.length; i++) {\n        inserted[attrib[i]] = true;\n      }\n\n      nodesToHydrate.push(node);\n    });\n  }\n\n  var _insert;\n\n  var omnipresentPlugins = [compat, removeLabel];\n\n  if (false) {}\n\n  {\n    var currentSheet;\n    var finalizingPlugins = [stringify,  false ? 0 : rulesheet(function (rule) {\n      currentSheet.insert(rule);\n    })];\n    var serializer = middleware(omnipresentPlugins.concat(stylisPlugins, finalizingPlugins));\n\n    var stylis = function stylis(styles) {\n      return Serializer_serialize(compile(styles), serializer);\n    };\n\n    _insert = function insert(selector, serialized, sheet, shouldCache) {\n      currentSheet = sheet;\n\n      if (false) {}\n\n      stylis(selector ? selector + \"{\" + serialized.styles + \"}\" : serialized.styles);\n\n      if (shouldCache) {\n        cache.inserted[serialized.name] = true;\n      }\n    };\n  }\n\n  var cache = {\n    key: key,\n    sheet: new StyleSheet({\n      key: key,\n      container: container,\n      nonce: options.nonce,\n      speedy: options.speedy,\n      prepend: options.prepend,\n      insertionPoint: options.insertionPoint\n    }),\n    nonce: options.nonce,\n    inserted: inserted,\n    registered: {},\n    insert: _insert\n  };\n  cache.sheet.hydrate(nodesToHydrate);\n  return cache;\n};\n\n\n\n\n/***/ }),\n\n/***/ 5042:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ memoize; }\n/* harmony export */ });\nfunction memoize(fn) {\n  var cache = Object.create(null);\n  return function (arg) {\n    if (cache[arg] === undefined) cache[arg] = fn(arg);\n    return cache[arg];\n  };\n}\n\n\n\n\n/***/ }),\n\n/***/ 6498:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"C\": function() { return /* binding */ CacheProvider; },\n/* harmony export */   \"T\": function() { return /* binding */ ThemeContext; },\n/* harmony export */   \"i\": function() { return /* binding */ isBrowser; },\n/* harmony export */   \"w\": function() { return /* binding */ withEmotionCache; }\n/* harmony export */ });\n/* unused harmony exports E, _, a, b, c, h, u */\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _emotion_cache__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(8417);\n/* harmony import */ var _emotion_serialize__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(8137);\n/* harmony import */ var _emotion_use_insertion_effect_with_fallbacks__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(1946);\n\n\n\n\n\n\n\n\n\n\nvar isBrowser = \"object\" !== 'undefined';\nvar hasOwn = {}.hasOwnProperty;\n\nvar EmotionCacheContext = /* #__PURE__ */react__WEBPACK_IMPORTED_MODULE_0__.createContext( // we're doing this to avoid preconstruct's dead code elimination in this one case\n// because this module is primarily intended for the browser and node\n// but it's also required in react native and similar environments sometimes\n// and we could have a special build just for that\n// but this is much easier and the native packages\n// might use a different theme context in the future anyway\ntypeof HTMLElement !== 'undefined' ? /* #__PURE__ */(0,_emotion_cache__WEBPACK_IMPORTED_MODULE_1__/* [\"default\"] */ .Z)({\n  key: 'css'\n}) : null);\n\nif (false) {}\n\nvar CacheProvider = EmotionCacheContext.Provider;\nvar __unsafe_useEmotionCache = function useEmotionCache() {\n  return useContext(EmotionCacheContext);\n};\n\nvar withEmotionCache = function withEmotionCache(func) {\n  // $FlowFixMe\n  return /*#__PURE__*/(0,react__WEBPACK_IMPORTED_MODULE_0__.forwardRef)(function (props, ref) {\n    // the cache will never be null in the browser\n    var cache = (0,react__WEBPACK_IMPORTED_MODULE_0__.useContext)(EmotionCacheContext);\n    return func(props, cache, ref);\n  });\n};\n\nif (!isBrowser) {\n  withEmotionCache = function withEmotionCache(func) {\n    return function (props) {\n      var cache = (0,react__WEBPACK_IMPORTED_MODULE_0__.useContext)(EmotionCacheContext);\n\n      if (cache === null) {\n        // yes, we're potentially creating this on every render\n        // it doesn't actually matter though since it's only on the server\n        // so there will only every be a single render\n        // that could change in the future because of suspense and etc. but for now,\n        // this works and i don't want to optimise for a future thing that we aren't sure about\n        cache = (0,_emotion_cache__WEBPACK_IMPORTED_MODULE_1__/* [\"default\"] */ .Z)({\n          key: 'css'\n        });\n        return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(EmotionCacheContext.Provider, {\n          value: cache\n        }, func(props, cache));\n      } else {\n        return func(props, cache);\n      }\n    };\n  };\n}\n\nvar ThemeContext = /* #__PURE__ */react__WEBPACK_IMPORTED_MODULE_0__.createContext({});\n\nif (false) {}\n\nvar useTheme = function useTheme() {\n  return React.useContext(ThemeContext);\n};\n\nvar getTheme = function getTheme(outerTheme, theme) {\n  if (typeof theme === 'function') {\n    var mergedTheme = theme(outerTheme);\n\n    if (false) {}\n\n    return mergedTheme;\n  }\n\n  if (false) {}\n\n  return _extends({}, outerTheme, theme);\n};\n\nvar createCacheWithTheme = /* #__PURE__ */(/* unused pure expression or super */ null && (weakMemoize(function (outerTheme) {\n  return weakMemoize(function (theme) {\n    return getTheme(outerTheme, theme);\n  });\n})));\nvar ThemeProvider = function ThemeProvider(props) {\n  var theme = React.useContext(ThemeContext);\n\n  if (props.theme !== theme) {\n    theme = createCacheWithTheme(theme)(props.theme);\n  }\n\n  return /*#__PURE__*/React.createElement(ThemeContext.Provider, {\n    value: theme\n  }, props.children);\n};\nfunction withTheme(Component) {\n  var componentName = Component.displayName || Component.name || 'Component';\n\n  var render = function render(props, ref) {\n    var theme = React.useContext(ThemeContext);\n    return /*#__PURE__*/React.createElement(Component, _extends({\n      theme: theme,\n      ref: ref\n    }, props));\n  }; // $FlowFixMe\n\n\n  var WithTheme = /*#__PURE__*/React.forwardRef(render);\n  WithTheme.displayName = \"WithTheme(\" + componentName + \")\";\n  return hoistNonReactStatics(WithTheme, Component);\n}\n\nvar getLastPart = function getLastPart(functionName) {\n  // The match may be something like 'Object.createEmotionProps' or\n  // 'Loader.prototype.render'\n  var parts = functionName.split('.');\n  return parts[parts.length - 1];\n};\n\nvar getFunctionNameFromStackTraceLine = function getFunctionNameFromStackTraceLine(line) {\n  // V8\n  var match = /^\\s+at\\s+([A-Za-z0-9$.]+)\\s/.exec(line);\n  if (match) return getLastPart(match[1]); // Safari / Firefox\n\n  match = /^([A-Za-z0-9$.]+)@/.exec(line);\n  if (match) return getLastPart(match[1]);\n  return undefined;\n};\n\nvar internalReactFunctionNames = /* #__PURE__ */new Set(['renderWithHooks', 'processChild', 'finishClassComponent', 'renderToString']); // These identifiers come from error stacks, so they have to be valid JS\n// identifiers, thus we only need to replace what is a valid character for JS,\n// but not for CSS.\n\nvar sanitizeIdentifier = function sanitizeIdentifier(identifier) {\n  return identifier.replace(/\\$/g, '-');\n};\n\nvar getLabelFromStackTrace = function getLabelFromStackTrace(stackTrace) {\n  if (!stackTrace) return undefined;\n  var lines = stackTrace.split('\\n');\n\n  for (var i = 0; i < lines.length; i++) {\n    var functionName = getFunctionNameFromStackTraceLine(lines[i]); // The first line of V8 stack traces is just \"Error\"\n\n    if (!functionName) continue; // If we reach one of these, we have gone too far and should quit\n\n    if (internalReactFunctionNames.has(functionName)) break; // The component name is the first function in the stack that starts with an\n    // uppercase letter\n\n    if (/^[A-Z]/.test(functionName)) return sanitizeIdentifier(functionName);\n  }\n\n  return undefined;\n};\n\nvar typePropName = '__EMOTION_TYPE_PLEASE_DO_NOT_USE__';\nvar labelPropName = '__EMOTION_LABEL_PLEASE_DO_NOT_USE__';\nvar createEmotionProps = function createEmotionProps(type, props) {\n  if (false) {}\n\n  var newProps = {};\n\n  for (var key in props) {\n    if (hasOwn.call(props, key)) {\n      newProps[key] = props[key];\n    }\n  }\n\n  newProps[typePropName] = type; // For performance, only call getLabelFromStackTrace in development and when\n  // the label hasn't already been computed\n\n  if (false) { var label; }\n\n  return newProps;\n};\n\nvar Insertion = function Insertion(_ref) {\n  var cache = _ref.cache,\n      serialized = _ref.serialized,\n      isStringTag = _ref.isStringTag;\n  registerStyles(cache, serialized, isStringTag);\n  useInsertionEffectAlwaysWithSyncFallback(function () {\n    return insertStyles(cache, serialized, isStringTag);\n  });\n\n  return null;\n};\n\nvar Emotion = /* #__PURE__ */(/* unused pure expression or super */ null && (withEmotionCache(function (props, cache, ref) {\n  var cssProp = props.css; // so that using `css` from `emotion` and passing the result to the css prop works\n  // not passing the registered cache to serializeStyles because it would\n  // make certain babel optimisations not possible\n\n  if (typeof cssProp === 'string' && cache.registered[cssProp] !== undefined) {\n    cssProp = cache.registered[cssProp];\n  }\n\n  var WrappedComponent = props[typePropName];\n  var registeredStyles = [cssProp];\n  var className = '';\n\n  if (typeof props.className === 'string') {\n    className = getRegisteredStyles(cache.registered, registeredStyles, props.className);\n  } else if (props.className != null) {\n    className = props.className + \" \";\n  }\n\n  var serialized = serializeStyles(registeredStyles, undefined, React.useContext(ThemeContext));\n\n  if (false) { var labelFromStack; }\n\n  className += cache.key + \"-\" + serialized.name;\n  var newProps = {};\n\n  for (var key in props) {\n    if (hasOwn.call(props, key) && key !== 'css' && key !== typePropName && ( true || 0)) {\n      newProps[key] = props[key];\n    }\n  }\n\n  newProps.ref = ref;\n  newProps.className = className;\n  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(Insertion, {\n    cache: cache,\n    serialized: serialized,\n    isStringTag: typeof WrappedComponent === 'string'\n  }), /*#__PURE__*/React.createElement(WrappedComponent, newProps));\n})));\n\nif (false) {}\n\nvar Emotion$1 = (/* unused pure expression or super */ null && (Emotion));\n\n\n\n\n/***/ }),\n\n/***/ 917:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"F4\": function() { return /* binding */ keyframes; },\n/* harmony export */   \"iv\": function() { return /* binding */ css; },\n/* harmony export */   \"xB\": function() { return /* binding */ Global; }\n/* harmony export */ });\n/* unused harmony exports ClassNames, createElement, jsx */\n/* harmony import */ var _emotion_element_43c6fea0_browser_esm_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(6498);\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _emotion_utils__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(444);\n/* harmony import */ var _emotion_use_insertion_effect_with_fallbacks__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(1946);\n/* harmony import */ var _emotion_serialize__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(8137);\n/* harmony import */ var _emotion_cache__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(8417);\n/* harmony import */ var hoist_non_react_statics__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(8679);\n/* harmony import */ var hoist_non_react_statics__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(hoist_non_react_statics__WEBPACK_IMPORTED_MODULE_4__);\n\n\n\n\n\n\n\n\n\n\n\n\nvar pkg = {\n\tname: \"@emotion/react\",\n\tversion: \"11.11.4\",\n\tmain: \"dist/emotion-react.cjs.js\",\n\tmodule: \"dist/emotion-react.esm.js\",\n\tbrowser: {\n\t\t\"./dist/emotion-react.esm.js\": \"./dist/emotion-react.browser.esm.js\"\n\t},\n\texports: {\n\t\t\".\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./dist/emotion-react.worker.esm.js\",\n\t\t\t\tbrowser: \"./dist/emotion-react.browser.esm.js\",\n\t\t\t\t\"default\": \"./dist/emotion-react.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./dist/emotion-react.cjs.mjs\",\n\t\t\t\"default\": \"./dist/emotion-react.cjs.js\"\n\t\t},\n\t\t\"./jsx-runtime\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./jsx-runtime/dist/emotion-react-jsx-runtime.worker.esm.js\",\n\t\t\t\tbrowser: \"./jsx-runtime/dist/emotion-react-jsx-runtime.browser.esm.js\",\n\t\t\t\t\"default\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.cjs.mjs\",\n\t\t\t\"default\": \"./jsx-runtime/dist/emotion-react-jsx-runtime.cjs.js\"\n\t\t},\n\t\t\"./_isolated-hnrs\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.worker.esm.js\",\n\t\t\t\tbrowser: \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.browser.esm.js\",\n\t\t\t\t\"default\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.cjs.mjs\",\n\t\t\t\"default\": \"./_isolated-hnrs/dist/emotion-react-_isolated-hnrs.cjs.js\"\n\t\t},\n\t\t\"./jsx-dev-runtime\": {\n\t\t\tmodule: {\n\t\t\t\tworker: \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.worker.esm.js\",\n\t\t\t\tbrowser: \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.browser.esm.js\",\n\t\t\t\t\"default\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.esm.js\"\n\t\t\t},\n\t\t\t\"import\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.cjs.mjs\",\n\t\t\t\"default\": \"./jsx-dev-runtime/dist/emotion-react-jsx-dev-runtime.cjs.js\"\n\t\t},\n\t\t\"./package.json\": \"./package.json\",\n\t\t\"./types/css-prop\": \"./types/css-prop.d.ts\",\n\t\t\"./macro\": {\n\t\t\ttypes: {\n\t\t\t\t\"import\": \"./macro.d.mts\",\n\t\t\t\t\"default\": \"./macro.d.ts\"\n\t\t\t},\n\t\t\t\"default\": \"./macro.js\"\n\t\t}\n\t},\n\ttypes: \"types/index.d.ts\",\n\tfiles: [\n\t\t\"src\",\n\t\t\"dist\",\n\t\t\"jsx-runtime\",\n\t\t\"jsx-dev-runtime\",\n\t\t\"_isolated-hnrs\",\n\t\t\"types/*.d.ts\",\n\t\t\"macro.*\"\n\t],\n\tsideEffects: false,\n\tauthor: \"Emotion Contributors\",\n\tlicense: \"MIT\",\n\tscripts: {\n\t\t\"test:typescript\": \"dtslint types\"\n\t},\n\tdependencies: {\n\t\t\"@babel/runtime\": \"^7.18.3\",\n\t\t\"@emotion/babel-plugin\": \"^11.11.0\",\n\t\t\"@emotion/cache\": \"^11.11.0\",\n\t\t\"@emotion/serialize\": \"^1.1.3\",\n\t\t\"@emotion/use-insertion-effect-with-fallbacks\": \"^1.0.1\",\n\t\t\"@emotion/utils\": \"^1.2.1\",\n\t\t\"@emotion/weak-memoize\": \"^0.3.1\",\n\t\t\"hoist-non-react-statics\": \"^3.3.1\"\n\t},\n\tpeerDependencies: {\n\t\treact: \">=16.8.0\"\n\t},\n\tpeerDependenciesMeta: {\n\t\t\"@types/react\": {\n\t\t\toptional: true\n\t\t}\n\t},\n\tdevDependencies: {\n\t\t\"@definitelytyped/dtslint\": \"0.0.112\",\n\t\t\"@emotion/css\": \"11.11.2\",\n\t\t\"@emotion/css-prettifier\": \"1.1.3\",\n\t\t\"@emotion/server\": \"11.11.0\",\n\t\t\"@emotion/styled\": \"11.11.0\",\n\t\t\"html-tag-names\": \"^1.1.2\",\n\t\treact: \"16.14.0\",\n\t\t\"svg-tag-names\": \"^1.1.1\",\n\t\ttypescript: \"^4.5.5\"\n\t},\n\trepository: \"https://github.com/emotion-js/emotion/tree/main/packages/react\",\n\tpublishConfig: {\n\t\taccess: \"public\"\n\t},\n\t\"umd:main\": \"dist/emotion-react.umd.min.js\",\n\tpreconstruct: {\n\t\tentrypoints: [\n\t\t\t\"./index.js\",\n\t\t\t\"./jsx-runtime.js\",\n\t\t\t\"./jsx-dev-runtime.js\",\n\t\t\t\"./_isolated-hnrs.js\"\n\t\t],\n\t\tumdName: \"emotionReact\",\n\t\texports: {\n\t\t\tenvConditions: [\n\t\t\t\t\"browser\",\n\t\t\t\t\"worker\"\n\t\t\t],\n\t\t\textra: {\n\t\t\t\t\"./types/css-prop\": \"./types/css-prop.d.ts\",\n\t\t\t\t\"./macro\": {\n\t\t\t\t\ttypes: {\n\t\t\t\t\t\t\"import\": \"./macro.d.mts\",\n\t\t\t\t\t\t\"default\": \"./macro.d.ts\"\n\t\t\t\t\t},\n\t\t\t\t\t\"default\": \"./macro.js\"\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nvar jsx = function jsx(type, props) {\n  var args = arguments;\n\n  if (props == null || !hasOwn.call(props, 'css')) {\n    // $FlowFixMe\n    return React.createElement.apply(undefined, args);\n  }\n\n  var argsLength = args.length;\n  var createElementArgArray = new Array(argsLength);\n  createElementArgArray[0] = Emotion;\n  createElementArgArray[1] = createEmotionProps(type, props);\n\n  for (var i = 2; i < argsLength; i++) {\n    createElementArgArray[i] = args[i];\n  } // $FlowFixMe\n\n\n  return React.createElement.apply(null, createElementArgArray);\n};\n\nvar warnedAboutCssPropForGlobal = false; // maintain place over rerenders.\n// initial render from browser, insertBefore context.sheet.tags[0] or if a style hasn't been inserted there yet, appendChild\n// initial client-side render from SSR, use place of hydrating tag\n\nvar Global = /* #__PURE__ */(0,_emotion_element_43c6fea0_browser_esm_js__WEBPACK_IMPORTED_MODULE_5__.w)(function (props, cache) {\n  if (false) {}\n\n  var styles = props.styles;\n  var serialized = (0,_emotion_serialize__WEBPACK_IMPORTED_MODULE_2__/* .serializeStyles */ .O)([styles], undefined, react__WEBPACK_IMPORTED_MODULE_0__.useContext(_emotion_element_43c6fea0_browser_esm_js__WEBPACK_IMPORTED_MODULE_5__.T));\n\n  if (!_emotion_element_43c6fea0_browser_esm_js__WEBPACK_IMPORTED_MODULE_5__.i) {\n    var _ref;\n\n    var serializedNames = serialized.name;\n    var serializedStyles = serialized.styles;\n    var next = serialized.next;\n\n    while (next !== undefined) {\n      serializedNames += ' ' + next.name;\n      serializedStyles += next.styles;\n      next = next.next;\n    }\n\n    var shouldCache = cache.compat === true;\n    var rules = cache.insert(\"\", {\n      name: serializedNames,\n      styles: serializedStyles\n    }, cache.sheet, shouldCache);\n\n    if (shouldCache) {\n      return null;\n    }\n\n    return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(\"style\", (_ref = {}, _ref[\"data-emotion\"] = cache.key + \"-global \" + serializedNames, _ref.dangerouslySetInnerHTML = {\n      __html: rules\n    }, _ref.nonce = cache.sheet.nonce, _ref));\n  } // yes, i know these hooks are used conditionally\n  // but it is based on a constant that will never change at runtime\n  // it's effectively like having two implementations and switching them out\n  // so it's not actually breaking anything\n\n\n  var sheetRef = react__WEBPACK_IMPORTED_MODULE_0__.useRef();\n  (0,_emotion_use_insertion_effect_with_fallbacks__WEBPACK_IMPORTED_MODULE_1__/* .useInsertionEffectWithLayoutFallback */ .j)(function () {\n    var key = cache.key + \"-global\"; // use case of https://github.com/emotion-js/emotion/issues/2675\n\n    var sheet = new cache.sheet.constructor({\n      key: key,\n      nonce: cache.sheet.nonce,\n      container: cache.sheet.container,\n      speedy: cache.sheet.isSpeedy\n    });\n    var rehydrating = false; // $FlowFixMe\n\n    var node = document.querySelector(\"style[data-emotion=\\\"\" + key + \" \" + serialized.name + \"\\\"]\");\n\n    if (cache.sheet.tags.length) {\n      sheet.before = cache.sheet.tags[0];\n    }\n\n    if (node !== null) {\n      rehydrating = true; // clear the hash so this node won't be recognizable as rehydratable by other <Global/>s\n\n      node.setAttribute('data-emotion', key);\n      sheet.hydrate([node]);\n    }\n\n    sheetRef.current = [sheet, rehydrating];\n    return function () {\n      sheet.flush();\n    };\n  }, [cache]);\n  (0,_emotion_use_insertion_effect_with_fallbacks__WEBPACK_IMPORTED_MODULE_1__/* .useInsertionEffectWithLayoutFallback */ .j)(function () {\n    var sheetRefCurrent = sheetRef.current;\n    var sheet = sheetRefCurrent[0],\n        rehydrating = sheetRefCurrent[1];\n\n    if (rehydrating) {\n      sheetRefCurrent[1] = false;\n      return;\n    }\n\n    if (serialized.next !== undefined) {\n      // insert keyframes\n      (0,_emotion_utils__WEBPACK_IMPORTED_MODULE_6__/* .insertStyles */ .My)(cache, serialized.next, true);\n    }\n\n    if (sheet.tags.length) {\n      // if this doesn't exist then it will be null so the style element will be appended\n      var element = sheet.tags[sheet.tags.length - 1].nextElementSibling;\n      sheet.before = element;\n      sheet.flush();\n    }\n\n    cache.insert(\"\", serialized, sheet, false);\n  }, [cache, serialized.name]);\n  return null;\n});\n\nif (false) {}\n\nfunction css() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return (0,_emotion_serialize__WEBPACK_IMPORTED_MODULE_2__/* .serializeStyles */ .O)(args);\n}\n\nvar keyframes = function keyframes() {\n  var insertable = css.apply(void 0, arguments);\n  var name = \"animation-\" + insertable.name; // $FlowFixMe\n\n  return {\n    name: name,\n    styles: \"@keyframes \" + name + \"{\" + insertable.styles + \"}\",\n    anim: 1,\n    toString: function toString() {\n      return \"_EMO_\" + this.name + \"_\" + this.styles + \"_EMO_\";\n    }\n  };\n};\n\nvar classnames = function classnames(args) {\n  var len = args.length;\n  var i = 0;\n  var cls = '';\n\n  for (; i < len; i++) {\n    var arg = args[i];\n    if (arg == null) continue;\n    var toAdd = void 0;\n\n    switch (typeof arg) {\n      case 'boolean':\n        break;\n\n      case 'object':\n        {\n          if (Array.isArray(arg)) {\n            toAdd = classnames(arg);\n          } else {\n            if (false) {}\n\n            toAdd = '';\n\n            for (var k in arg) {\n              if (arg[k] && k) {\n                toAdd && (toAdd += ' ');\n                toAdd += k;\n              }\n            }\n          }\n\n          break;\n        }\n\n      default:\n        {\n          toAdd = arg;\n        }\n    }\n\n    if (toAdd) {\n      cls && (cls += ' ');\n      cls += toAdd;\n    }\n  }\n\n  return cls;\n};\n\nfunction merge(registered, css, className) {\n  var registeredStyles = [];\n  var rawClassName = getRegisteredStyles(registered, registeredStyles, className);\n\n  if (registeredStyles.length < 2) {\n    return className;\n  }\n\n  return rawClassName + css(registeredStyles);\n}\n\nvar Insertion = function Insertion(_ref) {\n  var cache = _ref.cache,\n      serializedArr = _ref.serializedArr;\n  useInsertionEffectAlwaysWithSyncFallback(function () {\n\n    for (var i = 0; i < serializedArr.length; i++) {\n      insertStyles(cache, serializedArr[i], false);\n    }\n  });\n\n  return null;\n};\n\nvar ClassNames = /* #__PURE__ */(/* unused pure expression or super */ null && (withEmotionCache(function (props, cache) {\n  var hasRendered = false;\n  var serializedArr = [];\n\n  var css = function css() {\n    if (hasRendered && \"production\" !== 'production') {}\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    var serialized = serializeStyles(args, cache.registered);\n    serializedArr.push(serialized); // registration has to happen here as the result of this might get consumed by `cx`\n\n    registerStyles(cache, serialized, false);\n    return cache.key + \"-\" + serialized.name;\n  };\n\n  var cx = function cx() {\n    if (hasRendered && \"production\" !== 'production') {}\n\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return merge(cache.registered, css, classnames(args));\n  };\n\n  var content = {\n    css: css,\n    cx: cx,\n    theme: React.useContext(ThemeContext)\n  };\n  var ele = props.children(content);\n  hasRendered = true;\n  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(Insertion, {\n    cache: cache,\n    serializedArr: serializedArr\n  }), ele);\n})));\n\nif (false) {}\n\nif (false) { var globalKey, globalContext, isTestEnv, isBrowser; }\n\n\n\n\n/***/ }),\n\n/***/ 8137:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"O\": function() { return /* binding */ serializeStyles; }\n});\n\n;// CONCATENATED MODULE: ./node_modules/@emotion/hash/dist/emotion-hash.esm.js\n/* eslint-disable */\n// Inspired by https://github.com/garycourt/murmurhash-js\n// Ported from https://github.com/aappleby/smhasher/blob/61a0530f28277f2e850bfc39600ce61d02b518de/src/MurmurHash2.cpp#L37-L86\nfunction murmur2(str) {\n  // 'm' and 'r' are mixing constants generated offline.\n  // They're not really 'magic', they just happen to work well.\n  // const m = 0x5bd1e995;\n  // const r = 24;\n  // Initialize the hash\n  var h = 0; // Mix 4 bytes at a time into the hash\n\n  var k,\n      i = 0,\n      len = str.length;\n\n  for (; len >= 4; ++i, len -= 4) {\n    k = str.charCodeAt(i) & 0xff | (str.charCodeAt(++i) & 0xff) << 8 | (str.charCodeAt(++i) & 0xff) << 16 | (str.charCodeAt(++i) & 0xff) << 24;\n    k =\n    /* Math.imul(k, m): */\n    (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16);\n    k ^=\n    /* k >>> r: */\n    k >>> 24;\n    h =\n    /* Math.imul(k, m): */\n    (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16) ^\n    /* Math.imul(h, m): */\n    (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  } // Handle the last few bytes of the input array\n\n\n  switch (len) {\n    case 3:\n      h ^= (str.charCodeAt(i + 2) & 0xff) << 16;\n\n    case 2:\n      h ^= (str.charCodeAt(i + 1) & 0xff) << 8;\n\n    case 1:\n      h ^= str.charCodeAt(i) & 0xff;\n      h =\n      /* Math.imul(h, m): */\n      (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  } // Do a few final mixes of the hash to ensure the last few\n  // bytes are well-incorporated.\n\n\n  h ^= h >>> 13;\n  h =\n  /* Math.imul(h, m): */\n  (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n  return ((h ^ h >>> 15) >>> 0).toString(36);\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/@emotion/unitless/dist/emotion-unitless.esm.js\nvar unitlessKeys = {\n  animationIterationCount: 1,\n  aspectRatio: 1,\n  borderImageOutset: 1,\n  borderImageSlice: 1,\n  borderImageWidth: 1,\n  boxFlex: 1,\n  boxFlexGroup: 1,\n  boxOrdinalGroup: 1,\n  columnCount: 1,\n  columns: 1,\n  flex: 1,\n  flexGrow: 1,\n  flexPositive: 1,\n  flexShrink: 1,\n  flexNegative: 1,\n  flexOrder: 1,\n  gridRow: 1,\n  gridRowEnd: 1,\n  gridRowSpan: 1,\n  gridRowStart: 1,\n  gridColumn: 1,\n  gridColumnEnd: 1,\n  gridColumnSpan: 1,\n  gridColumnStart: 1,\n  msGridRow: 1,\n  msGridRowSpan: 1,\n  msGridColumn: 1,\n  msGridColumnSpan: 1,\n  fontWeight: 1,\n  lineHeight: 1,\n  opacity: 1,\n  order: 1,\n  orphans: 1,\n  tabSize: 1,\n  widows: 1,\n  zIndex: 1,\n  zoom: 1,\n  WebkitLineClamp: 1,\n  // SVG-related properties\n  fillOpacity: 1,\n  floodOpacity: 1,\n  stopOpacity: 1,\n  strokeDasharray: 1,\n  strokeDashoffset: 1,\n  strokeMiterlimit: 1,\n  strokeOpacity: 1,\n  strokeWidth: 1\n};\n\n\n\n// EXTERNAL MODULE: ./node_modules/@emotion/memoize/dist/emotion-memoize.esm.js\nvar emotion_memoize_esm = __webpack_require__(5042);\n;// CONCATENATED MODULE: ./node_modules/@emotion/serialize/dist/emotion-serialize.browser.esm.js\n\n\n\n\nvar ILLEGAL_ESCAPE_SEQUENCE_ERROR = \"You have illegal escape sequence in your template literal, most likely inside content's property value.\\nBecause you write your CSS inside a JavaScript string you actually have to do double escaping, so for example \\\"content: '\\\\00d7';\\\" should become \\\"content: '\\\\\\\\00d7';\\\".\\nYou can read more about this here:\\nhttps://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals#ES2018_revision_of_illegal_escape_sequences\";\nvar UNDEFINED_AS_OBJECT_KEY_ERROR = \"You have passed in falsy value as style object's key (can happen when in example you pass unexported component as computed key).\";\nvar hyphenateRegex = /[A-Z]|^ms/g;\nvar animationRegex = /_EMO_([^_]+?)_([^]*?)_EMO_/g;\n\nvar isCustomProperty = function isCustomProperty(property) {\n  return property.charCodeAt(1) === 45;\n};\n\nvar isProcessableValue = function isProcessableValue(value) {\n  return value != null && typeof value !== 'boolean';\n};\n\nvar processStyleName = /* #__PURE__ */(0,emotion_memoize_esm/* default */.Z)(function (styleName) {\n  return isCustomProperty(styleName) ? styleName : styleName.replace(hyphenateRegex, '-$&').toLowerCase();\n});\n\nvar processStyleValue = function processStyleValue(key, value) {\n  switch (key) {\n    case 'animation':\n    case 'animationName':\n      {\n        if (typeof value === 'string') {\n          return value.replace(animationRegex, function (match, p1, p2) {\n            cursor = {\n              name: p1,\n              styles: p2,\n              next: cursor\n            };\n            return p1;\n          });\n        }\n      }\n  }\n\n  if (unitlessKeys[key] !== 1 && !isCustomProperty(key) && typeof value === 'number' && value !== 0) {\n    return value + 'px';\n  }\n\n  return value;\n};\n\nif (false) { var hyphenatedCache, hyphenPattern, msPattern, oldProcessStyleValue, contentValues, contentValuePattern; }\n\nvar noComponentSelectorMessage = (/* unused pure expression or super */ null && ('Component selectors can only be used in conjunction with ' + '@emotion/babel-plugin, the swc Emotion plugin, or another Emotion-aware ' + 'compiler transform.'));\n\nfunction handleInterpolation(mergedProps, registered, interpolation) {\n  if (interpolation == null) {\n    return '';\n  }\n\n  if (interpolation.__emotion_styles !== undefined) {\n    if (false) {}\n\n    return interpolation;\n  }\n\n  switch (typeof interpolation) {\n    case 'boolean':\n      {\n        return '';\n      }\n\n    case 'object':\n      {\n        if (interpolation.anim === 1) {\n          cursor = {\n            name: interpolation.name,\n            styles: interpolation.styles,\n            next: cursor\n          };\n          return interpolation.name;\n        }\n\n        if (interpolation.styles !== undefined) {\n          var next = interpolation.next;\n\n          if (next !== undefined) {\n            // not the most efficient thing ever but this is a pretty rare case\n            // and there will be very few iterations of this generally\n            while (next !== undefined) {\n              cursor = {\n                name: next.name,\n                styles: next.styles,\n                next: cursor\n              };\n              next = next.next;\n            }\n          }\n\n          var styles = interpolation.styles + \";\";\n\n          if (false) {}\n\n          return styles;\n        }\n\n        return createStringFromObject(mergedProps, registered, interpolation);\n      }\n\n    case 'function':\n      {\n        if (mergedProps !== undefined) {\n          var previousCursor = cursor;\n          var result = interpolation(mergedProps);\n          cursor = previousCursor;\n          return handleInterpolation(mergedProps, registered, result);\n        } else if (false) {}\n\n        break;\n      }\n\n    case 'string':\n      if (false) { var replaced, matched; }\n\n      break;\n  } // finalize string values (regular strings and functions interpolated into css calls)\n\n\n  if (registered == null) {\n    return interpolation;\n  }\n\n  var cached = registered[interpolation];\n  return cached !== undefined ? cached : interpolation;\n}\n\nfunction createStringFromObject(mergedProps, registered, obj) {\n  var string = '';\n\n  if (Array.isArray(obj)) {\n    for (var i = 0; i < obj.length; i++) {\n      string += handleInterpolation(mergedProps, registered, obj[i]) + \";\";\n    }\n  } else {\n    for (var _key in obj) {\n      var value = obj[_key];\n\n      if (typeof value !== 'object') {\n        if (registered != null && registered[value] !== undefined) {\n          string += _key + \"{\" + registered[value] + \"}\";\n        } else if (isProcessableValue(value)) {\n          string += processStyleName(_key) + \":\" + processStyleValue(_key, value) + \";\";\n        }\n      } else {\n        if (_key === 'NO_COMPONENT_SELECTOR' && \"production\" !== 'production') {}\n\n        if (Array.isArray(value) && typeof value[0] === 'string' && (registered == null || registered[value[0]] === undefined)) {\n          for (var _i = 0; _i < value.length; _i++) {\n            if (isProcessableValue(value[_i])) {\n              string += processStyleName(_key) + \":\" + processStyleValue(_key, value[_i]) + \";\";\n            }\n          }\n        } else {\n          var interpolated = handleInterpolation(mergedProps, registered, value);\n\n          switch (_key) {\n            case 'animation':\n            case 'animationName':\n              {\n                string += processStyleName(_key) + \":\" + interpolated + \";\";\n                break;\n              }\n\n            default:\n              {\n                if (false) {}\n\n                string += _key + \"{\" + interpolated + \"}\";\n              }\n          }\n        }\n      }\n    }\n  }\n\n  return string;\n}\n\nvar labelPattern = /label:\\s*([^\\s;\\n{]+)\\s*(;|$)/g;\nvar sourceMapPattern;\n\nif (false) {} // this is the cursor for keyframes\n// keyframes are stored on the SerializedStyles object as a linked list\n\n\nvar cursor;\nvar serializeStyles = function serializeStyles(args, registered, mergedProps) {\n  if (args.length === 1 && typeof args[0] === 'object' && args[0] !== null && args[0].styles !== undefined) {\n    return args[0];\n  }\n\n  var stringMode = true;\n  var styles = '';\n  cursor = undefined;\n  var strings = args[0];\n\n  if (strings == null || strings.raw === undefined) {\n    stringMode = false;\n    styles += handleInterpolation(mergedProps, registered, strings);\n  } else {\n    if (false) {}\n\n    styles += strings[0];\n  } // we start at 1 since we've already handled the first arg\n\n\n  for (var i = 1; i < args.length; i++) {\n    styles += handleInterpolation(mergedProps, registered, args[i]);\n\n    if (stringMode) {\n      if (false) {}\n\n      styles += strings[i];\n    }\n  }\n\n  var sourceMap;\n\n  if (false) {} // using a global regex with .exec is stateful so lastIndex has to be reset each time\n\n\n  labelPattern.lastIndex = 0;\n  var identifierName = '';\n  var match; // https://esbench.com/bench/5b809c2cf2949800a0f61fb5\n\n  while ((match = labelPattern.exec(styles)) !== null) {\n    identifierName += '-' + // $FlowFixMe we know it's not null\n    match[1];\n  }\n\n  var name = murmur2(styles) + identifierName;\n\n  if (false) {}\n\n  return {\n    name: name,\n    styles: styles,\n    next: cursor\n  };\n};\n\n\n\n\n/***/ }),\n\n/***/ 1946:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\nvar react__WEBPACK_IMPORTED_MODULE_0___namespace_cache;\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"L\": function() { return /* binding */ useInsertionEffectAlwaysWithSyncFallback; },\n/* harmony export */   \"j\": function() { return /* binding */ useInsertionEffectWithLayoutFallback; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n\n\nvar syncFallback = function syncFallback(create) {\n  return create();\n};\n\nvar useInsertionEffect = /*#__PURE__*/ (react__WEBPACK_IMPORTED_MODULE_0___namespace_cache || (react__WEBPACK_IMPORTED_MODULE_0___namespace_cache = __webpack_require__.t(react__WEBPACK_IMPORTED_MODULE_0__, 2)))['useInsertion' + 'Effect'] ? /*#__PURE__*/ (react__WEBPACK_IMPORTED_MODULE_0___namespace_cache || (react__WEBPACK_IMPORTED_MODULE_0___namespace_cache = __webpack_require__.t(react__WEBPACK_IMPORTED_MODULE_0__, 2)))['useInsertion' + 'Effect'] : false;\nvar useInsertionEffectAlwaysWithSyncFallback = useInsertionEffect || syncFallback;\nvar useInsertionEffectWithLayoutFallback = useInsertionEffect || react__WEBPACK_IMPORTED_MODULE_0__.useLayoutEffect;\n\n\n\n\n/***/ }),\n\n/***/ 444:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"My\": function() { return /* binding */ insertStyles; },\n/* harmony export */   \"fp\": function() { return /* binding */ getRegisteredStyles; },\n/* harmony export */   \"hC\": function() { return /* binding */ registerStyles; }\n/* harmony export */ });\nvar isBrowser = \"object\" !== 'undefined';\nfunction getRegisteredStyles(registered, registeredStyles, classNames) {\n  var rawClassName = '';\n  classNames.split(' ').forEach(function (className) {\n    if (registered[className] !== undefined) {\n      registeredStyles.push(registered[className] + \";\");\n    } else {\n      rawClassName += className + \" \";\n    }\n  });\n  return rawClassName;\n}\nvar registerStyles = function registerStyles(cache, serialized, isStringTag) {\n  var className = cache.key + \"-\" + serialized.name;\n\n  if ( // we only need to add the styles to the registered cache if the\n  // class name could be used further down\n  // the tree but if it's a string tag, we know it won't\n  // so we don't have to add it to registered cache.\n  // this improves memory usage since we can avoid storing the whole style string\n  (isStringTag === false || // we need to always store it if we're in compat mode and\n  // in node since emotion-server relies on whether a style is in\n  // the registered cache to know whether a style is global or not\n  // also, note that this check will be dead code eliminated in the browser\n  isBrowser === false ) && cache.registered[className] === undefined) {\n    cache.registered[className] = serialized.styles;\n  }\n};\nvar insertStyles = function insertStyles(cache, serialized, isStringTag) {\n  registerStyles(cache, serialized, isStringTag);\n  var className = cache.key + \"-\" + serialized.name;\n\n  if (cache.inserted[serialized.name] === undefined) {\n    var current = serialized;\n\n    do {\n      cache.insert(serialized === current ? \".\" + className : '', current, cache.sheet, true);\n\n      current = current.next;\n    } while (current !== undefined);\n  }\n};\n\n\n\n\n/***/ }),\n\n/***/ 8628:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"i\": function() { return /* binding */ useDefaultProps; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _mui_system_DefaultPropsProvider__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(2842);\n/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(5893);\n'use client';\n\n\n\n\n\n\nfunction DefaultPropsProvider(props) {\n  return /*#__PURE__*/_jsx(SystemDefaultPropsProvider, _extends({}, props));\n}\n false ? 0 : void 0;\n/* unused harmony default export */ var __WEBPACK_DEFAULT_EXPORT__ = ((/* unused pure expression or super */ null && (DefaultPropsProvider)));\nfunction useDefaultProps(params) {\n  return (0,_mui_system_DefaultPropsProvider__WEBPACK_IMPORTED_MODULE_2__/* .useDefaultProps */ .i)(params);\n}\n\n/***/ }),\n\n/***/ 9773:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ material_GlobalStyles_GlobalStyles; }\n});\n\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/react/index.js\nvar react = __webpack_require__(7294);\n// EXTERNAL MODULE: ./node_modules/@mui/styled-engine/GlobalStyles/GlobalStyles.js\nvar GlobalStyles = __webpack_require__(1234);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/useTheme.js\nvar useTheme = __webpack_require__(6682);\n// EXTERNAL MODULE: ./node_modules/react/jsx-runtime.js\nvar jsx_runtime = __webpack_require__(5893);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/GlobalStyles/GlobalStyles.js\n'use client';\n\n\n\n\n\n\nfunction GlobalStyles_GlobalStyles({\n  styles,\n  themeId,\n  defaultTheme = {}\n}) {\n  const upperTheme = (0,useTheme/* default */.Z)(defaultTheme);\n  const globalStyles = typeof styles === 'function' ? styles(themeId ? upperTheme[themeId] || upperTheme : upperTheme) : styles;\n  return /*#__PURE__*/(0,jsx_runtime.jsx)(GlobalStyles/* default */.Z, {\n    styles: globalStyles\n  });\n}\n false ? 0 : void 0;\n/* harmony default export */ var esm_GlobalStyles_GlobalStyles = (GlobalStyles_GlobalStyles);\n// EXTERNAL MODULE: ./node_modules/@mui/material/styles/defaultTheme.js\nvar defaultTheme = __webpack_require__(247);\n// EXTERNAL MODULE: ./node_modules/@mui/material/styles/identifier.js\nvar identifier = __webpack_require__(606);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/GlobalStyles/GlobalStyles.js\n'use client';\n\n\n\n\n\n\n\n\nfunction GlobalStyles_GlobalStyles_GlobalStyles(props) {\n  return /*#__PURE__*/(0,jsx_runtime.jsx)(esm_GlobalStyles_GlobalStyles, (0,esm_extends/* default */.Z)({}, props, {\n    defaultTheme: defaultTheme/* default */.Z,\n    themeId: identifier/* default */.Z\n  }));\n}\n false ? 0 : void 0;\n/* harmony default export */ var material_GlobalStyles_GlobalStyles = (GlobalStyles_GlobalStyles_GlobalStyles);\n\n/***/ }),\n\n/***/ 1265:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ styles_createTheme; }\n});\n\n// UNUSED EXPORTS: createMuiTheme\n\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js\nvar objectWithoutPropertiesLoose = __webpack_require__(3366);\n// EXTERNAL MODULE: ./node_modules/@mui/utils/formatMuiErrorMessage/formatMuiErrorMessage.js\nvar formatMuiErrorMessage = __webpack_require__(8758);\n// EXTERNAL MODULE: ./node_modules/@mui/utils/deepmerge/deepmerge.js\nvar deepmerge = __webpack_require__(8027);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/styleFunctionSx/defaultSxConfig.js + 5 modules\nvar defaultSxConfig = __webpack_require__(4920);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/styleFunctionSx/styleFunctionSx.js\nvar styleFunctionSx = __webpack_require__(6523);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/createTheme/createTheme.js + 2 modules\nvar createTheme = __webpack_require__(7172);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/createMixins.js\n\nfunction createMixins(breakpoints, mixins) {\n  return (0,esm_extends/* default */.Z)({\n    toolbar: {\n      minHeight: 56,\n      [breakpoints.up('xs')]: {\n        '@media (orientation: landscape)': {\n          minHeight: 48\n        }\n      },\n      [breakpoints.up('sm')]: {\n        minHeight: 64\n      }\n    }\n  }, mixins);\n}\n// EXTERNAL MODULE: ./node_modules/@mui/system/colorManipulator.js\nvar colorManipulator = __webpack_require__(2101);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/common.js\nconst common = {\n  black: '#000',\n  white: '#fff'\n};\n/* harmony default export */ var colors_common = (common);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/grey.js\nconst grey = {\n  50: '#fafafa',\n  100: '#f5f5f5',\n  200: '#eeeeee',\n  300: '#e0e0e0',\n  400: '#bdbdbd',\n  500: '#9e9e9e',\n  600: '#757575',\n  700: '#616161',\n  800: '#424242',\n  900: '#212121',\n  A100: '#f5f5f5',\n  A200: '#eeeeee',\n  A400: '#bdbdbd',\n  A700: '#616161'\n};\n/* harmony default export */ var colors_grey = (grey);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/purple.js\nconst purple = {\n  50: '#f3e5f5',\n  100: '#e1bee7',\n  200: '#ce93d8',\n  300: '#ba68c8',\n  400: '#ab47bc',\n  500: '#9c27b0',\n  600: '#8e24aa',\n  700: '#7b1fa2',\n  800: '#6a1b9a',\n  900: '#4a148c',\n  A100: '#ea80fc',\n  A200: '#e040fb',\n  A400: '#d500f9',\n  A700: '#aa00ff'\n};\n/* harmony default export */ var colors_purple = (purple);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/red.js\nconst red = {\n  50: '#ffebee',\n  100: '#ffcdd2',\n  200: '#ef9a9a',\n  300: '#e57373',\n  400: '#ef5350',\n  500: '#f44336',\n  600: '#e53935',\n  700: '#d32f2f',\n  800: '#c62828',\n  900: '#b71c1c',\n  A100: '#ff8a80',\n  A200: '#ff5252',\n  A400: '#ff1744',\n  A700: '#d50000'\n};\n/* harmony default export */ var colors_red = (red);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/orange.js\nconst orange = {\n  50: '#fff3e0',\n  100: '#ffe0b2',\n  200: '#ffcc80',\n  300: '#ffb74d',\n  400: '#ffa726',\n  500: '#ff9800',\n  600: '#fb8c00',\n  700: '#f57c00',\n  800: '#ef6c00',\n  900: '#e65100',\n  A100: '#ffd180',\n  A200: '#ffab40',\n  A400: '#ff9100',\n  A700: '#ff6d00'\n};\n/* harmony default export */ var colors_orange = (orange);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/blue.js\nconst blue = {\n  50: '#e3f2fd',\n  100: '#bbdefb',\n  200: '#90caf9',\n  300: '#64b5f6',\n  400: '#42a5f5',\n  500: '#2196f3',\n  600: '#1e88e5',\n  700: '#1976d2',\n  800: '#1565c0',\n  900: '#0d47a1',\n  A100: '#82b1ff',\n  A200: '#448aff',\n  A400: '#2979ff',\n  A700: '#2962ff'\n};\n/* harmony default export */ var colors_blue = (blue);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/lightBlue.js\nconst lightBlue = {\n  50: '#e1f5fe',\n  100: '#b3e5fc',\n  200: '#81d4fa',\n  300: '#4fc3f7',\n  400: '#29b6f6',\n  500: '#03a9f4',\n  600: '#039be5',\n  700: '#0288d1',\n  800: '#0277bd',\n  900: '#01579b',\n  A100: '#80d8ff',\n  A200: '#40c4ff',\n  A400: '#00b0ff',\n  A700: '#0091ea'\n};\n/* harmony default export */ var colors_lightBlue = (lightBlue);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/colors/green.js\nconst green = {\n  50: '#e8f5e9',\n  100: '#c8e6c9',\n  200: '#a5d6a7',\n  300: '#81c784',\n  400: '#66bb6a',\n  500: '#4caf50',\n  600: '#43a047',\n  700: '#388e3c',\n  800: '#2e7d32',\n  900: '#1b5e20',\n  A100: '#b9f6ca',\n  A200: '#69f0ae',\n  A400: '#00e676',\n  A700: '#00c853'\n};\n/* harmony default export */ var colors_green = (green);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/createPalette.js\n\n\n\nconst _excluded = [\"mode\", \"contrastThreshold\", \"tonalOffset\"];\n\n\n\n\n\n\n\n\n\n\nconst light = {\n  // The colors used to style the text.\n  text: {\n    // The most important text.\n    primary: 'rgba(0, 0, 0, 0.87)',\n    // Secondary text.\n    secondary: 'rgba(0, 0, 0, 0.6)',\n    // Disabled text have even lower visual prominence.\n    disabled: 'rgba(0, 0, 0, 0.38)'\n  },\n  // The color used to divide different elements.\n  divider: 'rgba(0, 0, 0, 0.12)',\n  // The background colors used to style the surfaces.\n  // Consistency between these values is important.\n  background: {\n    paper: colors_common.white,\n    default: colors_common.white\n  },\n  // The colors used to style the action elements.\n  action: {\n    // The color of an active action like an icon button.\n    active: 'rgba(0, 0, 0, 0.54)',\n    // The color of an hovered action.\n    hover: 'rgba(0, 0, 0, 0.04)',\n    hoverOpacity: 0.04,\n    // The color of a selected action.\n    selected: 'rgba(0, 0, 0, 0.08)',\n    selectedOpacity: 0.08,\n    // The color of a disabled action.\n    disabled: 'rgba(0, 0, 0, 0.26)',\n    // The background color of a disabled action.\n    disabledBackground: 'rgba(0, 0, 0, 0.12)',\n    disabledOpacity: 0.38,\n    focus: 'rgba(0, 0, 0, 0.12)',\n    focusOpacity: 0.12,\n    activatedOpacity: 0.12\n  }\n};\nconst dark = {\n  text: {\n    primary: colors_common.white,\n    secondary: 'rgba(255, 255, 255, 0.7)',\n    disabled: 'rgba(255, 255, 255, 0.5)',\n    icon: 'rgba(255, 255, 255, 0.5)'\n  },\n  divider: 'rgba(255, 255, 255, 0.12)',\n  background: {\n    paper: '#121212',\n    default: '#121212'\n  },\n  action: {\n    active: colors_common.white,\n    hover: 'rgba(255, 255, 255, 0.08)',\n    hoverOpacity: 0.08,\n    selected: 'rgba(255, 255, 255, 0.16)',\n    selectedOpacity: 0.16,\n    disabled: 'rgba(255, 255, 255, 0.3)',\n    disabledBackground: 'rgba(255, 255, 255, 0.12)',\n    disabledOpacity: 0.38,\n    focus: 'rgba(255, 255, 255, 0.12)',\n    focusOpacity: 0.12,\n    activatedOpacity: 0.24\n  }\n};\nfunction addLightOrDark(intent, direction, shade, tonalOffset) {\n  const tonalOffsetLight = tonalOffset.light || tonalOffset;\n  const tonalOffsetDark = tonalOffset.dark || tonalOffset * 1.5;\n  if (!intent[direction]) {\n    if (intent.hasOwnProperty(shade)) {\n      intent[direction] = intent[shade];\n    } else if (direction === 'light') {\n      intent.light = (0,colorManipulator/* lighten */.$n)(intent.main, tonalOffsetLight);\n    } else if (direction === 'dark') {\n      intent.dark = (0,colorManipulator/* darken */._j)(intent.main, tonalOffsetDark);\n    }\n  }\n}\nfunction getDefaultPrimary(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_blue[200],\n      light: colors_blue[50],\n      dark: colors_blue[400]\n    };\n  }\n  return {\n    main: colors_blue[700],\n    light: colors_blue[400],\n    dark: colors_blue[800]\n  };\n}\nfunction getDefaultSecondary(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_purple[200],\n      light: colors_purple[50],\n      dark: colors_purple[400]\n    };\n  }\n  return {\n    main: colors_purple[500],\n    light: colors_purple[300],\n    dark: colors_purple[700]\n  };\n}\nfunction getDefaultError(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_red[500],\n      light: colors_red[300],\n      dark: colors_red[700]\n    };\n  }\n  return {\n    main: colors_red[700],\n    light: colors_red[400],\n    dark: colors_red[800]\n  };\n}\nfunction getDefaultInfo(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_lightBlue[400],\n      light: colors_lightBlue[300],\n      dark: colors_lightBlue[700]\n    };\n  }\n  return {\n    main: colors_lightBlue[700],\n    light: colors_lightBlue[500],\n    dark: colors_lightBlue[900]\n  };\n}\nfunction getDefaultSuccess(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_green[400],\n      light: colors_green[300],\n      dark: colors_green[700]\n    };\n  }\n  return {\n    main: colors_green[800],\n    light: colors_green[500],\n    dark: colors_green[900]\n  };\n}\nfunction getDefaultWarning(mode = 'light') {\n  if (mode === 'dark') {\n    return {\n      main: colors_orange[400],\n      light: colors_orange[300],\n      dark: colors_orange[700]\n    };\n  }\n  return {\n    main: '#ed6c02',\n    // closest to orange[800] that pass 3:1.\n    light: colors_orange[500],\n    dark: colors_orange[900]\n  };\n}\nfunction createPalette(palette) {\n  const {\n      mode = 'light',\n      contrastThreshold = 3,\n      tonalOffset = 0.2\n    } = palette,\n    other = (0,objectWithoutPropertiesLoose/* default */.Z)(palette, _excluded);\n  const primary = palette.primary || getDefaultPrimary(mode);\n  const secondary = palette.secondary || getDefaultSecondary(mode);\n  const error = palette.error || getDefaultError(mode);\n  const info = palette.info || getDefaultInfo(mode);\n  const success = palette.success || getDefaultSuccess(mode);\n  const warning = palette.warning || getDefaultWarning(mode);\n\n  // Use the same logic as\n  // Bootstrap: https://github.com/twbs/bootstrap/blob/1d6e3710dd447de1a200f29e8fa521f8a0908f70/scss/_functions.scss#L59\n  // and material-components-web https://github.com/material-components/material-components-web/blob/ac46b8863c4dab9fc22c4c662dc6bd1b65dd652f/packages/mdc-theme/_functions.scss#L54\n  function getContrastText(background) {\n    const contrastText = (0,colorManipulator/* getContrastRatio */.mi)(background, dark.text.primary) >= contrastThreshold ? dark.text.primary : light.text.primary;\n    if (false) {}\n    return contrastText;\n  }\n  const augmentColor = ({\n    color,\n    name,\n    mainShade = 500,\n    lightShade = 300,\n    darkShade = 700\n  }) => {\n    color = (0,esm_extends/* default */.Z)({}, color);\n    if (!color.main && color[mainShade]) {\n      color.main = color[mainShade];\n    }\n    if (!color.hasOwnProperty('main')) {\n      throw new Error( false ? 0 : (0,formatMuiErrorMessage/* default */.Z)(11, name ? ` (${name})` : '', mainShade));\n    }\n    if (typeof color.main !== 'string') {\n      throw new Error( false ? 0 : (0,formatMuiErrorMessage/* default */.Z)(12, name ? ` (${name})` : '', JSON.stringify(color.main)));\n    }\n    addLightOrDark(color, 'light', lightShade, tonalOffset);\n    addLightOrDark(color, 'dark', darkShade, tonalOffset);\n    if (!color.contrastText) {\n      color.contrastText = getContrastText(color.main);\n    }\n    return color;\n  };\n  const modes = {\n    dark,\n    light\n  };\n  if (false) {}\n  const paletteOutput = (0,deepmerge/* default */.Z)((0,esm_extends/* default */.Z)({\n    // A collection of common colors.\n    common: (0,esm_extends/* default */.Z)({}, colors_common),\n    // prevent mutable object.\n    // The palette mode, can be light or dark.\n    mode,\n    // The colors used to represent primary interface elements for a user.\n    primary: augmentColor({\n      color: primary,\n      name: 'primary'\n    }),\n    // The colors used to represent secondary interface elements for a user.\n    secondary: augmentColor({\n      color: secondary,\n      name: 'secondary',\n      mainShade: 'A400',\n      lightShade: 'A200',\n      darkShade: 'A700'\n    }),\n    // The colors used to represent interface elements that the user should be made aware of.\n    error: augmentColor({\n      color: error,\n      name: 'error'\n    }),\n    // The colors used to represent potentially dangerous actions or important messages.\n    warning: augmentColor({\n      color: warning,\n      name: 'warning'\n    }),\n    // The colors used to present information to the user that is neutral and not necessarily important.\n    info: augmentColor({\n      color: info,\n      name: 'info'\n    }),\n    // The colors used to indicate the successful completion of an action that user triggered.\n    success: augmentColor({\n      color: success,\n      name: 'success'\n    }),\n    // The grey colors.\n    grey: colors_grey,\n    // Used by `getContrastText()` to maximize the contrast between\n    // the background and the text.\n    contrastThreshold,\n    // Takes a background color and returns the text color that maximizes the contrast.\n    getContrastText,\n    // Generate a rich color object.\n    augmentColor,\n    // Used by the functions below to shift a color's luminance by approximately\n    // two indexes within its tonal palette.\n    // E.g., shift from Red 500 to Red 300 or Red 700.\n    tonalOffset\n  }, modes[mode]), other);\n  return paletteOutput;\n}\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/createTypography.js\n\n\nconst createTypography_excluded = [\"fontFamily\", \"fontSize\", \"fontWeightLight\", \"fontWeightRegular\", \"fontWeightMedium\", \"fontWeightBold\", \"htmlFontSize\", \"allVariants\", \"pxToRem\"];\n\nfunction round(value) {\n  return Math.round(value * 1e5) / 1e5;\n}\nconst caseAllCaps = {\n  textTransform: 'uppercase'\n};\nconst defaultFontFamily = '\"Roboto\", \"Helvetica\", \"Arial\", sans-serif';\n\n/**\n * @see @link{https://m2.material.io/design/typography/the-type-system.html}\n * @see @link{https://m2.material.io/design/typography/understanding-typography.html}\n */\nfunction createTypography(palette, typography) {\n  const _ref = typeof typography === 'function' ? typography(palette) : typography,\n    {\n      fontFamily = defaultFontFamily,\n      // The default font size of the Material Specification.\n      fontSize = 14,\n      // px\n      fontWeightLight = 300,\n      fontWeightRegular = 400,\n      fontWeightMedium = 500,\n      fontWeightBold = 700,\n      // Tell MUI what's the font-size on the html element.\n      // 16px is the default font-size used by browsers.\n      htmlFontSize = 16,\n      // Apply the CSS properties to all the variants.\n      allVariants,\n      pxToRem: pxToRem2\n    } = _ref,\n    other = (0,objectWithoutPropertiesLoose/* default */.Z)(_ref, createTypography_excluded);\n  if (false) {}\n  const coef = fontSize / 14;\n  const pxToRem = pxToRem2 || (size => `${size / htmlFontSize * coef}rem`);\n  const buildVariant = (fontWeight, size, lineHeight, letterSpacing, casing) => (0,esm_extends/* default */.Z)({\n    fontFamily,\n    fontWeight,\n    fontSize: pxToRem(size),\n    // Unitless following https://meyerweb.com/eric/thoughts/2006/02/08/unitless-line-heights/\n    lineHeight\n  }, fontFamily === defaultFontFamily ? {\n    letterSpacing: `${round(letterSpacing / size)}em`\n  } : {}, casing, allVariants);\n  const variants = {\n    h1: buildVariant(fontWeightLight, 96, 1.167, -1.5),\n    h2: buildVariant(fontWeightLight, 60, 1.2, -0.5),\n    h3: buildVariant(fontWeightRegular, 48, 1.167, 0),\n    h4: buildVariant(fontWeightRegular, 34, 1.235, 0.25),\n    h5: buildVariant(fontWeightRegular, 24, 1.334, 0),\n    h6: buildVariant(fontWeightMedium, 20, 1.6, 0.15),\n    subtitle1: buildVariant(fontWeightRegular, 16, 1.75, 0.15),\n    subtitle2: buildVariant(fontWeightMedium, 14, 1.57, 0.1),\n    body1: buildVariant(fontWeightRegular, 16, 1.5, 0.15),\n    body2: buildVariant(fontWeightRegular, 14, 1.43, 0.15),\n    button: buildVariant(fontWeightMedium, 14, 1.75, 0.4, caseAllCaps),\n    caption: buildVariant(fontWeightRegular, 12, 1.66, 0.4),\n    overline: buildVariant(fontWeightRegular, 12, 2.66, 1, caseAllCaps),\n    // TODO v6: Remove handling of 'inherit' variant from the theme as it is already handled in Material UI's Typography component. Also, remember to remove the associated types.\n    inherit: {\n      fontFamily: 'inherit',\n      fontWeight: 'inherit',\n      fontSize: 'inherit',\n      lineHeight: 'inherit',\n      letterSpacing: 'inherit'\n    }\n  };\n  return (0,deepmerge/* default */.Z)((0,esm_extends/* default */.Z)({\n    htmlFontSize,\n    pxToRem,\n    fontFamily,\n    fontSize,\n    fontWeightLight,\n    fontWeightRegular,\n    fontWeightMedium,\n    fontWeightBold\n  }, variants), other, {\n    clone: false // No need to clone deep\n  });\n}\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/shadows.js\nconst shadowKeyUmbraOpacity = 0.2;\nconst shadowKeyPenumbraOpacity = 0.14;\nconst shadowAmbientShadowOpacity = 0.12;\nfunction createShadow(...px) {\n  return [`${px[0]}px ${px[1]}px ${px[2]}px ${px[3]}px rgba(0,0,0,${shadowKeyUmbraOpacity})`, `${px[4]}px ${px[5]}px ${px[6]}px ${px[7]}px rgba(0,0,0,${shadowKeyPenumbraOpacity})`, `${px[8]}px ${px[9]}px ${px[10]}px ${px[11]}px rgba(0,0,0,${shadowAmbientShadowOpacity})`].join(',');\n}\n\n// Values from https://github.com/material-components/material-components-web/blob/be8747f94574669cb5e7add1a7c54fa41a89cec7/packages/mdc-elevation/_variables.scss\nconst shadows = ['none', createShadow(0, 2, 1, -1, 0, 1, 1, 0, 0, 1, 3, 0), createShadow(0, 3, 1, -2, 0, 2, 2, 0, 0, 1, 5, 0), createShadow(0, 3, 3, -2, 0, 3, 4, 0, 0, 1, 8, 0), createShadow(0, 2, 4, -1, 0, 4, 5, 0, 0, 1, 10, 0), createShadow(0, 3, 5, -1, 0, 5, 8, 0, 0, 1, 14, 0), createShadow(0, 3, 5, -1, 0, 6, 10, 0, 0, 1, 18, 0), createShadow(0, 4, 5, -2, 0, 7, 10, 1, 0, 2, 16, 1), createShadow(0, 5, 5, -3, 0, 8, 10, 1, 0, 3, 14, 2), createShadow(0, 5, 6, -3, 0, 9, 12, 1, 0, 3, 16, 2), createShadow(0, 6, 6, -3, 0, 10, 14, 1, 0, 4, 18, 3), createShadow(0, 6, 7, -4, 0, 11, 15, 1, 0, 4, 20, 3), createShadow(0, 7, 8, -4, 0, 12, 17, 2, 0, 5, 22, 4), createShadow(0, 7, 8, -4, 0, 13, 19, 2, 0, 5, 24, 4), createShadow(0, 7, 9, -4, 0, 14, 21, 2, 0, 5, 26, 4), createShadow(0, 8, 9, -5, 0, 15, 22, 2, 0, 6, 28, 5), createShadow(0, 8, 10, -5, 0, 16, 24, 2, 0, 6, 30, 5), createShadow(0, 8, 11, -5, 0, 17, 26, 2, 0, 6, 32, 5), createShadow(0, 9, 11, -5, 0, 18, 28, 2, 0, 7, 34, 6), createShadow(0, 9, 12, -6, 0, 19, 29, 2, 0, 7, 36, 6), createShadow(0, 10, 13, -6, 0, 20, 31, 3, 0, 8, 38, 7), createShadow(0, 10, 13, -6, 0, 21, 33, 3, 0, 8, 40, 7), createShadow(0, 10, 14, -6, 0, 22, 35, 3, 0, 8, 42, 7), createShadow(0, 11, 14, -7, 0, 23, 36, 3, 0, 9, 44, 8), createShadow(0, 11, 15, -7, 0, 24, 38, 3, 0, 9, 46, 8)];\n/* harmony default export */ var styles_shadows = (shadows);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/createTransitions.js\n\n\nconst createTransitions_excluded = [\"duration\", \"easing\", \"delay\"];\n// Follow https://material.google.com/motion/duration-easing.html#duration-easing-natural-easing-curves\n// to learn the context in which each easing should be used.\nconst easing = {\n  // This is the most common easing curve.\n  easeInOut: 'cubic-bezier(0.4, 0, 0.2, 1)',\n  // Objects enter the screen at full velocity from off-screen and\n  // slowly decelerate to a resting point.\n  easeOut: 'cubic-bezier(0.0, 0, 0.2, 1)',\n  // Objects leave the screen at full velocity. They do not decelerate when off-screen.\n  easeIn: 'cubic-bezier(0.4, 0, 1, 1)',\n  // The sharp curve is used by objects that may return to the screen at any time.\n  sharp: 'cubic-bezier(0.4, 0, 0.6, 1)'\n};\n\n// Follow https://m2.material.io/guidelines/motion/duration-easing.html#duration-easing-common-durations\n// to learn when use what timing\nconst duration = {\n  shortest: 150,\n  shorter: 200,\n  short: 250,\n  // most basic recommended timing\n  standard: 300,\n  // this is to be used in complex animations\n  complex: 375,\n  // recommended when something is entering screen\n  enteringScreen: 225,\n  // recommended when something is leaving screen\n  leavingScreen: 195\n};\nfunction formatMs(milliseconds) {\n  return `${Math.round(milliseconds)}ms`;\n}\nfunction getAutoHeightDuration(height) {\n  if (!height) {\n    return 0;\n  }\n  const constant = height / 36;\n\n  // https://www.wolframalpha.com/input/?i=(4+%2B+15+*+(x+%2F+36+)+**+0.25+%2B+(x+%2F+36)+%2F+5)+*+10\n  return Math.round((4 + 15 * constant ** 0.25 + constant / 5) * 10);\n}\nfunction createTransitions(inputTransitions) {\n  const mergedEasing = (0,esm_extends/* default */.Z)({}, easing, inputTransitions.easing);\n  const mergedDuration = (0,esm_extends/* default */.Z)({}, duration, inputTransitions.duration);\n  const create = (props = ['all'], options = {}) => {\n    const {\n        duration: durationOption = mergedDuration.standard,\n        easing: easingOption = mergedEasing.easeInOut,\n        delay = 0\n      } = options,\n      other = (0,objectWithoutPropertiesLoose/* default */.Z)(options, createTransitions_excluded);\n    if (false) {}\n    return (Array.isArray(props) ? props : [props]).map(animatedProp => `${animatedProp} ${typeof durationOption === 'string' ? durationOption : formatMs(durationOption)} ${easingOption} ${typeof delay === 'string' ? delay : formatMs(delay)}`).join(',');\n  };\n  return (0,esm_extends/* default */.Z)({\n    getAutoHeightDuration,\n    create\n  }, inputTransitions, {\n    easing: mergedEasing,\n    duration: mergedDuration\n  });\n}\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/zIndex.js\n// We need to centralize the zIndex definitions as they work\n// like global values in the browser.\nconst zIndex = {\n  mobileStepper: 1000,\n  fab: 1050,\n  speedDial: 1050,\n  appBar: 1100,\n  drawer: 1200,\n  modal: 1300,\n  snackbar: 1400,\n  tooltip: 1500\n};\n/* harmony default export */ var styles_zIndex = (zIndex);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/createTheme.js\n\n\n\nconst createTheme_excluded = [\"breakpoints\", \"mixins\", \"spacing\", \"palette\", \"transitions\", \"typography\", \"shape\"];\n\n\n\n\n\n\n\n\n\n\nfunction createTheme_createTheme(options = {}, ...args) {\n  const {\n      mixins: mixinsInput = {},\n      palette: paletteInput = {},\n      transitions: transitionsInput = {},\n      typography: typographyInput = {}\n    } = options,\n    other = (0,objectWithoutPropertiesLoose/* default */.Z)(options, createTheme_excluded);\n  if (options.vars) {\n    throw new Error( false ? 0 : (0,formatMuiErrorMessage/* default */.Z)(18));\n  }\n  const palette = createPalette(paletteInput);\n  const systemTheme = (0,createTheme/* default */.Z)(options);\n  let muiTheme = (0,deepmerge/* default */.Z)(systemTheme, {\n    mixins: createMixins(systemTheme.breakpoints, mixinsInput),\n    palette,\n    // Don't use [...shadows] until you've verified its transpiled code is not invoking the iterator protocol.\n    shadows: styles_shadows.slice(),\n    typography: createTypography(palette, typographyInput),\n    transitions: createTransitions(transitionsInput),\n    zIndex: (0,esm_extends/* default */.Z)({}, styles_zIndex)\n  });\n  muiTheme = (0,deepmerge/* default */.Z)(muiTheme, other);\n  muiTheme = args.reduce((acc, argument) => (0,deepmerge/* default */.Z)(acc, argument), muiTheme);\n  if (false) {}\n  muiTheme.unstable_sxConfig = (0,esm_extends/* default */.Z)({}, defaultSxConfig/* default */.Z, other == null ? void 0 : other.unstable_sxConfig);\n  muiTheme.unstable_sx = function sx(props) {\n    return (0,styleFunctionSx/* default */.Z)({\n      sx: props,\n      theme: this\n    });\n  };\n  return muiTheme;\n}\nlet warnedOnce = false;\nfunction createMuiTheme(...args) {\n  if (false) {}\n  return createTheme_createTheme(...args);\n}\n/* harmony default export */ var styles_createTheme = (createTheme_createTheme);\n\n/***/ }),\n\n/***/ 247:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony import */ var _createTheme__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(1265);\n'use client';\n\n\nconst defaultTheme = (0,_createTheme__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)();\n/* harmony default export */ __webpack_exports__[\"Z\"] = (defaultTheme);\n\n/***/ }),\n\n/***/ 606:\n/***/ (function(__unused_webpack_module, __webpack_exports__) {\n\n\"use strict\";\n/* harmony default export */ __webpack_exports__[\"Z\"] = ('$$material');\n\n/***/ }),\n\n/***/ 1234:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ GlobalStyles; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _emotion_react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(917);\n/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(5893);\n'use client';\n\n\n\n\n\nfunction isEmpty(obj) {\n  return obj === undefined || obj === null || Object.keys(obj).length === 0;\n}\nfunction GlobalStyles(props) {\n  const {\n    styles,\n    defaultTheme = {}\n  } = props;\n  const globalStyles = typeof styles === 'function' ? themeInput => styles(isEmpty(themeInput) ? defaultTheme : themeInput) : styles;\n  return /*#__PURE__*/(0,react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__.jsx)(_emotion_react__WEBPACK_IMPORTED_MODULE_2__/* .Global */ .xB, {\n    styles: globalStyles\n  });\n}\n false ? 0 : void 0;\n\n/***/ }),\n\n/***/ 2101:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\nvar __webpack_unused_export__;\n\n\nvar _interopRequireDefault = __webpack_require__(4836);\n__webpack_unused_export__ = ({\n  value: true\n});\nexports.Fq = alpha;\n__webpack_unused_export__ = blend;\n__webpack_unused_export__ = void 0;\nexports._j = darken;\n__webpack_unused_export__ = decomposeColor;\n__webpack_unused_export__ = emphasize;\nexports.mi = getContrastRatio;\n__webpack_unused_export__ = getLuminance;\n__webpack_unused_export__ = hexToRgb;\n__webpack_unused_export__ = hslToRgb;\nexports.$n = lighten;\n__webpack_unused_export__ = private_safeAlpha;\n__webpack_unused_export__ = void 0;\n__webpack_unused_export__ = private_safeDarken;\n__webpack_unused_export__ = private_safeEmphasize;\n__webpack_unused_export__ = private_safeLighten;\n__webpack_unused_export__ = recomposeColor;\n__webpack_unused_export__ = rgbToHex;\nvar _formatMuiErrorMessage2 = _interopRequireDefault(__webpack_require__(743));\nvar _clamp = _interopRequireDefault(__webpack_require__(9425));\n/* eslint-disable @typescript-eslint/naming-convention */\n\n/**\n * Returns a number whose value is limited to the given range.\n * @param {number} value The value to be clamped\n * @param {number} min The lower boundary of the output range\n * @param {number} max The upper boundary of the output range\n * @returns {number} A number in the range [min, max]\n */\nfunction clampWrapper(value, min = 0, max = 1) {\n  if (false) {}\n  return (0, _clamp.default)(value, min, max);\n}\n\n/**\n * Converts a color from CSS hex format to CSS rgb format.\n * @param {string} color - Hex color, i.e. #nnn or #nnnnnn\n * @returns {string} A CSS rgb color string\n */\nfunction hexToRgb(color) {\n  color = color.slice(1);\n  const re = new RegExp(`.{1,${color.length >= 6 ? 2 : 1}}`, 'g');\n  let colors = color.match(re);\n  if (colors && colors[0].length === 1) {\n    colors = colors.map(n => n + n);\n  }\n  return colors ? `rgb${colors.length === 4 ? 'a' : ''}(${colors.map((n, index) => {\n    return index < 3 ? parseInt(n, 16) : Math.round(parseInt(n, 16) / 255 * 1000) / 1000;\n  }).join(', ')})` : '';\n}\nfunction intToHex(int) {\n  const hex = int.toString(16);\n  return hex.length === 1 ? `0${hex}` : hex;\n}\n\n/**\n * Returns an object with the type and values of a color.\n *\n * Note: Does not support rgb % values.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {object} - A MUI color object: {type: string, values: number[]}\n */\nfunction decomposeColor(color) {\n  // Idempotent\n  if (color.type) {\n    return color;\n  }\n  if (color.charAt(0) === '#') {\n    return decomposeColor(hexToRgb(color));\n  }\n  const marker = color.indexOf('(');\n  const type = color.substring(0, marker);\n  if (['rgb', 'rgba', 'hsl', 'hsla', 'color'].indexOf(type) === -1) {\n    throw new Error( false ? 0 : (0, _formatMuiErrorMessage2.default)(9, color));\n  }\n  let values = color.substring(marker + 1, color.length - 1);\n  let colorSpace;\n  if (type === 'color') {\n    values = values.split(' ');\n    colorSpace = values.shift();\n    if (values.length === 4 && values[3].charAt(0) === '/') {\n      values[3] = values[3].slice(1);\n    }\n    if (['srgb', 'display-p3', 'a98-rgb', 'prophoto-rgb', 'rec-2020'].indexOf(colorSpace) === -1) {\n      throw new Error( false ? 0 : (0, _formatMuiErrorMessage2.default)(10, colorSpace));\n    }\n  } else {\n    values = values.split(',');\n  }\n  values = values.map(value => parseFloat(value));\n  return {\n    type,\n    values,\n    colorSpace\n  };\n}\n\n/**\n * Returns a channel created from the input color.\n *\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {string} - The channel for the color, that can be used in rgba or hsla colors\n */\nconst colorChannel = color => {\n  const decomposedColor = decomposeColor(color);\n  return decomposedColor.values.slice(0, 3).map((val, idx) => decomposedColor.type.indexOf('hsl') !== -1 && idx !== 0 ? `${val}%` : val).join(' ');\n};\n__webpack_unused_export__ = colorChannel;\nconst private_safeColorChannel = (color, warning) => {\n  try {\n    return colorChannel(color);\n  } catch (error) {\n    if (warning && \"production\" !== 'production') {}\n    return color;\n  }\n};\n\n/**\n * Converts a color object with type and values to a string.\n * @param {object} color - Decomposed color\n * @param {string} color.type - One of: 'rgb', 'rgba', 'hsl', 'hsla', 'color'\n * @param {array} color.values - [n,n,n] or [n,n,n,n]\n * @returns {string} A CSS color string\n */\n__webpack_unused_export__ = private_safeColorChannel;\nfunction recomposeColor(color) {\n  const {\n    type,\n    colorSpace\n  } = color;\n  let {\n    values\n  } = color;\n  if (type.indexOf('rgb') !== -1) {\n    // Only convert the first 3 values to int (i.e. not alpha)\n    values = values.map((n, i) => i < 3 ? parseInt(n, 10) : n);\n  } else if (type.indexOf('hsl') !== -1) {\n    values[1] = `${values[1]}%`;\n    values[2] = `${values[2]}%`;\n  }\n  if (type.indexOf('color') !== -1) {\n    values = `${colorSpace} ${values.join(' ')}`;\n  } else {\n    values = `${values.join(', ')}`;\n  }\n  return `${type}(${values})`;\n}\n\n/**\n * Converts a color from CSS rgb format to CSS hex format.\n * @param {string} color - RGB color, i.e. rgb(n, n, n)\n * @returns {string} A CSS rgb color string, i.e. #nnnnnn\n */\nfunction rgbToHex(color) {\n  // Idempotent\n  if (color.indexOf('#') === 0) {\n    return color;\n  }\n  const {\n    values\n  } = decomposeColor(color);\n  return `#${values.map((n, i) => intToHex(i === 3 ? Math.round(255 * n) : n)).join('')}`;\n}\n\n/**\n * Converts a color from hsl format to rgb format.\n * @param {string} color - HSL color values\n * @returns {string} rgb color values\n */\nfunction hslToRgb(color) {\n  color = decomposeColor(color);\n  const {\n    values\n  } = color;\n  const h = values[0];\n  const s = values[1] / 100;\n  const l = values[2] / 100;\n  const a = s * Math.min(l, 1 - l);\n  const f = (n, k = (n + h / 30) % 12) => l - a * Math.max(Math.min(k - 3, 9 - k, 1), -1);\n  let type = 'rgb';\n  const rgb = [Math.round(f(0) * 255), Math.round(f(8) * 255), Math.round(f(4) * 255)];\n  if (color.type === 'hsla') {\n    type += 'a';\n    rgb.push(values[3]);\n  }\n  return recomposeColor({\n    type,\n    values: rgb\n  });\n}\n/**\n * The relative brightness of any point in a color space,\n * normalized to 0 for darkest black and 1 for lightest white.\n *\n * Formula: https://www.w3.org/TR/WCAG20-TECHS/G17.html#G17-tests\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @returns {number} The relative brightness of the color in the range 0 - 1\n */\nfunction getLuminance(color) {\n  color = decomposeColor(color);\n  let rgb = color.type === 'hsl' || color.type === 'hsla' ? decomposeColor(hslToRgb(color)).values : color.values;\n  rgb = rgb.map(val => {\n    if (color.type !== 'color') {\n      val /= 255; // normalized\n    }\n    return val <= 0.03928 ? val / 12.92 : ((val + 0.055) / 1.055) ** 2.4;\n  });\n\n  // Truncate at 3 digits\n  return Number((0.2126 * rgb[0] + 0.7152 * rgb[1] + 0.0722 * rgb[2]).toFixed(3));\n}\n\n/**\n * Calculates the contrast ratio between two colors.\n *\n * Formula: https://www.w3.org/TR/WCAG20-TECHS/G17.html#G17-tests\n * @param {string} foreground - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla()\n * @param {string} background - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla()\n * @returns {number} A contrast ratio value in the range 0 - 21.\n */\nfunction getContrastRatio(foreground, background) {\n  const lumA = getLuminance(foreground);\n  const lumB = getLuminance(background);\n  return (Math.max(lumA, lumB) + 0.05) / (Math.min(lumA, lumB) + 0.05);\n}\n\n/**\n * Sets the absolute transparency of a color.\n * Any existing alpha values are overwritten.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} value - value to set the alpha channel to in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction alpha(color, value) {\n  color = decomposeColor(color);\n  value = clampWrapper(value);\n  if (color.type === 'rgb' || color.type === 'hsl') {\n    color.type += 'a';\n  }\n  if (color.type === 'color') {\n    color.values[3] = `/${value}`;\n  } else {\n    color.values[3] = value;\n  }\n  return recomposeColor(color);\n}\nfunction private_safeAlpha(color, value, warning) {\n  try {\n    return alpha(color, value);\n  } catch (error) {\n    if (warning && \"production\" !== 'production') {}\n    return color;\n  }\n}\n\n/**\n * Darkens a color.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction darken(color, coefficient) {\n  color = decomposeColor(color);\n  coefficient = clampWrapper(coefficient);\n  if (color.type.indexOf('hsl') !== -1) {\n    color.values[2] *= 1 - coefficient;\n  } else if (color.type.indexOf('rgb') !== -1 || color.type.indexOf('color') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] *= 1 - coefficient;\n    }\n  }\n  return recomposeColor(color);\n}\nfunction private_safeDarken(color, coefficient, warning) {\n  try {\n    return darken(color, coefficient);\n  } catch (error) {\n    if (warning && \"production\" !== 'production') {}\n    return color;\n  }\n}\n\n/**\n * Lightens a color.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction lighten(color, coefficient) {\n  color = decomposeColor(color);\n  coefficient = clampWrapper(coefficient);\n  if (color.type.indexOf('hsl') !== -1) {\n    color.values[2] += (100 - color.values[2]) * coefficient;\n  } else if (color.type.indexOf('rgb') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] += (255 - color.values[i]) * coefficient;\n    }\n  } else if (color.type.indexOf('color') !== -1) {\n    for (let i = 0; i < 3; i += 1) {\n      color.values[i] += (1 - color.values[i]) * coefficient;\n    }\n  }\n  return recomposeColor(color);\n}\nfunction private_safeLighten(color, coefficient, warning) {\n  try {\n    return lighten(color, coefficient);\n  } catch (error) {\n    if (warning && \"production\" !== 'production') {}\n    return color;\n  }\n}\n\n/**\n * Darken or lighten a color, depending on its luminance.\n * Light colors are darkened, dark colors are lightened.\n * @param {string} color - CSS color, i.e. one of: #nnn, #nnnnnn, rgb(), rgba(), hsl(), hsla(), color()\n * @param {number} coefficient=0.15 - multiplier in the range 0 - 1\n * @returns {string} A CSS color string. Hex input values are returned as rgb\n */\nfunction emphasize(color, coefficient = 0.15) {\n  return getLuminance(color) > 0.5 ? darken(color, coefficient) : lighten(color, coefficient);\n}\nfunction private_safeEmphasize(color, coefficient, warning) {\n  try {\n    return emphasize(color, coefficient);\n  } catch (error) {\n    if (warning && \"production\" !== 'production') {}\n    return color;\n  }\n}\n\n/**\n * Blend a transparent overlay color with a background color, resulting in a single\n * RGB color.\n * @param {string} background - CSS color\n * @param {string} overlay - CSS color\n * @param {number} opacity - Opacity multiplier in the range 0 - 1\n * @param {number} [gamma=1.0] - Gamma correction factor. For gamma-correct blending, 2.2 is usual.\n */\nfunction blend(background, overlay, opacity, gamma = 1.0) {\n  const blendChannel = (b, o) => Math.round((b ** (1 / gamma) * (1 - opacity) + o ** (1 / gamma) * opacity) ** gamma);\n  const backgroundColor = decomposeColor(background);\n  const overlayColor = decomposeColor(overlay);\n  const rgb = [blendChannel(backgroundColor.values[0], overlayColor.values[0]), blendChannel(backgroundColor.values[1], overlayColor.values[1]), blendChannel(backgroundColor.values[2], overlayColor.values[2])];\n  return recomposeColor({\n    type: 'rgb',\n    values: rgb\n  });\n}\n\n/***/ }),\n\n/***/ 2842:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"i\": function() { return /* binding */ useDefaultProps; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _mui_utils_resolveProps__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(2236);\n/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(5893);\n'use client';\n\n\n\n\n\nconst PropsContext = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createContext(undefined);\nfunction DefaultPropsProvider({\n  value,\n  children\n}) {\n  return /*#__PURE__*/(0,react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__.jsx)(PropsContext.Provider, {\n    value: value,\n    children: children\n  });\n}\n false ? 0 : void 0;\nfunction getThemeProps(params) {\n  const {\n    theme,\n    name,\n    props\n  } = params;\n  if (!theme || !theme.components || !theme.components[name]) {\n    return props;\n  }\n  const config = theme.components[name];\n  if (config.defaultProps) {\n    // compatible with v5 signature\n    return (0,_mui_utils_resolveProps__WEBPACK_IMPORTED_MODULE_2__/* [\"default\"] */ .Z)(config.defaultProps, props);\n  }\n  if (!config.styleOverrides && !config.variants) {\n    // v6 signature, no property 'defaultProps'\n    return (0,_mui_utils_resolveProps__WEBPACK_IMPORTED_MODULE_2__/* [\"default\"] */ .Z)(config, props);\n  }\n  return props;\n}\nfunction useDefaultProps({\n  props,\n  name\n}) {\n  const ctx = react__WEBPACK_IMPORTED_MODULE_0__.useContext(PropsContext);\n  return getThemeProps({\n    props,\n    name,\n    theme: {\n      components: ctx\n    }\n  });\n}\n/* harmony default export */ __webpack_exports__[\"Z\"] = (DefaultPropsProvider);\n\n/***/ }),\n\n/***/ 2056:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"V\": function() { return /* binding */ useRtl; }\n/* harmony export */ });\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(7462);\n/* harmony import */ var _babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(3366);\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(5893);\n\n\nconst _excluded = [\"value\"];\n\n\n\nconst RtlContext = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createContext();\nfunction RtlProvider(_ref) {\n  let {\n      value\n    } = _ref,\n    props = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_2__/* [\"default\"] */ .Z)(_ref, _excluded);\n  return /*#__PURE__*/(0,react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__.jsx)(RtlContext.Provider, (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_3__/* [\"default\"] */ .Z)({\n    value: value != null ? value : true\n  }, props));\n}\n false ? 0 : void 0;\nconst useRtl = () => {\n  const value = react__WEBPACK_IMPORTED_MODULE_0__.useContext(RtlContext);\n  return value != null ? value : false;\n};\n/* harmony default export */ __webpack_exports__[\"Z\"] = (RtlProvider);\n\n/***/ }),\n\n/***/ 5408:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"L7\": function() { return /* binding */ removeUnusedBreakpoints; },\n/* harmony export */   \"P$\": function() { return /* binding */ resolveBreakpointValues; },\n/* harmony export */   \"VO\": function() { return /* binding */ values; },\n/* harmony export */   \"W8\": function() { return /* binding */ createEmptyBreakpointObject; },\n/* harmony export */   \"dt\": function() { return /* binding */ mergeBreakpointsInOrder; },\n/* harmony export */   \"k9\": function() { return /* binding */ handleBreakpoints; }\n/* harmony export */ });\n/* unused harmony export computeBreakpointsBase */\n/* harmony import */ var _mui_utils_deepmerge__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8027);\n\n\n\n\n\n// The breakpoint **start** at this value.\n// For instance with the first breakpoint xs: [xs, sm[.\nconst values = {\n  xs: 0,\n  // phone\n  sm: 600,\n  // tablet\n  md: 900,\n  // small laptop\n  lg: 1200,\n  // desktop\n  xl: 1536 // large screen\n};\nconst defaultBreakpoints = {\n  // Sorted ASC by size. That's important.\n  // It can't be configured as it's used statically for propTypes.\n  keys: ['xs', 'sm', 'md', 'lg', 'xl'],\n  up: key => `@media (min-width:${values[key]}px)`\n};\nfunction handleBreakpoints(props, propValue, styleFromPropValue) {\n  const theme = props.theme || {};\n  if (Array.isArray(propValue)) {\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    return propValue.reduce((acc, item, index) => {\n      acc[themeBreakpoints.up(themeBreakpoints.keys[index])] = styleFromPropValue(propValue[index]);\n      return acc;\n    }, {});\n  }\n  if (typeof propValue === 'object') {\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    return Object.keys(propValue).reduce((acc, breakpoint) => {\n      // key is breakpoint\n      if (Object.keys(themeBreakpoints.values || values).indexOf(breakpoint) !== -1) {\n        const mediaKey = themeBreakpoints.up(breakpoint);\n        acc[mediaKey] = styleFromPropValue(propValue[breakpoint], breakpoint);\n      } else {\n        const cssKey = breakpoint;\n        acc[cssKey] = propValue[cssKey];\n      }\n      return acc;\n    }, {});\n  }\n  const output = styleFromPropValue(propValue);\n  return output;\n}\nfunction breakpoints(styleFunction) {\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const newStyleFunction = props => {\n    const theme = props.theme || {};\n    const base = styleFunction(props);\n    const themeBreakpoints = theme.breakpoints || defaultBreakpoints;\n    const extended = themeBreakpoints.keys.reduce((acc, key) => {\n      if (props[key]) {\n        acc = acc || {};\n        acc[themeBreakpoints.up(key)] = styleFunction(_extends({\n          theme\n        }, props[key]));\n      }\n      return acc;\n    }, null);\n    return merge(base, extended);\n  };\n  newStyleFunction.propTypes =  false ? 0 : {};\n  newStyleFunction.filterProps = ['xs', 'sm', 'md', 'lg', 'xl', ...styleFunction.filterProps];\n  return newStyleFunction;\n}\nfunction createEmptyBreakpointObject(breakpointsInput = {}) {\n  var _breakpointsInput$key;\n  const breakpointsInOrder = (_breakpointsInput$key = breakpointsInput.keys) == null ? void 0 : _breakpointsInput$key.reduce((acc, key) => {\n    const breakpointStyleKey = breakpointsInput.up(key);\n    acc[breakpointStyleKey] = {};\n    return acc;\n  }, {});\n  return breakpointsInOrder || {};\n}\nfunction removeUnusedBreakpoints(breakpointKeys, style) {\n  return breakpointKeys.reduce((acc, key) => {\n    const breakpointOutput = acc[key];\n    const isBreakpointUnused = !breakpointOutput || Object.keys(breakpointOutput).length === 0;\n    if (isBreakpointUnused) {\n      delete acc[key];\n    }\n    return acc;\n  }, style);\n}\nfunction mergeBreakpointsInOrder(breakpointsInput, ...styles) {\n  const emptyBreakpoints = createEmptyBreakpointObject(breakpointsInput);\n  const mergedOutput = [emptyBreakpoints, ...styles].reduce((prev, next) => (0,_mui_utils_deepmerge__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(prev, next), {});\n  return removeUnusedBreakpoints(Object.keys(emptyBreakpoints), mergedOutput);\n}\n\n// compute base for responsive values; e.g.,\n// [1,2,3] => {xs: true, sm: true, md: true}\n// {xs: 1, sm: 2, md: 3} => {xs: true, sm: true, md: true}\nfunction computeBreakpointsBase(breakpointValues, themeBreakpoints) {\n  // fixed value\n  if (typeof breakpointValues !== 'object') {\n    return {};\n  }\n  const base = {};\n  const breakpointsKeys = Object.keys(themeBreakpoints);\n  if (Array.isArray(breakpointValues)) {\n    breakpointsKeys.forEach((breakpoint, i) => {\n      if (i < breakpointValues.length) {\n        base[breakpoint] = true;\n      }\n    });\n  } else {\n    breakpointsKeys.forEach(breakpoint => {\n      if (breakpointValues[breakpoint] != null) {\n        base[breakpoint] = true;\n      }\n    });\n  }\n  return base;\n}\nfunction resolveBreakpointValues({\n  values: breakpointValues,\n  breakpoints: themeBreakpoints,\n  base: customBase\n}) {\n  const base = customBase || computeBreakpointsBase(breakpointValues, themeBreakpoints);\n  const keys = Object.keys(base);\n  if (keys.length === 0) {\n    return breakpointValues;\n  }\n  let previous;\n  return keys.reduce((acc, breakpoint, i) => {\n    if (Array.isArray(breakpointValues)) {\n      acc[breakpoint] = breakpointValues[i] != null ? breakpointValues[i] : breakpointValues[previous];\n      previous = i;\n    } else if (typeof breakpointValues === 'object') {\n      acc[breakpoint] = breakpointValues[breakpoint] != null ? breakpointValues[breakpoint] : breakpointValues[previous];\n      previous = breakpoint;\n    } else {\n      acc[breakpoint] = breakpointValues;\n    }\n    return acc;\n  }, {});\n}\n/* unused harmony default export */ var __WEBPACK_DEFAULT_EXPORT__ = ((/* unused pure expression or super */ null && (breakpoints)));\n\n/***/ }),\n\n/***/ 7064:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ applyStyles; }\n/* harmony export */ });\n/**\n * A universal utility to style components with multiple color modes. Always use it from the theme object.\n * It works with:\n *  - [Basic theme](https://mui.com/material-ui/customization/dark-mode/)\n *  - [CSS theme variables](https://mui.com/material-ui/experimental-api/css-theme-variables/overview/)\n *  - Zero-runtime engine\n *\n * Tips: Use an array over object spread and place `theme.applyStyles()` last.\n *\n * ✅ [{ background: '#e5e5e5' }, theme.applyStyles('dark', { background: '#1c1c1c' })]\n *\n * 🚫 { background: '#e5e5e5', ...theme.applyStyles('dark', { background: '#1c1c1c' })}\n *\n * @example\n * 1. using with `styled`:\n * ```jsx\n *   const Component = styled('div')(({ theme }) => [\n *     { background: '#e5e5e5' },\n *     theme.applyStyles('dark', {\n *       background: '#1c1c1c',\n *       color: '#fff',\n *     }),\n *   ]);\n * ```\n *\n * @example\n * 2. using with `sx` prop:\n * ```jsx\n *   <Box sx={theme => [\n *     { background: '#e5e5e5' },\n *     theme.applyStyles('dark', {\n *        background: '#1c1c1c',\n *        color: '#fff',\n *      }),\n *     ]}\n *   />\n * ```\n *\n * @example\n * 3. theming a component:\n * ```jsx\n *   extendTheme({\n *     components: {\n *       MuiButton: {\n *         styleOverrides: {\n *           root: ({ theme }) => [\n *             { background: '#e5e5e5' },\n *             theme.applyStyles('dark', {\n *               background: '#1c1c1c',\n *               color: '#fff',\n *             }),\n *           ],\n *         },\n *       }\n *     }\n *   })\n *```\n */\nfunction applyStyles(key, styles) {\n  // @ts-expect-error this is 'any' type\n  const theme = this;\n  if (theme.vars && typeof theme.getColorSchemeSelector === 'function') {\n    // If CssVarsProvider is used as a provider,\n    // returns '* :where([data-mui-color-scheme=\"light|dark\"]) &'\n    const selector = theme.getColorSchemeSelector(key).replace(/(\\[[^\\]]+\\])/, '*:where($1)');\n    return {\n      [selector]: styles\n    };\n  }\n  if (theme.palette.mode === key) {\n    return styles;\n  }\n  return {};\n}\n\n/***/ }),\n\n/***/ 1512:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ createBreakpoints; }\n/* harmony export */ });\n/* unused harmony export breakpointKeys */\n/* harmony import */ var _babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(3366);\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7462);\n\n\nconst _excluded = [\"values\", \"unit\", \"step\"];\n// Sorted ASC by size. That's important.\n// It can't be configured as it's used statically for propTypes.\nconst breakpointKeys = (/* unused pure expression or super */ null && (['xs', 'sm', 'md', 'lg', 'xl']));\nconst sortBreakpointsValues = values => {\n  const breakpointsAsArray = Object.keys(values).map(key => ({\n    key,\n    val: values[key]\n  })) || [];\n  // Sort in ascending order\n  breakpointsAsArray.sort((breakpoint1, breakpoint2) => breakpoint1.val - breakpoint2.val);\n  return breakpointsAsArray.reduce((acc, obj) => {\n    return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, acc, {\n      [obj.key]: obj.val\n    });\n  }, {});\n};\n\n// Keep in mind that @media is inclusive by the CSS specification.\nfunction createBreakpoints(breakpoints) {\n  const {\n      // The breakpoint **start** at this value.\n      // For instance with the first breakpoint xs: [xs, sm).\n      values = {\n        xs: 0,\n        // phone\n        sm: 600,\n        // tablet\n        md: 900,\n        // small laptop\n        lg: 1200,\n        // desktop\n        xl: 1536 // large screen\n      },\n      unit = 'px',\n      step = 5\n    } = breakpoints,\n    other = (0,_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__/* [\"default\"] */ .Z)(breakpoints, _excluded);\n  const sortedValues = sortBreakpointsValues(values);\n  const keys = Object.keys(sortedValues);\n  function up(key) {\n    const value = typeof values[key] === 'number' ? values[key] : key;\n    return `@media (min-width:${value}${unit})`;\n  }\n  function down(key) {\n    const value = typeof values[key] === 'number' ? values[key] : key;\n    return `@media (max-width:${value - step / 100}${unit})`;\n  }\n  function between(start, end) {\n    const endIndex = keys.indexOf(end);\n    return `@media (min-width:${typeof values[start] === 'number' ? values[start] : start}${unit}) and ` + `(max-width:${(endIndex !== -1 && typeof values[keys[endIndex]] === 'number' ? values[keys[endIndex]] : end) - step / 100}${unit})`;\n  }\n  function only(key) {\n    if (keys.indexOf(key) + 1 < keys.length) {\n      return between(key, keys[keys.indexOf(key) + 1]);\n    }\n    return up(key);\n  }\n  function not(key) {\n    // handle first and last key separately, for better readability\n    const keyIndex = keys.indexOf(key);\n    if (keyIndex === 0) {\n      return up(keys[1]);\n    }\n    if (keyIndex === keys.length - 1) {\n      return down(keys[keyIndex]);\n    }\n    return between(key, keys[keys.indexOf(key) + 1]).replace('@media', '@media not all and');\n  }\n  return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({\n    keys,\n    values: sortedValues,\n    up,\n    down,\n    between,\n    only,\n    not,\n    unit\n  }, other);\n}\n\n/***/ }),\n\n/***/ 7172:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ createTheme_createTheme; }\n});\n\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js\nvar objectWithoutPropertiesLoose = __webpack_require__(3366);\n// EXTERNAL MODULE: ./node_modules/@mui/utils/deepmerge/deepmerge.js\nvar deepmerge = __webpack_require__(8027);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/createTheme/createBreakpoints.js\nvar createBreakpoints = __webpack_require__(1512);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/createTheme/shape.js\nconst shape = {\n  borderRadius: 4\n};\n/* harmony default export */ var createTheme_shape = (shape);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/spacing.js + 1 modules\nvar esm_spacing = __webpack_require__(8700);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/createTheme/createSpacing.js\n\n\n// The different signatures imply different meaning for their arguments that can't be expressed structurally.\n// We express the difference with variable names.\n\nfunction createSpacing(spacingInput = 8) {\n  // Already transformed.\n  if (spacingInput.mui) {\n    return spacingInput;\n  }\n\n  // Material Design layouts are visually balanced. Most measurements align to an 8dp grid, which aligns both spacing and the overall layout.\n  // Smaller components, such as icons, can align to a 4dp grid.\n  // https://m2.material.io/design/layout/understanding-layout.html\n  const transform = (0,esm_spacing/* createUnarySpacing */.hB)({\n    spacing: spacingInput\n  });\n  const spacing = (...argsInput) => {\n    if (false) {}\n    const args = argsInput.length === 0 ? [1] : argsInput;\n    return args.map(argument => {\n      const output = transform(argument);\n      return typeof output === 'number' ? `${output}px` : output;\n    }).join(' ');\n  };\n  spacing.mui = true;\n  return spacing;\n}\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/styleFunctionSx/styleFunctionSx.js\nvar styleFunctionSx = __webpack_require__(6523);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/styleFunctionSx/defaultSxConfig.js + 5 modules\nvar defaultSxConfig = __webpack_require__(4920);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/createTheme/applyStyles.js\nvar applyStyles = __webpack_require__(7064);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/createTheme/createTheme.js\n\n\nconst _excluded = [\"breakpoints\", \"palette\", \"spacing\", \"shape\"];\n\n\n\n\n\n\n\nfunction createTheme(options = {}, ...args) {\n  const {\n      breakpoints: breakpointsInput = {},\n      palette: paletteInput = {},\n      spacing: spacingInput,\n      shape: shapeInput = {}\n    } = options,\n    other = (0,objectWithoutPropertiesLoose/* default */.Z)(options, _excluded);\n  const breakpoints = (0,createBreakpoints/* default */.Z)(breakpointsInput);\n  const spacing = createSpacing(spacingInput);\n  let muiTheme = (0,deepmerge/* default */.Z)({\n    breakpoints,\n    direction: 'ltr',\n    components: {},\n    // Inject component definitions.\n    palette: (0,esm_extends/* default */.Z)({\n      mode: 'light'\n    }, paletteInput),\n    spacing,\n    shape: (0,esm_extends/* default */.Z)({}, createTheme_shape, shapeInput)\n  }, other);\n  muiTheme.applyStyles = applyStyles/* default */.Z;\n  muiTheme = args.reduce((acc, argument) => (0,deepmerge/* default */.Z)(acc, argument), muiTheme);\n  muiTheme.unstable_sxConfig = (0,esm_extends/* default */.Z)({}, defaultSxConfig/* default */.Z, other == null ? void 0 : other.unstable_sxConfig);\n  muiTheme.unstable_sx = function sx(props) {\n    return (0,styleFunctionSx/* default */.Z)({\n      sx: props,\n      theme: this\n    });\n  };\n  return muiTheme;\n}\n/* harmony default export */ var createTheme_createTheme = (createTheme);\n\n/***/ }),\n\n/***/ 7730:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony import */ var _mui_utils_deepmerge__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8027);\n\nfunction merge(acc, item) {\n  if (!item) {\n    return acc;\n  }\n  return (0,_mui_utils_deepmerge__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(acc, item, {\n    clone: false // No need to clone deep, it's way faster.\n  });\n}\n/* harmony default export */ __webpack_exports__[\"Z\"] = (merge);\n\n/***/ }),\n\n/***/ 8700:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"hB\": function() { return /* binding */ createUnarySpacing; },\n  \"eI\": function() { return /* binding */ createUnaryUnit; },\n  \"NA\": function() { return /* binding */ getValue; },\n  \"e6\": function() { return /* binding */ margin; },\n  \"o3\": function() { return /* binding */ padding; }\n});\n\n// UNUSED EXPORTS: default, getStyleFromPropValue, marginKeys, paddingKeys\n\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/breakpoints.js\nvar breakpoints = __webpack_require__(5408);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/style.js\nvar style = __webpack_require__(4844);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/merge.js\nvar merge = __webpack_require__(7730);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/memoize.js\nfunction memoize(fn) {\n  const cache = {};\n  return arg => {\n    if (cache[arg] === undefined) {\n      cache[arg] = fn(arg);\n    }\n    return cache[arg];\n  };\n}\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/spacing.js\n\n\n\n\n\nconst properties = {\n  m: 'margin',\n  p: 'padding'\n};\nconst directions = {\n  t: 'Top',\n  r: 'Right',\n  b: 'Bottom',\n  l: 'Left',\n  x: ['Left', 'Right'],\n  y: ['Top', 'Bottom']\n};\nconst aliases = {\n  marginX: 'mx',\n  marginY: 'my',\n  paddingX: 'px',\n  paddingY: 'py'\n};\n\n// memoize() impact:\n// From 300,000 ops/sec\n// To 350,000 ops/sec\nconst getCssProperties = memoize(prop => {\n  // It's not a shorthand notation.\n  if (prop.length > 2) {\n    if (aliases[prop]) {\n      prop = aliases[prop];\n    } else {\n      return [prop];\n    }\n  }\n  const [a, b] = prop.split('');\n  const property = properties[a];\n  const direction = directions[b] || '';\n  return Array.isArray(direction) ? direction.map(dir => property + dir) : [property + direction];\n});\nconst marginKeys = ['m', 'mt', 'mr', 'mb', 'ml', 'mx', 'my', 'margin', 'marginTop', 'marginRight', 'marginBottom', 'marginLeft', 'marginX', 'marginY', 'marginInline', 'marginInlineStart', 'marginInlineEnd', 'marginBlock', 'marginBlockStart', 'marginBlockEnd'];\nconst paddingKeys = ['p', 'pt', 'pr', 'pb', 'pl', 'px', 'py', 'padding', 'paddingTop', 'paddingRight', 'paddingBottom', 'paddingLeft', 'paddingX', 'paddingY', 'paddingInline', 'paddingInlineStart', 'paddingInlineEnd', 'paddingBlock', 'paddingBlockStart', 'paddingBlockEnd'];\nconst spacingKeys = [...marginKeys, ...paddingKeys];\nfunction createUnaryUnit(theme, themeKey, defaultValue, propName) {\n  var _getPath;\n  const themeSpacing = (_getPath = (0,style/* getPath */.DW)(theme, themeKey, false)) != null ? _getPath : defaultValue;\n  if (typeof themeSpacing === 'number') {\n    return abs => {\n      if (typeof abs === 'string') {\n        return abs;\n      }\n      if (false) {}\n      return themeSpacing * abs;\n    };\n  }\n  if (Array.isArray(themeSpacing)) {\n    return abs => {\n      if (typeof abs === 'string') {\n        return abs;\n      }\n      if (false) {}\n      return themeSpacing[abs];\n    };\n  }\n  if (typeof themeSpacing === 'function') {\n    return themeSpacing;\n  }\n  if (false) {}\n  return () => undefined;\n}\nfunction createUnarySpacing(theme) {\n  return createUnaryUnit(theme, 'spacing', 8, 'spacing');\n}\nfunction getValue(transformer, propValue) {\n  if (typeof propValue === 'string' || propValue == null) {\n    return propValue;\n  }\n  const abs = Math.abs(propValue);\n  const transformed = transformer(abs);\n  if (propValue >= 0) {\n    return transformed;\n  }\n  if (typeof transformed === 'number') {\n    return -transformed;\n  }\n  return `-${transformed}`;\n}\nfunction getStyleFromPropValue(cssProperties, transformer) {\n  return propValue => cssProperties.reduce((acc, cssProperty) => {\n    acc[cssProperty] = getValue(transformer, propValue);\n    return acc;\n  }, {});\n}\nfunction resolveCssProperty(props, keys, prop, transformer) {\n  // Using a hash computation over an array iteration could be faster, but with only 28 items,\n  // it's doesn't worth the bundle size.\n  if (keys.indexOf(prop) === -1) {\n    return null;\n  }\n  const cssProperties = getCssProperties(prop);\n  const styleFromPropValue = getStyleFromPropValue(cssProperties, transformer);\n  const propValue = props[prop];\n  return (0,breakpoints/* handleBreakpoints */.k9)(props, propValue, styleFromPropValue);\n}\nfunction spacing_style(props, keys) {\n  const transformer = createUnarySpacing(props.theme);\n  return Object.keys(props).map(prop => resolveCssProperty(props, keys, prop, transformer)).reduce(merge/* default */.Z, {});\n}\nfunction margin(props) {\n  return spacing_style(props, marginKeys);\n}\nmargin.propTypes =  false ? 0 : {};\nmargin.filterProps = marginKeys;\nfunction padding(props) {\n  return spacing_style(props, paddingKeys);\n}\npadding.propTypes =  false ? 0 : {};\npadding.filterProps = paddingKeys;\nfunction spacing(props) {\n  return spacing_style(props, spacingKeys);\n}\nspacing.propTypes =  false ? 0 : {};\nspacing.filterProps = spacingKeys;\n/* harmony default export */ var esm_spacing = ((/* unused pure expression or super */ null && (spacing)));\n\n/***/ }),\n\n/***/ 4844:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"DW\": function() { return /* binding */ getPath; },\n/* harmony export */   \"Jq\": function() { return /* binding */ getStyleValue; }\n/* harmony export */ });\n/* harmony import */ var _mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(2908);\n/* harmony import */ var _breakpoints__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(5408);\n\n\n\nfunction getPath(obj, path, checkVars = true) {\n  if (!path || typeof path !== 'string') {\n    return null;\n  }\n\n  // Check if CSS variables are used\n  if (obj && obj.vars && checkVars) {\n    const val = `vars.${path}`.split('.').reduce((acc, item) => acc && acc[item] ? acc[item] : null, obj);\n    if (val != null) {\n      return val;\n    }\n  }\n  return path.split('.').reduce((acc, item) => {\n    if (acc && acc[item] != null) {\n      return acc[item];\n    }\n    return null;\n  }, obj);\n}\nfunction getStyleValue(themeMapping, transform, propValueFinal, userValue = propValueFinal) {\n  let value;\n  if (typeof themeMapping === 'function') {\n    value = themeMapping(propValueFinal);\n  } else if (Array.isArray(themeMapping)) {\n    value = themeMapping[propValueFinal] || userValue;\n  } else {\n    value = getPath(themeMapping, propValueFinal) || userValue;\n  }\n  if (transform) {\n    value = transform(value, userValue, themeMapping);\n  }\n  return value;\n}\nfunction style(options) {\n  const {\n    prop,\n    cssProperty = options.prop,\n    themeKey,\n    transform\n  } = options;\n\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const fn = props => {\n    if (props[prop] == null) {\n      return null;\n    }\n    const propValue = props[prop];\n    const theme = props.theme;\n    const themeMapping = getPath(theme, themeKey) || {};\n    const styleFromPropValue = propValueFinal => {\n      let value = getStyleValue(themeMapping, transform, propValueFinal);\n      if (propValueFinal === value && typeof propValueFinal === 'string') {\n        // Haven't found value\n        value = getStyleValue(themeMapping, transform, `${prop}${propValueFinal === 'default' ? '' : (0,_mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(propValueFinal)}`, propValueFinal);\n      }\n      if (cssProperty === false) {\n        return value;\n      }\n      return {\n        [cssProperty]: value\n      };\n    };\n    return (0,_breakpoints__WEBPACK_IMPORTED_MODULE_1__/* .handleBreakpoints */ .k9)(props, propValue, styleFromPropValue);\n  };\n  fn.propTypes =  false ? 0 : {};\n  fn.filterProps = [prop];\n  return fn;\n}\n/* harmony default export */ __webpack_exports__[\"ZP\"] = (style);\n\n/***/ }),\n\n/***/ 4920:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ styleFunctionSx_defaultSxConfig; }\n});\n\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/spacing.js + 1 modules\nvar spacing = __webpack_require__(8700);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/style.js\nvar style = __webpack_require__(4844);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/merge.js\nvar merge = __webpack_require__(7730);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/compose.js\n\nfunction compose(...styles) {\n  const handlers = styles.reduce((acc, style) => {\n    style.filterProps.forEach(prop => {\n      acc[prop] = style;\n    });\n    return acc;\n  }, {});\n\n  // false positive\n  // eslint-disable-next-line react/function-component-definition\n  const fn = props => {\n    return Object.keys(props).reduce((acc, prop) => {\n      if (handlers[prop]) {\n        return (0,merge/* default */.Z)(acc, handlers[prop](props));\n      }\n      return acc;\n    }, {});\n  };\n  fn.propTypes =  false ? 0 : {};\n  fn.filterProps = styles.reduce((acc, style) => acc.concat(style.filterProps), []);\n  return fn;\n}\n/* harmony default export */ var esm_compose = (compose);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/breakpoints.js\nvar breakpoints = __webpack_require__(5408);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/borders.js\n\n\n\n\n\nfunction borderTransform(value) {\n  if (typeof value !== 'number') {\n    return value;\n  }\n  return `${value}px solid`;\n}\nfunction createBorderStyle(prop, transform) {\n  return (0,style/* default */.ZP)({\n    prop,\n    themeKey: 'borders',\n    transform\n  });\n}\nconst border = createBorderStyle('border', borderTransform);\nconst borderTop = createBorderStyle('borderTop', borderTransform);\nconst borderRight = createBorderStyle('borderRight', borderTransform);\nconst borderBottom = createBorderStyle('borderBottom', borderTransform);\nconst borderLeft = createBorderStyle('borderLeft', borderTransform);\nconst borderColor = createBorderStyle('borderColor');\nconst borderTopColor = createBorderStyle('borderTopColor');\nconst borderRightColor = createBorderStyle('borderRightColor');\nconst borderBottomColor = createBorderStyle('borderBottomColor');\nconst borderLeftColor = createBorderStyle('borderLeftColor');\nconst outline = createBorderStyle('outline', borderTransform);\nconst outlineColor = createBorderStyle('outlineColor');\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nconst borderRadius = props => {\n  if (props.borderRadius !== undefined && props.borderRadius !== null) {\n    const transformer = (0,spacing/* createUnaryUnit */.eI)(props.theme, 'shape.borderRadius', 4, 'borderRadius');\n    const styleFromPropValue = propValue => ({\n      borderRadius: (0,spacing/* getValue */.NA)(transformer, propValue)\n    });\n    return (0,breakpoints/* handleBreakpoints */.k9)(props, props.borderRadius, styleFromPropValue);\n  }\n  return null;\n};\nborderRadius.propTypes =  false ? 0 : {};\nborderRadius.filterProps = ['borderRadius'];\nconst borders = esm_compose(border, borderTop, borderRight, borderBottom, borderLeft, borderColor, borderTopColor, borderRightColor, borderBottomColor, borderLeftColor, borderRadius, outline, outlineColor);\n/* harmony default export */ var esm_borders = ((/* unused pure expression or super */ null && (borders)));\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/cssGrid.js\n\n\n\n\n\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nconst gap = props => {\n  if (props.gap !== undefined && props.gap !== null) {\n    const transformer = (0,spacing/* createUnaryUnit */.eI)(props.theme, 'spacing', 8, 'gap');\n    const styleFromPropValue = propValue => ({\n      gap: (0,spacing/* getValue */.NA)(transformer, propValue)\n    });\n    return (0,breakpoints/* handleBreakpoints */.k9)(props, props.gap, styleFromPropValue);\n  }\n  return null;\n};\ngap.propTypes =  false ? 0 : {};\ngap.filterProps = ['gap'];\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nconst columnGap = props => {\n  if (props.columnGap !== undefined && props.columnGap !== null) {\n    const transformer = (0,spacing/* createUnaryUnit */.eI)(props.theme, 'spacing', 8, 'columnGap');\n    const styleFromPropValue = propValue => ({\n      columnGap: (0,spacing/* getValue */.NA)(transformer, propValue)\n    });\n    return (0,breakpoints/* handleBreakpoints */.k9)(props, props.columnGap, styleFromPropValue);\n  }\n  return null;\n};\ncolumnGap.propTypes =  false ? 0 : {};\ncolumnGap.filterProps = ['columnGap'];\n\n// false positive\n// eslint-disable-next-line react/function-component-definition\nconst rowGap = props => {\n  if (props.rowGap !== undefined && props.rowGap !== null) {\n    const transformer = (0,spacing/* createUnaryUnit */.eI)(props.theme, 'spacing', 8, 'rowGap');\n    const styleFromPropValue = propValue => ({\n      rowGap: (0,spacing/* getValue */.NA)(transformer, propValue)\n    });\n    return (0,breakpoints/* handleBreakpoints */.k9)(props, props.rowGap, styleFromPropValue);\n  }\n  return null;\n};\nrowGap.propTypes =  false ? 0 : {};\nrowGap.filterProps = ['rowGap'];\nconst gridColumn = (0,style/* default */.ZP)({\n  prop: 'gridColumn'\n});\nconst gridRow = (0,style/* default */.ZP)({\n  prop: 'gridRow'\n});\nconst gridAutoFlow = (0,style/* default */.ZP)({\n  prop: 'gridAutoFlow'\n});\nconst gridAutoColumns = (0,style/* default */.ZP)({\n  prop: 'gridAutoColumns'\n});\nconst gridAutoRows = (0,style/* default */.ZP)({\n  prop: 'gridAutoRows'\n});\nconst gridTemplateColumns = (0,style/* default */.ZP)({\n  prop: 'gridTemplateColumns'\n});\nconst gridTemplateRows = (0,style/* default */.ZP)({\n  prop: 'gridTemplateRows'\n});\nconst gridTemplateAreas = (0,style/* default */.ZP)({\n  prop: 'gridTemplateAreas'\n});\nconst gridArea = (0,style/* default */.ZP)({\n  prop: 'gridArea'\n});\nconst grid = esm_compose(gap, columnGap, rowGap, gridColumn, gridRow, gridAutoFlow, gridAutoColumns, gridAutoRows, gridTemplateColumns, gridTemplateRows, gridTemplateAreas, gridArea);\n/* harmony default export */ var cssGrid = ((/* unused pure expression or super */ null && (grid)));\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/palette.js\n\n\nfunction paletteTransform(value, userValue) {\n  if (userValue === 'grey') {\n    return userValue;\n  }\n  return value;\n}\nconst color = (0,style/* default */.ZP)({\n  prop: 'color',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nconst bgcolor = (0,style/* default */.ZP)({\n  prop: 'bgcolor',\n  cssProperty: 'backgroundColor',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nconst backgroundColor = (0,style/* default */.ZP)({\n  prop: 'backgroundColor',\n  themeKey: 'palette',\n  transform: paletteTransform\n});\nconst palette = esm_compose(color, bgcolor, backgroundColor);\n/* harmony default export */ var esm_palette = ((/* unused pure expression or super */ null && (palette)));\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/sizing.js\n\n\n\nfunction sizingTransform(value) {\n  return value <= 1 && value !== 0 ? `${value * 100}%` : value;\n}\nconst width = (0,style/* default */.ZP)({\n  prop: 'width',\n  transform: sizingTransform\n});\nconst maxWidth = props => {\n  if (props.maxWidth !== undefined && props.maxWidth !== null) {\n    const styleFromPropValue = propValue => {\n      var _props$theme, _props$theme2;\n      const breakpoint = ((_props$theme = props.theme) == null || (_props$theme = _props$theme.breakpoints) == null || (_props$theme = _props$theme.values) == null ? void 0 : _props$theme[propValue]) || breakpoints/* values */.VO[propValue];\n      if (!breakpoint) {\n        return {\n          maxWidth: sizingTransform(propValue)\n        };\n      }\n      if (((_props$theme2 = props.theme) == null || (_props$theme2 = _props$theme2.breakpoints) == null ? void 0 : _props$theme2.unit) !== 'px') {\n        return {\n          maxWidth: `${breakpoint}${props.theme.breakpoints.unit}`\n        };\n      }\n      return {\n        maxWidth: breakpoint\n      };\n    };\n    return (0,breakpoints/* handleBreakpoints */.k9)(props, props.maxWidth, styleFromPropValue);\n  }\n  return null;\n};\nmaxWidth.filterProps = ['maxWidth'];\nconst minWidth = (0,style/* default */.ZP)({\n  prop: 'minWidth',\n  transform: sizingTransform\n});\nconst height = (0,style/* default */.ZP)({\n  prop: 'height',\n  transform: sizingTransform\n});\nconst maxHeight = (0,style/* default */.ZP)({\n  prop: 'maxHeight',\n  transform: sizingTransform\n});\nconst minHeight = (0,style/* default */.ZP)({\n  prop: 'minHeight',\n  transform: sizingTransform\n});\nconst sizeWidth = (0,style/* default */.ZP)({\n  prop: 'size',\n  cssProperty: 'width',\n  transform: sizingTransform\n});\nconst sizeHeight = (0,style/* default */.ZP)({\n  prop: 'size',\n  cssProperty: 'height',\n  transform: sizingTransform\n});\nconst boxSizing = (0,style/* default */.ZP)({\n  prop: 'boxSizing'\n});\nconst sizing = esm_compose(width, maxWidth, minWidth, height, maxHeight, minHeight, boxSizing);\n/* harmony default export */ var esm_sizing = ((/* unused pure expression or super */ null && (sizing)));\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/styleFunctionSx/defaultSxConfig.js\n\n\n\n\n\nconst defaultSxConfig = {\n  // borders\n  border: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderTop: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderRight: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderBottom: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderLeft: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  borderColor: {\n    themeKey: 'palette'\n  },\n  borderTopColor: {\n    themeKey: 'palette'\n  },\n  borderRightColor: {\n    themeKey: 'palette'\n  },\n  borderBottomColor: {\n    themeKey: 'palette'\n  },\n  borderLeftColor: {\n    themeKey: 'palette'\n  },\n  outline: {\n    themeKey: 'borders',\n    transform: borderTransform\n  },\n  outlineColor: {\n    themeKey: 'palette'\n  },\n  borderRadius: {\n    themeKey: 'shape.borderRadius',\n    style: borderRadius\n  },\n  // palette\n  color: {\n    themeKey: 'palette',\n    transform: paletteTransform\n  },\n  bgcolor: {\n    themeKey: 'palette',\n    cssProperty: 'backgroundColor',\n    transform: paletteTransform\n  },\n  backgroundColor: {\n    themeKey: 'palette',\n    transform: paletteTransform\n  },\n  // spacing\n  p: {\n    style: spacing/* padding */.o3\n  },\n  pt: {\n    style: spacing/* padding */.o3\n  },\n  pr: {\n    style: spacing/* padding */.o3\n  },\n  pb: {\n    style: spacing/* padding */.o3\n  },\n  pl: {\n    style: spacing/* padding */.o3\n  },\n  px: {\n    style: spacing/* padding */.o3\n  },\n  py: {\n    style: spacing/* padding */.o3\n  },\n  padding: {\n    style: spacing/* padding */.o3\n  },\n  paddingTop: {\n    style: spacing/* padding */.o3\n  },\n  paddingRight: {\n    style: spacing/* padding */.o3\n  },\n  paddingBottom: {\n    style: spacing/* padding */.o3\n  },\n  paddingLeft: {\n    style: spacing/* padding */.o3\n  },\n  paddingX: {\n    style: spacing/* padding */.o3\n  },\n  paddingY: {\n    style: spacing/* padding */.o3\n  },\n  paddingInline: {\n    style: spacing/* padding */.o3\n  },\n  paddingInlineStart: {\n    style: spacing/* padding */.o3\n  },\n  paddingInlineEnd: {\n    style: spacing/* padding */.o3\n  },\n  paddingBlock: {\n    style: spacing/* padding */.o3\n  },\n  paddingBlockStart: {\n    style: spacing/* padding */.o3\n  },\n  paddingBlockEnd: {\n    style: spacing/* padding */.o3\n  },\n  m: {\n    style: spacing/* margin */.e6\n  },\n  mt: {\n    style: spacing/* margin */.e6\n  },\n  mr: {\n    style: spacing/* margin */.e6\n  },\n  mb: {\n    style: spacing/* margin */.e6\n  },\n  ml: {\n    style: spacing/* margin */.e6\n  },\n  mx: {\n    style: spacing/* margin */.e6\n  },\n  my: {\n    style: spacing/* margin */.e6\n  },\n  margin: {\n    style: spacing/* margin */.e6\n  },\n  marginTop: {\n    style: spacing/* margin */.e6\n  },\n  marginRight: {\n    style: spacing/* margin */.e6\n  },\n  marginBottom: {\n    style: spacing/* margin */.e6\n  },\n  marginLeft: {\n    style: spacing/* margin */.e6\n  },\n  marginX: {\n    style: spacing/* margin */.e6\n  },\n  marginY: {\n    style: spacing/* margin */.e6\n  },\n  marginInline: {\n    style: spacing/* margin */.e6\n  },\n  marginInlineStart: {\n    style: spacing/* margin */.e6\n  },\n  marginInlineEnd: {\n    style: spacing/* margin */.e6\n  },\n  marginBlock: {\n    style: spacing/* margin */.e6\n  },\n  marginBlockStart: {\n    style: spacing/* margin */.e6\n  },\n  marginBlockEnd: {\n    style: spacing/* margin */.e6\n  },\n  // display\n  displayPrint: {\n    cssProperty: false,\n    transform: value => ({\n      '@media print': {\n        display: value\n      }\n    })\n  },\n  display: {},\n  overflow: {},\n  textOverflow: {},\n  visibility: {},\n  whiteSpace: {},\n  // flexbox\n  flexBasis: {},\n  flexDirection: {},\n  flexWrap: {},\n  justifyContent: {},\n  alignItems: {},\n  alignContent: {},\n  order: {},\n  flex: {},\n  flexGrow: {},\n  flexShrink: {},\n  alignSelf: {},\n  justifyItems: {},\n  justifySelf: {},\n  // grid\n  gap: {\n    style: gap\n  },\n  rowGap: {\n    style: rowGap\n  },\n  columnGap: {\n    style: columnGap\n  },\n  gridColumn: {},\n  gridRow: {},\n  gridAutoFlow: {},\n  gridAutoColumns: {},\n  gridAutoRows: {},\n  gridTemplateColumns: {},\n  gridTemplateRows: {},\n  gridTemplateAreas: {},\n  gridArea: {},\n  // positions\n  position: {},\n  zIndex: {\n    themeKey: 'zIndex'\n  },\n  top: {},\n  right: {},\n  bottom: {},\n  left: {},\n  // shadows\n  boxShadow: {\n    themeKey: 'shadows'\n  },\n  // sizing\n  width: {\n    transform: sizingTransform\n  },\n  maxWidth: {\n    style: maxWidth\n  },\n  minWidth: {\n    transform: sizingTransform\n  },\n  height: {\n    transform: sizingTransform\n  },\n  maxHeight: {\n    transform: sizingTransform\n  },\n  minHeight: {\n    transform: sizingTransform\n  },\n  boxSizing: {},\n  // typography\n  fontFamily: {\n    themeKey: 'typography'\n  },\n  fontSize: {\n    themeKey: 'typography'\n  },\n  fontStyle: {\n    themeKey: 'typography'\n  },\n  fontWeight: {\n    themeKey: 'typography'\n  },\n  letterSpacing: {},\n  textTransform: {},\n  lineHeight: {},\n  textAlign: {},\n  typography: {\n    cssProperty: false,\n    themeKey: 'typography'\n  }\n};\n/* harmony default export */ var styleFunctionSx_defaultSxConfig = (defaultSxConfig);\n\n/***/ }),\n\n/***/ 6523:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"n\": function() { return /* binding */ unstable_createStyleFunctionSx; }\n/* harmony export */ });\n/* harmony import */ var _mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(2908);\n/* harmony import */ var _merge__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(7730);\n/* harmony import */ var _style__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(4844);\n/* harmony import */ var _breakpoints__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(5408);\n/* harmony import */ var _defaultSxConfig__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(4920);\n\n\n\n\n\nfunction objectsHaveSameKeys(...objects) {\n  const allKeys = objects.reduce((keys, object) => keys.concat(Object.keys(object)), []);\n  const union = new Set(allKeys);\n  return objects.every(object => union.size === Object.keys(object).length);\n}\nfunction callIfFn(maybeFn, arg) {\n  return typeof maybeFn === 'function' ? maybeFn(arg) : maybeFn;\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction unstable_createStyleFunctionSx() {\n  function getThemeValue(prop, val, theme, config) {\n    const props = {\n      [prop]: val,\n      theme\n    };\n    const options = config[prop];\n    if (!options) {\n      return {\n        [prop]: val\n      };\n    }\n    const {\n      cssProperty = prop,\n      themeKey,\n      transform,\n      style\n    } = options;\n    if (val == null) {\n      return null;\n    }\n\n    // TODO v6: remove, see https://github.com/mui/material-ui/pull/38123\n    if (themeKey === 'typography' && val === 'inherit') {\n      return {\n        [prop]: val\n      };\n    }\n    const themeMapping = (0,_style__WEBPACK_IMPORTED_MODULE_0__/* .getPath */ .DW)(theme, themeKey) || {};\n    if (style) {\n      return style(props);\n    }\n    const styleFromPropValue = propValueFinal => {\n      let value = (0,_style__WEBPACK_IMPORTED_MODULE_0__/* .getStyleValue */ .Jq)(themeMapping, transform, propValueFinal);\n      if (propValueFinal === value && typeof propValueFinal === 'string') {\n        // Haven't found value\n        value = (0,_style__WEBPACK_IMPORTED_MODULE_0__/* .getStyleValue */ .Jq)(themeMapping, transform, `${prop}${propValueFinal === 'default' ? '' : (0,_mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_1__/* [\"default\"] */ .Z)(propValueFinal)}`, propValueFinal);\n      }\n      if (cssProperty === false) {\n        return value;\n      }\n      return {\n        [cssProperty]: value\n      };\n    };\n    return (0,_breakpoints__WEBPACK_IMPORTED_MODULE_2__/* .handleBreakpoints */ .k9)(props, val, styleFromPropValue);\n  }\n  function styleFunctionSx(props) {\n    var _theme$unstable_sxCon;\n    const {\n      sx,\n      theme = {}\n    } = props || {};\n    if (!sx) {\n      return null; // Emotion & styled-components will neglect null\n    }\n    const config = (_theme$unstable_sxCon = theme.unstable_sxConfig) != null ? _theme$unstable_sxCon : _defaultSxConfig__WEBPACK_IMPORTED_MODULE_3__/* [\"default\"] */ .Z;\n\n    /*\n     * Receive `sxInput` as object or callback\n     * and then recursively check keys & values to create media query object styles.\n     * (the result will be used in `styled`)\n     */\n    function traverse(sxInput) {\n      let sxObject = sxInput;\n      if (typeof sxInput === 'function') {\n        sxObject = sxInput(theme);\n      } else if (typeof sxInput !== 'object') {\n        // value\n        return sxInput;\n      }\n      if (!sxObject) {\n        return null;\n      }\n      const emptyBreakpoints = (0,_breakpoints__WEBPACK_IMPORTED_MODULE_2__/* .createEmptyBreakpointObject */ .W8)(theme.breakpoints);\n      const breakpointsKeys = Object.keys(emptyBreakpoints);\n      let css = emptyBreakpoints;\n      Object.keys(sxObject).forEach(styleKey => {\n        const value = callIfFn(sxObject[styleKey], theme);\n        if (value !== null && value !== undefined) {\n          if (typeof value === 'object') {\n            if (config[styleKey]) {\n              css = (0,_merge__WEBPACK_IMPORTED_MODULE_4__/* [\"default\"] */ .Z)(css, getThemeValue(styleKey, value, theme, config));\n            } else {\n              const breakpointsValues = (0,_breakpoints__WEBPACK_IMPORTED_MODULE_2__/* .handleBreakpoints */ .k9)({\n                theme\n              }, value, x => ({\n                [styleKey]: x\n              }));\n              if (objectsHaveSameKeys(breakpointsValues, value)) {\n                css[styleKey] = styleFunctionSx({\n                  sx: value,\n                  theme\n                });\n              } else {\n                css = (0,_merge__WEBPACK_IMPORTED_MODULE_4__/* [\"default\"] */ .Z)(css, breakpointsValues);\n              }\n            }\n          } else {\n            css = (0,_merge__WEBPACK_IMPORTED_MODULE_4__/* [\"default\"] */ .Z)(css, getThemeValue(styleKey, value, theme, config));\n          }\n        }\n      });\n      return (0,_breakpoints__WEBPACK_IMPORTED_MODULE_2__/* .removeUnusedBreakpoints */ .L7)(breakpointsKeys, css);\n    }\n    return Array.isArray(sx) ? sx.map(traverse) : traverse(sx);\n  }\n  return styleFunctionSx;\n}\nconst styleFunctionSx = unstable_createStyleFunctionSx();\nstyleFunctionSx.filterProps = ['sx'];\n/* harmony default export */ __webpack_exports__[\"Z\"] = (styleFunctionSx);\n\n/***/ }),\n\n/***/ 6682:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* unused harmony export systemDefaultTheme */\n/* harmony import */ var _createTheme__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7172);\n/* harmony import */ var _useThemeWithoutDefault__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(4168);\n'use client';\n\n\n\nconst systemDefaultTheme = (0,_createTheme__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)();\nfunction useTheme(defaultTheme = systemDefaultTheme) {\n  return (0,_useThemeWithoutDefault__WEBPACK_IMPORTED_MODULE_1__/* [\"default\"] */ .Z)(defaultTheme);\n}\n/* harmony default export */ __webpack_exports__[\"Z\"] = (useTheme);\n\n/***/ }),\n\n/***/ 4168:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n/* harmony import */ var _mui_styled_engine__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6498);\n'use client';\n\n\n\nfunction isObjectEmpty(obj) {\n  return Object.keys(obj).length === 0;\n}\nfunction useTheme(defaultTheme = null) {\n  const contextTheme = react__WEBPACK_IMPORTED_MODULE_0__.useContext(_mui_styled_engine__WEBPACK_IMPORTED_MODULE_1__.T);\n  return !contextTheme || isObjectEmpty(contextTheme) ? defaultTheme : contextTheme;\n}\n/* harmony default export */ __webpack_exports__[\"Z\"] = (useTheme);\n\n/***/ }),\n\n/***/ 2908:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ capitalize; }\n/* harmony export */ });\n/* harmony import */ var _mui_utils_formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8758);\n\n// It should to be noted that this function isn't equivalent to `text-transform: capitalize`.\n//\n// A strict capitalization should uppercase the first letter of each word in the sentence.\n// We only handle the first word.\nfunction capitalize(string) {\n  if (typeof string !== 'string') {\n    throw new Error( false ? 0 : (0,_mui_utils_formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(7));\n  }\n  return string.charAt(0).toUpperCase() + string.slice(1);\n}\n\n/***/ }),\n\n/***/ 9425:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"default\": function() { return /* reexport */ clamp_clamp; }\n});\n\n;// CONCATENATED MODULE: ./node_modules/@mui/utils/clamp/clamp.js\nfunction clamp(val, min = Number.MIN_SAFE_INTEGER, max = Number.MAX_SAFE_INTEGER) {\n  return Math.max(min, Math.min(val, max));\n}\n/* harmony default export */ var clamp_clamp = (clamp);\n;// CONCATENATED MODULE: ./node_modules/@mui/utils/clamp/index.js\n\n\n/***/ }),\n\n/***/ 8027:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"P\": function() { return /* binding */ isPlainObject; },\n/* harmony export */   \"Z\": function() { return /* binding */ deepmerge; }\n/* harmony export */ });\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7462);\n\n// https://github.com/sindresorhus/is-plain-obj/blob/main/index.js\nfunction isPlainObject(item) {\n  if (typeof item !== 'object' || item === null) {\n    return false;\n  }\n  const prototype = Object.getPrototypeOf(item);\n  return (prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null) && !(Symbol.toStringTag in item) && !(Symbol.iterator in item);\n}\nfunction deepClone(source) {\n  if (!isPlainObject(source)) {\n    return source;\n  }\n  const output = {};\n  Object.keys(source).forEach(key => {\n    output[key] = deepClone(source[key]);\n  });\n  return output;\n}\nfunction deepmerge(target, source, options = {\n  clone: true\n}) {\n  const output = options.clone ? (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, target) : target;\n  if (isPlainObject(target) && isPlainObject(source)) {\n    Object.keys(source).forEach(key => {\n      if (isPlainObject(source[key]) &&\n      // Avoid prototype pollution\n      Object.prototype.hasOwnProperty.call(target, key) && isPlainObject(target[key])) {\n        // Since `output` is a clone of `target` and we have narrowed `target` in this block we can cast to the same type.\n        output[key] = deepmerge(target[key], source[key], options);\n      } else if (options.clone) {\n        output[key] = isPlainObject(source[key]) ? deepClone(source[key]) : source[key];\n      } else {\n        output[key] = source[key];\n      }\n    });\n  }\n  return output;\n}\n\n/***/ }),\n\n/***/ 8758:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ formatMuiErrorMessage; }\n/* harmony export */ });\n/**\n * WARNING: Don't import this directly.\n * Use `MuiError` from `@mui/internal-babel-macros/MuiError.macro` instead.\n * @param {number} code\n */\nfunction formatMuiErrorMessage(code) {\n  // Apply babel-plugin-transform-template-literals in loose mode\n  // loose mode is safe if we're concatenating primitives\n  // see https://babeljs.io/docs/en/babel-plugin-transform-template-literals#loose\n  /* eslint-disable prefer-template */\n  let url = 'https://mui.com/production-error/?code=' + code;\n  for (let i = 1; i < arguments.length; i += 1) {\n    // rest params over-transpile for this case\n    // eslint-disable-next-line prefer-rest-params\n    url += '&args[]=' + encodeURIComponent(arguments[i]);\n  }\n  return 'Minified MUI error #' + code + '; visit ' + url + ' for the full message.';\n  /* eslint-enable prefer-template */\n}\n\n/***/ }),\n\n/***/ 743:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": function() { return /* reexport safe */ _formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__.Z; }\n/* harmony export */ });\n/* harmony import */ var _formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8758);\n\n\n/***/ }),\n\n/***/ 2236:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ resolveProps; }\n/* harmony export */ });\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7462);\n\n/**\n * Add keys, values of `defaultProps` that does not exist in `props`\n * @param {object} defaultProps\n * @param {object} props\n * @returns {object} resolved props\n */\nfunction resolveProps(defaultProps, props) {\n  const output = (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, props);\n  Object.keys(defaultProps).forEach(propName => {\n    if (propName.toString().match(/^(components|slots)$/)) {\n      output[propName] = (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, defaultProps[propName], output[propName]);\n    } else if (propName.toString().match(/^(componentsProps|slotProps)$/)) {\n      const defaultSlotProps = defaultProps[propName] || {};\n      const slotProps = props[propName];\n      output[propName] = {};\n      if (!slotProps || !Object.keys(slotProps)) {\n        // Reduce the iteration if the slot props is empty\n        output[propName] = defaultSlotProps;\n      } else if (!defaultSlotProps || !Object.keys(defaultSlotProps)) {\n        // Reduce the iteration if the default slot props is empty\n        output[propName] = slotProps;\n      } else {\n        output[propName] = (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, slotProps);\n        Object.keys(defaultSlotProps).forEach(slotPropName => {\n          output[propName][slotPropName] = resolveProps(defaultSlotProps[slotPropName], slotProps[slotPropName]);\n        });\n      }\n    } else if (output[propName] === undefined) {\n      output[propName] = defaultProps[propName];\n    }\n  });\n  return output;\n}\n\n/***/ }),\n\n/***/ 6212:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.createWSOLAccountInstructions = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\n// TODO use native-mint instead\nfunction createWSOLAccountInstructions(walletAddress, amountIn, rentExemptLamports) {\n    const tempAccount = new web3_js_1.Keypair();\n    const createAccountInstruction = web3_js_1.SystemProgram.createAccount({\n        fromPubkey: walletAddress,\n        newAccountPubkey: tempAccount.publicKey,\n        lamports: amountIn.toNumber() + rentExemptLamports,\n        space: spl_token_1.AccountLayout.span,\n        programId: spl_token_1.TOKEN_PROGRAM_ID,\n    });\n    const initAccountInstruction = spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, spl_token_1.NATIVE_MINT, tempAccount.publicKey, walletAddress);\n    const closeWSOLAccountInstruction = spl_token_1.Token.createCloseAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, tempAccount.publicKey, walletAddress, walletAddress, []);\n    return {\n        address: tempAccount.publicKey,\n        instructions: [createAccountInstruction, initAccountInstruction],\n        cleanupInstructions: [closeWSOLAccountInstruction],\n        signers: [tempAccount],\n    };\n}\nexports.createWSOLAccountInstructions = createWSOLAccountInstructions;\n\n\n/***/ }),\n\n/***/ 6259:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(4319), exports);\n__exportStar(__webpack_require__(1084), exports);\n\n\n/***/ }),\n\n/***/ 7855:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.DecimalUtil = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst decimal_js_1 = __importDefault(__webpack_require__(3776));\nclass DecimalUtil {\n    static adjustDecimals(input, shift = 0) {\n        return input.div(decimal_js_1.default.pow(10, shift));\n    }\n    static fromU64(input, shift = 0) {\n        return new decimal_js_1.default(input.toString()).div(new decimal_js_1.default(10).pow(shift));\n    }\n    static fromNumber(input, shift = 0) {\n        return new decimal_js_1.default(input).div(new decimal_js_1.default(10).pow(shift));\n    }\n    static toU64(input, shift = 0) {\n        if (input.isNeg()) {\n            throw new Error(\"Negative decimal value ${input} cannot be converted to u64.\");\n        }\n        const shiftedValue = input.mul(new decimal_js_1.default(10).pow(shift));\n        const zeroDecimalValue = shiftedValue.trunc();\n        return new spl_token_1.u64(zeroDecimalValue.toString());\n    }\n}\nexports.DecimalUtil = DecimalUtil;\n\n\n/***/ }),\n\n/***/ 4319:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(7855), exports);\n__exportStar(__webpack_require__(4667), exports);\n__exportStar(__webpack_require__(7399), exports);\n\n\n/***/ }),\n\n/***/ 4667:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.MathUtil = exports.U64_MAX = exports.U128 = exports.TWO = exports.ONE = exports.ZERO = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst decimal_js_1 = __importDefault(__webpack_require__(3776));\n/**\n * @category Math\n */\nexports.ZERO = new anchor_1.BN(0);\n/**\n * @category Math\n */\nexports.ONE = new anchor_1.BN(1);\n/**\n * @category Math\n */\nexports.TWO = new anchor_1.BN(2);\n/**\n * @category Math\n */\nexports.U128 = exports.TWO.pow(new anchor_1.BN(128));\n/**\n * @category Math\n */\nexports.U64_MAX = exports.TWO.pow(new anchor_1.BN(64)).sub(exports.ONE);\n/**\n * @category Math\n */\nclass MathUtil {\n    static toX64_BN(num) {\n        return num.mul(new anchor_1.BN(2).pow(new anchor_1.BN(64)));\n    }\n    static toX64_Decimal(num) {\n        return num.mul(decimal_js_1.default.pow(2, 64));\n    }\n    static toX64(num) {\n        return new anchor_1.BN(num.mul(decimal_js_1.default.pow(2, 64)).floor().toFixed());\n    }\n    static fromX64(num) {\n        return new decimal_js_1.default(num.toString()).mul(decimal_js_1.default.pow(2, -64));\n    }\n    static fromX64_Decimal(num) {\n        return num.mul(decimal_js_1.default.pow(2, -64));\n    }\n    static fromX64_BN(num) {\n        return num.div(new anchor_1.BN(2).pow(new anchor_1.BN(64)));\n    }\n    static shiftRightRoundUp(n) {\n        let result = n.shrn(64);\n        if (n.mod(exports.U64_MAX).gt(exports.ZERO)) {\n            result = result.add(exports.ONE);\n        }\n        return result;\n    }\n    static divRoundUp(n0, n1) {\n        const hasRemainder = !n0.mod(n1).eq(exports.ZERO);\n        if (hasRemainder) {\n            return n0.div(n1).add(new anchor_1.BN(1));\n        }\n        else {\n            return n0.div(n1);\n        }\n    }\n    static subUnderflowU128(n0, n1) {\n        return n0.add(exports.U128).sub(n1).mod(exports.U128);\n    }\n}\nexports.MathUtil = MathUtil;\n\n\n/***/ }),\n\n/***/ 7399:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Percentage = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst decimal_js_1 = __importDefault(__webpack_require__(3776));\n/**\n * @category Math\n */\nclass Percentage {\n    constructor(numerator, denominator) {\n        this.toString = () => {\n            return `${this.numerator.toString()}/${this.denominator.toString()}`;\n        };\n        this.numerator = numerator;\n        this.denominator = denominator;\n    }\n    static fromDecimal(number) {\n        return Percentage.fromFraction(number.toDecimalPlaces(1).mul(10).toNumber(), 1000);\n    }\n    static fromFraction(numerator, denominator) {\n        const num = typeof numerator === \"number\" ? new spl_token_1.u64(numerator.toString()) : numerator;\n        const denom = typeof denominator === \"number\" ? new spl_token_1.u64(denominator.toString()) : denominator;\n        return new Percentage(num, denom);\n    }\n    toDecimal() {\n        if (this.denominator.eq(new spl_token_1.u64(0))) {\n            return new decimal_js_1.default(0);\n        }\n        return new decimal_js_1.default(this.numerator.toString()).div(new decimal_js_1.default(this.denominator.toString()));\n    }\n    add(p2) {\n        const denomGcd = this.denominator.gcd(p2.denominator);\n        const denomLcm = this.denominator.div(denomGcd).mul(p2.denominator);\n        const p1DenomAdjustment = denomLcm.div(this.denominator);\n        const p2DenomAdjustment = denomLcm.div(p2.denominator);\n        const p1NumeratorAdjusted = this.numerator.mul(p1DenomAdjustment);\n        const p2NumeratorAdjusted = p2.numerator.mul(p2DenomAdjustment);\n        const newNumerator = p1NumeratorAdjusted.add(p2NumeratorAdjusted);\n        return new Percentage(new spl_token_1.u64(newNumerator.toString()), new spl_token_1.u64(denomLcm.toString()));\n    }\n}\nexports.Percentage = Percentage;\n\n\n/***/ }),\n\n/***/ 7623:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.AddressUtil = void 0;\nconst anchor_1 = __webpack_require__(4758);\n/**\n * @category Util\n */\nclass AddressUtil {\n    static toPubKey(address) {\n        return (0, anchor_1.translateAddress)(address);\n    }\n    static toPubKeys(addresses) {\n        return addresses.map((address) => AddressUtil.toPubKey(address));\n    }\n    static toString(address) {\n        return AddressUtil.toPubKey(address).toBase58();\n    }\n    static toStrings(addresses) {\n        return addresses.map((address) => AddressUtil.toString(address));\n    }\n    static findProgramAddress(seeds, programId) {\n        const [publicKey, bump] = anchor_1.utils.publicKey.findProgramAddressSync(seeds, programId);\n        return { publicKey, bump };\n    }\n}\nexports.AddressUtil = AddressUtil;\n\n\n/***/ }),\n\n/***/ 6208:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.deriveATA = exports.resolveOrCreateATAs = exports.resolveOrCreateATA = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst token_instructions_1 = __webpack_require__(6212);\nconst token_util_1 = __webpack_require__(7209);\nconst types_1 = __webpack_require__(7864);\n/**\n * IMPORTANT: wrappedSolAmountIn should only be used for input/source token that\n *            could be SOL. This is because when SOL is the output, it is the end\n *            destination, and thus does not need to be wrapped with an amount.\n *\n * @param connection Solana connection class\n * @param ownerAddress The user's public key\n * @param tokenMint Token mint address\n * @param wrappedSolAmountIn Optional. Only use for input/source token that could be SOL\n * @param payer Payer that would pay the rent for the creation of the ATAs\n * @param modeIdempotent Optional. Use CreateIdempotent instruction instead of Create instruction\n * @returns\n */\nfunction resolveOrCreateATA(connection, ownerAddress, tokenMint, getAccountRentExempt, wrappedSolAmountIn = new spl_token_1.u64(0), payer = ownerAddress, modeIdempotent = false) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const instructions = yield resolveOrCreateATAs(connection, ownerAddress, [{ tokenMint, wrappedSolAmountIn }], getAccountRentExempt, payer, modeIdempotent);\n        return instructions[0];\n    });\n}\nexports.resolveOrCreateATA = resolveOrCreateATA;\n/**\n * IMPORTANT: wrappedSolAmountIn should only be used for input/source token that\n *            could be SOL. This is because when SOL is the output, it is the end\n *            destination, and thus does not need to be wrapped with an amount.\n *\n * @param connection Solana connection class\n * @param ownerAddress The user's public key\n * @param tokenMint Token mint address\n * @param wrappedSolAmountIn Optional. Only use for input/source token that could be SOL\n * @param payer Payer that would pay the rent for the creation of the ATAs\n * @param modeIdempotent Optional. Use CreateIdempotent instruction instead of Create instruction\n * @returns\n */\nfunction resolveOrCreateATAs(connection, ownerAddress, requests, getAccountRentExempt, payer = ownerAddress, modeIdempotent = false) {\n    var _a;\n    return __awaiter(this, void 0, void 0, function* () {\n        const nonNativeMints = requests.filter(({ tokenMint }) => !tokenMint.equals(spl_token_1.NATIVE_MINT));\n        const nativeMints = requests.filter(({ tokenMint }) => tokenMint.equals(spl_token_1.NATIVE_MINT));\n        if (nativeMints.length > 1) {\n            throw new Error(\"Cannot resolve multiple WSolAccounts\");\n        }\n        let instructionMap = {};\n        if (nonNativeMints.length > 0) {\n            const nonNativeAddresses = yield Promise.all(nonNativeMints.map(({ tokenMint }) => deriveATA(ownerAddress, tokenMint)));\n            const tokenAccountInfos = yield connection.getMultipleAccountsInfo(nonNativeAddresses);\n            const tokenAccounts = tokenAccountInfos.map((tai) => token_util_1.TokenUtil.deserializeTokenAccount(tai === null || tai === void 0 ? void 0 : tai.data));\n            tokenAccounts.forEach((tokenAccount, index) => {\n                const ataAddress = nonNativeAddresses[index];\n                let resolvedInstruction;\n                if (tokenAccount) {\n                    // ATA whose owner has been changed is abnormal entity.\n                    // To prevent to send swap/withdraw/collect output to the ATA, an error should be thrown.\n                    if (!tokenAccount.owner.equals(ownerAddress)) {\n                        throw new Error(`ATA with change of ownership detected: ${ataAddress.toBase58()}`);\n                    }\n                    resolvedInstruction = Object.assign({ address: ataAddress }, types_1.EMPTY_INSTRUCTION);\n                }\n                else {\n                    const createAtaInstruction = createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, nonNativeMints[index].tokenMint, ataAddress, ownerAddress, payer, modeIdempotent);\n                    resolvedInstruction = {\n                        address: ataAddress,\n                        instructions: [createAtaInstruction],\n                        cleanupInstructions: [],\n                        signers: [],\n                    };\n                }\n                instructionMap[nonNativeMints[index].tokenMint.toBase58()] = resolvedInstruction;\n            });\n        }\n        if (nativeMints.length > 0) {\n            const accountRentExempt = yield getAccountRentExempt();\n            const wrappedSolAmountIn = ((_a = nativeMints[0]) === null || _a === void 0 ? void 0 : _a.wrappedSolAmountIn) || new spl_token_1.u64(0);\n            instructionMap[spl_token_1.NATIVE_MINT.toBase58()] = (0, token_instructions_1.createWSOLAccountInstructions)(ownerAddress, wrappedSolAmountIn, accountRentExempt);\n        }\n        // Preserve order of resolution\n        return requests.map(({ tokenMint }) => instructionMap[tokenMint.toBase58()]);\n    });\n}\nexports.resolveOrCreateATAs = resolveOrCreateATAs;\nfunction deriveATA(ownerAddress, tokenMint) {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield spl_token_1.Token.getAssociatedTokenAddress(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, ownerAddress);\n    });\n}\nexports.deriveATA = deriveATA;\nfunction createAssociatedTokenAccountInstruction(associatedTokenProgramId, tokenProgramId, mint, associatedAccount, owner, payer, modeIdempotent) {\n    if (!modeIdempotent) {\n        return spl_token_1.Token.createAssociatedTokenAccountInstruction(associatedTokenProgramId, tokenProgramId, mint, associatedAccount, owner, payer);\n    }\n    // create CreateIdempotent instruction\n    // spl-token v0.1.8 doesn't have a method for CreateIdempotent.\n    // https://github.com/solana-labs/solana-program-library/blob/master/associated-token-account/program/src/instruction.rs#L26\n    const keys = [\n        { pubkey: payer, isSigner: true, isWritable: true },\n        { pubkey: associatedAccount, isSigner: false, isWritable: true },\n        { pubkey: owner, isSigner: false, isWritable: false },\n        { pubkey: mint, isSigner: false, isWritable: false },\n        { pubkey: web3_js_1.SystemProgram.programId, isSigner: false, isWritable: false },\n        { pubkey: tokenProgramId, isSigner: false, isWritable: false },\n    ];\n    const instructionData = Buffer.from([1]);\n    return new web3_js_1.TransactionInstruction({\n        keys,\n        programId: associatedTokenProgramId,\n        data: instructionData,\n    });\n}\n\n\n/***/ }),\n\n/***/ 1084:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(7623), exports);\n__exportStar(__webpack_require__(6208), exports);\n__exportStar(__webpack_require__(4911), exports);\n__exportStar(__webpack_require__(2888), exports);\n__exportStar(__webpack_require__(7209), exports);\n__exportStar(__webpack_require__(6493), exports);\n\n\n/***/ }),\n\n/***/ 9431:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getMultipleAccounts = exports.getMultipleParsedAccounts = exports.getParsedAccount = void 0;\nconst tiny_invariant_1 = __importDefault(__webpack_require__(6018));\nconst address_util_1 = __webpack_require__(7623);\nfunction getParsedAccount(connection, address, parser) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const value = yield connection.getAccountInfo(address_util_1.AddressUtil.toPubKey(address));\n        return parser.parse(value === null || value === void 0 ? void 0 : value.data);\n    });\n}\nexports.getParsedAccount = getParsedAccount;\nfunction getMultipleParsedAccounts(connection, addresses, parser) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (addresses.length === 0) {\n            return [];\n        }\n        const values = yield getMultipleAccounts(connection, address_util_1.AddressUtil.toPubKeys(addresses));\n        const results = values\n            .map((value) => parser.parse(value === null || value === void 0 ? void 0 : value.data))\n            .filter((value) => value !== undefined);\n        (0, tiny_invariant_1.default)(results.length === addresses.length, \"not enough results fetched\");\n        return results;\n    });\n}\nexports.getMultipleParsedAccounts = getMultipleParsedAccounts;\nfunction getMultipleAccounts(connection, addresses) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (addresses.length === 0) {\n            return [];\n        }\n        const responses = [];\n        const chunk = 100; // getMultipleAccounts has limitation of 100 accounts per request\n        for (let i = 0; i < addresses.length; i += chunk) {\n            const addressChunk = addresses.slice(i, i + chunk);\n            const res = connection.getMultipleAccountsInfo(address_util_1.AddressUtil.toPubKeys(addressChunk), connection.commitment);\n            responses.push(res);\n        }\n        const combinedResult = (yield Promise.all(responses)).flat();\n        (0, tiny_invariant_1.default)(combinedResult.length === addresses.length, \"getMultipleAccounts not enough results\");\n        return combinedResult;\n    });\n}\nexports.getMultipleAccounts = getMultipleAccounts;\n\n\n/***/ }),\n\n/***/ 4911:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(9431), exports);\n__exportStar(__webpack_require__(2388), exports);\n\n\n/***/ }),\n\n/***/ 2388:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.staticImplements = exports.ParsableMintInfo = exports.ParsableTokenAccountInfo = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst spl_token_1 = __webpack_require__(4945);\nconst token_util_1 = __webpack_require__(7209);\n/**\n * @category Parsables\n */\nlet ParsableTokenAccountInfo = class ParsableTokenAccountInfo {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return token_util_1.TokenUtil.deserializeTokenAccount(data);\n        }\n        catch (e) {\n            console.error(`error while parsing TokenAccount: ${e}`);\n            return null;\n        }\n    }\n};\nParsableTokenAccountInfo = __decorate([\n    staticImplements()\n], ParsableTokenAccountInfo);\nexports.ParsableTokenAccountInfo = ParsableTokenAccountInfo;\n/**\n * @category Parsables\n */\nlet ParsableMintInfo = class ParsableMintInfo {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            if (data.byteLength !== spl_token_1.MintLayout.span) {\n                throw new Error(\"Invalid data length for MintInfo\");\n            }\n            const buffer = spl_token_1.MintLayout.decode(data);\n            const mintInfo = {\n                mintAuthority: buffer.mintAuthorityOption === 0 ? null : new web3_js_1.PublicKey(buffer.mintAuthority),\n                supply: spl_token_1.u64.fromBuffer(buffer.supply),\n                decimals: buffer.decimals,\n                isInitialized: buffer.isInitialized !== 0,\n                freezeAuthority: buffer.freezeAuthorityOption === 0 ? null : new web3_js_1.PublicKey(buffer.freezeAuthority),\n            };\n            return mintInfo;\n        }\n        catch (e) {\n            console.error(`error while parsing MintInfo: ${e}`);\n            return null;\n        }\n    }\n};\nParsableMintInfo = __decorate([\n    staticImplements()\n], ParsableMintInfo);\nexports.ParsableMintInfo = ParsableMintInfo;\n/**\n * Class decorator to define an interface with static methods\n * Reference: https://github.com/Microsoft/TypeScript/issues/13462#issuecomment-295685298\n */\nfunction staticImplements() {\n    return (constructor) => {\n        constructor;\n    };\n}\nexports.staticImplements = staticImplements;\n\n\n/***/ }),\n\n/***/ 2888:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.PublicKeyUtils = void 0;\nclass PublicKeyUtils {\n    /**\n     * Check whether a string is a Base58 string.\n     * @param value\n     * @returns Whether the string is a Base58 string.\n     */\n    static isBase58(value) {\n        return /^[A-HJ-NP-Za-km-z1-9]*$/.test(value);\n    }\n    /**\n     * Order a list of public keys by bytes.\n     * @param keys a list of public keys to order\n     * @returns an ordered array of public keys\n     */\n    static orderKeys(...keys) {\n        return keys.sort(comparePublicKeys);\n    }\n}\nexports.PublicKeyUtils = PublicKeyUtils;\nfunction comparePublicKeys(key1, key2) {\n    const bytes1 = key1.toBytes();\n    const bytes2 = key2.toBytes();\n    // PublicKeys should be zero-padded 32 byte length\n    if (bytes1.byteLength !== bytes2.byteLength) {\n        return bytes1.byteLength - bytes2.byteLength;\n    }\n    for (let i = 0; i < bytes1.byteLength; i++) {\n        let byte1 = bytes1[i];\n        let byte2 = bytes2[i];\n        if (byte1 !== byte2) {\n            return byte1 - byte2;\n        }\n    }\n    return 0;\n}\n\n\n/***/ }),\n\n/***/ 7209:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __rest = (this && this.__rest) || function (s, e) {\n    var t = {};\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n        t[p] = s[p];\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n                t[p[i]] = s[p[i]];\n        }\n    return t;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenUtil = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst tiny_invariant_1 = __importDefault(__webpack_require__(6018));\nconst math_1 = __webpack_require__(4319);\nconst web3_1 = __webpack_require__(1084);\n/**\n * @category Util\n */\nclass TokenUtil {\n    static isNativeMint(mint) {\n        return mint.equals(spl_token_1.NATIVE_MINT);\n    }\n    /**\n     * Create an ix to send a spl-token / native-mint to another wallet.\n     * This function will handle the associated token accounts internally for spl-token.\n     * SOL is sent directly to the user's wallet.\n     *\n     * @param connection - Connection object\n     * @param sourceWallet - PublicKey for the sender's wallet\n     * @param destinationWallet - PublicKey for the receiver's wallet\n     * @param tokenMint - Mint for the token that is being sent.\n     * @param tokenDecimals - Decimal for the token that is being sent.\n     * @param amount - Amount of token to send\n     * @param getAccountRentExempt - Fn to fetch the account rent exempt value\n     * @param payer - PublicKey for the payer that would fund the possibly new token-accounts. (must sign the txn)\n     * @returns\n     */\n    static createSendTokensToWalletInstruction(connection, sourceWallet, destinationWallet, tokenMint, tokenDecimals, amount, getAccountRentExempt, payer) {\n        return __awaiter(this, void 0, void 0, function* () {\n            (0, tiny_invariant_1.default)(!amount.eq(math_1.ZERO), \"SendToken transaction must send more than 0 tokens.\");\n            // Specifically handle SOL, which is not a spl-token.\n            if (tokenMint.equals(spl_token_1.NATIVE_MINT)) {\n                const sendSolTxn = web3_js_1.SystemProgram.transfer({\n                    fromPubkey: sourceWallet,\n                    toPubkey: destinationWallet,\n                    lamports: BigInt(amount.toString()),\n                });\n                return {\n                    instructions: [sendSolTxn],\n                    cleanupInstructions: [],\n                    signers: [],\n                };\n            }\n            const sourceTokenAccount = yield (0, web3_1.deriveATA)(sourceWallet, tokenMint);\n            const _a = yield (0, web3_1.resolveOrCreateATA)(connection, destinationWallet, tokenMint, getAccountRentExempt, amount, payer), { address: destinationTokenAccount } = _a, destinationAtaIx = __rest(_a, [\"address\"]);\n            const transferIx = spl_token_1.Token.createTransferCheckedInstruction(spl_token_1.TOKEN_PROGRAM_ID, sourceTokenAccount, tokenMint, destinationTokenAccount, sourceWallet, [], new spl_token_1.u64(amount.toString()), tokenDecimals);\n            return {\n                instructions: destinationAtaIx.instructions.concat(transferIx),\n                cleanupInstructions: destinationAtaIx.cleanupInstructions,\n                signers: destinationAtaIx.signers,\n            };\n        });\n    }\n}\nexports.TokenUtil = TokenUtil;\nTokenUtil.deserializeTokenAccount = (data) => {\n    if (!data) {\n        return null;\n    }\n    if (data.byteLength !== spl_token_1.AccountLayout.span) {\n        throw new Error(\"Invalid data length for TokenAccount\");\n    }\n    const accountInfo = spl_token_1.AccountLayout.decode(data);\n    accountInfo.mint = new web3_js_1.PublicKey(accountInfo.mint);\n    accountInfo.owner = new web3_js_1.PublicKey(accountInfo.owner);\n    accountInfo.amount = spl_token_1.u64.fromBuffer(accountInfo.amount);\n    if (accountInfo.delegateOption === 0) {\n        accountInfo.delegate = null;\n        accountInfo.delegatedAmount = new spl_token_1.u64(0);\n    }\n    else {\n        accountInfo.delegate = new web3_js_1.PublicKey(accountInfo.delegate);\n        accountInfo.delegatedAmount = spl_token_1.u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n    accountInfo.isInitialized = accountInfo.state !== 0;\n    accountInfo.isFrozen = accountInfo.state === 2;\n    if (accountInfo.isNativeOption === 1) {\n        accountInfo.rentExemptReserve = spl_token_1.u64.fromBuffer(accountInfo.isNative);\n        accountInfo.isNative = true;\n    }\n    else {\n        accountInfo.rentExemptReserve = null;\n        accountInfo.isNative = false;\n    }\n    if (accountInfo.closeAuthorityOption === 0) {\n        accountInfo.closeAuthority = null;\n    }\n    else {\n        accountInfo.closeAuthority = new web3_js_1.PublicKey(accountInfo.closeAuthority);\n    }\n    return accountInfo;\n};\n\n\n/***/ }),\n\n/***/ 6493:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(8801), exports);\n__exportStar(__webpack_require__(785), exports);\n__exportStar(__webpack_require__(7864), exports);\n\n\n/***/ }),\n\n/***/ 8801:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TransactionBuilder = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst transactions_processor_1 = __webpack_require__(785);\n/**\n * @category Transactions Util\n */\nclass TransactionBuilder {\n    constructor(connection, wallet) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.instructions = [];\n        this.signers = [];\n    }\n    /**\n     * Append an instruction into this builder.\n     * @param instruction - An Instruction\n     * @returns Returns this transaction builder.\n     */\n    addInstruction(instruction) {\n        this.instructions.push(instruction);\n        return this;\n    }\n    /**\n     * Append a list of instructions into this builder.\n     * @param instructions - A list of Instructions\n     * @returns Returns this transaction builder.\n     */\n    addInstructions(instructions) {\n        this.instructions = this.instructions.concat(instructions);\n        return this;\n    }\n    /**\n     * Prepend a list of instructions into this builder.\n     * @param instruction - An Instruction\n     * @returns Returns this transaction builder.\n     */\n    prependInstruction(instruction) {\n        this.instructions.unshift(instruction);\n        return this;\n    }\n    /**\n     * Prepend a list of instructions into this builder.\n     * @param instructions - A list of Instructions\n     * @returns Returns this transaction builder.\n     */\n    prependInstructions(instructions) {\n        this.instructions = instructions.concat(this.instructions);\n        return this;\n    }\n    addSigner(signer) {\n        this.signers.push(signer);\n        return this;\n    }\n    isEmpty() {\n        return this.instructions.length == 0;\n    }\n    /**\n     * Compresses all instructions & signers in this builder\n     * into one single instruction\n     * @param compressPost Compress all post instructions into the instructions field\n     * @returns Instruction object containing all\n     */\n    compressIx(compressPost) {\n        let instructions = [];\n        let cleanupInstructions = [];\n        let signers = [];\n        this.instructions.forEach((curr) => {\n            instructions = instructions.concat(curr.instructions);\n            // Cleanup instructions should execute in reverse order\n            cleanupInstructions = curr.cleanupInstructions.concat(cleanupInstructions);\n            signers = signers.concat(curr.signers);\n        });\n        if (compressPost) {\n            instructions = instructions.concat(cleanupInstructions);\n            cleanupInstructions = [];\n        }\n        return {\n            instructions: [...instructions],\n            cleanupInstructions: [...cleanupInstructions],\n            signers,\n        };\n    }\n    /**\n     * Returns the size of the current transaction in bytes.\n     * @returns the size of the current transaction in bytes.\n     * @throws error if transaction is over maximum package size.\n     */\n    txnSize(options = { latestBlockhash: undefined }) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (this.isEmpty()) {\n                return 0;\n            }\n            const request = yield this.build(options);\n            return request.transaction.serialize({ requireAllSignatures: false }).length;\n        });\n    }\n    /**\n     * Constructs a transaction payload with the gathered instructions\n     * @returns a TransactionPayload object that can be excuted or agregated into other transactions\n     */\n    build(options = { latestBlockhash: undefined }) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { latestBlockhash } = options;\n            let recentBlockhash = !latestBlockhash\n                ? yield this.connection.getLatestBlockhash(\"singleGossip\")\n                : latestBlockhash;\n            const transaction = new web3_js_1.Transaction(Object.assign(Object.assign({}, recentBlockhash), { feePayer: this.wallet.publicKey }));\n            const ix = this.compressIx(true);\n            transaction.add(...ix.instructions);\n            transaction.feePayer = this.wallet.publicKey;\n            return {\n                transaction: transaction,\n                signers: ix.signers.concat(this.signers),\n            };\n        });\n    }\n    /**\n     * Constructs a transaction payload with the gathered instructions, sign it with the provider and send it out\n     * @returns the txId of the transaction\n     */\n    buildAndExecute() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const tx = yield this.build();\n            const tp = new transactions_processor_1.TransactionProcessor(this.connection, this.wallet);\n            const { execute } = yield tp.signAndConstructTransaction(tx);\n            return execute();\n        });\n    }\n    /**\n     * Send multiple transactions at once.\n     * @deprecated This method is here for legacy reasons and we prefer the use of TransactionProcessor\n     */\n    static sendAll(provider, txns, opts) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const txRequest = yield Promise.all(txns.map((txBuilder) => __awaiter(this, void 0, void 0, function* () {\n                const { transaction, signers } = yield txBuilder.build();\n                return { tx: transaction, signers };\n            })));\n            return yield provider.sendAll(txRequest, opts);\n        });\n    }\n}\nexports.TransactionBuilder = TransactionBuilder;\n\n\n/***/ }),\n\n/***/ 785:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TransactionProcessor = void 0;\nclass TransactionProcessor {\n    constructor(connection, wallet, commitment = \"confirmed\") {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.commitment = commitment;\n    }\n    signTransaction(txRequest) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transactions, lastValidBlockHeight, blockhash } = yield this.signTransactions([\n                txRequest,\n            ]);\n            return { transaction: transactions[0], lastValidBlockHeight, blockhash };\n        });\n    }\n    signTransactions(txRequests) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { blockhash, lastValidBlockHeight } = yield this.connection.getLatestBlockhash(this.commitment);\n            const feePayer = this.wallet.publicKey;\n            const pSignedTxs = txRequests.map((txRequest) => {\n                return rewriteTransaction(txRequest, feePayer, blockhash);\n            });\n            const transactions = yield this.wallet.signAllTransactions(pSignedTxs);\n            return {\n                transactions,\n                lastValidBlockHeight,\n                blockhash,\n            };\n        });\n    }\n    sendTransaction(transaction, lastValidBlockHeight, blockhash) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const execute = this.constructSendTransactions([transaction], lastValidBlockHeight, blockhash);\n            const txs = yield execute();\n            const ex = txs[0];\n            if (ex.status === \"fulfilled\") {\n                return ex.value;\n            }\n            else {\n                throw ex.reason;\n            }\n        });\n    }\n    constructSendTransactions(transactions, lastValidBlockHeight, blockhash, parallel = true) {\n        const executeTx = (tx) => __awaiter(this, void 0, void 0, function* () {\n            const rawTxs = tx.serialize();\n            return this.connection.sendRawTransaction(rawTxs, {\n                preflightCommitment: this.commitment,\n            });\n        });\n        const confirmTx = (txId) => __awaiter(this, void 0, void 0, function* () {\n            const result = yield this.connection.confirmTransaction({\n                signature: txId,\n                lastValidBlockHeight: lastValidBlockHeight,\n                blockhash,\n            }, this.commitment);\n            if (result.value.err) {\n                throw new Error(`Transaction failed: ${JSON.stringify(result.value)}`);\n            }\n        });\n        return () => __awaiter(this, void 0, void 0, function* () {\n            if (parallel) {\n                const results = transactions.map((tx) => __awaiter(this, void 0, void 0, function* () {\n                    const txId = yield executeTx(tx);\n                    yield confirmTx(txId);\n                    return txId;\n                }));\n                return Promise.allSettled(results);\n            }\n            else {\n                const results = [];\n                for (const tx of transactions) {\n                    const txId = yield executeTx(tx);\n                    yield confirmTx(txId);\n                    results.push(txId);\n                }\n                return Promise.allSettled(results);\n            }\n        });\n    }\n    signAndConstructTransaction(txRequest) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transaction, lastValidBlockHeight, blockhash } = yield this.signTransaction(txRequest);\n            return {\n                signedTx: transaction,\n                execute: () => __awaiter(this, void 0, void 0, function* () { return this.sendTransaction(transaction, lastValidBlockHeight, blockhash); }),\n            };\n        });\n    }\n    signAndConstructTransactions(txRequests, parallel = true) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { transactions, lastValidBlockHeight, blockhash } = yield this.signTransactions(txRequests);\n            const execute = this.constructSendTransactions(transactions, lastValidBlockHeight, blockhash, parallel);\n            return { signedTxs: transactions, execute };\n        });\n    }\n}\nexports.TransactionProcessor = TransactionProcessor;\nfunction rewriteTransaction(txRequest, feePayer, blockhash) {\n    var _a;\n    const signers = (_a = txRequest.signers) !== null && _a !== void 0 ? _a : [];\n    const tx = txRequest.transaction;\n    tx.feePayer = feePayer;\n    tx.recentBlockhash = blockhash;\n    signers.filter((s) => s !== undefined).forEach((keypair) => tx.partialSign(keypair));\n    return tx;\n}\n\n\n/***/ }),\n\n/***/ 7864:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.EMPTY_INSTRUCTION = void 0;\n/**\n * @category Transactions Util\n */\nexports.EMPTY_INSTRUCTION = {\n    instructions: [],\n    cleanupInstructions: [],\n    signers: [],\n};\n\n\n/***/ }),\n\n/***/ 4758:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"ACCOUNT_DISCRIMINATOR_SIZE\": function() { return /* binding */ Dt; },\n/* harmony export */   \"AccountClient\": function() { return /* binding */ En; },\n/* harmony export */   \"AnchorError\": function() { return /* binding */ vt; },\n/* harmony export */   \"AnchorProvider\": function() { return /* binding */ st; },\n/* harmony export */   \"BN\": function() { return /* reexport default from dynamic */ bn_js__WEBPACK_IMPORTED_MODULE_2___default.a; },\n/* harmony export */   \"BorshAccountsCoder\": function() { return /* binding */ Nt; },\n/* harmony export */   \"BorshCoder\": function() { return /* binding */ Kt; },\n/* harmony export */   \"BorshEventCoder\": function() { return /* binding */ Rt; },\n/* harmony export */   \"BorshInstructionCoder\": function() { return /* binding */ Tt; },\n/* harmony export */   \"BorshStateCoder\": function() { return /* binding */ Ut; },\n/* harmony export */   \"EventManager\": function() { return /* binding */ xn; },\n/* harmony export */   \"EventParser\": function() { return /* binding */ Pn; },\n/* harmony export */   \"IdlError\": function() { return /* binding */ gt; },\n/* harmony export */   \"LangErrorCode\": function() { return /* binding */ _t; },\n/* harmony export */   \"LangErrorMessage\": function() { return /* binding */ St; },\n/* harmony export */   \"MethodsBuilderFactory\": function() { return /* binding */ Nn; },\n/* harmony export */   \"Native\": function() { return /* binding */ Yn; },\n/* harmony export */   \"Program\": function() { return /* binding */ Vn; },\n/* harmony export */   \"ProgramError\": function() { return /* binding */ bt; },\n/* harmony export */   \"ProgramErrorStack\": function() { return /* binding */ wt; },\n/* harmony export */   \"Spl\": function() { return /* binding */ Jn; },\n/* harmony export */   \"SplTokenCoder\": function() { return /* binding */ Ne; },\n/* harmony export */   \"StateClient\": function() { return /* binding */ _n; },\n/* harmony export */   \"SystemCoder\": function() { return /* binding */ Qe; },\n/* harmony export */   \"eventDiscriminator\": function() { return /* binding */ Vt; },\n/* harmony export */   \"getProvider\": function() { return /* binding */ lt; },\n/* harmony export */   \"parseIdlErrors\": function() { return /* binding */ M; },\n/* harmony export */   \"setProvider\": function() { return /* binding */ dt; },\n/* harmony export */   \"splitArgsAndCtx\": function() { return /* binding */ wn; },\n/* harmony export */   \"stateDiscriminator\": function() { return /* binding */ jt; },\n/* harmony export */   \"toInstruction\": function() { return /* binding */ x; },\n/* harmony export */   \"translateAddress\": function() { return /* binding */ L; },\n/* harmony export */   \"translateError\": function() { return /* binding */ At; },\n/* harmony export */   \"utils\": function() { return /* binding */ yn; },\n/* harmony export */   \"validateAccounts\": function() { return /* binding */ P; },\n/* harmony export */   \"web3\": function() { return /* reexport module object */ _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__; }\n/* harmony export */ });\n/* harmony import */ var buffer__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8764);\n/* harmony import */ var _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6737);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(3550);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(bn_js__WEBPACK_IMPORTED_MODULE_2__);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(5658);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(bs58__WEBPACK_IMPORTED_MODULE_3__);\n/* harmony import */ var base64_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(9742);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(3204);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(camelcase__WEBPACK_IMPORTED_MODULE_5__);\n/* harmony import */ var js_sha256__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(2023);\n/* harmony import */ var js_sha256__WEBPACK_IMPORTED_MODULE_6___default = /*#__PURE__*/__webpack_require__.n(js_sha256__WEBPACK_IMPORTED_MODULE_6__);\n/* harmony import */ var _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(9593);\n/* harmony import */ var _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7___default = /*#__PURE__*/__webpack_require__.n(_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__);\n/* harmony import */ var pako__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(7885);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(6729);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(eventemitter3__WEBPACK_IMPORTED_MODULE_9__);\n/* harmony import */ var assert__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(9282);\n/* harmony import */ var assert__WEBPACK_IMPORTED_MODULE_10___default = /*#__PURE__*/__webpack_require__.n(assert__WEBPACK_IMPORTED_MODULE_10__);\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\nvar w=Object.freeze({__proto__:null,encode:function(t){return t.reduce(((t,e)=>t+e.toString(16).padStart(2,\"0\")),\"0x\")},decode:function(e){0===e.indexOf(\"0x\")&&(e=e.substr(2)),e.length%2==1&&(e=\"0\"+e);let n=e.match(/.{2}/g);return null===n?buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([]):buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(n.map((t=>parseInt(t,16))))}});function v(t){return new TextDecoder(\"utf-8\").decode(t)}function b(t){return(new TextEncoder).encode(t)}var A=Object.freeze({__proto__:null,decode:v,encode:b});function _(t){return bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(t)}var S=Object.freeze({__proto__:null,encode:_,decode:function(t){return bs58__WEBPACK_IMPORTED_MODULE_3___default().decode(t)}});function E(e){return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(base64_js__WEBPACK_IMPORTED_MODULE_4__.toByteArray(e))}var I=Object.freeze({__proto__:null,encode:function(t){return base64_js__WEBPACK_IMPORTED_MODULE_4__.fromByteArray(t)},decode:E}),k=Object.freeze({__proto__:null,hex:w,utf8:A,bs58:S,base64:I});function M(t){const e=new Map;return t.errors&&t.errors.forEach((t=>{var n;let r=null!==(n=t.msg)&&void 0!==n?n:t.name;e.set(t.code,r)})),e}function x(t,...e){if(t.args.length!=e.length)throw new Error(\"Invalid argument length\");const n={};let r=0;return t.args.forEach((t=>{n[t.name]=e[r],r+=1})),n}function P(t,e={}){t.forEach((t=>{if(\"accounts\"in t)P(t.accounts,e[t.name]);else if(void 0===e[t.name])throw new Error(`Invalid arguments: ${t.name} not provided.`)}))}function L(t){return t instanceof _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey?t:new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(t)}class T extends TypeError{constructor(t,e){let n;const{message:r,...o}=t,{path:i}=t;super(0===i.length?r:\"At path: \"+i.join(\".\")+\" -- \"+r),this.value=void 0,this.key=void 0,this.type=void 0,this.refinement=void 0,this.path=void 0,this.branch=void 0,this.failures=void 0,Object.assign(this,o),this.name=this.constructor.name,this.failures=()=>{var r;return null!=(r=n)?r:n=[t,...e()]}}}function C(t){return\"object\"==typeof t&&null!=t}function z(t){return\"string\"==typeof t?JSON.stringify(t):\"\"+t}function B(t,e,n,r){if(!0===t)return;!1===t?t={}:\"string\"==typeof t&&(t={message:t});const{path:o,branch:i}=e,{type:s}=n,{refinement:a,message:c=\"Expected a value of type `\"+s+\"`\"+(a?\" with refinement `\"+a+\"`\":\"\")+\", but received: `\"+z(r)+\"`\"}=t;return{value:r,type:s,refinement:a,key:o[o.length-1],path:o,branch:i,...t,message:c}}function*O(t,e,n,r){var o;C(o=t)&&\"function\"==typeof o[Symbol.iterator]||(t=[t]);for(const o of t){const t=B(o,e,n,r);t&&(yield t)}}function*D(t,e,n){void 0===n&&(n={});const{path:r=[],branch:o=[t],coerce:i=!1,mask:s=!1}=n,a={path:r,branch:o};if(i&&(t=e.coercer(t,a),s&&\"type\"!==e.type&&C(e.schema)&&C(t)&&!Array.isArray(t)))for(const n in t)void 0===e.schema[n]&&delete t[n];let c=!0;for(const n of e.validator(t,a))c=!1,yield[n,void 0];for(let[n,u,d]of e.entries(t,a)){const e=D(u,d,{path:void 0===n?r:[...r,n],branch:void 0===n?o:[...o,u],coerce:i,mask:s});for(const r of e)r[0]?(c=!1,yield[r[0],void 0]):i&&(u=r[1],void 0===n?t=u:t instanceof Map?t.set(n,u):t instanceof Set?t.add(u):C(t)&&(t[n]=u))}if(c)for(const n of e.refiner(t,a))c=!1,yield[n,void 0];c&&(yield[void 0,t])}class N{constructor(t){this.TYPE=void 0,this.type=void 0,this.schema=void 0,this.coercer=void 0,this.validator=void 0,this.refiner=void 0,this.entries=void 0;const{type:e,schema:n,validator:r,refiner:o,coercer:i=(t=>t),entries:s=function*(){}}=t;this.type=e,this.schema=n,this.entries=s,this.coercer=i,this.validator=r?(t,e)=>O(r(t,e),e,this,t):()=>[],this.refiner=o?(t,e)=>O(o(t,e),e,this,t):()=>[]}assert(t){return function(t,e){const n=U(t,e);if(n[0])throw n[0]}(t,this)}create(t){return R(t,this)}is(t){return V(t,this)}mask(t){return function(t,e){const n=U(t,e,{coerce:!0,mask:!0});if(n[0])throw n[0];return n[1]}(t,this)}validate(t,e){return void 0===e&&(e={}),U(t,this,e)}}function R(t,e){const n=U(t,e,{coerce:!0});if(n[0])throw n[0];return n[1]}function V(t,e){return!U(t,e)[0]}function U(t,e,n){void 0===n&&(n={});const r=D(t,e,n),o=function(t){const{done:e,value:n}=t.next();return e?void 0:n}(r);if(o[0]){return[new T(o[0],(function*(){for(const t of r)t[0]&&(yield t[0])})),void 0]}return[void 0,o[1]]}function j(t,e){return new N({type:t,schema:null,validator:e})}function $(t){return new N({type:\"array\",schema:t,*entries(e){if(t&&Array.isArray(e))for(const[n,r]of e.entries())yield[n,r,t]},coercer:t=>Array.isArray(t)?t.slice():t,validator:t=>Array.isArray(t)||\"Expected an array value, but received: \"+z(t)})}function K(t){const e=z(t),n=typeof t;return new N({type:\"literal\",schema:\"string\"===n||\"number\"===n||\"boolean\"===n?t:null,validator:n=>n===t||\"Expected the literal `\"+e+\"`, but received: \"+z(n)})}function q(t){return new N({...t,validator:(e,n)=>null===e||t.validator(e,n),refiner:(e,n)=>null===e||t.refiner(e,n)})}function F(){return j(\"number\",(t=>\"number\"==typeof t&&!isNaN(t)||\"Expected a number, but received: \"+z(t)))}function W(t){return new N({...t,validator:(e,n)=>void 0===e||t.validator(e,n),refiner:(e,n)=>void 0===e||t.refiner(e,n)})}function G(){return j(\"string\",(t=>\"string\"==typeof t||\"Expected a string, but received: \"+z(t)))}function H(t){const e=Object.keys(t);return new N({type:\"type\",schema:t,*entries(n){if(C(n))for(const r of e)yield[r,n[r],t[r]]},validator:t=>C(t)||\"Expected an object, but received: \"+z(t)})}function J(t){const e=t.map((t=>t.type)).join(\" | \");return new N({type:\"union\",schema:null,coercer:(e,n)=>(t.find((t=>{const[n]=t.validate(e,{coerce:!0});return!n}))||Z()).coercer(e,n),validator(n,r){const o=[];for(const e of t){const[...t]=D(n,e,r),[i]=t;if(!i[0])return[];for(const[e]of t)e&&o.push(e)}return[\"Expected the value to satisfy a union of `\"+e+\"`, but received: \"+z(n),...o]}})}function Z(){return j(\"unknown\",(()=>!0))}async function X(t,e,n){if(e.length<=99)return await Q(t,e,n);{const r=function(t,e){return Array.apply(0,new Array(Math.ceil(t.length/e))).map(((n,r)=>t.slice(r*e,(r+1)*e)))}(e,99);return(await Promise.all(r.map((e=>Q(t,e,n))))).flat()}}async function Q(t,e,n){const r=null!=n?n:t.commitment;return(await t.getMultipleAccountsInfo(e,r)).map(((t,n)=>null===t?null:{publicKey:e[n],account:t}))}async function Y(t,e,n,r,i){n&&n.length>0&&e.sign(...n);const s=e._compile(),a=s.serialize(),c=e._serialize(a).toString(\"base64\"),u={encoding:\"base64\",commitment:null!=r?r:t.commitment};if(i){const t=(Array.isArray(i)?i:s.nonProgramIds()).map((t=>t.toBase58()));u.accounts={encoding:\"base64\",addresses:t}}n&&(u.sigVerify=!0);const d=[c,u],l=R(await t._rpcRequest(\"simulateTransaction\",d),rt);if(\"error\"in l){let t;if(\"data\"in l.error&&(t=l.error.data.logs,t&&Array.isArray(t))){const e=\"\\n    \",n=e+t.join(e);console.error(l.error.message,n)}throw new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(\"failed to simulate transaction: \"+l.error.message,t)}return l.result}function tt(t){return function(t,e,n){return new N({...t,coercer:(r,o)=>V(r,e)?t.coercer(n(r,o),o):t.coercer(r,o)})}(nt(t),et,(e=>\"error\"in e?e:{...e,result:R(e.result,t)}))}const et=nt(Z());function nt(t){return J([H({jsonrpc:K(\"2.0\"),id:G(),result:t}),H({jsonrpc:K(\"2.0\"),id:G(),error:H({code:Z(),message:G(),data:W(j(\"any\",(()=>!0)))})})])}const rt=(ot=H({err:q(J([H({}),G()])),logs:q($(G())),accounts:W(q($(q(H({executable:j(\"boolean\",(t=>\"boolean\"==typeof t)),owner:G(),lamports:F(),data:$(G()),rentEpoch:W(F())}))))),unitsConsumed:W(F())}),tt(H({context:H({slot:F()}),value:ot})));var ot,it=Object.freeze({__proto__:null,invoke:async function(t,e,o,i){t=L(t),i||(i=lt());const s=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.Transaction;if(s.add(new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.TransactionInstruction({programId:t,keys:null!=e?e:[],data:o})),void 0===i.sendAndConfirm)throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");return await i.sendAndConfirm(s,[])},getMultipleAccounts:X,simulateTransaction:Y});class st{constructor(t,e,n){this.connection=t,this.wallet=e,this.opts=n,this.publicKey=e.publicKey}static defaultOptions(){return{preflightCommitment:\"processed\",commitment:\"processed\"}}static local(t,e){throw new Error(\"Provider local is not available on browser.\")}static env(){throw new Error(\"Provider env is not available on browser.\")}async sendAndConfirm(t,e,n){var r;void 0===n&&(n=this.opts),t.feePayer=this.wallet.publicKey,t.recentBlockhash=(await this.connection.getRecentBlockhash(n.preflightCommitment)).blockhash,t=await this.wallet.signTransaction(t),(null!=e?e:[]).forEach((e=>{t.partialSign(e)}));const i=t.serialize();try{return await ct(this.connection,i,n)}catch(e){if(e instanceof ut){const n=await this.connection.getTransaction(_(t.signature),{commitment:\"confirmed\"});if(n){const t=null===(r=n.meta)||void 0===r?void 0:r.logMessages;throw t?new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(e.message,t):e}throw e}throw e}}async sendAll(t,e){void 0===e&&(e=this.opts);const n=await this.connection.getRecentBlockhash(e.preflightCommitment);let r=t.map((t=>{var e;let r=t.tx,o=null!==(e=t.signers)&&void 0!==e?e:[];return r.feePayer=this.wallet.publicKey,r.recentBlockhash=n.blockhash,o.forEach((t=>{r.partialSign(t)})),r}));const o=await this.wallet.signAllTransactions(r),i=[];for(let t=0;t<r.length;t+=1){const n=o[t].serialize();i.push(await ct(this.connection,n,e))}return i}async simulate(t,e,n,r){t.feePayer=this.wallet.publicKey,t.recentBlockhash=(await this.connection.getLatestBlockhash(null!=n?n:this.connection.commitment)).blockhash,t=await this.wallet.signTransaction(t);const o=await Y(this.connection,t,e,n,r);if(o.value.err)throw new at(o.value);return o.value}}class at extends Error{constructor(t,e){super(e),this.simulationResponse=t}}async function ct(t,e,n){const r=n&&{skipPreflight:n.skipPreflight,preflightCommitment:n.preflightCommitment||n.commitment},o=await t.sendRawTransaction(e,r),i=(await t.confirmTransaction(o,n&&n.commitment)).value;if(i.err)throw new ut(`Raw transaction ${o} failed (${JSON.stringify(i)})`);return o}class ut extends Error{constructor(t){super(t)}}function dt(t){ht=t}function lt(){return null===ht?st.local():ht}let ht=null;const pt=new Set([\"anchor-deprecated-state\",\"debug-logs\"]),ft=new Map;function mt(t){return void 0!==ft.get(t)}var yt=Object.freeze({__proto__:null,set:function(t){if(!pt.has(t))throw new Error(\"Invalid feature\");ft.set(t,!0)},isSet:mt});class gt extends Error{constructor(t){super(t),this.name=\"IdlError\"}}class wt{constructor(t){this.stack=t}static parse(t){var n;const r=/^Program (\\w*) invoke/,o=/^Program \\w* success/,i=[];for(let s=0;s<t.length;s++){if(o.exec(t[s])){i.pop();continue}const a=null===(n=r.exec(t[s]))||void 0===n?void 0:n[1];a&&i.push(new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(a))}return new wt(i)}}class vt extends Error{constructor(t,e,n,r,o,i){super(n.join(\"\\n\").replace(\"Program log: \",\"\")),this.errorLogs=n,this.logs=r,this.error={errorCode:t,errorMessage:e,comparedValues:i,origin:o},this._programErrorStack=wt.parse(r)}static parse(t){if(!t)return null;const n=t.findIndex((t=>t.startsWith(\"Program log: AnchorError\")));if(-1===n)return null;const r=t[n],o=[r];let i;if(n+1<t.length)if(\"Program log: Left:\"===t[n+1]){const r=/^Program log: (.*)$/,s=r.exec(t[n+2])[1],a=r.exec(t[n+4])[1];i=[new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(s),new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(a)],o.push(...t.slice(n+1,n+5))}else if(t[n+1].startsWith(\"Program log: Left:\")){const e=/^Program log: (Left|Right): (.*)$/,r=e.exec(t[n+1])[2],s=e.exec(t[n+2])[2];o.push(...t.slice(n+1,n+3)),i=[r,s]}const s=/^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r),a=/^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r),c=/^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./.exec(r);if(s){const[e,n,r]=s.slice(1,4),a={code:e,number:parseInt(n)};return new vt(a,r,o,t,void 0,i)}if(a){const[e,n,r,s,c]=a.slice(1,6),u={code:r,number:parseInt(s)},d={file:e,line:parseInt(n)};return new vt(u,c,o,t,d,i)}if(c){const[e,n,r,s]=c.slice(1,5),a=e,u={code:n,number:parseInt(r)};return new vt(u,s,o,t,a,i)}return null}get program(){return this._programErrorStack.stack[this._programErrorStack.stack.length-1]}get programErrorStack(){return this._programErrorStack.stack}toString(){return this.message}}class bt extends Error{constructor(t,e,n){super(),this.code=t,this.msg=e,this.logs=n,n&&(this._programErrorStack=wt.parse(n))}static parse(t,e){const n=t.toString();let r,o;if(n.includes(\"custom program error:\")){let t=n.split(\"custom program error: \");if(2!==t.length)return null;r=t[1]}else{const t=n.match(/\"Custom\":([0-9]+)}/g);if(!t||t.length>1)return null;r=t[0].match(/([0-9]+)/g)[0]}try{o=parseInt(r)}catch(t){return null}let i=e.get(o);return void 0!==i?new bt(o,i,t.logs):(i=St.get(o),void 0!==i?new bt(o,i,t.logs):null)}get program(){var t;return null===(t=this._programErrorStack)||void 0===t?void 0:t.stack[this._programErrorStack.stack.length-1]}get programErrorStack(){var t;return null===(t=this._programErrorStack)||void 0===t?void 0:t.stack}toString(){return this.msg}}function At(t,e){mt(\"debug-logs\")&&console.log(\"Translating error:\",t);const n=vt.parse(t.logs);if(n)return n;const r=bt.parse(t,e);if(r)return r;if(t.logs){const e={get:function(e,n){return\"programErrorStack\"===n?e.programErrorStack.stack:\"program\"===n?e.programErrorStack.stack[t.programErrorStack.stack.length-1]:Reflect.get(...arguments)}};return t.programErrorStack=wt.parse(t.logs),new Proxy(t,e)}return t}const _t={InstructionMissing:100,InstructionFallbackNotFound:101,InstructionDidNotDeserialize:102,InstructionDidNotSerialize:103,IdlInstructionStub:1e3,IdlInstructionInvalidProgram:1001,ConstraintMut:2e3,ConstraintHasOne:2001,ConstraintSigner:2002,ConstraintRaw:2003,ConstraintOwner:2004,ConstraintRentExempt:2005,ConstraintSeeds:2006,ConstraintExecutable:2007,ConstraintState:2008,ConstraintAssociated:2009,ConstraintAssociatedInit:2010,ConstraintClose:2011,ConstraintAddress:2012,ConstraintZero:2013,ConstraintTokenMint:2014,ConstraintTokenOwner:2015,ConstraintMintMintAuthority:2016,ConstraintMintFreezeAuthority:2017,ConstraintMintDecimals:2018,ConstraintSpace:2019,RequireViolated:2500,RequireEqViolated:2501,RequireKeysEqViolated:2502,RequireNeqViolated:2503,RequireKeysNeqViolated:2504,RequireGtViolated:2505,RequireGteViolated:2506,AccountDiscriminatorAlreadySet:3e3,AccountDiscriminatorNotFound:3001,AccountDiscriminatorMismatch:3002,AccountDidNotDeserialize:3003,AccountDidNotSerialize:3004,AccountNotEnoughKeys:3005,AccountNotMutable:3006,AccountOwnedByWrongProgram:3007,InvalidProgramId:3008,InvalidProgramExecutable:3009,AccountNotSigner:3010,AccountNotSystemOwned:3011,AccountNotInitialized:3012,AccountNotProgramData:3013,AccountNotAssociatedTokenAccount:3014,AccountSysvarMismatch:3015,AccountReallocExceedsLimit:3016,AccountDuplicateReallocs:3017,StateInvalidAddress:4e3,DeclaredProgramIdMismatch:4100,Deprecated:5e3},St=new Map([[_t.InstructionMissing,\"8 byte instruction identifier not provided\"],[_t.InstructionFallbackNotFound,\"Fallback functions are not supported\"],[_t.InstructionDidNotDeserialize,\"The program could not deserialize the given instruction\"],[_t.InstructionDidNotSerialize,\"The program could not serialize the given instruction\"],[_t.IdlInstructionStub,\"The program was compiled without idl instructions\"],[_t.IdlInstructionInvalidProgram,\"The transaction was given an invalid program for the IDL instruction\"],[_t.ConstraintMut,\"A mut constraint was violated\"],[_t.ConstraintHasOne,\"A has_one constraint was violated\"],[_t.ConstraintSigner,\"A signer constraint was violated\"],[_t.ConstraintRaw,\"A raw constraint was violated\"],[_t.ConstraintOwner,\"An owner constraint was violated\"],[_t.ConstraintRentExempt,\"A rent exemption constraint was violated\"],[_t.ConstraintSeeds,\"A seeds constraint was violated\"],[_t.ConstraintExecutable,\"An executable constraint was violated\"],[_t.ConstraintState,\"A state constraint was violated\"],[_t.ConstraintAssociated,\"An associated constraint was violated\"],[_t.ConstraintAssociatedInit,\"An associated init constraint was violated\"],[_t.ConstraintClose,\"A close constraint was violated\"],[_t.ConstraintAddress,\"An address constraint was violated\"],[_t.ConstraintZero,\"Expected zero account discriminant\"],[_t.ConstraintTokenMint,\"A token mint constraint was violated\"],[_t.ConstraintTokenOwner,\"A token owner constraint was violated\"],[_t.ConstraintMintMintAuthority,\"A mint mint authority constraint was violated\"],[_t.ConstraintMintFreezeAuthority,\"A mint freeze authority constraint was violated\"],[_t.ConstraintMintDecimals,\"A mint decimals constraint was violated\"],[_t.ConstraintSpace,\"A space constraint was violated\"],[_t.RequireViolated,\"A require expression was violated\"],[_t.RequireEqViolated,\"A require_eq expression was violated\"],[_t.RequireKeysEqViolated,\"A require_keys_eq expression was violated\"],[_t.RequireNeqViolated,\"A require_neq expression was violated\"],[_t.RequireKeysNeqViolated,\"A require_keys_neq expression was violated\"],[_t.RequireGtViolated,\"A require_gt expression was violated\"],[_t.RequireGteViolated,\"A require_gte expression was violated\"],[_t.AccountDiscriminatorAlreadySet,\"The account discriminator was already set on this account\"],[_t.AccountDiscriminatorNotFound,\"No 8 byte discriminator was found on the account\"],[_t.AccountDiscriminatorMismatch,\"8 byte discriminator did not match what was expected\"],[_t.AccountDidNotDeserialize,\"Failed to deserialize the account\"],[_t.AccountDidNotSerialize,\"Failed to serialize the account\"],[_t.AccountNotEnoughKeys,\"Not enough account keys given to the instruction\"],[_t.AccountNotMutable,\"The given account is not mutable\"],[_t.AccountOwnedByWrongProgram,\"The given account is owned by a different program than expected\"],[_t.InvalidProgramId,\"Program ID was not as expected\"],[_t.InvalidProgramExecutable,\"Program account is not executable\"],[_t.AccountNotSigner,\"The given account did not sign\"],[_t.AccountNotSystemOwned,\"The given account is not owned by the system program\"],[_t.AccountNotInitialized,\"The program expected this account to be already initialized\"],[_t.AccountNotProgramData,\"The given account is not a program data account\"],[_t.AccountNotAssociatedTokenAccount,\"The given account is not the associated token account\"],[_t.AccountSysvarMismatch,\"The given public key does not match the required sysvar\"],[_t.AccountReallocExceedsLimit,\"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\"],[_t.AccountDuplicateReallocs,\"The account was duplicated for more than one reallocation\"],[_t.StateInvalidAddress,\"The given state account does not have the correct address\"],[_t.DeclaredProgramIdMismatch,\"The declared program id does not match the actual program id\"],[_t.Deprecated,\"The API being used is deprecated and should no longer be used\"]]);\n/*! *****************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\nvar Et=function(){return Et=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var o in e=arguments[n])Object.prototype.hasOwnProperty.call(e,o)&&(t[o]=e[o]);return t},Et.apply(this,arguments)};function It(t){return t.toLowerCase()}var kt=[/([a-z0-9])([A-Z])/g,/([A-Z])([A-Z][a-z])/g],Mt=/[^A-Z0-9]+/gi;function xt(t,e,n){return e instanceof RegExp?t.replace(e,n):e.reduce((function(t,e){return t.replace(e,n)}),t)}function Pt(t,e){return void 0===e&&(e={}),function(t,e){void 0===e&&(e={});for(var n=e.splitRegexp,r=void 0===n?kt:n,o=e.stripRegexp,i=void 0===o?Mt:o,s=e.transform,a=void 0===s?It:s,c=e.delimiter,u=void 0===c?\" \":c,d=xt(xt(t,r,\"$1\\0$2\"),i,\"\\0\"),l=0,h=d.length;\"\\0\"===d.charAt(l);)l++;for(;\"\\0\"===d.charAt(h-1);)h--;return d.slice(l,h).split(\"\\0\").map(a).join(u)}(t,Et({delimiter:\".\"},e))}class Lt{static fieldLayout(t,e){const n=void 0!==t.name?camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t.name):void 0;switch(t.type){case\"bool\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.bool(n);case\"u8\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u8(n);case\"i8\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.i8(n);case\"u16\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u16(n);case\"i16\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.i16(n);case\"u32\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u32(n);case\"i32\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.i32(n);case\"f32\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.f32(n);case\"u64\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u64(n);case\"i64\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.i64(n);case\"f64\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.f64(n);case\"u128\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u128(n);case\"i128\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.i128(n);case\"bytes\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.vecU8(n);case\"string\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.str(n);case\"publicKey\":return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.publicKey(n);default:if(\"vec\"in t.type)return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.vec(Lt.fieldLayout({name:void 0,type:t.type.vec},e),n);if(\"option\"in t.type)return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.option(Lt.fieldLayout({name:void 0,type:t.type.option},e),n);if(\"defined\"in t.type){const r=t.type.defined;if(void 0===e)throw new gt(\"User defined types not provided\");const o=e.filter((t=>t.name===r));if(1!==o.length)throw new gt(`Type not found: ${JSON.stringify(t)}`);return Lt.typeDefLayout(o[0],e,n)}if(\"array\"in t.type){let r=t.type.array[0],o=t.type.array[1],i=Lt.fieldLayout({name:void 0,type:r},e);return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.array(i,o,n)}throw new Error(`Not yet implemented: ${t}`)}}static typeDefLayout(t,e=[],n){if(\"struct\"===t.type.kind){const r=t.type.fields.map((t=>Lt.fieldLayout(t,e)));return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct(r,n)}if(\"enum\"===t.type.kind){let r=t.type.variants.map((t=>{const n=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t.name);if(void 0===t.fields)return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([],n);const r=t.fields.map((t=>{if(!t.hasOwnProperty(\"name\"))throw new Error(\"Tuple enum variants not yet implemented.\");return Lt.fieldLayout(t,e)}));return _project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct(r,n)}));return void 0!==n?_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.rustEnum(r).replicate(n):_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.rustEnum(r,n)}throw new Error(`Unknown type kint: ${t}`)}}class Tt{constructor(t){this.idl=t,this.ixLayout=Tt.parseIxLayout(t);const e=new Map;t.instructions.forEach((t=>{const n=zt(\"global\",t.name);e.set(bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(n),{layout:this.ixLayout.get(t.name),name:t.name})})),t.state&&t.state.methods.map((t=>{const n=zt(\"state\",t.name);e.set(bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(n),{layout:this.ixLayout.get(t.name),name:t.name})})),this.sighashLayouts=e}encode(t,e){return this._encode(\"global\",t,e)}encodeState(t,e){return this._encode(\"state\",t,e)}_encode(e,n,r){const o=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1e3),i=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(n),s=this.ixLayout.get(i);if(!s)throw new Error(`Unknown method: ${i}`);const a=s.encode(r,o),c=o.slice(0,a);return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([zt(e,n),c])}static parseIxLayout(t){const e=(t.state?t.state.methods:[]).map((e=>{let n=e.args.map((e=>{var n,r;return Lt.fieldLayout(e,Array.from([...null!==(n=t.accounts)&&void 0!==n?n:[],...null!==(r=t.types)&&void 0!==r?r:[]]))}));const r=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e.name);return[r,_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct(n,r)]})).concat(t.instructions.map((e=>{let n=e.args.map((e=>{var n,r;return Lt.fieldLayout(e,Array.from([...null!==(n=t.accounts)&&void 0!==n?n:[],...null!==(r=t.types)&&void 0!==r?r:[]]))}));const r=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e.name);return[r,_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct(n,r)]})));return new Map(e)}decode(e,n=\"hex\"){\"string\"==typeof e&&(e=\"hex\"===n?buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(e,\"hex\"):bs58__WEBPACK_IMPORTED_MODULE_3___default().decode(e));let r=bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(e.slice(0,8)),o=e.slice(8);const i=this.sighashLayouts.get(r);return i?{data:i.layout.decode(o),name:i.name}:null}format(t,e){return Ct.format(t,e,this.idl)}}class Ct{static format(t,e,n){const r=n.instructions.filter((e=>t.name===e.name))[0];if(void 0===r)return console.error(\"Invalid instruction given\"),null;const o=r.args.map((e=>({name:e.name,type:Ct.formatIdlType(e.type),data:Ct.formatIdlData(e,t.data[e.name],n.types)}))),i=Ct.flattenIdlAccounts(r.accounts);return{args:o,accounts:e.map(((t,e)=>e<i.length?{name:i[e].name,...t}:{name:void 0,...t}))}}static formatIdlType(t){if(\"string\"==typeof t)return t;if(\"vec\"in t)return`Vec<${this.formatIdlType(t.vec)}>`;if(\"option\"in t)return`Option<${this.formatIdlType(t.option)}>`;if(\"defined\"in t)return t.defined;if(\"array\"in t)return`Array<${t.array[0]}; ${t.array[1]}>`;throw new Error(`Unknown IDL type: ${t}`)}static formatIdlData(t,e,n){if(\"string\"==typeof t.type)return e.toString();if(t.type.hasOwnProperty(\"vec\"))return\"[\"+e.map((e=>this.formatIdlData({name:\"\",type:t.type.vec},e))).join(\", \")+\"]\";if(t.type.hasOwnProperty(\"option\"))return null===e?\"null\":this.formatIdlData({name:\"\",type:t.type.option},e,n);if(t.type.hasOwnProperty(\"defined\")){if(void 0===n)throw new Error(\"User defined types not provided\");const r=n.filter((e=>e.name===t.type.defined));if(1!==r.length)throw new Error(`Type not found: ${t.type.defined}`);return Ct.formatIdlDataDefined(r[0],e,n)}return\"unknown\"}static formatIdlDataDefined(t,e,n){if(\"struct\"===t.type.kind){const r=t.type;return\"{ \"+Object.keys(e).map((t=>{const o=r.fields.filter((e=>e.name===t))[0];if(void 0===o)throw new Error(\"Unable to find type\");return t+\": \"+Ct.formatIdlData(o,e[t],n)})).join(\", \")+\" }\"}if(0===t.type.variants.length)return\"{}\";if(t.type.variants[0].name){const r=t.type.variants,o=Object.keys(e)[0],i=e[o],s=Object.keys(i).map((t=>{var e;const s=i[t],a=null===(e=r[o])||void 0===e?void 0:e.filter((e=>e.name===t))[0];if(void 0===a)throw new Error(\"Unable to find variant\");return t+\": \"+Ct.formatIdlData(a,s,n)})).join(\", \"),a=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(o,{pascalCase:!0});return 0===s.length?a:`${a} { ${s} }`}return\"Tuple formatting not yet implemented\"}static flattenIdlAccounts(t,e){return t.map((t=>{const n=function(t){const e=t.replace(/([A-Z])/g,\" $1\");return e.charAt(0).toUpperCase()+e.slice(1)}(t.name);if(t.hasOwnProperty(\"accounts\")){const r=e?`${e} > ${n}`:n;return Ct.flattenIdlAccounts(t.accounts,r)}return{...t,name:e?`${e} > ${n}`:n}})).flat()}}function zt(e,n){var r;let o=`${e}:${void 0===r&&(r={}),Pt(n,Et({delimiter:\"_\"},r))}`;return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256.digest(o)).slice(0,8)}function Bt(t,e){if(\"enum\"===e.type.kind){let n=e.type.variants.map((e=>void 0===e.fields?0:e.fields.map((e=>{if(\"object\"!=typeof e||!(\"name\"in e))throw new Error(\"Tuple enum variants not yet implemented.\");return Ot(t,e.type)})).reduce(((t,e)=>t+e))));return Math.max(...n)+1}return void 0===e.type.fields?0:e.type.fields.map((e=>Ot(t,e.type))).reduce(((t,e)=>t+e),0)}function Ot(t,e){var n,r;switch(e){case\"bool\":case\"u8\":case\"i8\":case\"bytes\":case\"string\":return 1;case\"i16\":case\"u16\":return 2;case\"u32\":case\"i32\":case\"f32\":return 4;case\"u64\":case\"i64\":case\"f64\":return 8;case\"u128\":case\"i128\":return 16;case\"publicKey\":return 32;default:if(\"vec\"in e)return 1;if(\"option\"in e)return 1+Ot(t,e.option);if(\"coption\"in e)return 4+Ot(t,e.coption);if(\"defined\"in e){const o=null!==(r=null===(n=t.types)||void 0===n?void 0:n.filter((t=>t.name===e.defined)))&&void 0!==r?r:[];if(1!==o.length)throw new gt(`Type not found: ${JSON.stringify(e)}`);return Bt(t,o[0])}if(\"array\"in e){let n=e.array[0],r=e.array[1];return Ot(t,n)*r}throw new Error(`Invalid type ${JSON.stringify(e)}`)}}const Dt=8;class Nt{constructor(t){if(void 0===t.accounts)return void(this.accountLayouts=new Map);const e=t.accounts.map((e=>[e.name,Lt.typeDefLayout(e,t.types)]));this.accountLayouts=new Map(e),this.idl=t}async encode(e,n){const r=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1e3),o=this.accountLayouts.get(e);if(!o)throw new Error(`Unknown account: ${e}`);const i=o.encode(n,r);let s=r.slice(0,i),a=Nt.accountDiscriminator(e);return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([a,s])}decode(t,e){if(Nt.accountDiscriminator(t).compare(e.slice(0,8)))throw new Error(\"Invalid account discriminator\");return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){const n=e.slice(8),r=this.accountLayouts.get(t);if(!r)throw new Error(`Unknown account: ${t}`);return r.decode(n)}memcmp(e,n){const r=Nt.accountDiscriminator(e);return{offset:0,bytes:bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(n?buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([r,n]):r)}}size(t){var e;return 8+(null!==(e=Bt(this.idl,t))&&void 0!==e?e:0)}static accountDiscriminator(e){return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256.digest(`account:${camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e,{pascalCase:!0})}`)).slice(0,8)}}class Rt{constructor(t){if(void 0===t.events)return void(this.layouts=new Map);const e=t.events.map((e=>{let n={name:e.name,type:{kind:\"struct\",fields:e.fields.map((t=>({name:t.name,type:t.type})))}};return[e.name,Lt.typeDefLayout(n,t.types)]}));this.layouts=new Map(e),this.discriminators=new Map(void 0===t.events?[]:t.events.map((t=>[base64_js__WEBPACK_IMPORTED_MODULE_4__.fromByteArray(Vt(t.name)),t.name])))}decode(e){let n;try{n=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(base64_js__WEBPACK_IMPORTED_MODULE_4__.toByteArray(e))}catch(t){return null}const r=base64_js__WEBPACK_IMPORTED_MODULE_4__.fromByteArray(n.slice(0,8)),o=this.discriminators.get(r);if(void 0===o)return null;const i=this.layouts.get(o);if(!i)throw new Error(`Unknown event: ${o}`);return{data:i.decode(n.slice(8)),name:o}}}function Vt(e){return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256.digest(`event:${e}`)).slice(0,8)}class Ut{constructor(t){if(void 0===t.state)throw new Error(\"Idl state not defined.\");this.layout=Lt.typeDefLayout(t.state.struct,t.types)}async encode(e,n){const r=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1e3),o=this.layout.encode(n,r),i=await jt(e),s=r.slice(0,o);return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([i,s])}decode(t){const e=t.slice(8);return this.layout.decode(e)}}async function jt(e){let n=mt(\"anchor-deprecated-state\")?\"account\":\"state\";return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256.digest(`${n}:${e}`)).slice(0,8)}class $t{constructor(t){if(void 0===t.types)return void(this.typeLayouts=new Map);const e=t.types.map((e=>[e.name,Lt.typeDefLayout(e,t.types)]));this.typeLayouts=new Map(e),this.idl=t}encode(e,n){const r=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1e3),o=this.typeLayouts.get(e);if(!o)throw new Error(`Unknown type: ${e}`);const i=o.encode(n,r);return r.slice(0,i)}decode(t,e){const n=this.typeLayouts.get(t);if(!n)throw new Error(`Unknown type: ${t}`);return n.decode(e)}}class Kt{constructor(t){this.instruction=new Tt(t),this.accounts=new Nt(t),this.events=new Rt(t),t.state&&(this.state=new Ut(t)),this.types=new $t(t)}}var qt=\"undefined\"!=typeof globalThis?globalThis:\"undefined\"!=typeof window?window:\"undefined\"!=typeof __webpack_require__.g?__webpack_require__.g:\"undefined\"!=typeof self?self:{};function Ft(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}class Wt{constructor(t,e){if(!Number.isInteger(t))throw new TypeError(\"span must be an integer\");this.span=t,this.property=e}makeDestinationObject(){return{}}decode(t,e){throw new Error(\"Layout is abstract\")}encode(t,e,n){throw new Error(\"Layout is abstract\")}getSpan(t,e){if(0>this.span)throw new RangeError(\"indeterminate span\");return this.span}replicate(t){const e=Object.create(this.constructor.prototype);return Object.assign(e,this),e.property=t,e}fromArray(t){}}var Gt=Wt;class Ht extends Wt{isCount(){throw new Error(\"ExternalLayout is abstract\")}}class Jt extends Ht{constructor(t,e,n){if(!(t instanceof Wt))throw new TypeError(\"layout must be a Layout\");if(void 0===e)e=0;else if(!Number.isInteger(e))throw new TypeError(\"offset must be integer or undefined\");super(t.span,n||t.property),this.layout=t,this.offset=e}isCount(){return this.layout instanceof Zt||this.layout instanceof Xt}decode(t,e){return void 0===e&&(e=0),this.layout.decode(t,e+this.offset)}encode(t,e,n){return void 0===n&&(n=0),this.layout.encode(t,e,n+this.offset)}}class Zt extends Wt{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e){return void 0===e&&(e=0),t.readUIntLE(e,this.span)}encode(t,e,n){return void 0===n&&(n=0),e.writeUIntLE(t,n,this.span),this.span}}class Xt extends Wt{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e){return void 0===e&&(e=0),t.readUIntBE(e,this.span)}encode(t,e,n){return void 0===n&&(n=0),e.writeUIntBE(t,n,this.span),this.span}}const Qt=Math.pow(2,32);function Yt(t){const e=Math.floor(t/Qt);return{hi32:e,lo32:t-e*Qt}}function te(t,e){return t*Qt+e}class ee extends Wt{constructor(t){super(8,t)}decode(t,e){void 0===e&&(e=0);const n=t.readUInt32LE(e);return te(t.readUInt32LE(e+4),n)}encode(t,e,n){void 0===n&&(n=0);const r=Yt(t);return e.writeUInt32LE(r.lo32,n),e.writeUInt32LE(r.hi32,n+4),8}}class ne extends Wt{constructor(t){super(8,t)}decode(t,e){void 0===e&&(e=0);const n=t.readUInt32LE(e);return te(t.readInt32LE(e+4),n)}encode(t,e,n){void 0===n&&(n=0);const r=Yt(t);return e.writeUInt32LE(r.lo32,n),e.writeInt32LE(r.hi32,n+4),8}}class re extends Wt{constructor(t,e,n){if(!Array.isArray(t)||!t.reduce(((t,e)=>t&&e instanceof Wt),!0))throw new TypeError(\"fields must be array of Layout instances\");\"boolean\"==typeof e&&void 0===n&&(n=e,e=void 0);for(const e of t)if(0>e.span&&void 0===e.property)throw new Error(\"fields cannot contain unnamed variable-length layout\");let r=-1;try{r=t.reduce(((t,e)=>t+e.getSpan()),0)}catch(t){}super(r,e),this.fields=t,this.decodePrefixes=!!n}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);let n=0;try{n=this.fields.reduce(((n,r)=>{const o=r.getSpan(t,e);return e+=o,n+o}),0)}catch(t){throw new RangeError(\"indeterminate span\")}return n}decode(t,e){void 0===e&&(e=0);const n=this.makeDestinationObject();for(const r of this.fields)if(void 0!==r.property&&(n[r.property]=r.decode(t,e)),e+=r.getSpan(t,e),this.decodePrefixes&&t.length===e)break;return n}encode(t,e,n){void 0===n&&(n=0);const r=n;let o=0,i=0;for(const r of this.fields){let s=r.span;if(i=0<s?s:0,void 0!==r.property){const o=t[r.property];void 0!==o&&(i=r.encode(o,e,n),0>s&&(s=r.getSpan(e,n)))}o=n,n+=s}return o+i-r}fromArray(t){const e=this.makeDestinationObject();for(const n of this.fields)void 0!==n.property&&0<t.length&&(e[n.property]=t.shift());return e}layoutFor(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");for(const e of this.fields)if(e.property===t)return e}offsetOf(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");let e=0;for(const n of this.fields){if(n.property===t)return e;0>n.span?e=-1:0<=e&&(e+=n.span)}}}class oe{constructor(t){this.property=t}decode(){throw new Error(\"UnionDiscriminator is abstract\")}encode(){throw new Error(\"UnionDiscriminator is abstract\")}}class ie extends oe{constructor(t,e){if(!(t instanceof Ht&&t.isCount()))throw new TypeError(\"layout must be an unsigned integer ExternalLayout\");super(e||t.property||\"variant\"),this.layout=t}decode(t,e){return this.layout.decode(t,e)}encode(t,e,n){return this.layout.encode(t,e,n)}}class se extends Wt{constructor(t,e,n){const r=t instanceof Zt||t instanceof Xt;if(r)t=new ie(new Jt(t));else if(t instanceof Ht&&t.isCount())t=new ie(t);else if(!(t instanceof oe))throw new TypeError(\"discr must be a UnionDiscriminator or an unsigned integer layout\");if(void 0===e&&(e=null),!(null===e||e instanceof Wt))throw new TypeError(\"defaultLayout must be null or a Layout\");if(null!==e){if(0>e.span)throw new Error(\"defaultLayout must have constant span\");void 0===e.property&&(e=e.replicate(\"content\"))}let o=-1;e&&(o=e.span,0<=o&&r&&(o+=t.layout.span)),super(o,n),this.discriminator=t,this.usesPrefixDiscriminator=r,this.defaultLayout=e,this.registry={};let i=this.defaultGetSourceVariant.bind(this);this.getSourceVariant=function(t){return i(t)},this.configGetSourceVariant=function(t){i=t.bind(this)}}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);const n=this.getVariant(t,e);if(!n)throw new Error(\"unable to determine span for unrecognized variant\");return n.getSpan(t,e)}defaultGetSourceVariant(t){if(t.hasOwnProperty(this.discriminator.property)){if(this.defaultLayout&&t.hasOwnProperty(this.defaultLayout.property))return;const e=this.registry[t[this.discriminator.property]];if(e&&(!e.layout||t.hasOwnProperty(e.property)))return e}else for(const e in this.registry){const n=this.registry[e];if(t.hasOwnProperty(n.property))return n}throw new Error(\"unable to infer src variant\")}decode(t,e){let n;void 0===e&&(e=0);const r=this.discriminator,o=r.decode(t,e);let i=this.registry[o];if(void 0===i){let s=0;i=this.defaultLayout,this.usesPrefixDiscriminator&&(s=r.layout.span),n=this.makeDestinationObject(),n[r.property]=o,n[i.property]=this.defaultLayout.decode(t,e+s)}else n=i.decode(t,e);return n}encode(t,e,n){void 0===n&&(n=0);const r=this.getSourceVariant(t);if(void 0===r){const r=this.discriminator,o=this.defaultLayout;let i=0;return this.usesPrefixDiscriminator&&(i=r.layout.span),r.encode(t[r.property],e,n),i+o.encode(t[o.property],e,n+i)}return r.encode(t,e,n)}addVariant(t,e,n){const r=new ae(this,t,e,n);return this.registry[t]=r,r}getVariant(t,e){let n=t;return Buffer.isBuffer(t)&&(void 0===e&&(e=0),n=this.discriminator.decode(t,e)),this.registry[n]}}class ae extends Wt{constructor(t,e,n,r){if(!(t instanceof se))throw new TypeError(\"union must be a Union\");if(!Number.isInteger(e)||0>e)throw new TypeError(\"variant must be a (non-negative) integer\");if(\"string\"==typeof n&&void 0===r&&(r=n,n=null),n){if(!(n instanceof Wt))throw new TypeError(\"layout must be a Layout\");if(null!==t.defaultLayout&&0<=n.span&&n.span>t.defaultLayout.span)throw new Error(\"variant span exceeds span of containing union\");if(\"string\"!=typeof r)throw new TypeError(\"variant must have a String property\")}let o=t.span;0>t.span&&(o=n?n.span:0,0<=o&&t.usesPrefixDiscriminator&&(o+=t.discriminator.layout.span)),super(o,r),this.union=t,this.variant=e,this.layout=n||null}getSpan(t,e){if(0<=this.span)return this.span;void 0===e&&(e=0);let n=0;return this.union.usesPrefixDiscriminator&&(n=this.union.discriminator.layout.span),n+this.layout.getSpan(t,e+n)}decode(t,e){const n=this.makeDestinationObject();if(void 0===e&&(e=0),this!==this.union.getVariant(t,e))throw new Error(\"variant mismatch\");let r=0;return this.union.usesPrefixDiscriminator&&(r=this.union.discriminator.layout.span),this.layout?n[this.property]=this.layout.decode(t,e+r):this.property?n[this.property]=!0:this.union.usesPrefixDiscriminator&&(n[this.union.discriminator.property]=this.variant),n}encode(t,e,n){void 0===n&&(n=0);let r=0;if(this.union.usesPrefixDiscriminator&&(r=this.union.discriminator.layout.span),this.layout&&!t.hasOwnProperty(this.property))throw new TypeError(\"variant lacks property \"+this.property);this.union.discriminator.encode(this.variant,e,n);let o=r;if(this.layout&&(this.layout.encode(t[this.property],e,n+r),o+=this.layout.getSpan(e,n+r),0<=this.union.span&&o>this.union.span))throw new Error(\"encoded variant overruns containing union\");return o}fromArray(t){if(this.layout)return this.layout.fromArray(t)}}class ce extends Wt{constructor(t,e){if(!(t instanceof Ht&&t.isCount()||Number.isInteger(t)&&0<=t))throw new TypeError(\"length must be positive integer or an unsigned integer ExternalLayout\");let n=-1;t instanceof Ht||(n=t),super(n,e),this.length=t}getSpan(t,e){let n=this.span;return 0>n&&(n=this.length.decode(t,e)),n}decode(t,e){void 0===e&&(e=0);let n=this.span;return 0>n&&(n=this.length.decode(t,e)),t.slice(e,e+n)}encode(t,e,n){let r=this.length;if(this.length instanceof Ht&&(r=t.length),!Buffer.isBuffer(t)||r!==t.length)throw new TypeError((o=\"Blob.encode\",((i=this).property?o+\"[\"+i.property+\"]\":o)+\" requires (length \"+r+\") Buffer as src\"));var o,i;if(n+r>e.length)throw new RangeError(\"encoding overruns Buffer\");return e.write(t.toString(\"hex\"),n,r,\"hex\"),this.length instanceof Ht&&this.length.encode(r,e,n),r}}var ue=(t,e,n)=>new Jt(t,e,n),de=t=>new Zt(1,t),le=t=>new Zt(4,t),he=t=>new ee(t),pe=t=>new ne(t),fe=(t,e,n)=>new re(t,e,n),me=(t,e,n)=>new se(t,e,n),ye=(t,e)=>new ce(t,e);class ge{constructor(t){}encode(t,n){switch(camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t)){case\"initializeMint\":return function({decimals:t,mintAuthority:n,freezeAuthority:r}){return be({initializeMint:{decimals:t,mintAuthority:n.toBuffer(),freezeAuthorityOption:!!r,freezeAuthority:(r||_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey[\"default\"]).toBuffer()}})}(n);case\"initializeAccount\":return be({initializeAccount:{}});case\"initializeMultisig\":return function({m:t}){return be({initializeMultisig:{m:t}})}(n);case\"transfer\":return function({amount:t}){return be({transfer:{amount:t}})}(n);case\"approve\":return function({amount:t}){return be({approve:{amount:t}})}(n);case\"revoke\":return be({revoke:{}});case\"setAuthority\":return function({authorityType:t,newAuthority:e}){return be({setAuthority:{authorityType:t,newAuthority:e}})}(n);case\"mintTo\":return function({amount:t}){return be({mintTo:{amount:t}})}(n);case\"burn\":return function({amount:t}){return be({burn:{amount:t}})}(n);case\"closeAccount\":return be({closeAccount:{}});case\"freezeAccount\":return be({freezeAccount:{}});case\"thawAccount\":return be({thawAccount:{}});case\"transferChecked\":return function({amount:t,decimals:e}){return be({transferChecked:{amount:t,decimals:e}})}(n);case\"approvedChecked\":return function({amount:t,decimals:e}){return be({approveChecked:{amount:t,decimals:e}})}(n);case\"mintToChecked\":return function({amount:t,decimals:e}){return be({mintToChecked:{amount:t,decimals:e}})}(n);case\"burnChecked\":return function({amount:t,decimals:e}){return be({burnChecked:{amount:t,decimals:e}})}(n);case\"intializeAccount2\":return function({authority:t}){return be({initilaizeAccount2:{authority:t}})}(n);case\"syncNative\":return be({syncNative:{}});case\"initializeAccount3\":return function({authority:t}){return be({initializeAccount3:{authority:t}})}(n);case\"initializeMultisig2\":return function({m:t}){return be({initializeMultisig2:{m:t}})}(n);case\"initializeMint2\":return function({decimals:t,mintAuthority:e,freezeAuthority:n}){return be({encodeInitializeMint2:{decimals:t,mintAuthority:e,freezeAuthority:n}})}(n);default:throw new Error(`Invalid instruction: ${t}`)}}encodeState(t,e){throw new Error(\"SPL token does not have state\")}}const we=me(de(\"instruction\"));function ve(t){return ye(32,t)}function be(t){let e=Buffer.alloc(Ae),n=we.encode(t,e);return e.slice(0,n)}we.addVariant(0,fe([de(\"decimals\"),ye(32,\"mintAuthority\"),de(\"freezeAuthorityOption\"),ve(\"freezeAuthority\")]),\"initializeMint\"),we.addVariant(1,fe([]),\"initializeAccount\"),we.addVariant(2,fe([de(\"m\")]),\"initializeMultisig\"),we.addVariant(3,fe([he(\"amount\")]),\"transfer\"),we.addVariant(4,fe([he(\"amount\")]),\"approve\"),we.addVariant(5,fe([]),\"revoke\"),we.addVariant(6,fe([de(\"authorityType\"),de(\"newAuthorityOption\"),ve(\"newAuthority\")]),\"setAuthority\"),we.addVariant(7,fe([he(\"amount\")]),\"mintTo\"),we.addVariant(8,fe([he(\"amount\")]),\"burn\"),we.addVariant(9,fe([]),\"closeAccount\"),we.addVariant(10,fe([]),\"freezeAccount\"),we.addVariant(11,fe([]),\"thawAccount\"),we.addVariant(12,fe([he(\"amount\"),de(\"decimals\")]),\"transferChecked\"),we.addVariant(13,fe([he(\"amount\"),de(\"decimals\")]),\"approvedChecked\"),we.addVariant(14,fe([he(\"amount\"),de(\"decimals\")]),\"mintToChecked\"),we.addVariant(15,fe([he(\"amount\"),de(\"decimals\")]),\"burnedChecked\"),we.addVariant(16,fe([ve(\"authority\")]),\"InitializeAccount2\"),we.addVariant(17,fe([]),\"syncNative\"),we.addVariant(18,fe([ve(\"authority\")]),\"initializeAccount3\"),we.addVariant(19,fe([de(\"m\")]),\"initializeMultisig2\"),we.addVariant(20,fe([de(\"decimals\"),ve(\"mintAuthority\"),de(\"freezeAuthorityOption\"),ve(\"freezeAuthority\")]),\"initializeMint2\");const Ae=Math.max(...Object.values(we.registry).map((t=>t.span)));class _e{constructor(t){}encode(t,e){throw new Error(\"SPL token does not have state\")}decode(t){throw new Error(\"SPL token does not have state\")}}function Se(t){return new ke(ye(8),(t=>Le.fromBuffer(t)),(t=>t.toBuffer()),t)}function Ee(t){return new ke(ye(32),(t=>new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(t)),(t=>t.toBuffer()),t)}function Ie(t,e){return new Me(t,e)}class ke extends Gt{constructor(t,e,n,r){super(t.span,r),this.layout=t,this.decoder=e,this.encoder=n}decode(t,e){return this.decoder(this.layout.decode(t,e))}encode(t,e,n){return this.layout.encode(this.encoder(t),e,n)}getSpan(t,e){return this.layout.getSpan(t,e)}}class Me extends Gt{constructor(t,e){super(-1,e),this.layout=t,this.discriminator=le()}encode(t,e,n=0){return null==t?this.layout.span+this.discriminator.encode(0,e,n):(this.discriminator.encode(1,e,n),this.layout.encode(t,e,n+4)+4)}decode(t,e=0){const n=this.discriminator.decode(t,e);if(0===n)return null;if(1===n)return this.layout.decode(t,e+4);throw new Error(\"Invalid coption \"+this.layout.property)}getSpan(t,e=0){return this.layout.getSpan(t,e+4)+4}}function xe(t){if(0===t)return!1;if(1===t)return!0;throw new Error(\"Invalid bool: \"+t)}function Pe(t){return t?1:0}class Le extends (bn_js__WEBPACK_IMPORTED_MODULE_2___default()){toBuffer(){const t=super.toArray().reverse(),e=Buffer.from(t);if(8===e.length)return e;if(e.length>=8)throw new Error(\"u64 too large\");const n=Buffer.alloc(8);return e.copy(n),n}static fromBuffer(t){if(8!==t.length)throw new Error(`Invalid buffer length: ${t.length}`);return new Le([...t].reverse().map((t=>`00${t.toString(16)}`.slice(-2))).join(\"\"),16)}}class Te{constructor(t){this.idl=t}async encode(t,e){switch(t){case\"token\":{const t=Buffer.alloc(165),n=Be.encode(e,t);return t.slice(0,n)}case\"mint\":{const t=Buffer.alloc(82),n=Ce.encode(e,t);return t.slice(0,n)}default:throw new Error(`Invalid account name: ${t}`)}}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){switch(t){case\"token\":return function(t){return Be.decode(t)}(e);case\"mint\":return function(t){return Ce.decode(t)}(e);default:throw new Error(`Invalid account name: ${t}`)}}memcmp(t,e){switch(t){case\"token\":return{dataSize:165};case\"mint\":return{dataSize:82};default:throw new Error(`Invalid account name: ${t}`)}}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}const Ce=fe([Ie(Ee(),\"mintAuthority\"),Se(\"supply\"),de(\"decimals\"),(ze=\"isInitialized\",new ke(de(),xe,Pe,ze)),Ie(Ee(),\"freezeAuthority\")]);var ze;const Be=fe([Ee(\"mint\"),Ee(\"authority\"),Se(\"amount\"),Ie(Ee(),\"delegate\"),de(\"state\"),Ie(Se(),\"isNative\"),Se(\"delegatedAmount\"),Ie(Ee(),\"closeAuthority\")]);class Oe{constructor(t){}decode(t){throw new Error(\"SPL token program does not have events\")}}class De{constructor(t){}encode(t,e){throw new Error(\"SPL token does not have user-defined types\")}decode(t,e){throw new Error(\"SPL token does not have user-defined types\")}}class Ne{constructor(t){this.instruction=new ge(t),this.accounts=new Te(t),this.events=new Oe(t),this.state=new _e(t),this.types=new De(t)}}class Re{constructor(t){}encode(t,e){switch(camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t)){case\"createAccount\":return function({lamports:t,space:e,owner:n}){return Ke({createAccount:{lamports:t,space:e,owner:n.toBuffer()}})}(e);case\"assign\":return function({owner:t}){return Ke({assign:{owner:t.toBuffer()}})}(e);case\"transfer\":return function({lamports:t}){return Ke({transfer:{lamports:t}})}(e);case\"createAccountWithSeed\":return function({base:t,seed:e,lamports:n,space:r,owner:o}){return Ke({createAccountWithSeed:{base:t.toBuffer(),seed:e,lamports:n,space:r,owner:o.toBuffer()}},$e.getVariant(3).span+e.length)}(e);case\"advanceNonceAccount\":return function({authorized:t}){return Ke({advanceNonceAccount:{authorized:t.toBuffer()}})}(e);case\"withdrawNonceAccount\":return function({lamports:t}){return Ke({withdrawNonceAccount:{lamports:t}})}(e);case\"initializeNonceAccount\":return function({authorized:t}){return Ke({initializeNonceAccount:{authorized:t.toBuffer()}})}(e);case\"authorizeNonceAccount\":return function({authorized:t}){return Ke({authorizeNonceAccount:{authorized:t.toBuffer()}})}(e);case\"allocate\":return function({space:t}){return Ke({allocate:{space:t}})}(e);case\"allocateWithSeed\":return function({base:t,seed:e,space:n,owner:r}){return Ke({allocateWithSeed:{base:t.toBuffer(),seed:e,space:n,owner:r.toBuffer()}},$e.getVariant(9).span+e.length)}(e);case\"assignWithSeed\":return function({base:t,seed:e,owner:n}){return Ke({assignWithSeed:{base:t.toBuffer(),seed:e,owner:n.toBuffer()}},$e.getVariant(10).span+e.length)}(e);case\"transferWithSeed\":return function({lamports:t,seed:e,owner:n}){return Ke({transferWithSeed:{lamports:t,seed:e,owner:n.toBuffer()}},$e.getVariant(11).span+e.length)}(e);default:throw new Error(`Invalid instruction: ${t}`)}}encodeState(t,e){throw new Error(\"System does not have state\")}}class Ve extends Gt{constructor(t){super(-1,t),this.property=t,this.layout=fe([le(\"length\"),le(\"lengthPadding\"),ye(ue(le(),-8),\"chars\")],this.property)}encode(t,e,n=0){if(null==t)return this.layout.span;const r={chars:Buffer.from(t,\"utf8\")};return this.layout.encode(r,e,n)}decode(t,e=0){return this.layout.decode(t,e).chars.toString()}getSpan(t,e=0){return le().span+le().span+new (bn_js__WEBPACK_IMPORTED_MODULE_2___default())(new Uint8Array(t).slice(e,e+4),10,\"le\").toNumber()}}function Ue(t){return new Ve(t)}function je(t){return ye(32,t)}const $e=me(le(\"instruction\"));function Ke(t,e){const n=Buffer.alloc(null!=e?e:qe),r=$e.encode(t,n);return void 0===e?n.slice(0,r):n}$e.addVariant(0,fe([pe(\"lamports\"),pe(\"space\"),je(\"owner\")]),\"createAccount\"),$e.addVariant(1,fe([je(\"owner\")]),\"assign\"),$e.addVariant(2,fe([pe(\"lamports\")]),\"transfer\"),$e.addVariant(3,fe([je(\"base\"),Ue(\"seed\"),pe(\"lamports\"),pe(\"space\"),je(\"owner\")]),\"createAccountWithSeed\"),$e.addVariant(4,fe([je(\"authorized\")]),\"advanceNonceAccount\"),$e.addVariant(5,fe([pe(\"lamports\")]),\"withdrawNonceAccount\"),$e.addVariant(6,fe([je(\"authorized\")]),\"initializeNonceAccount\"),$e.addVariant(7,fe([je(\"authorized\")]),\"authorizeNonceAccount\"),$e.addVariant(8,fe([pe(\"space\")]),\"allocate\"),$e.addVariant(9,fe([je(\"base\"),Ue(\"seed\"),pe(\"space\"),je(\"owner\")]),\"allocateWithSeed\"),$e.addVariant(10,fe([je(\"base\"),Ue(\"seed\"),je(\"owner\")]),\"assignWithSeed\"),$e.addVariant(11,fe([pe(\"lamports\"),Ue(\"seed\"),je(\"owner\")]),\"transferWithSeed\");const qe=Math.max(...Object.values($e.registry).map((t=>t.span)));class Fe{constructor(t){}encode(t,e){throw new Error(\"System does not have state\")}decode(t){throw new Error(\"System does not have state\")}}class We{constructor(t){this.idl=t}async encode(t,e){if(\"nonce\"===t){const t=Buffer.alloc(_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.NONCE_ACCOUNT_LENGTH),n=Je.encode(e,t);return t.slice(0,n)}throw new Error(`Invalid account name: ${t}`)}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){if(\"nonce\"===t)return function(t){return Je.decode(t)}(e);throw new Error(`Invalid account name: ${t}`)}memcmp(t,e){if(\"nonce\"===t)return{dataSize:_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.NONCE_ACCOUNT_LENGTH};throw new Error(`Invalid account name: ${t}`)}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}class Ge extends Gt{constructor(t,e,n,r){super(t.span,r),this.layout=t,this.decoder=e,this.encoder=n}decode(t,e){return this.decoder(this.layout.decode(t,e))}encode(t,e,n){return this.layout.encode(this.encoder(t),e,n)}getSpan(t,e){return this.layout.getSpan(t,e)}}function He(t){return new Ge(ye(32),(t=>new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(t)),(t=>t.toBuffer()),t)}const Je=fe([le(\"version\"),le(\"state\"),He(\"authorizedPubkey\"),He(\"nonce\"),fe([he(\"lamportsPerSignature\")],\"feeCalculator\")]);class Ze{constructor(t){}decode(t){throw new Error(\"System program does not have events\")}}class Xe{constructor(t){}encode(t,e){throw new Error(\"System does not have user-defined types\")}decode(t,e){throw new Error(\"System does not have user-defined types\")}}class Qe{constructor(t){this.instruction=new Re(t),this.accounts=new We(t),this.events=new Ze(t),this.state=new Fe(t),this.types=new Xe(t)}}var Ye=Object.freeze({__proto__:null,hash:function(t){return (0,js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256)(t)}});function tn(n,r,o){const i=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([n.toBuffer(),buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(r),o.toBuffer()]),s=js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256.digest(i);return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(s))}function en(n,r){let o=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(0);n.forEach((function(e){if(e.length>32)throw new TypeError(\"Max seed length exceeded\");o=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([o,rn(e)])})),o=buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([o,r.toBuffer(),buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(\"ProgramDerivedAddress\")]);let i=(0,js_sha256__WEBPACK_IMPORTED_MODULE_6__.sha256)(new Uint8Array(o)),s=new (bn_js__WEBPACK_IMPORTED_MODULE_2___default())(i,16).toArray(void 0,32);if(_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.isOnCurve(new Uint8Array(s)))throw new Error(\"Invalid seeds, address must fall off the curve\");return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(s)}function nn(e,n){let r,o=255;for(;0!=o;){try{r=en(e.concat(buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([o])),n)}catch(t){if(t instanceof TypeError)throw t;o--;continue}return[r,o]}throw new Error(\"Unable to find a viable program address nonce\")}const rn=e=>e instanceof buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer?e:e instanceof Uint8Array?buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(e.buffer,e.byteOffset,e.byteLength):buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(e);async function on(n,...r){let o=[buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([97,110,99,104,111,114])];r.forEach((e=>{o.push(e instanceof buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer?e:L(e).toBuffer())}));const[i]=await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress(o,L(n));return i}var sn=Object.freeze({__proto__:null,createWithSeedSync:tn,createProgramAddressSync:en,findProgramAddressSync:nn,associated:on});const an=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\"),cn=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");var un=Object.freeze({__proto__:null,TOKEN_PROGRAM_ID:an,ASSOCIATED_PROGRAM_ID:cn,associatedAddress:async function({mint:t,owner:n}){return(await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress([n.toBuffer(),an.toBuffer(),t.toBuffer()],cn))[0]}}),dn={exports:{}};!function(t,e){var n=\"undefined\"!=typeof self?self:qt,r=function(){function t(){this.fetch=!1,this.DOMException=n.DOMException}return t.prototype=n,new t}();!function(t){!function(e){var n=\"URLSearchParams\"in t,r=\"Symbol\"in t&&\"iterator\"in Symbol,o=\"FileReader\"in t&&\"Blob\"in t&&function(){try{return new Blob,!0}catch(t){return!1}}(),i=\"FormData\"in t,s=\"ArrayBuffer\"in t;if(s)var a=[\"[object Int8Array]\",\"[object Uint8Array]\",\"[object Uint8ClampedArray]\",\"[object Int16Array]\",\"[object Uint16Array]\",\"[object Int32Array]\",\"[object Uint32Array]\",\"[object Float32Array]\",\"[object Float64Array]\"],c=ArrayBuffer.isView||function(t){return t&&a.indexOf(Object.prototype.toString.call(t))>-1};function u(t){if(\"string\"!=typeof t&&(t=String(t)),/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(t))throw new TypeError(\"Invalid character in header field name\");return t.toLowerCase()}function d(t){return\"string\"!=typeof t&&(t=String(t)),t}function l(t){var e={next:function(){var e=t.shift();return{done:void 0===e,value:e}}};return r&&(e[Symbol.iterator]=function(){return e}),e}function h(t){this.map={},t instanceof h?t.forEach((function(t,e){this.append(e,t)}),this):Array.isArray(t)?t.forEach((function(t){this.append(t[0],t[1])}),this):t&&Object.getOwnPropertyNames(t).forEach((function(e){this.append(e,t[e])}),this)}function p(t){if(t.bodyUsed)return Promise.reject(new TypeError(\"Already read\"));t.bodyUsed=!0}function f(t){return new Promise((function(e,n){t.onload=function(){e(t.result)},t.onerror=function(){n(t.error)}}))}function m(t){var e=new FileReader,n=f(e);return e.readAsArrayBuffer(t),n}function y(t){if(t.slice)return t.slice(0);var e=new Uint8Array(t.byteLength);return e.set(new Uint8Array(t)),e.buffer}function g(){return this.bodyUsed=!1,this._initBody=function(t){var e;this._bodyInit=t,t?\"string\"==typeof t?this._bodyText=t:o&&Blob.prototype.isPrototypeOf(t)?this._bodyBlob=t:i&&FormData.prototype.isPrototypeOf(t)?this._bodyFormData=t:n&&URLSearchParams.prototype.isPrototypeOf(t)?this._bodyText=t.toString():s&&o&&((e=t)&&DataView.prototype.isPrototypeOf(e))?(this._bodyArrayBuffer=y(t.buffer),this._bodyInit=new Blob([this._bodyArrayBuffer])):s&&(ArrayBuffer.prototype.isPrototypeOf(t)||c(t))?this._bodyArrayBuffer=y(t):this._bodyText=t=Object.prototype.toString.call(t):this._bodyText=\"\",this.headers.get(\"content-type\")||(\"string\"==typeof t?this.headers.set(\"content-type\",\"text/plain;charset=UTF-8\"):this._bodyBlob&&this._bodyBlob.type?this.headers.set(\"content-type\",this._bodyBlob.type):n&&URLSearchParams.prototype.isPrototypeOf(t)&&this.headers.set(\"content-type\",\"application/x-www-form-urlencoded;charset=UTF-8\"))},o&&(this.blob=function(){var t=p(this);if(t)return t;if(this._bodyBlob)return Promise.resolve(this._bodyBlob);if(this._bodyArrayBuffer)return Promise.resolve(new Blob([this._bodyArrayBuffer]));if(this._bodyFormData)throw new Error(\"could not read FormData body as blob\");return Promise.resolve(new Blob([this._bodyText]))},this.arrayBuffer=function(){return this._bodyArrayBuffer?p(this)||Promise.resolve(this._bodyArrayBuffer):this.blob().then(m)}),this.text=function(){var t=p(this);if(t)return t;if(this._bodyBlob)return function(t){var e=new FileReader,n=f(e);return e.readAsText(t),n}(this._bodyBlob);if(this._bodyArrayBuffer)return Promise.resolve(function(t){for(var e=new Uint8Array(t),n=new Array(e.length),r=0;r<e.length;r++)n[r]=String.fromCharCode(e[r]);return n.join(\"\")}(this._bodyArrayBuffer));if(this._bodyFormData)throw new Error(\"could not read FormData body as text\");return Promise.resolve(this._bodyText)},i&&(this.formData=function(){return this.text().then(b)}),this.json=function(){return this.text().then(JSON.parse)},this}h.prototype.append=function(t,e){t=u(t),e=d(e);var n=this.map[t];this.map[t]=n?n+\", \"+e:e},h.prototype.delete=function(t){delete this.map[u(t)]},h.prototype.get=function(t){return t=u(t),this.has(t)?this.map[t]:null},h.prototype.has=function(t){return this.map.hasOwnProperty(u(t))},h.prototype.set=function(t,e){this.map[u(t)]=d(e)},h.prototype.forEach=function(t,e){for(var n in this.map)this.map.hasOwnProperty(n)&&t.call(e,this.map[n],n,this)},h.prototype.keys=function(){var t=[];return this.forEach((function(e,n){t.push(n)})),l(t)},h.prototype.values=function(){var t=[];return this.forEach((function(e){t.push(e)})),l(t)},h.prototype.entries=function(){var t=[];return this.forEach((function(e,n){t.push([n,e])})),l(t)},r&&(h.prototype[Symbol.iterator]=h.prototype.entries);var w=[\"DELETE\",\"GET\",\"HEAD\",\"OPTIONS\",\"POST\",\"PUT\"];function v(t,e){var n,r,o=(e=e||{}).body;if(t instanceof v){if(t.bodyUsed)throw new TypeError(\"Already read\");this.url=t.url,this.credentials=t.credentials,e.headers||(this.headers=new h(t.headers)),this.method=t.method,this.mode=t.mode,this.signal=t.signal,o||null==t._bodyInit||(o=t._bodyInit,t.bodyUsed=!0)}else this.url=String(t);if(this.credentials=e.credentials||this.credentials||\"same-origin\",!e.headers&&this.headers||(this.headers=new h(e.headers)),this.method=(n=e.method||this.method||\"GET\",r=n.toUpperCase(),w.indexOf(r)>-1?r:n),this.mode=e.mode||this.mode||null,this.signal=e.signal||this.signal,this.referrer=null,(\"GET\"===this.method||\"HEAD\"===this.method)&&o)throw new TypeError(\"Body not allowed for GET or HEAD requests\");this._initBody(o)}function b(t){var e=new FormData;return t.trim().split(\"&\").forEach((function(t){if(t){var n=t.split(\"=\"),r=n.shift().replace(/\\+/g,\" \"),o=n.join(\"=\").replace(/\\+/g,\" \");e.append(decodeURIComponent(r),decodeURIComponent(o))}})),e}function A(t,e){e||(e={}),this.type=\"default\",this.status=void 0===e.status?200:e.status,this.ok=this.status>=200&&this.status<300,this.statusText=\"statusText\"in e?e.statusText:\"OK\",this.headers=new h(e.headers),this.url=e.url||\"\",this._initBody(t)}v.prototype.clone=function(){return new v(this,{body:this._bodyInit})},g.call(v.prototype),g.call(A.prototype),A.prototype.clone=function(){return new A(this._bodyInit,{status:this.status,statusText:this.statusText,headers:new h(this.headers),url:this.url})},A.error=function(){var t=new A(null,{status:0,statusText:\"\"});return t.type=\"error\",t};var _=[301,302,303,307,308];A.redirect=function(t,e){if(-1===_.indexOf(e))throw new RangeError(\"Invalid status code\");return new A(null,{status:e,headers:{location:t}})},e.DOMException=t.DOMException;try{new e.DOMException}catch(t){e.DOMException=function(t,e){this.message=t,this.name=e;var n=Error(t);this.stack=n.stack},e.DOMException.prototype=Object.create(Error.prototype),e.DOMException.prototype.constructor=e.DOMException}function S(t,n){return new Promise((function(r,i){var s=new v(t,n);if(s.signal&&s.signal.aborted)return i(new e.DOMException(\"Aborted\",\"AbortError\"));var a=new XMLHttpRequest;function c(){a.abort()}a.onload=function(){var t,e,n={status:a.status,statusText:a.statusText,headers:(t=a.getAllResponseHeaders()||\"\",e=new h,t.replace(/\\r?\\n[\\t ]+/g,\" \").split(/\\r?\\n/).forEach((function(t){var n=t.split(\":\"),r=n.shift().trim();if(r){var o=n.join(\":\").trim();e.append(r,o)}})),e)};n.url=\"responseURL\"in a?a.responseURL:n.headers.get(\"X-Request-URL\");var o=\"response\"in a?a.response:a.responseText;r(new A(o,n))},a.onerror=function(){i(new TypeError(\"Network request failed\"))},a.ontimeout=function(){i(new TypeError(\"Network request failed\"))},a.onabort=function(){i(new e.DOMException(\"Aborted\",\"AbortError\"))},a.open(s.method,s.url,!0),\"include\"===s.credentials?a.withCredentials=!0:\"omit\"===s.credentials&&(a.withCredentials=!1),\"responseType\"in a&&o&&(a.responseType=\"blob\"),s.headers.forEach((function(t,e){a.setRequestHeader(e,t)})),s.signal&&(s.signal.addEventListener(\"abort\",c),a.onreadystatechange=function(){4===a.readyState&&s.signal.removeEventListener(\"abort\",c)}),a.send(void 0===s._bodyInit?null:s._bodyInit)}))}S.polyfill=!0,t.fetch||(t.fetch=S,t.Headers=h,t.Request=v,t.Response=A),e.Headers=h,e.Request=v,e.Response=A,e.fetch=S,Object.defineProperty(e,\"__esModule\",{value:!0})}({})}(r),r.fetch.ponyfill=!0,delete r.fetch.polyfill;var o=r;(e=o.fetch).default=o.fetch,e.fetch=o.fetch,e.Headers=o.Headers,e.Request=o.Request,e.Response=o.Response,t.exports=e}(dn,dn.exports);var ln=Ft(dn.exports);async function hn(t,e){const n=await t.getAccountInfo(e);if(null===n)throw new Error(\"program account not found\");const{program:r}=fn(n.data),o=await t.getAccountInfo(r.programdataAddress);if(null===o)throw new Error(\"program data account not found\");const{programData:i}=fn(o.data);return i}const pn=_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.rustEnum([_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([],\"uninitialized\"),_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.option(_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.publicKey(),\"authorityAddress\")],\"buffer\"),_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.publicKey(\"programdataAddress\")],\"program\"),_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u64(\"slot\"),_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.option(_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.publicKey(),\"upgradeAuthorityAddress\")],\"programData\")],void 0,_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.u32());function fn(t){return pn.decode(t)}var mn=Object.freeze({__proto__:null,verifiedBuild:async function(t,e,n=5){const r=`https://api.apr.dev/api/v0/program/${e.toString()}/latest?limit=${n}`,[o,i]=await Promise.all([hn(t,e),ln(r)]),s=(await i.json()).filter((t=>!t.aborted&&\"Built\"===t.state&&\"Verified\"===t.verified));if(0===s.length)return null;const a=s[0];return o.slot.toNumber()!==a.verified_slot?null:a},fetchData:hn,decodeUpgradeableLoaderState:fn}),yn=Object.freeze({__proto__:null,sha256:Ye,rpc:it,publicKey:sn,bytes:k,token:un,features:yt,registry:mn});const gn=_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.struct([_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.publicKey(\"authority\"),_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__.vecU8(\"data\")]);function wn(t,e){var n,r;let o={};const i=t.args?t.args.length:0;if(e.length>i){if(e.length!==i+1)throw new Error(`provided too many arguments ${e} to instruction ${null==t?void 0:t.name} expecting: ${null!==(r=null===(n=t.args)||void 0===n?void 0:n.map((t=>t.name)))&&void 0!==r?r:[]}`);o=e.pop()}return[e,o]}class vn{static build(t,e,n){if(\"_inner\"===t.name)throw new gt(\"the _inner name is reserved\");const o=(...i)=>{const[s,a]=wn(t,[...i]);P(t.accounts,a.accounts);const c=o.accounts(a.accounts);return void 0!==a.remainingAccounts&&c.push(...a.remainingAccounts),mt(\"debug-logs\")&&console.log(\"Outgoing account metas:\",c),new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.TransactionInstruction({keys:c,programId:n,data:e(t.name,x(t,...s))})};return o.accounts=e=>vn.accountsArray(e,t.accounts,t.name),o}static accountsArray(t,e,n){return t?e.map((e=>{if(void 0!==(\"accounts\"in e?e.accounts:void 0)){const r=t[e.name];return vn.accountsArray(r,e.accounts,n).flat()}{const r=e;let o;try{o=L(t[e.name])}catch(t){throw new Error(`Wrong input type for account \"${e.name}\" in the instruction accounts object${void 0!==n?' for instruction \"'+n+'\"':\"\"}. Expected PublicKey or string.`)}return{pubkey:o,isWritable:r.isMut,isSigner:r.isSigner}}})).flat():[]}}class bn{static build(t,e,n,r){return async(...o)=>{var i;const s=e(...o),[,a]=wn(t,[...o]);if(void 0===r.sendAndConfirm)throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");try{return await r.sendAndConfirm(s,null!==(i=a.signers)&&void 0!==i?i:[],a.options)}catch(t){throw At(t,n)}}}}class An{static build(t,e){return(...r)=>{var o,i,s;const[,a]=wn(t,[...r]),c=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.Transaction;if(a.preInstructions&&a.instructions)throw new Error(\"instructions is deprecated, use preInstructions\");return null===(o=a.preInstructions)||void 0===o||o.forEach((t=>c.add(t))),null===(i=a.instructions)||void 0===i||i.forEach((t=>c.add(t))),c.add(e(...r)),null===(s=a.postInstructions)||void 0===s||s.forEach((t=>c.add(t))),c}}}class _n{constructor(t,e,n=lt(),r=new Kt(t)){this.provider=n,this.coder=r,this._idl=t,this._programId=e,this._address=Sn(e),this._sub=null;const[o,i,a]=(()=>{var o;let i={},a={},c={};return null===(o=t.state)||void 0===o||o.methods.forEach((o=>{const u=vn.build(o,((t,e)=>r.instruction.encodeState(t,e)),e);u.accounts=t=>{const r=function(t,e,n,r){if(\"new\"===n.name){const[n]=nn([],t);if(void 0===e.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");return[{pubkey:e.wallet.publicKey,isWritable:!1,isSigner:!0},{pubkey:Sn(t),isWritable:!0,isSigner:!1},{pubkey:n,isWritable:!1,isSigner:!1},{pubkey:_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SystemProgram.programId,isWritable:!1,isSigner:!1},{pubkey:t,isWritable:!1,isSigner:!1}]}return P(n.accounts,r),[{pubkey:Sn(t),isWritable:!0,isSigner:!1}]}(e,n,o,t);return r.concat(vn.accountsArray(t,o.accounts,o.name))};const d=An.build(o,u),l=bn.build(o,d,M(t),n),p=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(o.name);i[p]=u,a[p]=d,c[p]=l})),[i,a,c]})();this.instruction=o,this.transaction=i,this.rpc=a}get programId(){return this._programId}async fetch(){const t=this.address(),e=await this.provider.connection.getAccountInfo(t);if(null===e)throw new Error(`Account does not exist ${t.toString()}`);const n=this._idl.state;if(!n)throw new Error(\"State is not specified in IDL.\");if((await jt(n.struct.name)).compare(e.data.slice(0,8)))throw new Error(\"Invalid account discriminator\");return this.coder.state.decode(e.data)}address(){return this._address}subscribe(t){if(null!==this._sub)return this._sub.ee;const e=new (eventemitter3__WEBPACK_IMPORTED_MODULE_9___default()),n=this.provider.connection.onAccountChange(this.address(),(t=>{const n=this.coder.state.decode(t.data);e.emit(\"change\",n)}),t);return this._sub={ee:e,listener:n},e}unsubscribe(){null!==this._sub&&this.provider.connection.removeAccountChangeListener(this._sub.listener).then((async()=>{this._sub=null})).catch(console.error)}}function Sn(t){let[e]=nn([],t);return tn(e,\"unversioned\",t)}class En{constructor(t,e,n,r,o){this._idlAccount=e,this._programId=n,this._provider=null!=r?r:lt(),this._coder=null!=o?o:new Kt(t),this._size=this._coder.accounts.size(e)}get size(){return this._size}get programId(){return this._programId}get provider(){return this._provider}get coder(){return this._coder}async fetchNullable(t,e){const n=await this.getAccountInfo(t,e);return null===n?null:this._coder.accounts.decode(this._idlAccount.name,n.data)}async fetch(t,e){const n=await this.fetchNullable(t,e);if(null===n)throw new Error(`Account does not exist ${t.toString()}`);return n}async fetchMultiple(t,e){return(await X(this._provider.connection,t.map((t=>L(t))),e)).map((t=>null==t?null:this._coder.accounts.decode(this._idlAccount.name,null==t?void 0:t.account.data)))}async all(t){return(await this._provider.connection.getProgramAccounts(this._programId,{commitment:this._provider.connection.commitment,filters:[{memcmp:this.coder.accounts.memcmp(this._idlAccount.name,t instanceof Buffer?t:void 0)},...Array.isArray(t)?t:[]]})).map((({pubkey:t,account:e})=>({publicKey:t,account:this._coder.accounts.decode(this._idlAccount.name,e.data)})))}subscribe(t,e){const n=In.get(t.toString());if(n)return n.ee;const r=new (eventemitter3__WEBPACK_IMPORTED_MODULE_9___default());t=L(t);const o=this._provider.connection.onAccountChange(t,(t=>{const e=this._coder.accounts.decode(this._idlAccount.name,t.data);r.emit(\"change\",e)}),e);return In.set(t.toString(),{ee:r,listener:o}),r}async unsubscribe(t){let e=In.get(t.toString());e?In&&await this._provider.connection.removeAccountChangeListener(e.listener).then((()=>{In.delete(t.toString())})).catch(console.error):console.warn(\"Address is not subscribed\")}async createInstruction(t,e){const n=this.size;if(void 0===this._provider.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");return _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SystemProgram.createAccount({fromPubkey:this._provider.wallet.publicKey,newAccountPubkey:t.publicKey,space:null!=e?e:n,lamports:await this._provider.connection.getMinimumBalanceForRentExemption(null!=e?e:n),programId:this._programId})}async associated(...t){const e=await this.associatedAddress(...t);return await this.fetch(e)}async associatedAddress(...t){return await on(this._programId,...t)}async getAccountInfo(t,e){return await this._provider.connection.getAccountInfo(L(t),e)}}const In=new Map,kn=\"Program log: \".length,Mn=\"Program data: \".length;class xn{constructor(t,e,n){this._programId=t,this._provider=e,this._eventParser=new Pn(t,n),this._eventCallbacks=new Map,this._eventListeners=new Map,this._listenerIdCount=0}addEventListener(t,e){var n;let r=this._listenerIdCount;return this._listenerIdCount+=1,t in this._eventCallbacks||this._eventListeners.set(t,[]),this._eventListeners.set(t,(null!==(n=this._eventListeners.get(t))&&void 0!==n?n:[]).concat(r)),this._eventCallbacks.set(r,[t,e]),void 0!==this._onLogsSubscriptionId||(this._onLogsSubscriptionId=this._provider.connection.onLogs(this._programId,((t,e)=>{if(!t.err)for(const n of this._eventParser.parseLogs(t.logs)){const r=this._eventListeners.get(n.name);r&&r.forEach((r=>{const o=this._eventCallbacks.get(r);if(o){const[,r]=o;r(n.data,e.slot,t.signature)}}))}}))),r}async removeEventListener(t){const e=this._eventCallbacks.get(t);if(!e)throw new Error(`Event listener ${t} doesn't exist!`);const[n]=e;let r=this._eventListeners.get(n);if(!r)throw new Error(`Event listeners don't exist for ${n}!`);this._eventCallbacks.delete(t),r=r.filter((e=>e!==t)),0===r.length&&this._eventListeners.delete(n),0==this._eventCallbacks.size&&(assert__WEBPACK_IMPORTED_MODULE_10__.ok(0===this._eventListeners.size),void 0!==this._onLogsSubscriptionId&&(await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId),this._onLogsSubscriptionId=void 0))}}class Pn{constructor(t,e){this.coder=e,this.programId=t}*parseLogs(t){const e=new Tn(t),n=new Ln;let r=e.next();for(;null!==r;){let[t,o,i]=this.handleLog(n,r);t&&(yield t),o&&n.push(o),i&&n.pop(),r=e.next()}}handleLog(t,e){return t.stack.length>0&&t.program()===this.programId.toString()?this.handleProgramLog(e):[null,...this.handleSystemLog(e)]}handleProgramLog(t){if(t.startsWith(\"Program log: \")||t.startsWith(\"Program data: \")){const e=t.startsWith(\"Program log: \")?t.slice(kn):t.slice(Mn);return[this.coder.events.decode(e),null,!1]}return[null,...this.handleSystemLog(t)]}handleSystemLog(t){const e=t.split(\":\")[0];return null!==e.match(/^Program (.*) success/g)?[null,!0]:e.startsWith(`Program ${this.programId.toString()} invoke`)?[this.programId.toString(),!1]:e.includes(\"invoke\")?[\"cpi\",!1]:[null,!1]}}class Ln{constructor(){this.stack=[]}program(){return assert__WEBPACK_IMPORTED_MODULE_10__.ok(this.stack.length>0),this.stack[this.stack.length-1]}push(t){this.stack.push(t)}pop(){assert__WEBPACK_IMPORTED_MODULE_10__.ok(this.stack.length>0),this.stack.pop()}}class Tn{constructor(t){this.logs=t}next(){if(0===this.logs.length)return null;let t=this.logs[0];return this.logs=this.logs.slice(1),t}}const Cn=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");function zn(){return new Ne(Bn)}const Bn={version:\"0.1.0\",name:\"spl_token\",instructions:[{name:\"initializeMint\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"decimals\",type:\"u8\"},{name:\"mintAuthority\",type:\"publicKey\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]},{name:\"initializeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[]},{name:\"initializeMultisig\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"m\",type:\"u8\"}]},{name:\"transfer\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"approve\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"delegate\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"revoke\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"setAuthority\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"authorityType\",type:\"u8\"},{name:\"newAuthority\",type:{coption:\"publicKey\"}}]},{name:\"mintTo\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"burn\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"}]},{name:\"closeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!1}],args:[]},{name:\"freezeAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"thawAccount\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[]},{name:\"transferChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"destination\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"approveChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"delegate\",isMut:!1,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"mintToChecked\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"burnChecked\",accounts:[{name:\"source\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!0,isSigner:!1},{name:\"authority\",isMut:!1,isSigner:!0}],args:[{name:\"amount\",type:\"u64\"},{name:\"decimals\",type:\"u8\"}]},{name:\"initializeAccount2\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"authority\",type:\"publicKey\"}]},{name:\"syncNative\",accounts:[{name:\"account\",isMut:!0,isSigner:!1}],args:[]},{name:\"initializeAccount3\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1}],args:[{name:\"authority\",type:\"publicKey\"}]},{name:\"initializeMultisig2\",accounts:[{name:\"account\",isMut:!0,isSigner:!1}],args:[{name:\"m\",type:\"u8\"}]},{name:\"initializeMint2\",accounts:[{name:\"mint\",isMut:!0,isSigner:!1}],args:[{name:\"decimals\",type:\"u8\"},{name:\"mintAuthority\",type:\"publicKey\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]}],accounts:[{name:\"mint\",type:{kind:\"struct\",fields:[{name:\"mintAuthority\",type:{coption:\"publicKey\"}},{name:\"supply\",type:\"u64\"},{name:\"decimals\",type:\"u8\"},{name:\"isInitialized\",type:\"bool\"},{name:\"freezeAuthority\",type:{coption:\"publicKey\"}}]}},{name:\"token\",type:{kind:\"struct\",fields:[{name:\"mint\",type:\"publicKey\"},{name:\"authority\",type:\"publicKey\"},{name:\"amount\",type:\"u64\"},{name:\"delegate\",type:{coption:\"publicKey\"}},{name:\"state\",type:\"u8\"},{name:\"isNative\",type:{coption:\"u64\"}},{name:\"delegatedAmount\",type:\"u64\"},{name:\"closeAuthority\",type:{coption:\"publicKey\"}}]}}]};class On{constructor(t,e,n,r,o,i){this._args=t,this._accounts=e,this._provider=n,this._programId=r,this._idlIx=o,this._accountStore=new Dn(n,i)}async resolve(){for(let t=0;t<this._idlIx.accounts.length;t+=1){const e=this._idlIx.accounts[t],n=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e.name);if(!e.isSigner||this._accounts[n])Reflect.has(On.CONST_ACCOUNTS,n)&&!this._accounts[n]&&(this._accounts[n]=On.CONST_ACCOUNTS[n]);else{if(void 0===this._provider.wallet)throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");this._accounts[n]=this._provider.wallet.publicKey}}for(let t=0;t<this._idlIx.accounts.length;t+=1){const e=this._idlIx.accounts[t],n=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e.name);e.pda&&e.pda.seeds.length>0&&!this._accounts[n]&&await this.autoPopulatePda(e)}}async autoPopulatePda(t){if(!t.pda||!t.pda.seeds)throw new Error(\"Must have seeds\");const n=await Promise.all(t.pda.seeds.map((t=>this.toBuffer(t)))),r=await this.parseProgramId(t),[o]=await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress(n,r);this._accounts[camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t.name)]=o}async parseProgramId(t){var n;if(!(null===(n=t.pda)||void 0===n?void 0:n.programId))return this._programId;switch(t.pda.programId.kind){case\"const\":return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(this.toBufferConst(t.pda.programId.value));case\"arg\":return this.argValue(t.pda.programId);case\"account\":return await this.accountValue(t.pda.programId);default:throw new Error(`Unexpected program seed kind: ${t.pda.programId.kind}`)}}async toBuffer(t){switch(t.kind){case\"const\":return this.toBufferConst(t);case\"arg\":return await this.toBufferArg(t);case\"account\":return await this.toBufferAccount(t);default:throw new Error(`Unexpected seed kind: ${t.kind}`)}}toBufferConst(t){return this.toBufferValue(t.type,t.value)}async toBufferArg(t){const e=this.argValue(t);return this.toBufferValue(t.type,e)}argValue(t){const e=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t.path.split(\".\")[0]),n=this._idlIx.args.findIndex((t=>t.name===e));if(-1===n)throw new Error(`Unable to find argument for seed: ${e}`);return this._args[n]}async toBufferAccount(t){const e=await this.accountValue(t);return this.toBufferValue(t.type,e)}async accountValue(t){const e=t.path.split(\".\"),n=e[0],r=this._accounts[camelcase__WEBPACK_IMPORTED_MODULE_5___default()(n)];if(1===e.length)return r;const o=await this._accountStore.fetchAccount(t.account,r);return this.parseAccountValue(o,e.slice(1))}parseAccountValue(t,e){let n;for(;e.length>0;)n=t[camelcase__WEBPACK_IMPORTED_MODULE_5___default()(e[0])],e=e.slice(1);return n}toBufferValue(t,e){switch(t){case\"u8\":return Buffer.from([e]);case\"u16\":let n=Buffer.alloc(2);return n.writeUInt16LE(e),n;case\"u32\":let r=Buffer.alloc(4);return r.writeUInt32LE(e),r;case\"u64\":let o=Buffer.alloc(8);return o.writeBigUInt64LE(BigInt(e)),o;case\"string\":return Buffer.from(b(e));case\"publicKey\":return e.toBuffer();default:if(t.array)return Buffer.from(e);throw new Error(`Unexpected seed type: ${t}`)}}}On.CONST_ACCOUNTS={associatedTokenProgram:cn,rent:_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SYSVAR_RENT_PUBKEY,systemProgram:_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SystemProgram.programId,tokenProgram:an};class Dn{constructor(t,e){this._provider=t,this._accounts=e,this._cache=new Map}async fetchAccount(t,e){const n=e.toString();if(!this._cache.has(n))if(\"TokenAccount\"===t){const t=await this._provider.connection.getAccountInfo(e);if(null===t)throw new Error(`invalid account info for ${n}`);const r=zn().accounts.decode(\"token\",t.data);this._cache.set(n,r)}else{const r=this._accounts[camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t)].fetch(e);this._cache.set(n,r)}return this._cache.get(n)}}class Nn{static build(t,e,n,r,o,i,s,a,c){return(...u)=>new Rn(u,r,o,i,s,a,t,e,n,c)}}class Rn{constructor(t,e,n,r,o,i,s,a,c,u){this._args=t,this._ixFn=e,this._txFn=n,this._rpcFn=r,this._simulateFn=o,this._viewFn=i,this._accounts={},this._remainingAccounts=[],this._signers=[],this._preInstructions=[],this._postInstructions=[],this._autoResolveAccounts=!0,this._accountsResolver=new On(t,this._accounts,s,a,c,u)}async pubkeys(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._accounts}accounts(t){return this._autoResolveAccounts=!0,Object.assign(this._accounts,t),this}accountsStrict(t){return this._autoResolveAccounts=!1,Object.assign(this._accounts,t),this}signers(t){return this._signers=this._signers.concat(t),this}remainingAccounts(t){return this._remainingAccounts=this._remainingAccounts.concat(t),this}preInstructions(t){return this._preInstructions=this._preInstructions.concat(t),this}postInstructions(t){return this._postInstructions=this._postInstructions.concat(t),this}async rpc(t){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._rpcFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async view(t){if(this._autoResolveAccounts&&await this._accountsResolver.resolve(),!this._viewFn)throw new Error(\"Method does not support views\");return this._viewFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async simulate(t){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._simulateFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions,options:t})}async instruction(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._ixFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions})}async transaction(){return this._autoResolveAccounts&&await this._accountsResolver.resolve(),this._txFn(...this._args,{accounts:this._accounts,signers:this._signers,remainingAccounts:this._remainingAccounts,preInstructions:this._preInstructions,postInstructions:this._postInstructions})}}class Vn{constructor(t,e,n,r){e=L(e),n||(n=lt()),this._idl=t,this._provider=n,this._programId=e,this._coder=null!=r?r:new Kt(t),this._events=new xn(this._programId,n,this._coder);const[o,i,s,a,c,u,d,l]=class{static build(t,e,n,r){const o={},i={},s={},a={},c={},u={},d=M(t),l=t.accounts?class{static build(t,e,n,r){var o;const i={};return null===(o=t.accounts)||void 0===o||o.forEach((o=>{const s=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(o.name);i[s]=new En(t,o,n,r,e)})),i}}.build(t,e,n,r):{},p=class{static build(t,e,n,r){if(void 0!==t.state)return new _n(t,n,r,e)}}.build(t,e,n,r);return t.instructions.forEach((p=>{const f=vn.build(p,((t,n)=>e.instruction.encode(t,n)),n),m=An.build(p,f),y=bn.build(p,m,d,r),g=class{static build(t,e,n,r,o,i,s){return async(...a)=>{var c;const u=e(...a),[,d]=wn(t,[...a]);let l;if(void 0===r.simulate)throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");try{l=await r.simulate(u,d.signers,null===(c=d.options)||void 0===c?void 0:c.commitment)}catch(t){throw At(t,n)}if(void 0===l)throw new Error(\"Unable to simulate transaction\");const h=l.logs;if(!h)throw new Error(\"Simulated logs not found\");const p=[];if(s.events){let t=new Pn(i,o);for(const e of t.parseLogs(h))p.push(e)}return{events:p,raw:h}}}}.build(p,m,d,r,e,n,t),w=class{static build(t,e,n,r){const o=e.accounts.find((t=>t.isMut)),i=!!e.returns;if(!o&&i)return async(...o)=>{var i,s;let a=await n(...o);const c=`Program return: ${t} `;let u=a.raw.find((t=>t.startsWith(c)));if(!u)throw new Error(\"View expected return log\");let d=E(u.slice(c.length)),l=e.returns;if(!l)throw new Error(\"View expected return type\");return Lt.fieldLayout({type:l},Array.from([...null!==(i=r.accounts)&&void 0!==i?i:[],...null!==(s=r.types)&&void 0!==s?s:[]])).decode(d)}}}.build(n,p,g,t),v=Nn.build(r,n,p,f,m,y,g,w,l),b=camelcase__WEBPACK_IMPORTED_MODULE_5___default()(p.name);i[b]=f,s[b]=m,o[b]=y,a[b]=g,c[b]=v,w&&(u[b]=w)})),[o,i,s,l,a,c,p,u]}}.build(t,this._coder,e,n);this.rpc=o,this.instruction=i,this.transaction=s,this.account=a,this.simulate=c,this.methods=u,this.state=d,this.views=l}get programId(){return this._programId}get idl(){return this._idl}get coder(){return this._coder}get provider(){return this._provider}static async at(t,e){const n=L(t),r=await Vn.fetchIdl(n,e);if(!r)throw new Error(`IDL not found for program: ${t.toString()}`);return new Vn(r,n,e)}static async fetchIdl(t,n){n=null!=n?n:lt();const r=L(t),o=await async function(t){const n=(await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress([],t))[0];return await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.createWithSeed(n,\"anchor:idl\",t)}(r),i=await n.connection.getAccountInfo(o);if(!i)return null;let s=(a=i.data.slice(8),gn.decode(a));var a;const c=(0,pako__WEBPACK_IMPORTED_MODULE_8__/* .inflate */ .rr)(s.data);return JSON.parse(v(c))}addEventListener(t,e){return this._events.addEventListener(t,e)}async removeEventListener(t){return await this._events.removeEventListener(t)}}class Un{constructor(t){}encode(t,e){if(\"create\"===camelcase__WEBPACK_IMPORTED_MODULE_5___default()(t))return Buffer.alloc(0);throw new Error(`Invalid instruction: ${t}`)}encodeState(t,e){throw new Error(\"SPL associated token does not have state\")}}class jn{constructor(t){}encode(t,e){throw new Error(\"SPL associated token does not have state\")}decode(t){throw new Error(\"SPL associated token does not have state\")}}class $n{constructor(t){this.idl=t}async encode(t,e){throw new Error(`Invalid account name: ${t}`)}decode(t,e){return this.decodeUnchecked(t,e)}decodeUnchecked(t,e){throw new Error(`Invalid account name: ${t}`)}memcmp(t,e){throw new Error(`Invalid account name: ${t}`)}size(t){var e;return null!==(e=Bt(this.idl,t))&&void 0!==e?e:0}}class Kn{constructor(t){}decode(t){throw new Error(\"SPL associated token program does not have events\")}}class qn{constructor(t){}encode(t,e){throw new Error(\"SPL associated token does not have user-defined types\")}decode(t,e){throw new Error(\"SPL associated token does not have user-defined types\")}}class Fn{constructor(t){this.instruction=new Un(t),this.accounts=new $n(t),this.events=new Kn(t),this.state=new jn(t),this.types=new qn(t)}}const Wn=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");function Gn(t){return new Vn(Hn,Wn,t,new Fn(Hn))}const Hn={version:\"0.1.0\",name:\"spl_associated_token\",instructions:[{name:\"create\",accounts:[{name:\"authority\",isMut:!0,isSigner:!0},{name:\"associatedAccount\",isMut:!0,isSigner:!1},{name:\"owner\",isMut:!1,isSigner:!1},{name:\"mint\",isMut:!1,isSigner:!1},{name:\"systemProgram\",isMut:!1,isSigner:!1},{name:\"tokenProgram\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[]}]};class Jn{static token(t){return function(t){return new Vn(Bn,Cn,t,zn())}(t)}static associatedToken(t){return Gn(t)}}const Zn=new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"11111111111111111111111111111111\");function Xn(t){return new Vn(Qn,Zn,t,new Qe(Qn))}const Qn={version:\"0.1.0\",name:\"system_program\",instructions:[{name:\"createAccount\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!0}],args:[{name:\"lamports\",type:\"u64\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"assign\",accounts:[{name:\"pubkey\",isMut:!0,isSigner:!0}],args:[{name:\"owner\",type:\"publicKey\"}]},{name:\"transfer\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1}],args:[{name:\"lamports\",type:\"u64\"}]},{name:\"createAccountWithSeed\",accounts:[{name:\"from\",isMut:!0,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"lamports\",type:\"u64\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"advanceNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"withdrawNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"to\",isMut:!0,isSigner:!1},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"lamports\",type:\"u64\"}]},{name:\"initializeNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!0},{name:\"recentBlockhashes\",isMut:!1,isSigner:!1},{name:\"rent\",isMut:!1,isSigner:!1}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"authorizeNonceAccount\",accounts:[{name:\"nonce\",isMut:!0,isSigner:!1},{name:\"authorized\",isMut:!1,isSigner:!0}],args:[{name:\"authorized\",type:\"publicKey\"}]},{name:\"allocate\",accounts:[{name:\"pubkey\",isMut:!0,isSigner:!0}],args:[{name:\"space\",type:\"u64\"}]},{name:\"allocateWithSeed\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"space\",type:\"u64\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"assignWithSeed\",accounts:[{name:\"account\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0}],args:[{name:\"base\",type:\"publicKey\"},{name:\"seed\",type:\"string\"},{name:\"owner\",type:\"publicKey\"}]},{name:\"transferWithSeed\",accounts:[{name:\"from\",isMut:!0,isSigner:!1},{name:\"base\",isMut:!1,isSigner:!0},{name:\"to\",isMut:!0,isSigner:!1}],args:[{name:\"lamports\",type:\"u64\"},{name:\"seed\",type:\"string\"},{name:\"owner\",type:\"publicKey\"}]}],accounts:[{name:\"nonce\",type:{kind:\"struct\",fields:[{name:\"version\",type:\"u32\"},{name:\"state\",type:\"u32\"},{name:\"authorizedPubkey\",type:\"publicKey\"},{name:\"nonce\",type:\"publicKey\"},{name:\"feeCalculator\",type:{defined:\"FeeCalculator\"}}]}}],types:[{name:\"FeeCalculator\",type:{kind:\"struct\",fields:[{name:\"lamportsPerSignature\",type:\"u64\"}]}}]};class Yn{static system(t){return Xn(t)}}\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 5658:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar basex = __webpack_require__(8162)\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 9593:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = __webpack_require__(698);\nconst web3_js_1 = __webpack_require__(6737);\nconst bn_js_1 = __importDefault(__webpack_require__(3550));\nvar buffer_layout_2 = __webpack_require__(698);\nObject.defineProperty(exports, \"u8\", ({ enumerable: true, get: function () { return buffer_layout_2.u8; } }));\nObject.defineProperty(exports, \"i8\", ({ enumerable: true, get: function () { return buffer_layout_2.s8; } }));\nObject.defineProperty(exports, \"u16\", ({ enumerable: true, get: function () { return buffer_layout_2.u16; } }));\nObject.defineProperty(exports, \"i16\", ({ enumerable: true, get: function () { return buffer_layout_2.s16; } }));\nObject.defineProperty(exports, \"u32\", ({ enumerable: true, get: function () { return buffer_layout_2.u32; } }));\nObject.defineProperty(exports, \"i32\", ({ enumerable: true, get: function () { return buffer_layout_2.s32; } }));\nObject.defineProperty(exports, \"f32\", ({ enumerable: true, get: function () { return buffer_layout_2.f32; } }));\nObject.defineProperty(exports, \"f64\", ({ enumerable: true, get: function () { return buffer_layout_2.f64; } }));\nObject.defineProperty(exports, \"struct\", ({ enumerable: true, get: function () { return buffer_layout_2.struct; } }));\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = buffer_layout_1.blob(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, 'le');\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, 'le', this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout(buffer_layout_1.blob(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = buffer_layout_1.u8();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error('Invalid option ' + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error('Invalid option ' + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout(buffer_layout_1.u8(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error('Invalid bool: ' + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.seq(elementLayout, buffer_layout_1.offset(length, -length.span), 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, values => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = buffer_layout_1.struct([\n        u64('tag'),\n        layout.replicate('data'),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error('Invalid tag, expected: ' +\n                tag.toString('hex') +\n                ', got: ' +\n                receivedTag.toString('hex'));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, data => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.blob(buffer_layout_1.offset(length, -length.span), 'data'),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, data => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), data => data.toString('utf-8'), s => Buffer.from(s, 'utf-8'), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = buffer_layout_1.union(discriminant !== null && discriminant !== void 0 ? discriminant : buffer_layout_1.u8(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = buffer_layout_1.struct([\n        buffer_layout_1.seq(elementLayout, length, 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, values => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = buffer_layout_1.u32('length');\n    const layout = buffer_layout_1.struct([\n        length,\n        buffer_layout_1.seq(new MapEntryLayout(keyLayout, valueLayout), buffer_layout_1.offset(length, -length.span), 'values'),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), values => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 817:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.IDL = void 0;\nexports.IDL = {\n    \"version\": \"0.0.1\",\n    \"name\": \"merkle_distributor\",\n    \"instructions\": [\n        {\n            \"name\": \"newDistributor\",\n            \"docs\": [\n                \"READ THE FOLLOWING:\",\n                \"\",\n                \"This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.\",\n                \"\",\n                \"An attack could look like:\",\n                \"- A legitimate user opens a new distributor.\",\n                \"- Someone observes the call to this instruction.\",\n                \"- They replace the clawback_receiver, admin, or time parameters with their own.\",\n                \"\",\n                \"One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.\",\n                \"Then the attacker can steal all funds from the distributor to their own clawback_receiver account.\",\n                \"\",\n                \"HOW TO AVOID:\",\n                \"- When you call into this instruction, ensure your transaction succeeds.\",\n                \"- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and\",\n                \"assert the parameters are what you expect, most importantly the clawback_receiver and admin.\",\n                \"- If your transaction fails, double check the value on-chain matches what you expect.\"\n            ],\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"[MerkleDistributor].\"\n                    ],\n                    \"pda\": {\n                        \"seeds\": [\n                            {\n                                \"kind\": \"const\",\n                                \"type\": \"string\",\n                                \"value\": \"MerkleDistributor\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"account\": \"Mint\",\n                                \"path\": \"mint\"\n                            },\n                            {\n                                \"kind\": \"arg\",\n                                \"type\": \"u64\",\n                                \"path\": \"version\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"clawbackReceiver\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Clawback receiver token account\"\n                    ]\n                },\n                {\n                    \"name\": \"mint\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The mint to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenVault\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Token vault\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin wallet, responsible for creating the distributor and paying for the transaction.\",\n                        \"Also has the authority to set the clawback receiver and change itself.\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"associatedTokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [Associated Token] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [Token] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"version\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"root\",\n                    \"type\": {\n                        \"array\": [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"maxTotalClaim\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"maxNumNodes\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"startTs\",\n                    \"type\": \"i64\"\n                },\n                {\n                    \"name\": \"endTs\",\n                    \"type\": \"i64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"newClaim\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"claimStatus\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Claim status PDA\"\n                    ],\n                    \"pda\": {\n                        \"seeds\": [\n                            {\n                                \"kind\": \"const\",\n                                \"type\": \"string\",\n                                \"value\": \"ClaimStatus\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"path\": \"claimant\"\n                            },\n                            {\n                                \"kind\": \"account\",\n                                \"type\": \"publicKey\",\n                                \"account\": \"MerkleDistributor\",\n                                \"path\": \"distributor\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"from\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"to\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Account to send the claimed tokens to.\"\n                    ]\n                },\n                {\n                    \"name\": \"claimant\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Who is claiming the tokens.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"SPL [Token] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"index\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"proof\",\n                    \"type\": {\n                        \"vec\": {\n                            \"array\": [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    }\n                }\n            ]\n        },\n        {\n            \"name\": \"clawback\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"from\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    \"name\": \"to\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The Clawback token account.\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin account\"\n                    ]\n                },\n                {\n                    \"name\": \"systemProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    \"name\": \"tokenProgram\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"SPL [Token] program.\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"setClawbackReceiver\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"newClawbackAccount\",\n                    \"isMut\": false,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"New clawback account\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": []\n        },\n        {\n            \"name\": \"setAdmin\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                },\n                {\n                    \"name\": \"newAdmin\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"New admin account\"\n                    ]\n                }\n            ],\n            \"args\": []\n        },\n        {\n            \"name\": \"setTimestamp\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"startTs\",\n                    \"type\": \"i64\"\n                },\n                {\n                    \"name\": \"endTs\",\n                    \"type\": \"i64\"\n                }\n            ]\n        },\n        {\n            \"name\": \"setMerkleRoot\",\n            \"accounts\": [\n                {\n                    \"name\": \"distributor\",\n                    \"isMut\": true,\n                    \"isSigner\": false,\n                    \"docs\": [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    \"name\": \"admin\",\n                    \"isMut\": true,\n                    \"isSigner\": true,\n                    \"docs\": [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            \"args\": [\n                {\n                    \"name\": \"root\",\n                    \"type\": {\n                        \"array\": [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                },\n                {\n                    \"name\": \"maxTotalClaim\",\n                    \"type\": \"u64\"\n                },\n                {\n                    \"name\": \"maxNumNodes\",\n                    \"type\": \"u64\"\n                }\n            ]\n        }\n    ],\n    \"accounts\": [\n        {\n            \"name\": \"claimStatus\",\n            \"docs\": [\n                \"Holds whether or not a claimant has claimed tokens.\"\n            ],\n            \"type\": {\n                \"kind\": \"struct\",\n                \"fields\": [\n                    {\n                        \"name\": \"isClaimed\",\n                        \"docs\": [\n                            \"If true, the tokens have been claimed.\"\n                        ],\n                        \"type\": \"bool\"\n                    },\n                    {\n                        \"name\": \"claimant\",\n                        \"docs\": [\n                            \"Authority that claimed the tokens.\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"claimedAt\",\n                        \"docs\": [\n                            \"When the tokens were claimed.\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"amount\",\n                        \"docs\": [\n                            \"Amount of tokens claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    }\n                ]\n            }\n        },\n        {\n            \"name\": \"merkleDistributor\",\n            \"docs\": [\n                \"State for the account which distributes tokens.\"\n            ],\n            \"type\": {\n                \"kind\": \"struct\",\n                \"fields\": [\n                    {\n                        \"name\": \"bump\",\n                        \"docs\": [\n                            \"Bump seed.\"\n                        ],\n                        \"type\": \"u8\"\n                    },\n                    {\n                        \"name\": \"version\",\n                        \"docs\": [\n                            \"Version of the airdrop\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"root\",\n                        \"docs\": [\n                            \"The 256-bit merkle root.\"\n                        ],\n                        \"type\": {\n                            \"array\": [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    },\n                    {\n                        \"name\": \"mint\",\n                        \"docs\": [\n                            \"[Mint] of the token to be distributed.\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"tokenVault\",\n                        \"docs\": [\n                            \"Token Address of the vault\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"maxTotalClaim\",\n                        \"docs\": [\n                            \"Maximum number of tokens that can ever be claimed from this [MerkleDistributor].\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"maxNumNodes\",\n                        \"docs\": [\n                            \"Maximum number of nodes in [MerkleDistributor].\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"totalAmountClaimed\",\n                        \"docs\": [\n                            \"Total amount of tokens that have been claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"numNodesClaimed\",\n                        \"docs\": [\n                            \"Number of nodes that have been claimed.\"\n                        ],\n                        \"type\": \"u64\"\n                    },\n                    {\n                        \"name\": \"startTs\",\n                        \"docs\": [\n                            \"Claim time start (Unix Timestamp)\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"endTs\",\n                        \"docs\": [\n                            \"Claim time end (Unix Timestamp)\"\n                        ],\n                        \"type\": \"i64\"\n                    },\n                    {\n                        \"name\": \"clawbackReceiver\",\n                        \"docs\": [\n                            \"Clawback receiver\"\n                        ],\n                        \"type\": \"publicKey\"\n                    },\n                    {\n                        \"name\": \"admin\",\n                        \"docs\": [\n                            \"Admin wallet\"\n                        ],\n                        \"type\": \"publicKey\"\n                    }\n                ]\n            }\n        }\n    ],\n    \"events\": [\n        {\n            \"name\": \"NewClaimEvent\",\n            \"fields\": [\n                {\n                    \"name\": \"claimant\",\n                    \"type\": \"publicKey\",\n                    \"index\": false\n                },\n                {\n                    \"name\": \"timestamp\",\n                    \"type\": \"i64\",\n                    \"index\": false\n                }\n            ]\n        },\n        {\n            \"name\": \"ClaimedEvent\",\n            \"fields\": [\n                {\n                    \"name\": \"claimant\",\n                    \"type\": \"publicKey\",\n                    \"index\": false\n                },\n                {\n                    \"name\": \"amount\",\n                    \"type\": \"u64\",\n                    \"index\": false\n                }\n            ]\n        }\n    ],\n    \"errors\": [\n        {\n            \"code\": 6000,\n            \"name\": \"InvalidProof\",\n            \"msg\": \"Invalid Merkle proof\"\n        },\n        {\n            \"code\": 6001,\n            \"name\": \"ExceededMaxClaim\",\n            \"msg\": \"Exceeded maximum claim amount\"\n        },\n        {\n            \"code\": 6002,\n            \"name\": \"MaxNodesExceeded\",\n            \"msg\": \"Exceeded maximum node count\"\n        },\n        {\n            \"code\": 6003,\n            \"name\": \"Unauthorized\",\n            \"msg\": \"Account is not authorized to execute this instruction\"\n        },\n        {\n            \"code\": 6004,\n            \"name\": \"OwnerMismatch\",\n            \"msg\": \"Token account owner did not match intended owner\"\n        },\n        {\n            \"code\": 6005,\n            \"name\": \"SameClawbackReceiver\",\n            \"msg\": \"New and old Clawback receivers are identical\"\n        },\n        {\n            \"code\": 6006,\n            \"name\": \"SameAdmin\",\n            \"msg\": \"New and old admin are identical\"\n        },\n        {\n            \"code\": 6007,\n            \"name\": \"ClaimExpired\",\n            \"msg\": \"Claim window expired\"\n        },\n        {\n            \"code\": 6008,\n            \"name\": \"ArithmeticError\",\n            \"msg\": \"Arithmetic Error (overflow/underflow)\"\n        },\n        {\n            \"code\": 6009,\n            \"name\": \"StartTimestampAfterEnd\",\n            \"msg\": \"Start Timestamp cannot be after end Timestamp\"\n        },\n        {\n            \"code\": 6010,\n            \"name\": \"TimestampsNotInFuture\",\n            \"msg\": \"Timestamps cannot be in the past\"\n        },\n        {\n            \"code\": 6011,\n            \"name\": \"DistributionAlreadyStarted\",\n            \"msg\": \"Distribution already started\"\n        },\n        {\n            \"code\": 6012,\n            \"name\": \"InsufficientClawbackAmount\",\n            \"msg\": \"Insufficient clawback amount\"\n        }\n    ]\n};\n\n\n/***/ }),\n\n/***/ 5945:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.DistributorClient = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst anchor_1 = __webpack_require__(4758);\nconst common_sdk_1 = __webpack_require__(6259);\nconst token_utils_1 = __webpack_require__(9510);\nconst utils_1 = __webpack_require__(2209);\nconst buffer_layout_1 = __webpack_require__(9386);\nconst buffer_layout_utils_1 = __webpack_require__(7278);\nconst spl_token_1 = __webpack_require__(4945);\nclass DistributorClient {\n    constructor(ctx, pda) {\n        this.ctx = ctx;\n        this.pda = pda;\n    }\n    newDistributor(mint, root, clawbackReceiver, maxTotalClaim, maxNumNodes, startTs, endTs, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const clawbackReceiverATA = (0, token_utils_1.getATAAddressSync)({ mint, owner: clawbackReceiver });\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const clawbackTokenAccountInfo = yield this.ctx.connection.getAccountInfo(clawbackReceiverATA);\n            if (clawbackTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [\n                        spl_token_1.Token.createAssociatedTokenAccountInstruction(token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, token_utils_1.TOKEN_PROGRAM_ID, mint, clawbackReceiverATA, clawbackReceiver, this.ctx.wallet.publicKey)\n                    ],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const tokenVault = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const newDistributorIx = yield this.ctx.methods.newDistributor({\n                accounts: {\n                    distributor: distributor.key,\n                    clawbackReceiver: clawbackReceiverATA,\n                    mint,\n                    tokenVault,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    version,\n                    root: (0, utils_1.toBytes32Array)(root),\n                    maxTotalClaim,\n                    maxNumNodes,\n                    startTs,\n                    endTs,\n                },\n            });\n            if (newDistributorIx.ix) {\n                tx.addInstruction(newDistributorIx.ix);\n            }\n            return tx;\n        });\n    }\n    setAdmin(mint, newAdmin, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setAdmin({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                    newAdmin\n                },\n                inputs: {},\n            })).toTx();\n            return tx;\n        });\n    }\n    setClawbackReceiver(mint, clawbackReceiver, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const clawbackReceiverATA = (0, token_utils_1.getATAAddressSync)({ mint, owner: clawbackReceiver });\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const clawbackTokenAccountInfo = yield this.ctx.connection.getAccountInfo(clawbackReceiverATA);\n            if (clawbackTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [\n                        spl_token_1.Token.createAssociatedTokenAccountInstruction(token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, token_utils_1.TOKEN_PROGRAM_ID, mint, clawbackReceiverATA, clawbackReceiver, this.ctx.wallet.publicKey)\n                    ],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const setClawbackReceiverIx = yield this.ctx.methods.setClawbackReceiver({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                    newClawbackAccount: clawbackReceiverATA,\n                },\n                inputs: {},\n            });\n            if (setClawbackReceiverIx.ix) {\n                tx.addInstruction(setClawbackReceiverIx.ix);\n            }\n            return tx;\n        });\n    }\n    setMerkleRoot(mint, root, maxTotalClaim, maxNumNodes, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setMerkleRoot({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    root: (0, utils_1.toBytes32Array)(root),\n                    maxTotalClaim,\n                    maxNumNodes,\n                },\n            })).toTx();\n            return tx;\n        });\n    }\n    setTimestamp(mint, startTs, endTs, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const tx = (yield this.ctx.methods.setTimestamp({\n                accounts: {\n                    distributor: distributor.key,\n                    admin: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    startTs,\n                    endTs,\n                },\n            })).toTx();\n            return tx;\n        });\n    }\n    deposit(mint, amount, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            let distributorData;\n            try {\n                distributorData = yield this.ctx.fetcher.getOneMerkleDistributor(distributor.key);\n            }\n            catch (error) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            const fromAssociatedTokenAccount = (0, token_utils_1.getATAAddressSync)({\n                mint,\n                owner: this.ctx.wallet.publicKey\n            });\n            // tokenVault is initialized when creating the distributor\n            const tokenVault = distributorData.tokenVault;\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            const keys = (0, utils_1.addSigners)([\n                { pubkey: fromAssociatedTokenAccount, isSigner: false, isWritable: true },\n                { pubkey: tokenVault, isSigner: false, isWritable: true },\n            ], this.ctx.wallet.publicKey, []);\n            const transferInstructionData = (0, buffer_layout_1.struct)([(0, buffer_layout_1.u8)('instruction'), (0, buffer_layout_utils_1.u64)('amount')]);\n            const data = Buffer.alloc(transferInstructionData.span);\n            transferInstructionData.encode({ instruction: utils_1.TokenInstruction.Transfer, amount: BigInt(amount.toString()) }, data);\n            tx.addInstruction({\n                instructions: [new web3_js_1.TransactionInstruction({\n                        keys,\n                        programId: token_utils_1.TOKEN_PROGRAM_ID,\n                        data\n                    })],\n                cleanupInstructions: [],\n                signers: []\n            });\n            return tx;\n        });\n    }\n    newClaim(mint, index, amount, proof, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (proof.length === 0) {\n                throw new Error(\"Proof is empty\");\n            }\n            const distributor = this.pda.distributor(mint, version);\n            const claimStatus = this.pda.claim_status(this.ctx.wallet.publicKey, distributor.key);\n            try {\n                yield this.ctx.program.account.claimStatus.fetch(claimStatus.key);\n                throw Error(`Already claimed`);\n            }\n            catch (error) {\n                if (!error.message.includes(\"Account does not exist\")) {\n                    throw error;\n                }\n            }\n            const from = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const to = (0, token_utils_1.getATAAddressSync)({ mint, owner: this.ctx.wallet.publicKey });\n            const toTokenAccountInfo = yield this.ctx.connection.getAccountInfo(to);\n            const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n            if (toTokenAccountInfo === null) {\n                tx.addInstruction({\n                    instructions: [(0, token_utils_1.createATAInstruction)({ address: to, mint, owner: this.ctx.wallet.publicKey, payer: this.ctx.wallet.publicKey })],\n                    cleanupInstructions: [],\n                    signers: [],\n                });\n            }\n            const newClaimIx = yield this.ctx.methods.newClaim({\n                accounts: {\n                    distributor: distributor.key,\n                    claimStatus: claimStatus.key,\n                    from,\n                    to,\n                    claimant: this.ctx.wallet.publicKey,\n                },\n                inputs: {\n                    index,\n                    amount,\n                    proof: proof.map((p) => (0, utils_1.toBytes32Array)(p)),\n                },\n            });\n            if (newClaimIx.ix) {\n                tx.addInstruction(newClaimIx.ix);\n            }\n            return tx;\n        });\n    }\n    clawback(mint, amount, version = new anchor_1.BN(1)) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const distributor = this.pda.distributor(mint, version);\n            const distributorData = yield this.ctx.program.account.merkleDistributor.fetch(distributor.key);\n            if (!distributorData) {\n                throw new Error(`Distributor of token ${mint.toBase58()} version ${version.toString()} not found`);\n            }\n            if (distributorData.admin.toBase58() !== this.ctx.wallet.publicKey.toBase58()) {\n                throw new Error(`Admin of distributor ${distributor.key.toBase58()} is not the current wallet`);\n            }\n            amount = amount.gt(new anchor_1.BN(0)) ? amount : new anchor_1.BN(0);\n            const from = (0, token_utils_1.getATAAddressSync)({ mint, owner: distributor.key });\n            const tx = (yield this.ctx.methods.clawback({\n                accounts: {\n                    distributor: distributor.key,\n                    from,\n                    to: distributorData.clawbackReceiver,\n                    claimant: this.ctx.wallet.publicKey,\n                },\n                inputs: { amount },\n            })).toTx();\n            return tx;\n        });\n    }\n}\nexports.DistributorClient = DistributorClient;\n\n\n/***/ }),\n\n/***/ 6628:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(5945), exports);\n\n\n/***/ }),\n\n/***/ 2535:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.MERKLE_DISTRIBUTOR_PROGRAM_ID = exports.PROGRAM_ID = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nexports.PROGRAM_ID = new web3_js_1.PublicKey(\"EqaUmBqKuUsS8C1HwvckQymErozrmzzivxkP9CazU2mX\");\nexports.MERKLE_DISTRIBUTOR_PROGRAM_ID = exports.PROGRAM_ID;\n\n\n/***/ }),\n\n/***/ 6494:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Context = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst types_1 = __webpack_require__(1496);\nconst fetcher_1 = __webpack_require__(9727);\nconst methods_1 = __webpack_require__(9791);\n/**\n * @category Core\n */\nclass Context {\n    static from(connection, wallet, programId, fetcher = new fetcher_1.AccountFetcher(connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        const anchorProvider = new anchor_1.AnchorProvider(connection, wallet, opts);\n        const program = new anchor_1.Program(types_1.MerkleDistributorIDL, programId, anchorProvider);\n        return new Context(anchorProvider, anchorProvider.wallet, program, fetcher, opts);\n    }\n    static fromWorkspace(provider, program, fetcher = new fetcher_1.AccountFetcher(provider.connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        return new Context(provider, provider.wallet, program, fetcher, opts);\n    }\n    static withProvider(provider, programId, fetcher = new fetcher_1.AccountFetcher(provider.connection), opts = anchor_1.AnchorProvider.defaultOptions()) {\n        const program = new anchor_1.Program(types_1.MerkleDistributorIDL, programId, provider);\n        return new Context(provider, provider.wallet, program, fetcher, opts);\n    }\n    constructor(provider, wallet, program, fetcher, opts) {\n        this.connection = provider.connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        // It's a hack but it works on Anchor workspace *shrug*\n        this.program = program;\n        this.provider = provider;\n        this.fetcher = fetcher;\n        this.methods = new methods_1.Methods(this);\n    }\n}\nexports.Context = Context;\n\n\n/***/ }),\n\n/***/ 554:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.AccountFetcher = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst tiny_invariant_1 = __importDefault(__webpack_require__(6018));\nconst parsing_1 = __webpack_require__(7001);\nclass AccountFetcher {\n    constructor(connection, cache) {\n        this._cache = {};\n        this.connection = connection;\n        this._cache = cache !== null && cache !== void 0 ? cache : {};\n    }\n    /*** Public Methods ***/\n    /**\n     * Update the cached value of all entities currently in the cache.\n     * Uses batched rpc request for network efficient fetch.\n     */\n    refreshAll() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const addresses = Object.keys(this._cache);\n            const data = yield this.bulkRequest(addresses);\n            for (const [idx, [key, cachedContent]] of Object.entries(this._cache).entries()) {\n                const entity = cachedContent.entity;\n                const value = entity.parse(data[idx]);\n                this._cache[key] = { entity, value };\n            }\n        });\n    }\n    /*** Private Methods ***/\n    /**\n     * Retrieve from cache or fetch from rpc, an account\n     */\n    get(address, entity, refresh) {\n        var _a;\n        return __awaiter(this, void 0, void 0, function* () {\n            const key = address.toBase58();\n            const cachedValue = (_a = this._cache[key]) === null || _a === void 0 ? void 0 : _a.value;\n            if (cachedValue !== undefined && !refresh) {\n                return cachedValue;\n            }\n            const accountInfo = yield this.connection.getAccountInfo(address);\n            const accountData = accountInfo === null || accountInfo === void 0 ? void 0 : accountInfo.data;\n            const value = entity.parse(accountData);\n            this._cache[key] = { entity, value };\n            return value;\n        });\n    }\n    /**\n     * Retrieve from cache or fetch from rpc, a list of accounts\n     */\n    list(addresses, entity, refresh) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const keys = addresses.map((address) => address.toBase58());\n            const cachedValues = keys.map((key) => {\n                var _a;\n                return [\n                    key,\n                    refresh ? undefined : (_a = this._cache[key]) === null || _a === void 0 ? void 0 : _a.value,\n                ];\n            });\n            /* Look for accounts not found in cache */\n            const undefinedAccounts = [];\n            cachedValues.forEach(([key, value], cacheIndex) => {\n                if (value === undefined) {\n                    undefinedAccounts.push({ cacheIndex, key });\n                }\n            });\n            /* Fetch accounts not found in cache */\n            if (undefinedAccounts.length > 0) {\n                const data = yield this.bulkRequest(undefinedAccounts.map((account) => account.key));\n                undefinedAccounts.forEach(({ cacheIndex, key }, dataIndex) => {\n                    var _a;\n                    const value = entity.parse(data[dataIndex]);\n                    (0, tiny_invariant_1.default)(((_a = cachedValues[cacheIndex]) === null || _a === void 0 ? void 0 : _a[1]) === undefined, \"unexpected non-undefined value\");\n                    cachedValues[cacheIndex] = [key, value];\n                    this._cache[key] = { entity, value };\n                });\n            }\n            const result = cachedValues\n                .map(([_, value]) => value)\n                .filter((value) => value !== undefined);\n            (0, tiny_invariant_1.default)(result.length === addresses.length, \"not enough results fetched\");\n            return result;\n        });\n    }\n    /**\n     * Make batch rpc request\n     */\n    bulkRequest(addresses) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const responses = [];\n            const chunk = 100; // getMultipleAccounts has limitation of 100 accounts per request\n            for (let i = 0; i < addresses.length; i += chunk) {\n                const addressesSubset = addresses.slice(i, i + chunk);\n                const res = this.connection._rpcRequest(\"getMultipleAccounts\", [\n                    addressesSubset,\n                    { commitment: this.connection.commitment },\n                ]);\n                responses.push(res);\n            }\n            const combinedResult = [];\n            (yield Promise.all(responses)).forEach((res) => {\n                var _a;\n                (0, tiny_invariant_1.default)(!res.error, `bulkRequest result error: ${res.error}`);\n                (0, tiny_invariant_1.default)(!!((_a = res.result) === null || _a === void 0 ? void 0 : _a.value), \"bulkRequest no value\");\n                res.result.value.forEach((account) => {\n                    if (!account || account.data[1] !== \"base64\") {\n                        combinedResult.push(null);\n                    }\n                    else {\n                        combinedResult.push(Buffer.from(account.data[0], account.data[1]));\n                    }\n                });\n            });\n            (0, tiny_invariant_1.default)(combinedResult.length === addresses.length, \"bulkRequest not enough results\");\n            return combinedResult;\n        });\n    }\n    // YOUR CODE:\n    getOneMerkleDistributor(address, refresh = false) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this.get((0, anchor_1.translateAddress)(address), parsing_1.ParsableMerkleDistributor, refresh);\n        });\n    }\n    getOneClaimStatus(address, refresh = false) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this.get((0, anchor_1.translateAddress)(address), parsing_1.ParsableClaimStatus, refresh);\n        });\n    }\n}\nexports.AccountFetcher = AccountFetcher;\n\n\n/***/ }),\n\n/***/ 9727:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(554), exports);\n__exportStar(__webpack_require__(7001), exports);\n\n\n/***/ }),\n\n/***/ 7001:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ParsableClaimStatus = exports.ParsableMerkleDistributor = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst types_1 = __webpack_require__(1496);\n/**\n * Class decorator to define an interface with static methods\n * Reference: https://github.com/Microsoft/TypeScript/issues/13462#issuecomment-295685298\n */\nfunction staticImplements() {\n    return (constructor) => {\n        constructor;\n    };\n}\nfunction parseAnchorAccount(accountName, data) {\n    const discriminator = anchor_1.BorshAccountsCoder.accountDiscriminator(accountName);\n    if (discriminator.compare(data.subarray(0, 8))) {\n        console.error(\"incorrect account name during parsing\");\n        return null;\n    }\n    try {\n        return types_1.accountsCoder.decode(accountName, data);\n    }\n    catch (_e) {\n        console.error(\"unknown account name during parsing\");\n        return null;\n    }\n}\n// YOUR ACCOUNTS\nlet ParsableMerkleDistributor = class ParsableMerkleDistributor {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return parseAnchorAccount(types_1.AccountName.MerkleDistributor, data);\n        }\n        catch (e) {\n            console.error(`error while parsing MerkleDistributor: ${e}`);\n            return null;\n        }\n    }\n};\nParsableMerkleDistributor = __decorate([\n    staticImplements()\n], ParsableMerkleDistributor);\nexports.ParsableMerkleDistributor = ParsableMerkleDistributor;\nlet ParsableClaimStatus = class ParsableClaimStatus {\n    constructor() { }\n    static parse(data) {\n        if (!data) {\n            return null;\n        }\n        try {\n            return parseAnchorAccount(types_1.AccountName.ClaimStatus, data);\n        }\n        catch (e) {\n            console.error(`error while parsing ClaimStatus: ${e}`);\n            return null;\n        }\n    }\n};\nParsableClaimStatus = __decorate([\n    staticImplements()\n], ParsableClaimStatus);\nexports.ParsableClaimStatus = ParsableClaimStatus;\n\n\n/***/ }),\n\n/***/ 1142:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(1496), exports);\n__exportStar(__webpack_require__(6494), exports);\n__exportStar(__webpack_require__(9791), exports);\n__exportStar(__webpack_require__(7719), exports);\n__exportStar(__webpack_require__(6628), exports);\n__exportStar(__webpack_require__(2535), exports);\n__exportStar(__webpack_require__(2209), exports);\n\n\n/***/ }),\n\n/***/ 5581:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.clawback = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst token_utils_1 = __webpack_require__(9510);\nfunction clawback(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .clawback(inputs.amount)\n            .accounts(Object.assign(Object.assign({}, accounts), { systemProgram: web3_js_1.SystemProgram.programId, tokenProgram: token_utils_1.TOKEN_PROGRAM_ID }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.clawback = clawback;\n\n\n/***/ }),\n\n/***/ 6802:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(5581), exports);\n__exportStar(__webpack_require__(7141), exports);\n__exportStar(__webpack_require__(4343), exports);\n__exportStar(__webpack_require__(1498), exports);\n__exportStar(__webpack_require__(6925), exports);\n__exportStar(__webpack_require__(2371), exports);\n__exportStar(__webpack_require__(7549), exports);\n\n\n/***/ }),\n\n/***/ 7141:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.newClaim = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst token_utils_1 = __webpack_require__(9510);\nfunction newClaim(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .newClaim(inputs.index, inputs.amount, inputs.proof)\n            .accounts(Object.assign(Object.assign({}, accounts), { tokenProgram: token_utils_1.TOKEN_PROGRAM_ID, systemProgram: web3_js_1.SystemProgram.programId }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.newClaim = newClaim;\n\n\n/***/ }),\n\n/***/ 4343:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.newDistributor = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst token_utils_1 = __webpack_require__(9510);\nfunction newDistributor(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .newDistributor(inputs.version, inputs.root, inputs.maxTotalClaim, inputs.maxNumNodes, inputs.startTs, inputs.endTs)\n            .accounts(Object.assign(Object.assign({}, accounts), { systemProgram: web3_js_1.SystemProgram.programId, associatedTokenProgram: token_utils_1.ASSOCIATED_TOKEN_PROGRAM_ID, tokenProgram: token_utils_1.TOKEN_PROGRAM_ID }))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.newDistributor = newDistributor;\n\n\n/***/ }),\n\n/***/ 1498:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.setAdmin = void 0;\nfunction setAdmin(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setAdmin()\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setAdmin = setAdmin;\n\n\n/***/ }),\n\n/***/ 6925:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.setClawbackReceiver = void 0;\nfunction setClawbackReceiver(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, } = params;\n        const ix = yield program.methods\n            .setClawbackReceiver()\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setClawbackReceiver = setClawbackReceiver;\n\n\n/***/ }),\n\n/***/ 2371:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.setMerkleRoot = void 0;\nfunction setMerkleRoot(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setMerkleRoot(inputs.root, inputs.maxTotalClaim, inputs.maxNumNodes)\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setMerkleRoot = setMerkleRoot;\n\n\n/***/ }),\n\n/***/ 7549:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.setTimestamp = void 0;\nfunction setTimestamp(program, params) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const { accounts, inputs } = params;\n        const ix = yield program.methods\n            .setTimestamp(inputs.startTs, inputs.endTs)\n            .accounts(Object.assign({}, accounts))\n            .instruction();\n        return {\n            instructions: [ix],\n            cleanupInstructions: [],\n            signers: [],\n        };\n    });\n}\nexports.setTimestamp = setTimestamp;\n\n\n/***/ }),\n\n/***/ 9791:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Methods = void 0;\nconst common_sdk_1 = __webpack_require__(6259);\nconst ixs = __importStar(__webpack_require__(6802));\nclass Methods {\n    constructor(ctx, ix) {\n        this.ctx = ctx;\n        this.ix = ix;\n    }\n    newDistributor(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.newDistributor(this.ctx.program, params);\n            return this;\n        });\n    }\n    setAdmin(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setAdmin(this.ctx.program, params);\n            return this;\n        });\n    }\n    setTimestamp(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setTimestamp(this.ctx.program, params);\n            return this;\n        });\n    }\n    setMerkleRoot(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setMerkleRoot(this.ctx.program, params);\n            return this;\n        });\n    }\n    setClawbackReceiver(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.setClawbackReceiver(this.ctx.program, params);\n            return this;\n        });\n    }\n    newClaim(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.newClaim(this.ctx.program, params);\n            return this;\n        });\n    }\n    clawback(params) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.ix = yield ixs.clawback(this.ctx.program, params);\n            return this;\n        });\n    }\n    toTx() {\n        const tx = new common_sdk_1.TransactionBuilder(this.ctx.provider.connection, this.ctx.provider.wallet);\n        return this.ix ? tx.addInstruction(this.ix) : tx;\n    }\n}\nexports.Methods = Methods;\n\n\n/***/ }),\n\n/***/ 7719:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.PDA = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst web3_js_1 = __webpack_require__(6737);\nconst constants_1 = __webpack_require__(2535);\nclass PDA {\n    constructor(programId) {\n        this.distributor = (mint, version = new anchor_1.BN(1)) => {\n            const [pda, bump] = web3_js_1.PublicKey.findProgramAddressSync([anchor_1.utils.bytes.utf8.encode(\"MerkleDistributor\"), mint.toBytes(), version.toArrayLike(Buffer, \"le\", 8)], constants_1.PROGRAM_ID);\n            return {\n                key: pda,\n                bump,\n            };\n        };\n        this.claim_status = (claimant, distributor) => {\n            const [pda, bump] = web3_js_1.PublicKey.findProgramAddressSync([\n                anchor_1.utils.bytes.utf8.encode(\"ClaimStatus\"),\n                claimant.toBytes(),\n                distributor.toBytes(),\n            ], constants_1.PROGRAM_ID);\n            return {\n                key: pda,\n                bump,\n            };\n        };\n        this.programId = programId;\n    }\n}\nexports.PDA = PDA;\n\n\n/***/ }),\n\n/***/ 1496:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(9320), exports);\n\n\n/***/ }),\n\n/***/ 9320:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.AccountName = exports.accountsCoder = exports.MerkleDistributorIDL = void 0;\nconst anchor_1 = __webpack_require__(4758);\nconst IDL = __importStar(__webpack_require__(8616));\nexports.MerkleDistributorIDL = IDL;\nexports.accountsCoder = new anchor_1.BorshAccountsCoder(exports.MerkleDistributorIDL);\nvar AccountName;\n(function (AccountName) {\n    AccountName[\"MerkleDistributor\"] = \"MerkleDistributor\";\n    AccountName[\"ClaimStatus\"] = \"ClaimStatus\";\n})(AccountName = exports.AccountName || (exports.AccountName = {}));\n\n\n/***/ }),\n\n/***/ 3162:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.BalanceTree = void 0;\nconst bn_js_1 = __importDefault(__webpack_require__(3550));\nconst js_sha3_1 = __webpack_require__(1094);\nconst merkle_tree_1 = __webpack_require__(2565);\nclass BalanceTree {\n    constructor(balances) {\n        this._tree = new merkle_tree_1.MerkleTree(balances.map(({ account, amount }, index) => {\n            return BalanceTree.toNode(index, account, amount);\n        }));\n    }\n    static verifyProof(index, account, amount, proof, root) {\n        let pair = BalanceTree.toNode(index, account, amount);\n        for (const item of proof) {\n            pair = merkle_tree_1.MerkleTree.combinedHash(pair, item);\n        }\n        return pair.equals(root);\n    }\n    // keccak256(abi.encode(index, account, amount))\n    static toNode(index, account, amount) {\n        let buf = Buffer.concat([\n            new bn_js_1.default(index).toArrayLike(Buffer, \"le\", 8),\n            account.toBuffer(),\n            new bn_js_1.default(amount).toArrayLike(Buffer, \"le\", 8),\n        ]);\n        buf = Buffer.from((0, js_sha3_1.keccak_256)(buf), \"hex\");\n        const LEAF_PREFIX = Buffer.from([0]);\n        buf = Buffer.concat([LEAF_PREFIX, buf]);\n        return Buffer.from((0, js_sha3_1.keccak_256)(buf), \"hex\");\n    }\n    getHexRoot() {\n        return this._tree.getHexRoot();\n    }\n    // returns the hex bytes32 values of the proof\n    getHexProof(index, account, amount) {\n        return this._tree.getHexProof(BalanceTree.toNode(index, account, amount));\n    }\n    getRoot() {\n        return this._tree.getRoot();\n    }\n    getProof(index, account, amount) {\n        return this._tree.getProof(BalanceTree.toNode(index, account, amount));\n    }\n}\nexports.BalanceTree = BalanceTree;\n\n\n/***/ }),\n\n/***/ 5976:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.toBytes32Array = void 0;\nconst tiny_invariant_1 = __importDefault(__webpack_require__(6018));\nconst toBytes32Array = (b) => {\n    (0, tiny_invariant_1.default)(b.length <= 32, `invalid length ${b.length}`);\n    const buf = Buffer.alloc(32);\n    b.copy(buf, 32 - b.length);\n    return Array.from(buf);\n};\nexports.toBytes32Array = toBytes32Array;\n\n\n/***/ }),\n\n/***/ 3067:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getOrCreateATAInstruction = exports.deriveClaimStatus = void 0;\nconst anchor_1 = __webpack_require__(6908);\nconst spl_token_1 = __webpack_require__(4945);\nfunction deriveClaimStatus(claimant, distributor, programId) {\n    return anchor_1.web3.PublicKey.findProgramAddressSync([Buffer.from('ClaimStatus'), claimant.toBytes(), distributor.toBytes()], programId);\n}\nexports.deriveClaimStatus = deriveClaimStatus;\nconst getOrCreateATAInstruction = (tokenMint, owner, connection, allowOwnerOffCurve = true, payer = owner) => __awaiter(void 0, void 0, void 0, function* () {\n    let toAccount;\n    try {\n        toAccount = yield spl_token_1.Token.getAssociatedTokenAddress(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, owner, allowOwnerOffCurve);\n        const account = yield connection.getAccountInfo(toAccount);\n        if (!account) {\n            const ix = spl_token_1.Token.createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, tokenMint, toAccount, owner, payer);\n            return [toAccount, ix];\n        }\n        return [toAccount, undefined];\n    }\n    catch (e) {\n        /* handle error */\n        console.error('Error::getOrCreateATAInstruction', e);\n        throw e;\n    }\n});\nexports.getOrCreateATAInstruction = getOrCreateATAInstruction;\n\n\n/***/ }),\n\n/***/ 2209:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(3162), exports);\n__exportStar(__webpack_require__(5976), exports);\n__exportStar(__webpack_require__(3067), exports);\n__exportStar(__webpack_require__(2565), exports);\n__exportStar(__webpack_require__(9680), exports);\n__exportStar(__webpack_require__(6635), exports);\n\n\n/***/ }),\n\n/***/ 2565:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.MerkleTree = void 0;\nconst js_sha3_1 = __webpack_require__(1094);\nconst tiny_invariant_1 = __importDefault(__webpack_require__(6018));\nconst INTERMEDIATE_PREFIX = Buffer.from([1]);\nfunction getPairElement(idx, layer) {\n    const pairIdx = idx % 2 === 0 ? idx + 1 : idx - 1;\n    if (pairIdx < layer.length) {\n        const pairEl = layer[pairIdx];\n        (0, tiny_invariant_1.default)(pairEl, \"pairEl\");\n        return pairEl;\n    }\n    else {\n        return null;\n    }\n}\nfunction bufDedup(elements) {\n    return elements.filter((el, idx) => {\n        var _a;\n        return idx === 0 || !((_a = elements[idx - 1]) === null || _a === void 0 ? void 0 : _a.equals(el));\n    });\n}\nfunction bufArrToHexArr(arr) {\n    if (arr.some((el) => !Buffer.isBuffer(el))) {\n        throw new Error(\"Array is not an array of buffers\");\n    }\n    return arr.map((el) => \"0x\" + el.toString(\"hex\"));\n}\nfunction sortAndConcat(...args) {\n    const sorted = [...args].sort(Buffer.compare.bind(null));\n    const buf = [INTERMEDIATE_PREFIX];\n    for (const arg of sorted) {\n        buf.push(arg);\n    }\n    return Buffer.concat(buf);\n}\nclass MerkleTree {\n    constructor(elements) {\n        this._elements = [...elements];\n        // Sort elements\n        this._elements.sort(Buffer.compare.bind(null));\n        // Deduplicate elements\n        this._elements = bufDedup(this._elements);\n        this._bufferElementPositionIndex = this._elements.reduce((memo, el, index) => {\n            memo[el.toString(\"hex\")] = index;\n            return memo;\n        }, {});\n        // Create layers\n        this._layers = this.getLayers(this._elements);\n    }\n    getLayers(elements) {\n        var _a, _b;\n        if (elements.length === 0) {\n            throw new Error(\"empty tree\");\n        }\n        const layers = [];\n        layers.push(elements);\n        // Get next layer until we reach the root\n        while (((_b = (_a = layers[layers.length - 1]) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0) > 1) {\n            const nextLayerIndex = layers[layers.length - 1];\n            (0, tiny_invariant_1.default)(nextLayerIndex, \"nextLayerIndex\");\n            layers.push(this.getNextLayer(nextLayerIndex));\n        }\n        return layers;\n    }\n    getNextLayer(elements) {\n        return elements.reduce((layer, el, idx, arr) => {\n            if (idx % 2 === 0) {\n                // Hash the current element with its pair element\n                const pairEl = arr[idx + 1];\n                layer.push(MerkleTree.combinedHash(el, pairEl));\n            }\n            return layer;\n        }, []);\n    }\n    static combinedHash(first, second) {\n        if (!first) {\n            (0, tiny_invariant_1.default)(second, \"second element of pair must exist\");\n            return second;\n        }\n        if (!second) {\n            (0, tiny_invariant_1.default)(first, \"first element of pair must exist\");\n            return first;\n        }\n        return Buffer.from(js_sha3_1.keccak_256.digest(sortAndConcat(first, second)));\n    }\n    getRoot() {\n        var _a;\n        const root = (_a = this._layers[this._layers.length - 1]) === null || _a === void 0 ? void 0 : _a[0];\n        (0, tiny_invariant_1.default)(root, \"root\");\n        return root;\n    }\n    getHexRoot() {\n        return this.getRoot().toString(\"hex\");\n    }\n    getProof(el) {\n        const initialIdx = this._bufferElementPositionIndex[el.toString(\"hex\")];\n        if (typeof initialIdx !== \"number\") {\n            throw new Error(\"Element does not exist in Merkle tree\");\n        }\n        let idx = initialIdx;\n        return this._layers.reduce((proof, layer) => {\n            const pairElement = getPairElement(idx, layer);\n            if (pairElement) {\n                proof.push(pairElement);\n            }\n            idx = Math.floor(idx / 2);\n            return proof;\n        }, []);\n    }\n    getHexProof(el) {\n        const proof = this.getProof(el);\n        return bufArrToHexArr(proof);\n    }\n}\nexports.MerkleTree = MerkleTree;\n\n\n/***/ }),\n\n/***/ 9680:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.createMerkleDistributorProgram = void 0;\nconst anchor_1 = __webpack_require__(6908);\nconst merkle_distributor_1 = __webpack_require__(817);\nfunction createMerkleDistributorProgram(provider, programId) {\n    const program = new anchor_1.Program(merkle_distributor_1.IDL, programId, provider);\n    return program;\n}\nexports.createMerkleDistributorProgram = createMerkleDistributorProgram;\n\n\n/***/ }),\n\n/***/ 6635:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenInstruction = exports.addSigners = void 0;\nconst web3_js_1 = __webpack_require__(6737);\n/** @internal */\nfunction addSigners(keys, ownerOrAuthority, multiSigners) {\n    keys.push({\n        pubkey: ownerOrAuthority,\n        isSigner: multiSigners.length === 0,\n        isWritable: false\n    });\n    for (const signer of multiSigners) {\n        keys.push({\n            pubkey: signer instanceof web3_js_1.PublicKey ? signer : signer.publicKey,\n            isSigner: true,\n            isWritable: false\n        });\n    }\n    return keys;\n}\nexports.addSigners = addSigners;\n/** Instructions defined by the program */\nvar TokenInstruction;\n(function (TokenInstruction) {\n    TokenInstruction[TokenInstruction[\"InitializeMint\"] = 0] = \"InitializeMint\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount\"] = 1] = \"InitializeAccount\";\n    TokenInstruction[TokenInstruction[\"InitializeMultisig\"] = 2] = \"InitializeMultisig\";\n    TokenInstruction[TokenInstruction[\"Transfer\"] = 3] = \"Transfer\";\n    TokenInstruction[TokenInstruction[\"Approve\"] = 4] = \"Approve\";\n    TokenInstruction[TokenInstruction[\"Revoke\"] = 5] = \"Revoke\";\n    TokenInstruction[TokenInstruction[\"SetAuthority\"] = 6] = \"SetAuthority\";\n    TokenInstruction[TokenInstruction[\"MintTo\"] = 7] = \"MintTo\";\n    TokenInstruction[TokenInstruction[\"Burn\"] = 8] = \"Burn\";\n    TokenInstruction[TokenInstruction[\"CloseAccount\"] = 9] = \"CloseAccount\";\n    TokenInstruction[TokenInstruction[\"FreezeAccount\"] = 10] = \"FreezeAccount\";\n    TokenInstruction[TokenInstruction[\"ThawAccount\"] = 11] = \"ThawAccount\";\n    TokenInstruction[TokenInstruction[\"TransferChecked\"] = 12] = \"TransferChecked\";\n    TokenInstruction[TokenInstruction[\"ApproveChecked\"] = 13] = \"ApproveChecked\";\n    TokenInstruction[TokenInstruction[\"MintToChecked\"] = 14] = \"MintToChecked\";\n    TokenInstruction[TokenInstruction[\"BurnChecked\"] = 15] = \"BurnChecked\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount2\"] = 16] = \"InitializeAccount2\";\n    TokenInstruction[TokenInstruction[\"SyncNative\"] = 17] = \"SyncNative\";\n    TokenInstruction[TokenInstruction[\"InitializeAccount3\"] = 18] = \"InitializeAccount3\";\n    TokenInstruction[TokenInstruction[\"InitializeMultisig2\"] = 19] = \"InitializeMultisig2\";\n    TokenInstruction[TokenInstruction[\"InitializeMint2\"] = 20] = \"InitializeMint2\";\n    TokenInstruction[TokenInstruction[\"GetAccountDataSize\"] = 21] = \"GetAccountDataSize\";\n    TokenInstruction[TokenInstruction[\"InitializeImmutableOwner\"] = 22] = \"InitializeImmutableOwner\";\n    TokenInstruction[TokenInstruction[\"AmountToUiAmount\"] = 23] = \"AmountToUiAmount\";\n    TokenInstruction[TokenInstruction[\"UiAmountToAmount\"] = 24] = \"UiAmountToAmount\";\n    TokenInstruction[TokenInstruction[\"InitializeMintCloseAuthority\"] = 25] = \"InitializeMintCloseAuthority\";\n    TokenInstruction[TokenInstruction[\"TransferFeeExtension\"] = 26] = \"TransferFeeExtension\";\n    TokenInstruction[TokenInstruction[\"ConfidentialTransferExtension\"] = 27] = \"ConfidentialTransferExtension\";\n    TokenInstruction[TokenInstruction[\"DefaultAccountStateExtension\"] = 28] = \"DefaultAccountStateExtension\";\n    TokenInstruction[TokenInstruction[\"Reallocate\"] = 29] = \"Reallocate\";\n    TokenInstruction[TokenInstruction[\"MemoTransferExtension\"] = 30] = \"MemoTransferExtension\";\n    TokenInstruction[TokenInstruction[\"CreateNativeMint\"] = 31] = \"CreateNativeMint\";\n    TokenInstruction[TokenInstruction[\"InitializeNonTransferableMint\"] = 32] = \"InitializeNonTransferableMint\";\n    TokenInstruction[TokenInstruction[\"InterestBearingMintExtension\"] = 33] = \"InterestBearingMintExtension\";\n    TokenInstruction[TokenInstruction[\"CpiGuardExtension\"] = 34] = \"CpiGuardExtension\";\n    TokenInstruction[TokenInstruction[\"InitializePermanentDelegate\"] = 35] = \"InitializePermanentDelegate\";\n    TokenInstruction[TokenInstruction[\"TransferHookExtension\"] = 36] = \"TransferHookExtension\";\n    // ConfidentialTransferFeeExtension = 37,\n    // WithdrawalExcessLamports = 38,\n    TokenInstruction[TokenInstruction[\"MetadataPointerExtension\"] = 39] = \"MetadataPointerExtension\";\n    TokenInstruction[TokenInstruction[\"GroupPointerExtension\"] = 40] = \"GroupPointerExtension\";\n    TokenInstruction[TokenInstruction[\"GroupMemberPointerExtension\"] = 41] = \"GroupMemberPointerExtension\";\n})(TokenInstruction = exports.TokenInstruction || (exports.TokenInstruction = {}));\n\n\n/***/ }),\n\n/***/ 6908:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"AccountClient\": function() { return /* binding */ AccountClient; },\n/* harmony export */   \"AnchorError\": function() { return /* binding */ AnchorError; },\n/* harmony export */   \"AnchorProvider\": function() { return /* binding */ AnchorProvider; },\n/* harmony export */   \"BN\": function() { return /* reexport default from dynamic */ bn_js__WEBPACK_IMPORTED_MODULE_2___default.a; },\n/* harmony export */   \"BorshAccountsCoder\": function() { return /* binding */ BorshAccountsCoder; },\n/* harmony export */   \"BorshCoder\": function() { return /* binding */ BorshCoder; },\n/* harmony export */   \"BorshEventCoder\": function() { return /* binding */ BorshEventCoder; },\n/* harmony export */   \"BorshInstructionCoder\": function() { return /* binding */ BorshInstructionCoder; },\n/* harmony export */   \"DISCRIMINATOR_SIZE\": function() { return /* binding */ DISCRIMINATOR_SIZE; },\n/* harmony export */   \"EventManager\": function() { return /* binding */ EventManager; },\n/* harmony export */   \"EventParser\": function() { return /* binding */ EventParser; },\n/* harmony export */   \"IdlError\": function() { return /* binding */ IdlError; },\n/* harmony export */   \"LangErrorCode\": function() { return /* binding */ LangErrorCode; },\n/* harmony export */   \"LangErrorMessage\": function() { return /* binding */ LangErrorMessage; },\n/* harmony export */   \"MethodsBuilderFactory\": function() { return /* binding */ MethodsBuilderFactory; },\n/* harmony export */   \"Native\": function() { return /* binding */ Native; },\n/* harmony export */   \"Program\": function() { return /* binding */ Program; },\n/* harmony export */   \"ProgramError\": function() { return /* binding */ ProgramError; },\n/* harmony export */   \"ProgramErrorStack\": function() { return /* binding */ ProgramErrorStack; },\n/* harmony export */   \"SystemCoder\": function() { return /* binding */ SystemCoder; },\n/* harmony export */   \"eventDiscriminator\": function() { return /* binding */ eventDiscriminator; },\n/* harmony export */   \"getProvider\": function() { return /* binding */ getProvider; },\n/* harmony export */   \"parseIdlErrors\": function() { return /* binding */ parseIdlErrors; },\n/* harmony export */   \"setProvider\": function() { return /* binding */ setProvider; },\n/* harmony export */   \"splitArgsAndCtx\": function() { return /* binding */ splitArgsAndCtx; },\n/* harmony export */   \"toInstruction\": function() { return /* binding */ toInstruction; },\n/* harmony export */   \"translateAddress\": function() { return /* binding */ translateAddress; },\n/* harmony export */   \"translateError\": function() { return /* binding */ translateError; },\n/* harmony export */   \"utils\": function() { return /* binding */ index; },\n/* harmony export */   \"validateAccounts\": function() { return /* binding */ validateAccounts; },\n/* harmony export */   \"web3\": function() { return /* reexport module object */ _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__; }\n/* harmony export */ });\n/* harmony import */ var buffer__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(8764);\n/* harmony import */ var _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6737);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(3550);\n/* harmony import */ var bn_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(bn_js__WEBPACK_IMPORTED_MODULE_2__);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(6486);\n/* harmony import */ var bs58__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(bs58__WEBPACK_IMPORTED_MODULE_3__);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(7370);\n/* harmony import */ var camelcase__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(camelcase__WEBPACK_IMPORTED_MODULE_4__);\n/* harmony import */ var _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(1295);\n/* harmony import */ var _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__);\n/* harmony import */ var _noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(7748);\n/* harmony import */ var pako__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(7885);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(6729);\n/* harmony import */ var eventemitter3__WEBPACK_IMPORTED_MODULE_7___default = /*#__PURE__*/__webpack_require__.n(eventemitter3__WEBPACK_IMPORTED_MODULE_7__);\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\n\n\n\n\n\n\n\n\n\n\n\n\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n    return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n    return \"version\" in tx;\n};\n\nfunction encode$3(data) {\n    return data.reduce((str, byte) => str + byte.toString(16).padStart(2, \"0\"), \"0x\");\n}\nfunction decode$3(data) {\n    if (data.indexOf(\"0x\") === 0) {\n        data = data.substr(2);\n    }\n    if (data.length % 2 === 1) {\n        data = \"0\" + data;\n    }\n    let key = data.match(/.{2}/g);\n    if (key === null) {\n        return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([]);\n    }\n    return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(key.map((byte) => parseInt(byte, 16)));\n}\n\nvar hex = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$3,\n    decode: decode$3\n});\n\nfunction decode$2(array) {\n    const decoder = new TextDecoder(\"utf-8\") // Browser https://caniuse.com/textencoder.\n        ; // Node.\n    return decoder.decode(array);\n}\nfunction encode$2(input) {\n    const encoder = new TextEncoder() // Browser.\n        ; // Node.\n    return encoder.encode(input);\n}\n\nvar utf8 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    decode: decode$2,\n    encode: encode$2\n});\n\nfunction encode$1(data) {\n    return bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(data);\n}\nfunction decode$1(data) {\n    return bs58__WEBPACK_IMPORTED_MODULE_3___default().decode(data);\n}\n\nvar bs58 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode$1,\n    decode: decode$1\n});\n\nfunction encode(data) {\n    return data.toString(\"base64\");\n}\nfunction decode(data) {\n    return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(data, \"base64\");\n}\n\nvar base64 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    encode: encode,\n    decode: decode\n});\n\nvar index$1 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hex: hex,\n    utf8: utf8,\n    bs58: bs58,\n    base64: base64\n});\n\nfunction parseIdlErrors(idl) {\n    const errors = new Map();\n    if (idl.errors) {\n        idl.errors.forEach((e) => {\n            var _a;\n            let msg = (_a = e.msg) !== null && _a !== void 0 ? _a : e.name;\n            errors.set(e.code, msg);\n        });\n    }\n    return errors;\n}\n// Allow either IdLInstruction or IdlStateMethod since the types share fields.\nfunction toInstruction(idlIx, ...args) {\n    if (idlIx.args.length != args.length) {\n        throw new Error(\"Invalid argument length\");\n    }\n    const ix = {};\n    let idx = 0;\n    idlIx.args.forEach((ixArg) => {\n        ix[ixArg.name] = args[idx];\n        idx += 1;\n    });\n    return ix;\n}\n// Throws error if any account required for the `ix` is not given.\nfunction validateAccounts(ixAccounts, accounts = {}) {\n    ixAccounts.forEach((acc) => {\n        if (\"accounts\" in acc) {\n            validateAccounts(acc.accounts, accounts[acc.name]);\n        }\n        else {\n            if (accounts[acc.name] === undefined) {\n                throw new Error(`Invalid arguments: ${acc.name} not provided.`);\n            }\n        }\n    });\n}\n// Translates an address to a Pubkey.\nfunction translateAddress(address) {\n    return address instanceof _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey ? address : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(address);\n}\n\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n  constructor(failure, failures) {\n    let cached;\n    const {\n      message,\n      ...rest\n    } = failure;\n    const {\n      path\n    } = failure;\n    const msg = path.length === 0 ? message : \"At path: \" + path.join('.') + \" -- \" + message;\n    super(msg);\n    this.value = void 0;\n    this.key = void 0;\n    this.type = void 0;\n    this.refinement = void 0;\n    this.path = void 0;\n    this.branch = void 0;\n    this.failures = void 0;\n    Object.assign(this, rest);\n    this.name = this.constructor.name;\n\n    this.failures = () => {\n      var _cached;\n\n      return (_cached = cached) != null ? _cached : cached = [failure, ...failures()];\n    };\n  }\n\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n  return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\n\n\nfunction isObject(x) {\n  return typeof x === 'object' && x != null;\n}\n/**\n * Return a value as a printable string.\n */\n\nfunction print(value) {\n  return typeof value === 'string' ? JSON.stringify(value) : \"\" + value;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\n\nfunction shiftIterator(input) {\n  const {\n    done,\n    value\n  } = input.next();\n  return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\n\nfunction toFailure(result, context, struct, value) {\n  if (result === true) {\n    return;\n  } else if (result === false) {\n    result = {};\n  } else if (typeof result === 'string') {\n    result = {\n      message: result\n    };\n  }\n\n  const {\n    path,\n    branch\n  } = context;\n  const {\n    type\n  } = struct;\n  const {\n    refinement,\n    message = \"Expected a value of type `\" + type + \"`\" + (refinement ? \" with refinement `\" + refinement + \"`\" : '') + \", but received: `\" + print(value) + \"`\"\n  } = result;\n  return {\n    value,\n    type,\n    refinement,\n    key: path[path.length - 1],\n    path,\n    branch,\n    ...result,\n    message\n  };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\n\nfunction* toFailures(result, context, struct, value) {\n  if (!isIterable(result)) {\n    result = [result];\n  }\n\n  for (const r of result) {\n    const failure = toFailure(r, context, struct, value);\n\n    if (failure) {\n      yield failure;\n    }\n  }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\n\nfunction* run(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const {\n    path = [],\n    branch = [value],\n    coerce = false,\n    mask = false\n  } = options;\n  const ctx = {\n    path,\n    branch\n  };\n\n  if (coerce) {\n    value = struct.coercer(value, ctx);\n\n    if (mask && struct.type !== 'type' && isObject(struct.schema) && isObject(value) && !Array.isArray(value)) {\n      for (const key in value) {\n        if (struct.schema[key] === undefined) {\n          delete value[key];\n        }\n      }\n    }\n  }\n\n  let valid = true;\n\n  for (const failure of struct.validator(value, ctx)) {\n    valid = false;\n    yield [failure, undefined];\n  }\n\n  for (let [k, v, s] of struct.entries(value, ctx)) {\n    const ts = run(v, s, {\n      path: k === undefined ? path : [...path, k],\n      branch: k === undefined ? branch : [...branch, v],\n      coerce,\n      mask\n    });\n\n    for (const t of ts) {\n      if (t[0]) {\n        valid = false;\n        yield [t[0], undefined];\n      } else if (coerce) {\n        v = t[1];\n\n        if (k === undefined) {\n          value = v;\n        } else if (value instanceof Map) {\n          value.set(k, v);\n        } else if (value instanceof Set) {\n          value.add(v);\n        } else if (isObject(value)) {\n          value[k] = v;\n        }\n      }\n    }\n  }\n\n  if (valid) {\n    for (const failure of struct.refiner(value, ctx)) {\n      valid = false;\n      yield [failure, undefined];\n    }\n  }\n\n  if (valid) {\n    yield [undefined, value];\n  }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\n\nclass Struct {\n  constructor(props) {\n    this.TYPE = void 0;\n    this.type = void 0;\n    this.schema = void 0;\n    this.coercer = void 0;\n    this.validator = void 0;\n    this.refiner = void 0;\n    this.entries = void 0;\n    const {\n      type,\n      schema,\n      validator,\n      refiner,\n      coercer = value => value,\n      entries = function* () {}\n    } = props;\n    this.type = type;\n    this.schema = schema;\n    this.entries = entries;\n    this.coercer = coercer;\n\n    if (validator) {\n      this.validator = (value, context) => {\n        const result = validator(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.validator = () => [];\n    }\n\n    if (refiner) {\n      this.refiner = (value, context) => {\n        const result = refiner(value, context);\n        return toFailures(result, context, this, value);\n      };\n    } else {\n      this.refiner = () => [];\n    }\n  }\n  /**\n   * Assert that a value passes the struct's validation, throwing if it doesn't.\n   */\n\n\n  assert(value) {\n    return assert(value, this);\n  }\n  /**\n   * Create a value with the struct's coercion logic, then validate it.\n   */\n\n\n  create(value) {\n    return create(value, this);\n  }\n  /**\n   * Check if a value passes the struct's validation.\n   */\n\n\n  is(value) {\n    return is(value, this);\n  }\n  /**\n   * Mask a value, coercing and validating it, but returning only the subset of\n   * properties defined by the struct's schema.\n   */\n\n\n  mask(value) {\n    return mask(value, this);\n  }\n  /**\n   * Validate a value with the struct's validation logic, returning a tuple\n   * representing the result.\n   *\n   * You may optionally pass `true` for the `withCoercion` argument to coerce\n   * the value before attempting to validate it. If you do, the result will\n   * contain the coerced result when successful.\n   */\n\n\n  validate(value, options) {\n    if (options === void 0) {\n      options = {};\n    }\n\n    return validate(value, this, options);\n  }\n\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\n\nfunction assert(value, struct) {\n  const result = validate(value, struct);\n\n  if (result[0]) {\n    throw result[0];\n  }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\n\nfunction create(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\n\nfunction mask(value, struct) {\n  const result = validate(value, struct, {\n    coerce: true,\n    mask: true\n  });\n\n  if (result[0]) {\n    throw result[0];\n  } else {\n    return result[1];\n  }\n}\n/**\n * Check if a value passes a struct.\n */\n\nfunction is(value, struct) {\n  const result = validate(value, struct);\n  return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\n\nfunction validate(value, struct, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  const tuples = run(value, struct, options);\n  const tuple = shiftIterator(tuples);\n\n  if (tuple[0]) {\n    const error = new StructError(tuple[0], function* () {\n      for (const t of tuples) {\n        if (t[0]) {\n          yield t[0];\n        }\n      }\n    });\n    return [error, undefined];\n  } else {\n    const v = tuple[1];\n    return [undefined, v];\n  }\n}\n/**\n * Define a new struct type with a custom validation function.\n */\n\nfunction define(name, validator) {\n  return new Struct({\n    type: name,\n    schema: null,\n    validator\n  });\n}\n\n/**\n * Ensure that any value passes validation.\n */\n\nfunction any() {\n  return define('any', () => true);\n}\nfunction array(Element) {\n  return new Struct({\n    type: 'array',\n    schema: Element,\n\n    *entries(value) {\n      if (Element && Array.isArray(value)) {\n        for (const [i, v] of value.entries()) {\n          yield [i, v, Element];\n        }\n      }\n    },\n\n    coercer(value) {\n      return Array.isArray(value) ? value.slice() : value;\n    },\n\n    validator(value) {\n      return Array.isArray(value) || \"Expected an array value, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value is a boolean.\n */\n\nfunction boolean() {\n  return define('boolean', value => {\n    return typeof value === 'boolean';\n  });\n}\nfunction literal(constant) {\n  const description = print(constant);\n  const t = typeof constant;\n  return new Struct({\n    type: 'literal',\n    schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n\n    validator(value) {\n      return value === constant || \"Expected the literal `\" + description + \"`, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\n\nfunction nullable(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === null || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === null || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a number.\n */\n\nfunction number() {\n  return define('number', value => {\n    return typeof value === 'number' && !isNaN(value) || \"Expected a number, but received: \" + print(value);\n  });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\n\nfunction optional(struct) {\n  return new Struct({ ...struct,\n    validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n    refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx)\n  });\n}\n/**\n * Ensure that a value is a string.\n */\n\nfunction string() {\n  return define('string', value => {\n    return typeof value === 'string' || \"Expected a string, but received: \" + print(value);\n  });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\n\nfunction type(schema) {\n  const keys = Object.keys(schema);\n  return new Struct({\n    type: 'type',\n    schema,\n\n    *entries(value) {\n      if (isObject(value)) {\n        for (const k of keys) {\n          yield [k, value[k], schema[k]];\n        }\n      }\n    },\n\n    validator(value) {\n      return isObject(value) || \"Expected an object, but received: \" + print(value);\n    }\n\n  });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\n\nfunction union$1(Structs) {\n  const description = Structs.map(s => s.type).join(' | ');\n  return new Struct({\n    type: 'union',\n    schema: null,\n\n    coercer(value, ctx) {\n      const firstMatch = Structs.find(s => {\n        const [e] = s.validate(value, {\n          coerce: true\n        });\n        return !e;\n      }) || unknown();\n      return firstMatch.coercer(value, ctx);\n    },\n\n    validator(value, ctx) {\n      const failures = [];\n\n      for (const S of Structs) {\n        const [...tuples] = run(value, S, ctx);\n        const [first] = tuples;\n\n        if (!first[0]) {\n          return [];\n        } else {\n          for (const [failure] of tuples) {\n            if (failure) {\n              failures.push(failure);\n            }\n          }\n        }\n      }\n\n      return [\"Expected the value to satisfy a union of `\" + description + \"`, but received: \" + print(value), ...failures];\n    }\n\n  });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\n\nfunction unknown() {\n  return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\n\nfunction coerce(struct, condition, coercer) {\n  return new Struct({ ...struct,\n    coercer: (value, ctx) => {\n      return is(value, condition) ? struct.coercer(coercer(value, ctx), ctx) : struct.coercer(value, ctx);\n    }\n  });\n}\n\n/**\n * Sends a transaction to a program with the given accounts and instruction\n * data.\n */\nasync function invoke(programId, accounts, data, provider) {\n    programId = translateAddress(programId);\n    if (!provider) {\n        provider = getProvider();\n    }\n    const tx = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.Transaction();\n    tx.add(new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.TransactionInstruction({\n        programId,\n        keys: accounts !== null && accounts !== void 0 ? accounts : [],\n        data,\n    }));\n    if (provider.sendAndConfirm === undefined) {\n        throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n    }\n    return await provider.sendAndConfirm(tx, []);\n}\nconst GET_MULTIPLE_ACCOUNTS_LIMIT = 99;\nasync function getMultipleAccounts(connection, publicKeys, commitment) {\n    const results = await getMultipleAccountsAndContext(connection, publicKeys, commitment);\n    return results.map((result) => {\n        return result\n            ? { publicKey: result.publicKey, account: result.account }\n            : null;\n    });\n}\nasync function getMultipleAccountsAndContext(connection, publicKeys, commitment) {\n    if (publicKeys.length <= GET_MULTIPLE_ACCOUNTS_LIMIT) {\n        return await getMultipleAccountsAndContextCore(connection, publicKeys, commitment);\n    }\n    else {\n        const batches = chunks(publicKeys, GET_MULTIPLE_ACCOUNTS_LIMIT);\n        const results = await Promise.all(batches.map((batch) => getMultipleAccountsAndContextCore(connection, batch, commitment)));\n        return results.flat();\n    }\n}\nasync function getMultipleAccountsAndContextCore(connection, publicKeys, commitmentOverride) {\n    const commitment = commitmentOverride !== null && commitmentOverride !== void 0 ? commitmentOverride : connection.commitment;\n    const { value: accountInfos, context } = await connection.getMultipleAccountsInfoAndContext(publicKeys, commitment);\n    const accounts = accountInfos.map((account, idx) => {\n        if (account === null) {\n            return null;\n        }\n        return {\n            publicKey: publicKeys[idx],\n            account,\n            context,\n        };\n    });\n    return accounts;\n}\n// copy from @solana/web3.js that has a commitment param\nasync function simulateTransaction(connection, transaction, signers, commitment, includeAccounts) {\n    var _a;\n    if (signers && signers.length > 0) {\n        transaction.sign(...signers);\n    }\n    // @ts-expect-error\n    const message = transaction._compile();\n    const signData = message.serialize();\n    // @ts-expect-error\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = {\n        encoding: \"base64\",\n        commitment: commitment !== null && commitment !== void 0 ? commitment : connection.commitment,\n    };\n    if (includeAccounts) {\n        const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map((key) => key.toBase58());\n        config[\"accounts\"] = {\n            encoding: \"base64\",\n            addresses,\n        };\n    }\n    if (signers) {\n        config.sigVerify = true;\n    }\n    const args = [encodedTransaction, config];\n    // @ts-expect-error\n    const unsafeRes = await connection._rpcRequest(\"simulateTransaction\", args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if (\"error\" in res) {\n        let logs;\n        if (\"data\" in res.error) {\n            logs = (_a = res.error.data) === null || _a === void 0 ? void 0 : _a.logs;\n            if (logs && Array.isArray(logs)) {\n                const traceIndent = \"\\n    \";\n                const logTrace = traceIndent + logs.join(traceIndent);\n                console.error(res.error.message, logTrace);\n            }\n        }\n        throw new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(\"failed to simulate transaction: \" + res.error.message, logs);\n    }\n    return res.result;\n}\n// copy from @solana/web3.js\nfunction jsonRpcResult(schema) {\n    return coerce(createRpcResult(schema), UnknownRpcResult, (value) => {\n        if (\"error\" in value) {\n            return value;\n        }\n        else {\n            return {\n                ...value,\n                result: create(value.result, schema),\n            };\n        }\n    });\n}\n// copy from @solana/web3.js\nconst UnknownRpcResult = createRpcResult(unknown());\n// copy from @solana/web3.js\nfunction createRpcResult(result) {\n    return union$1([\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            result,\n        }),\n        type({\n            jsonrpc: literal(\"2.0\"),\n            id: string(),\n            error: type({\n                code: unknown(),\n                message: string(),\n                data: optional(any()),\n            }),\n        }),\n    ]);\n}\n// copy from @solana/web3.js\nfunction jsonRpcResultAndContext(value) {\n    return jsonRpcResult(type({\n        context: type({\n            slot: number(),\n        }),\n        value,\n    }));\n}\n// copy from @solana/web3.js\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n    err: nullable(union$1([type({}), string()])),\n    logs: nullable(array(string())),\n    accounts: optional(nullable(array(nullable(type({\n        executable: boolean(),\n        owner: string(),\n        lamports: number(),\n        data: array(string()),\n        rentEpoch: optional(number()),\n    }))))),\n    unitsConsumed: optional(number()),\n}));\n\nvar rpc = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    invoke: invoke,\n    getMultipleAccounts: getMultipleAccounts,\n    getMultipleAccountsAndContext: getMultipleAccountsAndContext,\n    simulateTransaction: simulateTransaction\n});\n\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n */\nclass AnchorProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, wallet, opts) {\n        this.connection = connection;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.publicKey = wallet === null || wallet === void 0 ? void 0 : wallet.publicKey;\n    }\n    static defaultOptions() {\n        return {\n            preflightCommitment: \"processed\",\n            commitment: \"processed\",\n        };\n    }\n    /**\n     * Returns a `Provider` with a wallet read from the local filesystem.\n     *\n     * @param url  The network cluster url.\n     * @param opts The default transaction confirmation options.\n     *\n     * (This api is for Node only.)\n     */\n    static local(url, opts) {\n        {\n            throw new Error(`Provider local is not available on browser.`);\n        }\n    }\n    /**\n     * Returns a `Provider` read from the `ANCHOR_PROVIDER_URL` environment\n     * variable\n     *\n     * (This api is for Node only.)\n     */\n    static env() {\n        {\n            throw new Error(`Provider env is not available on browser.`);\n        }\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sendAndConfirm(tx, signers, opts) {\n        var _a, _b, _c, _d;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n            }\n        }\n        else {\n            tx.feePayer = (_a = tx.feePayer) !== null && _a !== void 0 ? _a : this.wallet.publicKey;\n            tx.recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n            if (signers) {\n                for (const signer of signers) {\n                    tx.partialSign(signer);\n                }\n            }\n        }\n        tx = await this.wallet.signTransaction(tx);\n        const rawTx = tx.serialize();\n        try {\n            return await sendAndConfirmRawTransaction(this.connection, rawTx, opts);\n        }\n        catch (err) {\n            // thrown if the underlying 'confirmTransaction' encounters a failed tx\n            // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n            if (err instanceof ConfirmError) {\n                // choose the shortest available commitment for 'getTransaction'\n                // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                // commitment `sendAndConfirmRawTransaction` used\n                const txSig = encode$1(isVersionedTransaction(tx)\n                    ? ((_b = tx.signatures) === null || _b === void 0 ? void 0 : _b[0]) || new Uint8Array()\n                    : (_c = tx.signature) !== null && _c !== void 0 ? _c : new Uint8Array());\n                const failedTx = await this.connection.getTransaction(txSig, {\n                    commitment: \"confirmed\",\n                });\n                if (!failedTx) {\n                    throw err;\n                }\n                else {\n                    const logs = (_d = failedTx.meta) === null || _d === void 0 ? void 0 : _d.logMessages;\n                    throw !logs ? err : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(err.message, logs);\n                }\n            }\n            else {\n                throw err;\n            }\n        }\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     * All transactions need to be of the same type, it doesn't support a mix of `VersionedTransaction`s and `Transaction`s.\n     *\n     * @param txWithSigners Array of transactions and signers.\n     * @param opts          Transaction confirmation options.\n     */\n    async sendAll(txWithSigners, opts) {\n        var _a, _b, _c;\n        if (opts === undefined) {\n            opts = this.opts;\n        }\n        const recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n        let txs = txWithSigners.map((r) => {\n            var _a, _b;\n            if (isVersionedTransaction(r.tx)) {\n                let tx = r.tx;\n                if (r.signers) {\n                    tx.sign(r.signers);\n                }\n                return tx;\n            }\n            else {\n                let tx = r.tx;\n                let signers = (_a = r.signers) !== null && _a !== void 0 ? _a : [];\n                tx.feePayer = (_b = tx.feePayer) !== null && _b !== void 0 ? _b : this.wallet.publicKey;\n                tx.recentBlockhash = recentBlockhash;\n                signers.forEach((kp) => {\n                    tx.partialSign(kp);\n                });\n                return tx;\n            }\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        const sigs = [];\n        for (let k = 0; k < txs.length; k += 1) {\n            const tx = signedTxs[k];\n            const rawTx = tx.serialize();\n            try {\n                sigs.push(await sendAndConfirmRawTransaction(this.connection, rawTx, opts));\n            }\n            catch (err) {\n                // thrown if the underlying 'confirmTransaction' encounters a failed tx\n                // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n                if (err instanceof ConfirmError) {\n                    // choose the shortest available commitment for 'getTransaction'\n                    // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n                    // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n                    // commitment `sendAndConfirmRawTransaction` used\n                    const txSig = encode$1(isVersionedTransaction(tx)\n                        ? ((_a = tx.signatures) === null || _a === void 0 ? void 0 : _a[0]) || new Uint8Array()\n                        : (_b = tx.signature) !== null && _b !== void 0 ? _b : new Uint8Array());\n                    const failedTx = await this.connection.getTransaction(txSig, {\n                        commitment: \"confirmed\",\n                    });\n                    if (!failedTx) {\n                        throw err;\n                    }\n                    else {\n                        const logs = (_c = failedTx.meta) === null || _c === void 0 ? void 0 : _c.logMessages;\n                        throw !logs ? err : new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SendTransactionError(err.message, logs);\n                    }\n                }\n                else {\n                    throw err;\n                }\n            }\n        }\n        return sigs;\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The signers of the transaction. If unset, the transaction\n     *                will be simulated with the \"sigVerify: false\" option. This\n     *                allows for simulation of transactions without asking the\n     *                wallet for a signature.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, commitment, includeAccounts) {\n        let recentBlockhash = (await this.connection.getLatestBlockhash(commitment !== null && commitment !== void 0 ? commitment : this.connection.commitment)).blockhash;\n        let result;\n        if (isVersionedTransaction(tx)) {\n            if (signers) {\n                tx.sign(signers);\n                tx = await this.wallet.signTransaction(tx);\n            }\n            // Doesn't support includeAccounts which has been changed to something\n            // else in later versions of this function.\n            result = await this.connection.simulateTransaction(tx, { commitment });\n        }\n        else {\n            tx.feePayer = tx.feePayer || this.wallet.publicKey;\n            tx.recentBlockhash = recentBlockhash;\n            if (signers) {\n                tx = await this.wallet.signTransaction(tx);\n            }\n            result = await simulateTransaction(this.connection, tx, signers, commitment, includeAccounts);\n        }\n        if (result.value.err) {\n            throw new SimulateError(result.value);\n        }\n        return result.value;\n    }\n}\nclass SimulateError extends Error {\n    constructor(simulationResponse, message) {\n        super(message);\n        this.simulationResponse = simulationResponse;\n    }\n}\n// Copy of Connection.sendAndConfirmRawTransaction that throws\n// a better error if 'confirmTransaction` returns an error status\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, options) {\n    const sendOptions = options && {\n        skipPreflight: options.skipPreflight,\n        preflightCommitment: options.preflightCommitment || options.commitment,\n    };\n    const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n    const status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n    if (status.err) {\n        throw new ConfirmError(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n    }\n    return signature;\n}\nclass ConfirmError extends Error {\n    constructor(message) {\n        super(message);\n    }\n}\n/**\n * Sets the default provider on the client.\n */\nfunction setProvider(provider) {\n    _provider = provider;\n}\n/**\n * Returns the default provider being used by the client.\n */\nfunction getProvider() {\n    if (_provider === null) {\n        return AnchorProvider.local();\n    }\n    return _provider;\n}\n// Global provider used as the default when a provider is not given.\nlet _provider = null;\n\nconst _AVAILABLE_FEATURES = new Set([\"anchor-deprecated-state\", \"debug-logs\"]);\nconst _FEATURES = new Map();\nfunction set(key) {\n    if (!_AVAILABLE_FEATURES.has(key)) {\n        throw new Error(\"Invalid feature\");\n    }\n    _FEATURES.set(key, true);\n}\nfunction isSet(key) {\n    return _FEATURES.get(key) !== undefined;\n}\n\nvar features = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    set: set,\n    isSet: isSet\n});\n\nclass IdlError extends Error {\n    constructor(message) {\n        super(message);\n        this.name = \"IdlError\";\n    }\n}\nclass ProgramErrorStack {\n    constructor(stack) {\n        this.stack = stack;\n    }\n    static parse(logs) {\n        var _a;\n        const programKeyRegex = /^Program (\\w*) invoke/;\n        const successRegex = /^Program \\w* success/;\n        const programStack = [];\n        for (let i = 0; i < logs.length; i++) {\n            if (successRegex.exec(logs[i])) {\n                programStack.pop();\n                continue;\n            }\n            const programKey = (_a = programKeyRegex.exec(logs[i])) === null || _a === void 0 ? void 0 : _a[1];\n            if (!programKey) {\n                continue;\n            }\n            programStack.push(new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(programKey));\n        }\n        return new ProgramErrorStack(programStack);\n    }\n}\nclass AnchorError extends Error {\n    constructor(errorCode, errorMessage, errorLogs, logs, origin, comparedValues) {\n        super(errorLogs.join(\"\\n\").replace(\"Program log: \", \"\"));\n        this.errorLogs = errorLogs;\n        this.logs = logs;\n        this.error = { errorCode, errorMessage, comparedValues, origin };\n        this._programErrorStack = ProgramErrorStack.parse(logs);\n    }\n    static parse(logs) {\n        if (!logs) {\n            return null;\n        }\n        const anchorErrorLogIndex = logs.findIndex((log) => log.startsWith(\"Program log: AnchorError\"));\n        if (anchorErrorLogIndex === -1) {\n            return null;\n        }\n        const anchorErrorLog = logs[anchorErrorLogIndex];\n        const errorLogs = [anchorErrorLog];\n        let comparedValues;\n        if (anchorErrorLogIndex + 1 < logs.length) {\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left:\n            // <Pubkey>\n            // Right:\n            // <Pubkey>\n            if (logs[anchorErrorLogIndex + 1] === \"Program log: Left:\") {\n                const pubkeyRegex = /^Program log: (.*)$/;\n                const leftPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 2])[1];\n                const rightPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 4])[1];\n                comparedValues = [\n                    new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(leftPubkey),\n                    new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(rightPubkey),\n                ];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 5));\n            }\n            // This catches the comparedValues where the following is logged\n            // <AnchorError>\n            // Left: <value>\n            // Right: <value>\n            else if (logs[anchorErrorLogIndex + 1].startsWith(\"Program log: Left:\")) {\n                const valueRegex = /^Program log: (Left|Right): (.*)$/;\n                const leftValue = valueRegex.exec(logs[anchorErrorLogIndex + 1])[2];\n                const rightValue = valueRegex.exec(logs[anchorErrorLogIndex + 2])[2];\n                errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 3));\n                comparedValues = [leftValue, rightValue];\n            }\n        }\n        const regexNoInfo = /^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const noInfoAnchorErrorLog = regexNoInfo.exec(anchorErrorLog);\n        const regexFileLine = /^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const fileLineAnchorErrorLog = regexFileLine.exec(anchorErrorLog);\n        const regexAccountName = /^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n        const accountNameAnchorErrorLog = regexAccountName.exec(anchorErrorLog);\n        if (noInfoAnchorErrorLog) {\n            const [errorCodeString, errorNumber, errorMessage] = noInfoAnchorErrorLog.slice(1, 4);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, undefined, comparedValues);\n        }\n        else if (fileLineAnchorErrorLog) {\n            const [file, line, errorCodeString, errorNumber, errorMessage] = fileLineAnchorErrorLog.slice(1, 6);\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            const fileLine = { file, line: parseInt(line) };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, fileLine, comparedValues);\n        }\n        else if (accountNameAnchorErrorLog) {\n            const [accountName, errorCodeString, errorNumber, errorMessage] = accountNameAnchorErrorLog.slice(1, 5);\n            const origin = accountName;\n            const errorCode = {\n                code: errorCodeString,\n                number: parseInt(errorNumber),\n            };\n            return new AnchorError(errorCode, errorMessage, errorLogs, logs, origin, comparedValues);\n        }\n        else {\n            return null;\n        }\n    }\n    get program() {\n        return this._programErrorStack.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        return this._programErrorStack.stack;\n    }\n    toString() {\n        return this.message;\n    }\n}\n// An error from a user defined program.\nclass ProgramError extends Error {\n    constructor(code, msg, logs) {\n        super();\n        this.code = code;\n        this.msg = msg;\n        this.logs = logs;\n        if (logs) {\n            this._programErrorStack = ProgramErrorStack.parse(logs);\n        }\n    }\n    static parse(err, idlErrors) {\n        const errString = err.toString();\n        // TODO: don't rely on the error string. web3.js should preserve the error\n        //       code information instead of giving us an untyped string.\n        let unparsedErrorCode;\n        if (errString.includes(\"custom program error:\")) {\n            let components = errString.split(\"custom program error: \");\n            if (components.length !== 2) {\n                return null;\n            }\n            else {\n                unparsedErrorCode = components[1];\n            }\n        }\n        else {\n            const matches = errString.match(/\"Custom\":([0-9]+)}/g);\n            if (!matches || matches.length > 1) {\n                return null;\n            }\n            unparsedErrorCode = matches[0].match(/([0-9]+)/g)[0];\n        }\n        let errorCode;\n        try {\n            errorCode = parseInt(unparsedErrorCode);\n        }\n        catch (parseErr) {\n            return null;\n        }\n        // Parse user error.\n        let errorMsg = idlErrors.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Parse framework internal error.\n        errorMsg = LangErrorMessage.get(errorCode);\n        if (errorMsg !== undefined) {\n            return new ProgramError(errorCode, errorMsg, err.logs);\n        }\n        // Unable to parse the error. Just return the untranslated error.\n        return null;\n    }\n    get program() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack[this._programErrorStack.stack.length - 1];\n    }\n    get programErrorStack() {\n        var _a;\n        return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack;\n    }\n    toString() {\n        return this.msg;\n    }\n}\nfunction translateError(err, idlErrors) {\n    if (isSet(\"debug-logs\")) {\n        console.log(\"Translating error:\", err);\n    }\n    const anchorError = AnchorError.parse(err.logs);\n    if (anchorError) {\n        return anchorError;\n    }\n    const programError = ProgramError.parse(err, idlErrors);\n    if (programError) {\n        return programError;\n    }\n    if (err.logs) {\n        const handler = {\n            get: function (target, prop) {\n                if (prop === \"programErrorStack\") {\n                    return target.programErrorStack.stack;\n                }\n                else if (prop === \"program\") {\n                    return target.programErrorStack.stack[err.programErrorStack.stack.length - 1];\n                }\n                else {\n                    // this is the normal way to return all other props\n                    // without modifying them.\n                    // @ts-expect-error\n                    return Reflect.get(...arguments);\n                }\n            },\n        };\n        err.programErrorStack = ProgramErrorStack.parse(err.logs);\n        return new Proxy(err, handler);\n    }\n    return err;\n}\nconst LangErrorCode = {\n    // Instructions.\n    InstructionMissing: 100,\n    InstructionFallbackNotFound: 101,\n    InstructionDidNotDeserialize: 102,\n    InstructionDidNotSerialize: 103,\n    // IDL instructions.\n    IdlInstructionStub: 1000,\n    IdlInstructionInvalidProgram: 1001,\n    // Constraints.\n    ConstraintMut: 2000,\n    ConstraintHasOne: 2001,\n    ConstraintSigner: 2002,\n    ConstraintRaw: 2003,\n    ConstraintOwner: 2004,\n    ConstraintRentExempt: 2005,\n    ConstraintSeeds: 2006,\n    ConstraintExecutable: 2007,\n    ConstraintState: 2008,\n    ConstraintAssociated: 2009,\n    ConstraintAssociatedInit: 2010,\n    ConstraintClose: 2011,\n    ConstraintAddress: 2012,\n    ConstraintZero: 2013,\n    ConstraintTokenMint: 2014,\n    ConstraintTokenOwner: 2015,\n    ConstraintMintMintAuthority: 2016,\n    ConstraintMintFreezeAuthority: 2017,\n    ConstraintMintDecimals: 2018,\n    ConstraintSpace: 2019,\n    ConstraintAccountIsNone: 2020,\n    // Require.\n    RequireViolated: 2500,\n    RequireEqViolated: 2501,\n    RequireKeysEqViolated: 2502,\n    RequireNeqViolated: 2503,\n    RequireKeysNeqViolated: 2504,\n    RequireGtViolated: 2505,\n    RequireGteViolated: 2506,\n    // Accounts.\n    AccountDiscriminatorAlreadySet: 3000,\n    AccountDiscriminatorNotFound: 3001,\n    AccountDiscriminatorMismatch: 3002,\n    AccountDidNotDeserialize: 3003,\n    AccountDidNotSerialize: 3004,\n    AccountNotEnoughKeys: 3005,\n    AccountNotMutable: 3006,\n    AccountOwnedByWrongProgram: 3007,\n    InvalidProgramId: 3008,\n    InvalidProgramExecutable: 3009,\n    AccountNotSigner: 3010,\n    AccountNotSystemOwned: 3011,\n    AccountNotInitialized: 3012,\n    AccountNotProgramData: 3013,\n    AccountNotAssociatedTokenAccount: 3014,\n    AccountSysvarMismatch: 3015,\n    AccountReallocExceedsLimit: 3016,\n    AccountDuplicateReallocs: 3017,\n    // Miscellaneous\n    DeclaredProgramIdMismatch: 4100,\n    // Used for APIs that shouldn't be used anymore.\n    Deprecated: 5000,\n};\nconst LangErrorMessage = new Map([\n    // Instructions.\n    [\n        LangErrorCode.InstructionMissing,\n        \"8 byte instruction identifier not provided\",\n    ],\n    [\n        LangErrorCode.InstructionFallbackNotFound,\n        \"Fallback functions are not supported\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotDeserialize,\n        \"The program could not deserialize the given instruction\",\n    ],\n    [\n        LangErrorCode.InstructionDidNotSerialize,\n        \"The program could not serialize the given instruction\",\n    ],\n    // Idl instructions.\n    [\n        LangErrorCode.IdlInstructionStub,\n        \"The program was compiled without idl instructions\",\n    ],\n    [\n        LangErrorCode.IdlInstructionInvalidProgram,\n        \"The transaction was given an invalid program for the IDL instruction\",\n    ],\n    // Constraints.\n    [LangErrorCode.ConstraintMut, \"A mut constraint was violated\"],\n    [LangErrorCode.ConstraintHasOne, \"A has one constraint was violated\"],\n    [LangErrorCode.ConstraintSigner, \"A signer constraint was violated\"],\n    [LangErrorCode.ConstraintRaw, \"A raw constraint was violated\"],\n    [LangErrorCode.ConstraintOwner, \"An owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintRentExempt,\n        \"A rent exemption constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSeeds, \"A seeds constraint was violated\"],\n    [LangErrorCode.ConstraintExecutable, \"An executable constraint was violated\"],\n    [\n        LangErrorCode.ConstraintState,\n        \"Deprecated Error, feel free to replace with something else\",\n    ],\n    [LangErrorCode.ConstraintAssociated, \"An associated constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAssociatedInit,\n        \"An associated init constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintClose, \"A close constraint was violated\"],\n    [LangErrorCode.ConstraintAddress, \"An address constraint was violated\"],\n    [LangErrorCode.ConstraintZero, \"Expected zero account discriminant\"],\n    [LangErrorCode.ConstraintTokenMint, \"A token mint constraint was violated\"],\n    [LangErrorCode.ConstraintTokenOwner, \"A token owner constraint was violated\"],\n    [\n        LangErrorCode.ConstraintMintMintAuthority,\n        \"A mint mint authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintFreezeAuthority,\n        \"A mint freeze authority constraint was violated\",\n    ],\n    [\n        LangErrorCode.ConstraintMintDecimals,\n        \"A mint decimals constraint was violated\",\n    ],\n    [LangErrorCode.ConstraintSpace, \"A space constraint was violated\"],\n    [\n        LangErrorCode.ConstraintAccountIsNone,\n        \"A required account for the constraint is None\",\n    ],\n    // Require.\n    [LangErrorCode.RequireViolated, \"A require expression was violated\"],\n    [LangErrorCode.RequireEqViolated, \"A require_eq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysEqViolated,\n        \"A require_keys_eq expression was violated\",\n    ],\n    [LangErrorCode.RequireNeqViolated, \"A require_neq expression was violated\"],\n    [\n        LangErrorCode.RequireKeysNeqViolated,\n        \"A require_keys_neq expression was violated\",\n    ],\n    [LangErrorCode.RequireGtViolated, \"A require_gt expression was violated\"],\n    [LangErrorCode.RequireGteViolated, \"A require_gte expression was violated\"],\n    // Accounts.\n    [\n        LangErrorCode.AccountDiscriminatorAlreadySet,\n        \"The account discriminator was already set on this account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorNotFound,\n        \"No 8 byte discriminator was found on the account\",\n    ],\n    [\n        LangErrorCode.AccountDiscriminatorMismatch,\n        \"8 byte discriminator did not match what was expected\",\n    ],\n    [LangErrorCode.AccountDidNotDeserialize, \"Failed to deserialize the account\"],\n    [LangErrorCode.AccountDidNotSerialize, \"Failed to serialize the account\"],\n    [\n        LangErrorCode.AccountNotEnoughKeys,\n        \"Not enough account keys given to the instruction\",\n    ],\n    [LangErrorCode.AccountNotMutable, \"The given account is not mutable\"],\n    [\n        LangErrorCode.AccountOwnedByWrongProgram,\n        \"The given account is owned by a different program than expected\",\n    ],\n    [LangErrorCode.InvalidProgramId, \"Program ID was not as expected\"],\n    [LangErrorCode.InvalidProgramExecutable, \"Program account is not executable\"],\n    [LangErrorCode.AccountNotSigner, \"The given account did not sign\"],\n    [\n        LangErrorCode.AccountNotSystemOwned,\n        \"The given account is not owned by the system program\",\n    ],\n    [\n        LangErrorCode.AccountNotInitialized,\n        \"The program expected this account to be already initialized\",\n    ],\n    [\n        LangErrorCode.AccountNotProgramData,\n        \"The given account is not a program data account\",\n    ],\n    [\n        LangErrorCode.AccountNotAssociatedTokenAccount,\n        \"The given account is not the associated token account\",\n    ],\n    [\n        LangErrorCode.AccountSysvarMismatch,\n        \"The given public key does not match the required sysvar\",\n    ],\n    [\n        LangErrorCode.AccountReallocExceedsLimit,\n        \"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\",\n    ],\n    [\n        LangErrorCode.AccountDuplicateReallocs,\n        \"The account was duplicated for more than one reallocation\",\n    ],\n    // Miscellaneous\n    [\n        LangErrorCode.DeclaredProgramIdMismatch,\n        \"The declared program id does not match the actual program id\",\n    ],\n    // Deprecated\n    [\n        LangErrorCode.Deprecated,\n        \"The API being used is deprecated and should no longer be used\",\n    ],\n]);\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign$1 = function() {\r\n    __assign$1 = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    };\r\n    return __assign$1.apply(this, arguments);\r\n};\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    };\r\n    return __assign.apply(this, arguments);\r\n};\n\n/**\n * Source: ftp://ftp.unicode.org/Public/UCD/latest/ucd/SpecialCasing.txt\n */\n/**\n * Lower case as a function.\n */\nfunction lowerCase(str) {\n    return str.toLowerCase();\n}\n\n// Support camel case (\"camelCase\" -> \"camel Case\" and \"CAMELCase\" -> \"CAMEL Case\").\nvar DEFAULT_SPLIT_REGEXP = [/([a-z0-9])([A-Z])/g, /([A-Z])([A-Z][a-z])/g];\n// Remove all non-word characters.\nvar DEFAULT_STRIP_REGEXP = /[^A-Z0-9]+/gi;\n/**\n * Normalize the string into something other libraries can manipulate easier.\n */\nfunction noCase(input, options) {\n    if (options === void 0) { options = {}; }\n    var _a = options.splitRegexp, splitRegexp = _a === void 0 ? DEFAULT_SPLIT_REGEXP : _a, _b = options.stripRegexp, stripRegexp = _b === void 0 ? DEFAULT_STRIP_REGEXP : _b, _c = options.transform, transform = _c === void 0 ? lowerCase : _c, _d = options.delimiter, delimiter = _d === void 0 ? \" \" : _d;\n    var result = replace(replace(input, splitRegexp, \"$1\\0$2\"), stripRegexp, \"\\0\");\n    var start = 0;\n    var end = result.length;\n    // Trim the delimiter from around the output string.\n    while (result.charAt(start) === \"\\0\")\n        start++;\n    while (result.charAt(end - 1) === \"\\0\")\n        end--;\n    // Transform each token independently.\n    return result.slice(start, end).split(\"\\0\").map(transform).join(delimiter);\n}\n/**\n * Replace `re` in the input string with the replacement value.\n */\nfunction replace(input, re, value) {\n    if (re instanceof RegExp)\n        return input.replace(re, value);\n    return re.reduce(function (input, re) { return input.replace(re, value); }, input);\n}\n\nfunction dotCase(input, options) {\n    if (options === void 0) { options = {}; }\n    return noCase(input, __assign({ delimiter: \".\" }, options));\n}\n\nfunction snakeCase(input, options) {\n    if (options === void 0) { options = {}; }\n    return dotCase(input, __assign$1({ delimiter: \"_\" }, options));\n}\n\nclass IdlCoder {\n    static fieldLayout(field, types) {\n        const fieldName = field.name !== undefined ? camelcase__WEBPACK_IMPORTED_MODULE_4___default()(field.name) : undefined;\n        switch (field.type) {\n            case \"bool\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.bool(fieldName);\n            }\n            case \"u8\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u8(fieldName);\n            }\n            case \"i8\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i8(fieldName);\n            }\n            case \"u16\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u16(fieldName);\n            }\n            case \"i16\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i16(fieldName);\n            }\n            case \"u32\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u32(fieldName);\n            }\n            case \"i32\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i32(fieldName);\n            }\n            case \"f32\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.f32(fieldName);\n            }\n            case \"u64\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u64(fieldName);\n            }\n            case \"i64\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i64(fieldName);\n            }\n            case \"f64\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.f64(fieldName);\n            }\n            case \"u128\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u128(fieldName);\n            }\n            case \"i128\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i128(fieldName);\n            }\n            case \"u256\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u256(fieldName);\n            }\n            case \"i256\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.i256(fieldName);\n            }\n            case \"bytes\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.vecU8(fieldName);\n            }\n            case \"string\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.str(fieldName);\n            }\n            case \"publicKey\": {\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(fieldName);\n            }\n            default: {\n                if (\"vec\" in field.type) {\n                    return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.vec(IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: field.type.vec,\n                    }, types), fieldName);\n                }\n                else if (\"option\" in field.type) {\n                    return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.option(IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: field.type.option,\n                    }, types), fieldName);\n                }\n                else if (\"defined\" in field.type) {\n                    // User defined type.\n                    if (!types) {\n                        throw new IdlError(\"User defined types not provided\");\n                    }\n                    const defined = field.type.defined;\n                    const filtered = types.filter((t) => t.name === defined);\n                    if (filtered.length !== 1) {\n                        throw new IdlError(`Type not found: ${JSON.stringify(field)}`);\n                    }\n                    return IdlCoder.typeDefLayout(filtered[0], types, fieldName);\n                }\n                else if (\"array\" in field.type) {\n                    let arrayTy = field.type.array[0];\n                    let arrayLen = field.type.array[1];\n                    let innerLayout = IdlCoder.fieldLayout({\n                        name: undefined,\n                        type: arrayTy,\n                    }, types);\n                    return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.array(innerLayout, arrayLen, fieldName);\n                }\n                else {\n                    throw new Error(`Not yet implemented: ${field}`);\n                }\n            }\n        }\n    }\n    static typeDefLayout(typeDef, types = [], name) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const fieldLayouts = typeDef.type.fields.map((field) => {\n                    return IdlCoder.fieldLayout(field, types);\n                });\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct(fieldLayouts, name);\n            }\n            case \"enum\": {\n                let variants = typeDef.type.variants.map((variant) => {\n                    const name = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(variant.name);\n                    if (!variant.fields) {\n                        return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([], name);\n                    }\n                    const fieldLayouts = variant.fields.map((f, i) => {\n                        if (f === null || f === void 0 ? void 0 : f.name) {\n                            return IdlCoder.fieldLayout(f, types);\n                        }\n                        return IdlCoder.fieldLayout({ type: f, name: i.toString() }, types);\n                    });\n                    return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct(fieldLayouts, name);\n                });\n                if (name !== undefined) {\n                    // Buffer-layout lib requires the name to be null (on construction)\n                    // when used as a field.\n                    return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.rustEnum(variants).replicate(name);\n                }\n                return _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.rustEnum(variants, name);\n            }\n            case \"alias\": {\n                return IdlCoder.fieldLayout({ type: typeDef.type.value, name: typeDef.name }, types);\n            }\n        }\n    }\n}\n\n/**\n * Namespace for global instruction function signatures (i.e. functions\n * that aren't namespaced by the state or any of its trait implementations).\n */\nconst SIGHASH_GLOBAL_NAMESPACE = \"global\";\n/**\n * Encodes and decodes program instructions.\n */\nclass BorshInstructionCoder {\n    constructor(idl) {\n        this.idl = idl;\n        this.ixLayout = BorshInstructionCoder.parseIxLayout(idl);\n        const sighashLayouts = new Map();\n        idl.instructions.forEach((ix) => {\n            const sh = sighash(SIGHASH_GLOBAL_NAMESPACE, ix.name);\n            sighashLayouts.set(bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(sh), {\n                layout: this.ixLayout.get(ix.name),\n                name: ix.name,\n            });\n        });\n        this.sighashLayouts = sighashLayouts;\n    }\n    /**\n     * Encodes a program instruction.\n     */\n    encode(ixName, ix) {\n        return this._encode(SIGHASH_GLOBAL_NAMESPACE, ixName, ix);\n    }\n    _encode(nameSpace, ixName, ix) {\n        const buffer = buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1000); // TODO: use a tighter buffer.\n        const methodName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(ixName);\n        const layout = this.ixLayout.get(methodName);\n        if (!layout) {\n            throw new Error(`Unknown method: ${methodName}`);\n        }\n        const len = layout.encode(ix, buffer);\n        const data = buffer.slice(0, len);\n        return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([sighash(nameSpace, ixName), data]);\n    }\n    static parseIxLayout(idl) {\n        const ixLayouts = idl.instructions.map((ix) => {\n            let fieldLayouts = ix.args.map((arg) => {\n                var _a, _b;\n                return IdlCoder.fieldLayout(arg, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n            });\n            const name = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(ix.name);\n            return [name, _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct(fieldLayouts, name)];\n        });\n        return new Map(ixLayouts);\n    }\n    /**\n     * Decodes a program instruction.\n     */\n    decode(ix, encoding = \"hex\") {\n        if (typeof ix === \"string\") {\n            ix = encoding === \"hex\" ? buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(ix, \"hex\") : bs58__WEBPACK_IMPORTED_MODULE_3___default().decode(ix);\n        }\n        let sighash = bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(ix.slice(0, 8));\n        let data = ix.slice(8);\n        const decoder = this.sighashLayouts.get(sighash);\n        if (!decoder) {\n            return null;\n        }\n        return {\n            data: decoder.layout.decode(data),\n            name: decoder.name,\n        };\n    }\n    /**\n     * Returns a formatted table of all the fields in the given instruction data.\n     */\n    format(ix, accountMetas) {\n        return InstructionFormatter.format(ix, accountMetas, this.idl);\n    }\n}\nclass InstructionFormatter {\n    static format(ix, accountMetas, idl) {\n        const idlIx = idl.instructions.filter((i) => ix.name === i.name)[0];\n        if (idlIx === undefined) {\n            console.error(\"Invalid instruction given\");\n            return null;\n        }\n        const args = idlIx.args.map((idlField) => {\n            return {\n                name: idlField.name,\n                type: InstructionFormatter.formatIdlType(idlField.type),\n                data: InstructionFormatter.formatIdlData(idlField, ix.data[idlField.name], idl.types),\n            };\n        });\n        const flatIdlAccounts = InstructionFormatter.flattenIdlAccounts(idlIx.accounts);\n        const accounts = accountMetas.map((meta, idx) => {\n            if (idx < flatIdlAccounts.length) {\n                return {\n                    name: flatIdlAccounts[idx].name,\n                    ...meta,\n                };\n            }\n            // \"Remaining accounts\" are unnamed in Anchor.\n            else {\n                return {\n                    name: undefined,\n                    ...meta,\n                };\n            }\n        });\n        return {\n            args,\n            accounts,\n        };\n    }\n    static formatIdlType(idlType) {\n        if (typeof idlType === \"string\") {\n            return idlType;\n        }\n        if (\"vec\" in idlType) {\n            return `Vec<${this.formatIdlType(idlType.vec)}>`;\n        }\n        if (\"option\" in idlType) {\n            return `Option<${this.formatIdlType(idlType.option)}>`;\n        }\n        if (\"defined\" in idlType) {\n            return idlType.defined;\n        }\n        if (\"array\" in idlType) {\n            return `Array<${idlType.array[0]}; ${idlType.array[1]}>`;\n        }\n        throw new Error(`Unknown IDL type: ${idlType}`);\n    }\n    static formatIdlData(idlField, data, types) {\n        if (typeof idlField.type === \"string\") {\n            return data.toString();\n        }\n        if (idlField.type.hasOwnProperty(\"vec\")) {\n            return (\"[\" +\n                data\n                    .map((d) => this.formatIdlData({ name: \"\", type: idlField.type.vec }, d))\n                    .join(\", \") +\n                \"]\");\n        }\n        if (idlField.type.hasOwnProperty(\"option\")) {\n            return data === null\n                ? \"null\"\n                : this.formatIdlData({ name: \"\", type: idlField.type.option }, data, types);\n        }\n        if (idlField.type.hasOwnProperty(\"defined\")) {\n            if (types === undefined) {\n                throw new Error(\"User defined types not provided\");\n            }\n            const filtered = types.filter((t) => t.name === idlField.type.defined);\n            if (filtered.length !== 1) {\n                throw new Error(`Type not found: ${idlField.type.defined}`);\n            }\n            return InstructionFormatter.formatIdlDataDefined(filtered[0], data, types);\n        }\n        return \"unknown\";\n    }\n    static formatIdlDataDefined(typeDef, data, types) {\n        switch (typeDef.type.kind) {\n            case \"struct\": {\n                const struct = typeDef.type;\n                const fields = Object.keys(data)\n                    .map((k) => {\n                    const field = struct.fields.find((f) => f.name === k);\n                    if (!field) {\n                        throw new Error(\"Unable to find type\");\n                    }\n                    return (k +\n                        \": \" +\n                        InstructionFormatter.formatIdlData(field, data[k], types));\n                })\n                    .join(\", \");\n                return \"{ \" + fields + \" }\";\n            }\n            case \"enum\": {\n                if (typeDef.type.variants.length === 0) {\n                    return \"{}\";\n                }\n                // Struct enum.\n                if (typeDef.type.variants[0].name) {\n                    const variants = typeDef.type.variants;\n                    const variant = Object.keys(data)[0];\n                    const enumType = data[variant];\n                    const namedFields = Object.keys(enumType)\n                        .map((f) => {\n                        var _a;\n                        const fieldData = enumType[f];\n                        const idlField = (_a = variants[variant]) === null || _a === void 0 ? void 0 : _a.find((v) => v.name === f);\n                        if (!idlField) {\n                            throw new Error(\"Unable to find variant\");\n                        }\n                        return (f +\n                            \": \" +\n                            InstructionFormatter.formatIdlData(idlField, fieldData, types));\n                    })\n                        .join(\", \");\n                    const variantName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(variant, { pascalCase: true });\n                    if (namedFields.length === 0) {\n                        return variantName;\n                    }\n                    return `${variantName} { ${namedFields} }`;\n                }\n                // Tuple enum.\n                else {\n                    // TODO.\n                    return \"Tuple formatting not yet implemented\";\n                }\n            }\n            case \"alias\": {\n                return InstructionFormatter.formatIdlType(typeDef.type.value);\n            }\n        }\n    }\n    static flattenIdlAccounts(accounts, prefix) {\n        return accounts\n            .map((account) => {\n            const accName = sentenceCase(account.name);\n            if (account.hasOwnProperty(\"accounts\")) {\n                const newPrefix = prefix ? `${prefix} > ${accName}` : accName;\n                return InstructionFormatter.flattenIdlAccounts(account.accounts, newPrefix);\n            }\n            else {\n                return {\n                    ...account,\n                    name: prefix ? `${prefix} > ${accName}` : accName,\n                };\n            }\n        })\n            .flat();\n    }\n}\nfunction sentenceCase(field) {\n    const result = field.replace(/([A-Z])/g, \" $1\");\n    return result.charAt(0).toUpperCase() + result.slice(1);\n}\n// Not technically sighash, since we don't include the arguments, as Rust\n// doesn't allow function overloading.\nfunction sighash(nameSpace, ixName) {\n    let name = snakeCase(ixName);\n    let preimage = `${nameSpace}:${name}`;\n    return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(preimage).slice(0, 8));\n}\n\nfunction accountSize(idl, idlAccount) {\n    switch (idlAccount.type.kind) {\n        case \"struct\": {\n            return idlAccount.type.fields\n                .map((f) => typeSize(idl, f.type))\n                .reduce((acc, size) => acc + size, 0);\n        }\n        case \"enum\": {\n            const variantSizes = idlAccount.type.variants.map((variant) => {\n                if (!variant.fields) {\n                    return 0;\n                }\n                return variant.fields\n                    .map((f) => {\n                    // Unnamed enum variant\n                    if (!(typeof f === \"object\" && \"name\" in f)) {\n                        return typeSize(idl, f);\n                    }\n                    // Named enum variant\n                    return typeSize(idl, f.type);\n                })\n                    .reduce((acc, size) => acc + size, 0);\n            });\n            return Math.max(...variantSizes) + 1;\n        }\n        case \"alias\": {\n            return typeSize(idl, idlAccount.type.value);\n        }\n    }\n}\n// Returns the size of the type in bytes. For variable length types, just return\n// 1. Users should override this value in such cases.\nfunction typeSize(idl, ty) {\n    var _a, _b;\n    switch (ty) {\n        case \"bool\":\n            return 1;\n        case \"u8\":\n            return 1;\n        case \"i8\":\n            return 1;\n        case \"i16\":\n            return 2;\n        case \"u16\":\n            return 2;\n        case \"u32\":\n            return 4;\n        case \"i32\":\n            return 4;\n        case \"f32\":\n            return 4;\n        case \"u64\":\n            return 8;\n        case \"i64\":\n            return 8;\n        case \"f64\":\n            return 8;\n        case \"u128\":\n            return 16;\n        case \"i128\":\n            return 16;\n        case \"u256\":\n            return 32;\n        case \"i256\":\n            return 32;\n        case \"bytes\":\n            return 1;\n        case \"string\":\n            return 1;\n        case \"publicKey\":\n            return 32;\n        default:\n            if (\"vec\" in ty) {\n                return 1;\n            }\n            if (\"option\" in ty) {\n                return 1 + typeSize(idl, ty.option);\n            }\n            if (\"coption\" in ty) {\n                return 4 + typeSize(idl, ty.coption);\n            }\n            if (\"defined\" in ty) {\n                const filtered = (_b = (_a = idl.types) === null || _a === void 0 ? void 0 : _a.filter((t) => t.name === ty.defined)) !== null && _b !== void 0 ? _b : [];\n                if (filtered.length !== 1) {\n                    throw new IdlError(`Type not found: ${JSON.stringify(ty)}`);\n                }\n                let typeDef = filtered[0];\n                return accountSize(idl, typeDef);\n            }\n            if (\"array\" in ty) {\n                let arrayTy = ty.array[0];\n                let arraySize = ty.array[1];\n                return typeSize(idl, arrayTy) * arraySize;\n            }\n            throw new Error(`Invalid type ${JSON.stringify(ty)}`);\n    }\n}\n\n/**\n * Number of bytes in anchor discriminators\n */\nconst DISCRIMINATOR_SIZE = 8;\nfunction discriminator(preimage) {\n    return Buffer.from((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(preimage).slice(0, DISCRIMINATOR_SIZE));\n}\n\n/**\n * Encodes and decodes account objects.\n */\nclass BorshAccountsCoder {\n    constructor(idl) {\n        if (idl.accounts === undefined) {\n            this.accountLayouts = new Map();\n            return;\n        }\n        const layouts = idl.accounts.map((acc) => {\n            return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n        });\n        this.accountLayouts = new Map(layouts);\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        const buffer = buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        const len = layout.encode(account, buffer);\n        let accountData = buffer.slice(0, len);\n        let discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        return buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([discriminator, accountData]);\n    }\n    decode(accountName, data) {\n        // Assert the account discriminator is correct.\n        const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        if (discriminator.compare(data.slice(0, 8))) {\n            throw new Error(\"Invalid account discriminator\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeAny(data) {\n        const accountDescriminator = data.slice(0, 8);\n        const accountName = Array.from(this.accountLayouts.keys()).find((key) => BorshAccountsCoder.accountDiscriminator(key).equals(accountDescriminator));\n        if (!accountName) {\n            throw new Error(\"Account descriminator not found\");\n        }\n        return this.decodeUnchecked(accountName, data);\n    }\n    decodeUnchecked(accountName, ix) {\n        // Chop off the discriminator before decoding.\n        const data = ix.subarray(DISCRIMINATOR_SIZE);\n        const layout = this.accountLayouts.get(accountName);\n        if (!layout) {\n            throw new Error(`Unknown account: ${accountName}`);\n        }\n        return layout.decode(data);\n    }\n    memcmp(accountName, appendData) {\n        const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n        return {\n            offset: 0,\n            bytes: bs58__WEBPACK_IMPORTED_MODULE_3___default().encode(appendData ? buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([discriminator, appendData]) : discriminator),\n        };\n    }\n    size(idlAccount) {\n        var _a;\n        return DISCRIMINATOR_SIZE + ((_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0);\n    }\n    /**\n     * Calculates and returns a unique 8 byte discriminator prepended to all anchor accounts.\n     *\n     * @param name The name of the account to calculate the discriminator.\n     */\n    static accountDiscriminator(name) {\n        const discriminatorPreimage = `account:${camelcase__WEBPACK_IMPORTED_MODULE_4___default()(name, {\n            pascalCase: true,\n            preserveConsecutiveUppercase: true,\n        })}`;\n        return discriminator(discriminatorPreimage);\n    }\n}\n\nclass BorshEventCoder {\n    constructor(idl) {\n        if (idl.events === undefined) {\n            this.layouts = new Map();\n            return;\n        }\n        const layouts = idl.events.map((event) => {\n            let eventTypeDef = {\n                name: event.name,\n                type: {\n                    kind: \"struct\",\n                    fields: event.fields.map((f) => {\n                        return { name: f.name, type: f.type };\n                    }),\n                },\n            };\n            return [event.name, IdlCoder.typeDefLayout(eventTypeDef, idl.types)];\n        });\n        this.layouts = new Map(layouts);\n        this.discriminators = new Map(idl.events === undefined\n            ? []\n            : idl.events.map((e) => [\n                encode(eventDiscriminator(e.name)),\n                e.name,\n            ]));\n    }\n    decode(log) {\n        let logArr;\n        // This will throw if log length is not a multiple of 4.\n        try {\n            logArr = decode(log);\n        }\n        catch (e) {\n            return null;\n        }\n        const disc = encode(logArr.slice(0, 8));\n        // Only deserialize if the discriminator implies a proper event.\n        const eventName = this.discriminators.get(disc);\n        if (eventName === undefined) {\n            return null;\n        }\n        const layout = this.layouts.get(eventName);\n        if (!layout) {\n            throw new Error(`Unknown event: ${eventName}`);\n        }\n        const data = layout.decode(logArr.slice(8));\n        return { data, name: eventName };\n    }\n}\nfunction eventDiscriminator(name) {\n    return discriminator(`event:${name}`);\n}\n\n/**\n * Encodes and decodes user-defined types.\n */\nclass BorshTypesCoder {\n    constructor(idl) {\n        if (idl.types === undefined) {\n            this.typeLayouts = new Map();\n            return;\n        }\n        const layouts = idl.types.map((acc) => {\n            return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n        });\n        this.typeLayouts = new Map(layouts);\n        this.idl = idl;\n    }\n    encode(typeName, type) {\n        const buffer = buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.alloc(1000); // TODO: use a tighter buffer.\n        const layout = this.typeLayouts.get(typeName);\n        if (!layout) {\n            throw new Error(`Unknown type: ${typeName}`);\n        }\n        const len = layout.encode(type, buffer);\n        return buffer.slice(0, len);\n    }\n    decode(typeName, typeData) {\n        const layout = this.typeLayouts.get(typeName);\n        if (!layout) {\n            throw new Error(`Unknown type: ${typeName}`);\n        }\n        return layout.decode(typeData);\n    }\n}\n\n/**\n * BorshCoder is the default Coder for Anchor programs implementing the\n * borsh based serialization interface.\n */\nclass BorshCoder {\n    constructor(idl) {\n        this.instruction = new BorshInstructionCoder(idl);\n        this.accounts = new BorshAccountsCoder(idl);\n        this.events = new BorshEventCoder(idl);\n        this.types = new BorshTypesCoder(idl);\n    }\n}\n\nvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof __webpack_require__.g !== 'undefined' ? __webpack_require__.g : typeof self !== 'undefined' ? self : {};\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nvar Layout_2 = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob$1 extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/** Factory for {@link OffsetLayout}. */\nvar offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = (property => new UInt(4, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nvar nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nvar ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link Union} values. */\nvar union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = ((length, property) => new Blob$1(length, property));\n\nclass SystemInstructionCoder {\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    constructor(_) { }\n    encode(ixName, ix) {\n        switch (camelcase__WEBPACK_IMPORTED_MODULE_4___default()(ixName)) {\n            case \"createAccount\": {\n                return encodeCreateAccount(ix);\n            }\n            case \"assign\": {\n                return encodeAssign(ix);\n            }\n            case \"transfer\": {\n                return encodeTransfer(ix);\n            }\n            case \"createAccountWithSeed\": {\n                return encodeCreateAccountWithSeed(ix);\n            }\n            case \"advanceNonceAccount\": {\n                return encodeAdvanceNonceAccount(ix);\n            }\n            case \"withdrawNonceAccount\": {\n                return encodeWithdrawNonceAccount(ix);\n            }\n            case \"initializeNonceAccount\": {\n                return encodeInitializeNonceAccount(ix);\n            }\n            case \"authorizeNonceAccount\": {\n                return encodeAuthorizeNonceAccount(ix);\n            }\n            case \"allocate\": {\n                return encodeAllocate(ix);\n            }\n            case \"allocateWithSeed\": {\n                return encodeAllocateWithSeed(ix);\n            }\n            case \"assignWithSeed\": {\n                return encodeAssignWithSeed(ix);\n            }\n            case \"transferWithSeed\": {\n                return encodeTransferWithSeed(ix);\n            }\n            default: {\n                throw new Error(`Invalid instruction: ${ixName}`);\n            }\n        }\n    }\n    encodeState(_ixName, _ix) {\n        throw new Error(\"System does not have state\");\n    }\n}\nclass RustStringLayout extends Layout_2 {\n    constructor(property) {\n        super(-1, property);\n        this.property = property;\n        this.layout = struct([\n            u32(\"length\"),\n            u32(\"lengthPadding\"),\n            blob(offset(u32(), -8), \"chars\"),\n        ], this.property);\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span;\n        }\n        const data = {\n            chars: Buffer.from(src, \"utf8\"),\n        };\n        return this.layout.encode(data, b, offset);\n    }\n    decode(b, offset = 0) {\n        const data = this.layout.decode(b, offset);\n        return data[\"chars\"].toString();\n    }\n    getSpan(b, offset = 0) {\n        return (u32().span +\n            u32().span +\n            new (bn_js__WEBPACK_IMPORTED_MODULE_2___default())(new Uint8Array(b).slice(offset, offset + 4), 10, \"le\").toNumber());\n    }\n}\nfunction rustStringLayout(property) {\n    return new RustStringLayout(property);\n}\nfunction publicKey$2(property) {\n    return blob(32, property);\n}\nfunction encodeCreateAccount({ lamports, space, owner }) {\n    return encodeData({\n        createAccount: { lamports, space, owner: owner.toBuffer() },\n    });\n}\nfunction encodeAssign({ owner }) {\n    return encodeData({\n        assign: { owner: owner.toBuffer() },\n    });\n}\nfunction encodeTransfer({ lamports }) {\n    return encodeData({\n        transfer: { lamports },\n    });\n}\nfunction encodeCreateAccountWithSeed({ base, seed, lamports, space, owner, }) {\n    return encodeData({\n        createAccountWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            lamports,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(3).span + seed.length);\n}\nfunction encodeInitializeNonceAccount({ authorized }) {\n    return encodeData({\n        initializeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAdvanceNonceAccount({ authorized }) {\n    return encodeData({\n        advanceNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeWithdrawNonceAccount({ lamports }) {\n    return encodeData({\n        withdrawNonceAccount: { lamports },\n    });\n}\nfunction encodeAuthorizeNonceAccount({ authorized }) {\n    return encodeData({\n        authorizeNonceAccount: { authorized: authorized.toBuffer() },\n    });\n}\nfunction encodeAllocate({ space }) {\n    return encodeData({\n        allocate: { space },\n    });\n}\nfunction encodeAllocateWithSeed({ base, seed, space, owner }) {\n    return encodeData({\n        allocateWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            space,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(9).span + seed.length);\n}\nfunction encodeAssignWithSeed({ base, seed, owner }) {\n    return encodeData({\n        assignWithSeed: {\n            base: base.toBuffer(),\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(10).span + seed.length);\n}\nfunction encodeTransferWithSeed({ lamports, seed, owner }) {\n    return encodeData({\n        transferWithSeed: {\n            lamports,\n            seed,\n            owner: owner.toBuffer(),\n        },\n    }, LAYOUT.getVariant(11).span + seed.length);\n}\nconst LAYOUT = union(u32(\"instruction\"));\nLAYOUT.addVariant(0, struct([\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccount\");\nLAYOUT.addVariant(1, struct([publicKey$2(\"owner\")]), \"assign\");\nLAYOUT.addVariant(2, struct([ns64(\"lamports\")]), \"transfer\");\nLAYOUT.addVariant(3, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"lamports\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"createAccountWithSeed\");\nLAYOUT.addVariant(4, struct([publicKey$2(\"authorized\")]), \"advanceNonceAccount\");\nLAYOUT.addVariant(5, struct([ns64(\"lamports\")]), \"withdrawNonceAccount\");\nLAYOUT.addVariant(6, struct([publicKey$2(\"authorized\")]), \"initializeNonceAccount\");\nLAYOUT.addVariant(7, struct([publicKey$2(\"authorized\")]), \"authorizeNonceAccount\");\nLAYOUT.addVariant(8, struct([ns64(\"space\")]), \"allocate\");\nLAYOUT.addVariant(9, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    ns64(\"space\"),\n    publicKey$2(\"owner\"),\n]), \"allocateWithSeed\");\nLAYOUT.addVariant(10, struct([\n    publicKey$2(\"base\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"assignWithSeed\");\nLAYOUT.addVariant(11, struct([\n    ns64(\"lamports\"),\n    rustStringLayout(\"seed\"),\n    publicKey$2(\"owner\"),\n]), \"transferWithSeed\");\nfunction encodeData(instruction, maxSpan) {\n    const b = Buffer.alloc(maxSpan !== null && maxSpan !== void 0 ? maxSpan : instructionMaxSpan);\n    const span = LAYOUT.encode(instruction, b);\n    if (maxSpan === undefined) {\n        return b.slice(0, span);\n    }\n    return b;\n}\nconst instructionMaxSpan = Math.max(...Object.values(LAYOUT.registry).map((r) => r.span));\n\nclass SystemAccountsCoder {\n    constructor(idl) {\n        this.idl = idl;\n    }\n    async encode(accountName, account) {\n        switch (accountName) {\n            case \"nonce\": {\n                const buffer = Buffer.alloc(_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.NONCE_ACCOUNT_LENGTH);\n                const len = NONCE_ACCOUNT_LAYOUT.encode(account, buffer);\n                return buffer.slice(0, len);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    decode(accountName, ix) {\n        return this.decodeUnchecked(accountName, ix);\n    }\n    decodeUnchecked(accountName, ix) {\n        switch (accountName) {\n            case \"nonce\": {\n                return decodeNonceAccount(ix);\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    // TODO: this won't use the appendData.\n    memcmp(accountName, _appendData) {\n        switch (accountName) {\n            case \"nonce\": {\n                return {\n                    dataSize: _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.NONCE_ACCOUNT_LENGTH,\n                };\n            }\n            default: {\n                throw new Error(`Invalid account name: ${accountName}`);\n            }\n        }\n    }\n    size(idlAccount) {\n        var _a;\n        return (_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0;\n    }\n}\nfunction decodeNonceAccount(ix) {\n    return NONCE_ACCOUNT_LAYOUT.decode(ix);\n}\nclass WrappedLayout$1 extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey$1(property) {\n    return new WrappedLayout$1(blob(32), (b) => new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(b), (key) => key.toBuffer(), property);\n}\nconst NONCE_ACCOUNT_LAYOUT = struct([\n    u32(\"version\"),\n    u32(\"state\"),\n    publicKey$1(\"authorizedPubkey\"),\n    publicKey$1(\"nonce\"),\n    struct([nu64(\"lamportsPerSignature\")], \"feeCalculator\"),\n]);\n\nclass SystemEventsCoder {\n    constructor(_idl) { }\n    decode(_log) {\n        throw new Error(\"System program does not have events\");\n    }\n}\n\nclass SystemTypesCoder {\n    constructor(_idl) { }\n    encode(_name, _type) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n    decode(_name, _typeData) {\n        throw new Error(\"System does not have user-defined types\");\n    }\n}\n\n/**\n * Coder for the System program.\n */\nclass SystemCoder {\n    constructor(idl) {\n        this.instruction = new SystemInstructionCoder(idl);\n        this.accounts = new SystemAccountsCoder(idl);\n        this.events = new SystemEventsCoder(idl);\n        this.types = new SystemTypesCoder(idl);\n    }\n}\n\nfunction hash(data) {\n    return new TextDecoder().decode((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(data));\n}\n\nvar sha256 = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    hash: hash\n});\n\n// Sync version of web3.PublicKey.createWithSeed.\nfunction createWithSeedSync(fromPublicKey, seed, programId) {\n    const buffer = buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.concat([\n        fromPublicKey.toBuffer(),\n        buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from(seed),\n        programId.toBuffer(),\n    ]);\n    return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey((0,_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__/* .sha256 */ .J)(buffer));\n}\nfunction associated(programId, ...args) {\n    let seeds = [buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer.from([97, 110, 99, 104, 111, 114])]; // b\"anchor\".\n    args.forEach((arg) => {\n        seeds.push(arg instanceof buffer__WEBPACK_IMPORTED_MODULE_0__.Buffer ? arg : translateAddress(arg).toBuffer());\n    });\n    const [assoc] = _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddressSync(seeds, translateAddress(programId));\n    return assoc;\n}\n\nvar pubkey = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    createWithSeedSync: createWithSeedSync,\n    associated: associated\n});\n\nconst TOKEN_PROGRAM_ID = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");\nconst ASSOCIATED_PROGRAM_ID = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\nfunction associatedAddress({ mint, owner, }) {\n    return _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddressSync([owner.toBuffer(), TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], ASSOCIATED_PROGRAM_ID)[0];\n}\n\nvar token = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    TOKEN_PROGRAM_ID: TOKEN_PROGRAM_ID,\n    ASSOCIATED_PROGRAM_ID: ASSOCIATED_PROGRAM_ID,\n    associatedAddress: associatedAddress\n});\n\nvar browserPonyfill = {exports: {}};\n\n(function (module, exports) {\nvar global = typeof self !== 'undefined' ? self : commonjsGlobal;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException;\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\n((function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}))({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch; // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch; // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch; // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers;\nexports.Request = ctx.Request;\nexports.Response = ctx.Response;\nmodule.exports = exports;\n}(browserPonyfill, browserPonyfill.exports));\n\nvar fetch = /*@__PURE__*/getDefaultExportFromCjs(browserPonyfill.exports);\n\n/**\n * Returns a verified build from the anchor registry. null if no such\n * verified build exists, e.g., if the program has been upgraded since the\n * last verified build.\n */\nasync function verifiedBuild(connection, programId, limit = 5) {\n    const url = `https://api.apr.dev/api/v0/program/${programId.toString()}/latest?limit=${limit}`;\n    const [programData, latestBuildsResp] = await Promise.all([\n        fetchData(connection, programId),\n        fetch(url),\n    ]);\n    // Filter out all non successful builds.\n    const latestBuilds = (await latestBuildsResp.json()).filter((b) => !b.aborted && b.state === \"Built\" && b.verified === \"Verified\");\n    if (latestBuilds.length === 0) {\n        return null;\n    }\n    // Get the latest build.\n    const build = latestBuilds[0];\n    // Has the program been upgraded since the last build?\n    if (programData.slot.toNumber() !== build.verified_slot) {\n        return null;\n    }\n    // Success.\n    return build;\n}\n/**\n * Returns the program data account for this program, containing the\n * metadata for this program, e.g., the upgrade authority.\n */\nasync function fetchData(connection, programId) {\n    const accountInfo = await connection.getAccountInfo(programId);\n    if (accountInfo === null) {\n        throw new Error(\"program account not found\");\n    }\n    const { program } = decodeUpgradeableLoaderState(accountInfo.data);\n    const programdataAccountInfo = await connection.getAccountInfo(program.programdataAddress);\n    if (programdataAccountInfo === null) {\n        throw new Error(\"program data account not found\");\n    }\n    const { programData } = decodeUpgradeableLoaderState(programdataAccountInfo.data);\n    return programData;\n}\nconst UPGRADEABLE_LOADER_STATE_LAYOUT = _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.rustEnum([\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([], \"uninitialized\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.option(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(), \"authorityAddress\")], \"buffer\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(\"programdataAddress\")], \"program\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([\n        _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u64(\"slot\"),\n        _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.option(_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(), \"upgradeAuthorityAddress\"),\n    ], \"programData\"),\n], undefined, _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.u32());\nfunction decodeUpgradeableLoaderState(data) {\n    return UPGRADEABLE_LOADER_STATE_LAYOUT.decode(data);\n}\n\nvar registry = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    verifiedBuild: verifiedBuild,\n    fetchData: fetchData,\n    decodeUpgradeableLoaderState: decodeUpgradeableLoaderState\n});\n\nvar index = /*#__PURE__*/Object.freeze({\n    __proto__: null,\n    sha256: sha256,\n    rpc: rpc,\n    publicKey: pubkey,\n    bytes: index$1,\n    token: token,\n    features: features,\n    registry: registry\n});\n\nfunction isIdlAccounts(accountItem) {\n    return \"accounts\" in accountItem;\n}\n// Deterministic IDL address as a function of the program id.\nasync function idlAddress(programId) {\n    const base = (await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress([], programId))[0];\n    return await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.createWithSeed(base, seed(), programId);\n}\n// Seed for generating the idlAddress.\nfunction seed() {\n    return \"anchor:idl\";\n}\nconst IDL_ACCOUNT_LAYOUT = _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.struct([\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.publicKey(\"authority\"),\n    _coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__.vecU8(\"data\"),\n]);\nfunction decodeIdlAccount(data) {\n    return IDL_ACCOUNT_LAYOUT.decode(data);\n}\n\nfunction splitArgsAndCtx(idlIx, args) {\n    var _a, _b;\n    let options = {};\n    const inputLen = idlIx.args ? idlIx.args.length : 0;\n    if (args.length > inputLen) {\n        if (args.length !== inputLen + 1) {\n            throw new Error(`provided too many arguments ${args} to instruction ${idlIx === null || idlIx === void 0 ? void 0 : idlIx.name} expecting: ${(_b = (_a = idlIx.args) === null || _a === void 0 ? void 0 : _a.map((a) => a.name)) !== null && _b !== void 0 ? _b : []}`);\n        }\n        options = args.pop();\n    }\n    return [args, options];\n}\n\nclass InstructionNamespaceFactory {\n    static build(idlIx, encodeFn, programId) {\n        if (idlIx.name === \"_inner\") {\n            throw new IdlError(\"the _inner name is reserved\");\n        }\n        const ix = (...args) => {\n            const [ixArgs, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            validateAccounts(idlIx.accounts, ctx.accounts);\n            validateInstruction(idlIx, ...args);\n            const keys = ix.accounts(ctx.accounts);\n            if (ctx.remainingAccounts !== undefined) {\n                keys.push(...ctx.remainingAccounts);\n            }\n            if (isSet(\"debug-logs\")) {\n                console.log(\"Outgoing account metas:\", keys);\n            }\n            return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.TransactionInstruction({\n                keys,\n                programId,\n                data: encodeFn(idlIx.name, toInstruction(idlIx, ...ixArgs)),\n            });\n        };\n        // Utility fn for ordering the accounts for this instruction.\n        ix[\"accounts\"] = (accs) => {\n            return InstructionNamespaceFactory.accountsArray(accs, idlIx.accounts, programId, idlIx.name);\n        };\n        return ix;\n    }\n    static accountsArray(ctx, accounts, programId, ixName) {\n        if (!ctx) {\n            return [];\n        }\n        return accounts\n            .map((acc) => {\n            // Nested accounts.\n            const nestedAccounts = \"accounts\" in acc ? acc.accounts : undefined;\n            if (nestedAccounts !== undefined) {\n                const rpcAccs = ctx[acc.name];\n                return InstructionNamespaceFactory.accountsArray(rpcAccs, acc.accounts, programId, ixName).flat();\n            }\n            else {\n                const account = acc;\n                let pubkey;\n                try {\n                    pubkey = translateAddress(ctx[acc.name]);\n                }\n                catch (err) {\n                    throw new Error(`Wrong input type for account \"${acc.name}\" in the instruction accounts object${ixName !== undefined ? ' for instruction \"' + ixName + '\"' : \"\"}. Expected PublicKey or string.`);\n                }\n                const optional = account.isOptional && pubkey.equals(programId);\n                const isWritable = account.isMut && !optional;\n                const isSigner = account.isSigner && !optional;\n                return {\n                    pubkey,\n                    isWritable,\n                    isSigner,\n                };\n            }\n        })\n            .flat();\n    }\n}\n// Throws error if any argument required for the `ix` is not given.\nfunction validateInstruction(ix, ...args) {\n    // todo\n}\n\nclass TransactionFactory {\n    static build(idlIx, ixFn) {\n        const txFn = (...args) => {\n            var _a, _b, _c;\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            const tx = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.Transaction();\n            if (ctx.preInstructions && ctx.instructions) {\n                throw new Error(\"instructions is deprecated, use preInstructions\");\n            }\n            (_a = ctx.preInstructions) === null || _a === void 0 ? void 0 : _a.forEach((ix) => tx.add(ix));\n            (_b = ctx.instructions) === null || _b === void 0 ? void 0 : _b.forEach((ix) => tx.add(ix));\n            tx.add(ixFn(...args));\n            (_c = ctx.postInstructions) === null || _c === void 0 ? void 0 : _c.forEach((ix) => tx.add(ix));\n            return tx;\n        };\n        return txFn;\n    }\n}\n\nclass RpcFactory {\n    static build(idlIx, txFn, idlErrors, provider) {\n        const rpc = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            if (provider.sendAndConfirm === undefined) {\n                throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n            }\n            try {\n                return await provider.sendAndConfirm(tx, (_a = ctx.signers) !== null && _a !== void 0 ? _a : [], ctx.options);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n        };\n        return rpc;\n    }\n}\n\nclass AccountFactory {\n    static build(idl, coder, programId, provider) {\n        var _a;\n        const accountFns = {};\n        (_a = idl.accounts) === null || _a === void 0 ? void 0 : _a.forEach((idlAccount) => {\n            const name = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(idlAccount.name);\n            accountFns[name] = new AccountClient(idl, idlAccount, programId, provider, coder);\n        });\n        return accountFns;\n    }\n}\nclass AccountClient {\n    /**\n     * Returns the number of bytes in this account.\n     */\n    get size() {\n        return this._size;\n    }\n    /**\n     * Returns the program ID owning all accounts.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * Returns the client's wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * Returns the coder.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Returns the idl account.\n     */\n    get idlAccount() {\n        return this._idlAccount;\n    }\n    constructor(idl, idlAccount, programId, provider, coder) {\n        this._idlAccount = idlAccount;\n        this._programId = programId;\n        this._provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._size = this._coder.accounts.size(idlAccount);\n    }\n    /**\n     * Returns a deserialized account, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullable(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context, returning null if it doesn't exist.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchNullableAndContext(address, commitment) {\n        const accountInfo = await this.getAccountInfoAndContext(address, commitment);\n        const { value, context } = accountInfo;\n        return {\n            data: value && value.data.length !== 0\n                ? this._coder.accounts.decode(this._idlAccount.name, value.data)\n                : null,\n            context,\n        };\n    }\n    /**\n     * Returns a deserialized account.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetch(address, commitment) {\n        const { data } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist or has no data ${address.toString()}`);\n        }\n        return data;\n    }\n    /**\n     * Returns a deserialized account along with the associated rpc response context.\n     *\n     * @param address The address of the account to fetch.\n     */\n    async fetchAndContext(address, commitment) {\n        const { data, context } = await this.fetchNullableAndContext(address, commitment);\n        if (data === null) {\n            throw new Error(`Account does not exist ${address.toString()}`);\n        }\n        return { data, context };\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultiple(addresses, commitment) {\n        const accounts = await this.fetchMultipleAndContext(addresses, commitment);\n        return accounts.map((account) => (account ? account.data : null));\n    }\n    /**\n     * Returns multiple deserialized accounts.\n     * Accounts not found or with wrong discriminator are returned as null.\n     *\n     * @param addresses The addresses of the accounts to fetch.\n     */\n    async fetchMultipleAndContext(addresses, commitment) {\n        const accounts = await getMultipleAccountsAndContext(this._provider.connection, addresses.map((address) => translateAddress(address)), commitment);\n        // Decode accounts where discriminator is correct, null otherwise\n        return accounts.map((result) => {\n            if (result == null) {\n                return null;\n            }\n            const { account, context } = result;\n            return {\n                data: this._coder.accounts.decode(this._idlAccount.name, account.data),\n                context,\n            };\n        });\n    }\n    /**\n     * Returns all instances of this account type for the program.\n     *\n     * @param filters User-provided filters to narrow the results from `connection.getProgramAccounts`.\n     *\n     *                When filters are not defined this method returns all\n     *                the account instances.\n     *\n     *                When filters are of type `Buffer`, the filters are appended\n     *                after the discriminator.\n     *\n     *                When filters are of type `GetProgramAccountsFilter[]`,\n     *                filters are appended after the discriminator filter.\n     */\n    async all(filters) {\n        const filter = this.coder.accounts.memcmp(this._idlAccount.name, filters instanceof Buffer ? filters : undefined);\n        const coderFilters = [];\n        if ((filter === null || filter === void 0 ? void 0 : filter.offset) != undefined && (filter === null || filter === void 0 ? void 0 : filter.bytes) != undefined) {\n            coderFilters.push({\n                memcmp: { offset: filter.offset, bytes: filter.bytes },\n            });\n        }\n        if ((filter === null || filter === void 0 ? void 0 : filter.dataSize) != undefined) {\n            coderFilters.push({ dataSize: filter.dataSize });\n        }\n        let resp = await this._provider.connection.getProgramAccounts(this._programId, {\n            commitment: this._provider.connection.commitment,\n            filters: [...coderFilters, ...(Array.isArray(filters) ? filters : [])],\n        });\n        return resp.map(({ pubkey, account }) => {\n            return {\n                publicKey: pubkey,\n                account: this._coder.accounts.decode(this._idlAccount.name, account.data),\n            };\n        });\n    }\n    /**\n     * Returns an `EventEmitter` emitting a \"change\" event whenever the account\n     * changes.\n     */\n    subscribe(address, commitment) {\n        const sub = subscriptions.get(address.toString());\n        if (sub) {\n            return sub.ee;\n        }\n        const ee = new (eventemitter3__WEBPACK_IMPORTED_MODULE_7___default())();\n        address = translateAddress(address);\n        const listener = this._provider.connection.onAccountChange(address, (acc) => {\n            const account = this._coder.accounts.decode(this._idlAccount.name, acc.data);\n            ee.emit(\"change\", account);\n        }, commitment);\n        subscriptions.set(address.toString(), {\n            ee,\n            listener,\n        });\n        return ee;\n    }\n    /**\n     * Unsubscribes from the account at the given address.\n     */\n    async unsubscribe(address) {\n        let sub = subscriptions.get(address.toString());\n        if (!sub) {\n            console.warn(\"Address is not subscribed\");\n            return;\n        }\n        if (subscriptions) {\n            await this._provider.connection\n                .removeAccountChangeListener(sub.listener)\n                .then(() => {\n                subscriptions.delete(address.toString());\n            })\n                .catch(console.error);\n        }\n    }\n    /**\n     * Returns an instruction for creating this account.\n     */\n    async createInstruction(signer, sizeOverride) {\n        const size = this.size;\n        if (this._provider.publicKey === undefined) {\n            throw new Error(\"This function requires the Provider interface implementor to have a 'publicKey' field.\");\n        }\n        return _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SystemProgram.createAccount({\n            fromPubkey: this._provider.publicKey,\n            newAccountPubkey: signer.publicKey,\n            space: sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size,\n            lamports: await this._provider.connection.getMinimumBalanceForRentExemption(sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size),\n            programId: this._programId,\n        });\n    }\n    /**\n     * @deprecated since version 14.0.\n     *\n     * Function returning the associated account. Args are keys to associate.\n     * Order matters.\n     */\n    async associated(...args) {\n        const addr = await this.associatedAddress(...args);\n        return await this.fetch(addr);\n    }\n    /**\n     * @deprecated since version 14.0.\n     *\n     * Function returning the associated address. Args are keys to associate.\n     * Order matters.\n     */\n    async associatedAddress(...args) {\n        return await associated(this._programId, ...args);\n    }\n    async getAccountInfo(address, commitment) {\n        return await this._provider.connection.getAccountInfo(translateAddress(address), commitment);\n    }\n    async getAccountInfoAndContext(address, commitment) {\n        return await this._provider.connection.getAccountInfoAndContext(translateAddress(address), commitment);\n    }\n}\n// Tracks all subscriptions.\nconst subscriptions = new Map();\n\nconst PROGRAM_LOG = \"Program log: \";\nconst PROGRAM_DATA = \"Program data: \";\nconst PROGRAM_LOG_START_INDEX = PROGRAM_LOG.length;\nconst PROGRAM_DATA_START_INDEX = PROGRAM_DATA.length;\nclass EventManager {\n    constructor(programId, provider, coder) {\n        this._programId = programId;\n        this._provider = provider;\n        this._eventParser = new EventParser(programId, coder);\n        this._eventCallbacks = new Map();\n        this._eventListeners = new Map();\n        this._listenerIdCount = 0;\n    }\n    addEventListener(eventName, callback) {\n        var _a;\n        let listener = this._listenerIdCount;\n        this._listenerIdCount += 1;\n        // Store the listener into the event map.\n        if (!this._eventListeners.has(eventName)) {\n            this._eventListeners.set(eventName, []);\n        }\n        this._eventListeners.set(eventName, ((_a = this._eventListeners.get(eventName)) !== null && _a !== void 0 ? _a : []).concat(listener));\n        // Store the callback into the listener map.\n        this._eventCallbacks.set(listener, [eventName, callback]);\n        // Create the subscription singleton, if needed.\n        if (this._onLogsSubscriptionId !== undefined) {\n            return listener;\n        }\n        this._onLogsSubscriptionId = this._provider.connection.onLogs(this._programId, (logs, ctx) => {\n            if (logs.err) {\n                return;\n            }\n            for (const event of this._eventParser.parseLogs(logs.logs)) {\n                const allListeners = this._eventListeners.get(event.name);\n                if (allListeners) {\n                    allListeners.forEach((listener) => {\n                        const listenerCb = this._eventCallbacks.get(listener);\n                        if (listenerCb) {\n                            const [, callback] = listenerCb;\n                            callback(event.data, ctx.slot, logs.signature);\n                        }\n                    });\n                }\n            }\n        });\n        return listener;\n    }\n    async removeEventListener(listener) {\n        // Get the callback.\n        const callback = this._eventCallbacks.get(listener);\n        if (!callback) {\n            throw new Error(`Event listener ${listener} doesn't exist!`);\n        }\n        const [eventName] = callback;\n        // Get the listeners.\n        let listeners = this._eventListeners.get(eventName);\n        if (!listeners) {\n            throw new Error(`Event listeners don't exist for ${eventName}!`);\n        }\n        // Update both maps.\n        this._eventCallbacks.delete(listener);\n        listeners = listeners.filter((l) => l !== listener);\n        this._eventListeners.set(eventName, listeners);\n        if (listeners.length === 0) {\n            this._eventListeners.delete(eventName);\n        }\n        // Kill the websocket connection if all listeners have been removed.\n        if (this._eventCallbacks.size === 0) {\n            if (this._eventListeners.size !== 0) {\n                throw new Error(`Expected event listeners size to be 0 but got ${this._eventListeners.size}`);\n            }\n            if (this._onLogsSubscriptionId !== undefined) {\n                await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId);\n                this._onLogsSubscriptionId = undefined;\n            }\n        }\n    }\n}\nclass EventParser {\n    constructor(programId, coder) {\n        this.coder = coder;\n        this.programId = programId;\n    }\n    // Each log given, represents an array of messages emitted by\n    // a single transaction, which can execute many different programs across\n    // CPI boundaries. However, the subscription is only interested in the\n    // events emitted by *this* program. In achieving this, we keep track of the\n    // program execution context by parsing each log and looking for a CPI\n    // `invoke` call. If one exists, we know a new program is executing. So we\n    // push the programId onto a stack and switch the program context. This\n    // allows us to track, for a given log, which program was executing during\n    // its emission, thereby allowing us to know if a given log event was\n    // emitted by *this* program. If it was, then we parse the raw string and\n    // emit the event if the string matches the event being subscribed to.\n    *parseLogs(logs, errorOnDecodeFailure = false) {\n        const logScanner = new LogScanner(logs);\n        const execution = new ExecutionContext();\n        let log = logScanner.next();\n        while (log !== null) {\n            let [event, newProgram, didPop] = this.handleLog(execution, log, errorOnDecodeFailure);\n            if (event) {\n                yield event;\n            }\n            if (newProgram) {\n                execution.push(newProgram);\n            }\n            if (didPop) {\n                execution.pop();\n            }\n            log = logScanner.next();\n        }\n    }\n    // Main log handler. Returns a three element array of the event, the\n    // next program that was invoked for CPI, and a boolean indicating if\n    // a program has completed execution (and thus should be popped off the\n    // execution stack).\n    handleLog(execution, log, errorOnDecodeFailure) {\n        // Executing program is this program.\n        if (execution.stack.length > 0 &&\n            execution.program() === this.programId.toString()) {\n            return this.handleProgramLog(log, errorOnDecodeFailure);\n        }\n        // Executing program is not this program.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs from *this* program.\n    handleProgramLog(log, errorOnDecodeFailure) {\n        // This is a `msg!` log or a `sol_log_data` log.\n        if (log.startsWith(PROGRAM_LOG) || log.startsWith(PROGRAM_DATA)) {\n            const logStr = log.startsWith(PROGRAM_LOG)\n                ? log.slice(PROGRAM_LOG_START_INDEX)\n                : log.slice(PROGRAM_DATA_START_INDEX);\n            const event = this.coder.events.decode(logStr);\n            if (errorOnDecodeFailure && event === null) {\n                throw new Error(`Unable to decode event ${logStr}`);\n            }\n            return [event, null, false];\n        }\n        // System log.\n        else {\n            return [null, ...this.handleSystemLog(log)];\n        }\n    }\n    // Handles logs when the current program being executing is *not* this.\n    handleSystemLog(log) {\n        // System component.\n        const logStart = log.split(\":\")[0];\n        // Did the program finish executing?\n        if (logStart.match(/^Program (.*) success/g) !== null) {\n            return [null, true];\n            // Recursive call.\n        }\n        else if (logStart.startsWith(`Program ${this.programId.toString()} invoke`)) {\n            return [this.programId.toString(), false];\n        }\n        // CPI call.\n        else if (logStart.includes(\"invoke\")) {\n            return [\"cpi\", false]; // Any string will do.\n        }\n        else {\n            return [null, false];\n        }\n    }\n}\n// Stack frame execution context, allowing one to track what program is\n// executing for a given log.\nclass ExecutionContext {\n    constructor() {\n        this.stack = [];\n    }\n    program() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        return this.stack[this.stack.length - 1];\n    }\n    push(newProgram) {\n        this.stack.push(newProgram);\n    }\n    pop() {\n        if (!this.stack.length) {\n            throw new Error(\"Expected the stack to have elements\");\n        }\n        this.stack.pop();\n    }\n}\nclass LogScanner {\n    constructor(logs) {\n        this.logs = logs;\n    }\n    next() {\n        if (this.logs.length === 0) {\n            return null;\n        }\n        let l = this.logs[0];\n        this.logs = this.logs.slice(1);\n        return l;\n    }\n}\n\nclass SimulateFactory {\n    static build(idlIx, txFn, idlErrors, provider, coder, programId, idl) {\n        const simulate = async (...args) => {\n            var _a;\n            const tx = txFn(...args);\n            const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n            let resp = undefined;\n            if (provider.simulate === undefined) {\n                throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");\n            }\n            try {\n                resp = await provider.simulate(tx, ctx.signers, (_a = ctx.options) === null || _a === void 0 ? void 0 : _a.commitment);\n            }\n            catch (err) {\n                throw translateError(err, idlErrors);\n            }\n            if (resp === undefined) {\n                throw new Error(\"Unable to simulate transaction\");\n            }\n            const logs = resp.logs;\n            if (!logs) {\n                throw new Error(\"Simulated logs not found\");\n            }\n            const events = [];\n            if (idl.events) {\n                let parser = new EventParser(programId, coder);\n                for (const event of parser.parseLogs(logs)) {\n                    events.push(event);\n                }\n            }\n            return { events, raw: logs };\n        };\n        return simulate;\n    }\n}\n\nfunction uint64(property) {\n    return new WrappedLayout(blob(8), (b) => u64.fromBuffer(b), (n) => n.toBuffer(), property);\n}\nfunction publicKey(property) {\n    return new WrappedLayout(blob(32), (b) => new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(b), (key) => key.toBuffer(), property);\n}\nfunction coption(layout, property) {\n    return new COptionLayout(layout, property);\n}\nclass WrappedLayout extends Layout_2 {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nclass COptionLayout extends Layout_2 {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = u32();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.layout.span + this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 4) + 4;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 4);\n        }\n        throw new Error(\"Invalid coption \" + this.layout.property);\n    }\n    getSpan(b, offset = 0) {\n        return this.layout.getSpan(b, offset + 4) + 4;\n    }\n}\nclass u64 extends (bn_js__WEBPACK_IMPORTED_MODULE_2___default()) {\n    /**\n     * Convert to Buffer representation\n     */\n    toBuffer() {\n        const a = super.toArray().reverse();\n        const b = Buffer.from(a);\n        if (b.length === 8) {\n            return b;\n        }\n        if (b.length >= 8) {\n            throw new Error(\"u64 too large\");\n        }\n        const zeroPad = Buffer.alloc(8);\n        b.copy(zeroPad);\n        return zeroPad;\n    }\n    /**\n     * Construct a u64 from Buffer representation\n     */\n    static fromBuffer(buffer) {\n        if (buffer.length !== 8) {\n            throw new Error(`Invalid buffer length: ${buffer.length}`);\n        }\n        return new u64([...buffer]\n            .reverse()\n            .map((i) => `00${i.toString(16)}`.slice(-2))\n            .join(\"\"), 16);\n    }\n}\nconst TOKEN_ACCOUNT_LAYOUT = struct([\n    publicKey(\"mint\"),\n    publicKey(\"owner\"),\n    uint64(\"amount\"),\n    coption(publicKey(), \"delegate\"),\n    ((p) => {\n        const U = union(u8(\"discriminator\"), null, p);\n        U.addVariant(0, struct([]), \"uninitialized\");\n        U.addVariant(1, struct([]), \"initialized\");\n        U.addVariant(2, struct([]), \"frozen\");\n        return U;\n    })(\"state\"),\n    coption(uint64(), \"isNative\"),\n    uint64(\"delegatedAmount\"),\n    coption(publicKey(), \"closeAuthority\"),\n]);\nfunction decodeTokenAccount(b) {\n    return TOKEN_ACCOUNT_LAYOUT.decode(b);\n}\n\n// Populates a given accounts context with PDAs and common missing accounts.\nclass AccountsResolver {\n    constructor(_args, _accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n        this._accounts = _accounts;\n        this._provider = _provider;\n        this._programId = _programId;\n        this._idlIx = _idlIx;\n        this._idlTypes = _idlTypes;\n        this._customResolver = _customResolver;\n        this._args = _args;\n        this._accountStore = new AccountStore(_provider, _accountNamespace, this._programId);\n    }\n    args(_args) {\n        this._args = _args;\n    }\n    // Note: We serially resolve PDAs one by one rather than doing them\n    //       in parallel because there can be dependencies between\n    //       addresses. That is, one PDA can be used as a seed in another.\n    async resolve() {\n        await this.resolveConst(this._idlIx.accounts);\n        this._resolveEventCpi(this._idlIx.accounts);\n        // Auto populate pdas and relations until we stop finding new accounts\n        while ((await this.resolvePdas(this._idlIx.accounts)) +\n            (await this.resolveRelations(this._idlIx.accounts)) +\n            (await this.resolveCustom()) >\n            0) { }\n    }\n    async resolveCustom() {\n        if (this._customResolver) {\n            const { accounts, resolved } = await this._customResolver({\n                args: this._args,\n                accounts: this._accounts,\n                provider: this._provider,\n                programId: this._programId,\n                idlIx: this._idlIx,\n            });\n            this._accounts = accounts;\n            return resolved;\n        }\n        return 0;\n    }\n    resolveOptionalsHelper(partialAccounts, accountItems) {\n        const nestedAccountsGeneric = {};\n        // Looping through accountItem array instead of on partialAccounts, so\n        // we only traverse array once\n        for (const accountItem of accountItems) {\n            const accountName = accountItem.name;\n            const partialAccount = partialAccounts[accountName];\n            // Skip if the account isn't included (thus would be undefined)\n            if (partialAccount === undefined)\n                continue;\n            if (isPartialAccounts(partialAccount)) {\n                // is compound accounts, recurse one level deeper\n                if (isIdlAccounts(accountItem)) {\n                    nestedAccountsGeneric[accountName] = this.resolveOptionalsHelper(partialAccount, accountItem[\"accounts\"]);\n                }\n                else {\n                    // Here we try our best to recover gracefully. If there are optionals we can't check, we will fail then.\n                    nestedAccountsGeneric[accountName] = flattenPartialAccounts(partialAccount, true);\n                }\n            }\n            else {\n                // if not compound accounts, do null/optional check and proceed\n                if (partialAccount !== null) {\n                    nestedAccountsGeneric[accountName] = translateAddress(partialAccount);\n                }\n                else if (accountItem[\"isOptional\"]) {\n                    nestedAccountsGeneric[accountName] = this._programId;\n                }\n            }\n        }\n        return nestedAccountsGeneric;\n    }\n    resolveOptionals(accounts) {\n        Object.assign(this._accounts, this.resolveOptionalsHelper(accounts, this._idlIx.accounts));\n    }\n    get(path) {\n        // Only return if pubkey\n        const ret = path.reduce((acc, subPath) => acc && acc[subPath], this._accounts);\n        if (ret && ret.toBase58) {\n            return ret;\n        }\n    }\n    set(path, value) {\n        let curr = this._accounts;\n        path.forEach((p, idx) => {\n            const isLast = idx == path.length - 1;\n            if (isLast) {\n                curr[p] = value;\n            }\n            curr[p] = curr[p] || {};\n            curr = curr[p];\n        });\n    }\n    async resolveConst(accounts, path = []) {\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDescOrAccounts = accounts[k];\n            const subAccounts = accountDescOrAccounts.accounts;\n            if (subAccounts) {\n                await this.resolveConst(subAccounts, [\n                    ...path,\n                    camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDescOrAccounts.name),\n                ]);\n            }\n            const accountDesc = accountDescOrAccounts;\n            const accountDescName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDescOrAccounts.name);\n            // Signers default to the provider.\n            if (accountDesc.isSigner && !this.get([...path, accountDescName])) {\n                // @ts-expect-error\n                if (this._provider.wallet === undefined) {\n                    throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");\n                }\n                // @ts-expect-error\n                this.set([...path, accountDescName], this._provider.wallet.publicKey);\n            }\n            // Common accounts are auto populated with magic names by convention.\n            if (Reflect.has(AccountsResolver.CONST_ACCOUNTS, accountDescName) &&\n                !this.get([...path, accountDescName])) {\n                this.set([...path, accountDescName], AccountsResolver.CONST_ACCOUNTS[accountDescName]);\n            }\n        }\n    }\n    /**\n     * Resolve event CPI accounts `eventAuthority` and `program`.\n     *\n     * Accounts will only be resolved if they are declared next to each other to\n     * reduce the chance of name collision.\n     */\n    _resolveEventCpi(accounts, path = []) {\n        for (const i in accounts) {\n            const accountDescOrAccounts = accounts[i];\n            const subAccounts = accountDescOrAccounts.accounts;\n            if (subAccounts) {\n                this._resolveEventCpi(subAccounts, [\n                    ...path,\n                    camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDescOrAccounts.name),\n                ]);\n            }\n            // Validate next index exists\n            const nextIndex = +i + 1;\n            if (nextIndex === accounts.length)\n                return;\n            const currentName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accounts[i].name);\n            const nextName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accounts[nextIndex].name);\n            // Populate event CPI accounts if they exist\n            if (currentName === \"eventAuthority\" && nextName === \"program\") {\n                const currentPath = [...path, currentName];\n                const nextPath = [...path, nextName];\n                if (!this.get(currentPath)) {\n                    this.set(currentPath, _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddressSync([Buffer.from(\"__event_authority\")], this._programId)[0]);\n                }\n                if (!this.get(nextPath)) {\n                    this.set(nextPath, this._programId);\n                }\n                return;\n            }\n        }\n    }\n    async resolvePdas(accounts, path = []) {\n        let found = 0;\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDesc = accounts[k];\n            const subAccounts = accountDesc.accounts;\n            if (subAccounts) {\n                found += await this.resolvePdas(subAccounts, [\n                    ...path,\n                    camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDesc.name),\n                ]);\n            }\n            const accountDescCasted = accountDesc;\n            const accountDescName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDesc.name);\n            // PDA derived from IDL seeds.\n            if (accountDescCasted.pda &&\n                accountDescCasted.pda.seeds.length > 0 &&\n                !this.get([...path, accountDescName])) {\n                if (Boolean(await this.autoPopulatePda(accountDescCasted, path))) {\n                    found += 1;\n                }\n            }\n        }\n        return found;\n    }\n    async resolveRelations(accounts, path = []) {\n        let found = 0;\n        for (let k = 0; k < accounts.length; k += 1) {\n            const accountDesc = accounts[k];\n            const subAccounts = accountDesc.accounts;\n            if (subAccounts) {\n                found += await this.resolveRelations(subAccounts, [\n                    ...path,\n                    camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDesc.name),\n                ]);\n            }\n            const relations = accountDesc.relations || [];\n            const accountDescName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDesc.name);\n            const newPath = [...path, accountDescName];\n            // If we have this account and there's some missing accounts that are relations to this account, fetch them\n            const accountKey = this.get(newPath);\n            if (accountKey) {\n                const matching = relations.filter((rel) => !this.get([...path, camelcase__WEBPACK_IMPORTED_MODULE_4___default()(rel)]));\n                found += matching.length;\n                if (matching.length > 0) {\n                    const account = await this._accountStore.fetchAccount({\n                        publicKey: accountKey,\n                    });\n                    await Promise.all(matching.map(async (rel) => {\n                        const relName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(rel);\n                        this.set([...path, relName], account[relName]);\n                        return account[relName];\n                    }));\n                }\n            }\n        }\n        return found;\n    }\n    async autoPopulatePda(accountDesc, path = []) {\n        if (!accountDesc.pda || !accountDesc.pda.seeds)\n            throw new Error(\"Must have seeds\");\n        const seeds = await Promise.all(accountDesc.pda.seeds.map((seedDesc) => this.toBuffer(seedDesc, path)));\n        if (seeds.some((seed) => typeof seed == \"undefined\")) {\n            return;\n        }\n        const programId = await this.parseProgramId(accountDesc, path);\n        if (!programId) {\n            return;\n        }\n        const [pubkey] = await _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey.findProgramAddress(seeds, programId);\n        this.set([...path, camelcase__WEBPACK_IMPORTED_MODULE_4___default()(accountDesc.name)], pubkey);\n    }\n    async parseProgramId(accountDesc, path = []) {\n        var _a;\n        if (!((_a = accountDesc.pda) === null || _a === void 0 ? void 0 : _a.programId)) {\n            return this._programId;\n        }\n        switch (accountDesc.pda.programId.kind) {\n            case \"const\":\n                return new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(this.toBufferConst(accountDesc.pda.programId.value));\n            case \"arg\":\n                return this.argValue(accountDesc.pda.programId);\n            case \"account\":\n                return await this.accountValue(accountDesc.pda.programId, path);\n            default:\n                throw new Error(`Unexpected program seed kind: ${accountDesc.pda.programId.kind}`);\n        }\n    }\n    async toBuffer(seedDesc, path = []) {\n        switch (seedDesc.kind) {\n            case \"const\":\n                return this.toBufferConst(seedDesc);\n            case \"arg\":\n                return await this.toBufferArg(seedDesc);\n            case \"account\":\n                return await this.toBufferAccount(seedDesc, path);\n            default:\n                throw new Error(`Unexpected seed kind: ${seedDesc.kind}`);\n        }\n    }\n    /**\n     * Recursively get the type at some path of either a primitive or a user defined struct.\n     */\n    getType(type, path = []) {\n        if (path.length > 0 && type.defined) {\n            const subType = this._idlTypes.find((t) => t.name === type.defined);\n            if (!subType) {\n                throw new Error(`Cannot find type ${type.defined}`);\n            }\n            const structType = subType.type; // enum not supported yet\n            const field = structType.fields.find((field) => field.name === path[0]);\n            return this.getType(field.type, path.slice(1));\n        }\n        return type;\n    }\n    toBufferConst(seedDesc) {\n        return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), seedDesc.value);\n    }\n    async toBufferArg(seedDesc) {\n        const argValue = this.argValue(seedDesc);\n        if (typeof argValue === \"undefined\") {\n            return;\n        }\n        return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), argValue);\n    }\n    argValue(seedDesc) {\n        const split = seedDesc.path.split(\".\");\n        const seedArgName = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(split[0]);\n        const idlArgPosition = this._idlIx.args.findIndex((argDesc) => argDesc.name === seedArgName);\n        if (idlArgPosition === -1) {\n            throw new Error(`Unable to find argument for seed: ${seedArgName}`);\n        }\n        return split\n            .slice(1)\n            .reduce((curr, path) => (curr || {})[path], this._args[idlArgPosition]);\n    }\n    async toBufferAccount(seedDesc, path = []) {\n        const accountValue = await this.accountValue(seedDesc, path);\n        if (!accountValue) {\n            return;\n        }\n        return this.toBufferValue(seedDesc.type, accountValue);\n    }\n    async accountValue(seedDesc, path = []) {\n        const pathComponents = seedDesc.path.split(\".\");\n        const fieldName = pathComponents[0];\n        const fieldPubkey = this.get([...path, camelcase__WEBPACK_IMPORTED_MODULE_4___default()(fieldName)]);\n        if (fieldPubkey === null) {\n            throw new Error(`fieldPubkey is null`);\n        }\n        // The seed is a pubkey of the account.\n        if (pathComponents.length === 1) {\n            return fieldPubkey;\n        }\n        // The key is account data.\n        //\n        // Fetch and deserialize it.\n        const account = await this._accountStore.fetchAccount({\n            publicKey: fieldPubkey,\n            name: seedDesc.account,\n        });\n        // Dereference all fields in the path to get the field value\n        // used in the seed.\n        const fieldValue = this.parseAccountValue(account, pathComponents.slice(1));\n        return fieldValue;\n    }\n    parseAccountValue(account, path) {\n        let accountField;\n        while (path.length > 0) {\n            accountField = account[camelcase__WEBPACK_IMPORTED_MODULE_4___default()(path[0])];\n            path = path.slice(1);\n        }\n        return accountField;\n    }\n    // Converts the given idl valaue into a Buffer. The values here must be\n    // primitives. E.g. no structs.\n    //\n    // TODO: add more types here as needed.\n    toBufferValue(type, value) {\n        switch (type) {\n            case \"u8\":\n                return Buffer.from([value]);\n            case \"u16\":\n                let b = Buffer.alloc(2);\n                b.writeUInt16LE(value);\n                return b;\n            case \"u32\":\n                let buf = Buffer.alloc(4);\n                buf.writeUInt32LE(value);\n                return buf;\n            case \"u64\":\n                let bU64 = Buffer.alloc(8);\n                bU64.writeBigUInt64LE(BigInt(value));\n                return bU64;\n            case \"string\":\n                return Buffer.from(encode$2(value));\n            case \"publicKey\":\n                return value.toBuffer();\n            default:\n                if (type.array) {\n                    return Buffer.from(value);\n                }\n                throw new Error(`Unexpected seed type: ${type}`);\n        }\n    }\n}\nAccountsResolver.CONST_ACCOUNTS = {\n    associatedTokenProgram: ASSOCIATED_PROGRAM_ID,\n    rent: _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SYSVAR_RENT_PUBKEY,\n    systemProgram: _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SystemProgram.programId,\n    tokenProgram: TOKEN_PROGRAM_ID,\n    clock: _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.SYSVAR_CLOCK_PUBKEY,\n};\n// TODO: this should be configureable to avoid unnecessary requests.\nclass AccountStore {\n    // todo: don't use the progrma use the account namespace.\n    constructor(_provider, _accounts, _programId) {\n        this._provider = _provider;\n        this._programId = _programId;\n        this._cache = new Map();\n        this._idls = {};\n        this._idls[_programId.toBase58()] = _accounts;\n    }\n    async ensureIdl(programId) {\n        if (!this._idls[programId.toBase58()]) {\n            const idl = await Program.fetchIdl(programId, this._provider);\n            if (idl) {\n                const program = new Program(idl, programId, this._provider);\n                this._idls[programId.toBase58()] = program.account;\n            }\n        }\n        return this._idls[programId.toBase58()];\n    }\n    async fetchAccount({ publicKey, name, programId = this._programId, }) {\n        const address = publicKey.toString();\n        if (!this._cache.has(address)) {\n            if (name === \"TokenAccount\") {\n                const accountInfo = await this._provider.connection.getAccountInfo(publicKey);\n                if (accountInfo === null) {\n                    throw new Error(`invalid account info for ${address}`);\n                }\n                const data = decodeTokenAccount(accountInfo.data);\n                this._cache.set(address, data);\n            }\n            else if (name) {\n                const accounts = await this.ensureIdl(programId);\n                if (accounts) {\n                    const accountFetcher = accounts[camelcase__WEBPACK_IMPORTED_MODULE_4___default()(name)];\n                    if (accountFetcher) {\n                        const account = await accountFetcher.fetch(publicKey);\n                        this._cache.set(address, account);\n                    }\n                }\n            }\n            else {\n                const account = await this._provider.connection.getAccountInfo(publicKey);\n                if (account === null) {\n                    throw new Error(`invalid account info for ${address}`);\n                }\n                const data = account.data;\n                const accounts = await this.ensureIdl(account.owner);\n                if (accounts) {\n                    const firstAccountLayout = Object.values(accounts)[0];\n                    if (!firstAccountLayout) {\n                        throw new Error(\"No accounts for this program\");\n                    }\n                    const result = firstAccountLayout.coder.accounts.decodeAny(data);\n                    this._cache.set(address, result);\n                }\n            }\n        }\n        return this._cache.get(address);\n    }\n}\n\nclass MethodsBuilderFactory {\n    static build(provider, programId, idlIx, ixFn, txFn, rpcFn, simulateFn, viewFn, accountNamespace, idlTypes, customResolver) {\n        return (...args) => new MethodsBuilder(args, ixFn, txFn, rpcFn, simulateFn, viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n    }\n}\nfunction isPartialAccounts(partialAccount) {\n    return (typeof partialAccount === \"object\" &&\n        partialAccount !== null &&\n        !(\"_bn\" in partialAccount) // Ensures not a pubkey\n    );\n}\nfunction flattenPartialAccounts(partialAccounts, throwOnNull) {\n    const toReturn = {};\n    for (const accountName in partialAccounts) {\n        const account = partialAccounts[accountName];\n        if (account === null) {\n            if (throwOnNull)\n                throw new Error(\"Failed to resolve optionals due to IDL type mismatch with input accounts!\");\n            continue;\n        }\n        toReturn[accountName] = isPartialAccounts(account)\n            ? flattenPartialAccounts(account, true)\n            : translateAddress(account);\n    }\n    return toReturn;\n}\nclass MethodsBuilder {\n    constructor(_args, _ixFn, _txFn, _rpcFn, _simulateFn, _viewFn, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n        this._ixFn = _ixFn;\n        this._txFn = _txFn;\n        this._rpcFn = _rpcFn;\n        this._simulateFn = _simulateFn;\n        this._viewFn = _viewFn;\n        this._programId = _programId;\n        this._accounts = {};\n        this._remainingAccounts = [];\n        this._signers = [];\n        this._preInstructions = [];\n        this._postInstructions = [];\n        this._autoResolveAccounts = true;\n        this._args = _args;\n        this._accountsResolver = new AccountsResolver(_args, this._accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver);\n    }\n    args(_args) {\n        this._args = _args;\n        this._accountsResolver.args(_args);\n    }\n    async pubkeys() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        return this._accounts;\n    }\n    accounts(accounts) {\n        this._autoResolveAccounts = true;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    accountsStrict(accounts) {\n        this._autoResolveAccounts = false;\n        this._accountsResolver.resolveOptionals(accounts);\n        return this;\n    }\n    signers(signers) {\n        this._signers = this._signers.concat(signers);\n        return this;\n    }\n    remainingAccounts(accounts) {\n        this._remainingAccounts = this._remainingAccounts.concat(accounts);\n        return this;\n    }\n    preInstructions(ixs) {\n        this._preInstructions = this._preInstructions.concat(ixs);\n        return this;\n    }\n    postInstructions(ixs) {\n        this._postInstructions = this._postInstructions.concat(ixs);\n        return this;\n    }\n    async rpc(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._rpcFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async rpcAndKeys(options) {\n        const pubkeys = await this.pubkeys();\n        return {\n            pubkeys,\n            signature: await this.rpc(options),\n        };\n    }\n    async view(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        if (!this._viewFn) {\n            throw new Error(\"Method does not support views\");\n        }\n        // @ts-ignore\n        return this._viewFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async simulate(options) {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._simulateFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n            options: options,\n        });\n    }\n    async instruction() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._ixFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n    /**\n     * Convenient shortcut to get instructions and pubkeys via\n     * const { pubkeys, instructions } = await prepare();\n     */\n    async prepare() {\n        return {\n            instruction: await this.instruction(),\n            pubkeys: await this.pubkeys(),\n            signers: await this._signers,\n        };\n    }\n    async transaction() {\n        if (this._autoResolveAccounts) {\n            await this._accountsResolver.resolve();\n        }\n        // @ts-ignore\n        return this._txFn(...this._args, {\n            accounts: this._accounts,\n            signers: this._signers,\n            remainingAccounts: this._remainingAccounts,\n            preInstructions: this._preInstructions,\n            postInstructions: this._postInstructions,\n        });\n    }\n}\n\nclass ViewFactory {\n    static build(programId, idlIx, simulateFn, idl) {\n        const isMut = idlIx.accounts.find((a) => a.isMut);\n        const hasReturn = !!idlIx.returns;\n        if (isMut || !hasReturn)\n            return;\n        const view = async (...args) => {\n            var _a, _b;\n            let simulationResult = await simulateFn(...args);\n            const returnPrefix = `Program return: ${programId} `;\n            let returnLog = simulationResult.raw.find((l) => l.startsWith(returnPrefix));\n            if (!returnLog) {\n                throw new Error(\"View expected return log\");\n            }\n            let returnData = decode(returnLog.slice(returnPrefix.length));\n            let returnType = idlIx.returns;\n            if (!returnType) {\n                throw new Error(\"View expected return type\");\n            }\n            const coder = IdlCoder.fieldLayout({ type: returnType }, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n            return coder.decode(returnData);\n        };\n        return view;\n    }\n}\n\nclass NamespaceFactory {\n    /**\n     * Generates all namespaces for a given program.\n     */\n    static build(idl, coder, programId, provider, getCustomResolver) {\n        const rpc = {};\n        const instruction = {};\n        const transaction = {};\n        const simulate = {};\n        const methods = {};\n        const view = {};\n        const idlErrors = parseIdlErrors(idl);\n        const account = idl.accounts\n            ? AccountFactory.build(idl, coder, programId, provider)\n            : {};\n        idl.instructions.forEach((idlIx) => {\n            const ixItem = InstructionNamespaceFactory.build(idlIx, (ixName, ix) => coder.instruction.encode(ixName, ix), programId);\n            const txItem = TransactionFactory.build(idlIx, ixItem);\n            const rpcItem = RpcFactory.build(idlIx, txItem, idlErrors, provider);\n            const simulateItem = SimulateFactory.build(idlIx, txItem, idlErrors, provider, coder, programId, idl);\n            const viewItem = ViewFactory.build(programId, idlIx, simulateItem, idl);\n            const methodItem = MethodsBuilderFactory.build(provider, programId, idlIx, ixItem, txItem, rpcItem, simulateItem, viewItem, account, idl.types || [], getCustomResolver && getCustomResolver(idlIx));\n            const name = camelcase__WEBPACK_IMPORTED_MODULE_4___default()(idlIx.name);\n            instruction[name] = ixItem;\n            transaction[name] = txItem;\n            rpc[name] = rpcItem;\n            simulate[name] = simulateItem;\n            methods[name] = methodItem;\n            if (viewItem) {\n                view[name] = viewItem;\n            }\n        });\n        return [\n            rpc,\n            instruction,\n            transaction,\n            account,\n            simulate,\n            methods,\n            view,\n        ];\n    }\n}\n\n/**\n * ## Program\n *\n * Program provides the IDL deserialized client representation of an Anchor\n * program.\n *\n * This API is the one stop shop for all things related to communicating with\n * on-chain programs. Among other things, one can send transactions, fetch\n * deserialized accounts, decode instruction data, subscribe to account\n * changes, and listen to events.\n *\n * In addition to field accessors and methods, the object provides a set of\n * dynamically generated properties, also known as namespaces, that\n * map one-to-one to program methods and accounts. These namespaces generally\n *  can be used as follows:\n *\n * ## Usage\n *\n * ```javascript\n * program.<namespace>.<program-specific-method>\n * ```\n *\n * API specifics are namespace dependent. The examples used in the documentation\n * below will refer to the two counter examples found\n * [here](https://github.com/coral-xyz/anchor#examples).\n */\nclass Program {\n    /**\n     * Address of the program.\n     */\n    get programId() {\n        return this._programId;\n    }\n    /**\n     * IDL defining the program's interface.\n     */\n    get idl() {\n        return this._idl;\n    }\n    /**\n     * Coder for serializing requests.\n     */\n    get coder() {\n        return this._coder;\n    }\n    /**\n     * Wallet and network provider.\n     */\n    get provider() {\n        return this._provider;\n    }\n    /**\n     * @param idl       The interface definition.\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context to use. If not provided\n     *                  then uses [[getProvider]].\n     * @param getCustomResolver A function that returns a custom account resolver\n     *                          for the given instruction. This is useful for resolving\n     *                          public keys of missing accounts when building instructions\n     */\n    constructor(idl, programId, provider, coder, getCustomResolver) {\n        programId = translateAddress(programId);\n        if (!provider) {\n            provider = getProvider();\n        }\n        // Fields.\n        this._idl = idl;\n        this._provider = provider;\n        this._programId = programId;\n        this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n        this._events = new EventManager(this._programId, provider, this._coder);\n        // Dynamic namespaces.\n        const [rpc, instruction, transaction, account, simulate, methods, views] = NamespaceFactory.build(idl, this._coder, programId, provider, getCustomResolver !== null && getCustomResolver !== void 0 ? getCustomResolver : (() => undefined));\n        this.rpc = rpc;\n        this.instruction = instruction;\n        this.transaction = transaction;\n        this.account = account;\n        this.simulate = simulate;\n        this.methods = methods;\n        this.views = views;\n    }\n    /**\n     * Generates a Program client by fetching the IDL from the network.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async at(address, provider) {\n        const programId = translateAddress(address);\n        const idl = await Program.fetchIdl(programId, provider);\n        if (!idl) {\n            throw new Error(`IDL not found for program: ${address.toString()}`);\n        }\n        return new Program(idl, programId, provider);\n    }\n    /**\n     * Fetches an idl from the blockchain.\n     *\n     * In order to use this method, an IDL must have been previously initialized\n     * via the anchor CLI's `anchor idl init` command.\n     *\n     * @param programId The on-chain address of the program.\n     * @param provider  The network and wallet context.\n     */\n    static async fetchIdl(address, provider) {\n        provider = provider !== null && provider !== void 0 ? provider : getProvider();\n        const programId = translateAddress(address);\n        const idlAddr = await idlAddress(programId);\n        const accountInfo = await provider.connection.getAccountInfo(idlAddr);\n        if (!accountInfo) {\n            return null;\n        }\n        // Chop off account discriminator.\n        let idlAccount = decodeIdlAccount(accountInfo.data.slice(8));\n        const inflatedIdl = (0,pako__WEBPACK_IMPORTED_MODULE_6__/* .inflate */ .rr)(idlAccount.data);\n        return JSON.parse(decode$2(inflatedIdl));\n    }\n    /**\n     * Invokes the given callback every time the given event is emitted.\n     *\n     * @param eventName The PascalCase name of the event, provided by the IDL.\n     * @param callback  The function to invoke whenever the event is emitted from\n     *                  program logs.\n     */\n    addEventListener(eventName, callback) {\n        return this._events.addEventListener(eventName, callback);\n    }\n    /**\n     * Unsubscribes from the given eventName.\n     */\n    async removeEventListener(listener) {\n        return await this._events.removeEventListener(listener);\n    }\n}\n\nconst SYSTEM_PROGRAM_ID = new _solana_web3_js__WEBPACK_IMPORTED_MODULE_1__.PublicKey(\"11111111111111111111111111111111\");\nfunction program(provider) {\n    return new Program(IDL, SYSTEM_PROGRAM_ID, provider, coder());\n}\nfunction coder() {\n    return new SystemCoder(IDL);\n}\nconst IDL = {\n    version: \"0.1.0\",\n    name: \"system_program\",\n    instructions: [\n        {\n            name: \"createAccount\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"assign\",\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"transfer\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"createAccountWithSeed\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"advanceNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"withdrawNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"rent\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"initializeNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: true,\n                },\n                {\n                    name: \"recentBlockhashes\",\n                    isMut: false,\n                    isSigner: false,\n                },\n                {\n                    name: \"rent\",\n                    isMut: false,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"authorizeNonceAccount\",\n            accounts: [\n                {\n                    name: \"nonce\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"authorized\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"authorized\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"allocate\",\n            accounts: [\n                {\n                    name: \"pubkey\",\n                    isMut: true,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n            ],\n        },\n        {\n            name: \"allocateWithSeed\",\n            accounts: [\n                {\n                    name: \"account\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"space\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"assignWithSeed\",\n            accounts: [\n                {\n                    name: \"account\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n            ],\n            args: [\n                {\n                    name: \"base\",\n                    type: \"publicKey\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n        {\n            name: \"transferWithSeed\",\n            accounts: [\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: false,\n                },\n                {\n                    name: \"base\",\n                    isMut: false,\n                    isSigner: true,\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                },\n            ],\n            args: [\n                {\n                    name: \"lamports\",\n                    type: \"u64\",\n                },\n                {\n                    name: \"seed\",\n                    type: \"string\",\n                },\n                {\n                    name: \"owner\",\n                    type: \"publicKey\",\n                },\n            ],\n        },\n    ],\n    accounts: [\n        {\n            name: \"nonce\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"version\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"state\",\n                        type: \"u32\",\n                    },\n                    {\n                        name: \"authorizedPubkey\",\n                        type: \"publicKey\",\n                    },\n                    {\n                        name: \"nonce\",\n                        type: \"publicKey\",\n                    },\n                    {\n                        name: \"feeCalculator\",\n                        type: {\n                            defined: \"FeeCalculator\",\n                        },\n                    },\n                ],\n            },\n        },\n    ],\n    types: [\n        {\n            name: \"FeeCalculator\",\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"lamportsPerSignature\",\n                        type: \"u64\",\n                    },\n                ],\n            },\n        },\n    ],\n};\n\nclass Native {\n    static system(provider) {\n        return program(provider);\n    }\n}\n\n\n//# sourceMappingURL=index.js.map\n\n\n/***/ }),\n\n/***/ 1295:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = __webpack_require__(698);\nconst web3_js_1 = __webpack_require__(6737);\nconst bn_js_1 = __importDefault(__webpack_require__(3550));\nvar buffer_layout_2 = __webpack_require__(698);\nObject.defineProperty(exports, \"u8\", ({ enumerable: true, get: function () { return buffer_layout_2.u8; } }));\nObject.defineProperty(exports, \"i8\", ({ enumerable: true, get: function () { return buffer_layout_2.s8; } }));\nObject.defineProperty(exports, \"u16\", ({ enumerable: true, get: function () { return buffer_layout_2.u16; } }));\nObject.defineProperty(exports, \"i16\", ({ enumerable: true, get: function () { return buffer_layout_2.s16; } }));\nObject.defineProperty(exports, \"u32\", ({ enumerable: true, get: function () { return buffer_layout_2.u32; } }));\nObject.defineProperty(exports, \"i32\", ({ enumerable: true, get: function () { return buffer_layout_2.s32; } }));\nObject.defineProperty(exports, \"f32\", ({ enumerable: true, get: function () { return buffer_layout_2.f32; } }));\nObject.defineProperty(exports, \"f64\", ({ enumerable: true, get: function () { return buffer_layout_2.f64; } }));\nObject.defineProperty(exports, \"struct\", ({ enumerable: true, get: function () { return buffer_layout_2.struct; } }));\nclass BNLayout extends buffer_layout_1.Layout {\n    constructor(span, signed, property) {\n        super(span, property);\n        this.blob = (0, buffer_layout_1.blob)(span);\n        this.signed = signed;\n    }\n    decode(b, offset = 0) {\n        const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n        if (this.signed) {\n            return num.fromTwos(this.span * 8).clone();\n        }\n        return num;\n    }\n    encode(src, b, offset = 0) {\n        if (this.signed) {\n            src = src.toTwos(this.span * 8);\n        }\n        return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n    }\n}\nfunction u64(property) {\n    return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n    return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n    return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n    return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n    return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n    return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n    constructor(layout, decoder, encoder, property) {\n        super(layout.span, property);\n        this.layout = layout;\n        this.decoder = decoder;\n        this.encoder = encoder;\n    }\n    decode(b, offset) {\n        return this.decoder(this.layout.decode(b, offset));\n    }\n    encode(src, b, offset) {\n        return this.layout.encode(this.encoder(src), b, offset);\n    }\n    getSpan(b, offset) {\n        return this.layout.getSpan(b, offset);\n    }\n}\nfunction publicKey(property) {\n    return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n    constructor(layout, property) {\n        super(-1, property);\n        this.layout = layout;\n        this.discriminator = (0, buffer_layout_1.u8)();\n    }\n    encode(src, b, offset = 0) {\n        if (src === null || src === undefined) {\n            return this.discriminator.encode(0, b, offset);\n        }\n        this.discriminator.encode(1, b, offset);\n        return this.layout.encode(src, b, offset + 1) + 1;\n    }\n    decode(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return null;\n        }\n        else if (discriminator === 1) {\n            return this.layout.decode(b, offset + 1);\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n    getSpan(b, offset = 0) {\n        const discriminator = this.discriminator.decode(b, offset);\n        if (discriminator === 0) {\n            return 1;\n        }\n        else if (discriminator === 1) {\n            return this.layout.getSpan(b, offset + 1) + 1;\n        }\n        throw new Error(\"Invalid option \" + this.property);\n    }\n}\nfunction option(layout, property) {\n    return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n    return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n    if (value === 0) {\n        return false;\n    }\n    else if (value === 1) {\n        return true;\n    }\n    throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n    return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n    const wrappedLayout = (0, buffer_layout_1.struct)([\n        u64(\"tag\"),\n        layout.replicate(\"data\"),\n    ]);\n    function decodeTag({ tag: receivedTag, data }) {\n        if (!receivedTag.eq(tag)) {\n            throw new Error(\"Invalid tag, expected: \" +\n                tag.toString(\"hex\") +\n                \", got: \" +\n                receivedTag.toString(\"hex\"));\n        }\n        return data;\n    }\n    return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n    ]);\n    return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n    return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n    const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n    variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n    return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n    const layout = (0, buffer_layout_1.struct)([\n        (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n    constructor(keyLayout, valueLayout, property) {\n        super(keyLayout.span + valueLayout.span, property);\n        this.keyLayout = keyLayout;\n        this.valueLayout = valueLayout;\n    }\n    decode(b, offset) {\n        offset = offset || 0;\n        const key = this.keyLayout.decode(b, offset);\n        const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n        return [key, value];\n    }\n    encode(src, b, offset) {\n        offset = offset || 0;\n        const keyBytes = this.keyLayout.encode(src[0], b, offset);\n        const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n        return keyBytes + valueBytes;\n    }\n    getSpan(b, offset) {\n        return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n    }\n}\nfunction map(keyLayout, valueLayout, property) {\n    const length = (0, buffer_layout_1.u32)(\"length\");\n    const layout = (0, buffer_layout_1.struct)([\n        length,\n        (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n    ]);\n    return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 6486:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar basex = __webpack_require__(8162)\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 7370:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nconst UPPERCASE = /[\\p{Lu}]/u;\nconst LOWERCASE = /[\\p{Ll}]/u;\nconst LEADING_CAPITAL = /^[\\p{Lu}](?![\\p{Lu}])/gu;\nconst IDENTIFIER = /([\\p{Alpha}\\p{N}_]|$)/u;\nconst SEPARATORS = /[_.\\- ]+/;\n\nconst LEADING_SEPARATORS = new RegExp('^' + SEPARATORS.source);\nconst SEPARATORS_AND_IDENTIFIER = new RegExp(SEPARATORS.source + IDENTIFIER.source, 'gu');\nconst NUMBERS_AND_IDENTIFIER = new RegExp('\\\\d+' + IDENTIFIER.source, 'gu');\n\nconst preserveCamelCase = (string, toLowerCase, toUpperCase) => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && UPPERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && LOWERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = toLowerCase(character) === character && toUpperCase(character) !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = toUpperCase(character) === character && toLowerCase(character) !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst preserveConsecutiveUppercase = (input, toLowerCase) => {\n\tLEADING_CAPITAL.lastIndex = 0;\n\n\treturn input.replace(LEADING_CAPITAL, m1 => toLowerCase(m1));\n};\n\nconst postProcess = (input, toUpperCase) => {\n\tSEPARATORS_AND_IDENTIFIER.lastIndex = 0;\n\tNUMBERS_AND_IDENTIFIER.lastIndex = 0;\n\n\treturn input.replace(SEPARATORS_AND_IDENTIFIER, (_, identifier) => toUpperCase(identifier))\n\t\t.replace(NUMBERS_AND_IDENTIFIER, m => toUpperCase(m));\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = {\n\t\tpascalCase: false,\n\t\tpreserveConsecutiveUppercase: false,\n\t\t...options\n\t};\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tconst toLowerCase = options.locale === false ?\n\t\tstring => string.toLowerCase() :\n\t\tstring => string.toLocaleLowerCase(options.locale);\n\tconst toUpperCase = options.locale === false ?\n\t\tstring => string.toUpperCase() :\n\t\tstring => string.toLocaleUpperCase(options.locale);\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? toUpperCase(input) : toLowerCase(input);\n\t}\n\n\tconst hasUpperCase = input !== toLowerCase(input);\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input, toLowerCase, toUpperCase);\n\t}\n\n\tinput = input.replace(LEADING_SEPARATORS, '');\n\n\tif (options.preserveConsecutiveUppercase) {\n\t\tinput = preserveConsecutiveUppercase(input, toLowerCase);\n\t} else {\n\t\tinput = toLowerCase(input);\n\t}\n\n\tif (options.pascalCase) {\n\t\tinput = toUpperCase(input.charAt(0)) + input.slice(1);\n\t}\n\n\treturn postProcess(input, toUpperCase);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports[\"default\"] = camelCase;\n\n\n/***/ }),\n\n/***/ 71:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getATAAddressesSync = exports.getATAAddresses = exports.getATAAddressSync = exports.getATAAddress = void 0;\nconst solana_contrib_1 = __webpack_require__(4175);\nconst spl_token_1 = __webpack_require__(4945);\n/**\n * Gets an associated token account address.\n *\n * @deprecated use {@link getATAAddressSync}\n */\nconst getATAAddress = async ({ mint, owner, }) => {\n    return Promise.resolve((0, exports.getATAAddressSync)({ mint, owner }));\n};\nexports.getATAAddress = getATAAddress;\n/**\n * Gets an associated token account address synchronously.\n */\nconst getATAAddressSync = ({ mint, owner, }) => {\n    return (0, solana_contrib_1.getProgramAddress)([owner.toBuffer(), spl_token_1.TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID);\n};\nexports.getATAAddressSync = getATAAddressSync;\n/**\n * Gets multiple associated token account addresses.\n *\n * @deprecated use {@link getATAAddressesSync}\n */\nconst getATAAddresses = ({ mints, owner, }) => {\n    return Promise.resolve((0, exports.getATAAddressesSync)({ mints, owner }));\n};\nexports.getATAAddresses = getATAAddresses;\n/**\n * Gets multiple associated token account addresses.\n */\nconst getATAAddressesSync = ({ mints, owner, }) => {\n    const result = Object.entries(mints).map((args) => {\n        const [name, mint] = args;\n        const result = (0, exports.getATAAddressSync)({\n            mint,\n            owner: owner,\n        });\n        return {\n            address: result,\n            name,\n            mint,\n        };\n    });\n    const deduped = result.reduce((acc, { address, name, mint }) => {\n        return {\n            accounts: {\n                ...acc.accounts,\n                [name]: { address, mint },\n            },\n        };\n    }, { accounts: {} });\n    return {\n        accounts: deduped.accounts,\n    };\n};\nexports.getATAAddressesSync = getATAAddressesSync;\n//# sourceMappingURL=ata.js.map\n\n/***/ }),\n\n/***/ 5300:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * This file is a port of serum-common, which was built for web3.js 0.x.\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.sleep = exports.getTokenAccount = exports.getMintInfo = exports.createAccountRentExempt = exports.createTokenAccountInstrs = exports.createMintAndVault = exports.createMintInstructions = exports.createToken = exports.createMint = exports.SPL_SHARED_MEMORY_ID = exports.DEFAULT_TOKEN_DECIMALS = exports.token = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst index_js_1 = __webpack_require__(9510);\nexports.token = tslib_1.__importStar(__webpack_require__(7079));\n/**\n * Default number of decimals of a token.\n */\nexports.DEFAULT_TOKEN_DECIMALS = 6;\nexports.SPL_SHARED_MEMORY_ID = new web3_js_1.PublicKey(\"shmem4EWT2sPdVGvTZCzXXRAURL9G5vpPxNwSeKhHUL\");\nasync function createMint(provider, authority, decimals) {\n    if (authority === undefined) {\n        authority = provider.wallet.publicKey;\n    }\n    const mint = web3_js_1.Keypair.generate();\n    const instructions = await createMintInstructions(provider, authority, mint.publicKey, decimals);\n    const tx = new web3_js_1.Transaction();\n    tx.add(...instructions);\n    await provider.send(tx, [mint]);\n    return mint.publicKey;\n}\nexports.createMint = createMint;\n/**\n * Creates a Token.\n *\n * @param provider\n * @param authority The mint authority.\n * @param decimals Number of decimals.\n * @returns\n */\nasync function createToken(provider, authority, decimals = 6) {\n    return index_js_1.Token.fromMint(await createMint(provider, authority, decimals), decimals);\n}\nexports.createToken = createToken;\nasync function createMintInstructions(provider, authority, mint, decimals = 6) {\n    const instructions = [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: provider.wallet.publicKey,\n            newAccountPubkey: mint,\n            space: index_js_1.MintLayout.span,\n            lamports: await provider.connection.getMinimumBalanceForRentExemption(index_js_1.MintLayout.span),\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitMintInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, decimals, authority, null),\n    ];\n    return instructions;\n}\nexports.createMintInstructions = createMintInstructions;\nasync function createMintAndVault(provider, amount, owner, decimals) {\n    if (owner === undefined) {\n        owner = provider.wallet.publicKey;\n    }\n    const mint = web3_js_1.Keypair.generate();\n    const vault = web3_js_1.Keypair.generate();\n    const tx = new web3_js_1.Transaction();\n    tx.add(...(await createMintInstructions(provider, provider.wallet.publicKey, mint.publicKey, decimals)), web3_js_1.SystemProgram.createAccount({\n        fromPubkey: provider.wallet.publicKey,\n        newAccountPubkey: vault.publicKey,\n        space: 165,\n        lamports: await provider.connection.getMinimumBalanceForRentExemption(165),\n        programId: spl_token_1.TOKEN_PROGRAM_ID,\n    }), spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint.publicKey, vault.publicKey, owner), spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint.publicKey, vault.publicKey, provider.wallet.publicKey, [], amount));\n    await provider.send(tx, [mint, vault]);\n    return [mint.publicKey, vault.publicKey];\n}\nexports.createMintAndVault = createMintAndVault;\nasync function createTokenAccountInstrs(provider, newAccountPubkey, mint, owner, lamports) {\n    if (lamports === undefined) {\n        lamports = await provider.connection.getMinimumBalanceForRentExemption(165);\n    }\n    return [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: provider.wallet.publicKey,\n            newAccountPubkey,\n            space: 165,\n            lamports,\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, newAccountPubkey, owner),\n    ];\n}\nexports.createTokenAccountInstrs = createTokenAccountInstrs;\nasync function createAccountRentExempt(provider, programId, size) {\n    const acc = web3_js_1.Keypair.generate();\n    const tx = new web3_js_1.Transaction();\n    tx.add(web3_js_1.SystemProgram.createAccount({\n        fromPubkey: provider.wallet.publicKey,\n        newAccountPubkey: acc.publicKey,\n        space: size,\n        lamports: await provider.connection.getMinimumBalanceForRentExemption(size),\n        programId,\n    }));\n    await provider.send(tx, [acc]);\n    return acc;\n}\nexports.createAccountRentExempt = createAccountRentExempt;\nasync function getMintInfo(provider, addr) {\n    const depositorAccInfo = await provider.getAccountInfo(addr);\n    if (depositorAccInfo === null) {\n        throw new Error(\"Failed to find token mint account\");\n    }\n    return (0, index_js_1.deserializeMint)(depositorAccInfo.accountInfo.data);\n}\nexports.getMintInfo = getMintInfo;\nasync function getTokenAccount(provider, addr) {\n    const depositorAccInfo = await provider.getAccountInfo(addr);\n    if (depositorAccInfo === null) {\n        throw new Error(\"Failed to find token account\");\n    }\n    return (0, index_js_1.deserializeAccount)(depositorAccInfo.accountInfo.data);\n}\nexports.getTokenAccount = getTokenAccount;\nfunction sleep(ms) {\n    return new Promise((resolve) => setTimeout(resolve, ms));\n}\nexports.sleep = sleep;\n//# sourceMappingURL=common.js.map\n\n/***/ }),\n\n/***/ 9510:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * [[include:token-utils/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.u64 = exports.TOKEN_PROGRAM_ID = exports.SPLToken = exports.NATIVE_MINT = exports.ASSOCIATED_TOKEN_PROGRAM_ID = exports.ZERO = exports.validateU256 = exports.validateU64 = exports.TEN = exports.Rounding = exports.Percent = exports.parseBigintIsh = exports.ONE = exports.MAX_U256 = exports.MAX_U64 = exports.makeDecimalMultiplier = exports.Fraction = void 0;\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(71), exports);\ntslib_1.__exportStar(__webpack_require__(326), exports);\ntslib_1.__exportStar(__webpack_require__(3183), exports);\ntslib_1.__exportStar(__webpack_require__(7535), exports);\ntslib_1.__exportStar(__webpack_require__(3048), exports);\ntslib_1.__exportStar(__webpack_require__(7079), exports);\ntslib_1.__exportStar(__webpack_require__(7092), exports);\ntslib_1.__exportStar(__webpack_require__(1755), exports);\ntslib_1.__exportStar(__webpack_require__(1459), exports);\ntslib_1.__exportStar(__webpack_require__(9117), exports);\nvar token_math_1 = __webpack_require__(7111);\nObject.defineProperty(exports, \"Fraction\", ({ enumerable: true, get: function () { return token_math_1.Fraction; } }));\nObject.defineProperty(exports, \"makeDecimalMultiplier\", ({ enumerable: true, get: function () { return token_math_1.makeDecimalMultiplier; } }));\nObject.defineProperty(exports, \"MAX_U64\", ({ enumerable: true, get: function () { return token_math_1.MAX_U64; } }));\nObject.defineProperty(exports, \"MAX_U256\", ({ enumerable: true, get: function () { return token_math_1.MAX_U256; } }));\nObject.defineProperty(exports, \"ONE\", ({ enumerable: true, get: function () { return token_math_1.ONE; } }));\nObject.defineProperty(exports, \"parseBigintIsh\", ({ enumerable: true, get: function () { return token_math_1.parseBigintIsh; } }));\nObject.defineProperty(exports, \"Percent\", ({ enumerable: true, get: function () { return token_math_1.Percent; } }));\nObject.defineProperty(exports, \"Rounding\", ({ enumerable: true, get: function () { return token_math_1.Rounding; } }));\nObject.defineProperty(exports, \"TEN\", ({ enumerable: true, get: function () { return token_math_1.TEN; } }));\nObject.defineProperty(exports, \"validateU64\", ({ enumerable: true, get: function () { return token_math_1.validateU64; } }));\nObject.defineProperty(exports, \"validateU256\", ({ enumerable: true, get: function () { return token_math_1.validateU256; } }));\nObject.defineProperty(exports, \"ZERO\", ({ enumerable: true, get: function () { return token_math_1.ZERO; } }));\n// serum common\ntslib_1.__exportStar(__webpack_require__(5300), exports);\nvar spl_token_1 = __webpack_require__(4945);\nObject.defineProperty(exports, \"ASSOCIATED_TOKEN_PROGRAM_ID\", ({ enumerable: true, get: function () { return spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID; } }));\nObject.defineProperty(exports, \"NATIVE_MINT\", ({ enumerable: true, get: function () { return spl_token_1.NATIVE_MINT; } }));\nObject.defineProperty(exports, \"SPLToken\", ({ enumerable: true, get: function () { return spl_token_1.Token; } }));\nObject.defineProperty(exports, \"TOKEN_PROGRAM_ID\", ({ enumerable: true, get: function () { return spl_token_1.TOKEN_PROGRAM_ID; } }));\nObject.defineProperty(exports, \"u64\", ({ enumerable: true, get: function () { return spl_token_1.u64; } }));\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 2555:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.buildCreateTokenAccountTX = exports.createTokenAccount = void 0;\nconst solana_contrib_1 = __webpack_require__(4175);\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst layout_js_1 = __webpack_require__(3183);\nconst createTokenAccount = async ({ provider, mint, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, accountSigner = web3_js_1.Keypair.generate(), }) => {\n    // Allocate memory for the account\n    const rentExemptAccountBalance = await spl_token_1.Token.getMinBalanceRentForExemptAccount(provider.connection);\n    return (0, exports.buildCreateTokenAccountTX)({\n        provider,\n        mint,\n        rentExemptAccountBalance,\n        owner,\n        payer,\n        accountSigner,\n    });\n};\nexports.createTokenAccount = createTokenAccount;\nconst buildCreateTokenAccountTX = ({ provider, mint, rentExemptAccountBalance, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, accountSigner = web3_js_1.Keypair.generate(), }) => {\n    const tokenAccount = accountSigner.publicKey;\n    return {\n        key: tokenAccount,\n        tx: new solana_contrib_1.TransactionEnvelope(provider, [\n            web3_js_1.SystemProgram.createAccount({\n                fromPubkey: payer,\n                newAccountPubkey: accountSigner.publicKey,\n                lamports: rentExemptAccountBalance,\n                space: layout_js_1.TokenAccountLayout.span,\n                programId: spl_token_1.TOKEN_PROGRAM_ID,\n            }),\n            spl_token_1.Token.createInitAccountInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, tokenAccount, owner),\n        ], [accountSigner]),\n    };\n};\nexports.buildCreateTokenAccountTX = buildCreateTokenAccountTX;\n//# sourceMappingURL=account.js.map\n\n/***/ }),\n\n/***/ 7353:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.createATAInstruction = exports.getOrCreateATAs = exports.getOrCreateATA = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst ata_js_1 = __webpack_require__(71);\n/**\n * Gets an associated token account, returning a create instruction if it doesn't exist.\n * @param param0\n * @returns\n */\nconst getOrCreateATA = async ({ provider, mint, owner = provider.wallet.publicKey, payer = provider.wallet.publicKey, }) => {\n    const address = (0, ata_js_1.getATAAddressSync)({ mint, owner });\n    if (await provider.getAccountInfo(address)) {\n        return { address, instruction: null };\n    }\n    else {\n        return {\n            address,\n            instruction: (0, exports.createATAInstruction)({\n                mint,\n                address,\n                owner,\n                payer,\n            }),\n        };\n    }\n};\nexports.getOrCreateATA = getOrCreateATA;\n/**\n * Gets ATAs and creates them if they don't exist.\n * @param param0\n * @returns\n */\nconst getOrCreateATAs = async ({ provider, mints, owner = provider.wallet.publicKey, }) => {\n    const result = await Promise.all(Object.entries(mints).map(async ([name, mint]) => {\n        const mintKey = new web3_js_1.PublicKey(mint);\n        const result = await (0, exports.getOrCreateATA)({\n            provider,\n            mint: mintKey,\n            owner: owner,\n            payer: provider.wallet.publicKey,\n        });\n        return {\n            address: result.address,\n            instruction: result.instruction,\n            name,\n            mintKey,\n        };\n    }));\n    const deduped = result.reduce((acc, { address, name, instruction }) => {\n        return {\n            accounts: {\n                ...acc.accounts,\n                [name]: address,\n            },\n            createAccountInstructions: {\n                ...acc.createAccountInstructions,\n                [name]: instruction,\n            },\n            instructions: instruction\n                ? {\n                    ...acc.instructions,\n                    [address.toString()]: instruction,\n                }\n                : acc.instructions,\n        };\n    }, { accounts: {}, instructions: {}, createAccountInstructions: {} });\n    return {\n        accounts: deduped.accounts,\n        createAccountInstructions: deduped.createAccountInstructions,\n        instructions: Object.values(deduped.instructions),\n    };\n};\nexports.getOrCreateATAs = getOrCreateATAs;\n/**\n * Instruction for creating an ATA.\n * @returns\n */\nconst createATAInstruction = ({ address, mint, owner, payer, }) => spl_token_1.Token.createAssociatedTokenAccountInstruction(spl_token_1.ASSOCIATED_TOKEN_PROGRAM_ID, spl_token_1.TOKEN_PROGRAM_ID, mint, address, owner, payer);\nexports.createATAInstruction = createATAInstruction;\n//# sourceMappingURL=ata.js.map\n\n/***/ }),\n\n/***/ 326:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(2555), exports);\ntslib_1.__exportStar(__webpack_require__(7353), exports);\ntslib_1.__exportStar(__webpack_require__(4483), exports);\ntslib_1.__exportStar(__webpack_require__(4476), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 4483:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.createMintToInstruction = exports.createInitMintTX = exports.createInitMintInstructions = void 0;\nconst solana_contrib_1 = __webpack_require__(4175);\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst layout_js_1 = __webpack_require__(3183);\n/**\n * Creates instructions for initializing a mint.\n * @param param0\n * @returns\n */\nconst createInitMintInstructions = async ({ provider, mintKP, decimals, mintAuthority = provider.wallet.publicKey, freezeAuthority = null, }) => {\n    return (0, exports.createInitMintTX)({\n        provider,\n        mintKP,\n        decimals,\n        rentExemptMintBalance: await spl_token_1.Token.getMinBalanceRentForExemptMint(provider.connection),\n        mintAuthority,\n        freezeAuthority,\n    });\n};\nexports.createInitMintInstructions = createInitMintInstructions;\n/**\n * Creates instructions for initializing a mint.\n * @param param0\n * @returns\n */\nconst createInitMintTX = ({ provider, mintKP, decimals, rentExemptMintBalance, mintAuthority = provider.wallet.publicKey, freezeAuthority = null, }) => {\n    const from = provider.wallet.publicKey;\n    return new solana_contrib_1.TransactionEnvelope(provider, [\n        web3_js_1.SystemProgram.createAccount({\n            fromPubkey: from,\n            newAccountPubkey: mintKP.publicKey,\n            space: layout_js_1.MintLayout.span,\n            lamports: rentExemptMintBalance,\n            programId: spl_token_1.TOKEN_PROGRAM_ID,\n        }),\n        spl_token_1.Token.createInitMintInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, decimals, mintAuthority, freezeAuthority),\n    ], [mintKP]);\n};\nexports.createInitMintTX = createInitMintTX;\nconst createMintToInstruction = ({ provider, mint, mintAuthorityKP, to, amount, }) => {\n    return new solana_contrib_1.TransactionEnvelope(provider, [\n        spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mint, to, mintAuthorityKP.publicKey, [], amount),\n    ], [mintAuthorityKP]);\n};\nexports.createMintToInstruction = createMintToInstruction;\n//# sourceMappingURL=mint.js.map\n\n/***/ }),\n\n/***/ 4476:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.mintNFT = void 0;\nconst spl_token_1 = __webpack_require__(4945);\nconst ata_js_1 = __webpack_require__(7353);\nconst mint_js_1 = __webpack_require__(4483);\nconst mintNFT = async (provider, mintKP, owner = provider.wallet.publicKey) => {\n    // Temporary mint authority\n    const tempMintAuthority = provider.wallet.publicKey;\n    // Mint for the NFT\n    const tx = await (0, mint_js_1.createInitMintInstructions)({\n        provider,\n        mintKP,\n        decimals: 0,\n        mintAuthority: tempMintAuthority,\n    });\n    // Token account for the NFT\n    const { address, instruction } = await (0, ata_js_1.getOrCreateATA)({\n        provider,\n        mint: mintKP.publicKey,\n        owner: owner,\n        payer: provider.wallet.publicKey,\n    });\n    if (instruction) {\n        tx.instructions.push(instruction);\n    }\n    // Mint to owner's ATA\n    tx.instructions.push(spl_token_1.Token.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, address, tempMintAuthority, [], new spl_token_1.u64(1)));\n    // Set mint authority of the NFT to NULL\n    tx.instructions.push(spl_token_1.Token.createSetAuthorityInstruction(spl_token_1.TOKEN_PROGRAM_ID, mintKP.publicKey, null, \"MintTokens\", tempMintAuthority, []));\n    return tx;\n};\nexports.mintNFT = mintNFT;\n//# sourceMappingURL=nft.js.map\n\n/***/ }),\n\n/***/ 3183:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.deserializeMint = exports.deserializeAccount = exports.MintLayout = exports.TokenAccountLayout = exports.Uint64Layout = exports.PublicKeyLayout = exports.structLayout = exports.TypedStructure = exports.TypedLayout = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst solana_contrib_1 = __webpack_require__(4175);\nconst BufferLayout = tslib_1.__importStar(__webpack_require__(9386));\nconst spl_token_1 = __webpack_require__(4945);\nvar buffer_layout_1 = __webpack_require__(9386);\nObject.defineProperty(exports, \"TypedLayout\", ({ enumerable: true, get: function () { return buffer_layout_1.Layout; } }));\nObject.defineProperty(exports, \"TypedStructure\", ({ enumerable: true, get: function () { return buffer_layout_1.Structure; } }));\n/**\n * Typed struct buffer layout\n * @param fields\n * @param property\n * @param decodePrefixes\n * @returns\n */\nconst structLayout = (fields, property, decodePrefixes) => BufferLayout.struct(fields, property, decodePrefixes);\nexports.structLayout = structLayout;\n/**\n * Layout for a public key\n */\nconst PublicKeyLayout = (property = \"publicKey\") => {\n    return BufferLayout.blob(32, property);\n};\nexports.PublicKeyLayout = PublicKeyLayout;\n/**\n * Layout for a 64bit unsigned value\n */\nconst Uint64Layout = (property = \"uint64\") => {\n    return BufferLayout.blob(8, property);\n};\nexports.Uint64Layout = Uint64Layout;\n/**\n * Layout for a TokenAccount.\n */\nexports.TokenAccountLayout = spl_token_1.AccountLayout;\n/**\n * Layout for a Mint.\n */\nexports.MintLayout = spl_token_1.MintLayout;\n/**\n * Deserializes a token account.\n * @param address\n * @param data\n * @returns\n */\nconst deserializeAccount = (data) => {\n    const accountInfo = exports.TokenAccountLayout.decode(data);\n    const mint = new solana_contrib_1.PublicKey(accountInfo.mint);\n    const owner = new solana_contrib_1.PublicKey(accountInfo.owner);\n    const amount = spl_token_1.u64.fromBuffer(accountInfo.amount);\n    let delegate;\n    let delegatedAmount;\n    if (accountInfo.delegateOption === 0) {\n        delegate = null;\n        delegatedAmount = new spl_token_1.u64(0);\n    }\n    else {\n        delegate = new solana_contrib_1.PublicKey(accountInfo.delegate);\n        delegatedAmount = spl_token_1.u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n    const isInitialized = accountInfo.state !== 0;\n    const isFrozen = accountInfo.state === 2;\n    let rentExemptReserve;\n    let isNative;\n    if (accountInfo.isNativeOption === 1) {\n        rentExemptReserve = spl_token_1.u64.fromBuffer(accountInfo.isNative);\n        isNative = true;\n    }\n    else {\n        rentExemptReserve = null;\n        isNative = false;\n    }\n    let closeAuthority;\n    if (accountInfo.closeAuthorityOption === 0) {\n        closeAuthority = null;\n    }\n    else {\n        closeAuthority = new solana_contrib_1.PublicKey(accountInfo.closeAuthority);\n    }\n    return {\n        mint,\n        owner,\n        amount,\n        delegate,\n        delegatedAmount,\n        isInitialized,\n        isFrozen,\n        rentExemptReserve,\n        isNative,\n        closeAuthority,\n    };\n};\nexports.deserializeAccount = deserializeAccount;\n/**\n * Deserialize a {@link Buffer} into a {@link MintInfo}.\n * @param data\n * @returns\n */\nconst deserializeMint = (data) => {\n    if (data.length !== exports.MintLayout.span) {\n        throw new Error(\"Not a valid Mint\");\n    }\n    const mintInfo = exports.MintLayout.decode(data);\n    let mintAuthority;\n    if (mintInfo.mintAuthorityOption === 0) {\n        mintAuthority = null;\n    }\n    else {\n        mintAuthority = new solana_contrib_1.PublicKey(mintInfo.mintAuthority);\n    }\n    const supply = spl_token_1.u64.fromBuffer(mintInfo.supply);\n    const isInitialized = mintInfo.isInitialized !== 0;\n    let freezeAuthority;\n    if (mintInfo.freezeAuthorityOption === 0) {\n        freezeAuthority = null;\n    }\n    else {\n        freezeAuthority = new solana_contrib_1.PublicKey(mintInfo.freezeAuthority);\n    }\n    return {\n        mintAuthority,\n        supply,\n        decimals: mintInfo.decimals,\n        isInitialized,\n        freezeAuthority,\n    };\n};\nexports.deserializeMint = deserializeMint;\n//# sourceMappingURL=layout.js.map\n\n/***/ }),\n\n/***/ 7535:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Price = void 0;\nconst token_math_1 = __webpack_require__(7111);\n/**\n * A price of one token relative to another.\n */\nclass Price extends token_math_1.Price {\n    /**\n     * Constructs a price.\n     * @param baseCurrency\n     * @param quoteCurrency\n     * @param denominator\n     * @param numerator\n     */\n    constructor(baseCurrency, quoteCurrency, denominator, numerator) {\n        super(baseCurrency, quoteCurrency, denominator, numerator);\n    }\n    new(baseCurrency, quoteCurrency, denominator, numerator) {\n        return new Price(baseCurrency, quoteCurrency, denominator, numerator);\n    }\n    static fromUPrice(price) {\n        return new Price(price.baseCurrency, price.quoteCurrency, price.denominator, price.numerator);\n    }\n}\nexports.Price = Price;\n//# sourceMappingURL=price.js.map\n\n/***/ }),\n\n/***/ 3048:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\n/**\n * These types all come from the @solana/spl-token-registry package.\n *\n * We re-export them here so we do not have to have a hard dependency on\n * that package, which is massive.\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ENV = void 0;\n/**\n * Chain ID.\n */\nvar ENV;\n(function (ENV) {\n    ENV[ENV[\"MainnetBeta\"] = 101] = \"MainnetBeta\";\n    ENV[ENV[\"Testnet\"] = 102] = \"Testnet\";\n    ENV[ENV[\"Devnet\"] = 103] = \"Devnet\";\n})(ENV || (exports.ENV = ENV = {}));\n//# sourceMappingURL=splTokenRegistry.js.map\n\n/***/ }),\n\n/***/ 7079:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar _a;\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.WRAPPED_SOL = exports.RAW_SOL = exports.chainIdToNetwork = exports.networkToChainId = exports.CHAIN_ID_TO_NETWORK = exports.NETWORK_TO_CHAIN_ID = exports.ChainId = exports.makeTokenForAllNetworks = exports.tokensEqual = exports.Token = exports.RAW_SOL_MINT = void 0;\nconst solana_contrib_1 = __webpack_require__(4175);\nconst spl_token_1 = __webpack_require__(4945);\nconst layout_js_1 = __webpack_require__(3183);\n/**\n * Magic value representing the raw, underlying Solana native asset.\n */\nexports.RAW_SOL_MINT = new solana_contrib_1.PublicKey(\"RawSo11111111111111111111111111111111111112\");\n/**\n * Token information.\n */\nclass Token {\n    constructor(info) {\n        var _b;\n        this.info = info;\n        this._mintAccount = null;\n        this.network = (_b = (0, exports.chainIdToNetwork)(info.chainId)) !== null && _b !== void 0 ? _b : \"localnet\";\n    }\n    /**\n     * The mint PublicKey of the token.\n     *\n     * Avoid using this value to print it to a string, as base58\n     * strings are relatively slow to create since they require the use\n     * of hash functions.\n     */\n    get mintAccount() {\n        if (this._mintAccount) {\n            return this._mintAccount;\n        }\n        this._mintAccount = new solana_contrib_1.PublicKey(this.info.address);\n        return this._mintAccount;\n    }\n    /**\n     * If true, this token represents unwrapped, native, \"raw\" SOL.\n     */\n    get isRawSOL() {\n        return this.mintAccount.equals(exports.RAW_SOL_MINT);\n    }\n    /**\n     * The Base58 string representation of the mint address.\n     */\n    get address() {\n        return this.info.address;\n    }\n    /**\n     * The chain ID of the token.\n     */\n    get chainId() {\n        return this.info.chainId;\n    }\n    /**\n     * Number of decimals of the token.\n     */\n    get decimals() {\n        return this.info.decimals;\n    }\n    /**\n     * The name of the token.\n     */\n    get name() {\n        return this.info.name;\n    }\n    /**\n     * The symbol of the token.\n     */\n    get symbol() {\n        return this.info.symbol;\n    }\n    /**\n     * The token's icon to render.\n     */\n    get icon() {\n        return this.info.logoURI;\n    }\n    equals(other) {\n        return (0, exports.tokensEqual)(this, other);\n    }\n    toString() {\n        return `Token[mint=${this.address}, decimals=${this.decimals}, network=${this.network}]`;\n    }\n    toJSON() {\n        return this.info;\n    }\n    /**\n     * Returns true if the given tag is present.\n     * @param tag The tag to check.\n     * @returns\n     */\n    hasTag(tag) {\n        var _b;\n        return !!((_b = this.info.tags) === null || _b === void 0 ? void 0 : _b.includes(tag));\n    }\n}\nexports.Token = Token;\n_a = Token;\n/**\n * Loads a token from a Mint.\n * @param mint\n * @param opts\n * @returns\n */\nToken.fromMint = (mint, decimals, opts = {}) => {\n    var _b, _c, _d;\n    return new _a({\n        ...opts,\n        // required\n        address: mint.toString(),\n        decimals,\n        // optional\n        name: (_b = opts.name) !== null && _b !== void 0 ? _b : `Token ${mint.toString().slice(0, 4)}`,\n        symbol: (_c = opts.symbol) !== null && _c !== void 0 ? _c : mint.toString().slice(0, 5),\n        chainId: (_d = opts.chainId) !== null && _d !== void 0 ? _d : ChainId.Localnet,\n    });\n};\n/**\n * Loads a token from a Connection.\n *\n * @param connection\n * @param mint\n * @param info\n */\nToken.load = async (connection, mint, info = {}) => {\n    if (typeof info.decimals === \"number\") {\n        return _a.fromMint(mint, info.decimals, info);\n    }\n    const mintAccountInfo = await connection.getAccountInfo(mint);\n    if (!mintAccountInfo) {\n        return null;\n    }\n    const mintInfo = (0, layout_js_1.deserializeMint)(mintAccountInfo.data);\n    return _a.fromMint(mint, mintInfo.decimals, info);\n};\n/**\n * Checks if two tokens are equal.\n * @param a\n * @param b\n * @returns\n */\nconst tokensEqual = (a, b) => a !== undefined &&\n    b !== undefined &&\n    a.address === b.address &&\n    a.network === b.network;\nexports.tokensEqual = tokensEqual;\nconst rawSol = {\n    address: exports.RAW_SOL_MINT.toString(),\n    name: \"Solana\",\n    symbol: \"SOL\",\n    decimals: 9,\n    logoURI: \"https://raw.githubusercontent.com/solana-labs/token-list/main/assets/mainnet/So11111111111111111111111111111111111111112/logo.png\",\n};\nconst wrappedSol = {\n    address: spl_token_1.NATIVE_MINT.toString(),\n    name: \"Wrapped SOL\",\n    symbol: \"SOL\",\n    decimals: 9,\n    logoURI: \"https://raw.githubusercontent.com/solana-labs/token-list/main/assets/mainnet/So11111111111111111111111111111111111111112/logo.png\",\n};\n/**\n * Creates a Token for all networks.\n */\nconst makeTokenForAllNetworks = (token) => ({\n    \"mainnet-beta\": new Token({ ...token, chainId: ChainId.MainnetBeta }),\n    devnet: new Token({ ...token, chainId: ChainId.Devnet }),\n    testnet: new Token({ ...token, chainId: ChainId.Testnet }),\n    localnet: new Token({ ...token, chainId: ChainId.Localnet }),\n});\nexports.makeTokenForAllNetworks = makeTokenForAllNetworks;\n// comes from @solana/spl-token-registry, except we've added localnet\nvar ChainId;\n(function (ChainId) {\n    ChainId[ChainId[\"MainnetBeta\"] = 101] = \"MainnetBeta\";\n    ChainId[ChainId[\"Testnet\"] = 102] = \"Testnet\";\n    ChainId[ChainId[\"Devnet\"] = 103] = \"Devnet\";\n    ChainId[ChainId[\"Localnet\"] = 104] = \"Localnet\";\n})(ChainId || (exports.ChainId = ChainId = {}));\nexports.NETWORK_TO_CHAIN_ID = {\n    \"mainnet-beta\": ChainId.MainnetBeta,\n    devnet: ChainId.Devnet,\n    testnet: ChainId.Testnet,\n    localnet: 104,\n};\nexports.CHAIN_ID_TO_NETWORK = Object.entries(exports.NETWORK_TO_CHAIN_ID).reduce((acc, [network, env]) => ({ ...acc, [env]: network }), {});\n/**\n * Gets the chain id associated with a network.\n * @param network\n * @returns\n */\nconst networkToChainId = (network) => exports.NETWORK_TO_CHAIN_ID[network];\nexports.networkToChainId = networkToChainId;\n/**\n * Gets the Network associated with a chain id.\n * @param network\n * @returns\n */\nconst chainIdToNetwork = (env) => exports.CHAIN_ID_TO_NETWORK[env];\nexports.chainIdToNetwork = chainIdToNetwork;\n/**\n * Raw Solana token.\n *\n * This is a magic value. This is not a real token.\n */\nexports.RAW_SOL = (0, exports.makeTokenForAllNetworks)(rawSol);\n/**\n * Wrapped Solana token.\n */\nexports.WRAPPED_SOL = (0, exports.makeTokenForAllNetworks)(wrappedSol);\n//# sourceMappingURL=token.js.map\n\n/***/ }),\n\n/***/ 7092:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenAmount = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst spl_token_1 = __webpack_require__(4945);\nconst token_math_1 = __webpack_require__(7111);\nconst bn_js_1 = tslib_1.__importDefault(__webpack_require__(3550));\nclass TokenAmount extends token_math_1.TokenAmount {\n    // amount _must_ be raw, i.e. in the native representation\n    constructor(token, amount) {\n        super(token, amount, token_math_1.validateU64);\n    }\n    new(token, amount) {\n        // unsafe but nobody will be extending this anyway probably\n        return new TokenAmount(token, amount);\n    }\n    /**\n     * Parses a token amount from a decimal representation.\n     * @param token\n     * @param uiAmount\n     * @returns\n     */\n    static parse(token, uiAmount) {\n        const prev = (0, token_math_1.parseAmountFromString)(token, uiAmount, \".\", \",\");\n        return new TokenAmount(token, prev);\n    }\n    /**\n     * Divides this TokenAmount by a raw integer.\n     * @param other\n     * @returns\n     */\n    divideByInteger(other) {\n        return new TokenAmount(this.token, this.toU64().div(new bn_js_1.default((0, token_math_1.parseBigintIsh)(other).toString())));\n    }\n    /**\n     * String representation of this token amount.\n     */\n    toString() {\n        return `TokenAmount[Token=(${this.token.toString()}), amount=${this.toExact()}`;\n    }\n    /**\n     * JSON representation of the token amount.\n     */\n    toJSON() {\n        return {\n            ...super.toJSON(),\n            _isTA: true,\n            mint: this.token.address,\n            uiAmount: this.toExact(),\n        };\n    }\n    /**\n     * Converts this to the raw u64 used by the SPL library\n     * @returns\n     */\n    toU64() {\n        return new spl_token_1.u64(this.raw.toString());\n    }\n}\nexports.TokenAmount = TokenAmount;\n//# sourceMappingURL=tokenAmount.js.map\n\n/***/ }),\n\n/***/ 1755:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.dedupeTokens = exports.makeTokenMap = exports.ORIGIN_CHAINS = void 0;\nconst token_js_1 = __webpack_require__(7079);\n/**\n * Known origin chains.\n */\nexports.ORIGIN_CHAINS = [\n    \"bitcoin\",\n    \"ethereum\",\n    \"terra\",\n    \"avalanche\",\n    \"binance\",\n    \"celo\",\n    \"polygon\",\n    \"fantom\",\n    \"polygon\",\n    \"heco\",\n];\n/**\n * Creates a token map from a TokenList.\n * @param tokens\n * @returns\n */\nconst makeTokenMap = (tokenList) => {\n    const ret = {};\n    tokenList.tokens.forEach((item) => {\n        ret[item.address] = new token_js_1.Token(item);\n    });\n    return ret;\n};\nexports.makeTokenMap = makeTokenMap;\n/**\n * Dedupes a list of tokens, picking the first instance of the token in a list.\n * @param tokens\n * @returns\n */\nconst dedupeTokens = (tokens) => {\n    const seen = new Set();\n    return tokens.filter((token) => {\n        const tokenID = `${token.address}_${token.chainId}`;\n        if (seen.has(tokenID)) {\n            return false;\n        }\n        else {\n            seen.add(tokenID);\n            return true;\n        }\n    });\n};\nexports.dedupeTokens = dedupeTokens;\n//# sourceMappingURL=tokenList.js.map\n\n/***/ }),\n\n/***/ 1459:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenOwner = void 0;\nconst index_js_1 = __webpack_require__(9510);\n/**\n * Wrapper around a token account owner to create token instructions.\n */\nclass TokenOwner {\n    constructor(owner) {\n        this.owner = owner;\n    }\n    /**\n     * Gets the user's ATA.\n     * @param mint\n     * @returns\n     */\n    async getATA(mint) {\n        return await (0, index_js_1.getATAAddress)({ mint, owner: this.owner });\n    }\n    /**\n     * Gets the user's ATA.\n     * @param mint\n     * @returns\n     */\n    getATASync(mint) {\n        return (0, index_js_1.getATAAddressSync)({ mint, owner: this.owner });\n    }\n    /**\n     * Transfers tokens to a token account.\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    async transfer(amount, to) {\n        return index_js_1.SPLToken.createTransferInstruction(index_js_1.TOKEN_PROGRAM_ID, await this.getATA(amount.token.mintAccount), to, this.owner, [], amount.toU64());\n    }\n    /**\n     * Transfers tokens to a token account, checked..\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    async transferChecked(amount, to) {\n        return index_js_1.SPLToken.createTransferCheckedInstruction(index_js_1.TOKEN_PROGRAM_ID, await this.getATA(amount.token.mintAccount), amount.token.mintAccount, to, this.owner, [], amount.toU64(), amount.token.decimals);\n    }\n    /**\n     * Mints tokens to a token account.\n     * @param amount Amount of tokens to transfer.\n     * @param to Token account to transfer to.\n     * @returns The transaction instruction.\n     */\n    mintTo(amount, to) {\n        return index_js_1.SPLToken.createMintToInstruction(index_js_1.TOKEN_PROGRAM_ID, amount.token.mintAccount, to, this.owner, [], amount.toU64());\n    }\n    /**\n     * Creates an associated token account instruction.\n     * @param mint Mint of the ATA.\n     * @param payer Payer to create the ATA. Defaults to the owner.\n     * @returns The transaction instruction.\n     */\n    async createATA(mint, payer = this.owner) {\n        return index_js_1.SPLToken.createAssociatedTokenAccountInstruction(index_js_1.ASSOCIATED_TOKEN_PROGRAM_ID, index_js_1.TOKEN_PROGRAM_ID, mint, await this.getATA(mint), this.owner, payer);\n    }\n}\nexports.TokenOwner = TokenOwner;\n//# sourceMappingURL=tokenOwner.js.map\n\n/***/ }),\n\n/***/ 9117:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenAugmentedProvider = void 0;\nconst solana_contrib_1 = __webpack_require__(4175);\nconst spl_token_1 = __webpack_require__(4945);\nconst web3_js_1 = __webpack_require__(6737);\nconst ata_js_1 = __webpack_require__(71);\nconst common_js_1 = __webpack_require__(5300);\nconst index_js_1 = __webpack_require__(9510);\nconst ata_js_2 = __webpack_require__(7353);\nconst layout_js_1 = __webpack_require__(3183);\nconst token_js_1 = __webpack_require__(7079);\n/**\n * Augmented provider with token utilities.\n */\nclass TokenAugmentedProvider extends solana_contrib_1.SolanaAugmentedProvider {\n    constructor(provider) {\n        super(provider);\n    }\n    /**\n     * Creates a transaction to create a {@link Token}.\n     */\n    async createTokenTX({ mintKP = web3_js_1.Keypair.generate(), authority = this.walletKey, decimals = common_js_1.DEFAULT_TOKEN_DECIMALS, } = {}) {\n        const instructions = await (0, common_js_1.createMintInstructions)(this.provider, authority, mintKP.publicKey, decimals);\n        return {\n            token: token_js_1.Token.fromMint(mintKP.publicKey, decimals),\n            tx: this.newTX(instructions, [mintKP]),\n        };\n    }\n    /**\n     * Transfers tokens from the provider's ATA to a `TokenAccount`.\n     */\n    async transferTo({ amount, source, destination, }) {\n        const txEnv = this.newTX();\n        if (!source) {\n            const sourceATA = await this.getOrCreateATA({\n                mint: amount.token.mintAccount,\n            });\n            txEnv.append(sourceATA.instruction);\n            source = sourceATA.address;\n        }\n        txEnv.append(index_js_1.SPLToken.createTransferInstruction(spl_token_1.TOKEN_PROGRAM_ID, source, destination, this.walletKey, [], amount.toU64()));\n        return txEnv;\n    }\n    /**\n     * Transfers tokens to a recipient's ATA.\n     */\n    async transfer({ amount, source, to, }) {\n        const toATA = await this.getOrCreateATA({\n            mint: amount.token.mintAccount,\n            owner: to,\n        });\n        const txEnv = await this.transferTo({\n            amount,\n            source,\n            destination: toATA.address,\n        });\n        txEnv.prepend(toATA.instruction);\n        return txEnv;\n    }\n    /**\n     * Creates a {@link Token}.\n     */\n    async createToken({ mintKP = web3_js_1.Keypair.generate(), authority = this.walletKey, decimals = common_js_1.DEFAULT_TOKEN_DECIMALS, } = {}) {\n        const { token, tx } = await this.createTokenTX({\n            mintKP,\n            authority,\n            decimals,\n        });\n        await tx.confirm();\n        return token;\n    }\n    /**\n     * Gets an ATA address.\n     * @returns\n     */\n    async getATAAddress({ mint, owner = this.walletKey, }) {\n        return await (0, ata_js_1.getATAAddress)({ mint, owner });\n    }\n    /**\n     * Gets an ATA address.\n     * @returns\n     */\n    async getATAAddresses({ mints, owner = this.walletKey, }) {\n        return await (0, ata_js_1.getATAAddresses)({ mints, owner });\n    }\n    /**\n     * Gets an ATA, creating it if it doesn't exist.\n     * @returns\n     */\n    async getOrCreateATA({ mint, owner = this.walletKey, }) {\n        return await (0, ata_js_2.getOrCreateATA)({ provider: this.provider, mint, owner });\n    }\n    /**\n     * Get or create multiple ATAs.\n     * @returns\n     */\n    async getOrCreateATAs({ mints, owner = this.walletKey, }) {\n        return await (0, ata_js_2.getOrCreateATAs)({ provider: this.provider, mints, owner });\n    }\n    /**\n     * Loads a token from the blockchain, only if the decimals are not provided.\n     * @param mint\n     * @returns\n     */\n    async loadToken(mint, info = {}) {\n        return token_js_1.Token.load(this.provider.connection, mint, info);\n    }\n    /**\n     * Mints tokens to a token account.\n     * @param mint\n     * @returns\n     */\n    mintToAccount({ amount, destination, }) {\n        return this.newTX([\n            index_js_1.SPLToken.createMintToInstruction(spl_token_1.TOKEN_PROGRAM_ID, amount.token.mintAccount, destination, this.walletKey, [], amount.toU64()),\n        ]);\n    }\n    /**\n     * Mints tokens to the ATA of the `to` account.\n     * @param amount The amount of tokens to mint.\n     * @param to The owner of the ATA that may be created.\n     * @returns\n     */\n    async mintTo({ amount, to = this.walletKey, }) {\n        const toATA = await this.getOrCreateATA({\n            mint: amount.token.mintAccount,\n            owner: to,\n        });\n        const txEnv = this.mintToAccount({\n            amount,\n            destination: toATA.address,\n        });\n        txEnv.prepend(toATA.instruction);\n        return txEnv;\n    }\n    /**\n     * Fetches a mint.\n     * @param address\n     * @returns\n     */\n    async fetchMint(address) {\n        const accountInfo = await this.getAccountInfo(address);\n        if (accountInfo === null) {\n            return null;\n        }\n        return (0, layout_js_1.deserializeMint)(accountInfo.accountInfo.data);\n    }\n    /**\n     * Fetches a token account.\n     * @param address\n     * @returns\n     */\n    async fetchTokenAccount(address) {\n        const tokenAccountInfo = await this.getAccountInfo(address);\n        if (tokenAccountInfo === null) {\n            return null;\n        }\n        return (0, layout_js_1.deserializeAccount)(tokenAccountInfo.accountInfo.data);\n    }\n    /**\n     * Fetches an ATA.\n     * @param mint\n     * @param owner\n     * @returns\n     */\n    async fetchATA(mint, owner = this.walletKey) {\n        const taAddress = await (0, ata_js_1.getATAAddress)({ mint, owner });\n        return await this.fetchTokenAccount(taAddress);\n    }\n}\nexports.TokenAugmentedProvider = TokenAugmentedProvider;\n//# sourceMappingURL=tokenProvider.js.map\n\n/***/ }),\n\n/***/ 7979:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\n/**\n * [[include:option-utils/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.exists = exports.isNotUndefined = exports.isNotNull = exports.mapSome = exports.mapN = void 0;\n/**\n * Applies a function to a list of null/undefined values, unwrapping the null/undefined value or passing it through.\n */\nconst mapN = (fn, ...args) => {\n    if (!args.every((arg) => arg !== undefined)) {\n        return undefined;\n    }\n    if (!args.every((arg) => arg !== null)) {\n        return null;\n    }\n    return fn(...args);\n};\nexports.mapN = mapN;\n/**\n * Applies a function to a null/undefined inner value if it is null or undefined,\n * otherwise returns null/undefined.\n *\n * For consistency reasons, we recommend just using {@link mapN} in all cases.\n *\n * @deprecated use {@link mapN}\n * @param obj\n * @param fn\n * @returns\n */\nconst mapSome = (obj, fn) => ((0, exports.exists)(obj) ? fn(obj) : obj);\nexports.mapSome = mapSome;\n/**\n * Checks to see if the provided value is not null.\n *\n * Useful for preserving types in filtering out non-null values.\n *\n * @param value\n * @returns\n */\nconst isNotNull = (value) => {\n    return value !== null;\n};\nexports.isNotNull = isNotNull;\n/**\n * Checks to see if the provided value is not undefined.\n *\n * @param value\n * @returns\n */\nconst isNotUndefined = (value) => {\n    return value !== undefined;\n};\nexports.isNotUndefined = isNotUndefined;\n/**\n * Checks to see if the provided value is not null or undefined.\n *\n * @param value\n * @returns\n */\nconst exists = (value) => {\n    return value !== null && value !== undefined;\n};\nexports.exists = exists;\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 2072:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.MultipleConnectionBroadcaster = exports.SingleConnectionBroadcaster = exports.DEFAULT_FALLBACK_RETRY_OPTIONS = exports.DEFAULT_RETRY_OPTIONS = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst error_js_1 = __webpack_require__(8075);\nconst provider_js_1 = __webpack_require__(2645);\nconst index_js_1 = __webpack_require__(2175);\nconst index_js_2 = __webpack_require__(2723);\nconst simulateTransactionWithCommitment_js_1 = __webpack_require__(2377);\nconst sendAndSpamRawTx_js_1 = __webpack_require__(8653);\ntslib_1.__exportStar(__webpack_require__(7720), exports);\n/**\n * Default retry parameters.\n */\nexports.DEFAULT_RETRY_OPTIONS = {\n    retryTimes: 3,\n    retryInterval: 1000,\n};\n/**\n * Default retry parameters for fallbacks.\n */\nexports.DEFAULT_FALLBACK_RETRY_OPTIONS = {\n    retryTimes: 10,\n    retryInterval: 300,\n};\n/**\n * Broadcasts transactions to a single connection.\n */\nclass SingleConnectionBroadcaster {\n    constructor(sendConnection, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.sendConnection = sendConnection;\n        this.opts = opts;\n    }\n    /**\n     * @inheritdoc\n     */\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.commitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.sendConnection.getLatestBlockhash(commitment);\n    }\n    /**\n     * @inheritdoc\n     */\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.commitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        const result = await this.sendConnection.getLatestBlockhash(commitment);\n        return result.blockhash;\n    }\n    /**\n     * @inheritdoc\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return new index_js_1.PendingTransaction(this.sendConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.sendConnection, rawTx, opts, opts));\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return new index_js_1.PendingTransaction(this.sendConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.sendConnection, rawTx, opts, opts));\n        });\n    }\n    /**\n     * @inheritdoc\n     */\n    async simulate(tx, _a) {\n        var _b, _c;\n        var { commitment = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_c = this.opts.preflightCommitment) !== null && _c !== void 0 ? _c : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        return await (0, simulateTransactionWithCommitment_js_1.simulateTransactionWithCommitment)(this.sendConnection, tx, commitment);\n    }\n}\nexports.SingleConnectionBroadcaster = SingleConnectionBroadcaster;\n/**\n * Broadcasts transactions to multiple connections simultaneously.\n */\nclass MultipleConnectionBroadcaster {\n    constructor(connections, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.connections = connections;\n        this.opts = opts;\n    }\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        try {\n            const result = await Promise.any(this.connections.map((conn) => conn.getLatestBlockhash(commitment)));\n            return result;\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        try {\n            const result = await Promise.any(this.connections.map((conn) => conn.getLatestBlockhash(commitment)));\n            return result.blockhash;\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    async _sendRawTransaction(encoded, options) {\n        try {\n            return await Promise.any(this.connections.map(async (connection) => {\n                return new index_js_1.PendingTransaction(connection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(connection, encoded, options !== null && options !== void 0 ? options : this.opts));\n            }));\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n    /**\n     * Broadcasts a signed transaction.\n     *\n     * @param tx\n     * @param confirm\n     * @param opts\n     * @returns\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return await this._sendRawTransaction(rawTx, opts);\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return await this._sendRawTransaction(rawTx, opts);\n        });\n    }\n    /**\n     * Simulates a transaction with a commitment.\n     * @param tx\n     * @param commitment\n     * @returns\n     */\n    async simulate(tx, _a) {\n        var _b, _c, _d, _e;\n        var { commitment = (_c = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : this.opts.commitment) !== null && _c !== void 0 ? _c : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_e = (_d = this.opts.preflightCommitment) !== null && _d !== void 0 ? _d : this.opts.commitment) !== null && _e !== void 0 ? _e : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        try {\n            return await Promise.any(this.connections.map(async (connection) => {\n                return await (0, simulateTransactionWithCommitment_js_1.simulateTransactionWithCommitment)(connection, tx, commitment);\n            }));\n        }\n        catch (e) {\n            if (e instanceof AggregateError) {\n                throw (0, error_js_1.firstAggregateError)(e);\n            }\n            else {\n                throw e;\n            }\n        }\n    }\n}\nexports.MultipleConnectionBroadcaster = MultipleConnectionBroadcaster;\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 8653:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.sendAndSpamRawTx = void 0;\nconst index_js_1 = __webpack_require__(2723);\nconst index_js_2 = __webpack_require__(2072);\n/**\n * Sends and spams a raw transaction multiple times.\n * @param connection Connection to send the transaction to. We recommend using a public endpoint such as GenesysGo.\n * @param rawTx\n * @param opts\n */\nconst sendAndSpamRawTx = async (connection, rawTx, sendOptions, { retryTimes = index_js_2.DEFAULT_RETRY_OPTIONS.retryTimes, retryInterval = index_js_2.DEFAULT_RETRY_OPTIONS.retryInterval, } = index_js_2.DEFAULT_RETRY_OPTIONS) => {\n    const result = await connection.sendRawTransaction(rawTx, sendOptions);\n    // if we could send the TX with preflight, let's spam it.\n    void (async () => {\n        // technique stolen from Mango.\n        for (let i = 0; i < retryTimes; i++) {\n            try {\n                await (0, index_js_1.sleep)(retryInterval);\n                await connection.sendRawTransaction(rawTx, {\n                    ...sendOptions,\n                    skipPreflight: true,\n                });\n            }\n            catch (e) {\n                console.warn(`[Broadcaster] sendAndSpamRawTx error`, e);\n            }\n        }\n    })();\n    return result;\n};\nexports.sendAndSpamRawTx = sendAndSpamRawTx;\n//# sourceMappingURL=sendAndSpamRawTx.js.map\n\n/***/ }),\n\n/***/ 7720:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TieredBroadcaster = void 0;\nconst provider_js_1 = __webpack_require__(2645);\nconst index_js_1 = __webpack_require__(2175);\nconst index_js_2 = __webpack_require__(2723);\nconst index_js_3 = __webpack_require__(2072);\nconst sendAndSpamRawTx_js_1 = __webpack_require__(8653);\n/**\n * Broadcasts transactions to multiple connections simultaneously.\n */\nclass TieredBroadcaster {\n    constructor(primaryConnection, \n    /**\n     * Connections to send to in addition to the primary.\n     */\n    fallbackConnections, opts = provider_js_1.DEFAULT_PROVIDER_OPTIONS) {\n        this.primaryConnection = primaryConnection;\n        this.fallbackConnections = fallbackConnections;\n        this.opts = opts;\n        this.premiumBroadcaster = new index_js_3.SingleConnectionBroadcaster(primaryConnection, opts);\n    }\n    async getLatestBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.premiumBroadcaster.getLatestBlockhash(commitment);\n    }\n    async getRecentBlockhash(commitment) {\n        var _a;\n        if (commitment === void 0) { commitment = (_a = this.opts.preflightCommitment) !== null && _a !== void 0 ? _a : \"confirmed\"; }\n        return await this.premiumBroadcaster.getRecentBlockhash(commitment);\n    }\n    async _sendRawTransaction(encoded, options) {\n        const pending = new index_js_1.PendingTransaction(this.primaryConnection, await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(this.primaryConnection, encoded, options !== null && options !== void 0 ? options : this.opts, options !== null && options !== void 0 ? options : index_js_3.DEFAULT_RETRY_OPTIONS));\n        void (async () => {\n            await Promise.all(this.fallbackConnections.map(async (fc) => {\n                var _a;\n                try {\n                    await (0, sendAndSpamRawTx_js_1.sendAndSpamRawTx)(fc, encoded, options !== null && options !== void 0 ? options : this.opts, (_a = options === null || options === void 0 ? void 0 : options.fallbackRetryOptions) !== null && _a !== void 0 ? _a : index_js_3.DEFAULT_FALLBACK_RETRY_OPTIONS);\n                }\n                catch (e) {\n                    console.warn(`[Broadcaster] _sendRawTransaction error`, e);\n                }\n            }));\n        })();\n        return pending;\n    }\n    /**\n     * Broadcasts a signed transaction.\n     *\n     * @param tx\n     * @param confirm\n     * @param opts\n     * @returns\n     */\n    async broadcast(tx, { printLogs = true, ...opts } = this.opts) {\n        if (tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before broadcasting.\");\n        }\n        const rawTx = tx.serialize();\n        if (printLogs) {\n            return await this._sendRawTransaction(rawTx, opts);\n        }\n        return await (0, index_js_2.suppressConsoleErrorAsync)(async () => {\n            // hide the logs of TX errors if printLogs = false\n            return await this._sendRawTransaction(rawTx, opts);\n        });\n    }\n    /**\n     * Simulates a transaction with a commitment.\n     * @param tx\n     * @param commitment\n     * @returns\n     */\n    async simulate(tx, _a) {\n        var _b, _c;\n        var { commitment = (_b = this.opts.preflightCommitment) !== null && _b !== void 0 ? _b : \"confirmed\", verifySigners = true, } = _a === void 0 ? {\n            commitment: (_c = this.opts.preflightCommitment) !== null && _c !== void 0 ? _c : \"confirmed\",\n            verifySigners: true,\n        } : _a;\n        if (verifySigners && tx.signatures.length === 0) {\n            throw new Error(\"Transaction must be signed before simulating.\");\n        }\n        return this.premiumBroadcaster.simulate(tx, {\n            commitment,\n            verifySigners,\n        });\n    }\n}\nexports.TieredBroadcaster = TieredBroadcaster;\n//# sourceMappingURL=tiered.js.map\n\n/***/ }),\n\n/***/ 3078:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.COMPUTE_BUDGET_PROGRAM = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst web3_js_1 = __webpack_require__(6737);\n/**\n * The compute budget program.\n * Source: https://github.com/solana-labs/solana/blob/master/program-runtime/src/compute_budget.rs#L101\n */\nexports.COMPUTE_BUDGET_PROGRAM = new web3_js_1.PublicKey(\"ComputeBudget111111111111111111111111111111\");\ntslib_1.__exportStar(__webpack_require__(4781), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 4781:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.requestHeapFrameInstruction = exports.requestComputeUnitsInstruction = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst index_js_1 = __webpack_require__(3078);\nconst layouts_js_1 = __webpack_require__(6251);\n/**\n * Request a specific maximum number of compute units the transaction is\n * allowed to consume and an additional fee to pay.\n */\nconst requestComputeUnitsInstruction = (units, additionalFee) => {\n    const data = Buffer.alloc(layouts_js_1.RequestUnitsLayout.span);\n    layouts_js_1.RequestUnitsLayout.encode({ instruction: 0, units, additionalFee }, data);\n    return new web3_js_1.TransactionInstruction({\n        data,\n        keys: [],\n        programId: index_js_1.COMPUTE_BUDGET_PROGRAM,\n    });\n};\nexports.requestComputeUnitsInstruction = requestComputeUnitsInstruction;\n/**\n * Request a specific transaction-wide program heap region size in bytes.\n * The value requested must be a multiple of 1024. This new heap region\n * size applies to each program executed, including all calls to CPIs.\n */\nconst requestHeapFrameInstruction = (bytes) => {\n    const data = Buffer.alloc(layouts_js_1.RequestHeapFrameLayout.span);\n    layouts_js_1.RequestHeapFrameLayout.encode({ instruction: 1, bytes }, data);\n    return new web3_js_1.TransactionInstruction({\n        data,\n        keys: [],\n        programId: index_js_1.COMPUTE_BUDGET_PROGRAM,\n    });\n};\nexports.requestHeapFrameInstruction = requestHeapFrameInstruction;\n//# sourceMappingURL=instructions.js.map\n\n/***/ }),\n\n/***/ 6251:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.RequestHeapFrameLayout = exports.RequestUnitsLayout = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst BufferLayout = tslib_1.__importStar(__webpack_require__(9386));\nexports.RequestUnitsLayout = BufferLayout.struct([\n    BufferLayout.u8(\"instruction\"),\n    BufferLayout.u32(\"units\"),\n    BufferLayout.u32(\"additionalFee\"),\n]);\nexports.RequestHeapFrameLayout = BufferLayout.struct([BufferLayout.u8(\"instruction\"), BufferLayout.u32(\"bytes\")]);\n//# sourceMappingURL=layouts.js.map\n\n/***/ }),\n\n/***/ 2610:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.DEFAULT_NETWORK_CONFIG_MAP = exports.formatNetwork = void 0;\n/**\n * Formats the network as a string.\n * @param network\n * @returns\n */\nconst formatNetwork = (network) => {\n    if (network === \"mainnet-beta\") {\n        return \"mainnet\";\n    }\n    return network;\n};\nexports.formatNetwork = formatNetwork;\n/**\n * Default configuration for all networks.\n */\nexports.DEFAULT_NETWORK_CONFIG_MAP = {\n    \"mainnet-beta\": {\n        name: \"Mainnet Beta\",\n        endpoint: \"https://api.mainnet-beta.solana.com/\",\n    },\n    devnet: {\n        name: \"Devnet\",\n        endpoint: \"https://api.devnet.solana.com/\",\n    },\n    testnet: {\n        name: \"Testnet\",\n        endpoint: \"https://api.testnet.solana.com/\",\n    },\n    localnet: {\n        name: \"Localnet\",\n        endpoint: \"http://127.0.0.1:8899\",\n    },\n};\n//# sourceMappingURL=constants.js.map\n\n/***/ }),\n\n/***/ 8075:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.firstAggregateError = void 0;\nconst firstAggregateError = (err) => {\n    const errors = err.errors;\n    const [firstError, ...remErrors] = [errors.pop(), ...errors];\n    if (remErrors.length > 0) {\n        console.error(remErrors);\n    }\n    return firstError;\n};\nexports.firstAggregateError = firstAggregateError;\n//# sourceMappingURL=error.js.map\n\n/***/ }),\n\n/***/ 4175:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * [[include:solana-contrib/README.md]]\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(2072), exports);\ntslib_1.__exportStar(__webpack_require__(2610), exports);\ntslib_1.__exportStar(__webpack_require__(5545), exports);\ntslib_1.__exportStar(__webpack_require__(2645), exports);\ntslib_1.__exportStar(__webpack_require__(2175), exports);\ntslib_1.__exportStar(__webpack_require__(2723), exports);\ntslib_1.__exportStar(__webpack_require__(4633), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 5545:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n//# sourceMappingURL=interfaces.js.map\n\n/***/ }),\n\n/***/ 2645:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.SolanaAugmentedProvider = exports.SolanaProvider = exports.SolanaTransactionSigner = exports.doSignAndBroadcastTransaction = exports.SolanaReadonlyProvider = exports.DEFAULT_READONLY_PUBLIC_KEY = exports.DEFAULT_PROVIDER_OPTIONS = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst web3_js_1 = __webpack_require__(6737);\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst index_js_1 = __webpack_require__(2072);\nconst index_js_2 = __webpack_require__(4175);\nconst TransactionEnvelope_js_1 = __webpack_require__(775);\nexports.DEFAULT_PROVIDER_OPTIONS = {\n    preflightCommitment: \"confirmed\",\n    commitment: \"confirmed\",\n};\nexports.DEFAULT_READONLY_PUBLIC_KEY = web3_js_1.SystemProgram.programId;\n/**\n * Provider that can only read.\n */\nclass SolanaReadonlyProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param opts       Transaction confirmation options to use by default.\n     * @param publicKey  Optional public key of read-only wallet.\n     */\n    constructor(connection, opts = exports.DEFAULT_PROVIDER_OPTIONS, publicKey = exports.DEFAULT_READONLY_PUBLIC_KEY) {\n        this.connection = connection;\n        this.opts = opts;\n        this.publicKey = publicKey;\n        this.wallet = {\n            signTransaction: Promise.resolve.bind(Promise),\n            signAllTransactions: Promise.resolve.bind(Promise),\n            publicKey: exports.DEFAULT_READONLY_PUBLIC_KEY,\n        };\n        this.wallet = {\n            ...this.wallet,\n            publicKey,\n        };\n    }\n    /**\n     * Gets\n     * @param accountId\n     * @returns\n     */\n    async getAccountInfo(accountId) {\n        const accountInfo = await this.connection.getAccountInfo(accountId, this.opts.commitment);\n        if (!accountInfo) {\n            return null;\n        }\n        return {\n            accountId,\n            accountInfo,\n        };\n    }\n}\nexports.SolanaReadonlyProvider = SolanaReadonlyProvider;\nconst doSignAndBroadcastTransaction = async (wallet, transaction, broadcaster, opts) => {\n    const tx = await wallet.signTransaction(transaction);\n    if ((opts === null || opts === void 0 ? void 0 : opts.signers) && opts.signers.length > 0) {\n        tx.sign(...opts.signers);\n    }\n    return await broadcaster.broadcast(tx, opts);\n};\nexports.doSignAndBroadcastTransaction = doSignAndBroadcastTransaction;\n/**\n * Signs Solana transactions.\n */\nclass SolanaTransactionSigner {\n    constructor(wallet, broadcaster, preflightCommitment = \"confirmed\") {\n        this.wallet = wallet;\n        this.broadcaster = broadcaster;\n        this.preflightCommitment = preflightCommitment;\n    }\n    get publicKey() {\n        return this.wallet.publicKey;\n    }\n    async signAndBroadcastTransaction(transaction, opts) {\n        return await (0, exports.doSignAndBroadcastTransaction)(this.wallet, transaction, this.broadcaster, opts);\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provdier wallet that\n     *                will sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async sign(tx, signers = [], opts = {\n        preflightCommitment: this.preflightCommitment,\n    }) {\n        const { blockhash, lastValidBlockHeight } = await this.broadcaster.getLatestBlockhash(opts.preflightCommitment);\n        tx.feePayer = this.wallet.publicKey;\n        tx.lastValidBlockHeight = lastValidBlockHeight;\n        tx.recentBlockhash = blockhash;\n        await this.wallet.signTransaction(tx);\n        signers\n            .filter((s) => s !== undefined)\n            .forEach((kp) => {\n            tx.partialSign(kp);\n        });\n        return tx;\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     */\n    async signAll(reqs, opts = {\n        preflightCommitment: this.preflightCommitment,\n    }) {\n        const { blockhash, lastValidBlockHeight } = await this.broadcaster.getLatestBlockhash(opts.preflightCommitment);\n        const txs = reqs.map(({ tx, signers = [] }) => {\n            tx.feePayer = this.wallet.publicKey;\n            tx.lastValidBlockHeight = lastValidBlockHeight;\n            tx.recentBlockhash = blockhash;\n            signers\n                .filter((s) => s !== undefined)\n                .forEach((kp) => {\n                tx.partialSign(kp);\n            });\n            return tx;\n        });\n        const signedTxs = await this.wallet.signAllTransactions(txs);\n        return signedTxs;\n    }\n}\nexports.SolanaTransactionSigner = SolanaTransactionSigner;\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n *\n * This implementation was taken from Anchor.\n */\nclass SolanaProvider extends SolanaReadonlyProvider {\n    /**\n     * @param connection The cluster connection where the program is deployed.\n     * @param sendConnection The connection where transactions are sent to.\n     * @param wallet     The wallet used to pay for and sign all transactions.\n     * @param opts       Transaction confirmation options to use by default.\n     */\n    constructor(connection, broadcaster, wallet, opts = exports.DEFAULT_PROVIDER_OPTIONS, signer = new SolanaTransactionSigner(wallet, broadcaster, opts.preflightCommitment)) {\n        super(connection, opts);\n        this.connection = connection;\n        this.broadcaster = broadcaster;\n        this.wallet = wallet;\n        this.opts = opts;\n        this.signer = signer;\n    }\n    async signAndBroadcastTransaction(transaction, opts) {\n        return await this.signer.signAndBroadcastTransaction(transaction, opts);\n    }\n    /**\n     * Creates a new SolanaProvider.\n     * @deprecated use {@link SolanaProvider.init}\n     */\n    static load({ connection, sendConnection = connection, wallet, opts, }) {\n        return new SolanaProvider(connection, new index_js_1.SingleConnectionBroadcaster(sendConnection, opts), wallet, opts);\n    }\n    /**\n     * Initializes a new SolanaProvider.\n     */\n    static init({ connection, broadcastConnections = [connection], wallet, opts = exports.DEFAULT_PROVIDER_OPTIONS, }) {\n        const firstBroadcastConnection = broadcastConnections[0];\n        (0, tiny_invariant_1.default)(firstBroadcastConnection, \"must have at least one broadcast connection\");\n        return new SolanaProvider(connection, broadcastConnections.length > 1\n            ? new index_js_2.TieredBroadcaster(connection, broadcastConnections, opts)\n            : new index_js_1.SingleConnectionBroadcaster(firstBroadcastConnection, opts), wallet, opts);\n    }\n    /**\n     * Sends the given transaction, paid for and signed by the provider's wallet.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provider wallet that\n     *                will sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async send(tx, signers = [], opts = this.opts) {\n        const theTx = await this.signer.sign(tx, signers, opts);\n        const pending = await this.broadcaster.broadcast(theTx, opts);\n        await pending.wait();\n        return pending;\n    }\n    /**\n     * Similar to `send`, but for an array of transactions and signers.\n     */\n    async sendAll(reqs, opts = this.opts) {\n        const txs = await this.signer.signAll(reqs, opts);\n        return await Promise.all(txs.map(async (tx) => {\n            const pending = await this.broadcaster.broadcast(tx, opts);\n            await pending.wait();\n            return pending;\n        }));\n    }\n    /**\n     * Simulates the given transaction, returning emitted logs from execution.\n     *\n     * @param tx      The transaction to send.\n     * @param signers The set of signers in addition to the provider wallet that\n     *                will sign the transaction. If specified, the provider will\n     *                sign the transaction.\n     * @param opts    Transaction confirmation options.\n     */\n    async simulate(tx, signers, opts = this.opts) {\n        let simTX = tx;\n        if (signers !== undefined) {\n            simTX = await this.signer.sign(tx, signers, opts);\n        }\n        return await this.broadcaster.simulate(simTX, {\n            verifySigners: signers !== undefined,\n            commitment: opts.commitment,\n        });\n    }\n}\nexports.SolanaProvider = SolanaProvider;\n/**\n * Wrapper for a Provider containing utility functions.\n */\nclass SolanaAugmentedProvider {\n    constructor(provider) {\n        this.provider = provider;\n    }\n    get walletKey() {\n        return this.provider.wallet.publicKey;\n    }\n    get connection() {\n        return this.provider.connection;\n    }\n    get signer() {\n        return this.provider.signer;\n    }\n    get broadcaster() {\n        return this.provider.broadcaster;\n    }\n    get opts() {\n        return this.provider.opts;\n    }\n    get wallet() {\n        return this.provider.wallet;\n    }\n    signAndBroadcastTransaction(transaction, opts) {\n        return this.provider.signAndBroadcastTransaction(transaction, opts);\n    }\n    send(tx, signers, opts) {\n        return this.provider.send(tx, signers, opts);\n    }\n    sendAll(reqs, opts) {\n        return this.provider.sendAll(reqs, opts);\n    }\n    simulate(tx, signers, opts) {\n        return this.provider.simulate(tx, signers, opts);\n    }\n    getAccountInfo(accountId) {\n        return this.provider.getAccountInfo(accountId);\n    }\n    /**\n     * Creates a new transaction using this Provider.\n     * @param instructions\n     * @param signers\n     * @returns\n     */\n    newTX(instructions = [], signers = []) {\n        return TransactionEnvelope_js_1.TransactionEnvelope.create(this, instructions, signers);\n    }\n    /**\n     * Requests an airdrop of tokens.\n     * @param amount\n     * @returns\n     */\n    async requestAirdrop(lamports, to = this.wallet.publicKey) {\n        return new index_js_2.PendingTransaction(this.connection, await this.connection.requestAirdrop(to, lamports));\n    }\n    /**\n     * Returns this provider with a different signer.\n     * @param signer\n     * @returns\n     */\n    withSigner(signer) {\n        return new SolanaAugmentedProvider(new SolanaProvider(this.connection, this.broadcaster, new index_js_2.SignerWallet(signer), this.opts));\n    }\n}\nexports.SolanaAugmentedProvider = SolanaAugmentedProvider;\n//# sourceMappingURL=provider.js.map\n\n/***/ }),\n\n/***/ 5395:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.PendingTransaction = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst promise_retry_1 = tslib_1.__importDefault(__webpack_require__(5273));\nconst txLink_js_1 = __webpack_require__(3409);\nconst TransactionReceipt_js_1 = __webpack_require__(6920);\n/**\n * Transaction which may or may not be confirmed.\n */\nclass PendingTransaction {\n    constructor(connection, signature) {\n        this.connection = connection;\n        this.signature = signature;\n        this._receipt = null;\n    }\n    /**\n     * Gets the transaction receipt, if it has already been fetched.\n     *\n     * You probably want the async version of this function, `wait`.\n     */\n    get receipt() {\n        return this._receipt;\n    }\n    /**\n     * Waits for the confirmation of the transaction.\n     * @returns\n     */\n    async wait({ commitment = \"confirmed\", maxSupportedTransactionVersion = 0, useWebsocket = true, ...retryOpts } = {}) {\n        if (this._receipt) {\n            return this._receipt;\n        }\n        if (useWebsocket) {\n            await this.confirm({ commitment, ...retryOpts });\n            return await this.pollForReceipt({\n                commitment,\n                maxSupportedTransactionVersion,\n            });\n        }\n        return await this.pollForReceipt({\n            commitment,\n            maxSupportedTransactionVersion,\n            ...retryOpts,\n        });\n    }\n    /**\n     * Fetches the TransactionReceipt via polling.\n     * @returns\n     */\n    async pollForReceipt({ commitment = \"confirmed\", maxSupportedTransactionVersion = 0, ...retryOpts } = {}) {\n        const receipt = await (0, promise_retry_1.default)(async (retry) => {\n            const result = await this.connection.getTransaction(this.signature, {\n                commitment,\n                maxSupportedTransactionVersion,\n            });\n            if (!result) {\n                retry(new Error(\"Error fetching transaction\"));\n                return;\n            }\n            return new TransactionReceipt_js_1.TransactionReceipt(this.signature, result);\n        }, {\n            retries: 5,\n            minTimeout: 500,\n            ...retryOpts,\n        });\n        if (!receipt) {\n            throw new Error(\"transaction could not be confirmed\");\n        }\n        this._receipt = receipt;\n        return receipt;\n    }\n    /**\n     * Awaits the confirmation of the transaction, via onSignature subscription.\n     *\n     * @deprecated use {@link PendingTransaction#confirm}\n     * @returns\n     */\n    async awaitSignatureConfirmation(commitment = \"confirmed\") {\n        const { value } = await this.connection.confirmTransaction(this.signature, commitment);\n        if (value.err) {\n            throw value.err;\n        }\n        return this.signature;\n    }\n    /**\n     * Awaits the confirmation of the transaction, via onSignature subscription.\n     * @returns\n     */\n    async confirm({ commitment = \"confirmed\", blockhash, lastValidBlockHeight, }) {\n        let value;\n        if (blockhash && lastValidBlockHeight) {\n            value = (await this.connection.confirmTransaction({\n                signature: this.signature,\n                blockhash,\n                lastValidBlockHeight,\n            }, commitment)).value;\n        }\n        else {\n            value = (await this.connection.confirmTransaction(this.signature, commitment)).value;\n        }\n        if (value.err) {\n            throw new Error(`Transaction ${this.signature} failed (${JSON.stringify(value)})`);\n        }\n        return this.signature;\n    }\n    /**\n     * Generates a link to view this {@link PendingTransaction} on the official Solana explorer.\n     * @param network\n     * @returns\n     */\n    generateSolanaExplorerLink(cluster = \"mainnet-beta\") {\n        return (0, txLink_js_1.generateTXLink)(this.signature, cluster);\n    }\n}\nexports.PendingTransaction = PendingTransaction;\n//# sourceMappingURL=PendingTransaction.js.map\n\n/***/ }),\n\n/***/ 775:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TransactionEnvelope = exports.PACKET_DATA_SIZE = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst web3_js_1 = __webpack_require__(6737);\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst index_js_1 = __webpack_require__(3078);\nconst index_js_2 = __webpack_require__(2723);\nconst txSizer_js_1 = __webpack_require__(8129);\nconst utils_js_1 = __webpack_require__(2707);\nexports.PACKET_DATA_SIZE = 1280 - 40 - 8;\nconst ASSOCIATED_TOKEN_PROGRAM_ID = new web3_js_1.PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\n/**\n * Filters the required signers for a list of instructions.\n * @param ixs\n * @returns\n */\nconst filterRequiredSigners = (ixs, signers) => {\n    // filter out the signers required for the transaction\n    const requiredSigners = ixs.flatMap((ix) => ix.keys.filter((k) => k.isSigner).map((k) => k.pubkey));\n    return signers.filter((s) => requiredSigners.find((rs) => rs.equals(s.publicKey)));\n};\n/**\n * Contains a Transaction that is being built.\n */\nclass TransactionEnvelope {\n    constructor(\n    /**\n     * Provider that will be sending the transaction as the fee payer.\n     */\n    provider, \n    /**\n     * Instructions associated with the transaction.\n     */\n    instructions, \n    /**\n     * Optional signers of the transaction.\n     */\n    signers = []) {\n        this.provider = provider;\n        this.instructions = instructions;\n        this.signers = signers;\n    }\n    /**\n     * Prepends the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to prepend.\n     * @returns\n     */\n    prepend(...instructions) {\n        this.instructions.unshift(...instructions.filter((ix) => !!ix));\n        return this;\n    }\n    /**\n     * Appends the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to append.\n     * @returns\n     */\n    append(...instructions) {\n        this.instructions.push(...instructions.filter((ix) => !!ix));\n        return this;\n    }\n    /**\n     * A the given {@link TransactionInstruction}s to the {@link TransactionEnvelope}.\n     * @param instructions The instructions to add.\n     * @deprecated Use {@link #append} instead.\n     * @returns\n     */\n    addInstructions(...instructions) {\n        return this.append(...instructions);\n    }\n    /**\n     * Adds the given {@link Signer}s to the {@link TransactionEnvelope}.\n     * @param signers The signers to add.\n     * @returns\n     */\n    addSigners(...signers) {\n        this.signers.push(...signers);\n        return this;\n    }\n    /**\n     * Builds a transaction from this envelope.\n     * @param feePayer Optional override for the fee payer.\n     */\n    build(feePayer = this.provider.wallet.publicKey) {\n        const tx = new web3_js_1.Transaction().add(...this.instructions);\n        tx.feePayer = feePayer;\n        return tx;\n    }\n    /**\n     * Builds a transaction and estimates the size in bytes.\n     * Does not check to see if the transaction is too big.\n     *\n     * @returns Byte count\n     */\n    estimateSizeUnsafe() {\n        const builtTx = this.build();\n        // dummy blockhash that is required for building the transaction\n        builtTx.recentBlockhash = \"MaryHadALittLeLambZNdhAUTrsLE1ydg6rmtvFEpKT\";\n        return (0, txSizer_js_1.calculateTxSizeUnsafe)(builtTx);\n    }\n    /**\n     * Builds a transaction and estimates the size in bytes. This number is primrily\n     * to be used for checking to see if a transaction is too big and instructions\n     * need to be split. It may not be 100% accurate.\n     *\n     * This is used in expectTXTable and is useful for increasing efficiency in\n     * dapps that build large transactions.\n     *\n     * The max transaction size of a v1 Transaction in Solana is 1232 bytes.\n     * For info about Transaction v2: https://docs.solana.com/proposals/transactions-v2\n     */\n    estimateSize() {\n        return (0, index_js_2.suppressConsoleError)(() => {\n            try {\n                const builtTx = this.build();\n                // dummy blockhash that is required for building the transaction\n                builtTx.recentBlockhash = \"MaryHadALittLeLambZNdhAUTrsLE1ydg6rmtvFEpKT\";\n                const size = (0, txSizer_js_1.calculateTxSizeUnsafe)(builtTx);\n                if (size > exports.PACKET_DATA_SIZE) {\n                    return { error: new index_js_2.EstimatedTXTooBigError(builtTx, size) };\n                }\n                return { size };\n            }\n            catch (e) {\n                return { error: new index_js_2.TXSizeEstimationError(e) };\n            }\n        });\n    }\n    /**\n     * Partition a large {@link TransactionEnvelope} into smaller, valid {@link Transaction}s.\n     * This relies on this envelope already having the correct number of signers.\n     *\n     * @param feePayer Optional fee payer override.\n     * @returns A list of {@link Transaction}s.\n     */\n    buildPartition(feePayer = this.provider.wallet.publicKey) {\n        const partition = this.partition();\n        return partition.map((env) => env.build(feePayer));\n    }\n    /**\n     * Partition a large {@link TransactionEnvelope} into smaller, valid transaction envelopes which can be built.\n     * This relies on this envelope already having the correct number of signers.\n     *\n     * @returns\n     */\n    partition() {\n        const estimation = this.estimateSize();\n        if (\"size\" in estimation) {\n            return [this];\n        }\n        // empty partition should have no envelopes\n        if (this.instructions.length === 0) {\n            return [];\n        }\n        let lastTXEnv = new TransactionEnvelope(this.provider, this.instructions.slice(0, 1), this._filterRequiredSigners(this.instructions.slice(0, 1)));\n        let lastEstimation = lastTXEnv.estimateSizeUnsafe();\n        const txs = [];\n        this.instructions.slice(1).forEach((ix, i) => {\n            if (lastEstimation > exports.PACKET_DATA_SIZE) {\n                throw new Error(`cannot construct a valid partition: instruction ${i} is too large (${lastEstimation} > ${exports.PACKET_DATA_SIZE})`);\n            }\n            const nextIXs = [...lastTXEnv.instructions, ix];\n            const nextSigners = this._filterRequiredSigners(nextIXs);\n            const nextTXEnv = new TransactionEnvelope(this.provider, nextIXs, nextSigners);\n            const nextEstimation = nextTXEnv.estimateSizeUnsafe();\n            // move to next tx envelope if too big\n            if (nextEstimation > exports.PACKET_DATA_SIZE) {\n                txs.push(lastTXEnv);\n                const nextIXs = [ix];\n                lastTXEnv = new TransactionEnvelope(this.provider, nextIXs, this._filterRequiredSigners(nextIXs));\n                lastEstimation = lastTXEnv.estimateSizeUnsafe();\n            }\n            else {\n                lastTXEnv = nextTXEnv;\n                lastEstimation = nextEstimation;\n            }\n        });\n        txs.push(lastTXEnv);\n        return txs;\n    }\n    /**\n     * Filters the required signers for a list of instructions.\n     * @param ixs\n     * @returns\n     */\n    _filterRequiredSigners(ixs) {\n        return filterRequiredSigners(ixs, this.signers);\n    }\n    /**\n     * Generates a link for inspecting the contents of this {@link TransactionEnvelope}.\n     *\n     * @returns URL\n     */\n    generateInspectLink(cluster = \"mainnet-beta\") {\n        const t = this.build();\n        t.recentBlockhash = utils_js_1.RECENT_BLOCKHASH_STUB;\n        const str = t.serializeMessage().toString(\"base64\");\n        return (0, utils_js_1.generateInspectLinkFromBase64)(cluster, str);\n    }\n    /**\n     * Simulates the transaction.\n     * @param opts\n     * @returns\n     */\n    simulate(opts = {\n        verifySigners: true,\n    }) {\n        return this.provider.simulate(this.build(), opts.verifySigners ? this.signers : undefined, opts);\n    }\n    /**\n     * Simulates the transaction, without validating signers.\n     *\n     * @deprecated Use {@link TXEnvelope#simulate} instead.\n     * @param opts\n     * @returns\n     */\n    simulateUnchecked(opts) {\n        return this.simulate({ ...opts, verifySigners: false });\n    }\n    /**\n     * Simulates the transaction and prints a fancy table in the console.\n     * ```\n     *    ┌─────┬───┬───┬───┬───────────┬──────┬─────┬──────┬───┐\n     *    │index│iso│mar│cum│ programId │quota │used │ left │CPI│\n     *    ├─────┼───┼───┼───┼───────────┼──────┼─────┼──────┼───┤\n     *    │  0  │298│281│464│'ATokenG..'│200000│24270│175730│ 1 │\n     *    │  1  │298│ 74│538│'ATokenG..'│178730│21270│157460│ 1 │\n     *    │  2  │298│ 74│612│'ATokenG..'│157460│27277│130183│ 1 │\n     *    │  3  │298│ 42│686│'ATokenG..'│130183│21270│108913│ 1 │\n     *    │  4  │338│265│951│'qExampL..'│108913│76289│ 32624│ 3 │\n     *    └─────┴───┴───┴───┴───────────┴──────┴─────┴──────┴───┘\n     * ```\n     *\n     * - **index**: the array index of the instruction within the transaction\n     * - **iso**: the isolated size of the instruction (marginal cost of only the instruction)\n     * - **mar**: the marginal size cost of the instruction (when added to previous)\n     * - **cum**: the cumulative size of the instructions up until that instruction\n     * - **quota/used/left**: [BPF instruction compute unit info](https://docs.solana.com/developing/programming-model/runtime)\n     * - **CPI**: [the maximum depth of CPI](https://docs.solana.com/developing/programming-model/calling-between-programs) (current limit in Solana is 4)\n     *\n     * @param opts\n     * @returns\n     */\n    simulateTable(opts) {\n        return this.simulate(opts).then((simulation) => {\n            var _a;\n            if ((_a = simulation === null || simulation === void 0 ? void 0 : simulation.value) === null || _a === void 0 ? void 0 : _a.logs) {\n                (0, index_js_2.printTXTable)(this, simulation.value.logs, \"\");\n            }\n            return simulation;\n        });\n    }\n    /**\n     * Sends the transaction without confirming it.\n     * @param opts\n     * @returns\n     */\n    async send(opts) {\n        const signed = await this.provider.signer.sign(this.build(), this.signers, opts);\n        return this.provider.broadcaster.broadcast(signed, opts);\n    }\n    /**\n     * Sends the transaction and waits for confirmation.\n     * @param opts\n     */\n    async confirm(opts) {\n        return (await this.send(opts)).wait();\n    }\n    /**\n     * Combines the instructions/signers of the other envelope to create one large transaction.\n     */\n    combine(other) {\n        return new TransactionEnvelope(this.provider, [...this.instructions, ...other.instructions], [...this.signers, ...other.signers]);\n    }\n    /**\n     * Get a list of all writable accounts, deduped\n     * All of these accounts likely need to be updated after the transaction is confirmed.\n     */\n    get writableKeys() {\n        return [\n            ...new Set([\n                ...this.instructions\n                    .map((inst) => inst.keys.filter((key) => key.isWritable).map((k) => k.pubkey))\n                    .reduce((acc, el) => acc.concat(el)),\n            ]).values(),\n        ];\n    }\n    /**\n     * Gets the instructions in a format that can be serialized easily to JSON.\n     */\n    get instructionsJSON() {\n        return this.instructions.map((instruction) => ({\n            programId: instruction.programId.toString(),\n            keys: instruction.keys.map((m) => ({\n                isSigner: m.isSigner,\n                isWritable: m.isWritable,\n                publicKey: m.pubkey.toString(),\n            })),\n            data: instruction.data.toString(\"base64\"),\n        }));\n    }\n    /**\n     * Returns a string representation of the {@link TransactionEnvelope}.\n     */\n    get debugStr() {\n        return [\n            \"=> Instructions\",\n            this.instructions\n                .map((ser, i) => {\n                return [\n                    `Instruction ${i}: ${ser.programId.toString()}`,\n                    ...ser.keys.map((k, i) => `  [${i}] ${k.pubkey.toString()} ${k.isWritable ? \"(mut)\" : \"\"} ${k.isSigner ? \"(signer)\" : \"\"}`),\n                    `  Data (base64): ${ser.data.toString(\"base64\")}`,\n                ].join(\"\\n\");\n            })\n                .join(\"\\n\"),\n            \"=> Signers\",\n            this.signers.map((sg) => sg.publicKey.toString()).join(\"\\n\"),\n        ].join(\"\\n\");\n    }\n    /**\n     * Creates a new {@link TransactionEnvelope}.\n     * @param provider\n     * @param instructions\n     * @param signers\n     * @returns\n     */\n    static create(provider, instructions, signers = []) {\n        const ixs = instructions.filter((ix) => !!ix);\n        return new TransactionEnvelope(provider, ixs, signers);\n    }\n    /**\n     * Add a memo to each transaction envelope specified.\n     */\n    static addMemos(memo, ...txs) {\n        return txs.map((tx) => tx.addMemo(memo));\n    }\n    /**\n     * Combines multiple TransactionEnvelopes into one.\n     */\n    static combineAll(...txs) {\n        return txs.reduce((acc, tx) => acc.combine(tx));\n    }\n    /**\n     * Takes a list of {@link TransactionEnvelope}s and combines them if they\n     * are able to be combined under the maximum TX size limit.\n     *\n     * @param txs\n     * @returns\n     */\n    static pack(...txs) {\n        if (txs.length === 0) {\n            return [];\n        }\n        const [first, ...rest] = txs;\n        (0, tiny_invariant_1.default)(first);\n        const { provider } = first;\n        let lastTXEnv = first;\n        let lastEstimation = lastTXEnv.estimateSizeUnsafe();\n        const partition = [];\n        rest.forEach((addedTX, i) => {\n            if (lastEstimation > exports.PACKET_DATA_SIZE) {\n                throw new Error(`cannot construct a valid partition: instruction ${i} is too large (${lastEstimation} > ${exports.PACKET_DATA_SIZE})`);\n            }\n            const nextIXs = [...lastTXEnv.instructions, ...addedTX.instructions];\n            const nextSigners = filterRequiredSigners(nextIXs, [\n                ...lastTXEnv.signers,\n                ...addedTX.signers,\n            ]);\n            const nextTXEnv = new TransactionEnvelope(provider, nextIXs, nextSigners);\n            const nextEstimation = nextTXEnv.estimateSizeUnsafe();\n            // move to next tx envelope if too big\n            if (nextEstimation > exports.PACKET_DATA_SIZE) {\n                partition.push(lastTXEnv);\n                lastTXEnv = addedTX;\n                lastEstimation = lastTXEnv.estimateSizeUnsafe();\n            }\n            else {\n                lastTXEnv = nextTXEnv;\n                lastEstimation = nextEstimation;\n            }\n        });\n        partition.push(lastTXEnv);\n        return partition;\n    }\n    /**\n     * Combines multiple async TransactionEnvelopes into one, serially.\n     */\n    static async combineAllAsync(firstTX, ...txs) {\n        let acc = await firstTX;\n        for (const tx of txs) {\n            acc = acc.combine(await tx);\n        }\n        return acc;\n    }\n    /**\n     * Sends all of the envelopes.\n     * @returns Pending transactions\n     */\n    static async sendAll(txs, opts) {\n        const firstTX = txs[0];\n        if (!firstTX) {\n            return [];\n        }\n        const provider = firstTX.provider;\n        return await provider.sendAll(txs.map((tx) => ({ tx: tx.build(), signers: tx.signers })), opts);\n    }\n    /**\n     * Deduplicate ATA instructions inside the transaction envelope.\n     */\n    dedupeATAIXs() {\n        if (this.instructions.length === 0) {\n            return this;\n        }\n        const seenATAs = new Set();\n        const instructions = this.instructions\n            .map((ix) => {\n            var _a;\n            const programId = ix.programId;\n            if (programId.equals(ASSOCIATED_TOKEN_PROGRAM_ID)) {\n                const ataKey = (_a = ix.keys[1]) === null || _a === void 0 ? void 0 : _a.pubkey.toString();\n                if (!ataKey) {\n                    throw new Error(\"ATA key does not exist on ATA instruction\");\n                }\n                if (seenATAs.has(ataKey)) {\n                    return null;\n                }\n                seenATAs.add(ataKey);\n            }\n            return ix;\n        })\n            .filter((ix) => !!ix);\n        return new TransactionEnvelope(this.provider, instructions, this.signers);\n    }\n    /**\n     * Split out ATA instructions to a separate transaction envelope.\n     */\n    splitATAIXs() {\n        const ataIXs = new TransactionEnvelope(this.provider, [], this.signers);\n        const newTx = new TransactionEnvelope(this.provider, [], this.signers);\n        for (const ix of this.instructions) {\n            if (ix.programId.equals(ASSOCIATED_TOKEN_PROGRAM_ID)) {\n                ataIXs.instructions.push(ix);\n            }\n            else {\n                newTx.instructions.push(ix);\n            }\n        }\n        return {\n            ataIXs: ataIXs.dedupeATAIXs(),\n            tx: newTx,\n        };\n    }\n    /**\n     * Get an instruction from the transaction envelope by index.\n     */\n    getInstruction(index) {\n        const ix = this.instructions[index];\n        if (!ix) {\n            throw new Error(`No instruction found at index ${index}`);\n        }\n        return ix;\n    }\n    /**\n     * Attach a memo instruction to this transaction.\n     */\n    addMemo(memo) {\n        this.instructions.push((0, index_js_2.createMemoInstruction)(memo));\n        return this;\n    }\n    /**\n     * Request for additional compute units before processing this transaction.\n     */\n    addAdditionalComputeBudget(units, additionalFee) {\n        this.instructions.unshift((0, index_js_1.requestComputeUnitsInstruction)(units, additionalFee));\n        return this;\n    }\n    /**\n     * Request a specific transaction-wide program heap region size in bytes.\n     */\n    addAdditionalHeapFrame(bytes) {\n        this.instructions.unshift((0, index_js_1.requestHeapFrameInstruction)(bytes));\n        return this;\n    }\n}\nexports.TransactionEnvelope = TransactionEnvelope;\n//# sourceMappingURL=TransactionEnvelope.js.map\n\n/***/ }),\n\n/***/ 6920:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TransactionReceipt = exports.confirmTransactionLike = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst misc_js_1 = __webpack_require__(2837);\nconst txLink_js_1 = __webpack_require__(3409);\nconst PendingTransaction_js_1 = __webpack_require__(5395);\n/**\n * Confirms a transaction, returning its receipt.\n *\n * @param tx\n * @returns\n */\nconst confirmTransactionLike = async (tx) => {\n    const ish = await (0, misc_js_1.valueAsPromise)(tx);\n    if (ish instanceof TransactionReceipt) {\n        return ish;\n    }\n    let pending;\n    if (ish instanceof PendingTransaction_js_1.PendingTransaction) {\n        pending = ish;\n    }\n    else {\n        pending = await ish.send({\n            printLogs: false,\n        });\n    }\n    return await pending.wait();\n};\nexports.confirmTransactionLike = confirmTransactionLike;\n/**\n * A transaction that has been processed by the cluster.\n */\nclass TransactionReceipt {\n    constructor(\n    /**\n     * Signature (id) of the transaction.\n     */\n    signature, \n    /**\n     * Raw response from web3.js\n     */\n    response) {\n        this.signature = signature;\n        this.response = response;\n    }\n    /**\n     * Gets the events associated with this transaction.\n     */\n    getEvents(eventParser) {\n        var _a;\n        const logs = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages;\n        if (logs && logs.length > 0) {\n            return eventParser(logs);\n        }\n        return [];\n    }\n    /**\n     * Prints the logs associated with this transaction.\n     */\n    printLogs() {\n        var _a, _b;\n        console.log((_b = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages) === null || _b === void 0 ? void 0 : _b.join(\"\\n\"));\n    }\n    /**\n     * Gets the compute units used by the transaction.\n     * @returns\n     */\n    get computeUnits() {\n        var _a;\n        const logs = (_a = this.response.meta) === null || _a === void 0 ? void 0 : _a.logMessages;\n        (0, tiny_invariant_1.default)(logs, \"no logs\");\n        const consumeLog = logs[logs.length - 2];\n        (0, tiny_invariant_1.default)(consumeLog, \"no consume log\");\n        const amtStr = consumeLog.split(\" \")[3];\n        (0, tiny_invariant_1.default)(amtStr, \"no amount\");\n        return parseInt(amtStr);\n    }\n    /**\n     * Generates a link to view this {@link TransactionReceipt} on the official Solana explorer.\n     * @param network\n     * @returns\n     */\n    generateSolanaExplorerLink(cluster = \"mainnet-beta\") {\n        return (0, txLink_js_1.generateTXLink)(this.signature, cluster);\n    }\n}\nexports.TransactionReceipt = TransactionReceipt;\n//# sourceMappingURL=TransactionReceipt.js.map\n\n/***/ }),\n\n/***/ 2175:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(686), exports);\ntslib_1.__exportStar(__webpack_require__(5395), exports);\ntslib_1.__exportStar(__webpack_require__(7422), exports);\ntslib_1.__exportStar(__webpack_require__(775), exports);\ntslib_1.__exportStar(__webpack_require__(6920), exports);\ntslib_1.__exportStar(__webpack_require__(2707), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 686:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Adapted from explorer.solana.com code written by @jstarry.\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.formatInstructionLogs = exports.formatLogEntry = exports.parseTransactionLogs = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst programErr_js_1 = __webpack_require__(7422);\n/**\n * Stack-aware program log parser.\n * @param logs\n * @param error\n * @returns\n */\nconst parseTransactionLogs = (logs, error) => {\n    let depth = 0;\n    const prettyLogs = [];\n    let prettyError;\n    if (!logs) {\n        if (error)\n            throw new Error(JSON.stringify(error));\n        throw new Error(\"No logs detected\");\n    }\n    else if (error) {\n        prettyError = (0, programErr_js_1.getTransactionInstructionError)(error);\n    }\n    logs.forEach((log) => {\n        var _a, _b, _c, _d, _e;\n        if (log.startsWith(\"Program log:\")) {\n            (_a = prettyLogs[prettyLogs.length - 1]) === null || _a === void 0 ? void 0 : _a.logs.push({\n                type: \"text\",\n                depth,\n                text: log,\n            });\n        }\n        else {\n            const regex = /Program (\\w*) invoke \\[(\\d)\\]/g;\n            const matches = [...log.matchAll(regex)];\n            if (matches.length > 0) {\n                const programAddress = (_b = matches[0]) === null || _b === void 0 ? void 0 : _b[1];\n                (0, tiny_invariant_1.default)(programAddress, \"program address\");\n                if (depth === 0) {\n                    prettyLogs.push({\n                        programAddress,\n                        logs: [],\n                        failed: false,\n                    });\n                }\n                else {\n                    (_c = prettyLogs[prettyLogs.length - 1]) === null || _c === void 0 ? void 0 : _c.logs.push({\n                        type: \"cpi\",\n                        depth,\n                        programAddress: programAddress !== null && programAddress !== void 0 ? programAddress : null,\n                    });\n                }\n                depth++;\n            }\n            else if (log.includes(\"success\")) {\n                (_d = prettyLogs[prettyLogs.length - 1]) === null || _d === void 0 ? void 0 : _d.logs.push({\n                    type: \"success\",\n                    depth,\n                });\n                depth--;\n            }\n            else if (log.includes(\"failed\")) {\n                const instructionLog = prettyLogs[prettyLogs.length - 1];\n                if (instructionLog && !instructionLog.failed) {\n                    instructionLog.failed = true;\n                    instructionLog.logs.push({\n                        type: \"programError\",\n                        depth,\n                        text: log.slice(log.indexOf(\": \") + 2),\n                    });\n                }\n                depth--;\n            }\n            else {\n                if (depth === 0) {\n                    prettyLogs.push({\n                        logs: [],\n                        failed: false,\n                    });\n                    depth++;\n                }\n                // system transactions don't start with \"Program log:\"\n                (_e = prettyLogs[prettyLogs.length - 1]) === null || _e === void 0 ? void 0 : _e.logs.push({\n                    type: \"system\",\n                    depth,\n                    text: log,\n                });\n            }\n        }\n    });\n    // If the instruction's simulation returned an error without any logs then add an empty log entry for Runtime error\n    // For example BpfUpgradableLoader fails without returning any logs for Upgrade instruction with buffer that doesn't exist\n    if (prettyError && prettyLogs.length === 0) {\n        prettyLogs.push({\n            logs: [],\n            failed: true,\n        });\n    }\n    if (prettyError && prettyError.index === prettyLogs.length - 1) {\n        const failedIx = prettyLogs[prettyError.index];\n        if (failedIx) {\n            failedIx.failed = true;\n            failedIx.logs.push({\n                type: \"runtimeError\",\n                depth: 1,\n                text: prettyError.message,\n            });\n        }\n    }\n    return prettyLogs;\n};\nexports.parseTransactionLogs = parseTransactionLogs;\nconst buildPrefix = (depth) => {\n    const prefix = new Array(depth - 1).fill(\"\\u00A0\\u00A0\").join(\"\");\n    return prefix + \"> \";\n};\nconst formatLogEntryString = (entry) => {\n    switch (entry.type) {\n        case \"success\":\n            return `Program returned success`;\n        case \"programError\":\n            return `Program returned error: ${entry.text}`;\n        case \"runtimeError\":\n            return `Runtime error: ${entry.text}`;\n        case \"system\":\n            return entry.text;\n        case \"text\":\n            return entry.text;\n        case \"cpi\":\n            return `Invoking Unknown ${entry.programAddress ? `(${entry.programAddress}) ` : \"\"}Program`;\n    }\n};\n/**\n * Formats a log entry to be printed out.\n * @param entry\n * @param prefix\n * @returns\n */\nconst formatLogEntry = (entry, prefix = false) => {\n    const prefixString = prefix ? buildPrefix(entry.depth) : \"\";\n    return `${prefixString}${formatLogEntryString(entry)}`;\n};\nexports.formatLogEntry = formatLogEntry;\n/**\n * Formats instruction logs.\n * @param logs\n */\nconst formatInstructionLogs = (logs) => logs\n    .map((log, i) => {\n    return [\n        `=> Instruction #${i}: ${log.programAddress ? `Program ${log.programAddress}` : \"System\"}`,\n        ...log.logs.map((entry) => (0, exports.formatLogEntry)(entry, true)),\n    ].join(\"\\n\");\n})\n    .join(\"\\n\");\nexports.formatInstructionLogs = formatInstructionLogs;\n//# sourceMappingURL=parseTransactionLogs.js.map\n\n/***/ }),\n\n/***/ 7422:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\n/**\n * Borrowed from explorer.solana.com code written by @jstarry.\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getTransactionInstructionError = exports.BUILTIN_SOLANA_ERROR_MESSAGES = void 0;\n/**\n * Solana error messages built-in.\n */\nexports.BUILTIN_SOLANA_ERROR_MESSAGES = new Map([\n    [\"GenericError\", \"generic instruction error\"],\n    [\"InvalidArgument\", \"invalid program argument\"],\n    [\"InvalidInstructionData\", \"invalid instruction data\"],\n    [\"InvalidAccountData\", \"invalid account data for instruction\"],\n    [\"AccountDataTooSmall\", \"account data too small for instruction\"],\n    [\"InsufficientFunds\", \"insufficient funds for instruction\"],\n    [\"IncorrectProgramId\", \"incorrect program id for instruction\"],\n    [\"MissingRequiredSignature\", \"missing required signature for instruction\"],\n    [\n        \"AccountAlreadyInitialized\",\n        \"instruction requires an uninitialized account\",\n    ],\n    [\"UninitializedAccount\", \"instruction requires an initialized account\"],\n    [\n        \"UnbalancedInstruction\",\n        \"sum of account balances before and after instruction do not match\",\n    ],\n    [\"ModifiedProgramId\", \"instruction modified the program id of an account\"],\n    [\n        \"ExternalAccountLamportSpend\",\n        \"instruction spent from the balance of an account it does not own\",\n    ],\n    [\n        \"ExternalAccountDataModified\",\n        \"instruction modified data of an account it does not own\",\n    ],\n    [\n        \"ReadonlyLamportChange\",\n        \"instruction changed the balance of a read-only account\",\n    ],\n    [\"ReadonlyDataModified\", \"instruction modified data of a read-only account\"],\n    [\"DuplicateAccountIndex\", \"instruction contains duplicate accounts\"],\n    [\"ExecutableModified\", \"instruction changed executable bit of an account\"],\n    [\"RentEpochModified\", \"instruction modified rent epoch of an account\"],\n    [\"NotEnoughAccountKeys\", \"insufficient account keys for instruction\"],\n    [\"AccountDataSizeChanged\", \"non-system instruction changed account size\"],\n    [\"AccountNotExecutable\", \"instruction expected an executable account\"],\n    [\n        \"AccountBorrowFailed\",\n        \"instruction tries to borrow reference for an account which is already borrowed\",\n    ],\n    [\n        \"AccountBorrowOutstanding\",\n        \"instruction left account with an outstanding borrowed reference\",\n    ],\n    [\n        \"DuplicateAccountOutOfSync\",\n        \"instruction modifications of multiply-passed account differ\",\n    ],\n    [\"Custom\", \"custom program error: {0}\"],\n    [\"InvalidError\", \"program returned invalid error code\"],\n    [\"ExecutableDataModified\", \"instruction changed executable accounts data\"],\n    [\n        \"ExecutableLamportChange\",\n        \"instruction changed the balance of a executable account\",\n    ],\n    [\"ExecutableAccountNotRentExempt\", \"executable accounts must be rent exempt\"],\n    [\"UnsupportedProgramId\", \"Unsupported program id\"],\n    [\"CallDepth\", \"Cross-program invocation call depth too deep\"],\n    [\"MissingAccount\", \"An account required by the instruction is missing\"],\n    [\n        \"ReentrancyNotAllowed\",\n        \"Cross-program invocation reentrancy not allowed for this instruction\",\n    ],\n    [\n        \"MaxSeedLengthExceeded\",\n        \"Length of the seed is too long for address generation\",\n    ],\n    [\"InvalidSeeds\", \"Provided seeds do not result in a valid address\"],\n    [\"InvalidRealloc\", \"Failed to reallocate account data\"],\n    [\"ComputationalBudgetExceeded\", \"Computational budget exceeded\"],\n    [\n        \"PrivilegeEscalation\",\n        \"Cross-program invocation with unauthorized signer or writable account\",\n    ],\n    [\n        \"ProgramEnvironmentSetupFailure\",\n        \"Failed to create program execution environment\",\n    ],\n    [\"ProgramFailedToComplete\", \"Program failed to complete\"],\n    [\"ProgramFailedToCompile\", \"Program failed to compile\"],\n    [\"Immutable\", \"Account is immutable\"],\n    [\"IncorrectAuthority\", \"Incorrect authority provided\"],\n    [\"BorshIoError\", \"Failed to serialize or deserialize account data: {0}\"],\n    [\n        \"AccountNotRentExempt\",\n        \"An account does not have enough lamports to be rent-exempt\",\n    ],\n    [\"InvalidAccountOwner\", \"Invalid account owner\"],\n    [\"ArithmeticOverflow\", \"Program arithmetic overflowed\"],\n    [\"UnsupportedSysvar\", \"Unsupported sysvar\"],\n    [\"IllegalOwner\", \"Provided owner is not allowed\"],\n]);\nfunction getTransactionInstructionError(error) {\n    if (!error) {\n        return;\n    }\n    if (typeof error === \"object\" && \"InstructionError\" in error) {\n        const innerError = error[\"InstructionError\"];\n        const index = innerError[0];\n        const instructionError = innerError[1];\n        return {\n            index,\n            message: getInstructionError(instructionError),\n        };\n    }\n}\nexports.getTransactionInstructionError = getTransactionInstructionError;\nfunction getInstructionError(error) {\n    let out;\n    let value = null;\n    if (typeof error === \"string\") {\n        const message = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(error);\n        if (message) {\n            return message;\n        }\n    }\n    else if (\"Custom\" in error) {\n        out = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(\"Custom\");\n        value = error[\"Custom\"];\n    }\n    else if (\"BorshIoError\" in error) {\n        out = exports.BUILTIN_SOLANA_ERROR_MESSAGES.get(\"BorshIoError\");\n        value = error[\"BorshIoError\"];\n    }\n    if (out && value) {\n        return out.replace(\"{0}\", value);\n    }\n    return \"Unknown instruction error\";\n}\n//# sourceMappingURL=programErr.js.map\n\n/***/ }),\n\n/***/ 8129:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.calculateTxSizeUnsafe = void 0;\nfunction shortvecEncodeLength(bytes, len) {\n    let rem_len = len;\n    for (;;) {\n        let elem = rem_len & 0x7f;\n        rem_len >>= 7;\n        if (rem_len === 0) {\n            bytes.push(elem);\n            break;\n        }\n        else {\n            elem |= 0x80;\n            bytes.push(elem);\n        }\n    }\n}\n/**\n * Calculates transaction size. If the transaction is too large, it does not throw.\n * @param tx\n * @returns\n */\nconst calculateTxSizeUnsafe = (tx) => {\n    // check if fee payer signed.\n    const { feePayer } = tx;\n    const hasFeePayerSigned = feePayer && tx.signatures.find((s) => s.publicKey.equals(feePayer));\n    const signData = tx.serializeMessage();\n    const numSigners = tx.signatures.length + (hasFeePayerSigned ? 1 : 0);\n    const signatureCount = [];\n    shortvecEncodeLength(signatureCount, numSigners);\n    return signatureCount.length + numSigners * 64 + signData.length;\n};\nexports.calculateTxSizeUnsafe = calculateTxSizeUnsafe;\n//# sourceMappingURL=txSizer.js.map\n\n/***/ }),\n\n/***/ 2707:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.generateUncheckedInspectLink = exports.generateInspectLinkFromBase64 = exports.serializeToBase64Unchecked = exports.buildStubbedTransaction = exports.RECENT_BLOCKHASH_STUB = void 0;\nconst web3_js_1 = __webpack_require__(6737);\n/**\n * Stub of a recent blockhash that can be used to simulate transactions.\n */\nexports.RECENT_BLOCKHASH_STUB = \"GfVcyD4kkTrj4bKc7WA9sZCin9JDbdT4Zkd3EittNR1W\";\n/**\n * Builds a transaction with a fake `recentBlockhash` and `feePayer` for the purpose\n * of simulating a sequence of instructions.\n *\n * @param cluster\n * @param ixs\n * @returns\n */\nconst buildStubbedTransaction = (cluster, ixs) => {\n    const tx = new web3_js_1.Transaction();\n    tx.recentBlockhash = exports.RECENT_BLOCKHASH_STUB;\n    // random keys that always have money in them\n    tx.feePayer =\n        cluster === \"devnet\"\n            ? new web3_js_1.PublicKey(\"A2jaCHPzD6346348JoEym2KFGX9A7uRBw6AhCdX7gTWP\")\n            : new web3_js_1.PublicKey(\"9u9iZBWqGsp5hXBxkVZtBTuLSGNAG9gEQLgpuVw39ASg\");\n    tx.instructions = ixs;\n    return tx;\n};\nexports.buildStubbedTransaction = buildStubbedTransaction;\n/**\n * Serializes a {@link Transaction} to base64 format without checking signatures.\n * @param tx\n * @returns\n */\nconst serializeToBase64Unchecked = (tx) => tx\n    .serialize({\n    requireAllSignatures: false,\n    verifySignatures: false,\n})\n    .toString(\"base64\");\nexports.serializeToBase64Unchecked = serializeToBase64Unchecked;\n/**\n * Generates a link for inspecting the contents of a transaction.\n *\n * @returns URL\n */\nconst generateInspectLinkFromBase64 = (cluster, base64TX) => {\n    return `https://${cluster === \"mainnet-beta\" ? \"\" : `${cluster}.`}anchor.so/tx/inspector?message=${encodeURIComponent(base64TX)}`;\n};\nexports.generateInspectLinkFromBase64 = generateInspectLinkFromBase64;\n/**\n * Generates a link for inspecting the contents of a transaction, not checking for\n * or requiring valid signatures.\n *\n * @returns URL\n */\nconst generateUncheckedInspectLink = (cluster, tx) => {\n    return (0, exports.generateInspectLinkFromBase64)(cluster, (0, exports.serializeToBase64Unchecked)(tx));\n};\nexports.generateUncheckedInspectLink = generateUncheckedInspectLink;\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 2723:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(2330), exports);\ntslib_1.__exportStar(__webpack_require__(2837), exports);\ntslib_1.__exportStar(__webpack_require__(7502), exports);\ntslib_1.__exportStar(__webpack_require__(3358), exports);\ntslib_1.__exportStar(__webpack_require__(5963), exports);\ntslib_1.__exportStar(__webpack_require__(5112), exports);\ntslib_1.__exportStar(__webpack_require__(2377), exports);\ntslib_1.__exportStar(__webpack_require__(6348), exports);\ntslib_1.__exportStar(__webpack_require__(3409), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 2330:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.createMemoInstruction = exports.MEMO_PROGRAM_ID = void 0;\nconst web3_js_1 = __webpack_require__(6737);\n/**\n * ID of the memo program.\n */\nexports.MEMO_PROGRAM_ID = new web3_js_1.PublicKey(\"MemoSq4gqABAXKb96qnH8TysNcWxMyWCqXgDLGmfcHr\");\n/**\n * Creates a memo program instruction.\n *\n * More info: https://spl.solana.com/memo\n *\n * @param text Text of the memo.\n * @param signers Optional signers to validate.\n * @returns\n */\nconst createMemoInstruction = (text, signers = []) => {\n    return new web3_js_1.TransactionInstruction({\n        programId: exports.MEMO_PROGRAM_ID,\n        keys: signers.map((s) => ({\n            pubkey: s,\n            isSigner: true,\n            isWritable: false,\n        })),\n        data: Buffer.from(text, \"utf8\"),\n    });\n};\nexports.createMemoInstruction = createMemoInstruction;\n//# sourceMappingURL=instructions.js.map\n\n/***/ }),\n\n/***/ 2837:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.formatPubkeyShort = exports.valueAsPromise = exports.sleep = exports.suppressConsoleError = exports.suppressConsoleErrorAsync = void 0;\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(7979), exports);\nconst noop = () => {\n    // noop\n};\n/**\n * Hide the console.error because @solana/web3.js often emits noisy errors as a\n * side effect.\n */\nconst suppressConsoleErrorAsync = async (fn) => {\n    const oldConsoleError = console.error;\n    console.error = noop;\n    try {\n        const result = await fn();\n        console.error = oldConsoleError;\n        return result;\n    }\n    catch (e) {\n        console.error = oldConsoleError;\n        throw e;\n    }\n};\nexports.suppressConsoleErrorAsync = suppressConsoleErrorAsync;\n/**\n * Hide the console.error because @solana/web3.js often emits noisy errors as a\n * side effect.\n */\nconst suppressConsoleError = (fn) => {\n    const oldConsoleError = console.error;\n    console.error = noop;\n    try {\n        const result = fn();\n        console.error = oldConsoleError;\n        return result;\n    }\n    catch (e) {\n        console.error = oldConsoleError;\n        throw e;\n    }\n};\nexports.suppressConsoleError = suppressConsoleError;\nfunction sleep(ms) {\n    return new Promise((resolve) => setTimeout(resolve, ms));\n}\nexports.sleep = sleep;\n/**\n * Awaits for a promise or value.\n */\nconst valueAsPromise = async (awaitable) => {\n    if (\"then\" in awaitable) {\n        return await awaitable;\n    }\n    return awaitable;\n};\nexports.valueAsPromise = valueAsPromise;\n/**\n * Shortens a pubkey.\n * @param pubkey\n * @returns\n */\nconst formatPubkeyShort = (pubkey, leading = 7, trailing = 7) => {\n    const str = pubkey.toString();\n    return str.length > 20\n        ? `${str.substring(0, leading)}.....${str.substring(str.length - trailing, str.length)}`\n        : str;\n};\nexports.formatPubkeyShort = formatPubkeyShort;\n//# sourceMappingURL=misc.js.map\n\n/***/ }),\n\n/***/ 7502:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var process = __webpack_require__(4155);\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.printAccountOwners = void 0;\nconst web3_js_1 = __webpack_require__(6737);\n/**\n * A useful tool for debugging account structs. It gives a quick glance at\n * addresses and owners. It also converts bignums into JS numbers.\n *\n * Types converted:\n * - **big numbers**: converted to native numbers\n * - **addresses**: format in base58, and prints the owner in parentheses if the account exists\n * - **plain objects**: recursively converts\n *\n * HINT: This function is mainly useful for the browser. If you are writing\n * Rust integration tests, use debugAccountOwners from chai-solana instead, so\n * that you don't have to pass in connection.\n *\n * Usage:\n * ```\n * await printAccountOwners(connection, depositAccounts);\n * // using void is recommend in dapps to avoid slowing down the user experience\n * void printAccountOwners(connection, depositAccounts);\n * ```\n *\n * Example output:\n * ```\n * tests/awesomeTest.spec.ts:583:29 {\n *   payer: 'CEGhKVeyXUrihUnNU9EchSuu6pMHEsB8MiKgvhJqYgd1 (11111111111111111111111111111111)',\n *   foo: '61tMNVhG66QZQ4UEAoHytqaUN4G1xpk1zsS5YU7Y2Qui (135QzSyjKTKaZ7ebhLpvNA2KUahEjykMjbqz3JV1V4k9)',\n *   bar: '9oPMxXVSm5msAecxi4zJpKDwbHS9c6Yos1ru739rVExc (TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA)',\n *   tokenProgram: 'TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA (BPFLoader2111111111111111111111111111111111)'\n * }\n * ```\n *\n * WARNING: This may break silently if web3 changes its api. This is only\n * intended for debugging purposes only. But it should be safe to use in production.\n */\nasync function printAccountOwners(connection, plainObj) {\n    var _a, _b;\n    try {\n        if (typeof plainObj !== \"object\") {\n            throw new Error(\"printAccountOwners only works on objects\");\n        }\n        else {\n            let relativePath;\n            const callStack = (_a = new Error().stack) === null || _a === void 0 ? void 0 : _a.split(\"\\n\");\n            if (callStack) {\n                let expectIndex = callStack.findIndex((l) => l.includes(`at ${printAccountOwners.name}`));\n                // debugAccountOwners in chai-solana wraps printAccountOwners\n                // We need to get the caller of debugAccountOwners instead\n                const debugAccountOwnersIndex = callStack.findIndex((l) => l.includes(`at debugAccountOwners`));\n                if (debugAccountOwnersIndex > expectIndex) {\n                    expectIndex = debugAccountOwnersIndex;\n                }\n                // Only log the line number in Node.js\n                if (expectIndex > 0 &&\n                    typeof process !== \"undefined\" &&\n                    process.versions !== undefined &&\n                    process.versions.node !== undefined) {\n                    const maybeProcess = process;\n                    const targetLine = callStack[expectIndex + 1];\n                    if (targetLine) {\n                        const cwd = ((_b = process.cwd) === null || _b === void 0 ? void 0 : _b.call(process)) || \"/\";\n                        // get the part of targetLine after cwd\n                        const targetLineAfterCwd = targetLine.substring(targetLine.indexOf(cwd) + cwd.length);\n                        if (targetLineAfterCwd.length > 0) {\n                            relativePath = targetLineAfterCwd.substring(1).replace(/\\)$/, \"\");\n                        }\n                    }\n                }\n            }\n            if (!connection) {\n                return;\n            }\n            if (relativePath) {\n                console.log(relativePath, await _transformAccountOwners(plainObj, connection));\n            }\n            else {\n                console.log(await _transformAccountOwners(plainObj, connection));\n            }\n        }\n    }\n    catch (e) {\n        console.error(\"Error in printAccountOwners:\", e);\n    }\n}\nexports.printAccountOwners = printAccountOwners;\n/**\n * This is a patched version of web3's getMultipleAccountsInfo.\n *\n * When it reaches an account that doesn't exist, it will just continue instead\n * of giving up.\n *\n * WARNING: This may break silently if web3 changes its api. This is only\n * intended for debugging purposes only.\n */\nasync function gracefulGetMultipleAccountsInfo(connection, publicKeys) {\n    var _a;\n    try {\n        // To be honest, the web3 internals aren't going to change that much. And if\n        // they do, it'll be rare.\n        const unknownConection = connection;\n        const rpcRequest = unknownConection._rpcRequest;\n        if (typeof rpcRequest !== \"function\") {\n            console.error(\"_rpcRequest is not a function. Maybe web3 changed?\");\n            return [];\n        }\n        const unsafeRes = await rpcRequest(\"getMultipleAccounts\", [\n            publicKeys.map((key) => key.toBase58()),\n            { encoding: \"base64\", commitment: \"confirmed\" },\n        ]);\n        const value = (_a = unsafeRes === null || unsafeRes === void 0 ? void 0 : unsafeRes.result) === null || _a === void 0 ? void 0 : _a.value;\n        if (value) {\n            return value;\n        }\n        return [];\n    }\n    catch (e) {\n        console.error(\"Error in gracefulGetMultipleAccountsInfo:\", e);\n        return [];\n    }\n}\n/**\n * Lots of complexity in this function. But using getMultipleAccountsInfo is\n * very important. Even locally, it reduces the time from 300ms to 40ms. On a\n * remote RPC server, it would probably save much more time.\n */\nconst _transformAccountOwners = async (plainObjWithAddressesAndBignums, connection) => {\n    /* eslint-disable */\n    const result = {};\n    if (!plainObjWithAddressesAndBignums ||\n        typeof plainObjWithAddressesAndBignums !== \"object\") {\n        return plainObjWithAddressesAndBignums;\n    }\n    const base58ToResultKey = {};\n    const base58ToLookup = [];\n    const asyncKeys = [];\n    const asyncPromises = [];\n    for (const [key, value] of Object.entries(plainObjWithAddressesAndBignums)) {\n        if (value && value.toBase58 && typeof value.toBase58 === \"function\") {\n            const base58 = value.toBase58();\n            base58ToResultKey[base58] = key;\n            const pubKey = new web3_js_1.PublicKey(base58);\n            if (!base58ToLookup.includes(pubKey)) {\n                base58ToLookup.push(pubKey);\n            }\n        }\n        else if (value &&\n            value.toNumber &&\n            typeof value.toNumber === \"function\") {\n            result[key] = value.toNumber();\n        }\n        else if (isPlainObject(value) && value) {\n            asyncKeys.push(key);\n            asyncPromises.push(_transformAccountOwners(value, connection));\n        }\n        else {\n            result[key] = value;\n        }\n    }\n    if (Object.keys(base58ToResultKey).length > 0) {\n        const accountInfos = await gracefulGetMultipleAccountsInfo(connection, base58ToLookup);\n        for (const [base58, resultKey] of Object.entries(base58ToResultKey)) {\n            const lookupIndex = base58ToLookup.findIndex((p) => p.toBase58() === base58);\n            if (lookupIndex >= 0) {\n                const accountInfo = accountInfos[lookupIndex];\n                const owner = accountInfo === null || accountInfo === void 0 ? void 0 : accountInfo.owner;\n                if (owner) {\n                    result[resultKey] = `${base58} (${owner})`;\n                    // Uncomment to verify that this implementation is correct\n                    // const accountInfo =\n                    //   await connection.getAccountInfo(\n                    //     new PublicKey(base58)\n                    //   );\n                    // const correctOwner = accountInfo?.owner; // we know for sure this works\n                    // if (!correctOwner) {\n                    //   throw new Error(\"Unable to load correct owner\");\n                    // }\n                    // if (!new PublicKey(owner).equals(correctOwner)) {\n                    //   console.log(\"OWNER MISMATCH\", base58, owner, accountInfo?.owner);\n                    //   throw new Error(\"OWNER MISMATCH\");\n                    // }\n                }\n                else {\n                    result[resultKey] = `${base58}`;\n                }\n            }\n            else {\n                result[resultKey] = `${base58}`;\n            }\n        }\n    }\n    const asyncValues = await Promise.all(asyncPromises);\n    for (let i = 0; i < asyncKeys.length; i++) {\n        result[asyncKeys[i]] = asyncValues[i];\n    }\n    return result;\n};\nfunction isPlainObject(obj) {\n    /* eslint-disable */\n    return (typeof obj === \"object\" && // separate from primitives\n        obj !== null && // is obvious\n        obj.constructor === Object && // separate instances (Array, DOM, ...)\n        Object.prototype.toString.call(obj) === \"[object Object]\"); // separate build-in like Math\n}\n//# sourceMappingURL=printAccountOwners.js.map\n\n/***/ }),\n\n/***/ 3358:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.estimateTransactionSize = exports.EstimatedTXTooBigError = exports.TXSizeEstimationError = exports.printTXTable = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst index_js_1 = __webpack_require__(4175);\n/**\n * Takes in a simulation result of a transaction and prints it in a cool table.\n * ```\n *    ┌─────┬───┬───┬───┬───────────┬──────┬─────┬──────┬───┐\n *    │index│iso│mar│cum│ programId │quota │used │ left │CPI│\n *    ├─────┼───┼───┼───┼───────────┼──────┼─────┼──────┼───┤\n *    │  0  │298│281│464│'ATokenG..'│200000│24270│175730│ 1 │\n *    │  1  │298│ 74│538│'ATokenG..'│178730│21270│157460│ 1 │\n *    │  2  │298│ 74│612│'ATokenG..'│157460│27277│130183│ 1 │\n *    │  3  │298│ 42│686│'ATokenG..'│130183│21270│108913│ 1 │\n *    │  4  │338│265│951│'qExampL..'│108913│76289│ 32624│ 3 │\n *    └─────┴───┴───┴───┴───────────┴──────┴─────┴──────┴───┘\n * ```\n *\n * - **index**: the array index of the instruction within the transaction\n * - **iso**: the isolated size of the instruction (marginal cost of only the instruction)\n * - **mar**: the marginal size cost of the instruction (when added to previous)\n * - **cum**: the cumulative size of the instructions up until that instruction\n * - **quota/used/left**: [BPF instruction compute unit info](https://docs.solana.com/developing/programming-model/runtime)\n * - **CPI**: [the maximum depth of CPI](https://docs.solana.com/developing/programming-model/calling-between-programs) (current limit in Solana is 4)\n *\n * Safe for browser usage. Can be conveniently run with txEnvelope.simulateTable()\n */\nconst printTXTable = (tx, transactionLogs, message) => {\n    if (message && message !== \"\") {\n        console.log((0, exports.estimateTransactionSize)(tx), message);\n    }\n    else {\n        console.log(\"Transaction size:\", (0, exports.estimateTransactionSize)(tx));\n    }\n    const computeUnitLogStack = [];\n    const cpiLogStack = [];\n    let currentIndex = -1;\n    transactionLogs.forEach((line) => {\n        if (line.includes(\" invoke [1]\")) {\n            currentIndex++;\n            cpiLogStack[currentIndex] = 0;\n        }\n        const cpiMatch = line.match(/ invoke \\[(\\d)\\]/);\n        if (cpiMatch && cpiMatch[1]) {\n            const cur = cpiLogStack[currentIndex];\n            cpiLogStack[currentIndex] =\n                cur === undefined\n                    ? Number(cpiMatch[1]) - 1\n                    : Math.max(Number(cpiMatch[1]) - 1, cur);\n        }\n        const computeMatch = line.match(/consumed \\d* of \\d* compute units/);\n        if (computeMatch && computeMatch[0]) {\n            computeUnitLogStack[currentIndex] = computeMatch[0];\n        }\n    });\n    const instructionTable = [];\n    tx.instructions.forEach((instruction, i) => {\n        const computeUnitLog = computeUnitLogStack[i];\n        const computeUnitMatch = computeUnitLog === null || computeUnitLog === void 0 ? void 0 : computeUnitLog.match(/consumed (\\d*) of (\\d*)/);\n        const [consumed, quota] = (computeUnitMatch === null || computeUnitMatch === void 0 ? void 0 : computeUnitMatch.slice(1, 3).map((num) => parseInt(num, 10))) || [undefined, undefined];\n        instructionTable.push({\n            iso: isolatedInstructionSize(tx.provider, instruction),\n            mar: marginalInstructionSize(tx.provider, tx.instructions.slice(0, i), instruction),\n            cum: instructionsSize(tx.provider, tx.instructions.slice(0, i + 1)),\n            programId: instruction.programId.toBase58(),\n            quota: quota ? quota : i === 0 ? 200000 : undefined,\n            used: consumed,\n            left: quota && consumed ? quota - consumed : undefined,\n            CPI: cpiLogStack[i],\n        });\n    });\n    console.table(instructionTable);\n};\nexports.printTXTable = printTXTable;\nclass TXSizeEstimationError extends Error {\n    constructor(underlyingError) {\n        super(`could not estimate transaction size`);\n        this.underlyingError = underlyingError;\n        this.name = \"TXSizeEstimationError\";\n    }\n}\nexports.TXSizeEstimationError = TXSizeEstimationError;\nclass EstimatedTXTooBigError extends Error {\n    constructor(tx, size) {\n        super(`Transaction too large`);\n        this.tx = tx;\n        this.size = size;\n        this.name = \"EstimatedTXTooBigError\";\n    }\n}\nexports.EstimatedTXTooBigError = EstimatedTXTooBigError;\n/**\n * Builds a transaction and estimates the size in bytes. This number is primrily\n * to be used for checking to see if a transaction is too big and instructions\n * need to be split. It may not be 100% accurate.\n *\n * This is used in expectTXTable and is useful for increasing efficiency in\n * dapps that build large transactions.\n *\n * The max transaction size of a v1 Transaction in Solana is 1232 bytes.\n * For info about Transaction v2: https://docs.solana.com/proposals/transactions-v2\n *\n * Returns 8888 if the transaction was too big.\n * Returns 9999 if the transaction was unable to be built.\n */\nconst estimateTransactionSize = (txEnvelope) => {\n    const result = txEnvelope.estimateSize();\n    if (\"size\" in result) {\n        return result.size;\n    }\n    if (result.error instanceof TXSizeEstimationError) {\n        console.error(\"Unknown error estimating transaction size\", result.error.underlyingError);\n        return 9999;\n    }\n    return 8888;\n};\nexports.estimateTransactionSize = estimateTransactionSize;\n/**\n * A dummy instruction that is probably tiny and has overlap with most instructions\n */\nconst simpleInstruction = () => {\n    const fs = getFakeSigner();\n    return web3_js_1.SystemProgram.transfer({\n        fromPubkey: fs.publicKey,\n        toPubkey: fs.publicKey,\n        lamports: 1,\n    });\n};\nconst isolatedInstructionSize = (randomProvider, instruction) => {\n    return marginalInstructionSize(randomProvider, [simpleInstruction()], instruction);\n};\nconst marginalInstructionSize = (randomProvider, previousInstructions, instruction) => {\n    const previousTxSize = instructionsSize(randomProvider, previousInstructions.length ? previousInstructions : [simpleInstruction()]);\n    const biggerTxSize = instructionsSize(randomProvider, [\n        ...previousInstructions,\n        instruction,\n    ]);\n    return biggerTxSize - previousTxSize;\n};\nconst instructionsSize = (randomProvider, instructions) => {\n    const instructionedTx = new index_js_1.TransactionEnvelope(randomProvider, [\n        ...instructions,\n    ]);\n    return (0, exports.estimateTransactionSize)(instructionedTx);\n};\nlet fakeSigner = undefined;\nconst getFakeSigner = () => {\n    if (!fakeSigner) {\n        fakeSigner = web3_js_1.Keypair.generate();\n    }\n    return fakeSigner;\n};\n//# sourceMappingURL=printTXTable.js.map\n\n/***/ }),\n\n/***/ 5963:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.getProgramAddress = exports.getPublicKey = exports.CachedPublicKey = void 0;\nconst web3_js_1 = __webpack_require__(6737);\nconst pubkeyCache = {};\n/**\n * PublicKey with a cached base58 value.\n */\nclass CachedPublicKey extends web3_js_1.PublicKey {\n    constructor(value) {\n        super(value);\n        this._base58 = super.toBase58();\n    }\n    equals(other) {\n        if (other instanceof CachedPublicKey) {\n            return other._base58 === this._base58;\n        }\n        return super.equals(other);\n    }\n    toString() {\n        return this._base58;\n    }\n    toBase58() {\n        return this._base58;\n    }\n}\nexports.CachedPublicKey = CachedPublicKey;\nconst getOrCreatePublicKey = (pk) => {\n    const cached = pubkeyCache[pk];\n    if (!cached) {\n        return (pubkeyCache[pk] = new CachedPublicKey(pk));\n    }\n    return cached;\n};\n/**\n * Gets or parses a PublicKey.\n * @param pk\n * @returns\n */\nconst getPublicKey = (pk) => {\n    if (typeof pk === \"string\") {\n        return getOrCreatePublicKey(pk);\n    }\n    else if (pk instanceof web3_js_1.PublicKey) {\n        return getOrCreatePublicKey(pk.toString());\n    }\n    else {\n        return getOrCreatePublicKey(new web3_js_1.PublicKey(pk).toString());\n    }\n};\nexports.getPublicKey = getPublicKey;\nconst gpaCache = {};\n/**\n * Concatenates seeds to generate a unique number array.\n * @param seeds\n * @returns\n */\nconst concatSeeds = (seeds) => {\n    return Uint8Array.from(seeds.reduce((acc, seed) => [...acc, ...seed], []));\n};\n/**\n * Gets a cached program address for the given seeds.\n * @param seeds\n * @param programId\n * @returns\n */\nconst getProgramAddress = (seeds, programId) => {\n    const normalizedSeeds = concatSeeds(seeds);\n    const cacheKey = `${normalizedSeeds.toString()}_${programId.toString()}`;\n    const cached = gpaCache[cacheKey];\n    if (cached) {\n        return cached;\n    }\n    const [key] = web3_js_1.PublicKey.findProgramAddressSync(seeds, programId);\n    return (gpaCache[cacheKey] = (0, exports.getPublicKey)(key));\n};\nexports.getProgramAddress = getProgramAddress;\n//# sourceMappingURL=pubkeyCache.js.map\n\n/***/ }),\n\n/***/ 5112:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.isPublicKey = exports.parsePublicKey = exports.PublicKey = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst web3_js_1 = __webpack_require__(6737);\nconst bn_js_1 = tslib_1.__importDefault(__webpack_require__(3550));\nvar web3_js_2 = __webpack_require__(6737);\nObject.defineProperty(exports, \"PublicKey\", ({ enumerable: true, get: function () { return web3_js_2.PublicKey; } }));\n/**\n * Returns a {@link PublicKey} if it can be parsed, otherwise returns null.\n * @param pk\n * @returns\n */\nconst parsePublicKey = (pk) => {\n    if (!pk) {\n        return null;\n    }\n    if (pk instanceof web3_js_1.PublicKey) {\n        return pk;\n    }\n    if (typeof pk !== \"object\" ||\n        Array.isArray(pk) ||\n        (\"constructor\" in pk && bn_js_1.default.isBN(pk))) {\n        return null;\n    }\n    try {\n        return new web3_js_1.PublicKey(pk);\n    }\n    catch (e) {\n        return null;\n    }\n};\nexports.parsePublicKey = parsePublicKey;\n/**\n * Returns true if the given value is a {@link PublicKey}.\n * @param pk\n * @returns\n */\nconst isPublicKey = (pk) => {\n    return !!(0, exports.parsePublicKey)(pk);\n};\nexports.isPublicKey = isPublicKey;\n//# sourceMappingURL=publicKey.js.map\n\n/***/ }),\n\n/***/ 2377:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.simulateTransactionWithCommitment = void 0;\nconst web3_js_1 = __webpack_require__(6737);\n/**\n * Copy of Connection.simulateTransaction that takes a commitment parameter.\n */\nasync function simulateTransactionWithCommitment(connection, transaction, commitment = \"confirmed\") {\n    var _a;\n    const connectionInner = connection;\n    // only populate recent blockhash if it isn't on the tx\n    if (!transaction.recentBlockhash) {\n        const { blockhash } = await connection.getLatestBlockhash(commitment);\n        transaction.recentBlockhash = blockhash;\n    }\n    const wireTransaction = transaction.serialize({\n        requireAllSignatures: false,\n    });\n    const encodedTransaction = wireTransaction.toString(\"base64\");\n    const config = { encoding: \"base64\", commitment };\n    const res = await connectionInner._rpcRequest(\"simulateTransaction\", [\n        encodedTransaction,\n        config,\n    ]);\n    if (res.error) {\n        throw new web3_js_1.SendTransactionError(\"failed to simulate transaction: \" + res.error.message, (_a = res.result.value.logs) !== null && _a !== void 0 ? _a : undefined);\n    }\n    return res.result;\n}\nexports.simulateTransactionWithCommitment = simulateTransactionWithCommitment;\n//# sourceMappingURL=simulateTransactionWithCommitment.js.map\n\n/***/ }),\n\n/***/ 6348:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.tsToDate = exports.dateToTs = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst bn_js_1 = tslib_1.__importDefault(__webpack_require__(3550));\n/**\n * Converts a {@link Date} to a {@link BN} timestamp.\n * @param date\n * @returns\n */\nconst dateToTs = (date) => new bn_js_1.default(Math.floor(date.getTime() / 1000));\nexports.dateToTs = dateToTs;\n/**\n * Converts a {@link BN} timestamp to a {@link Date}.\n * @param ts\n * @returns\n */\nconst tsToDate = (ts) => new Date(ts.toNumber() * 1000);\nexports.tsToDate = tsToDate;\n//# sourceMappingURL=time.js.map\n\n/***/ }),\n\n/***/ 3409:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.generateTXLink = exports.ExplorerType = void 0;\nvar ExplorerType;\n(function (ExplorerType) {\n    ExplorerType[\"SOLANA_EXPLORER\"] = \"solana-explorer\";\n    ExplorerType[\"SOLSCAN\"] = \"solscan\";\n})(ExplorerType || (exports.ExplorerType = ExplorerType = {}));\nfunction generateTXLink(signature, cluster = \"mainnet-beta\", explorerType = ExplorerType.SOLANA_EXPLORER) {\n    switch (explorerType) {\n        case ExplorerType.SOLANA_EXPLORER:\n            return `https://explorer.solana.com/tx/${signature}?cluster=${cluster}`;\n        case ExplorerType.SOLSCAN:\n            return `https://solscan.io/tx/${signature}?cluster=${cluster}`;\n        default:\n            throw new Error(`Explorer type ${explorerType} is not supported.`);\n    }\n}\nexports.generateTXLink = generateTXLink;\n//# sourceMappingURL=txLink.js.map\n\n/***/ }),\n\n/***/ 4633:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.SignerWallet = void 0;\nconst provider_js_1 = __webpack_require__(2645);\n/**\n * Wallet based on a Signer.\n */\nclass SignerWallet {\n    constructor(signer) {\n        this.signer = signer;\n    }\n    get publicKey() {\n        return this.signer.publicKey;\n    }\n    signAllTransactions(transactions) {\n        return Promise.resolve(transactions.map((tx) => {\n            tx.partialSign(this.signer);\n            return tx;\n        }));\n    }\n    signTransaction(transaction) {\n        transaction.partialSign(this.signer);\n        return Promise.resolve(transaction);\n    }\n    /**\n     * Creates a Provider from this Wallet by adding a Connection.\n     * @param connection\n     * @returns\n     */\n    createProvider(connection, sendConnection, opts) {\n        return provider_js_1.SolanaProvider.load({\n            connection,\n            sendConnection,\n            wallet: this,\n            opts,\n        });\n    }\n}\nexports.SignerWallet = SignerWallet;\n//# sourceMappingURL=wallet.js.map\n\n/***/ }),\n\n/***/ 9386:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n/**\n * Support for translating between Uint8Array instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n *   format} with {@link module:Layout.u8|8-bit}, {@link\n *   module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n *   {@link module:Layout.u32|32-bit}, {@link\n *   module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n *   format} with {@link module:Layout.u16be|16-bit}, {@link\n *   module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n *   {@link module:Layout.u40be|40-bit}, and {@link\n *   module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n *   format} with {@link module:Layout.s8|8-bit}, {@link\n *   module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n *   {@link module:Layout.s32|32-bit}, {@link\n *   module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n *   with {@link module:Layout.s16be|16-bit}, {@link\n *   module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n *   {@link module:Layout.s40be|40-bit}, and {@link\n *   module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n *   less than 2^53) or nearby integral Number in {@link\n *   module:Layout.nu64|unsigned little-endian}, {@link\n *   module:Layout.nu64be|unsigned big-endian}, {@link\n *   module:Layout.ns64|signed little-endian}, and {@link\n *   module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n *   module:Layout.f32|little-endian} and {@link\n *   module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n *   module:Layout.f64|little-endian} and {@link\n *   module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n *   encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n *   module:Layout~Layout|Layout}, with JavaScript representation as\n *   an Array and constant or data-dependent {@link\n *   module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n *   heterogeneous sequence of {@link module:Layout~Layout|Layout}\n *   instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n *   module:Layout~VariantLayout|variant layouts} over a fixed\n *   (padded) or variable (not padded) span of bytes, using an\n *   unsigned integer at the start of the data or a separate {@link\n *   module:Layout.unionLayoutDiscriminator|layout element} to\n *   determine which layout to use when interpreting the buffer\n *   contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n *   of individual {@link\n *   module:Layout~BitStructure#addField|BitField}s packed into an 8,\n *   16, 24, or 32-bit unsigned integer starting at the least- or\n *   most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n *   module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.s16 = exports.s8 = exports.nu64be = exports.u48be = exports.u40be = exports.u32be = exports.u24be = exports.u16be = exports.nu64 = exports.u48 = exports.u40 = exports.u32 = exports.u24 = exports.u16 = exports.u8 = exports.offset = exports.greedy = exports.Constant = exports.UTF8 = exports.CString = exports.Blob = exports.Boolean = exports.BitField = exports.BitStructure = exports.VariantLayout = exports.Union = exports.UnionLayoutDiscriminator = exports.UnionDiscriminator = exports.Structure = exports.Sequence = exports.DoubleBE = exports.Double = exports.FloatBE = exports.Float = exports.NearInt64BE = exports.NearInt64 = exports.NearUInt64BE = exports.NearUInt64 = exports.IntBE = exports.Int = exports.UIntBE = exports.UInt = exports.OffsetLayout = exports.GreedyCount = exports.ExternalLayout = exports.bindConstructorLayout = exports.nameWithProperty = exports.Layout = exports.uint8ArrayToBuffer = exports.checkUint8Array = void 0;\nexports.constant = exports.utf8 = exports.cstr = exports.blob = exports.unionLayoutDiscriminator = exports.union = exports.seq = exports.bits = exports.struct = exports.f64be = exports.f64 = exports.f32be = exports.f32 = exports.ns64be = exports.s48be = exports.s40be = exports.s32be = exports.s24be = exports.s16be = exports.ns64 = exports.s48 = exports.s40 = exports.s32 = exports.s24 = void 0;\nconst buffer_1 = __webpack_require__(8764);\n/* Check if a value is a Uint8Array.\n *\n * @ignore */\nfunction checkUint8Array(b) {\n    if (!(b instanceof Uint8Array)) {\n        throw new TypeError('b must be a Uint8Array');\n    }\n}\nexports.checkUint8Array = checkUint8Array;\n/* Create a Buffer instance from a Uint8Array.\n *\n * @ignore */\nfunction uint8ArrayToBuffer(b) {\n    checkUint8Array(b);\n    return buffer_1.Buffer.from(b.buffer, b.byteOffset, b.length);\n}\nexports.uint8ArrayToBuffer = uint8ArrayToBuffer;\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n    constructor(span, property) {\n        if (!Number.isInteger(span)) {\n            throw new TypeError('span must be an integer');\n        }\n        /** The span of the layout in bytes.\n         *\n         * Positive values are generally expected.\n         *\n         * Zero will only appear in {@link Constant}s and in {@link\n         * Sequence}s where the {@link Sequence#count|count} is zero.\n         *\n         * A negative value indicates that the span is value-specific, and\n         * must be obtained using {@link Layout#getSpan|getSpan}. */\n        this.span = span;\n        /** The property name used when this layout is represented in an\n         * Object.\n         *\n         * Used only for layouts that {@link Layout#decode|decode} to Object\n         * instances.  If left undefined the span of the unnamed layout will\n         * be treated as padding: it will not be mutated by {@link\n         * Layout#encode|encode} nor represented as a property in the\n         * decoded Object. */\n        this.property = property;\n    }\n    /** Function to create an Object into which decoded properties will\n     * be written.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances, which means:\n     * * {@link Structure}\n     * * {@link Union}\n     * * {@link VariantLayout}\n     * * {@link BitStructure}\n     *\n     * If left undefined the JavaScript representation of these layouts\n     * will be Object instances.\n     *\n     * See {@link bindConstructorLayout}.\n     */\n    makeDestinationObject() {\n        return {};\n    }\n    /**\n     * Calculate the span of a specific instance of a layout.\n     *\n     * @param {Uint8Array} b - the buffer that contains an encoded instance.\n     *\n     * @param {Number} [offset] - the offset at which the encoded instance\n     * starts.  If absent a zero offset is inferred.\n     *\n     * @return {Number} - the number of bytes covered by the layout\n     * instance.  If this method is not overridden in a subclass the\n     * definition-time constant {@link Layout#span|span} will be\n     * returned.\n     *\n     * @throws {RangeError} - if the length of the value cannot be\n     * determined.\n     */\n    getSpan(b, offset) {\n        if (0 > this.span) {\n            throw new RangeError('indeterminate span');\n        }\n        return this.span;\n    }\n    /**\n     * Replicate the layout using a new property.\n     *\n     * This function must be used to get a structurally-equivalent layout\n     * with a different name since all {@link Layout} instances are\n     * immutable.\n     *\n     * **NOTE** This is a shallow copy.  All fields except {@link\n     * Layout#property|property} are strictly equal to the origin layout.\n     *\n     * @param {String} property - the value for {@link\n     * Layout#property|property} in the replica.\n     *\n     * @returns {Layout} - the copy with {@link Layout#property|property}\n     * set to `property`.\n     */\n    replicate(property) {\n        const rv = Object.create(this.constructor.prototype);\n        Object.assign(rv, this);\n        rv.property = property;\n        return rv;\n    }\n    /**\n     * Create an object from layout properties and an array of values.\n     *\n     * **NOTE** This function returns `undefined` if invoked on a layout\n     * that does not return its value as an Object.  Objects are\n     * returned for things that are a {@link Structure}, which includes\n     * {@link VariantLayout|variant layouts} if they are structures, and\n     * excludes {@link Union}s.  If you want this feature for a union\n     * you must use {@link Union.getVariant|getVariant} to select the\n     * desired layout.\n     *\n     * @param {Array} values - an array of values that correspond to the\n     * default order for properties.  As with {@link Layout#decode|decode}\n     * layout elements that have no property name are skipped when\n     * iterating over the array values.  Only the top-level properties are\n     * assigned; arguments are not assigned to properties of contained\n     * layouts.  Any unused values are ignored.\n     *\n     * @return {(Object|undefined)}\n     */\n    fromArray(values) {\n        return undefined;\n    }\n}\nexports.Layout = Layout;\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n    if (lo.property) {\n        return name + '[' + lo.property + ']';\n    }\n    return name;\n}\nexports.nameWithProperty = nameWithProperty;\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\n// `Class` must be a constructor Function, but the assignment of a `layout_` property to it makes it difficult to type\n// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\nfunction bindConstructorLayout(Class, layout) {\n    if ('function' !== typeof Class) {\n        throw new TypeError('Class must be constructor');\n    }\n    if (Object.prototype.hasOwnProperty.call(Class, 'layout_')) {\n        throw new Error('Class is already bound to a layout');\n    }\n    if (!(layout && (layout instanceof Layout))) {\n        throw new TypeError('layout must be a Layout');\n    }\n    if (Object.prototype.hasOwnProperty.call(layout, 'boundConstructor_')) {\n        throw new Error('layout is already bound to a constructor');\n    }\n    Class.layout_ = layout;\n    layout.boundConstructor_ = Class;\n    layout.makeDestinationObject = (() => new Class());\n    Object.defineProperty(Class.prototype, 'encode', {\n        value(b, offset) {\n            return layout.encode(this, b, offset);\n        },\n        writable: true,\n    });\n    Object.defineProperty(Class, 'decode', {\n        value(b, offset) {\n            return layout.decode(b, offset);\n        },\n        writable: true,\n    });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n    /**\n     * Return `true` iff the external layout decodes to an unsigned\n     * integer layout.\n     *\n     * In that case it can be used as the source of {@link\n     * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n     * or as {@link UnionLayoutDiscriminator#layout|external union\n     * discriminators}.\n     *\n     * @abstract\n     */\n    isCount() {\n        throw new Error('ExternalLayout is abstract');\n    }\n}\nexports.ExternalLayout = ExternalLayout;\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n    constructor(elementSpan = 1, property) {\n        if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n            throw new TypeError('elementSpan must be a (positive) integer');\n        }\n        super(-1, property);\n        /** The layout for individual elements of the sequence.  The value\n         * must be a positive integer.  If not provided, the value will be\n         * 1. */\n        this.elementSpan = elementSpan;\n    }\n    /** @override */\n    isCount() {\n        return true;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        checkUint8Array(b);\n        const rem = b.length - offset;\n        return Math.floor(rem / this.elementSpan);\n    }\n    /** @override */\n    encode(src, b, offset) {\n        return 0;\n    }\n}\nexports.GreedyCount = GreedyCount;\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n    constructor(layout, offset = 0, property) {\n        if (!(layout instanceof Layout)) {\n            throw new TypeError('layout must be a Layout');\n        }\n        if (!Number.isInteger(offset)) {\n            throw new TypeError('offset must be integer or undefined');\n        }\n        super(layout.span, property || layout.property);\n        /** The subordinated layout. */\n        this.layout = layout;\n        /** The location of {@link OffsetLayout#layout} relative to the\n         * start of another layout.\n         *\n         * The value may be positive or negative, but an error will thrown\n         * if at the point of use it goes outside the span of the Uint8Array\n         * being accessed.  */\n        this.offset = offset;\n    }\n    /** @override */\n    isCount() {\n        return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return this.layout.decode(b, offset + this.offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        return this.layout.encode(src, b, offset + this.offset);\n    }\n}\nexports.OffsetLayout = OffsetLayout;\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readUIntLE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeUIntLE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.UInt = UInt;\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readUIntBE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeUIntBE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.UIntBE = UIntBE;\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readIntLE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeIntLE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.Int = Int;\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n    constructor(span, property) {\n        super(span, property);\n        if (6 < this.span) {\n            throw new RangeError('span must not exceed 6 bytes');\n        }\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readIntBE(offset, this.span);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeIntBE(src, offset, this.span);\n        return this.span;\n    }\n}\nexports.IntBE = IntBE;\nconst V2E32 = Math.pow(2, 32);\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n    const hi32 = Math.floor(src / V2E32);\n    const lo32 = src - (hi32 * V2E32);\n    return { hi32, lo32 };\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n    return hi32 * V2E32 + lo32;\n}\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const lo32 = buffer.readUInt32LE(offset);\n        const hi32 = buffer.readUInt32LE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32LE(split.lo32, offset);\n        buffer.writeUInt32LE(split.hi32, offset + 4);\n        return 8;\n    }\n}\nexports.NearUInt64 = NearUInt64;\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const hi32 = buffer.readUInt32BE(offset);\n        const lo32 = buffer.readUInt32BE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32BE(split.hi32, offset);\n        buffer.writeUInt32BE(split.lo32, offset + 4);\n        return 8;\n    }\n}\nexports.NearUInt64BE = NearUInt64BE;\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const lo32 = buffer.readUInt32LE(offset);\n        const hi32 = buffer.readInt32LE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeUInt32LE(split.lo32, offset);\n        buffer.writeInt32LE(split.hi32, offset + 4);\n        return 8;\n    }\n}\nexports.NearInt64 = NearInt64;\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const buffer = uint8ArrayToBuffer(b);\n        const hi32 = buffer.readInt32BE(offset);\n        const lo32 = buffer.readUInt32BE(offset + 4);\n        return roundedInt64(hi32, lo32);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        const split = divmodInt64(src);\n        const buffer = uint8ArrayToBuffer(b);\n        buffer.writeInt32BE(split.hi32, offset);\n        buffer.writeUInt32BE(split.lo32, offset + 4);\n        return 8;\n    }\n}\nexports.NearInt64BE = NearInt64BE;\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n    constructor(property) {\n        super(4, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readFloatLE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeFloatLE(src, offset);\n        return 4;\n    }\n}\nexports.Float = Float;\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n    constructor(property) {\n        super(4, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readFloatBE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeFloatBE(src, offset);\n        return 4;\n    }\n}\nexports.FloatBE = FloatBE;\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readDoubleLE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeDoubleLE(src, offset);\n        return 8;\n    }\n}\nexports.Double = Double;\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n    constructor(property) {\n        super(8, property);\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        return uint8ArrayToBuffer(b).readDoubleBE(offset);\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        uint8ArrayToBuffer(b).writeDoubleBE(src, offset);\n        return 8;\n    }\n}\nexports.DoubleBE = DoubleBE;\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n    constructor(elementLayout, count, property) {\n        if (!(elementLayout instanceof Layout)) {\n            throw new TypeError('elementLayout must be a Layout');\n        }\n        if (!(((count instanceof ExternalLayout) && count.isCount())\n            || (Number.isInteger(count) && (0 <= count)))) {\n            throw new TypeError('count must be non-negative integer '\n                + 'or an unsigned integer ExternalLayout');\n        }\n        let span = -1;\n        if ((!(count instanceof ExternalLayout))\n            && (0 < elementLayout.span)) {\n            span = count * elementLayout.span;\n        }\n        super(span, property);\n        /** The layout for individual elements of the sequence. */\n        this.elementLayout = elementLayout;\n        /** The number of elements in the sequence.\n         *\n         * This will be either a non-negative integer or an instance of\n         * {@link ExternalLayout} for which {@link\n         * ExternalLayout#isCount|isCount()} is `true`. */\n        this.count = count;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        let span = 0;\n        let count = this.count;\n        if (count instanceof ExternalLayout) {\n            count = count.decode(b, offset);\n        }\n        if (0 < this.elementLayout.span) {\n            span = count * this.elementLayout.span;\n        }\n        else {\n            let idx = 0;\n            while (idx < count) {\n                span += this.elementLayout.getSpan(b, offset + span);\n                ++idx;\n            }\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const rv = [];\n        let i = 0;\n        let count = this.count;\n        if (count instanceof ExternalLayout) {\n            count = count.decode(b, offset);\n        }\n        while (i < count) {\n            rv.push(this.elementLayout.decode(b, offset));\n            offset += this.elementLayout.getSpan(b, offset);\n            i += 1;\n        }\n        return rv;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n     *\n     * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n     * the unused space in the buffer is left unchanged.  If `src` is\n     * longer than {@link Sequence#count|count} the unneeded elements are\n     * ignored.\n     *\n     * **NOTE** If {@link Layout#count|count} is an instance of {@link\n     * ExternalLayout} then the length of `src` will be encoded as the\n     * count after `src` is encoded. */\n    encode(src, b, offset = 0) {\n        const elo = this.elementLayout;\n        const span = src.reduce((span, v) => {\n            return span + elo.encode(v, b, offset + span);\n        }, 0);\n        if (this.count instanceof ExternalLayout) {\n            this.count.encode(src.length, b, offset);\n        }\n        return span;\n    }\n}\nexports.Sequence = Sequence;\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n    constructor(fields, property, decodePrefixes) {\n        if (!(Array.isArray(fields)\n            && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n            throw new TypeError('fields must be array of Layout instances');\n        }\n        if (('boolean' === typeof property)\n            && (undefined === decodePrefixes)) {\n            decodePrefixes = property;\n            property = undefined;\n        }\n        /* Verify absence of unnamed variable-length fields. */\n        for (const fd of fields) {\n            if ((0 > fd.span)\n                && (undefined === fd.property)) {\n                throw new Error('fields cannot contain unnamed variable-length layout');\n            }\n        }\n        let span = -1;\n        try {\n            span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n        }\n        catch (e) {\n            // ignore error\n        }\n        super(span, property);\n        /** The sequence of {@link Layout} values that comprise the\n         * structure.\n         *\n         * The individual elements need not be the same type, and may be\n         * either scalar or aggregate layouts.  If a member layout leaves\n         * its {@link Layout#property|property} undefined the\n         * corresponding region of the buffer associated with the element\n         * will not be mutated.\n         *\n         * @type {Layout[]} */\n        this.fields = fields;\n        /** Control behavior of {@link Layout#decode|decode()} given short\n         * buffers.\n         *\n         * In some situations a structure many be extended with additional\n         * fields over time, with older installations providing only a\n         * prefix of the full structure.  If this property is `true`\n         * decoding will accept those buffers and leave subsequent fields\n         * undefined, as long as the buffer ends at a field boundary.\n         * Defaults to `false`. */\n        this.decodePrefixes = !!decodePrefixes;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        let span = 0;\n        try {\n            span = this.fields.reduce((span, fd) => {\n                const fsp = fd.getSpan(b, offset);\n                offset += fsp;\n                return span + fsp;\n            }, 0);\n        }\n        catch (e) {\n            throw new RangeError('indeterminate span');\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        checkUint8Array(b);\n        const dest = this.makeDestinationObject();\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                dest[fd.property] = fd.decode(b, offset);\n            }\n            offset += fd.getSpan(b, offset);\n            if (this.decodePrefixes\n                && (b.length === offset)) {\n                break;\n            }\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Structure}.\n     *\n     * If `src` is missing a property for a member with a defined {@link\n     * Layout#property|property} the corresponding region of the buffer is\n     * left unmodified. */\n    encode(src, b, offset = 0) {\n        const firstOffset = offset;\n        let lastOffset = 0;\n        let lastWrote = 0;\n        for (const fd of this.fields) {\n            let span = fd.span;\n            lastWrote = (0 < span) ? span : 0;\n            if (undefined !== fd.property) {\n                const fv = src[fd.property];\n                if (undefined !== fv) {\n                    lastWrote = fd.encode(fv, b, offset);\n                    if (0 > span) {\n                        /* Read the as-encoded span, which is not necessarily the\n                         * same as what we wrote. */\n                        span = fd.getSpan(b, offset);\n                    }\n                }\n            }\n            lastOffset = offset;\n            offset += span;\n        }\n        /* Use (lastOffset + lastWrote) instead of offset because the last\n         * item may have had a dynamic length and we don't want to include\n         * the padding between it and the end of the space reserved for\n         * it. */\n        return (lastOffset + lastWrote) - firstOffset;\n    }\n    /** @override */\n    fromArray(values) {\n        const dest = this.makeDestinationObject();\n        for (const fd of this.fields) {\n            if ((undefined !== fd.property)\n                && (0 < values.length)) {\n                dest[fd.property] = values.shift();\n            }\n        }\n        return dest;\n    }\n    /**\n     * Get access to the layout of a given property.\n     *\n     * @param {String} property - the structure member of interest.\n     *\n     * @return {Layout} - the layout associated with `property`, or\n     * undefined if there is no such property.\n     */\n    layoutFor(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return fd;\n            }\n        }\n        return undefined;\n    }\n    /**\n     * Get the offset of a structure member.\n     *\n     * @param {String} property - the structure member of interest.\n     *\n     * @return {Number} - the offset in bytes to the start of `property`\n     * within the structure, or undefined if `property` is not a field\n     * within the structure.  If the property is a member but follows a\n     * variable-length structure member a negative number will be\n     * returned.\n     */\n    offsetOf(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        let offset = 0;\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return offset;\n            }\n            if (0 > fd.span) {\n                offset = -1;\n            }\n            else if (0 <= offset) {\n                offset += fd.span;\n            }\n        }\n        return undefined;\n    }\n}\nexports.Structure = Structure;\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n    constructor(property) {\n        /** The {@link Layout#property|property} to be used when the\n         * discriminator is referenced in isolation (generally when {@link\n         * Union#decode|Union decode} cannot delegate to a specific\n         * variant). */\n        this.property = property;\n    }\n    /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n     *\n     * The implementation of this method need not reference the buffer if\n     * variant information is available through other means. */\n    decode(b, offset) {\n        throw new Error('UnionDiscriminator is abstract');\n    }\n    /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n     *\n     * The implementation of this method need not store the value if\n     * variant information is maintained through other means. */\n    encode(src, b, offset) {\n        throw new Error('UnionDiscriminator is abstract');\n    }\n}\nexports.UnionDiscriminator = UnionDiscriminator;\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n    constructor(layout, property) {\n        if (!((layout instanceof ExternalLayout)\n            && layout.isCount())) {\n            throw new TypeError('layout must be an unsigned integer ExternalLayout');\n        }\n        super(property || layout.property || 'variant');\n        /** The {@link ExternalLayout} used to access the discriminator\n         * value. */\n        this.layout = layout;\n    }\n    /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n    decode(b, offset) {\n        return this.layout.decode(b, offset);\n    }\n    /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n    encode(src, b, offset) {\n        return this.layout.encode(src, b, offset);\n    }\n}\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n    constructor(discr, defaultLayout, property) {\n        let discriminator;\n        if ((discr instanceof UInt)\n            || (discr instanceof UIntBE)) {\n            discriminator = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n        }\n        else if ((discr instanceof ExternalLayout)\n            && discr.isCount()) {\n            discriminator = new UnionLayoutDiscriminator(discr);\n        }\n        else if (!(discr instanceof UnionDiscriminator)) {\n            throw new TypeError('discr must be a UnionDiscriminator '\n                + 'or an unsigned integer layout');\n        }\n        else {\n            discriminator = discr;\n        }\n        if (undefined === defaultLayout) {\n            defaultLayout = null;\n        }\n        if (!((null === defaultLayout)\n            || (defaultLayout instanceof Layout))) {\n            throw new TypeError('defaultLayout must be null or a Layout');\n        }\n        if (null !== defaultLayout) {\n            if (0 > defaultLayout.span) {\n                throw new Error('defaultLayout must have constant span');\n            }\n            if (undefined === defaultLayout.property) {\n                defaultLayout = defaultLayout.replicate('content');\n            }\n        }\n        /* The union span can be estimated only if there's a default\n         * layout.  The union spans its default layout, plus any prefix\n         * variant layout.  By construction both layouts, if present, have\n         * non-negative span. */\n        let span = -1;\n        if (defaultLayout) {\n            span = defaultLayout.span;\n            if ((0 <= span) && ((discr instanceof UInt)\n                || (discr instanceof UIntBE))) {\n                span += discriminator.layout.span;\n            }\n        }\n        super(span, property);\n        /** The interface for the discriminator value in isolation.\n         *\n         * This a {@link UnionDiscriminator} either passed to the\n         * constructor or synthesized from the `discr` constructor\n         * argument.  {@link\n         * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n         * `true` iff the `discr` parameter was a non-offset {@link\n         * Layout} instance. */\n        this.discriminator = discriminator;\n        /** `true` if the {@link Union#discriminator|discriminator} is the\n         * first field in the union.\n         *\n         * If `false` the discriminator is obtained from somewhere\n         * else. */\n        this.usesPrefixDiscriminator = (discr instanceof UInt)\n            || (discr instanceof UIntBE);\n        /** The layout for non-discriminator content when the value of the\n         * discriminator is not recognized.\n         *\n         * This is the value passed to the constructor.  It is\n         * structurally equivalent to the second component of {@link\n         * Union#layout|layout} but may have a different property\n         * name. */\n        this.defaultLayout = defaultLayout;\n        /** A registry of allowed variants.\n         *\n         * The keys are unsigned integers which should be compatible with\n         * {@link Union.discriminator|discriminator}.  The property value\n         * is the corresponding {@link VariantLayout} instances assigned\n         * to this union by {@link Union#addVariant|addVariant}.\n         *\n         * **NOTE** The registry remains mutable so that variants can be\n         * {@link Union#addVariant|added} at any time.  Users should not\n         * manipulate the content of this property. */\n        this.registry = {};\n        /* Private variable used when invoking getSourceVariant */\n        let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n        /** Function to infer the variant selected by a source object.\n         *\n         * Defaults to {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n         * be overridden using {@link\n         * Union#configGetSourceVariant|configGetSourceVariant}.\n         *\n         * @param {Object} src - as with {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n         *\n         * @returns {(undefined|VariantLayout)} The default variant\n         * (`undefined`) or first registered variant that uses a property\n         * available in `src`. */\n        this.getSourceVariant = function (src) {\n            return boundGetSourceVariant(src);\n        };\n        /** Function to override the implementation of {@link\n         * Union#getSourceVariant|getSourceVariant}.\n         *\n         * Use this if the desired variant cannot be identified using the\n         * algorithm of {@link\n         * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n         *\n         * **NOTE** The provided function will be invoked bound to this\n         * Union instance, providing local access to {@link\n         * Union#registry|registry}.\n         *\n         * @param {Function} gsv - a function that follows the API of\n         * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n        this.configGetSourceVariant = function (gsv) {\n            boundGetSourceVariant = gsv.bind(this);\n        };\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            return this.span;\n        }\n        /* Default layouts always have non-negative span, so we don't have\n         * one and we have to recognize the variant which will in turn\n         * determine the span. */\n        const vlo = this.getVariant(b, offset);\n        if (!vlo) {\n            throw new Error('unable to determine span for unrecognized variant');\n        }\n        return vlo.getSpan(b, offset);\n    }\n    /**\n     * Method to infer a registered Union variant compatible with `src`.\n     *\n     * The first satisfied rule in the following sequence defines the\n     * return value:\n     * * If `src` has properties matching the Union discriminator and\n     *   the default layout, `undefined` is returned regardless of the\n     *   value of the discriminator property (this ensures the default\n     *   layout will be used);\n     * * If `src` has a property matching the Union discriminator, the\n     *   value of the discriminator identifies a registered variant, and\n     *   either (a) the variant has no layout, or (b) `src` has the\n     *   variant's property, then the variant is returned (because the\n     *   source satisfies the constraints of the variant it identifies);\n     * * If `src` does not have a property matching the Union\n     *   discriminator, but does have a property matching a registered\n     *   variant, then the variant is returned (because the source\n     *   matches a variant without an explicit conflict);\n     * * An error is thrown (because we either can't identify a variant,\n     *   or we were explicitly told the variant but can't satisfy it).\n     *\n     * @param {Object} src - an object presumed to be compatible with\n     * the content of the Union.\n     *\n     * @return {(undefined|VariantLayout)} - as described above.\n     *\n     * @throws {Error} - if `src` cannot be associated with a default or\n     * registered variant.\n     */\n    defaultGetSourceVariant(src) {\n        if (Object.prototype.hasOwnProperty.call(src, this.discriminator.property)) {\n            if (this.defaultLayout && this.defaultLayout.property\n                && Object.prototype.hasOwnProperty.call(src, this.defaultLayout.property)) {\n                return undefined;\n            }\n            const vlo = this.registry[src[this.discriminator.property]];\n            if (vlo\n                && ((!vlo.layout)\n                    || (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)))) {\n                return vlo;\n            }\n        }\n        else {\n            for (const tag in this.registry) {\n                const vlo = this.registry[tag];\n                if (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)) {\n                    return vlo;\n                }\n            }\n        }\n        throw new Error('unable to infer src variant');\n    }\n    /** Implement {@link Layout#decode|decode} for {@link Union}.\n     *\n     * If the variant is {@link Union#addVariant|registered} the return\n     * value is an instance of that variant, with no explicit\n     * discriminator.  Otherwise the {@link Union#defaultLayout|default\n     * layout} is used to decode the content. */\n    decode(b, offset = 0) {\n        let dest;\n        const dlo = this.discriminator;\n        const discr = dlo.decode(b, offset);\n        const clo = this.registry[discr];\n        if (undefined === clo) {\n            const defaultLayout = this.defaultLayout;\n            let contentOffset = 0;\n            if (this.usesPrefixDiscriminator) {\n                contentOffset = dlo.layout.span;\n            }\n            dest = this.makeDestinationObject();\n            dest[dlo.property] = discr;\n            // defaultLayout.property can be undefined, but this is allowed by buffer-layout\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            dest[defaultLayout.property] = defaultLayout.decode(b, offset + contentOffset);\n        }\n        else {\n            dest = clo.decode(b, offset);\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Union}.\n     *\n     * This API assumes the `src` object is consistent with the union's\n     * {@link Union#defaultLayout|default layout}.  To encode variants\n     * use the appropriate variant-specific {@link VariantLayout#encode}\n     * method. */\n    encode(src, b, offset = 0) {\n        const vlo = this.getSourceVariant(src);\n        if (undefined === vlo) {\n            const dlo = this.discriminator;\n            // this.defaultLayout is not undefined when vlo is undefined\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const clo = this.defaultLayout;\n            let contentOffset = 0;\n            if (this.usesPrefixDiscriminator) {\n                contentOffset = dlo.layout.span;\n            }\n            dlo.encode(src[dlo.property], b, offset);\n            // clo.property is not undefined when vlo is undefined\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            return contentOffset + clo.encode(src[clo.property], b, offset + contentOffset);\n        }\n        return vlo.encode(src, b, offset);\n    }\n    /** Register a new variant structure within a union.  The newly\n     * created variant is returned.\n     *\n     * @param {Number} variant - initializer for {@link\n     * VariantLayout#variant|variant}.\n     *\n     * @param {Layout} layout - initializer for {@link\n     * VariantLayout#layout|layout}.\n     *\n     * @param {String} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {VariantLayout} */\n    addVariant(variant, layout, property) {\n        const rv = new VariantLayout(this, variant, layout, property);\n        this.registry[variant] = rv;\n        return rv;\n    }\n    /**\n     * Get the layout associated with a registered variant.\n     *\n     * If `vb` does not produce a registered variant the function returns\n     * `undefined`.\n     *\n     * @param {(Number|Uint8Array)} vb - either the variant number, or a\n     * buffer from which the discriminator is to be read.\n     *\n     * @param {Number} offset - offset into `vb` for the start of the\n     * union.  Used only when `vb` is an instance of {Uint8Array}.\n     *\n     * @return {({VariantLayout}|undefined)}\n     */\n    getVariant(vb, offset = 0) {\n        let variant;\n        if (vb instanceof Uint8Array) {\n            variant = this.discriminator.decode(vb, offset);\n        }\n        else {\n            variant = vb;\n        }\n        return this.registry[variant];\n    }\n}\nexports.Union = Union;\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n    constructor(union, variant, layout, property) {\n        if (!(union instanceof Union)) {\n            throw new TypeError('union must be a Union');\n        }\n        if ((!Number.isInteger(variant)) || (0 > variant)) {\n            throw new TypeError('variant must be a (non-negative) integer');\n        }\n        if (('string' === typeof layout)\n            && (undefined === property)) {\n            property = layout;\n            layout = null;\n        }\n        if (layout) {\n            if (!(layout instanceof Layout)) {\n                throw new TypeError('layout must be a Layout');\n            }\n            if ((null !== union.defaultLayout)\n                && (0 <= layout.span)\n                && (layout.span > union.defaultLayout.span)) {\n                throw new Error('variant span exceeds span of containing union');\n            }\n            if ('string' !== typeof property) {\n                throw new TypeError('variant must have a String property');\n            }\n        }\n        let span = union.span;\n        if (0 > union.span) {\n            span = layout ? layout.span : 0;\n            if ((0 <= span) && union.usesPrefixDiscriminator) {\n                span += union.discriminator.layout.span;\n            }\n        }\n        super(span, property);\n        /** The {@link Union} to which this variant belongs. */\n        this.union = union;\n        /** The unsigned integral value identifying this variant within\n         * the {@link Union#discriminator|discriminator} of the containing\n         * union. */\n        this.variant = variant;\n        /** The {@link Layout} to be used when reading/writing the\n         * non-discriminator part of the {@link\n         * VariantLayout#union|union}.  If `null` the variant carries no\n         * data. */\n        this.layout = layout || null;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        if (0 <= this.span) {\n            /* Will be equal to the containing union span if that is not\n             * variable. */\n            return this.span;\n        }\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        /* Span is defined solely by the variant (and prefix discriminator) */\n        let span = 0;\n        if (this.layout) {\n            span = this.layout.getSpan(b, offset + contentOffset);\n        }\n        return contentOffset + span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const dest = this.makeDestinationObject();\n        if (this !== this.union.getVariant(b, offset)) {\n            throw new Error('variant mismatch');\n        }\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        if (this.layout) {\n            dest[this.property] = this.layout.decode(b, offset + contentOffset);\n        }\n        else if (this.property) {\n            dest[this.property] = true;\n        }\n        else if (this.union.usesPrefixDiscriminator) {\n            dest[this.union.discriminator.property] = this.variant;\n        }\n        return dest;\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        let contentOffset = 0;\n        if (this.union.usesPrefixDiscriminator) {\n            contentOffset = this.union.discriminator.layout.span;\n        }\n        if (this.layout\n            && (!Object.prototype.hasOwnProperty.call(src, this.property))) {\n            throw new TypeError('variant lacks property ' + this.property);\n        }\n        this.union.discriminator.encode(this.variant, b, offset);\n        let span = contentOffset;\n        if (this.layout) {\n            this.layout.encode(src[this.property], b, offset + contentOffset);\n            span += this.layout.getSpan(b, offset + contentOffset);\n            if ((0 <= this.union.span)\n                && (span > this.union.span)) {\n                throw new Error('encoded variant overruns containing union');\n            }\n        }\n        return span;\n    }\n    /** Delegate {@link Layout#fromArray|fromArray} to {@link\n     * VariantLayout#layout|layout}. */\n    fromArray(values) {\n        if (this.layout) {\n            return this.layout.fromArray(values);\n        }\n        return undefined;\n    }\n}\nexports.VariantLayout = VariantLayout;\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n    if (0 > v) {\n        v += 0x100000000;\n    }\n    return v;\n}\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n    constructor(word, msb, property) {\n        if (!((word instanceof UInt)\n            || (word instanceof UIntBE))) {\n            throw new TypeError('word must be a UInt or UIntBE layout');\n        }\n        if (('string' === typeof msb)\n            && (undefined === property)) {\n            property = msb;\n            msb = false;\n        }\n        if (4 < word.span) {\n            throw new RangeError('word cannot exceed 32 bits');\n        }\n        super(word.span, property);\n        /** The layout used for the packed value.  {@link BitField}\n         * instances are packed sequentially depending on {@link\n         * BitStructure#msb|msb}. */\n        this.word = word;\n        /** Whether the bit sequences are packed starting at the most\n         * significant bit growing down (`true`), or the least significant\n         * bit growing up (`false`).\n         *\n         * **NOTE** Regardless of this value, the least significant bit of\n         * any {@link BitField} value is the least significant bit of the\n         * corresponding section of the packed value. */\n        this.msb = !!msb;\n        /** The sequence of {@link BitField} layouts that comprise the\n         * packed structure.\n         *\n         * **NOTE** The array remains mutable to allow fields to be {@link\n         * BitStructure#addField|added} after construction.  Users should\n         * not manipulate the content of this property.*/\n        this.fields = [];\n        /* Storage for the value.  Capture a variable instead of using an\n         * instance property because we don't want anything to change the\n         * value without going through the mutator. */\n        let value = 0;\n        this._packedSetValue = function (v) {\n            value = fixBitwiseResult(v);\n            return this;\n        };\n        this._packedGetValue = function () {\n            return value;\n        };\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const dest = this.makeDestinationObject();\n        const value = this.word.decode(b, offset);\n        this._packedSetValue(value);\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                dest[fd.property] = fd.decode(b);\n            }\n        }\n        return dest;\n    }\n    /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n     *\n     * If `src` is missing a property for a member with a defined {@link\n     * Layout#property|property} the corresponding region of the packed\n     * value is left unmodified.  Unused bits are also left unmodified. */\n    encode(src, b, offset = 0) {\n        const value = this.word.decode(b, offset);\n        this._packedSetValue(value);\n        for (const fd of this.fields) {\n            if (undefined !== fd.property) {\n                const fv = src[fd.property];\n                if (undefined !== fv) {\n                    fd.encode(fv);\n                }\n            }\n        }\n        return this.word.encode(this._packedGetValue(), b, offset);\n    }\n    /** Register a new bitfield with a containing bit structure.  The\n     * resulting bitfield is returned.\n     *\n     * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n     *\n     * @param {string} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {BitField} */\n    addField(bits, property) {\n        const bf = new BitField(this, bits, property);\n        this.fields.push(bf);\n        return bf;\n    }\n    /** As with {@link BitStructure#addField|addField} for single-bit\n     * fields with `boolean` value representation.\n     *\n     * @param {string} property - initializer for {@link\n     * Layout#property|property}.\n     *\n     * @return {Boolean} */\n    // `Boolean` conflicts with the native primitive type\n    // eslint-disable-next-line @typescript-eslint/ban-types\n    addBoolean(property) {\n        // This is my Boolean, not the Javascript one.\n        const bf = new Boolean(this, property);\n        this.fields.push(bf);\n        return bf;\n    }\n    /**\n     * Get access to the bit field for a given property.\n     *\n     * @param {String} property - the bit field of interest.\n     *\n     * @return {BitField} - the field associated with `property`, or\n     * undefined if there is no such property.\n     */\n    fieldFor(property) {\n        if ('string' !== typeof property) {\n            throw new TypeError('property must be string');\n        }\n        for (const fd of this.fields) {\n            if (fd.property === property) {\n                return fd;\n            }\n        }\n        return undefined;\n    }\n}\nexports.BitStructure = BitStructure;\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n    constructor(container, bits, property) {\n        if (!(container instanceof BitStructure)) {\n            throw new TypeError('container must be a BitStructure');\n        }\n        if ((!Number.isInteger(bits)) || (0 >= bits)) {\n            throw new TypeError('bits must be positive integer');\n        }\n        const totalBits = 8 * container.span;\n        const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n        if ((bits + usedBits) > totalBits) {\n            throw new Error('bits too long for span remainder ('\n                + (totalBits - usedBits) + ' of '\n                + totalBits + ' remain)');\n        }\n        /** The {@link BitStructure} instance to which this bit field\n         * belongs. */\n        this.container = container;\n        /** The span of this value in bits. */\n        this.bits = bits;\n        /** A mask of {@link BitField#bits|bits} bits isolating value bits\n         * that fit within the field.\n         *\n         * That is, it masks a value that has not yet been shifted into\n         * position within its containing packed integer. */\n        this.valueMask = (1 << bits) - 1;\n        if (32 === bits) { // shifted value out of range\n            this.valueMask = 0xFFFFFFFF;\n        }\n        /** The offset of the value within the containing packed unsigned\n         * integer.  The least significant bit of the packed value is at\n         * offset zero, regardless of bit ordering used. */\n        this.start = usedBits;\n        if (this.container.msb) {\n            this.start = totalBits - usedBits - bits;\n        }\n        /** A mask of {@link BitField#bits|bits} isolating the field value\n         * within the containing packed unsigned integer. */\n        this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n        /** The property name used when this bitfield is represented in an\n         * Object.\n         *\n         * Intended to be functionally equivalent to {@link\n         * Layout#property}.\n         *\n         * If left undefined the corresponding span of bits will be\n         * treated as padding: it will not be mutated by {@link\n         * Layout#encode|encode} nor represented as a property in the\n         * decoded Object. */\n        this.property = property;\n    }\n    /** Store a value into the corresponding subsequence of the containing\n     * bit field. */\n    decode(b, offset) {\n        const word = this.container._packedGetValue();\n        const wordValue = fixBitwiseResult(word & this.wordMask);\n        const value = wordValue >>> this.start;\n        return value;\n    }\n    /** Store a value into the corresponding subsequence of the containing\n     * bit field.\n     *\n     * **NOTE** This is not a specialization of {@link\n     * Layout#encode|Layout.encode} and there is no return value. */\n    encode(value) {\n        if ('number' !== typeof value\n            || !Number.isInteger(value)\n            || (value !== fixBitwiseResult(value & this.valueMask))) {\n            throw new TypeError(nameWithProperty('BitField.encode', this)\n                + ' value must be integer not exceeding ' + this.valueMask);\n        }\n        const word = this.container._packedGetValue();\n        const wordValue = fixBitwiseResult(value << this.start);\n        this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n            | wordValue);\n    }\n}\nexports.BitField = BitField;\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n    constructor(container, property) {\n        super(container, 1, property);\n    }\n    /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n     *\n     * @returns {boolean} */\n    decode(b, offset) {\n        return !!super.decode(b, offset);\n    }\n    /** @override */\n    encode(value) {\n        if ('boolean' === typeof value) {\n            // BitField requires integer values\n            value = +value;\n        }\n        super.encode(value);\n    }\n}\nexports.Boolean = Boolean;\n/* eslint-enable no-extend-native */\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Uint8Array.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n    constructor(length, property) {\n        if (!(((length instanceof ExternalLayout) && length.isCount())\n            || (Number.isInteger(length) && (0 <= length)))) {\n            throw new TypeError('length must be positive integer '\n                + 'or an unsigned integer ExternalLayout');\n        }\n        let span = -1;\n        if (!(length instanceof ExternalLayout)) {\n            span = length;\n        }\n        super(span, property);\n        /** The number of bytes in the blob.\n         *\n         * This may be a non-negative integer, or an instance of {@link\n         * ExternalLayout} that satisfies {@link\n         * ExternalLayout#isCount|isCount()}. */\n        this.length = length;\n    }\n    /** @override */\n    getSpan(b, offset) {\n        let span = this.span;\n        if (0 > span) {\n            span = this.length.decode(b, offset);\n        }\n        return span;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        let span = this.span;\n        if (0 > span) {\n            span = this.length.decode(b, offset);\n        }\n        return uint8ArrayToBuffer(b).slice(offset, offset + span);\n    }\n    /** Implement {@link Layout#encode|encode} for {@link Blob}.\n     *\n     * **NOTE** If {@link Layout#count|count} is an instance of {@link\n     * ExternalLayout} then the length of `src` will be encoded as the\n     * count after `src` is encoded. */\n    encode(src, b, offset) {\n        let span = this.length;\n        if (this.length instanceof ExternalLayout) {\n            span = src.length;\n        }\n        if (!(src instanceof Uint8Array && span === src.length)) {\n            throw new TypeError(nameWithProperty('Blob.encode', this)\n                + ' requires (length ' + span + ') Uint8Array as src');\n        }\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Uint8Array');\n        }\n        const srcBuffer = uint8ArrayToBuffer(src);\n        uint8ArrayToBuffer(b).write(srcBuffer.toString('hex'), offset, span, 'hex');\n        if (this.length instanceof ExternalLayout) {\n            this.length.encode(span, b, offset);\n        }\n        return span;\n    }\n}\nexports.Blob = Blob;\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n    constructor(property) {\n        super(-1, property);\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        checkUint8Array(b);\n        let idx = offset;\n        while ((idx < b.length) && (0 !== b[idx])) {\n            idx += 1;\n        }\n        return 1 + idx - offset;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const span = this.getSpan(b, offset);\n        return uint8ArrayToBuffer(b).slice(offset, offset + span - 1).toString('utf-8');\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        /* Must force this to a string, lest it be a number and the\n         * \"utf8-encoding\" below actually allocate a buffer of length\n         * src */\n        if ('string' !== typeof src) {\n            src = String(src);\n        }\n        const srcb = buffer_1.Buffer.from(src, 'utf8');\n        const span = srcb.length;\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Buffer');\n        }\n        const buffer = uint8ArrayToBuffer(b);\n        srcb.copy(buffer, offset);\n        buffer[offset + span] = 0;\n        return span + 1;\n    }\n}\nexports.CString = CString;\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n    constructor(maxSpan, property) {\n        if (('string' === typeof maxSpan) && (undefined === property)) {\n            property = maxSpan;\n            maxSpan = undefined;\n        }\n        if (undefined === maxSpan) {\n            maxSpan = -1;\n        }\n        else if (!Number.isInteger(maxSpan)) {\n            throw new TypeError('maxSpan must be an integer');\n        }\n        super(-1, property);\n        /** The maximum span of the layout in bytes.\n         *\n         * Positive values are generally expected.  Zero is abnormal.\n         * Attempts to encode or decode a value that exceeds this length\n         * will throw a `RangeError`.\n         *\n         * A negative value indicates that there is no bound on the length\n         * of the content. */\n        this.maxSpan = maxSpan;\n    }\n    /** @override */\n    getSpan(b, offset = 0) {\n        checkUint8Array(b);\n        return b.length - offset;\n    }\n    /** @override */\n    decode(b, offset = 0) {\n        const span = this.getSpan(b, offset);\n        if ((0 <= this.maxSpan)\n            && (this.maxSpan < span)) {\n            throw new RangeError('text length exceeds maxSpan');\n        }\n        return uint8ArrayToBuffer(b).slice(offset, offset + span).toString('utf-8');\n    }\n    /** @override */\n    encode(src, b, offset = 0) {\n        /* Must force this to a string, lest it be a number and the\n         * \"utf8-encoding\" below actually allocate a buffer of length\n         * src */\n        if ('string' !== typeof src) {\n            src = String(src);\n        }\n        const srcb = buffer_1.Buffer.from(src, 'utf8');\n        const span = srcb.length;\n        if ((0 <= this.maxSpan)\n            && (this.maxSpan < span)) {\n            throw new RangeError('text length exceeds maxSpan');\n        }\n        if ((offset + span) > b.length) {\n            throw new RangeError('encoding overruns Buffer');\n        }\n        srcb.copy(uint8ArrayToBuffer(b), offset);\n        return span;\n    }\n}\nexports.UTF8 = UTF8;\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n    constructor(value, property) {\n        super(0, property);\n        /** The value produced by this constant when the layout is {@link\n         * Constant#decode|decoded}.\n         *\n         * Any JavaScript value including `null` and `undefined` is\n         * permitted.\n         *\n         * **WARNING** If `value` passed in the constructor was not\n         * frozen, it is possible for users of decoded values to change\n         * the content of the value. */\n        this.value = value;\n    }\n    /** @override */\n    decode(b, offset) {\n        return this.value;\n    }\n    /** @override */\n    encode(src, b, offset) {\n        /* Constants take no space */\n        return 0;\n    }\n}\nexports.Constant = Constant;\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = ((property) => new UInt(1, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = ((property) => new UInt(2, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = ((property) => new UInt(3, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = ((property) => new UInt(4, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = ((property) => new UInt(5, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = ((property) => new UInt(6, property));\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = ((property) => new NearUInt64(property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = ((property) => new UIntBE(2, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = ((property) => new UIntBE(3, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = ((property) => new UIntBE(4, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = ((property) => new UIntBE(5, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = ((property) => new UIntBE(6, property));\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = ((property) => new NearUInt64BE(property));\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = ((property) => new Int(1, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = ((property) => new Int(2, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = ((property) => new Int(3, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = ((property) => new Int(4, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = ((property) => new Int(5, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = ((property) => new Int(6, property));\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = ((property) => new NearInt64(property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = ((property) => new IntBE(2, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = ((property) => new IntBE(3, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = ((property) => new IntBE(4, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = ((property) => new IntBE(5, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = ((property) => new IntBE(6, property));\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = ((property) => new NearInt64BE(property));\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = ((property) => new Float(property));\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = ((property) => new FloatBE(property));\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = ((property) => new Double(property));\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = ((property) => new DoubleBE(property));\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n/** Factory for {@link CString} values. */\nexports.cstr = ((property) => new CString(property));\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n/** Factory for {@link Constant} values. */\nexports.constant = ((value, property) => new Constant(value, property));\n//# sourceMappingURL=Layout.js.map\n\n/***/ }),\n\n/***/ 4945:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"ASSOCIATED_TOKEN_PROGRAM_ID\": function() { return /* binding */ ASSOCIATED_TOKEN_PROGRAM_ID; },\n  \"AccountLayout\": function() { return /* binding */ AccountLayout; },\n  \"MintLayout\": function() { return /* binding */ MintLayout; },\n  \"NATIVE_MINT\": function() { return /* binding */ NATIVE_MINT; },\n  \"TOKEN_PROGRAM_ID\": function() { return /* binding */ TOKEN_PROGRAM_ID; },\n  \"Token\": function() { return /* binding */ Token; },\n  \"u64\": function() { return /* binding */ u64; }\n});\n\n;// CONCATENATED MODULE: ./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/typeof.js\nfunction _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}\n\n;// CONCATENATED MODULE: ./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/toPrimitive.js\n\nfunction toPrimitive(t, r) {\n  if (\"object\" != _typeof(t) || !t) return t;\n  var e = t[Symbol.toPrimitive];\n  if (void 0 !== e) {\n    var i = e.call(t, r || \"default\");\n    if (\"object\" != _typeof(i)) return i;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (\"string\" === r ? String : Number)(t);\n}\n\n;// CONCATENATED MODULE: ./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js\n\n\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\n\n;// CONCATENATED MODULE: ./node_modules/@solana/spl-token/node_modules/@babel/runtime/helpers/esm/defineProperty.js\n\nfunction _defineProperty(e, r, t) {\n  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n    value: t,\n    enumerable: !0,\n    configurable: !0,\n    writable: !0\n  }) : e[r] = t, e;\n}\n\n// EXTERNAL MODULE: ./node_modules/bn.js/lib/bn.js\nvar bn = __webpack_require__(3550);\nvar bn_default = /*#__PURE__*/__webpack_require__.n(bn);\n// EXTERNAL MODULE: ./node_modules/@solana/web3.js/lib/index.browser.esm.js + 15 modules\nvar index_browser_esm = __webpack_require__(6737);\n;// CONCATENATED MODULE: ./node_modules/@solana/spl-token/lib/index.browser.esm.js\n\n\n\n\nvar buffer = {};\n\nvar base64Js = {};\n\nbase64Js.byteLength = byteLength;\nbase64Js.toByteArray = toByteArray;\nbase64Js.fromByteArray = fromByteArray;\n\nvar lookup = [];\nvar revLookup = [];\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i];\n  revLookup[code.charCodeAt(i)] = i;\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62;\nrevLookup['_'.charCodeAt(0)] = 63;\n\nfunction getLens (b64) {\n  var len = b64.length;\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=');\n  if (validLen === -1) validLen = len;\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4);\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64);\n  var validLen = lens[0];\n  var placeHoldersLen = lens[1];\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp;\n  var lens = getLens(b64);\n  var validLen = lens[0];\n  var placeHoldersLen = lens[1];\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));\n\n  var curByte = 0;\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen;\n\n  var i;\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)];\n    arr[curByte++] = (tmp >> 16) & 0xFF;\n    arr[curByte++] = (tmp >> 8) & 0xFF;\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4);\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2);\n    arr[curByte++] = (tmp >> 8) & 0xFF;\n    arr[curByte++] = tmp & 0xFF;\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp;\n  var output = [];\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF);\n    output.push(tripletToBase64(tmp));\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp;\n  var len = uint8.length;\n  var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes\n  var parts = [];\n  var maxChunkLength = 16383; // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)));\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1];\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    );\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1];\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    );\n  }\n\n  return parts.join('')\n}\n\nvar ieee754 = {};\n\n/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\n\nieee754.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m;\n  var eLen = (nBytes * 8) - mLen - 1;\n  var eMax = (1 << eLen) - 1;\n  var eBias = eMax >> 1;\n  var nBits = -7;\n  var i = isLE ? (nBytes - 1) : 0;\n  var d = isLE ? -1 : 1;\n  var s = buffer[offset + i];\n\n  i += d;\n\n  e = s & ((1 << (-nBits)) - 1);\n  s >>= (-nBits);\n  nBits += eLen;\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1);\n  e >>= (-nBits);\n  nBits += mLen;\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias;\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen);\n    e = e - eBias;\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n};\n\nieee754.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c;\n  var eLen = (nBytes * 8) - mLen - 1;\n  var eMax = (1 << eLen) - 1;\n  var eBias = eMax >> 1;\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0);\n  var i = isLE ? 0 : (nBytes - 1);\n  var d = isLE ? 1 : -1;\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;\n\n  value = Math.abs(value);\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0;\n    e = eMax;\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2);\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--;\n      c *= 2;\n    }\n    if (e + eBias >= 1) {\n      value += rt / c;\n    } else {\n      value += rt * Math.pow(2, 1 - eBias);\n    }\n    if (value * c >= 2) {\n      e++;\n      c /= 2;\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0;\n      e = eMax;\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen);\n      e = e + eBias;\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);\n      e = 0;\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m;\n  eLen += mLen;\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128;\n};\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n\n(function (exports) {\n\nconst base64 = base64Js;\nconst ieee754$1 = ieee754;\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null;\n\nexports.Buffer = Buffer;\nexports.SlowBuffer = SlowBuffer;\nexports.INSPECT_MAX_BYTES = 50;\n\nconst K_MAX_LENGTH = 0x7fffffff;\nexports.kMaxLength = K_MAX_LENGTH;\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport();\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  );\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1);\n    const proto = { foo: function () { return 42 } };\n    Object.setPrototypeOf(proto, Uint8Array.prototype);\n    Object.setPrototypeOf(arr, proto);\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n});\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n});\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length);\n  Object.setPrototypeOf(buf, Buffer.prototype);\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192; // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf();\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value);\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n};\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype);\nObject.setPrototypeOf(Buffer, Uint8Array);\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size);\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n};\n\nfunction allocUnsafe (size) {\n  assertSize(size);\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n};\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n};\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8';\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0;\n  let buf = createBuffer(length);\n\n  const actual = buf.write(string, encoding);\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual);\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0;\n  const buf = createBuffer(length);\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255;\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView);\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf;\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array);\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset);\n  } else {\n    buf = new Uint8Array(array, byteOffset, length);\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype);\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0;\n    const buf = createBuffer(len);\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len);\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0;\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n};\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength);\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength);\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length;\n  let y = b.length;\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n};\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n};\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i;\n  if (length === undefined) {\n    length = 0;\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length;\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length);\n  let pos = 0;\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i];\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf);\n        buf.copy(buffer, pos);\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        );\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos);\n    }\n    pos += buf.length;\n  }\n  return buffer\n};\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length;\n  const mustMatch = (arguments.length > 2 && arguments[2] === true);\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false;\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase();\n        loweredCase = true;\n    }\n  }\n}\nBuffer.byteLength = byteLength;\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false;\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0;\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length;\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0;\n  start >>>= 0;\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8';\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase();\n        loweredCase = true;\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true;\n\nfunction swap (b, n, m) {\n  const i = b[n];\n  b[n] = b[m];\n  b[m] = i;\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length;\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1);\n  }\n  return this\n};\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length;\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3);\n    swap(this, i + 1, i + 2);\n  }\n  return this\n};\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length;\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7);\n    swap(this, i + 1, i + 6);\n    swap(this, i + 2, i + 5);\n    swap(this, i + 3, i + 4);\n  }\n  return this\n};\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length;\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n};\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString;\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n};\n\nBuffer.prototype.inspect = function inspect () {\n  let str = '';\n  const max = exports.INSPECT_MAX_BYTES;\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim();\n  if (this.length > max) str += ' ... ';\n  return '<Buffer ' + str + '>'\n};\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect;\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength);\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0;\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0;\n  }\n  if (thisStart === undefined) {\n    thisStart = 0;\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length;\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0;\n  end >>>= 0;\n  thisStart >>>= 0;\n  thisEnd >>>= 0;\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart;\n  let y = end - start;\n  const len = Math.min(x, y);\n\n  const thisCopy = this.slice(thisStart, thisEnd);\n  const targetCopy = target.slice(start, end);\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i];\n      y = targetCopy[i];\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n};\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset;\n    byteOffset = 0;\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff;\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000;\n  }\n  byteOffset = +byteOffset; // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1);\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset;\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1;\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0;\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding);\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF; // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1;\n  let arrLength = arr.length;\n  let valLength = val.length;\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase();\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2;\n      arrLength /= 2;\n      valLength /= 2;\n      byteOffset /= 2;\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i;\n  if (dir) {\n    let foundIndex = -1;\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i;\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex;\n        foundIndex = -1;\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true;\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false;\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n};\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n};\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n};\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0;\n  const remaining = buf.length - offset;\n  if (!length) {\n    length = remaining;\n  } else {\n    length = Number(length);\n    if (length > remaining) {\n      length = remaining;\n    }\n  }\n\n  const strLen = string.length;\n\n  if (length > strLen / 2) {\n    length = strLen / 2;\n  }\n  let i;\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16);\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed;\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8';\n    length = this.length;\n    offset = 0;\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset;\n    length = this.length;\n    offset = 0;\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0;\n    if (isFinite(length)) {\n      length = length >>> 0;\n      if (encoding === undefined) encoding = 'utf8';\n    } else {\n      encoding = length;\n      length = undefined;\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset;\n  if (length === undefined || length > remaining) length = remaining;\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8';\n\n  let loweredCase = false;\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase();\n        loweredCase = true;\n    }\n  }\n};\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n};\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end);\n  const res = [];\n\n  let i = start;\n  while (i < end) {\n    const firstByte = buf[i];\n    let codePoint = null;\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1;\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint;\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte;\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1];\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F);\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F);\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          fourthByte = buf[i + 3];\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F);\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint;\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD;\n      bytesPerSequence = 1;\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000;\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800);\n      codePoint = 0xDC00 | codePoint & 0x3FF;\n    }\n\n    res.push(codePoint);\n    i += bytesPerSequence;\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000;\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length;\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = '';\n  let i = 0;\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    );\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F);\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i]);\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length;\n\n  if (!start || start < 0) start = 0;\n  if (!end || end < 0 || end > len) end = len;\n\n  let out = '';\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]];\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end);\n  let res = '';\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256));\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length;\n  start = ~~start;\n  end = end === undefined ? len : ~~end;\n\n  if (start < 0) {\n    start += len;\n    if (start < 0) start = 0;\n  } else if (start > len) {\n    start = len;\n  }\n\n  if (end < 0) {\n    end += len;\n    if (end < 0) end = 0;\n  } else if (end > len) {\n    end = len;\n  }\n\n  if (end < start) end = start;\n\n  const newBuf = this.subarray(start, end);\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype);\n\n  return newBuf\n};\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let val = this[offset];\n  let mul = 1;\n  let i = 0;\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul;\n  }\n\n  return val\n};\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length);\n  }\n\n  let val = this[offset + --byteLength];\n  let mul = 1;\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul;\n  }\n\n  return val\n};\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 1, this.length);\n  return this[offset]\n};\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  return this[offset] | (this[offset + 1] << 8)\n};\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  return (this[offset] << 8) | this[offset + 1]\n};\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n};\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n};\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24;\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24;\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n});\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset];\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last;\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n});\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let val = this[offset];\n  let mul = 1;\n  let i = 0;\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul;\n  }\n  mul *= 0x80;\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n  return val\n};\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n  let i = byteLength;\n  let mul = 1;\n  let val = this[offset + --i];\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul;\n  }\n  mul *= 0x80;\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n  return val\n};\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 1, this.length);\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n};\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  const val = this[offset] | (this[offset + 1] << 8);\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 2, this.length);\n  const val = this[offset + 1] | (this[offset] << 8);\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n};\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n};\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24); // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n});\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0;\n  validateNumber(offset, 'offset');\n  const first = this[offset];\n  const last = this[offset + 7];\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8);\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset];\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n});\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n  return ieee754$1.read(this, offset, true, 23, 4)\n};\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 4, this.length);\n  return ieee754$1.read(this, offset, false, 23, 4)\n};\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 8, this.length);\n  return ieee754$1.read(this, offset, true, 52, 8)\n};\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0;\n  if (!noAssert) checkOffset(offset, 8, this.length);\n  return ieee754$1.read(this, offset, false, 52, 8)\n};\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n    checkInt(this, value, offset, byteLength, maxBytes, 0);\n  }\n\n  let mul = 1;\n  let i = 0;\n  this[offset] = value & 0xFF;\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  byteLength = byteLength >>> 0;\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n    checkInt(this, value, offset, byteLength, maxBytes, 0);\n  }\n\n  let i = byteLength - 1;\n  let mul = 1;\n  this[offset + i] = value & 0xFF;\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n  this[offset] = (value & 0xff);\n  return offset + 1\n};\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  return offset + 2\n};\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n  this[offset] = (value >>> 8);\n  this[offset + 1] = (value & 0xff);\n  return offset + 2\n};\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n  this[offset + 3] = (value >>> 24);\n  this[offset + 2] = (value >>> 16);\n  this[offset + 1] = (value >>> 8);\n  this[offset] = (value & 0xff);\n  return offset + 4\n};\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n  this[offset] = (value >>> 24);\n  this[offset + 1] = (value >>> 16);\n  this[offset + 2] = (value >>> 8);\n  this[offset + 3] = (value & 0xff);\n  return offset + 4\n};\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset + 7] = lo;\n  lo = lo >> 8;\n  buf[offset + 6] = lo;\n  lo = lo >> 8;\n  buf[offset + 5] = lo;\n  lo = lo >> 8;\n  buf[offset + 4] = lo;\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));\n  buf[offset + 3] = hi;\n  hi = hi >> 8;\n  buf[offset + 2] = hi;\n  hi = hi >> 8;\n  buf[offset + 1] = hi;\n  hi = hi >> 8;\n  buf[offset] = hi;\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n});\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n});\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1);\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit);\n  }\n\n  let i = 0;\n  let mul = 1;\n  let sub = 0;\n  this[offset] = value & 0xFF;\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1;\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1);\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit);\n  }\n\n  let i = byteLength - 1;\n  let mul = 1;\n  let sub = 0;\n  this[offset + i] = value & 0xFF;\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1;\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;\n  }\n\n  return offset + byteLength\n};\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);\n  if (value < 0) value = 0xff + value + 1;\n  this[offset] = (value & 0xff);\n  return offset + 1\n};\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  return offset + 2\n};\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n  this[offset] = (value >>> 8);\n  this[offset + 1] = (value & 0xff);\n  return offset + 2\n};\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n  this[offset] = (value & 0xff);\n  this[offset + 1] = (value >>> 8);\n  this[offset + 2] = (value >>> 16);\n  this[offset + 3] = (value >>> 24);\n  return offset + 4\n};\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n  if (value < 0) value = 0xffffffff + value + 1;\n  this[offset] = (value >>> 24);\n  this[offset + 1] = (value >>> 16);\n  this[offset + 2] = (value >>> 8);\n  this[offset + 3] = (value & 0xff);\n  return offset + 4\n};\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n});\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n});\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4);\n  }\n  ieee754$1.write(buf, value, offset, littleEndian, 23, 4);\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n};\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n};\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value;\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8);\n  }\n  ieee754$1.write(buf, value, offset, littleEndian, 52, 8);\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n};\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n};\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0;\n  if (!end && end !== 0) end = this.length;\n  if (targetStart >= target.length) targetStart = target.length;\n  if (!targetStart) targetStart = 0;\n  if (end > 0 && end < start) end = start;\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length;\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start;\n  }\n\n  const len = end - start;\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end);\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    );\n  }\n\n  return len\n};\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start;\n      start = 0;\n      end = this.length;\n    } else if (typeof end === 'string') {\n      encoding = end;\n      end = this.length;\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0);\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code;\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255;\n  } else if (typeof val === 'boolean') {\n    val = Number(val);\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0;\n  end = end === undefined ? this.length : end >>> 0;\n\n  if (!val) val = 0;\n\n  let i;\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val;\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding);\n    const len = bytes.length;\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len];\n    }\n  }\n\n  return this\n};\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {};\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super();\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      });\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`;\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack; // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name;\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      });\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  };\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError);\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError);\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`;\n    let received = input;\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input));\n    } else if (typeof input === 'bigint') {\n      received = String(input);\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received);\n      }\n      received += 'n';\n    }\n    msg += ` It must be ${range}. Received ${received}`;\n    return msg\n  }, RangeError);\n\nfunction addNumericalSeparator (val) {\n  let res = '';\n  let i = val.length;\n  const start = val[0] === '-' ? 1 : 0;\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`;\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset');\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1));\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : '';\n    let range;\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`;\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`;\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`;\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength);\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type);\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0];\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '');\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '=';\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity;\n  let codePoint;\n  const length = string.length;\n  let leadSurrogate = null;\n  const bytes = [];\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i);\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint;\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n        leadSurrogate = codePoint;\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000;\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n    }\n\n    leadSurrogate = null;\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint);\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      );\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      );\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      );\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = [];\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF);\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo;\n  const byteArray = [];\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i);\n    hi = c >> 8;\n    lo = c % 256;\n    byteArray.push(lo);\n    byteArray.push(hi);\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i;\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i];\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef';\n  const table = new Array(256);\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16;\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j];\n    }\n  }\n  return table\n})();\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n}(buffer));\n\nvar global$1 = (typeof __webpack_require__.g !== \"undefined\" ? __webpack_require__.g :\n  typeof self !== \"undefined\" ? self :\n  typeof window !== \"undefined\" ? window : {});\n\nvar inherits;\nif (typeof Object.create === 'function'){\n  inherits = function inherits(ctor, superCtor) {\n    // implementation from standard node.js 'util' module\n    ctor.super_ = superCtor;\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  inherits = 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}\nvar inherits$1 = inherits;\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect$1(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    _extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect$1.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect$1.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect$1.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect$1.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect$1.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== inspect$1 &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (index_browser_esm_hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!index_browser_esm_hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var length = output.reduce(function(prev, cur) {\n    if (cur.indexOf('\\n') >= 0) ;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\n\nfunction isNull(arg) {\n  return arg === null;\n}\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\nfunction _extend(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n}\nfunction index_browser_esm_hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n\n  var x = a.length;\n  var y = b.length;\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nvar hasOwn = Object.prototype.hasOwnProperty;\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) {\n    if (hasOwn.call(obj, key)) keys.push(key);\n  }\n  return keys;\n};\nvar pSlice = Array.prototype.slice;\nvar _functionsHaveNames;\nfunction functionsHaveNames() {\n  if (typeof _functionsHaveNames !== 'undefined') {\n    return _functionsHaveNames;\n  }\n  return _functionsHaveNames = (function () {\n    return function foo() {}.name === 'foo';\n  }());\n}\nfunction pToString (obj) {\n  return Object.prototype.toString.call(obj);\n}\nfunction isView(arrbuf) {\n  if (buffer.isBuffer(arrbuf)) {\n    return false;\n  }\n  if (typeof global$1.ArrayBuffer !== 'function') {\n    return false;\n  }\n  if (typeof ArrayBuffer.isView === 'function') {\n    return ArrayBuffer.isView(arrbuf);\n  }\n  if (!arrbuf) {\n    return false;\n  }\n  if (arrbuf instanceof DataView) {\n    return true;\n  }\n  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {\n    return true;\n  }\n  return false;\n}\n// 1. The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nfunction assert(value, message) {\n  if (!value) fail(value, true, message, '==', ok);\n}\n\n// 2. The AssertionError is defined in assert.\n// new assert.AssertionError({ message: message,\n//                             actual: actual,\n//                             expected: expected })\n\nvar regex = /\\s*function\\s+([^\\(\\s]*)\\s*/;\n// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js\nfunction getName(func) {\n  if (!isFunction(func)) {\n    return;\n  }\n  if (functionsHaveNames()) {\n    return func.name;\n  }\n  var str = func.toString();\n  var match = str.match(regex);\n  return match && match[1];\n}\nassert.AssertionError = AssertionError;\nfunction AssertionError(options) {\n  this.name = 'AssertionError';\n  this.actual = options.actual;\n  this.expected = options.expected;\n  this.operator = options.operator;\n  if (options.message) {\n    this.message = options.message;\n    this.generatedMessage = false;\n  } else {\n    this.message = getMessage(this);\n    this.generatedMessage = true;\n  }\n  var stackStartFunction = options.stackStartFunction || fail;\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(this, stackStartFunction);\n  } else {\n    // non v8 browsers so we can have a stacktrace\n    var err = new Error();\n    if (err.stack) {\n      var out = err.stack;\n\n      // try to strip useless frames\n      var fn_name = getName(stackStartFunction);\n      var idx = out.indexOf('\\n' + fn_name);\n      if (idx >= 0) {\n        // once we have located the function frame\n        // we need to strip out everything before it (and its line)\n        var next_line = out.indexOf('\\n', idx + 1);\n        out = out.substring(next_line + 1);\n      }\n\n      this.stack = out;\n    }\n  }\n}\n\n// assert.AssertionError instanceof Error\ninherits$1(AssertionError, Error);\n\nfunction truncate(s, n) {\n  if (typeof s === 'string') {\n    return s.length < n ? s : s.slice(0, n);\n  } else {\n    return s;\n  }\n}\nfunction inspect(something) {\n  if (functionsHaveNames() || !isFunction(something)) {\n    return inspect$1(something);\n  }\n  var rawname = getName(something);\n  var name = rawname ? ': ' + rawname : '';\n  return '[Function' +  name + ']';\n}\nfunction getMessage(self) {\n  return truncate(inspect(self.actual), 128) + ' ' +\n         self.operator + ' ' +\n         truncate(inspect(self.expected), 128);\n}\n\n// At present only the three keys mentioned above are used and\n// understood by the spec. Implementations or sub modules can pass\n// other keys to the AssertionError's constructor - they will be\n// ignored.\n\n// 3. All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided.  All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction fail(actual, expected, message, operator, stackStartFunction) {\n  throw new AssertionError({\n    message: message,\n    actual: actual,\n    expected: expected,\n    operator: operator,\n    stackStartFunction: stackStartFunction\n  });\n}\n\n// EXTENSION! allows for well behaved errors defined elsewhere.\nassert.fail = fail;\n\n// 4. Pure assertion tests whether a value is truthy, as determined\n// by !!guard.\n// assert.ok(guard, message_opt);\n// This statement is equivalent to assert.equal(true, !!guard,\n// message_opt);. To test strictly for the value true, use\n// assert.strictEqual(true, guard, message_opt);.\n\nfunction ok(value, message) {\n  if (!value) fail(value, true, message, '==', ok);\n}\nassert.ok = ok;\n\n// 5. The equality assertion tests shallow, coercive equality with\n// ==.\n// assert.equal(actual, expected, message_opt);\nassert.equal = equal;\nfunction equal(actual, expected, message) {\n  if (actual != expected) fail(actual, expected, message, '==', equal);\n}\n\n// 6. The non-equality assertion tests for whether two objects are not equal\n// with != assert.notEqual(actual, expected, message_opt);\nassert.notEqual = notEqual;\nfunction notEqual(actual, expected, message) {\n  if (actual == expected) {\n    fail(actual, expected, message, '!=', notEqual);\n  }\n}\n\n// 7. The equivalence assertion tests a deep equality relation.\n// assert.deepEqual(actual, expected, message_opt);\nassert.deepEqual = deepEqual;\nfunction deepEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'deepEqual', deepEqual);\n  }\n}\nassert.deepStrictEqual = deepStrictEqual;\nfunction deepStrictEqual(actual, expected, message) {\n  if (!_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'deepStrictEqual', deepStrictEqual);\n  }\n}\n\nfunction _deepEqual(actual, expected, strict, memos) {\n  // 7.1. All identical values are equivalent, as determined by ===.\n  if (actual === expected) {\n    return true;\n  } else if (buffer.isBuffer(actual) && buffer.isBuffer(expected)) {\n    return compare(actual, expected) === 0;\n\n  // 7.2. If the expected value is a Date object, the actual value is\n  // equivalent if it is also a Date object that refers to the same time.\n  } else if (isDate(actual) && isDate(expected)) {\n    return actual.getTime() === expected.getTime();\n\n  // 7.3 If the expected value is a RegExp object, the actual value is\n  // equivalent if it is also a RegExp object with the same source and\n  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).\n  } else if (isRegExp(actual) && isRegExp(expected)) {\n    return actual.source === expected.source &&\n           actual.global === expected.global &&\n           actual.multiline === expected.multiline &&\n           actual.lastIndex === expected.lastIndex &&\n           actual.ignoreCase === expected.ignoreCase;\n\n  // 7.4. Other pairs that do not both pass typeof value == 'object',\n  // equivalence is determined by ==.\n  } else if ((actual === null || typeof actual !== 'object') &&\n             (expected === null || typeof expected !== 'object')) {\n    return strict ? actual === expected : actual == expected;\n\n  // If both values are instances of typed arrays, wrap their underlying\n  // ArrayBuffers in a Buffer each to increase performance\n  // This optimization requires the arrays to have the same type as checked by\n  // Object.prototype.toString (aka pToString). Never perform binary\n  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their\n  // bit patterns are not identical.\n  } else if (isView(actual) && isView(expected) &&\n             pToString(actual) === pToString(expected) &&\n             !(actual instanceof Float32Array ||\n               actual instanceof Float64Array)) {\n    return compare(new Uint8Array(actual.buffer),\n                   new Uint8Array(expected.buffer)) === 0;\n\n  // 7.5 For all other Object pairs, including Array objects, equivalence is\n  // determined by having the same number of owned properties (as verified\n  // with Object.prototype.hasOwnProperty.call), the same set of keys\n  // (although not necessarily the same order), equivalent values for every\n  // corresponding key, and an identical 'prototype' property. Note: this\n  // accounts for both named and indexed properties on Arrays.\n  } else if (buffer.isBuffer(actual) !== buffer.isBuffer(expected)) {\n    return false;\n  } else {\n    memos = memos || {actual: [], expected: []};\n\n    var actualIndex = memos.actual.indexOf(actual);\n    if (actualIndex !== -1) {\n      if (actualIndex === memos.expected.indexOf(expected)) {\n        return true;\n      }\n    }\n\n    memos.actual.push(actual);\n    memos.expected.push(expected);\n\n    return objEquiv(actual, expected, strict, memos);\n  }\n}\n\nfunction isArguments(object) {\n  return Object.prototype.toString.call(object) == '[object Arguments]';\n}\n\nfunction objEquiv(a, b, strict, actualVisitedObjects) {\n  if (a === null || a === undefined || b === null || b === undefined)\n    return false;\n  // if one is a primitive, the other must be same\n  if (isPrimitive(a) || isPrimitive(b))\n    return a === b;\n  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))\n    return false;\n  var aIsArgs = isArguments(a);\n  var bIsArgs = isArguments(b);\n  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))\n    return false;\n  if (aIsArgs) {\n    a = pSlice.call(a);\n    b = pSlice.call(b);\n    return _deepEqual(a, b, strict);\n  }\n  var ka = objectKeys(a);\n  var kb = objectKeys(b);\n  var key, i;\n  // having the same number of owned properties (keys incorporates\n  // hasOwnProperty)\n  if (ka.length !== kb.length)\n    return false;\n  //the same set of keys (although not necessarily the same order),\n  ka.sort();\n  kb.sort();\n  //~~~cheap key test\n  for (i = ka.length - 1; i >= 0; i--) {\n    if (ka[i] !== kb[i])\n      return false;\n  }\n  //equivalent values for every corresponding key, and\n  //~~~possibly expensive deep test\n  for (i = ka.length - 1; i >= 0; i--) {\n    key = ka[i];\n    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))\n      return false;\n  }\n  return true;\n}\n\n// 8. The non-equivalence assertion tests for any deep inequality.\n// assert.notDeepEqual(actual, expected, message_opt);\nassert.notDeepEqual = notDeepEqual;\nfunction notDeepEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, false)) {\n    fail(actual, expected, message, 'notDeepEqual', notDeepEqual);\n  }\n}\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (_deepEqual(actual, expected, true)) {\n    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);\n  }\n}\n\n\n// 9. The strict equality assertion tests strict equality, as determined by ===.\n// assert.strictEqual(actual, expected, message_opt);\nassert.strictEqual = strictEqual;\nfunction strictEqual(actual, expected, message) {\n  if (actual !== expected) {\n    fail(actual, expected, message, '===', strictEqual);\n  }\n}\n\n// 10. The strict non-equality assertion tests for strict inequality, as\n// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);\nassert.notStrictEqual = notStrictEqual;\nfunction notStrictEqual(actual, expected, message) {\n  if (actual === expected) {\n    fail(actual, expected, message, '!==', notStrictEqual);\n  }\n}\n\nfunction expectedException(actual, expected) {\n  if (!actual || !expected) {\n    return false;\n  }\n\n  if (Object.prototype.toString.call(expected) == '[object RegExp]') {\n    return expected.test(actual);\n  }\n\n  try {\n    if (actual instanceof expected) {\n      return true;\n    }\n  } catch (e) {\n    // Ignore.  The instanceof check doesn't work for arrow functions.\n  }\n\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n\n  return expected.call({}, actual) === true;\n}\n\nfunction _tryBlock(block) {\n  var error;\n  try {\n    block();\n  } catch (e) {\n    error = e;\n  }\n  return error;\n}\n\nfunction _throws(shouldThrow, block, expected, message) {\n  var actual;\n\n  if (typeof block !== 'function') {\n    throw new TypeError('\"block\" argument must be a function');\n  }\n\n  if (typeof expected === 'string') {\n    message = expected;\n    expected = null;\n  }\n\n  actual = _tryBlock(block);\n\n  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +\n            (message ? ' ' + message : '.');\n\n  if (shouldThrow && !actual) {\n    fail(actual, expected, 'Missing expected exception' + message);\n  }\n\n  var userProvidedMessage = typeof message === 'string';\n  var isUnwantedException = !shouldThrow && isError(actual);\n  var isUnexpectedException = !shouldThrow && actual && !expected;\n\n  if ((isUnwantedException &&\n      userProvidedMessage &&\n      expectedException(actual, expected)) ||\n      isUnexpectedException) {\n    fail(actual, expected, 'Got unwanted exception' + message);\n  }\n\n  if ((shouldThrow && actual && expected &&\n      !expectedException(actual, expected)) || (!shouldThrow && actual)) {\n    throw actual;\n  }\n}\n\n// 11. Expected to throw an error:\n// assert.throws(block, Error_opt, message_opt);\nassert.throws = index_browser_esm_throws;\nfunction index_browser_esm_throws(block, /*optional*/error, /*optional*/message) {\n  _throws(true, block, error, message);\n}\n\n// EXTENSION! This is annoying to write outside this module.\nassert.doesNotThrow = doesNotThrow;\nfunction doesNotThrow(block, /*optional*/error, /*optional*/message) {\n  _throws(false, block, error, message);\n}\n\nassert.ifError = ifError;\nfunction ifError(err) {\n  if (err) throw err;\n}\n\nvar Layout$1 = {};\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nLayout$1.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\nLayout$1.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n  if ('function' !== typeof Class) {\n    throw new TypeError('Class must be constructor');\n  }\n  if (Class.hasOwnProperty('layout_')) {\n    throw new Error('Class is already bound to a layout');\n  }\n  if (!(layout && (layout instanceof Layout))) {\n    throw new TypeError('layout must be a Layout');\n  }\n  if (layout.hasOwnProperty('boundConstructor_')) {\n    throw new Error('layout is already bound to a constructor');\n  }\n  Class.layout_ = layout;\n  layout.boundConstructor_ = Class;\n  layout.makeDestinationObject = (() => new Class());\n  Object.defineProperty(Class.prototype, 'encode', {\n    value: function(b, offset) {\n      return layout.encode(this, b, offset);\n    },\n    writable: true,\n  });\n  Object.defineProperty(Class, 'decode', {\n    value: function(b, offset) {\n      return layout.decode(b, offset);\n    },\n    writable: true,\n  });\n}\nLayout$1.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n  constructor(elementSpan, property) {\n    if (undefined === elementSpan) {\n      elementSpan = 1;\n    }\n    if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n      throw new TypeError('elementSpan must be a (positive) integer');\n    }\n    super(-1, property);\n\n    /** The layout for individual elements of the sequence.  The value\n     * must be a positive integer.  If not provided, the value will be\n     * 1. */\n    this.elementSpan = elementSpan;\n  }\n\n  /** @override */\n  isCount() {\n    return true;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rem = b.length - offset;\n    return Math.floor(rem / this.elementSpan);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    return 0;\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readUInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatLE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatBE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleLE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleBE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n  constructor(elementLayout, count, property) {\n    if (!(elementLayout instanceof Layout)) {\n      throw new TypeError('elementLayout must be a Layout');\n    }\n    if (!(((count instanceof ExternalLayout) && count.isCount())\n          || (Number.isInteger(count) && (0 <= count)))) {\n      throw new TypeError('count must be non-negative integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n    let span = -1;\n    if ((!(count instanceof ExternalLayout))\n        && (0 < elementLayout.span)) {\n      span = count * elementLayout.span;\n    }\n\n    super(span, property);\n\n    /** The layout for individual elements of the sequence. */\n    this.elementLayout = elementLayout;\n\n    /** The number of elements in the sequence.\n     *\n     * This will be either a non-negative integer or an instance of\n     * {@link ExternalLayout} for which {@link\n     * ExternalLayout#isCount|isCount()} is `true`. */\n    this.count = count;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    if (0 < this.elementLayout.span) {\n      span = count * this.elementLayout.span;\n    } else {\n      let idx = 0;\n      while (idx < count) {\n        span += this.elementLayout.getSpan(b, offset + span);\n        ++idx;\n      }\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rv = [];\n    let i = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    while (i < count) {\n      rv.push(this.elementLayout.decode(b, offset));\n      offset += this.elementLayout.getSpan(b, offset);\n      i += 1;\n    }\n    return rv;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n   *\n   * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n   * the unused space in the buffer is left unchanged.  If `src` is\n   * longer than {@link Sequence#count|count} the unneeded elements are\n   * ignored.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const elo = this.elementLayout;\n    const span = src.reduce((span, v) => {\n      return span + elo.encode(v, b, offset + span);\n    }, 0);\n    if (this.count instanceof ExternalLayout) {\n      this.count.encode(src.length, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (buffer.Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n  if (0 > v) {\n    v += 0x100000000;\n  }\n  return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n  constructor(word, msb, property) {\n    if (!((word instanceof UInt)\n          || (word instanceof UIntBE))) {\n      throw new TypeError('word must be a UInt or UIntBE layout');\n    }\n    if (('string' === typeof msb)\n        && (undefined === property)) {\n      property = msb;\n      msb = undefined;\n    }\n    if (4 < word.span) {\n      throw new RangeError('word cannot exceed 32 bits');\n    }\n    super(word.span, property);\n\n    /** The layout used for the packed value.  {@link BitField}\n     * instances are packed sequentially depending on {@link\n     * BitStructure#msb|msb}. */\n    this.word = word;\n\n    /** Whether the bit sequences are packed starting at the most\n     * significant bit growing down (`true`), or the least significant\n     * bit growing up (`false`).\n     *\n     * **NOTE** Regardless of this value, the least significant bit of\n     * any {@link BitField} value is the least significant bit of the\n     * corresponding section of the packed value. */\n    this.msb = !!msb;\n\n    /** The sequence of {@link BitField} layouts that comprise the\n     * packed structure.\n     *\n     * **NOTE** The array remains mutable to allow fields to be {@link\n     * BitStructure#addField|added} after construction.  Users should\n     * not manipulate the content of this property.*/\n    this.fields = [];\n\n    /* Storage for the value.  Capture a variable instead of using an\n     * instance property because we don't want anything to change the\n     * value without going through the mutator. */\n    let value = 0;\n    this._packedSetValue = function(v) {\n      value = fixBitwiseResult(v);\n      return this;\n    };\n    this._packedGetValue = function() {\n      return value;\n    };\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(value);\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the packed\n   * value is left unmodified.  Unused bits are also left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          fd.encode(fv);\n        }\n      }\n    }\n    return this.word.encode(this._packedGetValue(), b, offset);\n  }\n\n  /** Register a new bitfield with a containing bit structure.  The\n   * resulting bitfield is returned.\n   *\n   * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {BitField} */\n  addField(bits, property) {\n    const bf = new BitField(this, bits, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /** As with {@link BitStructure#addField|addField} for single-bit\n   * fields with `boolean` value representation.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {Boolean} */\n  addBoolean(property) {\n    // This is my Boolean, not the Javascript one.\n    // eslint-disable-next-line no-new-wrappers\n    const bf = new Boolean(this, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /**\n   * Get access to the bit field for a given property.\n   *\n   * @param {String} property - the bit field of interest.\n   *\n   * @return {BitField} - the field associated with `property`, or\n   * undefined if there is no such property.\n   */\n  fieldFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n  constructor(container, bits, property) {\n    if (!(container instanceof BitStructure)) {\n      throw new TypeError('container must be a BitStructure');\n    }\n    if ((!Number.isInteger(bits)) || (0 >= bits)) {\n      throw new TypeError('bits must be positive integer');\n    }\n    const totalBits = 8 * container.span;\n    const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n    if ((bits + usedBits) > totalBits) {\n      throw new Error('bits too long for span remainder ('\n                      + (totalBits - usedBits) + ' of '\n                      + totalBits + ' remain)');\n    }\n\n    /** The {@link BitStructure} instance to which this bit field\n     * belongs. */\n    this.container = container;\n\n    /** The span of this value in bits. */\n    this.bits = bits;\n\n    /** A mask of {@link BitField#bits|bits} bits isolating value bits\n     * that fit within the field.\n     *\n     * That is, it masks a value that has not yet been shifted into\n     * position within its containing packed integer. */\n    this.valueMask = (1 << bits) - 1;\n    if (32 === bits) { // shifted value out of range\n      this.valueMask = 0xFFFFFFFF;\n    }\n\n    /** The offset of the value within the containing packed unsigned\n     * integer.  The least significant bit of the packed value is at\n     * offset zero, regardless of bit ordering used. */\n    this.start = usedBits;\n    if (this.container.msb) {\n      this.start = totalBits - usedBits - bits;\n    }\n\n    /** A mask of {@link BitField#bits|bits} isolating the field value\n     * within the containing packed unsigned integer. */\n    this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n    /** The property name used when this bitfield is represented in an\n     * Object.\n     *\n     * Intended to be functionally equivalent to {@link\n     * Layout#property}.\n     *\n     * If left undefined the corresponding span of bits will be\n     * treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field. */\n  decode() {\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(word & this.wordMask);\n    const value = wordValue >>> this.start;\n    return value;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field.\n   *\n   * **NOTE** This is not a specialization of {@link\n   * Layout#encode|Layout.encode} and there is no return value. */\n  encode(value) {\n    if ((!Number.isInteger(value))\n        || (value !== fixBitwiseResult(value & this.valueMask))) {\n      throw new TypeError(nameWithProperty('BitField.encode', this)\n                          + ' value must be integer not exceeding ' + this.valueMask);\n    }\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(value << this.start);\n    this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n                                   | wordValue);\n  };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n  constructor(container, property) {\n    super(container, 1, property);\n  }\n\n  /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n   *\n   * @returns {boolean} */\n  decode(b, offset) {\n    return !!BitField.prototype.decode.call(this, b, offset);\n  }\n\n  /** @override */\n  encode(value) {\n    if ('boolean' === typeof value) {\n      // BitField requires integer values\n      value = +value;\n    }\n    return BitField.prototype.encode.call(this, value);\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(buffer.Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n  constructor(property) {\n    super(-1, property);\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!buffer.Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let idx = offset;\n    while ((idx < b.length) && (0 !== b[idx])) {\n      idx += 1;\n    }\n    return 1 + idx - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    return b.slice(offset, offset + span - 1).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new buffer.Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    b[offset + span] = 0;\n    return span + 1;\n  }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n  constructor(maxSpan, property) {\n    if (('string' === typeof maxSpan)\n        && (undefined === property)) {\n      property = maxSpan;\n      maxSpan = undefined;\n    }\n    if (undefined === maxSpan) {\n      maxSpan = -1;\n    } else if (!Number.isInteger(maxSpan)) {\n      throw new TypeError('maxSpan must be an integer');\n    }\n\n    super(-1, property);\n\n    /** The maximum span of the layout in bytes.\n     *\n     * Positive values are generally expected.  Zero is abnormal.\n     * Attempts to encode or decode a value that exceeds this length\n     * will throw a `RangeError`.\n     *\n     * A negative value indicates that there is no bound on the length\n     * of the content. */\n    this.maxSpan = maxSpan;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!buffer.Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.length - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    return b.slice(offset, offset + span).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new buffer.Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    return span;\n  }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n  constructor(value, property) {\n    super(0, property);\n\n    /** The value produced by this constant when the layout is {@link\n     * Constant#decode|decoded}.\n     *\n     * Any JavaScript value including `null` and `undefined` is\n     * permitted.\n     *\n     * **WARNING** If `value` passed in the constructor was not\n     * frozen, it is possible for users of decoded values to change\n     * the content of the value. */\n    this.value = value;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    return this.value;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    /* Constants take no space */\n    return 0;\n  }\n}\n\nLayout$1.ExternalLayout = ExternalLayout;\nLayout$1.GreedyCount = GreedyCount;\nLayout$1.OffsetLayout = OffsetLayout;\nLayout$1.UInt = UInt;\nLayout$1.UIntBE = UIntBE;\nLayout$1.Int = Int;\nLayout$1.IntBE = IntBE;\nLayout$1.Float = Float;\nLayout$1.FloatBE = FloatBE;\nLayout$1.Double = Double;\nLayout$1.DoubleBE = DoubleBE;\nLayout$1.Sequence = Sequence;\nLayout$1.Structure = Structure;\nLayout$1.UnionDiscriminator = UnionDiscriminator;\nLayout$1.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nLayout$1.Union = Union;\nLayout$1.VariantLayout = VariantLayout;\nLayout$1.BitStructure = BitStructure;\nLayout$1.BitField = BitField;\nLayout$1.Boolean = Boolean;\nLayout$1.Blob = Blob;\nLayout$1.CString = CString;\nLayout$1.UTF8 = UTF8;\nLayout$1.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nLayout$1.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nLayout$1.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = Layout$1.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nLayout$1.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nLayout$1.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = Layout$1.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nLayout$1.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nLayout$1.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nLayout$1.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nLayout$1.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nLayout$1.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nLayout$1.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nLayout$1.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nLayout$1.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nLayout$1.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nLayout$1.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nLayout$1.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nLayout$1.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nLayout$1.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nLayout$1.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nLayout$1.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nLayout$1.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nLayout$1.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nLayout$1.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nLayout$1.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nLayout$1.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nLayout$1.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nLayout$1.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nLayout$1.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nLayout$1.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nLayout$1.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nLayout$1.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = Layout$1.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nLayout$1.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nLayout$1.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nLayout$1.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nLayout$1.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = Layout$1.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nLayout$1.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nLayout$1.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nLayout$1.const = ((value, property) => new Constant(value, property));\n\n//      \n/**\n * Layout for a public key\n */\n\nconst publicKey = (property = 'publicKey') => {\n  return blob(32, property);\n};\n/**\n * Layout for a 64bit unsigned value\n */\n\nconst uint64 = (property = 'uint64') => {\n  return blob(8, property);\n};\n\n//      \nfunction sendAndConfirmTransaction(title, connection, transaction, ...signers) {\n  return (0,index_browser_esm.sendAndConfirmTransaction)(connection, transaction, signers, {\n    skipPreflight: false\n  });\n}\n\nconst TOKEN_PROGRAM_ID = new index_browser_esm.PublicKey('TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA');\nconst ASSOCIATED_TOKEN_PROGRAM_ID = new index_browser_esm.PublicKey('ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL');\nconst FAILED_TO_FIND_ACCOUNT = 'Failed to find account';\nconst INVALID_ACCOUNT_OWNER = 'Invalid account owner';\n/**\n * Unfortunately, BufferLayout.encode uses an `instanceof` check for `Buffer`\n * which fails when using `publicKey.toBuffer()` directly because the bundled `Buffer`\n * class in `@solana/web3.js` is different from the bundled `Buffer` class in this package\n */\n\nfunction pubkeyToBuffer(publicKey) {\n  return buffer.Buffer.from(publicKey.toBuffer());\n}\n/**\n * 64-bit value\n */\n\n\nclass u64 extends (bn_default()) {\n  /**\n   * Convert to Buffer representation\n   */\n  toBuffer() {\n    const a = super.toArray().reverse();\n    const b = buffer.Buffer.from(a);\n\n    if (b.length === 8) {\n      return b;\n    }\n\n    assert(b.length < 8, 'u64 too large');\n    const zeroPad = buffer.Buffer.alloc(8);\n    b.copy(zeroPad);\n    return zeroPad;\n  }\n  /**\n   * Construct a u64 from Buffer representation\n   */\n\n\n  static fromBuffer(buffer) {\n    assert(buffer.length === 8, `Invalid buffer length: ${buffer.length}`);\n    return new u64([...buffer].reverse().map(i => `00${i.toString(16)}`.slice(-2)).join(''), 16);\n  }\n\n}\n\nfunction isAccount(accountOrPublicKey) {\n  return 'publicKey' in accountOrPublicKey;\n}\n\nconst AuthorityTypeCodes = {\n  MintTokens: 0,\n  FreezeAccount: 1,\n  AccountOwner: 2,\n  CloseAccount: 3\n}; // The address of the special mint for wrapped native token.\n\nconst NATIVE_MINT = new index_browser_esm.PublicKey('So11111111111111111111111111111111111111112');\n/**\n * Information about the mint\n */\n\nconst MintLayout = struct([u32('mintAuthorityOption'), publicKey('mintAuthority'), uint64('supply'), u8('decimals'), u8('isInitialized'), u32('freezeAuthorityOption'), publicKey('freezeAuthority')]);\n/**\n * Information about an account\n */\n\n/**\n * @private\n */\n\nconst AccountLayout = struct([publicKey('mint'), publicKey('owner'), uint64('amount'), u32('delegateOption'), publicKey('delegate'), u8('state'), u32('isNativeOption'), uint64('isNative'), uint64('delegatedAmount'), u32('closeAuthorityOption'), publicKey('closeAuthority')]);\n/**\n * Information about an multisig\n */\n\n/**\n * @private\n */\n\nconst MultisigLayout = struct([u8('m'), u8('n'), u8('is_initialized'), publicKey('signer1'), publicKey('signer2'), publicKey('signer3'), publicKey('signer4'), publicKey('signer5'), publicKey('signer6'), publicKey('signer7'), publicKey('signer8'), publicKey('signer9'), publicKey('signer10'), publicKey('signer11')]);\n/**\n * An ERC20-like Token\n */\n\nclass Token {\n  /**\n   * @private\n   */\n\n  /**\n   * The public key identifying this mint\n   */\n\n  /**\n   * Program Identifier for the Token program\n   */\n\n  /**\n   * Program Identifier for the Associated Token program\n   */\n\n  /**\n   * Fee payer\n   */\n\n  /**\n   * Create a Token object attached to the specific mint\n   *\n   * @param connection The connection to use\n   * @param token Public key of the mint\n   * @param programId token programId\n   * @param payer Payer of fees\n   */\n  constructor(connection, publicKey, programId, payer) {\n    _defineProperty(this, \"connection\", void 0);\n\n    _defineProperty(this, \"publicKey\", void 0);\n\n    _defineProperty(this, \"programId\", void 0);\n\n    _defineProperty(this, \"associatedProgramId\", void 0);\n\n    _defineProperty(this, \"payer\", void 0);\n\n    Object.assign(this, {\n      connection,\n      publicKey,\n      programId,\n      payer,\n      // Hard code is ok; Overriding is needed only for tests\n      associatedProgramId: ASSOCIATED_TOKEN_PROGRAM_ID\n    });\n  }\n  /**\n   * Get the minimum balance for the mint to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptMint(connection) {\n    return await connection.getMinimumBalanceForRentExemption(MintLayout.span);\n  }\n  /**\n   * Get the minimum balance for the account to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptAccount(connection) {\n    return await connection.getMinimumBalanceForRentExemption(AccountLayout.span);\n  }\n  /**\n   * Get the minimum balance for the multsig to be rent exempt\n   *\n   * @return Number of lamports required\n   */\n\n\n  static async getMinBalanceRentForExemptMultisig(connection) {\n    return await connection.getMinimumBalanceForRentExemption(MultisigLayout.span);\n  }\n  /**\n   * Create and initialize a token.\n   *\n   * @param connection The connection to use\n   * @param payer Fee payer for transaction\n   * @param mintAuthority Account or multisig that will control minting\n   * @param freezeAuthority Optional account or multisig that can freeze token accounts\n   * @param decimals Location of the decimal place\n   * @param programId Optional token programId, uses the system programId by default\n   * @return Token object for the newly minted token\n   */\n\n\n  static async createMint(connection, payer, mintAuthority, freezeAuthority, decimals, programId) {\n    const mintAccount = index_browser_esm.Keypair.generate();\n    const token = new Token(connection, mintAccount.publicKey, programId, payer); // Allocate memory for the account\n\n    const balanceNeeded = await Token.getMinBalanceRentForExemptMint(connection);\n    const transaction = new index_browser_esm.Transaction();\n    transaction.add(index_browser_esm.SystemProgram.createAccount({\n      fromPubkey: payer.publicKey,\n      newAccountPubkey: mintAccount.publicKey,\n      lamports: balanceNeeded,\n      space: MintLayout.span,\n      programId\n    }));\n    transaction.add(Token.createInitMintInstruction(programId, mintAccount.publicKey, decimals, mintAuthority, freezeAuthority)); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeMint', connection, transaction, payer, mintAccount);\n    return token;\n  }\n  /**\n   * Create and initialize a new account.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return Public key of the new empty account\n   */\n\n\n  async createAccount(owner) {\n    // Allocate memory for the account\n    const balanceNeeded = await Token.getMinBalanceRentForExemptAccount(this.connection);\n    const newAccount = index_browser_esm.Keypair.generate();\n    const transaction = new index_browser_esm.Transaction();\n    transaction.add(index_browser_esm.SystemProgram.createAccount({\n      fromPubkey: this.payer.publicKey,\n      newAccountPubkey: newAccount.publicKey,\n      lamports: balanceNeeded,\n      space: AccountLayout.span,\n      programId: this.programId\n    }));\n    const mintPublicKey = this.publicKey;\n    transaction.add(Token.createInitAccountInstruction(this.programId, mintPublicKey, newAccount.publicKey, owner)); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeAccount', this.connection, transaction, this.payer, newAccount);\n    return newAccount.publicKey;\n  }\n  /**\n   * Create and initialize the associated account.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return Public key of the new associated account\n   */\n\n\n  async createAssociatedTokenAccount(owner) {\n    const associatedAddress = await Token.getAssociatedTokenAddress(this.associatedProgramId, this.programId, this.publicKey, owner);\n    return this.createAssociatedTokenAccountInternal(owner, associatedAddress);\n  }\n\n  async createAssociatedTokenAccountInternal(owner, associatedAddress) {\n    await sendAndConfirmTransaction('CreateAssociatedTokenAccount', this.connection, new index_browser_esm.Transaction().add(Token.createAssociatedTokenAccountInstruction(this.associatedProgramId, this.programId, this.publicKey, associatedAddress, owner, this.payer.publicKey)), this.payer);\n    return associatedAddress;\n  }\n  /**\n   * Retrieve the associated account or create one if not found.\n   *\n   * This account may then be used as a `transfer()` or `approve()` destination\n   *\n   * @param owner User account that will own the new account\n   * @return The new associated account\n   */\n\n\n  async getOrCreateAssociatedAccountInfo(owner) {\n    const associatedAddress = await Token.getAssociatedTokenAddress(this.associatedProgramId, this.programId, this.publicKey, owner); // This is the optimum logic, considering TX fee, client-side computation,\n    // RPC roundtrips and guaranteed idempotent.\n    // Sadly we can't do this atomically;\n\n    try {\n      return await this.getAccountInfo(associatedAddress);\n    } catch (err) {\n      // INVALID_ACCOUNT_OWNER can be possible if the associatedAddress has\n      // already been received some lamports (= became system accounts).\n      // Assuming program derived addressing is safe, this is the only case\n      // for the INVALID_ACCOUNT_OWNER in this code-path\n      if (err.message === FAILED_TO_FIND_ACCOUNT || err.message === INVALID_ACCOUNT_OWNER) {\n        // as this isn't atomic, it's possible others can create associated\n        // accounts meanwhile\n        try {\n          await this.createAssociatedTokenAccountInternal(owner, associatedAddress);\n        } catch (err) {// ignore all errors; for now there is no API compatible way to\n          // selectively ignore the expected instruction error if the\n          // associated account is existing already.\n        } // Now this should always succeed\n\n\n        return await this.getAccountInfo(associatedAddress);\n      } else {\n        throw err;\n      }\n    }\n  }\n  /**\n   * Create and initialize a new account on the special native token mint.\n   *\n   * In order to be wrapped, the account must have a balance of native tokens\n   * when it is initialized with the token program.\n   *\n   * This function sends lamports to the new account before initializing it.\n   *\n   * @param connection A solana web3 connection\n   * @param programId The token program ID\n   * @param owner The owner of the new token account\n   * @param payer The source of the lamports to initialize, and payer of the initialization fees.\n   * @param amount The amount of lamports to wrap\n   * @return {Promise<PublicKey>} The new token account\n   */\n\n\n  static async createWrappedNativeAccount(connection, programId, owner, payer, amount) {\n    // Allocate memory for the account\n    const balanceNeeded = await Token.getMinBalanceRentForExemptAccount(connection); // Create a new account\n\n    const newAccount = index_browser_esm.Keypair.generate();\n    const transaction = new index_browser_esm.Transaction();\n    transaction.add(index_browser_esm.SystemProgram.createAccount({\n      fromPubkey: payer.publicKey,\n      newAccountPubkey: newAccount.publicKey,\n      lamports: balanceNeeded,\n      space: AccountLayout.span,\n      programId\n    })); // Send lamports to it (these will be wrapped into native tokens by the token program)\n\n    transaction.add(index_browser_esm.SystemProgram.transfer({\n      fromPubkey: payer.publicKey,\n      toPubkey: newAccount.publicKey,\n      lamports: amount\n    })); // Assign the new account to the native token mint.\n    // the account will be initialized with a balance equal to the native token balance.\n    // (i.e. amount)\n\n    transaction.add(Token.createInitAccountInstruction(programId, NATIVE_MINT, newAccount.publicKey, owner)); // Send the three instructions\n\n    await sendAndConfirmTransaction('createAccount, transfer, and initializeAccount', connection, transaction, payer, newAccount);\n    return newAccount.publicKey;\n  }\n  /**\n   * Create and initialize a new multisig.\n   *\n   * This account may then be used for multisignature verification\n   *\n   * @param m Number of required signatures\n   * @param signers Full set of signers\n   * @return Public key of the new multisig account\n   */\n\n\n  async createMultisig(m, signers) {\n    const multisigAccount = index_browser_esm.Keypair.generate(); // Allocate memory for the account\n\n    const balanceNeeded = await Token.getMinBalanceRentForExemptMultisig(this.connection);\n    const transaction = new index_browser_esm.Transaction();\n    transaction.add(index_browser_esm.SystemProgram.createAccount({\n      fromPubkey: this.payer.publicKey,\n      newAccountPubkey: multisigAccount.publicKey,\n      lamports: balanceNeeded,\n      space: MultisigLayout.span,\n      programId: this.programId\n    })); // create the new account\n\n    let keys = [{\n      pubkey: multisigAccount.publicKey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: index_browser_esm.SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    signers.forEach(signer => keys.push({\n      pubkey: signer,\n      isSigner: false,\n      isWritable: false\n    }));\n    const dataLayout = struct([u8('instruction'), u8('m')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 2,\n      // InitializeMultisig instruction\n      m\n    }, data);\n    transaction.add({\n      keys,\n      programId: this.programId,\n      data\n    }); // Send the two instructions\n\n    await sendAndConfirmTransaction('createAccount and InitializeMultisig', this.connection, transaction, this.payer, multisigAccount);\n    return multisigAccount.publicKey;\n  }\n  /**\n   * Retrieve mint information\n   */\n\n\n  async getMintInfo() {\n    const info = await this.connection.getAccountInfo(this.publicKey);\n\n    if (info === null) {\n      throw new Error('Failed to find mint account');\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(`Invalid mint owner: ${JSON.stringify(info.owner)}`);\n    }\n\n    if (info.data.length != MintLayout.span) {\n      throw new Error(`Invalid mint size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const mintInfo = MintLayout.decode(data);\n\n    if (mintInfo.mintAuthorityOption === 0) {\n      mintInfo.mintAuthority = null;\n    } else {\n      mintInfo.mintAuthority = new index_browser_esm.PublicKey(mintInfo.mintAuthority);\n    }\n\n    mintInfo.supply = u64.fromBuffer(mintInfo.supply);\n    mintInfo.isInitialized = mintInfo.isInitialized != 0;\n\n    if (mintInfo.freezeAuthorityOption === 0) {\n      mintInfo.freezeAuthority = null;\n    } else {\n      mintInfo.freezeAuthority = new index_browser_esm.PublicKey(mintInfo.freezeAuthority);\n    }\n\n    return mintInfo;\n  }\n  /**\n   * Retrieve account information\n   *\n   * @param account Public key of the account\n   */\n\n\n  async getAccountInfo(account, commitment) {\n    const info = await this.connection.getAccountInfo(account, commitment);\n\n    if (info === null) {\n      throw new Error(FAILED_TO_FIND_ACCOUNT);\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(INVALID_ACCOUNT_OWNER);\n    }\n\n    if (info.data.length != AccountLayout.span) {\n      throw new Error(`Invalid account size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const accountInfo = AccountLayout.decode(data);\n    accountInfo.address = account;\n    accountInfo.mint = new index_browser_esm.PublicKey(accountInfo.mint);\n    accountInfo.owner = new index_browser_esm.PublicKey(accountInfo.owner);\n    accountInfo.amount = u64.fromBuffer(accountInfo.amount);\n\n    if (accountInfo.delegateOption === 0) {\n      accountInfo.delegate = null;\n      accountInfo.delegatedAmount = new u64();\n    } else {\n      accountInfo.delegate = new index_browser_esm.PublicKey(accountInfo.delegate);\n      accountInfo.delegatedAmount = u64.fromBuffer(accountInfo.delegatedAmount);\n    }\n\n    accountInfo.isInitialized = accountInfo.state !== 0;\n    accountInfo.isFrozen = accountInfo.state === 2;\n\n    if (accountInfo.isNativeOption === 1) {\n      accountInfo.rentExemptReserve = u64.fromBuffer(accountInfo.isNative);\n      accountInfo.isNative = true;\n    } else {\n      accountInfo.rentExemptReserve = null;\n      accountInfo.isNative = false;\n    }\n\n    if (accountInfo.closeAuthorityOption === 0) {\n      accountInfo.closeAuthority = null;\n    } else {\n      accountInfo.closeAuthority = new index_browser_esm.PublicKey(accountInfo.closeAuthority);\n    }\n\n    if (!accountInfo.mint.equals(this.publicKey)) {\n      throw new Error(`Invalid account mint: ${JSON.stringify(accountInfo.mint)} !== ${JSON.stringify(this.publicKey)}`);\n    }\n\n    return accountInfo;\n  }\n  /**\n   * Retrieve Multisig information\n   *\n   * @param multisig Public key of the account\n   */\n\n\n  async getMultisigInfo(multisig) {\n    const info = await this.connection.getAccountInfo(multisig);\n\n    if (info === null) {\n      throw new Error('Failed to find multisig');\n    }\n\n    if (!info.owner.equals(this.programId)) {\n      throw new Error(`Invalid multisig owner`);\n    }\n\n    if (info.data.length != MultisigLayout.span) {\n      throw new Error(`Invalid multisig size`);\n    }\n\n    const data = buffer.Buffer.from(info.data);\n    const multisigInfo = MultisigLayout.decode(data);\n    multisigInfo.signer1 = new index_browser_esm.PublicKey(multisigInfo.signer1);\n    multisigInfo.signer2 = new index_browser_esm.PublicKey(multisigInfo.signer2);\n    multisigInfo.signer3 = new index_browser_esm.PublicKey(multisigInfo.signer3);\n    multisigInfo.signer4 = new index_browser_esm.PublicKey(multisigInfo.signer4);\n    multisigInfo.signer5 = new index_browser_esm.PublicKey(multisigInfo.signer5);\n    multisigInfo.signer6 = new index_browser_esm.PublicKey(multisigInfo.signer6);\n    multisigInfo.signer7 = new index_browser_esm.PublicKey(multisigInfo.signer7);\n    multisigInfo.signer8 = new index_browser_esm.PublicKey(multisigInfo.signer8);\n    multisigInfo.signer9 = new index_browser_esm.PublicKey(multisigInfo.signer9);\n    multisigInfo.signer10 = new index_browser_esm.PublicKey(multisigInfo.signer10);\n    multisigInfo.signer11 = new index_browser_esm.PublicKey(multisigInfo.signer11);\n    return multisigInfo;\n  }\n  /**\n   * Transfer tokens to another account\n   *\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Number of tokens to transfer\n   */\n\n\n  async transfer(source, destination, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    return await sendAndConfirmTransaction('Transfer', this.connection, new index_browser_esm.Transaction().add(Token.createTransferInstruction(this.programId, source, destination, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Grant a third-party permission to transfer up the specified number of tokens from an account\n   *\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   */\n\n\n  async approve(account, delegate, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Approve', this.connection, new index_browser_esm.Transaction().add(Token.createApproveInstruction(this.programId, account, delegate, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Remove approval for the transfer of any remaining tokens\n   *\n   * @param account Public key of the account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  async revoke(account, owner, multiSigners) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Revoke', this.connection, new index_browser_esm.Transaction().add(Token.createRevokeInstruction(this.programId, account, ownerPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Assign a new authority to the account\n   *\n   * @param account Public key of the account\n   * @param newAuthority New authority of the account\n   * @param authorityType Type of authority to set\n   * @param currentAuthority Current authority of the account\n   * @param multiSigners Signing accounts if `currentAuthority` is a multiSig\n   */\n\n\n  async setAuthority(account, newAuthority, authorityType, currentAuthority, multiSigners) {\n    let currentAuthorityPublicKey;\n    let signers;\n\n    if (isAccount(currentAuthority)) {\n      currentAuthorityPublicKey = currentAuthority.publicKey;\n      signers = [currentAuthority];\n    } else {\n      currentAuthorityPublicKey = currentAuthority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('SetAuthority', this.connection, new index_browser_esm.Transaction().add(Token.createSetAuthorityInstruction(this.programId, account, newAuthority, authorityType, currentAuthorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Mint new tokens\n   *\n   * @param dest Public key of the account to mint to\n   * @param authority Minting authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   */\n\n\n  async mintTo(dest, authority, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      ownerPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      ownerPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('MintTo', this.connection, new index_browser_esm.Transaction().add(Token.createMintToInstruction(this.programId, this.publicKey, dest, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Burn tokens\n   *\n   * @param account Account to burn tokens from\n   * @param owner Account owner\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Amount to burn\n   */\n\n\n  async burn(account, owner, multiSigners, amount) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('Burn', this.connection, new index_browser_esm.Transaction().add(Token.createBurnInstruction(this.programId, this.publicKey, account, ownerPublicKey, multiSigners, amount)), this.payer, ...signers);\n  }\n  /**\n   * Close account\n   *\n   * @param account Account to close\n   * @param dest Account to receive the remaining balance of the closed account\n   * @param authority Authority which is allowed to close the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async closeAccount(account, dest, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('CloseAccount', this.connection, new index_browser_esm.Transaction().add(Token.createCloseAccountInstruction(this.programId, account, dest, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Freeze account\n   *\n   * @param account Account to freeze\n   * @param authority The mint freeze authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async freezeAccount(account, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('FreezeAccount', this.connection, new index_browser_esm.Transaction().add(Token.createFreezeAccountInstruction(this.programId, account, this.publicKey, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Thaw account\n   *\n   * @param account Account to thaw\n   * @param authority The mint freeze authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   */\n\n\n  async thawAccount(account, authority, multiSigners) {\n    let authorityPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      authorityPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      authorityPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('ThawAccount', this.connection, new index_browser_esm.Transaction().add(Token.createThawAccountInstruction(this.programId, account, this.publicKey, authorityPublicKey, multiSigners)), this.payer, ...signers);\n  }\n  /**\n   * Transfer tokens to another account, asserting the token mint and decimals\n   *\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Number of tokens to transfer\n   * @param decimals Number of decimals in transfer amount\n   */\n\n\n  async transferChecked(source, destination, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    return await sendAndConfirmTransaction('TransferChecked', this.connection, new index_browser_esm.Transaction().add(Token.createTransferCheckedInstruction(this.programId, source, this.publicKey, destination, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Grant a third-party permission to transfer up the specified number of tokens from an account,\n   * asserting the token mint and decimals\n   *\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   * @param decimals Number of decimals in approve amount\n   */\n\n\n  async approveChecked(account, delegate, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('ApproveChecked', this.connection, new index_browser_esm.Transaction().add(Token.createApproveCheckedInstruction(this.programId, account, this.publicKey, delegate, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Mint new tokens, asserting the token mint and decimals\n   *\n   * @param dest Public key of the account to mint to\n   * @param authority Minting authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   * @param decimals Number of decimals in amount to mint\n   */\n\n\n  async mintToChecked(dest, authority, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(authority)) {\n      ownerPublicKey = authority.publicKey;\n      signers = [authority];\n    } else {\n      ownerPublicKey = authority;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('MintToChecked', this.connection, new index_browser_esm.Transaction().add(Token.createMintToCheckedInstruction(this.programId, this.publicKey, dest, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Burn tokens, asserting the token mint and decimals\n   *\n   * @param account Account to burn tokens from\n   * @param owner Account owner\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Amount to burn\n   * @param decimals Number of decimals in amount to burn\n   */\n\n\n  async burnChecked(account, owner, multiSigners, amount, decimals) {\n    let ownerPublicKey;\n    let signers;\n\n    if (isAccount(owner)) {\n      ownerPublicKey = owner.publicKey;\n      signers = [owner];\n    } else {\n      ownerPublicKey = owner;\n      signers = multiSigners;\n    }\n\n    await sendAndConfirmTransaction('BurnChecked', this.connection, new index_browser_esm.Transaction().add(Token.createBurnCheckedInstruction(this.programId, this.publicKey, account, ownerPublicKey, multiSigners, amount, decimals)), this.payer, ...signers);\n  }\n  /**\n   * Sync amount in native SPL token account to underlying lamports\n   *\n   * @param nativeAccount Account to sync\n   */\n\n\n  async syncNative(nativeAccount) {\n    await sendAndConfirmTransaction('SyncNative', this.connection, new index_browser_esm.Transaction().add(Token.createSyncNativeInstruction(this.programId, nativeAccount)), this.payer);\n  }\n  /**\n   * Construct an InitializeMint instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param decimals Number of decimals in token account amounts\n   * @param mintAuthority Minting authority\n   * @param freezeAuthority Optional authority that can freeze token accounts\n   */\n\n\n  static createInitMintInstruction(programId, mint, decimals, mintAuthority, freezeAuthority) {\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: index_browser_esm.SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    const commandDataLayout = struct([u8('instruction'), u8('decimals'), publicKey('mintAuthority'), u8('option'), publicKey('freezeAuthority')]);\n    let data = buffer.Buffer.alloc(1024);\n    {\n      const encodeLength = commandDataLayout.encode({\n        instruction: 0,\n        // InitializeMint instruction\n        decimals,\n        mintAuthority: pubkeyToBuffer(mintAuthority),\n        option: freezeAuthority === null ? 0 : 1,\n        freezeAuthority: pubkeyToBuffer(freezeAuthority || new index_browser_esm.PublicKey(0))\n      }, data);\n      data = data.slice(0, encodeLength);\n    }\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId,\n      data\n    });\n  }\n  /**\n   * Construct an InitializeAccount instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param account New account\n   * @param owner Owner of the new account\n   */\n\n\n  static createInitAccountInstruction(programId, mint, account, owner) {\n    const keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: owner,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: index_browser_esm.SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 1 // InitializeAccount instruction\n\n    }, data);\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId,\n      data\n    });\n  }\n  /**\n   * Construct a Transfer instruction\n   *\n   * @param programId SPL Token program account\n   * @param source Source account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Number of tokens to transfer\n   */\n\n\n  static createTransferInstruction(programId, source, destination, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 3,\n      // Transfer instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: source,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: destination,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct an Approve instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param delegate Account authorized to perform a transfer of tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   */\n\n\n  static createApproveInstruction(programId, account, delegate, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 4,\n      // Approve instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: delegate,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Revoke instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createRevokeInstruction(programId, account, owner, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 5 // Approve instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a SetAuthority instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param newAuthority New authority of the account\n   * @param authorityType Type of authority to set\n   * @param currentAuthority Current authority of the specified type\n   * @param multiSigners Signing accounts if `currentAuthority` is a multiSig\n   */\n\n\n  static createSetAuthorityInstruction(programId, account, newAuthority, authorityType, currentAuthority, multiSigners) {\n    const commandDataLayout = struct([u8('instruction'), u8('authorityType'), u8('option'), publicKey('newAuthority')]);\n    let data = buffer.Buffer.alloc(1024);\n    {\n      const encodeLength = commandDataLayout.encode({\n        instruction: 6,\n        // SetAuthority instruction\n        authorityType: AuthorityTypeCodes[authorityType],\n        option: newAuthority === null ? 0 : 1,\n        newAuthority: pubkeyToBuffer(newAuthority || new index_browser_esm.PublicKey(0))\n      }, data);\n      data = data.slice(0, encodeLength);\n    }\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: currentAuthority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: currentAuthority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a MintTo instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Public key of the mint\n   * @param dest Public key of the account to mint to\n   * @param authority The mint authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   */\n\n\n  static createMintToInstruction(programId, mint, dest, authority, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 7,\n      // MintTo instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Burn instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Mint for the account\n   * @param account Account to burn tokens from\n   * @param owner Owner of the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount amount to burn\n   */\n\n\n  static createBurnInstruction(programId, mint, account, owner, multiSigners, amount) {\n    const dataLayout = struct([u8('instruction'), uint64('amount')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 8,\n      // Burn instruction\n      amount: new u64(amount).toBuffer()\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Close instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to close\n   * @param dest Account to receive the remaining balance of the closed account\n   * @param authority Account Close authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createCloseAccountInstruction(programId, account, dest, owner, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 9 // CloseAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Freeze instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to freeze\n   * @param mint Mint account\n   * @param authority Mint freeze authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createFreezeAccountInstruction(programId, account, mint, authority, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 10 // FreezeAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a Thaw instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Account to thaw\n   * @param mint Mint account\n   * @param authority Mint freeze authority\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   */\n\n\n  static createThawAccountInstruction(programId, account, mint, authority, multiSigners) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 11 // ThawAccount instruction\n\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a TransferChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param source Source account\n   * @param mint Mint account\n   * @param destination Destination account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Number of tokens to transfer\n   * @param decimals Number of decimals in transfer amount\n   */\n\n\n  static createTransferCheckedInstruction(programId, source, mint, destination, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 12,\n      // TransferChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: source,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: destination,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct an ApproveChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param account Public key of the account\n   * @param mint Mint account\n   * @param delegate Account authorized to perform a transfer of tokens from the source account\n   * @param owner Owner of the source account\n   * @param multiSigners Signing accounts if `owner` is a multiSig\n   * @param amount Maximum number of tokens the delegate may transfer\n   * @param decimals Number of decimals in approve amount\n   */\n\n\n  static createApproveCheckedInstruction(programId, account, mint, delegate, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 13,\n      // ApproveChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: delegate,\n      isSigner: false,\n      isWritable: false\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a MintToChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Public key of the mint\n   * @param dest Public key of the account to mint to\n   * @param authority The mint authority\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount Amount to mint\n   * @param decimals Number of decimals in amount to mint\n   */\n\n\n  static createMintToCheckedInstruction(programId, mint, dest, authority, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 14,\n      // MintToChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: dest,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: authority,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: authority,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a BurnChecked instruction\n   *\n   * @param programId SPL Token program account\n   * @param mint Mint for the account\n   * @param account Account to burn tokens from\n   * @param owner Owner of the account\n   * @param multiSigners Signing accounts if `authority` is a multiSig\n   * @param amount amount to burn\n   */\n\n\n  static createBurnCheckedInstruction(programId, mint, account, owner, multiSigners, amount, decimals) {\n    const dataLayout = struct([u8('instruction'), uint64('amount'), u8('decimals')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 15,\n      // BurnChecked instruction\n      amount: new u64(amount).toBuffer(),\n      decimals\n    }, data);\n    let keys = [{\n      pubkey: account,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: true\n    }];\n\n    if (multiSigners.length === 0) {\n      keys.push({\n        pubkey: owner,\n        isSigner: true,\n        isWritable: false\n      });\n    } else {\n      keys.push({\n        pubkey: owner,\n        isSigner: false,\n        isWritable: false\n      });\n      multiSigners.forEach(signer => keys.push({\n        pubkey: signer.publicKey,\n        isSigner: true,\n        isWritable: false\n      }));\n    }\n\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Construct a SyncNative instruction\n   *\n   * @param programId SPL Token program account\n   * @param nativeAccount Account to sync lamports from\n   */\n\n\n  static createSyncNativeInstruction(programId, nativeAccount) {\n    const dataLayout = struct([u8('instruction')]);\n    const data = buffer.Buffer.alloc(dataLayout.span);\n    dataLayout.encode({\n      instruction: 17 // SyncNative instruction\n\n    }, data);\n    let keys = [{\n      pubkey: nativeAccount,\n      isSigner: false,\n      isWritable: true\n    }];\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: programId,\n      data\n    });\n  }\n  /**\n   * Get the address for the associated token account\n   *\n   * @param associatedProgramId SPL Associated Token program account\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param owner Owner of the new account\n   * @return Public key of the associated token account\n   */\n\n\n  static async getAssociatedTokenAddress(associatedProgramId, programId, mint, owner, allowOwnerOffCurve = false) {\n    if (!allowOwnerOffCurve && !index_browser_esm.PublicKey.isOnCurve(owner.toBuffer())) {\n      throw new Error(`Owner cannot sign: ${owner.toString()}`);\n    }\n\n    return (await index_browser_esm.PublicKey.findProgramAddress([owner.toBuffer(), programId.toBuffer(), mint.toBuffer()], associatedProgramId))[0];\n  }\n  /**\n   * Construct the AssociatedTokenProgram instruction to create the associated\n   * token account\n   *\n   * @param associatedProgramId SPL Associated Token program account\n   * @param programId SPL Token program account\n   * @param mint Token mint account\n   * @param associatedAccount New associated account\n   * @param owner Owner of the new account\n   * @param payer Payer of fees\n   */\n\n\n  static createAssociatedTokenAccountInstruction(associatedProgramId, programId, mint, associatedAccount, owner, payer) {\n    const data = buffer.Buffer.alloc(0);\n    let keys = [{\n      pubkey: payer,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: associatedAccount,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: owner,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: mint,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: index_browser_esm.SystemProgram.programId,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: programId,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: index_browser_esm.SYSVAR_RENT_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    return new index_browser_esm.TransactionInstruction({\n      keys,\n      programId: associatedProgramId,\n      data\n    });\n  }\n\n}\n\n\n//# sourceMappingURL=index.browser.esm.js.map\n\n\n/***/ }),\n\n/***/ 6737:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Account\": function() { return /* binding */ Account; },\n  \"AddressLookupTableAccount\": function() { return /* binding */ AddressLookupTableAccount; },\n  \"AddressLookupTableInstruction\": function() { return /* binding */ AddressLookupTableInstruction; },\n  \"AddressLookupTableProgram\": function() { return /* binding */ AddressLookupTableProgram; },\n  \"Authorized\": function() { return /* binding */ Authorized; },\n  \"BLOCKHASH_CACHE_TIMEOUT_MS\": function() { return /* binding */ BLOCKHASH_CACHE_TIMEOUT_MS; },\n  \"BPF_LOADER_DEPRECATED_PROGRAM_ID\": function() { return /* binding */ BPF_LOADER_DEPRECATED_PROGRAM_ID; },\n  \"BPF_LOADER_PROGRAM_ID\": function() { return /* binding */ BPF_LOADER_PROGRAM_ID; },\n  \"BpfLoader\": function() { return /* binding */ BpfLoader; },\n  \"COMPUTE_BUDGET_INSTRUCTION_LAYOUTS\": function() { return /* binding */ COMPUTE_BUDGET_INSTRUCTION_LAYOUTS; },\n  \"ComputeBudgetInstruction\": function() { return /* binding */ ComputeBudgetInstruction; },\n  \"ComputeBudgetProgram\": function() { return /* binding */ ComputeBudgetProgram; },\n  \"Connection\": function() { return /* binding */ Connection; },\n  \"Ed25519Program\": function() { return /* binding */ Ed25519Program; },\n  \"Enum\": function() { return /* binding */ Enum; },\n  \"EpochSchedule\": function() { return /* binding */ EpochSchedule; },\n  \"FeeCalculatorLayout\": function() { return /* binding */ FeeCalculatorLayout; },\n  \"Keypair\": function() { return /* binding */ Keypair; },\n  \"LAMPORTS_PER_SOL\": function() { return /* binding */ LAMPORTS_PER_SOL; },\n  \"LOOKUP_TABLE_INSTRUCTION_LAYOUTS\": function() { return /* binding */ LOOKUP_TABLE_INSTRUCTION_LAYOUTS; },\n  \"Loader\": function() { return /* binding */ Loader; },\n  \"Lockup\": function() { return /* binding */ Lockup; },\n  \"MAX_SEED_LENGTH\": function() { return /* binding */ MAX_SEED_LENGTH; },\n  \"Message\": function() { return /* binding */ Message; },\n  \"MessageAccountKeys\": function() { return /* binding */ MessageAccountKeys; },\n  \"MessageV0\": function() { return /* binding */ MessageV0; },\n  \"NONCE_ACCOUNT_LENGTH\": function() { return /* binding */ NONCE_ACCOUNT_LENGTH; },\n  \"NonceAccount\": function() { return /* binding */ NonceAccount; },\n  \"PACKET_DATA_SIZE\": function() { return /* binding */ PACKET_DATA_SIZE; },\n  \"PUBLIC_KEY_LENGTH\": function() { return /* binding */ PUBLIC_KEY_LENGTH; },\n  \"PublicKey\": function() { return /* binding */ PublicKey; },\n  \"SIGNATURE_LENGTH_IN_BYTES\": function() { return /* binding */ SIGNATURE_LENGTH_IN_BYTES; },\n  \"SOLANA_SCHEMA\": function() { return /* binding */ SOLANA_SCHEMA; },\n  \"STAKE_CONFIG_ID\": function() { return /* binding */ STAKE_CONFIG_ID; },\n  \"STAKE_INSTRUCTION_LAYOUTS\": function() { return /* binding */ STAKE_INSTRUCTION_LAYOUTS; },\n  \"SYSTEM_INSTRUCTION_LAYOUTS\": function() { return /* binding */ SYSTEM_INSTRUCTION_LAYOUTS; },\n  \"SYSVAR_CLOCK_PUBKEY\": function() { return /* binding */ SYSVAR_CLOCK_PUBKEY; },\n  \"SYSVAR_EPOCH_SCHEDULE_PUBKEY\": function() { return /* binding */ SYSVAR_EPOCH_SCHEDULE_PUBKEY; },\n  \"SYSVAR_INSTRUCTIONS_PUBKEY\": function() { return /* binding */ SYSVAR_INSTRUCTIONS_PUBKEY; },\n  \"SYSVAR_RECENT_BLOCKHASHES_PUBKEY\": function() { return /* binding */ SYSVAR_RECENT_BLOCKHASHES_PUBKEY; },\n  \"SYSVAR_RENT_PUBKEY\": function() { return /* binding */ SYSVAR_RENT_PUBKEY; },\n  \"SYSVAR_REWARDS_PUBKEY\": function() { return /* binding */ SYSVAR_REWARDS_PUBKEY; },\n  \"SYSVAR_SLOT_HASHES_PUBKEY\": function() { return /* binding */ SYSVAR_SLOT_HASHES_PUBKEY; },\n  \"SYSVAR_SLOT_HISTORY_PUBKEY\": function() { return /* binding */ SYSVAR_SLOT_HISTORY_PUBKEY; },\n  \"SYSVAR_STAKE_HISTORY_PUBKEY\": function() { return /* binding */ SYSVAR_STAKE_HISTORY_PUBKEY; },\n  \"Secp256k1Program\": function() { return /* binding */ Secp256k1Program; },\n  \"SendTransactionError\": function() { return /* binding */ SendTransactionError; },\n  \"SolanaJSONRPCError\": function() { return /* binding */ SolanaJSONRPCError; },\n  \"SolanaJSONRPCErrorCode\": function() { return /* binding */ SolanaJSONRPCErrorCode; },\n  \"StakeAuthorizationLayout\": function() { return /* binding */ StakeAuthorizationLayout; },\n  \"StakeInstruction\": function() { return /* binding */ StakeInstruction; },\n  \"StakeProgram\": function() { return /* binding */ StakeProgram; },\n  \"Struct\": function() { return /* binding */ index_browser_esm_Struct; },\n  \"SystemInstruction\": function() { return /* binding */ SystemInstruction; },\n  \"SystemProgram\": function() { return /* binding */ SystemProgram; },\n  \"Transaction\": function() { return /* binding */ Transaction; },\n  \"TransactionExpiredBlockheightExceededError\": function() { return /* binding */ TransactionExpiredBlockheightExceededError; },\n  \"TransactionExpiredNonceInvalidError\": function() { return /* binding */ TransactionExpiredNonceInvalidError; },\n  \"TransactionExpiredTimeoutError\": function() { return /* binding */ TransactionExpiredTimeoutError; },\n  \"TransactionInstruction\": function() { return /* binding */ TransactionInstruction; },\n  \"TransactionMessage\": function() { return /* binding */ TransactionMessage; },\n  \"TransactionStatus\": function() { return /* binding */ TransactionStatus; },\n  \"VALIDATOR_INFO_KEY\": function() { return /* binding */ VALIDATOR_INFO_KEY; },\n  \"VERSION_PREFIX_MASK\": function() { return /* binding */ VERSION_PREFIX_MASK; },\n  \"VOTE_PROGRAM_ID\": function() { return /* binding */ VOTE_PROGRAM_ID; },\n  \"ValidatorInfo\": function() { return /* binding */ ValidatorInfo; },\n  \"VersionedMessage\": function() { return /* binding */ VersionedMessage; },\n  \"VersionedTransaction\": function() { return /* binding */ VersionedTransaction; },\n  \"VoteAccount\": function() { return /* binding */ VoteAccount; },\n  \"VoteAuthorizationLayout\": function() { return /* binding */ VoteAuthorizationLayout; },\n  \"VoteInit\": function() { return /* binding */ VoteInit; },\n  \"VoteInstruction\": function() { return /* binding */ VoteInstruction; },\n  \"VoteProgram\": function() { return /* binding */ VoteProgram; },\n  \"clusterApiUrl\": function() { return /* binding */ clusterApiUrl; },\n  \"sendAndConfirmRawTransaction\": function() { return /* binding */ sendAndConfirmRawTransaction; },\n  \"sendAndConfirmTransaction\": function() { return /* binding */ sendAndConfirmTransaction; }\n});\n\n// NAMESPACE OBJECT: ./node_modules/@noble/curves/esm/abstract/utils.js\nvar utils_namespaceObject = {};\n__webpack_require__.r(utils_namespaceObject);\n__webpack_require__.d(utils_namespaceObject, {\n  \"abytes\": function() { return abytes; },\n  \"bitGet\": function() { return bitGet; },\n  \"bitLen\": function() { return bitLen; },\n  \"bitMask\": function() { return bitMask; },\n  \"bitSet\": function() { return bitSet; },\n  \"bytesToHex\": function() { return utils_bytesToHex; },\n  \"bytesToNumberBE\": function() { return utils_bytesToNumberBE; },\n  \"bytesToNumberLE\": function() { return utils_bytesToNumberLE; },\n  \"concatBytes\": function() { return utils_concatBytes; },\n  \"createHmacDrbg\": function() { return createHmacDrbg; },\n  \"ensureBytes\": function() { return utils_ensureBytes; },\n  \"equalBytes\": function() { return utils_equalBytes; },\n  \"hexToBytes\": function() { return hexToBytes; },\n  \"hexToNumber\": function() { return hexToNumber; },\n  \"isBytes\": function() { return isBytes; },\n  \"numberToBytesBE\": function() { return utils_numberToBytesBE; },\n  \"numberToBytesLE\": function() { return utils_numberToBytesLE; },\n  \"numberToHexUnpadded\": function() { return numberToHexUnpadded; },\n  \"numberToVarBytesBE\": function() { return numberToVarBytesBE; },\n  \"utf8ToBytes\": function() { return utils_utf8ToBytes; },\n  \"validateObject\": function() { return validateObject; }\n});\n\n// EXTERNAL MODULE: ./node_modules/buffer/index.js\nvar node_modules_buffer = __webpack_require__(8764);\n// EXTERNAL MODULE: ./node_modules/@noble/hashes/esm/_md.js\nvar _md = __webpack_require__(4359);\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/_u64.js\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n    let Ah = new Uint32Array(lst.length);\n    let Al = new Uint32Array(lst.length);\n    for (let i = 0; i < lst.length; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\n\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\n/* harmony default export */ var _u64 = (u64);\n//# sourceMappingURL=_u64.js.map\n// EXTERNAL MODULE: ./node_modules/@noble/hashes/esm/utils.js + 1 modules\nvar utils = __webpack_require__(6409);\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/sha512.js\n\n\n\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => _u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nclass SHA512 extends _md/* HashMD */.VR {\n    constructor() {\n        super(128, 64, 16, false);\n        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n        // Also looks cleaner and easier to verify with spec.\n        // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x6a09e667 | 0;\n        this.Al = 0xf3bcc908 | 0;\n        this.Bh = 0xbb67ae85 | 0;\n        this.Bl = 0x84caa73b | 0;\n        this.Ch = 0x3c6ef372 | 0;\n        this.Cl = 0xfe94f82b | 0;\n        this.Dh = 0xa54ff53a | 0;\n        this.Dl = 0x5f1d36f1 | 0;\n        this.Eh = 0x510e527f | 0;\n        this.El = 0xade682d1 | 0;\n        this.Fh = 0x9b05688c | 0;\n        this.Fl = 0x2b3e6c1f | 0;\n        this.Gh = 0x1f83d9ab | 0;\n        this.Gl = 0xfb41bd6b | 0;\n        this.Hh = 0x5be0cd19 | 0;\n        this.Hl = 0x137e2179 | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = _u64.rotrSH(W15h, W15l, 1) ^ _u64.rotrSH(W15h, W15l, 8) ^ _u64.shrSH(W15h, W15l, 7);\n            const s0l = _u64.rotrSL(W15h, W15l, 1) ^ _u64.rotrSL(W15h, W15l, 8) ^ _u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = _u64.rotrSH(W2h, W2l, 19) ^ _u64.rotrBH(W2h, W2l, 61) ^ _u64.shrSH(W2h, W2l, 6);\n            const s1l = _u64.rotrSL(W2h, W2l, 19) ^ _u64.rotrBL(W2h, W2l, 61) ^ _u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = _u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = _u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = _u64.rotrSH(Eh, El, 14) ^ _u64.rotrSH(Eh, El, 18) ^ _u64.rotrBH(Eh, El, 41);\n            const sigma1l = _u64.rotrSL(Eh, El, 14) ^ _u64.rotrSL(Eh, El, 18) ^ _u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = _u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = _u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = _u64.rotrSH(Ah, Al, 28) ^ _u64.rotrBH(Ah, Al, 34) ^ _u64.rotrBH(Ah, Al, 39);\n            const sigma0l = _u64.rotrSL(Ah, Al, 28) ^ _u64.rotrBL(Ah, Al, 34) ^ _u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = _u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = _u64.add3L(T1l, sigma0l, MAJl);\n            Ah = _u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = _u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = _u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = _u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = _u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = _u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = _u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = _u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = _u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        SHA512_W_H.fill(0);\n        SHA512_W_L.fill(0);\n    }\n    destroy() {\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nclass SHA512_224 extends (/* unused pure expression or super */ null && (SHA512)) {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x8c3d37c8 | 0;\n        this.Al = 0x19544da2 | 0;\n        this.Bh = 0x73e19966 | 0;\n        this.Bl = 0x89dcd4d6 | 0;\n        this.Ch = 0x1dfab7ae | 0;\n        this.Cl = 0x32ff9c82 | 0;\n        this.Dh = 0x679dd514 | 0;\n        this.Dl = 0x582f9fcf | 0;\n        this.Eh = 0x0f6d2b69 | 0;\n        this.El = 0x7bd44da8 | 0;\n        this.Fh = 0x77e36f73 | 0;\n        this.Fl = 0x04c48942 | 0;\n        this.Gh = 0x3f9d85a8 | 0;\n        this.Gl = 0x6a1d36c8 | 0;\n        this.Hh = 0x1112e6ad | 0;\n        this.Hl = 0x91d692a1 | 0;\n        this.outputLen = 28;\n    }\n}\nclass SHA512_256 extends (/* unused pure expression or super */ null && (SHA512)) {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x22312194 | 0;\n        this.Al = 0xfc2bf72c | 0;\n        this.Bh = 0x9f555fa3 | 0;\n        this.Bl = 0xc84c64c2 | 0;\n        this.Ch = 0x2393b86b | 0;\n        this.Cl = 0x6f53b151 | 0;\n        this.Dh = 0x96387719 | 0;\n        this.Dl = 0x5940eabd | 0;\n        this.Eh = 0x96283ee2 | 0;\n        this.El = 0xa88effe3 | 0;\n        this.Fh = 0xbe5e1e25 | 0;\n        this.Fl = 0x53863992 | 0;\n        this.Gh = 0x2b0199fc | 0;\n        this.Gl = 0x2c85b8aa | 0;\n        this.Hh = 0x0eb72ddc | 0;\n        this.Hl = 0x81c52ca2 | 0;\n        this.outputLen = 32;\n    }\n}\nclass SHA384 extends (/* unused pure expression or super */ null && (SHA512)) {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0xcbbb9d5d | 0;\n        this.Al = 0xc1059ed8 | 0;\n        this.Bh = 0x629a292a | 0;\n        this.Bl = 0x367cd507 | 0;\n        this.Ch = 0x9159015a | 0;\n        this.Cl = 0x3070dd17 | 0;\n        this.Dh = 0x152fecd8 | 0;\n        this.Dl = 0xf70e5939 | 0;\n        this.Eh = 0x67332667 | 0;\n        this.El = 0xffc00b31 | 0;\n        this.Fh = 0x8eb44a87 | 0;\n        this.Fl = 0x68581511 | 0;\n        this.Gh = 0xdb0c2e0d | 0;\n        this.Gl = 0x64f98fa7 | 0;\n        this.Hh = 0x47b5481d | 0;\n        this.Hl = 0xbefa4fa4 | 0;\n        this.outputLen = 48;\n    }\n}\nconst sha512_sha512 = /* @__PURE__ */ (0,utils/* wrapConstructor */.hE)(() => new SHA512());\nconst sha512_224 = /* @__PURE__ */ (/* unused pure expression or super */ null && (wrapConstructor(() => new SHA512_224())));\nconst sha512_256 = /* @__PURE__ */ (/* unused pure expression or super */ null && (wrapConstructor(() => new SHA512_256())));\nconst sha384 = /* @__PURE__ */ (/* unused pure expression or super */ null && (wrapConstructor(() => new SHA384())));\n//# sourceMappingURL=sha512.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/abstract/utils.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction abytes(item) {\n    if (!isBytes(item))\n        throw new Error('Uint8Array expected');\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nfunction utils_bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nfunction numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nfunction hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nfunction utils_bytesToNumberBE(bytes) {\n    return hexToNumber(utils_bytesToHex(bytes));\n}\nfunction utils_bytesToNumberLE(bytes) {\n    abytes(bytes);\n    return hexToNumber(utils_bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nfunction utils_numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nfunction utils_numberToBytesLE(n, len) {\n    return utils_numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nfunction numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nfunction utils_ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (isBytes(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nfunction utils_concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// Compares 2 u8a-s in kinda constant time\nfunction utils_equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nfunction utils_utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nfunction bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nfunction bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nfunction bitSet(n, pos, value) {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nconst bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nfunction createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return utils_concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nfunction validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/abstract/modular.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\n\n// prettier-ignore\nconst modular_0n = BigInt(0), modular_1n = BigInt(1), modular_2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nfunction modular_mod(a, b) {\n    const result = a % b;\n    return result >= modular_0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nfunction pow(num, power, modulo) {\n    if (modulo <= modular_0n || power < modular_0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === modular_1n)\n        return modular_0n;\n    let res = modular_1n;\n    while (power > modular_0n) {\n        if (power & modular_1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= modular_1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nfunction modular_pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > modular_0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nfunction invert(number, modulo) {\n    if (number === modular_0n || modulo <= modular_0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = modular_mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = modular_0n, y = modular_1n, u = modular_1n, v = modular_0n;\n    while (a !== modular_0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== modular_1n)\n        throw new Error('invert: does not exist');\n    return modular_mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nfunction tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - modular_1n) / modular_2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - modular_1n, S = 0; Q % modular_2n === modular_0n; Q /= modular_2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = modular_2n; Z < P && pow(Z, legendreC, P) !== P - modular_1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + modular_1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + modular_1n) / modular_2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, modular_1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nfunction FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + modular_1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, modular_2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, modular_2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nconst modular_isNegativeLE = (num, modulo) => (modular_mod(num, modulo) & modular_1n) === modular_1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nfunction validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nfunction FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < modular_0n)\n        throw new Error('Expected power > 0');\n    if (power === modular_0n)\n        return f.ONE;\n    if (power === modular_1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > modular_0n) {\n        if (power & modular_1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= modular_1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nfunction FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nfunction FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nfunction FpIsSquare(f) {\n    const legendreConst = (f.ORDER - modular_1n) / modular_2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nfunction nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nfunction Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= modular_0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: modular_0n,\n        ONE: modular_1n,\n        create: (num) => modular_mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return modular_0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === modular_0n,\n        isOdd: (num) => (num & modular_1n) === modular_1n,\n        neg: (num) => modular_mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => modular_mod(num * num, ORDER),\n        add: (lhs, rhs) => modular_mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => modular_mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => modular_mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => modular_mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? utils_numberToBytesLE(num, BYTES) : utils_numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? utils_bytesToNumberLE(bytes) : utils_bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nfunction FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nfunction modular_FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nfunction hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return modular_mod(num, groupOrder - modular_1n) + modular_1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nfunction getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nfunction getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nfunction mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n    const num = isLE ? utils_bytesToNumberBE(key) : utils_bytesToNumberLE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = modular_mod(num, fieldOrder - modular_1n) + modular_1n;\n    return isLE ? utils_numberToBytesLE(reduced, fieldLen) : utils_numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/abstract/curve.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\n\n\nconst curve_0n = BigInt(0);\nconst curve_1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nfunction wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > curve_0n) {\n                if (n & curve_1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= curve_1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += curve_1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nfunction validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/abstract/edwards.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²\n\n\n\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst edwards_0n = BigInt(0), edwards_1n = BigInt(1), edwards_2n = BigInt(2), edwards_8n = BigInt(8);\n// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\nconst VERIFY_DEFAULT = { zip215: true };\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    validateObject(curve, {\n        hash: 'function',\n        a: 'bigint',\n        d: 'bigint',\n        randomBytes: 'function',\n    }, {\n        adjustScalarBytes: 'function',\n        domain: 'function',\n        uvRatio: 'function',\n        mapToCurve: 'function',\n    });\n    // Set defaults\n    return Object.freeze({ ...opts });\n}\n// It is not generic twisted curve for now, but ed25519/ed448 generic implementation\nfunction edwards_twistedEdwards(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER, prehash: prehash, hash: cHash, randomBytes, nByteLength, h: cofactor, } = CURVE;\n    const MASK = edwards_2n << (BigInt(nByteLength * 8) - edwards_1n);\n    const modP = Fp.create; // Function overrides\n    // sqrt(u/v)\n    const uvRatio = CURVE.uvRatio ||\n        ((u, v) => {\n            try {\n                return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };\n            }\n            catch (e) {\n                return { isValid: false, value: edwards_0n };\n            }\n        });\n    const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP\n    const domain = CURVE.domain ||\n        ((data, ctx, phflag) => {\n            if (ctx.length || phflag)\n                throw new Error('Contexts/pre-hash are not supported');\n            return data;\n        }); // NOOP\n    const inBig = (n) => typeof n === 'bigint' && edwards_0n < n; // n in [1..]\n    const inRange = (n, max) => inBig(n) && inBig(max) && n < max; // n in [1..max-1]\n    const in0MaskRange = (n) => n === edwards_0n || inRange(n, MASK); // n in [0..MASK-1]\n    function assertInRange(n, max) {\n        // n in [1..max-1]\n        if (inRange(n, max))\n            return n;\n        throw new Error(`Expected valid scalar < ${max}, got ${typeof n} ${n}`);\n    }\n    function assertGE0(n) {\n        // n in [0..CURVE_ORDER-1]\n        return n === edwards_0n ? n : assertInRange(n, CURVE_ORDER); // GE = prime subgroup, not full group\n    }\n    const pointPrecomputes = new Map();\n    function isPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ExtendedPoint expected');\n    }\n    // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).\n    // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n    class Point {\n        constructor(ex, ey, ez, et) {\n            this.ex = ex;\n            this.ey = ey;\n            this.ez = ez;\n            this.et = et;\n            if (!in0MaskRange(ex))\n                throw new Error('x required');\n            if (!in0MaskRange(ey))\n                throw new Error('y required');\n            if (!in0MaskRange(ez))\n                throw new Error('z required');\n            if (!in0MaskRange(et))\n                throw new Error('t required');\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        static fromAffine(p) {\n            if (p instanceof Point)\n                throw new Error('extended point not allowed');\n            const { x, y } = p || {};\n            if (!in0MaskRange(x) || !in0MaskRange(y))\n                throw new Error('invalid affine point');\n            return new Point(x, y, edwards_1n, modP(x * y));\n        }\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.ez));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // Not required for fromHex(), which always creates valid points.\n        // Could be useful for fromAffine().\n        assertValidity() {\n            const { a, d } = CURVE;\n            if (this.is0())\n                throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n            // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n            // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX² + Y²)Z² = Z⁴ + dX²Y²\n            const { ex: X, ey: Y, ez: Z, et: T } = this;\n            const X2 = modP(X * X); // X²\n            const Y2 = modP(Y * Y); // Y²\n            const Z2 = modP(Z * Z); // Z²\n            const Z4 = modP(Z2 * Z2); // Z⁴\n            const aX2 = modP(X2 * a); // aX²\n            const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n            const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n            if (left !== right)\n                throw new Error('bad point: equation left != right (1)');\n            // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n            const XY = modP(X * Y);\n            const ZT = modP(Z * T);\n            if (XY !== ZT)\n                throw new Error('bad point: equation left != right (2)');\n        }\n        // Compare one point to another.\n        equals(other) {\n            isPoint(other);\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2 } = other;\n            const X1Z2 = modP(X1 * Z2);\n            const X2Z1 = modP(X2 * Z1);\n            const Y1Z2 = modP(Y1 * Z2);\n            const Y2Z1 = modP(Y2 * Z1);\n            return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        negate() {\n            // Flips point sign to a negative one (-x, y in affine coords)\n            return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));\n        }\n        // Fast algo for doubling Extended Point.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n        // Cost: 4M + 4S + 1*a + 6add + 1*2.\n        double() {\n            const { a } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const A = modP(X1 * X1); // A = X12\n            const B = modP(Y1 * Y1); // B = Y12\n            const C = modP(edwards_2n * modP(Z1 * Z1)); // C = 2*Z12\n            const D = modP(a * A); // D = a*A\n            const x1y1 = X1 + Y1;\n            const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n            const G = D + B; // G = D+B\n            const F = G - C; // F = G-C\n            const H = D - B; // H = D-B\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        // Fast algo for adding 2 Extended Points.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n        // Cost: 9M + 1*a + 1*d + 7add.\n        add(other) {\n            isPoint(other);\n            const { a, d } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;\n            // Faster algo for adding 2 Extended Points when curve's a=-1.\n            // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4\n            // Cost: 8M + 8add + 2*2.\n            // Note: It does not check whether the `other` point is valid.\n            if (a === BigInt(-1)) {\n                const A = modP((Y1 - X1) * (Y2 + X2));\n                const B = modP((Y1 + X1) * (Y2 - X2));\n                const F = modP(B - A);\n                if (F === edwards_0n)\n                    return this.double(); // Same point. Tests say it doesn't affect timing\n                const C = modP(Z1 * edwards_2n * T2);\n                const D = modP(T1 * edwards_2n * Z2);\n                const E = D + C;\n                const G = B + A;\n                const H = D - C;\n                const X3 = modP(E * F);\n                const Y3 = modP(G * H);\n                const T3 = modP(E * H);\n                const Z3 = modP(F * G);\n                return new Point(X3, Y3, Z3, T3);\n            }\n            const A = modP(X1 * X2); // A = X1*X2\n            const B = modP(Y1 * Y2); // B = Y1*Y2\n            const C = modP(T1 * d * T2); // C = T1*d*T2\n            const D = modP(Z1 * Z2); // D = Z1*Z2\n            const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n            const F = D - C; // F = D-C\n            const G = D + C; // G = D+C\n            const H = modP(B - a * A); // H = B-a*A\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, Point.normalizeZ);\n        }\n        // Constant-time multiplication.\n        multiply(scalar) {\n            const { p, f } = this.wNAF(assertInRange(scalar, CURVE_ORDER));\n            return Point.normalizeZ([p, f])[0];\n        }\n        // Non-constant-time multiplication. Uses double-and-add algorithm.\n        // It's faster, but should only be used when you don't care about\n        // an exposed private key e.g. sig verification.\n        // Does NOT allow scalars higher than CURVE.n.\n        multiplyUnsafe(scalar) {\n            let n = assertGE0(scalar); // 0 <= scalar < CURVE.n\n            if (n === edwards_0n)\n                return I;\n            if (this.equals(I) || n === edwards_1n)\n                return this;\n            if (this.equals(G))\n                return this.wNAF(n).p;\n            return wnaf.unsafeLadder(this, n);\n        }\n        // Checks if point is of small order.\n        // If you add something to small order point, you will have \"dirty\"\n        // point with torsion component.\n        // Multiplies point by cofactor and checks if the result is 0.\n        isSmallOrder() {\n            return this.multiplyUnsafe(cofactor).is0();\n        }\n        // Multiplies point by curve order and checks if the result is 0.\n        // Returns `false` is the point is dirty.\n        isTorsionFree() {\n            return wnaf.unsafeLadder(this, CURVE_ORDER).is0();\n        }\n        // Converts Extended point to default (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        toAffine(iz) {\n            const { ex: x, ey: y, ez: z } = this;\n            const is0 = this.is0();\n            if (iz == null)\n                iz = is0 ? edwards_8n : Fp.inv(z); // 8 was chosen arbitrarily\n            const ax = modP(x * iz);\n            const ay = modP(y * iz);\n            const zz = modP(z * iz);\n            if (is0)\n                return { x: edwards_0n, y: edwards_1n };\n            if (zz !== edwards_1n)\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        clearCofactor() {\n            const { h: cofactor } = CURVE;\n            if (cofactor === edwards_1n)\n                return this;\n            return this.multiplyUnsafe(cofactor);\n        }\n        // Converts hash string or Uint8Array to Point.\n        // Uses algo from RFC8032 5.1.3.\n        static fromHex(hex, zip215 = false) {\n            const { d, a } = CURVE;\n            const len = Fp.BYTES;\n            hex = utils_ensureBytes('pointHex', hex, len); // copy hex to a new array\n            const normed = hex.slice(); // copy again, we'll manipulate it\n            const lastByte = hex[len - 1]; // select last byte\n            normed[len - 1] = lastByte & ~0x80; // clear last bit\n            const y = utils_bytesToNumberLE(normed);\n            if (y === edwards_0n) {\n                // y=0 is allowed\n            }\n            else {\n                // RFC8032 prohibits >= p, but ZIP215 doesn't\n                if (zip215)\n                    assertInRange(y, MASK); // zip215=true [1..P-1] (2^255-19-1 for ed25519)\n                else\n                    assertInRange(y, Fp.ORDER); // zip215=false [1..MASK-1] (2^256-1 for ed25519)\n            }\n            // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n            // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n            const y2 = modP(y * y); // denominator is always non-0 mod p.\n            const u = modP(y2 - edwards_1n); // u = y² - 1\n            const v = modP(d * y2 - a); // v = d y² + 1.\n            let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n            if (!isValid)\n                throw new Error('Point.fromHex: invalid y coordinate');\n            const isXOdd = (x & edwards_1n) === edwards_1n; // There are 2 square roots. Use x_0 bit to select proper\n            const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n            if (!zip215 && x === edwards_0n && isLastByteOdd)\n                // if x=0 and x_0 = 1, fail\n                throw new Error('Point.fromHex: x=0 and x_0=1');\n            if (isLastByteOdd !== isXOdd)\n                x = modP(-x); // if x_0 != x mod 2, set x = p-x\n            return Point.fromAffine({ x, y });\n        }\n        static fromPrivateKey(privKey) {\n            return getExtendedPublicKey(privKey).point;\n        }\n        toRawBytes() {\n            const { x, y } = this.toAffine();\n            const bytes = utils_numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)\n            bytes[bytes.length - 1] |= x & edwards_1n ? 0x80 : 0; // when compressing, it's enough to store y\n            return bytes; // and use the last byte to encode sign of x\n        }\n        toHex() {\n            return utils_bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, edwards_1n, modP(CURVE.Gx * CURVE.Gy));\n    Point.ZERO = new Point(edwards_0n, edwards_1n, edwards_1n, edwards_0n); // 0, 1, 1, 0\n    const { BASE: G, ZERO: I } = Point;\n    const wnaf = wNAF(Point, nByteLength * 8);\n    function modN(a) {\n        return modular_mod(a, CURVE_ORDER);\n    }\n    // Little-endian SHA512 with modulo n\n    function modN_LE(hash) {\n        return modN(utils_bytesToNumberLE(hash));\n    }\n    /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */\n    function getExtendedPublicKey(key) {\n        const len = nByteLength;\n        key = utils_ensureBytes('private key', key, len);\n        // Hash private key with curve's hash function to produce uniformingly random input\n        // Check byte lengths: ensure(64, h(ensure(32, key)))\n        const hashed = utils_ensureBytes('hashed private key', cHash(key), 2 * len);\n        const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n        const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n        const scalar = modN_LE(head); // The actual private scalar\n        const point = G.multiply(scalar); // Point on Edwards curve aka public key\n        const pointBytes = point.toRawBytes(); // Uint8Array representation\n        return { head, prefix, scalar, point, pointBytes };\n    }\n    // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared\n    function getPublicKey(privKey) {\n        return getExtendedPublicKey(privKey).pointBytes;\n    }\n    // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n    function hashDomainToScalar(context = new Uint8Array(), ...msgs) {\n        const msg = utils_concatBytes(...msgs);\n        return modN_LE(cHash(domain(msg, utils_ensureBytes('context', context), !!prehash)));\n    }\n    /** Signs message with privateKey. RFC8032 5.1.6 */\n    function sign(msg, privKey, options = {}) {\n        msg = utils_ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph etc.\n        const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);\n        const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n        const R = G.multiply(r).toRawBytes(); // R = rG\n        const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n        const s = modN(r + k * scalar); // S = (r + k * s) mod L\n        assertGE0(s); // 0 <= s < l\n        const res = utils_concatBytes(R, utils_numberToBytesLE(s, Fp.BYTES));\n        return utils_ensureBytes('result', res, nByteLength * 2); // 64-byte signature\n    }\n    const verifyOpts = VERIFY_DEFAULT;\n    function verify(sig, msg, publicKey, options = verifyOpts) {\n        const { context, zip215 } = options;\n        const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n        sig = utils_ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.\n        msg = utils_ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph, etc\n        const s = utils_bytesToNumberLE(sig.slice(len, 2 * len));\n        // zip215: true is good for consensus-critical apps and allows points < 2^256\n        // zip215: false follows RFC8032 / NIST186-5 and restricts points to CURVE.p\n        let A, R, SB;\n        try {\n            A = Point.fromHex(publicKey, zip215);\n            R = Point.fromHex(sig.slice(0, len), zip215);\n            SB = G.multiplyUnsafe(s); // 0 <= s < l is done inside\n        }\n        catch (error) {\n            return false;\n        }\n        if (!zip215 && A.isSmallOrder())\n            return false;\n        const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);\n        const RkA = R.add(A.multiplyUnsafe(k));\n        // [8][S]B = [8]R + [8][k]A'\n        return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);\n    }\n    G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n    const utils = {\n        getExtendedPublicKey,\n        // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.\n        randomPrivateKey: () => randomBytes(Fp.BYTES),\n        /**\n         * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT\n         * values. This slows down first getPublicKey() by milliseconds (see Speed section),\n         * but allows to speed-up subsequent getPublicKey() calls up to 20x.\n         * @param windowSize 2, 4, 8, 16\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3));\n            return point;\n        },\n    };\n    return {\n        CURVE,\n        getPublicKey,\n        sign,\n        verify,\n        ExtendedPoint: Point,\n        utils,\n    };\n}\n//# sourceMappingURL=edwards.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/ed25519.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n\n\n\n\n\n\n/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n */\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');\n// prettier-ignore\nconst ed25519_0n = BigInt(0), ed25519_1n = BigInt(1), ed25519_2n = BigInt(2), ed25519_3n = BigInt(3);\n// prettier-ignore\nconst ed25519_5n = BigInt(5), ed25519_8n = BigInt(8);\nfunction ed25519_pow_2_252_3(x) {\n    // prettier-ignore\n    const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n    const P = ED25519_P;\n    const x2 = (x * x) % P;\n    const b2 = (x2 * x) % P; // x^3, 11\n    const b4 = (modular_pow2(b2, ed25519_2n, P) * b2) % P; // x^15, 1111\n    const b5 = (modular_pow2(b4, ed25519_1n, P) * x) % P; // x^31\n    const b10 = (modular_pow2(b5, ed25519_5n, P) * b5) % P;\n    const b20 = (modular_pow2(b10, _10n, P) * b10) % P;\n    const b40 = (modular_pow2(b20, _20n, P) * b20) % P;\n    const b80 = (modular_pow2(b40, _40n, P) * b40) % P;\n    const b160 = (modular_pow2(b80, _80n, P) * b80) % P;\n    const b240 = (modular_pow2(b160, _80n, P) * b80) % P;\n    const b250 = (modular_pow2(b240, _10n, P) * b10) % P;\n    const pow_p_5_8 = (modular_pow2(b250, ed25519_2n, P) * x) % P;\n    // ^ To pow to (p+3)/8, multiply it by x.\n    return { pow_p_5_8, b2 };\n}\nfunction adjustScalarBytes(bytes) {\n    // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n    // set the three least significant bits of the first byte\n    bytes[0] &= 248; // 0b1111_1000\n    // and the most significant bit of the last to zero,\n    bytes[31] &= 127; // 0b0111_1111\n    // set the second most significant bit of the last byte to 1\n    bytes[31] |= 64; // 0b0100_0000\n    return bytes;\n}\n// sqrt(u/v)\nfunction uvRatio(u, v) {\n    const P = ED25519_P;\n    const v3 = modular_mod(v * v * v, P); // v³\n    const v7 = modular_mod(v3 * v3 * v, P); // v⁷\n    // (p+3)/8 and (p-5)/8\n    const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n    let x = modular_mod(u * v3 * pow, P); // (uv³)(uv⁷)^(p-5)/8\n    const vx2 = modular_mod(v * x * x, P); // vx²\n    const root1 = x; // First root candidate\n    const root2 = modular_mod(x * ED25519_SQRT_M1, P); // Second root candidate\n    const useRoot1 = vx2 === u; // If vx² = u (mod p), x is a square root\n    const useRoot2 = vx2 === modular_mod(-u, P); // If vx² = -u, set x <-- x * 2^((p-1)/4)\n    const noRoot = vx2 === modular_mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx² = -u√(-1)\n    if (useRoot1)\n        x = root1;\n    if (useRoot2 || noRoot)\n        x = root2; // We return root2 anyway, for const-time\n    if (modular_isNegativeLE(x, P))\n        x = modular_mod(-x, P);\n    return { isValid: useRoot1 || useRoot2, value: x };\n}\n// Just in case\nconst ED25519_TORSION_SUBGROUP = (/* unused pure expression or super */ null && ([\n    '0100000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n    '0000000000000000000000000000000000000000000000000000000000000080',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n    'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n    '0000000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n]));\nconst Fp = /* @__PURE__ */ (() => Field(ED25519_P, undefined, true))();\nconst ed25519Defaults = /* @__PURE__ */ (() => ({\n    // Param: a\n    a: BigInt(-1), // Fp.create(-1) is proper; our way still works and is faster\n    // d is equal to -121665/121666 over finite field.\n    // Negative number is P - number, and division is invert(number, P)\n    d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n    // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n\n    Fp,\n    // Subgroup order: how many points curve has\n    // 2n**252n + 27742317777372353535851937790883648493n;\n    n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n    // Cofactor\n    h: ed25519_8n,\n    // Base point (x, y) aka generator point\n    Gx: BigInt('15112221349535400772501151409588531511454012693041857206046113283949847762202'),\n    Gy: BigInt('46316835694926478169428394003475163141307993866256225615783033603165251855960'),\n    hash: sha512_sha512,\n    randomBytes: utils/* randomBytes */.O6,\n    adjustScalarBytes,\n    // dom2\n    // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.\n    // Constant-time, u/√v\n    uvRatio,\n}))();\nconst ed25519 = /* @__PURE__ */ (() => edwards_twistedEdwards(ed25519Defaults))();\nfunction ed25519_domain(data, ctx, phflag) {\n    if (ctx.length > 255)\n        throw new Error('Context is too big');\n    return concatBytes(utf8ToBytes('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);\n}\nconst ed25519ctx = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => twistedEdwards({\n    ...ed25519Defaults,\n    domain: ed25519_domain,\n}))()));\nconst ed25519ph = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => twistedEdwards(Object.assign({}, ed25519Defaults, {\n    domain: ed25519_domain,\n    prehash: sha512,\n})))()));\nconst x25519 = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => montgomery({\n    P: ED25519_P,\n    a: BigInt(486662),\n    montgomeryBits: 255, // n is 253 bits\n    nByteLength: 32,\n    Gu: BigInt(9),\n    powPminus2: (x) => {\n        const P = ED25519_P;\n        // x^(p-2) aka x^(2^255-21)\n        const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n        return mod(pow2(pow_p_5_8, ed25519_3n, P) * b2, P);\n    },\n    adjustScalarBytes,\n    randomBytes,\n}))()));\n/**\n * Converts ed25519 public key to x25519 public key. Uses formula:\n * * `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`\n * * `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`\n * @example\n *   const someonesPub = ed25519.getPublicKey(ed25519.utils.randomPrivateKey());\n *   const aPriv = x25519.utils.randomPrivateKey();\n *   x25519.getSharedSecret(aPriv, edwardsToMontgomeryPub(someonesPub))\n */\nfunction edwardsToMontgomeryPub(edwardsPub) {\n    const { y } = ed25519.ExtendedPoint.fromHex(edwardsPub);\n    const _1n = BigInt(1);\n    return Fp.toBytes(Fp.create((_1n + y) * Fp.inv(_1n - y)));\n}\nconst edwardsToMontgomery = (/* unused pure expression or super */ null && (edwardsToMontgomeryPub)); // deprecated\n/**\n * Converts ed25519 secret key to x25519 secret key.\n * @example\n *   const someonesPub = x25519.getPublicKey(x25519.utils.randomPrivateKey());\n *   const aPriv = ed25519.utils.randomPrivateKey();\n *   x25519.getSharedSecret(edwardsToMontgomeryPriv(aPriv), someonesPub)\n */\nfunction edwardsToMontgomeryPriv(edwardsPriv) {\n    const hashed = ed25519Defaults.hash(edwardsPriv.subarray(0, 32));\n    return ed25519Defaults.adjustScalarBytes(hashed).subarray(0, 32);\n}\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => (Fp.ORDER + ed25519_3n) / ed25519_8n)())); // 1. c1 = (q + 3) / 8       # Integer arithmetic\nconst ELL2_C2 = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => Fp.pow(ed25519_2n, ELL2_C1))())); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => Fp.sqrt(Fp.neg(Fp.ONE)))())); // 3. c3 = sqrt(-1)\n// prettier-ignore\nfunction map_to_curve_elligator2_curve25519(u) {\n    const ELL2_C4 = (Fp.ORDER - ed25519_5n) / ed25519_8n; // 4. c4 = (q - 5) / 8       # Integer arithmetic\n    const ELL2_J = BigInt(486662);\n    let tv1 = Fp.sqr(u); //  1.  tv1 = u^2\n    tv1 = Fp.mul(tv1, ed25519_2n); //  2.  tv1 = 2 * tv1\n    let xd = Fp.add(tv1, Fp.ONE); //  3.   xd = tv1 + 1         # Nonzero: -1 is square (mod p), tv1 is not\n    let x1n = Fp.neg(ELL2_J); //  4.  x1n = -J              # x1 = x1n / xd = -J / (1 + 2 * u^2)\n    let tv2 = Fp.sqr(xd); //  5.  tv2 = xd^2\n    let gxd = Fp.mul(tv2, xd); //  6.  gxd = tv2 * xd        # gxd = xd^3\n    let gx1 = Fp.mul(tv1, ELL2_J); //  7.  gx1 = J * tv1         # x1n + J * xd\n    gx1 = Fp.mul(gx1, x1n); //  8.  gx1 = gx1 * x1n       # x1n^2 + J * x1n * xd\n    gx1 = Fp.add(gx1, tv2); //  9.  gx1 = gx1 + tv2       # x1n^2 + J * x1n * xd + xd^2\n    gx1 = Fp.mul(gx1, x1n); //  10. gx1 = gx1 * x1n       # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n    let tv3 = Fp.sqr(gxd); //  11. tv3 = gxd^2\n    tv2 = Fp.sqr(tv3); //  12. tv2 = tv3^2           # gxd^4\n    tv3 = Fp.mul(tv3, gxd); //  13. tv3 = tv3 * gxd       # gxd^3\n    tv3 = Fp.mul(tv3, gx1); //  14. tv3 = tv3 * gx1       # gx1 * gxd^3\n    tv2 = Fp.mul(tv2, tv3); //  15. tv2 = tv2 * tv3       # gx1 * gxd^7\n    let y11 = Fp.pow(tv2, ELL2_C4); //  16. y11 = tv2^c4        # (gx1 * gxd^7)^((p - 5) / 8)\n    y11 = Fp.mul(y11, tv3); //  17. y11 = y11 * tv3       # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n    let y12 = Fp.mul(y11, ELL2_C3); //  18. y12 = y11 * c3\n    tv2 = Fp.sqr(y11); //  19. tv2 = y11^2\n    tv2 = Fp.mul(tv2, gxd); //  20. tv2 = tv2 * gxd\n    let e1 = Fp.eql(tv2, gx1); //  21.  e1 = tv2 == gx1\n    let y1 = Fp.cmov(y12, y11, e1); //  22.  y1 = CMOV(y12, y11, e1)  # If g(x1) is square, this is its sqrt\n    let x2n = Fp.mul(x1n, tv1); //  23. x2n = x1n * tv1       # x2 = x2n / xd = 2 * u^2 * x1n / xd\n    let y21 = Fp.mul(y11, u); //  24. y21 = y11 * u\n    y21 = Fp.mul(y21, ELL2_C2); //  25. y21 = y21 * c2\n    let y22 = Fp.mul(y21, ELL2_C3); //  26. y22 = y21 * c3\n    let gx2 = Fp.mul(gx1, tv1); //  27. gx2 = gx1 * tv1       # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n    tv2 = Fp.sqr(y21); //  28. tv2 = y21^2\n    tv2 = Fp.mul(tv2, gxd); //  29. tv2 = tv2 * gxd\n    let e2 = Fp.eql(tv2, gx2); //  30.  e2 = tv2 == gx2\n    let y2 = Fp.cmov(y22, y21, e2); //  31.  y2 = CMOV(y22, y21, e2)  # If g(x2) is square, this is its sqrt\n    tv2 = Fp.sqr(y1); //  32. tv2 = y1^2\n    tv2 = Fp.mul(tv2, gxd); //  33. tv2 = tv2 * gxd\n    let e3 = Fp.eql(tv2, gx1); //  34.  e3 = tv2 == gx1\n    let xn = Fp.cmov(x2n, x1n, e3); //  35.  xn = CMOV(x2n, x1n, e3)  # If e3, x = x1, else x = x2\n    let y = Fp.cmov(y2, y1, e3); //  36.   y = CMOV(y2, y1, e3)    # If e3, y = y1, else y = y2\n    let e4 = Fp.isOdd(y); //  37.  e4 = sgn0(y) == 1        # Fix sign of y\n    y = Fp.cmov(y, Fp.neg(y), e3 !== e4); //  38.   y = CMOV(y, -y, e3 XOR e4)\n    return { xMn: xn, xMd: xd, yMn: y, yMd: ed25519_1n }; //  39. return (xn, xd, y, 1)\n}\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))())); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u) {\n    const { xMn, xMd, yMn, yMd } = map_to_curve_elligator2_curve25519(u); //  1.  (xMn, xMd, yMn, yMd) =\n    // map_to_curve_elligator2_curve25519(u)\n    let xn = Fp.mul(xMn, yMd); //  2.  xn = xMn * yMd\n    xn = Fp.mul(xn, ELL2_C1_EDWARDS); //  3.  xn = xn * c1\n    let xd = Fp.mul(xMd, yMn); //  4.  xd = xMd * yMn    # xn / xd = c1 * xM / yM\n    let yn = Fp.sub(xMn, xMd); //  5.  yn = xMn - xMd\n    let yd = Fp.add(xMn, xMd); //  6.  yd = xMn + xMd    # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n    let tv1 = Fp.mul(xd, yd); //  7. tv1 = xd * yd\n    let e = Fp.eql(tv1, Fp.ZERO); //  8.   e = tv1 == 0\n    xn = Fp.cmov(xn, Fp.ZERO, e); //  9.  xn = CMOV(xn, 0, e)\n    xd = Fp.cmov(xd, Fp.ONE, e); //  10. xd = CMOV(xd, 1, e)\n    yn = Fp.cmov(yn, Fp.ONE, e); //  11. yn = CMOV(yn, 1, e)\n    yd = Fp.cmov(yd, Fp.ONE, e); //  12. yd = CMOV(yd, 1, e)\n    const inv = Fp.invertBatch([xd, yd]); // batch division\n    return { x: Fp.mul(xn, inv[0]), y: Fp.mul(yn, inv[1]) }; //  13. return (xn, xd, yn, yd)\n}\nconst htf = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => createHasher(ed25519.ExtendedPoint, (scalars) => map_to_curve_elligator2_edwards25519(scalars[0]), {\n    DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n    encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n    p: Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha512,\n}))()));\nconst hashToCurve = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => htf.hashToCurve)()));\nconst encodeToCurve = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => htf.encodeToCurve)()));\nfunction assertRstPoint(other) {\n    if (!(other instanceof RistPoint))\n        throw new Error('RistrettoPoint expected');\n}\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst SQRT_M1 = (/* unused pure expression or super */ null && (ED25519_SQRT_M1));\n// √(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ (/* unused pure expression or super */ null && (BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235')));\n// 1 / √(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ (/* unused pure expression or super */ null && (BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578')));\n// 1-d²\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ (/* unused pure expression or super */ null && (BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838')));\n// (d-1)²\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ (/* unused pure expression or super */ null && (BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952')));\n// Calculates 1/√(number)\nconst invertSqrt = (number) => uvRatio(ed25519_1n, number);\nconst MAX_255B = /* @__PURE__ */ (/* unused pure expression or super */ null && (BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff')));\nconst bytes255ToNumberLE = (bytes) => ed25519.CURVE.Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n// Computes Elligator map for Ristretto\n// https://ristretto.group/formulas/elligator.html\nfunction calcElligatorRistrettoMap(r0) {\n    const { d } = ed25519.CURVE;\n    const P = ed25519.CURVE.Fp.ORDER;\n    const mod = ed25519.CURVE.Fp.create;\n    const r = mod(SQRT_M1 * r0 * r0); // 1\n    const Ns = mod((r + ed25519_1n) * ONE_MINUS_D_SQ); // 2\n    let c = BigInt(-1); // 3\n    const D = mod((c - d * r) * mod(r + d)); // 4\n    let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n    let s_ = mod(s * r0); // 6\n    if (!isNegativeLE(s_, P))\n        s_ = mod(-s_);\n    if (!Ns_D_is_sq)\n        s = s_; // 7\n    if (!Ns_D_is_sq)\n        c = r; // 8\n    const Nt = mod(c * (r - ed25519_1n) * D_MINUS_ONE_SQ - D); // 9\n    const s2 = s * s;\n    const W0 = mod((s + s) * D); // 10\n    const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n    const W2 = mod(ed25519_1n - s2); // 12\n    const W3 = mod(ed25519_1n + s2); // 13\n    return new ed25519.ExtendedPoint(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n/**\n * Each ed25519/ExtendedPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like ExtendedPoint,\n * but it should work in its own namespace: do not combine those two.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-ristretto255-decaf448\n */\nclass RistPoint {\n    // Private property to discourage combining ExtendedPoint + RistrettoPoint\n    // Always use Ristretto encoding/decoding instead.\n    constructor(ep) {\n        this.ep = ep;\n    }\n    static fromAffine(ap) {\n        return new RistPoint(ed25519.ExtendedPoint.fromAffine(ap));\n    }\n    /**\n     * Takes uniform output of 64-byte hash function like sha512 and converts it to `RistrettoPoint`.\n     * The hash-to-group operation applies Elligator twice and adds the results.\n     * **Note:** this is one-way map, there is no conversion from point to hash.\n     * https://ristretto.group/formulas/elligator.html\n     * @param hex 64-byte output of a hash function\n     */\n    static hashToCurve(hex) {\n        hex = ensureBytes('ristrettoHash', hex, 64);\n        const r1 = bytes255ToNumberLE(hex.slice(0, 32));\n        const R1 = calcElligatorRistrettoMap(r1);\n        const r2 = bytes255ToNumberLE(hex.slice(32, 64));\n        const R2 = calcElligatorRistrettoMap(r2);\n        return new RistPoint(R1.add(R2));\n    }\n    /**\n     * Converts ristretto-encoded string to ristretto point.\n     * https://ristretto.group/formulas/decoding.html\n     * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n     */\n    static fromHex(hex) {\n        hex = ensureBytes('ristrettoHex', hex, 32);\n        const { a, d } = ed25519.CURVE;\n        const P = ed25519.CURVE.Fp.ORDER;\n        const mod = ed25519.CURVE.Fp.create;\n        const emsg = 'RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint';\n        const s = bytes255ToNumberLE(hex);\n        // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n        // 3. Check that s is non-negative, or else abort\n        if (!equalBytes(numberToBytesLE(s, 32), hex) || isNegativeLE(s, P))\n            throw new Error(emsg);\n        const s2 = mod(s * s);\n        const u1 = mod(ed25519_1n + a * s2); // 4 (a is -1)\n        const u2 = mod(ed25519_1n - a * s2); // 5\n        const u1_2 = mod(u1 * u1);\n        const u2_2 = mod(u2 * u2);\n        const v = mod(a * d * u1_2 - u2_2); // 6\n        const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n        const Dx = mod(I * u2); // 8\n        const Dy = mod(I * Dx * v); // 9\n        let x = mod((s + s) * Dx); // 10\n        if (isNegativeLE(x, P))\n            x = mod(-x); // 10\n        const y = mod(u1 * Dy); // 11\n        const t = mod(x * y); // 12\n        if (!isValid || isNegativeLE(t, P) || y === ed25519_0n)\n            throw new Error(emsg);\n        return new RistPoint(new ed25519.ExtendedPoint(x, y, ed25519_1n, t));\n    }\n    /**\n     * Encodes ristretto point to Uint8Array.\n     * https://ristretto.group/formulas/encoding.html\n     */\n    toRawBytes() {\n        let { ex: x, ey: y, ez: z, et: t } = this.ep;\n        const P = ed25519.CURVE.Fp.ORDER;\n        const mod = ed25519.CURVE.Fp.create;\n        const u1 = mod(mod(z + y) * mod(z - y)); // 1\n        const u2 = mod(x * y); // 2\n        // Square root always exists\n        const u2sq = mod(u2 * u2);\n        const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n        const D1 = mod(invsqrt * u1); // 4\n        const D2 = mod(invsqrt * u2); // 5\n        const zInv = mod(D1 * D2 * t); // 6\n        let D; // 7\n        if (isNegativeLE(t * zInv, P)) {\n            let _x = mod(y * SQRT_M1);\n            let _y = mod(x * SQRT_M1);\n            x = _x;\n            y = _y;\n            D = mod(D1 * INVSQRT_A_MINUS_D);\n        }\n        else {\n            D = D2; // 8\n        }\n        if (isNegativeLE(x * zInv, P))\n            y = mod(-y); // 9\n        let s = mod((z - y) * D); // 10 (check footer's note, no sqrt(-a))\n        if (isNegativeLE(s, P))\n            s = mod(-s);\n        return numberToBytesLE(s, 32); // 11\n    }\n    toHex() {\n        return bytesToHex(this.toRawBytes());\n    }\n    toString() {\n        return this.toHex();\n    }\n    // Compare one point to another.\n    equals(other) {\n        assertRstPoint(other);\n        const { ex: X1, ey: Y1 } = this.ep;\n        const { ex: X2, ey: Y2 } = other.ep;\n        const mod = ed25519.CURVE.Fp.create;\n        // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n        const one = mod(X1 * Y2) === mod(Y1 * X2);\n        const two = mod(Y1 * Y2) === mod(X1 * X2);\n        return one || two;\n    }\n    add(other) {\n        assertRstPoint(other);\n        return new RistPoint(this.ep.add(other.ep));\n    }\n    subtract(other) {\n        assertRstPoint(other);\n        return new RistPoint(this.ep.subtract(other.ep));\n    }\n    multiply(scalar) {\n        return new RistPoint(this.ep.multiply(scalar));\n    }\n    multiplyUnsafe(scalar) {\n        return new RistPoint(this.ep.multiplyUnsafe(scalar));\n    }\n    double() {\n        return new RistPoint(this.ep.double());\n    }\n    negate() {\n        return new RistPoint(this.ep.negate());\n    }\n}\nconst RistrettoPoint = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => {\n    if (!RistPoint.BASE)\n        RistPoint.BASE = new RistPoint(ed25519.ExtendedPoint.BASE);\n    if (!RistPoint.ZERO)\n        RistPoint.ZERO = new RistPoint(ed25519.ExtendedPoint.ZERO);\n    return RistPoint;\n})()));\n// Hashing to ristretto255. https://www.rfc-editor.org/rfc/rfc9380#appendix-B\nconst hashToRistretto255 = (msg, options) => {\n    const d = options.DST;\n    const DST = typeof d === 'string' ? utf8ToBytes(d) : d;\n    const uniform_bytes = expand_message_xmd(msg, DST, 64, sha512);\n    const P = RistPoint.hashToCurve(uniform_bytes);\n    return P;\n};\nconst hash_to_ristretto255 = (/* unused pure expression or super */ null && (hashToRistretto255)); // legacy\n//# sourceMappingURL=ed25519.js.map\n// EXTERNAL MODULE: ./node_modules/bn.js/lib/bn.js\nvar bn = __webpack_require__(3550);\nvar bn_default = /*#__PURE__*/__webpack_require__.n(bn);\n// EXTERNAL MODULE: ./node_modules/@solana/web3.js/node_modules/bs58/index.js\nvar bs58 = __webpack_require__(11);\nvar bs58_default = /*#__PURE__*/__webpack_require__.n(bs58);\n// EXTERNAL MODULE: ./node_modules/@noble/hashes/esm/sha256.js\nvar esm_sha256 = __webpack_require__(7748);\n// EXTERNAL MODULE: ./node_modules/borsh/lib/index.js\nvar lib = __webpack_require__(5532);\n// EXTERNAL MODULE: ./node_modules/@solana/buffer-layout/lib/Layout.js\nvar Layout = __webpack_require__(9386);\n// EXTERNAL MODULE: ./node_modules/bigint-buffer/dist/browser.js\nvar browser = __webpack_require__(475);\n;// CONCATENATED MODULE: ./node_modules/@solana/web3.js/node_modules/superstruct/dist/index.mjs\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n    constructor(failure, failures) {\n        let cached;\n        const { message, explanation, ...rest } = failure;\n        const { path } = failure;\n        const msg = path.length === 0 ? message : `At path: ${path.join('.')} -- ${message}`;\n        super(explanation ?? msg);\n        if (explanation != null)\n            this.cause = msg;\n        Object.assign(this, rest);\n        this.name = this.constructor.name;\n        this.failures = () => {\n            return (cached ?? (cached = [failure, ...failures()]));\n        };\n    }\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n    return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\nfunction isObject(x) {\n    return typeof x === 'object' && x != null;\n}\n/**\n * Check if a value is a non-array object.\n */\nfunction isNonArrayObject(x) {\n    return isObject(x) && !Array.isArray(x);\n}\n/**\n * Check if a value is a plain object.\n */\nfunction isPlainObject(x) {\n    if (Object.prototype.toString.call(x) !== '[object Object]') {\n        return false;\n    }\n    const prototype = Object.getPrototypeOf(x);\n    return prototype === null || prototype === Object.prototype;\n}\n/**\n * Return a value as a printable string.\n */\nfunction print(value) {\n    if (typeof value === 'symbol') {\n        return value.toString();\n    }\n    return typeof value === 'string' ? JSON.stringify(value) : `${value}`;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\nfunction shiftIterator(input) {\n    const { done, value } = input.next();\n    return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\nfunction toFailure(result, context, struct, value) {\n    if (result === true) {\n        return;\n    }\n    else if (result === false) {\n        result = {};\n    }\n    else if (typeof result === 'string') {\n        result = { message: result };\n    }\n    const { path, branch } = context;\n    const { type } = struct;\n    const { refinement, message = `Expected a value of type \\`${type}\\`${refinement ? ` with refinement \\`${refinement}\\`` : ''}, but received: \\`${print(value)}\\``, } = result;\n    return {\n        value,\n        type,\n        refinement,\n        key: path[path.length - 1],\n        path,\n        branch,\n        ...result,\n        message,\n    };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\nfunction* toFailures(result, context, struct, value) {\n    if (!isIterable(result)) {\n        result = [result];\n    }\n    for (const r of result) {\n        const failure = toFailure(r, context, struct, value);\n        if (failure) {\n            yield failure;\n        }\n    }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\nfunction* run(value, struct, options = {}) {\n    const { path = [], branch = [value], coerce = false, mask = false } = options;\n    const ctx = { path, branch, mask };\n    if (coerce) {\n        value = struct.coercer(value, ctx);\n    }\n    let status = 'valid';\n    for (const failure of struct.validator(value, ctx)) {\n        failure.explanation = options.message;\n        status = 'not_valid';\n        yield [failure, undefined];\n    }\n    for (let [k, v, s] of struct.entries(value, ctx)) {\n        const ts = run(v, s, {\n            path: k === undefined ? path : [...path, k],\n            branch: k === undefined ? branch : [...branch, v],\n            coerce,\n            mask,\n            message: options.message,\n        });\n        for (const t of ts) {\n            if (t[0]) {\n                status = t[0].refinement != null ? 'not_refined' : 'not_valid';\n                yield [t[0], undefined];\n            }\n            else if (coerce) {\n                v = t[1];\n                if (k === undefined) {\n                    value = v;\n                }\n                else if (value instanceof Map) {\n                    value.set(k, v);\n                }\n                else if (value instanceof Set) {\n                    value.add(v);\n                }\n                else if (isObject(value)) {\n                    if (v !== undefined || k in value)\n                        value[k] = v;\n                }\n            }\n        }\n    }\n    if (status !== 'not_valid') {\n        for (const failure of struct.refiner(value, ctx)) {\n            failure.explanation = options.message;\n            status = 'not_refined';\n            yield [failure, undefined];\n        }\n    }\n    if (status === 'valid') {\n        yield [undefined, value];\n    }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\nclass Struct {\n    constructor(props) {\n        const { type, schema, validator, refiner, coercer = (value) => value, entries = function* () { }, } = props;\n        this.type = type;\n        this.schema = schema;\n        this.entries = entries;\n        this.coercer = coercer;\n        if (validator) {\n            this.validator = (value, context) => {\n                const result = validator(value, context);\n                return toFailures(result, context, this, value);\n            };\n        }\n        else {\n            this.validator = () => [];\n        }\n        if (refiner) {\n            this.refiner = (value, context) => {\n                const result = refiner(value, context);\n                return toFailures(result, context, this, value);\n            };\n        }\n        else {\n            this.refiner = () => [];\n        }\n    }\n    /**\n     * Assert that a value passes the struct's validation, throwing if it doesn't.\n     */\n    assert(value, message) {\n        return assert(value, this, message);\n    }\n    /**\n     * Create a value with the struct's coercion logic, then validate it.\n     */\n    create(value, message) {\n        return create(value, this, message);\n    }\n    /**\n     * Check if a value passes the struct's validation.\n     */\n    is(value) {\n        return is(value, this);\n    }\n    /**\n     * Mask a value, coercing and validating it, but returning only the subset of\n     * properties defined by the struct's schema. Masking applies recursively to\n     * props of `object` structs only.\n     */\n    mask(value, message) {\n        return mask(value, this, message);\n    }\n    /**\n     * Validate a value with the struct's validation logic, returning a tuple\n     * representing the result.\n     *\n     * You may optionally pass `true` for the `coerce` argument to coerce\n     * the value before attempting to validate it. If you do, the result will\n     * contain the coerced result when successful. Also, `mask` will turn on\n     * masking of the unknown `object` props recursively if passed.\n     */\n    validate(value, options = {}) {\n        return validate(value, this, options);\n    }\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\nfunction assert(value, struct, message) {\n    const result = validate(value, struct, { message });\n    if (result[0]) {\n        throw result[0];\n    }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\nfunction create(value, struct, message) {\n    const result = validate(value, struct, { coerce: true, message });\n    if (result[0]) {\n        throw result[0];\n    }\n    else {\n        return result[1];\n    }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\nfunction mask(value, struct, message) {\n    const result = validate(value, struct, { coerce: true, mask: true, message });\n    if (result[0]) {\n        throw result[0];\n    }\n    else {\n        return result[1];\n    }\n}\n/**\n * Check if a value passes a struct.\n */\nfunction is(value, struct) {\n    const result = validate(value, struct);\n    return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\nfunction validate(value, struct, options = {}) {\n    const tuples = run(value, struct, options);\n    const tuple = shiftIterator(tuples);\n    if (tuple[0]) {\n        const error = new StructError(tuple[0], function* () {\n            for (const t of tuples) {\n                if (t[0]) {\n                    yield t[0];\n                }\n            }\n        });\n        return [error, undefined];\n    }\n    else {\n        const v = tuple[1];\n        return [undefined, v];\n    }\n}\n\nfunction dist_assign(...Structs) {\n    const isType = Structs[0].type === 'type';\n    const schemas = Structs.map((s) => s.schema);\n    const schema = Object.assign({}, ...schemas);\n    return isType ? type(schema) : object(schema);\n}\n/**\n * Define a new struct type with a custom validation function.\n */\nfunction dist_define(name, validator) {\n    return new Struct({ type: name, schema: null, validator });\n}\n/**\n * Create a new struct based on an existing struct, but the value is allowed to\n * be `undefined`. `log` will be called if the value is not `undefined`.\n */\nfunction deprecated(struct, log) {\n    return new Struct({\n        ...struct,\n        refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx),\n        validator(value, ctx) {\n            if (value === undefined) {\n                return true;\n            }\n            else {\n                log(value, ctx);\n                return struct.validator(value, ctx);\n            }\n        },\n    });\n}\n/**\n * Create a struct with dynamic validation logic.\n *\n * The callback will receive the value currently being validated, and must\n * return a struct object to validate it with. This can be useful to model\n * validation logic that changes based on its input.\n */\nfunction dynamic(fn) {\n    return new Struct({\n        type: 'dynamic',\n        schema: null,\n        *entries(value, ctx) {\n            const struct = fn(value, ctx);\n            yield* struct.entries(value, ctx);\n        },\n        validator(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.validator(value, ctx);\n        },\n        coercer(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.coercer(value, ctx);\n        },\n        refiner(value, ctx) {\n            const struct = fn(value, ctx);\n            return struct.refiner(value, ctx);\n        },\n    });\n}\n/**\n * Create a struct with lazily evaluated validation logic.\n *\n * The first time validation is run with the struct, the callback will be called\n * and must return a struct object to use. This is useful for cases where you\n * want to have self-referential structs for nested data structures to avoid a\n * circular definition problem.\n */\nfunction lazy(fn) {\n    let struct;\n    return new Struct({\n        type: 'lazy',\n        schema: null,\n        *entries(value, ctx) {\n            struct ?? (struct = fn());\n            yield* struct.entries(value, ctx);\n        },\n        validator(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.validator(value, ctx);\n        },\n        coercer(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.coercer(value, ctx);\n        },\n        refiner(value, ctx) {\n            struct ?? (struct = fn());\n            return struct.refiner(value, ctx);\n        },\n    });\n}\n/**\n * Create a new struct based on an existing object struct, but excluding\n * specific properties.\n *\n * Like TypeScript's `Omit` utility.\n */\nfunction omit(struct, keys) {\n    const { schema } = struct;\n    const subschema = { ...schema };\n    for (const key of keys) {\n        delete subschema[key];\n    }\n    switch (struct.type) {\n        case 'type':\n            return type(subschema);\n        default:\n            return object(subschema);\n    }\n}\n/**\n * Create a new struct based on an existing object struct, but with all of its\n * properties allowed to be `undefined`.\n *\n * Like TypeScript's `Partial` utility.\n */\nfunction partial(struct) {\n    const isStruct = struct instanceof Struct;\n    const schema = isStruct ? { ...struct.schema } : { ...struct };\n    for (const key in schema) {\n        schema[key] = optional(schema[key]);\n    }\n    if (isStruct && struct.type === 'type') {\n        return type(schema);\n    }\n    return object(schema);\n}\n/**\n * Create a new struct based on an existing object struct, but only including\n * specific properties.\n *\n * Like TypeScript's `Pick` utility.\n */\nfunction pick(struct, keys) {\n    const { schema } = struct;\n    const subschema = {};\n    for (const key of keys) {\n        subschema[key] = schema[key];\n    }\n    switch (struct.type) {\n        case 'type':\n            return type(subschema);\n        default:\n            return object(subschema);\n    }\n}\n/**\n * Define a new struct type with a custom validation function.\n *\n * @deprecated This function has been renamed to `define`.\n */\nfunction struct(name, validator) {\n    console.warn('superstruct@0.11 - The `struct` helper has been renamed to `define`.');\n    return dist_define(name, validator);\n}\n\n/**\n * Ensure that any value passes validation.\n */\nfunction any() {\n    return dist_define('any', () => true);\n}\nfunction array(Element) {\n    return new Struct({\n        type: 'array',\n        schema: Element,\n        *entries(value) {\n            if (Element && Array.isArray(value)) {\n                for (const [i, v] of value.entries()) {\n                    yield [i, v, Element];\n                }\n            }\n        },\n        coercer(value) {\n            return Array.isArray(value) ? value.slice() : value;\n        },\n        validator(value) {\n            return (Array.isArray(value) ||\n                `Expected an array value, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a bigint.\n */\nfunction bigint() {\n    return dist_define('bigint', (value) => {\n        return typeof value === 'bigint';\n    });\n}\n/**\n * Ensure that a value is a boolean.\n */\nfunction dist_boolean() {\n    return dist_define('boolean', (value) => {\n        return typeof value === 'boolean';\n    });\n}\n/**\n * Ensure that a value is a valid `Date`.\n *\n * Note: this also ensures that the value is *not* an invalid `Date` object,\n * which can occur when parsing a date fails but still returns a `Date`.\n */\nfunction date() {\n    return dist_define('date', (value) => {\n        return ((value instanceof Date && !isNaN(value.getTime())) ||\n            `Expected a valid \\`Date\\` object, but received: ${print(value)}`);\n    });\n}\nfunction enums(values) {\n    const schema = {};\n    const description = values.map((v) => print(v)).join();\n    for (const key of values) {\n        schema[key] = key;\n    }\n    return new Struct({\n        type: 'enums',\n        schema,\n        validator(value) {\n            return (values.includes(value) ||\n                `Expected one of \\`${description}\\`, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a function.\n */\nfunction func() {\n    return dist_define('func', (value) => {\n        return (typeof value === 'function' ||\n            `Expected a function, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is an instance of a specific class.\n */\nfunction instance(Class) {\n    return dist_define('instance', (value) => {\n        return (value instanceof Class ||\n            `Expected a \\`${Class.name}\\` instance, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is an integer.\n */\nfunction integer() {\n    return dist_define('integer', (value) => {\n        return ((typeof value === 'number' && !isNaN(value) && Number.isInteger(value)) ||\n            `Expected an integer, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value matches all of a set of types.\n */\nfunction intersection(Structs) {\n    return new Struct({\n        type: 'intersection',\n        schema: null,\n        *entries(value, ctx) {\n            for (const S of Structs) {\n                yield* S.entries(value, ctx);\n            }\n        },\n        *validator(value, ctx) {\n            for (const S of Structs) {\n                yield* S.validator(value, ctx);\n            }\n        },\n        *refiner(value, ctx) {\n            for (const S of Structs) {\n                yield* S.refiner(value, ctx);\n            }\n        },\n    });\n}\nfunction literal(constant) {\n    const description = print(constant);\n    const t = typeof constant;\n    return new Struct({\n        type: 'literal',\n        schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n        validator(value) {\n            return (value === constant ||\n                `Expected the literal \\`${description}\\`, but received: ${print(value)}`);\n        },\n    });\n}\nfunction map(Key, Value) {\n    return new Struct({\n        type: 'map',\n        schema: null,\n        *entries(value) {\n            if (Key && Value && value instanceof Map) {\n                for (const [k, v] of value.entries()) {\n                    yield [k, k, Key];\n                    yield [k, v, Value];\n                }\n            }\n        },\n        coercer(value) {\n            return value instanceof Map ? new Map(value) : value;\n        },\n        validator(value) {\n            return (value instanceof Map ||\n                `Expected a \\`Map\\` object, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that no value ever passes validation.\n */\nfunction never() {\n    return dist_define('never', () => false);\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\nfunction nullable(struct) {\n    return new Struct({\n        ...struct,\n        validator: (value, ctx) => value === null || struct.validator(value, ctx),\n        refiner: (value, ctx) => value === null || struct.refiner(value, ctx),\n    });\n}\n/**\n * Ensure that a value is a number.\n */\nfunction number() {\n    return dist_define('number', (value) => {\n        return ((typeof value === 'number' && !isNaN(value)) ||\n            `Expected a number, but received: ${print(value)}`);\n    });\n}\nfunction object(schema) {\n    const knowns = schema ? Object.keys(schema) : [];\n    const Never = never();\n    return new Struct({\n        type: 'object',\n        schema: schema ? schema : null,\n        *entries(value) {\n            if (schema && isObject(value)) {\n                const unknowns = new Set(Object.keys(value));\n                for (const key of knowns) {\n                    unknowns.delete(key);\n                    yield [key, value[key], schema[key]];\n                }\n                for (const key of unknowns) {\n                    yield [key, value[key], Never];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value, ctx) {\n            if (!isNonArrayObject(value)) {\n                return value;\n            }\n            const coerced = { ...value };\n            // The `object` struct has special behaviour enabled by the mask flag.\n            // When masking, properties that are not in the schema are deleted from\n            // the coerced object instead of eventually failing validaiton.\n            if (ctx.mask && schema) {\n                for (const key in coerced) {\n                    if (schema[key] === undefined) {\n                        delete coerced[key];\n                    }\n                }\n            }\n            return coerced;\n        },\n    });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\nfunction optional(struct) {\n    return new Struct({\n        ...struct,\n        validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n        refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx),\n    });\n}\n/**\n * Ensure that a value is an object with keys and values of specific types, but\n * without ensuring any specific shape of properties.\n *\n * Like TypeScript's `Record` utility.\n */\nfunction record(Key, Value) {\n    return new Struct({\n        type: 'record',\n        schema: null,\n        *entries(value) {\n            if (isObject(value)) {\n                for (const k in value) {\n                    const v = value[k];\n                    yield [k, k, Key];\n                    yield [k, v, Value];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return isNonArrayObject(value) ? { ...value } : value;\n        },\n    });\n}\n/**\n * Ensure that a value is a `RegExp`.\n *\n * Note: this does not test the value against the regular expression! For that\n * you need to use the `pattern()` refinement.\n */\nfunction regexp() {\n    return dist_define('regexp', (value) => {\n        return value instanceof RegExp;\n    });\n}\nfunction set(Element) {\n    return new Struct({\n        type: 'set',\n        schema: null,\n        *entries(value) {\n            if (Element && value instanceof Set) {\n                for (const v of value) {\n                    yield [v, v, Element];\n                }\n            }\n        },\n        coercer(value) {\n            return value instanceof Set ? new Set(value) : value;\n        },\n        validator(value) {\n            return (value instanceof Set ||\n                `Expected a \\`Set\\` object, but received: ${print(value)}`);\n        },\n    });\n}\n/**\n * Ensure that a value is a string.\n */\nfunction string() {\n    return dist_define('string', (value) => {\n        return (typeof value === 'string' ||\n            `Expected a string, but received: ${print(value)}`);\n    });\n}\n/**\n * Ensure that a value is a tuple of a specific length, and that each of its\n * elements is of a specific type.\n */\nfunction tuple(Structs) {\n    const Never = never();\n    return new Struct({\n        type: 'tuple',\n        schema: null,\n        *entries(value) {\n            if (Array.isArray(value)) {\n                const length = Math.max(Structs.length, value.length);\n                for (let i = 0; i < length; i++) {\n                    yield [i, value[i], Structs[i] || Never];\n                }\n            }\n        },\n        validator(value) {\n            return (Array.isArray(value) ||\n                `Expected an array, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return Array.isArray(value) ? value.slice() : value;\n        },\n    });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\nfunction type(schema) {\n    const keys = Object.keys(schema);\n    return new Struct({\n        type: 'type',\n        schema,\n        *entries(value) {\n            if (isObject(value)) {\n                for (const k of keys) {\n                    yield [k, value[k], schema[k]];\n                }\n            }\n        },\n        validator(value) {\n            return (isNonArrayObject(value) ||\n                `Expected an object, but received: ${print(value)}`);\n        },\n        coercer(value) {\n            return isNonArrayObject(value) ? { ...value } : value;\n        },\n    });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\nfunction union(Structs) {\n    const description = Structs.map((s) => s.type).join(' | ');\n    return new Struct({\n        type: 'union',\n        schema: null,\n        coercer(value, ctx) {\n            for (const S of Structs) {\n                const [error, coerced] = S.validate(value, {\n                    coerce: true,\n                    mask: ctx.mask,\n                });\n                if (!error) {\n                    return coerced;\n                }\n            }\n            return value;\n        },\n        validator(value, ctx) {\n            const failures = [];\n            for (const S of Structs) {\n                const [...tuples] = run(value, S, ctx);\n                const [first] = tuples;\n                if (!first[0]) {\n                    return [];\n                }\n                else {\n                    for (const [failure] of tuples) {\n                        if (failure) {\n                            failures.push(failure);\n                        }\n                    }\n                }\n            }\n            return [\n                `Expected the value to satisfy a union of \\`${description}\\`, but received: ${print(value)}`,\n                ...failures,\n            ];\n        },\n    });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\nfunction unknown() {\n    return dist_define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction coerce(struct, condition, coercer) {\n    return new Struct({\n        ...struct,\n        coercer: (value, ctx) => {\n            return is(value, condition)\n                ? struct.coercer(coercer(value, ctx), ctx)\n                : struct.coercer(value, ctx);\n        },\n    });\n}\n/**\n * Augment a struct to replace `undefined` values with a default.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction defaulted(struct, fallback, options = {}) {\n    return coerce(struct, unknown(), (x) => {\n        const f = typeof fallback === 'function' ? fallback() : fallback;\n        if (x === undefined) {\n            return f;\n        }\n        if (!options.strict && isPlainObject(x) && isPlainObject(f)) {\n            const ret = { ...x };\n            let changed = false;\n            for (const key in f) {\n                if (ret[key] === undefined) {\n                    ret[key] = f[key];\n                    changed = true;\n                }\n            }\n            if (changed) {\n                return ret;\n            }\n        }\n        return x;\n    });\n}\n/**\n * Augment a struct to trim string inputs.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\nfunction trimmed(struct) {\n    return coerce(struct, string(), (x) => x.trim());\n}\n\n/**\n * Ensure that a string, array, map, or set is empty.\n */\nfunction empty(struct) {\n    return refine(struct, 'empty', (value) => {\n        const size = getSize(value);\n        return (size === 0 ||\n            `Expected an empty ${struct.type} but received one with a size of \\`${size}\\``);\n    });\n}\nfunction getSize(value) {\n    if (value instanceof Map || value instanceof Set) {\n        return value.size;\n    }\n    else {\n        return value.length;\n    }\n}\n/**\n * Ensure that a number or date is below a threshold.\n */\nfunction max(struct, threshold, options = {}) {\n    const { exclusive } = options;\n    return refine(struct, 'max', (value) => {\n        return exclusive\n            ? value < threshold\n            : value <= threshold ||\n                `Expected a ${struct.type} less than ${exclusive ? '' : 'or equal to '}${threshold} but received \\`${value}\\``;\n    });\n}\n/**\n * Ensure that a number or date is above a threshold.\n */\nfunction min(struct, threshold, options = {}) {\n    const { exclusive } = options;\n    return refine(struct, 'min', (value) => {\n        return exclusive\n            ? value > threshold\n            : value >= threshold ||\n                `Expected a ${struct.type} greater than ${exclusive ? '' : 'or equal to '}${threshold} but received \\`${value}\\``;\n    });\n}\n/**\n * Ensure that a string, array, map or set is not empty.\n */\nfunction nonempty(struct) {\n    return refine(struct, 'nonempty', (value) => {\n        const size = getSize(value);\n        return (size > 0 || `Expected a nonempty ${struct.type} but received an empty one`);\n    });\n}\n/**\n * Ensure that a string matches a regular expression.\n */\nfunction pattern(struct, regexp) {\n    return refine(struct, 'pattern', (value) => {\n        return (regexp.test(value) ||\n            `Expected a ${struct.type} matching \\`/${regexp.source}/\\` but received \"${value}\"`);\n    });\n}\n/**\n * Ensure that a string, array, number, date, map, or set has a size (or length, or time) between `min` and `max`.\n */\nfunction size(struct, min, max = min) {\n    const expected = `Expected a ${struct.type}`;\n    const of = min === max ? `of \\`${min}\\`` : `between \\`${min}\\` and \\`${max}\\``;\n    return refine(struct, 'size', (value) => {\n        if (typeof value === 'number' || value instanceof Date) {\n            return ((min <= value && value <= max) ||\n                `${expected} ${of} but received \\`${value}\\``);\n        }\n        else if (value instanceof Map || value instanceof Set) {\n            const { size } = value;\n            return ((min <= size && size <= max) ||\n                `${expected} with a size ${of} but received one with a size of \\`${size}\\``);\n        }\n        else {\n            const { length } = value;\n            return ((min <= length && length <= max) ||\n                `${expected} with a length ${of} but received one with a length of \\`${length}\\``);\n        }\n    });\n}\n/**\n * Augment a `Struct` to add an additional refinement to the validation.\n *\n * The refiner function is guaranteed to receive a value of the struct's type,\n * because the struct's existing validation will already have passed. This\n * allows you to layer additional validation on top of existing structs.\n */\nfunction refine(struct, name, refiner) {\n    return new Struct({\n        ...struct,\n        *refiner(value, ctx) {\n            yield* struct.refiner(value, ctx);\n            const result = refiner(value, ctx);\n            const failures = toFailures(result, ctx, struct, value);\n            for (const failure of failures) {\n                yield { ...failure, refinement: name };\n            }\n        },\n    });\n}\n\n\n//# sourceMappingURL=index.mjs.map\n\n// EXTERNAL MODULE: ./node_modules/jayson/lib/client/browser/index.js\nvar client_browser = __webpack_require__(1198);\nvar browser_default = /*#__PURE__*/__webpack_require__.n(client_browser);\n// EXTERNAL MODULE: ./node_modules/rpc-websockets/node_modules/eventemitter3/index.js\nvar eventemitter3 = __webpack_require__(4790);\n;// CONCATENATED MODULE: ./node_modules/rpc-websockets/node_modules/eventemitter3/index.mjs\n\n\n\n/* harmony default export */ var node_modules_eventemitter3 = ((/* unused pure expression or super */ null && (EventEmitter)));\n\n;// CONCATENATED MODULE: ./node_modules/rpc-websockets/dist/index.browser.mjs\n\n\n\n// node_modules/esbuild-plugin-polyfill-node/polyfills/buffer.js\nvar WebSocketBrowserImpl = class extends eventemitter3 {\n  socket;\n  /** Instantiate a WebSocket class\n  * @constructor\n  * @param {String} address - url to a websocket server\n  * @param {(Object)} options - websocket options\n  * @param {(String|Array)} protocols - a list of protocols\n  * @return {WebSocketBrowserImpl} - returns a WebSocket instance\n  */\n  constructor(address, options, protocols) {\n    super();\n    this.socket = new window.WebSocket(address, protocols);\n    this.socket.onopen = () => this.emit(\"open\");\n    this.socket.onmessage = (event) => this.emit(\"message\", event.data);\n    this.socket.onerror = (error) => this.emit(\"error\", error);\n    this.socket.onclose = (event) => {\n      this.emit(\"close\", event.code, event.reason);\n    };\n  }\n  /**\n  * Sends data through a websocket connection\n  * @method\n  * @param {(String|Object)} data - data to be sent via websocket\n  * @param {Object} optionsOrCallback - ws options\n  * @param {Function} callback - a callback called once the data is sent\n  * @return {Undefined}\n  */\n  send(data, optionsOrCallback, callback) {\n    const cb = callback || optionsOrCallback;\n    try {\n      this.socket.send(data);\n      cb();\n    } catch (error) {\n      cb(error);\n    }\n  }\n  /**\n  * Closes an underlying socket\n  * @method\n  * @param {Number} code - status code explaining why the connection is being closed\n  * @param {String} reason - a description why the connection is closing\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  close(code, reason) {\n    this.socket.close(code, reason);\n  }\n  addEventListener(type, listener, options) {\n    this.socket.addEventListener(type, listener, options);\n  }\n};\nfunction WebSocket(address, options) {\n  return new WebSocketBrowserImpl(address, options);\n}\n\n// src/lib/utils.ts\nvar DefaultDataPack = class {\n  encode(value) {\n    return JSON.stringify(value);\n  }\n  decode(value) {\n    return JSON.parse(value);\n  }\n};\n\n// src/lib/client.ts\nvar CommonClient = class extends eventemitter3 {\n  address;\n  rpc_id;\n  queue;\n  options;\n  autoconnect;\n  ready;\n  reconnect;\n  reconnect_timer_id;\n  reconnect_interval;\n  max_reconnects;\n  rest_options;\n  current_reconnects;\n  generate_request_id;\n  socket;\n  webSocketFactory;\n  dataPack;\n  /**\n  * Instantiate a Client class.\n  * @constructor\n  * @param {webSocketFactory} webSocketFactory - factory method for WebSocket\n  * @param {String} address - url to a websocket server\n  * @param {Object} options - ws options object with reconnect parameters\n  * @param {Function} generate_request_id - custom generation request Id\n  * @param {DataPack} dataPack - data pack contains encoder and decoder\n  * @return {CommonClient}\n  */\n  constructor(webSocketFactory, address = \"ws://localhost:8080\", {\n    autoconnect = true,\n    reconnect = true,\n    reconnect_interval = 1e3,\n    max_reconnects = 5,\n    ...rest_options\n  } = {}, generate_request_id, dataPack) {\n    super();\n    this.webSocketFactory = webSocketFactory;\n    this.queue = {};\n    this.rpc_id = 0;\n    this.address = address;\n    this.autoconnect = autoconnect;\n    this.ready = false;\n    this.reconnect = reconnect;\n    this.reconnect_timer_id = void 0;\n    this.reconnect_interval = reconnect_interval;\n    this.max_reconnects = max_reconnects;\n    this.rest_options = rest_options;\n    this.current_reconnects = 0;\n    this.generate_request_id = generate_request_id || (() => ++this.rpc_id);\n    if (!dataPack) this.dataPack = new DefaultDataPack();\n    else this.dataPack = dataPack;\n    if (this.autoconnect)\n      this._connect(this.address, {\n        autoconnect: this.autoconnect,\n        reconnect: this.reconnect,\n        reconnect_interval: this.reconnect_interval,\n        max_reconnects: this.max_reconnects,\n        ...this.rest_options\n      });\n  }\n  /**\n  * Connects to a defined server if not connected already.\n  * @method\n  * @return {Undefined}\n  */\n  connect() {\n    if (this.socket) return;\n    this._connect(this.address, {\n      autoconnect: this.autoconnect,\n      reconnect: this.reconnect,\n      reconnect_interval: this.reconnect_interval,\n      max_reconnects: this.max_reconnects,\n      ...this.rest_options\n    });\n  }\n  /**\n  * Calls a registered RPC method on server.\n  * @method\n  * @param {String} method - RPC method name\n  * @param {Object|Array} params - optional method parameters\n  * @param {Number} timeout - RPC reply timeout value\n  * @param {Object} ws_opts - options passed to ws\n  * @return {Promise}\n  */\n  call(method, params, timeout, ws_opts) {\n    if (!ws_opts && \"object\" === typeof timeout) {\n      ws_opts = timeout;\n      timeout = null;\n    }\n    return new Promise((resolve, reject) => {\n      if (!this.ready) return reject(new Error(\"socket not ready\"));\n      const rpc_id = this.generate_request_id(method, params);\n      const message = {\n        jsonrpc: \"2.0\",\n        method,\n        params: params || void 0,\n        id: rpc_id\n      };\n      this.socket.send(this.dataPack.encode(message), ws_opts, (error) => {\n        if (error) return reject(error);\n        this.queue[rpc_id] = { promise: [resolve, reject] };\n        if (timeout) {\n          this.queue[rpc_id].timeout = setTimeout(() => {\n            delete this.queue[rpc_id];\n            reject(new Error(\"reply timeout\"));\n          }, timeout);\n        }\n      });\n    });\n  }\n  /**\n  * Logins with the other side of the connection.\n  * @method\n  * @param {Object} params - Login credentials object\n  * @return {Promise}\n  */\n  async login(params) {\n    const resp = await this.call(\"rpc.login\", params);\n    if (!resp) throw new Error(\"authentication failed\");\n    return resp;\n  }\n  /**\n  * Fetches a list of client's methods registered on server.\n  * @method\n  * @return {Array}\n  */\n  async listMethods() {\n    return await this.call(\"__listMethods\");\n  }\n  /**\n  * Sends a JSON-RPC 2.0 notification to server.\n  * @method\n  * @param {String} method - RPC method name\n  * @param {Object} params - optional method parameters\n  * @return {Promise}\n  */\n  notify(method, params) {\n    return new Promise((resolve, reject) => {\n      if (!this.ready) return reject(new Error(\"socket not ready\"));\n      const message = {\n        jsonrpc: \"2.0\",\n        method,\n        params\n      };\n      this.socket.send(this.dataPack.encode(message), (error) => {\n        if (error) return reject(error);\n        resolve();\n      });\n    });\n  }\n  /**\n  * Subscribes for a defined event.\n  * @method\n  * @param {String|Array} event - event name\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  async subscribe(event) {\n    if (typeof event === \"string\") event = [event];\n    const result = await this.call(\"rpc.on\", event);\n    if (typeof event === \"string\" && result[event] !== \"ok\")\n      throw new Error(\n        \"Failed subscribing to an event '\" + event + \"' with: \" + result[event]\n      );\n    return result;\n  }\n  /**\n  * Unsubscribes from a defined event.\n  * @method\n  * @param {String|Array} event - event name\n  * @return {Undefined}\n  * @throws {Error}\n  */\n  async unsubscribe(event) {\n    if (typeof event === \"string\") event = [event];\n    const result = await this.call(\"rpc.off\", event);\n    if (typeof event === \"string\" && result[event] !== \"ok\")\n      throw new Error(\"Failed unsubscribing from an event with: \" + result);\n    return result;\n  }\n  /**\n  * Closes a WebSocket connection gracefully.\n  * @method\n  * @param {Number} code - socket close code\n  * @param {String} data - optional data to be sent before closing\n  * @return {Undefined}\n  */\n  close(code, data) {\n    this.socket.close(code || 1e3, data);\n  }\n  /**\n  * Enable / disable automatic reconnection.\n  * @method\n  * @param {Boolean} reconnect - enable / disable reconnection\n  * @return {Undefined}\n  */\n  setAutoReconnect(reconnect) {\n    this.reconnect = reconnect;\n  }\n  /**\n  * Set the interval between reconnection attempts.\n  * @method\n  * @param {Number} interval - reconnection interval in milliseconds\n  * @return {Undefined}\n  */\n  setReconnectInterval(interval) {\n    this.reconnect_interval = interval;\n  }\n  /**\n  * Set the maximum number of reconnection attempts.\n  * @method\n  * @param {Number} max_reconnects - maximum reconnection attempts\n  * @return {Undefined}\n  */\n  setMaxReconnects(max_reconnects) {\n    this.max_reconnects = max_reconnects;\n  }\n  /**\n  * Connection/Message handler.\n  * @method\n  * @private\n  * @param {String} address - WebSocket API address\n  * @param {Object} options - ws options object\n  * @return {Undefined}\n  */\n  _connect(address, options) {\n    clearTimeout(this.reconnect_timer_id);\n    this.socket = this.webSocketFactory(address, options);\n    this.socket.addEventListener(\"open\", () => {\n      this.ready = true;\n      this.emit(\"open\");\n      this.current_reconnects = 0;\n    });\n    this.socket.addEventListener(\"message\", ({ data: message }) => {\n      if (message instanceof ArrayBuffer)\n        message = node_modules_buffer.Buffer.from(message).toString();\n      try {\n        message = this.dataPack.decode(message);\n      } catch (error) {\n        return;\n      }\n      if (message.notification && this.listeners(message.notification).length) {\n        if (!Object.keys(message.params).length)\n          return this.emit(message.notification);\n        const args = [message.notification];\n        if (message.params.constructor === Object) args.push(message.params);\n        else\n          for (let i = 0; i < message.params.length; i++)\n            args.push(message.params[i]);\n        return Promise.resolve().then(() => {\n          this.emit.apply(this, args);\n        });\n      }\n      if (!this.queue[message.id]) {\n        if (message.method) {\n          return Promise.resolve().then(() => {\n            this.emit(message.method, message?.params);\n          });\n        }\n        return;\n      }\n      if (\"error\" in message === \"result\" in message)\n        this.queue[message.id].promise[1](\n          new Error(\n            'Server response malformed. Response must include either \"result\" or \"error\", but not both.'\n          )\n        );\n      if (this.queue[message.id].timeout)\n        clearTimeout(this.queue[message.id].timeout);\n      if (message.error) this.queue[message.id].promise[1](message.error);\n      else this.queue[message.id].promise[0](message.result);\n      delete this.queue[message.id];\n    });\n    this.socket.addEventListener(\"error\", (error) => this.emit(\"error\", error));\n    this.socket.addEventListener(\"close\", ({ code, reason }) => {\n      if (this.ready)\n        setTimeout(() => this.emit(\"close\", code, reason), 0);\n      this.ready = false;\n      this.socket = void 0;\n      if (code === 1e3) return;\n      this.current_reconnects++;\n      if (this.reconnect && (this.max_reconnects > this.current_reconnects || this.max_reconnects === 0))\n        this.reconnect_timer_id = setTimeout(\n          () => this._connect(address, options),\n          this.reconnect_interval\n        );\n    });\n  }\n};\n\n// src/index.browser.ts\nvar Client = class extends (/* unused pure expression or super */ null && (CommonClient)) {\n  constructor(address = \"ws://localhost:8080\", {\n    autoconnect = true,\n    reconnect = true,\n    reconnect_interval = 1e3,\n    max_reconnects = 5\n  } = {}, generate_request_id) {\n    super(\n      WebSocket,\n      address,\n      {\n        autoconnect,\n        reconnect,\n        reconnect_interval,\n        max_reconnects\n      },\n      generate_request_id\n    );\n  }\n};\n\n\n//# sourceMappingURL=out.js.map\n//# sourceMappingURL=index.browser.mjs.map\n// EXTERNAL MODULE: ./node_modules/@noble/hashes/esm/_assert.js\nvar _assert = __webpack_require__(3527);\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/sha3.js\n\n\n\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n// Various per round constants calculations\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = [];\nconst sha3_0n = /* @__PURE__ */ BigInt(0);\nconst sha3_1n = /* @__PURE__ */ BigInt(1);\nconst sha3_2n = /* @__PURE__ */ BigInt(2);\nconst _7n = /* @__PURE__ */ BigInt(7);\nconst _256n = /* @__PURE__ */ BigInt(256);\nconst _0x71n = /* @__PURE__ */ BigInt(0x71);\nfor (let round = 0, R = sha3_1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    let t = sha3_0n;\n    for (let j = 0; j < 7; j++) {\n        R = ((R << sha3_1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n        if (R & sha3_2n)\n            t ^= sha3_1n << ((sha3_1n << /* @__PURE__ */ BigInt(j)) - sha3_1n);\n    }\n    _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nfunction keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    B.fill(0);\n}\nclass Keccak extends utils/* Hash */.kb {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        // Can be passed from user as dkLen\n        (0,_assert/* number */.Rx)(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        if (0 >= this.blockLen || this.blockLen >= 200)\n            throw new Error('Sha3 supports only keccak-f1600 function');\n        this.state = new Uint8Array(200);\n        this.state32 = (0,utils/* u32 */.Jq)(this.state);\n    }\n    keccak() {\n        if (!utils/* isLE */.iA)\n            (0,utils/* byteSwap32 */.l1)(this.state32);\n        keccakP(this.state32, this.rounds);\n        if (!utils/* isLE */.iA)\n            (0,utils/* byteSwap32 */.l1)(this.state32);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        (0,_assert/* exists */.Gg)(this);\n        const { blockLen, state } = this;\n        data = (0,utils/* toBytes */.O0)(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        (0,_assert/* exists */.Gg)(this, false);\n        (0,_assert/* bytes */.aI)(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        (0,_assert/* number */.Rx)(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        (0,_assert/* output */.J8)(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        this.state.fill(0);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => (0,utils/* wrapConstructor */.hE)(() => new Keccak(blockLen, suffix, outputLen));\nconst sha3_224 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x06, 144, 224 / 8)));\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nconst sha3_256 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x06, 136, 256 / 8)));\nconst sha3_384 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x06, 104, 384 / 8)));\nconst sha3_512 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x06, 72, 512 / 8)));\nconst keccak_224 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x01, 144, 224 / 8)));\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nconst keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nconst keccak_384 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x01, 104, 384 / 8)));\nconst keccak_512 = /* @__PURE__ */ (/* unused pure expression or super */ null && (gen(0x01, 72, 512 / 8)));\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nconst shake128 = /* @__PURE__ */ (/* unused pure expression or super */ null && (genShake(0x1f, 168, 128 / 8)));\nconst shake256 = /* @__PURE__ */ (/* unused pure expression or super */ null && (genShake(0x1f, 136, 256 / 8)));\n//# sourceMappingURL=sha3.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/hmac.js\n\n\n// HMAC (RFC 2104)\nclass HMAC extends utils/* Hash */.kb {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        (0,_assert/* hash */.vp)(hash);\n        const key = (0,utils/* toBytes */.O0)(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        (0,_assert/* exists */.Gg)(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        (0,_assert/* exists */.Gg)(this);\n        (0,_assert/* bytes */.aI)(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nconst hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/abstract/weierstrass.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\n\n\n\n\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = utils_namespaceObject;\nconst DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\n        // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n        // since we always use positive integers here. It must always be empty:\n        // - add zero byte if exists\n        // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        abytes(data);\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst weierstrass_0n = BigInt(0), weierstrass_1n = BigInt(1), weierstrass_2n = BigInt(2), weierstrass_3n = BigInt(3), weierstrass_4n = BigInt(4);\nfunction weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return utils_concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && weierstrass_0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (isBytes(key))\n                key = utils_bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : utils_bytesToNumberBE(utils_ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = modular_mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(utils_ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            if (this.is0()) {\n                // (0, 1, 0) aka ZERO is invalid in most contexts.\n                // In BLS, ZERO can be serialized, so we allow it.\n                // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n                if (CURVE.allowInfinityPoint && !Fp.is0(this.py))\n                    return;\n                throw new Error('bad point: ZERO');\n            }\n            // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n            const { x, y } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, weierstrass_3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, weierstrass_3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === weierstrass_0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === weierstrass_1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > weierstrass_0n || k2 > weierstrass_0n) {\n                if (k1 & weierstrass_1n)\n                    k1p = k1p.add(d);\n                if (k2 & weierstrass_1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= weierstrass_1n;\n                k2 >>= weierstrass_1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === weierstrass_0n || a === weierstrass_1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.is0();\n            // If invZ was 0, we return zero point. However we still want to execute\n            // all operations, so we replace invZ with a random number, 1.\n            if (iz == null)\n                iz = is0 ? Fp.ONE : Fp.inv(z);\n            const ax = Fp.mul(x, iz);\n            const ay = Fp.mul(y, iz);\n            const zz = Fp.mul(z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === weierstrass_1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === weierstrass_1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return utils_bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction weierstrass_validateOpts(curve) {\n    const opts = validateBasic(curve);\n    validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nfunction weierstrass(curveDef) {\n    const CURVE = weierstrass_validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return weierstrass_0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return modular_mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = utils_concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = utils_bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y;\n                try {\n                    y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                }\n                catch (sqrtError) {\n                    const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                    throw new Error('Point is not on curve' + suffix);\n                }\n                const isYOdd = (y & weierstrass_1n) === weierstrass_1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => utils_bytesToHex(utils_numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> weierstrass_1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => utils_bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = utils_ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(utils_ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(utils_ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = getMinHashLength(CURVE.n);\n            return mapHashToField(CURVE.randomBytes(length), CURVE.n);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = isBytes(item);\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = utils_bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(weierstrass_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return utils_numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = utils_ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = utils_ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null && ent !== false) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(utils_ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = utils_concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === weierstrass_0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === weierstrass_0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & weierstrass_1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = utils_ensureBytes('msgHash', msgHash);\n        publicKey = utils_ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || isBytes(sg)) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nfunction SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = weierstrass_0n;\n    for (let o = q - weierstrass_1n; o % weierstrass_2n === weierstrass_0n; o /= weierstrass_2n)\n        l += weierstrass_1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = weierstrass_2n << (c1 - weierstrass_1n - weierstrass_1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * weierstrass_2n;\n    const c2 = (q - weierstrass_1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - weierstrass_1n) / weierstrass_2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - weierstrass_1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + weierstrass_1n) / weierstrass_2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > weierstrass_1n; i--) {\n            let tv5 = i - weierstrass_2n; // 18.    tv5 = i - 2\n            tv5 = weierstrass_2n << (tv5 - weierstrass_1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % weierstrass_4n === weierstrass_3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - weierstrass_3n) / weierstrass_4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nfunction weierstrass_mapToCurveSimpleSWU(Fp, opts) {\n    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/_shortw_utils.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n\n\n// connects noble-curves to noble-hashes\nfunction getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, (0,utils/* concatBytes */.eV)(...msgs)),\n        randomBytes: utils/* randomBytes */.O6,\n    };\n}\nfunction createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map\n;// CONCATENATED MODULE: ./node_modules/@noble/curves/esm/secp256k1.js\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n\n\n\n\n\n\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst secp256k1_1n = BigInt(1);\nconst secp256k1_2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / secp256k1_2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n    const P = secp256k1P;\n    // prettier-ignore\n    const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n    // prettier-ignore\n    const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n    const b2 = (y * y * y) % P; // x^3, 11\n    const b3 = (b2 * b2 * y) % P; // x^7\n    const b6 = (modular_pow2(b3, _3n, P) * b3) % P;\n    const b9 = (modular_pow2(b6, _3n, P) * b3) % P;\n    const b11 = (modular_pow2(b9, secp256k1_2n, P) * b2) % P;\n    const b22 = (modular_pow2(b11, _11n, P) * b11) % P;\n    const b44 = (modular_pow2(b22, _22n, P) * b22) % P;\n    const b88 = (modular_pow2(b44, _44n, P) * b44) % P;\n    const b176 = (modular_pow2(b88, _88n, P) * b88) % P;\n    const b220 = (modular_pow2(b176, _44n, P) * b44) % P;\n    const b223 = (modular_pow2(b220, _3n, P) * b3) % P;\n    const t1 = (modular_pow2(b223, _23n, P) * b22) % P;\n    const t2 = (modular_pow2(t1, _6n, P) * b2) % P;\n    const root = modular_pow2(t2, secp256k1_2n, P);\n    if (!secp256k1_Fp.eql(secp256k1_Fp.sqr(root), y))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst secp256k1_Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nconst secp256k1 = createCurve({\n    a: BigInt(0), // equation params: a, b\n    b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n    Fp: secp256k1_Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n    n: secp256k1N, // Curve order, total count of valid points in the field\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1), // Cofactor\n    lowS: true, // Allow only low-S signatures by default in sign() and verify()\n    /**\n     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n     */\n    endo: {\n        beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n        splitScalar: (k) => {\n            const n = secp256k1N;\n            const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n            const b1 = -secp256k1_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n            const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n            const b2 = a1;\n            const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n            const c1 = divNearest(b2 * k, n);\n            const c2 = divNearest(-b1 * k, n);\n            let k1 = modular_mod(k - c1 * a1 - c2 * a2, n);\n            let k2 = modular_mod(-c1 * b1 - c2 * b2, n);\n            const k1neg = k1 > POW_2_128;\n            const k2neg = k2 > POW_2_128;\n            if (k1neg)\n                k1 = n - k1;\n            if (k2neg)\n                k2 = n - k2;\n            if (k1 > POW_2_128 || k2 > POW_2_128) {\n                throw new Error('splitScalar: Endomorphism failed, k=' + k);\n            }\n            return { k1neg, k1, k2neg, k2 };\n        },\n    },\n}, esm_sha256/* sha256 */.J);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst secp256k1_0n = BigInt(0);\nconst fe = (x) => typeof x === 'bigint' && secp256k1_0n < x && x < secp256k1P;\nconst ge = (x) => typeof x === 'bigint' && secp256k1_0n < x && x < secp256k1N;\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n    let tagP = TAGGED_HASH_PREFIXES[tag];\n    if (tagP === undefined) {\n        const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n        tagP = concatBytes(tagH, tagH);\n        TAGGED_HASH_PREFIXES[tag] = tagP;\n    }\n    return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n    let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n    const scalar = p.hasEvenY() ? d_ : modN(-d_);\n    return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n    if (!fe(x))\n        throw new Error('bad x: need 0 < x < p'); // Fail if x ≥ p.\n    const xx = modP(x * x);\n    const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n    let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n    if (y % secp256k1_2n !== secp256k1_0n)\n        y = modP(-y); // Return the unique point P such that x(P) = x and\n    const p = new Point(x, y, secp256k1_1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n    p.assertValidity();\n    return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n    return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n    const m = ensureBytes('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ bytesToNumberBE(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n    const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n    const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n    if (k_ === secp256k1_0n)\n        throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n    const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n    const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n    sig.set(rx, 0);\n    sig.set(numTo32b(modN(k + e * d)), 32);\n    // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n    if (!schnorrVerify(sig, m, px))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n    const sig = ensureBytes('signature', signature, 64);\n    const m = ensureBytes('message', message);\n    const pub = ensureBytes('publicKey', publicKey, 32);\n    try {\n        const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n        if (!fe(r))\n            return false;\n        const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!ge(s))\n            return false;\n        const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n        if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\n    }\n}\nconst schnorr = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE,\n        bytesToNumberBE,\n        taggedHash,\n        mod,\n    },\n}))()));\nconst isoMap = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => isogenyMap(secp256k1_Fp, [\n    // xNum\n    [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n    ],\n    // xDen\n    [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n    // yNum\n    [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n    ],\n    // yDen\n    [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n].map((i) => i.map((j) => BigInt(j)))))()));\nconst mapSWU = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => mapToCurveSimpleSWU(secp256k1_Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: secp256k1_Fp.create(BigInt('-11')),\n}))()));\nconst secp256k1_htf = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(secp256k1_Fp.create(scalars[0]));\n    return isoMap(x, y);\n}, {\n    DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n    encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n    p: secp256k1_Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha256,\n}))()));\nconst secp256k1_hashToCurve = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => secp256k1_htf.hashToCurve)()));\nconst secp256k1_encodeToCurve = /* @__PURE__ */ (/* unused pure expression or super */ null && ((() => secp256k1_htf.encodeToCurve)()));\n//# sourceMappingURL=secp256k1.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/web3.js/lib/index.browser.esm.js\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n/**\n * A 64 byte secret key, the first 32 bytes of which is the\n * private scalar and the last 32 bytes is the public key.\n * Read more: https://blog.mozilla.org/warner/2011/11/29/ed25519-keys/\n */\n\n/**\n * Ed25519 Keypair\n */\n\nconst generatePrivateKey = ed25519.utils.randomPrivateKey;\nconst generateKeypair = () => {\n  const privateScalar = ed25519.utils.randomPrivateKey();\n  const publicKey = getPublicKey(privateScalar);\n  const secretKey = new Uint8Array(64);\n  secretKey.set(privateScalar);\n  secretKey.set(publicKey, 32);\n  return {\n    publicKey,\n    secretKey\n  };\n};\nconst getPublicKey = ed25519.getPublicKey;\nfunction isOnCurve(publicKey) {\n  try {\n    ed25519.ExtendedPoint.fromHex(publicKey);\n    return true;\n  } catch {\n    return false;\n  }\n}\nconst sign = (message, secretKey) => ed25519.sign(message, secretKey.slice(0, 32));\nconst verify = ed25519.verify;\n\nconst toBuffer = arr => {\n  if (node_modules_buffer.Buffer.isBuffer(arr)) {\n    return arr;\n  } else if (arr instanceof Uint8Array) {\n    return node_modules_buffer.Buffer.from(arr.buffer, arr.byteOffset, arr.byteLength);\n  } else {\n    return node_modules_buffer.Buffer.from(arr);\n  }\n};\n\n// Class wrapping a plain object\nclass index_browser_esm_Struct {\n  constructor(properties) {\n    Object.assign(this, properties);\n  }\n  encode() {\n    return node_modules_buffer.Buffer.from((0,lib.serialize)(SOLANA_SCHEMA, this));\n  }\n  static decode(data) {\n    return (0,lib.deserialize)(SOLANA_SCHEMA, this, data);\n  }\n  static decodeUnchecked(data) {\n    return (0,lib.deserializeUnchecked)(SOLANA_SCHEMA, this, data);\n  }\n}\n\n// Class representing a Rust-compatible enum, since enums are only strings or\n// numbers in pure JS\nclass Enum extends index_browser_esm_Struct {\n  constructor(properties) {\n    super(properties);\n    this.enum = '';\n    if (Object.keys(properties).length !== 1) {\n      throw new Error('Enum can only take single value');\n    }\n    Object.keys(properties).map(key => {\n      this.enum = key;\n    });\n  }\n}\nconst SOLANA_SCHEMA = new Map();\n\nvar _PublicKey;\n\n/**\n * Maximum length of derived pubkey seed\n */\nconst MAX_SEED_LENGTH = 32;\n\n/**\n * Size of public key in bytes\n */\nconst PUBLIC_KEY_LENGTH = 32;\n\n/**\n * Value to be converted into public key\n */\n\n/**\n * JSON object representation of PublicKey class\n */\n\nfunction isPublicKeyData(value) {\n  return value._bn !== undefined;\n}\n\n// local counter used by PublicKey.unique()\nlet uniquePublicKeyCounter = 1;\n\n/**\n * A public key\n */\nclass PublicKey extends index_browser_esm_Struct {\n  /**\n   * Create a new PublicKey object\n   * @param value ed25519 public key as buffer or base-58 encoded string\n   */\n  constructor(value) {\n    super({});\n    /** @internal */\n    this._bn = void 0;\n    if (isPublicKeyData(value)) {\n      this._bn = value._bn;\n    } else {\n      if (typeof value === 'string') {\n        // assume base 58 encoding by default\n        const decoded = bs58_default().decode(value);\n        if (decoded.length != PUBLIC_KEY_LENGTH) {\n          throw new Error(`Invalid public key input`);\n        }\n        this._bn = new (bn_default())(decoded);\n      } else {\n        this._bn = new (bn_default())(value);\n      }\n      if (this._bn.byteLength() > PUBLIC_KEY_LENGTH) {\n        throw new Error(`Invalid public key input`);\n      }\n    }\n  }\n\n  /**\n   * Returns a unique PublicKey for tests and benchmarks using a counter\n   */\n  static unique() {\n    const key = new PublicKey(uniquePublicKeyCounter);\n    uniquePublicKeyCounter += 1;\n    return new PublicKey(key.toBuffer());\n  }\n\n  /**\n   * Default public key value. The base58-encoded string representation is all ones (as seen below)\n   * The underlying BN number is 32 bytes that are all zeros\n   */\n\n  /**\n   * Checks if two publicKeys are equal\n   */\n  equals(publicKey) {\n    return this._bn.eq(publicKey._bn);\n  }\n\n  /**\n   * Return the base-58 representation of the public key\n   */\n  toBase58() {\n    return bs58_default().encode(this.toBytes());\n  }\n  toJSON() {\n    return this.toBase58();\n  }\n\n  /**\n   * Return the byte array representation of the public key in big endian\n   */\n  toBytes() {\n    const buf = this.toBuffer();\n    return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\n  }\n\n  /**\n   * Return the Buffer representation of the public key in big endian\n   */\n  toBuffer() {\n    const b = this._bn.toArrayLike(node_modules_buffer.Buffer);\n    if (b.length === PUBLIC_KEY_LENGTH) {\n      return b;\n    }\n    const zeroPad = node_modules_buffer.Buffer.alloc(32);\n    b.copy(zeroPad, 32 - b.length);\n    return zeroPad;\n  }\n  get [Symbol.toStringTag]() {\n    return `PublicKey(${this.toString()})`;\n  }\n\n  /**\n   * Return the base-58 representation of the public key\n   */\n  toString() {\n    return this.toBase58();\n  }\n\n  /**\n   * Derive a public key from another key, a seed, and a program ID.\n   * The program ID will also serve as the owner of the public key, giving\n   * it permission to write data to the account.\n   */\n  /* eslint-disable require-await */\n  static async createWithSeed(fromPublicKey, seed, programId) {\n    const buffer = node_modules_buffer.Buffer.concat([fromPublicKey.toBuffer(), node_modules_buffer.Buffer.from(seed), programId.toBuffer()]);\n    const publicKeyBytes = (0,esm_sha256/* sha256 */.J)(buffer);\n    return new PublicKey(publicKeyBytes);\n  }\n\n  /**\n   * Derive a program address from seeds and a program ID.\n   */\n  /* eslint-disable require-await */\n  static createProgramAddressSync(seeds, programId) {\n    let buffer = node_modules_buffer.Buffer.alloc(0);\n    seeds.forEach(function (seed) {\n      if (seed.length > MAX_SEED_LENGTH) {\n        throw new TypeError(`Max seed length exceeded`);\n      }\n      buffer = node_modules_buffer.Buffer.concat([buffer, toBuffer(seed)]);\n    });\n    buffer = node_modules_buffer.Buffer.concat([buffer, programId.toBuffer(), node_modules_buffer.Buffer.from('ProgramDerivedAddress')]);\n    const publicKeyBytes = (0,esm_sha256/* sha256 */.J)(buffer);\n    if (isOnCurve(publicKeyBytes)) {\n      throw new Error(`Invalid seeds, address must fall off the curve`);\n    }\n    return new PublicKey(publicKeyBytes);\n  }\n\n  /**\n   * Async version of createProgramAddressSync\n   * For backwards compatibility\n   *\n   * @deprecated Use {@link createProgramAddressSync} instead\n   */\n  /* eslint-disable require-await */\n  static async createProgramAddress(seeds, programId) {\n    return this.createProgramAddressSync(seeds, programId);\n  }\n\n  /**\n   * Find a valid program address\n   *\n   * Valid program addresses must fall off the ed25519 curve.  This function\n   * iterates a nonce until it finds one that when combined with the seeds\n   * results in a valid program address.\n   */\n  static findProgramAddressSync(seeds, programId) {\n    let nonce = 255;\n    let address;\n    while (nonce != 0) {\n      try {\n        const seedsWithNonce = seeds.concat(node_modules_buffer.Buffer.from([nonce]));\n        address = this.createProgramAddressSync(seedsWithNonce, programId);\n      } catch (err) {\n        if (err instanceof TypeError) {\n          throw err;\n        }\n        nonce--;\n        continue;\n      }\n      return [address, nonce];\n    }\n    throw new Error(`Unable to find a viable program address nonce`);\n  }\n\n  /**\n   * Async version of findProgramAddressSync\n   * For backwards compatibility\n   *\n   * @deprecated Use {@link findProgramAddressSync} instead\n   */\n  static async findProgramAddress(seeds, programId) {\n    return this.findProgramAddressSync(seeds, programId);\n  }\n\n  /**\n   * Check that a pubkey is on the ed25519 curve.\n   */\n  static isOnCurve(pubkeyData) {\n    const pubkey = new PublicKey(pubkeyData);\n    return isOnCurve(pubkey.toBytes());\n  }\n}\n_PublicKey = PublicKey;\nPublicKey.default = new _PublicKey('11111111111111111111111111111111');\nSOLANA_SCHEMA.set(PublicKey, {\n  kind: 'struct',\n  fields: [['_bn', 'u256']]\n});\n\n/**\n * An account key pair (public and secret keys).\n *\n * @deprecated since v1.10.0, please use {@link Keypair} instead.\n */\nclass Account {\n  /**\n   * Create a new Account object\n   *\n   * If the secretKey parameter is not provided a new key pair is randomly\n   * created for the account\n   *\n   * @param secretKey Secret key for the account\n   */\n  constructor(secretKey) {\n    /** @internal */\n    this._publicKey = void 0;\n    /** @internal */\n    this._secretKey = void 0;\n    if (secretKey) {\n      const secretKeyBuffer = toBuffer(secretKey);\n      if (secretKey.length !== 64) {\n        throw new Error('bad secret key size');\n      }\n      this._publicKey = secretKeyBuffer.slice(32, 64);\n      this._secretKey = secretKeyBuffer.slice(0, 32);\n    } else {\n      this._secretKey = toBuffer(generatePrivateKey());\n      this._publicKey = toBuffer(getPublicKey(this._secretKey));\n    }\n  }\n\n  /**\n   * The public key for this account\n   */\n  get publicKey() {\n    return new PublicKey(this._publicKey);\n  }\n\n  /**\n   * The **unencrypted** secret key for this account. The first 32 bytes\n   * is the private scalar and the last 32 bytes is the public key.\n   * Read more: https://blog.mozilla.org/warner/2011/11/29/ed25519-keys/\n   */\n  get secretKey() {\n    return node_modules_buffer.Buffer.concat([this._secretKey, this._publicKey], 64);\n  }\n}\n\nconst BPF_LOADER_DEPRECATED_PROGRAM_ID = new PublicKey('BPFLoader1111111111111111111111111111111111');\n\n/**\n * Maximum over-the-wire size of a Transaction\n *\n * 1280 is IPv6 minimum MTU\n * 40 bytes is the size of the IPv6 header\n * 8 bytes is the size of the fragment header\n */\nconst PACKET_DATA_SIZE = 1280 - 40 - 8;\nconst VERSION_PREFIX_MASK = 0x7f;\nconst SIGNATURE_LENGTH_IN_BYTES = 64;\n\nclass TransactionExpiredBlockheightExceededError extends Error {\n  constructor(signature) {\n    super(`Signature ${signature} has expired: block height exceeded.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredBlockheightExceededError.prototype, 'name', {\n  value: 'TransactionExpiredBlockheightExceededError'\n});\nclass TransactionExpiredTimeoutError extends Error {\n  constructor(signature, timeoutSeconds) {\n    super(`Transaction was not confirmed in ${timeoutSeconds.toFixed(2)} seconds. It is ` + 'unknown if it succeeded or failed. Check signature ' + `${signature} using the Solana Explorer or CLI tools.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredTimeoutError.prototype, 'name', {\n  value: 'TransactionExpiredTimeoutError'\n});\nclass TransactionExpiredNonceInvalidError extends Error {\n  constructor(signature) {\n    super(`Signature ${signature} has expired: the nonce is no longer valid.`);\n    this.signature = void 0;\n    this.signature = signature;\n  }\n}\nObject.defineProperty(TransactionExpiredNonceInvalidError.prototype, 'name', {\n  value: 'TransactionExpiredNonceInvalidError'\n});\n\nclass MessageAccountKeys {\n  constructor(staticAccountKeys, accountKeysFromLookups) {\n    this.staticAccountKeys = void 0;\n    this.accountKeysFromLookups = void 0;\n    this.staticAccountKeys = staticAccountKeys;\n    this.accountKeysFromLookups = accountKeysFromLookups;\n  }\n  keySegments() {\n    const keySegments = [this.staticAccountKeys];\n    if (this.accountKeysFromLookups) {\n      keySegments.push(this.accountKeysFromLookups.writable);\n      keySegments.push(this.accountKeysFromLookups.readonly);\n    }\n    return keySegments;\n  }\n  get(index) {\n    for (const keySegment of this.keySegments()) {\n      if (index < keySegment.length) {\n        return keySegment[index];\n      } else {\n        index -= keySegment.length;\n      }\n    }\n    return;\n  }\n  get length() {\n    return this.keySegments().flat().length;\n  }\n  compileInstructions(instructions) {\n    // Bail early if any account indexes would overflow a u8\n    const U8_MAX = 255;\n    if (this.length > U8_MAX + 1) {\n      throw new Error('Account index overflow encountered during compilation');\n    }\n    const keyIndexMap = new Map();\n    this.keySegments().flat().forEach((key, index) => {\n      keyIndexMap.set(key.toBase58(), index);\n    });\n    const findKeyIndex = key => {\n      const keyIndex = keyIndexMap.get(key.toBase58());\n      if (keyIndex === undefined) throw new Error('Encountered an unknown instruction account key during compilation');\n      return keyIndex;\n    };\n    return instructions.map(instruction => {\n      return {\n        programIdIndex: findKeyIndex(instruction.programId),\n        accountKeyIndexes: instruction.keys.map(meta => findKeyIndex(meta.pubkey)),\n        data: instruction.data\n      };\n    });\n  }\n}\n\n/**\n * Layout for a public key\n */\nconst publicKey = (property = 'publicKey') => {\n  return Layout.blob(32, property);\n};\n\n/**\n * Layout for a signature\n */\nconst signature = (property = 'signature') => {\n  return Layout.blob(64, property);\n};\n/**\n * Layout for a Rust String type\n */\nconst rustString = (property = 'string') => {\n  const rsl = Layout.struct([Layout.u32('length'), Layout.u32('lengthPadding'), Layout.blob(Layout.offset(Layout.u32(), -8), 'chars')], property);\n  const _decode = rsl.decode.bind(rsl);\n  const _encode = rsl.encode.bind(rsl);\n  const rslShim = rsl;\n  rslShim.decode = (b, offset) => {\n    const data = _decode(b, offset);\n    return data['chars'].toString();\n  };\n  rslShim.encode = (str, b, offset) => {\n    const data = {\n      chars: node_modules_buffer.Buffer.from(str, 'utf8')\n    };\n    return _encode(data, b, offset);\n  };\n  rslShim.alloc = str => {\n    return Layout.u32().span + Layout.u32().span + node_modules_buffer.Buffer.from(str, 'utf8').length;\n  };\n  return rslShim;\n};\n\n/**\n * Layout for an Authorized object\n */\nconst authorized = (property = 'authorized') => {\n  return Layout.struct([publicKey('staker'), publicKey('withdrawer')], property);\n};\n\n/**\n * Layout for a Lockup object\n */\nconst lockup = (property = 'lockup') => {\n  return Layout.struct([Layout.ns64('unixTimestamp'), Layout.ns64('epoch'), publicKey('custodian')], property);\n};\n\n/**\n *  Layout for a VoteInit object\n */\nconst voteInit = (property = 'voteInit') => {\n  return Layout.struct([publicKey('nodePubkey'), publicKey('authorizedVoter'), publicKey('authorizedWithdrawer'), Layout.u8('commission')], property);\n};\n\n/**\n *  Layout for a VoteAuthorizeWithSeedArgs object\n */\nconst voteAuthorizeWithSeedArgs = (property = 'voteAuthorizeWithSeedArgs') => {\n  return Layout.struct([Layout.u32('voteAuthorizationType'), publicKey('currentAuthorityDerivedKeyOwnerPubkey'), rustString('currentAuthorityDerivedKeySeed'), publicKey('newAuthorized')], property);\n};\nfunction getAlloc(type, fields) {\n  const getItemAlloc = item => {\n    if (item.span >= 0) {\n      return item.span;\n    } else if (typeof item.alloc === 'function') {\n      return item.alloc(fields[item.property]);\n    } else if ('count' in item && 'elementLayout' in item) {\n      const field = fields[item.property];\n      if (Array.isArray(field)) {\n        return field.length * getItemAlloc(item.elementLayout);\n      }\n    } else if ('fields' in item) {\n      // This is a `Structure` whose size needs to be recursively measured.\n      return getAlloc({\n        layout: item\n      }, fields[item.property]);\n    }\n    // Couldn't determine allocated size of layout\n    return 0;\n  };\n  let alloc = 0;\n  type.layout.fields.forEach(item => {\n    alloc += getItemAlloc(item);\n  });\n  return alloc;\n}\n\nfunction decodeLength(bytes) {\n  let len = 0;\n  let size = 0;\n  for (;;) {\n    let elem = bytes.shift();\n    len |= (elem & 0x7f) << size * 7;\n    size += 1;\n    if ((elem & 0x80) === 0) {\n      break;\n    }\n  }\n  return len;\n}\nfunction encodeLength(bytes, len) {\n  let rem_len = len;\n  for (;;) {\n    let elem = rem_len & 0x7f;\n    rem_len >>= 7;\n    if (rem_len == 0) {\n      bytes.push(elem);\n      break;\n    } else {\n      elem |= 0x80;\n      bytes.push(elem);\n    }\n  }\n}\n\nfunction index_browser_esm_assert (condition, message) {\n  if (!condition) {\n    throw new Error(message || 'Assertion failed');\n  }\n}\n\nclass CompiledKeys {\n  constructor(payer, keyMetaMap) {\n    this.payer = void 0;\n    this.keyMetaMap = void 0;\n    this.payer = payer;\n    this.keyMetaMap = keyMetaMap;\n  }\n  static compile(instructions, payer) {\n    const keyMetaMap = new Map();\n    const getOrInsertDefault = pubkey => {\n      const address = pubkey.toBase58();\n      let keyMeta = keyMetaMap.get(address);\n      if (keyMeta === undefined) {\n        keyMeta = {\n          isSigner: false,\n          isWritable: false,\n          isInvoked: false\n        };\n        keyMetaMap.set(address, keyMeta);\n      }\n      return keyMeta;\n    };\n    const payerKeyMeta = getOrInsertDefault(payer);\n    payerKeyMeta.isSigner = true;\n    payerKeyMeta.isWritable = true;\n    for (const ix of instructions) {\n      getOrInsertDefault(ix.programId).isInvoked = true;\n      for (const accountMeta of ix.keys) {\n        const keyMeta = getOrInsertDefault(accountMeta.pubkey);\n        keyMeta.isSigner ||= accountMeta.isSigner;\n        keyMeta.isWritable ||= accountMeta.isWritable;\n      }\n    }\n    return new CompiledKeys(payer, keyMetaMap);\n  }\n  getMessageComponents() {\n    const mapEntries = [...this.keyMetaMap.entries()];\n    index_browser_esm_assert(mapEntries.length <= 256, 'Max static account keys length exceeded');\n    const writableSigners = mapEntries.filter(([, meta]) => meta.isSigner && meta.isWritable);\n    const readonlySigners = mapEntries.filter(([, meta]) => meta.isSigner && !meta.isWritable);\n    const writableNonSigners = mapEntries.filter(([, meta]) => !meta.isSigner && meta.isWritable);\n    const readonlyNonSigners = mapEntries.filter(([, meta]) => !meta.isSigner && !meta.isWritable);\n    const header = {\n      numRequiredSignatures: writableSigners.length + readonlySigners.length,\n      numReadonlySignedAccounts: readonlySigners.length,\n      numReadonlyUnsignedAccounts: readonlyNonSigners.length\n    };\n\n    // sanity checks\n    {\n      index_browser_esm_assert(writableSigners.length > 0, 'Expected at least one writable signer key');\n      const [payerAddress] = writableSigners[0];\n      index_browser_esm_assert(payerAddress === this.payer.toBase58(), 'Expected first writable signer key to be the fee payer');\n    }\n    const staticAccountKeys = [...writableSigners.map(([address]) => new PublicKey(address)), ...readonlySigners.map(([address]) => new PublicKey(address)), ...writableNonSigners.map(([address]) => new PublicKey(address)), ...readonlyNonSigners.map(([address]) => new PublicKey(address))];\n    return [header, staticAccountKeys];\n  }\n  extractTableLookup(lookupTable) {\n    const [writableIndexes, drainedWritableKeys] = this.drainKeysFoundInLookupTable(lookupTable.state.addresses, keyMeta => !keyMeta.isSigner && !keyMeta.isInvoked && keyMeta.isWritable);\n    const [readonlyIndexes, drainedReadonlyKeys] = this.drainKeysFoundInLookupTable(lookupTable.state.addresses, keyMeta => !keyMeta.isSigner && !keyMeta.isInvoked && !keyMeta.isWritable);\n\n    // Don't extract lookup if no keys were found\n    if (writableIndexes.length === 0 && readonlyIndexes.length === 0) {\n      return;\n    }\n    return [{\n      accountKey: lookupTable.key,\n      writableIndexes,\n      readonlyIndexes\n    }, {\n      writable: drainedWritableKeys,\n      readonly: drainedReadonlyKeys\n    }];\n  }\n\n  /** @internal */\n  drainKeysFoundInLookupTable(lookupTableEntries, keyMetaFilter) {\n    const lookupTableIndexes = new Array();\n    const drainedKeys = new Array();\n    for (const [address, keyMeta] of this.keyMetaMap.entries()) {\n      if (keyMetaFilter(keyMeta)) {\n        const key = new PublicKey(address);\n        const lookupTableIndex = lookupTableEntries.findIndex(entry => entry.equals(key));\n        if (lookupTableIndex >= 0) {\n          index_browser_esm_assert(lookupTableIndex < 256, 'Max lookup table index exceeded');\n          lookupTableIndexes.push(lookupTableIndex);\n          drainedKeys.push(key);\n          this.keyMetaMap.delete(address);\n        }\n      }\n    }\n    return [lookupTableIndexes, drainedKeys];\n  }\n}\n\nconst END_OF_BUFFER_ERROR_MESSAGE = 'Reached end of buffer unexpectedly';\n\n/**\n * Delegates to `Array#shift`, but throws if the array is zero-length.\n */\nfunction guardedShift(byteArray) {\n  if (byteArray.length === 0) {\n    throw new Error(END_OF_BUFFER_ERROR_MESSAGE);\n  }\n  return byteArray.shift();\n}\n\n/**\n * Delegates to `Array#splice`, but throws if the section being spliced out extends past the end of\n * the array.\n */\nfunction guardedSplice(byteArray, ...args) {\n  const [start] = args;\n  if (args.length === 2 // Implies that `deleteCount` was supplied\n  ? start + (args[1] ?? 0) > byteArray.length : start >= byteArray.length) {\n    throw new Error(END_OF_BUFFER_ERROR_MESSAGE);\n  }\n  return byteArray.splice(...args);\n}\n\n/**\n * An instruction to execute by a program\n *\n * @property {number} programIdIndex\n * @property {number[]} accounts\n * @property {string} data\n */\n\n/**\n * Message constructor arguments\n */\n\n/**\n * List of instructions to be processed atomically\n */\nclass Message {\n  constructor(args) {\n    this.header = void 0;\n    this.accountKeys = void 0;\n    this.recentBlockhash = void 0;\n    this.instructions = void 0;\n    this.indexToProgramIds = new Map();\n    this.header = args.header;\n    this.accountKeys = args.accountKeys.map(account => new PublicKey(account));\n    this.recentBlockhash = args.recentBlockhash;\n    this.instructions = args.instructions;\n    this.instructions.forEach(ix => this.indexToProgramIds.set(ix.programIdIndex, this.accountKeys[ix.programIdIndex]));\n  }\n  get version() {\n    return 'legacy';\n  }\n  get staticAccountKeys() {\n    return this.accountKeys;\n  }\n  get compiledInstructions() {\n    return this.instructions.map(ix => ({\n      programIdIndex: ix.programIdIndex,\n      accountKeyIndexes: ix.accounts,\n      data: bs58_default().decode(ix.data)\n    }));\n  }\n  get addressTableLookups() {\n    return [];\n  }\n  getAccountKeys() {\n    return new MessageAccountKeys(this.staticAccountKeys);\n  }\n  static compile(args) {\n    const compiledKeys = CompiledKeys.compile(args.instructions, args.payerKey);\n    const [header, staticAccountKeys] = compiledKeys.getMessageComponents();\n    const accountKeys = new MessageAccountKeys(staticAccountKeys);\n    const instructions = accountKeys.compileInstructions(args.instructions).map(ix => ({\n      programIdIndex: ix.programIdIndex,\n      accounts: ix.accountKeyIndexes,\n      data: bs58_default().encode(ix.data)\n    }));\n    return new Message({\n      header,\n      accountKeys: staticAccountKeys,\n      recentBlockhash: args.recentBlockhash,\n      instructions\n    });\n  }\n  isAccountSigner(index) {\n    return index < this.header.numRequiredSignatures;\n  }\n  isAccountWritable(index) {\n    const numSignedAccounts = this.header.numRequiredSignatures;\n    if (index >= this.header.numRequiredSignatures) {\n      const unsignedAccountIndex = index - numSignedAccounts;\n      const numUnsignedAccounts = this.accountKeys.length - numSignedAccounts;\n      const numWritableUnsignedAccounts = numUnsignedAccounts - this.header.numReadonlyUnsignedAccounts;\n      return unsignedAccountIndex < numWritableUnsignedAccounts;\n    } else {\n      const numWritableSignedAccounts = numSignedAccounts - this.header.numReadonlySignedAccounts;\n      return index < numWritableSignedAccounts;\n    }\n  }\n  isProgramId(index) {\n    return this.indexToProgramIds.has(index);\n  }\n  programIds() {\n    return [...this.indexToProgramIds.values()];\n  }\n  nonProgramIds() {\n    return this.accountKeys.filter((_, index) => !this.isProgramId(index));\n  }\n  serialize() {\n    const numKeys = this.accountKeys.length;\n    let keyCount = [];\n    encodeLength(keyCount, numKeys);\n    const instructions = this.instructions.map(instruction => {\n      const {\n        accounts,\n        programIdIndex\n      } = instruction;\n      const data = Array.from(bs58_default().decode(instruction.data));\n      let keyIndicesCount = [];\n      encodeLength(keyIndicesCount, accounts.length);\n      let dataCount = [];\n      encodeLength(dataCount, data.length);\n      return {\n        programIdIndex,\n        keyIndicesCount: node_modules_buffer.Buffer.from(keyIndicesCount),\n        keyIndices: accounts,\n        dataLength: node_modules_buffer.Buffer.from(dataCount),\n        data\n      };\n    });\n    let instructionCount = [];\n    encodeLength(instructionCount, instructions.length);\n    let instructionBuffer = node_modules_buffer.Buffer.alloc(PACKET_DATA_SIZE);\n    node_modules_buffer.Buffer.from(instructionCount).copy(instructionBuffer);\n    let instructionBufferLength = instructionCount.length;\n    instructions.forEach(instruction => {\n      const instructionLayout = Layout.struct([Layout.u8('programIdIndex'), Layout.blob(instruction.keyIndicesCount.length, 'keyIndicesCount'), Layout.seq(Layout.u8('keyIndex'), instruction.keyIndices.length, 'keyIndices'), Layout.blob(instruction.dataLength.length, 'dataLength'), Layout.seq(Layout.u8('userdatum'), instruction.data.length, 'data')]);\n      const length = instructionLayout.encode(instruction, instructionBuffer, instructionBufferLength);\n      instructionBufferLength += length;\n    });\n    instructionBuffer = instructionBuffer.slice(0, instructionBufferLength);\n    const signDataLayout = Layout.struct([Layout.blob(1, 'numRequiredSignatures'), Layout.blob(1, 'numReadonlySignedAccounts'), Layout.blob(1, 'numReadonlyUnsignedAccounts'), Layout.blob(keyCount.length, 'keyCount'), Layout.seq(publicKey('key'), numKeys, 'keys'), publicKey('recentBlockhash')]);\n    const transaction = {\n      numRequiredSignatures: node_modules_buffer.Buffer.from([this.header.numRequiredSignatures]),\n      numReadonlySignedAccounts: node_modules_buffer.Buffer.from([this.header.numReadonlySignedAccounts]),\n      numReadonlyUnsignedAccounts: node_modules_buffer.Buffer.from([this.header.numReadonlyUnsignedAccounts]),\n      keyCount: node_modules_buffer.Buffer.from(keyCount),\n      keys: this.accountKeys.map(key => toBuffer(key.toBytes())),\n      recentBlockhash: bs58_default().decode(this.recentBlockhash)\n    };\n    let signData = node_modules_buffer.Buffer.alloc(2048);\n    const length = signDataLayout.encode(transaction, signData);\n    instructionBuffer.copy(signData, length);\n    return signData.slice(0, length + instructionBuffer.length);\n  }\n\n  /**\n   * Decode a compiled message into a Message object.\n   */\n  static from(buffer) {\n    // Slice up wire data\n    let byteArray = [...buffer];\n    const numRequiredSignatures = guardedShift(byteArray);\n    if (numRequiredSignatures !== (numRequiredSignatures & VERSION_PREFIX_MASK)) {\n      throw new Error('Versioned messages must be deserialized with VersionedMessage.deserialize()');\n    }\n    const numReadonlySignedAccounts = guardedShift(byteArray);\n    const numReadonlyUnsignedAccounts = guardedShift(byteArray);\n    const accountCount = decodeLength(byteArray);\n    let accountKeys = [];\n    for (let i = 0; i < accountCount; i++) {\n      const account = guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH);\n      accountKeys.push(new PublicKey(node_modules_buffer.Buffer.from(account)));\n    }\n    const recentBlockhash = guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH);\n    const instructionCount = decodeLength(byteArray);\n    let instructions = [];\n    for (let i = 0; i < instructionCount; i++) {\n      const programIdIndex = guardedShift(byteArray);\n      const accountCount = decodeLength(byteArray);\n      const accounts = guardedSplice(byteArray, 0, accountCount);\n      const dataLength = decodeLength(byteArray);\n      const dataSlice = guardedSplice(byteArray, 0, dataLength);\n      const data = bs58_default().encode(node_modules_buffer.Buffer.from(dataSlice));\n      instructions.push({\n        programIdIndex,\n        accounts,\n        data\n      });\n    }\n    const messageArgs = {\n      header: {\n        numRequiredSignatures,\n        numReadonlySignedAccounts,\n        numReadonlyUnsignedAccounts\n      },\n      recentBlockhash: bs58_default().encode(node_modules_buffer.Buffer.from(recentBlockhash)),\n      accountKeys,\n      instructions\n    };\n    return new Message(messageArgs);\n  }\n}\n\n/**\n * Message constructor arguments\n */\n\nclass MessageV0 {\n  constructor(args) {\n    this.header = void 0;\n    this.staticAccountKeys = void 0;\n    this.recentBlockhash = void 0;\n    this.compiledInstructions = void 0;\n    this.addressTableLookups = void 0;\n    this.header = args.header;\n    this.staticAccountKeys = args.staticAccountKeys;\n    this.recentBlockhash = args.recentBlockhash;\n    this.compiledInstructions = args.compiledInstructions;\n    this.addressTableLookups = args.addressTableLookups;\n  }\n  get version() {\n    return 0;\n  }\n  get numAccountKeysFromLookups() {\n    let count = 0;\n    for (const lookup of this.addressTableLookups) {\n      count += lookup.readonlyIndexes.length + lookup.writableIndexes.length;\n    }\n    return count;\n  }\n  getAccountKeys(args) {\n    let accountKeysFromLookups;\n    if (args && 'accountKeysFromLookups' in args && args.accountKeysFromLookups) {\n      if (this.numAccountKeysFromLookups != args.accountKeysFromLookups.writable.length + args.accountKeysFromLookups.readonly.length) {\n        throw new Error('Failed to get account keys because of a mismatch in the number of account keys from lookups');\n      }\n      accountKeysFromLookups = args.accountKeysFromLookups;\n    } else if (args && 'addressLookupTableAccounts' in args && args.addressLookupTableAccounts) {\n      accountKeysFromLookups = this.resolveAddressTableLookups(args.addressLookupTableAccounts);\n    } else if (this.addressTableLookups.length > 0) {\n      throw new Error('Failed to get account keys because address table lookups were not resolved');\n    }\n    return new MessageAccountKeys(this.staticAccountKeys, accountKeysFromLookups);\n  }\n  isAccountSigner(index) {\n    return index < this.header.numRequiredSignatures;\n  }\n  isAccountWritable(index) {\n    const numSignedAccounts = this.header.numRequiredSignatures;\n    const numStaticAccountKeys = this.staticAccountKeys.length;\n    if (index >= numStaticAccountKeys) {\n      const lookupAccountKeysIndex = index - numStaticAccountKeys;\n      const numWritableLookupAccountKeys = this.addressTableLookups.reduce((count, lookup) => count + lookup.writableIndexes.length, 0);\n      return lookupAccountKeysIndex < numWritableLookupAccountKeys;\n    } else if (index >= this.header.numRequiredSignatures) {\n      const unsignedAccountIndex = index - numSignedAccounts;\n      const numUnsignedAccounts = numStaticAccountKeys - numSignedAccounts;\n      const numWritableUnsignedAccounts = numUnsignedAccounts - this.header.numReadonlyUnsignedAccounts;\n      return unsignedAccountIndex < numWritableUnsignedAccounts;\n    } else {\n      const numWritableSignedAccounts = numSignedAccounts - this.header.numReadonlySignedAccounts;\n      return index < numWritableSignedAccounts;\n    }\n  }\n  resolveAddressTableLookups(addressLookupTableAccounts) {\n    const accountKeysFromLookups = {\n      writable: [],\n      readonly: []\n    };\n    for (const tableLookup of this.addressTableLookups) {\n      const tableAccount = addressLookupTableAccounts.find(account => account.key.equals(tableLookup.accountKey));\n      if (!tableAccount) {\n        throw new Error(`Failed to find address lookup table account for table key ${tableLookup.accountKey.toBase58()}`);\n      }\n      for (const index of tableLookup.writableIndexes) {\n        if (index < tableAccount.state.addresses.length) {\n          accountKeysFromLookups.writable.push(tableAccount.state.addresses[index]);\n        } else {\n          throw new Error(`Failed to find address for index ${index} in address lookup table ${tableLookup.accountKey.toBase58()}`);\n        }\n      }\n      for (const index of tableLookup.readonlyIndexes) {\n        if (index < tableAccount.state.addresses.length) {\n          accountKeysFromLookups.readonly.push(tableAccount.state.addresses[index]);\n        } else {\n          throw new Error(`Failed to find address for index ${index} in address lookup table ${tableLookup.accountKey.toBase58()}`);\n        }\n      }\n    }\n    return accountKeysFromLookups;\n  }\n  static compile(args) {\n    const compiledKeys = CompiledKeys.compile(args.instructions, args.payerKey);\n    const addressTableLookups = new Array();\n    const accountKeysFromLookups = {\n      writable: new Array(),\n      readonly: new Array()\n    };\n    const lookupTableAccounts = args.addressLookupTableAccounts || [];\n    for (const lookupTable of lookupTableAccounts) {\n      const extractResult = compiledKeys.extractTableLookup(lookupTable);\n      if (extractResult !== undefined) {\n        const [addressTableLookup, {\n          writable,\n          readonly\n        }] = extractResult;\n        addressTableLookups.push(addressTableLookup);\n        accountKeysFromLookups.writable.push(...writable);\n        accountKeysFromLookups.readonly.push(...readonly);\n      }\n    }\n    const [header, staticAccountKeys] = compiledKeys.getMessageComponents();\n    const accountKeys = new MessageAccountKeys(staticAccountKeys, accountKeysFromLookups);\n    const compiledInstructions = accountKeys.compileInstructions(args.instructions);\n    return new MessageV0({\n      header,\n      staticAccountKeys,\n      recentBlockhash: args.recentBlockhash,\n      compiledInstructions,\n      addressTableLookups\n    });\n  }\n  serialize() {\n    const encodedStaticAccountKeysLength = Array();\n    encodeLength(encodedStaticAccountKeysLength, this.staticAccountKeys.length);\n    const serializedInstructions = this.serializeInstructions();\n    const encodedInstructionsLength = Array();\n    encodeLength(encodedInstructionsLength, this.compiledInstructions.length);\n    const serializedAddressTableLookups = this.serializeAddressTableLookups();\n    const encodedAddressTableLookupsLength = Array();\n    encodeLength(encodedAddressTableLookupsLength, this.addressTableLookups.length);\n    const messageLayout = Layout.struct([Layout.u8('prefix'), Layout.struct([Layout.u8('numRequiredSignatures'), Layout.u8('numReadonlySignedAccounts'), Layout.u8('numReadonlyUnsignedAccounts')], 'header'), Layout.blob(encodedStaticAccountKeysLength.length, 'staticAccountKeysLength'), Layout.seq(publicKey(), this.staticAccountKeys.length, 'staticAccountKeys'), publicKey('recentBlockhash'), Layout.blob(encodedInstructionsLength.length, 'instructionsLength'), Layout.blob(serializedInstructions.length, 'serializedInstructions'), Layout.blob(encodedAddressTableLookupsLength.length, 'addressTableLookupsLength'), Layout.blob(serializedAddressTableLookups.length, 'serializedAddressTableLookups')]);\n    const serializedMessage = new Uint8Array(PACKET_DATA_SIZE);\n    const MESSAGE_VERSION_0_PREFIX = 1 << 7;\n    const serializedMessageLength = messageLayout.encode({\n      prefix: MESSAGE_VERSION_0_PREFIX,\n      header: this.header,\n      staticAccountKeysLength: new Uint8Array(encodedStaticAccountKeysLength),\n      staticAccountKeys: this.staticAccountKeys.map(key => key.toBytes()),\n      recentBlockhash: bs58_default().decode(this.recentBlockhash),\n      instructionsLength: new Uint8Array(encodedInstructionsLength),\n      serializedInstructions,\n      addressTableLookupsLength: new Uint8Array(encodedAddressTableLookupsLength),\n      serializedAddressTableLookups\n    }, serializedMessage);\n    return serializedMessage.slice(0, serializedMessageLength);\n  }\n  serializeInstructions() {\n    let serializedLength = 0;\n    const serializedInstructions = new Uint8Array(PACKET_DATA_SIZE);\n    for (const instruction of this.compiledInstructions) {\n      const encodedAccountKeyIndexesLength = Array();\n      encodeLength(encodedAccountKeyIndexesLength, instruction.accountKeyIndexes.length);\n      const encodedDataLength = Array();\n      encodeLength(encodedDataLength, instruction.data.length);\n      const instructionLayout = Layout.struct([Layout.u8('programIdIndex'), Layout.blob(encodedAccountKeyIndexesLength.length, 'encodedAccountKeyIndexesLength'), Layout.seq(Layout.u8(), instruction.accountKeyIndexes.length, 'accountKeyIndexes'), Layout.blob(encodedDataLength.length, 'encodedDataLength'), Layout.blob(instruction.data.length, 'data')]);\n      serializedLength += instructionLayout.encode({\n        programIdIndex: instruction.programIdIndex,\n        encodedAccountKeyIndexesLength: new Uint8Array(encodedAccountKeyIndexesLength),\n        accountKeyIndexes: instruction.accountKeyIndexes,\n        encodedDataLength: new Uint8Array(encodedDataLength),\n        data: instruction.data\n      }, serializedInstructions, serializedLength);\n    }\n    return serializedInstructions.slice(0, serializedLength);\n  }\n  serializeAddressTableLookups() {\n    let serializedLength = 0;\n    const serializedAddressTableLookups = new Uint8Array(PACKET_DATA_SIZE);\n    for (const lookup of this.addressTableLookups) {\n      const encodedWritableIndexesLength = Array();\n      encodeLength(encodedWritableIndexesLength, lookup.writableIndexes.length);\n      const encodedReadonlyIndexesLength = Array();\n      encodeLength(encodedReadonlyIndexesLength, lookup.readonlyIndexes.length);\n      const addressTableLookupLayout = Layout.struct([publicKey('accountKey'), Layout.blob(encodedWritableIndexesLength.length, 'encodedWritableIndexesLength'), Layout.seq(Layout.u8(), lookup.writableIndexes.length, 'writableIndexes'), Layout.blob(encodedReadonlyIndexesLength.length, 'encodedReadonlyIndexesLength'), Layout.seq(Layout.u8(), lookup.readonlyIndexes.length, 'readonlyIndexes')]);\n      serializedLength += addressTableLookupLayout.encode({\n        accountKey: lookup.accountKey.toBytes(),\n        encodedWritableIndexesLength: new Uint8Array(encodedWritableIndexesLength),\n        writableIndexes: lookup.writableIndexes,\n        encodedReadonlyIndexesLength: new Uint8Array(encodedReadonlyIndexesLength),\n        readonlyIndexes: lookup.readonlyIndexes\n      }, serializedAddressTableLookups, serializedLength);\n    }\n    return serializedAddressTableLookups.slice(0, serializedLength);\n  }\n  static deserialize(serializedMessage) {\n    let byteArray = [...serializedMessage];\n    const prefix = guardedShift(byteArray);\n    const maskedPrefix = prefix & VERSION_PREFIX_MASK;\n    index_browser_esm_assert(prefix !== maskedPrefix, `Expected versioned message but received legacy message`);\n    const version = maskedPrefix;\n    index_browser_esm_assert(version === 0, `Expected versioned message with version 0 but found version ${version}`);\n    const header = {\n      numRequiredSignatures: guardedShift(byteArray),\n      numReadonlySignedAccounts: guardedShift(byteArray),\n      numReadonlyUnsignedAccounts: guardedShift(byteArray)\n    };\n    const staticAccountKeys = [];\n    const staticAccountKeysLength = decodeLength(byteArray);\n    for (let i = 0; i < staticAccountKeysLength; i++) {\n      staticAccountKeys.push(new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH)));\n    }\n    const recentBlockhash = bs58_default().encode(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n    const instructionCount = decodeLength(byteArray);\n    const compiledInstructions = [];\n    for (let i = 0; i < instructionCount; i++) {\n      const programIdIndex = guardedShift(byteArray);\n      const accountKeyIndexesLength = decodeLength(byteArray);\n      const accountKeyIndexes = guardedSplice(byteArray, 0, accountKeyIndexesLength);\n      const dataLength = decodeLength(byteArray);\n      const data = new Uint8Array(guardedSplice(byteArray, 0, dataLength));\n      compiledInstructions.push({\n        programIdIndex,\n        accountKeyIndexes,\n        data\n      });\n    }\n    const addressTableLookupsCount = decodeLength(byteArray);\n    const addressTableLookups = [];\n    for (let i = 0; i < addressTableLookupsCount; i++) {\n      const accountKey = new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n      const writableIndexesLength = decodeLength(byteArray);\n      const writableIndexes = guardedSplice(byteArray, 0, writableIndexesLength);\n      const readonlyIndexesLength = decodeLength(byteArray);\n      const readonlyIndexes = guardedSplice(byteArray, 0, readonlyIndexesLength);\n      addressTableLookups.push({\n        accountKey,\n        writableIndexes,\n        readonlyIndexes\n      });\n    }\n    return new MessageV0({\n      header,\n      staticAccountKeys,\n      recentBlockhash,\n      compiledInstructions,\n      addressTableLookups\n    });\n  }\n}\n\n// eslint-disable-next-line no-redeclare\nconst VersionedMessage = {\n  deserializeMessageVersion(serializedMessage) {\n    const prefix = serializedMessage[0];\n    const maskedPrefix = prefix & VERSION_PREFIX_MASK;\n\n    // if the highest bit of the prefix is not set, the message is not versioned\n    if (maskedPrefix === prefix) {\n      return 'legacy';\n    }\n\n    // the lower 7 bits of the prefix indicate the message version\n    return maskedPrefix;\n  },\n  deserialize: serializedMessage => {\n    const version = VersionedMessage.deserializeMessageVersion(serializedMessage);\n    if (version === 'legacy') {\n      return Message.from(serializedMessage);\n    }\n    if (version === 0) {\n      return MessageV0.deserialize(serializedMessage);\n    } else {\n      throw new Error(`Transaction message version ${version} deserialization is not supported`);\n    }\n  }\n};\n\n/** @internal */\n\n/**\n * Transaction signature as base-58 encoded string\n */\n\nlet TransactionStatus = /*#__PURE__*/function (TransactionStatus) {\n  TransactionStatus[TransactionStatus[\"BLOCKHEIGHT_EXCEEDED\"] = 0] = \"BLOCKHEIGHT_EXCEEDED\";\n  TransactionStatus[TransactionStatus[\"PROCESSED\"] = 1] = \"PROCESSED\";\n  TransactionStatus[TransactionStatus[\"TIMED_OUT\"] = 2] = \"TIMED_OUT\";\n  TransactionStatus[TransactionStatus[\"NONCE_INVALID\"] = 3] = \"NONCE_INVALID\";\n  return TransactionStatus;\n}({});\n\n/**\n * Default (empty) signature\n */\nconst DEFAULT_SIGNATURE = node_modules_buffer.Buffer.alloc(SIGNATURE_LENGTH_IN_BYTES).fill(0);\n\n/**\n * Account metadata used to define instructions\n */\n\n/**\n * List of TransactionInstruction object fields that may be initialized at construction\n */\n\n/**\n * Configuration object for Transaction.serialize()\n */\n\n/**\n * @internal\n */\n\n/**\n * Transaction Instruction class\n */\nclass TransactionInstruction {\n  constructor(opts) {\n    /**\n     * Public keys to include in this transaction\n     * Boolean represents whether this pubkey needs to sign the transaction\n     */\n    this.keys = void 0;\n    /**\n     * Program Id to execute\n     */\n    this.programId = void 0;\n    /**\n     * Program input\n     */\n    this.data = node_modules_buffer.Buffer.alloc(0);\n    this.programId = opts.programId;\n    this.keys = opts.keys;\n    if (opts.data) {\n      this.data = opts.data;\n    }\n  }\n\n  /**\n   * @internal\n   */\n  toJSON() {\n    return {\n      keys: this.keys.map(({\n        pubkey,\n        isSigner,\n        isWritable\n      }) => ({\n        pubkey: pubkey.toJSON(),\n        isSigner,\n        isWritable\n      })),\n      programId: this.programId.toJSON(),\n      data: [...this.data]\n    };\n  }\n}\n\n/**\n * Pair of signature and corresponding public key\n */\n\n/**\n * List of Transaction object fields that may be initialized at construction\n */\n\n// For backward compatibility; an unfortunate consequence of being\n// forced to over-export types by the documentation generator.\n// See https://github.com/solana-labs/solana/pull/25820\n\n/**\n * Blockhash-based transactions have a lifetime that are defined by\n * the blockhash they include. Any transaction whose blockhash is\n * too old will be rejected.\n */\n\n/**\n * Use these options to construct a durable nonce transaction.\n */\n\n/**\n * Nonce information to be used to build an offline Transaction.\n */\n\n/**\n * @internal\n */\n\n/**\n * Transaction class\n */\nclass Transaction {\n  /**\n   * The first (payer) Transaction signature\n   *\n   * @returns {Buffer | null} Buffer of payer's signature\n   */\n  get signature() {\n    if (this.signatures.length > 0) {\n      return this.signatures[0].signature;\n    }\n    return null;\n  }\n\n  /**\n   * The transaction fee payer\n   */\n\n  // Construct a transaction with a blockhash and lastValidBlockHeight\n\n  // Construct a transaction using a durable nonce\n\n  /**\n   * @deprecated `TransactionCtorFields` has been deprecated and will be removed in a future version.\n   * Please supply a `TransactionBlockhashCtor` instead.\n   */\n\n  /**\n   * Construct an empty Transaction\n   */\n  constructor(opts) {\n    /**\n     * Signatures for the transaction.  Typically created by invoking the\n     * `sign()` method\n     */\n    this.signatures = [];\n    this.feePayer = void 0;\n    /**\n     * The instructions to atomically execute\n     */\n    this.instructions = [];\n    /**\n     * A recent transaction id. Must be populated by the caller\n     */\n    this.recentBlockhash = void 0;\n    /**\n     * the last block chain can advance to before tx is declared expired\n     * */\n    this.lastValidBlockHeight = void 0;\n    /**\n     * Optional Nonce information. If populated, transaction will use a durable\n     * Nonce hash instead of a recentBlockhash. Must be populated by the caller\n     */\n    this.nonceInfo = void 0;\n    /**\n     * If this is a nonce transaction this represents the minimum slot from which\n     * to evaluate if the nonce has advanced when attempting to confirm the\n     * transaction. This protects against a case where the transaction confirmation\n     * logic loads the nonce account from an old slot and assumes the mismatch in\n     * nonce value implies that the nonce has been advanced.\n     */\n    this.minNonceContextSlot = void 0;\n    /**\n     * @internal\n     */\n    this._message = void 0;\n    /**\n     * @internal\n     */\n    this._json = void 0;\n    if (!opts) {\n      return;\n    }\n    if (opts.feePayer) {\n      this.feePayer = opts.feePayer;\n    }\n    if (opts.signatures) {\n      this.signatures = opts.signatures;\n    }\n    if (Object.prototype.hasOwnProperty.call(opts, 'nonceInfo')) {\n      const {\n        minContextSlot,\n        nonceInfo\n      } = opts;\n      this.minNonceContextSlot = minContextSlot;\n      this.nonceInfo = nonceInfo;\n    } else if (Object.prototype.hasOwnProperty.call(opts, 'lastValidBlockHeight')) {\n      const {\n        blockhash,\n        lastValidBlockHeight\n      } = opts;\n      this.recentBlockhash = blockhash;\n      this.lastValidBlockHeight = lastValidBlockHeight;\n    } else {\n      const {\n        recentBlockhash,\n        nonceInfo\n      } = opts;\n      if (nonceInfo) {\n        this.nonceInfo = nonceInfo;\n      }\n      this.recentBlockhash = recentBlockhash;\n    }\n  }\n\n  /**\n   * @internal\n   */\n  toJSON() {\n    return {\n      recentBlockhash: this.recentBlockhash || null,\n      feePayer: this.feePayer ? this.feePayer.toJSON() : null,\n      nonceInfo: this.nonceInfo ? {\n        nonce: this.nonceInfo.nonce,\n        nonceInstruction: this.nonceInfo.nonceInstruction.toJSON()\n      } : null,\n      instructions: this.instructions.map(instruction => instruction.toJSON()),\n      signers: this.signatures.map(({\n        publicKey\n      }) => {\n        return publicKey.toJSON();\n      })\n    };\n  }\n\n  /**\n   * Add one or more instructions to this Transaction\n   *\n   * @param {Array< Transaction | TransactionInstruction | TransactionInstructionCtorFields >} items - Instructions to add to the Transaction\n   */\n  add(...items) {\n    if (items.length === 0) {\n      throw new Error('No instructions');\n    }\n    items.forEach(item => {\n      if ('instructions' in item) {\n        this.instructions = this.instructions.concat(item.instructions);\n      } else if ('data' in item && 'programId' in item && 'keys' in item) {\n        this.instructions.push(item);\n      } else {\n        this.instructions.push(new TransactionInstruction(item));\n      }\n    });\n    return this;\n  }\n\n  /**\n   * Compile transaction data\n   */\n  compileMessage() {\n    if (this._message && JSON.stringify(this.toJSON()) === JSON.stringify(this._json)) {\n      return this._message;\n    }\n    let recentBlockhash;\n    let instructions;\n    if (this.nonceInfo) {\n      recentBlockhash = this.nonceInfo.nonce;\n      if (this.instructions[0] != this.nonceInfo.nonceInstruction) {\n        instructions = [this.nonceInfo.nonceInstruction, ...this.instructions];\n      } else {\n        instructions = this.instructions;\n      }\n    } else {\n      recentBlockhash = this.recentBlockhash;\n      instructions = this.instructions;\n    }\n    if (!recentBlockhash) {\n      throw new Error('Transaction recentBlockhash required');\n    }\n    if (instructions.length < 1) {\n      console.warn('No instructions provided');\n    }\n    let feePayer;\n    if (this.feePayer) {\n      feePayer = this.feePayer;\n    } else if (this.signatures.length > 0 && this.signatures[0].publicKey) {\n      // Use implicit fee payer\n      feePayer = this.signatures[0].publicKey;\n    } else {\n      throw new Error('Transaction fee payer required');\n    }\n    for (let i = 0; i < instructions.length; i++) {\n      if (instructions[i].programId === undefined) {\n        throw new Error(`Transaction instruction index ${i} has undefined program id`);\n      }\n    }\n    const programIds = [];\n    const accountMetas = [];\n    instructions.forEach(instruction => {\n      instruction.keys.forEach(accountMeta => {\n        accountMetas.push({\n          ...accountMeta\n        });\n      });\n      const programId = instruction.programId.toString();\n      if (!programIds.includes(programId)) {\n        programIds.push(programId);\n      }\n    });\n\n    // Append programID account metas\n    programIds.forEach(programId => {\n      accountMetas.push({\n        pubkey: new PublicKey(programId),\n        isSigner: false,\n        isWritable: false\n      });\n    });\n\n    // Cull duplicate account metas\n    const uniqueMetas = [];\n    accountMetas.forEach(accountMeta => {\n      const pubkeyString = accountMeta.pubkey.toString();\n      const uniqueIndex = uniqueMetas.findIndex(x => {\n        return x.pubkey.toString() === pubkeyString;\n      });\n      if (uniqueIndex > -1) {\n        uniqueMetas[uniqueIndex].isWritable = uniqueMetas[uniqueIndex].isWritable || accountMeta.isWritable;\n        uniqueMetas[uniqueIndex].isSigner = uniqueMetas[uniqueIndex].isSigner || accountMeta.isSigner;\n      } else {\n        uniqueMetas.push(accountMeta);\n      }\n    });\n\n    // Sort. Prioritizing first by signer, then by writable\n    uniqueMetas.sort(function (x, y) {\n      if (x.isSigner !== y.isSigner) {\n        // Signers always come before non-signers\n        return x.isSigner ? -1 : 1;\n      }\n      if (x.isWritable !== y.isWritable) {\n        // Writable accounts always come before read-only accounts\n        return x.isWritable ? -1 : 1;\n      }\n      // Otherwise, sort by pubkey, stringwise.\n      const options = {\n        localeMatcher: 'best fit',\n        usage: 'sort',\n        sensitivity: 'variant',\n        ignorePunctuation: false,\n        numeric: false,\n        caseFirst: 'lower'\n      };\n      return x.pubkey.toBase58().localeCompare(y.pubkey.toBase58(), 'en', options);\n    });\n\n    // Move fee payer to the front\n    const feePayerIndex = uniqueMetas.findIndex(x => {\n      return x.pubkey.equals(feePayer);\n    });\n    if (feePayerIndex > -1) {\n      const [payerMeta] = uniqueMetas.splice(feePayerIndex, 1);\n      payerMeta.isSigner = true;\n      payerMeta.isWritable = true;\n      uniqueMetas.unshift(payerMeta);\n    } else {\n      uniqueMetas.unshift({\n        pubkey: feePayer,\n        isSigner: true,\n        isWritable: true\n      });\n    }\n\n    // Disallow unknown signers\n    for (const signature of this.signatures) {\n      const uniqueIndex = uniqueMetas.findIndex(x => {\n        return x.pubkey.equals(signature.publicKey);\n      });\n      if (uniqueIndex > -1) {\n        if (!uniqueMetas[uniqueIndex].isSigner) {\n          uniqueMetas[uniqueIndex].isSigner = true;\n          console.warn('Transaction references a signature that is unnecessary, ' + 'only the fee payer and instruction signer accounts should sign a transaction. ' + 'This behavior is deprecated and will throw an error in the next major version release.');\n        }\n      } else {\n        throw new Error(`unknown signer: ${signature.publicKey.toString()}`);\n      }\n    }\n    let numRequiredSignatures = 0;\n    let numReadonlySignedAccounts = 0;\n    let numReadonlyUnsignedAccounts = 0;\n\n    // Split out signing from non-signing keys and count header values\n    const signedKeys = [];\n    const unsignedKeys = [];\n    uniqueMetas.forEach(({\n      pubkey,\n      isSigner,\n      isWritable\n    }) => {\n      if (isSigner) {\n        signedKeys.push(pubkey.toString());\n        numRequiredSignatures += 1;\n        if (!isWritable) {\n          numReadonlySignedAccounts += 1;\n        }\n      } else {\n        unsignedKeys.push(pubkey.toString());\n        if (!isWritable) {\n          numReadonlyUnsignedAccounts += 1;\n        }\n      }\n    });\n    const accountKeys = signedKeys.concat(unsignedKeys);\n    const compiledInstructions = instructions.map(instruction => {\n      const {\n        data,\n        programId\n      } = instruction;\n      return {\n        programIdIndex: accountKeys.indexOf(programId.toString()),\n        accounts: instruction.keys.map(meta => accountKeys.indexOf(meta.pubkey.toString())),\n        data: bs58_default().encode(data)\n      };\n    });\n    compiledInstructions.forEach(instruction => {\n      index_browser_esm_assert(instruction.programIdIndex >= 0);\n      instruction.accounts.forEach(keyIndex => index_browser_esm_assert(keyIndex >= 0));\n    });\n    return new Message({\n      header: {\n        numRequiredSignatures,\n        numReadonlySignedAccounts,\n        numReadonlyUnsignedAccounts\n      },\n      accountKeys,\n      recentBlockhash,\n      instructions: compiledInstructions\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _compile() {\n    const message = this.compileMessage();\n    const signedKeys = message.accountKeys.slice(0, message.header.numRequiredSignatures);\n    if (this.signatures.length === signedKeys.length) {\n      const valid = this.signatures.every((pair, index) => {\n        return signedKeys[index].equals(pair.publicKey);\n      });\n      if (valid) return message;\n    }\n    this.signatures = signedKeys.map(publicKey => ({\n      signature: null,\n      publicKey\n    }));\n    return message;\n  }\n\n  /**\n   * Get a buffer of the Transaction data that need to be covered by signatures\n   */\n  serializeMessage() {\n    return this._compile().serialize();\n  }\n\n  /**\n   * Get the estimated fee associated with a transaction\n   *\n   * @param {Connection} connection Connection to RPC Endpoint.\n   *\n   * @returns {Promise<number | null>} The estimated fee for the transaction\n   */\n  async getEstimatedFee(connection) {\n    return (await connection.getFeeForMessage(this.compileMessage())).value;\n  }\n\n  /**\n   * Specify the public keys which will be used to sign the Transaction.\n   * The first signer will be used as the transaction fee payer account.\n   *\n   * Signatures can be added with either `partialSign` or `addSignature`\n   *\n   * @deprecated Deprecated since v0.84.0. Only the fee payer needs to be\n   * specified and it can be set in the Transaction constructor or with the\n   * `feePayer` property.\n   */\n  setSigners(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n    const seen = new Set();\n    this.signatures = signers.filter(publicKey => {\n      const key = publicKey.toString();\n      if (seen.has(key)) {\n        return false;\n      } else {\n        seen.add(key);\n        return true;\n      }\n    }).map(publicKey => ({\n      signature: null,\n      publicKey\n    }));\n  }\n\n  /**\n   * Sign the Transaction with the specified signers. Multiple signatures may\n   * be applied to a Transaction. The first signature is considered \"primary\"\n   * and is used identify and confirm transactions.\n   *\n   * If the Transaction `feePayer` is not set, the first signer will be used\n   * as the transaction fee payer account.\n   *\n   * Transaction fields should not be modified after the first call to `sign`,\n   * as doing so may invalidate the signature and cause the Transaction to be\n   * rejected.\n   *\n   * The Transaction must be assigned a valid `recentBlockhash` before invoking this method\n   *\n   * @param {Array<Signer>} signers Array of signers that will sign the transaction\n   */\n  sign(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n\n    // Dedupe signers\n    const seen = new Set();\n    const uniqueSigners = [];\n    for (const signer of signers) {\n      const key = signer.publicKey.toString();\n      if (seen.has(key)) {\n        continue;\n      } else {\n        seen.add(key);\n        uniqueSigners.push(signer);\n      }\n    }\n    this.signatures = uniqueSigners.map(signer => ({\n      signature: null,\n      publicKey: signer.publicKey\n    }));\n    const message = this._compile();\n    this._partialSign(message, ...uniqueSigners);\n  }\n\n  /**\n   * Partially sign a transaction with the specified accounts. All accounts must\n   * correspond to either the fee payer or a signer account in the transaction\n   * instructions.\n   *\n   * All the caveats from the `sign` method apply to `partialSign`\n   *\n   * @param {Array<Signer>} signers Array of signers that will sign the transaction\n   */\n  partialSign(...signers) {\n    if (signers.length === 0) {\n      throw new Error('No signers');\n    }\n\n    // Dedupe signers\n    const seen = new Set();\n    const uniqueSigners = [];\n    for (const signer of signers) {\n      const key = signer.publicKey.toString();\n      if (seen.has(key)) {\n        continue;\n      } else {\n        seen.add(key);\n        uniqueSigners.push(signer);\n      }\n    }\n    const message = this._compile();\n    this._partialSign(message, ...uniqueSigners);\n  }\n\n  /**\n   * @internal\n   */\n  _partialSign(message, ...signers) {\n    const signData = message.serialize();\n    signers.forEach(signer => {\n      const signature = sign(signData, signer.secretKey);\n      this._addSignature(signer.publicKey, toBuffer(signature));\n    });\n  }\n\n  /**\n   * Add an externally created signature to a transaction. The public key\n   * must correspond to either the fee payer or a signer account in the transaction\n   * instructions.\n   *\n   * @param {PublicKey} pubkey Public key that will be added to the transaction.\n   * @param {Buffer} signature An externally created signature to add to the transaction.\n   */\n  addSignature(pubkey, signature) {\n    this._compile(); // Ensure signatures array is populated\n    this._addSignature(pubkey, signature);\n  }\n\n  /**\n   * @internal\n   */\n  _addSignature(pubkey, signature) {\n    index_browser_esm_assert(signature.length === 64);\n    const index = this.signatures.findIndex(sigpair => pubkey.equals(sigpair.publicKey));\n    if (index < 0) {\n      throw new Error(`unknown signer: ${pubkey.toString()}`);\n    }\n    this.signatures[index].signature = node_modules_buffer.Buffer.from(signature);\n  }\n\n  /**\n   * Verify signatures of a Transaction\n   * Optional parameter specifies if we're expecting a fully signed Transaction or a partially signed one.\n   * If no boolean is provided, we expect a fully signed Transaction by default.\n   *\n   * @param {boolean} [requireAllSignatures=true] Require a fully signed Transaction\n   */\n  verifySignatures(requireAllSignatures = true) {\n    const signatureErrors = this._getMessageSignednessErrors(this.serializeMessage(), requireAllSignatures);\n    return !signatureErrors;\n  }\n\n  /**\n   * @internal\n   */\n  _getMessageSignednessErrors(message, requireAllSignatures) {\n    const errors = {};\n    for (const {\n      signature,\n      publicKey\n    } of this.signatures) {\n      if (signature === null) {\n        if (requireAllSignatures) {\n          (errors.missing ||= []).push(publicKey);\n        }\n      } else {\n        if (!verify(signature, message, publicKey.toBytes())) {\n          (errors.invalid ||= []).push(publicKey);\n        }\n      }\n    }\n    return errors.invalid || errors.missing ? errors : undefined;\n  }\n\n  /**\n   * Serialize the Transaction in the wire format.\n   *\n   * @param {Buffer} [config] Config of transaction.\n   *\n   * @returns {Buffer} Signature of transaction in wire format.\n   */\n  serialize(config) {\n    const {\n      requireAllSignatures,\n      verifySignatures\n    } = Object.assign({\n      requireAllSignatures: true,\n      verifySignatures: true\n    }, config);\n    const signData = this.serializeMessage();\n    if (verifySignatures) {\n      const sigErrors = this._getMessageSignednessErrors(signData, requireAllSignatures);\n      if (sigErrors) {\n        let errorMessage = 'Signature verification failed.';\n        if (sigErrors.invalid) {\n          errorMessage += `\\nInvalid signature for public key${sigErrors.invalid.length === 1 ? '' : '(s)'} [\\`${sigErrors.invalid.map(p => p.toBase58()).join('`, `')}\\`].`;\n        }\n        if (sigErrors.missing) {\n          errorMessage += `\\nMissing signature for public key${sigErrors.missing.length === 1 ? '' : '(s)'} [\\`${sigErrors.missing.map(p => p.toBase58()).join('`, `')}\\`].`;\n        }\n        throw new Error(errorMessage);\n      }\n    }\n    return this._serialize(signData);\n  }\n\n  /**\n   * @internal\n   */\n  _serialize(signData) {\n    const {\n      signatures\n    } = this;\n    const signatureCount = [];\n    encodeLength(signatureCount, signatures.length);\n    const transactionLength = signatureCount.length + signatures.length * 64 + signData.length;\n    const wireTransaction = node_modules_buffer.Buffer.alloc(transactionLength);\n    index_browser_esm_assert(signatures.length < 256);\n    node_modules_buffer.Buffer.from(signatureCount).copy(wireTransaction, 0);\n    signatures.forEach(({\n      signature\n    }, index) => {\n      if (signature !== null) {\n        index_browser_esm_assert(signature.length === 64, `signature has invalid length`);\n        node_modules_buffer.Buffer.from(signature).copy(wireTransaction, signatureCount.length + index * 64);\n      }\n    });\n    signData.copy(wireTransaction, signatureCount.length + signatures.length * 64);\n    index_browser_esm_assert(wireTransaction.length <= PACKET_DATA_SIZE, `Transaction too large: ${wireTransaction.length} > ${PACKET_DATA_SIZE}`);\n    return wireTransaction;\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get keys() {\n    index_browser_esm_assert(this.instructions.length === 1);\n    return this.instructions[0].keys.map(keyObj => keyObj.pubkey);\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get programId() {\n    index_browser_esm_assert(this.instructions.length === 1);\n    return this.instructions[0].programId;\n  }\n\n  /**\n   * Deprecated method\n   * @internal\n   */\n  get data() {\n    index_browser_esm_assert(this.instructions.length === 1);\n    return this.instructions[0].data;\n  }\n\n  /**\n   * Parse a wire transaction into a Transaction object.\n   *\n   * @param {Buffer | Uint8Array | Array<number>} buffer Signature of wire Transaction\n   *\n   * @returns {Transaction} Transaction associated with the signature\n   */\n  static from(buffer) {\n    // Slice up wire data\n    let byteArray = [...buffer];\n    const signatureCount = decodeLength(byteArray);\n    let signatures = [];\n    for (let i = 0; i < signatureCount; i++) {\n      const signature = guardedSplice(byteArray, 0, SIGNATURE_LENGTH_IN_BYTES);\n      signatures.push(bs58_default().encode(node_modules_buffer.Buffer.from(signature)));\n    }\n    return Transaction.populate(Message.from(byteArray), signatures);\n  }\n\n  /**\n   * Populate Transaction object from message and signatures\n   *\n   * @param {Message} message Message of transaction\n   * @param {Array<string>} signatures List of signatures to assign to the transaction\n   *\n   * @returns {Transaction} The populated Transaction\n   */\n  static populate(message, signatures = []) {\n    const transaction = new Transaction();\n    transaction.recentBlockhash = message.recentBlockhash;\n    if (message.header.numRequiredSignatures > 0) {\n      transaction.feePayer = message.accountKeys[0];\n    }\n    signatures.forEach((signature, index) => {\n      const sigPubkeyPair = {\n        signature: signature == bs58_default().encode(DEFAULT_SIGNATURE) ? null : bs58_default().decode(signature),\n        publicKey: message.accountKeys[index]\n      };\n      transaction.signatures.push(sigPubkeyPair);\n    });\n    message.instructions.forEach(instruction => {\n      const keys = instruction.accounts.map(account => {\n        const pubkey = message.accountKeys[account];\n        return {\n          pubkey,\n          isSigner: transaction.signatures.some(keyObj => keyObj.publicKey.toString() === pubkey.toString()) || message.isAccountSigner(account),\n          isWritable: message.isAccountWritable(account)\n        };\n      });\n      transaction.instructions.push(new TransactionInstruction({\n        keys,\n        programId: message.accountKeys[instruction.programIdIndex],\n        data: bs58_default().decode(instruction.data)\n      }));\n    });\n    transaction._message = message;\n    transaction._json = transaction.toJSON();\n    return transaction;\n  }\n}\n\nclass TransactionMessage {\n  constructor(args) {\n    this.payerKey = void 0;\n    this.instructions = void 0;\n    this.recentBlockhash = void 0;\n    this.payerKey = args.payerKey;\n    this.instructions = args.instructions;\n    this.recentBlockhash = args.recentBlockhash;\n  }\n  static decompile(message, args) {\n    const {\n      header,\n      compiledInstructions,\n      recentBlockhash\n    } = message;\n    const {\n      numRequiredSignatures,\n      numReadonlySignedAccounts,\n      numReadonlyUnsignedAccounts\n    } = header;\n    const numWritableSignedAccounts = numRequiredSignatures - numReadonlySignedAccounts;\n    index_browser_esm_assert(numWritableSignedAccounts > 0, 'Message header is invalid');\n    const numWritableUnsignedAccounts = message.staticAccountKeys.length - numRequiredSignatures - numReadonlyUnsignedAccounts;\n    index_browser_esm_assert(numWritableUnsignedAccounts >= 0, 'Message header is invalid');\n    const accountKeys = message.getAccountKeys(args);\n    const payerKey = accountKeys.get(0);\n    if (payerKey === undefined) {\n      throw new Error('Failed to decompile message because no account keys were found');\n    }\n    const instructions = [];\n    for (const compiledIx of compiledInstructions) {\n      const keys = [];\n      for (const keyIndex of compiledIx.accountKeyIndexes) {\n        const pubkey = accountKeys.get(keyIndex);\n        if (pubkey === undefined) {\n          throw new Error(`Failed to find key for account key index ${keyIndex}`);\n        }\n        const isSigner = keyIndex < numRequiredSignatures;\n        let isWritable;\n        if (isSigner) {\n          isWritable = keyIndex < numWritableSignedAccounts;\n        } else if (keyIndex < accountKeys.staticAccountKeys.length) {\n          isWritable = keyIndex - numRequiredSignatures < numWritableUnsignedAccounts;\n        } else {\n          isWritable = keyIndex - accountKeys.staticAccountKeys.length <\n          // accountKeysFromLookups cannot be undefined because we already found a pubkey for this index above\n          accountKeys.accountKeysFromLookups.writable.length;\n        }\n        keys.push({\n          pubkey,\n          isSigner: keyIndex < header.numRequiredSignatures,\n          isWritable\n        });\n      }\n      const programId = accountKeys.get(compiledIx.programIdIndex);\n      if (programId === undefined) {\n        throw new Error(`Failed to find program id for program id index ${compiledIx.programIdIndex}`);\n      }\n      instructions.push(new TransactionInstruction({\n        programId,\n        data: toBuffer(compiledIx.data),\n        keys\n      }));\n    }\n    return new TransactionMessage({\n      payerKey,\n      instructions,\n      recentBlockhash\n    });\n  }\n  compileToLegacyMessage() {\n    return Message.compile({\n      payerKey: this.payerKey,\n      recentBlockhash: this.recentBlockhash,\n      instructions: this.instructions\n    });\n  }\n  compileToV0Message(addressLookupTableAccounts) {\n    return MessageV0.compile({\n      payerKey: this.payerKey,\n      recentBlockhash: this.recentBlockhash,\n      instructions: this.instructions,\n      addressLookupTableAccounts\n    });\n  }\n}\n\n/**\n * Versioned transaction class\n */\nclass VersionedTransaction {\n  get version() {\n    return this.message.version;\n  }\n  constructor(message, signatures) {\n    this.signatures = void 0;\n    this.message = void 0;\n    if (signatures !== undefined) {\n      index_browser_esm_assert(signatures.length === message.header.numRequiredSignatures, 'Expected signatures length to be equal to the number of required signatures');\n      this.signatures = signatures;\n    } else {\n      const defaultSignatures = [];\n      for (let i = 0; i < message.header.numRequiredSignatures; i++) {\n        defaultSignatures.push(new Uint8Array(SIGNATURE_LENGTH_IN_BYTES));\n      }\n      this.signatures = defaultSignatures;\n    }\n    this.message = message;\n  }\n  serialize() {\n    const serializedMessage = this.message.serialize();\n    const encodedSignaturesLength = Array();\n    encodeLength(encodedSignaturesLength, this.signatures.length);\n    const transactionLayout = Layout.struct([Layout.blob(encodedSignaturesLength.length, 'encodedSignaturesLength'), Layout.seq(signature(), this.signatures.length, 'signatures'), Layout.blob(serializedMessage.length, 'serializedMessage')]);\n    const serializedTransaction = new Uint8Array(2048);\n    const serializedTransactionLength = transactionLayout.encode({\n      encodedSignaturesLength: new Uint8Array(encodedSignaturesLength),\n      signatures: this.signatures,\n      serializedMessage\n    }, serializedTransaction);\n    return serializedTransaction.slice(0, serializedTransactionLength);\n  }\n  static deserialize(serializedTransaction) {\n    let byteArray = [...serializedTransaction];\n    const signatures = [];\n    const signaturesLength = decodeLength(byteArray);\n    for (let i = 0; i < signaturesLength; i++) {\n      signatures.push(new Uint8Array(guardedSplice(byteArray, 0, SIGNATURE_LENGTH_IN_BYTES)));\n    }\n    const message = VersionedMessage.deserialize(new Uint8Array(byteArray));\n    return new VersionedTransaction(message, signatures);\n  }\n  sign(signers) {\n    const messageData = this.message.serialize();\n    const signerPubkeys = this.message.staticAccountKeys.slice(0, this.message.header.numRequiredSignatures);\n    for (const signer of signers) {\n      const signerIndex = signerPubkeys.findIndex(pubkey => pubkey.equals(signer.publicKey));\n      index_browser_esm_assert(signerIndex >= 0, `Cannot sign with non signer key ${signer.publicKey.toBase58()}`);\n      this.signatures[signerIndex] = sign(messageData, signer.secretKey);\n    }\n  }\n  addSignature(publicKey, signature) {\n    index_browser_esm_assert(signature.byteLength === 64, 'Signature must be 64 bytes long');\n    const signerPubkeys = this.message.staticAccountKeys.slice(0, this.message.header.numRequiredSignatures);\n    const signerIndex = signerPubkeys.findIndex(pubkey => pubkey.equals(publicKey));\n    index_browser_esm_assert(signerIndex >= 0, `Can not add signature; \\`${publicKey.toBase58()}\\` is not required to sign this transaction`);\n    this.signatures[signerIndex] = signature;\n  }\n}\n\n// TODO: These constants should be removed in favor of reading them out of a\n// Syscall account\n\n/**\n * @internal\n */\nconst NUM_TICKS_PER_SECOND = 160;\n\n/**\n * @internal\n */\nconst DEFAULT_TICKS_PER_SLOT = 64;\n\n/**\n * @internal\n */\nconst NUM_SLOTS_PER_SECOND = NUM_TICKS_PER_SECOND / DEFAULT_TICKS_PER_SLOT;\n\n/**\n * @internal\n */\nconst MS_PER_SLOT = 1000 / NUM_SLOTS_PER_SECOND;\n\nconst SYSVAR_CLOCK_PUBKEY = new PublicKey('SysvarC1ock11111111111111111111111111111111');\nconst SYSVAR_EPOCH_SCHEDULE_PUBKEY = new PublicKey('SysvarEpochSchedu1e111111111111111111111111');\nconst SYSVAR_INSTRUCTIONS_PUBKEY = new PublicKey('Sysvar1nstructions1111111111111111111111111');\nconst SYSVAR_RECENT_BLOCKHASHES_PUBKEY = new PublicKey('SysvarRecentB1ockHashes11111111111111111111');\nconst SYSVAR_RENT_PUBKEY = new PublicKey('SysvarRent111111111111111111111111111111111');\nconst SYSVAR_REWARDS_PUBKEY = new PublicKey('SysvarRewards111111111111111111111111111111');\nconst SYSVAR_SLOT_HASHES_PUBKEY = new PublicKey('SysvarS1otHashes111111111111111111111111111');\nconst SYSVAR_SLOT_HISTORY_PUBKEY = new PublicKey('SysvarS1otHistory11111111111111111111111111');\nconst SYSVAR_STAKE_HISTORY_PUBKEY = new PublicKey('SysvarStakeHistory1111111111111111111111111');\n\nclass SendTransactionError extends Error {\n  constructor({\n    action,\n    signature,\n    transactionMessage,\n    logs\n  }) {\n    const maybeLogsOutput = logs ? `Logs: \\n${JSON.stringify(logs.slice(-10), null, 2)}. ` : '';\n    const guideText = '\\nCatch the `SendTransactionError` and call `getLogs()` on it for full details.';\n    let message;\n    switch (action) {\n      case 'send':\n        message = `Transaction ${signature} resulted in an error. \\n` + `${transactionMessage}. ` + maybeLogsOutput + guideText;\n        break;\n      case 'simulate':\n        message = `Simulation failed. \\nMessage: ${transactionMessage}. \\n` + maybeLogsOutput + guideText;\n        break;\n      default:\n        {\n          message = `Unknown action '${(a => a)(action)}'`;\n        }\n    }\n    super(message);\n    this.signature = void 0;\n    this.transactionMessage = void 0;\n    this.transactionLogs = void 0;\n    this.signature = signature;\n    this.transactionMessage = transactionMessage;\n    this.transactionLogs = logs ? logs : undefined;\n  }\n  get transactionError() {\n    return {\n      message: this.transactionMessage,\n      logs: Array.isArray(this.transactionLogs) ? this.transactionLogs : undefined\n    };\n  }\n\n  /* @deprecated Use `await getLogs()` instead */\n  get logs() {\n    const cachedLogs = this.transactionLogs;\n    if (cachedLogs != null && typeof cachedLogs === 'object' && 'then' in cachedLogs) {\n      return undefined;\n    }\n    return cachedLogs;\n  }\n  async getLogs(connection) {\n    if (!Array.isArray(this.transactionLogs)) {\n      this.transactionLogs = new Promise((resolve, reject) => {\n        connection.getTransaction(this.signature).then(tx => {\n          if (tx && tx.meta && tx.meta.logMessages) {\n            const logs = tx.meta.logMessages;\n            this.transactionLogs = logs;\n            resolve(logs);\n          } else {\n            reject(new Error('Log messages not found'));\n          }\n        }).catch(reject);\n      });\n    }\n    return await this.transactionLogs;\n  }\n}\n\n// Keep in sync with client/src/rpc_custom_errors.rs\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaJSONRPCErrorCode = {\n  JSON_RPC_SERVER_ERROR_BLOCK_CLEANED_UP: -32001,\n  JSON_RPC_SERVER_ERROR_SEND_TRANSACTION_PREFLIGHT_FAILURE: -32002,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_VERIFICATION_FAILURE: -32003,\n  JSON_RPC_SERVER_ERROR_BLOCK_NOT_AVAILABLE: -32004,\n  JSON_RPC_SERVER_ERROR_NODE_UNHEALTHY: -32005,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_PRECOMPILE_VERIFICATION_FAILURE: -32006,\n  JSON_RPC_SERVER_ERROR_SLOT_SKIPPED: -32007,\n  JSON_RPC_SERVER_ERROR_NO_SNAPSHOT: -32008,\n  JSON_RPC_SERVER_ERROR_LONG_TERM_STORAGE_SLOT_SKIPPED: -32009,\n  JSON_RPC_SERVER_ERROR_KEY_EXCLUDED_FROM_SECONDARY_INDEX: -32010,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_HISTORY_NOT_AVAILABLE: -32011,\n  JSON_RPC_SCAN_ERROR: -32012,\n  JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_LEN_MISMATCH: -32013,\n  JSON_RPC_SERVER_ERROR_BLOCK_STATUS_NOT_AVAILABLE_YET: -32014,\n  JSON_RPC_SERVER_ERROR_UNSUPPORTED_TRANSACTION_VERSION: -32015,\n  JSON_RPC_SERVER_ERROR_MIN_CONTEXT_SLOT_NOT_REACHED: -32016\n};\nclass SolanaJSONRPCError extends Error {\n  constructor({\n    code,\n    message,\n    data\n  }, customMessage) {\n    super(customMessage != null ? `${customMessage}: ${message}` : message);\n    this.code = void 0;\n    this.data = void 0;\n    this.code = code;\n    this.data = data;\n    this.name = 'SolanaJSONRPCError';\n  }\n}\n\n/**\n * Sign, send and confirm a transaction.\n *\n * If `commitment` option is not specified, defaults to 'max' commitment.\n *\n * @param {Connection} connection\n * @param {Transaction} transaction\n * @param {Array<Signer>} signers\n * @param {ConfirmOptions} [options]\n * @returns {Promise<TransactionSignature>}\n */\nasync function sendAndConfirmTransaction(connection, transaction, signers, options) {\n  const sendOptions = options && {\n    skipPreflight: options.skipPreflight,\n    preflightCommitment: options.preflightCommitment || options.commitment,\n    maxRetries: options.maxRetries,\n    minContextSlot: options.minContextSlot\n  };\n  const signature = await connection.sendTransaction(transaction, signers, sendOptions);\n  let status;\n  if (transaction.recentBlockhash != null && transaction.lastValidBlockHeight != null) {\n    status = (await connection.confirmTransaction({\n      abortSignal: options?.abortSignal,\n      signature: signature,\n      blockhash: transaction.recentBlockhash,\n      lastValidBlockHeight: transaction.lastValidBlockHeight\n    }, options && options.commitment)).value;\n  } else if (transaction.minNonceContextSlot != null && transaction.nonceInfo != null) {\n    const {\n      nonceInstruction\n    } = transaction.nonceInfo;\n    const nonceAccountPubkey = nonceInstruction.keys[0].pubkey;\n    status = (await connection.confirmTransaction({\n      abortSignal: options?.abortSignal,\n      minContextSlot: transaction.minNonceContextSlot,\n      nonceAccountPubkey,\n      nonceValue: transaction.nonceInfo.nonce,\n      signature\n    }, options && options.commitment)).value;\n  } else {\n    if (options?.abortSignal != null) {\n      console.warn('sendAndConfirmTransaction(): A transaction with a deprecated confirmation strategy was ' + 'supplied along with an `abortSignal`. Only transactions having `lastValidBlockHeight` ' + 'or a combination of `nonceInfo` and `minNonceContextSlot` are abortable.');\n    }\n    status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n  }\n  if (status.err) {\n    if (signature != null) {\n      throw new SendTransactionError({\n        action: 'send',\n        signature: signature,\n        transactionMessage: `Status: (${JSON.stringify(status)})`\n      });\n    }\n    throw new Error(`Transaction ${signature} failed (${JSON.stringify(status)})`);\n  }\n  return signature;\n}\n\n// zzz\nfunction sleep(ms) {\n  return new Promise(resolve => setTimeout(resolve, ms));\n}\n\n/**\n * @internal\n */\n\n/**\n * Populate a buffer of instruction data using an InstructionType\n * @internal\n */\nfunction encodeData(type, fields) {\n  const allocLength = type.layout.span >= 0 ? type.layout.span : getAlloc(type, fields);\n  const data = node_modules_buffer.Buffer.alloc(allocLength);\n  const layoutFields = Object.assign({\n    instruction: type.index\n  }, fields);\n  type.layout.encode(layoutFields, data);\n  return data;\n}\n\n/**\n * Decode instruction data buffer using an InstructionType\n * @internal\n */\nfunction decodeData$1(type, buffer) {\n  let data;\n  try {\n    data = type.layout.decode(buffer);\n  } catch (err) {\n    throw new Error('invalid instruction; ' + err);\n  }\n  if (data.instruction !== type.index) {\n    throw new Error(`invalid instruction; instruction index mismatch ${data.instruction} != ${type.index}`);\n  }\n  return data;\n}\n\n/**\n * https://github.com/solana-labs/solana/blob/90bedd7e067b5b8f3ddbb45da00a4e9cabb22c62/sdk/src/fee_calculator.rs#L7-L11\n *\n * @internal\n */\nconst FeeCalculatorLayout = Layout.nu64('lamportsPerSignature');\n\n/**\n * Calculator for transaction fees.\n *\n * @deprecated Deprecated since Solana v1.8.0.\n */\n\n/**\n * See https://github.com/solana-labs/solana/blob/0ea2843ec9cdc517572b8e62c959f41b55cf4453/sdk/src/nonce_state.rs#L29-L32\n *\n * @internal\n */\nconst NonceAccountLayout = Layout.struct([Layout.u32('version'), Layout.u32('state'), publicKey('authorizedPubkey'), publicKey('nonce'), Layout.struct([FeeCalculatorLayout], 'feeCalculator')]);\nconst NONCE_ACCOUNT_LENGTH = NonceAccountLayout.span;\n\n/**\n * A durable nonce is a 32 byte value encoded as a base58 string.\n */\n\n/**\n * NonceAccount class\n */\nclass NonceAccount {\n  /**\n   * @internal\n   */\n  constructor(args) {\n    this.authorizedPubkey = void 0;\n    this.nonce = void 0;\n    this.feeCalculator = void 0;\n    this.authorizedPubkey = args.authorizedPubkey;\n    this.nonce = args.nonce;\n    this.feeCalculator = args.feeCalculator;\n  }\n\n  /**\n   * Deserialize NonceAccount from the account data.\n   *\n   * @param buffer account data\n   * @return NonceAccount\n   */\n  static fromAccountData(buffer) {\n    const nonceAccount = NonceAccountLayout.decode(toBuffer(buffer), 0);\n    return new NonceAccount({\n      authorizedPubkey: new PublicKey(nonceAccount.authorizedPubkey),\n      nonce: new PublicKey(nonceAccount.nonce).toString(),\n      feeCalculator: nonceAccount.feeCalculator\n    });\n  }\n}\n\nconst encodeDecode = layout => {\n  const decode = layout.decode.bind(layout);\n  const encode = layout.encode.bind(layout);\n  return {\n    decode,\n    encode\n  };\n};\nconst bigInt = length => property => {\n  const layout = (0,Layout.blob)(length, property);\n  const {\n    encode,\n    decode\n  } = encodeDecode(layout);\n  const bigIntLayout = layout;\n  bigIntLayout.decode = (buffer, offset) => {\n    const src = decode(buffer, offset);\n    return (0,browser.toBigIntLE)(node_modules_buffer.Buffer.from(src));\n  };\n  bigIntLayout.encode = (bigInt, buffer, offset) => {\n    const src = (0,browser.toBufferLE)(bigInt, length);\n    return encode(src, buffer, offset);\n  };\n  return bigIntLayout;\n};\nconst index_browser_esm_u64 = bigInt(8);\n\n/**\n * Create account system transaction params\n */\n\n/**\n * Transfer system transaction params\n */\n\n/**\n * Assign system transaction params\n */\n\n/**\n * Create account with seed system transaction params\n */\n\n/**\n * Create nonce account system transaction params\n */\n\n/**\n * Create nonce account with seed system transaction params\n */\n\n/**\n * Initialize nonce account system instruction params\n */\n\n/**\n * Advance nonce account system instruction params\n */\n\n/**\n * Withdraw nonce account system transaction params\n */\n\n/**\n * Authorize nonce account system transaction params\n */\n\n/**\n * Allocate account system transaction params\n */\n\n/**\n * Allocate account with seed system transaction params\n */\n\n/**\n * Assign account with seed system transaction params\n */\n\n/**\n * Transfer with seed system transaction params\n */\n\n/** Decoded transfer system transaction instruction */\n\n/** Decoded transferWithSeed system transaction instruction */\n\n/**\n * System Instruction class\n */\nclass SystemInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a system instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = Layout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(SYSTEM_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a SystemInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode a create account system instruction and retrieve the instruction params.\n   */\n  static decodeCreateAccount(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      lamports,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Create, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      newAccountPubkey: instruction.keys[1].pubkey,\n      lamports,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a transfer system instruction and retrieve the instruction params.\n   */\n  static decodeTransfer(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      lamports\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Transfer, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a transfer with seed system instruction and retrieve the instruction params.\n   */\n  static decodeTransferWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports,\n      seed,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.TransferWithSeed, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      basePubkey: instruction.keys[1].pubkey,\n      toPubkey: instruction.keys[2].pubkey,\n      lamports,\n      seed,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an allocate system instruction and retrieve the instruction params.\n   */\n  static decodeAllocate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      space\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Allocate, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      space\n    };\n  }\n\n  /**\n   * Decode an allocate with seed system instruction and retrieve the instruction params.\n   */\n  static decodeAllocateWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      base,\n      seed,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AllocateWithSeed, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an assign system instruction and retrieve the instruction params.\n   */\n  static decodeAssign(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.Assign, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode an assign with seed system instruction and retrieve the instruction params.\n   */\n  static decodeAssignWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 1);\n    const {\n      base,\n      seed,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AssignWithSeed, instruction.data);\n    return {\n      accountPubkey: instruction.keys[0].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a create account with seed system instruction and retrieve the instruction params.\n   */\n  static decodeCreateWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      base,\n      seed,\n      lamports,\n      space,\n      programId\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.CreateWithSeed, instruction.data);\n    return {\n      fromPubkey: instruction.keys[0].pubkey,\n      newAccountPubkey: instruction.keys[1].pubkey,\n      basePubkey: new PublicKey(base),\n      seed,\n      lamports,\n      space,\n      programId: new PublicKey(programId)\n    };\n  }\n\n  /**\n   * Decode a nonce initialize system instruction and retrieve the instruction params.\n   */\n  static decodeNonceInitialize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      authorized\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.InitializeNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: new PublicKey(authorized)\n    };\n  }\n\n  /**\n   * Decode a nonce advance system instruction and retrieve the instruction params.\n   */\n  static decodeNonceAdvance(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AdvanceNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey\n    };\n  }\n\n  /**\n   * Decode a nonce withdraw system instruction and retrieve the instruction params.\n   */\n  static decodeNonceWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 5);\n    const {\n      lamports\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.WithdrawNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a nonce authorize system instruction and retrieve the instruction params.\n   */\n  static decodeNonceAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      authorized\n    } = decodeData$1(SYSTEM_INSTRUCTION_LAYOUTS.AuthorizeNonceAccount, instruction.data);\n    return {\n      noncePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[1].pubkey,\n      newAuthorizedPubkey: new PublicKey(authorized)\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(SystemProgram.programId)) {\n      throw new Error('invalid instruction; programId is not SystemProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid SystemInstructionType's\n */\n\n/**\n * An enumeration of valid system InstructionType's\n * @internal\n */\nconst SYSTEM_INSTRUCTION_LAYOUTS = Object.freeze({\n  Create: {\n    index: 0,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('lamports'), Layout.ns64('space'), publicKey('programId')])\n  },\n  Assign: {\n    index: 1,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('programId')])\n  },\n  Transfer: {\n    index: 2,\n    layout: Layout.struct([Layout.u32('instruction'), index_browser_esm_u64('lamports')])\n  },\n  CreateWithSeed: {\n    index: 3,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('base'), rustString('seed'), Layout.ns64('lamports'), Layout.ns64('space'), publicKey('programId')])\n  },\n  AdvanceNonceAccount: {\n    index: 4,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  WithdrawNonceAccount: {\n    index: 5,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('lamports')])\n  },\n  InitializeNonceAccount: {\n    index: 6,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('authorized')])\n  },\n  AuthorizeNonceAccount: {\n    index: 7,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('authorized')])\n  },\n  Allocate: {\n    index: 8,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('space')])\n  },\n  AllocateWithSeed: {\n    index: 9,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('base'), rustString('seed'), Layout.ns64('space'), publicKey('programId')])\n  },\n  AssignWithSeed: {\n    index: 10,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('base'), rustString('seed'), publicKey('programId')])\n  },\n  TransferWithSeed: {\n    index: 11,\n    layout: Layout.struct([Layout.u32('instruction'), index_browser_esm_u64('lamports'), rustString('seed'), publicKey('programId')])\n  },\n  UpgradeNonceAccount: {\n    index: 12,\n    layout: Layout.struct([Layout.u32('instruction')])\n  }\n});\n\n/**\n * Factory class for transactions to interact with the System program\n */\nclass SystemProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the System program\n   */\n\n  /**\n   * Generate a transaction instruction that creates a new account\n   */\n  static createAccount(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.Create;\n    const data = encodeData(type, {\n      lamports: params.lamports,\n      space: params.space,\n      programId: toBuffer(params.programId.toBuffer())\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.fromPubkey,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: params.newAccountPubkey,\n        isSigner: true,\n        isWritable: true\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that transfers lamports from one account to another\n   */\n  static transfer(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.TransferWithSeed;\n      data = encodeData(type, {\n        lamports: BigInt(params.lamports),\n        seed: params.seed,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.fromPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Transfer;\n      data = encodeData(type, {\n        lamports: BigInt(params.lamports)\n      });\n      keys = [{\n        pubkey: params.fromPubkey,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that assigns an account to a program\n   */\n  static assign(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.AssignWithSeed;\n      data = encodeData(type, {\n        base: toBuffer(params.basePubkey.toBuffer()),\n        seed: params.seed,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Assign;\n      data = encodeData(type, {\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: true,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that creates a new account at\n   *   an address generated with `from`, a seed, and programId\n   */\n  static createAccountWithSeed(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.CreateWithSeed;\n    const data = encodeData(type, {\n      base: toBuffer(params.basePubkey.toBuffer()),\n      seed: params.seed,\n      lamports: params.lamports,\n      space: params.space,\n      programId: toBuffer(params.programId.toBuffer())\n    });\n    let keys = [{\n      pubkey: params.fromPubkey,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: params.newAccountPubkey,\n      isSigner: false,\n      isWritable: true\n    }];\n    if (params.basePubkey != params.fromPubkey) {\n      keys.push({\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction that creates a new Nonce account\n   */\n  static createNonceAccount(params) {\n    const transaction = new Transaction();\n    if ('basePubkey' in params && 'seed' in params) {\n      transaction.add(SystemProgram.createAccountWithSeed({\n        fromPubkey: params.fromPubkey,\n        newAccountPubkey: params.noncePubkey,\n        basePubkey: params.basePubkey,\n        seed: params.seed,\n        lamports: params.lamports,\n        space: NONCE_ACCOUNT_LENGTH,\n        programId: this.programId\n      }));\n    } else {\n      transaction.add(SystemProgram.createAccount({\n        fromPubkey: params.fromPubkey,\n        newAccountPubkey: params.noncePubkey,\n        lamports: params.lamports,\n        space: NONCE_ACCOUNT_LENGTH,\n        programId: this.programId\n      }));\n    }\n    const initParams = {\n      noncePubkey: params.noncePubkey,\n      authorizedPubkey: params.authorizedPubkey\n    };\n    transaction.add(this.nonceInitialize(initParams));\n    return transaction;\n  }\n\n  /**\n   * Generate an instruction to initialize a Nonce account\n   */\n  static nonceInitialize(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.InitializeNonceAccount;\n    const data = encodeData(type, {\n      authorized: toBuffer(params.authorizedPubkey.toBuffer())\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate an instruction to advance the nonce in a Nonce account\n   */\n  static nonceAdvance(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.AdvanceNonceAccount;\n    const data = encodeData(type);\n    const instructionData = {\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a transaction instruction that withdraws lamports from a Nonce account\n   */\n  static nonceWithdraw(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.WithdrawNonceAccount;\n    const data = encodeData(type, {\n      lamports: params.lamports\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.toPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RECENT_BLOCKHASHES_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that authorizes a new PublicKey as the authority\n   * on a Nonce account.\n   */\n  static nonceAuthorize(params) {\n    const type = SYSTEM_INSTRUCTION_LAYOUTS.AuthorizeNonceAccount;\n    const data = encodeData(type, {\n      authorized: toBuffer(params.newAuthorizedPubkey.toBuffer())\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: params.noncePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction instruction that allocates space in an account without funding\n   */\n  static allocate(params) {\n    let data;\n    let keys;\n    if ('basePubkey' in params) {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.AllocateWithSeed;\n      data = encodeData(type, {\n        base: toBuffer(params.basePubkey.toBuffer()),\n        seed: params.seed,\n        space: params.space,\n        programId: toBuffer(params.programId.toBuffer())\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: params.basePubkey,\n        isSigner: true,\n        isWritable: false\n      }];\n    } else {\n      const type = SYSTEM_INSTRUCTION_LAYOUTS.Allocate;\n      data = encodeData(type, {\n        space: params.space\n      });\n      keys = [{\n        pubkey: params.accountPubkey,\n        isSigner: true,\n        isWritable: true\n      }];\n    }\n    return new TransactionInstruction({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n}\nSystemProgram.programId = new PublicKey('11111111111111111111111111111111');\n\n// Keep program chunks under PACKET_DATA_SIZE, leaving enough room for the\n// rest of the Transaction fields\n//\n// TODO: replace 300 with a proper constant for the size of the other\n// Transaction fields\nconst CHUNK_SIZE = PACKET_DATA_SIZE - 300;\n\n/**\n * Program loader interface\n */\nclass Loader {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Amount of program data placed in each load Transaction\n   */\n\n  /**\n   * Minimum number of signatures required to load a program not including\n   * retries\n   *\n   * Can be used to calculate transaction fees\n   */\n  static getMinNumSignatures(dataLength) {\n    return 2 * (\n    // Every transaction requires two signatures (payer + program)\n    Math.ceil(dataLength / Loader.chunkSize) + 1 +\n    // Add one for Create transaction\n    1) // Add one for Finalize transaction\n    ;\n  }\n\n  /**\n   * Loads a generic program\n   *\n   * @param connection The connection to use\n   * @param payer System account that pays to load the program\n   * @param program Account to load the program into\n   * @param programId Public key that identifies the loader\n   * @param data Program octets\n   * @return true if program was loaded successfully, false if program was already loaded\n   */\n  static async load(connection, payer, program, programId, data) {\n    {\n      const balanceNeeded = await connection.getMinimumBalanceForRentExemption(data.length);\n\n      // Fetch program account info to check if it has already been created\n      const programInfo = await connection.getAccountInfo(program.publicKey, 'confirmed');\n      let transaction = null;\n      if (programInfo !== null) {\n        if (programInfo.executable) {\n          console.error('Program load failed, account is already executable');\n          return false;\n        }\n        if (programInfo.data.length !== data.length) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.allocate({\n            accountPubkey: program.publicKey,\n            space: data.length\n          }));\n        }\n        if (!programInfo.owner.equals(programId)) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.assign({\n            accountPubkey: program.publicKey,\n            programId\n          }));\n        }\n        if (programInfo.lamports < balanceNeeded) {\n          transaction = transaction || new Transaction();\n          transaction.add(SystemProgram.transfer({\n            fromPubkey: payer.publicKey,\n            toPubkey: program.publicKey,\n            lamports: balanceNeeded - programInfo.lamports\n          }));\n        }\n      } else {\n        transaction = new Transaction().add(SystemProgram.createAccount({\n          fromPubkey: payer.publicKey,\n          newAccountPubkey: program.publicKey,\n          lamports: balanceNeeded > 0 ? balanceNeeded : 1,\n          space: data.length,\n          programId\n        }));\n      }\n\n      // If the account is already created correctly, skip this step\n      // and proceed directly to loading instructions\n      if (transaction !== null) {\n        await sendAndConfirmTransaction(connection, transaction, [payer, program], {\n          commitment: 'confirmed'\n        });\n      }\n    }\n    const dataLayout = Layout.struct([Layout.u32('instruction'), Layout.u32('offset'), Layout.u32('bytesLength'), Layout.u32('bytesLengthPadding'), Layout.seq(Layout.u8('byte'), Layout.offset(Layout.u32(), -8), 'bytes')]);\n    const chunkSize = Loader.chunkSize;\n    let offset = 0;\n    let array = data;\n    let transactions = [];\n    while (array.length > 0) {\n      const bytes = array.slice(0, chunkSize);\n      const data = node_modules_buffer.Buffer.alloc(chunkSize + 16);\n      dataLayout.encode({\n        instruction: 0,\n        // Load instruction\n        offset,\n        bytes: bytes,\n        bytesLength: 0,\n        bytesLengthPadding: 0\n      }, data);\n      const transaction = new Transaction().add({\n        keys: [{\n          pubkey: program.publicKey,\n          isSigner: true,\n          isWritable: true\n        }],\n        programId,\n        data\n      });\n      transactions.push(sendAndConfirmTransaction(connection, transaction, [payer, program], {\n        commitment: 'confirmed'\n      }));\n\n      // Delay between sends in an attempt to reduce rate limit errors\n      if (connection._rpcEndpoint.includes('solana.com')) {\n        const REQUESTS_PER_SECOND = 4;\n        await sleep(1000 / REQUESTS_PER_SECOND);\n      }\n      offset += chunkSize;\n      array = array.slice(chunkSize);\n    }\n    await Promise.all(transactions);\n\n    // Finalize the account loaded with program data for execution\n    {\n      const dataLayout = Layout.struct([Layout.u32('instruction')]);\n      const data = node_modules_buffer.Buffer.alloc(dataLayout.span);\n      dataLayout.encode({\n        instruction: 1 // Finalize instruction\n      }, data);\n      const transaction = new Transaction().add({\n        keys: [{\n          pubkey: program.publicKey,\n          isSigner: true,\n          isWritable: true\n        }, {\n          pubkey: SYSVAR_RENT_PUBKEY,\n          isSigner: false,\n          isWritable: false\n        }],\n        programId,\n        data\n      });\n      const deployCommitment = 'processed';\n      const finalizeSignature = await connection.sendTransaction(transaction, [payer, program], {\n        preflightCommitment: deployCommitment\n      });\n      const {\n        context,\n        value\n      } = await connection.confirmTransaction({\n        signature: finalizeSignature,\n        lastValidBlockHeight: transaction.lastValidBlockHeight,\n        blockhash: transaction.recentBlockhash\n      }, deployCommitment);\n      if (value.err) {\n        throw new Error(`Transaction ${finalizeSignature} failed (${JSON.stringify(value)})`);\n      }\n      // We prevent programs from being usable until the slot after their deployment.\n      // See https://github.com/solana-labs/solana/pull/29654\n      while (true // eslint-disable-line no-constant-condition\n      ) {\n        try {\n          const currentSlot = await connection.getSlot({\n            commitment: deployCommitment\n          });\n          if (currentSlot > context.slot) {\n            break;\n          }\n        } catch {\n          /* empty */\n        }\n        await new Promise(resolve => setTimeout(resolve, Math.round(MS_PER_SLOT / 2)));\n      }\n    }\n\n    // success\n    return true;\n  }\n}\nLoader.chunkSize = CHUNK_SIZE;\n\n/**\n * @deprecated Deprecated since Solana v1.17.20.\n */\nconst BPF_LOADER_PROGRAM_ID = new PublicKey('BPFLoader2111111111111111111111111111111111');\n\n/**\n * Factory class for transactions to interact with a program loader\n *\n * @deprecated Deprecated since Solana v1.17.20.\n */\nclass BpfLoader {\n  /**\n   * Minimum number of signatures required to load a program not including\n   * retries\n   *\n   * Can be used to calculate transaction fees\n   */\n  static getMinNumSignatures(dataLength) {\n    return Loader.getMinNumSignatures(dataLength);\n  }\n\n  /**\n   * Load a SBF program\n   *\n   * @param connection The connection to use\n   * @param payer Account that will pay program loading fees\n   * @param program Account to load the program into\n   * @param elf The entire ELF containing the SBF program\n   * @param loaderProgramId The program id of the BPF loader to use\n   * @return true if program was loaded successfully, false if program was already loaded\n   */\n  static load(connection, payer, program, elf, loaderProgramId) {\n    return Loader.load(connection, payer, program, loaderProgramId, elf);\n  }\n}\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\nvar objToString = Object.prototype.toString;\nvar objKeys = Object.keys || function(obj) {\n\t\tvar keys = [];\n\t\tfor (var name in obj) {\n\t\t\tkeys.push(name);\n\t\t}\n\t\treturn keys;\n\t};\n\nfunction stringify(val, isArrayProp) {\n\tvar i, max, str, keys, key, propVal, toStr;\n\tif (val === true) {\n\t\treturn \"true\";\n\t}\n\tif (val === false) {\n\t\treturn \"false\";\n\t}\n\tswitch (typeof val) {\n\t\tcase \"object\":\n\t\t\tif (val === null) {\n\t\t\t\treturn null;\n\t\t\t} else if (val.toJSON && typeof val.toJSON === \"function\") {\n\t\t\t\treturn stringify(val.toJSON(), isArrayProp);\n\t\t\t} else {\n\t\t\t\ttoStr = objToString.call(val);\n\t\t\t\tif (toStr === \"[object Array]\") {\n\t\t\t\t\tstr = '[';\n\t\t\t\t\tmax = val.length - 1;\n\t\t\t\t\tfor(i = 0; i < max; i++) {\n\t\t\t\t\t\tstr += stringify(val[i], true) + ',';\n\t\t\t\t\t}\n\t\t\t\t\tif (max > -1) {\n\t\t\t\t\t\tstr += stringify(val[i], true);\n\t\t\t\t\t}\n\t\t\t\t\treturn str + ']';\n\t\t\t\t} else if (toStr === \"[object Object]\") {\n\t\t\t\t\t// only object is left\n\t\t\t\t\tkeys = objKeys(val).sort();\n\t\t\t\t\tmax = keys.length;\n\t\t\t\t\tstr = \"\";\n\t\t\t\t\ti = 0;\n\t\t\t\t\twhile (i < max) {\n\t\t\t\t\t\tkey = keys[i];\n\t\t\t\t\t\tpropVal = stringify(val[key], false);\n\t\t\t\t\t\tif (propVal !== undefined) {\n\t\t\t\t\t\t\tif (str) {\n\t\t\t\t\t\t\t\tstr += ',';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstr += JSON.stringify(key) + ':' + propVal;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t\treturn '{' + str + '}';\n\t\t\t\t} else {\n\t\t\t\t\treturn JSON.stringify(val);\n\t\t\t\t}\n\t\t\t}\n\t\tcase \"function\":\n\t\tcase \"undefined\":\n\t\t\treturn isArrayProp ? null : undefined;\n\t\tcase \"string\":\n\t\t\treturn JSON.stringify(val);\n\t\tdefault:\n\t\t\treturn isFinite(val) ? val : null;\n\t}\n}\n\nvar fastStableStringify = function(val) {\n\tvar returnVal = stringify(val, false);\n\tif (returnVal !== undefined) {\n\t\treturn ''+ returnVal;\n\t}\n};\n\nvar fastStableStringify$1 = /*@__PURE__*/getDefaultExportFromCjs(fastStableStringify);\n\nconst MINIMUM_SLOT_PER_EPOCH = 32;\n\n// Returns the number of trailing zeros in the binary representation of self.\nfunction trailingZeros(n) {\n  let trailingZeros = 0;\n  while (n > 1) {\n    n /= 2;\n    trailingZeros++;\n  }\n  return trailingZeros;\n}\n\n// Returns the smallest power of two greater than or equal to n\nfunction nextPowerOfTwo(n) {\n  if (n === 0) return 1;\n  n--;\n  n |= n >> 1;\n  n |= n >> 2;\n  n |= n >> 4;\n  n |= n >> 8;\n  n |= n >> 16;\n  n |= n >> 32;\n  return n + 1;\n}\n\n/**\n * Epoch schedule\n * (see https://docs.solana.com/terminology#epoch)\n * Can be retrieved with the {@link Connection.getEpochSchedule} method\n */\nclass EpochSchedule {\n  constructor(slotsPerEpoch, leaderScheduleSlotOffset, warmup, firstNormalEpoch, firstNormalSlot) {\n    /** The maximum number of slots in each epoch */\n    this.slotsPerEpoch = void 0;\n    /** The number of slots before beginning of an epoch to calculate a leader schedule for that epoch */\n    this.leaderScheduleSlotOffset = void 0;\n    /** Indicates whether epochs start short and grow */\n    this.warmup = void 0;\n    /** The first epoch with `slotsPerEpoch` slots */\n    this.firstNormalEpoch = void 0;\n    /** The first slot of `firstNormalEpoch` */\n    this.firstNormalSlot = void 0;\n    this.slotsPerEpoch = slotsPerEpoch;\n    this.leaderScheduleSlotOffset = leaderScheduleSlotOffset;\n    this.warmup = warmup;\n    this.firstNormalEpoch = firstNormalEpoch;\n    this.firstNormalSlot = firstNormalSlot;\n  }\n  getEpoch(slot) {\n    return this.getEpochAndSlotIndex(slot)[0];\n  }\n  getEpochAndSlotIndex(slot) {\n    if (slot < this.firstNormalSlot) {\n      const epoch = trailingZeros(nextPowerOfTwo(slot + MINIMUM_SLOT_PER_EPOCH + 1)) - trailingZeros(MINIMUM_SLOT_PER_EPOCH) - 1;\n      const epochLen = this.getSlotsInEpoch(epoch);\n      const slotIndex = slot - (epochLen - MINIMUM_SLOT_PER_EPOCH);\n      return [epoch, slotIndex];\n    } else {\n      const normalSlotIndex = slot - this.firstNormalSlot;\n      const normalEpochIndex = Math.floor(normalSlotIndex / this.slotsPerEpoch);\n      const epoch = this.firstNormalEpoch + normalEpochIndex;\n      const slotIndex = normalSlotIndex % this.slotsPerEpoch;\n      return [epoch, slotIndex];\n    }\n  }\n  getFirstSlotInEpoch(epoch) {\n    if (epoch <= this.firstNormalEpoch) {\n      return (Math.pow(2, epoch) - 1) * MINIMUM_SLOT_PER_EPOCH;\n    } else {\n      return (epoch - this.firstNormalEpoch) * this.slotsPerEpoch + this.firstNormalSlot;\n    }\n  }\n  getLastSlotInEpoch(epoch) {\n    return this.getFirstSlotInEpoch(epoch) + this.getSlotsInEpoch(epoch) - 1;\n  }\n  getSlotsInEpoch(epoch) {\n    if (epoch < this.firstNormalEpoch) {\n      return Math.pow(2, epoch + trailingZeros(MINIMUM_SLOT_PER_EPOCH));\n    } else {\n      return this.slotsPerEpoch;\n    }\n  }\n}\n\nvar fetchImpl = globalThis.fetch;\n\nclass RpcWebSocketClient extends CommonClient {\n  constructor(address, options, generate_request_id) {\n    const webSocketFactory = url => {\n      const rpc = WebSocket(url, {\n        autoconnect: true,\n        max_reconnects: 5,\n        reconnect: true,\n        reconnect_interval: 1000,\n        ...options\n      });\n      if ('socket' in rpc) {\n        this.underlyingSocket = rpc.socket;\n      } else {\n        this.underlyingSocket = rpc;\n      }\n      return rpc;\n    };\n    super(webSocketFactory, address, options, generate_request_id);\n    this.underlyingSocket = void 0;\n  }\n  call(...args) {\n    const readyState = this.underlyingSocket?.readyState;\n    if (readyState === 1 /* WebSocket.OPEN */) {\n      return super.call(...args);\n    }\n    return Promise.reject(new Error('Tried to call a JSON-RPC method `' + args[0] + '` but the socket was not `CONNECTING` or `OPEN` (`readyState` was ' + readyState + ')'));\n  }\n  notify(...args) {\n    const readyState = this.underlyingSocket?.readyState;\n    if (readyState === 1 /* WebSocket.OPEN */) {\n      return super.notify(...args);\n    }\n    return Promise.reject(new Error('Tried to send a JSON-RPC notification `' + args[0] + '` but the socket was not `CONNECTING` or `OPEN` (`readyState` was ' + readyState + ')'));\n  }\n}\n\n/**\n * @internal\n */\n\n/**\n * Decode account data buffer using an AccountType\n * @internal\n */\nfunction decodeData(type, data) {\n  let decoded;\n  try {\n    decoded = type.layout.decode(data);\n  } catch (err) {\n    throw new Error('invalid instruction; ' + err);\n  }\n  if (decoded.typeIndex !== type.index) {\n    throw new Error(`invalid account data; account type mismatch ${decoded.typeIndex} != ${type.index}`);\n  }\n  return decoded;\n}\n\n/// The serialized size of lookup table metadata\nconst LOOKUP_TABLE_META_SIZE = 56;\nclass AddressLookupTableAccount {\n  constructor(args) {\n    this.key = void 0;\n    this.state = void 0;\n    this.key = args.key;\n    this.state = args.state;\n  }\n  isActive() {\n    const U64_MAX = BigInt('0xffffffffffffffff');\n    return this.state.deactivationSlot === U64_MAX;\n  }\n  static deserialize(accountData) {\n    const meta = decodeData(LookupTableMetaLayout, accountData);\n    const serializedAddressesLen = accountData.length - LOOKUP_TABLE_META_SIZE;\n    index_browser_esm_assert(serializedAddressesLen >= 0, 'lookup table is invalid');\n    index_browser_esm_assert(serializedAddressesLen % 32 === 0, 'lookup table is invalid');\n    const numSerializedAddresses = serializedAddressesLen / 32;\n    const {\n      addresses\n    } = Layout.struct([Layout.seq(publicKey(), numSerializedAddresses, 'addresses')]).decode(accountData.slice(LOOKUP_TABLE_META_SIZE));\n    return {\n      deactivationSlot: meta.deactivationSlot,\n      lastExtendedSlot: meta.lastExtendedSlot,\n      lastExtendedSlotStartIndex: meta.lastExtendedStartIndex,\n      authority: meta.authority.length !== 0 ? new PublicKey(meta.authority[0]) : undefined,\n      addresses: addresses.map(address => new PublicKey(address))\n    };\n  }\n}\nconst LookupTableMetaLayout = {\n  index: 1,\n  layout: Layout.struct([Layout.u32('typeIndex'), index_browser_esm_u64('deactivationSlot'), Layout.nu64('lastExtendedSlot'), Layout.u8('lastExtendedStartIndex'), Layout.u8(),\n  // option\n  Layout.seq(publicKey(), Layout.offset(Layout.u8(), -1), 'authority')])\n};\n\nconst URL_RE = /^[^:]+:\\/\\/([^:[]+|\\[[^\\]]+\\])(:\\d+)?(.*)/i;\nfunction makeWebsocketUrl(endpoint) {\n  const matches = endpoint.match(URL_RE);\n  if (matches == null) {\n    throw TypeError(`Failed to validate endpoint URL \\`${endpoint}\\``);\n  }\n  const [_,\n  // eslint-disable-line @typescript-eslint/no-unused-vars\n  hostish, portWithColon, rest] = matches;\n  const protocol = endpoint.startsWith('https:') ? 'wss:' : 'ws:';\n  const startPort = portWithColon == null ? null : parseInt(portWithColon.slice(1), 10);\n  const websocketPort =\n  // Only shift the port by +1 as a convention for ws(s) only if given endpoint\n  // is explicitly specifying the endpoint port (HTTP-based RPC), assuming\n  // we're directly trying to connect to agave-validator's ws listening port.\n  // When the endpoint omits the port, we're connecting to the protocol\n  // default ports: http(80) or https(443) and it's assumed we're behind a reverse\n  // proxy which manages WebSocket upgrade and backend port redirection.\n  startPort == null ? '' : `:${startPort + 1}`;\n  return `${protocol}//${hostish}${websocketPort}${rest}`;\n}\n\nconst PublicKeyFromString = coerce(instance(PublicKey), string(), value => new PublicKey(value));\nconst RawAccountDataResult = tuple([string(), literal('base64')]);\nconst BufferFromRawAccountData = coerce(instance(node_modules_buffer.Buffer), RawAccountDataResult, value => node_modules_buffer.Buffer.from(value[0], 'base64'));\n\n/**\n * Attempt to use a recent blockhash for up to 30 seconds\n * @internal\n */\nconst BLOCKHASH_CACHE_TIMEOUT_MS = 30 * 1000;\n\n/**\n * HACK.\n * Copied from rpc-websockets/dist/lib/client.\n * Otherwise, `yarn build` fails with:\n * https://gist.github.com/steveluscher/c057eca81d479ef705cdb53162f9971d\n */\n\n/** @internal */\n/** @internal */\n/** @internal */\n/** @internal */\n\n/** @internal */\n/**\n * @internal\n * Every subscription contains the args used to open the subscription with\n * the server, and a list of callers interested in notifications.\n */\n\n/**\n * @internal\n * A subscription may be in various states of connectedness. Only when it is\n * fully connected will it have a server subscription id associated with it.\n * This id can be returned to the server to unsubscribe the client entirely.\n */\n\n/**\n * A type that encapsulates a subscription's RPC method\n * names and notification (callback) signature.\n */\n\n/**\n * @internal\n * Utility type that keeps tagged unions intact while omitting properties.\n */\n\n/**\n * @internal\n * This type represents a single subscribable 'topic.' It's made up of:\n *\n * - The args used to open the subscription with the server,\n * - The state of the subscription, in terms of its connectedness, and\n * - The set of callbacks to call when the server publishes notifications\n *\n * This record gets indexed by `SubscriptionConfigHash` and is used to\n * set up subscriptions, fan out notifications, and track subscription state.\n */\n\n/**\n * @internal\n */\n\n/**\n * Extra contextual information for RPC responses\n */\n\n/**\n * Options for sending transactions\n */\n\n/**\n * Options for confirming transactions\n */\n\n/**\n * Options for getConfirmedSignaturesForAddress2\n */\n\n/**\n * Options for getSignaturesForAddress\n */\n\n/**\n * RPC Response with extra contextual information\n */\n\n/**\n * A strategy for confirming transactions that uses the last valid\n * block height for a given blockhash to check for transaction expiration.\n */\n\n/**\n * A strategy for confirming durable nonce transactions.\n */\n\n/**\n * Properties shared by all transaction confirmation strategies\n */\n\n/**\n * This type represents all transaction confirmation strategies\n */\n\n/* @internal */\nfunction assertEndpointUrl(putativeUrl) {\n  if (/^https?:/.test(putativeUrl) === false) {\n    throw new TypeError('Endpoint URL must start with `http:` or `https:`.');\n  }\n  return putativeUrl;\n}\n\n/** @internal */\nfunction extractCommitmentFromConfig(commitmentOrConfig) {\n  let commitment;\n  let config;\n  if (typeof commitmentOrConfig === 'string') {\n    commitment = commitmentOrConfig;\n  } else if (commitmentOrConfig) {\n    const {\n      commitment: specifiedCommitment,\n      ...specifiedConfig\n    } = commitmentOrConfig;\n    commitment = specifiedCommitment;\n    config = specifiedConfig;\n  }\n  return {\n    commitment,\n    config\n  };\n}\n\n/**\n * @internal\n */\nfunction createRpcResult(result) {\n  return union([type({\n    jsonrpc: literal('2.0'),\n    id: string(),\n    result\n  }), type({\n    jsonrpc: literal('2.0'),\n    id: string(),\n    error: type({\n      code: unknown(),\n      message: string(),\n      data: optional(any())\n    })\n  })]);\n}\nconst UnknownRpcResult = createRpcResult(unknown());\n\n/**\n * @internal\n */\nfunction jsonRpcResult(schema) {\n  return coerce(createRpcResult(schema), UnknownRpcResult, value => {\n    if ('error' in value) {\n      return value;\n    } else {\n      return {\n        ...value,\n        result: create(value.result, schema)\n      };\n    }\n  });\n}\n\n/**\n * @internal\n */\nfunction jsonRpcResultAndContext(value) {\n  return jsonRpcResult(type({\n    context: type({\n      slot: number()\n    }),\n    value\n  }));\n}\n\n/**\n * @internal\n */\nfunction notificationResultAndContext(value) {\n  return type({\n    context: type({\n      slot: number()\n    }),\n    value\n  });\n}\n\n/**\n * @internal\n */\nfunction versionedMessageFromResponse(version, response) {\n  if (version === 0) {\n    return new MessageV0({\n      header: response.header,\n      staticAccountKeys: response.accountKeys.map(accountKey => new PublicKey(accountKey)),\n      recentBlockhash: response.recentBlockhash,\n      compiledInstructions: response.instructions.map(ix => ({\n        programIdIndex: ix.programIdIndex,\n        accountKeyIndexes: ix.accounts,\n        data: bs58_default().decode(ix.data)\n      })),\n      addressTableLookups: response.addressTableLookups\n    });\n  } else {\n    return new Message(response);\n  }\n}\n\n/**\n * The level of commitment desired when querying state\n * <pre>\n *   'processed': Query the most recent block which has reached 1 confirmation by the connected node\n *   'confirmed': Query the most recent block which has reached 1 confirmation by the cluster\n *   'finalized': Query the most recent block which has been finalized by the cluster\n * </pre>\n */\n\n// Deprecated as of v1.5.5\n\n/**\n * A subset of Commitment levels, which are at least optimistically confirmed\n * <pre>\n *   'confirmed': Query the most recent block which has reached 1 confirmation by the cluster\n *   'finalized': Query the most recent block which has been finalized by the cluster\n * </pre>\n */\n\n/**\n * Filter for largest accounts query\n * <pre>\n *   'circulating':    Return the largest accounts that are part of the circulating supply\n *   'nonCirculating': Return the largest accounts that are not part of the circulating supply\n * </pre>\n */\n\n/**\n * Configuration object for changing `getAccountInfo` query behavior\n */\n\n/**\n * Configuration object for changing `getBalance` query behavior\n */\n\n/**\n * Configuration object for changing `getBlock` query behavior\n */\n\n/**\n * Configuration object for changing `getBlock` query behavior\n */\n\n/**\n * Configuration object for changing `getStakeMinimumDelegation` query behavior\n */\n\n/**\n * Configuration object for changing `getBlockHeight` query behavior\n */\n\n/**\n * Configuration object for changing `getEpochInfo` query behavior\n */\n\n/**\n * Configuration object for changing `getInflationReward` query behavior\n */\n\n/**\n * Configuration object for changing `getLatestBlockhash` query behavior\n */\n\n/**\n * Configuration object for changing `isBlockhashValid` query behavior\n */\n\n/**\n * Configuration object for changing `getSlot` query behavior\n */\n\n/**\n * Configuration object for changing `getSlotLeader` query behavior\n */\n\n/**\n * Configuration object for changing `getTransaction` query behavior\n */\n\n/**\n * Configuration object for changing `getTransaction` query behavior\n */\n\n/**\n * Configuration object for changing `getLargestAccounts` query behavior\n */\n\n/**\n * Configuration object for changing `getSupply` request behavior\n */\n\n/**\n * Configuration object for changing query behavior\n */\n\n/**\n * Information describing a cluster node\n */\n\n/**\n * Information describing a vote account\n */\n\n/**\n * A collection of cluster vote accounts\n */\n\n/**\n * Network Inflation\n * (see https://docs.solana.com/implemented-proposals/ed_overview)\n */\n\nconst GetInflationGovernorResult = type({\n  foundation: number(),\n  foundationTerm: number(),\n  initial: number(),\n  taper: number(),\n  terminal: number()\n});\n\n/**\n * The inflation reward for an epoch\n */\n\n/**\n * Expected JSON RPC response for the \"getInflationReward\" message\n */\nconst GetInflationRewardResult = jsonRpcResult(array(nullable(type({\n  epoch: number(),\n  effectiveSlot: number(),\n  amount: number(),\n  postBalance: number(),\n  commission: optional(nullable(number()))\n}))));\n\n/**\n * Configuration object for changing `getRecentPrioritizationFees` query behavior\n */\n\n/**\n * Expected JSON RPC response for the \"getRecentPrioritizationFees\" message\n */\nconst GetRecentPrioritizationFeesResult = array(type({\n  slot: number(),\n  prioritizationFee: number()\n}));\n/**\n * Expected JSON RPC response for the \"getInflationRate\" message\n */\nconst GetInflationRateResult = type({\n  total: number(),\n  validator: number(),\n  foundation: number(),\n  epoch: number()\n});\n\n/**\n * Information about the current epoch\n */\n\nconst GetEpochInfoResult = type({\n  epoch: number(),\n  slotIndex: number(),\n  slotsInEpoch: number(),\n  absoluteSlot: number(),\n  blockHeight: optional(number()),\n  transactionCount: optional(number())\n});\nconst GetEpochScheduleResult = type({\n  slotsPerEpoch: number(),\n  leaderScheduleSlotOffset: number(),\n  warmup: dist_boolean(),\n  firstNormalEpoch: number(),\n  firstNormalSlot: number()\n});\n\n/**\n * Leader schedule\n * (see https://docs.solana.com/terminology#leader-schedule)\n */\n\nconst GetLeaderScheduleResult = record(string(), array(number()));\n\n/**\n * Transaction error or null\n */\nconst TransactionErrorResult = nullable(union([type({}), string()]));\n\n/**\n * Signature status for a transaction\n */\nconst SignatureStatusResult = type({\n  err: TransactionErrorResult\n});\n\n/**\n * Transaction signature received notification\n */\nconst SignatureReceivedResult = literal('receivedSignature');\n\n/**\n * Version info for a node\n */\n\nconst VersionResult = type({\n  'solana-core': string(),\n  'feature-set': optional(number())\n});\nconst ParsedInstructionStruct = type({\n  program: string(),\n  programId: PublicKeyFromString,\n  parsed: unknown()\n});\nconst PartiallyDecodedInstructionStruct = type({\n  programId: PublicKeyFromString,\n  accounts: array(PublicKeyFromString),\n  data: string()\n});\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n  err: nullable(union([type({}), string()])),\n  logs: nullable(array(string())),\n  accounts: optional(nullable(array(nullable(type({\n    executable: dist_boolean(),\n    owner: string(),\n    lamports: number(),\n    data: array(string()),\n    rentEpoch: optional(number())\n  }))))),\n  unitsConsumed: optional(number()),\n  returnData: optional(nullable(type({\n    programId: string(),\n    data: tuple([string(), literal('base64')])\n  }))),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(union([ParsedInstructionStruct, PartiallyDecodedInstructionStruct]))\n  }))))\n}));\n\n/**\n * Metadata for a parsed confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link ParsedTransactionMeta} instead.\n */\n\n/**\n * Collection of addresses loaded by a transaction using address table lookups\n */\n\n/**\n * Metadata for a parsed transaction on the ledger\n */\n\n/**\n * Metadata for a confirmed transaction on the ledger\n */\n\n/**\n * A processed transaction from the RPC API\n */\n\n/**\n * A processed transaction from the RPC API\n */\n\n/**\n * A processed transaction message from the RPC API\n */\n\n/**\n * A confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0.\n */\n\n/**\n * A partially decoded transaction instruction\n */\n\n/**\n * A parsed transaction message account\n */\n\n/**\n * A parsed transaction instruction\n */\n\n/**\n * A parsed address table lookup\n */\n\n/**\n * A parsed transaction message\n */\n\n/**\n * A parsed transaction\n */\n\n/**\n * A parsed and confirmed transaction on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link ParsedTransactionWithMeta} instead.\n */\n\n/**\n * A parsed transaction on the ledger with meta\n */\n\n/**\n * A processed block fetched from the RPC API\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `none`\n */\n\n/**\n * A block with parsed transactions\n */\n\n/**\n * A block with parsed transactions where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A block with parsed transactions where the `transactionDetails` mode is `none`\n */\n\n/**\n * A processed block fetched from the RPC API\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `accounts`\n */\n\n/**\n * A processed block fetched from the RPC API where the `transactionDetails` mode is `none`\n */\n\n/**\n * A confirmed block on the ledger\n *\n * @deprecated Deprecated since RPC v1.8.0.\n */\n\n/**\n * A Block on the ledger with signatures only\n */\n\n/**\n * recent block production information\n */\n\n/**\n * Expected JSON RPC response for the \"getBlockProduction\" message\n */\nconst BlockProductionResponseStruct = jsonRpcResultAndContext(type({\n  byIdentity: record(string(), array(number())),\n  range: type({\n    firstSlot: number(),\n    lastSlot: number()\n  })\n}));\n\n/**\n * A performance sample\n */\n\nfunction createRpcClient(url, httpHeaders, customFetch, fetchMiddleware, disableRetryOnRateLimit, httpAgent) {\n  const fetch = customFetch ? customFetch : fetchImpl;\n  let agent;\n  {\n    if (httpAgent != null) {\n      console.warn('You have supplied an `httpAgent` when creating a `Connection` in a browser environment.' + 'It has been ignored; `httpAgent` is only used in Node environments.');\n    }\n  }\n  let fetchWithMiddleware;\n  if (fetchMiddleware) {\n    fetchWithMiddleware = async (info, init) => {\n      const modifiedFetchArgs = await new Promise((resolve, reject) => {\n        try {\n          fetchMiddleware(info, init, (modifiedInfo, modifiedInit) => resolve([modifiedInfo, modifiedInit]));\n        } catch (error) {\n          reject(error);\n        }\n      });\n      return await fetch(...modifiedFetchArgs);\n    };\n  }\n  const clientBrowser = new (browser_default())(async (request, callback) => {\n    const options = {\n      method: 'POST',\n      body: request,\n      agent,\n      headers: Object.assign({\n        'Content-Type': 'application/json'\n      }, httpHeaders || {}, COMMON_HTTP_HEADERS)\n    };\n    try {\n      let too_many_requests_retries = 5;\n      let res;\n      let waitTime = 500;\n      for (;;) {\n        if (fetchWithMiddleware) {\n          res = await fetchWithMiddleware(url, options);\n        } else {\n          res = await fetch(url, options);\n        }\n        if (res.status !== 429 /* Too many requests */) {\n          break;\n        }\n        if (disableRetryOnRateLimit === true) {\n          break;\n        }\n        too_many_requests_retries -= 1;\n        if (too_many_requests_retries === 0) {\n          break;\n        }\n        console.error(`Server responded with ${res.status} ${res.statusText}.  Retrying after ${waitTime}ms delay...`);\n        await sleep(waitTime);\n        waitTime *= 2;\n      }\n      const text = await res.text();\n      if (res.ok) {\n        callback(null, text);\n      } else {\n        callback(new Error(`${res.status} ${res.statusText}: ${text}`));\n      }\n    } catch (err) {\n      if (err instanceof Error) callback(err);\n    }\n  }, {});\n  return clientBrowser;\n}\nfunction createRpcRequest(client) {\n  return (method, args) => {\n    return new Promise((resolve, reject) => {\n      client.request(method, args, (err, response) => {\n        if (err) {\n          reject(err);\n          return;\n        }\n        resolve(response);\n      });\n    });\n  };\n}\nfunction createRpcBatchRequest(client) {\n  return requests => {\n    return new Promise((resolve, reject) => {\n      // Do nothing if requests is empty\n      if (requests.length === 0) resolve([]);\n      const batch = requests.map(params => {\n        return client.request(params.methodName, params.args);\n      });\n      client.request(batch, (err, response) => {\n        if (err) {\n          reject(err);\n          return;\n        }\n        resolve(response);\n      });\n    });\n  };\n}\n\n/**\n * Expected JSON RPC response for the \"getInflationGovernor\" message\n */\nconst GetInflationGovernorRpcResult = jsonRpcResult(GetInflationGovernorResult);\n\n/**\n * Expected JSON RPC response for the \"getInflationRate\" message\n */\nconst GetInflationRateRpcResult = jsonRpcResult(GetInflationRateResult);\n\n/**\n * Expected JSON RPC response for the \"getRecentPrioritizationFees\" message\n */\nconst GetRecentPrioritizationFeesRpcResult = jsonRpcResult(GetRecentPrioritizationFeesResult);\n\n/**\n * Expected JSON RPC response for the \"getEpochInfo\" message\n */\nconst GetEpochInfoRpcResult = jsonRpcResult(GetEpochInfoResult);\n\n/**\n * Expected JSON RPC response for the \"getEpochSchedule\" message\n */\nconst GetEpochScheduleRpcResult = jsonRpcResult(GetEpochScheduleResult);\n\n/**\n * Expected JSON RPC response for the \"getLeaderSchedule\" message\n */\nconst GetLeaderScheduleRpcResult = jsonRpcResult(GetLeaderScheduleResult);\n\n/**\n * Expected JSON RPC response for the \"minimumLedgerSlot\" and \"getFirstAvailableBlock\" messages\n */\nconst SlotRpcResult = jsonRpcResult(number());\n\n/**\n * Supply\n */\n\n/**\n * Expected JSON RPC response for the \"getSupply\" message\n */\nconst GetSupplyRpcResult = jsonRpcResultAndContext(type({\n  total: number(),\n  circulating: number(),\n  nonCirculating: number(),\n  nonCirculatingAccounts: array(PublicKeyFromString)\n}));\n\n/**\n * Token amount object which returns a token amount in different formats\n * for various client use cases.\n */\n\n/**\n * Expected JSON RPC structure for token amounts\n */\nconst TokenAmountResult = type({\n  amount: string(),\n  uiAmount: nullable(number()),\n  decimals: number(),\n  uiAmountString: optional(string())\n});\n\n/**\n * Token address and balance.\n */\n\n/**\n * Expected JSON RPC response for the \"getTokenLargestAccounts\" message\n */\nconst GetTokenLargestAccountsResult = jsonRpcResultAndContext(array(type({\n  address: PublicKeyFromString,\n  amount: string(),\n  uiAmount: nullable(number()),\n  decimals: number(),\n  uiAmountString: optional(string())\n})));\n\n/**\n * Expected JSON RPC response for the \"getTokenAccountsByOwner\" message\n */\nconst GetTokenAccountsByOwner = jsonRpcResultAndContext(array(type({\n  pubkey: PublicKeyFromString,\n  account: type({\n    executable: dist_boolean(),\n    owner: PublicKeyFromString,\n    lamports: number(),\n    data: BufferFromRawAccountData,\n    rentEpoch: number()\n  })\n})));\nconst ParsedAccountDataResult = type({\n  program: string(),\n  parsed: unknown(),\n  space: number()\n});\n\n/**\n * Expected JSON RPC response for the \"getTokenAccountsByOwner\" message with parsed data\n */\nconst GetParsedTokenAccountsByOwner = jsonRpcResultAndContext(array(type({\n  pubkey: PublicKeyFromString,\n  account: type({\n    executable: dist_boolean(),\n    owner: PublicKeyFromString,\n    lamports: number(),\n    data: ParsedAccountDataResult,\n    rentEpoch: number()\n  })\n})));\n\n/**\n * Pair of an account address and its balance\n */\n\n/**\n * Expected JSON RPC response for the \"getLargestAccounts\" message\n */\nconst GetLargestAccountsRpcResult = jsonRpcResultAndContext(array(type({\n  lamports: number(),\n  address: PublicKeyFromString\n})));\n\n/**\n * @internal\n */\nconst AccountInfoResult = type({\n  executable: dist_boolean(),\n  owner: PublicKeyFromString,\n  lamports: number(),\n  data: BufferFromRawAccountData,\n  rentEpoch: number()\n});\n\n/**\n * @internal\n */\nconst KeyedAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: AccountInfoResult\n});\nconst ParsedOrRawAccountData = coerce(union([instance(node_modules_buffer.Buffer), ParsedAccountDataResult]), union([RawAccountDataResult, ParsedAccountDataResult]), value => {\n  if (Array.isArray(value)) {\n    return create(value, BufferFromRawAccountData);\n  } else {\n    return value;\n  }\n});\n\n/**\n * @internal\n */\nconst ParsedAccountInfoResult = type({\n  executable: dist_boolean(),\n  owner: PublicKeyFromString,\n  lamports: number(),\n  data: ParsedOrRawAccountData,\n  rentEpoch: number()\n});\nconst KeyedParsedAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: ParsedAccountInfoResult\n});\n\n/**\n * @internal\n */\nconst StakeActivationResult = type({\n  state: union([literal('active'), literal('inactive'), literal('activating'), literal('deactivating')]),\n  active: number(),\n  inactive: number()\n});\n\n/**\n * Expected JSON RPC response for the \"getConfirmedSignaturesForAddress2\" message\n */\n\nconst GetConfirmedSignaturesForAddress2RpcResult = jsonRpcResult(array(type({\n  signature: string(),\n  slot: number(),\n  err: TransactionErrorResult,\n  memo: nullable(string()),\n  blockTime: optional(nullable(number()))\n})));\n\n/**\n * Expected JSON RPC response for the \"getSignaturesForAddress\" message\n */\nconst GetSignaturesForAddressRpcResult = jsonRpcResult(array(type({\n  signature: string(),\n  slot: number(),\n  err: TransactionErrorResult,\n  memo: nullable(string()),\n  blockTime: optional(nullable(number()))\n})));\n\n/***\n * Expected JSON RPC response for the \"accountNotification\" message\n */\nconst AccountNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(AccountInfoResult)\n});\n\n/**\n * @internal\n */\nconst ProgramAccountInfoResult = type({\n  pubkey: PublicKeyFromString,\n  account: AccountInfoResult\n});\n\n/***\n * Expected JSON RPC response for the \"programNotification\" message\n */\nconst ProgramAccountNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(ProgramAccountInfoResult)\n});\n\n/**\n * @internal\n */\nconst SlotInfoResult = type({\n  parent: number(),\n  slot: number(),\n  root: number()\n});\n\n/**\n * Expected JSON RPC response for the \"slotNotification\" message\n */\nconst SlotNotificationResult = type({\n  subscription: number(),\n  result: SlotInfoResult\n});\n\n/**\n * Slot updates which can be used for tracking the live progress of a cluster.\n * - `\"firstShredReceived\"`: connected node received the first shred of a block.\n * Indicates that a new block that is being produced.\n * - `\"completed\"`: connected node has received all shreds of a block. Indicates\n * a block was recently produced.\n * - `\"optimisticConfirmation\"`: block was optimistically confirmed by the\n * cluster. It is not guaranteed that an optimistic confirmation notification\n * will be sent for every finalized blocks.\n * - `\"root\"`: the connected node rooted this block.\n * - `\"createdBank\"`: the connected node has started validating this block.\n * - `\"frozen\"`: the connected node has validated this block.\n * - `\"dead\"`: the connected node failed to validate this block.\n */\n\n/**\n * @internal\n */\nconst SlotUpdateResult = union([type({\n  type: union([literal('firstShredReceived'), literal('completed'), literal('optimisticConfirmation'), literal('root')]),\n  slot: number(),\n  timestamp: number()\n}), type({\n  type: literal('createdBank'),\n  parent: number(),\n  slot: number(),\n  timestamp: number()\n}), type({\n  type: literal('frozen'),\n  slot: number(),\n  timestamp: number(),\n  stats: type({\n    numTransactionEntries: number(),\n    numSuccessfulTransactions: number(),\n    numFailedTransactions: number(),\n    maxTransactionsPerEntry: number()\n  })\n}), type({\n  type: literal('dead'),\n  slot: number(),\n  timestamp: number(),\n  err: string()\n})]);\n\n/**\n * Expected JSON RPC response for the \"slotsUpdatesNotification\" message\n */\nconst SlotUpdateNotificationResult = type({\n  subscription: number(),\n  result: SlotUpdateResult\n});\n\n/**\n * Expected JSON RPC response for the \"signatureNotification\" message\n */\nconst SignatureNotificationResult = type({\n  subscription: number(),\n  result: notificationResultAndContext(union([SignatureStatusResult, SignatureReceivedResult]))\n});\n\n/**\n * Expected JSON RPC response for the \"rootNotification\" message\n */\nconst RootNotificationResult = type({\n  subscription: number(),\n  result: number()\n});\nconst ContactInfoResult = type({\n  pubkey: string(),\n  gossip: nullable(string()),\n  tpu: nullable(string()),\n  rpc: nullable(string()),\n  version: nullable(string())\n});\nconst VoteAccountInfoResult = type({\n  votePubkey: string(),\n  nodePubkey: string(),\n  activatedStake: number(),\n  epochVoteAccount: dist_boolean(),\n  epochCredits: array(tuple([number(), number(), number()])),\n  commission: number(),\n  lastVote: number(),\n  rootSlot: nullable(number())\n});\n\n/**\n * Expected JSON RPC response for the \"getVoteAccounts\" message\n */\nconst GetVoteAccounts = jsonRpcResult(type({\n  current: array(VoteAccountInfoResult),\n  delinquent: array(VoteAccountInfoResult)\n}));\nconst ConfirmationStatus = union([literal('processed'), literal('confirmed'), literal('finalized')]);\nconst SignatureStatusResponse = type({\n  slot: number(),\n  confirmations: nullable(number()),\n  err: TransactionErrorResult,\n  confirmationStatus: optional(ConfirmationStatus)\n});\n\n/**\n * Expected JSON RPC response for the \"getSignatureStatuses\" message\n */\nconst GetSignatureStatusesRpcResult = jsonRpcResultAndContext(array(nullable(SignatureStatusResponse)));\n\n/**\n * Expected JSON RPC response for the \"getMinimumBalanceForRentExemption\" message\n */\nconst GetMinimumBalanceForRentExemptionRpcResult = jsonRpcResult(number());\nconst AddressTableLookupStruct = type({\n  accountKey: PublicKeyFromString,\n  writableIndexes: array(number()),\n  readonlyIndexes: array(number())\n});\nconst ConfirmedTransactionResult = type({\n  signatures: array(string()),\n  message: type({\n    accountKeys: array(string()),\n    header: type({\n      numRequiredSignatures: number(),\n      numReadonlySignedAccounts: number(),\n      numReadonlyUnsignedAccounts: number()\n    }),\n    instructions: array(type({\n      accounts: array(number()),\n      data: string(),\n      programIdIndex: number()\n    })),\n    recentBlockhash: string(),\n    addressTableLookups: optional(array(AddressTableLookupStruct))\n  })\n});\nconst AnnotatedAccountKey = type({\n  pubkey: PublicKeyFromString,\n  signer: dist_boolean(),\n  writable: dist_boolean(),\n  source: optional(union([literal('transaction'), literal('lookupTable')]))\n});\nconst ConfirmedTransactionAccountsModeResult = type({\n  accountKeys: array(AnnotatedAccountKey),\n  signatures: array(string())\n});\nconst ParsedInstructionResult = type({\n  parsed: unknown(),\n  program: string(),\n  programId: PublicKeyFromString\n});\nconst RawInstructionResult = type({\n  accounts: array(PublicKeyFromString),\n  data: string(),\n  programId: PublicKeyFromString\n});\nconst InstructionResult = union([RawInstructionResult, ParsedInstructionResult]);\nconst UnknownInstructionResult = union([type({\n  parsed: unknown(),\n  program: string(),\n  programId: string()\n}), type({\n  accounts: array(string()),\n  data: string(),\n  programId: string()\n})]);\nconst ParsedOrRawInstruction = coerce(InstructionResult, UnknownInstructionResult, value => {\n  if ('accounts' in value) {\n    return create(value, RawInstructionResult);\n  } else {\n    return create(value, ParsedInstructionResult);\n  }\n});\n\n/**\n * @internal\n */\nconst ParsedConfirmedTransactionResult = type({\n  signatures: array(string()),\n  message: type({\n    accountKeys: array(AnnotatedAccountKey),\n    instructions: array(ParsedOrRawInstruction),\n    recentBlockhash: string(),\n    addressTableLookups: optional(nullable(array(AddressTableLookupStruct)))\n  })\n});\nconst TokenBalanceResult = type({\n  accountIndex: number(),\n  mint: string(),\n  owner: optional(string()),\n  uiTokenAmount: TokenAmountResult\n});\nconst LoadedAddressesResult = type({\n  writable: array(PublicKeyFromString),\n  readonly: array(PublicKeyFromString)\n});\n\n/**\n * @internal\n */\nconst ConfirmedTransactionMetaResult = type({\n  err: TransactionErrorResult,\n  fee: number(),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(type({\n      accounts: array(number()),\n      data: string(),\n      programIdIndex: number()\n    }))\n  })))),\n  preBalances: array(number()),\n  postBalances: array(number()),\n  logMessages: optional(nullable(array(string()))),\n  preTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  postTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  loadedAddresses: optional(LoadedAddressesResult),\n  computeUnitsConsumed: optional(number())\n});\n\n/**\n * @internal\n */\nconst ParsedConfirmedTransactionMetaResult = type({\n  err: TransactionErrorResult,\n  fee: number(),\n  innerInstructions: optional(nullable(array(type({\n    index: number(),\n    instructions: array(ParsedOrRawInstruction)\n  })))),\n  preBalances: array(number()),\n  postBalances: array(number()),\n  logMessages: optional(nullable(array(string()))),\n  preTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  postTokenBalances: optional(nullable(array(TokenBalanceResult))),\n  loadedAddresses: optional(LoadedAddressesResult),\n  computeUnitsConsumed: optional(number())\n});\nconst TransactionVersionStruct = union([literal(0), literal('legacy')]);\n\n/** @internal */\nconst RewardsResult = type({\n  pubkey: string(),\n  lamports: number(),\n  postBalance: nullable(number()),\n  rewardType: nullable(string()),\n  commission: optional(nullable(number()))\n});\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message\n */\nconst GetBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionResult,\n    meta: nullable(ConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message when `transactionDetails` is `none`\n */\nconst GetNoneModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message when `transactionDetails` is `accounts`\n */\nconst GetAccountsModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionAccountsModeResult,\n    meta: nullable(ConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message\n */\nconst GetParsedBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ParsedConfirmedTransactionResult,\n    meta: nullable(ParsedConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message  when `transactionDetails` is `accounts`\n */\nconst GetParsedAccountsModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionAccountsModeResult,\n    meta: nullable(ParsedConfirmedTransactionMetaResult),\n    version: optional(TransactionVersionStruct)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getBlock\" message  when `transactionDetails` is `none`\n */\nconst GetParsedNoneModeBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number()),\n  blockHeight: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getConfirmedBlock\" message\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link GetBlockRpcResult} instead.\n */\nconst GetConfirmedBlockRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  transactions: array(type({\n    transaction: ConfirmedTransactionResult,\n    meta: nullable(ConfirmedTransactionMetaResult)\n  })),\n  rewards: optional(array(RewardsResult)),\n  blockTime: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getBlock\" message\n */\nconst GetBlockSignaturesRpcResult = jsonRpcResult(nullable(type({\n  blockhash: string(),\n  previousBlockhash: string(),\n  parentSlot: number(),\n  signatures: array(string()),\n  blockTime: nullable(number())\n})));\n\n/**\n * Expected JSON RPC response for the \"getTransaction\" message\n */\nconst GetTransactionRpcResult = jsonRpcResult(nullable(type({\n  slot: number(),\n  meta: nullable(ConfirmedTransactionMetaResult),\n  blockTime: optional(nullable(number())),\n  transaction: ConfirmedTransactionResult,\n  version: optional(TransactionVersionStruct)\n})));\n\n/**\n * Expected parsed JSON RPC response for the \"getTransaction\" message\n */\nconst GetParsedTransactionRpcResult = jsonRpcResult(nullable(type({\n  slot: number(),\n  transaction: ParsedConfirmedTransactionResult,\n  meta: nullable(ParsedConfirmedTransactionMetaResult),\n  blockTime: optional(nullable(number())),\n  version: optional(TransactionVersionStruct)\n})));\n\n/**\n * Expected JSON RPC response for the \"getRecentBlockhash\" message\n *\n * @deprecated Deprecated since RPC v1.8.0. Please use {@link GetLatestBlockhashRpcResult} instead.\n */\nconst GetRecentBlockhashAndContextRpcResult = jsonRpcResultAndContext(type({\n  blockhash: string(),\n  feeCalculator: type({\n    lamportsPerSignature: number()\n  })\n}));\n\n/**\n * Expected JSON RPC response for the \"getLatestBlockhash\" message\n */\nconst GetLatestBlockhashRpcResult = jsonRpcResultAndContext(type({\n  blockhash: string(),\n  lastValidBlockHeight: number()\n}));\n\n/**\n * Expected JSON RPC response for the \"isBlockhashValid\" message\n */\nconst IsBlockhashValidRpcResult = jsonRpcResultAndContext(dist_boolean());\nconst PerfSampleResult = type({\n  slot: number(),\n  numTransactions: number(),\n  numSlots: number(),\n  samplePeriodSecs: number()\n});\n\n/*\n * Expected JSON RPC response for \"getRecentPerformanceSamples\" message\n */\nconst GetRecentPerformanceSamplesRpcResult = jsonRpcResult(array(PerfSampleResult));\n\n/**\n * Expected JSON RPC response for the \"getFeeCalculatorForBlockhash\" message\n */\nconst GetFeeCalculatorRpcResult = jsonRpcResultAndContext(nullable(type({\n  feeCalculator: type({\n    lamportsPerSignature: number()\n  })\n})));\n\n/**\n * Expected JSON RPC response for the \"requestAirdrop\" message\n */\nconst RequestAirdropRpcResult = jsonRpcResult(string());\n\n/**\n * Expected JSON RPC response for the \"sendTransaction\" message\n */\nconst SendTransactionRpcResult = jsonRpcResult(string());\n\n/**\n * Information about the latest slot being processed by a node\n */\n\n/**\n * Parsed account data\n */\n\n/**\n * Stake Activation data\n */\n\n/**\n * Data slice argument for getProgramAccounts\n */\n\n/**\n * Memory comparison filter for getProgramAccounts\n */\n\n/**\n * Data size comparison filter for getProgramAccounts\n */\n\n/**\n * A filter object for getProgramAccounts\n */\n\n/**\n * Configuration object for getProgramAccounts requests\n */\n\n/**\n * Configuration object for getParsedProgramAccounts\n */\n\n/**\n * Configuration object for getMultipleAccounts\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getStakeActivation`\n */\n\n/**\n * Configuration object for `getNonce`\n */\n\n/**\n * Configuration object for `getNonceAndContext`\n */\n\n/**\n * Information describing an account\n */\n\n/**\n * Account information identified by pubkey\n */\n\n/**\n * Callback function for account change notifications\n */\n\n/**\n * Callback function for program account change notifications\n */\n\n/**\n * Callback function for slot change notifications\n */\n\n/**\n * Callback function for slot update notifications\n */\n\n/**\n * Callback function for signature status notifications\n */\n\n/**\n * Signature status notification with transaction result\n */\n\n/**\n * Signature received notification\n */\n\n/**\n * Callback function for signature notifications\n */\n\n/**\n * Signature subscription options\n */\n\n/**\n * Callback function for root change notifications\n */\n\n/**\n * @internal\n */\nconst LogsResult = type({\n  err: TransactionErrorResult,\n  logs: array(string()),\n  signature: string()\n});\n\n/**\n * Logs result.\n */\n\n/**\n * Expected JSON RPC response for the \"logsNotification\" message.\n */\nconst LogsNotificationResult = type({\n  result: notificationResultAndContext(LogsResult),\n  subscription: number()\n});\n\n/**\n * Filter for log subscriptions.\n */\n\n/**\n * Callback function for log notifications.\n */\n\n/**\n * Signature result\n */\n\n/**\n * Transaction error\n */\n\n/**\n * Transaction confirmation status\n * <pre>\n *   'processed': Transaction landed in a block which has reached 1 confirmation by the connected node\n *   'confirmed': Transaction landed in a block which has reached 1 confirmation by the cluster\n *   'finalized': Transaction landed in a block which has been finalized by the cluster\n * </pre>\n */\n\n/**\n * Signature status\n */\n\n/**\n * A confirmed signature with its status\n */\n\n/**\n * An object defining headers to be passed to the RPC server\n */\n\n/**\n * The type of the JavaScript `fetch()` API\n */\n\n/**\n * A callback used to augment the outgoing HTTP request\n */\n\n/**\n * Configuration for instantiating a Connection\n */\n\n/** @internal */\nconst COMMON_HTTP_HEADERS = {\n  'solana-client': `js/${\"0.0.0-development\" }`\n};\n\n/**\n * A connection to a fullnode JSON RPC endpoint\n */\nclass Connection {\n  /**\n   * Establish a JSON RPC connection\n   *\n   * @param endpoint URL to the fullnode JSON RPC endpoint\n   * @param commitmentOrConfig optional default commitment level or optional ConnectionConfig configuration object\n   */\n  constructor(endpoint, _commitmentOrConfig) {\n    /** @internal */\n    this._commitment = void 0;\n    /** @internal */\n    this._confirmTransactionInitialTimeout = void 0;\n    /** @internal */\n    this._rpcEndpoint = void 0;\n    /** @internal */\n    this._rpcWsEndpoint = void 0;\n    /** @internal */\n    this._rpcClient = void 0;\n    /** @internal */\n    this._rpcRequest = void 0;\n    /** @internal */\n    this._rpcBatchRequest = void 0;\n    /** @internal */\n    this._rpcWebSocket = void 0;\n    /** @internal */\n    this._rpcWebSocketConnected = false;\n    /** @internal */\n    this._rpcWebSocketHeartbeat = null;\n    /** @internal */\n    this._rpcWebSocketIdleTimeout = null;\n    /** @internal\n     * A number that we increment every time an active connection closes.\n     * Used to determine whether the same socket connection that was open\n     * when an async operation started is the same one that's active when\n     * its continuation fires.\n     *\n     */\n    this._rpcWebSocketGeneration = 0;\n    /** @internal */\n    this._disableBlockhashCaching = false;\n    /** @internal */\n    this._pollingBlockhash = false;\n    /** @internal */\n    this._blockhashInfo = {\n      latestBlockhash: null,\n      lastFetch: 0,\n      transactionSignatures: [],\n      simulatedSignatures: []\n    };\n    /** @internal */\n    this._nextClientSubscriptionId = 0;\n    /** @internal */\n    this._subscriptionDisposeFunctionsByClientSubscriptionId = {};\n    /** @internal */\n    this._subscriptionHashByClientSubscriptionId = {};\n    /** @internal */\n    this._subscriptionStateChangeCallbacksByHash = {};\n    /** @internal */\n    this._subscriptionCallbacksByServerSubscriptionId = {};\n    /** @internal */\n    this._subscriptionsByHash = {};\n    /**\n     * Special case.\n     * After a signature is processed, RPCs automatically dispose of the\n     * subscription on the server side. We need to track which of these\n     * subscriptions have been disposed in such a way, so that we know\n     * whether the client is dealing with a not-yet-processed signature\n     * (in which case we must tear down the server subscription) or an\n     * already-processed signature (in which case the client can simply\n     * clear out the subscription locally without telling the server).\n     *\n     * NOTE: There is a proposal to eliminate this special case, here:\n     * https://github.com/solana-labs/solana/issues/18892\n     */\n    /** @internal */\n    this._subscriptionsAutoDisposedByRpc = new Set();\n    /*\n     * Returns the current block height of the node\n     */\n    this.getBlockHeight = (() => {\n      const requestPromises = {};\n      return async commitmentOrConfig => {\n        const {\n          commitment,\n          config\n        } = extractCommitmentFromConfig(commitmentOrConfig);\n        const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n        const requestHash = fastStableStringify$1(args);\n        requestPromises[requestHash] = requestPromises[requestHash] ?? (async () => {\n          try {\n            const unsafeRes = await this._rpcRequest('getBlockHeight', args);\n            const res = create(unsafeRes, jsonRpcResult(number()));\n            if ('error' in res) {\n              throw new SolanaJSONRPCError(res.error, 'failed to get block height information');\n            }\n            return res.result;\n          } finally {\n            delete requestPromises[requestHash];\n          }\n        })();\n        return await requestPromises[requestHash];\n      };\n    })();\n    let wsEndpoint;\n    let httpHeaders;\n    let fetch;\n    let fetchMiddleware;\n    let disableRetryOnRateLimit;\n    let httpAgent;\n    if (_commitmentOrConfig && typeof _commitmentOrConfig === 'string') {\n      this._commitment = _commitmentOrConfig;\n    } else if (_commitmentOrConfig) {\n      this._commitment = _commitmentOrConfig.commitment;\n      this._confirmTransactionInitialTimeout = _commitmentOrConfig.confirmTransactionInitialTimeout;\n      wsEndpoint = _commitmentOrConfig.wsEndpoint;\n      httpHeaders = _commitmentOrConfig.httpHeaders;\n      fetch = _commitmentOrConfig.fetch;\n      fetchMiddleware = _commitmentOrConfig.fetchMiddleware;\n      disableRetryOnRateLimit = _commitmentOrConfig.disableRetryOnRateLimit;\n      httpAgent = _commitmentOrConfig.httpAgent;\n    }\n    this._rpcEndpoint = assertEndpointUrl(endpoint);\n    this._rpcWsEndpoint = wsEndpoint || makeWebsocketUrl(endpoint);\n    this._rpcClient = createRpcClient(endpoint, httpHeaders, fetch, fetchMiddleware, disableRetryOnRateLimit, httpAgent);\n    this._rpcRequest = createRpcRequest(this._rpcClient);\n    this._rpcBatchRequest = createRpcBatchRequest(this._rpcClient);\n    this._rpcWebSocket = new RpcWebSocketClient(this._rpcWsEndpoint, {\n      autoconnect: false,\n      max_reconnects: Infinity\n    });\n    this._rpcWebSocket.on('open', this._wsOnOpen.bind(this));\n    this._rpcWebSocket.on('error', this._wsOnError.bind(this));\n    this._rpcWebSocket.on('close', this._wsOnClose.bind(this));\n    this._rpcWebSocket.on('accountNotification', this._wsOnAccountNotification.bind(this));\n    this._rpcWebSocket.on('programNotification', this._wsOnProgramAccountNotification.bind(this));\n    this._rpcWebSocket.on('slotNotification', this._wsOnSlotNotification.bind(this));\n    this._rpcWebSocket.on('slotsUpdatesNotification', this._wsOnSlotUpdatesNotification.bind(this));\n    this._rpcWebSocket.on('signatureNotification', this._wsOnSignatureNotification.bind(this));\n    this._rpcWebSocket.on('rootNotification', this._wsOnRootNotification.bind(this));\n    this._rpcWebSocket.on('logsNotification', this._wsOnLogsNotification.bind(this));\n  }\n\n  /**\n   * The default commitment used for requests\n   */\n  get commitment() {\n    return this._commitment;\n  }\n\n  /**\n   * The RPC endpoint\n   */\n  get rpcEndpoint() {\n    return this._rpcEndpoint;\n  }\n\n  /**\n   * Fetch the balance for the specified public key, return with context\n   */\n  async getBalanceAndContext(publicKey, commitmentOrConfig) {\n    /** @internal */\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getBalance', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get balance for ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the balance for the specified public key\n   */\n  async getBalance(publicKey, commitmentOrConfig) {\n    return await this.getBalanceAndContext(publicKey, commitmentOrConfig).then(x => x.value).catch(e => {\n      throw new Error('failed to get balance of account ' + publicKey.toBase58() + ': ' + e);\n    });\n  }\n\n  /**\n   * Fetch the estimated production time of a block\n   */\n  async getBlockTime(slot) {\n    const unsafeRes = await this._rpcRequest('getBlockTime', [slot]);\n    const res = create(unsafeRes, jsonRpcResult(nullable(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get block time for slot ${slot}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the lowest slot that the node has information about in its ledger.\n   * This value may increase over time if the node is configured to purge older ledger data\n   */\n  async getMinimumLedgerSlot() {\n    const unsafeRes = await this._rpcRequest('minimumLedgerSlot', []);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get minimum ledger slot');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the slot of the lowest confirmed block that has not been purged from the ledger\n   */\n  async getFirstAvailableBlock() {\n    const unsafeRes = await this._rpcRequest('getFirstAvailableBlock', []);\n    const res = create(unsafeRes, SlotRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get first available block');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch information about the current supply\n   */\n  async getSupply(config) {\n    let configArg = {};\n    if (typeof config === 'string') {\n      configArg = {\n        commitment: config\n      };\n    } else if (config) {\n      configArg = {\n        ...config,\n        commitment: config && config.commitment || this.commitment\n      };\n    } else {\n      configArg = {\n        commitment: this.commitment\n      };\n    }\n    const unsafeRes = await this._rpcRequest('getSupply', [configArg]);\n    const res = create(unsafeRes, GetSupplyRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get supply');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current supply of a token mint\n   */\n  async getTokenSupply(tokenMintAddress, commitment) {\n    const args = this._buildArgs([tokenMintAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenSupply', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(TokenAmountResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token supply');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current balance of a token account\n   */\n  async getTokenAccountBalance(tokenAddress, commitment) {\n    const args = this._buildArgs([tokenAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenAccountBalance', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(TokenAmountResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token account balance');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the token accounts owned by the specified account\n   *\n   * @return {Promise<RpcResponseAndContext<GetProgramAccountsResponse>}\n   */\n  async getTokenAccountsByOwner(ownerAddress, filter, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    let _args = [ownerAddress.toBase58()];\n    if ('mint' in filter) {\n      _args.push({\n        mint: filter.mint.toBase58()\n      });\n    } else {\n      _args.push({\n        programId: filter.programId.toBase58()\n      });\n    }\n    const args = this._buildArgs(_args, commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getTokenAccountsByOwner', args);\n    const res = create(unsafeRes, GetTokenAccountsByOwner);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get token accounts owned by account ${ownerAddress.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed token accounts owned by the specified account\n   *\n   * @return {Promise<RpcResponseAndContext<Array<{pubkey: PublicKey, account: AccountInfo<ParsedAccountData>}>>>}\n   */\n  async getParsedTokenAccountsByOwner(ownerAddress, filter, commitment) {\n    let _args = [ownerAddress.toBase58()];\n    if ('mint' in filter) {\n      _args.push({\n        mint: filter.mint.toBase58()\n      });\n    } else {\n      _args.push({\n        programId: filter.programId.toBase58()\n      });\n    }\n    const args = this._buildArgs(_args, commitment, 'jsonParsed');\n    const unsafeRes = await this._rpcRequest('getTokenAccountsByOwner', args);\n    const res = create(unsafeRes, GetParsedTokenAccountsByOwner);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get token accounts owned by account ${ownerAddress.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the 20 largest accounts with their current balances\n   */\n  async getLargestAccounts(config) {\n    const arg = {\n      ...config,\n      commitment: config && config.commitment || this.commitment\n    };\n    const args = arg.filter || arg.commitment ? [arg] : [];\n    const unsafeRes = await this._rpcRequest('getLargestAccounts', args);\n    const res = create(unsafeRes, GetLargestAccountsRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get largest accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the 20 largest token accounts with their current balances\n   * for a given mint.\n   */\n  async getTokenLargestAccounts(mintAddress, commitment) {\n    const args = this._buildArgs([mintAddress.toBase58()], commitment);\n    const unsafeRes = await this._rpcRequest('getTokenLargestAccounts', args);\n    const res = create(unsafeRes, GetTokenLargestAccountsResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get token largest accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for the specified public key, return with context\n   */\n  async getAccountInfoAndContext(publicKey, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getAccountInfo', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(AccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info about account ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed account info for the specified public key\n   */\n  async getParsedAccountInfo(publicKey, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getAccountInfo', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(ParsedAccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info about account ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for the specified public key\n   */\n  async getAccountInfo(publicKey, commitmentOrConfig) {\n    try {\n      const res = await this.getAccountInfoAndContext(publicKey, commitmentOrConfig);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get info about account ' + publicKey.toBase58() + ': ' + e);\n    }\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys, return with context\n   */\n  async getMultipleParsedAccounts(publicKeys, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const keys = publicKeys.map(key => key.toBase58());\n    const args = this._buildArgs([keys], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getMultipleAccounts', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(array(nullable(ParsedAccountInfoResult))));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info for accounts ${keys}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys, return with context\n   */\n  async getMultipleAccountsInfoAndContext(publicKeys, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const keys = publicKeys.map(key => key.toBase58());\n    const args = this._buildArgs([keys], commitment, 'base64', config);\n    const unsafeRes = await this._rpcRequest('getMultipleAccounts', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(array(nullable(AccountInfoResult))));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get info for accounts ${keys}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the account info for multiple accounts specified by an array of public keys\n   */\n  async getMultipleAccountsInfo(publicKeys, commitmentOrConfig) {\n    const res = await this.getMultipleAccountsInfoAndContext(publicKeys, commitmentOrConfig);\n    return res.value;\n  }\n\n  /**\n   * Returns epoch activation information for a stake account that has been delegated\n   *\n   * @deprecated Deprecated since RPC v1.18; will be removed in a future version.\n   */\n  async getStakeActivation(publicKey, commitmentOrConfig, epoch) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment, undefined /* encoding */, {\n      ...config,\n      epoch: epoch != null ? epoch : config?.epoch\n    });\n    const unsafeRes = await this._rpcRequest('getStakeActivation', args);\n    const res = create(unsafeRes, jsonRpcResult(StakeActivationResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get Stake Activation ${publicKey.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch all the accounts owned by the specified program id\n   *\n   * @return {Promise<Array<{pubkey: PublicKey, account: AccountInfo<Buffer>}>>}\n   */\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async getProgramAccounts(programId, configOrCommitment) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(configOrCommitment);\n    const {\n      encoding,\n      ...configWithoutEncoding\n    } = config || {};\n    const args = this._buildArgs([programId.toBase58()], commitment, encoding || 'base64', configWithoutEncoding);\n    const unsafeRes = await this._rpcRequest('getProgramAccounts', args);\n    const baseSchema = array(KeyedAccountInfoResult);\n    const res = configWithoutEncoding.withContext === true ? create(unsafeRes, jsonRpcResultAndContext(baseSchema)) : create(unsafeRes, jsonRpcResult(baseSchema));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get accounts owned by program ${programId.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch and parse all the accounts owned by the specified program id\n   *\n   * @return {Promise<Array<{pubkey: PublicKey, account: AccountInfo<Buffer | ParsedAccountData>}>>}\n   */\n  async getParsedProgramAccounts(programId, configOrCommitment) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(configOrCommitment);\n    const args = this._buildArgs([programId.toBase58()], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getProgramAccounts', args);\n    const res = create(unsafeRes, jsonRpcResult(array(KeyedParsedAccountInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get accounts owned by program ${programId.toBase58()}`);\n    }\n    return res.result;\n  }\n\n  /** @deprecated Instead, call `confirmTransaction` and pass in {@link TransactionConfirmationStrategy} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async confirmTransaction(strategy, commitment) {\n    let rawSignature;\n    if (typeof strategy == 'string') {\n      rawSignature = strategy;\n    } else {\n      const config = strategy;\n      if (config.abortSignal?.aborted) {\n        return Promise.reject(config.abortSignal.reason);\n      }\n      rawSignature = config.signature;\n    }\n    let decodedSignature;\n    try {\n      decodedSignature = bs58_default().decode(rawSignature);\n    } catch (err) {\n      throw new Error('signature must be base58 encoded: ' + rawSignature);\n    }\n    index_browser_esm_assert(decodedSignature.length === 64, 'signature has invalid length');\n    if (typeof strategy === 'string') {\n      return await this.confirmTransactionUsingLegacyTimeoutStrategy({\n        commitment: commitment || this.commitment,\n        signature: rawSignature\n      });\n    } else if ('lastValidBlockHeight' in strategy) {\n      return await this.confirmTransactionUsingBlockHeightExceedanceStrategy({\n        commitment: commitment || this.commitment,\n        strategy\n      });\n    } else {\n      return await this.confirmTransactionUsingDurableNonceStrategy({\n        commitment: commitment || this.commitment,\n        strategy\n      });\n    }\n  }\n  getCancellationPromise(signal) {\n    return new Promise((_, reject) => {\n      if (signal == null) {\n        return;\n      }\n      if (signal.aborted) {\n        reject(signal.reason);\n      } else {\n        signal.addEventListener('abort', () => {\n          reject(signal.reason);\n        });\n      }\n    });\n  }\n  getTransactionConfirmationPromise({\n    commitment,\n    signature\n  }) {\n    let signatureSubscriptionId;\n    let disposeSignatureSubscriptionStateChangeObserver;\n    let done = false;\n    const confirmationPromise = new Promise((resolve, reject) => {\n      try {\n        signatureSubscriptionId = this.onSignature(signature, (result, context) => {\n          signatureSubscriptionId = undefined;\n          const response = {\n            context,\n            value: result\n          };\n          resolve({\n            __type: TransactionStatus.PROCESSED,\n            response\n          });\n        }, commitment);\n        const subscriptionSetupPromise = new Promise(resolveSubscriptionSetup => {\n          if (signatureSubscriptionId == null) {\n            resolveSubscriptionSetup();\n          } else {\n            disposeSignatureSubscriptionStateChangeObserver = this._onSubscriptionStateChange(signatureSubscriptionId, nextState => {\n              if (nextState === 'subscribed') {\n                resolveSubscriptionSetup();\n              }\n            });\n          }\n        });\n        (async () => {\n          await subscriptionSetupPromise;\n          if (done) return;\n          const response = await this.getSignatureStatus(signature);\n          if (done) return;\n          if (response == null) {\n            return;\n          }\n          const {\n            context,\n            value\n          } = response;\n          if (value == null) {\n            return;\n          }\n          if (value?.err) {\n            reject(value.err);\n          } else {\n            switch (commitment) {\n              case 'confirmed':\n              case 'single':\n              case 'singleGossip':\n                {\n                  if (value.confirmationStatus === 'processed') {\n                    return;\n                  }\n                  break;\n                }\n              case 'finalized':\n              case 'max':\n              case 'root':\n                {\n                  if (value.confirmationStatus === 'processed' || value.confirmationStatus === 'confirmed') {\n                    return;\n                  }\n                  break;\n                }\n              // exhaust enums to ensure full coverage\n              case 'processed':\n              case 'recent':\n            }\n            done = true;\n            resolve({\n              __type: TransactionStatus.PROCESSED,\n              response: {\n                context,\n                value\n              }\n            });\n          }\n        })();\n      } catch (err) {\n        reject(err);\n      }\n    });\n    const abortConfirmation = () => {\n      if (disposeSignatureSubscriptionStateChangeObserver) {\n        disposeSignatureSubscriptionStateChangeObserver();\n        disposeSignatureSubscriptionStateChangeObserver = undefined;\n      }\n      if (signatureSubscriptionId != null) {\n        this.removeSignatureListener(signatureSubscriptionId);\n        signatureSubscriptionId = undefined;\n      }\n    };\n    return {\n      abortConfirmation,\n      confirmationPromise\n    };\n  }\n  async confirmTransactionUsingBlockHeightExceedanceStrategy({\n    commitment,\n    strategy: {\n      abortSignal,\n      lastValidBlockHeight,\n      signature\n    }\n  }) {\n    let done = false;\n    const expiryPromise = new Promise(resolve => {\n      const checkBlockHeight = async () => {\n        try {\n          const blockHeight = await this.getBlockHeight(commitment);\n          return blockHeight;\n        } catch (_e) {\n          return -1;\n        }\n      };\n      (async () => {\n        let currentBlockHeight = await checkBlockHeight();\n        if (done) return;\n        while (currentBlockHeight <= lastValidBlockHeight) {\n          await sleep(1000);\n          if (done) return;\n          currentBlockHeight = await checkBlockHeight();\n          if (done) return;\n        }\n        resolve({\n          __type: TransactionStatus.BLOCKHEIGHT_EXCEEDED\n        });\n      })();\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    const cancellationPromise = this.getCancellationPromise(abortSignal);\n    let result;\n    try {\n      const outcome = await Promise.race([cancellationPromise, confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        throw new TransactionExpiredBlockheightExceededError(signature);\n      }\n    } finally {\n      done = true;\n      abortConfirmation();\n    }\n    return result;\n  }\n  async confirmTransactionUsingDurableNonceStrategy({\n    commitment,\n    strategy: {\n      abortSignal,\n      minContextSlot,\n      nonceAccountPubkey,\n      nonceValue,\n      signature\n    }\n  }) {\n    let done = false;\n    const expiryPromise = new Promise(resolve => {\n      let currentNonceValue = nonceValue;\n      let lastCheckedSlot = null;\n      const getCurrentNonceValue = async () => {\n        try {\n          const {\n            context,\n            value: nonceAccount\n          } = await this.getNonceAndContext(nonceAccountPubkey, {\n            commitment,\n            minContextSlot\n          });\n          lastCheckedSlot = context.slot;\n          return nonceAccount?.nonce;\n        } catch (e) {\n          // If for whatever reason we can't reach/read the nonce\n          // account, just keep using the last-known value.\n          return currentNonceValue;\n        }\n      };\n      (async () => {\n        currentNonceValue = await getCurrentNonceValue();\n        if (done) return;\n        while (true // eslint-disable-line no-constant-condition\n        ) {\n          if (nonceValue !== currentNonceValue) {\n            resolve({\n              __type: TransactionStatus.NONCE_INVALID,\n              slotInWhichNonceDidAdvance: lastCheckedSlot\n            });\n            return;\n          }\n          await sleep(2000);\n          if (done) return;\n          currentNonceValue = await getCurrentNonceValue();\n          if (done) return;\n        }\n      })();\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    const cancellationPromise = this.getCancellationPromise(abortSignal);\n    let result;\n    try {\n      const outcome = await Promise.race([cancellationPromise, confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        // Double check that the transaction is indeed unconfirmed.\n        let signatureStatus;\n        while (true // eslint-disable-line no-constant-condition\n        ) {\n          const status = await this.getSignatureStatus(signature);\n          if (status == null) {\n            break;\n          }\n          if (status.context.slot < (outcome.slotInWhichNonceDidAdvance ?? minContextSlot)) {\n            await sleep(400);\n            continue;\n          }\n          signatureStatus = status;\n          break;\n        }\n        if (signatureStatus?.value) {\n          const commitmentForStatus = commitment || 'finalized';\n          const {\n            confirmationStatus\n          } = signatureStatus.value;\n          switch (commitmentForStatus) {\n            case 'processed':\n            case 'recent':\n              if (confirmationStatus !== 'processed' && confirmationStatus !== 'confirmed' && confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            case 'confirmed':\n            case 'single':\n            case 'singleGossip':\n              if (confirmationStatus !== 'confirmed' && confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            case 'finalized':\n            case 'max':\n            case 'root':\n              if (confirmationStatus !== 'finalized') {\n                throw new TransactionExpiredNonceInvalidError(signature);\n              }\n              break;\n            default:\n              // Exhaustive switch.\n              // eslint-disable-next-line @typescript-eslint/no-unused-vars\n              (_ => {})(commitmentForStatus);\n          }\n          result = {\n            context: signatureStatus.context,\n            value: {\n              err: signatureStatus.value.err\n            }\n          };\n        } else {\n          throw new TransactionExpiredNonceInvalidError(signature);\n        }\n      }\n    } finally {\n      done = true;\n      abortConfirmation();\n    }\n    return result;\n  }\n  async confirmTransactionUsingLegacyTimeoutStrategy({\n    commitment,\n    signature\n  }) {\n    let timeoutId;\n    const expiryPromise = new Promise(resolve => {\n      let timeoutMs = this._confirmTransactionInitialTimeout || 60 * 1000;\n      switch (commitment) {\n        case 'processed':\n        case 'recent':\n        case 'single':\n        case 'confirmed':\n        case 'singleGossip':\n          {\n            timeoutMs = this._confirmTransactionInitialTimeout || 30 * 1000;\n            break;\n          }\n      }\n      timeoutId = setTimeout(() => resolve({\n        __type: TransactionStatus.TIMED_OUT,\n        timeoutMs\n      }), timeoutMs);\n    });\n    const {\n      abortConfirmation,\n      confirmationPromise\n    } = this.getTransactionConfirmationPromise({\n      commitment,\n      signature\n    });\n    let result;\n    try {\n      const outcome = await Promise.race([confirmationPromise, expiryPromise]);\n      if (outcome.__type === TransactionStatus.PROCESSED) {\n        result = outcome.response;\n      } else {\n        throw new TransactionExpiredTimeoutError(signature, outcome.timeoutMs / 1000);\n      }\n    } finally {\n      clearTimeout(timeoutId);\n      abortConfirmation();\n    }\n    return result;\n  }\n\n  /**\n   * Return the list of nodes that are currently participating in the cluster\n   */\n  async getClusterNodes() {\n    const unsafeRes = await this._rpcRequest('getClusterNodes', []);\n    const res = create(unsafeRes, jsonRpcResult(array(ContactInfoResult)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get cluster nodes');\n    }\n    return res.result;\n  }\n\n  /**\n   * Return the list of nodes that are currently participating in the cluster\n   */\n  async getVoteAccounts(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getVoteAccounts', args);\n    const res = create(unsafeRes, GetVoteAccounts);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get vote accounts');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current slot that the node is processing\n   */\n  async getSlot(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getSlot', args);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current slot leader of the cluster\n   */\n  async getSlotLeader(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getSlotLeader', args);\n    const res = create(unsafeRes, jsonRpcResult(string()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot leader');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch `limit` number of slot leaders starting from `startSlot`\n   *\n   * @param startSlot fetch slot leaders starting from this slot\n   * @param limit number of slot leaders to return\n   */\n  async getSlotLeaders(startSlot, limit) {\n    const args = [startSlot, limit];\n    const unsafeRes = await this._rpcRequest('getSlotLeaders', args);\n    const res = create(unsafeRes, jsonRpcResult(array(PublicKeyFromString)));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get slot leaders');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current status of a signature\n   */\n  async getSignatureStatus(signature, config) {\n    const {\n      context,\n      value: values\n    } = await this.getSignatureStatuses([signature], config);\n    index_browser_esm_assert(values.length === 1);\n    const value = values[0];\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the current statuses of a batch of signatures\n   */\n  async getSignatureStatuses(signatures, config) {\n    const params = [signatures];\n    if (config) {\n      params.push(config);\n    }\n    const unsafeRes = await this._rpcRequest('getSignatureStatuses', params);\n    const res = create(unsafeRes, GetSignatureStatusesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get signature status');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current transaction count of the cluster\n   */\n  async getTransactionCount(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getTransactionCount', args);\n    const res = create(unsafeRes, jsonRpcResult(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction count');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the current total currency supply of the cluster in lamports\n   *\n   * @deprecated Deprecated since RPC v1.2.8. Please use {@link getSupply} instead.\n   */\n  async getTotalSupply(commitment) {\n    const result = await this.getSupply({\n      commitment,\n      excludeNonCirculatingAccountsList: true\n    });\n    return result.value.total;\n  }\n\n  /**\n   * Fetch the cluster InflationGovernor parameters\n   */\n  async getInflationGovernor(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getInflationGovernor', args);\n    const res = create(unsafeRes, GetInflationGovernorRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the inflation reward for a list of addresses for an epoch\n   */\n  async getInflationReward(addresses, epoch, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([addresses.map(pubkey => pubkey.toBase58())], commitment, undefined /* encoding */, {\n      ...config,\n      epoch: epoch != null ? epoch : config?.epoch\n    });\n    const unsafeRes = await this._rpcRequest('getInflationReward', args);\n    const res = create(unsafeRes, GetInflationRewardResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation reward');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the specific inflation values for the current epoch\n   */\n  async getInflationRate() {\n    const unsafeRes = await this._rpcRequest('getInflationRate', []);\n    const res = create(unsafeRes, GetInflationRateRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get inflation rate');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the Epoch Info parameters\n   */\n  async getEpochInfo(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getEpochInfo', args);\n    const res = create(unsafeRes, GetEpochInfoRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get epoch info');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the Epoch Schedule parameters\n   */\n  async getEpochSchedule() {\n    const unsafeRes = await this._rpcRequest('getEpochSchedule', []);\n    const res = create(unsafeRes, GetEpochScheduleRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get epoch schedule');\n    }\n    const epochSchedule = res.result;\n    return new EpochSchedule(epochSchedule.slotsPerEpoch, epochSchedule.leaderScheduleSlotOffset, epochSchedule.warmup, epochSchedule.firstNormalEpoch, epochSchedule.firstNormalSlot);\n  }\n\n  /**\n   * Fetch the leader schedule for the current epoch\n   * @return {Promise<RpcResponseAndContext<LeaderSchedule>>}\n   */\n  async getLeaderSchedule() {\n    const unsafeRes = await this._rpcRequest('getLeaderSchedule', []);\n    const res = create(unsafeRes, GetLeaderScheduleRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get leader schedule');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the minimum balance needed to exempt an account of `dataLength`\n   * size from rent\n   */\n  async getMinimumBalanceForRentExemption(dataLength, commitment) {\n    const args = this._buildArgs([dataLength], commitment);\n    const unsafeRes = await this._rpcRequest('getMinimumBalanceForRentExemption', args);\n    const res = create(unsafeRes, GetMinimumBalanceForRentExemptionRpcResult);\n    if ('error' in res) {\n      console.warn('Unable to fetch minimum balance for rent exemption');\n      return 0;\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a recent blockhash from the cluster, return with context\n   * @return {Promise<RpcResponseAndContext<{blockhash: Blockhash, feeCalculator: FeeCalculator}>>}\n   *\n   * @deprecated Deprecated since RPC v1.9.0. Please use {@link getLatestBlockhash} instead.\n   */\n  async getRecentBlockhashAndContext(commitment) {\n    const args = this._buildArgs([], commitment);\n    const unsafeRes = await this._rpcRequest('getRecentBlockhash', args);\n    const res = create(unsafeRes, GetRecentBlockhashAndContextRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch recent performance samples\n   * @return {Promise<Array<PerfSample>>}\n   */\n  async getRecentPerformanceSamples(limit) {\n    const unsafeRes = await this._rpcRequest('getRecentPerformanceSamples', limit ? [limit] : []);\n    const res = create(unsafeRes, GetRecentPerformanceSamplesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent performance samples');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the fee calculator for a recent blockhash from the cluster, return with context\n   *\n   * @deprecated Deprecated since RPC v1.9.0. Please use {@link getFeeForMessage} instead.\n   */\n  async getFeeCalculatorForBlockhash(blockhash, commitment) {\n    const args = this._buildArgs([blockhash], commitment);\n    const unsafeRes = await this._rpcRequest('getFeeCalculatorForBlockhash', args);\n    const res = create(unsafeRes, GetFeeCalculatorRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get fee calculator');\n    }\n    const {\n      context,\n      value\n    } = res.result;\n    return {\n      context,\n      value: value !== null ? value.feeCalculator : null\n    };\n  }\n\n  /**\n   * Fetch the fee for a message from the cluster, return with context\n   */\n  async getFeeForMessage(message, commitment) {\n    const wireMessage = toBuffer(message.serialize()).toString('base64');\n    const args = this._buildArgs([wireMessage], commitment);\n    const unsafeRes = await this._rpcRequest('getFeeForMessage', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(nullable(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get fee for message');\n    }\n    if (res.result === null) {\n      throw new Error('invalid blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a list of prioritization fees from recent blocks.\n   */\n  async getRecentPrioritizationFees(config) {\n    const accounts = config?.lockedWritableAccounts?.map(key => key.toBase58());\n    const args = accounts?.length ? [accounts] : [];\n    const unsafeRes = await this._rpcRequest('getRecentPrioritizationFees', args);\n    const res = create(unsafeRes, GetRecentPrioritizationFeesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get recent prioritization fees');\n    }\n    return res.result;\n  }\n  /**\n   * Fetch a recent blockhash from the cluster\n   * @return {Promise<{blockhash: Blockhash, feeCalculator: FeeCalculator}>}\n   *\n   * @deprecated Deprecated since RPC v1.8.0. Please use {@link getLatestBlockhash} instead.\n   */\n  async getRecentBlockhash(commitment) {\n    try {\n      const res = await this.getRecentBlockhashAndContext(commitment);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get recent blockhash: ' + e);\n    }\n  }\n\n  /**\n   * Fetch the latest blockhash from the cluster\n   * @return {Promise<BlockhashWithExpiryBlockHeight>}\n   */\n  async getLatestBlockhash(commitmentOrConfig) {\n    try {\n      const res = await this.getLatestBlockhashAndContext(commitmentOrConfig);\n      return res.value;\n    } catch (e) {\n      throw new Error('failed to get recent blockhash: ' + e);\n    }\n  }\n\n  /**\n   * Fetch the latest blockhash from the cluster\n   * @return {Promise<BlockhashWithExpiryBlockHeight>}\n   */\n  async getLatestBlockhashAndContext(commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getLatestBlockhash', args);\n    const res = create(unsafeRes, GetLatestBlockhashRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get latest blockhash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Returns whether a blockhash is still valid or not\n   */\n  async isBlockhashValid(blockhash, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgs([blockhash], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('isBlockhashValid', args);\n    const res = create(unsafeRes, IsBlockhashValidRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to determine if the blockhash `' + blockhash + '`is valid');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the node version\n   */\n  async getVersion() {\n    const unsafeRes = await this._rpcRequest('getVersion', []);\n    const res = create(unsafeRes, jsonRpcResult(VersionResult));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get version');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch the genesis hash\n   */\n  async getGenesisHash() {\n    const unsafeRes = await this._rpcRequest('getGenesisHash', []);\n    const res = create(unsafeRes, jsonRpcResult(string()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get genesis hash');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a processed block from the cluster.\n   *\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * @deprecated Instead, call `getBlock` using a `GetVersionedBlockConfig` by\n   * setting the `maxSupportedTransactionVersion` property.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a processed block from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a processed block from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getBlock(slot, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    try {\n      switch (config?.transactionDetails) {\n        case 'accounts':\n          {\n            const res = create(unsafeRes, GetAccountsModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        case 'none':\n          {\n            const res = create(unsafeRes, GetNoneModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        default:\n          {\n            const res = create(unsafeRes, GetBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            const {\n              result\n            } = res;\n            return result ? {\n              ...result,\n              transactions: result.transactions.map(({\n                transaction,\n                meta,\n                version\n              }) => ({\n                meta,\n                transaction: {\n                  ...transaction,\n                  message: versionedMessageFromResponse(version, transaction.message)\n                },\n                version\n              }))\n            } : null;\n          }\n      }\n    } catch (e) {\n      throw new SolanaJSONRPCError(e, 'failed to get confirmed block');\n    }\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed or finalized block\n   */\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  async getParsedBlock(slot, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    try {\n      switch (config?.transactionDetails) {\n        case 'accounts':\n          {\n            const res = create(unsafeRes, GetParsedAccountsModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        case 'none':\n          {\n            const res = create(unsafeRes, GetParsedNoneModeBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n        default:\n          {\n            const res = create(unsafeRes, GetParsedBlockRpcResult);\n            if ('error' in res) {\n              throw res.error;\n            }\n            return res.result;\n          }\n      }\n    } catch (e) {\n      throw new SolanaJSONRPCError(e, 'failed to get block');\n    }\n  }\n  /*\n   * Returns recent block production information from the current or previous epoch\n   */\n  async getBlockProduction(configOrCommitment) {\n    let extra;\n    let commitment;\n    if (typeof configOrCommitment === 'string') {\n      commitment = configOrCommitment;\n    } else if (configOrCommitment) {\n      const {\n        commitment: c,\n        ...rest\n      } = configOrCommitment;\n      commitment = c;\n      extra = rest;\n    }\n    const args = this._buildArgs([], commitment, 'base64', extra);\n    const unsafeRes = await this._rpcRequest('getBlockProduction', args);\n    const res = create(unsafeRes, BlockProductionResponseStruct);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get block production information');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   *\n   * @deprecated Instead, call `getTransaction` using a\n   * `GetVersionedTransactionConfig` by setting the\n   * `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch a confirmed or finalized transaction from the cluster.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getTransaction(signature, rawConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(rawConfig);\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, undefined /* encoding */, config);\n    const unsafeRes = await this._rpcRequest('getTransaction', args);\n    const res = create(unsafeRes, GetTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    const result = res.result;\n    if (!result) return result;\n    return {\n      ...result,\n      transaction: {\n        ...result.transaction,\n        message: versionedMessageFromResponse(result.version, result.transaction.message)\n      }\n    };\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed or finalized transaction\n   */\n  async getParsedTransaction(signature, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed', config);\n    const unsafeRes = await this._rpcRequest('getTransaction', args);\n    const res = create(unsafeRes, GetParsedTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed transaction details for a batch of confirmed transactions\n   */\n  async getParsedTransactions(signatures, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed', config);\n      return {\n        methodName: 'getTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetParsedTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get transactions');\n      }\n      return res.result;\n    });\n    return res;\n  }\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link TransactionResponse}.\n   *\n   * @deprecated Instead, call `getTransactions` using a\n   * `GetVersionedTransactionConfig` by setting the\n   * `maxSupportedTransactionVersion` property.\n   */\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link\n   * VersionedTransactionResponse}.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Fetch transaction details for a batch of confirmed transactions.\n   * Similar to {@link getParsedTransactions} but returns a {@link\n   * VersionedTransactionResponse}.\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async getTransactions(signatures, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, undefined /* encoding */, config);\n      return {\n        methodName: 'getTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get transactions');\n      }\n      const result = res.result;\n      if (!result) return result;\n      return {\n        ...result,\n        transaction: {\n          ...result.transaction,\n          message: versionedMessageFromResponse(result.version, result.transaction.message)\n        }\n      };\n    });\n    return res;\n  }\n\n  /**\n   * Fetch a list of Transactions and transaction statuses from the cluster\n   * for a confirmed block.\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getBlock} instead.\n   */\n  async getConfirmedBlock(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment);\n    const unsafeRes = await this._rpcRequest('getConfirmedBlock', args);\n    const res = create(unsafeRes, GetConfirmedBlockRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Confirmed block ' + slot + ' not found');\n    }\n    const block = {\n      ...result,\n      transactions: result.transactions.map(({\n        transaction,\n        meta\n      }) => {\n        const message = new Message(transaction.message);\n        return {\n          meta,\n          transaction: {\n            ...transaction,\n            message\n          }\n        };\n      })\n    };\n    return {\n      ...block,\n      transactions: block.transactions.map(({\n        transaction,\n        meta\n      }) => {\n        return {\n          meta,\n          transaction: Transaction.populate(transaction.message, transaction.signatures)\n        };\n      })\n    };\n  }\n\n  /**\n   * Fetch confirmed blocks between two slots\n   */\n  async getBlocks(startSlot, endSlot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed(endSlot !== undefined ? [startSlot, endSlot] : [startSlot], commitment);\n    const unsafeRes = await this._rpcRequest('getBlocks', args);\n    const res = create(unsafeRes, jsonRpcResult(array(number())));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get blocks');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch a list of Signatures from the cluster for a block, excluding rewards\n   */\n  async getBlockSignatures(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined, {\n      transactionDetails: 'signatures',\n      rewards: false\n    });\n    const unsafeRes = await this._rpcRequest('getBlock', args);\n    const res = create(unsafeRes, GetBlockSignaturesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Block ' + slot + ' not found');\n    }\n    return result;\n  }\n\n  /**\n   * Fetch a list of Signatures from the cluster for a confirmed block, excluding rewards\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getBlockSignatures} instead.\n   */\n  async getConfirmedBlockSignatures(slot, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([slot], commitment, undefined, {\n      transactionDetails: 'signatures',\n      rewards: false\n    });\n    const unsafeRes = await this._rpcRequest('getConfirmedBlock', args);\n    const res = create(unsafeRes, GetBlockSignaturesRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed block');\n    }\n    const result = res.result;\n    if (!result) {\n      throw new Error('Confirmed block ' + slot + ' not found');\n    }\n    return result;\n  }\n\n  /**\n   * Fetch a transaction details for a confirmed transaction\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getTransaction} instead.\n   */\n  async getConfirmedTransaction(signature, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment);\n    const unsafeRes = await this._rpcRequest('getConfirmedTransaction', args);\n    const res = create(unsafeRes, GetTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get transaction');\n    }\n    const result = res.result;\n    if (!result) return result;\n    const message = new Message(result.transaction.message);\n    const signatures = result.transaction.signatures;\n    return {\n      ...result,\n      transaction: Transaction.populate(message, signatures)\n    };\n  }\n\n  /**\n   * Fetch parsed transaction details for a confirmed transaction\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getParsedTransaction} instead.\n   */\n  async getParsedConfirmedTransaction(signature, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed');\n    const unsafeRes = await this._rpcRequest('getConfirmedTransaction', args);\n    const res = create(unsafeRes, GetParsedTransactionRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed transaction');\n    }\n    return res.result;\n  }\n\n  /**\n   * Fetch parsed transaction details for a batch of confirmed transactions\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getParsedTransactions} instead.\n   */\n  async getParsedConfirmedTransactions(signatures, commitment) {\n    const batch = signatures.map(signature => {\n      const args = this._buildArgsAtLeastConfirmed([signature], commitment, 'jsonParsed');\n      return {\n        methodName: 'getConfirmedTransaction',\n        args\n      };\n    });\n    const unsafeRes = await this._rpcBatchRequest(batch);\n    const res = unsafeRes.map(unsafeRes => {\n      const res = create(unsafeRes, GetParsedTransactionRpcResult);\n      if ('error' in res) {\n        throw new SolanaJSONRPCError(res.error, 'failed to get confirmed transactions');\n      }\n      return res.result;\n    });\n    return res;\n  }\n\n  /**\n   * Fetch a list of all the confirmed signatures for transactions involving an address\n   * within a specified slot range. Max range allowed is 10,000 slots.\n   *\n   * @deprecated Deprecated since RPC v1.3. Please use {@link getConfirmedSignaturesForAddress2} instead.\n   *\n   * @param address queried address\n   * @param startSlot start slot, inclusive\n   * @param endSlot end slot, inclusive\n   */\n  async getConfirmedSignaturesForAddress(address, startSlot, endSlot) {\n    let options = {};\n    let firstAvailableBlock = await this.getFirstAvailableBlock();\n    while (!('until' in options)) {\n      startSlot--;\n      if (startSlot <= 0 || startSlot < firstAvailableBlock) {\n        break;\n      }\n      try {\n        const block = await this.getConfirmedBlockSignatures(startSlot, 'finalized');\n        if (block.signatures.length > 0) {\n          options.until = block.signatures[block.signatures.length - 1].toString();\n        }\n      } catch (err) {\n        if (err instanceof Error && err.message.includes('skipped')) {\n          continue;\n        } else {\n          throw err;\n        }\n      }\n    }\n    let highestConfirmedRoot = await this.getSlot('finalized');\n    while (!('before' in options)) {\n      endSlot++;\n      if (endSlot > highestConfirmedRoot) {\n        break;\n      }\n      try {\n        const block = await this.getConfirmedBlockSignatures(endSlot);\n        if (block.signatures.length > 0) {\n          options.before = block.signatures[block.signatures.length - 1].toString();\n        }\n      } catch (err) {\n        if (err instanceof Error && err.message.includes('skipped')) {\n          continue;\n        } else {\n          throw err;\n        }\n      }\n    }\n    const confirmedSignatureInfo = await this.getConfirmedSignaturesForAddress2(address, options);\n    return confirmedSignatureInfo.map(info => info.signature);\n  }\n\n  /**\n   * Returns confirmed signatures for transactions involving an\n   * address backwards in time from the provided signature or most recent confirmed block\n   *\n   * @deprecated Deprecated since RPC v1.7.0. Please use {@link getSignaturesForAddress} instead.\n   */\n  async getConfirmedSignaturesForAddress2(address, options, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([address.toBase58()], commitment, undefined, options);\n    const unsafeRes = await this._rpcRequest('getConfirmedSignaturesForAddress2', args);\n    const res = create(unsafeRes, GetConfirmedSignaturesForAddress2RpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get confirmed signatures for address');\n    }\n    return res.result;\n  }\n\n  /**\n   * Returns confirmed signatures for transactions involving an\n   * address backwards in time from the provided signature or most recent confirmed block\n   *\n   *\n   * @param address queried address\n   * @param options\n   */\n  async getSignaturesForAddress(address, options, commitment) {\n    const args = this._buildArgsAtLeastConfirmed([address.toBase58()], commitment, undefined, options);\n    const unsafeRes = await this._rpcRequest('getSignaturesForAddress', args);\n    const res = create(unsafeRes, GetSignaturesForAddressRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, 'failed to get signatures for address');\n    }\n    return res.result;\n  }\n  async getAddressLookupTable(accountKey, config) {\n    const {\n      context,\n      value: accountInfo\n    } = await this.getAccountInfoAndContext(accountKey, config);\n    let value = null;\n    if (accountInfo !== null) {\n      value = new AddressLookupTableAccount({\n        key: accountKey,\n        state: AddressLookupTableAccount.deserialize(accountInfo.data)\n      });\n    }\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the contents of a Nonce account from the cluster, return with context\n   */\n  async getNonceAndContext(nonceAccount, commitmentOrConfig) {\n    const {\n      context,\n      value: accountInfo\n    } = await this.getAccountInfoAndContext(nonceAccount, commitmentOrConfig);\n    let value = null;\n    if (accountInfo !== null) {\n      value = NonceAccount.fromAccountData(accountInfo.data);\n    }\n    return {\n      context,\n      value\n    };\n  }\n\n  /**\n   * Fetch the contents of a Nonce account from the cluster\n   */\n  async getNonce(nonceAccount, commitmentOrConfig) {\n    return await this.getNonceAndContext(nonceAccount, commitmentOrConfig).then(x => x.value).catch(e => {\n      throw new Error('failed to get nonce for account ' + nonceAccount.toBase58() + ': ' + e);\n    });\n  }\n\n  /**\n   * Request an allocation of lamports to the specified address\n   *\n   * ```typescript\n   * import { Connection, PublicKey, LAMPORTS_PER_SOL } from \"@solana/web3.js\";\n   *\n   * (async () => {\n   *   const connection = new Connection(\"https://api.testnet.solana.com\", \"confirmed\");\n   *   const myAddress = new PublicKey(\"2nr1bHFT86W9tGnyvmYW4vcHKsQB3sVQfnddasz4kExM\");\n   *   const signature = await connection.requestAirdrop(myAddress, LAMPORTS_PER_SOL);\n   *   await connection.confirmTransaction(signature);\n   * })();\n   * ```\n   */\n  async requestAirdrop(to, lamports) {\n    const unsafeRes = await this._rpcRequest('requestAirdrop', [to.toBase58(), lamports]);\n    const res = create(unsafeRes, RequestAirdropRpcResult);\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `airdrop to ${to.toBase58()} failed`);\n    }\n    return res.result;\n  }\n\n  /**\n   * @internal\n   */\n  async _blockhashWithExpiryBlockHeight(disableCache) {\n    if (!disableCache) {\n      // Wait for polling to finish\n      while (this._pollingBlockhash) {\n        await sleep(100);\n      }\n      const timeSinceFetch = Date.now() - this._blockhashInfo.lastFetch;\n      const expired = timeSinceFetch >= BLOCKHASH_CACHE_TIMEOUT_MS;\n      if (this._blockhashInfo.latestBlockhash !== null && !expired) {\n        return this._blockhashInfo.latestBlockhash;\n      }\n    }\n    return await this._pollNewBlockhash();\n  }\n\n  /**\n   * @internal\n   */\n  async _pollNewBlockhash() {\n    this._pollingBlockhash = true;\n    try {\n      const startTime = Date.now();\n      const cachedLatestBlockhash = this._blockhashInfo.latestBlockhash;\n      const cachedBlockhash = cachedLatestBlockhash ? cachedLatestBlockhash.blockhash : null;\n      for (let i = 0; i < 50; i++) {\n        const latestBlockhash = await this.getLatestBlockhash('finalized');\n        if (cachedBlockhash !== latestBlockhash.blockhash) {\n          this._blockhashInfo = {\n            latestBlockhash,\n            lastFetch: Date.now(),\n            transactionSignatures: [],\n            simulatedSignatures: []\n          };\n          return latestBlockhash;\n        }\n\n        // Sleep for approximately half a slot\n        await sleep(MS_PER_SLOT / 2);\n      }\n      throw new Error(`Unable to obtain a new blockhash after ${Date.now() - startTime}ms`);\n    } finally {\n      this._pollingBlockhash = false;\n    }\n  }\n\n  /**\n   * get the stake minimum delegation\n   */\n  async getStakeMinimumDelegation(config) {\n    const {\n      commitment,\n      config: configArg\n    } = extractCommitmentFromConfig(config);\n    const args = this._buildArgs([], commitment, 'base64', configArg);\n    const unsafeRes = await this._rpcRequest('getStakeMinimumDelegation', args);\n    const res = create(unsafeRes, jsonRpcResultAndContext(number()));\n    if ('error' in res) {\n      throw new SolanaJSONRPCError(res.error, `failed to get stake minimum delegation`);\n    }\n    return res.result;\n  }\n\n  /**\n   * Simulate a transaction\n   *\n   * @deprecated Instead, call {@link simulateTransaction} with {@link\n   * VersionedTransaction} and {@link SimulateTransactionConfig} parameters\n   */\n\n  /**\n   * Simulate a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Simulate a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async simulateTransaction(transactionOrMessage, configOrSigners, includeAccounts) {\n    if ('message' in transactionOrMessage) {\n      const versionedTx = transactionOrMessage;\n      const wireTransaction = versionedTx.serialize();\n      const encodedTransaction = node_modules_buffer.Buffer.from(wireTransaction).toString('base64');\n      if (Array.isArray(configOrSigners) || includeAccounts !== undefined) {\n        throw new Error('Invalid arguments');\n      }\n      const config = configOrSigners || {};\n      config.encoding = 'base64';\n      if (!('commitment' in config)) {\n        config.commitment = this.commitment;\n      }\n      if (configOrSigners && typeof configOrSigners === 'object' && 'innerInstructions' in configOrSigners) {\n        config.innerInstructions = configOrSigners.innerInstructions;\n      }\n      const args = [encodedTransaction, config];\n      const unsafeRes = await this._rpcRequest('simulateTransaction', args);\n      const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n      if ('error' in res) {\n        throw new Error('failed to simulate transaction: ' + res.error.message);\n      }\n      return res.result;\n    }\n    let transaction;\n    if (transactionOrMessage instanceof Transaction) {\n      let originalTx = transactionOrMessage;\n      transaction = new Transaction();\n      transaction.feePayer = originalTx.feePayer;\n      transaction.instructions = transactionOrMessage.instructions;\n      transaction.nonceInfo = originalTx.nonceInfo;\n      transaction.signatures = originalTx.signatures;\n    } else {\n      transaction = Transaction.populate(transactionOrMessage);\n      // HACK: this function relies on mutating the populated transaction\n      transaction._message = transaction._json = undefined;\n    }\n    if (configOrSigners !== undefined && !Array.isArray(configOrSigners)) {\n      throw new Error('Invalid arguments');\n    }\n    const signers = configOrSigners;\n    if (transaction.nonceInfo && signers) {\n      transaction.sign(...signers);\n    } else {\n      let disableCache = this._disableBlockhashCaching;\n      for (;;) {\n        const latestBlockhash = await this._blockhashWithExpiryBlockHeight(disableCache);\n        transaction.lastValidBlockHeight = latestBlockhash.lastValidBlockHeight;\n        transaction.recentBlockhash = latestBlockhash.blockhash;\n        if (!signers) break;\n        transaction.sign(...signers);\n        if (!transaction.signature) {\n          throw new Error('!signature'); // should never happen\n        }\n        const signature = transaction.signature.toString('base64');\n        if (!this._blockhashInfo.simulatedSignatures.includes(signature) && !this._blockhashInfo.transactionSignatures.includes(signature)) {\n          // The signature of this transaction has not been seen before with the\n          // current recentBlockhash, all done. Let's break\n          this._blockhashInfo.simulatedSignatures.push(signature);\n          break;\n        } else {\n          // This transaction would be treated as duplicate (its derived signature\n          // matched to one of already recorded signatures).\n          // So, we must fetch a new blockhash for a different signature by disabling\n          // our cache not to wait for the cache expiration (BLOCKHASH_CACHE_TIMEOUT_MS).\n          disableCache = true;\n        }\n      }\n    }\n    const message = transaction._compile();\n    const signData = message.serialize();\n    const wireTransaction = transaction._serialize(signData);\n    const encodedTransaction = wireTransaction.toString('base64');\n    const config = {\n      encoding: 'base64',\n      commitment: this.commitment\n    };\n    if (includeAccounts) {\n      const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map(key => key.toBase58());\n      config['accounts'] = {\n        encoding: 'base64',\n        addresses\n      };\n    }\n    if (signers) {\n      config.sigVerify = true;\n    }\n    if (configOrSigners && typeof configOrSigners === 'object' && 'innerInstructions' in configOrSigners) {\n      config.innerInstructions = configOrSigners.innerInstructions;\n    }\n    const args = [encodedTransaction, config];\n    const unsafeRes = await this._rpcRequest('simulateTransaction', args);\n    const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n    if ('error' in res) {\n      let logs;\n      if ('data' in res.error) {\n        logs = res.error.data.logs;\n        if (logs && Array.isArray(logs)) {\n          const traceIndent = '\\n    ';\n          const logTrace = traceIndent + logs.join(traceIndent);\n          console.error(res.error.message, logTrace);\n        }\n      }\n      throw new SendTransactionError({\n        action: 'simulate',\n        signature: '',\n        transactionMessage: res.error.message,\n        logs: logs\n      });\n    }\n    return res.result;\n  }\n\n  /**\n   * Sign and send a transaction\n   *\n   * @deprecated Instead, call {@link sendTransaction} with a {@link\n   * VersionedTransaction}\n   */\n\n  /**\n   * Send a signed transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n\n  /**\n   * Sign and send a transaction\n   */\n  // eslint-disable-next-line no-dupe-class-members\n  async sendTransaction(transaction, signersOrOptions, options) {\n    if ('version' in transaction) {\n      if (signersOrOptions && Array.isArray(signersOrOptions)) {\n        throw new Error('Invalid arguments');\n      }\n      const wireTransaction = transaction.serialize();\n      return await this.sendRawTransaction(wireTransaction, signersOrOptions);\n    }\n    if (signersOrOptions === undefined || !Array.isArray(signersOrOptions)) {\n      throw new Error('Invalid arguments');\n    }\n    const signers = signersOrOptions;\n    if (transaction.nonceInfo) {\n      transaction.sign(...signers);\n    } else {\n      let disableCache = this._disableBlockhashCaching;\n      for (;;) {\n        const latestBlockhash = await this._blockhashWithExpiryBlockHeight(disableCache);\n        transaction.lastValidBlockHeight = latestBlockhash.lastValidBlockHeight;\n        transaction.recentBlockhash = latestBlockhash.blockhash;\n        transaction.sign(...signers);\n        if (!transaction.signature) {\n          throw new Error('!signature'); // should never happen\n        }\n        const signature = transaction.signature.toString('base64');\n        if (!this._blockhashInfo.transactionSignatures.includes(signature)) {\n          // The signature of this transaction has not been seen before with the\n          // current recentBlockhash, all done. Let's break\n          this._blockhashInfo.transactionSignatures.push(signature);\n          break;\n        } else {\n          // This transaction would be treated as duplicate (its derived signature\n          // matched to one of already recorded signatures).\n          // So, we must fetch a new blockhash for a different signature by disabling\n          // our cache not to wait for the cache expiration (BLOCKHASH_CACHE_TIMEOUT_MS).\n          disableCache = true;\n        }\n      }\n    }\n    const wireTransaction = transaction.serialize();\n    return await this.sendRawTransaction(wireTransaction, options);\n  }\n\n  /**\n   * Send a transaction that has already been signed and serialized into the\n   * wire format\n   */\n  async sendRawTransaction(rawTransaction, options) {\n    const encodedTransaction = toBuffer(rawTransaction).toString('base64');\n    const result = await this.sendEncodedTransaction(encodedTransaction, options);\n    return result;\n  }\n\n  /**\n   * Send a transaction that has already been signed, serialized into the\n   * wire format, and encoded as a base64 string\n   */\n  async sendEncodedTransaction(encodedTransaction, options) {\n    const config = {\n      encoding: 'base64'\n    };\n    const skipPreflight = options && options.skipPreflight;\n    const preflightCommitment = skipPreflight === true ? 'processed' // FIXME Remove when https://github.com/anza-xyz/agave/pull/483 is deployed.\n    : options && options.preflightCommitment || this.commitment;\n    if (options && options.maxRetries != null) {\n      config.maxRetries = options.maxRetries;\n    }\n    if (options && options.minContextSlot != null) {\n      config.minContextSlot = options.minContextSlot;\n    }\n    if (skipPreflight) {\n      config.skipPreflight = skipPreflight;\n    }\n    if (preflightCommitment) {\n      config.preflightCommitment = preflightCommitment;\n    }\n    const args = [encodedTransaction, config];\n    const unsafeRes = await this._rpcRequest('sendTransaction', args);\n    const res = create(unsafeRes, SendTransactionRpcResult);\n    if ('error' in res) {\n      let logs = undefined;\n      if ('data' in res.error) {\n        logs = res.error.data.logs;\n      }\n      throw new SendTransactionError({\n        action: skipPreflight ? 'send' : 'simulate',\n        signature: '',\n        transactionMessage: res.error.message,\n        logs: logs\n      });\n    }\n    return res.result;\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnOpen() {\n    this._rpcWebSocketConnected = true;\n    this._rpcWebSocketHeartbeat = setInterval(() => {\n      // Ping server every 5s to prevent idle timeouts\n      (async () => {\n        try {\n          await this._rpcWebSocket.notify('ping');\n          // eslint-disable-next-line no-empty\n        } catch {}\n      })();\n    }, 5000);\n    this._updateSubscriptions();\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnError(err) {\n    this._rpcWebSocketConnected = false;\n    console.error('ws error:', err.message);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnClose(code) {\n    this._rpcWebSocketConnected = false;\n    this._rpcWebSocketGeneration = (this._rpcWebSocketGeneration + 1) % Number.MAX_SAFE_INTEGER;\n    if (this._rpcWebSocketIdleTimeout) {\n      clearTimeout(this._rpcWebSocketIdleTimeout);\n      this._rpcWebSocketIdleTimeout = null;\n    }\n    if (this._rpcWebSocketHeartbeat) {\n      clearInterval(this._rpcWebSocketHeartbeat);\n      this._rpcWebSocketHeartbeat = null;\n    }\n    if (code === 1000) {\n      // explicit close, check if any subscriptions have been made since close\n      this._updateSubscriptions();\n      return;\n    }\n\n    // implicit close, prepare subscriptions for auto-reconnect\n    this._subscriptionCallbacksByServerSubscriptionId = {};\n    Object.entries(this._subscriptionsByHash).forEach(([hash, subscription]) => {\n      this._setSubscription(hash, {\n        ...subscription,\n        state: 'pending'\n      });\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _setSubscription(hash, nextSubscription) {\n    const prevState = this._subscriptionsByHash[hash]?.state;\n    this._subscriptionsByHash[hash] = nextSubscription;\n    if (prevState !== nextSubscription.state) {\n      const stateChangeCallbacks = this._subscriptionStateChangeCallbacksByHash[hash];\n      if (stateChangeCallbacks) {\n        stateChangeCallbacks.forEach(cb => {\n          try {\n            cb(nextSubscription.state);\n            // eslint-disable-next-line no-empty\n          } catch {}\n        });\n      }\n    }\n  }\n\n  /**\n   * @internal\n   */\n  _onSubscriptionStateChange(clientSubscriptionId, callback) {\n    const hash = this._subscriptionHashByClientSubscriptionId[clientSubscriptionId];\n    if (hash == null) {\n      return () => {};\n    }\n    const stateChangeCallbacks = this._subscriptionStateChangeCallbacksByHash[hash] ||= new Set();\n    stateChangeCallbacks.add(callback);\n    return () => {\n      stateChangeCallbacks.delete(callback);\n      if (stateChangeCallbacks.size === 0) {\n        delete this._subscriptionStateChangeCallbacksByHash[hash];\n      }\n    };\n  }\n\n  /**\n   * @internal\n   */\n  async _updateSubscriptions() {\n    if (Object.keys(this._subscriptionsByHash).length === 0) {\n      if (this._rpcWebSocketConnected) {\n        this._rpcWebSocketConnected = false;\n        this._rpcWebSocketIdleTimeout = setTimeout(() => {\n          this._rpcWebSocketIdleTimeout = null;\n          try {\n            this._rpcWebSocket.close();\n          } catch (err) {\n            // swallow error if socket has already been closed.\n            if (err instanceof Error) {\n              console.log(`Error when closing socket connection: ${err.message}`);\n            }\n          }\n        }, 500);\n      }\n      return;\n    }\n    if (this._rpcWebSocketIdleTimeout !== null) {\n      clearTimeout(this._rpcWebSocketIdleTimeout);\n      this._rpcWebSocketIdleTimeout = null;\n      this._rpcWebSocketConnected = true;\n    }\n    if (!this._rpcWebSocketConnected) {\n      this._rpcWebSocket.connect();\n      return;\n    }\n    const activeWebSocketGeneration = this._rpcWebSocketGeneration;\n    const isCurrentConnectionStillActive = () => {\n      return activeWebSocketGeneration === this._rpcWebSocketGeneration;\n    };\n    await Promise.all(\n    // Don't be tempted to change this to `Object.entries`. We call\n    // `_updateSubscriptions` recursively when processing the state,\n    // so it's important that we look up the *current* version of\n    // each subscription, every time we process a hash.\n    Object.keys(this._subscriptionsByHash).map(async hash => {\n      const subscription = this._subscriptionsByHash[hash];\n      if (subscription === undefined) {\n        // This entry has since been deleted. Skip.\n        return;\n      }\n      switch (subscription.state) {\n        case 'pending':\n        case 'unsubscribed':\n          if (subscription.callbacks.size === 0) {\n            /**\n             * You can end up here when:\n             *\n             * - a subscription has recently unsubscribed\n             *   without having new callbacks added to it\n             *   while the unsubscribe was in flight, or\n             * - when a pending subscription has its\n             *   listeners removed before a request was\n             *   sent to the server.\n             *\n             * Being that nobody is interested in this\n             * subscription any longer, delete it.\n             */\n            delete this._subscriptionsByHash[hash];\n            if (subscription.state === 'unsubscribed') {\n              delete this._subscriptionCallbacksByServerSubscriptionId[subscription.serverSubscriptionId];\n            }\n            await this._updateSubscriptions();\n            return;\n          }\n          await (async () => {\n            const {\n              args,\n              method\n            } = subscription;\n            try {\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'subscribing'\n              });\n              const serverSubscriptionId = await this._rpcWebSocket.call(method, args);\n              this._setSubscription(hash, {\n                ...subscription,\n                serverSubscriptionId,\n                state: 'subscribed'\n              });\n              this._subscriptionCallbacksByServerSubscriptionId[serverSubscriptionId] = subscription.callbacks;\n              await this._updateSubscriptions();\n            } catch (e) {\n              if (e instanceof Error) {\n                console.error(`${method} error for argument`, args, e.message);\n              }\n              if (!isCurrentConnectionStillActive()) {\n                return;\n              }\n              // TODO: Maybe add an 'errored' state or a retry limit?\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'pending'\n              });\n              await this._updateSubscriptions();\n            }\n          })();\n          break;\n        case 'subscribed':\n          if (subscription.callbacks.size === 0) {\n            // By the time we successfully set up a subscription\n            // with the server, the client stopped caring about it.\n            // Tear it down now.\n            await (async () => {\n              const {\n                serverSubscriptionId,\n                unsubscribeMethod\n              } = subscription;\n              if (this._subscriptionsAutoDisposedByRpc.has(serverSubscriptionId)) {\n                /**\n                 * Special case.\n                 * If we're dealing with a subscription that has been auto-\n                 * disposed by the RPC, then we can skip the RPC call to\n                 * tear down the subscription here.\n                 *\n                 * NOTE: There is a proposal to eliminate this special case, here:\n                 * https://github.com/solana-labs/solana/issues/18892\n                 */\n                this._subscriptionsAutoDisposedByRpc.delete(serverSubscriptionId);\n              } else {\n                this._setSubscription(hash, {\n                  ...subscription,\n                  state: 'unsubscribing'\n                });\n                this._setSubscription(hash, {\n                  ...subscription,\n                  state: 'unsubscribing'\n                });\n                try {\n                  await this._rpcWebSocket.call(unsubscribeMethod, [serverSubscriptionId]);\n                } catch (e) {\n                  if (e instanceof Error) {\n                    console.error(`${unsubscribeMethod} error:`, e.message);\n                  }\n                  if (!isCurrentConnectionStillActive()) {\n                    return;\n                  }\n                  // TODO: Maybe add an 'errored' state or a retry limit?\n                  this._setSubscription(hash, {\n                    ...subscription,\n                    state: 'subscribed'\n                  });\n                  await this._updateSubscriptions();\n                  return;\n                }\n              }\n              this._setSubscription(hash, {\n                ...subscription,\n                state: 'unsubscribed'\n              });\n              await this._updateSubscriptions();\n            })();\n          }\n          break;\n      }\n    }));\n  }\n\n  /**\n   * @internal\n   */\n  _handleServerNotification(serverSubscriptionId, callbackArgs) {\n    const callbacks = this._subscriptionCallbacksByServerSubscriptionId[serverSubscriptionId];\n    if (callbacks === undefined) {\n      return;\n    }\n    callbacks.forEach(cb => {\n      try {\n        cb(\n        // I failed to find a way to convince TypeScript that `cb` is of type\n        // `TCallback` which is certainly compatible with `Parameters<TCallback>`.\n        // See https://github.com/microsoft/TypeScript/issues/47615\n        // @ts-ignore\n        ...callbackArgs);\n      } catch (e) {\n        console.error(e);\n      }\n    });\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnAccountNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, AccountNotificationResult);\n    this._handleServerNotification(subscription, [result.value, result.context]);\n  }\n\n  /**\n   * @internal\n   */\n  _makeSubscription(subscriptionConfig,\n  /**\n   * When preparing `args` for a call to `_makeSubscription`, be sure\n   * to carefully apply a default `commitment` property, if necessary.\n   *\n   * - If the user supplied a `commitment` use that.\n   * - Otherwise, if the `Connection::commitment` is set, use that.\n   * - Otherwise, set it to the RPC server default: `finalized`.\n   *\n   * This is extremely important to ensure that these two fundamentally\n   * identical subscriptions produce the same identifying hash:\n   *\n   * - A subscription made without specifying a commitment.\n   * - A subscription made where the commitment specified is the same\n   *   as the default applied to the subscription above.\n   *\n   * Example; these two subscriptions must produce the same hash:\n   *\n   * - An `accountSubscribe` subscription for `'PUBKEY'`\n   * - An `accountSubscribe` subscription for `'PUBKEY'` with commitment\n   *   `'finalized'`.\n   *\n   * See the 'making a subscription with defaulted params omitted' test\n   * in `connection-subscriptions.ts` for more.\n   */\n  args) {\n    const clientSubscriptionId = this._nextClientSubscriptionId++;\n    const hash = fastStableStringify$1([subscriptionConfig.method, args]);\n    const existingSubscription = this._subscriptionsByHash[hash];\n    if (existingSubscription === undefined) {\n      this._subscriptionsByHash[hash] = {\n        ...subscriptionConfig,\n        args,\n        callbacks: new Set([subscriptionConfig.callback]),\n        state: 'pending'\n      };\n    } else {\n      existingSubscription.callbacks.add(subscriptionConfig.callback);\n    }\n    this._subscriptionHashByClientSubscriptionId[clientSubscriptionId] = hash;\n    this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId] = async () => {\n      delete this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId];\n      delete this._subscriptionHashByClientSubscriptionId[clientSubscriptionId];\n      const subscription = this._subscriptionsByHash[hash];\n      index_browser_esm_assert(subscription !== undefined, `Could not find a \\`Subscription\\` when tearing down client subscription #${clientSubscriptionId}`);\n      subscription.callbacks.delete(subscriptionConfig.callback);\n      await this._updateSubscriptions();\n    };\n    this._updateSubscriptions();\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Register a callback to be invoked whenever the specified account changes\n   *\n   * @param publicKey Public key of the account to monitor\n   * @param callback Function to invoke whenever the account is changed\n   * @param config\n   * @return subscription id\n   */\n\n  /** @deprecated Instead, pass in an {@link AccountSubscriptionConfig} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  onAccountChange(publicKey, callback, commitmentOrConfig) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([publicKey.toBase58()], commitment || this._commitment || 'finalized',\n    // Apply connection/server default.\n    'base64', config);\n    return this._makeSubscription({\n      callback,\n      method: 'accountSubscribe',\n      unsubscribeMethod: 'accountUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister an account notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeAccountChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'account change');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnProgramAccountNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, ProgramAccountNotificationResult);\n    this._handleServerNotification(subscription, [{\n      accountId: result.value.pubkey,\n      accountInfo: result.value.account\n    }, result.context]);\n  }\n\n  /**\n   * Register a callback to be invoked whenever accounts owned by the\n   * specified program change\n   *\n   * @param programId Public key of the program to monitor\n   * @param callback Function to invoke whenever the account is changed\n   * @param config\n   * @return subscription id\n   */\n\n  /** @deprecated Instead, pass in a {@link ProgramAccountSubscriptionConfig} */\n  // eslint-disable-next-line no-dupe-class-members\n\n  // eslint-disable-next-line no-dupe-class-members\n  onProgramAccountChange(programId, callback, commitmentOrConfig, maybeFilters) {\n    const {\n      commitment,\n      config\n    } = extractCommitmentFromConfig(commitmentOrConfig);\n    const args = this._buildArgs([programId.toBase58()], commitment || this._commitment || 'finalized',\n    // Apply connection/server default.\n    'base64' /* encoding */, config ? config : maybeFilters ? {\n      filters: maybeFilters\n    } : undefined /* extra */);\n    return this._makeSubscription({\n      callback,\n      method: 'programSubscribe',\n      unsubscribeMethod: 'programUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister an account notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeProgramAccountChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'program account change');\n  }\n\n  /**\n   * Registers a callback to be invoked whenever logs are emitted.\n   */\n  onLogs(filter, callback, commitment) {\n    const args = this._buildArgs([typeof filter === 'object' ? {\n      mentions: [filter.toString()]\n    } : filter], commitment || this._commitment || 'finalized' // Apply connection/server default.\n    );\n    return this._makeSubscription({\n      callback,\n      method: 'logsSubscribe',\n      unsubscribeMethod: 'logsUnsubscribe'\n    }, args);\n  }\n\n  /**\n   * Deregister a logs callback.\n   *\n   * @param clientSubscriptionId client subscription id to deregister.\n   */\n  async removeOnLogsListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'logs');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnLogsNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, LogsNotificationResult);\n    this._handleServerNotification(subscription, [result.value, result.context]);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSlotNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SlotNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon slot changes\n   *\n   * @param callback Function to invoke whenever the slot changes\n   * @return subscription id\n   */\n  onSlotChange(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'slotSubscribe',\n      unsubscribeMethod: 'slotUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a slot notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSlotChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'slot change');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSlotUpdatesNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SlotUpdateNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon slot updates. {@link SlotUpdate}'s\n   * may be useful to track live progress of a cluster.\n   *\n   * @param callback Function to invoke whenever the slot updates\n   * @return subscription id\n   */\n  onSlotUpdate(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'slotsUpdatesSubscribe',\n      unsubscribeMethod: 'slotsUpdatesUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a slot update notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSlotUpdateListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'slot update');\n  }\n\n  /**\n   * @internal\n   */\n\n  async _unsubscribeClientSubscription(clientSubscriptionId, subscriptionName) {\n    const dispose = this._subscriptionDisposeFunctionsByClientSubscriptionId[clientSubscriptionId];\n    if (dispose) {\n      await dispose();\n    } else {\n      console.warn('Ignored unsubscribe request because an active subscription with id ' + `\\`${clientSubscriptionId}\\` for '${subscriptionName}' events ` + 'could not be found.');\n    }\n  }\n  _buildArgs(args, override, encoding, extra) {\n    const commitment = override || this._commitment;\n    if (commitment || encoding || extra) {\n      let options = {};\n      if (encoding) {\n        options.encoding = encoding;\n      }\n      if (commitment) {\n        options.commitment = commitment;\n      }\n      if (extra) {\n        options = Object.assign(options, extra);\n      }\n      args.push(options);\n    }\n    return args;\n  }\n\n  /**\n   * @internal\n   */\n  _buildArgsAtLeastConfirmed(args, override, encoding, extra) {\n    const commitment = override || this._commitment;\n    if (commitment && !['confirmed', 'finalized'].includes(commitment)) {\n      throw new Error('Using Connection with default commitment: `' + this._commitment + '`, but method requires at least `confirmed`');\n    }\n    return this._buildArgs(args, override, encoding, extra);\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnSignatureNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, SignatureNotificationResult);\n    if (result.value !== 'receivedSignature') {\n      /**\n       * Special case.\n       * After a signature is processed, RPCs automatically dispose of the\n       * subscription on the server side. We need to track which of these\n       * subscriptions have been disposed in such a way, so that we know\n       * whether the client is dealing with a not-yet-processed signature\n       * (in which case we must tear down the server subscription) or an\n       * already-processed signature (in which case the client can simply\n       * clear out the subscription locally without telling the server).\n       *\n       * NOTE: There is a proposal to eliminate this special case, here:\n       * https://github.com/solana-labs/solana/issues/18892\n       */\n      this._subscriptionsAutoDisposedByRpc.add(subscription);\n    }\n    this._handleServerNotification(subscription, result.value === 'receivedSignature' ? [{\n      type: 'received'\n    }, result.context] : [{\n      type: 'status',\n      result: result.value\n    }, result.context]);\n  }\n\n  /**\n   * Register a callback to be invoked upon signature updates\n   *\n   * @param signature Transaction signature string in base 58\n   * @param callback Function to invoke on signature notifications\n   * @param commitment Specify the commitment level signature must reach before notification\n   * @return subscription id\n   */\n  onSignature(signature, callback, commitment) {\n    const args = this._buildArgs([signature], commitment || this._commitment || 'finalized' // Apply connection/server default.\n    );\n    const clientSubscriptionId = this._makeSubscription({\n      callback: (notification, context) => {\n        if (notification.type === 'status') {\n          callback(notification.result, context);\n          // Signatures subscriptions are auto-removed by the RPC service\n          // so no need to explicitly send an unsubscribe message.\n          try {\n            this.removeSignatureListener(clientSubscriptionId);\n            // eslint-disable-next-line no-empty\n          } catch (_err) {\n            // Already removed.\n          }\n        }\n      },\n      method: 'signatureSubscribe',\n      unsubscribeMethod: 'signatureUnsubscribe'\n    }, args);\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Register a callback to be invoked when a transaction is\n   * received and/or processed.\n   *\n   * @param signature Transaction signature string in base 58\n   * @param callback Function to invoke on signature notifications\n   * @param options Enable received notifications and set the commitment\n   *   level that signature must reach before notification\n   * @return subscription id\n   */\n  onSignatureWithOptions(signature, callback, options) {\n    const {\n      commitment,\n      ...extra\n    } = {\n      ...options,\n      commitment: options && options.commitment || this._commitment || 'finalized' // Apply connection/server default.\n    };\n    const args = this._buildArgs([signature], commitment, undefined /* encoding */, extra);\n    const clientSubscriptionId = this._makeSubscription({\n      callback: (notification, context) => {\n        callback(notification, context);\n        // Signatures subscriptions are auto-removed by the RPC service\n        // so no need to explicitly send an unsubscribe message.\n        try {\n          this.removeSignatureListener(clientSubscriptionId);\n          // eslint-disable-next-line no-empty\n        } catch (_err) {\n          // Already removed.\n        }\n      },\n      method: 'signatureSubscribe',\n      unsubscribeMethod: 'signatureUnsubscribe'\n    }, args);\n    return clientSubscriptionId;\n  }\n\n  /**\n   * Deregister a signature notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeSignatureListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'signature result');\n  }\n\n  /**\n   * @internal\n   */\n  _wsOnRootNotification(notification) {\n    const {\n      result,\n      subscription\n    } = create(notification, RootNotificationResult);\n    this._handleServerNotification(subscription, [result]);\n  }\n\n  /**\n   * Register a callback to be invoked upon root changes\n   *\n   * @param callback Function to invoke whenever the root changes\n   * @return subscription id\n   */\n  onRootChange(callback) {\n    return this._makeSubscription({\n      callback,\n      method: 'rootSubscribe',\n      unsubscribeMethod: 'rootUnsubscribe'\n    }, [] /* args */);\n  }\n\n  /**\n   * Deregister a root notification callback\n   *\n   * @param clientSubscriptionId client subscription id to deregister\n   */\n  async removeRootChangeListener(clientSubscriptionId) {\n    await this._unsubscribeClientSubscription(clientSubscriptionId, 'root change');\n  }\n}\n\n/**\n * Keypair signer interface\n */\n\n/**\n * An account keypair used for signing transactions.\n */\nclass Keypair {\n  /**\n   * Create a new keypair instance.\n   * Generate random keypair if no {@link Ed25519Keypair} is provided.\n   *\n   * @param {Ed25519Keypair} keypair ed25519 keypair\n   */\n  constructor(keypair) {\n    this._keypair = void 0;\n    this._keypair = keypair ?? generateKeypair();\n  }\n\n  /**\n   * Generate a new random keypair\n   *\n   * @returns {Keypair} Keypair\n   */\n  static generate() {\n    return new Keypair(generateKeypair());\n  }\n\n  /**\n   * Create a keypair from a raw secret key byte array.\n   *\n   * This method should only be used to recreate a keypair from a previously\n   * generated secret key. Generating keypairs from a random seed should be done\n   * with the {@link Keypair.fromSeed} method.\n   *\n   * @throws error if the provided secret key is invalid and validation is not skipped.\n   *\n   * @param secretKey secret key byte array\n   * @param options skip secret key validation\n   *\n   * @returns {Keypair} Keypair\n   */\n  static fromSecretKey(secretKey, options) {\n    if (secretKey.byteLength !== 64) {\n      throw new Error('bad secret key size');\n    }\n    const publicKey = secretKey.slice(32, 64);\n    if (!options || !options.skipValidation) {\n      const privateScalar = secretKey.slice(0, 32);\n      const computedPublicKey = getPublicKey(privateScalar);\n      for (let ii = 0; ii < 32; ii++) {\n        if (publicKey[ii] !== computedPublicKey[ii]) {\n          throw new Error('provided secretKey is invalid');\n        }\n      }\n    }\n    return new Keypair({\n      publicKey,\n      secretKey\n    });\n  }\n\n  /**\n   * Generate a keypair from a 32 byte seed.\n   *\n   * @param seed seed byte array\n   *\n   * @returns {Keypair} Keypair\n   */\n  static fromSeed(seed) {\n    const publicKey = getPublicKey(seed);\n    const secretKey = new Uint8Array(64);\n    secretKey.set(seed);\n    secretKey.set(publicKey, 32);\n    return new Keypair({\n      publicKey,\n      secretKey\n    });\n  }\n\n  /**\n   * The public key for this keypair\n   *\n   * @returns {PublicKey} PublicKey\n   */\n  get publicKey() {\n    return new PublicKey(this._keypair.publicKey);\n  }\n\n  /**\n   * The raw secret key for this keypair\n   * @returns {Uint8Array} Secret key in an array of Uint8 bytes\n   */\n  get secretKey() {\n    return new Uint8Array(this._keypair.secretKey);\n  }\n}\n\n/**\n * An enumeration of valid LookupTableInstructionType's\n */\n\n/**\n * An enumeration of valid address lookup table InstructionType's\n * @internal\n */\nconst LOOKUP_TABLE_INSTRUCTION_LAYOUTS = Object.freeze({\n  CreateLookupTable: {\n    index: 0,\n    layout: Layout.struct([Layout.u32('instruction'), index_browser_esm_u64('recentSlot'), Layout.u8('bumpSeed')])\n  },\n  FreezeLookupTable: {\n    index: 1,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  ExtendLookupTable: {\n    index: 2,\n    layout: Layout.struct([Layout.u32('instruction'), index_browser_esm_u64(), Layout.seq(publicKey(), Layout.offset(Layout.u32(), -8), 'addresses')])\n  },\n  DeactivateLookupTable: {\n    index: 3,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  CloseLookupTable: {\n    index: 4,\n    layout: Layout.struct([Layout.u32('instruction')])\n  }\n});\nclass AddressLookupTableInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = Layout.u32('instruction');\n    const index = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [layoutType, layout] of Object.entries(LOOKUP_TABLE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == index) {\n        type = layoutType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Invalid Instruction. Should be a LookupTable Instruction');\n    }\n    return type;\n  }\n  static decodeCreateLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 4);\n    const {\n      recentSlot\n    } = decodeData$1(LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CreateLookupTable, instruction.data);\n    return {\n      authority: instruction.keys[1].pubkey,\n      payer: instruction.keys[2].pubkey,\n      recentSlot: Number(recentSlot)\n    };\n  }\n  static decodeExtendLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    if (instruction.keys.length < 2) {\n      throw new Error(`invalid instruction; found ${instruction.keys.length} keys, expected at least 2`);\n    }\n    const {\n      addresses\n    } = decodeData$1(LOOKUP_TABLE_INSTRUCTION_LAYOUTS.ExtendLookupTable, instruction.data);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey,\n      payer: instruction.keys.length > 2 ? instruction.keys[2].pubkey : undefined,\n      addresses: addresses.map(buffer => new PublicKey(buffer))\n    };\n  }\n  static decodeCloseLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 3);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey,\n      recipient: instruction.keys[2].pubkey\n    };\n  }\n  static decodeFreezeLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 2);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey\n    };\n  }\n  static decodeDeactivateLookupTable(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeysLength(instruction.keys, 2);\n    return {\n      lookupTable: instruction.keys[0].pubkey,\n      authority: instruction.keys[1].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(AddressLookupTableProgram.programId)) {\n      throw new Error('invalid instruction; programId is not AddressLookupTable Program');\n    }\n  }\n  /**\n   * @internal\n   */\n  static checkKeysLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\nclass AddressLookupTableProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n  static createLookupTable(params) {\n    const [lookupTableAddress, bumpSeed] = PublicKey.findProgramAddressSync([params.authority.toBuffer(), (0,browser.toBufferLE)(BigInt(params.recentSlot), 8)], this.programId);\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CreateLookupTable;\n    const data = encodeData(type, {\n      recentSlot: BigInt(params.recentSlot),\n      bumpSeed: bumpSeed\n    });\n    const keys = [{\n      pubkey: lookupTableAddress,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: params.payer,\n      isSigner: true,\n      isWritable: true\n    }, {\n      pubkey: SystemProgram.programId,\n      isSigner: false,\n      isWritable: false\n    }];\n    return [new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    }), lookupTableAddress];\n  }\n  static freezeLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.FreezeLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static extendLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.ExtendLookupTable;\n    const data = encodeData(type, {\n      addresses: params.addresses.map(addr => addr.toBytes())\n    });\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (params.payer) {\n      keys.push({\n        pubkey: params.payer,\n        isSigner: true,\n        isWritable: true\n      }, {\n        pubkey: SystemProgram.programId,\n        isSigner: false,\n        isWritable: false\n      });\n    }\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static deactivateLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.DeactivateLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n  static closeLookupTable(params) {\n    const type = LOOKUP_TABLE_INSTRUCTION_LAYOUTS.CloseLookupTable;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: params.lookupTable,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: params.authority,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: params.recipient,\n      isSigner: false,\n      isWritable: true\n    }];\n    return new TransactionInstruction({\n      programId: this.programId,\n      keys: keys,\n      data: data\n    });\n  }\n}\nAddressLookupTableProgram.programId = new PublicKey('AddressLookupTab1e1111111111111111111111111');\n\n/**\n * Compute Budget Instruction class\n */\nclass ComputeBudgetInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a compute budget instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = Layout.u8('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a ComputeBudgetInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode request units compute budget instruction and retrieve the instruction params.\n   */\n  static decodeRequestUnits(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      units,\n      additionalFee\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestUnits, instruction.data);\n    return {\n      units,\n      additionalFee\n    };\n  }\n\n  /**\n   * Decode request heap frame compute budget instruction and retrieve the instruction params.\n   */\n  static decodeRequestHeapFrame(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      bytes\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestHeapFrame, instruction.data);\n    return {\n      bytes\n    };\n  }\n\n  /**\n   * Decode set compute unit limit compute budget instruction and retrieve the instruction params.\n   */\n  static decodeSetComputeUnitLimit(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      units\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitLimit, instruction.data);\n    return {\n      units\n    };\n  }\n\n  /**\n   * Decode set compute unit price compute budget instruction and retrieve the instruction params.\n   */\n  static decodeSetComputeUnitPrice(instruction) {\n    this.checkProgramId(instruction.programId);\n    const {\n      microLamports\n    } = decodeData$1(COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitPrice, instruction.data);\n    return {\n      microLamports\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(ComputeBudgetProgram.programId)) {\n      throw new Error('invalid instruction; programId is not ComputeBudgetProgram');\n    }\n  }\n}\n\n/**\n * An enumeration of valid ComputeBudgetInstructionType's\n */\n\n/**\n * Request units instruction params\n */\n\n/**\n * Request heap frame instruction params\n */\n\n/**\n * Set compute unit limit instruction params\n */\n\n/**\n * Set compute unit price instruction params\n */\n\n/**\n * An enumeration of valid ComputeBudget InstructionType's\n * @internal\n */\nconst COMPUTE_BUDGET_INSTRUCTION_LAYOUTS = Object.freeze({\n  RequestUnits: {\n    index: 0,\n    layout: Layout.struct([Layout.u8('instruction'), Layout.u32('units'), Layout.u32('additionalFee')])\n  },\n  RequestHeapFrame: {\n    index: 1,\n    layout: Layout.struct([Layout.u8('instruction'), Layout.u32('bytes')])\n  },\n  SetComputeUnitLimit: {\n    index: 2,\n    layout: Layout.struct([Layout.u8('instruction'), Layout.u32('units')])\n  },\n  SetComputeUnitPrice: {\n    index: 3,\n    layout: Layout.struct([Layout.u8('instruction'), index_browser_esm_u64('microLamports')])\n  }\n});\n\n/**\n * Factory class for transaction instructions to interact with the Compute Budget program\n */\nclass ComputeBudgetProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Compute Budget program\n   */\n\n  /**\n   * @deprecated Instead, call {@link setComputeUnitLimit} and/or {@link setComputeUnitPrice}\n   */\n  static requestUnits(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestUnits;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static requestHeapFrame(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.RequestHeapFrame;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static setComputeUnitLimit(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitLimit;\n    const data = encodeData(type, params);\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n  static setComputeUnitPrice(params) {\n    const type = COMPUTE_BUDGET_INSTRUCTION_LAYOUTS.SetComputeUnitPrice;\n    const data = encodeData(type, {\n      microLamports: BigInt(params.microLamports)\n    });\n    return new TransactionInstruction({\n      keys: [],\n      programId: this.programId,\n      data\n    });\n  }\n}\nComputeBudgetProgram.programId = new PublicKey('ComputeBudget111111111111111111111111111111');\n\nconst PRIVATE_KEY_BYTES$1 = 64;\nconst PUBLIC_KEY_BYTES$1 = 32;\nconst SIGNATURE_BYTES = 64;\n\n/**\n * Params for creating an ed25519 instruction using a public key\n */\n\n/**\n * Params for creating an ed25519 instruction using a private key\n */\n\nconst ED25519_INSTRUCTION_LAYOUT = Layout.struct([Layout.u8('numSignatures'), Layout.u8('padding'), Layout.u16('signatureOffset'), Layout.u16('signatureInstructionIndex'), Layout.u16('publicKeyOffset'), Layout.u16('publicKeyInstructionIndex'), Layout.u16('messageDataOffset'), Layout.u16('messageDataSize'), Layout.u16('messageInstructionIndex')]);\nclass Ed25519Program {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the ed25519 program\n   */\n\n  /**\n   * Create an ed25519 instruction with a public key and signature. The\n   * public key must be a buffer that is 32 bytes long, and the signature\n   * must be a buffer of 64 bytes.\n   */\n  static createInstructionWithPublicKey(params) {\n    const {\n      publicKey,\n      message,\n      signature,\n      instructionIndex\n    } = params;\n    index_browser_esm_assert(publicKey.length === PUBLIC_KEY_BYTES$1, `Public Key must be ${PUBLIC_KEY_BYTES$1} bytes but received ${publicKey.length} bytes`);\n    index_browser_esm_assert(signature.length === SIGNATURE_BYTES, `Signature must be ${SIGNATURE_BYTES} bytes but received ${signature.length} bytes`);\n    const publicKeyOffset = ED25519_INSTRUCTION_LAYOUT.span;\n    const signatureOffset = publicKeyOffset + publicKey.length;\n    const messageDataOffset = signatureOffset + signature.length;\n    const numSignatures = 1;\n    const instructionData = node_modules_buffer.Buffer.alloc(messageDataOffset + message.length);\n    const index = instructionIndex == null ? 0xffff // An index of `u16::MAX` makes it default to the current instruction.\n    : instructionIndex;\n    ED25519_INSTRUCTION_LAYOUT.encode({\n      numSignatures,\n      padding: 0,\n      signatureOffset,\n      signatureInstructionIndex: index,\n      publicKeyOffset,\n      publicKeyInstructionIndex: index,\n      messageDataOffset,\n      messageDataSize: message.length,\n      messageInstructionIndex: index\n    }, instructionData);\n    instructionData.fill(publicKey, publicKeyOffset);\n    instructionData.fill(signature, signatureOffset);\n    instructionData.fill(message, messageDataOffset);\n    return new TransactionInstruction({\n      keys: [],\n      programId: Ed25519Program.programId,\n      data: instructionData\n    });\n  }\n\n  /**\n   * Create an ed25519 instruction with a private key. The private key\n   * must be a buffer that is 64 bytes long.\n   */\n  static createInstructionWithPrivateKey(params) {\n    const {\n      privateKey,\n      message,\n      instructionIndex\n    } = params;\n    index_browser_esm_assert(privateKey.length === PRIVATE_KEY_BYTES$1, `Private key must be ${PRIVATE_KEY_BYTES$1} bytes but received ${privateKey.length} bytes`);\n    try {\n      const keypair = Keypair.fromSecretKey(privateKey);\n      const publicKey = keypair.publicKey.toBytes();\n      const signature = sign(message, keypair.secretKey);\n      return this.createInstructionWithPublicKey({\n        publicKey,\n        message,\n        signature,\n        instructionIndex\n      });\n    } catch (error) {\n      throw new Error(`Error creating instruction; ${error}`);\n    }\n  }\n}\nEd25519Program.programId = new PublicKey('Ed25519SigVerify111111111111111111111111111');\n\nconst ecdsaSign = (msgHash, privKey) => {\n  const signature = secp256k1.sign(msgHash, privKey);\n  return [signature.toCompactRawBytes(), signature.recovery];\n};\nsecp256k1.utils.isValidPrivateKey;\nconst publicKeyCreate = secp256k1.getPublicKey;\n\nconst PRIVATE_KEY_BYTES = 32;\nconst ETHEREUM_ADDRESS_BYTES = 20;\nconst PUBLIC_KEY_BYTES = 64;\nconst SIGNATURE_OFFSETS_SERIALIZED_SIZE = 11;\n\n/**\n * Params for creating an secp256k1 instruction using a public key\n */\n\n/**\n * Params for creating an secp256k1 instruction using an Ethereum address\n */\n\n/**\n * Params for creating an secp256k1 instruction using a private key\n */\n\nconst SECP256K1_INSTRUCTION_LAYOUT = Layout.struct([Layout.u8('numSignatures'), Layout.u16('signatureOffset'), Layout.u8('signatureInstructionIndex'), Layout.u16('ethAddressOffset'), Layout.u8('ethAddressInstructionIndex'), Layout.u16('messageDataOffset'), Layout.u16('messageDataSize'), Layout.u8('messageInstructionIndex'), Layout.blob(20, 'ethAddress'), Layout.blob(64, 'signature'), Layout.u8('recoveryId')]);\nclass Secp256k1Program {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the secp256k1 program\n   */\n\n  /**\n   * Construct an Ethereum address from a secp256k1 public key buffer.\n   * @param {Buffer} publicKey a 64 byte secp256k1 public key buffer\n   */\n  static publicKeyToEthAddress(publicKey) {\n    index_browser_esm_assert(publicKey.length === PUBLIC_KEY_BYTES, `Public key must be ${PUBLIC_KEY_BYTES} bytes but received ${publicKey.length} bytes`);\n    try {\n      return node_modules_buffer.Buffer.from(keccak_256(toBuffer(publicKey))).slice(-ETHEREUM_ADDRESS_BYTES);\n    } catch (error) {\n      throw new Error(`Error constructing Ethereum address: ${error}`);\n    }\n  }\n\n  /**\n   * Create an secp256k1 instruction with a public key. The public key\n   * must be a buffer that is 64 bytes long.\n   */\n  static createInstructionWithPublicKey(params) {\n    const {\n      publicKey,\n      message,\n      signature,\n      recoveryId,\n      instructionIndex\n    } = params;\n    return Secp256k1Program.createInstructionWithEthAddress({\n      ethAddress: Secp256k1Program.publicKeyToEthAddress(publicKey),\n      message,\n      signature,\n      recoveryId,\n      instructionIndex\n    });\n  }\n\n  /**\n   * Create an secp256k1 instruction with an Ethereum address. The address\n   * must be a hex string or a buffer that is 20 bytes long.\n   */\n  static createInstructionWithEthAddress(params) {\n    const {\n      ethAddress: rawAddress,\n      message,\n      signature,\n      recoveryId,\n      instructionIndex = 0\n    } = params;\n    let ethAddress;\n    if (typeof rawAddress === 'string') {\n      if (rawAddress.startsWith('0x')) {\n        ethAddress = node_modules_buffer.Buffer.from(rawAddress.substr(2), 'hex');\n      } else {\n        ethAddress = node_modules_buffer.Buffer.from(rawAddress, 'hex');\n      }\n    } else {\n      ethAddress = rawAddress;\n    }\n    index_browser_esm_assert(ethAddress.length === ETHEREUM_ADDRESS_BYTES, `Address must be ${ETHEREUM_ADDRESS_BYTES} bytes but received ${ethAddress.length} bytes`);\n    const dataStart = 1 + SIGNATURE_OFFSETS_SERIALIZED_SIZE;\n    const ethAddressOffset = dataStart;\n    const signatureOffset = dataStart + ethAddress.length;\n    const messageDataOffset = signatureOffset + signature.length + 1;\n    const numSignatures = 1;\n    const instructionData = node_modules_buffer.Buffer.alloc(SECP256K1_INSTRUCTION_LAYOUT.span + message.length);\n    SECP256K1_INSTRUCTION_LAYOUT.encode({\n      numSignatures,\n      signatureOffset,\n      signatureInstructionIndex: instructionIndex,\n      ethAddressOffset,\n      ethAddressInstructionIndex: instructionIndex,\n      messageDataOffset,\n      messageDataSize: message.length,\n      messageInstructionIndex: instructionIndex,\n      signature: toBuffer(signature),\n      ethAddress: toBuffer(ethAddress),\n      recoveryId\n    }, instructionData);\n    instructionData.fill(toBuffer(message), SECP256K1_INSTRUCTION_LAYOUT.span);\n    return new TransactionInstruction({\n      keys: [],\n      programId: Secp256k1Program.programId,\n      data: instructionData\n    });\n  }\n\n  /**\n   * Create an secp256k1 instruction with a private key. The private key\n   * must be a buffer that is 32 bytes long.\n   */\n  static createInstructionWithPrivateKey(params) {\n    const {\n      privateKey: pkey,\n      message,\n      instructionIndex\n    } = params;\n    index_browser_esm_assert(pkey.length === PRIVATE_KEY_BYTES, `Private key must be ${PRIVATE_KEY_BYTES} bytes but received ${pkey.length} bytes`);\n    try {\n      const privateKey = toBuffer(pkey);\n      const publicKey = publicKeyCreate(privateKey, false /* isCompressed */).slice(1); // throw away leading byte\n      const messageHash = node_modules_buffer.Buffer.from(keccak_256(toBuffer(message)));\n      const [signature, recoveryId] = ecdsaSign(messageHash, privateKey);\n      return this.createInstructionWithPublicKey({\n        publicKey,\n        message,\n        signature,\n        recoveryId,\n        instructionIndex\n      });\n    } catch (error) {\n      throw new Error(`Error creating instruction; ${error}`);\n    }\n  }\n}\nSecp256k1Program.programId = new PublicKey('KeccakSecp256k11111111111111111111111111111');\n\nvar _Lockup;\n\n/**\n * Address of the stake config account which configures the rate\n * of stake warmup and cooldown as well as the slashing penalty.\n */\nconst STAKE_CONFIG_ID = new PublicKey('StakeConfig11111111111111111111111111111111');\n\n/**\n * Stake account authority info\n */\nclass Authorized {\n  /**\n   * Create a new Authorized object\n   * @param staker the stake authority\n   * @param withdrawer the withdraw authority\n   */\n  constructor(staker, withdrawer) {\n    /** stake authority */\n    this.staker = void 0;\n    /** withdraw authority */\n    this.withdrawer = void 0;\n    this.staker = staker;\n    this.withdrawer = withdrawer;\n  }\n}\n/**\n * Stake account lockup info\n */\nclass Lockup {\n  /**\n   * Create a new Lockup object\n   */\n  constructor(unixTimestamp, epoch, custodian) {\n    /** Unix timestamp of lockup expiration */\n    this.unixTimestamp = void 0;\n    /** Epoch of lockup expiration */\n    this.epoch = void 0;\n    /** Lockup custodian authority */\n    this.custodian = void 0;\n    this.unixTimestamp = unixTimestamp;\n    this.epoch = epoch;\n    this.custodian = custodian;\n  }\n\n  /**\n   * Default, inactive Lockup value\n   */\n}\n_Lockup = Lockup;\nLockup.default = new _Lockup(0, 0, PublicKey.default);\n/**\n * Create stake account transaction params\n */\n/**\n * Create stake account with seed transaction params\n */\n/**\n * Initialize stake instruction params\n */\n/**\n * Delegate stake instruction params\n */\n/**\n * Authorize stake instruction params\n */\n/**\n * Authorize stake instruction params using a derived key\n */\n/**\n * Split stake instruction params\n */\n/**\n * Split with seed transaction params\n */\n/**\n * Withdraw stake instruction params\n */\n/**\n * Deactivate stake instruction params\n */\n/**\n * Merge stake instruction params\n */\n/**\n * Stake Instruction class\n */\nclass StakeInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a stake instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = Layout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(STAKE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a StakeInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode a initialize stake instruction and retrieve the instruction params.\n   */\n  static decodeInitialize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      authorized,\n      lockup\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Initialize, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorized: new Authorized(new PublicKey(authorized.staker), new PublicKey(authorized.withdrawer)),\n      lockup: new Lockup(lockup.unixTimestamp, lockup.epoch, new PublicKey(lockup.custodian))\n    };\n  }\n\n  /**\n   * Decode a delegate stake instruction and retrieve the instruction params.\n   */\n  static decodeDelegate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 6);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Delegate, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      votePubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[5].pubkey\n    };\n  }\n\n  /**\n   * Decode an authorize stake instruction and retrieve the instruction params.\n   */\n  static decodeAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      newAuthorized,\n      stakeAuthorizationType\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Authorize, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      stakeAuthorizationType: {\n        index: stakeAuthorizationType\n      }\n    };\n    if (instruction.keys.length > 3) {\n      o.custodianPubkey = instruction.keys[3].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode an authorize-with-seed stake instruction and retrieve the instruction params.\n   */\n  static decodeAuthorizeWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 2);\n    const {\n      newAuthorized,\n      stakeAuthorizationType,\n      authoritySeed,\n      authorityOwner\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorityBase: instruction.keys[1].pubkey,\n      authoritySeed: authoritySeed,\n      authorityOwner: new PublicKey(authorityOwner),\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      stakeAuthorizationType: {\n        index: stakeAuthorizationType\n      }\n    };\n    if (instruction.keys.length > 3) {\n      o.custodianPubkey = instruction.keys[3].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode a split stake instruction and retrieve the instruction params.\n   */\n  static decodeSplit(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Split, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      splitStakePubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      lamports\n    };\n  }\n\n  /**\n   * Decode a merge stake instruction and retrieve the instruction params.\n   */\n  static decodeMerge(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Merge, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      sourceStakePubKey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey\n    };\n  }\n\n  /**\n   * Decode a withdraw stake instruction and retrieve the instruction params.\n   */\n  static decodeWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 5);\n    const {\n      lamports\n    } = decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Withdraw, instruction.data);\n    const o = {\n      stakePubkey: instruction.keys[0].pubkey,\n      toPubkey: instruction.keys[1].pubkey,\n      authorizedPubkey: instruction.keys[4].pubkey,\n      lamports\n    };\n    if (instruction.keys.length > 5) {\n      o.custodianPubkey = instruction.keys[5].pubkey;\n    }\n    return o;\n  }\n\n  /**\n   * Decode a deactivate stake instruction and retrieve the instruction params.\n   */\n  static decodeDeactivate(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    decodeData$1(STAKE_INSTRUCTION_LAYOUTS.Deactivate, instruction.data);\n    return {\n      stakePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(StakeProgram.programId)) {\n      throw new Error('invalid instruction; programId is not StakeProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid StakeInstructionType's\n */\n\n/**\n * An enumeration of valid stake InstructionType's\n * @internal\n */\nconst STAKE_INSTRUCTION_LAYOUTS = Object.freeze({\n  Initialize: {\n    index: 0,\n    layout: Layout.struct([Layout.u32('instruction'), authorized(), lockup()])\n  },\n  Authorize: {\n    index: 1,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('newAuthorized'), Layout.u32('stakeAuthorizationType')])\n  },\n  Delegate: {\n    index: 2,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  Split: {\n    index: 3,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('lamports')])\n  },\n  Withdraw: {\n    index: 4,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('lamports')])\n  },\n  Deactivate: {\n    index: 5,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  Merge: {\n    index: 7,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  AuthorizeWithSeed: {\n    index: 8,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('newAuthorized'), Layout.u32('stakeAuthorizationType'), rustString('authoritySeed'), publicKey('authorityOwner')])\n  }\n});\n\n/**\n * Stake authorization type\n */\n\n/**\n * An enumeration of valid StakeAuthorizationLayout's\n */\nconst StakeAuthorizationLayout = Object.freeze({\n  Staker: {\n    index: 0\n  },\n  Withdrawer: {\n    index: 1\n  }\n});\n\n/**\n * Factory class for transactions to interact with the Stake program\n */\nclass StakeProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Stake program\n   */\n\n  /**\n   * Generate an Initialize instruction to add to a Stake Create transaction\n   */\n  static initialize(params) {\n    const {\n      stakePubkey,\n      authorized,\n      lockup: maybeLockup\n    } = params;\n    const lockup = maybeLockup || Lockup.default;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Initialize;\n    const data = encodeData(type, {\n      authorized: {\n        staker: toBuffer(authorized.staker.toBuffer()),\n        withdrawer: toBuffer(authorized.withdrawer.toBuffer())\n      },\n      lockup: {\n        unixTimestamp: lockup.unixTimestamp,\n        epoch: lockup.epoch,\n        custodian: toBuffer(lockup.custodian.toBuffer())\n      }\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a Transaction that creates a new Stake account at\n   *   an address generated with `from`, a seed, and the Stake programId\n   */\n  static createAccountWithSeed(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccountWithSeed({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.stakePubkey,\n      basePubkey: params.basePubkey,\n      seed: params.seed,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    const {\n      stakePubkey,\n      authorized,\n      lockup\n    } = params;\n    return transaction.add(this.initialize({\n      stakePubkey,\n      authorized,\n      lockup\n    }));\n  }\n\n  /**\n   * Generate a Transaction that creates a new Stake account\n   */\n  static createAccount(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.stakePubkey,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    const {\n      stakePubkey,\n      authorized,\n      lockup\n    } = params;\n    return transaction.add(this.initialize({\n      stakePubkey,\n      authorized,\n      lockup\n    }));\n  }\n\n  /**\n   * Generate a Transaction that delegates Stake tokens to a validator\n   * Vote PublicKey. This transaction can also be used to redelegate Stake\n   * to a new validator Vote PublicKey.\n   */\n  static delegate(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      votePubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Delegate;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: votePubkey,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: STAKE_CONFIG_ID,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that authorizes a new PublicKey as Staker\n   * or Withdrawer on the Stake account.\n   */\n  static authorize(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      newAuthorizedPubkey,\n      stakeAuthorizationType,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Authorize;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      stakeAuthorizationType: stakeAuthorizationType.index\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that authorizes a new PublicKey as Staker\n   * or Withdrawer on the Stake account.\n   */\n  static authorizeWithSeed(params) {\n    const {\n      stakePubkey,\n      authorityBase,\n      authoritySeed,\n      authorityOwner,\n      newAuthorizedPubkey,\n      stakeAuthorizationType,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      stakeAuthorizationType: stakeAuthorizationType.index,\n      authoritySeed: authoritySeed,\n      authorityOwner: toBuffer(authorityOwner.toBuffer())\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorityBase,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * @internal\n   */\n  static splitInstruction(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      lamports\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Split;\n    const data = encodeData(type, {\n      lamports\n    });\n    return new TransactionInstruction({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: splitStakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that splits Stake tokens into another stake account\n   */\n  static split(params,\n  // Compute the cost of allocating the new stake account in lamports\n  rentExemptReserve) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.authorizedPubkey,\n      newAccountPubkey: params.splitStakePubkey,\n      lamports: rentExemptReserve,\n      space: this.space,\n      programId: this.programId\n    }));\n    return transaction.add(this.splitInstruction(params));\n  }\n\n  /**\n   * Generate a Transaction that splits Stake tokens into another account\n   * derived from a base public key and seed\n   */\n  static splitWithSeed(params,\n  // If this stake account is new, compute the cost of allocating it in lamports\n  rentExemptReserve) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      basePubkey,\n      seed,\n      lamports\n    } = params;\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.allocate({\n      accountPubkey: splitStakePubkey,\n      basePubkey,\n      seed,\n      space: this.space,\n      programId: this.programId\n    }));\n    if (rentExemptReserve && rentExemptReserve > 0) {\n      transaction.add(SystemProgram.transfer({\n        fromPubkey: params.authorizedPubkey,\n        toPubkey: splitStakePubkey,\n        lamports: rentExemptReserve\n      }));\n    }\n    return transaction.add(this.splitInstruction({\n      stakePubkey,\n      authorizedPubkey,\n      splitStakePubkey,\n      lamports\n    }));\n  }\n\n  /**\n   * Generate a Transaction that merges Stake accounts.\n   */\n  static merge(params) {\n    const {\n      stakePubkey,\n      sourceStakePubKey,\n      authorizedPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Merge;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: sourceStakePubKey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that withdraws deactivated Stake tokens.\n   */\n  static withdraw(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey,\n      toPubkey,\n      lamports,\n      custodianPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Withdraw;\n    const data = encodeData(type, {\n      lamports\n    });\n    const keys = [{\n      pubkey: stakePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: toPubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: SYSVAR_STAKE_HISTORY_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    if (custodianPubkey) {\n      keys.push({\n        pubkey: custodianPubkey,\n        isSigner: true,\n        isWritable: false\n      });\n    }\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a Transaction that deactivates Stake tokens.\n   */\n  static deactivate(params) {\n    const {\n      stakePubkey,\n      authorizedPubkey\n    } = params;\n    const type = STAKE_INSTRUCTION_LAYOUTS.Deactivate;\n    const data = encodeData(type);\n    return new Transaction().add({\n      keys: [{\n        pubkey: stakePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: authorizedPubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    });\n  }\n}\nStakeProgram.programId = new PublicKey('Stake11111111111111111111111111111111111111');\n/**\n * Max space of a Stake account\n *\n * This is generated from the solana-stake-program StakeState struct as\n * `StakeStateV2::size_of()`:\n * https://docs.rs/solana-stake-program/latest/solana_stake_program/stake_state/enum.StakeStateV2.html\n */\nStakeProgram.space = 200;\n\n/**\n * Vote account info\n */\nclass VoteInit {\n  /** [0, 100] */\n\n  constructor(nodePubkey, authorizedVoter, authorizedWithdrawer, commission) {\n    this.nodePubkey = void 0;\n    this.authorizedVoter = void 0;\n    this.authorizedWithdrawer = void 0;\n    this.commission = void 0;\n    this.nodePubkey = nodePubkey;\n    this.authorizedVoter = authorizedVoter;\n    this.authorizedWithdrawer = authorizedWithdrawer;\n    this.commission = commission;\n  }\n}\n\n/**\n * Create vote account transaction params\n */\n\n/**\n * InitializeAccount instruction params\n */\n\n/**\n * Authorize instruction params\n */\n\n/**\n * AuthorizeWithSeed instruction params\n */\n\n/**\n * Withdraw from vote account transaction params\n */\n\n/**\n * Update validator identity (node pubkey) vote account instruction params.\n */\n\n/**\n * Vote Instruction class\n */\nclass VoteInstruction {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Decode a vote instruction and retrieve the instruction type.\n   */\n  static decodeInstructionType(instruction) {\n    this.checkProgramId(instruction.programId);\n    const instructionTypeLayout = Layout.u32('instruction');\n    const typeIndex = instructionTypeLayout.decode(instruction.data);\n    let type;\n    for (const [ixType, layout] of Object.entries(VOTE_INSTRUCTION_LAYOUTS)) {\n      if (layout.index == typeIndex) {\n        type = ixType;\n        break;\n      }\n    }\n    if (!type) {\n      throw new Error('Instruction type incorrect; not a VoteInstruction');\n    }\n    return type;\n  }\n\n  /**\n   * Decode an initialize vote instruction and retrieve the instruction params.\n   */\n  static decodeInitializeAccount(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 4);\n    const {\n      voteInit\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.InitializeAccount, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      nodePubkey: instruction.keys[3].pubkey,\n      voteInit: new VoteInit(new PublicKey(voteInit.nodePubkey), new PublicKey(voteInit.authorizedVoter), new PublicKey(voteInit.authorizedWithdrawer), voteInit.commission)\n    };\n  }\n\n  /**\n   * Decode an authorize instruction and retrieve the instruction params.\n   */\n  static decodeAuthorize(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      newAuthorized,\n      voteAuthorizationType\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.Authorize, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      authorizedPubkey: instruction.keys[2].pubkey,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      voteAuthorizationType: {\n        index: voteAuthorizationType\n      }\n    };\n  }\n\n  /**\n   * Decode an authorize instruction and retrieve the instruction params.\n   */\n  static decodeAuthorizeWithSeed(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      voteAuthorizeWithSeedArgs: {\n        currentAuthorityDerivedKeyOwnerPubkey,\n        currentAuthorityDerivedKeySeed,\n        newAuthorized,\n        voteAuthorizationType\n      }\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed, instruction.data);\n    return {\n      currentAuthorityDerivedKeyBasePubkey: instruction.keys[2].pubkey,\n      currentAuthorityDerivedKeyOwnerPubkey: new PublicKey(currentAuthorityDerivedKeyOwnerPubkey),\n      currentAuthorityDerivedKeySeed: currentAuthorityDerivedKeySeed,\n      newAuthorizedPubkey: new PublicKey(newAuthorized),\n      voteAuthorizationType: {\n        index: voteAuthorizationType\n      },\n      votePubkey: instruction.keys[0].pubkey\n    };\n  }\n\n  /**\n   * Decode a withdraw instruction and retrieve the instruction params.\n   */\n  static decodeWithdraw(instruction) {\n    this.checkProgramId(instruction.programId);\n    this.checkKeyLength(instruction.keys, 3);\n    const {\n      lamports\n    } = decodeData$1(VOTE_INSTRUCTION_LAYOUTS.Withdraw, instruction.data);\n    return {\n      votePubkey: instruction.keys[0].pubkey,\n      authorizedWithdrawerPubkey: instruction.keys[2].pubkey,\n      lamports,\n      toPubkey: instruction.keys[1].pubkey\n    };\n  }\n\n  /**\n   * @internal\n   */\n  static checkProgramId(programId) {\n    if (!programId.equals(VoteProgram.programId)) {\n      throw new Error('invalid instruction; programId is not VoteProgram');\n    }\n  }\n\n  /**\n   * @internal\n   */\n  static checkKeyLength(keys, expectedLength) {\n    if (keys.length < expectedLength) {\n      throw new Error(`invalid instruction; found ${keys.length} keys, expected at least ${expectedLength}`);\n    }\n  }\n}\n\n/**\n * An enumeration of valid VoteInstructionType's\n */\n\n/** @internal */\n\nconst VOTE_INSTRUCTION_LAYOUTS = Object.freeze({\n  InitializeAccount: {\n    index: 0,\n    layout: Layout.struct([Layout.u32('instruction'), voteInit()])\n  },\n  Authorize: {\n    index: 1,\n    layout: Layout.struct([Layout.u32('instruction'), publicKey('newAuthorized'), Layout.u32('voteAuthorizationType')])\n  },\n  Withdraw: {\n    index: 3,\n    layout: Layout.struct([Layout.u32('instruction'), Layout.ns64('lamports')])\n  },\n  UpdateValidatorIdentity: {\n    index: 4,\n    layout: Layout.struct([Layout.u32('instruction')])\n  },\n  AuthorizeWithSeed: {\n    index: 10,\n    layout: Layout.struct([Layout.u32('instruction'), voteAuthorizeWithSeedArgs()])\n  }\n});\n\n/**\n * VoteAuthorize type\n */\n\n/**\n * An enumeration of valid VoteAuthorization layouts.\n */\nconst VoteAuthorizationLayout = Object.freeze({\n  Voter: {\n    index: 0\n  },\n  Withdrawer: {\n    index: 1\n  }\n});\n\n/**\n * Factory class for transactions to interact with the Vote program\n */\nclass VoteProgram {\n  /**\n   * @internal\n   */\n  constructor() {}\n\n  /**\n   * Public key that identifies the Vote program\n   */\n\n  /**\n   * Generate an Initialize instruction.\n   */\n  static initializeAccount(params) {\n    const {\n      votePubkey,\n      nodePubkey,\n      voteInit\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.InitializeAccount;\n    const data = encodeData(type, {\n      voteInit: {\n        nodePubkey: toBuffer(voteInit.nodePubkey.toBuffer()),\n        authorizedVoter: toBuffer(voteInit.authorizedVoter.toBuffer()),\n        authorizedWithdrawer: toBuffer(voteInit.authorizedWithdrawer.toBuffer()),\n        commission: voteInit.commission\n      }\n    });\n    const instructionData = {\n      keys: [{\n        pubkey: votePubkey,\n        isSigner: false,\n        isWritable: true\n      }, {\n        pubkey: SYSVAR_RENT_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: SYSVAR_CLOCK_PUBKEY,\n        isSigner: false,\n        isWritable: false\n      }, {\n        pubkey: nodePubkey,\n        isSigner: true,\n        isWritable: false\n      }],\n      programId: this.programId,\n      data\n    };\n    return new TransactionInstruction(instructionData);\n  }\n\n  /**\n   * Generate a transaction that creates a new Vote account.\n   */\n  static createAccount(params) {\n    const transaction = new Transaction();\n    transaction.add(SystemProgram.createAccount({\n      fromPubkey: params.fromPubkey,\n      newAccountPubkey: params.votePubkey,\n      lamports: params.lamports,\n      space: this.space,\n      programId: this.programId\n    }));\n    return transaction.add(this.initializeAccount({\n      votePubkey: params.votePubkey,\n      nodePubkey: params.voteInit.nodePubkey,\n      voteInit: params.voteInit\n    }));\n  }\n\n  /**\n   * Generate a transaction that authorizes a new Voter or Withdrawer on the Vote account.\n   */\n  static authorize(params) {\n    const {\n      votePubkey,\n      authorizedPubkey,\n      newAuthorizedPubkey,\n      voteAuthorizationType\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.Authorize;\n    const data = encodeData(type, {\n      newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n      voteAuthorizationType: voteAuthorizationType.index\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: authorizedPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction that authorizes a new Voter or Withdrawer on the Vote account\n   * where the current Voter or Withdrawer authority is a derived key.\n   */\n  static authorizeWithSeed(params) {\n    const {\n      currentAuthorityDerivedKeyBasePubkey,\n      currentAuthorityDerivedKeyOwnerPubkey,\n      currentAuthorityDerivedKeySeed,\n      newAuthorizedPubkey,\n      voteAuthorizationType,\n      votePubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.AuthorizeWithSeed;\n    const data = encodeData(type, {\n      voteAuthorizeWithSeedArgs: {\n        currentAuthorityDerivedKeyOwnerPubkey: toBuffer(currentAuthorityDerivedKeyOwnerPubkey.toBuffer()),\n        currentAuthorityDerivedKeySeed: currentAuthorityDerivedKeySeed,\n        newAuthorized: toBuffer(newAuthorizedPubkey.toBuffer()),\n        voteAuthorizationType: voteAuthorizationType.index\n      }\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: SYSVAR_CLOCK_PUBKEY,\n      isSigner: false,\n      isWritable: false\n    }, {\n      pubkey: currentAuthorityDerivedKeyBasePubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction to withdraw from a Vote account.\n   */\n  static withdraw(params) {\n    const {\n      votePubkey,\n      authorizedWithdrawerPubkey,\n      lamports,\n      toPubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.Withdraw;\n    const data = encodeData(type, {\n      lamports\n    });\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: toPubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: authorizedWithdrawerPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n\n  /**\n   * Generate a transaction to withdraw safely from a Vote account.\n   *\n   * This function was created as a safeguard for vote accounts running validators, `safeWithdraw`\n   * checks that the withdraw amount will not exceed the specified balance while leaving enough left\n   * to cover rent. If you wish to close the vote account by withdrawing the full amount, call the\n   * `withdraw` method directly.\n   */\n  static safeWithdraw(params, currentVoteAccountBalance, rentExemptMinimum) {\n    if (params.lamports > currentVoteAccountBalance - rentExemptMinimum) {\n      throw new Error('Withdraw will leave vote account with insufficient funds.');\n    }\n    return VoteProgram.withdraw(params);\n  }\n\n  /**\n   * Generate a transaction to update the validator identity (node pubkey) of a Vote account.\n   */\n  static updateValidatorIdentity(params) {\n    const {\n      votePubkey,\n      authorizedWithdrawerPubkey,\n      nodePubkey\n    } = params;\n    const type = VOTE_INSTRUCTION_LAYOUTS.UpdateValidatorIdentity;\n    const data = encodeData(type);\n    const keys = [{\n      pubkey: votePubkey,\n      isSigner: false,\n      isWritable: true\n    }, {\n      pubkey: nodePubkey,\n      isSigner: true,\n      isWritable: false\n    }, {\n      pubkey: authorizedWithdrawerPubkey,\n      isSigner: true,\n      isWritable: false\n    }];\n    return new Transaction().add({\n      keys,\n      programId: this.programId,\n      data\n    });\n  }\n}\nVoteProgram.programId = new PublicKey('Vote111111111111111111111111111111111111111');\n/**\n * Max space of a Vote account\n *\n * This is generated from the solana-vote-program VoteState struct as\n * `VoteState::size_of()`:\n * https://docs.rs/solana-vote-program/1.9.5/solana_vote_program/vote_state/struct.VoteState.html#method.size_of\n *\n * KEEP IN SYNC WITH `VoteState::size_of()` in https://github.com/solana-labs/solana/blob/a474cb24b9238f5edcc982f65c0b37d4a1046f7e/sdk/program/src/vote/state/mod.rs#L340-L342\n */\nVoteProgram.space = 3762;\n\nconst VALIDATOR_INFO_KEY = new PublicKey('Va1idator1nfo111111111111111111111111111111');\n\n/**\n * @internal\n */\n\n/**\n * Info used to identity validators.\n */\n\nconst InfoString = type({\n  name: string(),\n  website: optional(string()),\n  details: optional(string()),\n  iconUrl: optional(string()),\n  keybaseUsername: optional(string())\n});\n\n/**\n * ValidatorInfo class\n */\nclass ValidatorInfo {\n  /**\n   * Construct a valid ValidatorInfo\n   *\n   * @param key validator public key\n   * @param info validator information\n   */\n  constructor(key, info) {\n    /**\n     * validator public key\n     */\n    this.key = void 0;\n    /**\n     * validator information\n     */\n    this.info = void 0;\n    this.key = key;\n    this.info = info;\n  }\n\n  /**\n   * Deserialize ValidatorInfo from the config account data. Exactly two config\n   * keys are required in the data.\n   *\n   * @param buffer config account data\n   * @return null if info was not found\n   */\n  static fromConfigData(buffer) {\n    let byteArray = [...buffer];\n    const configKeyCount = decodeLength(byteArray);\n    if (configKeyCount !== 2) return null;\n    const configKeys = [];\n    for (let i = 0; i < 2; i++) {\n      const publicKey = new PublicKey(guardedSplice(byteArray, 0, PUBLIC_KEY_LENGTH));\n      const isSigner = guardedShift(byteArray) === 1;\n      configKeys.push({\n        publicKey,\n        isSigner\n      });\n    }\n    if (configKeys[0].publicKey.equals(VALIDATOR_INFO_KEY)) {\n      if (configKeys[1].isSigner) {\n        const rawInfo = rustString().decode(node_modules_buffer.Buffer.from(byteArray));\n        const info = JSON.parse(rawInfo);\n        assert(info, InfoString);\n        return new ValidatorInfo(configKeys[1].publicKey, info);\n      }\n    }\n    return null;\n  }\n}\n\nconst VOTE_PROGRAM_ID = new PublicKey('Vote111111111111111111111111111111111111111');\n\n/**\n * History of how many credits earned by the end of each epoch\n */\n\n/**\n * See https://github.com/solana-labs/solana/blob/8a12ed029cfa38d4a45400916c2463fb82bbec8c/programs/vote_api/src/vote_state.rs#L68-L88\n *\n * @internal\n */\nconst VoteAccountLayout = Layout.struct([publicKey('nodePubkey'), publicKey('authorizedWithdrawer'), Layout.u8('commission'), Layout.nu64(),\n// votes.length\nLayout.seq(Layout.struct([Layout.nu64('slot'), Layout.u32('confirmationCount')]), Layout.offset(Layout.u32(), -8), 'votes'), Layout.u8('rootSlotValid'), Layout.nu64('rootSlot'), Layout.nu64(),\n// authorizedVoters.length\nLayout.seq(Layout.struct([Layout.nu64('epoch'), publicKey('authorizedVoter')]), Layout.offset(Layout.u32(), -8), 'authorizedVoters'), Layout.struct([Layout.seq(Layout.struct([publicKey('authorizedPubkey'), Layout.nu64('epochOfLastAuthorizedSwitch'), Layout.nu64('targetEpoch')]), 32, 'buf'), Layout.nu64('idx'), Layout.u8('isEmpty')], 'priorVoters'), Layout.nu64(),\n// epochCredits.length\nLayout.seq(Layout.struct([Layout.nu64('epoch'), Layout.nu64('credits'), Layout.nu64('prevCredits')]), Layout.offset(Layout.u32(), -8), 'epochCredits'), Layout.struct([Layout.nu64('slot'), Layout.nu64('timestamp')], 'lastTimestamp')]);\n/**\n * VoteAccount class\n */\nclass VoteAccount {\n  /**\n   * @internal\n   */\n  constructor(args) {\n    this.nodePubkey = void 0;\n    this.authorizedWithdrawer = void 0;\n    this.commission = void 0;\n    this.rootSlot = void 0;\n    this.votes = void 0;\n    this.authorizedVoters = void 0;\n    this.priorVoters = void 0;\n    this.epochCredits = void 0;\n    this.lastTimestamp = void 0;\n    this.nodePubkey = args.nodePubkey;\n    this.authorizedWithdrawer = args.authorizedWithdrawer;\n    this.commission = args.commission;\n    this.rootSlot = args.rootSlot;\n    this.votes = args.votes;\n    this.authorizedVoters = args.authorizedVoters;\n    this.priorVoters = args.priorVoters;\n    this.epochCredits = args.epochCredits;\n    this.lastTimestamp = args.lastTimestamp;\n  }\n\n  /**\n   * Deserialize VoteAccount from the account data.\n   *\n   * @param buffer account data\n   * @return VoteAccount\n   */\n  static fromAccountData(buffer) {\n    const versionOffset = 4;\n    const va = VoteAccountLayout.decode(toBuffer(buffer), versionOffset);\n    let rootSlot = va.rootSlot;\n    if (!va.rootSlotValid) {\n      rootSlot = null;\n    }\n    return new VoteAccount({\n      nodePubkey: new PublicKey(va.nodePubkey),\n      authorizedWithdrawer: new PublicKey(va.authorizedWithdrawer),\n      commission: va.commission,\n      votes: va.votes,\n      rootSlot,\n      authorizedVoters: va.authorizedVoters.map(parseAuthorizedVoter),\n      priorVoters: getPriorVoters(va.priorVoters),\n      epochCredits: va.epochCredits,\n      lastTimestamp: va.lastTimestamp\n    });\n  }\n}\nfunction parseAuthorizedVoter({\n  authorizedVoter,\n  epoch\n}) {\n  return {\n    epoch,\n    authorizedVoter: new PublicKey(authorizedVoter)\n  };\n}\nfunction parsePriorVoters({\n  authorizedPubkey,\n  epochOfLastAuthorizedSwitch,\n  targetEpoch\n}) {\n  return {\n    authorizedPubkey: new PublicKey(authorizedPubkey),\n    epochOfLastAuthorizedSwitch,\n    targetEpoch\n  };\n}\nfunction getPriorVoters({\n  buf,\n  idx,\n  isEmpty\n}) {\n  if (isEmpty) {\n    return [];\n  }\n  return [...buf.slice(idx + 1).map(parsePriorVoters), ...buf.slice(0, idx).map(parsePriorVoters)];\n}\n\nconst endpoint = {\n  http: {\n    devnet: 'http://api.devnet.solana.com',\n    testnet: 'http://api.testnet.solana.com',\n    'mainnet-beta': 'http://api.mainnet-beta.solana.com/'\n  },\n  https: {\n    devnet: 'https://api.devnet.solana.com',\n    testnet: 'https://api.testnet.solana.com',\n    'mainnet-beta': 'https://api.mainnet-beta.solana.com/'\n  }\n};\n/**\n * Retrieves the RPC API URL for the specified cluster\n * @param {Cluster} [cluster=\"devnet\"] - The cluster name of the RPC API URL to use. Possible options: 'devnet' | 'testnet' | 'mainnet-beta'\n * @param {boolean} [tls=\"http\"] - Use TLS when connecting to cluster.\n *\n * @returns {string} URL string of the RPC endpoint\n */\nfunction clusterApiUrl(cluster, tls) {\n  const key = tls === false ? 'http' : 'https';\n  if (!cluster) {\n    return endpoint[key]['devnet'];\n  }\n  const url = endpoint[key][cluster];\n  if (!url) {\n    throw new Error(`Unknown ${key} cluster: ${cluster}`);\n  }\n  return url;\n}\n\n/**\n * Send and confirm a raw transaction\n *\n * If `commitment` option is not specified, defaults to 'max' commitment.\n *\n * @param {Connection} connection\n * @param {Buffer} rawTransaction\n * @param {TransactionConfirmationStrategy} confirmationStrategy\n * @param {ConfirmOptions} [options]\n * @returns {Promise<TransactionSignature>}\n */\n\n/**\n * @deprecated Calling `sendAndConfirmRawTransaction()` without a `confirmationStrategy`\n * is no longer supported and will be removed in a future version.\n */\n// eslint-disable-next-line no-redeclare\n\n// eslint-disable-next-line no-redeclare\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, confirmationStrategyOrConfirmOptions, maybeConfirmOptions) {\n  let confirmationStrategy;\n  let options;\n  if (confirmationStrategyOrConfirmOptions && Object.prototype.hasOwnProperty.call(confirmationStrategyOrConfirmOptions, 'lastValidBlockHeight')) {\n    confirmationStrategy = confirmationStrategyOrConfirmOptions;\n    options = maybeConfirmOptions;\n  } else if (confirmationStrategyOrConfirmOptions && Object.prototype.hasOwnProperty.call(confirmationStrategyOrConfirmOptions, 'nonceValue')) {\n    confirmationStrategy = confirmationStrategyOrConfirmOptions;\n    options = maybeConfirmOptions;\n  } else {\n    options = confirmationStrategyOrConfirmOptions;\n  }\n  const sendOptions = options && {\n    skipPreflight: options.skipPreflight,\n    preflightCommitment: options.preflightCommitment || options.commitment,\n    minContextSlot: options.minContextSlot\n  };\n  const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n  const commitment = options && options.commitment;\n  const confirmationPromise = confirmationStrategy ? connection.confirmTransaction(confirmationStrategy, commitment) : connection.confirmTransaction(signature, commitment);\n  const status = (await confirmationPromise).value;\n  if (status.err) {\n    if (signature != null) {\n      throw new SendTransactionError({\n        action: sendOptions?.skipPreflight ? 'send' : 'simulate',\n        signature: signature,\n        transactionMessage: `Status: (${JSON.stringify(status)})`\n      });\n    }\n    throw new Error(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n  }\n  return signature;\n}\n\n/**\n * There are 1-billion lamports in one SOL\n */\nconst LAMPORTS_PER_SOL = 1000000000;\n\n\n//# sourceMappingURL=index.browser.esm.js.map\n\n\n/***/ }),\n\n/***/ 11:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar basex = __webpack_require__(8162)\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 7658:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.MAX_U256 = exports.MAX_U64 = exports.Rounding = exports.TEN = exports.ONE = exports.ZERO = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst jsbi_1 = tslib_1.__importDefault(__webpack_require__(9499));\n/**\n * Zero bigint.\n */\nexports.ZERO = jsbi_1.default.BigInt(0);\n/**\n * One bigint.\n */\nexports.ONE = jsbi_1.default.BigInt(1);\n/**\n * 10 bigint.\n */\nexports.TEN = jsbi_1.default.BigInt(10);\nvar Rounding;\n(function (Rounding) {\n    Rounding[Rounding[\"ROUND_DOWN\"] = 0] = \"ROUND_DOWN\";\n    Rounding[Rounding[\"ROUND_HALF_UP\"] = 1] = \"ROUND_HALF_UP\";\n    Rounding[Rounding[\"ROUND_UP\"] = 2] = \"ROUND_UP\";\n})(Rounding = exports.Rounding || (exports.Rounding = {}));\nexports.MAX_U64 = jsbi_1.default.BigInt(\"0xffffffffffffffff\");\nexports.MAX_U256 = jsbi_1.default.BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n//# sourceMappingURL=constants.js.map\n\n/***/ }),\n\n/***/ 1762:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/*\n *  toFormat v2.0.0\n *  Adds a toFormat instance method to big.js or decimal.js\n *  Copyright (c) 2017 Michael Mclaughlin\n *  MIT Licence\n */\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.formatBig = exports.formatDecimal = exports.DEFAULT_DISPLAY_NUMBER_FORMAT = exports.DEFAULT_NUMBER_FORMAT = exports.toSignificantRounding = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst big_js_1 = tslib_1.__importDefault(__webpack_require__(3302));\nconst decimal_js_light_1 = tslib_1.__importDefault(__webpack_require__(9887));\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst constants_js_1 = __webpack_require__(7658);\nexports.toSignificantRounding = {\n    [constants_js_1.Rounding.ROUND_DOWN]: decimal_js_light_1.default.ROUND_DOWN,\n    [constants_js_1.Rounding.ROUND_HALF_UP]: decimal_js_light_1.default.ROUND_HALF_UP,\n    [constants_js_1.Rounding.ROUND_UP]: decimal_js_light_1.default.ROUND_UP,\n};\nconst toFixedRounding = {\n    [constants_js_1.Rounding.ROUND_DOWN]: big_js_1.default.roundDown,\n    [constants_js_1.Rounding.ROUND_HALF_UP]: big_js_1.default.roundHalfUp,\n    [constants_js_1.Rounding.ROUND_UP]: big_js_1.default.roundUp,\n};\n/**\n * Default number format. (no grouping)\n */\nexports.DEFAULT_NUMBER_FORMAT = {\n    decimalSeparator: \".\",\n    groupSeparator: \"\",\n    groupSize: 3,\n    rounding: constants_js_1.Rounding.ROUND_DOWN,\n};\n/**\n * Default number format display.\n */\nexports.DEFAULT_DISPLAY_NUMBER_FORMAT = {\n    ...exports.DEFAULT_NUMBER_FORMAT,\n    groupSeparator: \",\",\n};\nconst formatNum = (num, isNegative, roundingMethod, decimalPlaces, { decimalSeparator = exports.DEFAULT_NUMBER_FORMAT.decimalSeparator, groupSeparator = exports.DEFAULT_NUMBER_FORMAT.groupSeparator, groupSize = exports.DEFAULT_NUMBER_FORMAT.groupSize, rounding = exports.DEFAULT_NUMBER_FORMAT.rounding, } = exports.DEFAULT_NUMBER_FORMAT) => {\n    const decInternal = num;\n    if (!decInternal.e && decInternal.e !== 0) {\n        return num.toString(); // Infinity/NaN\n    }\n    const [integerPart, fractionPart] = num\n        .toFixed(decimalPlaces, roundingMethod === \"fixed\"\n        ? toFixedRounding[rounding]\n        : exports.toSignificantRounding[rounding])\n        .split(\".\");\n    (0, tiny_invariant_1.default)(integerPart);\n    let displayIntegerPart = integerPart;\n    if (groupSeparator) {\n        // integer digits\n        const intd = isNegative ? integerPart.slice(1) : integerPart;\n        // number of integer digits\n        const nd = intd.length;\n        if (groupSize > 0 && nd > 0) {\n            let i = nd % groupSize || groupSize;\n            displayIntegerPart = intd.slice(0, i);\n            for (; i < nd; i += groupSize) {\n                displayIntegerPart += groupSeparator + intd.slice(i, i + groupSize);\n            }\n            if (isNegative) {\n                displayIntegerPart = \"-\" + displayIntegerPart;\n            }\n        }\n    }\n    if (fractionPart) {\n        return displayIntegerPart + (decimalSeparator !== null && decimalSeparator !== void 0 ? decimalSeparator : \"\") + fractionPart;\n    }\n    else {\n        return displayIntegerPart;\n    }\n};\n/*\n *  Returns a string representing the value of this big number in fixed-point notation to `dp`\n *  decimal places using rounding mode `rm`, and formatted according to the properties of the\n * `fmt`, `this.format` and `this.constructor.format` objects, in that order of precedence.\n *\n *  Example:\n *\n *  x = new Decimal('123456789.987654321')\n *\n *  // Add a format object to the constructor...\n *  Decimal.format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ',',\n *    groupSize: 3,\n *    secondaryGroupSize: 0,\n *    fractionGroupSeparator: '',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 0\n *  }\n *\n *  x.toFormat();                // 123,456,789.987654321\n *  x.toFormat(2, 1);            // 123,456,789.98\n *\n *  // And/or add a format object to the big number itself...\n *  x.format = {\n *    decimalSeparator: ',',\n *    groupSeparator: '',\n *  }\n *\n *  x.toFormat();                // 123456789,987654321\n *\n *  format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ' ',\n *    groupSize: 3,\n *    fractionGroupSeparator: ' ',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 5\n *  }\n *  // And/or pass a format object to the method call.\n *  x.toFormat(format);          // 123 456 789.98765 4321\n *  x.toFormat(4, format);       // 123 456 789.9877\n *  x.toFormat(2, 1, format);    // 123 456 789.98\n *\n *  [dp] {number} Decimal places. Integer.\n *  [rm] {number} Rounding mode. Integer, 0 to 8. (Ignored if using big.js.)\n *  [fmt] {Object} A format object.\n *\n */\nconst formatDecimal = (dec, decimalPlaces, fmt = exports.DEFAULT_NUMBER_FORMAT) => {\n    return formatNum(dec, dec.isNegative(), \"significant\", decimalPlaces, fmt);\n};\nexports.formatDecimal = formatDecimal;\n/*\n *  Returns a string representing the value of this big number in fixed-point notation to `dp`\n *  decimal places using rounding mode `rm`, and formatted according to the properties of the\n * `fmt`, `this.format` and `this.constructor.format` objects, in that order of precedence.\n *\n *  Example:\n *\n *  x = new Decimal('123456789.987654321')\n *\n *  // Add a format object to the constructor...\n *  Decimal.format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ',',\n *    groupSize: 3,\n *    secondaryGroupSize: 0,\n *    fractionGroupSeparator: '',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 0\n *  }\n *\n *  x.toFormat();                // 123,456,789.987654321\n *  x.toFormat(2, 1);            // 123,456,789.98\n *\n *  // And/or add a format object to the big number itself...\n *  x.format = {\n *    decimalSeparator: ',',\n *    groupSeparator: '',\n *  }\n *\n *  x.toFormat();                // 123456789,987654321\n *\n *  format = {\n *    decimalSeparator: '.',\n *    groupSeparator: ' ',\n *    groupSize: 3,\n *    fractionGroupSeparator: ' ',     // '\\xA0' non-breaking space\n *    fractionGroupSize : 5\n *  }\n *  // And/or pass a format object to the method call.\n *  x.toFormat(format);          // 123 456 789.98765 4321\n *  x.toFormat(4, format);       // 123 456 789.9877\n *  x.toFormat(2, 1, format);    // 123 456 789.98\n *\n *  [dp] {number} Decimal places. Integer.\n *  [rm] {number} Rounding mode. Integer, 0 to 8. (Ignored if using big.js.)\n *  [fmt] {Object} A format object.\n *\n */\nconst formatBig = (big, decimalPlaces, fmt = exports.DEFAULT_NUMBER_FORMAT) => {\n    return formatNum(big, big.s === -1, \"fixed\", decimalPlaces, fmt);\n};\nexports.formatBig = formatBig;\n//# sourceMappingURL=format.js.map\n\n/***/ }),\n\n/***/ 7646:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Fraction = exports.fractionFromObject = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst big_js_1 = tslib_1.__importDefault(__webpack_require__(3302));\nconst decimal_js_light_1 = tslib_1.__importDefault(__webpack_require__(9887));\nconst jsbi_1 = tslib_1.__importDefault(__webpack_require__(9499));\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst constants_js_1 = __webpack_require__(7658);\nconst format_js_1 = __webpack_require__(1762);\nconst utils_js_1 = __webpack_require__(8872);\n/**\n * Attempts to parse a {@link Fraction}.\n * @param fractionish Fraction or BigintIsh.\n * @returns\n */\nconst tryParseFraction = (fractionish) => {\n    if (Fraction.isFraction(fractionish)) {\n        return fractionish;\n    }\n    try {\n        return new Fraction((0, utils_js_1.parseBigintIsh)(fractionish));\n    }\n    catch (e) {\n        if (e instanceof Error) {\n            throw new Error(`Could not parse fraction: ${e.message}`);\n        }\n        throw new Error(`Could not parse fraction`);\n    }\n};\n/**\n * Creates a {@link Fraction} from a {@link FractionObject}.\n * @param param0\n * @returns\n */\nconst fractionFromObject = ({ numeratorStr, denominatorStr, }) => {\n    return new Fraction(numeratorStr, denominatorStr);\n};\nexports.fractionFromObject = fractionFromObject;\n/**\n * Number with an integer numerator and denominator.\n */\nclass Fraction {\n    constructor(numerator, denominator = constants_js_1.ONE) {\n        this.isFraction = true;\n        this.numerator = (0, utils_js_1.parseBigintIsh)(numerator);\n        this.denominator = (0, utils_js_1.parseBigintIsh)(denominator);\n    }\n    get numeratorStr() {\n        return this.numerator.toString();\n    }\n    get denominatorStr() {\n        return this.numerator.toString();\n    }\n    /**\n     * Ensures the other object is of this {@link Fraction} type.\n     * @param other\n     * @returns\n     */\n    static fromObject(other) {\n        if (other instanceof Fraction) {\n            return other;\n        }\n        return (0, exports.fractionFromObject)(other);\n    }\n    /**\n     * JSON representation of the {@link Fraction}.\n     */\n    toJSON() {\n        return {\n            isFraction: true,\n            numeratorStr: this.numerator.toString(),\n            denominatorStr: this.denominator.toString(),\n        };\n    }\n    /**\n     * Returns true if the other object is a {@link Fraction}.\n     *\n     * @param other\n     * @returns\n     */\n    static isFraction(other) {\n        return (typeof other === \"object\" &&\n            other !== null &&\n            \"numerator\" in other &&\n            \"denominator\" in other);\n    }\n    /**\n     * Compares this {@link Fraction} to the other {@link Fraction}.\n     */\n    compareTo(other) {\n        if (this.equalTo(other)) {\n            return 0;\n        }\n        return this.greaterThan(other) ? 1 : -1;\n    }\n    /**\n     * Parses a {@link Fraction} from a float.\n     * @param number Number to parse.\n     * @param decimals Number of decimals of precision. (default 10)\n     * @returns Fraction\n     */\n    static fromNumber(number, decimals = 10) {\n        const multiplier = Math.pow(10, decimals);\n        return new Fraction(Math.floor(number * multiplier), multiplier);\n    }\n    /**\n     * Performs floor division.\n     */\n    get quotient() {\n        return jsbi_1.default.divide(this.numerator, this.denominator);\n    }\n    /**\n     * Remainder after floor division.\n     */\n    get remainder() {\n        return new Fraction(jsbi_1.default.remainder(this.numerator, this.denominator), this.denominator);\n    }\n    /**\n     * Swaps the numerator and denominator of the {@link Fraction}.\n     * @returns\n     */\n    invert() {\n        return new Fraction(this.denominator, this.numerator);\n    }\n    add(other) {\n        const otherParsed = tryParseFraction(other);\n        if (jsbi_1.default.equal(this.denominator, otherParsed.denominator)) {\n            return new Fraction(jsbi_1.default.add(this.numerator, otherParsed.numerator), this.denominator);\n        }\n        return new Fraction(jsbi_1.default.add(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator)), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    subtract(other) {\n        const otherParsed = tryParseFraction(other);\n        if (jsbi_1.default.equal(this.denominator, otherParsed.denominator)) {\n            return new Fraction(jsbi_1.default.subtract(this.numerator, otherParsed.numerator), this.denominator);\n        }\n        return new Fraction(jsbi_1.default.subtract(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator)), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    lessThan(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.lessThan(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    equalTo(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.equal(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    greaterThan(other) {\n        const otherParsed = tryParseFraction(other);\n        return jsbi_1.default.greaterThan(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(otherParsed.numerator, this.denominator));\n    }\n    multiply(other) {\n        const otherParsed = tryParseFraction(other);\n        return new Fraction(jsbi_1.default.multiply(this.numerator, otherParsed.numerator), jsbi_1.default.multiply(this.denominator, otherParsed.denominator));\n    }\n    /**\n     * Divides this {@link Fraction} by another {@link Fraction}.\n     */\n    divide(other) {\n        const otherParsed = tryParseFraction(other);\n        return new Fraction(jsbi_1.default.multiply(this.numerator, otherParsed.denominator), jsbi_1.default.multiply(this.denominator, otherParsed.numerator));\n    }\n    /**\n     * Converts this {@link Fraction} to a string with the specified significant digits.\n     * @param significantDigits\n     * @param format\n     * @param rounding\n     * @returns\n     */\n    toSignificant(significantDigits, format = { groupSeparator: \"\" }, rounding = constants_js_1.Rounding.ROUND_HALF_UP) {\n        (0, tiny_invariant_1.default)(Number.isInteger(significantDigits), `${significantDigits} is not an integer.`);\n        (0, tiny_invariant_1.default)(significantDigits > 0, `${significantDigits} is not positive.`);\n        decimal_js_light_1.default.set({\n            precision: significantDigits + 1,\n            rounding: format_js_1.toSignificantRounding[rounding],\n        });\n        const quotient = new decimal_js_light_1.default(this.numerator.toString())\n            .div(this.denominator.toString())\n            .toSignificantDigits(significantDigits);\n        return (0, format_js_1.formatDecimal)(quotient, quotient.decimalPlaces(), {\n            ...format,\n            rounding,\n        });\n    }\n    toFixed(decimalPlaces, format = { groupSeparator: \"\" }, rounding = constants_js_1.Rounding.ROUND_HALF_UP) {\n        (0, tiny_invariant_1.default)(Number.isInteger(decimalPlaces), `${decimalPlaces} is not an integer.`);\n        (0, tiny_invariant_1.default)(decimalPlaces >= 0, `${decimalPlaces} is negative.`);\n        return (0, format_js_1.formatBig)(new big_js_1.default(this.numerator.toString()).div(this.denominator.toString()), decimalPlaces, { ...format, rounding });\n    }\n    /**\n     * Helper method for converting any super class back to a fraction\n     */\n    get asFraction() {\n        return new Fraction(this.numerator, this.denominator);\n    }\n    /**\n     * Gets the value of this {@link Fraction} as a number.\n     */\n    get asNumber() {\n        if (jsbi_1.default.equal(this.denominator, constants_js_1.ZERO)) {\n            return jsbi_1.default.greaterThan(this.numerator, constants_js_1.ZERO)\n                ? Number.POSITIVE_INFINITY\n                : jsbi_1.default.lessThan(this.numerator, constants_js_1.ZERO)\n                    ? Number.NEGATIVE_INFINITY\n                    : Number.NaN;\n        }\n        const result = jsbi_1.default.toNumber(this.numerator) / jsbi_1.default.toNumber(this.denominator);\n        if (!Number.isNaN(result)) {\n            return result;\n        }\n        return parseFloat(this.toFixed(10));\n    }\n    /**\n     * Returns true if this number (the numerator) is equal to zero and the denominator is non-zero.\n     * @returns\n     */\n    isZero() {\n        return jsbi_1.default.EQ(this.numerator, constants_js_1.ZERO) && jsbi_1.default.NE(this.denominator, constants_js_1.ZERO);\n    }\n    /**\n     * Returns true if this number (the numerator) is not equal to zero.\n     * @returns\n     */\n    isNonZero() {\n        return !this.isZero();\n    }\n}\nexports.Fraction = Fraction;\nFraction.ZERO = new Fraction(0);\nFraction.ONE = new Fraction(1);\n//# sourceMappingURL=fraction.js.map\n\n/***/ }),\n\n/***/ 7111:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(7582);\ntslib_1.__exportStar(__webpack_require__(7658), exports);\ntslib_1.__exportStar(__webpack_require__(7646), exports);\ntslib_1.__exportStar(__webpack_require__(8476), exports);\ntslib_1.__exportStar(__webpack_require__(3726), exports);\ntslib_1.__exportStar(__webpack_require__(8097), exports);\ntslib_1.__exportStar(__webpack_require__(5998), exports);\ntslib_1.__exportStar(__webpack_require__(8872), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 8476:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Percent = void 0;\nconst fraction_js_1 = __webpack_require__(7646);\nconst ONE_HUNDRED = new fraction_js_1.Fraction(100);\n/**\n * Converts a fraction to a percent\n * @param fraction the fraction to convert\n */\nfunction toPercent(fraction) {\n    return new Percent(fraction.numerator, fraction.denominator);\n}\nclass Percent extends fraction_js_1.Fraction {\n    constructor() {\n        super(...arguments);\n        /**\n         * This boolean prevents a fraction from being interpreted as a Percent\n         */\n        this.isPercent = true;\n    }\n    /**\n     * Parses a {@link Percent} from a float.\n     * @param number Number to parse. (100% is 1.00)\n     * @param decimals Number of decimals of precision. (default 10)\n     * @returns Percent\n     */\n    static fromNumber(number, decimals = 10) {\n        const frac = fraction_js_1.Fraction.fromNumber(number, decimals);\n        return new Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Constructs an {@link Percent} from a {@link PercentObject}.\n     * @param other\n     * @returns\n     */\n    static fromObject(other) {\n        if (other instanceof Percent) {\n            return other;\n        }\n        return toPercent(fraction_js_1.Fraction.fromObject(other));\n    }\n    /**\n     * JSON representation of the {@link Percent}.\n     */\n    toJSON() {\n        return {\n            ...super.toJSON(),\n            isPercent: true,\n        };\n    }\n    /**\n     * Creates a {@link Percent} from a {@link Fraction}.\n     */\n    static fromFraction(fraction) {\n        return toPercent(fraction);\n    }\n    /**\n     * Parses a {@link Percent} from a given number of bps.\n     * @returns Percent\n     */\n    static fromBPS(bps) {\n        return new Percent(bps, 10000);\n    }\n    add(other) {\n        return toPercent(super.add(other));\n    }\n    subtract(other) {\n        return toPercent(super.subtract(other));\n    }\n    multiply(other) {\n        return toPercent(super.multiply(other));\n    }\n    divide(other) {\n        return toPercent(super.divide(other));\n    }\n    /**\n     * Swaps the numerator and denominator of the {@link Percent}.\n     * @returns\n     */\n    invert() {\n        return new Percent(this.denominator, this.numerator);\n    }\n    toSignificant(significantDigits = 5, format, rounding) {\n        return super\n            .multiply(ONE_HUNDRED)\n            .toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = 2, format, rounding) {\n        return super.multiply(ONE_HUNDRED).toFixed(decimalPlaces, format, rounding);\n    }\n    /**\n     * Returns true if the other object is a {@link Percent}.\n     *\n     * @param other\n     * @returns\n     */\n    static isPercent(other) {\n        return (fraction_js_1.Fraction.isFraction(other) &&\n            (other === null || other === void 0 ? void 0 : other.isPercent) === true);\n    }\n}\nexports.Percent = Percent;\n/**\n * Zero percent.\n */\nPercent.ZERO = new Percent(0);\n/**\n * 1%\n */\nPercent.ONE = new Percent(1, 100);\n/**\n * 100% (1/1)\n */\nPercent.ONE_HUNDRED = new Percent(1);\n//# sourceMappingURL=percent.js.map\n\n/***/ }),\n\n/***/ 3726:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Price = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst fraction_js_1 = __webpack_require__(7646);\nconst utils_js_1 = __webpack_require__(8872);\nclass Price extends fraction_js_1.Fraction {\n    /**\n     * Constructs a Price.\n     *\n     * denominator and numerator _must_ be raw, i.e. in the native representation\n     *\n     * @param denominator Units of base currency. E.g. 1 BTC would be 1_00000000\n     * @param numerator Units of quote currency. E.g. $30k at 6 decimals would be 30_000_000000\n     */\n    constructor(baseCurrency, quoteCurrency, denominator, numerator) {\n        super((0, utils_js_1.parseBigintIsh)(numerator), (0, utils_js_1.parseBigintIsh)(denominator));\n        this.baseCurrency = baseCurrency;\n        this.quoteCurrency = quoteCurrency;\n        this.scalar = new fraction_js_1.Fraction((0, utils_js_1.makeDecimalMultiplier)(baseCurrency.decimals), (0, utils_js_1.makeDecimalMultiplier)(quoteCurrency.decimals));\n    }\n    get raw() {\n        return new fraction_js_1.Fraction(this.numerator, this.denominator);\n    }\n    get adjusted() {\n        return super.multiply(this.scalar);\n    }\n    invert() {\n        return this.new(this.quoteCurrency, this.baseCurrency, this.numerator, this.denominator);\n    }\n    multiply(other) {\n        (0, tiny_invariant_1.default)(this.quoteCurrency.equals(other.baseCurrency), `multiply token mismatch: ${this.quoteCurrency.toString()} !== ${other.baseCurrency.toString()}`);\n        const fraction = super.multiply(other);\n        return this.new(this.baseCurrency, other.quoteCurrency, fraction.denominator, fraction.numerator);\n    }\n    // performs floor division on overflow\n    quote(tokenAmount) {\n        (0, tiny_invariant_1.default)(tokenAmount.token.equals(this.baseCurrency), `quote token mismatch: ${tokenAmount.token.toString()} !== ${this.baseCurrency.toString()}`);\n        return tokenAmount.new(this.quoteCurrency, super.multiply(tokenAmount.raw).quotient);\n    }\n    toSignificant(significantDigits = 6, format, rounding) {\n        return this.adjusted.toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = 4, format, rounding) {\n        return this.adjusted.toFixed(decimalPlaces, format, rounding);\n    }\n    /**\n     * Returns the price in terms of the quote currency.\n     * @param format\n     * @param rounding\n     * @returns\n     */\n    toFixedQuote(format = { groupSeparator: \"\" }, rounding) {\n        return this.toFixed(this.quoteCurrency.decimals, format, rounding);\n    }\n    get asNumber() {\n        return this.adjusted.asNumber;\n    }\n}\nexports.Price = Price;\n//# sourceMappingURL=price.js.map\n\n/***/ }),\n\n/***/ 8097:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n//# sourceMappingURL=token.js.map\n\n/***/ }),\n\n/***/ 5998:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar _a, _b;\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TokenAmount = exports.stripTrailingZeroes = exports.validateU256 = exports.validateU64 = exports.TokenAmountUnderflow = exports.TokenAmountOverflow = exports.parseAmountFromString = exports.DEFAULT_GROUP_SEPARATOR = exports.DEFAULT_DECIMAL_SEPARATOR = exports.DEFAULT_LOCALE_GROUP_SEPARATOR = exports.DEFAULT_LOCALE_DECIMAL_SEPARATOR = exports.getGroupSeparator = exports.getDecimalSeparator = exports.getSeparator = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst big_js_1 = tslib_1.__importDefault(__webpack_require__(3302));\nconst jsbi_1 = tslib_1.__importDefault(__webpack_require__(9499));\nconst tiny_invariant_1 = tslib_1.__importDefault(__webpack_require__(6018));\nconst constants_js_1 = __webpack_require__(7658);\nconst format_js_1 = __webpack_require__(1762);\nconst fraction_js_1 = __webpack_require__(7646);\nconst percent_js_1 = __webpack_require__(8476);\nconst utils_js_1 = __webpack_require__(8872);\n/**\n * Gets the separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param separatorType\n * @param locale\n * @returns\n */\nconst getSeparator = (separatorType, locale) => {\n    var _a;\n    const numberWithDecimalSeparator = 1000.1;\n    return (_a = Intl.NumberFormat(locale)\n        .formatToParts(numberWithDecimalSeparator)\n        .find((part) => part.type === separatorType)) === null || _a === void 0 ? void 0 : _a.value;\n};\nexports.getSeparator = getSeparator;\n/**\n * Gets the decimal separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param locale\n * @returns\n */\nconst getDecimalSeparator = (locale) => {\n    return (0, exports.getSeparator)(\"decimal\", locale);\n};\nexports.getDecimalSeparator = getDecimalSeparator;\n/**\n * Gets the group separator of the provided locale.\n *\n * Source: {@link https://stackoverflow.com/questions/1074660/with-a-browser-how-do-i-know-which-decimal-separator-does-the-operating-system}\n *\n * @param locale\n * @returns\n */\nconst getGroupSeparator = (locale) => {\n    return (0, exports.getSeparator)(\"group\", locale);\n};\nexports.getGroupSeparator = getGroupSeparator;\n/**\n * The decimal separator of the default locale.\n */\nexports.DEFAULT_LOCALE_DECIMAL_SEPARATOR = (_a = (0, exports.getDecimalSeparator)()) !== null && _a !== void 0 ? _a : \".\";\n/**\n * The group separator of the default locale.\n */\nexports.DEFAULT_LOCALE_GROUP_SEPARATOR = (_b = (0, exports.getGroupSeparator)()) !== null && _b !== void 0 ? _b : \",\";\n/**\n * The default decimal separator.\n */\nexports.DEFAULT_DECIMAL_SEPARATOR = \".\";\n/**\n * The default group separator.\n */\nexports.DEFAULT_GROUP_SEPARATOR = \",\";\n/**\n * Parses a token amount from a decimal representation.\n * @param token\n * @param uiAmount\n * @returns\n */\nconst parseAmountFromString = (token, uiAmount, decimalSeparator = exports.DEFAULT_DECIMAL_SEPARATOR, groupSeparator = exports.DEFAULT_GROUP_SEPARATOR) => {\n    const parts = uiAmount.split(decimalSeparator);\n    if (parts.length === 0) {\n        throw new Error(\"empty number\");\n    }\n    const [wholeRaw, fractionRaw] = parts;\n    const whole = wholeRaw\n        ? jsbi_1.default.BigInt(wholeRaw.split(groupSeparator).join(\"\"))\n        : constants_js_1.ZERO;\n    const fraction = fractionRaw\n        ? jsbi_1.default.BigInt(fractionRaw.slice(0, token.decimals) +\n            Array(token.decimals).fill(\"0\").slice(fractionRaw.length).join(\"\"))\n        : constants_js_1.ZERO;\n    const combined = jsbi_1.default.add(jsbi_1.default.multiply(whole, (0, utils_js_1.makeDecimalMultiplier)(token.decimals)), fraction);\n    return combined;\n};\nexports.parseAmountFromString = parseAmountFromString;\n/**\n * Thrown when a token amount overflows.\n */\nclass TokenAmountOverflow extends RangeError {\n    constructor(type, amount) {\n        super(`Token amount overflows ${type}: ${amount.toString()}`);\n    }\n}\nexports.TokenAmountOverflow = TokenAmountOverflow;\n/**\n * Thrown when a token amount underflows.\n */\nclass TokenAmountUnderflow extends RangeError {\n    constructor(amount) {\n        super(`Token amount must be greater than zero: ${amount.toString()}`);\n    }\n}\nexports.TokenAmountUnderflow = TokenAmountUnderflow;\n/**\n * Validates that a number falls within the range of u64.\n * @param value\n */\nfunction validateU64(value) {\n    if (!jsbi_1.default.greaterThanOrEqual(value, constants_js_1.ZERO)) {\n        throw new TokenAmountUnderflow(value);\n    }\n    if (!jsbi_1.default.lessThanOrEqual(value, constants_js_1.MAX_U64)) {\n        throw new TokenAmountOverflow(\"u64\", value);\n    }\n}\nexports.validateU64 = validateU64;\n/**\n * Validates that a number falls within the range of u256.\n * @param value\n */\nfunction validateU256(value) {\n    if (!jsbi_1.default.greaterThanOrEqual(value, constants_js_1.ZERO)) {\n        throw new TokenAmountUnderflow(value);\n    }\n    if (!jsbi_1.default.lessThanOrEqual(value, constants_js_1.MAX_U256)) {\n        throw new TokenAmountOverflow(\"u256\", value);\n    }\n}\nexports.validateU256 = validateU256;\nconst stripTrailingZeroes = (num) => {\n    const [head, tail, ...rest] = num.split(\".\");\n    if (rest.length > 0 || !head) {\n        console.warn(`Invalid number passed to stripTrailingZeroes: ${num}`);\n        return num;\n    }\n    if (!tail) {\n        return num;\n    }\n    const newTail = tail.replace(/0+$/, \"\");\n    return newTail === \"\" ? head : `${head}.${newTail}`;\n};\nexports.stripTrailingZeroes = stripTrailingZeroes;\n/**\n * Represents a quantity of tokens.\n */\nclass TokenAmount extends fraction_js_1.Fraction {\n    /**\n     * amount _must_ be raw, i.e. in the native representation\n     */\n    constructor(token, amount, validate) {\n        const parsedAmount = (0, utils_js_1.parseBigintIsh)(amount);\n        validate === null || validate === void 0 ? void 0 : validate(parsedAmount);\n        super(parsedAmount, (0, utils_js_1.makeDecimalMultiplier)(token.decimals));\n        this.token = token;\n        this.token = token;\n    }\n    withAmount(amount) {\n        return this.new(this.token, amount);\n    }\n    get raw() {\n        return this.numerator;\n    }\n    toSignificant(significantDigits = 6, format, rounding = constants_js_1.Rounding.ROUND_DOWN) {\n        return super.toSignificant(significantDigits, format, rounding);\n    }\n    toFixed(decimalPlaces = this.token.decimals, format, rounding = constants_js_1.Rounding.ROUND_DOWN) {\n        (0, tiny_invariant_1.default)(decimalPlaces <= this.token.decimals, \"DECIMALS\");\n        return super.toFixed(decimalPlaces, format, rounding);\n    }\n    toExact(format = { groupSeparator: \"\" }) {\n        return (0, format_js_1.formatBig)(new big_js_1.default(this.numerator.toString()).div(this.denominator.toString()), this.token.decimals, format);\n    }\n    add(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `add token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        return this.withAmount(jsbi_1.default.add(this.raw, other.raw));\n    }\n    subtract(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `subtract token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        return this.withAmount(jsbi_1.default.subtract(this.raw, other.raw));\n    }\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @returns\n     */\n    percentOf(other) {\n        (0, tiny_invariant_1.default)(this.token.equals(other.token), `percentOf token mismatch: ${this.token.toString()} !== ${other.token.toString()}`);\n        const frac = this.divide(other);\n        return new percent_js_1.Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @returns\n     */\n    divideBy(other) {\n        const frac = this.divide(other);\n        return new percent_js_1.Percent(frac.numerator, frac.denominator);\n    }\n    /**\n     * Multiplies this token amount by a fraction.\n     * WARNING: this loses precision\n     * @param percent\n     * @returns\n     */\n    scale(fraction) {\n        return this.withAmount(fraction.asFraction.multiply(this.raw).toFixed(0));\n    }\n    /**\n     * Reduces this token amount by a percent.\n     * WARNING: this loses precision\n     * @param percent\n     * @returns\n     */\n    reduceBy(percent) {\n        return this.scale(percent_js_1.Percent.ONE_HUNDRED.subtract(percent));\n    }\n    /**\n     * Formats the token amount quantity with units.\n     *\n     * This function is not locale-specific: it hardcodes \"en-US\"-like behavior.\n     *\n     * @returns\n     */\n    formatUnits() {\n        return `${(0, exports.stripTrailingZeroes)(this.toExact({\n            groupSeparator: exports.DEFAULT_GROUP_SEPARATOR,\n            groupSize: 3,\n            decimalSeparator: exports.DEFAULT_DECIMAL_SEPARATOR,\n        }))} ${this.token.symbol}`;\n    }\n    /**\n     * Formats this number using Intl.NumberFormatOptions\n     * @param param0\n     * @returns\n     */\n    format({ numberFormatOptions, locale } = {}) {\n        return `${numberFormatOptions !== undefined\n            ? this.asNumber.toLocaleString(locale, numberFormatOptions)\n            : (0, exports.stripTrailingZeroes)(this.toFixed(this.token.decimals))}`;\n    }\n    /**\n     * Gets the value of this {@link TokenAmount} as a number.\n     */\n    get asNumber() {\n        return parseFloat(this.toExact());\n    }\n    /**\n     * Returns true if the other object is a {@link TokenAmount}.\n     *\n     * @param other\n     * @returns\n     */\n    static isTokenAmount(other) {\n        return (fraction_js_1.Fraction.isFraction(other) &&\n            !!(other === null || other === void 0 ? void 0 : other.token));\n    }\n    // ----------------------------------------------------------------\n    // DEPRECATED FUNCTIONS\n    // ----------------------------------------------------------------\n    /**\n     * Gets this TokenAmount as a percentage of the other TokenAmount.\n     * @param other\n     * @deprecated use {@link percentOf}\n     * @returns\n     */\n    divideByAmount(other) {\n        return this.percentOf(other);\n    }\n    /**\n     * Multiplies this token amount by a fraction.\n     * WARNING: this loses precision\n     * @param percent\n     * @deprecated use {@link scale}\n     * @returns\n     */\n    multiplyBy(fraction) {\n        return this.scale(fraction);\n    }\n}\nexports.TokenAmount = TokenAmount;\n//# sourceMappingURL=tokenAmount.js.map\n\n/***/ }),\n\n/***/ 8872:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.makeDecimalMultiplier = exports.parseBigintIsh = exports.isBN = void 0;\nconst tslib_1 = __webpack_require__(7582);\nconst jsbi_1 = tslib_1.__importDefault(__webpack_require__(9499));\nconst constants_js_1 = __webpack_require__(7658);\nconst BN_WORD_SIZE = 26;\n/**\n * Checks if an object is a BN.\n */\nconst isBN = (num) => {\n    return (num !== null &&\n        typeof num === \"object\" &&\n        num.constructor.wordSize === BN_WORD_SIZE &&\n        Array.isArray(num.words));\n};\nexports.isBN = isBN;\n/**\n * Parses a {@link BigintIsh} into a {@link JSBI}.\n * @param bigintIsh\n * @returns\n */\nfunction parseBigintIsh(bigintIsh) {\n    return bigintIsh instanceof jsbi_1.default\n        ? bigintIsh\n        : typeof bigintIsh === \"string\" || typeof bigintIsh === \"number\"\n            ? jsbi_1.default.BigInt(bigintIsh)\n            : typeof bigintIsh === \"bigint\" || (0, exports.isBN)(bigintIsh)\n                ? jsbi_1.default.BigInt(bigintIsh.toString())\n                : jsbi_1.default.BigInt(bigintIsh);\n}\nexports.parseBigintIsh = parseBigintIsh;\nconst decimalMultipliersCache = {};\n/**\n * Creates the multiplier for an amount of decimals.\n * @param decimals\n * @returns\n */\nconst makeDecimalMultiplier = (decimals) => {\n    const cached = decimalMultipliersCache[decimals];\n    if (cached) {\n        return cached;\n    }\n    if (decimals <= 18) {\n        return (decimalMultipliersCache[decimals] = jsbi_1.default.BigInt(10 ** decimals));\n    }\n    return (decimalMultipliersCache[decimals] = jsbi_1.default.exponentiate(constants_js_1.TEN, jsbi_1.default.BigInt(decimals)));\n};\nexports.makeDecimalMultiplier = makeDecimalMultiplier;\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 9282:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var process = __webpack_require__(4155);\n// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b\n\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the 'Software'), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\n\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nvar _require = __webpack_require__(2136),\n  _require$codes = _require.codes,\n  ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT,\n  ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n  ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE,\n  ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE,\n  ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS;\nvar AssertionError = __webpack_require__(5961);\nvar _require2 = __webpack_require__(9539),\n  inspect = _require2.inspect;\nvar _require$types = (__webpack_require__(9539).types),\n  isPromise = _require$types.isPromise,\n  isRegExp = _require$types.isRegExp;\nvar objectAssign = __webpack_require__(8399)();\nvar objectIs = __webpack_require__(5624)();\nvar RegExpPrototypeTest = __webpack_require__(1924)('RegExp.prototype.test');\nvar errorCache = new Map();\nvar isDeepEqual;\nvar isDeepStrictEqual;\nvar parseExpressionAt;\nvar findNodeAround;\nvar decoder;\nfunction lazyLoadComparison() {\n  var comparison = __webpack_require__(9158);\n  isDeepEqual = comparison.isDeepEqual;\n  isDeepStrictEqual = comparison.isDeepStrictEqual;\n}\n\n// Escape control characters but not \\n and \\t to keep the line breaks and\n// indentation intact.\n// eslint-disable-next-line no-control-regex\nvar escapeSequencesRegExp = /[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f]/g;\nvar meta = (/* unused pure expression or super */ null && ([\"\\\\u0000\", \"\\\\u0001\", \"\\\\u0002\", \"\\\\u0003\", \"\\\\u0004\", \"\\\\u0005\", \"\\\\u0006\", \"\\\\u0007\", '\\\\b', '', '', \"\\\\u000b\", '\\\\f', '', \"\\\\u000e\", \"\\\\u000f\", \"\\\\u0010\", \"\\\\u0011\", \"\\\\u0012\", \"\\\\u0013\", \"\\\\u0014\", \"\\\\u0015\", \"\\\\u0016\", \"\\\\u0017\", \"\\\\u0018\", \"\\\\u0019\", \"\\\\u001a\", \"\\\\u001b\", \"\\\\u001c\", \"\\\\u001d\", \"\\\\u001e\", \"\\\\u001f\"]));\nvar escapeFn = function escapeFn(str) {\n  return meta[str.charCodeAt(0)];\n};\nvar warned = false;\n\n// The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\nvar NO_EXCEPTION_SENTINEL = {};\n\n// All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction innerFail(obj) {\n  if (obj.message instanceof Error) throw obj.message;\n  throw new AssertionError(obj);\n}\nfunction fail(actual, expected, message, operator, stackStartFn) {\n  var argsLen = arguments.length;\n  var internalMessage;\n  if (argsLen === 0) {\n    internalMessage = 'Failed';\n  } else if (argsLen === 1) {\n    message = actual;\n    actual = undefined;\n  } else {\n    if (warned === false) {\n      warned = true;\n      var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console);\n      warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094');\n    }\n    if (argsLen === 2) operator = '!=';\n  }\n  if (message instanceof Error) throw message;\n  var errArgs = {\n    actual: actual,\n    expected: expected,\n    operator: operator === undefined ? 'fail' : operator,\n    stackStartFn: stackStartFn || fail\n  };\n  if (message !== undefined) {\n    errArgs.message = message;\n  }\n  var err = new AssertionError(errArgs);\n  if (internalMessage) {\n    err.message = internalMessage;\n    err.generatedMessage = true;\n  }\n  throw err;\n}\nassert.fail = fail;\n\n// The AssertionError is defined in internal/error.\nassert.AssertionError = AssertionError;\nfunction innerOk(fn, argLen, value, message) {\n  if (!value) {\n    var generatedMessage = false;\n    if (argLen === 0) {\n      generatedMessage = true;\n      message = 'No value argument passed to `assert.ok()`';\n    } else if (message instanceof Error) {\n      throw message;\n    }\n    var err = new AssertionError({\n      actual: value,\n      expected: true,\n      message: message,\n      operator: '==',\n      stackStartFn: fn\n    });\n    err.generatedMessage = generatedMessage;\n    throw err;\n  }\n}\n\n// Pure assertion tests whether a value is truthy, as determined\n// by !!value.\nfunction ok() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n  innerOk.apply(void 0, [ok, args.length].concat(args));\n}\nassert.ok = ok;\n\n// The equality assertion tests shallow, coercive equality with ==.\n/* eslint-disable no-restricted-properties */\nassert.equal = function equal(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  // eslint-disable-next-line eqeqeq\n  if (actual != expected) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: '==',\n      stackStartFn: equal\n    });\n  }\n};\n\n// The non-equality assertion tests for whether two objects are not\n// equal with !=.\nassert.notEqual = function notEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  // eslint-disable-next-line eqeqeq\n  if (actual == expected) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: '!=',\n      stackStartFn: notEqual\n    });\n  }\n};\n\n// The equivalence assertion tests a deep equality relation.\nassert.deepEqual = function deepEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (!isDeepEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'deepEqual',\n      stackStartFn: deepEqual\n    });\n  }\n};\n\n// The non-equivalence assertion tests for any deep inequality.\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (isDeepEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notDeepEqual',\n      stackStartFn: notDeepEqual\n    });\n  }\n};\n/* eslint-enable */\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (!isDeepStrictEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'deepStrictEqual',\n      stackStartFn: deepStrictEqual\n    });\n  }\n};\nassert.notDeepStrictEqual = notDeepStrictEqual;\nfunction notDeepStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (isDeepEqual === undefined) lazyLoadComparison();\n  if (isDeepStrictEqual(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notDeepStrictEqual',\n      stackStartFn: notDeepStrictEqual\n    });\n  }\n}\nassert.strictEqual = function strictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (!objectIs(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'strictEqual',\n      stackStartFn: strictEqual\n    });\n  }\n};\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n  if (arguments.length < 2) {\n    throw new ERR_MISSING_ARGS('actual', 'expected');\n  }\n  if (objectIs(actual, expected)) {\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: 'notStrictEqual',\n      stackStartFn: notStrictEqual\n    });\n  }\n};\nvar Comparison = /*#__PURE__*/_createClass(function Comparison(obj, keys, actual) {\n  var _this = this;\n  _classCallCheck(this, Comparison);\n  keys.forEach(function (key) {\n    if (key in obj) {\n      if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && RegExpPrototypeTest(obj[key], actual[key])) {\n        _this[key] = actual[key];\n      } else {\n        _this[key] = obj[key];\n      }\n    }\n  });\n});\nfunction compareExceptionKey(actual, expected, key, message, keys, fn) {\n  if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) {\n    if (!message) {\n      // Create placeholder objects to create a nice output.\n      var a = new Comparison(actual, keys);\n      var b = new Comparison(expected, keys, actual);\n      var err = new AssertionError({\n        actual: a,\n        expected: b,\n        operator: 'deepStrictEqual',\n        stackStartFn: fn\n      });\n      err.actual = actual;\n      err.expected = expected;\n      err.operator = fn.name;\n      throw err;\n    }\n    innerFail({\n      actual: actual,\n      expected: expected,\n      message: message,\n      operator: fn.name,\n      stackStartFn: fn\n    });\n  }\n}\nfunction expectedException(actual, expected, msg, fn) {\n  if (typeof expected !== 'function') {\n    if (isRegExp(expected)) return RegExpPrototypeTest(expected, actual);\n    // assert.doesNotThrow does not accept objects.\n    if (arguments.length === 2) {\n      throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected);\n    }\n\n    // Handle primitives properly.\n    if (_typeof(actual) !== 'object' || actual === null) {\n      var err = new AssertionError({\n        actual: actual,\n        expected: expected,\n        message: msg,\n        operator: 'deepStrictEqual',\n        stackStartFn: fn\n      });\n      err.operator = fn.name;\n      throw err;\n    }\n    var keys = Object.keys(expected);\n    // Special handle errors to make sure the name and the message are compared\n    // as well.\n    if (expected instanceof Error) {\n      keys.push('name', 'message');\n    } else if (keys.length === 0) {\n      throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object');\n    }\n    if (isDeepEqual === undefined) lazyLoadComparison();\n    keys.forEach(function (key) {\n      if (typeof actual[key] === 'string' && isRegExp(expected[key]) && RegExpPrototypeTest(expected[key], actual[key])) {\n        return;\n      }\n      compareExceptionKey(actual, expected, key, msg, keys, fn);\n    });\n    return true;\n  }\n  // Guard instanceof against arrow functions as they don't have a prototype.\n  if (expected.prototype !== undefined && actual instanceof expected) {\n    return true;\n  }\n  if (Error.isPrototypeOf(expected)) {\n    return false;\n  }\n  return expected.call({}, actual) === true;\n}\nfunction getActual(fn) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn);\n  }\n  try {\n    fn();\n  } catch (e) {\n    return e;\n  }\n  return NO_EXCEPTION_SENTINEL;\n}\nfunction checkIsPromise(obj) {\n  // Accept native ES6 promises and promises that are implemented in a similar\n  // way. Do not accept thenables that use a function as `obj` and that have no\n  // `catch` handler.\n\n  // TODO: thenables are checked up until they have the correct methods,\n  // but according to documentation, the `then` method should receive\n  // the `fulfill` and `reject` arguments as well or it may be never resolved.\n\n  return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function';\n}\nfunction waitForActual(promiseFn) {\n  return Promise.resolve().then(function () {\n    var resultPromise;\n    if (typeof promiseFn === 'function') {\n      // Return a rejected promise if `promiseFn` throws synchronously.\n      resultPromise = promiseFn();\n      // Fail in case no promise is returned.\n      if (!checkIsPromise(resultPromise)) {\n        throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise);\n      }\n    } else if (checkIsPromise(promiseFn)) {\n      resultPromise = promiseFn;\n    } else {\n      throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn);\n    }\n    return Promise.resolve().then(function () {\n      return resultPromise;\n    }).then(function () {\n      return NO_EXCEPTION_SENTINEL;\n    }).catch(function (e) {\n      return e;\n    });\n  });\n}\nfunction expectsError(stackStartFn, actual, error, message) {\n  if (typeof error === 'string') {\n    if (arguments.length === 4) {\n      throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n    }\n    if (_typeof(actual) === 'object' && actual !== null) {\n      if (actual.message === error) {\n        throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error message \\\"\".concat(actual.message, \"\\\" is identical to the message.\"));\n      }\n    } else if (actual === error) {\n      throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error \\\"\".concat(actual, \"\\\" is identical to the message.\"));\n    }\n    message = error;\n    error = undefined;\n  } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n  }\n  if (actual === NO_EXCEPTION_SENTINEL) {\n    var details = '';\n    if (error && error.name) {\n      details += \" (\".concat(error.name, \")\");\n    }\n    details += message ? \": \".concat(message) : '.';\n    var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception';\n    innerFail({\n      actual: undefined,\n      expected: error,\n      operator: stackStartFn.name,\n      message: \"Missing expected \".concat(fnType).concat(details),\n      stackStartFn: stackStartFn\n    });\n  }\n  if (error && !expectedException(actual, error, message, stackStartFn)) {\n    throw actual;\n  }\n}\nfunction expectsNoError(stackStartFn, actual, error, message) {\n  if (actual === NO_EXCEPTION_SENTINEL) return;\n  if (typeof error === 'string') {\n    message = error;\n    error = undefined;\n  }\n  if (!error || expectedException(actual, error)) {\n    var details = message ? \": \".concat(message) : '.';\n    var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception';\n    innerFail({\n      actual: actual,\n      expected: error,\n      operator: stackStartFn.name,\n      message: \"Got unwanted \".concat(fnType).concat(details, \"\\n\") + \"Actual message: \\\"\".concat(actual && actual.message, \"\\\"\"),\n      stackStartFn: stackStartFn\n    });\n  }\n  throw actual;\n}\nassert.throws = function throws(promiseFn) {\n  for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n    args[_key2 - 1] = arguments[_key2];\n  }\n  expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args));\n};\nassert.rejects = function rejects(promiseFn) {\n  for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n    args[_key3 - 1] = arguments[_key3];\n  }\n  return waitForActual(promiseFn).then(function (result) {\n    return expectsError.apply(void 0, [rejects, result].concat(args));\n  });\n};\nassert.doesNotThrow = function doesNotThrow(fn) {\n  for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n    args[_key4 - 1] = arguments[_key4];\n  }\n  expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args));\n};\nassert.doesNotReject = function doesNotReject(fn) {\n  for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {\n    args[_key5 - 1] = arguments[_key5];\n  }\n  return waitForActual(fn).then(function (result) {\n    return expectsNoError.apply(void 0, [doesNotReject, result].concat(args));\n  });\n};\nassert.ifError = function ifError(err) {\n  if (err !== null && err !== undefined) {\n    var message = 'ifError got unwanted exception: ';\n    if (_typeof(err) === 'object' && typeof err.message === 'string') {\n      if (err.message.length === 0 && err.constructor) {\n        message += err.constructor.name;\n      } else {\n        message += err.message;\n      }\n    } else {\n      message += inspect(err);\n    }\n    var newErr = new AssertionError({\n      actual: err,\n      expected: null,\n      operator: 'ifError',\n      message: message,\n      stackStartFn: ifError\n    });\n\n    // Make sure we actually have a stack trace!\n    var origStack = err.stack;\n    if (typeof origStack === 'string') {\n      // This will remove any duplicated frames from the error frames taken\n      // from within `ifError` and add the original error frames to the newly\n      // created ones.\n      var tmp2 = origStack.split('\\n');\n      tmp2.shift();\n      // Filter all frames existing in err.stack.\n      var tmp1 = newErr.stack.split('\\n');\n      for (var i = 0; i < tmp2.length; i++) {\n        // Find the first occurrence of the frame.\n        var pos = tmp1.indexOf(tmp2[i]);\n        if (pos !== -1) {\n          // Only keep new frames.\n          tmp1 = tmp1.slice(0, pos);\n          break;\n        }\n      }\n      newErr.stack = \"\".concat(tmp1.join('\\n'), \"\\n\").concat(tmp2.join('\\n'));\n    }\n    throw newErr;\n  }\n};\n\n// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a871df3dfb8ea663ef5e1f8f62701ec51384ecb\nfunction internalMatch(string, regexp, message, fn, fnName) {\n  if (!isRegExp(regexp)) {\n    throw new ERR_INVALID_ARG_TYPE('regexp', 'RegExp', regexp);\n  }\n  var match = fnName === 'match';\n  if (typeof string !== 'string' || RegExpPrototypeTest(regexp, string) !== match) {\n    if (message instanceof Error) {\n      throw message;\n    }\n    var generatedMessage = !message;\n\n    // 'The input was expected to not match the regular expression ' +\n    message = message || (typeof string !== 'string' ? 'The \"string\" argument must be of type string. Received type ' + \"\".concat(_typeof(string), \" (\").concat(inspect(string), \")\") : (match ? 'The input did not match the regular expression ' : 'The input was expected to not match the regular expression ') + \"\".concat(inspect(regexp), \". Input:\\n\\n\").concat(inspect(string), \"\\n\"));\n    var err = new AssertionError({\n      actual: string,\n      expected: regexp,\n      message: message,\n      operator: fnName,\n      stackStartFn: fn\n    });\n    err.generatedMessage = generatedMessage;\n    throw err;\n  }\n}\nassert.match = function match(string, regexp, message) {\n  internalMatch(string, regexp, message, match, 'match');\n};\nassert.doesNotMatch = function doesNotMatch(string, regexp, message) {\n  internalMatch(string, regexp, message, doesNotMatch, 'doesNotMatch');\n};\n\n// Expose a strict only variant of assert\nfunction strict() {\n  for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n    args[_key6] = arguments[_key6];\n  }\n  innerOk.apply(void 0, [strict, args.length].concat(args));\n}\nassert.strict = objectAssign(strict, assert, {\n  equal: assert.strictEqual,\n  deepEqual: assert.deepStrictEqual,\n  notEqual: assert.notStrictEqual,\n  notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;\n\n/***/ }),\n\n/***/ 5961:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var process = __webpack_require__(4155);\n// Currently in sync with Node.js lib/internal/assert/assertion_error.js\n// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c\n\n\n\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct.bind(); } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nvar _require = __webpack_require__(9539),\n  inspect = _require.inspect;\nvar _require2 = __webpack_require__(2136),\n  ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE;\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n  return str.substring(this_len - search.length, this_len) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat\nfunction repeat(str, count) {\n  count = Math.floor(count);\n  if (str.length == 0 || count == 0) return '';\n  var maxCount = str.length * count;\n  count = Math.floor(Math.log(count) / Math.log(2));\n  while (count) {\n    str += str;\n    count--;\n  }\n  str += str.substring(0, maxCount - str.length);\n  return str;\n}\nvar blue = '';\nvar green = '';\nvar red = '';\nvar white = '';\nvar kReadableOperator = {\n  deepStrictEqual: 'Expected values to be strictly deep-equal:',\n  strictEqual: 'Expected values to be strictly equal:',\n  strictEqualObject: 'Expected \"actual\" to be reference-equal to \"expected\":',\n  deepEqual: 'Expected values to be loosely deep-equal:',\n  equal: 'Expected values to be loosely equal:',\n  notDeepStrictEqual: 'Expected \"actual\" not to be strictly deep-equal to:',\n  notStrictEqual: 'Expected \"actual\" to be strictly unequal to:',\n  notStrictEqualObject: 'Expected \"actual\" not to be reference-equal to \"expected\":',\n  notDeepEqual: 'Expected \"actual\" not to be loosely deep-equal to:',\n  notEqual: 'Expected \"actual\" to be loosely unequal to:',\n  notIdentical: 'Values identical but not reference-equal:'\n};\n\n// Comparing short primitives should just show === / !== instead of using the\n// diff.\nvar kMaxShortLength = 10;\nfunction copyError(source) {\n  var keys = Object.keys(source);\n  var target = Object.create(Object.getPrototypeOf(source));\n  keys.forEach(function (key) {\n    target[key] = source[key];\n  });\n  Object.defineProperty(target, 'message', {\n    value: source.message\n  });\n  return target;\n}\nfunction inspectValue(val) {\n  // The util.inspect default values could be changed. This makes sure the\n  // error messages contain the necessary information nevertheless.\n  return inspect(val, {\n    compact: false,\n    customInspect: false,\n    depth: 1000,\n    maxArrayLength: Infinity,\n    // Assert compares only enumerable properties (with a few exceptions).\n    showHidden: false,\n    // Having a long line as error is better than wrapping the line for\n    // comparison for now.\n    // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we\n    // have meta information about the inspected properties (i.e., know where\n    // in what line the property starts and ends).\n    breakLength: Infinity,\n    // Assert does not detect proxies currently.\n    showProxy: false,\n    sorted: true,\n    // Inspect getters as we also check them when comparing entries.\n    getters: true\n  });\n}\nfunction createErrDiff(actual, expected, operator) {\n  var other = '';\n  var res = '';\n  var lastPos = 0;\n  var end = '';\n  var skipped = false;\n  var actualInspected = inspectValue(actual);\n  var actualLines = actualInspected.split('\\n');\n  var expectedLines = inspectValue(expected).split('\\n');\n  var i = 0;\n  var indicator = '';\n\n  // In case both values are objects explicitly mark them as not reference equal\n  // for the `strictEqual` operator.\n  if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) {\n    operator = 'strictEqualObject';\n  }\n\n  // If \"actual\" and \"expected\" fit on a single line and they are not strictly\n  // equal, check further special handling.\n  if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) {\n    var inputLength = actualLines[0].length + expectedLines[0].length;\n    // If the character length of \"actual\" and \"expected\" together is less than\n    // kMaxShortLength and if neither is an object and at least one of them is\n    // not `zero`, use the strict equal comparison to visualize the output.\n    if (inputLength <= kMaxShortLength) {\n      if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) {\n        // -0 === +0\n        return \"\".concat(kReadableOperator[operator], \"\\n\\n\") + \"\".concat(actualLines[0], \" !== \").concat(expectedLines[0], \"\\n\");\n      }\n    } else if (operator !== 'strictEqualObject') {\n      // If the stderr is a tty and the input length is lower than the current\n      // columns per line, add a mismatch indicator below the output. If it is\n      // not a tty, use a default value of 80 characters.\n      var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80;\n      if (inputLength < maxLength) {\n        while (actualLines[0][i] === expectedLines[0][i]) {\n          i++;\n        }\n        // Ignore the first characters.\n        if (i > 2) {\n          // Add position indicator for the first mismatch in case it is a\n          // single line and the input length is less than the column length.\n          indicator = \"\\n  \".concat(repeat(' ', i), \"^\");\n          i = 0;\n        }\n      }\n    }\n  }\n\n  // Remove all ending lines that match (this optimizes the output for\n  // readability by reducing the number of total changed lines).\n  var a = actualLines[actualLines.length - 1];\n  var b = expectedLines[expectedLines.length - 1];\n  while (a === b) {\n    if (i++ < 2) {\n      end = \"\\n  \".concat(a).concat(end);\n    } else {\n      other = a;\n    }\n    actualLines.pop();\n    expectedLines.pop();\n    if (actualLines.length === 0 || expectedLines.length === 0) break;\n    a = actualLines[actualLines.length - 1];\n    b = expectedLines[expectedLines.length - 1];\n  }\n  var maxLines = Math.max(actualLines.length, expectedLines.length);\n  // Strict equal with identical objects that are not identical by reference.\n  // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() })\n  if (maxLines === 0) {\n    // We have to get the result again. The lines were all removed before.\n    var _actualLines = actualInspected.split('\\n');\n\n    // Only remove lines in case it makes sense to collapse those.\n    // TODO: Accept env to always show the full error.\n    if (_actualLines.length > 30) {\n      _actualLines[26] = \"\".concat(blue, \"...\").concat(white);\n      while (_actualLines.length > 27) {\n        _actualLines.pop();\n      }\n    }\n    return \"\".concat(kReadableOperator.notIdentical, \"\\n\\n\").concat(_actualLines.join('\\n'), \"\\n\");\n  }\n  if (i > 3) {\n    end = \"\\n\".concat(blue, \"...\").concat(white).concat(end);\n    skipped = true;\n  }\n  if (other !== '') {\n    end = \"\\n  \".concat(other).concat(end);\n    other = '';\n  }\n  var printedLines = 0;\n  var msg = kReadableOperator[operator] + \"\\n\".concat(green, \"+ actual\").concat(white, \" \").concat(red, \"- expected\").concat(white);\n  var skippedMsg = \" \".concat(blue, \"...\").concat(white, \" Lines skipped\");\n  for (i = 0; i < maxLines; i++) {\n    // Only extra expected lines exist\n    var cur = i - lastPos;\n    if (actualLines.length < i + 1) {\n      // If the last diverging line is more than one line above and the\n      // current line is at least line three, add some of the former lines and\n      // also add dots to indicate skipped entries.\n      if (cur > 1 && i > 2) {\n        if (cur > 4) {\n          res += \"\\n\".concat(blue, \"...\").concat(white);\n          skipped = true;\n        } else if (cur > 3) {\n          res += \"\\n  \".concat(expectedLines[i - 2]);\n          printedLines++;\n        }\n        res += \"\\n  \".concat(expectedLines[i - 1]);\n        printedLines++;\n      }\n      // Mark the current line as the last diverging one.\n      lastPos = i;\n      // Add the expected line to the cache.\n      other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLines[i]);\n      printedLines++;\n      // Only extra actual lines exist\n    } else if (expectedLines.length < i + 1) {\n      // If the last diverging line is more than one line above and the\n      // current line is at least line three, add some of the former lines and\n      // also add dots to indicate skipped entries.\n      if (cur > 1 && i > 2) {\n        if (cur > 4) {\n          res += \"\\n\".concat(blue, \"...\").concat(white);\n          skipped = true;\n        } else if (cur > 3) {\n          res += \"\\n  \".concat(actualLines[i - 2]);\n          printedLines++;\n        }\n        res += \"\\n  \".concat(actualLines[i - 1]);\n        printedLines++;\n      }\n      // Mark the current line as the last diverging one.\n      lastPos = i;\n      // Add the actual line to the result.\n      res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLines[i]);\n      printedLines++;\n      // Lines diverge\n    } else {\n      var expectedLine = expectedLines[i];\n      var actualLine = actualLines[i];\n      // If the lines diverge, specifically check for lines that only diverge by\n      // a trailing comma. In that case it is actually identical and we should\n      // mark it as such.\n      var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine);\n      // If the expected line has a trailing comma but is otherwise identical,\n      // add a comma at the end of the actual line. Otherwise the output could\n      // look weird as in:\n      //\n      //   [\n      //     1         // No comma at the end!\n      // +   2\n      //   ]\n      //\n      if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) {\n        divergingLines = false;\n        actualLine += ',';\n      }\n      if (divergingLines) {\n        // If the last diverging line is more than one line above and the\n        // current line is at least line three, add some of the former lines and\n        // also add dots to indicate skipped entries.\n        if (cur > 1 && i > 2) {\n          if (cur > 4) {\n            res += \"\\n\".concat(blue, \"...\").concat(white);\n            skipped = true;\n          } else if (cur > 3) {\n            res += \"\\n  \".concat(actualLines[i - 2]);\n            printedLines++;\n          }\n          res += \"\\n  \".concat(actualLines[i - 1]);\n          printedLines++;\n        }\n        // Mark the current line as the last diverging one.\n        lastPos = i;\n        // Add the actual line to the result and cache the expected diverging\n        // line so consecutive diverging lines show up as +++--- and not +-+-+-.\n        res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLine);\n        other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLine);\n        printedLines += 2;\n        // Lines are identical\n      } else {\n        // Add all cached information to the result before adding other things\n        // and reset the cache.\n        res += other;\n        other = '';\n        // If the last diverging line is exactly one line above or if it is the\n        // very first line, add the line to the result.\n        if (cur === 1 || i === 0) {\n          res += \"\\n  \".concat(actualLine);\n          printedLines++;\n        }\n      }\n    }\n    // Inspected object to big (Show ~20 rows max)\n    if (printedLines > 20 && i < maxLines - 2) {\n      return \"\".concat(msg).concat(skippedMsg, \"\\n\").concat(res, \"\\n\").concat(blue, \"...\").concat(white).concat(other, \"\\n\") + \"\".concat(blue, \"...\").concat(white);\n    }\n  }\n  return \"\".concat(msg).concat(skipped ? skippedMsg : '', \"\\n\").concat(res).concat(other).concat(end).concat(indicator);\n}\nvar AssertionError = /*#__PURE__*/function (_Error, _inspect$custom) {\n  _inherits(AssertionError, _Error);\n  var _super = _createSuper(AssertionError);\n  function AssertionError(options) {\n    var _this;\n    _classCallCheck(this, AssertionError);\n    if (_typeof(options) !== 'object' || options === null) {\n      throw new ERR_INVALID_ARG_TYPE('options', 'Object', options);\n    }\n    var message = options.message,\n      operator = options.operator,\n      stackStartFn = options.stackStartFn;\n    var actual = options.actual,\n      expected = options.expected;\n    var limit = Error.stackTraceLimit;\n    Error.stackTraceLimit = 0;\n    if (message != null) {\n      _this = _super.call(this, String(message));\n    } else {\n      if (process.stderr && process.stderr.isTTY) {\n        // Reset on each call to make sure we handle dynamically set environment\n        // variables correct.\n        if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) {\n          blue = \"\\x1B[34m\";\n          green = \"\\x1B[32m\";\n          white = \"\\x1B[39m\";\n          red = \"\\x1B[31m\";\n        } else {\n          blue = '';\n          green = '';\n          white = '';\n          red = '';\n        }\n      }\n      // Prevent the error stack from being visible by duplicating the error\n      // in a very close way to the original in case both sides are actually\n      // instances of Error.\n      if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) {\n        actual = copyError(actual);\n        expected = copyError(expected);\n      }\n      if (operator === 'deepStrictEqual' || operator === 'strictEqual') {\n        _this = _super.call(this, createErrDiff(actual, expected, operator));\n      } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') {\n        // In case the objects are equal but the operator requires unequal, show\n        // the first object and say A equals B\n        var base = kReadableOperator[operator];\n        var res = inspectValue(actual).split('\\n');\n\n        // In case \"actual\" is an object, it should not be reference equal.\n        if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) {\n          base = kReadableOperator.notStrictEqualObject;\n        }\n\n        // Only remove lines in case it makes sense to collapse those.\n        // TODO: Accept env to always show the full error.\n        if (res.length > 30) {\n          res[26] = \"\".concat(blue, \"...\").concat(white);\n          while (res.length > 27) {\n            res.pop();\n          }\n        }\n\n        // Only print a single input.\n        if (res.length === 1) {\n          _this = _super.call(this, \"\".concat(base, \" \").concat(res[0]));\n        } else {\n          _this = _super.call(this, \"\".concat(base, \"\\n\\n\").concat(res.join('\\n'), \"\\n\"));\n        }\n      } else {\n        var _res = inspectValue(actual);\n        var other = '';\n        var knownOperators = kReadableOperator[operator];\n        if (operator === 'notDeepEqual' || operator === 'notEqual') {\n          _res = \"\".concat(kReadableOperator[operator], \"\\n\\n\").concat(_res);\n          if (_res.length > 1024) {\n            _res = \"\".concat(_res.slice(0, 1021), \"...\");\n          }\n        } else {\n          other = \"\".concat(inspectValue(expected));\n          if (_res.length > 512) {\n            _res = \"\".concat(_res.slice(0, 509), \"...\");\n          }\n          if (other.length > 512) {\n            other = \"\".concat(other.slice(0, 509), \"...\");\n          }\n          if (operator === 'deepEqual' || operator === 'equal') {\n            _res = \"\".concat(knownOperators, \"\\n\\n\").concat(_res, \"\\n\\nshould equal\\n\\n\");\n          } else {\n            other = \" \".concat(operator, \" \").concat(other);\n          }\n        }\n        _this = _super.call(this, \"\".concat(_res).concat(other));\n      }\n    }\n    Error.stackTraceLimit = limit;\n    _this.generatedMessage = !message;\n    Object.defineProperty(_assertThisInitialized(_this), 'name', {\n      value: 'AssertionError [ERR_ASSERTION]',\n      enumerable: false,\n      writable: true,\n      configurable: true\n    });\n    _this.code = 'ERR_ASSERTION';\n    _this.actual = actual;\n    _this.expected = expected;\n    _this.operator = operator;\n    if (Error.captureStackTrace) {\n      // eslint-disable-next-line no-restricted-syntax\n      Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn);\n    }\n    // Create error message including the error code in the name.\n    _this.stack;\n    // Reset the name.\n    _this.name = 'AssertionError';\n    return _possibleConstructorReturn(_this);\n  }\n  _createClass(AssertionError, [{\n    key: \"toString\",\n    value: function toString() {\n      return \"\".concat(this.name, \" [\").concat(this.code, \"]: \").concat(this.message);\n    }\n  }, {\n    key: _inspect$custom,\n    value: function value(recurseTimes, ctx) {\n      // This limits the `actual` and `expected` property default inspection to\n      // the minimum depth. Otherwise those values would be too verbose compared\n      // to the actual error message which contains a combined view of these two\n      // input values.\n      return inspect(this, _objectSpread(_objectSpread({}, ctx), {}, {\n        customInspect: false,\n        depth: 0\n      }));\n    }\n  }]);\n  return AssertionError;\n}( /*#__PURE__*/_wrapNativeSuper(Error), inspect.custom);\nmodule.exports = AssertionError;\n\n/***/ }),\n\n/***/ 2136:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n// Currently in sync with Node.js lib/internal/errors.js\n// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f\n\n/* eslint node-core/documented-errors: \"error\" */\n/* eslint node-core/alphabetize-errors: \"error\" */\n/* eslint node-core/prefer-util-format-errors: \"error\" */\n\n\n\n// The whole point behind this internal module is to allow Node.js to no\n// longer be forced to treat every error message change as a semver-major\n// change. The NodeError classes here all expose a `code` property whose\n// value statically and permanently identifies the error. While the error\n// message may change, the code should not.\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nvar codes = {};\n\n// Lazy loaded\nvar assert;\nvar util;\nfunction createErrorType(code, message, Base) {\n  if (!Base) {\n    Base = Error;\n  }\n  function getMessage(arg1, arg2, arg3) {\n    if (typeof message === 'string') {\n      return message;\n    } else {\n      return message(arg1, arg2, arg3);\n    }\n  }\n  var NodeError = /*#__PURE__*/function (_Base) {\n    _inherits(NodeError, _Base);\n    var _super = _createSuper(NodeError);\n    function NodeError(arg1, arg2, arg3) {\n      var _this;\n      _classCallCheck(this, NodeError);\n      _this = _super.call(this, getMessage(arg1, arg2, arg3));\n      _this.code = code;\n      return _this;\n    }\n    return _createClass(NodeError);\n  }(Base);\n  codes[code] = NodeError;\n}\n\n// https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\nfunction oneOf(expected, thing) {\n  if (Array.isArray(expected)) {\n    var len = expected.length;\n    expected = expected.map(function (i) {\n      return String(i);\n    });\n    if (len > 2) {\n      return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n    } else if (len === 2) {\n      return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n    } else {\n      return \"of \".concat(thing, \" \").concat(expected[0]);\n    }\n  } else {\n    return \"of \".concat(thing, \" \").concat(String(expected));\n  }\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\nfunction startsWith(str, search, pos) {\n  return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n  return str.substring(this_len - search.length, this_len) === search;\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\nfunction includes(str, search, start) {\n  if (typeof start !== 'number') {\n    start = 0;\n  }\n  if (start + search.length > str.length) {\n    return false;\n  } else {\n    return str.indexOf(search, start) !== -1;\n  }\n}\ncreateErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The \"%s\" argument is ambiguous. %s', TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n  if (assert === undefined) assert = __webpack_require__(9282);\n  assert(typeof name === 'string', \"'name' must be a string\");\n\n  // determiner: 'must be' or 'must not be'\n  var determiner;\n  if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n    determiner = 'must not be';\n    expected = expected.replace(/^not /, '');\n  } else {\n    determiner = 'must be';\n  }\n  var msg;\n  if (endsWith(name, ' argument')) {\n    // For cases like 'first argument'\n    msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  } else {\n    var type = includes(name, '.') ? 'property' : 'argument';\n    msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  }\n\n  // TODO(BridgeAR): Improve the output by showing `null` and similar.\n  msg += \". Received type \".concat(_typeof(actual));\n  return msg;\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_VALUE', function (name, value) {\n  var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid';\n  if (util === undefined) util = __webpack_require__(9539);\n  var inspected = util.inspect(value);\n  if (inspected.length > 128) {\n    inspected = \"\".concat(inspected.slice(0, 128), \"...\");\n  }\n  return \"The argument '\".concat(name, \"' \").concat(reason, \". Received \").concat(inspected);\n}, TypeError, RangeError);\ncreateErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) {\n  var type;\n  if (value && value.constructor && value.constructor.name) {\n    type = \"instance of \".concat(value.constructor.name);\n  } else {\n    type = \"type \".concat(_typeof(value));\n  }\n  return \"Expected \".concat(input, \" to be returned from the \\\"\").concat(name, \"\\\"\") + \" function but got \".concat(type, \".\");\n}, TypeError);\ncreateErrorType('ERR_MISSING_ARGS', function () {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n  if (assert === undefined) assert = __webpack_require__(9282);\n  assert(args.length > 0, 'At least one arg needs to be specified');\n  var msg = 'The ';\n  var len = args.length;\n  args = args.map(function (a) {\n    return \"\\\"\".concat(a, \"\\\"\");\n  });\n  switch (len) {\n    case 1:\n      msg += \"\".concat(args[0], \" argument\");\n      break;\n    case 2:\n      msg += \"\".concat(args[0], \" and \").concat(args[1], \" arguments\");\n      break;\n    default:\n      msg += args.slice(0, len - 1).join(', ');\n      msg += \", and \".concat(args[len - 1], \" arguments\");\n      break;\n  }\n  return \"\".concat(msg, \" must be specified\");\n}, TypeError);\nmodule.exports.codes = codes;\n\n/***/ }),\n\n/***/ 9158:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n// Currently in sync with Node.js lib/internal/util/comparisons.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nfunction _iterableToArrayLimit(r, l) { var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nvar regexFlagsSupported = /a/g.flags !== undefined;\nvar arrayFromSet = function arrayFromSet(set) {\n  var array = [];\n  set.forEach(function (value) {\n    return array.push(value);\n  });\n  return array;\n};\nvar arrayFromMap = function arrayFromMap(map) {\n  var array = [];\n  map.forEach(function (value, key) {\n    return array.push([key, value]);\n  });\n  return array;\n};\nvar objectIs = Object.is ? Object.is : __webpack_require__(609);\nvar objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () {\n  return [];\n};\nvar numberIsNaN = Number.isNaN ? Number.isNaN : __webpack_require__(360);\nfunction uncurryThis(f) {\n  return f.call.bind(f);\n}\nvar hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\nvar propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable);\nvar objectToString = uncurryThis(Object.prototype.toString);\nvar _require$types = (__webpack_require__(9539).types),\n  isAnyArrayBuffer = _require$types.isAnyArrayBuffer,\n  isArrayBufferView = _require$types.isArrayBufferView,\n  isDate = _require$types.isDate,\n  isMap = _require$types.isMap,\n  isRegExp = _require$types.isRegExp,\n  isSet = _require$types.isSet,\n  isNativeError = _require$types.isNativeError,\n  isBoxedPrimitive = _require$types.isBoxedPrimitive,\n  isNumberObject = _require$types.isNumberObject,\n  isStringObject = _require$types.isStringObject,\n  isBooleanObject = _require$types.isBooleanObject,\n  isBigIntObject = _require$types.isBigIntObject,\n  isSymbolObject = _require$types.isSymbolObject,\n  isFloat32Array = _require$types.isFloat32Array,\n  isFloat64Array = _require$types.isFloat64Array;\nfunction isNonIndex(key) {\n  if (key.length === 0 || key.length > 10) return true;\n  for (var i = 0; i < key.length; i++) {\n    var code = key.charCodeAt(i);\n    if (code < 48 || code > 57) return true;\n  }\n  // The maximum size for an array is 2 ** 32 -1.\n  return key.length === 10 && key >= Math.pow(2, 32);\n}\nfunction getOwnNonIndexProperties(value) {\n  return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value)));\n}\n\n// Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license  MIT\n */\nfunction compare(a, b) {\n  if (a === b) {\n    return 0;\n  }\n  var x = a.length;\n  var y = b.length;\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i];\n      y = b[i];\n      break;\n    }\n  }\n  if (x < y) {\n    return -1;\n  }\n  if (y < x) {\n    return 1;\n  }\n  return 0;\n}\nvar ONLY_ENUMERABLE = undefined;\nvar kStrict = true;\nvar kLoose = false;\nvar kNoIterator = 0;\nvar kIsArray = 1;\nvar kIsSet = 2;\nvar kIsMap = 3;\n\n// Check if they have the same source and flags\nfunction areSimilarRegExps(a, b) {\n  return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b);\n}\nfunction areSimilarFloatArrays(a, b) {\n  if (a.byteLength !== b.byteLength) {\n    return false;\n  }\n  for (var offset = 0; offset < a.byteLength; offset++) {\n    if (a[offset] !== b[offset]) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction areSimilarTypedArrays(a, b) {\n  if (a.byteLength !== b.byteLength) {\n    return false;\n  }\n  return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0;\n}\nfunction areEqualArrayBuffers(buf1, buf2) {\n  return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0;\n}\nfunction isEqualBoxedPrimitive(val1, val2) {\n  if (isNumberObject(val1)) {\n    return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2));\n  }\n  if (isStringObject(val1)) {\n    return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2);\n  }\n  if (isBooleanObject(val1)) {\n    return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2);\n  }\n  if (isBigIntObject(val1)) {\n    return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2);\n  }\n  return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2);\n}\n\n// Notes: Type tags are historical [[Class]] properties that can be set by\n// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS\n// and retrieved using Object.prototype.toString.call(obj) in JS\n// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring\n// for a list of tags pre-defined in the spec.\n// There are some unspecified tags in the wild too (e.g. typed array tags).\n// Since tags can be altered, they only serve fast failures\n//\n// Typed arrays and buffers are checked by comparing the content in their\n// underlying ArrayBuffer. This optimization requires that it's\n// reasonable to interpret their underlying memory in the same way,\n// which is checked by comparing their type tags.\n// (e.g. a Uint8Array and a Uint16Array with the same memory content\n// could still be different because they will be interpreted differently).\n//\n// For strict comparison, objects should have\n// a) The same built-in type tags\n// b) The same prototypes.\n\nfunction innerDeepEqual(val1, val2, strict, memos) {\n  // All identical values are equivalent, as determined by ===.\n  if (val1 === val2) {\n    if (val1 !== 0) return true;\n    return strict ? objectIs(val1, val2) : true;\n  }\n\n  // Check more closely if val1 and val2 are equal.\n  if (strict) {\n    if (_typeof(val1) !== 'object') {\n      return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2);\n    }\n    if (_typeof(val2) !== 'object' || val1 === null || val2 === null) {\n      return false;\n    }\n    if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) {\n      return false;\n    }\n  } else {\n    if (val1 === null || _typeof(val1) !== 'object') {\n      if (val2 === null || _typeof(val2) !== 'object') {\n        // eslint-disable-next-line eqeqeq\n        return val1 == val2;\n      }\n      return false;\n    }\n    if (val2 === null || _typeof(val2) !== 'object') {\n      return false;\n    }\n  }\n  var val1Tag = objectToString(val1);\n  var val2Tag = objectToString(val2);\n  if (val1Tag !== val2Tag) {\n    return false;\n  }\n  if (Array.isArray(val1)) {\n    // Check for sparse arrays and general fast path\n    if (val1.length !== val2.length) {\n      return false;\n    }\n    var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n    var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n    if (keys1.length !== keys2.length) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsArray, keys1);\n  }\n  // [browserify] This triggers on certain types in IE (Map/Set) so we don't\n  // wan't to early return out of the rest of the checks. However we can check\n  // if the second value is one of these values and the first isn't.\n  if (val1Tag === '[object Object]') {\n    // return keyCheck(val1, val2, strict, memos, kNoIterator);\n    if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) {\n      return false;\n    }\n  }\n  if (isDate(val1)) {\n    if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) {\n      return false;\n    }\n  } else if (isRegExp(val1)) {\n    if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) {\n      return false;\n    }\n  } else if (isNativeError(val1) || val1 instanceof Error) {\n    // Do not compare the stack as it might differ even though the error itself\n    // is otherwise identical.\n    if (val1.message !== val2.message || val1.name !== val2.name) {\n      return false;\n    }\n  } else if (isArrayBufferView(val1)) {\n    if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) {\n      if (!areSimilarFloatArrays(val1, val2)) {\n        return false;\n      }\n    } else if (!areSimilarTypedArrays(val1, val2)) {\n      return false;\n    }\n    // Buffer.compare returns true, so val1.length === val2.length. If they both\n    // only contain numeric keys, we don't need to exam further than checking\n    // the symbols.\n    var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n    var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n    if (_keys.length !== _keys2.length) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kNoIterator, _keys);\n  } else if (isSet(val1)) {\n    if (!isSet(val2) || val1.size !== val2.size) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsSet);\n  } else if (isMap(val1)) {\n    if (!isMap(val2) || val1.size !== val2.size) {\n      return false;\n    }\n    return keyCheck(val1, val2, strict, memos, kIsMap);\n  } else if (isAnyArrayBuffer(val1)) {\n    if (!areEqualArrayBuffers(val1, val2)) {\n      return false;\n    }\n  } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) {\n    return false;\n  }\n  return keyCheck(val1, val2, strict, memos, kNoIterator);\n}\nfunction getEnumerables(val, keys) {\n  return keys.filter(function (k) {\n    return propertyIsEnumerable(val, k);\n  });\n}\nfunction keyCheck(val1, val2, strict, memos, iterationType, aKeys) {\n  // For all remaining Object pairs, including Array, objects and Maps,\n  // equivalence is determined by having:\n  // a) The same number of owned enumerable properties\n  // b) The same set of keys/indexes (although not necessarily the same order)\n  // c) Equivalent values for every corresponding key/index\n  // d) For Sets and Maps, equal contents\n  // Note: this accounts for both named and indexed properties on Arrays.\n  if (arguments.length === 5) {\n    aKeys = Object.keys(val1);\n    var bKeys = Object.keys(val2);\n\n    // The pair must have the same number of owned properties.\n    if (aKeys.length !== bKeys.length) {\n      return false;\n    }\n  }\n\n  // Cheap key test\n  var i = 0;\n  for (; i < aKeys.length; i++) {\n    if (!hasOwnProperty(val2, aKeys[i])) {\n      return false;\n    }\n  }\n  if (strict && arguments.length === 5) {\n    var symbolKeysA = objectGetOwnPropertySymbols(val1);\n    if (symbolKeysA.length !== 0) {\n      var count = 0;\n      for (i = 0; i < symbolKeysA.length; i++) {\n        var key = symbolKeysA[i];\n        if (propertyIsEnumerable(val1, key)) {\n          if (!propertyIsEnumerable(val2, key)) {\n            return false;\n          }\n          aKeys.push(key);\n          count++;\n        } else if (propertyIsEnumerable(val2, key)) {\n          return false;\n        }\n      }\n      var symbolKeysB = objectGetOwnPropertySymbols(val2);\n      if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) {\n        return false;\n      }\n    } else {\n      var _symbolKeysB = objectGetOwnPropertySymbols(val2);\n      if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) {\n        return false;\n      }\n    }\n  }\n  if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) {\n    return true;\n  }\n\n  // Use memos to handle cycles.\n  if (memos === undefined) {\n    memos = {\n      val1: new Map(),\n      val2: new Map(),\n      position: 0\n    };\n  } else {\n    // We prevent up to two map.has(x) calls by directly retrieving the value\n    // and checking for undefined. The map can only contain numbers, so it is\n    // safe to check for undefined only.\n    var val2MemoA = memos.val1.get(val1);\n    if (val2MemoA !== undefined) {\n      var val2MemoB = memos.val2.get(val2);\n      if (val2MemoB !== undefined) {\n        return val2MemoA === val2MemoB;\n      }\n    }\n    memos.position++;\n  }\n  memos.val1.set(val1, memos.position);\n  memos.val2.set(val2, memos.position);\n  var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType);\n  memos.val1.delete(val1);\n  memos.val2.delete(val2);\n  return areEq;\n}\nfunction setHasEqualElement(set, val1, strict, memo) {\n  // Go looking.\n  var setValues = arrayFromSet(set);\n  for (var i = 0; i < setValues.length; i++) {\n    var val2 = setValues[i];\n    if (innerDeepEqual(val1, val2, strict, memo)) {\n      // Remove the matching element to make sure we do not check that again.\n      set.delete(val2);\n      return true;\n    }\n  }\n  return false;\n}\n\n// See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using\n// Sadly it is not possible to detect corresponding values properly in case the\n// type is a string, number, bigint or boolean. The reason is that those values\n// can match lots of different string values (e.g., 1n == '+00001').\nfunction findLooseMatchingPrimitives(prim) {\n  switch (_typeof(prim)) {\n    case 'undefined':\n      return null;\n    case 'object':\n      // Only pass in null as object!\n      return undefined;\n    case 'symbol':\n      return false;\n    case 'string':\n      prim = +prim;\n    // Loose equal entries exist only if the string is possible to convert to\n    // a regular number and not NaN.\n    // Fall through\n    case 'number':\n      if (numberIsNaN(prim)) {\n        return false;\n      }\n  }\n  return true;\n}\nfunction setMightHaveLoosePrim(a, b, prim) {\n  var altValue = findLooseMatchingPrimitives(prim);\n  if (altValue != null) return altValue;\n  return b.has(altValue) && !a.has(altValue);\n}\nfunction mapMightHaveLoosePrim(a, b, prim, item, memo) {\n  var altValue = findLooseMatchingPrimitives(prim);\n  if (altValue != null) {\n    return altValue;\n  }\n  var curB = b.get(altValue);\n  if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) {\n    return false;\n  }\n  return !a.has(altValue) && innerDeepEqual(item, curB, false, memo);\n}\nfunction setEquiv(a, b, strict, memo) {\n  // This is a lazily initiated Set of entries which have to be compared\n  // pairwise.\n  var set = null;\n  var aValues = arrayFromSet(a);\n  for (var i = 0; i < aValues.length; i++) {\n    var val = aValues[i];\n    // Note: Checking for the objects first improves the performance for object\n    // heavy sets but it is a minor slow down for primitives. As they are fast\n    // to check this improves the worst case scenario instead.\n    if (_typeof(val) === 'object' && val !== null) {\n      if (set === null) {\n        set = new Set();\n      }\n      // If the specified value doesn't exist in the second set its an not null\n      // object (or non strict only: a not matching primitive) we'll need to go\n      // hunting for something thats deep-(strict-)equal to it. To make this\n      // O(n log n) complexity we have to copy these values in a new set first.\n      set.add(val);\n    } else if (!b.has(val)) {\n      if (strict) return false;\n\n      // Fast path to detect missing string, symbol, undefined and null values.\n      if (!setMightHaveLoosePrim(a, b, val)) {\n        return false;\n      }\n      if (set === null) {\n        set = new Set();\n      }\n      set.add(val);\n    }\n  }\n  if (set !== null) {\n    var bValues = arrayFromSet(b);\n    for (var _i = 0; _i < bValues.length; _i++) {\n      var _val = bValues[_i];\n      // We have to check if a primitive value is already\n      // matching and only if it's not, go hunting for it.\n      if (_typeof(_val) === 'object' && _val !== null) {\n        if (!setHasEqualElement(set, _val, strict, memo)) return false;\n      } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) {\n        return false;\n      }\n    }\n    return set.size === 0;\n  }\n  return true;\n}\nfunction mapHasEqualEntry(set, map, key1, item1, strict, memo) {\n  // To be able to handle cases like:\n  //   Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']])\n  // ... we need to consider *all* matching keys, not just the first we find.\n  var setValues = arrayFromSet(set);\n  for (var i = 0; i < setValues.length; i++) {\n    var key2 = setValues[i];\n    if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) {\n      set.delete(key2);\n      return true;\n    }\n  }\n  return false;\n}\nfunction mapEquiv(a, b, strict, memo) {\n  var set = null;\n  var aEntries = arrayFromMap(a);\n  for (var i = 0; i < aEntries.length; i++) {\n    var _aEntries$i = _slicedToArray(aEntries[i], 2),\n      key = _aEntries$i[0],\n      item1 = _aEntries$i[1];\n    if (_typeof(key) === 'object' && key !== null) {\n      if (set === null) {\n        set = new Set();\n      }\n      set.add(key);\n    } else {\n      // By directly retrieving the value we prevent another b.has(key) check in\n      // almost all possible cases.\n      var item2 = b.get(key);\n      if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) {\n        if (strict) return false;\n        // Fast path to detect missing string, symbol, undefined and null\n        // keys.\n        if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false;\n        if (set === null) {\n          set = new Set();\n        }\n        set.add(key);\n      }\n    }\n  }\n  if (set !== null) {\n    var bEntries = arrayFromMap(b);\n    for (var _i2 = 0; _i2 < bEntries.length; _i2++) {\n      var _bEntries$_i = _slicedToArray(bEntries[_i2], 2),\n        _key = _bEntries$_i[0],\n        item = _bEntries$_i[1];\n      if (_typeof(_key) === 'object' && _key !== null) {\n        if (!mapHasEqualEntry(set, a, _key, item, strict, memo)) return false;\n      } else if (!strict && (!a.has(_key) || !innerDeepEqual(a.get(_key), item, false, memo)) && !mapHasEqualEntry(set, a, _key, item, false, memo)) {\n        return false;\n      }\n    }\n    return set.size === 0;\n  }\n  return true;\n}\nfunction objEquiv(a, b, strict, keys, memos, iterationType) {\n  // Sets and maps don't have their entries accessible via normal object\n  // properties.\n  var i = 0;\n  if (iterationType === kIsSet) {\n    if (!setEquiv(a, b, strict, memos)) {\n      return false;\n    }\n  } else if (iterationType === kIsMap) {\n    if (!mapEquiv(a, b, strict, memos)) {\n      return false;\n    }\n  } else if (iterationType === kIsArray) {\n    for (; i < a.length; i++) {\n      if (hasOwnProperty(a, i)) {\n        if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) {\n          return false;\n        }\n      } else if (hasOwnProperty(b, i)) {\n        return false;\n      } else {\n        // Array is sparse.\n        var keysA = Object.keys(a);\n        for (; i < keysA.length; i++) {\n          var key = keysA[i];\n          if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) {\n            return false;\n          }\n        }\n        if (keysA.length !== Object.keys(b).length) {\n          return false;\n        }\n        return true;\n      }\n    }\n  }\n\n  // The pair must have equivalent values for every corresponding key.\n  // Possibly expensive deep test:\n  for (i = 0; i < keys.length; i++) {\n    var _key2 = keys[i];\n    if (!innerDeepEqual(a[_key2], b[_key2], strict, memos)) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction isDeepEqual(val1, val2) {\n  return innerDeepEqual(val1, val2, kLoose);\n}\nfunction isDeepStrictEqual(val1, val2) {\n  return innerDeepEqual(val1, val2, kStrict);\n}\nmodule.exports = {\n  isDeepEqual: isDeepEqual,\n  isDeepStrictEqual: isDeepStrictEqual\n};\n\n/***/ }),\n\n/***/ 8162:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = (__webpack_require__(9509).Buffer)\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n    if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return _Buffer.alloc(0) }\n    var psz = 0\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (psz < source.length) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n    vch.fill(0x00, 0, zeroes)\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n\n\n/***/ }),\n\n/***/ 9742:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n\n\n/***/ }),\n\n/***/ 3302:\n/***/ (function(module, exports, __webpack_require__) {\n\nvar __WEBPACK_AMD_DEFINE_RESULT__;/*\r\n *  big.js v6.2.1\r\n *  A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\r\n *  Copyright (c) 2022 Michael Mclaughlin\r\n *  https://github.com/MikeMcl/big.js/LICENCE.md\r\n */\r\n;(function (GLOBAL) {\r\n  'use strict';\r\n  var Big,\r\n\r\n\r\n/************************************** EDITABLE DEFAULTS *****************************************/\r\n\r\n\r\n    // The default values below must be integers within the stated ranges.\r\n\r\n    /*\r\n     * The maximum number of decimal places (DP) of the results of operations involving division:\r\n     * div and sqrt, and pow with negative exponents.\r\n     */\r\n    DP = 20,            // 0 to MAX_DP\r\n\r\n    /*\r\n     * The rounding mode (RM) used when rounding to the above decimal places.\r\n     *\r\n     *  0  Towards zero (i.e. truncate, no rounding).       (ROUND_DOWN)\r\n     *  1  To nearest neighbour. If equidistant, round up.  (ROUND_HALF_UP)\r\n     *  2  To nearest neighbour. If equidistant, to even.   (ROUND_HALF_EVEN)\r\n     *  3  Away from zero.                                  (ROUND_UP)\r\n     */\r\n    RM = 1,             // 0, 1, 2 or 3\r\n\r\n    // The maximum value of DP and Big.DP.\r\n    MAX_DP = 1E6,       // 0 to 1000000\r\n\r\n    // The maximum magnitude of the exponent argument to the pow method.\r\n    MAX_POWER = 1E6,    // 1 to 1000000\r\n\r\n    /*\r\n     * The negative exponent (NE) at and beneath which toString returns exponential notation.\r\n     * (JavaScript numbers: -7)\r\n     * -1000000 is the minimum recommended exponent value of a Big.\r\n     */\r\n    NE = -7,            // 0 to -1000000\r\n\r\n    /*\r\n     * The positive exponent (PE) at and above which toString returns exponential notation.\r\n     * (JavaScript numbers: 21)\r\n     * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\r\n     */\r\n    PE = 21,            // 0 to 1000000\r\n\r\n    /*\r\n     * When true, an error will be thrown if a primitive number is passed to the Big constructor,\r\n     * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\r\n     * primitive number without a loss of precision.\r\n     */\r\n    STRICT = false,     // true or false\r\n\r\n\r\n/**************************************************************************************************/\r\n\r\n\r\n    // Error messages.\r\n    NAME = '[big.js] ',\r\n    INVALID = NAME + 'Invalid ',\r\n    INVALID_DP = INVALID + 'decimal places',\r\n    INVALID_RM = INVALID + 'rounding mode',\r\n    DIV_BY_ZERO = NAME + 'Division by zero',\r\n\r\n    // The shared prototype object.\r\n    P = {},\r\n    UNDEFINED = void 0,\r\n    NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\r\n\r\n\r\n  /*\r\n   * Create and return a Big constructor.\r\n   */\r\n  function _Big_() {\r\n\r\n    /*\r\n     * The Big constructor and exported function.\r\n     * Create and return a new instance of a Big number object.\r\n     *\r\n     * n {number|string|Big} A numeric value.\r\n     */\r\n    function Big(n) {\r\n      var x = this;\r\n\r\n      // Enable constructor usage without new.\r\n      if (!(x instanceof Big)) return n === UNDEFINED ? _Big_() : new Big(n);\r\n\r\n      // Duplicate.\r\n      if (n instanceof Big) {\r\n        x.s = n.s;\r\n        x.e = n.e;\r\n        x.c = n.c.slice();\r\n      } else {\r\n        if (typeof n !== 'string') {\r\n          if (Big.strict === true && typeof n !== 'bigint') {\r\n            throw TypeError(INVALID + 'value');\r\n          }\r\n\r\n          // Minus zero?\r\n          n = n === 0 && 1 / n < 0 ? '-0' : String(n);\r\n        }\r\n\r\n        parse(x, n);\r\n      }\r\n\r\n      // Retain a reference to this Big constructor.\r\n      // Shadow Big.prototype.constructor which points to Object.\r\n      x.constructor = Big;\r\n    }\r\n\r\n    Big.prototype = P;\r\n    Big.DP = DP;\r\n    Big.RM = RM;\r\n    Big.NE = NE;\r\n    Big.PE = PE;\r\n    Big.strict = STRICT;\r\n    Big.roundDown = 0;\r\n    Big.roundHalfUp = 1;\r\n    Big.roundHalfEven = 2;\r\n    Big.roundUp = 3;\r\n\r\n    return Big;\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the number or string value passed to a Big constructor.\r\n   *\r\n   * x {Big} A Big number instance.\r\n   * n {number|string} A numeric value.\r\n   */\r\n  function parse(x, n) {\r\n    var e, i, nl;\r\n\r\n    if (!NUMERIC.test(n)) {\r\n      throw Error(INVALID + 'number');\r\n    }\r\n\r\n    // Determine sign.\r\n    x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\r\n\r\n    // Decimal point?\r\n    if ((e = n.indexOf('.')) > -1) n = n.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = n.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +n.slice(i + 1);\r\n      n = n.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = n.length;\r\n    }\r\n\r\n    nl = n.length;\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\r\n\r\n    if (i == nl) {\r\n\r\n      // Zero.\r\n      x.c = [x.e = 0];\r\n    } else {\r\n\r\n      // Determine trailing zeros.\r\n      for (; nl > 0 && n.charAt(--nl) == '0';);\r\n      x.e = e - i - 1;\r\n      x.c = [];\r\n\r\n      // Convert string to array of digits without leading/trailing zeros.\r\n      for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round Big x to a maximum of sd significant digits using rounding mode rm.\r\n   *\r\n   * x {Big} The Big to round.\r\n   * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\r\n   * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   * [more] {boolean} Whether the result of division was truncated.\r\n   */\r\n  function round(x, sd, rm, more) {\r\n    var xc = x.c;\r\n\r\n    if (rm === UNDEFINED) rm = x.constructor.RM;\r\n    if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\r\n      throw Error(INVALID_RM);\r\n    }\r\n\r\n    if (sd < 1) {\r\n      more =\r\n        rm === 3 && (more || !!xc[0]) || sd === 0 && (\r\n        rm === 1 && xc[0] >= 5 ||\r\n        rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED))\r\n      );\r\n\r\n      xc.length = 1;\r\n\r\n      if (more) {\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        x.e = x.e - sd + 1;\r\n        xc[0] = 1;\r\n      } else {\r\n\r\n        // Zero.\r\n        xc[0] = x.e = 0;\r\n      }\r\n    } else if (sd < xc.length) {\r\n\r\n      // xc[sd] is the digit after the digit that may be rounded up.\r\n      more =\r\n        rm === 1 && xc[sd] >= 5 ||\r\n        rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\r\n          (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\r\n        rm === 3 && (more || !!xc[0]);\r\n\r\n      // Remove any digits after the required precision.\r\n      xc.length = sd;\r\n\r\n      // Round up?\r\n      if (more) {\r\n\r\n        // Rounding up may mean the previous digit has to be rounded up.\r\n        for (; ++xc[--sd] > 9;) {\r\n          xc[sd] = 0;\r\n          if (sd === 0) {\r\n            ++x.e;\r\n            xc.unshift(1);\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // Remove trailing zeros.\r\n      for (sd = xc.length; !xc[--sd];) xc.pop();\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of Big x in normal or exponential notation.\r\n   * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\r\n   */\r\n  function stringify(x, doExponential, isNonzero) {\r\n    var e = x.e,\r\n      s = x.c.join(''),\r\n      n = s.length;\r\n\r\n    // Exponential notation?\r\n    if (doExponential) {\r\n      s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\r\n\r\n    // Normal notation.\r\n    } else if (e < 0) {\r\n      for (; ++e;) s = '0' + s;\r\n      s = '0.' + s;\r\n    } else if (e > 0) {\r\n      if (++e > n) {\r\n        for (e -= n; e--;) s += '0';\r\n      } else if (e < n) {\r\n        s = s.slice(0, e) + '.' + s.slice(e);\r\n      }\r\n    } else if (n > 1) {\r\n      s = s.charAt(0) + '.' + s.slice(1);\r\n    }\r\n\r\n    return x.s < 0 && isNonzero ? '-' + s : s;\r\n  }\r\n\r\n\r\n  // Prototype/instance methods\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the absolute value of this Big.\r\n   */\r\n  P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return 1 if the value of this Big is greater than the value of Big y,\r\n   *       -1 if the value of this Big is less than the value of Big y, or\r\n   *        0 if they have the same value.\r\n   */\r\n  P.cmp = function (y) {\r\n    var isneg,\r\n      x = this,\r\n      xc = x.c,\r\n      yc = (y = new x.constructor(y)).c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) return !xc[0] ? !yc[0] ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    isneg = i < 0;\r\n\r\n    // Compare exponents.\r\n    if (k != l) return k > l ^ isneg ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = -1; ++i < j;) {\r\n      if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ isneg ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\r\n   * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n   */\r\n  P.div = function (y) {\r\n    var x = this,\r\n      Big = x.constructor,\r\n      a = x.c,                  // dividend\r\n      b = (y = new Big(y)).c,   // divisor\r\n      k = x.s == y.s ? 1 : -1,\r\n      dp = Big.DP;\r\n\r\n    if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n\r\n    // Divisor is zero?\r\n    if (!b[0]) {\r\n      throw Error(DIV_BY_ZERO);\r\n    }\r\n\r\n    // Dividend is 0? Return +-0.\r\n    if (!a[0]) {\r\n      y.s = k;\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    var bl, bt, n, cmp, ri,\r\n      bz = b.slice(),\r\n      ai = bl = b.length,\r\n      al = a.length,\r\n      r = a.slice(0, bl),   // remainder\r\n      rl = r.length,\r\n      q = y,                // quotient\r\n      qc = q.c = [],\r\n      qi = 0,\r\n      p = dp + (q.e = x.e - y.e) + 1;    // precision of the result\r\n\r\n    q.s = k;\r\n    k = p < 0 ? 0 : p;\r\n\r\n    // Create version of divisor with leading zero.\r\n    bz.unshift(0);\r\n\r\n    // Add zeros to make remainder as long as divisor.\r\n    for (; rl++ < bl;) r.push(0);\r\n\r\n    do {\r\n\r\n      // n is how many times the divisor goes into current remainder.\r\n      for (n = 0; n < 10; n++) {\r\n\r\n        // Compare divisor and remainder.\r\n        if (bl != (rl = r.length)) {\r\n          cmp = bl > rl ? 1 : -1;\r\n        } else {\r\n          for (ri = -1, cmp = 0; ++ri < bl;) {\r\n            if (b[ri] != r[ri]) {\r\n              cmp = b[ri] > r[ri] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        // If divisor < remainder, subtract divisor from remainder.\r\n        if (cmp < 0) {\r\n\r\n          // Remainder can't be more than 1 digit longer than divisor.\r\n          // Equalise lengths using divisor with extra leading zero?\r\n          for (bt = rl == bl ? b : bz; rl;) {\r\n            if (r[--rl] < bt[rl]) {\r\n              ri = rl;\r\n              for (; ri && !r[--ri];) r[ri] = 9;\r\n              --r[ri];\r\n              r[rl] += 10;\r\n            }\r\n            r[rl] -= bt[rl];\r\n          }\r\n\r\n          for (; !r[0];) r.shift();\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n\r\n      // Add the digit n to the result array.\r\n      qc[qi++] = cmp ? n : ++n;\r\n\r\n      // Update the remainder.\r\n      if (r[0] && cmp) r[rl] = a[ai] || 0;\r\n      else r = [a[ai]];\r\n\r\n    } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\r\n\r\n    // Leading zero? Do not remove if result is simply zero (qi == 1).\r\n    if (!qc[0] && qi != 1) {\r\n\r\n      // There can't be more than one zero.\r\n      qc.shift();\r\n      q.e--;\r\n      p--;\r\n    }\r\n\r\n    // Round?\r\n    if (qi > p) round(q, p, Big.RM, r[0] !== UNDEFINED);\r\n\r\n    return q;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\r\n   */\r\n  P.eq = function (y) {\r\n    return this.cmp(y) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is greater than the value of Big y, otherwise return\r\n   * false.\r\n   */\r\n  P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\r\n   * return false.\r\n   */\r\n  P.gte = function (y) {\r\n    return this.cmp(y) > -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is less than the value of Big y, otherwise return false.\r\n   */\r\n  P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\r\n   * return false.\r\n   */\r\n  P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big minus the value of Big y.\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var i, j, t, xlty,\r\n      x = this,\r\n      Big = x.constructor,\r\n      a = x.s,\r\n      b = (y = new Big(y)).s;\r\n\r\n    // Signs differ?\r\n    if (a != b) {\r\n      y.s = -b;\r\n      return x.plus(y);\r\n    }\r\n\r\n    var xc = x.c.slice(),\r\n      xe = x.e,\r\n      yc = y.c,\r\n      ye = y.e;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) {\r\n      if (yc[0]) {\r\n        y.s = -b;\r\n      } else if (xc[0]) {\r\n        y = new Big(x);\r\n      } else {\r\n        y.s = 1;\r\n      }\r\n      return y;\r\n    }\r\n\r\n    // Determine which is the bigger number. Prepend zeros to equalise exponents.\r\n    if (a = xe - ye) {\r\n\r\n      if (xlty = a < 0) {\r\n        a = -a;\r\n        t = xc;\r\n      } else {\r\n        ye = xe;\r\n        t = yc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (b = a; b--;) t.push(0);\r\n      t.reverse();\r\n    } else {\r\n\r\n      // Exponents equal. Check digit by digit.\r\n      j = ((xlty = xc.length < yc.length) ? xc : yc).length;\r\n\r\n      for (a = b = 0; b < j; b++) {\r\n        if (xc[b] != yc[b]) {\r\n          xlty = xc[b] < yc[b];\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    // x < y? Point xc to the array of the bigger number.\r\n    if (xlty) {\r\n      t = xc;\r\n      xc = yc;\r\n      yc = t;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    /*\r\n     * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\r\n     * needs to start at yc.length.\r\n     */\r\n    if ((b = (j = yc.length) - (i = xc.length)) > 0) for (; b--;) xc[i++] = 0;\r\n\r\n    // Subtract yc from xc.\r\n    for (b = i; j > a;) {\r\n      if (xc[--j] < yc[j]) {\r\n        for (i = j; i && !xc[--i];) xc[i] = 9;\r\n        --xc[i];\r\n        xc[j] += 10;\r\n      }\r\n\r\n      xc[j] -= yc[j];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xc[--b] === 0;) xc.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xc[0] === 0;) {\r\n      xc.shift();\r\n      --ye;\r\n    }\r\n\r\n    if (!xc[0]) {\r\n\r\n      // n - n = +0\r\n      y.s = 1;\r\n\r\n      // Result must be zero.\r\n      xc = [ye = 0];\r\n    }\r\n\r\n    y.c = xc;\r\n    y.e = ye;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big modulo the value of Big y.\r\n   */\r\n  P.mod = function (y) {\r\n    var ygtx,\r\n      x = this,\r\n      Big = x.constructor,\r\n      a = x.s,\r\n      b = (y = new Big(y)).s;\r\n\r\n    if (!y.c[0]) {\r\n      throw Error(DIV_BY_ZERO);\r\n    }\r\n\r\n    x.s = y.s = 1;\r\n    ygtx = y.cmp(x) == 1;\r\n    x.s = a;\r\n    y.s = b;\r\n\r\n    if (ygtx) return new Big(x);\r\n\r\n    a = Big.DP;\r\n    b = Big.RM;\r\n    Big.DP = Big.RM = 0;\r\n    x = x.div(y);\r\n    Big.DP = a;\r\n    Big.RM = b;\r\n\r\n    return this.minus(x.times(y));\r\n  };\r\n  \r\n  \r\n  /*\r\n   * Return a new Big whose value is the value of this Big negated.\r\n   */\r\n  P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big plus the value of Big y.\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var e, k, t,\r\n      x = this,\r\n      Big = x.constructor;\r\n\r\n    y = new Big(y);\r\n\r\n    // Signs differ?\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    var xe = x.e,\r\n      xc = x.c,\r\n      ye = y.e,\r\n      yc = y.c;\r\n\r\n    // Either zero?\r\n    if (!xc[0] || !yc[0]) {\r\n      if (!yc[0]) {\r\n        if (xc[0]) {\r\n          y = new Big(x);\r\n        } else {\r\n          y.s = x.s;\r\n        }\r\n      }\r\n      return y;\r\n    }\r\n\r\n    xc = xc.slice();\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    // Note: reverse faster than unshifts.\r\n    if (e = xe - ye) {\r\n      if (e > 0) {\r\n        ye = xe;\r\n        t = yc;\r\n      } else {\r\n        e = -e;\r\n        t = xc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (; e--;) t.push(0);\r\n      t.reverse();\r\n    }\r\n\r\n    // Point xc to the longer array.\r\n    if (xc.length - yc.length < 0) {\r\n      t = yc;\r\n      yc = xc;\r\n      xc = t;\r\n    }\r\n\r\n    e = yc.length;\r\n\r\n    // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\r\n    for (k = 0; e; xc[e] %= 10) k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\r\n\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n\r\n    if (k) {\r\n      xc.unshift(k);\r\n      ++ye;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (e = xc.length; xc[--e] === 0;) xc.pop();\r\n\r\n    y.c = xc;\r\n    y.e = ye;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a Big whose value is the value of this Big raised to the power n.\r\n   * If n is negative, round to a maximum of Big.DP decimal places using rounding\r\n   * mode Big.RM.\r\n   *\r\n   * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\r\n   */\r\n  P.pow = function (n) {\r\n    var x = this,\r\n      one = new x.constructor('1'),\r\n      y = one,\r\n      isneg = n < 0;\r\n\r\n    if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\r\n      throw Error(INVALID + 'exponent');\r\n    }\r\n\r\n    if (isneg) n = -n;\r\n\r\n    for (;;) {\r\n      if (n & 1) y = y.times(x);\r\n      n >>= 1;\r\n      if (!n) break;\r\n      x = x.times(x);\r\n    }\r\n\r\n    return isneg ? one.div(y) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\r\n   * significant digits using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.prec = function (sd, rm) {\r\n    if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n      throw Error(INVALID + 'precision');\r\n    }\r\n    return round(new this.constructor(this), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\r\n   * using rounding mode rm, or Big.RM if rm is not specified.\r\n   * If dp is negative, round to an integer which is a multiple of 10**-dp.\r\n   * If dp is not specified, round to 0 decimal places.\r\n   *\r\n   * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.round = function (dp, rm) {\r\n    if (dp === UNDEFINED) dp = 0;\r\n    else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n    return round(new this.constructor(this), dp + this.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the square root of the value of this Big, rounded, if\r\n   * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n   */\r\n  P.sqrt = function () {\r\n    var r, c, t,\r\n      x = this,\r\n      Big = x.constructor,\r\n      s = x.s,\r\n      e = x.e,\r\n      half = new Big('0.5');\r\n\r\n    // Zero?\r\n    if (!x.c[0]) return new Big(x);\r\n\r\n    // Negative?\r\n    if (s < 0) {\r\n      throw Error(NAME + 'No square root');\r\n    }\r\n\r\n    // Estimate.\r\n    s = Math.sqrt(x + '');\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\r\n    if (s === 0 || s === 1 / 0) {\r\n      c = x.c.join('');\r\n      if (!(c.length + e & 1)) c += '0';\r\n      s = Math.sqrt(c);\r\n      e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\r\n      r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\r\n    } else {\r\n      r = new Big(s + '');\r\n    }\r\n\r\n    e = r.e + (Big.DP += 4);\r\n\r\n    // Newton-Raphson iteration.\r\n    do {\r\n      t = r;\r\n      r = half.times(t.plus(x.div(t)));\r\n    } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\r\n\r\n    return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Big whose value is the value of this Big times the value of Big y.\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var c,\r\n      x = this,\r\n      Big = x.constructor,\r\n      xc = x.c,\r\n      yc = (y = new Big(y)).c,\r\n      a = xc.length,\r\n      b = yc.length,\r\n      i = x.e,\r\n      j = y.e;\r\n\r\n    // Determine sign of result.\r\n    y.s = x.s == y.s ? 1 : -1;\r\n\r\n    // Return signed 0 if either 0.\r\n    if (!xc[0] || !yc[0]) {\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    // Initialise exponent of result as x.e + y.e.\r\n    y.e = i + j;\r\n\r\n    // If array xc has fewer digits than yc, swap xc and yc, and lengths.\r\n    if (a < b) {\r\n      c = xc;\r\n      xc = yc;\r\n      yc = c;\r\n      j = a;\r\n      a = b;\r\n      b = j;\r\n    }\r\n\r\n    // Initialise coefficient array of result with zeros.\r\n    for (c = new Array(j = a + b); j--;) c[j] = 0;\r\n\r\n    // Multiply.\r\n\r\n    // i is initially xc.length.\r\n    for (i = b; i--;) {\r\n      b = 0;\r\n\r\n      // a is yc.length.\r\n      for (j = a + i; j > i;) {\r\n\r\n        // Current sum of products at this digit position, plus carry.\r\n        b = c[j] + yc[i] * xc[j - i - 1] + b;\r\n        c[j--] = b % 10;\r\n\r\n        // carry\r\n        b = b / 10 | 0;\r\n      }\r\n\r\n      c[j] = b;\r\n    }\r\n\r\n    // Increment result exponent if there is a final carry, otherwise remove leading zero.\r\n    if (b) ++y.e;\r\n    else c.shift();\r\n\r\n    // Remove trailing zeros.\r\n    for (i = c.length; !c[--i];) c.pop();\r\n    y.c = c;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big in exponential notation rounded to dp fixed\r\n   * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var x = this,\r\n      n = x.c[0];\r\n\r\n    if (dp !== UNDEFINED) {\r\n      if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n        throw Error(INVALID_DP);\r\n      }\r\n      x = round(new x.constructor(x), ++dp, rm);\r\n      for (; x.c.length < dp;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, true, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big in normal notation rounded to dp fixed\r\n   * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n   *\r\n   * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var x = this,\r\n      n = x.c[0];\r\n\r\n    if (dp !== UNDEFINED) {\r\n      if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n        throw Error(INVALID_DP);\r\n      }\r\n      x = round(new x.constructor(x), dp + x.e + 1, rm);\r\n\r\n      // x.e may have changed if the value is rounded up.\r\n      for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, false, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big.\r\n   * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n   * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n   * Omit the sign for negative zero.\r\n   */\r\n  P.toJSON = P.toString = function () {\r\n    var x = this,\r\n      Big = x.constructor;\r\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Big as a primitve number.\r\n   */\r\n  P.toNumber = function () {\r\n    var n = Number(stringify(this, true, true));\r\n    if (this.constructor.strict === true && !this.eq(n.toString())) {\r\n      throw Error(NAME + 'Imprecise conversion');\r\n    }\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big rounded to sd significant digits using\r\n   * rounding mode rm, or Big.RM if rm is not specified.\r\n   * Use exponential notation if sd is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n   * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var x = this,\r\n      Big = x.constructor,\r\n      n = x.c[0];\r\n\r\n    if (sd !== UNDEFINED) {\r\n      if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n        throw Error(INVALID + 'precision');\r\n      }\r\n      x = round(new Big(x), sd, rm);\r\n      for (; x.c.length < sd;) x.c.push(0);\r\n    }\r\n\r\n    return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Big.\r\n   * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n   * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n   * Include the sign for negative zero.\r\n   */\r\n  P.valueOf = function () {\r\n    var x = this,\r\n      Big = x.constructor;\r\n    if (Big.strict === true) {\r\n      throw Error(NAME + 'valueOf disallowed');\r\n    }\r\n    return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\r\n  };\r\n\r\n\r\n  // Export\r\n\r\n\r\n  Big = _Big_();\r\n\r\n  Big['default'] = Big.Big = Big;\r\n\r\n  //AMD.\r\n  if (true) {\r\n    !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { return Big; }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\r\n\r\n  // Node and other CommonJS-like environments that support module.exports.\r\n  } else {}\r\n})(this);\r\n\n\n/***/ }),\n\n/***/ 475:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nlet converter;\n/**\n * Convert a little-endian buffer into a BigInt.\n * @param buf The little-endian buffer to convert\n * @returns A BigInt with the little-endian representation of buf.\n */\nfunction toBigIntLE(buf) {\n    {\n        const reversed = Buffer.from(buf);\n        reversed.reverse();\n        const hex = reversed.toString('hex');\n        if (hex.length === 0) {\n            return BigInt(0);\n        }\n        return BigInt(`0x${hex}`);\n    }\n    return converter.toBigInt(buf, false);\n}\nexports.toBigIntLE = toBigIntLE;\n/**\n * Convert a big-endian buffer into a BigInt\n * @param buf The big-endian buffer to convert.\n * @returns A BigInt with the big-endian representation of buf.\n */\nfunction toBigIntBE(buf) {\n    {\n        const hex = buf.toString('hex');\n        if (hex.length === 0) {\n            return BigInt(0);\n        }\n        return BigInt(`0x${hex}`);\n    }\n    return converter.toBigInt(buf, true);\n}\nexports.toBigIntBE = toBigIntBE;\n/**\n * Convert a BigInt to a little-endian buffer.\n * @param num   The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A little-endian buffer representation of num.\n */\nfunction toBufferLE(num, width) {\n    {\n        const hex = num.toString(16);\n        const buffer = Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n        buffer.reverse();\n        return buffer;\n    }\n    // Allocation is done here, since it is slower using napi in C\n    return converter.fromBigInt(num, Buffer.allocUnsafe(width), false);\n}\nexports.toBufferLE = toBufferLE;\n/**\n * Convert a BigInt to a big-endian buffer.\n * @param num   The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A big-endian buffer representation of num.\n */\nfunction toBufferBE(num, width) {\n    {\n        const hex = num.toString(16);\n        return Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n    }\n    return converter.fromBigInt(num, Buffer.allocUnsafe(width), true);\n}\nexports.toBufferBE = toBufferBE;\n\n\n/***/ }),\n\n/***/ 4431:\n/***/ (function(module, exports, __webpack_require__) {\n\nvar __WEBPACK_AMD_DEFINE_RESULT__;;(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v9.1.2\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                       // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        prefix: '',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        groupSeparator: ',',\r\n        decimalSeparator: '.',\r\n        fractionGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',        // non-breaking space\r\n        suffix: ''\r\n      },\r\n\r\n      // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n      // '-', '.', whitespace, or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n      alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * v {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(v, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor call without `new`.\r\n      if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n      if (b == null) {\r\n\r\n        if (v && v._isBigNumber === true) {\r\n          x.s = v.s;\r\n\r\n          if (!v.c || v.e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else if (v.e < MIN_EXP) {\r\n            x.c = [x.e = 0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.c = v.c.slice();\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n          // Fast path for integers, where n < 2147483648 (2**31).\r\n          if (v === ~~v) {\r\n            for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n            if (e > MAX_EXP) {\r\n              x.c = x.e = null;\r\n            } else {\r\n              x.e = e;\r\n              x.c = [v];\r\n            }\r\n\r\n            return;\r\n          }\r\n\r\n          str = String(v);\r\n        } else {\r\n\r\n          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n          x = new BigNumber(v);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        str = String(v);\r\n\r\n        if (isNum = typeof v == 'number') {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + v);\r\n          }\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp, so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, String(v), isNum, b);\r\n          }\r\n        }\r\n\r\n        // Prevent later check for length on converted number.\r\n        isNum = false;\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      if (str = str.slice(i, ++len)) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * v));\r\n        }\r\n\r\n         // Overflow?\r\n        if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            i = LOG_BASE - (str = str.slice(i)).length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *     prefix                 {string}\r\n     *     groupSize              {number}\r\n     *     secondaryGroupSize     {number}\r\n     *     groupSeparator         {string}\r\n     *     decimalSeparator       {string}\r\n     *     fractionGroupSize      {number}\r\n     *     fractionGroupSeparator {string}\r\n     *     suffix                 {string}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if less than two characters,\r\n            // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n            if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n              alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n     *\r\n     * v {any}\r\n     *\r\n     * '[BigNumber Error] Invalid BigNumber: {v}'\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      if (!v || v._isBigNumber !== true) return false;\r\n      if (!BigNumber.DEBUG) return true;\r\n\r\n      var i, n,\r\n        c = v.c,\r\n        e = v.e,\r\n        s = v.s;\r\n\r\n      out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n          // If the first element is zero, the BigNumber value must be zero.\r\n          if (c[0] === 0) {\r\n            if (e === 0 && c.length === 1) return true;\r\n            break out;\r\n          }\r\n\r\n          // Calculate number of digits that c[0] should have, based on the exponent.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (i < 1) i += LOG_BASE;\r\n\r\n          // Calculate number of digits of c[0].\r\n          //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n          if (String(c[0]).length == i) {\r\n\r\n            for (i = 0; i < c.length; i++) {\r\n              n = c[i];\r\n              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n            }\r\n\r\n            // Last element cannot be zero, unless it is the only element.\r\n            if (n !== 0) return true;\r\n          }\r\n        }\r\n\r\n      // Infinity/NaN\r\n      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n        return true;\r\n      }\r\n\r\n      throw Error\r\n        (bignumberError + 'Invalid BigNumber: ' + v);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, -1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the sum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.sum = function () {\r\n      var i = 1,\r\n        args = arguments,\r\n        sum = new BigNumber(args[0]);\r\n      for (; i < args.length;) sum = sum.plus(args[i++]);\r\n      return sum;\r\n    };\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    // If any number is NaN, return NaN.\r\n    function maxOrMin(args, n) {\r\n      var k, y,\r\n        i = 1,\r\n        x = new BigNumber(args[0]);\r\n\r\n      for (; i < args.length; i++) {\r\n        y = new BigNumber(args[i]);\r\n        if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {\r\n          x = y;\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.s = null;\r\n        }\r\n\r\n        x.c = x.e = null;\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    function valueOf(n) {\r\n      var str,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        if (nIsNeg) n.s = 1;\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        i = Math.abs(+valueOf(n));\r\n        nIsOdd = i % 2;\r\n      }\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (i) {\r\n          i = mathfloor(i / 2);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        } else {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n\r\n          if (n.e > 14) {\r\n            nIsOdd = isOdd(n);\r\n          } else {\r\n            i = +valueOf(n);\r\n            if (i === 0) break;\r\n            nIsOdd = i % 2;\r\n          }\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) {\r\n        t = xc;\r\n        xc = yc;\r\n        yc = t;\r\n        y.s = -y.s;\r\n      }\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) {\r\n        zc = xc;\r\n        xc = yc;\r\n        yc = zc;\r\n        i = xcL;\r\n        xcL = ycL;\r\n        ycL = i;\r\n      }\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) {\r\n        t = yc;\r\n        yc = xc;\r\n        xc = t;\r\n        b = a;\r\n      }\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+valueOf(x));\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(+n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '5e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the format or FORMAT object (see BigNumber.set).\r\n     *\r\n     * The formatting object may contain some or all of the properties shown below.\r\n     *\r\n     * FORMAT = {\r\n     *   prefix: '',\r\n     *   groupSize: 3,\r\n     *   secondaryGroupSize: 0,\r\n     *   groupSeparator: ',',\r\n     *   decimalSeparator: '.',\r\n     *   fractionGroupSize: 0,\r\n     *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n     *   suffix: ''\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     * [format] {object} Formatting options. See FORMAT pbject above.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     * '[BigNumber Error] Argument not an object: {format}'\r\n     */\r\n    P.toFormat = function (dp, rm, format) {\r\n      var str,\r\n        x = this;\r\n\r\n      if (format == null) {\r\n        if (dp != null && rm && typeof rm == 'object') {\r\n          format = rm;\r\n          rm = null;\r\n        } else if (dp && typeof dp == 'object') {\r\n          format = dp;\r\n          dp = rm = null;\r\n        } else {\r\n          format = FORMAT;\r\n        }\r\n      } else if (typeof format != 'object') {\r\n        throw Error\r\n          (bignumberError + 'Argument not an object: ' + format);\r\n      }\r\n\r\n      str = x.toFixed(dp, rm);\r\n\r\n      if (x.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +format.groupSize,\r\n          g2 = +format.secondaryGroupSize,\r\n          groupSeparator = format.groupSeparator || '',\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = x.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) {\r\n          i = g1;\r\n          g1 = g2;\r\n          g2 = i;\r\n          len -= i;\r\n        }\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + (format.fractionGroupSeparator || ''))\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return (format.prefix || '') + str + (format.suffix || '');\r\n    };\r\n\r\n\r\n    /*\r\n     * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n     * fraction with an integer numerator and an integer denominator.\r\n     * The denominator will be a positive non-zero value less than or equal to the specified\r\n     * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n     * the lowest value necessary to represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n        }\r\n      }\r\n\r\n      if (!xc) return new BigNumber(x);\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e = e * 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n          div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n      MAX_EXP = exp;\r\n\r\n      return r;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +valueOf(this);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(coeffToString(n.c), e)\r\n           : toFixedPoint(coeffToString(n.c), e, '0');\r\n        } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n          n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n          str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      return valueOf(this);\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n  // These functions don't need access to variables,\r\n  // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== mathfloor(n)) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + String(n));\r\n    }\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (true) {\r\n    !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { return BigNumber; }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else {}\r\n})(this);\r\n\n\n/***/ }),\n\n/***/ 3550:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n/* module decorator */ module = __webpack_require__.nmd(module);\n(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = (__webpack_require__(6601).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})( false || module, this);\n\n\n/***/ }),\n\n/***/ 5532:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.deserializeUnchecked = exports.deserialize = exports.serialize = exports.BinaryReader = exports.BinaryWriter = exports.BorshError = exports.baseDecode = exports.baseEncode = void 0;\nconst bn_js_1 = __importDefault(__webpack_require__(3550));\nconst bs58_1 = __importDefault(__webpack_require__(7304));\n// TODO: Make sure this polyfill not included when not required\nconst encoding = __importStar(__webpack_require__(1127));\nconst ResolvedTextDecoder = typeof TextDecoder !== \"function\" ? encoding.TextDecoder : TextDecoder;\nconst textDecoder = new ResolvedTextDecoder(\"utf-8\", { fatal: true });\nfunction baseEncode(value) {\n    if (typeof value === \"string\") {\n        value = Buffer.from(value, \"utf8\");\n    }\n    return bs58_1.default.encode(Buffer.from(value));\n}\nexports.baseEncode = baseEncode;\nfunction baseDecode(value) {\n    return Buffer.from(bs58_1.default.decode(value));\n}\nexports.baseDecode = baseDecode;\nconst INITIAL_LENGTH = 1024;\nclass BorshError extends Error {\n    constructor(message) {\n        super(message);\n        this.fieldPath = [];\n        this.originalMessage = message;\n    }\n    addToFieldPath(fieldName) {\n        this.fieldPath.splice(0, 0, fieldName);\n        // NOTE: Modifying message directly as jest doesn't use .toString()\n        this.message = this.originalMessage + \": \" + this.fieldPath.join(\".\");\n    }\n}\nexports.BorshError = BorshError;\n/// Binary encoder.\nclass BinaryWriter {\n    constructor() {\n        this.buf = Buffer.alloc(INITIAL_LENGTH);\n        this.length = 0;\n    }\n    maybeResize() {\n        if (this.buf.length < 16 + this.length) {\n            this.buf = Buffer.concat([this.buf, Buffer.alloc(INITIAL_LENGTH)]);\n        }\n    }\n    writeU8(value) {\n        this.maybeResize();\n        this.buf.writeUInt8(value, this.length);\n        this.length += 1;\n    }\n    writeU16(value) {\n        this.maybeResize();\n        this.buf.writeUInt16LE(value, this.length);\n        this.length += 2;\n    }\n    writeU32(value) {\n        this.maybeResize();\n        this.buf.writeUInt32LE(value, this.length);\n        this.length += 4;\n    }\n    writeU64(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 8)));\n    }\n    writeU128(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 16)));\n    }\n    writeU256(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 32)));\n    }\n    writeU512(value) {\n        this.maybeResize();\n        this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 64)));\n    }\n    writeBuffer(buffer) {\n        // Buffer.from is needed as this.buf.subarray can return plain Uint8Array in browser\n        this.buf = Buffer.concat([\n            Buffer.from(this.buf.subarray(0, this.length)),\n            buffer,\n            Buffer.alloc(INITIAL_LENGTH),\n        ]);\n        this.length += buffer.length;\n    }\n    writeString(str) {\n        this.maybeResize();\n        const b = Buffer.from(str, \"utf8\");\n        this.writeU32(b.length);\n        this.writeBuffer(b);\n    }\n    writeFixedArray(array) {\n        this.writeBuffer(Buffer.from(array));\n    }\n    writeArray(array, fn) {\n        this.maybeResize();\n        this.writeU32(array.length);\n        for (const elem of array) {\n            this.maybeResize();\n            fn(elem);\n        }\n    }\n    toArray() {\n        return this.buf.subarray(0, this.length);\n    }\n}\nexports.BinaryWriter = BinaryWriter;\nfunction handlingRangeError(target, propertyKey, propertyDescriptor) {\n    const originalMethod = propertyDescriptor.value;\n    propertyDescriptor.value = function (...args) {\n        try {\n            return originalMethod.apply(this, args);\n        }\n        catch (e) {\n            if (e instanceof RangeError) {\n                const code = e.code;\n                if ([\"ERR_BUFFER_OUT_OF_BOUNDS\", \"ERR_OUT_OF_RANGE\"].indexOf(code) >= 0) {\n                    throw new BorshError(\"Reached the end of buffer when deserializing\");\n                }\n            }\n            throw e;\n        }\n    };\n}\nclass BinaryReader {\n    constructor(buf) {\n        this.buf = buf;\n        this.offset = 0;\n    }\n    readU8() {\n        const value = this.buf.readUInt8(this.offset);\n        this.offset += 1;\n        return value;\n    }\n    readU16() {\n        const value = this.buf.readUInt16LE(this.offset);\n        this.offset += 2;\n        return value;\n    }\n    readU32() {\n        const value = this.buf.readUInt32LE(this.offset);\n        this.offset += 4;\n        return value;\n    }\n    readU64() {\n        const buf = this.readBuffer(8);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU128() {\n        const buf = this.readBuffer(16);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU256() {\n        const buf = this.readBuffer(32);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readU512() {\n        const buf = this.readBuffer(64);\n        return new bn_js_1.default(buf, \"le\");\n    }\n    readBuffer(len) {\n        if (this.offset + len > this.buf.length) {\n            throw new BorshError(`Expected buffer length ${len} isn't within bounds`);\n        }\n        const result = this.buf.slice(this.offset, this.offset + len);\n        this.offset += len;\n        return result;\n    }\n    readString() {\n        const len = this.readU32();\n        const buf = this.readBuffer(len);\n        try {\n            // NOTE: Using TextDecoder to fail on invalid UTF-8\n            return textDecoder.decode(buf);\n        }\n        catch (e) {\n            throw new BorshError(`Error decoding UTF-8 string: ${e}`);\n        }\n    }\n    readFixedArray(len) {\n        return new Uint8Array(this.readBuffer(len));\n    }\n    readArray(fn) {\n        const len = this.readU32();\n        const result = Array();\n        for (let i = 0; i < len; ++i) {\n            result.push(fn());\n        }\n        return result;\n    }\n}\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU8\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU16\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU32\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU64\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU128\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU256\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readU512\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readString\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readFixedArray\", null);\n__decorate([\n    handlingRangeError\n], BinaryReader.prototype, \"readArray\", null);\nexports.BinaryReader = BinaryReader;\nfunction capitalizeFirstLetter(string) {\n    return string.charAt(0).toUpperCase() + string.slice(1);\n}\nfunction serializeField(schema, fieldName, value, fieldType, writer) {\n    try {\n        // TODO: Handle missing values properly (make sure they never result in just skipped write)\n        if (typeof fieldType === \"string\") {\n            writer[`write${capitalizeFirstLetter(fieldType)}`](value);\n        }\n        else if (fieldType instanceof Array) {\n            if (typeof fieldType[0] === \"number\") {\n                if (value.length !== fieldType[0]) {\n                    throw new BorshError(`Expecting byte array of length ${fieldType[0]}, but got ${value.length} bytes`);\n                }\n                writer.writeFixedArray(value);\n            }\n            else if (fieldType.length === 2 && typeof fieldType[1] === \"number\") {\n                if (value.length !== fieldType[1]) {\n                    throw new BorshError(`Expecting byte array of length ${fieldType[1]}, but got ${value.length} bytes`);\n                }\n                for (let i = 0; i < fieldType[1]; i++) {\n                    serializeField(schema, null, value[i], fieldType[0], writer);\n                }\n            }\n            else {\n                writer.writeArray(value, (item) => {\n                    serializeField(schema, fieldName, item, fieldType[0], writer);\n                });\n            }\n        }\n        else if (fieldType.kind !== undefined) {\n            switch (fieldType.kind) {\n                case \"option\": {\n                    if (value === null || value === undefined) {\n                        writer.writeU8(0);\n                    }\n                    else {\n                        writer.writeU8(1);\n                        serializeField(schema, fieldName, value, fieldType.type, writer);\n                    }\n                    break;\n                }\n                case \"map\": {\n                    writer.writeU32(value.size);\n                    value.forEach((val, key) => {\n                        serializeField(schema, fieldName, key, fieldType.key, writer);\n                        serializeField(schema, fieldName, val, fieldType.value, writer);\n                    });\n                    break;\n                }\n                default:\n                    throw new BorshError(`FieldType ${fieldType} unrecognized`);\n            }\n        }\n        else {\n            serializeStruct(schema, value, writer);\n        }\n    }\n    catch (error) {\n        if (error instanceof BorshError) {\n            error.addToFieldPath(fieldName);\n        }\n        throw error;\n    }\n}\nfunction serializeStruct(schema, obj, writer) {\n    if (typeof obj.borshSerialize === \"function\") {\n        obj.borshSerialize(writer);\n        return;\n    }\n    const structSchema = schema.get(obj.constructor);\n    if (!structSchema) {\n        throw new BorshError(`Class ${obj.constructor.name} is missing in schema`);\n    }\n    if (structSchema.kind === \"struct\") {\n        structSchema.fields.map(([fieldName, fieldType]) => {\n            serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n        });\n    }\n    else if (structSchema.kind === \"enum\") {\n        const name = obj[structSchema.field];\n        for (let idx = 0; idx < structSchema.values.length; ++idx) {\n            const [fieldName, fieldType] = structSchema.values[idx];\n            if (fieldName === name) {\n                writer.writeU8(idx);\n                serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n                break;\n            }\n        }\n    }\n    else {\n        throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${obj.constructor.name}`);\n    }\n}\n/// Serialize given object using schema of the form:\n/// { class_name -> [ [field_name, field_type], .. ], .. }\nfunction serialize(schema, obj, Writer = BinaryWriter) {\n    const writer = new Writer();\n    serializeStruct(schema, obj, writer);\n    return writer.toArray();\n}\nexports.serialize = serialize;\nfunction deserializeField(schema, fieldName, fieldType, reader) {\n    try {\n        if (typeof fieldType === \"string\") {\n            return reader[`read${capitalizeFirstLetter(fieldType)}`]();\n        }\n        if (fieldType instanceof Array) {\n            if (typeof fieldType[0] === \"number\") {\n                return reader.readFixedArray(fieldType[0]);\n            }\n            else if (typeof fieldType[1] === \"number\") {\n                const arr = [];\n                for (let i = 0; i < fieldType[1]; i++) {\n                    arr.push(deserializeField(schema, null, fieldType[0], reader));\n                }\n                return arr;\n            }\n            else {\n                return reader.readArray(() => deserializeField(schema, fieldName, fieldType[0], reader));\n            }\n        }\n        if (fieldType.kind === \"option\") {\n            const option = reader.readU8();\n            if (option) {\n                return deserializeField(schema, fieldName, fieldType.type, reader);\n            }\n            return undefined;\n        }\n        if (fieldType.kind === \"map\") {\n            let map = new Map();\n            const length = reader.readU32();\n            for (let i = 0; i < length; i++) {\n                const key = deserializeField(schema, fieldName, fieldType.key, reader);\n                const val = deserializeField(schema, fieldName, fieldType.value, reader);\n                map.set(key, val);\n            }\n            return map;\n        }\n        return deserializeStruct(schema, fieldType, reader);\n    }\n    catch (error) {\n        if (error instanceof BorshError) {\n            error.addToFieldPath(fieldName);\n        }\n        throw error;\n    }\n}\nfunction deserializeStruct(schema, classType, reader) {\n    if (typeof classType.borshDeserialize === \"function\") {\n        return classType.borshDeserialize(reader);\n    }\n    const structSchema = schema.get(classType);\n    if (!structSchema) {\n        throw new BorshError(`Class ${classType.name} is missing in schema`);\n    }\n    if (structSchema.kind === \"struct\") {\n        const result = {};\n        for (const [fieldName, fieldType] of schema.get(classType).fields) {\n            result[fieldName] = deserializeField(schema, fieldName, fieldType, reader);\n        }\n        return new classType(result);\n    }\n    if (structSchema.kind === \"enum\") {\n        const idx = reader.readU8();\n        if (idx >= structSchema.values.length) {\n            throw new BorshError(`Enum index: ${idx} is out of range`);\n        }\n        const [fieldName, fieldType] = structSchema.values[idx];\n        const fieldValue = deserializeField(schema, fieldName, fieldType, reader);\n        return new classType({ [fieldName]: fieldValue });\n    }\n    throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${classType.constructor.name}`);\n}\n/// Deserializes object from bytes using schema.\nfunction deserialize(schema, classType, buffer, Reader = BinaryReader) {\n    const reader = new Reader(buffer);\n    const result = deserializeStruct(schema, classType, reader);\n    if (reader.offset < buffer.length) {\n        throw new BorshError(`Unexpected ${buffer.length - reader.offset} bytes after deserialized data`);\n    }\n    return result;\n}\nexports.deserialize = deserialize;\n/// Deserializes object from bytes using schema, without checking the length read\nfunction deserializeUnchecked(schema, classType, buffer, Reader = BinaryReader) {\n    const reader = new Reader(buffer);\n    return deserializeStruct(schema, classType, reader);\n}\nexports.deserializeUnchecked = deserializeUnchecked;\n\n\n/***/ }),\n\n/***/ 7304:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar basex = __webpack_require__(8162)\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 7191:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nconst basex = __webpack_require__(8247)\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n\n\n/***/ }),\n\n/***/ 8247:\n/***/ (function(module) {\n\n\"use strict\";\n\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (source instanceof Uint8Array) {\n    } else if (ArrayBuffer.isView(source)) {\n      source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n    } else if (Array.isArray(source)) {\n      source = Uint8Array.from(source)\n    }\n    if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return new Uint8Array() }\n    var psz = 0\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (source[psz]) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = new Uint8Array(zeroes + (size - it4))\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n\n\n/***/ }),\n\n/***/ 698:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Support for translating between Buffer instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n *   format} with {@link module:Layout.u8|8-bit}, {@link\n *   module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n *   {@link module:Layout.u32|32-bit}, {@link\n *   module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n *   format} with {@link module:Layout.u16be|16-bit}, {@link\n *   module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n *   {@link module:Layout.u40be|40-bit}, and {@link\n *   module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n *   format} with {@link module:Layout.s8|8-bit}, {@link\n *   module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n *   {@link module:Layout.s32|32-bit}, {@link\n *   module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n *   representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n *   with {@link module:Layout.s16be|16-bit}, {@link\n *   module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n *   {@link module:Layout.s40be|40-bit}, and {@link\n *   module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n *   less than 2^53) or nearby integral Number in {@link\n *   module:Layout.nu64|unsigned little-endian}, {@link\n *   module:Layout.nu64be|unsigned big-endian}, {@link\n *   module:Layout.ns64|signed little-endian}, and {@link\n *   module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n *   module:Layout.f32|little-endian} and {@link\n *   module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n *   module:Layout.f64|little-endian} and {@link\n *   module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n *   encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n *   module:Layout~Layout|Layout}, with JavaScript representation as\n *   an Array and constant or data-dependent {@link\n *   module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n *   heterogeneous sequence of {@link module:Layout~Layout|Layout}\n *   instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n *   module:Layout~VariantLayout|variant layouts} over a fixed\n *   (padded) or variable (not padded) span of bytes, using an\n *   unsigned integer at the start of the data or a separate {@link\n *   module:Layout.unionLayoutDiscriminator|layout element} to\n *   determine which layout to use when interpreting the buffer\n *   contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n *   of individual {@link\n *   module:Layout~BitStructure#addField|BitField}s packed into an 8,\n *   16, 24, or 32-bit unsigned integer starting at the least- or\n *   most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n *   module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n\n\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}.  The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n  constructor(span, property) {\n    if (!Number.isInteger(span)) {\n      throw new TypeError('span must be an integer');\n    }\n\n    /** The span of the layout in bytes.\n     *\n     * Positive values are generally expected.\n     *\n     * Zero will only appear in {@link Constant}s and in {@link\n     * Sequence}s where the {@link Sequence#count|count} is zero.\n     *\n     * A negative value indicates that the span is value-specific, and\n     * must be obtained using {@link Layout#getSpan|getSpan}. */\n    this.span = span;\n\n    /** The property name used when this layout is represented in an\n     * Object.\n     *\n     * Used only for layouts that {@link Layout#decode|decode} to Object\n     * instances.  If left undefined the span of the unnamed layout will\n     * be treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Function to create an Object into which decoded properties will\n   * be written.\n   *\n   * Used only for layouts that {@link Layout#decode|decode} to Object\n   * instances, which means:\n   * * {@link Structure}\n   * * {@link Union}\n   * * {@link VariantLayout}\n   * * {@link BitStructure}\n   *\n   * If left undefined the JavaScript representation of these layouts\n   * will be Object instances.\n   *\n   * See {@link bindConstructorLayout}.\n   */\n  makeDestinationObject() {\n    return {};\n  }\n\n  /**\n   * Decode from a Buffer into an JavaScript value.\n   *\n   * @param {Buffer} b - the buffer from which encoded data is read.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {(Number|Array|Object)} - the value of the decoded data.\n   *\n   * @abstract\n   */\n  decode(b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Encode a JavaScript value into a Buffer.\n   *\n   * @param {(Number|Array|Object)} src - the value to be encoded into\n   * the buffer.  The type accepted depends on the (sub-)type of {@link\n   * Layout}.\n   *\n   * @param {Buffer} b - the buffer into which encoded data will be\n   * written.\n   *\n   * @param {Number} [offset] - the offset at which the encoded data\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @returns {Number} - the number of bytes encoded, including the\n   * space skipped for internal padding, but excluding data such as\n   * {@link Sequence#count|lengths} when stored {@link\n   * ExternalLayout|externally}.  This is the adjustment to `offset`\n   * producing the offset where data for the next layout would be\n   * written.\n   *\n   * @abstract\n   */\n  encode(src, b, offset) {\n    throw new Error('Layout is abstract');\n  }\n\n  /**\n   * Calculate the span of a specific instance of a layout.\n   *\n   * @param {Buffer} b - the buffer that contains an encoded instance.\n   *\n   * @param {Number} [offset] - the offset at which the encoded instance\n   * starts.  If absent a zero offset is inferred.\n   *\n   * @return {Number} - the number of bytes covered by the layout\n   * instance.  If this method is not overridden in a subclass the\n   * definition-time constant {@link Layout#span|span} will be\n   * returned.\n   *\n   * @throws {RangeError} - if the length of the value cannot be\n   * determined.\n   */\n  getSpan(b, offset) {\n    if (0 > this.span) {\n      throw new RangeError('indeterminate span');\n    }\n    return this.span;\n  }\n\n  /**\n   * Replicate the layout using a new property.\n   *\n   * This function must be used to get a structurally-equivalent layout\n   * with a different name since all {@link Layout} instances are\n   * immutable.\n   *\n   * **NOTE** This is a shallow copy.  All fields except {@link\n   * Layout#property|property} are strictly equal to the origin layout.\n   *\n   * @param {String} property - the value for {@link\n   * Layout#property|property} in the replica.\n   *\n   * @returns {Layout} - the copy with {@link Layout#property|property}\n   * set to `property`.\n   */\n  replicate(property) {\n    const rv = Object.create(this.constructor.prototype);\n    Object.assign(rv, this);\n    rv.property = property;\n    return rv;\n  }\n\n  /**\n   * Create an object from layout properties and an array of values.\n   *\n   * **NOTE** This function returns `undefined` if invoked on a layout\n   * that does not return its value as an Object.  Objects are\n   * returned for things that are a {@link Structure}, which includes\n   * {@link VariantLayout|variant layouts} if they are structures, and\n   * excludes {@link Union}s.  If you want this feature for a union\n   * you must use {@link Union.getVariant|getVariant} to select the\n   * desired layout.\n   *\n   * @param {Array} values - an array of values that correspond to the\n   * default order for properties.  As with {@link Layout#decode|decode}\n   * layout elements that have no property name are skipped when\n   * iterating over the array values.  Only the top-level properties are\n   * assigned; arguments are not assigned to properties of contained\n   * layouts.  Any unused values are ignored.\n   *\n   * @return {(Object|undefined)}\n   */\n  fromArray(values) {\n    return undefined;\n  }\n}\nexports.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n  if (lo.property) {\n    return name + '[' + lo.property + ']';\n  }\n  return name;\n}\nexports.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n *    to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n *   property of `layout` is set to a function that returns a `new\n *   Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n *   delegates to {@link Layout#decode|layout.decode}.  The\n *   synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n *   function that delegates to {@link Layout#encode|layout.encode}\n *   with `src` set to `this`.  The synthesized function may be\n *   captured and extended, but when the extension is invoked `this`\n *   must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n  if ('function' !== typeof Class) {\n    throw new TypeError('Class must be constructor');\n  }\n  if (Class.hasOwnProperty('layout_')) {\n    throw new Error('Class is already bound to a layout');\n  }\n  if (!(layout && (layout instanceof Layout))) {\n    throw new TypeError('layout must be a Layout');\n  }\n  if (layout.hasOwnProperty('boundConstructor_')) {\n    throw new Error('layout is already bound to a constructor');\n  }\n  Class.layout_ = layout;\n  layout.boundConstructor_ = Class;\n  layout.makeDestinationObject = (() => new Class());\n  Object.defineProperty(Class.prototype, 'encode', {\n    value: function(b, offset) {\n      return layout.encode(this, b, offset);\n    },\n    writable: true,\n  });\n  Object.defineProperty(Class, 'decode', {\n    value: function(b, offset) {\n      return layout.decode(b, offset);\n    },\n    writable: true,\n  });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n  /**\n   * Return `true` iff the external layout decodes to an unsigned\n   * integer layout.\n   *\n   * In that case it can be used as the source of {@link\n   * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n   * or as {@link UnionLayoutDiscriminator#layout|external union\n   * discriminators}.\n   *\n   * @abstract\n   */\n  isCount() {\n    throw new Error('ExternalLayout is abstract');\n  }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n  constructor(elementSpan, property) {\n    if (undefined === elementSpan) {\n      elementSpan = 1;\n    }\n    if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n      throw new TypeError('elementSpan must be a (positive) integer');\n    }\n    super(-1, property);\n\n    /** The layout for individual elements of the sequence.  The value\n     * must be a positive integer.  If not provided, the value will be\n     * 1. */\n    this.elementSpan = elementSpan;\n  }\n\n  /** @override */\n  isCount() {\n    return true;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rem = b.length - offset;\n    return Math.floor(rem / this.elementSpan);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    return 0;\n  }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout.  The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}.  Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}.  If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n  constructor(layout, offset, property) {\n    if (!(layout instanceof Layout)) {\n      throw new TypeError('layout must be a Layout');\n    }\n\n    if (undefined === offset) {\n      offset = 0;\n    } else if (!Number.isInteger(offset)) {\n      throw new TypeError('offset must be integer or undefined');\n    }\n\n    super(layout.span, property || layout.property);\n\n    /** The subordinated layout. */\n    this.layout = layout;\n\n    /** The location of {@link OffsetLayout#layout} relative to the\n     * start of another layout.\n     *\n     * The value may be positive or negative, but an error will thrown\n     * if at the point of use it goes outside the span of the Buffer\n     * being accessed.  */\n    this.offset = offset;\n  }\n\n  /** @override */\n  isCount() {\n    return ((this.layout instanceof UInt)\n            || (this.layout instanceof UIntBE));\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.decode(b, offset + this.offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return this.layout.encode(src, b, offset + this.offset);\n  }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n *  module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n *  module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n *  module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n  constructor(span, property) {\n    super( span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readUIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeUIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n *  module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n *  module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n *  module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntLE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntLE(src, offset, this.span);\n    return this.span;\n  }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n  constructor(span, property) {\n    super(span, property);\n    if (6 < this.span) {\n      throw new RangeError('span must not exceed 6 bytes');\n    }\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readIntBE(offset, this.span);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeIntBE(src, offset, this.span);\n    return this.span;\n  }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n  const hi32 = Math.floor(src / V2E32);\n  const lo32 = src - (hi32 * V2E32);\n  return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n  return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readUInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeUInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readUInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const lo32 = b.readUInt32LE(offset);\n    const hi32 = b.readInt32LE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeUInt32LE(split.lo32, offset);\n    b.writeInt32LE(split.hi32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const hi32 = b.readInt32BE(offset);\n    const lo32 = b.readUInt32BE(offset + 4);\n    return roundedInt64(hi32, lo32);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const split = divmodInt64(src);\n    b.writeInt32BE(split.hi32, offset);\n    b.writeUInt32BE(split.lo32, offset + 4);\n    return 8;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatLE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n  constructor(property) {\n    super(4, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readFloatBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeFloatBE(src, offset);\n    return 4;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleLE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleLE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n  constructor(property) {\n    super(8, property);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.readDoubleBE(offset);\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    b.writeDoubleBE(src, offset);\n    return 8;\n  }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}.  The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n  constructor(elementLayout, count, property) {\n    if (!(elementLayout instanceof Layout)) {\n      throw new TypeError('elementLayout must be a Layout');\n    }\n    if (!(((count instanceof ExternalLayout) && count.isCount())\n          || (Number.isInteger(count) && (0 <= count)))) {\n      throw new TypeError('count must be non-negative integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n    let span = -1;\n    if ((!(count instanceof ExternalLayout))\n        && (0 < elementLayout.span)) {\n      span = count * elementLayout.span;\n    }\n\n    super(span, property);\n\n    /** The layout for individual elements of the sequence. */\n    this.elementLayout = elementLayout;\n\n    /** The number of elements in the sequence.\n     *\n     * This will be either a non-negative integer or an instance of\n     * {@link ExternalLayout} for which {@link\n     * ExternalLayout#isCount|isCount()} is `true`. */\n    this.count = count;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    if (0 < this.elementLayout.span) {\n      span = count * this.elementLayout.span;\n    } else {\n      let idx = 0;\n      while (idx < count) {\n        span += this.elementLayout.getSpan(b, offset + span);\n        ++idx;\n      }\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const rv = [];\n    let i = 0;\n    let count = this.count;\n    if (count instanceof ExternalLayout) {\n      count = count.decode(b, offset);\n    }\n    while (i < count) {\n      rv.push(this.elementLayout.decode(b, offset));\n      offset += this.elementLayout.getSpan(b, offset);\n      i += 1;\n    }\n    return rv;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n   *\n   * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n   * the unused space in the buffer is left unchanged.  If `src` is\n   * longer than {@link Sequence#count|count} the unneeded elements are\n   * ignored.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const elo = this.elementLayout;\n    const span = src.reduce((span, v) => {\n      return span + elo.encode(v, b, offset + span);\n    }, 0);\n    if (this.count instanceof ExternalLayout) {\n      this.count.encode(src.length, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span.  When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage.  We can only identify the value\n * for a field when it has a {@link Layout#property|property}.  As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}.  An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n  constructor(fields, property, decodePrefixes) {\n    if (!(Array.isArray(fields)\n          && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n      throw new TypeError('fields must be array of Layout instances');\n    }\n    if (('boolean' === typeof property)\n        && (undefined === decodePrefixes)) {\n      decodePrefixes = property;\n      property = undefined;\n    }\n\n    /* Verify absence of unnamed variable-length fields. */\n    for (const fd of fields) {\n      if ((0 > fd.span)\n          && (undefined === fd.property)) {\n        throw new Error('fields cannot contain unnamed variable-length layout');\n      }\n    }\n\n    let span = -1;\n    try {\n      span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n    } catch (e) {\n    }\n    super(span, property);\n\n    /** The sequence of {@link Layout} values that comprise the\n     * structure.\n     *\n     * The individual elements need not be the same type, and may be\n     * either scalar or aggregate layouts.  If a member layout leaves\n     * its {@link Layout#property|property} undefined the\n     * corresponding region of the buffer associated with the element\n     * will not be mutated.\n     *\n     * @type {Layout[]} */\n    this.fields = fields;\n\n    /** Control behavior of {@link Layout#decode|decode()} given short\n     * buffers.\n     *\n     * In some situations a structure many be extended with additional\n     * fields over time, with older installations providing only a\n     * prefix of the full structure.  If this property is `true`\n     * decoding will accept those buffers and leave subsequent fields\n     * undefined, as long as the buffer ends at a field boundary.\n     * Defaults to `false`. */\n    this.decodePrefixes = !!decodePrefixes;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = 0;\n    try {\n      span = this.fields.reduce((span, fd) => {\n        const fsp = fd.getSpan(b, offset);\n        offset += fsp;\n        return span + fsp;\n      }, 0);\n    } catch (e) {\n      throw new RangeError('indeterminate span');\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(b, offset);\n      }\n      offset += fd.getSpan(b, offset);\n      if (this.decodePrefixes\n          && (b.length === offset)) {\n        break;\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Structure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the buffer is\n   * left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const firstOffset = offset;\n    let lastOffset = 0;\n    let lastWrote = 0;\n    for (const fd of this.fields) {\n      let span = fd.span;\n      lastWrote = (0 < span) ? span : 0;\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          lastWrote = fd.encode(fv, b, offset);\n          if (0 > span) {\n            /* Read the as-encoded span, which is not necessarily the\n             * same as what we wrote. */\n            span = fd.getSpan(b, offset);\n          }\n        }\n      }\n      lastOffset = offset;\n      offset += span;\n    }\n    /* Use (lastOffset + lastWrote) instead of offset because the last\n     * item may have had a dynamic length and we don't want to include\n     * the padding between it and the end of the space reserved for\n     * it. */\n    return (lastOffset + lastWrote) - firstOffset;\n  }\n\n  /** @override */\n  fromArray(values) {\n    const dest = this.makeDestinationObject();\n    for (const fd of this.fields) {\n      if ((undefined !== fd.property)\n          && (0 < values.length)) {\n        dest[fd.property] = values.shift();\n      }\n    }\n    return dest;\n  }\n\n  /**\n   * Get access to the layout of a given property.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Layout} - the layout associated with `property`, or\n   * undefined if there is no such property.\n   */\n  layoutFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n\n  /**\n   * Get the offset of a structure member.\n   *\n   * @param {String} property - the structure member of interest.\n   *\n   * @return {Number} - the offset in bytes to the start of `property`\n   * within the structure, or undefined if `property` is not a field\n   * within the structure.  If the property is a member but follows a\n   * variable-length structure member a negative number will be\n   * returned.\n   */\n  offsetOf(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    let offset = 0;\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return offset;\n      }\n      if (0 > fd.span) {\n        offset = -1;\n      } else if (0 <= offset) {\n        offset += fd.span;\n      }\n    }\n  }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n  constructor(property) {\n    /** The {@link Layout#property|property} to be used when the\n     * discriminator is referenced in isolation (generally when {@link\n     * Union#decode|Union decode} cannot delegate to a specific\n     * variant). */\n    this.property = property;\n  }\n\n  /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n   *\n   * The implementation of this method need not reference the buffer if\n   * variant information is available through other means. */\n  decode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n\n  /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n   *\n   * The implementation of this method need not store the value if\n   * variant information is maintained through other means. */\n  encode() {\n    throw new Error('UnionDiscriminator is abstract');\n  }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}.  Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n  constructor(layout, property) {\n    if (!((layout instanceof ExternalLayout)\n          && layout.isCount())) {\n      throw new TypeError('layout must be an unsigned integer ExternalLayout');\n    }\n\n    super(property || layout.property || 'variant');\n\n    /** The {@link ExternalLayout} used to access the discriminator\n     * value. */\n    this.layout = layout;\n  }\n\n  /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  decode(b, offset) {\n    return this.layout.decode(b, offset);\n  }\n\n  /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n  encode(src, b, offset) {\n    return this.layout.encode(src, b, offset);\n  }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}.  The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}.  If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used).  The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents.  The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}).  When a non-external layout element is passed the layout\n * appears at the start of the union.  In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}.  If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception.  A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n  constructor(discr, defaultLayout, property) {\n    const upv = ((discr instanceof UInt)\n               || (discr instanceof UIntBE));\n    if (upv) {\n      discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n    } else if ((discr instanceof ExternalLayout)\n               && discr.isCount()) {\n      discr = new UnionLayoutDiscriminator(discr);\n    } else if (!(discr instanceof UnionDiscriminator)) {\n      throw new TypeError('discr must be a UnionDiscriminator '\n                          + 'or an unsigned integer layout');\n    }\n    if (undefined === defaultLayout) {\n      defaultLayout = null;\n    }\n    if (!((null === defaultLayout)\n          || (defaultLayout instanceof Layout))) {\n      throw new TypeError('defaultLayout must be null or a Layout');\n    }\n    if (null !== defaultLayout) {\n      if (0 > defaultLayout.span) {\n        throw new Error('defaultLayout must have constant span');\n      }\n      if (undefined === defaultLayout.property) {\n        defaultLayout = defaultLayout.replicate('content');\n      }\n    }\n\n    /* The union span can be estimated only if there's a default\n     * layout.  The union spans its default layout, plus any prefix\n     * variant layout.  By construction both layouts, if present, have\n     * non-negative span. */\n    let span = -1;\n    if (defaultLayout) {\n      span = defaultLayout.span;\n      if ((0 <= span) && upv) {\n        span += discr.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The interface for the discriminator value in isolation.\n     *\n     * This a {@link UnionDiscriminator} either passed to the\n     * constructor or synthesized from the `discr` constructor\n     * argument.  {@link\n     * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n     * `true` iff the `discr` parameter was a non-offset {@link\n     * Layout} instance. */\n    this.discriminator = discr;\n\n    /** `true` if the {@link Union#discriminator|discriminator} is the\n     * first field in the union.\n     *\n     * If `false` the discriminator is obtained from somewhere\n     * else. */\n    this.usesPrefixDiscriminator = upv;\n\n    /** The layout for non-discriminator content when the value of the\n     * discriminator is not recognized.\n     *\n     * This is the value passed to the constructor.  It is\n     * structurally equivalent to the second component of {@link\n     * Union#layout|layout} but may have a different property\n     * name. */\n    this.defaultLayout = defaultLayout;\n\n    /** A registry of allowed variants.\n     *\n     * The keys are unsigned integers which should be compatible with\n     * {@link Union.discriminator|discriminator}.  The property value\n     * is the corresponding {@link VariantLayout} instances assigned\n     * to this union by {@link Union#addVariant|addVariant}.\n     *\n     * **NOTE** The registry remains mutable so that variants can be\n     * {@link Union#addVariant|added} at any time.  Users should not\n     * manipulate the content of this property. */\n    this.registry = {};\n\n    /* Private variable used when invoking getSourceVariant */\n    let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n    /** Function to infer the variant selected by a source object.\n     *\n     * Defaults to {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n     * be overridden using {@link\n     * Union#configGetSourceVariant|configGetSourceVariant}.\n     *\n     * @param {Object} src - as with {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * @returns {(undefined|VariantLayout)} The default variant\n     * (`undefined`) or first registered variant that uses a property\n     * available in `src`. */\n    this.getSourceVariant = function(src) {\n      return boundGetSourceVariant(src);\n    };\n\n    /** Function to override the implementation of {@link\n     * Union#getSourceVariant|getSourceVariant}.\n     *\n     * Use this if the desired variant cannot be identified using the\n     * algorithm of {@link\n     * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n     *\n     * **NOTE** The provided function will be invoked bound to this\n     * Union instance, providing local access to {@link\n     * Union#registry|registry}.\n     *\n     * @param {Function} gsv - a function that follows the API of\n     * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n    this.configGetSourceVariant = function(gsv) {\n      boundGetSourceVariant = gsv.bind(this);\n    };\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Default layouts always have non-negative span, so we don't have\n     * one and we have to recognize the variant which will in turn\n     * determine the span. */\n    const vlo = this.getVariant(b, offset);\n    if (!vlo) {\n      throw new Error('unable to determine span for unrecognized variant');\n    }\n    return vlo.getSpan(b, offset);\n  }\n\n  /**\n   * Method to infer a registered Union variant compatible with `src`.\n   *\n   * The first satisified rule in the following sequence defines the\n   * return value:\n   * * If `src` has properties matching the Union discriminator and\n   *   the default layout, `undefined` is returned regardless of the\n   *   value of the discriminator property (this ensures the default\n   *   layout will be used);\n   * * If `src` has a property matching the Union discriminator, the\n   *   value of the discriminator identifies a registered variant, and\n   *   either (a) the variant has no layout, or (b) `src` has the\n   *   variant's property, then the variant is returned (because the\n   *   source satisfies the constraints of the variant it identifies);\n   * * If `src` does not have a property matching the Union\n   *   discriminator, but does have a property matching a registered\n   *   variant, then the variant is returned (because the source\n   *   matches a variant without an explicit conflict);\n   * * An error is thrown (because we either can't identify a variant,\n   *   or we were explicitly told the variant but can't satisfy it).\n   *\n   * @param {Object} src - an object presumed to be compatible with\n   * the content of the Union.\n   *\n   * @return {(undefined|VariantLayout)} - as described above.\n   *\n   * @throws {Error} - if `src` cannot be associated with a default or\n   * registered variant.\n   */\n  defaultGetSourceVariant(src) {\n    if (src.hasOwnProperty(this.discriminator.property)) {\n      if (this.defaultLayout\n          && src.hasOwnProperty(this.defaultLayout.property)) {\n        return undefined;\n      }\n      const vlo = this.registry[src[this.discriminator.property]];\n      if (vlo\n          && ((!vlo.layout)\n              || src.hasOwnProperty(vlo.property))) {\n        return vlo;\n      }\n    } else {\n      for (const tag in this.registry) {\n        const vlo = this.registry[tag];\n        if (src.hasOwnProperty(vlo.property)) {\n          return vlo;\n        }\n      }\n    }\n    throw new Error('unable to infer src variant');\n  }\n\n  /** Implement {@link Layout#decode|decode} for {@link Union}.\n   *\n   * If the variant is {@link Union#addVariant|registered} the return\n   * value is an instance of that variant, with no explicit\n   * discriminator.  Otherwise the {@link Union#defaultLayout|default\n   * layout} is used to decode the content. */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let dest;\n    const dlo = this.discriminator;\n    const discr = dlo.decode(b, offset);\n    let clo = this.registry[discr];\n    if (undefined === clo) {\n      let contentOffset = 0;\n      clo = this.defaultLayout;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dest = this.makeDestinationObject();\n      dest[dlo.property] = discr;\n      dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n    } else {\n      dest = clo.decode(b, offset);\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Union}.\n   *\n   * This API assumes the `src` object is consistent with the union's\n   * {@link Union#defaultLayout|default layout}.  To encode variants\n   * use the appropriate variant-specific {@link VariantLayout#encode}\n   * method. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const vlo = this.getSourceVariant(src);\n    if (undefined === vlo) {\n      const dlo = this.discriminator;\n      const clo = this.defaultLayout;\n      let contentOffset = 0;\n      if (this.usesPrefixDiscriminator) {\n        contentOffset = dlo.layout.span;\n      }\n      dlo.encode(src[dlo.property], b, offset);\n      return contentOffset + clo.encode(src[clo.property], b,\n                                        offset + contentOffset);\n    }\n    return vlo.encode(src, b, offset);\n  }\n\n  /** Register a new variant structure within a union.  The newly\n   * created variant is returned.\n   *\n   * @param {Number} variant - initializer for {@link\n   * VariantLayout#variant|variant}.\n   *\n   * @param {Layout} layout - initializer for {@link\n   * VariantLayout#layout|layout}.\n   *\n   * @param {String} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {VariantLayout} */\n  addVariant(variant, layout, property) {\n    const rv = new VariantLayout(this, variant, layout, property);\n    this.registry[variant] = rv;\n    return rv;\n  }\n\n  /**\n   * Get the layout associated with a registered variant.\n   *\n   * If `vb` does not produce a registered variant the function returns\n   * `undefined`.\n   *\n   * @param {(Number|Buffer)} vb - either the variant number, or a\n   * buffer from which the discriminator is to be read.\n   *\n   * @param {Number} offset - offset into `vb` for the start of the\n   * union.  Used only when `vb` is an instance of {Buffer}.\n   *\n   * @return {({VariantLayout}|undefined)}\n   */\n  getVariant(vb, offset) {\n    let variant = vb;\n    if (Buffer.isBuffer(vb)) {\n      if (undefined === offset) {\n        offset = 0;\n      }\n      variant = this.discriminator.decode(vb, offset);\n    }\n    return this.registry[variant];\n  }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly.  Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}.  If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.  Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}.  The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n  constructor(union, variant, layout, property) {\n    if (!(union instanceof Union)) {\n      throw new TypeError('union must be a Union');\n    }\n    if ((!Number.isInteger(variant)) || (0 > variant)) {\n      throw new TypeError('variant must be a (non-negative) integer');\n    }\n    if (('string' === typeof layout)\n        && (undefined === property)) {\n      property = layout;\n      layout = null;\n    }\n    if (layout) {\n      if (!(layout instanceof Layout)) {\n        throw new TypeError('layout must be a Layout');\n      }\n      if ((null !== union.defaultLayout)\n          && (0 <= layout.span)\n          && (layout.span > union.defaultLayout.span)) {\n        throw new Error('variant span exceeds span of containing union');\n      }\n      if ('string' !== typeof property) {\n        throw new TypeError('variant must have a String property');\n      }\n    }\n    let span = union.span;\n    if (0 > union.span) {\n      span = layout ? layout.span : 0;\n      if ((0 <= span) && union.usesPrefixDiscriminator) {\n        span += union.discriminator.layout.span;\n      }\n    }\n    super(span, property);\n\n    /** The {@link Union} to which this variant belongs. */\n    this.union = union;\n\n    /** The unsigned integral value identifying this variant within\n     * the {@link Union#discriminator|discriminator} of the containing\n     * union. */\n    this.variant = variant;\n\n    /** The {@link Layout} to be used when reading/writing the\n     * non-discriminator part of the {@link\n     * VariantLayout#union|union}.  If `null` the variant carries no\n     * data. */\n    this.layout = layout || null;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (0 <= this.span) {\n      /* Will be equal to the containing union span if that is not\n       * variable. */\n      return this.span;\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    /* Span is defined solely by the variant (and prefix discriminator) */\n    return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    if (this !== this.union.getVariant(b, offset)) {\n      throw new Error('variant mismatch');\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout) {\n      dest[this.property] = this.layout.decode(b, offset + contentOffset);\n    } else if (this.property) {\n      dest[this.property] = true;\n    } else if (this.union.usesPrefixDiscriminator) {\n      dest[this.union.discriminator.property] = this.variant;\n    }\n    return dest;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let contentOffset = 0;\n    if (this.union.usesPrefixDiscriminator) {\n      contentOffset = this.union.discriminator.layout.span;\n    }\n    if (this.layout\n        && (!src.hasOwnProperty(this.property))) {\n      throw new TypeError('variant lacks property ' + this.property);\n    }\n    this.union.discriminator.encode(this.variant, b, offset);\n    let span = contentOffset;\n    if (this.layout) {\n      this.layout.encode(src[this.property], b, offset + contentOffset);\n      span += this.layout.getSpan(b, offset + contentOffset);\n      if ((0 <= this.union.span)\n          && (span > this.union.span)) {\n        throw new Error('encoded variant overruns containing union');\n      }\n    }\n    return span;\n  }\n\n  /** Delegate {@link Layout#fromArray|fromArray} to {@link\n   * VariantLayout#layout|layout}. */\n  fromArray(values) {\n    if (this.layout) {\n      return this.layout.fromArray(values);\n    }\n  }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative.  For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n  if (0 > v) {\n    v += 0x100000000;\n  }\n  return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties.  The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}.  The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word.  If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n  constructor(word, msb, property) {\n    if (!((word instanceof UInt)\n          || (word instanceof UIntBE))) {\n      throw new TypeError('word must be a UInt or UIntBE layout');\n    }\n    if (('string' === typeof msb)\n        && (undefined === property)) {\n      property = msb;\n      msb = undefined;\n    }\n    if (4 < word.span) {\n      throw new RangeError('word cannot exceed 32 bits');\n    }\n    super(word.span, property);\n\n    /** The layout used for the packed value.  {@link BitField}\n     * instances are packed sequentially depending on {@link\n     * BitStructure#msb|msb}. */\n    this.word = word;\n\n    /** Whether the bit sequences are packed starting at the most\n     * significant bit growing down (`true`), or the least significant\n     * bit growing up (`false`).\n     *\n     * **NOTE** Regardless of this value, the least significant bit of\n     * any {@link BitField} value is the least significant bit of the\n     * corresponding section of the packed value. */\n    this.msb = !!msb;\n\n    /** The sequence of {@link BitField} layouts that comprise the\n     * packed structure.\n     *\n     * **NOTE** The array remains mutable to allow fields to be {@link\n     * BitStructure#addField|added} after construction.  Users should\n     * not manipulate the content of this property.*/\n    this.fields = [];\n\n    /* Storage for the value.  Capture a variable instead of using an\n     * instance property because we don't want anything to change the\n     * value without going through the mutator. */\n    let value = 0;\n    this._packedSetValue = function(v) {\n      value = fixBitwiseResult(v);\n      return this;\n    };\n    this._packedGetValue = function() {\n      return value;\n    };\n  }\n\n  /** @override */\n  decode(b, offset) {\n    const dest = this.makeDestinationObject();\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        dest[fd.property] = fd.decode(value);\n      }\n    }\n    return dest;\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n   *\n   * If `src` is missing a property for a member with a defined {@link\n   * Layout#property|property} the corresponding region of the packed\n   * value is left unmodified.  Unused bits are also left unmodified. */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    const value = this.word.decode(b, offset);\n    this._packedSetValue(value);\n    for (const fd of this.fields) {\n      if (undefined !== fd.property) {\n        const fv = src[fd.property];\n        if (undefined !== fv) {\n          fd.encode(fv);\n        }\n      }\n    }\n    return this.word.encode(this._packedGetValue(), b, offset);\n  }\n\n  /** Register a new bitfield with a containing bit structure.  The\n   * resulting bitfield is returned.\n   *\n   * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {BitField} */\n  addField(bits, property) {\n    const bf = new BitField(this, bits, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /** As with {@link BitStructure#addField|addField} for single-bit\n   * fields with `boolean` value representation.\n   *\n   * @param {string} property - initializer for {@link\n   * Layout#property|property}.\n   *\n   * @return {Boolean} */\n  addBoolean(property) {\n    // This is my Boolean, not the Javascript one.\n    // eslint-disable-next-line no-new-wrappers\n    const bf = new Boolean(this, property);\n    this.fields.push(bf);\n    return bf;\n  }\n\n  /**\n   * Get access to the bit field for a given property.\n   *\n   * @param {String} property - the bit field of interest.\n   *\n   * @return {BitField} - the field associated with `property`, or\n   * undefined if there is no such property.\n   */\n  fieldFor(property) {\n    if ('string' !== typeof property) {\n      throw new TypeError('property must be string');\n    }\n    for (const fd of this.fields) {\n      if (fd.property === property) {\n        return fd;\n      }\n    }\n  }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n  constructor(container, bits, property) {\n    if (!(container instanceof BitStructure)) {\n      throw new TypeError('container must be a BitStructure');\n    }\n    if ((!Number.isInteger(bits)) || (0 >= bits)) {\n      throw new TypeError('bits must be positive integer');\n    }\n    const totalBits = 8 * container.span;\n    const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n    if ((bits + usedBits) > totalBits) {\n      throw new Error('bits too long for span remainder ('\n                      + (totalBits - usedBits) + ' of '\n                      + totalBits + ' remain)');\n    }\n\n    /** The {@link BitStructure} instance to which this bit field\n     * belongs. */\n    this.container = container;\n\n    /** The span of this value in bits. */\n    this.bits = bits;\n\n    /** A mask of {@link BitField#bits|bits} bits isolating value bits\n     * that fit within the field.\n     *\n     * That is, it masks a value that has not yet been shifted into\n     * position within its containing packed integer. */\n    this.valueMask = (1 << bits) - 1;\n    if (32 === bits) { // shifted value out of range\n      this.valueMask = 0xFFFFFFFF;\n    }\n\n    /** The offset of the value within the containing packed unsigned\n     * integer.  The least significant bit of the packed value is at\n     * offset zero, regardless of bit ordering used. */\n    this.start = usedBits;\n    if (this.container.msb) {\n      this.start = totalBits - usedBits - bits;\n    }\n\n    /** A mask of {@link BitField#bits|bits} isolating the field value\n     * within the containing packed unsigned integer. */\n    this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n    /** The property name used when this bitfield is represented in an\n     * Object.\n     *\n     * Intended to be functionally equivalent to {@link\n     * Layout#property}.\n     *\n     * If left undefined the corresponding span of bits will be\n     * treated as padding: it will not be mutated by {@link\n     * Layout#encode|encode} nor represented as a property in the\n     * decoded Object. */\n    this.property = property;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field. */\n  decode() {\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(word & this.wordMask);\n    const value = wordValue >>> this.start;\n    return value;\n  }\n\n  /** Store a value into the corresponding subsequence of the containing\n   * bit field.\n   *\n   * **NOTE** This is not a specialization of {@link\n   * Layout#encode|Layout.encode} and there is no return value. */\n  encode(value) {\n    if ((!Number.isInteger(value))\n        || (value !== fixBitwiseResult(value & this.valueMask))) {\n      throw new TypeError(nameWithProperty('BitField.encode', this)\n                          + ' value must be integer not exceeding ' + this.valueMask);\n    }\n    const word = this.container._packedGetValue();\n    const wordValue = fixBitwiseResult(value << this.start);\n    this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n                                   | wordValue);\n  };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n  constructor(container, property) {\n    super(container, 1, property);\n  }\n\n  /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n   *\n   * @returns {boolean} */\n  decode(b, offset) {\n    return !!BitField.prototype.decode.call(this, b, offset);\n  }\n\n  /** @override */\n  encode(value) {\n    if ('boolean' === typeof value) {\n      // BitField requires integer values\n      value = +value;\n    }\n    return BitField.prototype.encode.call(this, value);\n  }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n  constructor(length, property) {\n    if (!(((length instanceof ExternalLayout) && length.isCount())\n          || (Number.isInteger(length) && (0 <= length)))) {\n      throw new TypeError('length must be positive integer '\n                          + 'or an unsigned integer ExternalLayout');\n    }\n\n    let span = -1;\n    if (!(length instanceof ExternalLayout)) {\n      span = length;\n    }\n    super(span, property);\n\n    /** The number of bytes in the blob.\n     *\n     * This may be a non-negative integer, or an instance of {@link\n     * ExternalLayout} that satisfies {@link\n     * ExternalLayout#isCount|isCount()}. */\n    this.length = length;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return span;\n  }\n\n  /** @override */\n  decode(b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.span;\n    if (0 > span) {\n      span = this.length.decode(b, offset);\n    }\n    return b.slice(offset, offset + span);\n  }\n\n  /** Implement {@link Layout#encode|encode} for {@link Blob}.\n   *\n   * **NOTE** If {@link Layout#count|count} is an instance of {@link\n   * ExternalLayout} then the length of `src` will be encoded as the\n   * count after `src` is encoded. */\n  encode(src, b, offset) {\n    let span = this.length;\n    if (this.length instanceof ExternalLayout) {\n      span = src.length;\n    }\n    if (!(Buffer.isBuffer(src)\n          && (span === src.length))) {\n      throw new TypeError(nameWithProperty('Blob.encode', this)\n                          + ' requires (length ' + span + ') Buffer as src');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    b.write(src.toString('hex'), offset, span, 'hex');\n    if (this.length instanceof ExternalLayout) {\n      this.length.encode(span, b, offset);\n    }\n    return span;\n  }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n  constructor(property) {\n    super(-1, property);\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let idx = offset;\n    while ((idx < b.length) && (0 !== b[idx])) {\n      idx += 1;\n    }\n    return 1 + idx - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    return b.slice(offset, offset + span - 1).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    b[offset + span] = 0;\n    return span + 1;\n  }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content.  If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n  constructor(maxSpan, property) {\n    if (('string' === typeof maxSpan)\n        && (undefined === property)) {\n      property = maxSpan;\n      maxSpan = undefined;\n    }\n    if (undefined === maxSpan) {\n      maxSpan = -1;\n    } else if (!Number.isInteger(maxSpan)) {\n      throw new TypeError('maxSpan must be an integer');\n    }\n\n    super(-1, property);\n\n    /** The maximum span of the layout in bytes.\n     *\n     * Positive values are generally expected.  Zero is abnormal.\n     * Attempts to encode or decode a value that exceeds this length\n     * will throw a `RangeError`.\n     *\n     * A negative value indicates that there is no bound on the length\n     * of the content. */\n    this.maxSpan = maxSpan;\n  }\n\n  /** @override */\n  getSpan(b, offset) {\n    if (!Buffer.isBuffer(b)) {\n      throw new TypeError('b must be a Buffer');\n    }\n    if (undefined === offset) {\n      offset = 0;\n    }\n    return b.length - offset;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    let span = this.getSpan(b, offset);\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    return b.slice(offset, offset + span).toString('utf-8');\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    if (undefined === offset) {\n      offset = 0;\n    }\n    /* Must force this to a string, lest it be a number and the\n     * \"utf8-encoding\" below actually allocate a buffer of length\n     * src */\n    if ('string' !== typeof src) {\n      src = src.toString();\n    }\n    const srcb = new Buffer(src, 'utf8');\n    const span = srcb.length;\n    if ((0 <= this.maxSpan)\n        && (this.maxSpan < span)) {\n      throw new RangeError('text length exceeds maxSpan');\n    }\n    if ((offset + span) > b.length) {\n      throw new RangeError('encoding overruns Buffer');\n    }\n    srcb.copy(b, offset);\n    return span;\n  }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding.  An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}.  If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n  constructor(value, property) {\n    super(0, property);\n\n    /** The value produced by this constant when the layout is {@link\n     * Constant#decode|decoded}.\n     *\n     * Any JavaScript value including `null` and `undefined` is\n     * permitted.\n     *\n     * **WARNING** If `value` passed in the constructor was not\n     * frozen, it is possible for users of decoded values to change\n     * the content of the value. */\n    this.value = value;\n  }\n\n  /** @override */\n  decode(b, offset, dest) {\n    return this.value;\n  }\n\n  /** @override */\n  encode(src, b, offset) {\n    /* Constants take no space */\n    return 0;\n  }\n}\n\nexports.ExternalLayout = ExternalLayout;\nexports.GreedyCount = GreedyCount;\nexports.OffsetLayout = OffsetLayout;\nexports.UInt = UInt;\nexports.UIntBE = UIntBE;\nexports.Int = Int;\nexports.IntBE = IntBE;\nexports.Float = Float;\nexports.FloatBE = FloatBE;\nexports.Double = Double;\nexports.DoubleBE = DoubleBE;\nexports.Sequence = Sequence;\nexports.Structure = Structure;\nexports.UnionDiscriminator = UnionDiscriminator;\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nexports.Union = Union;\nexports.VariantLayout = VariantLayout;\nexports.BitStructure = BitStructure;\nexports.BitField = BitField;\nexports.Boolean = Boolean;\nexports.Blob = Blob;\nexports.CString = CString;\nexports.UTF8 = UTF8;\nexports.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nexports.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nexports[\"const\"] = ((value, property) => new Constant(value, property));\n\n\n/***/ }),\n\n/***/ 8764:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n\n\nconst base64 = __webpack_require__(9742)\nconst ieee754 = __webpack_require__(645)\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n\n\n/***/ }),\n\n/***/ 1924:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar GetIntrinsic = __webpack_require__(210);\n\nvar callBind = __webpack_require__(5559);\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n\n\n/***/ }),\n\n/***/ 5559:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar bind = __webpack_require__(8612);\nvar GetIntrinsic = __webpack_require__(210);\nvar setFunctionLength = __webpack_require__(7771);\n\nvar $TypeError = __webpack_require__(4453);\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $defineProperty = __webpack_require__(4429);\nvar $max = GetIntrinsic('%Math.max%');\n\nmodule.exports = function callBind(originalFunction) {\n\tif (typeof originalFunction !== 'function') {\n\t\tthrow new $TypeError('a function is required');\n\t}\n\tvar func = $reflectApply(bind, $call, arguments);\n\treturn setFunctionLength(\n\t\tfunc,\n\t\t1 + $max(0, originalFunction.length - (arguments.length - 1)),\n\t\ttrue\n\t);\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n\n\n/***/ }),\n\n/***/ 3204:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nconst preserveCamelCase = string => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && /[a-zA-Z]/.test(character) && character.toUpperCase() === character) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && /[a-zA-Z]/.test(character) && character.toLowerCase() === character) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = character.toLowerCase() === character && character.toUpperCase() !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = character.toUpperCase() === character && character.toLowerCase() !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = Object.assign({\n\t\tpascalCase: false\n\t}, options);\n\n\tconst postProcess = x => options.pascalCase ? x.charAt(0).toUpperCase() + x.slice(1) : x;\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? input.toUpperCase() : input.toLowerCase();\n\t}\n\n\tconst hasUpperCase = input !== input.toLowerCase();\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input);\n\t}\n\n\tinput = input\n\t\t.replace(/^[_.\\- ]+/, '')\n\t\t.toLowerCase()\n\t\t.replace(/[_.\\- ]+(\\w|$)/g, (_, p1) => p1.toUpperCase())\n\t\t.replace(/\\d+(\\w|$)/g, m => m.toUpperCase());\n\n\treturn postProcess(input);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports[\"default\"] = camelCase;\n\n\n/***/ }),\n\n/***/ 9887:\n/***/ (function(module, exports, __webpack_require__) {\n\nvar __WEBPACK_AMD_DEFINE_RESULT__;/*! decimal.js-light v2.5.1 https://github.com/MikeMcl/decimal.js-light/LICENCE */\r\n;(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js-light v2.5.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js-light\r\n   *  Copyright (c) 2020 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Expat Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  var MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    Decimal = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed during run-time using `Decimal.config`.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used by default by `toInteger`, `toDecimalPlaces`, `toExponential`,\r\n      // `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -MAX_E\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to MAX_E\r\n\r\n      // The natural logarithm of 10.\r\n      // 115 digits\r\n      LN10: '2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286'\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    exponentOutOfRange = decimalError + 'Exponent out of range: ',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    ONE,\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n    MAX_E = mathfloor(MAX_SAFE_INTEGER / LOG_BASE),    // 1286742750677284\r\n\r\n    // Decimal.prototype object\r\n    P = {};\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue                       abs\r\n   *  comparedTo                          cmp\r\n   *  decimalPlaces                       dp\r\n   *  dividedBy                           div\r\n   *  dividedToIntegerBy                  idiv\r\n   *  equals                              eq\r\n   *  exponent\r\n   *  greaterThan                         gt\r\n   *  greaterThanOrEqualTo                gte\r\n   *  isInteger                           isint\r\n   *  isNegative                          isneg\r\n   *  isPositive                          ispos\r\n   *  isZero\r\n   *  lessThan                            lt\r\n   *  lessThanOrEqualTo                   lte\r\n   *  logarithm                           log\r\n   *  minus                               sub\r\n   *  modulo                              mod\r\n   *  naturalExponential                  exp\r\n   *  naturalLogarithm                    ln\r\n   *  negated                             neg\r\n   *  plus                                add\r\n   *  precision                           sd\r\n   *  squareRoot                          sqrt\r\n   *  times                               mul\r\n   *  toDecimalPlaces                     todp\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toInteger                           toint\r\n   *  toNumber\r\n   *  toPower                             pow\r\n   *  toPrecision\r\n   *  toSignificantDigits                 tosd\r\n   *  toString\r\n   *  valueOf                             val\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this;\r\n\r\n    y = new x.constructor(y);\r\n\r\n    // Signs differ?\r\n    if (x.s !== y.s) return x.s || -y.s;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ x.s < 0 ? 1 : -1;\r\n\r\n    xdL = x.d.length;\r\n    ydL = y.d.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (x.d[i] !== y.d[i]) return x.d[i] > y.d[i] ^ x.s < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ x.s < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var x = this,\r\n      w = x.d.length - 1,\r\n      dp = (w - x.e) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = x.d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) dp--;\r\n\r\n    return dp < 0 ? 0 : dp;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(divide(x, new Ctor(y), 0, 1), Ctor.precision);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return !this.cmp(y);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the (base 10) exponent value of this Decimal (this.e is the base 10000000 exponent).\r\n   *\r\n   */\r\n  P.exponent = function () {\r\n    return getBase10Exponent(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    return this.cmp(y) >= 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isint = function () {\r\n    return this.e > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isneg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.ispos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return this.s === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   * If no base is specified, return log[10](x).\r\n   *\r\n   * log[base](x) = ln(x) / ln(base)\r\n   *\r\n   * The maximum error of the result is 1 ulp (unit in the last place).\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var r,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      wpr = pr + 5;\r\n\r\n    // Default base is 10.\r\n    if (base === void 0) {\r\n      base = new Ctor(10);\r\n    } else {\r\n      base = new Ctor(base);\r\n\r\n      // log[-b](x) = NaN\r\n      // log[0](x)  = NaN\r\n      // log[1](x)  = NaN\r\n      if (base.s < 1 || base.eq(ONE)) throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    // log[b](-x) = NaN\r\n    // log[b](0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // log[b](1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    external = false;\r\n    r = divide(ln(x, wpr), ln(base, wpr), wpr);\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? subtract(x, y) : add(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // x % 0 = NaN\r\n    if (!y.s) throw Error(decimalError + 'NaN');\r\n\r\n    // Return x if x is 0.\r\n    if (!x.s) return round(new Ctor(x), pr);\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n    q = divide(x, y, 0, 1).times(y);\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return exp(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return ln(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s || 0;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? add(x, y) : subtract(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var e, sd, w,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    e = getBase10Exponent(x) + 1;\r\n    w = x.d.length - 1;\r\n    sd = w * LOG_BASE + 1;\r\n    w = x.d[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) sd--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = x.d[0]; w >= 10; w /= 10) sd++;\r\n    }\r\n\r\n    return z && e > sd ? e : sd;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var e, n, pr, r, s, t, wpr,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative or zero?\r\n    if (x.s < 1) {\r\n      if (!x.s) return new Ctor(0);\r\n\r\n      // sqrt(-x) = NaN\r\n      throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    e = getBase10Exponent(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    pr = Ctor.precision;\r\n    s = wpr = pr + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, wpr + 2)).times(0.5);\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === (n = digitsToString(r.d)).slice(0, wpr)) {\r\n        n = n.slice(wpr - 3, wpr + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (s == wpr && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          round(t, pr + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        } else if (n != '9999') {\r\n          break;\r\n        }\r\n\r\n        wpr += 4;\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal times `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    // Return 0 if either is 0.\r\n    if (!x.s || !y.s) return new Ctor(0);\r\n\r\n    y.s *= x.s;\r\n    e = x.e + y.e;\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = e;\r\n\r\n    return external ? round(y, Ctor.precision) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.todp = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return round(x, dp + getBase10Exponent(x) + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = toString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), dp + 1, rm);\r\n      str = toString(x, true, dp + 1);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) return toString(x);\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = round(new Ctor(x), dp + getBase10Exponent(x) + 1, rm);\r\n    str = toString(y.abs(), false, dp + getBase10Exponent(y) + 1);\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isneg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.toInteger = P.toint = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(new Ctor(x), getBase10Exponent(x) + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * The maximum error is 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, sign, yIsInt,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      guard = 12,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // pow(x, 0) = 1\r\n    if (!y.s) return new Ctor(ONE);\r\n\r\n    x = new Ctor(x);\r\n\r\n    // pow(0, y > 0) = 0\r\n    // pow(0, y < 0) = Infinity\r\n    if (!x.s) {\r\n      if (y.s < 1) throw Error(decimalError + 'Infinity');\r\n      return x;\r\n    }\r\n\r\n    // pow(1, y) = 1\r\n    if (x.eq(ONE)) return x;\r\n\r\n    pr = Ctor.precision;\r\n\r\n    // pow(x, 1) = x\r\n    if (y.eq(ONE)) return round(x, pr);\r\n\r\n    e = y.e;\r\n    k = y.d.length - 1;\r\n    yIsInt = e >= k;\r\n    sign = x.s;\r\n\r\n    if (!yIsInt) {\r\n\r\n      // pow(x < 0, y non-integer) = NaN\r\n      if (sign < 0) throw Error(decimalError + 'NaN');\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    } else if ((k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = new Ctor(ONE);\r\n\r\n      // Max k of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      e = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n      external = false;\r\n\r\n      for (;;) {\r\n        if (k % 2) {\r\n          r = r.times(x);\r\n          truncate(r.d, e);\r\n        }\r\n\r\n        k = mathfloor(k / 2);\r\n        if (k === 0) break;\r\n\r\n        x = x.times(x);\r\n        truncate(x.d, e);\r\n      }\r\n\r\n      external = true;\r\n\r\n      return y.s < 0 ? new Ctor(ONE).div(r) : round(r, pr);\r\n    }\r\n\r\n    // Result is negative if x is negative and the last digit of integer y is odd.\r\n    sign = sign < 0 && y.d[Math.max(e, k)] & 1 ? -1 : 1;\r\n\r\n    x.s = 1;\r\n    external = false;\r\n    r = y.times(ln(x, pr + guard));\r\n    external = true;\r\n    r = exp(r);\r\n    r.s = sign;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var e, str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), sd, rm);\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, sd <= e || e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.tosd = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return round(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = P.valueOf = P.val = P.toJSON = function () {\r\n    var x = this,\r\n      e = getBase10Exponent(x),\r\n      Ctor = x.constructor;\r\n\r\n    return toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  add                 P.minus, P.plus\r\n   *  checkInt32          P.todp, P.toExponential, P.toFixed, P.toPrecision, P.tosd\r\n   *  digitsToString      P.log, P.sqrt, P.pow, toString, exp, ln\r\n   *  divide              P.div, P.idiv, P.log, P.mod, P.sqrt, exp, ln\r\n   *  exp                 P.exp, P.pow\r\n   *  getBase10Exponent   P.exponent, P.sd, P.toint, P.sqrt, P.todp, P.toFixed, P.toPrecision,\r\n   *                      P.toString, divide, round, toString, exp, ln\r\n   *  getLn10             P.log, ln\r\n   *  getZeroString       digitsToString, toString\r\n   *  ln                  P.log, P.ln, P.pow, exp\r\n   *  parseDecimal        Decimal\r\n   *  round               P.abs, P.idiv, P.log, P.minus, P.mod, P.neg, P.plus, P.toint, P.sqrt,\r\n   *                      P.times, P.todp, P.toExponential, P.toFixed, P.pow, P.toPrecision, P.tosd,\r\n   *                      divide, getLn10, exp, ln\r\n   *  subtract            P.minus, P.plus\r\n   *  toString            P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf\r\n   *  truncate            P.pow\r\n   *\r\n   *  Throws:             P.log, P.mod, P.sd, P.sqrt, P.pow,  checkInt32, divide, round,\r\n   *                      getLn10, exp, ln, parseDecimal, Decimal, config\r\n   */\r\n\r\n\r\n  function add(x, y) {\r\n    var carry, d, e, i, k, len, xd, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // If either is zero...\r\n    if (!x.s || !y.s) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!y.s) y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    k = x.e;\r\n    e = y.e;\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % BASE | 0;\r\n        carry = temp / BASE | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * BASE + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, dp) {\r\n      var cmp, e, i, k, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either 0?\r\n      if (!x.s) return new Ctor(x);\r\n      if (!y.s) throw Error(decimalError + 'Division by zero');\r\n\r\n      e = x.e - y.e;\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      for (i = 0; yd[i] == (xd[i] || 0); ) ++i;\r\n      if (yd[i] > (xd[i] || 0)) --e;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n      } else if (dp) {\r\n        sd = pr + (getBase10Exponent(x) - getBase10Exponent(y)) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) return new Ctor(0);\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / LOG_BASE + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * BASE + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= BASE/2\r\n        k = BASE / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k);\r\n          xd = multiplyInteger(xd, k);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= BASE / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * BASE + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= BASE) k = BASE - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n\r\n      q.e = e;\r\n\r\n      return round(q, dp ? pr + getBase10Exponent(q) + 1 : pr);\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` truncated to `sd`\r\n   * significant digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   */\r\n  function exp(x, sd) {\r\n    var denominator, guard, pow, sum, t, wpr,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    if (getBase10Exponent(x) > 16) throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n\r\n    // exp(0) = 1\r\n    if (!x.s) return new Ctor(ONE);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    while (x.abs().gte(0.1)) {\r\n      x = x.times(t);    // x = x / 2^5\r\n      k += 5;\r\n    }\r\n\r\n    // Estimate the precision increase necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(ONE);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = round(pow.times(x), wpr);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        while (k--) sum = round(sum.times(sum), wpr);\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(x) {\r\n    var e = x.e * LOG_BASE,\r\n      w = x.d[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for (; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n\r\n    if (sd > Ctor.LN10.sd()) {\r\n\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(decimalError + 'LN10 precision limit exceeded');\r\n    }\r\n\r\n    return round(new Ctor(Ctor.LN10), sd);\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` truncated to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(n) is non-terminating (n != 1)\r\n   *\r\n   */\r\n  function ln(y, sd) {\r\n    var c, c0, denominator, e, numerator, sum, t, wpr, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // ln(-x) = NaN\r\n    // ln(0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // ln(1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    if (x.eq(10)) {\r\n      if (sd == null) external = true;\r\n      return getLn10(Ctor, wpr);\r\n    }\r\n\r\n    wpr += guard;\r\n    Ctor.precision = wpr;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n    e = getBase10Exponent(x);\r\n\r\n    if (Math.abs(e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = getBase10Exponent(x);\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = ln(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n\r\n      Ctor.precision = pr;\r\n      return sd == null ? (external = true, round(x, pr)) : x;\r\n    }\r\n\r\n    // x is reduced to a value near 1.\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(ONE), x.plus(ONE), wpr);\r\n    x2 = round(x.times(x), wpr);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = round(numerator.times(x2), wpr);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr);\r\n\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48;) ++i;\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48;) --len;\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      e = e - i - 1;\r\n      x.e = mathfloor(e / LOG_BASE);\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external && (x.e > MAX_E || x.e < -MAX_E)) throw Error(exponentOutOfRange + e);\r\n    } else {\r\n\r\n      // Zero.\r\n      x.s = 0;\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits, using rounding mode `rm` if present (truncate otherwise).\r\n   */\r\n   function round(x, sd, rm) {\r\n    var i, j, k, n, rd, doRound, w, xdi,\r\n      xd = x.d;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd which contains the rounding digit, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // n: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (n = 1, k = xd[0]; k >= 10; k /= 10) n++;\r\n    i = sd - n;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) return x;\r\n      w = k = xd[xdi];\r\n\r\n      // Get the number of digits of w.\r\n      for (n = 1; k >= 10; k /= 10) n++;\r\n\r\n      // Get the index of rd within w.\r\n      i %= LOG_BASE;\r\n\r\n      // Get the index of rd within w, adjusted for leading zeros.\r\n      // The number of leading zeros of w is given by LOG_BASE - n.\r\n      j = i - LOG_BASE + n;\r\n    }\r\n\r\n    if (rm !== void 0) {\r\n      k = mathpow(10, n - j - 1);\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / k % 10 | 0;\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      doRound = sd < 0 || xd[xdi + 1] !== void 0 || w % k;\r\n\r\n      // The expression `w % mathpow(10, n - j - 1)` returns all the digits of w to the right of the\r\n      // digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression will give\r\n      // 714.\r\n\r\n      doRound = rm < 4\r\n        ? (rd || doRound) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || doRound || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, n - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n    }\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      if (doRound) {\r\n        k = getBase10Exponent(x);\r\n        xd.length = 1;\r\n\r\n        // Convert sd to decimal places.\r\n        sd = sd - k - 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = mathfloor(-sd / LOG_BASE) || 0;\r\n      } else {\r\n        xd.length = 1;\r\n\r\n        // Zero.\r\n        xd[0] = x.e = x.s = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, n - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (doRound) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n          if ((xd[0] += k) == BASE) {\r\n            xd[0] = 1;\r\n            ++x.e;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n\r\n    if (external && (x.e > MAX_E || x.e < -MAX_E)) {\r\n      throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function subtract(x, y) {\r\n    var d, e, i, j, k, len, xd, xe, xLTy, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // Return y negated if x is zero.\r\n    // Return x if y is zero and x is non-zero.\r\n    if (!x.s || !y.s) {\r\n      if (y.s) y.s = -y.s;\r\n      else y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are non-zero numbers with the same sign.\r\n\r\n    e = y.e;\r\n    xe = x.e;\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of zeros\r\n      // needing to be prepended, but this can be avoided while still ensuring correct rounding by\r\n      // limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to xd if shorter.\r\n    // Don't add zeros to yd if shorter as subtraction only needs to start at yd length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(0);\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    //return external && xd.length >= pr / LOG_BASE ? round(y, pr) : y;\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function toString(x, isExp, sd) {\r\n    var k,\r\n      e = getBase10Exponent(x),\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (e < 0 ? 'e' : 'e+') + e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  clone\r\n   *  config/set\r\n   */\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * value {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(value) {\r\n      var x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(value);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (value instanceof Decimal) {\r\n        x.s = value.s;\r\n        x.e = value.e;\r\n        x.d = (value = value.d) ? value.slice() : value;\r\n        return;\r\n      }\r\n\r\n      if (typeof value === 'number') {\r\n\r\n        // Reject Infinity/NaN.\r\n        if (value * 0 !== 0) {\r\n          throw Error(invalidArgument + value);\r\n        }\r\n\r\n        if (value > 0) {\r\n          x.s = 1;\r\n        } else if (value < 0) {\r\n          value = -value;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 0;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (value === ~~value && value < 1e7) {\r\n          x.e = 0;\r\n          x.d = [value];\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, value.toString());\r\n      } else if (typeof value !== 'string') {\r\n        throw Error(invalidArgument + value);\r\n      }\r\n\r\n      // Minus sign?\r\n      if (value.charCodeAt(0) === 45) {\r\n        value = value.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      if (isDecimal.test(value)) parseDecimal(x, value);\r\n      else throw Error(invalidArgument + value);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n\r\n    Decimal.clone = clone;\r\n    Decimal.config = Decimal.set = config;\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'LN10'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') {\r\n      throw Error(decimalError + 'Object expected');\r\n    }\r\n    var i, p, v,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -1 / 0, 0,\r\n        'toExpPos', 0, 1 / 0\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if ((v = obj[p = ps[i]]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if ((v = obj[p = 'LN10']) !== void 0) {\r\n        if (v == Math.LN10) this[p] = new this(v);\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(Decimal);\r\n\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Internal constant.\r\n  ONE = new Decimal(1);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (true) {\r\n    !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {\r\n      return Decimal;\r\n    }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else {}\r\n})(this);\r\n\n\n/***/ }),\n\n/***/ 3776:\n/***/ (function(module, exports, __webpack_require__) {\n\nvar __WEBPACK_AMD_DEFINE_RESULT__;;(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*!\r\n   *  decimal.js v10.4.3\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The maximum exponent magnitude.\r\n    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\n  var EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n    MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n    // Base conversion alphabet.\r\n    NUMERALS = '0123456789abcdef',\r\n\r\n    // The natural logarithm of 10 (1025 digits).\r\n    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n    // Pi (1025 digits).\r\n    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    DEFAULTS = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used when rounding to `precision`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n      // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN  6 The IEEE 754 remainder function.\r\n      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n      //\r\n      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n      // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n      // be used, but they may not give useful results.\r\n      modulo: 1,                             // 0 to 9\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // JavaScript numbers: -324  (5e-324)\r\n      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      crypto: false                          // true/false\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    Decimal, inexact, noConflict, quadrant,\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n    cryptoUnavailable = decimalError + 'crypto unavailable',\r\n    tag = '[object Decimal]',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n    isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n    isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n    LN10_PRECISION = LN10.length - 1,\r\n    PI_PRECISION = PI.length - 1,\r\n\r\n    // Decimal.prototype object\r\n    P = { toStringTag: tag };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\r\n   *  clampedTo                 clamp\r\n   *  comparedTo                cmp\r\n   *  cosine                    cos\r\n   *  cubeRoot                  cbrt\r\n   *  decimalPlaces             dp\r\n   *  dividedBy                 div\r\n   *  dividedToIntegerBy        divToInt\r\n   *  equals                    eq\r\n   *  floor\r\n   *  greaterThan               gt\r\n   *  greaterThanOrEqualTo      gte\r\n   *  hyperbolicCosine          cosh\r\n   *  hyperbolicSine            sinh\r\n   *  hyperbolicTangent         tanh\r\n   *  inverseCosine             acos\r\n   *  inverseHyperbolicCosine   acosh\r\n   *  inverseHyperbolicSine     asinh\r\n   *  inverseHyperbolicTangent  atanh\r\n   *  inverseSine               asin\r\n   *  inverseTangent            atan\r\n   *  isFinite\r\n   *  isInteger                 isInt\r\n   *  isNaN\r\n   *  isNegative                isNeg\r\n   *  isPositive                isPos\r\n   *  isZero\r\n   *  lessThan                  lt\r\n   *  lessThanOrEqualTo         lte\r\n   *  logarithm                 log\r\n   *  [maximum]                 [max]\r\n   *  [minimum]                 [min]\r\n   *  minus                     sub\r\n   *  modulo                    mod\r\n   *  naturalExponential        exp\r\n   *  naturalLogarithm          ln\r\n   *  negated                   neg\r\n   *  plus                      add\r\n   *  precision                 sd\r\n   *  round\r\n   *  sine                      sin\r\n   *  squareRoot                sqrt\r\n   *  tangent                   tan\r\n   *  times                     mul\r\n   *  toBinary\r\n   *  toDecimalPlaces           toDP\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toFraction\r\n   *  toHexadecimal             toHex\r\n   *  toNearest\r\n   *  toNumber\r\n   *  toOctal\r\n   *  toPower                   pow\r\n   *  toPrecision\r\n   *  toSignificantDigits       toSD\r\n   *  toString\r\n   *  truncated                 trunc\r\n   *  valueOf                   toJSON\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s < 0) x.s = 1;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of positive Infinity.\r\n   *\r\n   */\r\n  P.ceil = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n   * delineated by `min` and `max`.\r\n   *\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  P.clampedTo = P.clamp = function (min, max) {\r\n    var k,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n    min = new Ctor(min);\r\n    max = new Ctor(max);\r\n    if (!min.s || !max.s) return new Ctor(NaN);\r\n    if (min.gt(max)) throw Error(invalidArgument + max);\r\n    k = x.cmp(min);\r\n    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value,\r\n   *   NaN  if the value of either Decimal is NaN.\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this,\r\n      xd = x.d,\r\n      yd = (y = new x.constructor(y)).d,\r\n      xs = x.s,\r\n      ys = y.s;\r\n\r\n    // Either NaN or ±Infinity?\r\n    if (!xd || !yd) {\r\n      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Either zero?\r\n    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n    // Signs differ?\r\n    if (xs !== ys) return xs;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * cos(0)         = 1\r\n   * cos(-0)        = 1\r\n   * cos(Infinity)  = NaN\r\n   * cos(-Infinity) = NaN\r\n   * cos(NaN)       = NaN\r\n   *\r\n   */\r\n  P.cosine = P.cos = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.d) return new Ctor(NaN);\r\n\r\n    // cos(0) = cos(-0) = 1\r\n    if (!x.d[0]) return new Ctor(1);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *\r\n   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   *  cbrt(0)  =  0\r\n   *  cbrt(-0) = -0\r\n   *  cbrt(1)  =  1\r\n   *  cbrt(-1) = -1\r\n   *  cbrt(N)  =  N\r\n   *  cbrt(-I) = -I\r\n   *  cbrt(I)  =  I\r\n   *\r\n   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n   *\r\n   */\r\n  P.cubeRoot = P.cbrt = function () {\r\n    var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n     // Math.cbrt underflow/overflow?\r\n     // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n    if (!s || Math.abs(s) == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      e = x.e;\r\n\r\n      // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n      s = mathpow(n, 1 / 3);\r\n\r\n      // Rarely, e may be one less than the result exponent value.\r\n      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n      r.s = x.s;\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Halley's method.\r\n    // TODO? Compare Newton's method.\r\n    for (;;) {\r\n      t = r;\r\n      t3 = t.times(t).times(t);\r\n      t3plusx = t3.plus(x);\r\n      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n        // , i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var w,\r\n      d = this.d,\r\n      n = NaN;\r\n\r\n    if (d) {\r\n      w = d.length - 1;\r\n      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      w = d[w];\r\n      if (w) for (; w % 10 == 0; w /= 10) n--;\r\n      if (n < 0) n = 0;\r\n    }\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.divToInt = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return this.cmp(y) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n   * direction of negative Infinity.\r\n   *\r\n   */\r\n  P.floor = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 3);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    var k = this.cmp(y);\r\n    return k == 1 || k === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [1, Infinity]\r\n   *\r\n   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n   *\r\n   * cosh(0)         = 1\r\n   * cosh(-0)        = 1\r\n   * cosh(Infinity)  = Infinity\r\n   * cosh(-Infinity) = Infinity\r\n   * cosh(NaN)       = NaN\r\n   *\r\n   *  x        time taken (ms)   result\r\n   * 1000      9                 9.8503555700852349694e+433\r\n   * 10000     25                4.4034091128314607936e+4342\r\n   * 100000    171               1.4033316802130615897e+43429\r\n   * 1000000   3817              1.5166076984010437725e+434294\r\n   * 10000000  abandoned after 2 minute wait\r\n   *\r\n   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicCosine = P.cosh = function () {\r\n    var k, n, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      one = new Ctor(1);\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n    if (x.isZero()) return one;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    // TODO? Estimation reused from cosine() and may not be optimal here.\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      n = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      n = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n    // Reverse argument reduction\r\n    var cosh2_x,\r\n      i = k,\r\n      d8 = new Ctor(8);\r\n    for (; i--;) {\r\n      cosh2_x = x.times(x);\r\n      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n    }\r\n\r\n    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n   *\r\n   * sinh(0)         = 0\r\n   * sinh(-0)        = -0\r\n   * sinh(Infinity)  = Infinity\r\n   * sinh(-Infinity) = -Infinity\r\n   * sinh(NaN)       = NaN\r\n   *\r\n   * x        time taken (ms)\r\n   * 10       2 ms\r\n   * 100      5 ms\r\n   * 1000     14 ms\r\n   * 10000    82 ms\r\n   * 100000   886 ms            1.4033316802130615897e+43429\r\n   * 200000   2613 ms\r\n   * 300000   5407 ms\r\n   * 400000   8824 ms\r\n   * 500000   13026 ms          8.7080643612718084129e+217146\r\n   * 1000000  48543 ms\r\n   *\r\n   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicSine = P.sinh = function () {\r\n    var k, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n    } else {\r\n\r\n      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n      // 3 multiplications and 1 addition\r\n\r\n      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n      // 4 multiplications and 2 additions\r\n\r\n      // Estimate the optimum number of times to use the argument reduction.\r\n      k = 1.4 * Math.sqrt(len);\r\n      k = k > 16 ? 16 : k | 0;\r\n\r\n      x = x.times(1 / tinyPow(5, k));\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n      // Reverse argument reduction\r\n      var sinh2_x,\r\n        d5 = new Ctor(5),\r\n        d16 = new Ctor(16),\r\n        d20 = new Ctor(20);\r\n      for (; k--;) {\r\n        sinh2_x = x.times(x);\r\n        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n      }\r\n    }\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * tanh(x) = sinh(x) / cosh(x)\r\n   *\r\n   * tanh(0)         = 0\r\n   * tanh(-0)        = -0\r\n   * tanh(Infinity)  = 1\r\n   * tanh(-Infinity) = -1\r\n   * tanh(NaN)       = NaN\r\n   *\r\n   */\r\n  P.hyperbolicTangent = P.tanh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 7;\r\n    Ctor.rounding = 1;\r\n\r\n    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n   * this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [0, pi]\r\n   *\r\n   * acos(x) = pi/2 - asin(x)\r\n   *\r\n   * acos(0)       = pi/2\r\n   * acos(-0)      = pi/2\r\n   * acos(1)       = 0\r\n   * acos(-1)      = pi\r\n   * acos(1/2)     = pi/3\r\n   * acos(-1/2)    = 2*pi/3\r\n   * acos(|x| > 1) = NaN\r\n   * acos(NaN)     = NaN\r\n   *\r\n   */\r\n  P.inverseCosine = P.acos = function () {\r\n    var halfPi,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      k = x.abs().cmp(1),\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n      return k === 0\r\n        // |x| is 1\r\n        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n        // |x| > 1 or x is NaN\r\n        : new Ctor(NaN);\r\n    }\r\n\r\n    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.asin();\r\n    halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return halfPi.minus(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [1, Infinity]\r\n   * Range: [0, Infinity]\r\n   *\r\n   * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n   *\r\n   * acosh(x < 1)     = NaN\r\n   * acosh(NaN)       = NaN\r\n   * acosh(Infinity)  = Infinity\r\n   * acosh(-Infinity) = NaN\r\n   * acosh(0)         = NaN\r\n   * acosh(-0)        = NaN\r\n   * acosh(1)         = 0\r\n   * acosh(-1)        = NaN\r\n   *\r\n   */\r\n  P.inverseHyperbolicCosine = P.acosh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n    if (!x.isFinite()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n   *\r\n   * asinh(NaN)       = NaN\r\n   * asinh(Infinity)  = Infinity\r\n   * asinh(-Infinity) = -Infinity\r\n   * asinh(0)         = 0\r\n   * asinh(-0)        = -0\r\n   *\r\n   */\r\n  P.inverseHyperbolicSine = P.asinh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n   *\r\n   * atanh(|x| > 1)   = NaN\r\n   * atanh(NaN)       = NaN\r\n   * atanh(Infinity)  = NaN\r\n   * atanh(-Infinity) = NaN\r\n   * atanh(0)         = 0\r\n   * atanh(-0)        = -0\r\n   * atanh(1)         = Infinity\r\n   * atanh(-1)        = -Infinity\r\n   *\r\n   */\r\n  P.inverseHyperbolicTangent = P.atanh = function () {\r\n    var pr, rm, wpr, xsd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    xsd = x.sd();\r\n\r\n    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n    Ctor.precision = wpr = xsd - x.e;\r\n\r\n    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n    Ctor.precision = pr + 4;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.ln();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(0.5);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n   *\r\n   * asin(0)       = 0\r\n   * asin(-0)      = -0\r\n   * asin(1/2)     = pi/6\r\n   * asin(-1/2)    = -pi/6\r\n   * asin(1)       = pi/2\r\n   * asin(-1)      = -pi/2\r\n   * asin(|x| > 1) = NaN\r\n   * asin(NaN)     = NaN\r\n   *\r\n   * TODO? Compare performance of Taylor series.\r\n   *\r\n   */\r\n  P.inverseSine = P.asin = function () {\r\n    var halfPi, k,\r\n      pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    k = x.abs().cmp(1);\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n\r\n      // |x| is 1\r\n      if (k === 0) {\r\n        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        halfPi.s = x.s;\r\n        return halfPi;\r\n      }\r\n\r\n      // |x| > 1 or x is NaN\r\n      return new Ctor(NaN);\r\n    }\r\n\r\n    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n   *\r\n   * atan(0)         = 0\r\n   * atan(-0)        = -0\r\n   * atan(1)         = pi/4\r\n   * atan(-1)        = -pi/4\r\n   * atan(Infinity)  = pi/2\r\n   * atan(-Infinity) = -pi/2\r\n   * atan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.inverseTangent = P.atan = function () {\r\n    var i, j, k, n, px, t, r, wpr, x2,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (!x.isFinite()) {\r\n      if (!x.s) return new Ctor(NaN);\r\n      if (pr + 4 <= PI_PRECISION) {\r\n        r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        r.s = x.s;\r\n        return r;\r\n      }\r\n    } else if (x.isZero()) {\r\n      return new Ctor(x);\r\n    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n\r\n    Ctor.precision = wpr = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n    // Argument reduction\r\n    // Ensure |x| < 0.42\r\n    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n    k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n    external = false;\r\n\r\n    j = Math.ceil(wpr / LOG_BASE);\r\n    n = 1;\r\n    x2 = x.times(x);\r\n    r = new Ctor(x);\r\n    px = x;\r\n\r\n    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n    for (; i !== -1;) {\r\n      px = px.times(x2);\r\n      t = r.minus(px.div(n += 2));\r\n\r\n      px = px.times(x2);\r\n      r = t.plus(px.div(n += 2));\r\n\r\n      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n    }\r\n\r\n    if (k) r = r.times(2 << (k - 1));\r\n\r\n    external = true;\r\n\r\n    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n   *\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.d;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isInt = function () {\r\n    return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is NaN, otherwise return false.\r\n   *\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isNeg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.isPos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.d && this.d[0] === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * If no base is specified, return log[10](arg).\r\n   *\r\n   * log[base](arg) = ln(arg) / ln(base)\r\n   *\r\n   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n   * otherwise:\r\n   *\r\n   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n   * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n   *\r\n   * log[-b](a)       = NaN\r\n   * log[0](a)        = NaN\r\n   * log[1](a)        = NaN\r\n   * log[NaN](a)      = NaN\r\n   * log[Infinity](a) = NaN\r\n   * log[b](0)        = -Infinity\r\n   * log[b](-0)       = -Infinity\r\n   * log[b](-a)       = NaN\r\n   * log[b](1)        = 0\r\n   * log[b](Infinity) = Infinity\r\n   * log[b](NaN)      = NaN\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var isBase10, d, denominator, k, inf, num, sd, r,\r\n      arg = this,\r\n      Ctor = arg.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding,\r\n      guard = 5;\r\n\r\n    // Default base is 10.\r\n    if (base == null) {\r\n      base = new Ctor(10);\r\n      isBase10 = true;\r\n    } else {\r\n      base = new Ctor(base);\r\n      d = base.d;\r\n\r\n      // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n      isBase10 = base.eq(10);\r\n    }\r\n\r\n    d = arg.d;\r\n\r\n    // Is arg negative, non-finite, 0 or 1?\r\n    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n    }\r\n\r\n    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n    // integer power of 10.\r\n    if (isBase10) {\r\n      if (d.length > 1) {\r\n        inf = true;\r\n      } else {\r\n        for (k = d[0]; k % 10 === 0;) k /= 10;\r\n        inf = k !== 1;\r\n      }\r\n    }\r\n\r\n    external = false;\r\n    sd = pr + guard;\r\n    num = naturalLogarithm(arg, sd);\r\n    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n    // The result will have 5 rounding digits.\r\n    r = divide(num, denominator, sd, 1);\r\n\r\n    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n    // calculate 10 further digits.\r\n    //\r\n    // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n    // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n    // further digits, the last 14 are nines, round up and assume the result is exact.\r\n    // Also assume the result is exact if the last 14 are zero.\r\n    //\r\n    // Example of a result that will be incorrectly rounded:\r\n    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n    // place is still 2.6.\r\n    if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n      do {\r\n        sd += 10;\r\n        num = naturalLogarithm(arg, sd);\r\n        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n        r = divide(num, denominator, sd, 1);\r\n\r\n        if (!inf) {\r\n\r\n          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n            r = finalise(r, pr + 1, 0);\r\n          }\r\n\r\n          break;\r\n        }\r\n      } while (checkRoundingDigits(r.d, k += 10, rm));\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.max = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'lt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.min = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'gt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return y negated if x is finite and y is ±Infinity.\r\n      else if (x.d) y.s = -y.s;\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with different signs.\r\n      // Return NaN if both are ±Infinity with the same sign.\r\n      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n    // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.plus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return y negated if x is zero and y is non-zero.\r\n      if (yd[0]) y.s = -y.s;\r\n\r\n      // Return x if y is zero and x is non-zero.\r\n      else if (xd[0]) y = new Ctor(x);\r\n\r\n      // Return zero if both are zero.\r\n      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n      else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    e = mathfloor(y.e / LOG_BASE);\r\n    xe = mathfloor(x.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of\r\n      // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n      // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to `xd` if shorter.\r\n    // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * The result depends on the modulo mode.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n    // Return x if y is ±Infinity or x is ±0.\r\n    if (!y.d || x.d && !x.d[0]) {\r\n      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n    }\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n\r\n    if (Ctor.modulo == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // result = x - q * y    where  0 <= result < abs(y)\r\n      q = divide(x, y.abs(), 0, 3, 1);\r\n      q.s *= y.s;\r\n    } else {\r\n      q = divide(x, y, 0, Ctor.modulo, 1);\r\n    }\r\n\r\n    q = q.times(y);\r\n\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return naturalExponential(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return naturalLogarithm(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with the same sign.\r\n      // Return NaN if both are ±Infinity with different signs.\r\n      // Return y if x is finite and y is ±Infinity.\r\n      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n     // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!yd[0]) y = new Ctor(x);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    k = mathfloor(x.e / LOG_BASE);\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var k,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    if (x.d) {\r\n      k = getPrecision(x.d);\r\n      if (z && x.e + 1 > k) k = x.e + 1;\r\n    } else {\r\n      k = NaN;\r\n    }\r\n\r\n    return k;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.round = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   *\r\n   * sin(0)         = 0\r\n   * sin(-0)        = -0\r\n   * sin(Infinity)  = NaN\r\n   * sin(-Infinity) = NaN\r\n   * sin(NaN)       = NaN\r\n   *\r\n   */\r\n  P.sine = P.sin = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N)  =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I)  =  I\r\n   *  sqrt(0)  =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, sd, r, rep, t,\r\n      x = this,\r\n      d = x.d,\r\n      e = x.e,\r\n      s = x.s,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !d || !d[0]) {\r\n      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n    }\r\n\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(d);\r\n\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * tan(0)         = 0\r\n   * tan(-0)        = -0\r\n   * tan(Infinity)  = NaN\r\n   * tan(-Infinity) = NaN\r\n   * tan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.tangent = P.tan = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.sin();\r\n    x.s = 1;\r\n    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    y.s *= x.s;\r\n\r\n     // If either is NaN, ±Infinity or ±0...\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n        // Return NaN if either is NaN.\r\n        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n        ? NaN\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        // Return ±0 if either is ±0.\r\n        : !xd || !yd ? y.s / 0 : y.s * 0);\r\n    }\r\n\r\n    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = getBase10Exponent(r, e);\r\n\r\n    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toBinary = function (sd, rm) {\r\n    return toStringBinary(this, 2, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return finalise(x, dp + x.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), dp + 1, rm);\r\n      str = finiteToString(x, true, dp + 1);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = finiteToString(x);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n      str = finiteToString(y, false, dp + y.e + 1);\r\n    }\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n   * numerator and an integer denominator.\r\n   *\r\n   * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n   * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n   * value necessary to represent the number exactly.\r\n   *\r\n   * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n   *\r\n   */\r\n  P.toFraction = function (maxD) {\r\n    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n      x = this,\r\n      xd = x.d,\r\n      Ctor = x.constructor;\r\n\r\n    if (!xd) return new Ctor(x);\r\n\r\n    n1 = d0 = new Ctor(1);\r\n    d1 = n0 = new Ctor(0);\r\n\r\n    d = new Ctor(d1);\r\n    e = d.e = getPrecision(xd) - x.e - 1;\r\n    k = e % LOG_BASE;\r\n    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n    if (maxD == null) {\r\n\r\n      // d is 10**e, the minimum max-denominator needed.\r\n      maxD = e > 0 ? d : n1;\r\n    } else {\r\n      n = new Ctor(maxD);\r\n      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n    }\r\n\r\n    external = false;\r\n    n = new Ctor(digitsToString(xd));\r\n    pr = Ctor.precision;\r\n    Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n    for (;;)  {\r\n      q = divide(n, d, 0, 1, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.cmp(maxD) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      d2 = n1;\r\n      n1 = n0.plus(q.times(d2));\r\n      n0 = d2;\r\n      d2 = d;\r\n      d = n.minus(q.times(d2));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n        ? [n1, d1] : [n0, d0];\r\n\r\n    Ctor.precision = pr;\r\n    external = true;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toHexadecimal = P.toHex = function (sd, rm) {\r\n    return toStringBinary(this, 16, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n   *\r\n   * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n   * or `y` is NaN, in which case the return value will be also be NaN.\r\n   *\r\n   * The return value is not affected by the value of `precision`.\r\n   *\r\n   * y {number|string|Decimal} The magnitude to round to a multiple of.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toNearest() rounding mode not an integer: {rm}'\r\n   * 'toNearest() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toNearest = function (y, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (y == null) {\r\n\r\n      // If x is not finite, return x.\r\n      if (!x.d) return x;\r\n\r\n      y = new Ctor(1);\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      y = new Ctor(y);\r\n      if (rm === void 0) {\r\n        rm = Ctor.rounding;\r\n      } else {\r\n        checkInt32(rm, 0, 8);\r\n      }\r\n\r\n      // If x is not finite, return x if y is not NaN, else NaN.\r\n      if (!x.d) return y.s ? x : y;\r\n\r\n      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n      if (!y.d) {\r\n        if (y.s) y.s = x.s;\r\n        return y;\r\n      }\r\n    }\r\n\r\n    // If y is not zero, calculate the nearest multiple of y to x.\r\n    if (y.d[0]) {\r\n      external = false;\r\n      x = divide(x, y, 0, rm, 1).times(y);\r\n      external = true;\r\n      finalise(x);\r\n\r\n    // If y is zero, return zero with the sign of x.\r\n    } else {\r\n      y.s = x.s;\r\n      x = y;\r\n    }\r\n\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   * Zero keeps its sign.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toOctal = function (sd, rm) {\r\n    return toStringBinary(this, 8, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n   * to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * ECMAScript compliant.\r\n   *\r\n   *   pow(x, NaN)                           = NaN\r\n   *   pow(x, ±0)                            = 1\r\n\r\n   *   pow(NaN, non-zero)                    = NaN\r\n   *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n   *   pow(abs(x) > 1, -Infinity)            = +0\r\n   *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n   *   pow(abs(x) < 1, +Infinity)            = +0\r\n   *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n   *   pow(+Infinity, y > 0)                 = +Infinity\r\n   *   pow(+Infinity, y < 0)                 = +0\r\n   *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n   *   pow(-Infinity, even integer > 0)      = +Infinity\r\n   *   pow(-Infinity, odd integer < 0)       = -0\r\n   *   pow(-Infinity, even integer < 0)      = +0\r\n   *   pow(+0, y > 0)                        = +0\r\n   *   pow(+0, y < 0)                        = +Infinity\r\n   *   pow(-0, odd integer > 0)              = -0\r\n   *   pow(-0, even integer > 0)             = +0\r\n   *   pow(-0, odd integer < 0)              = -Infinity\r\n   *   pow(-0, even integer < 0)             = +Infinity\r\n   *   pow(finite x < 0, finite non-integer) = NaN\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n   * probability of an incorrectly rounded result\r\n   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n   * i.e. 1 in 250,000,000,000,000\r\n   *\r\n   * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, rm, s,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // Either ±Infinity, NaN or ±0?\r\n    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (x.eq(1)) return x;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n    // y exponent\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = intPow(Ctor, x, k, pr);\r\n      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n    }\r\n\r\n    s = x.s;\r\n\r\n    // if x is negative\r\n    if (s < 0) {\r\n\r\n      // if y is not an integer\r\n      if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n      // Result is positive if x is negative and the last digit of integer y is even.\r\n      if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n      // if x.eq(-1)\r\n      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n        x.s = s;\r\n        return x;\r\n      }\r\n    }\r\n\r\n    // Estimate result exponent.\r\n    // x^y = 10^e,  where e = y * log10(x)\r\n    // log10(x) = log10(x_significand) + x_exponent\r\n    // log10(x_significand) = ln(x_significand) / ln(10)\r\n    k = mathpow(+x, yn);\r\n    e = k == 0 || !isFinite(k)\r\n      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n      : new Ctor(k + '').e;\r\n\r\n    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n    // Overflow/underflow?\r\n    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n    external = false;\r\n    Ctor.rounding = x.s = 1;\r\n\r\n    // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n    // new Decimal(2.32456).pow('2087987436534566.46411')\r\n    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n    k = Math.min(12, (e + '').length);\r\n\r\n    // r = x^y = exp(y*ln(x))\r\n    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n    if (r.d) {\r\n\r\n      // Truncate to the required precision plus five rounding digits.\r\n      r = finalise(r, pr + 5, 1);\r\n\r\n      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n      // the result.\r\n      if (checkRoundingDigits(r.d, pr, rm)) {\r\n        e = pr + 10;\r\n\r\n        // Truncate to the increased precision plus five rounding digits.\r\n        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n      }\r\n    }\r\n\r\n    r.s = s;\r\n    external = true;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = finalise(new Ctor(x), sd, rm);\r\n      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toSD() digits out of range: {sd}'\r\n   * 'toSD() digits not an integer: {sd}'\r\n   * 'toSD() rounding mode not an integer: {rm}'\r\n   * 'toSD() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.toSD = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return finalise(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n   *\r\n   */\r\n  P.truncated = P.trunc = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   * Unlike `toString`, negative zero will include the minus sign.\r\n   *\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n   *                           finiteToString, naturalExponential, naturalLogarithm\r\n   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n   *  convertBase              toStringBinary, parseOther\r\n   *  cos                      P.cos\r\n   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n   *                           taylorSeries, atan2, parseOther\r\n   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n   *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n   *                           naturalLogarithm, ceil, floor, round, trunc\r\n   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n   *                           toStringBinary\r\n   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n   *  getLn10                  P.logarithm, naturalLogarithm\r\n   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n   *  getPrecision             P.precision, P.toFraction\r\n   *  getZeroString            digitsToString, finiteToString\r\n   *  intPow                   P.toPower, parseOther\r\n   *  isOdd                    toLessThanHalfPi\r\n   *  maxOrMin                 max, min\r\n   *  naturalExponential       P.naturalExponential, P.toPower\r\n   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n   *                           P.toPower, naturalExponential\r\n   *  nonFiniteToString        finiteToString, toStringBinary\r\n   *  parseDecimal             Decimal\r\n   *  parseOther               Decimal\r\n   *  sin                      P.sin\r\n   *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n   *  toLessThanHalfPi         P.cos, P.sin\r\n   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n   *  truncate                 intPow\r\n   *\r\n   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n   *                           naturalLogarithm, config, parseOther, random, Decimal\r\n   */\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n   * `repeating == null` if caller is `log` or `pow`,\r\n   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n   */\r\n  function checkRoundingDigits(d, i, rm, repeating) {\r\n    var di, k, r, rd;\r\n\r\n    // Get the length of the first word of the array d.\r\n    for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n    // Is the rounding digit in the first word of d?\r\n    if (--i < 0) {\r\n      i += LOG_BASE;\r\n      di = 0;\r\n    } else {\r\n      di = Math.ceil((i + 1) / LOG_BASE);\r\n      i %= LOG_BASE;\r\n    }\r\n\r\n    // i is the index (0 - 6) of the rounding digit.\r\n    // E.g. if within the word 3487563 the first rounding digit is 5,\r\n    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n    k = mathpow(10, LOG_BASE - i);\r\n    rd = d[di] % k | 0;\r\n\r\n    if (repeating == null) {\r\n      if (i < 3) {\r\n        if (i == 0) rd = rd / 100 | 0;\r\n        else if (i == 1) rd = rd / 10 | 0;\r\n        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n      } else {\r\n        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n      }\r\n    } else {\r\n      if (i < 4) {\r\n        if (i == 0) rd = rd / 1000 | 0;\r\n        else if (i == 1) rd = rd / 100 | 0;\r\n        else if (i == 2) rd = rd / 10 | 0;\r\n        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n      } else {\r\n        r = ((repeating || rm < 4) && rd + 1 == k ||\r\n        (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  // Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n  // Eg. convertBase('255', 10, 16) returns [15, 15].\r\n  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\n  function convertBase(str, baseIn, baseOut) {\r\n    var j,\r\n      arr = [0],\r\n      arrL,\r\n      i = 0,\r\n      strL = str.length;\r\n\r\n    for (; i < strL;) {\r\n      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n      arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n      for (j = 0; j < arr.length; j++) {\r\n        if (arr[j] > baseOut - 1) {\r\n          if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n          arr[j + 1] += arr[j] / baseOut | 0;\r\n          arr[j] %= baseOut;\r\n        }\r\n      }\r\n    }\r\n\r\n    return arr.reverse();\r\n  }\r\n\r\n\r\n  /*\r\n   * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function cosine(Ctor, x) {\r\n    var k, len, y;\r\n\r\n    if (x.isZero()) return x;\r\n\r\n    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    len = x.d.length;\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      y = (1 / tinyPow(4, k)).toString();\r\n    } else {\r\n      k = 16;\r\n      y = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    Ctor.precision += k;\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n    // Reverse argument reduction\r\n    for (var i = k; i--;) {\r\n      var cos2x = x.times(x);\r\n      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n    }\r\n\r\n    Ctor.precision -= k;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Perform division in the specified base.\r\n   */\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k, base) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % base | 0;\r\n        carry = temp / base | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL, base) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * base + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, rm, dp, base) {\r\n      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n        yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either NaN, Infinity or 0?\r\n      if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n      }\r\n\r\n      if (base) {\r\n        logBase = 1;\r\n        e = x.e - y.e;\r\n      } else {\r\n        base = BASE;\r\n        logBase = LOG_BASE;\r\n        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n      }\r\n\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n      for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n      if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n        rm = Ctor.rounding;\r\n      } else if (dp) {\r\n        sd = pr + (x.e - y.e) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) {\r\n        qd.push(1);\r\n        more = true;\r\n      } else {\r\n\r\n        // Convert precision in number of base 10 digits to base 1e7 digits.\r\n        sd = sd / logBase + 2 | 0;\r\n        i = 0;\r\n\r\n        // divisor < 1e7\r\n        if (yL == 1) {\r\n          k = 0;\r\n          yd = yd[0];\r\n          sd++;\r\n\r\n          // k is the carry.\r\n          for (; (i < xL || k) && sd--; i++) {\r\n            t = k * base + (xd[i] || 0);\r\n            qd[i] = t / yd | 0;\r\n            k = t % yd | 0;\r\n          }\r\n\r\n          more = k || i < xL;\r\n\r\n        // divisor >= 1e7\r\n        } else {\r\n\r\n          // Normalise xd and yd so highest order digit of yd is >= base/2\r\n          k = base / (yd[0] + 1) | 0;\r\n\r\n          if (k > 1) {\r\n            yd = multiplyInteger(yd, k, base);\r\n            xd = multiplyInteger(xd, k, base);\r\n            yL = yd.length;\r\n            xL = xd.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xd.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL;) rem[remL++] = 0;\r\n\r\n          yz = yd.slice();\r\n          yz.unshift(0);\r\n          yd0 = yd[0];\r\n\r\n          if (yd[1] >= base / 2) ++yd0;\r\n\r\n          do {\r\n            k = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yd, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, k.\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // k will be how many times the divisor goes into the current remainder.\r\n              k = rem0 / yd0 | 0;\r\n\r\n              //  Algorithm:\r\n              //  1. product = divisor * trial digit (k)\r\n              //  2. if product > remainder: product -= divisor, k--\r\n              //  3. remainder -= product\r\n              //  4. if product was < remainder at 2:\r\n              //    5. compare new remainder and divisor\r\n              //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n              if (k > 1) {\r\n                if (k >= base) k = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiplyInteger(yd, k, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                cmp = compare(prod, rem, prodL, remL);\r\n\r\n                // product > remainder.\r\n                if (cmp == 1) {\r\n                  k--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n                }\r\n              } else {\r\n\r\n                // cmp is -1.\r\n                // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n                // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n                if (k == 0) cmp = k = 1;\r\n                prod = yd.slice();\r\n              }\r\n\r\n              prodL = prod.length;\r\n              if (prodL < remL) prod.unshift(0);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n\r\n              // If product was < previous remainder.\r\n              if (cmp == -1) {\r\n                remL = rem.length;\r\n\r\n                // Compare divisor and new remainder.\r\n                cmp = compare(yd, rem, yL, remL);\r\n\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                if (cmp < 1) {\r\n                  k++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yd, remL, base);\r\n                }\r\n              }\r\n\r\n              remL = rem.length;\r\n            } else if (cmp === 0) {\r\n              k++;\r\n              rem = [0];\r\n            }    // if cmp === 1, k will be 0\r\n\r\n            // Add the next digit, k, to the result array.\r\n            qd[i++] = k;\r\n\r\n            // Update the remainder.\r\n            if (cmp && rem[0]) {\r\n              rem[remL++] = xd[xi] || 0;\r\n            } else {\r\n              rem = [xd[xi]];\r\n              remL = 1;\r\n            }\r\n\r\n          } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n          more = rem[0] !== void 0;\r\n        }\r\n\r\n        // Leading zero?\r\n        if (!qd[0]) qd.shift();\r\n      }\r\n\r\n      // logBase is 1 when divide is being used for base conversion.\r\n      if (logBase == 1) {\r\n        q.e = e;\r\n        inexact = more;\r\n      } else {\r\n\r\n        // To calculate q.e, first get the number of digits of qd[0].\r\n        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n        q.e = i + e * logBase - 1;\r\n\r\n        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n   * Check for over/under-flow.\r\n   */\r\n   function finalise(x, sd, rm, isTruncated) {\r\n    var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n      Ctor = x.constructor;\r\n\r\n    // Don't round if sd is null or undefined.\r\n    out: if (sd != null) {\r\n      xd = x.d;\r\n\r\n      // Infinity/NaN.\r\n      if (!xd) return x;\r\n\r\n      // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      // w: the word of xd containing rd, a base 1e7 number.\r\n      // xdi: the index of w within xd.\r\n      // digits: the number of digits of w.\r\n      // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n      // they had leading zeros)\r\n      // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n      // Get the length of the first word of the digits array xd.\r\n      for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n      i = sd - digits;\r\n\r\n      // Is the rounding digit in the first word of xd?\r\n      if (i < 0) {\r\n        i += LOG_BASE;\r\n        j = sd;\r\n        w = xd[xdi = 0];\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      } else {\r\n        xdi = Math.ceil((i + 1) / LOG_BASE);\r\n        k = xd.length;\r\n        if (xdi >= k) {\r\n          if (isTruncated) {\r\n\r\n            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n            for (; k++ <= xdi;) xd.push(0);\r\n            w = rd = 0;\r\n            digits = 1;\r\n            i %= LOG_BASE;\r\n            j = i - LOG_BASE + 1;\r\n          } else {\r\n            break out;\r\n          }\r\n        } else {\r\n          w = k = xd[xdi];\r\n\r\n          // Get the number of digits of w.\r\n          for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n          // Get the index of rd within w.\r\n          i %= LOG_BASE;\r\n\r\n          // Get the index of rd within w, adjusted for leading zeros.\r\n          // The number of leading zeros of w is given by LOG_BASE - digits.\r\n          j = i - LOG_BASE + digits;\r\n\r\n          // Get the rounding digit at index j of w.\r\n          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n        }\r\n      }\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      isTruncated = isTruncated || sd < 0 ||\r\n        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n      // will give 714.\r\n\r\n      roundUp = rm < 4\r\n        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n\r\n      if (sd < 1 || !xd[0]) {\r\n        xd.length = 0;\r\n        if (roundUp) {\r\n\r\n          // Convert sd to decimal places.\r\n          sd -= x.e + 1;\r\n\r\n          // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n          xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n          x.e = -sd || 0;\r\n        } else {\r\n\r\n          // Zero.\r\n          xd[0] = x.e = 0;\r\n        }\r\n\r\n        return x;\r\n      }\r\n\r\n      // Remove excess digits.\r\n      if (i == 0) {\r\n        xd.length = xdi;\r\n        k = 1;\r\n        xdi--;\r\n      } else {\r\n        xd.length = xdi + 1;\r\n        k = mathpow(10, LOG_BASE - i);\r\n\r\n        // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n        // j > 0 means i > number of leading zeros of w.\r\n        xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n      }\r\n\r\n      if (roundUp) {\r\n        for (;;) {\r\n\r\n          // Is the digit to be rounded up in the first word of xd?\r\n          if (xdi == 0) {\r\n\r\n            // i will be the length of xd[0] before k is added.\r\n            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n            j = xd[0] += k;\r\n            for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n            // if i != k the length has increased.\r\n            if (i != k) {\r\n              x.e++;\r\n              if (xd[0] == BASE) xd[0] = 1;\r\n            }\r\n\r\n            break;\r\n          } else {\r\n            xd[xdi] += k;\r\n            if (xd[xdi] != BASE) break;\r\n            xd[xdi--] = 0;\r\n            k = 1;\r\n          }\r\n        }\r\n      }\r\n\r\n      // Remove trailing zeros.\r\n      for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n    }\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > Ctor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < Ctor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // Ctor.underflow = true;\r\n      } // else Ctor.underflow = false;\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function finiteToString(x, isExp, sd) {\r\n    if (!x.isFinite()) return nonFiniteToString(x);\r\n    var k,\r\n      e = x.e,\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(digits, e) {\r\n    var w = digits[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n    if (sd > LN10_PRECISION) {\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(precisionLimitExceeded);\r\n    }\r\n    return finalise(new Ctor(LN10), sd, 1, true);\r\n  }\r\n\r\n\r\n  function getPi(Ctor, sd, rm) {\r\n    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n    return finalise(new Ctor(PI), sd, rm, true);\r\n  }\r\n\r\n\r\n  function getPrecision(digits) {\r\n    var w = digits.length - 1,\r\n      len = w * LOG_BASE + 1;\r\n\r\n    w = digits[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) len--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = digits[0]; w >= 10; w /= 10) len++;\r\n    }\r\n\r\n    return len;\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n   * integer of type number.\r\n   *\r\n   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n   *\r\n   */\r\n  function intPow(Ctor, x, n, pr) {\r\n    var isTruncated,\r\n      r = new Ctor(1),\r\n\r\n      // Max n of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n    external = false;\r\n\r\n    for (;;) {\r\n      if (n % 2) {\r\n        r = r.times(x);\r\n        if (truncate(r.d, k)) isTruncated = true;\r\n      }\r\n\r\n      n = mathfloor(n / 2);\r\n      if (n === 0) {\r\n\r\n        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n        n = r.d.length - 1;\r\n        if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n        break;\r\n      }\r\n\r\n      x = x.times(x);\r\n      truncate(x.d, k);\r\n    }\r\n\r\n    external = true;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  function isOdd(n) {\r\n    return n.d[n.d.length - 1] & 1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n   */\r\n  function maxOrMin(Ctor, args, ltgt) {\r\n    var y,\r\n      x = new Ctor(args[0]),\r\n      i = 0;\r\n\r\n    for (; ++i < args.length;) {\r\n      y = new Ctor(args[i]);\r\n      if (!y.s) {\r\n        x = y;\r\n        break;\r\n      } else if (x[ltgt](y)) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(Infinity)  = Infinity\r\n   *  exp(-Infinity) = 0\r\n   *  exp(NaN)       = NaN\r\n   *  exp(±0)        = 1\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   *  The result will always be correctly rounded.\r\n   *\r\n   */\r\n  function naturalExponential(x, sd) {\r\n    var denominator, guard, j, pow, sum, t, wpr,\r\n      rep = 0,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // 0/NaN/Infinity?\r\n    if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n      return new Ctor(x.d\r\n        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n        : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    // while abs(x) >= 0.1\r\n    while (x.e > -2) {\r\n\r\n      // x = x / 2^5\r\n      x = x.times(t);\r\n      k += 5;\r\n    }\r\n\r\n    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n    // necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(1);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = finalise(pow.times(x), wpr, 1);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        j = k;\r\n        while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n        // Check to see if the first 4 rounding digits are [49]999.\r\n        // If so, repeat the summation with a higher precision, otherwise\r\n        // e.g. with precision: 18, rounding: 1\r\n        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n\r\n          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += 10;\r\n            denominator = pow = t = new Ctor(1);\r\n            i = 0;\r\n            rep++;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(-n)        = NaN\r\n   *  ln(0)         = -Infinity\r\n   *  ln(-0)        = -Infinity\r\n   *  ln(1)         = 0\r\n   *  ln(Infinity)  = Infinity\r\n   *  ln(-Infinity) = NaN\r\n   *  ln(NaN)       = NaN\r\n   *\r\n   *  ln(n) (n != 1) is non-terminating.\r\n   *\r\n   */\r\n  function naturalLogarithm(y, sd) {\r\n    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // Is x negative or Infinity, NaN, 0 or 1?\r\n    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n    }\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    Ctor.precision = wpr += guard;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n\r\n    if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = x.e;\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n      Ctor.precision = pr;\r\n\r\n      return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n    }\r\n\r\n    // x1 is x reduced to a value near 1.\r\n    x1 = x;\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n    x2 = finalise(x.times(x), wpr, 1);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = finalise(numerator.times(x2), wpr, 1);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n        // been repeated previously) and the first 4 rounding digits 9999?\r\n        // If so, restart the summation with a higher precision, otherwise\r\n        // e.g. with precision: 12, rounding: 1\r\n        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += guard;\r\n            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n            x2 = finalise(x.times(x), wpr, 1);\r\n            denominator = rep = 1;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  // ±Infinity, NaN.\r\n  function nonFiniteToString(x) {\r\n    // Unsigned.\r\n    return String(x.s * x.s / 0);\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      x.e = e = e - i - 1;\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external) {\r\n\r\n        // Overflow?\r\n        if (x.e > x.constructor.maxE) {\r\n\r\n          // Infinity.\r\n          x.d = null;\r\n          x.e = NaN;\r\n\r\n        // Underflow?\r\n        } else if (x.e < x.constructor.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n          // x.constructor.underflow = true;\r\n        } // else x.constructor.underflow = false;\r\n      }\r\n    } else {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n   */\r\n  function parseOther(x, str) {\r\n    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n    if (str.indexOf('_') > -1) {\r\n      str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n      if (isDecimal.test(str)) return parseDecimal(x, str);\r\n    } else if (str === 'Infinity' || str === 'NaN') {\r\n      if (!+str) x.s = NaN;\r\n      x.e = NaN;\r\n      x.d = null;\r\n      return x;\r\n    }\r\n\r\n    if (isHex.test(str))  {\r\n      base = 16;\r\n      str = str.toLowerCase();\r\n    } else if (isBinary.test(str))  {\r\n      base = 2;\r\n    } else if (isOctal.test(str))  {\r\n      base = 8;\r\n    } else {\r\n      throw Error(invalidArgument + str);\r\n    }\r\n\r\n    // Is there a binary exponent part?\r\n    i = str.search(/p/i);\r\n\r\n    if (i > 0) {\r\n      p = +str.slice(i + 1);\r\n      str = str.substring(2, i);\r\n    } else {\r\n      str = str.slice(2);\r\n    }\r\n\r\n    // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n    // fraction part will be restored.\r\n    i = str.indexOf('.');\r\n    isFloat = i >= 0;\r\n    Ctor = x.constructor;\r\n\r\n    if (isFloat) {\r\n      str = str.replace('.', '');\r\n      len = str.length;\r\n      i = len - i;\r\n\r\n      // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n      divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n    }\r\n\r\n    xd = convertBase(str, base, BASE);\r\n    xe = xd.length - 1;\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xe; xd[i] === 0; --i) xd.pop();\r\n    if (i < 0) return new Ctor(x.s * 0);\r\n    x.e = getBase10Exponent(xd, xe);\r\n    x.d = xd;\r\n    external = false;\r\n\r\n    // At what precision to perform the division to ensure exact conversion?\r\n    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n    // Therefore using 4 * the number of digits of str will always be enough.\r\n    if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n    // Multiply by the binary exponent part if present.\r\n    if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n    external = true;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function sine(Ctor, x) {\r\n    var k,\r\n      len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n    }\r\n\r\n    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x);\r\n\r\n    // Reverse argument reduction\r\n    var sin2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sin2_x = x.times(x);\r\n      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\n  function taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n    var j, t, u, x2,\r\n      i = 1,\r\n      pr = Ctor.precision,\r\n      k = Math.ceil(pr / LOG_BASE);\r\n\r\n    external = false;\r\n    x2 = x.times(x);\r\n    u = new Ctor(y);\r\n\r\n    for (;;) {\r\n      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      t = u.plus(y);\r\n\r\n      if (t.d[k] !== void 0) {\r\n        for (j = k; t.d[j] === u.d[j] && j--;);\r\n        if (j == -1) break;\r\n      }\r\n\r\n      j = u;\r\n      u = y;\r\n      y = t;\r\n      t = j;\r\n      i++;\r\n    }\r\n\r\n    external = true;\r\n    t.d.length = k + 1;\r\n\r\n    return t;\r\n  }\r\n\r\n\r\n  // Exponent e must be positive and non-zero.\r\n  function tinyPow(b, e) {\r\n    var n = b;\r\n    while (--e) n *= b;\r\n    return n;\r\n  }\r\n\r\n\r\n  // Return the absolute value of `x` reduced to less than or equal to half pi.\r\n  function toLessThanHalfPi(Ctor, x) {\r\n    var t,\r\n      isNeg = x.s < 0,\r\n      pi = getPi(Ctor, Ctor.precision, 1),\r\n      halfPi = pi.times(0.5);\r\n\r\n    x = x.abs();\r\n\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isNeg ? 4 : 1;\r\n      return x;\r\n    }\r\n\r\n    t = x.divToInt(pi);\r\n\r\n    if (t.isZero()) {\r\n      quadrant = isNeg ? 3 : 2;\r\n    } else {\r\n      x = x.minus(t.times(pi));\r\n\r\n      // 0 <= x < pi\r\n      if (x.lte(halfPi)) {\r\n        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n        return x;\r\n      }\r\n\r\n      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n    }\r\n\r\n    return x.minus(pi).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return the value of Decimal `x` as a string in base `baseOut`.\r\n   *\r\n   * If the optional `sd` argument is present include a binary exponent suffix.\r\n   */\r\n  function toStringBinary(x, baseOut, sd, rm) {\r\n    var base, e, i, k, len, roundUp, str, xd, y,\r\n      Ctor = x.constructor,\r\n      isExp = sd !== void 0;\r\n\r\n    if (isExp) {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    } else {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    }\r\n\r\n    if (!x.isFinite()) {\r\n      str = nonFiniteToString(x);\r\n    } else {\r\n      str = finiteToString(x);\r\n      i = str.indexOf('.');\r\n\r\n      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n      // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n      // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n      if (isExp) {\r\n        base = 2;\r\n        if (baseOut == 16) {\r\n          sd = sd * 4 - 3;\r\n        } else if (baseOut == 8) {\r\n          sd = sd * 3 - 2;\r\n        }\r\n      } else {\r\n        base = baseOut;\r\n      }\r\n\r\n      // Convert the number as an integer then divide the result by its base raised to a power such\r\n      // that the fraction part will be restored.\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        str = str.replace('.', '');\r\n        y = new Ctor(1);\r\n        y.e = str.length - i;\r\n        y.d = convertBase(finiteToString(y), 10, base);\r\n        y.e = y.d.length;\r\n      }\r\n\r\n      xd = convertBase(str, 10, base);\r\n      e = len = xd.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xd[--len] == 0;) xd.pop();\r\n\r\n      if (!xd[0]) {\r\n        str = isExp ? '0p+0' : '0';\r\n      } else {\r\n        if (i < 0) {\r\n          e--;\r\n        } else {\r\n          x = new Ctor(x);\r\n          x.d = xd;\r\n          x.e = e;\r\n          x = divide(x, y, sd, rm, 0, base);\r\n          xd = x.d;\r\n          e = x.e;\r\n          roundUp = inexact;\r\n        }\r\n\r\n        // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        i = xd[sd];\r\n        k = base / 2;\r\n        roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n        roundUp = rm < 4\r\n          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n            rm === (x.s < 0 ? 8 : 7));\r\n\r\n        xd.length = sd;\r\n\r\n        if (roundUp) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (; ++xd[--sd] > base - 1;) {\r\n            xd[sd] = 0;\r\n            if (!sd) {\r\n              ++e;\r\n              xd.unshift(1);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n        // Add binary exponent suffix?\r\n        if (isExp) {\r\n          if (len > 1) {\r\n            if (baseOut == 16 || baseOut == 8) {\r\n              i = baseOut == 16 ? 4 : 3;\r\n              for (--len; len % i; len++) str += '0';\r\n              xd = convertBase(str, base, baseOut);\r\n              for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n              // xd[0] will always be be 1\r\n              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n            } else {\r\n              str = str.charAt(0) + '.' + str.slice(1);\r\n            }\r\n          }\r\n\r\n          str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n        } else if (e < 0) {\r\n          for (; ++e;) str = '0' + str;\r\n          str = '0.' + str;\r\n        } else {\r\n          if (++e > len) for (e -= len; e-- ;) str += '0';\r\n          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n        }\r\n      }\r\n\r\n      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  abs\r\n   *  acos\r\n   *  acosh\r\n   *  add\r\n   *  asin\r\n   *  asinh\r\n   *  atan\r\n   *  atanh\r\n   *  atan2\r\n   *  cbrt\r\n   *  ceil\r\n   *  clamp\r\n   *  clone\r\n   *  config\r\n   *  cos\r\n   *  cosh\r\n   *  div\r\n   *  exp\r\n   *  floor\r\n   *  hypot\r\n   *  ln\r\n   *  log\r\n   *  log2\r\n   *  log10\r\n   *  max\r\n   *  min\r\n   *  mod\r\n   *  mul\r\n   *  pow\r\n   *  random\r\n   *  round\r\n   *  set\r\n   *  sign\r\n   *  sin\r\n   *  sinh\r\n   *  sqrt\r\n   *  sub\r\n   *  sum\r\n   *  tan\r\n   *  tanh\r\n   *  trunc\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function abs(x) {\r\n    return new this(x).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function acos(x) {\r\n    return new this(x).acos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function acosh(x) {\r\n    return new this(x).acosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function add(x, y) {\r\n    return new this(x).plus(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function asin(x) {\r\n    return new this(x).asin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function asinh(x) {\r\n    return new this(x).asinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function atan(x) {\r\n    return new this(x).atan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function atanh(x) {\r\n    return new this(x).atanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi, pi]\r\n   *\r\n   * y {number|string|Decimal} The y-coordinate.\r\n   * x {number|string|Decimal} The x-coordinate.\r\n   *\r\n   * atan2(±0, -0)               = ±pi\r\n   * atan2(±0, +0)               = ±0\r\n   * atan2(±0, -x)               = ±pi for x > 0\r\n   * atan2(±0, x)                = ±0 for x > 0\r\n   * atan2(-y, ±0)               = -pi/2 for y > 0\r\n   * atan2(y, ±0)                = pi/2 for y > 0\r\n   * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n   * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n   * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n   * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n   * atan2(±Infinity, +Infinity) = ±pi/4\r\n   * atan2(NaN, x) = NaN\r\n   * atan2(y, NaN) = NaN\r\n   *\r\n   */\r\n  function atan2(y, x) {\r\n    y = new this(y);\r\n    x = new this(x);\r\n    var r,\r\n      pr = this.precision,\r\n      rm = this.rounding,\r\n      wpr = pr + 4;\r\n\r\n    // Either NaN\r\n    if (!y.s || !x.s) {\r\n      r = new this(NaN);\r\n\r\n    // Both ±Infinity\r\n    } else if (!y.d && !x.d) {\r\n      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n      r.s = y.s;\r\n\r\n    // x is ±Infinity or y is ±0\r\n    } else if (!x.d || y.isZero()) {\r\n      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n      r.s = y.s;\r\n\r\n    // y is ±Infinity or x is ±0\r\n    } else if (!y.d || x.isZero()) {\r\n      r = getPi(this, wpr, 1).times(0.5);\r\n      r.s = y.s;\r\n\r\n    // Both non-zero and finite\r\n    } else if (x.s < 0) {\r\n      this.precision = wpr;\r\n      this.rounding = 1;\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n      x = getPi(this, wpr, 1);\r\n      this.precision = pr;\r\n      this.rounding = rm;\r\n      r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n    } else {\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function cbrt(x) {\r\n    return new this(x).cbrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ceil(x) {\r\n    return finalise(x = new this(x), x.e + 1, 2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  function clamp(x, min, max) {\r\n    return new this(x).clamp(min, max);\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *   maxE       {number}\r\n   *   minE       {number}\r\n   *   modulo     {number}\r\n   *   crypto     {boolean|number}\r\n   *   defaults   {true}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n    var i, p, v,\r\n      useDefaults = obj.defaults === true,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -EXP_LIMIT, 0,\r\n        'toExpPos', 0, EXP_LIMIT,\r\n        'maxE', 0, EXP_LIMIT,\r\n        'minE', -EXP_LIMIT, 0,\r\n        'modulo', 0, 9\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n      if ((v = obj[p]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (v === true || v === false || v === 0 || v === 1) {\r\n        if (v) {\r\n          if (typeof crypto != 'undefined' && crypto &&\r\n            (crypto.getRandomValues || crypto.randomBytes)) {\r\n            this[p] = true;\r\n          } else {\r\n            throw Error(cryptoUnavailable);\r\n          }\r\n        } else {\r\n          this[p] = false;\r\n        }\r\n      } else {\r\n        throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cos(x) {\r\n    return new this(x).cos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cosh(x) {\r\n    return new this(x).cosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * v {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(v) {\r\n      var e, i, t,\r\n        x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (isDecimalInstance(v)) {\r\n        x.s = v.s;\r\n\r\n        if (external) {\r\n          if (!v.d || v.e > Decimal.maxE) {\r\n\r\n            // Infinity.\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (v.e < Decimal.minE) {\r\n\r\n            // Zero.\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.d = v.d.slice();\r\n          }\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d ? v.d.slice() : v.d;\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      t = typeof v;\r\n\r\n      if (t === 'number') {\r\n        if (v === 0) {\r\n          x.s = 1 / v < 0 ? -1 : 1;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        if (v < 0) {\r\n          v = -v;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 1;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (v === ~~v && v < 1e7) {\r\n          for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n          if (external) {\r\n            if (e > Decimal.maxE) {\r\n              x.e = NaN;\r\n              x.d = null;\r\n            } else if (e < Decimal.minE) {\r\n              x.e = 0;\r\n              x.d = [0];\r\n            } else {\r\n              x.e = e;\r\n              x.d = [v];\r\n            }\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n\r\n          return;\r\n\r\n        // Infinity, NaN.\r\n        } else if (v * 0 !== 0) {\r\n          if (!v) x.s = NaN;\r\n          x.e = NaN;\r\n          x.d = null;\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, v.toString());\r\n\r\n      } else if (t !== 'string') {\r\n        throw Error(invalidArgument + v);\r\n      }\r\n\r\n      // Minus sign?\r\n      if ((i = v.charCodeAt(0)) === 45) {\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        // Plus sign?\r\n        if (i === 43) v = v.slice(1);\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n    Decimal.EUCLID = 9;\r\n\r\n    Decimal.config = Decimal.set = config;\r\n    Decimal.clone = clone;\r\n    Decimal.isDecimal = isDecimalInstance;\r\n\r\n    Decimal.abs = abs;\r\n    Decimal.acos = acos;\r\n    Decimal.acosh = acosh;        // ES6\r\n    Decimal.add = add;\r\n    Decimal.asin = asin;\r\n    Decimal.asinh = asinh;        // ES6\r\n    Decimal.atan = atan;\r\n    Decimal.atanh = atanh;        // ES6\r\n    Decimal.atan2 = atan2;\r\n    Decimal.cbrt = cbrt;          // ES6\r\n    Decimal.ceil = ceil;\r\n    Decimal.clamp = clamp;\r\n    Decimal.cos = cos;\r\n    Decimal.cosh = cosh;          // ES6\r\n    Decimal.div = div;\r\n    Decimal.exp = exp;\r\n    Decimal.floor = floor;\r\n    Decimal.hypot = hypot;        // ES6\r\n    Decimal.ln = ln;\r\n    Decimal.log = log;\r\n    Decimal.log10 = log10;        // ES6\r\n    Decimal.log2 = log2;          // ES6\r\n    Decimal.max = max;\r\n    Decimal.min = min;\r\n    Decimal.mod = mod;\r\n    Decimal.mul = mul;\r\n    Decimal.pow = pow;\r\n    Decimal.random = random;\r\n    Decimal.round = round;\r\n    Decimal.sign = sign;          // ES6\r\n    Decimal.sin = sin;\r\n    Decimal.sinh = sinh;          // ES6\r\n    Decimal.sqrt = sqrt;\r\n    Decimal.sub = sub;\r\n    Decimal.sum = sum;\r\n    Decimal.tan = tan;\r\n    Decimal.tanh = tanh;          // ES6\r\n    Decimal.trunc = trunc;        // ES6\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      if (obj.defaults !== true) {\r\n        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n      }\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function div(x, y) {\r\n    return new this(x).div(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The power to which to raise the base of the natural log.\r\n   *\r\n   */\r\n  function exp(x) {\r\n    return new this(x).exp();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function floor(x) {\r\n    return finalise(x = new this(x), x.e + 1, 3);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function hypot() {\r\n    var i, n,\r\n      t = new this(0);\r\n\r\n    external = false;\r\n\r\n    for (i = 0; i < arguments.length;) {\r\n      n = new this(arguments[i++]);\r\n      if (!n.d) {\r\n        if (n.s) {\r\n          external = true;\r\n          return new this(1 / 0);\r\n        }\r\n        t = n;\r\n      } else if (t.d) {\r\n        t = t.plus(n.times(n));\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return t.sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  function isDecimalInstance(obj) {\r\n    return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ln(x) {\r\n    return new this(x).ln();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * log[y](x)\r\n   *\r\n   * x {number|string|Decimal} The argument of the logarithm.\r\n   * y {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  function log(x, y) {\r\n    return new this(x).log(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log2(x) {\r\n    return new this(x).log(2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log10(x) {\r\n    return new this(x).log(10);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function max() {\r\n    return maxOrMin(this, arguments, 'lt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function min() {\r\n    return maxOrMin(this, arguments, 'gt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mod(x, y) {\r\n    return new this(x).mod(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mul(x, y) {\r\n    return new this(x).mul(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The base.\r\n   * y {number|string|Decimal} The exponent.\r\n   *\r\n   */\r\n  function pow(x, y) {\r\n    return new this(x).pow(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n   * are produced).\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n   *\r\n   */\r\n  function random(sd) {\r\n    var d, e, k, n,\r\n      i = 0,\r\n      r = new this(1),\r\n      rd = [];\r\n\r\n    if (sd === void 0) sd = this.precision;\r\n    else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    k = Math.ceil(sd / LOG_BASE);\r\n\r\n    if (!this.crypto) {\r\n      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n    // Browsers supporting crypto.getRandomValues.\r\n    } else if (crypto.getRandomValues) {\r\n      d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n      for (; i < k;) {\r\n        n = d[i];\r\n\r\n        // 0 <= n < 4294967296\r\n        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n        if (n >= 4.29e9) {\r\n          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n        } else {\r\n\r\n          // 0 <= n <= 4289999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd[i++] = n % 1e7;\r\n        }\r\n      }\r\n\r\n    // Node.js supporting crypto.randomBytes.\r\n    } else if (crypto.randomBytes) {\r\n\r\n      // buffer\r\n      d = crypto.randomBytes(k *= 4);\r\n\r\n      for (; i < k;) {\r\n\r\n        // 0 <= n < 2147483648\r\n        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n        if (n >= 2.14e9) {\r\n          crypto.randomBytes(4).copy(d, i);\r\n        } else {\r\n\r\n          // 0 <= n <= 2139999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd.push(n % 1e7);\r\n          i += 4;\r\n        }\r\n      }\r\n\r\n      i = k / 4;\r\n    } else {\r\n      throw Error(cryptoUnavailable);\r\n    }\r\n\r\n    k = rd[--i];\r\n    sd %= LOG_BASE;\r\n\r\n    // Convert trailing digits to zeros according to sd.\r\n    if (k && sd) {\r\n      n = mathpow(10, LOG_BASE - sd);\r\n      rd[i] = (k / n | 0) * n;\r\n    }\r\n\r\n    // Remove trailing words which are zero.\r\n    for (; rd[i] === 0; i--) rd.pop();\r\n\r\n    // Zero?\r\n    if (i < 0) {\r\n      e = 0;\r\n      rd = [0];\r\n    } else {\r\n      e = -1;\r\n\r\n      // Remove leading words which are zero and adjust exponent accordingly.\r\n      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n      // Count the digits of the first word of rd to determine leading zeros.\r\n      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n      // Adjust the exponent for leading zeros of the first word of rd.\r\n      if (k < LOG_BASE) e -= LOG_BASE - k;\r\n    }\r\n\r\n    r.e = e;\r\n    r.d = rd;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n   *\r\n   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function round(x) {\r\n    return finalise(x = new this(x), x.e + 1, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if x > 0,\r\n   *  -1    if x < 0,\r\n   *   0    if x is 0,\r\n   *  -0    if x is -0,\r\n   *   NaN  otherwise\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sign(x) {\r\n    x = new this(x);\r\n    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sin(x) {\r\n    return new this(x).sin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sinh(x) {\r\n    return new this(x).sinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sqrt(x) {\r\n    return new this(x).sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function sub(x, y) {\r\n    return new this(x).sub(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * Only the result is rounded, not the intermediate calculations.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function sum() {\r\n    var i = 0,\r\n      args = arguments,\r\n      x = new this(args[i]);\r\n\r\n    external = false;\r\n    for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n    external = true;\r\n\r\n    return finalise(x, this.precision, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tan(x) {\r\n    return new this(x).tan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tanh(x) {\r\n    return new this(x).tanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` truncated to an integer.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function trunc(x) {\r\n    return finalise(x = new this(x), x.e + 1, 1);\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(DEFAULTS);\r\n  Decimal.prototype.constructor = Decimal;\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Create the internal constants from their string values.\r\n  LN10 = new Decimal(LN10);\r\n  PI = new Decimal(PI);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (true) {\r\n    !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {\r\n      return Decimal;\r\n    }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else {}\r\n})(this);\r\n\n\n/***/ }),\n\n/***/ 2296:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar $defineProperty = __webpack_require__(4429);\n\nvar $SyntaxError = __webpack_require__(3464);\nvar $TypeError = __webpack_require__(4453);\n\nvar gopd = __webpack_require__(7296);\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n\n\n/***/ }),\n\n/***/ 4289:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar keys = __webpack_require__(2215);\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar defineDataProperty = __webpack_require__(2296);\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar supportsDescriptors = __webpack_require__(1044)();\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object) {\n\t\tif (predicate === true) {\n\t\t\tif (object[name] === value) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} else if (!isFunction(predicate) || !predicate()) {\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (supportsDescriptors) {\n\t\tdefineDataProperty(object, name, value, true);\n\t} else {\n\t\tdefineDataProperty(object, name, value);\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n\n\n/***/ }),\n\n/***/ 2114:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nfunction assign(obj, props) {\n    for (const key in props) {\n        Object.defineProperty(obj, key, {\n            value: props[key],\n            enumerable: true,\n            configurable: true,\n        });\n    }\n\n    return obj;\n}\n\nfunction createError(err, code, props) {\n    if (!err || typeof err === 'string') {\n        throw new TypeError('Please pass an Error to err-code');\n    }\n\n    if (!props) {\n        props = {};\n    }\n\n    if (typeof code === 'object') {\n        props = code;\n        code = undefined;\n    }\n\n    if (code != null) {\n        props.code = code;\n    }\n\n    try {\n        return assign(err, props);\n    } catch (_) {\n        props.message = err.message;\n        props.stack = err.stack;\n\n        const ErrClass = function () {};\n\n        ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n        return assign(new ErrClass(), props);\n    }\n}\n\nmodule.exports = createError;\n\n\n/***/ }),\n\n/***/ 4429:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar GetIntrinsic = __webpack_require__(210);\n\n/** @type {import('.')} */\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true) || false;\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = false;\n\t}\n}\n\nmodule.exports = $defineProperty;\n\n\n/***/ }),\n\n/***/ 3981:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./eval')} */\nmodule.exports = EvalError;\n\n\n/***/ }),\n\n/***/ 1648:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('.')} */\nmodule.exports = Error;\n\n\n/***/ }),\n\n/***/ 4726:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./range')} */\nmodule.exports = RangeError;\n\n\n/***/ }),\n\n/***/ 6712:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./ref')} */\nmodule.exports = ReferenceError;\n\n\n/***/ }),\n\n/***/ 3464:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./syntax')} */\nmodule.exports = SyntaxError;\n\n\n/***/ }),\n\n/***/ 4453:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\n\n\n/***/ }),\n\n/***/ 3915:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('./uri')} */\nmodule.exports = URIError;\n\n\n/***/ }),\n\n/***/ 6729:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif (true) {\n  module.exports = EventEmitter;\n}\n\n\n/***/ }),\n\n/***/ 4029:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar isCallable = __webpack_require__(5320);\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n    for (var i = 0, len = array.length; i < len; i++) {\n        if (hasOwnProperty.call(array, i)) {\n            if (receiver == null) {\n                iterator(array[i], i, array);\n            } else {\n                iterator.call(receiver, array[i], i, array);\n            }\n        }\n    }\n};\n\nvar forEachString = function forEachString(string, iterator, receiver) {\n    for (var i = 0, len = string.length; i < len; i++) {\n        // no such thing as a sparse string.\n        if (receiver == null) {\n            iterator(string.charAt(i), i, string);\n        } else {\n            iterator.call(receiver, string.charAt(i), i, string);\n        }\n    }\n};\n\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n    for (var k in object) {\n        if (hasOwnProperty.call(object, k)) {\n            if (receiver == null) {\n                iterator(object[k], k, object);\n            } else {\n                iterator.call(receiver, object[k], k, object);\n            }\n        }\n    }\n};\n\nvar forEach = function forEach(list, iterator, thisArg) {\n    if (!isCallable(iterator)) {\n        throw new TypeError('iterator must be a function');\n    }\n\n    var receiver;\n    if (arguments.length >= 3) {\n        receiver = thisArg;\n    }\n\n    if (toStr.call(list) === '[object Array]') {\n        forEachArray(list, iterator, receiver);\n    } else if (typeof list === 'string') {\n        forEachString(list, iterator, receiver);\n    } else {\n        forEachObject(list, iterator, receiver);\n    }\n};\n\nmodule.exports = forEach;\n\n\n/***/ }),\n\n/***/ 7648:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar toStr = Object.prototype.toString;\nvar max = Math.max;\nvar funcType = '[object Function]';\n\nvar concatty = function concatty(a, b) {\n    var arr = [];\n\n    for (var i = 0; i < a.length; i += 1) {\n        arr[i] = a[i];\n    }\n    for (var j = 0; j < b.length; j += 1) {\n        arr[j + a.length] = b[j];\n    }\n\n    return arr;\n};\n\nvar slicy = function slicy(arrLike, offset) {\n    var arr = [];\n    for (var i = offset || 0, j = 0; i < arrLike.length; i += 1, j += 1) {\n        arr[j] = arrLike[i];\n    }\n    return arr;\n};\n\nvar joiny = function (arr, joiner) {\n    var str = '';\n    for (var i = 0; i < arr.length; i += 1) {\n        str += arr[i];\n        if (i + 1 < arr.length) {\n            str += joiner;\n        }\n    }\n    return str;\n};\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.apply(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slicy(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                concatty(args, arguments)\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        }\n        return target.apply(\n            that,\n            concatty(args, arguments)\n        );\n\n    };\n\n    var boundLength = max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs[i] = '$' + i;\n    }\n\n    bound = Function('binder', 'return function (' + joiny(boundArgs, ',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n\n\n/***/ }),\n\n/***/ 8612:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar implementation = __webpack_require__(7648);\n\nmodule.exports = Function.prototype.bind || implementation;\n\n\n/***/ }),\n\n/***/ 210:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar undefined;\n\nvar $Error = __webpack_require__(1648);\nvar $EvalError = __webpack_require__(3981);\nvar $RangeError = __webpack_require__(4726);\nvar $ReferenceError = __webpack_require__(6712);\nvar $SyntaxError = __webpack_require__(3464);\nvar $TypeError = __webpack_require__(4453);\nvar $URIError = __webpack_require__(3915);\n\nvar $Function = Function;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = __webpack_require__(1405)();\nvar hasProto = __webpack_require__(8185)();\n\nvar getProto = Object.getPrototypeOf || (\n\thasProto\n\t\t? function (x) { return x.__proto__; } // eslint-disable-line no-proto\n\t\t: null\n);\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t__proto__: null,\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': $Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': $EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': $RangeError,\n\t'%ReferenceError%': $ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': $URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t__proto__: null,\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = __webpack_require__(8612);\nvar hasOwn = __webpack_require__(8824);\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\nvar $exec = bind.call(Function.call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n\n\n/***/ }),\n\n/***/ 7296:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar GetIntrinsic = __webpack_require__(210);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n\n\n/***/ }),\n\n/***/ 1044:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar $defineProperty = __webpack_require__(4429);\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\treturn !!$defineProperty;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!$defineProperty) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n\n\n/***/ }),\n\n/***/ 8185:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar test = {\n\t__proto__: null,\n\tfoo: {}\n};\n\nvar $Object = Object;\n\n/** @type {import('.')} */\nmodule.exports = function hasProto() {\n\t// @ts-expect-error: TS errors on an inherited property for some reason\n\treturn { __proto__: test }.foo === test.foo\n\t\t&& !(test instanceof $Object);\n};\n\n\n/***/ }),\n\n/***/ 1405:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = __webpack_require__(5419);\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n\n\n/***/ }),\n\n/***/ 5419:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n\n\n/***/ }),\n\n/***/ 6410:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar hasSymbols = __webpack_require__(5419);\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n\n\n/***/ }),\n\n/***/ 8824:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar call = Function.prototype.call;\nvar $hasOwn = Object.prototype.hasOwnProperty;\nvar bind = __webpack_require__(8612);\n\n/** @type {import('.')} */\nmodule.exports = bind.call(call, $hasOwn);\n\n\n/***/ }),\n\n/***/ 8679:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar reactIs = __webpack_require__(7109);\n\n/**\n * Copyright 2015, Yahoo! Inc.\n * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.\n */\nvar REACT_STATICS = {\n  childContextTypes: true,\n  contextType: true,\n  contextTypes: true,\n  defaultProps: true,\n  displayName: true,\n  getDefaultProps: true,\n  getDerivedStateFromError: true,\n  getDerivedStateFromProps: true,\n  mixins: true,\n  propTypes: true,\n  type: true\n};\nvar KNOWN_STATICS = {\n  name: true,\n  length: true,\n  prototype: true,\n  caller: true,\n  callee: true,\n  arguments: true,\n  arity: true\n};\nvar FORWARD_REF_STATICS = {\n  '$$typeof': true,\n  render: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true\n};\nvar MEMO_STATICS = {\n  '$$typeof': true,\n  compare: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true,\n  type: true\n};\nvar TYPE_STATICS = {};\nTYPE_STATICS[reactIs.ForwardRef] = FORWARD_REF_STATICS;\nTYPE_STATICS[reactIs.Memo] = MEMO_STATICS;\n\nfunction getStatics(component) {\n  // React v16.11 and below\n  if (reactIs.isMemo(component)) {\n    return MEMO_STATICS;\n  } // React v16.12 and above\n\n\n  return TYPE_STATICS[component['$$typeof']] || REACT_STATICS;\n}\n\nvar defineProperty = Object.defineProperty;\nvar getOwnPropertyNames = Object.getOwnPropertyNames;\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\nvar getPrototypeOf = Object.getPrototypeOf;\nvar objectPrototype = Object.prototype;\nfunction hoistNonReactStatics(targetComponent, sourceComponent, blacklist) {\n  if (typeof sourceComponent !== 'string') {\n    // don't hoist over string (html) components\n    if (objectPrototype) {\n      var inheritedComponent = getPrototypeOf(sourceComponent);\n\n      if (inheritedComponent && inheritedComponent !== objectPrototype) {\n        hoistNonReactStatics(targetComponent, inheritedComponent, blacklist);\n      }\n    }\n\n    var keys = getOwnPropertyNames(sourceComponent);\n\n    if (getOwnPropertySymbols) {\n      keys = keys.concat(getOwnPropertySymbols(sourceComponent));\n    }\n\n    var targetStatics = getStatics(targetComponent);\n    var sourceStatics = getStatics(sourceComponent);\n\n    for (var i = 0; i < keys.length; ++i) {\n      var key = keys[i];\n\n      if (!KNOWN_STATICS[key] && !(blacklist && blacklist[key]) && !(sourceStatics && sourceStatics[key]) && !(targetStatics && targetStatics[key])) {\n        var descriptor = getOwnPropertyDescriptor(sourceComponent, key);\n\n        try {\n          // Avoid failures from read-only properties\n          defineProperty(targetComponent, key, descriptor);\n        } catch (e) {}\n      }\n    }\n  }\n\n  return targetComponent;\n}\n\nmodule.exports = hoistNonReactStatics;\n\n\n/***/ }),\n\n/***/ 6103:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n/** @license React v16.13.1\n * react-is.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar b=\"function\"===typeof Symbol&&Symbol.for,c=b?Symbol.for(\"react.element\"):60103,d=b?Symbol.for(\"react.portal\"):60106,e=b?Symbol.for(\"react.fragment\"):60107,f=b?Symbol.for(\"react.strict_mode\"):60108,g=b?Symbol.for(\"react.profiler\"):60114,h=b?Symbol.for(\"react.provider\"):60109,k=b?Symbol.for(\"react.context\"):60110,l=b?Symbol.for(\"react.async_mode\"):60111,m=b?Symbol.for(\"react.concurrent_mode\"):60111,n=b?Symbol.for(\"react.forward_ref\"):60112,p=b?Symbol.for(\"react.suspense\"):60113,q=b?\nSymbol.for(\"react.suspense_list\"):60120,r=b?Symbol.for(\"react.memo\"):60115,t=b?Symbol.for(\"react.lazy\"):60116,v=b?Symbol.for(\"react.block\"):60121,w=b?Symbol.for(\"react.fundamental\"):60117,x=b?Symbol.for(\"react.responder\"):60118,y=b?Symbol.for(\"react.scope\"):60119;\nfunction z(a){if(\"object\"===typeof a&&null!==a){var u=a.$$typeof;switch(u){case c:switch(a=a.type,a){case l:case m:case e:case g:case f:case p:return a;default:switch(a=a&&a.$$typeof,a){case k:case n:case t:case r:case h:return a;default:return u}}case d:return u}}}function A(a){return z(a)===m}exports.AsyncMode=l;exports.ConcurrentMode=m;exports.ContextConsumer=k;exports.ContextProvider=h;exports.Element=c;exports.ForwardRef=n;exports.Fragment=e;exports.Lazy=t;exports.Memo=r;exports.Portal=d;\nexports.Profiler=g;exports.StrictMode=f;exports.Suspense=p;exports.isAsyncMode=function(a){return A(a)||z(a)===l};exports.isConcurrentMode=A;exports.isContextConsumer=function(a){return z(a)===k};exports.isContextProvider=function(a){return z(a)===h};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===c};exports.isForwardRef=function(a){return z(a)===n};exports.isFragment=function(a){return z(a)===e};exports.isLazy=function(a){return z(a)===t};\nexports.isMemo=function(a){return z(a)===r};exports.isPortal=function(a){return z(a)===d};exports.isProfiler=function(a){return z(a)===g};exports.isStrictMode=function(a){return z(a)===f};exports.isSuspense=function(a){return z(a)===p};\nexports.isValidElementType=function(a){return\"string\"===typeof a||\"function\"===typeof a||a===e||a===m||a===g||a===f||a===p||a===q||\"object\"===typeof a&&null!==a&&(a.$$typeof===t||a.$$typeof===r||a.$$typeof===h||a.$$typeof===k||a.$$typeof===n||a.$$typeof===w||a.$$typeof===x||a.$$typeof===y||a.$$typeof===v)};exports.typeOf=z;\n\n\n/***/ }),\n\n/***/ 7109:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nif (true) {\n  module.exports = __webpack_require__(6103);\n} else {}\n\n\n/***/ }),\n\n/***/ 645:\n/***/ (function(__unused_webpack_module, exports) {\n\n/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n\n\n/***/ }),\n\n/***/ 5717:\n/***/ (function(module) {\n\nif (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      ctor.prototype = Object.create(superCtor.prototype, {\n        constructor: {\n          value: ctor,\n          enumerable: false,\n          writable: true,\n          configurable: true\n        }\n      })\n    }\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    if (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}\n\n\n/***/ }),\n\n/***/ 2584:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar hasToStringTag = __webpack_require__(6410)();\nvar callBound = __webpack_require__(1924);\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n\n\n/***/ }),\n\n/***/ 5320:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n\n\n/***/ }),\n\n/***/ 8662:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = __webpack_require__(6410)();\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n\n\n/***/ }),\n\n/***/ 8611:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function isNaN(value) {\n\treturn value !== value;\n};\n\n\n/***/ }),\n\n/***/ 360:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar callBind = __webpack_require__(5559);\nvar define = __webpack_require__(4289);\n\nvar implementation = __webpack_require__(8611);\nvar getPolyfill = __webpack_require__(9415);\nvar shim = __webpack_require__(3194);\n\nvar polyfill = callBind(getPolyfill(), Number);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n\n\n/***/ }),\n\n/***/ 9415:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar implementation = __webpack_require__(8611);\n\nmodule.exports = function getPolyfill() {\n\tif (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) {\n\t\treturn Number.isNaN;\n\t}\n\treturn implementation;\n};\n\n\n/***/ }),\n\n/***/ 3194:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar define = __webpack_require__(4289);\nvar getPolyfill = __webpack_require__(9415);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function shimNumberIsNaN() {\n\tvar polyfill = getPolyfill();\n\tdefine(Number, { isNaN: polyfill }, {\n\t\tisNaN: function testIsNaN() {\n\t\t\treturn Number.isNaN !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n\n\n/***/ }),\n\n/***/ 5692:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar whichTypedArray = __webpack_require__(6430);\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\n};\n\n\n/***/ }),\n\n/***/ 1198:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nconst uuid = (__webpack_require__(4880).v4);\nconst generateRequest = __webpack_require__(7741);\n\n/**\n * Constructor for a Jayson Browser Client that does not depend any node.js core libraries\n * @class ClientBrowser\n * @param {Function} callServer Method that calls the server, receives the stringified request and a regular node-style callback\n * @param {Object} [options]\n * @param {Function} [options.reviver] Reviver function for JSON\n * @param {Function} [options.replacer] Replacer function for JSON\n * @param {Number} [options.version=2] JSON-RPC version to use (1|2)\n * @param {Function} [options.generator] Function to use for generating request IDs\n *  @param {Boolean} [options.notificationIdNull=false] When true, version 2 requests will set id to null instead of omitting it\n * @return {ClientBrowser}\n */\nconst ClientBrowser = function(callServer, options) {\n  if(!(this instanceof ClientBrowser)) {\n    return new ClientBrowser(callServer, options);\n  }\n\n  if (!options) {\n    options = {};\n  }\n\n  this.options = {\n    reviver: typeof options.reviver !== 'undefined' ? options.reviver : null,\n    replacer: typeof options.replacer !== 'undefined' ? options.replacer : null,\n    generator: typeof options.generator !== 'undefined' ? options.generator : function() { return uuid(); },\n    version: typeof options.version !== 'undefined' ? options.version : 2,\n    notificationIdNull: typeof options.notificationIdNull === 'boolean' ? options.notificationIdNull : false,\n  };\n\n  this.callServer = callServer;\n};\n\nmodule.exports = ClientBrowser;\n\n/**\n *  Creates a request and dispatches it if given a callback.\n *  @param {String|Array} method A batch request if passed an Array, or a method name if passed a String\n *  @param {Array|Object} [params] Parameters for the method\n *  @param {String|Number} [id] Optional id. If undefined an id will be generated. If null it creates a notification request\n *  @param {Function} [callback] Request callback. If specified, executes the request rather than only returning it.\n *  @throws {TypeError} Invalid parameters\n *  @return {Object} JSON-RPC 1.0 or 2.0 compatible request\n */\nClientBrowser.prototype.request = function(method, params, id, callback) {\n  const self = this;\n  let request = null;\n\n  // is this a batch request?\n  const isBatch = Array.isArray(method) && typeof params === 'function';\n\n  if (this.options.version === 1 && isBatch) {\n    throw new TypeError('JSON-RPC 1.0 does not support batching');\n  }\n\n  // is this a raw request?\n  const isRaw = !isBatch && method && typeof method === 'object' && typeof params === 'function';\n\n  if(isBatch || isRaw) {\n    callback = params;\n    request = method;\n  } else {\n    if(typeof id === 'function') {\n      callback = id;\n      // specifically undefined because \"null\" is a notification request\n      id = undefined;\n    }\n\n    const hasCallback = typeof callback === 'function';\n\n    try {\n      request = generateRequest(method, params, id, {\n        generator: this.options.generator,\n        version: this.options.version,\n        notificationIdNull: this.options.notificationIdNull,\n      });\n    } catch(err) {\n      if(hasCallback) {\n        return callback(err);\n      }\n      throw err;\n    }\n\n    // no callback means we should just return a raw request\n    if(!hasCallback) {\n      return request;\n    }\n\n  }\n\n  let message;\n  try {\n    message = JSON.stringify(request, this.options.replacer);\n  } catch(err) {\n    return callback(err);\n  }\n\n  this.callServer(message, function(err, response) {\n    self._parseResponse(err, response, callback);\n  });\n\n  // always return the raw request\n  return request;\n};\n\n/**\n * Parses a response from a server\n * @param {Object} err Error to pass on that is unrelated to the actual response\n * @param {String} responseText JSON-RPC 1.0 or 2.0 response\n * @param {Function} callback Callback that will receive different arguments depending on the amount of parameters\n * @private\n */\nClientBrowser.prototype._parseResponse = function(err, responseText, callback) {\n  if(err) {\n    callback(err);\n    return;\n  }\n\n  if(!responseText) {\n    // empty response text, assume that is correct because it could be a\n    // notification which jayson does not give any body for\n    return callback();\n  }\n\n  let response;\n  try {\n    response = JSON.parse(responseText, this.options.reviver);\n  } catch(err) {\n    return callback(err);\n  }\n\n  if(callback.length === 3) {\n    // if callback length is 3, we split callback arguments on error and response\n\n    // is batch response?\n    if(Array.isArray(response)) {\n\n      // neccesary to split strictly on validity according to spec here\n      const isError = function(res) {\n        return typeof res.error !== 'undefined';\n      };\n\n      const isNotError = function (res) {\n        return !isError(res);\n      };\n\n      return callback(null, response.filter(isError), response.filter(isNotError));\n    \n    } else {\n\n      // split regardless of validity\n      return callback(null, response.error, response.result);\n    \n    }\n  \n  }\n\n  callback(null, response);\n};\n\n\n/***/ }),\n\n/***/ 7741:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nconst uuid = (__webpack_require__(4880).v4);\n\n/**\n *  Generates a JSON-RPC 1.0 or 2.0 request\n *  @param {String} method Name of method to call\n *  @param {Array|Object} params Array of parameters passed to the method as specified, or an object of parameter names and corresponding value\n *  @param {String|Number|null} [id] Request ID can be a string, number, null for explicit notification or left out for automatic generation\n *  @param {Object} [options]\n *  @param {Number} [options.version=2] JSON-RPC version to use (1 or 2)\n *  @param {Boolean} [options.notificationIdNull=false] When true, version 2 requests will set id to null instead of omitting it\n *  @param {Function} [options.generator] Passed the request, and the options object and is expected to return a request ID\n *  @throws {TypeError} If any of the parameters are invalid\n *  @return {Object} A JSON-RPC 1.0 or 2.0 request\n *  @memberOf Utils\n */\nconst generateRequest = function(method, params, id, options) {\n  if(typeof method !== 'string') {\n    throw new TypeError(method + ' must be a string');\n  }\n\n  options = options || {};\n\n  // check valid version provided\n  const version = typeof options.version === 'number' ? options.version : 2;\n  if (version !== 1 && version !== 2) {\n    throw new TypeError(version + ' must be 1 or 2');\n  }\n\n  const request = {\n    method: method\n  };\n\n  if(version === 2) {\n    request.jsonrpc = '2.0';\n  }\n\n  if(params) {\n    // params given, but invalid?\n    if(typeof params !== 'object' && !Array.isArray(params)) {\n      throw new TypeError(params + ' must be an object, array or omitted');\n    }\n    request.params = params;\n  }\n\n  // if id was left out, generate one (null means explicit notification)\n  if(typeof(id) === 'undefined') {\n    const generator = typeof options.generator === 'function' ? options.generator : function() { return uuid(); };\n    request.id = generator(request, options);\n  } else if (version === 2 && id === null) {\n    // we have a version 2 notification\n    if (options.notificationIdNull) {\n      request.id = null; // id will not be set at all unless option provided\n    }\n  } else {\n    request.id = id;\n  }\n\n  return request;\n};\n\nmodule.exports = generateRequest;\n\n\n/***/ }),\n\n/***/ 2023:\n/***/ (function(module, exports, __webpack_require__) {\n\n/* provided dependency */ var process = __webpack_require__(4155);\nvar __WEBPACK_AMD_DEFINE_RESULT__;/**\n * [js-sha256]{@link https://github.com/emn178/js-sha256}\n *\n * @version 0.9.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2014-2017\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n  'use strict';\n\n  var ERROR = 'input is invalid type';\n  var WINDOW = typeof window === 'object';\n  var root = WINDOW ? window : {};\n  if (root.JS_SHA256_NO_WINDOW) {\n    WINDOW = false;\n  }\n  var WEB_WORKER = !WINDOW && typeof self === 'object';\n  var NODE_JS = !root.JS_SHA256_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n  if (NODE_JS) {\n    root = __webpack_require__.g;\n  } else if (WEB_WORKER) {\n    root = self;\n  }\n  var COMMON_JS = !root.JS_SHA256_NO_COMMON_JS && \"object\" === 'object' && module.exports;\n  var AMD =  true && __webpack_require__.amdO;\n  var ARRAY_BUFFER = !root.JS_SHA256_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n  var HEX_CHARS = '0123456789abcdef'.split('');\n  var EXTRA = [-2147483648, 8388608, 32768, 128];\n  var SHIFT = [24, 16, 8, 0];\n  var K = [\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n  ];\n  var OUTPUT_TYPES = ['hex', 'array', 'digest', 'arrayBuffer'];\n\n  var blocks = [];\n\n  if (root.JS_SHA256_NO_NODE_JS || !Array.isArray) {\n    Array.isArray = function (obj) {\n      return Object.prototype.toString.call(obj) === '[object Array]';\n    };\n  }\n\n  if (ARRAY_BUFFER && (root.JS_SHA256_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {\n    ArrayBuffer.isView = function (obj) {\n      return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n    };\n  }\n\n  var createOutputMethod = function (outputType, is224) {\n    return function (message) {\n      return new Sha256(is224, true).update(message)[outputType]();\n    };\n  };\n\n  var createMethod = function (is224) {\n    var method = createOutputMethod('hex', is224);\n    if (NODE_JS) {\n      method = nodeWrap(method, is224);\n    }\n    method.create = function () {\n      return new Sha256(is224);\n    };\n    method.update = function (message) {\n      return method.create().update(message);\n    };\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createOutputMethod(type, is224);\n    }\n    return method;\n  };\n\n  var nodeWrap = function (method, is224) {\n    var crypto = eval(\"require('crypto')\");\n    var Buffer = eval(\"require('buffer').Buffer\");\n    var algorithm = is224 ? 'sha224' : 'sha256';\n    var nodeMethod = function (message) {\n      if (typeof message === 'string') {\n        return crypto.createHash(algorithm).update(message, 'utf8').digest('hex');\n      } else {\n        if (message === null || message === undefined) {\n          throw new Error(ERROR);\n        } else if (message.constructor === ArrayBuffer) {\n          message = new Uint8Array(message);\n        }\n      }\n      if (Array.isArray(message) || ArrayBuffer.isView(message) ||\n        message.constructor === Buffer) {\n        return crypto.createHash(algorithm).update(new Buffer(message)).digest('hex');\n      } else {\n        return method(message);\n      }\n    };\n    return nodeMethod;\n  };\n\n  var createHmacOutputMethod = function (outputType, is224) {\n    return function (key, message) {\n      return new HmacSha256(key, is224, true).update(message)[outputType]();\n    };\n  };\n\n  var createHmacMethod = function (is224) {\n    var method = createHmacOutputMethod('hex', is224);\n    method.create = function (key) {\n      return new HmacSha256(key, is224);\n    };\n    method.update = function (key, message) {\n      return method.create(key).update(message);\n    };\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createHmacOutputMethod(type, is224);\n    }\n    return method;\n  };\n\n  function Sha256(is224, sharedMemory) {\n    if (sharedMemory) {\n      blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n        blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n        blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n        blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n      this.blocks = blocks;\n    } else {\n      this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n    }\n\n    if (is224) {\n      this.h0 = 0xc1059ed8;\n      this.h1 = 0x367cd507;\n      this.h2 = 0x3070dd17;\n      this.h3 = 0xf70e5939;\n      this.h4 = 0xffc00b31;\n      this.h5 = 0x68581511;\n      this.h6 = 0x64f98fa7;\n      this.h7 = 0xbefa4fa4;\n    } else { // 256\n      this.h0 = 0x6a09e667;\n      this.h1 = 0xbb67ae85;\n      this.h2 = 0x3c6ef372;\n      this.h3 = 0xa54ff53a;\n      this.h4 = 0x510e527f;\n      this.h5 = 0x9b05688c;\n      this.h6 = 0x1f83d9ab;\n      this.h7 = 0x5be0cd19;\n    }\n\n    this.block = this.start = this.bytes = this.hBytes = 0;\n    this.finalized = this.hashed = false;\n    this.first = true;\n    this.is224 = is224;\n  }\n\n  Sha256.prototype.update = function (message) {\n    if (this.finalized) {\n      return;\n    }\n    var notString, type = typeof message;\n    if (type !== 'string') {\n      if (type === 'object') {\n        if (message === null) {\n          throw new Error(ERROR);\n        } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n          message = new Uint8Array(message);\n        } else if (!Array.isArray(message)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {\n            throw new Error(ERROR);\n          }\n        }\n      } else {\n        throw new Error(ERROR);\n      }\n      notString = true;\n    }\n    var code, index = 0, i, length = message.length, blocks = this.blocks;\n\n    while (index < length) {\n      if (this.hashed) {\n        this.hashed = false;\n        blocks[0] = this.block;\n        blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n          blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n          blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n          blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n      }\n\n      if (notString) {\n        for (i = this.start; index < length && i < 64; ++index) {\n          blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n        }\n      } else {\n        for (i = this.start; index < length && i < 64; ++index) {\n          code = message.charCodeAt(index);\n          if (code < 0x80) {\n            blocks[i >> 2] |= code << SHIFT[i++ & 3];\n          } else if (code < 0x800) {\n            blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else if (code < 0xd800 || code >= 0xe000) {\n            blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else {\n            code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n            blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          }\n        }\n      }\n\n      this.lastByteIndex = i;\n      this.bytes += i - this.start;\n      if (i >= 64) {\n        this.block = blocks[16];\n        this.start = i - 64;\n        this.hash();\n        this.hashed = true;\n      } else {\n        this.start = i;\n      }\n    }\n    if (this.bytes > 4294967295) {\n      this.hBytes += this.bytes / 4294967296 << 0;\n      this.bytes = this.bytes % 4294967296;\n    }\n    return this;\n  };\n\n  Sha256.prototype.finalize = function () {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    var blocks = this.blocks, i = this.lastByteIndex;\n    blocks[16] = this.block;\n    blocks[i >> 2] |= EXTRA[i & 3];\n    this.block = blocks[16];\n    if (i >= 56) {\n      if (!this.hashed) {\n        this.hash();\n      }\n      blocks[0] = this.block;\n      blocks[16] = blocks[1] = blocks[2] = blocks[3] =\n        blocks[4] = blocks[5] = blocks[6] = blocks[7] =\n        blocks[8] = blocks[9] = blocks[10] = blocks[11] =\n        blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;\n    }\n    blocks[14] = this.hBytes << 3 | this.bytes >>> 29;\n    blocks[15] = this.bytes << 3;\n    this.hash();\n  };\n\n  Sha256.prototype.hash = function () {\n    var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4, f = this.h5, g = this.h6,\n      h = this.h7, blocks = this.blocks, j, s0, s1, maj, t1, t2, ch, ab, da, cd, bc;\n\n    for (j = 16; j < 64; ++j) {\n      // rightrotate\n      t1 = blocks[j - 15];\n      s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);\n      t1 = blocks[j - 2];\n      s1 = ((t1 >>> 17) | (t1 << 15)) ^ ((t1 >>> 19) | (t1 << 13)) ^ (t1 >>> 10);\n      blocks[j] = blocks[j - 16] + s0 + blocks[j - 7] + s1 << 0;\n    }\n\n    bc = b & c;\n    for (j = 0; j < 64; j += 4) {\n      if (this.first) {\n        if (this.is224) {\n          ab = 300032;\n          t1 = blocks[0] - 1413257819;\n          h = t1 - 150054599 << 0;\n          d = t1 + 24177077 << 0;\n        } else {\n          ab = 704751109;\n          t1 = blocks[0] - 210244248;\n          h = t1 - 1521486534 << 0;\n          d = t1 + 143694565 << 0;\n        }\n        this.first = false;\n      } else {\n        s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));\n        s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));\n        ab = a & b;\n        maj = ab ^ (a & c) ^ bc;\n        ch = (e & f) ^ (~e & g);\n        t1 = h + s1 + ch + K[j] + blocks[j];\n        t2 = s0 + maj;\n        h = d + t1 << 0;\n        d = t1 + t2 << 0;\n      }\n      s0 = ((d >>> 2) | (d << 30)) ^ ((d >>> 13) | (d << 19)) ^ ((d >>> 22) | (d << 10));\n      s1 = ((h >>> 6) | (h << 26)) ^ ((h >>> 11) | (h << 21)) ^ ((h >>> 25) | (h << 7));\n      da = d & a;\n      maj = da ^ (d & b) ^ ab;\n      ch = (h & e) ^ (~h & f);\n      t1 = g + s1 + ch + K[j + 1] + blocks[j + 1];\n      t2 = s0 + maj;\n      g = c + t1 << 0;\n      c = t1 + t2 << 0;\n      s0 = ((c >>> 2) | (c << 30)) ^ ((c >>> 13) | (c << 19)) ^ ((c >>> 22) | (c << 10));\n      s1 = ((g >>> 6) | (g << 26)) ^ ((g >>> 11) | (g << 21)) ^ ((g >>> 25) | (g << 7));\n      cd = c & d;\n      maj = cd ^ (c & a) ^ da;\n      ch = (g & h) ^ (~g & e);\n      t1 = f + s1 + ch + K[j + 2] + blocks[j + 2];\n      t2 = s0 + maj;\n      f = b + t1 << 0;\n      b = t1 + t2 << 0;\n      s0 = ((b >>> 2) | (b << 30)) ^ ((b >>> 13) | (b << 19)) ^ ((b >>> 22) | (b << 10));\n      s1 = ((f >>> 6) | (f << 26)) ^ ((f >>> 11) | (f << 21)) ^ ((f >>> 25) | (f << 7));\n      bc = b & c;\n      maj = bc ^ (b & d) ^ cd;\n      ch = (f & g) ^ (~f & h);\n      t1 = e + s1 + ch + K[j + 3] + blocks[j + 3];\n      t2 = s0 + maj;\n      e = a + t1 << 0;\n      a = t1 + t2 << 0;\n    }\n\n    this.h0 = this.h0 + a << 0;\n    this.h1 = this.h1 + b << 0;\n    this.h2 = this.h2 + c << 0;\n    this.h3 = this.h3 + d << 0;\n    this.h4 = this.h4 + e << 0;\n    this.h5 = this.h5 + f << 0;\n    this.h6 = this.h6 + g << 0;\n    this.h7 = this.h7 + h << 0;\n  };\n\n  Sha256.prototype.hex = function () {\n    this.finalize();\n\n    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,\n      h6 = this.h6, h7 = this.h7;\n\n    var hex = HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +\n      HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +\n      HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F] +\n      HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F] +\n      HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F] +\n      HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F] +\n      HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F] +\n      HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F] +\n      HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F] +\n      HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F] +\n      HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F] +\n      HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F] +\n      HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F] +\n      HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F] +\n      HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F] +\n      HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F] +\n      HEX_CHARS[(h4 >> 28) & 0x0F] + HEX_CHARS[(h4 >> 24) & 0x0F] +\n      HEX_CHARS[(h4 >> 20) & 0x0F] + HEX_CHARS[(h4 >> 16) & 0x0F] +\n      HEX_CHARS[(h4 >> 12) & 0x0F] + HEX_CHARS[(h4 >> 8) & 0x0F] +\n      HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F] +\n      HEX_CHARS[(h5 >> 28) & 0x0F] + HEX_CHARS[(h5 >> 24) & 0x0F] +\n      HEX_CHARS[(h5 >> 20) & 0x0F] + HEX_CHARS[(h5 >> 16) & 0x0F] +\n      HEX_CHARS[(h5 >> 12) & 0x0F] + HEX_CHARS[(h5 >> 8) & 0x0F] +\n      HEX_CHARS[(h5 >> 4) & 0x0F] + HEX_CHARS[h5 & 0x0F] +\n      HEX_CHARS[(h6 >> 28) & 0x0F] + HEX_CHARS[(h6 >> 24) & 0x0F] +\n      HEX_CHARS[(h6 >> 20) & 0x0F] + HEX_CHARS[(h6 >> 16) & 0x0F] +\n      HEX_CHARS[(h6 >> 12) & 0x0F] + HEX_CHARS[(h6 >> 8) & 0x0F] +\n      HEX_CHARS[(h6 >> 4) & 0x0F] + HEX_CHARS[h6 & 0x0F];\n    if (!this.is224) {\n      hex += HEX_CHARS[(h7 >> 28) & 0x0F] + HEX_CHARS[(h7 >> 24) & 0x0F] +\n        HEX_CHARS[(h7 >> 20) & 0x0F] + HEX_CHARS[(h7 >> 16) & 0x0F] +\n        HEX_CHARS[(h7 >> 12) & 0x0F] + HEX_CHARS[(h7 >> 8) & 0x0F] +\n        HEX_CHARS[(h7 >> 4) & 0x0F] + HEX_CHARS[h7 & 0x0F];\n    }\n    return hex;\n  };\n\n  Sha256.prototype.toString = Sha256.prototype.hex;\n\n  Sha256.prototype.digest = function () {\n    this.finalize();\n\n    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,\n      h6 = this.h6, h7 = this.h7;\n\n    var arr = [\n      (h0 >> 24) & 0xFF, (h0 >> 16) & 0xFF, (h0 >> 8) & 0xFF, h0 & 0xFF,\n      (h1 >> 24) & 0xFF, (h1 >> 16) & 0xFF, (h1 >> 8) & 0xFF, h1 & 0xFF,\n      (h2 >> 24) & 0xFF, (h2 >> 16) & 0xFF, (h2 >> 8) & 0xFF, h2 & 0xFF,\n      (h3 >> 24) & 0xFF, (h3 >> 16) & 0xFF, (h3 >> 8) & 0xFF, h3 & 0xFF,\n      (h4 >> 24) & 0xFF, (h4 >> 16) & 0xFF, (h4 >> 8) & 0xFF, h4 & 0xFF,\n      (h5 >> 24) & 0xFF, (h5 >> 16) & 0xFF, (h5 >> 8) & 0xFF, h5 & 0xFF,\n      (h6 >> 24) & 0xFF, (h6 >> 16) & 0xFF, (h6 >> 8) & 0xFF, h6 & 0xFF\n    ];\n    if (!this.is224) {\n      arr.push((h7 >> 24) & 0xFF, (h7 >> 16) & 0xFF, (h7 >> 8) & 0xFF, h7 & 0xFF);\n    }\n    return arr;\n  };\n\n  Sha256.prototype.array = Sha256.prototype.digest;\n\n  Sha256.prototype.arrayBuffer = function () {\n    this.finalize();\n\n    var buffer = new ArrayBuffer(this.is224 ? 28 : 32);\n    var dataView = new DataView(buffer);\n    dataView.setUint32(0, this.h0);\n    dataView.setUint32(4, this.h1);\n    dataView.setUint32(8, this.h2);\n    dataView.setUint32(12, this.h3);\n    dataView.setUint32(16, this.h4);\n    dataView.setUint32(20, this.h5);\n    dataView.setUint32(24, this.h6);\n    if (!this.is224) {\n      dataView.setUint32(28, this.h7);\n    }\n    return buffer;\n  };\n\n  function HmacSha256(key, is224, sharedMemory) {\n    var i, type = typeof key;\n    if (type === 'string') {\n      var bytes = [], length = key.length, index = 0, code;\n      for (i = 0; i < length; ++i) {\n        code = key.charCodeAt(i);\n        if (code < 0x80) {\n          bytes[index++] = code;\n        } else if (code < 0x800) {\n          bytes[index++] = (0xc0 | (code >> 6));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        } else if (code < 0xd800 || code >= 0xe000) {\n          bytes[index++] = (0xe0 | (code >> 12));\n          bytes[index++] = (0x80 | ((code >> 6) & 0x3f));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        } else {\n          code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));\n          bytes[index++] = (0xf0 | (code >> 18));\n          bytes[index++] = (0x80 | ((code >> 12) & 0x3f));\n          bytes[index++] = (0x80 | ((code >> 6) & 0x3f));\n          bytes[index++] = (0x80 | (code & 0x3f));\n        }\n      }\n      key = bytes;\n    } else {\n      if (type === 'object') {\n        if (key === null) {\n          throw new Error(ERROR);\n        } else if (ARRAY_BUFFER && key.constructor === ArrayBuffer) {\n          key = new Uint8Array(key);\n        } else if (!Array.isArray(key)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(key)) {\n            throw new Error(ERROR);\n          }\n        }\n      } else {\n        throw new Error(ERROR);\n      }\n    }\n\n    if (key.length > 64) {\n      key = (new Sha256(is224, true)).update(key).array();\n    }\n\n    var oKeyPad = [], iKeyPad = [];\n    for (i = 0; i < 64; ++i) {\n      var b = key[i] || 0;\n      oKeyPad[i] = 0x5c ^ b;\n      iKeyPad[i] = 0x36 ^ b;\n    }\n\n    Sha256.call(this, is224, sharedMemory);\n\n    this.update(iKeyPad);\n    this.oKeyPad = oKeyPad;\n    this.inner = true;\n    this.sharedMemory = sharedMemory;\n  }\n  HmacSha256.prototype = new Sha256();\n\n  HmacSha256.prototype.finalize = function () {\n    Sha256.prototype.finalize.call(this);\n    if (this.inner) {\n      this.inner = false;\n      var innerHash = this.array();\n      Sha256.call(this, this.is224, this.sharedMemory);\n      this.update(this.oKeyPad);\n      this.update(innerHash);\n      Sha256.prototype.finalize.call(this);\n    }\n  };\n\n  var exports = createMethod();\n  exports.sha256 = exports;\n  exports.sha224 = createMethod(true);\n  exports.sha256.hmac = createHmacMethod();\n  exports.sha224.hmac = createHmacMethod(true);\n\n  if (COMMON_JS) {\n    module.exports = exports;\n  } else {\n    root.sha256 = exports.sha256;\n    root.sha224 = exports.sha224;\n    if (AMD) {\n      !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {\n        return exports;\n      }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\n    }\n  }\n})();\n\n\n/***/ }),\n\n/***/ 1094:\n/***/ (function(module, exports, __webpack_require__) {\n\n/* provided dependency */ var process = __webpack_require__(4155);\nvar __WEBPACK_AMD_DEFINE_RESULT__;/**\n * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.9.3\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2023\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n  'use strict';\n\n  var INPUT_ERROR = 'input is invalid type';\n  var FINALIZE_ERROR = 'finalize already called';\n  var WINDOW = typeof window === 'object';\n  var root = WINDOW ? window : {};\n  if (root.JS_SHA3_NO_WINDOW) {\n    WINDOW = false;\n  }\n  var WEB_WORKER = !WINDOW && typeof self === 'object';\n  var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n  if (NODE_JS) {\n    root = __webpack_require__.g;\n  } else if (WEB_WORKER) {\n    root = self;\n  }\n  var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && \"object\" === 'object' && module.exports;\n  var AMD =  true && __webpack_require__.amdO;\n  var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n  var HEX_CHARS = '0123456789abcdef'.split('');\n  var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n  var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n  var KECCAK_PADDING = [1, 256, 65536, 16777216];\n  var PADDING = [6, 1536, 393216, 100663296];\n  var SHIFT = [0, 8, 16, 24];\n  var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n    0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n    2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n    2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n    2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n  var BITS = [224, 256, 384, 512];\n  var SHAKE_BITS = [128, 256];\n  var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n  var CSHAKE_BYTEPAD = {\n    '128': 168,\n    '256': 136\n  };\n\n\n  var isArray = root.JS_SHA3_NO_NODE_JS || !Array.isArray\n    ? function (obj) {\n        return Object.prototype.toString.call(obj) === '[object Array]';\n      }\n    : Array.isArray;\n\n  var isView = (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView))\n    ? function (obj) {\n        return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n      }\n    : ArrayBuffer.isView;\n\n  // [message: string, isString: bool]\n  var formatMessage = function (message) {\n    var type = typeof message;\n    if (type === 'string') {\n      return [message, true];\n    }\n    if (type !== 'object' || message === null) {\n      throw new Error(INPUT_ERROR);\n    }\n    if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n      return [new Uint8Array(message), false];\n    }\n    if (!isArray(message) && !isView(message)) {\n      throw new Error(INPUT_ERROR);\n    }\n    return [message, false];\n  }\n\n  var empty = function (message) {\n    return formatMessage(message)[0].length === 0;\n  };\n\n  var cloneArray = function (array) {\n    var newArray = [];\n    for (var i = 0; i < array.length; ++i) {\n      newArray[i] = array[i];\n    }\n    return newArray;\n  }\n\n  var createOutputMethod = function (bits, padding, outputType) {\n    return function (message) {\n      return new Keccak(bits, padding, bits).update(message)[outputType]();\n    };\n  };\n\n  var createShakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits) {\n      return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n    };\n  };\n\n  var createCshakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits, n, s) {\n      return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n    };\n  };\n\n  var createKmacOutputMethod = function (bits, padding, outputType) {\n    return function (key, message, outputBits, s) {\n      return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n    };\n  };\n\n  var createOutputMethods = function (method, createMethod, bits, padding) {\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createMethod(bits, padding, type);\n    }\n    return method;\n  };\n\n  var createMethod = function (bits, padding) {\n    var method = createOutputMethod(bits, padding, 'hex');\n    method.create = function () {\n      return new Keccak(bits, padding, bits);\n    };\n    method.update = function (message) {\n      return method.create().update(message);\n    };\n    return createOutputMethods(method, createOutputMethod, bits, padding);\n  };\n\n  var createShakeMethod = function (bits, padding) {\n    var method = createShakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits) {\n      return new Keccak(bits, padding, outputBits);\n    };\n    method.update = function (message, outputBits) {\n      return method.create(outputBits).update(message);\n    };\n    return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n  };\n\n  var createCshakeMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createCshakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits, n, s) {\n      if (empty(n) && empty(s)) {\n        return methods['shake' + bits].create(outputBits);\n      } else {\n        return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n      }\n    };\n    method.update = function (message, outputBits, n, s) {\n      return method.create(outputBits, n, s).update(message);\n    };\n    return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n  };\n\n  var createKmacMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createKmacOutputMethod(bits, padding, 'hex');\n    method.create = function (key, outputBits, s) {\n      return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n    };\n    method.update = function (key, message, outputBits, s) {\n      return method.create(key, outputBits, s).update(message);\n    };\n    return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n  };\n\n  var algorithms = [\n    { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n    { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n    { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n  ];\n\n  var methods = {}, methodNames = [];\n\n  for (var i = 0; i < algorithms.length; ++i) {\n    var algorithm = algorithms[i];\n    var bits = algorithm.bits;\n    for (var j = 0; j < bits.length; ++j) {\n      var methodName = algorithm.name + '_' + bits[j];\n      methodNames.push(methodName);\n      methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n      if (algorithm.name !== 'sha3') {\n        var newMethodName = algorithm.name + bits[j];\n        methodNames.push(newMethodName);\n        methods[newMethodName] = methods[methodName];\n      }\n    }\n  }\n\n  function Keccak(bits, padding, outputBits) {\n    this.blocks = [];\n    this.s = [];\n    this.padding = padding;\n    this.outputBits = outputBits;\n    this.reset = true;\n    this.finalized = false;\n    this.block = 0;\n    this.start = 0;\n    this.blockCount = (1600 - (bits << 1)) >> 5;\n    this.byteCount = this.blockCount << 2;\n    this.outputBlocks = outputBits >> 5;\n    this.extraBytes = (outputBits & 31) >> 3;\n\n    for (var i = 0; i < 50; ++i) {\n      this.s[i] = 0;\n    }\n  }\n\n  Keccak.prototype.update = function (message) {\n    if (this.finalized) {\n      throw new Error(FINALIZE_ERROR);\n    }\n    var result = formatMessage(message);\n    message = result[0];\n    var isString = result[1];\n    var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n      blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n    while (index < length) {\n      if (this.reset) {\n        this.reset = false;\n        blocks[0] = this.block;\n        for (i = 1; i < blockCount + 1; ++i) {\n          blocks[i] = 0;\n        }\n      }\n      if (isString) {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          code = message.charCodeAt(index);\n          if (code < 0x80) {\n            blocks[i >> 2] |= code << SHIFT[i++ & 3];\n          } else if (code < 0x800) {\n            blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else if (code < 0xd800 || code >= 0xe000) {\n            blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else {\n            code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n            blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          }\n        }\n      } else {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n        }\n      }\n      this.lastByteIndex = i;\n      if (i >= byteCount) {\n        this.start = i - byteCount;\n        this.block = blocks[blockCount];\n        for (i = 0; i < blockCount; ++i) {\n          s[i] ^= blocks[i];\n        }\n        f(s);\n        this.reset = true;\n      } else {\n        this.start = i;\n      }\n    }\n    return this;\n  };\n\n  Keccak.prototype.encode = function (x, right) {\n    var o = x & 255, n = 1;\n    var bytes = [o];\n    x = x >> 8;\n    o = x & 255;\n    while (o > 0) {\n      bytes.unshift(o);\n      x = x >> 8;\n      o = x & 255;\n      ++n;\n    }\n    if (right) {\n      bytes.push(n);\n    } else {\n      bytes.unshift(n);\n    }\n    this.update(bytes);\n    return bytes.length;\n  };\n\n  Keccak.prototype.encodeString = function (str) {\n    var result = formatMessage(str);\n    str = result[0];\n    var isString = result[1];\n    var bytes = 0, length = str.length;\n    if (isString) {\n      for (var i = 0; i < str.length; ++i) {\n        var code = str.charCodeAt(i);\n        if (code < 0x80) {\n          bytes += 1;\n        } else if (code < 0x800) {\n          bytes += 2;\n        } else if (code < 0xd800 || code >= 0xe000) {\n          bytes += 3;\n        } else {\n          code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n          bytes += 4;\n        }\n      }\n    } else {\n      bytes = length;\n    }\n    bytes += this.encode(bytes * 8);\n    this.update(str);\n    return bytes;\n  };\n\n  Keccak.prototype.bytepad = function (strs, w) {\n    var bytes = this.encode(w);\n    for (var i = 0; i < strs.length; ++i) {\n      bytes += this.encodeString(strs[i]);\n    }\n    var paddingBytes = (w - bytes % w) % w;\n    var zeros = [];\n    zeros.length = paddingBytes;\n    this.update(zeros);\n    return this;\n  };\n\n  Keccak.prototype.finalize = function () {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n    blocks[i >> 2] |= this.padding[i & 3];\n    if (this.lastByteIndex === this.byteCount) {\n      blocks[0] = blocks[blockCount];\n      for (i = 1; i < blockCount + 1; ++i) {\n        blocks[i] = 0;\n      }\n    }\n    blocks[blockCount - 1] |= 0x80000000;\n    for (i = 0; i < blockCount; ++i) {\n      s[i] ^= blocks[i];\n    }\n    f(s);\n  };\n\n  Keccak.prototype.toString = Keccak.prototype.hex = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var hex = '', block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        block = s[i];\n        hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n          HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n          HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n          HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n        i = 0;\n      }\n    }\n    if (extraBytes) {\n      block = s[i];\n      hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n      if (extraBytes > 1) {\n        hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n      }\n      if (extraBytes > 2) {\n        hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n      }\n    }\n    return hex;\n  };\n\n  Keccak.prototype.arrayBuffer = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var bytes = this.outputBits >> 3;\n    var buffer;\n    if (extraBytes) {\n      buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n    } else {\n      buffer = new ArrayBuffer(bytes);\n    }\n    var array = new Uint32Array(buffer);\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        array[j] = s[i];\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      array[j] = s[i];\n      buffer = buffer.slice(0, bytes);\n    }\n    return buffer;\n  };\n\n  Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n  Keccak.prototype.digest = Keccak.prototype.array = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var array = [], offset, block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        offset = j << 2;\n        block = s[i];\n        array[offset] = block & 0xFF;\n        array[offset + 1] = (block >> 8) & 0xFF;\n        array[offset + 2] = (block >> 16) & 0xFF;\n        array[offset + 3] = (block >> 24) & 0xFF;\n      }\n      if (j % blockCount === 0) {\n        s = cloneArray(s);\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      offset = j << 2;\n      block = s[i];\n      array[offset] = block & 0xFF;\n      if (extraBytes > 1) {\n        array[offset + 1] = (block >> 8) & 0xFF;\n      }\n      if (extraBytes > 2) {\n        array[offset + 2] = (block >> 16) & 0xFF;\n      }\n    }\n    return array;\n  };\n\n  function Kmac(bits, padding, outputBits) {\n    Keccak.call(this, bits, padding, outputBits);\n  }\n\n  Kmac.prototype = new Keccak();\n\n  Kmac.prototype.finalize = function () {\n    this.encode(this.outputBits, true);\n    return Keccak.prototype.finalize.call(this);\n  };\n\n  var f = function (s) {\n    var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n      b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n      b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n      b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n    for (n = 0; n < 48; n += 2) {\n      c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n      c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n      c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n      c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n      c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n      c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n      c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n      c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n      c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n      c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n      h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n      l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n      s[0] ^= h;\n      s[1] ^= l;\n      s[10] ^= h;\n      s[11] ^= l;\n      s[20] ^= h;\n      s[21] ^= l;\n      s[30] ^= h;\n      s[31] ^= l;\n      s[40] ^= h;\n      s[41] ^= l;\n      h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n      l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n      s[2] ^= h;\n      s[3] ^= l;\n      s[12] ^= h;\n      s[13] ^= l;\n      s[22] ^= h;\n      s[23] ^= l;\n      s[32] ^= h;\n      s[33] ^= l;\n      s[42] ^= h;\n      s[43] ^= l;\n      h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n      l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n      s[4] ^= h;\n      s[5] ^= l;\n      s[14] ^= h;\n      s[15] ^= l;\n      s[24] ^= h;\n      s[25] ^= l;\n      s[34] ^= h;\n      s[35] ^= l;\n      s[44] ^= h;\n      s[45] ^= l;\n      h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n      l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n      s[6] ^= h;\n      s[7] ^= l;\n      s[16] ^= h;\n      s[17] ^= l;\n      s[26] ^= h;\n      s[27] ^= l;\n      s[36] ^= h;\n      s[37] ^= l;\n      s[46] ^= h;\n      s[47] ^= l;\n      h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n      l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n      s[8] ^= h;\n      s[9] ^= l;\n      s[18] ^= h;\n      s[19] ^= l;\n      s[28] ^= h;\n      s[29] ^= l;\n      s[38] ^= h;\n      s[39] ^= l;\n      s[48] ^= h;\n      s[49] ^= l;\n\n      b0 = s[0];\n      b1 = s[1];\n      b32 = (s[11] << 4) | (s[10] >>> 28);\n      b33 = (s[10] << 4) | (s[11] >>> 28);\n      b14 = (s[20] << 3) | (s[21] >>> 29);\n      b15 = (s[21] << 3) | (s[20] >>> 29);\n      b46 = (s[31] << 9) | (s[30] >>> 23);\n      b47 = (s[30] << 9) | (s[31] >>> 23);\n      b28 = (s[40] << 18) | (s[41] >>> 14);\n      b29 = (s[41] << 18) | (s[40] >>> 14);\n      b20 = (s[2] << 1) | (s[3] >>> 31);\n      b21 = (s[3] << 1) | (s[2] >>> 31);\n      b2 = (s[13] << 12) | (s[12] >>> 20);\n      b3 = (s[12] << 12) | (s[13] >>> 20);\n      b34 = (s[22] << 10) | (s[23] >>> 22);\n      b35 = (s[23] << 10) | (s[22] >>> 22);\n      b16 = (s[33] << 13) | (s[32] >>> 19);\n      b17 = (s[32] << 13) | (s[33] >>> 19);\n      b48 = (s[42] << 2) | (s[43] >>> 30);\n      b49 = (s[43] << 2) | (s[42] >>> 30);\n      b40 = (s[5] << 30) | (s[4] >>> 2);\n      b41 = (s[4] << 30) | (s[5] >>> 2);\n      b22 = (s[14] << 6) | (s[15] >>> 26);\n      b23 = (s[15] << 6) | (s[14] >>> 26);\n      b4 = (s[25] << 11) | (s[24] >>> 21);\n      b5 = (s[24] << 11) | (s[25] >>> 21);\n      b36 = (s[34] << 15) | (s[35] >>> 17);\n      b37 = (s[35] << 15) | (s[34] >>> 17);\n      b18 = (s[45] << 29) | (s[44] >>> 3);\n      b19 = (s[44] << 29) | (s[45] >>> 3);\n      b10 = (s[6] << 28) | (s[7] >>> 4);\n      b11 = (s[7] << 28) | (s[6] >>> 4);\n      b42 = (s[17] << 23) | (s[16] >>> 9);\n      b43 = (s[16] << 23) | (s[17] >>> 9);\n      b24 = (s[26] << 25) | (s[27] >>> 7);\n      b25 = (s[27] << 25) | (s[26] >>> 7);\n      b6 = (s[36] << 21) | (s[37] >>> 11);\n      b7 = (s[37] << 21) | (s[36] >>> 11);\n      b38 = (s[47] << 24) | (s[46] >>> 8);\n      b39 = (s[46] << 24) | (s[47] >>> 8);\n      b30 = (s[8] << 27) | (s[9] >>> 5);\n      b31 = (s[9] << 27) | (s[8] >>> 5);\n      b12 = (s[18] << 20) | (s[19] >>> 12);\n      b13 = (s[19] << 20) | (s[18] >>> 12);\n      b44 = (s[29] << 7) | (s[28] >>> 25);\n      b45 = (s[28] << 7) | (s[29] >>> 25);\n      b26 = (s[38] << 8) | (s[39] >>> 24);\n      b27 = (s[39] << 8) | (s[38] >>> 24);\n      b8 = (s[48] << 14) | (s[49] >>> 18);\n      b9 = (s[49] << 14) | (s[48] >>> 18);\n\n      s[0] = b0 ^ (~b2 & b4);\n      s[1] = b1 ^ (~b3 & b5);\n      s[10] = b10 ^ (~b12 & b14);\n      s[11] = b11 ^ (~b13 & b15);\n      s[20] = b20 ^ (~b22 & b24);\n      s[21] = b21 ^ (~b23 & b25);\n      s[30] = b30 ^ (~b32 & b34);\n      s[31] = b31 ^ (~b33 & b35);\n      s[40] = b40 ^ (~b42 & b44);\n      s[41] = b41 ^ (~b43 & b45);\n      s[2] = b2 ^ (~b4 & b6);\n      s[3] = b3 ^ (~b5 & b7);\n      s[12] = b12 ^ (~b14 & b16);\n      s[13] = b13 ^ (~b15 & b17);\n      s[22] = b22 ^ (~b24 & b26);\n      s[23] = b23 ^ (~b25 & b27);\n      s[32] = b32 ^ (~b34 & b36);\n      s[33] = b33 ^ (~b35 & b37);\n      s[42] = b42 ^ (~b44 & b46);\n      s[43] = b43 ^ (~b45 & b47);\n      s[4] = b4 ^ (~b6 & b8);\n      s[5] = b5 ^ (~b7 & b9);\n      s[14] = b14 ^ (~b16 & b18);\n      s[15] = b15 ^ (~b17 & b19);\n      s[24] = b24 ^ (~b26 & b28);\n      s[25] = b25 ^ (~b27 & b29);\n      s[34] = b34 ^ (~b36 & b38);\n      s[35] = b35 ^ (~b37 & b39);\n      s[44] = b44 ^ (~b46 & b48);\n      s[45] = b45 ^ (~b47 & b49);\n      s[6] = b6 ^ (~b8 & b0);\n      s[7] = b7 ^ (~b9 & b1);\n      s[16] = b16 ^ (~b18 & b10);\n      s[17] = b17 ^ (~b19 & b11);\n      s[26] = b26 ^ (~b28 & b20);\n      s[27] = b27 ^ (~b29 & b21);\n      s[36] = b36 ^ (~b38 & b30);\n      s[37] = b37 ^ (~b39 & b31);\n      s[46] = b46 ^ (~b48 & b40);\n      s[47] = b47 ^ (~b49 & b41);\n      s[8] = b8 ^ (~b0 & b2);\n      s[9] = b9 ^ (~b1 & b3);\n      s[18] = b18 ^ (~b10 & b12);\n      s[19] = b19 ^ (~b11 & b13);\n      s[28] = b28 ^ (~b20 & b22);\n      s[29] = b29 ^ (~b21 & b23);\n      s[38] = b38 ^ (~b30 & b32);\n      s[39] = b39 ^ (~b31 & b33);\n      s[48] = b48 ^ (~b40 & b42);\n      s[49] = b49 ^ (~b41 & b43);\n\n      s[0] ^= RC[n];\n      s[1] ^= RC[n + 1];\n    }\n  };\n\n  if (COMMON_JS) {\n    module.exports = methods;\n  } else {\n    for (i = 0; i < methodNames.length; ++i) {\n      root[methodNames[i]] = methods[methodNames[i]];\n    }\n    if (AMD) {\n      !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {\n        return methods;\n      }).call(exports, __webpack_require__, exports, module),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\n    }\n  }\n})();\n\n\n/***/ }),\n\n/***/ 9499:\n/***/ (function(module) {\n\n(function(i,_){ true?module.exports=_():0})(this,function(){'use strict';var i=Math.imul,_=Math.clz32,t=Math.abs,e=Math.max,g=Math.floor;class o extends Array{constructor(i,_){if(super(i),this.sign=_,i>o.__kMaxLength)throw new RangeError(\"Maximum BigInt size exceeded\")}static BigInt(i){var _=Number.isFinite;if(\"number\"==typeof i){if(0===i)return o.__zero();if(o.__isOneDigitInt(i))return 0>i?o.__oneDigit(-i,!0):o.__oneDigit(i,!1);if(!_(i)||g(i)!==i)throw new RangeError(\"The number \"+i+\" cannot be converted to BigInt because it is not an integer\");return o.__fromDouble(i)}if(\"string\"==typeof i){const _=o.__fromString(i);if(null===_)throw new SyntaxError(\"Cannot convert \"+i+\" to a BigInt\");return _}if(\"boolean\"==typeof i)return!0===i?o.__oneDigit(1,!1):o.__zero();if(\"object\"==typeof i){if(i.constructor===o)return i;const _=o.__toPrimitive(i);return o.BigInt(_)}throw new TypeError(\"Cannot convert \"+i+\" to a BigInt\")}toDebugString(){const i=[\"BigInt[\"];for(const _ of this)i.push((_?(_>>>0).toString(16):_)+\", \");return i.push(\"]\"),i.join(\"\")}toString(i=10){if(2>i||36<i)throw new RangeError(\"toString() radix argument must be between 2 and 36\");return 0===this.length?\"0\":0==(i&i-1)?o.__toStringBasePowerOfTwo(this,i):o.__toStringGeneric(this,i,!1)}static toNumber(i){const _=i.length;if(0===_)return 0;if(1===_){const _=i.__unsignedDigit(0);return i.sign?-_:_}const t=i.__digit(_-1),e=o.__clz30(t),n=30*_-e;if(1024<n)return i.sign?-Infinity:1/0;let g=n-1,s=t,l=_-1;const r=e+3;let a=32===r?0:s<<r;a>>>=12;const u=r-12;let d=12<=r?0:s<<20+r,h=20+r;for(0<u&&0<l&&(l--,s=i.__digit(l),a|=s>>>30-u,d=s<<u+2,h=u+2);0<h&&0<l;)l--,s=i.__digit(l),d|=30<=h?s<<h-30:s>>>30-h,h-=30;const m=o.__decideRounding(i,h,l,s);if((1===m||0===m&&1==(1&d))&&(d=d+1>>>0,0===d&&(a++,0!=a>>>20&&(a=0,g++,1023<g))))return i.sign?-Infinity:1/0;const b=i.sign?-2147483648:0;return g=g+1023<<20,o.__kBitConversionInts[1]=b|g|a,o.__kBitConversionInts[0]=d,o.__kBitConversionDouble[0]}static unaryMinus(i){if(0===i.length)return i;const _=i.__copy();return _.sign=!i.sign,_}static bitwiseNot(i){return i.sign?o.__absoluteSubOne(i).__trim():o.__absoluteAddOne(i,!0)}static exponentiate(i,_){if(_.sign)throw new RangeError(\"Exponent must be positive\");if(0===_.length)return o.__oneDigit(1,!1);if(0===i.length)return i;if(1===i.length&&1===i.__digit(0))return i.sign&&0==(1&_.__digit(0))?o.unaryMinus(i):i;if(1<_.length)throw new RangeError(\"BigInt too big\");let t=_.__unsignedDigit(0);if(1===t)return i;if(t>=o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");if(1===i.length&&2===i.__digit(0)){const _=1+(0|t/30),e=i.sign&&0!=(1&t),n=new o(_,e);n.__initializeDigits();const g=1<<t%30;return n.__setDigit(_-1,g),n}let e=null,n=i;for(0!=(1&t)&&(e=i),t>>=1;0!==t;t>>=1)n=o.multiply(n,n),0!=(1&t)&&(null===e?e=n:e=o.multiply(e,n));return e}static multiply(_,t){if(0===_.length)return _;if(0===t.length)return t;let i=_.length+t.length;30<=_.__clzmsd()+t.__clzmsd()&&i--;const e=new o(i,_.sign!==t.sign);e.__initializeDigits();for(let n=0;n<_.length;n++)o.__multiplyAccumulate(t,_.__digit(n),e,n);return e.__trim()}static divide(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return o.__zero();const t=i.sign!==_.sign,e=_.__unsignedDigit(0);let n;if(1===_.length&&32767>=e){if(1===e)return t===i.sign?i:o.unaryMinus(i);n=o.__absoluteDivSmall(i,e,null)}else n=o.__absoluteDivLarge(i,_,!0,!1);return n.sign=t,n.__trim()}static remainder(i,_){if(0===_.length)throw new RangeError(\"Division by zero\");if(0>o.__absoluteCompare(i,_))return i;const t=_.__unsignedDigit(0);if(1===_.length&&32767>=t){if(1===t)return o.__zero();const _=o.__absoluteModSmall(i,t);return 0===_?o.__zero():o.__oneDigit(_,i.sign)}const e=o.__absoluteDivLarge(i,_,!1,!0);return e.sign=i.sign,e.__trim()}static add(i,_){const t=i.sign;return t===_.sign?o.__absoluteAdd(i,_,t):0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t)}static subtract(i,_){const t=i.sign;return t===_.sign?0<=o.__absoluteCompare(i,_)?o.__absoluteSub(i,_,t):o.__absoluteSub(_,i,!t):o.__absoluteAdd(i,_,t)}static leftShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__rightShiftByAbsolute(i,_):o.__leftShiftByAbsolute(i,_)}static signedRightShift(i,_){return 0===_.length||0===i.length?i:_.sign?o.__leftShiftByAbsolute(i,_):o.__rightShiftByAbsolute(i,_)}static unsignedRightShift(){throw new TypeError(\"BigInts have no unsigned right shift; use >> instead\")}static lessThan(i,_){return 0>o.__compareToBigInt(i,_)}static lessThanOrEqual(i,_){return 0>=o.__compareToBigInt(i,_)}static greaterThan(i,_){return 0<o.__compareToBigInt(i,_)}static greaterThanOrEqual(i,_){return 0<=o.__compareToBigInt(i,_)}static equal(_,t){if(_.sign!==t.sign)return!1;if(_.length!==t.length)return!1;for(let e=0;e<_.length;e++)if(_.__digit(e)!==t.__digit(e))return!1;return!0}static notEqual(i,_){return!o.equal(i,_)}static bitwiseAnd(i,_){if(!i.sign&&!_.sign)return o.__absoluteAnd(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length)+1;let n=o.__absoluteSubOne(i,t);const g=o.__absoluteSubOne(_);return n=o.__absoluteOr(n,g,n),o.__absoluteAddOne(n,!0,n).__trim()}return i.sign&&([i,_]=[_,i]),o.__absoluteAndNot(i,o.__absoluteSubOne(_)).__trim()}static bitwiseXor(i,_){if(!i.sign&&!_.sign)return o.__absoluteXor(i,_).__trim();if(i.sign&&_.sign){const t=e(i.length,_.length),n=o.__absoluteSubOne(i,t),g=o.__absoluteSubOne(_);return o.__absoluteXor(n,g,n).__trim()}const t=e(i.length,_.length)+1;i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteXor(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static bitwiseOr(i,_){const t=e(i.length,_.length);if(!i.sign&&!_.sign)return o.__absoluteOr(i,_).__trim();if(i.sign&&_.sign){let e=o.__absoluteSubOne(i,t);const n=o.__absoluteSubOne(_);return e=o.__absoluteAnd(e,n,e),o.__absoluteAddOne(e,!0,e).__trim()}i.sign&&([i,_]=[_,i]);let n=o.__absoluteSubOne(_,t);return n=o.__absoluteAndNot(n,i,n),o.__absoluteAddOne(n,!0,n).__trim()}static asIntN(_,t){if(0===t.length)return t;if(_=g(_),0>_)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===_)return o.__zero();if(_>=o.__kMaxLengthBits)return t;const e=0|(_+29)/30;if(t.length<e)return t;const s=t.__unsignedDigit(e-1),l=1<<(_-1)%30;if(t.length===e&&s<l)return t;if(!((s&l)===l))return o.__truncateToNBits(_,t);if(!t.sign)return o.__truncateAndSubFromPowerOfTwo(_,t,!0);if(0==(s&l-1)){for(let n=e-2;0<=n;n--)if(0!==t.__digit(n))return o.__truncateAndSubFromPowerOfTwo(_,t,!1);return t.length===e&&s===l?t:o.__truncateToNBits(_,t)}return o.__truncateAndSubFromPowerOfTwo(_,t,!1)}static asUintN(i,_){if(0===_.length)return _;if(i=g(i),0>i)throw new RangeError(\"Invalid value: not (convertible to) a safe integer\");if(0===i)return o.__zero();if(_.sign){if(i>o.__kMaxLengthBits)throw new RangeError(\"BigInt too big\");return o.__truncateAndSubFromPowerOfTwo(i,_,!1)}if(i>=o.__kMaxLengthBits)return _;const t=0|(i+29)/30;if(_.length<t)return _;const e=i%30;if(_.length==t){if(0===e)return _;const i=_.__digit(t-1);if(0==i>>>e)return _}return o.__truncateToNBits(i,_)}static ADD(i,_){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i)return\"string\"!=typeof _&&(_=_.toString()),i+_;if(\"string\"==typeof _)return i.toString()+_;if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)&&o.__isBigInt(_))return o.add(i,_);if(\"number\"==typeof i&&\"number\"==typeof _)return i+_;throw new TypeError(\"Cannot mix BigInt and other types, use explicit conversions\")}static LT(i,_){return o.__compare(i,_,0)}static LE(i,_){return o.__compare(i,_,1)}static GT(i,_){return o.__compare(i,_,2)}static GE(i,_){return o.__compare(i,_,3)}static EQ(i,_){for(;;){if(o.__isBigInt(i))return o.__isBigInt(_)?o.equal(i,_):o.EQ(_,i);if(\"number\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"string\"==typeof i){if(o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.equal(i,_);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"boolean\"==typeof i){if(o.__isBigInt(_))return o.__equalToNumber(_,+i);if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"symbol\"==typeof i){if(o.__isBigInt(_))return!1;if(\"object\"!=typeof _)return i==_;_=o.__toPrimitive(_)}else if(\"object\"==typeof i){if(\"object\"==typeof _&&_.constructor!==o)return i==_;i=o.__toPrimitive(i)}else return i==_}}static NE(i,_){return!o.EQ(i,_)}static __zero(){return new o(0,!1)}static __oneDigit(i,_){const t=new o(1,_);return t.__setDigit(0,i),t}__copy(){const _=new o(this.length,this.sign);for(let t=0;t<this.length;t++)_[t]=this[t];return _}__trim(){let i=this.length,_=this[i-1];for(;0===_;)i--,_=this[i-1],this.pop();return 0===i&&(this.sign=!1),this}__initializeDigits(){for(let _=0;_<this.length;_++)this[_]=0}static __decideRounding(i,_,t,e){if(0<_)return-1;let n;if(0>_)n=-_-1;else{if(0===t)return-1;t--,e=i.__digit(t),n=29}let g=1<<n;if(0==(e&g))return-1;if(g-=1,0!=(e&g))return 1;for(;0<t;)if(t--,0!==i.__digit(t))return 1;return 0}static __fromDouble(i){o.__kBitConversionDouble[0]=i;const _=2047&o.__kBitConversionInts[1]>>>20,t=_-1023,e=(0|t/30)+1,n=new o(e,0>i);let g=1048575&o.__kBitConversionInts[1]|1048576,s=o.__kBitConversionInts[0];const l=20,r=t%30;let a,u=0;if(20>r){const i=l-r;u=i+32,a=g>>>i,g=g<<32-i|s>>>i,s<<=32-i}else if(20===r)u=32,a=g,g=s,s=0;else{const i=r-l;u=32-i,a=g<<i|s>>>32-i,g=s<<i,s=0}n.__setDigit(e-1,a);for(let _=e-2;0<=_;_--)0<u?(u-=30,a=g>>>2,g=g<<30|s>>>2,s<<=30):a=0,n.__setDigit(_,a);return n.__trim()}static __isWhitespace(i){return!!(13>=i&&9<=i)||(159>=i?32==i:131071>=i?160==i||5760==i:196607>=i?(i&=131071,10>=i||40==i||41==i||47==i||95==i||4096==i):65279==i)}static __fromString(i,_=0){let t=0;const e=i.length;let n=0;if(n===e)return o.__zero();let g=i.charCodeAt(n);for(;o.__isWhitespace(g);){if(++n===e)return o.__zero();g=i.charCodeAt(n)}if(43===g){if(++n===e)return null;g=i.charCodeAt(n),t=1}else if(45===g){if(++n===e)return null;g=i.charCodeAt(n),t=-1}if(0===_){if(_=10,48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(_=16,++n===e)return null;g=i.charCodeAt(n)}else if(79===g||111===g){if(_=8,++n===e)return null;g=i.charCodeAt(n)}else if(66===g||98===g){if(_=2,++n===e)return null;g=i.charCodeAt(n)}}}else if(16===_&&48===g){if(++n===e)return o.__zero();if(g=i.charCodeAt(n),88===g||120===g){if(++n===e)return null;g=i.charCodeAt(n)}}if(0!=t&&10!==_)return null;for(;48===g;){if(++n===e)return o.__zero();g=i.charCodeAt(n)}const s=e-n;let l=o.__kMaxBitsPerChar[_],r=o.__kBitsPerCharTableMultiplier-1;if(s>1073741824/l)return null;const a=l*s+r>>>o.__kBitsPerCharTableShift,u=new o(0|(a+29)/30,!1),h=10>_?_:10,b=10<_?_-10:0;if(0==(_&_-1)){l>>=o.__kBitsPerCharTableShift;const _=[],t=[];let s=!1;do{let o=0,r=0;for(;;){let _;if(g-48>>>0<h)_=g-48;else if((32|g)-97>>>0<b)_=(32|g)-87;else{s=!0;break}if(r+=l,o=o<<l|_,++n===e){s=!0;break}if(g=i.charCodeAt(n),30<r+l)break}_.push(o),t.push(r)}while(!s);o.__fillFromParts(u,_,t)}else{u.__initializeDigits();let t=!1,s=0;do{let a=0,D=1;for(;;){let o;if(g-48>>>0<h)o=g-48;else if((32|g)-97>>>0<b)o=(32|g)-87;else{t=!0;break}const l=D*_;if(1073741823<l)break;if(D=l,a=a*_+o,s++,++n===e){t=!0;break}g=i.charCodeAt(n)}r=30*o.__kBitsPerCharTableMultiplier-1;const c=0|(l*s+r>>>o.__kBitsPerCharTableShift)/30;u.__inplaceMultiplyAdd(D,a,c)}while(!t)}if(n!==e){if(!o.__isWhitespace(g))return null;for(n++;n<e;n++)if(g=i.charCodeAt(n),!o.__isWhitespace(g))return null}return u.sign=-1==t,u.__trim()}static __fillFromParts(_,t,e){let n=0,g=0,o=0;for(let s=t.length-1;0<=s;s--){const i=t[s],l=e[s];g|=i<<o,o+=l,30===o?(_.__setDigit(n++,g),o=0,g=0):30<o&&(_.__setDigit(n++,1073741823&g),o-=30,g=i>>>l-o)}if(0!==g){if(n>=_.length)throw new Error(\"implementation bug\");_.__setDigit(n++,g)}for(;n<_.length;n++)_.__setDigit(n,0)}static __toStringBasePowerOfTwo(_,i){const t=_.length;let e=i-1;e=(85&e>>>1)+(85&e),e=(51&e>>>2)+(51&e),e=(15&e>>>4)+(15&e);const n=e,g=i-1,s=_.__digit(t-1),l=o.__clz30(s);let r=0|(30*t-l+n-1)/n;if(_.sign&&r++,268435456<r)throw new Error(\"string too long\");const a=Array(r);let u=r-1,d=0,h=0;for(let e=0;e<t-1;e++){const i=_.__digit(e),t=(d|i<<h)&g;a[u--]=o.__kConversionChars[t];const s=n-h;for(d=i>>>s,h=30-s;h>=n;)a[u--]=o.__kConversionChars[d&g],d>>>=n,h-=n}const m=(d|s<<h)&g;for(a[u--]=o.__kConversionChars[m],d=s>>>n-h;0!==d;)a[u--]=o.__kConversionChars[d&g],d>>>=n;if(_.sign&&(a[u--]=\"-\"),-1!=u)throw new Error(\"implementation bug\");return a.join(\"\")}static __toStringGeneric(_,i,t){const e=_.length;if(0===e)return\"\";if(1===e){let e=_.__unsignedDigit(0).toString(i);return!1===t&&_.sign&&(e=\"-\"+e),e}const n=30*e-o.__clz30(_.__digit(e-1)),g=o.__kMaxBitsPerChar[i],s=g-1;let l=n*o.__kBitsPerCharTableMultiplier;l+=s-1,l=0|l/s;const r=l+1>>1,a=o.exponentiate(o.__oneDigit(i,!1),o.__oneDigit(r,!1));let u,d;const h=a.__unsignedDigit(0);if(1===a.length&&32767>=h){u=new o(_.length,!1),u.__initializeDigits();let t=0;for(let e=2*_.length-1;0<=e;e--){const i=t<<15|_.__halfDigit(e);u.__setHalfDigit(e,0|i/h),t=0|i%h}d=t.toString(i)}else{const t=o.__absoluteDivLarge(_,a,!0,!0);u=t.quotient;const e=t.remainder.__trim();d=o.__toStringGeneric(e,i,!0)}u.__trim();let m=o.__toStringGeneric(u,i,!0);for(;d.length<r;)d=\"0\"+d;return!1===t&&_.sign&&(m=\"-\"+m),m+d}static __unequalSign(i){return i?-1:1}static __absoluteGreater(i){return i?-1:1}static __absoluteLess(i){return i?1:-1}static __compareToBigInt(i,_){const t=i.sign;if(t!==_.sign)return o.__unequalSign(t);const e=o.__absoluteCompare(i,_);return 0<e?o.__absoluteGreater(t):0>e?o.__absoluteLess(t):0}static __compareToNumber(i,_){if(o.__isOneDigitInt(_)){const e=i.sign,n=0>_;if(e!==n)return o.__unequalSign(e);if(0===i.length){if(n)throw new Error(\"implementation bug\");return 0===_?0:-1}if(1<i.length)return o.__absoluteGreater(e);const g=t(_),s=i.__unsignedDigit(0);return s>g?o.__absoluteGreater(e):s<g?o.__absoluteLess(e):0}return o.__compareToDouble(i,_)}static __compareToDouble(i,_){if(_!==_)return _;if(_===1/0)return-1;if(_===-Infinity)return 1;const t=i.sign;if(t!==0>_)return o.__unequalSign(t);if(0===_)throw new Error(\"implementation bug: should be handled elsewhere\");if(0===i.length)return-1;o.__kBitConversionDouble[0]=_;const e=2047&o.__kBitConversionInts[1]>>>20;if(2047==e)throw new Error(\"implementation bug: handled elsewhere\");const n=e-1023;if(0>n)return o.__absoluteGreater(t);const g=i.length;let s=i.__digit(g-1);const l=o.__clz30(s),r=30*g-l,a=n+1;if(r<a)return o.__absoluteLess(t);if(r>a)return o.__absoluteGreater(t);let u=1048576|1048575&o.__kBitConversionInts[1],d=o.__kBitConversionInts[0];const h=20,m=29-l;if(m!==(0|(r-1)%30))throw new Error(\"implementation bug\");let b,D=0;if(20>m){const i=h-m;D=i+32,b=u>>>i,u=u<<32-i|d>>>i,d<<=32-i}else if(20===m)D=32,b=u,u=d,d=0;else{const i=m-h;D=32-i,b=u<<i|d>>>32-i,u=d<<i,d=0}if(s>>>=0,b>>>=0,s>b)return o.__absoluteGreater(t);if(s<b)return o.__absoluteLess(t);for(let e=g-2;0<=e;e--){0<D?(D-=30,b=u>>>2,u=u<<30|d>>>2,d<<=30):b=0;const _=i.__unsignedDigit(e);if(_>b)return o.__absoluteGreater(t);if(_<b)return o.__absoluteLess(t)}if(0!==u||0!==d){if(0===D)throw new Error(\"implementation bug\");return o.__absoluteLess(t)}return 0}static __equalToNumber(i,_){return o.__isOneDigitInt(_)?0===_?0===i.length:1===i.length&&i.sign===0>_&&i.__unsignedDigit(0)===t(_):0===o.__compareToDouble(i,_)}static __comparisonResultToBool(i,_){return 0===_?0>i:1===_?0>=i:2===_?0<i:3===_?0<=i:void 0}static __compare(i,_,t){if(i=o.__toPrimitive(i),_=o.__toPrimitive(_),\"string\"==typeof i&&\"string\"==typeof _)switch(t){case 0:return i<_;case 1:return i<=_;case 2:return i>_;case 3:return i>=_;}if(o.__isBigInt(i)&&\"string\"==typeof _)return _=o.__fromString(_),null!==_&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"string\"==typeof i&&o.__isBigInt(_))return i=o.__fromString(i),null!==i&&o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(i=o.__toNumeric(i),_=o.__toNumeric(_),o.__isBigInt(i)){if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToBigInt(i,_),t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return o.__comparisonResultToBool(o.__compareToNumber(i,_),t)}if(\"number\"!=typeof i)throw new Error(\"implementation bug\");if(o.__isBigInt(_))return o.__comparisonResultToBool(o.__compareToNumber(_,i),2^t);if(\"number\"!=typeof _)throw new Error(\"implementation bug\");return 0===t?i<_:1===t?i<=_:2===t?i>_:3===t?i>=_:void 0}__clzmsd(){return o.__clz30(this.__digit(this.length-1))}static __absoluteAdd(_,t,e){if(_.length<t.length)return o.__absoluteAdd(t,_,e);if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);let n=_.length;(0===_.__clzmsd()||t.length===_.length&&0===t.__clzmsd())&&n++;const g=new o(n,e);let s=0,l=0;for(;l<t.length;l++){const i=_.__digit(l)+t.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}for(;l<_.length;l++){const i=_.__digit(l)+s;s=i>>>30,g.__setDigit(l,1073741823&i)}return l<g.length&&g.__setDigit(l,s),g.__trim()}static __absoluteSub(_,t,e){if(0===_.length)return _;if(0===t.length)return _.sign===e?_:o.unaryMinus(_);const n=new o(_.length,e);let g=0,s=0;for(;s<t.length;s++){const i=_.__digit(s)-t.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}for(;s<_.length;s++){const i=_.__digit(s)-g;g=1&i>>>30,n.__setDigit(s,1073741823&i)}return n.__trim()}static __absoluteAddOne(_,i,t=null){const e=_.length;null===t?t=new o(e,i):t.sign=i;let n=1;for(let g=0;g<e;g++){const i=_.__digit(g)+n;n=i>>>30,t.__setDigit(g,1073741823&i)}return 0!=n&&t.__setDigitGrow(e,1),t}static __absoluteSubOne(_,t){const e=_.length;t=t||e;const n=new o(t,!1);let g=1;for(let o=0;o<e;o++){const i=_.__digit(o)-g;g=1&i>>>30,n.__setDigit(o,1073741823&i)}if(0!=g)throw new Error(\"implementation bug\");for(let g=e;g<t;g++)n.__setDigit(g,0);return n}static __absoluteAnd(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=s;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&t.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteAndNot(_,t,e=null){const n=_.length,g=t.length;let s=g;n<g&&(s=n);let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)&~t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteOr(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)|t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteXor(_,t,e=null){let n=_.length,g=t.length,s=g;if(n<g){s=n;const i=_,e=n;_=t,n=g,t=i,g=e}let l=n;null===e?e=new o(l,!1):l=e.length;let r=0;for(;r<s;r++)e.__setDigit(r,_.__digit(r)^t.__digit(r));for(;r<n;r++)e.__setDigit(r,_.__digit(r));for(;r<l;r++)e.__setDigit(r,0);return e}static __absoluteCompare(_,t){const e=_.length-t.length;if(0!=e)return e;let n=_.length-1;for(;0<=n&&_.__digit(n)===t.__digit(n);)n--;return 0>n?0:_.__unsignedDigit(n)>t.__unsignedDigit(n)?1:-1}static __multiplyAccumulate(_,t,e,n){if(0===t)return;const g=32767&t,s=t>>>15;let l=0,r=0;for(let a,u=0;u<_.length;u++,n++){a=e.__digit(n);const i=_.__digit(u),t=32767&i,d=i>>>15,h=o.__imul(t,g),m=o.__imul(t,s),b=o.__imul(d,g),D=o.__imul(d,s);a+=r+h+l,l=a>>>30,a&=1073741823,a+=((32767&m)<<15)+((32767&b)<<15),l+=a>>>30,r=D+(m>>>15)+(b>>>15),e.__setDigit(n,1073741823&a)}for(;0!=l||0!==r;n++){let i=e.__digit(n);i+=l+r,r=0,l=i>>>30,e.__setDigit(n,1073741823&i)}}static __internalMultiplyAdd(_,t,e,g,s){let l=e,a=0;for(let n=0;n<g;n++){const i=_.__digit(n),e=o.__imul(32767&i,t),g=o.__imul(i>>>15,t),u=e+((32767&g)<<15)+a+l;l=u>>>30,a=g>>>15,s.__setDigit(n,1073741823&u)}if(s.length>g)for(s.__setDigit(g++,l+a);g<s.length;)s.__setDigit(g++,0);else if(0!==l+a)throw new Error(\"implementation bug\")}__inplaceMultiplyAdd(i,_,t){t>this.length&&(t=this.length);const e=32767&i,n=i>>>15;let g=0,s=_;for(let l=0;l<t;l++){const i=this.__digit(l),_=32767&i,t=i>>>15,r=o.__imul(_,e),a=o.__imul(_,n),u=o.__imul(t,e),d=o.__imul(t,n);let h=s+r+g;g=h>>>30,h&=1073741823,h+=((32767&a)<<15)+((32767&u)<<15),g+=h>>>30,s=d+(a>>>15)+(u>>>15),this.__setDigit(l,1073741823&h)}if(0!=g||0!==s)throw new Error(\"implementation bug\")}static __absoluteDivSmall(_,t,e=null){null===e&&(e=new o(_.length,!1));let n=0;for(let g,o=2*_.length-1;0<=o;o-=2){g=(n<<15|_.__halfDigit(o))>>>0;const i=0|g/t;n=0|g%t,g=(n<<15|_.__halfDigit(o-1))>>>0;const s=0|g/t;n=0|g%t,e.__setDigit(o>>>1,i<<15|s)}return e}static __absoluteModSmall(_,t){let e=0;for(let n=2*_.length-1;0<=n;n--){const i=(e<<15|_.__halfDigit(n))>>>0;e=0|i%t}return e}static __absoluteDivLarge(i,_,t,e){const g=_.__halfDigitLength(),n=_.length,s=i.__halfDigitLength()-g;let l=null;t&&(l=new o(s+2>>>1,!1),l.__initializeDigits());const r=new o(g+2>>>1,!1);r.__initializeDigits();const a=o.__clz15(_.__halfDigit(g-1));0<a&&(_=o.__specialLeftShift(_,a,0));const d=o.__specialLeftShift(i,a,1),u=_.__halfDigit(g-1);let h=0;for(let a,m=s;0<=m;m--){a=32767;const i=d.__halfDigit(m+g);if(i!==u){const t=(i<<15|d.__halfDigit(m+g-1))>>>0;a=0|t/u;let e=0|t%u;const n=_.__halfDigit(g-2),s=d.__halfDigit(m+g-2);for(;o.__imul(a,n)>>>0>(e<<16|s)>>>0&&(a--,e+=u,!(32767<e)););}o.__internalMultiplyAdd(_,a,0,n,r);let e=d.__inplaceSub(r,m,g+1);0!==e&&(e=d.__inplaceAdd(_,m,g),d.__setHalfDigit(m+g,32767&d.__halfDigit(m+g)+e),a--),t&&(1&m?h=a<<15:l.__setDigit(m>>>1,h|a))}if(e)return d.__inplaceRightShift(a),t?{quotient:l,remainder:d}:d;if(t)return l;throw new Error(\"unreachable\")}static __clz15(i){return o.__clz30(i)-15}__inplaceAdd(_,t,e){let n=0;for(let g=0;g<e;g++){const i=this.__halfDigit(t+g)+_.__halfDigit(g)+n;n=i>>>15,this.__setHalfDigit(t+g,32767&i)}return n}__inplaceSub(_,t,e){let n=0;if(1&t){t>>=1;let g=this.__digit(t),o=32767&g,s=0;for(;s<e-1>>>1;s++){const i=_.__digit(s),e=(g>>>15)-(32767&i)-n;n=1&e>>>15,this.__setDigit(t+s,(32767&e)<<15|32767&o),g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15}const i=_.__digit(s),l=(g>>>15)-(32767&i)-n;n=1&l>>>15,this.__setDigit(t+s,(32767&l)<<15|32767&o);if(t+s+1>=this.length)throw new RangeError(\"out of bounds\");0==(1&e)&&(g=this.__digit(t+s+1),o=(32767&g)-(i>>>15)-n,n=1&o>>>15,this.__setDigit(t+_.length,1073709056&g|32767&o))}else{t>>=1;let g=0;for(;g<_.length-1;g++){const i=this.__digit(t+g),e=_.__digit(g),o=(32767&i)-(32767&e)-n;n=1&o>>>15;const s=(i>>>15)-(e>>>15)-n;n=1&s>>>15,this.__setDigit(t+g,(32767&s)<<15|32767&o)}const i=this.__digit(t+g),o=_.__digit(g),s=(32767&i)-(32767&o)-n;n=1&s>>>15;let l=0;0==(1&e)&&(l=(i>>>15)-(o>>>15)-n,n=1&l>>>15),this.__setDigit(t+g,(32767&l)<<15|32767&s)}return n}__inplaceRightShift(_){if(0===_)return;let t=this.__digit(0)>>>_;const e=this.length-1;for(let n=0;n<e;n++){const i=this.__digit(n+1);this.__setDigit(n,1073741823&i<<30-_|t),t=i>>>_}this.__setDigit(e,t)}static __specialLeftShift(_,t,e){const g=_.length,n=new o(g+e,!1);if(0===t){for(let t=0;t<g;t++)n.__setDigit(t,_.__digit(t));return 0<e&&n.__setDigit(g,0),n}let s=0;for(let o=0;o<g;o++){const i=_.__digit(o);n.__setDigit(o,1073741823&i<<t|s),s=i>>>30-t}return 0<e&&n.__setDigit(g,s),n}static __leftShiftByAbsolute(_,i){const t=o.__toShiftAmount(i);if(0>t)throw new RangeError(\"BigInt too big\");const e=0|t/30,n=t%30,g=_.length,s=0!==n&&0!=_.__digit(g-1)>>>30-n,l=g+e+(s?1:0),r=new o(l,_.sign);if(0===n){let t=0;for(;t<e;t++)r.__setDigit(t,0);for(;t<l;t++)r.__setDigit(t,_.__digit(t-e))}else{let t=0;for(let _=0;_<e;_++)r.__setDigit(_,0);for(let o=0;o<g;o++){const i=_.__digit(o);r.__setDigit(o+e,1073741823&i<<n|t),t=i>>>30-n}if(s)r.__setDigit(g+e,t);else if(0!==t)throw new Error(\"implementation bug\")}return r.__trim()}static __rightShiftByAbsolute(_,i){const t=_.length,e=_.sign,n=o.__toShiftAmount(i);if(0>n)return o.__rightShiftByMaximum(e);const g=0|n/30,s=n%30;let l=t-g;if(0>=l)return o.__rightShiftByMaximum(e);let r=!1;if(e){if(0!=(_.__digit(g)&(1<<s)-1))r=!0;else for(let t=0;t<g;t++)if(0!==_.__digit(t)){r=!0;break}}if(r&&0===s){const i=_.__digit(t-1);0==~i&&l++}let a=new o(l,e);if(0===s){a.__setDigit(l-1,0);for(let e=g;e<t;e++)a.__setDigit(e-g,_.__digit(e))}else{let e=_.__digit(g)>>>s;const n=t-g-1;for(let t=0;t<n;t++){const i=_.__digit(t+g+1);a.__setDigit(t,1073741823&i<<30-s|e),e=i>>>s}a.__setDigit(n,e)}return r&&(a=o.__absoluteAddOne(a,!0,a)),a.__trim()}static __rightShiftByMaximum(i){return i?o.__oneDigit(1,!0):o.__zero()}static __toShiftAmount(i){if(1<i.length)return-1;const _=i.__unsignedDigit(0);return _>o.__kMaxLengthBits?-1:_}static __toPrimitive(i,_=\"default\"){if(\"object\"!=typeof i)return i;if(i.constructor===o)return i;if(\"undefined\"!=typeof Symbol&&\"symbol\"==typeof Symbol.toPrimitive){const t=i[Symbol.toPrimitive];if(t){const i=t(_);if(\"object\"!=typeof i)return i;throw new TypeError(\"Cannot convert object to primitive value\")}}const t=i.valueOf;if(t){const _=t.call(i);if(\"object\"!=typeof _)return _}const e=i.toString;if(e){const _=e.call(i);if(\"object\"!=typeof _)return _}throw new TypeError(\"Cannot convert object to primitive value\")}static __toNumeric(i){return o.__isBigInt(i)?i:+i}static __isBigInt(i){return\"object\"==typeof i&&null!==i&&i.constructor===o}static __truncateToNBits(i,_){const t=0|(i+29)/30,e=new o(t,_.sign),n=t-1;for(let t=0;t<n;t++)e.__setDigit(t,_.__digit(t));let g=_.__digit(n);if(0!=i%30){const _=32-i%30;g=g<<_>>>_}return e.__setDigit(n,g),e.__trim()}static __truncateAndSubFromPowerOfTwo(_,t,e){var n=Math.min;const g=0|(_+29)/30,s=new o(g,e);let l=0;const r=g-1;let a=0;for(const i=n(r,t.length);l<i;l++){const i=0-t.__digit(l)-a;a=1&i>>>30,s.__setDigit(l,1073741823&i)}for(;l<r;l++)s.__setDigit(l,0|1073741823&-a);let u=r<t.length?t.__digit(r):0;const d=_%30;let h;if(0==d)h=0-u-a,h&=1073741823;else{const i=32-d;u=u<<i>>>i;const _=1<<32-i;h=_-u-a,h&=_-1}return s.__setDigit(r,h),s.__trim()}__digit(_){return this[_]}__unsignedDigit(_){return this[_]>>>0}__setDigit(_,i){this[_]=0|i}__setDigitGrow(_,i){this[_]=0|i}__halfDigitLength(){const i=this.length;return 32767>=this.__unsignedDigit(i-1)?2*i-1:2*i}__halfDigit(_){return 32767&this[_>>>1]>>>15*(1&_)}__setHalfDigit(_,i){const t=_>>>1,e=this.__digit(t),n=1&_?32767&e|i<<15:1073709056&e|32767&i;this.__setDigit(t,n)}static __digitPow(i,_){let t=1;for(;0<_;)1&_&&(t*=i),_>>>=1,i*=i;return t}static __isOneDigitInt(i){return(1073741823&i)===i}}return o.__kMaxLength=33554432,o.__kMaxLengthBits=o.__kMaxLength<<5,o.__kMaxBitsPerChar=[0,0,32,51,64,75,83,90,96,102,107,111,115,119,122,126,128,131,134,136,139,141,143,145,147,149,151,153,154,156,158,159,160,162,163,165,166],o.__kBitsPerCharTableShift=5,o.__kBitsPerCharTableMultiplier=1<<o.__kBitsPerCharTableShift,o.__kConversionChars=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"],o.__kBitConversionBuffer=new ArrayBuffer(8),o.__kBitConversionDouble=new Float64Array(o.__kBitConversionBuffer),o.__kBitConversionInts=new Int32Array(o.__kBitConversionBuffer),o.__clz30=_?function(i){return _(i)-2}:function(i){var _=Math.LN2,t=Math.log;return 0===i?30:0|29-(0|t(i>>>0)/_)},o.__imul=i||function(i,_){return 0|i*_},o});\n//# sourceMappingURL=jsbi-umd.js.map\n\n\n/***/ }),\n\n/***/ 1296:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g && __webpack_require__.g.Object === Object && __webpack_require__.g;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        result = wait - timeSinceLastCall;\n\n    return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = debounce;\n\n\n/***/ }),\n\n/***/ 8399:\n/***/ (function(module) {\n\n\"use strict\";\n\nmodule.exports = function() {\n    return Object.assign;\n};\n\n//# sourceMappingURL=polyfill.js.map\n\n/***/ }),\n\n/***/ 6840:\n/***/ (function(__unused_webpack_module, __unused_webpack_exports, __webpack_require__) {\n\n\n    (window.__NEXT_P = window.__NEXT_P || []).push([\n      \"/_app\",\n      function () {\n        return __webpack_require__(9214);\n      }\n    ]);\n    if(false) {}\n  \n\n/***/ }),\n\n/***/ 9214:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"default\": function() { return /* binding */ MyApp; }\n});\n\n// EXTERNAL MODULE: ./node_modules/react/jsx-runtime.js\nvar jsx_runtime = __webpack_require__(5893);\n// EXTERNAL MODULE: ./node_modules/@fontsource-variable/inter/index.css\nvar inter = __webpack_require__(511);\n// EXTERNAL MODULE: ./node_modules/@fontsource/rubik-mono-one/index.css\nvar rubik_mono_one = __webpack_require__(6106);\n// EXTERNAL MODULE: ./src/styles/global.scss\nvar global = __webpack_require__(393);\n// EXTERNAL MODULE: ./node_modules/react/index.js\nvar react = __webpack_require__(7294);\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/is-browser.mjs\nconst isBrowser = typeof document !== \"undefined\";\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/use-isomorphic-effect.mjs\n\n\n\nconst useIsomorphicLayoutEffect = isBrowser ? react.useLayoutEffect : react.useEffect;\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/use-is-mounted.mjs\n\n\n\nfunction useIsMounted() {\n    const isMounted = (0,react.useRef)(false);\n    useIsomorphicLayoutEffect(() => {\n        isMounted.current = true;\n        return () => {\n            isMounted.current = false;\n        };\n    }, []);\n    return isMounted;\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/noop.mjs\nconst noop_noop = (any) => any;\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/GlobalConfig.mjs\nconst MotionGlobalConfig = {\n    skipAnimations: false,\n    useManualTiming: false,\n};\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/frameloop/render-step.mjs\nclass Queue {\n    constructor() {\n        this.order = [];\n        this.scheduled = new Set();\n    }\n    add(process) {\n        if (!this.scheduled.has(process)) {\n            this.scheduled.add(process);\n            this.order.push(process);\n            return true;\n        }\n    }\n    remove(process) {\n        const index = this.order.indexOf(process);\n        if (index !== -1) {\n            this.order.splice(index, 1);\n            this.scheduled.delete(process);\n        }\n    }\n    clear() {\n        this.order.length = 0;\n        this.scheduled.clear();\n    }\n}\nfunction createRenderStep(runNextFrame) {\n    /**\n     * We create and reuse two queues, one to queue jobs for the current frame\n     * and one for the next. We reuse to avoid triggering GC after x frames.\n     */\n    let thisFrame = new Queue();\n    let nextFrame = new Queue();\n    let numToRun = 0;\n    /**\n     * Track whether we're currently processing jobs in this step. This way\n     * we can decide whether to schedule new jobs for this frame or next.\n     */\n    let isProcessing = false;\n    let flushNextFrame = false;\n    /**\n     * A set of processes which were marked keepAlive when scheduled.\n     */\n    const toKeepAlive = new WeakSet();\n    const step = {\n        /**\n         * Schedule a process to run on the next frame.\n         */\n        schedule: (callback, keepAlive = false, immediate = false) => {\n            const addToCurrentFrame = immediate && isProcessing;\n            const queue = addToCurrentFrame ? thisFrame : nextFrame;\n            if (keepAlive)\n                toKeepAlive.add(callback);\n            if (queue.add(callback) && addToCurrentFrame && isProcessing) {\n                // If we're adding it to the currently running queue, update its measured size\n                numToRun = thisFrame.order.length;\n            }\n            return callback;\n        },\n        /**\n         * Cancel the provided callback from running on the next frame.\n         */\n        cancel: (callback) => {\n            nextFrame.remove(callback);\n            toKeepAlive.delete(callback);\n        },\n        /**\n         * Execute all schedule callbacks.\n         */\n        process: (frameData) => {\n            /**\n             * If we're already processing we've probably been triggered by a flushSync\n             * inside an existing process. Instead of executing, mark flushNextFrame\n             * as true and ensure we flush the following frame at the end of this one.\n             */\n            if (isProcessing) {\n                flushNextFrame = true;\n                return;\n            }\n            isProcessing = true;\n            [thisFrame, nextFrame] = [nextFrame, thisFrame];\n            // Clear the next frame queue\n            nextFrame.clear();\n            // Execute this frame\n            numToRun = thisFrame.order.length;\n            if (numToRun) {\n                for (let i = 0; i < numToRun; i++) {\n                    const callback = thisFrame.order[i];\n                    if (toKeepAlive.has(callback)) {\n                        step.schedule(callback);\n                        runNextFrame();\n                    }\n                    callback(frameData);\n                }\n            }\n            isProcessing = false;\n            if (flushNextFrame) {\n                flushNextFrame = false;\n                step.process(frameData);\n            }\n        },\n    };\n    return step;\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/frameloop/batcher.mjs\n\n\n\nconst stepsOrder = [\n    \"read\", // Read\n    \"resolveKeyframes\", // Write/Read/Write/Read\n    \"update\", // Compute\n    \"preRender\", // Compute\n    \"render\", // Write\n    \"postRender\", // Compute\n];\nconst maxElapsed = 40;\nfunction createRenderBatcher(scheduleNextBatch, allowKeepAlive) {\n    let runNextFrame = false;\n    let useDefaultElapsed = true;\n    const state = {\n        delta: 0,\n        timestamp: 0,\n        isProcessing: false,\n    };\n    const steps = stepsOrder.reduce((acc, key) => {\n        acc[key] = createRenderStep(() => (runNextFrame = true));\n        return acc;\n    }, {});\n    const processStep = (stepId) => {\n        steps[stepId].process(state);\n    };\n    const processBatch = () => {\n        const timestamp = MotionGlobalConfig.useManualTiming\n            ? state.timestamp\n            : performance.now();\n        runNextFrame = false;\n        state.delta = useDefaultElapsed\n            ? 1000 / 60\n            : Math.max(Math.min(timestamp - state.timestamp, maxElapsed), 1);\n        state.timestamp = timestamp;\n        state.isProcessing = true;\n        stepsOrder.forEach(processStep);\n        state.isProcessing = false;\n        if (runNextFrame && allowKeepAlive) {\n            useDefaultElapsed = false;\n            scheduleNextBatch(processBatch);\n        }\n    };\n    const wake = () => {\n        runNextFrame = true;\n        useDefaultElapsed = true;\n        if (!state.isProcessing) {\n            scheduleNextBatch(processBatch);\n        }\n    };\n    const schedule = stepsOrder.reduce((acc, key) => {\n        const step = steps[key];\n        acc[key] = (process, keepAlive = false, immediate = false) => {\n            if (!runNextFrame)\n                wake();\n            return step.schedule(process, keepAlive, immediate);\n        };\n        return acc;\n    }, {});\n    const cancel = (process) => stepsOrder.forEach((key) => steps[key].cancel(process));\n    return { schedule, cancel, state, steps };\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/frameloop/frame.mjs\n\n\n\nconst { schedule: frame_frame, cancel: cancelFrame, state: frameData, steps, } = createRenderBatcher(typeof requestAnimationFrame !== \"undefined\" ? requestAnimationFrame : noop_noop, true);\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/use-force-update.mjs\n\n\n\n\nfunction useForceUpdate() {\n    const isMounted = useIsMounted();\n    const [forcedRenderCount, setForcedRenderCount] = (0,react.useState)(0);\n    const forceRender = (0,react.useCallback)(() => {\n        isMounted.current && setForcedRenderCount(forcedRenderCount + 1);\n    }, [forcedRenderCount]);\n    /**\n     * Defer this to the end of the next animation frame in case there are multiple\n     * synchronous calls.\n     */\n    const deferredForceRender = (0,react.useCallback)(() => frame_frame.postRender(forceRender), [forceRender]);\n    return [deferredForceRender, forcedRenderCount];\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/context/PresenceContext.mjs\n\n\n/**\n * @public\n */\nconst PresenceContext = (0,react.createContext)(null);\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/use-constant.mjs\n\n\n/**\n * Creates a constant value over the lifecycle of a component.\n *\n * Even if `useMemo` is provided an empty array as its final argument, it doesn't offer\n * a guarantee that it won't re-run for performance reasons later on. By using `useConstant`\n * you can ensure that initialisers don't execute twice or more.\n */\nfunction useConstant(init) {\n    const ref = (0,react.useRef)(null);\n    if (ref.current === null) {\n        ref.current = init();\n    }\n    return ref.current;\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/context/MotionConfigContext.mjs\n\n\n/**\n * @public\n */\nconst MotionConfigContext = (0,react.createContext)({\n    transformPagePoint: (p) => p,\n    isStatic: false,\n    reducedMotion: \"never\",\n});\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/components/AnimatePresence/PopChild.mjs\n\n\n\n\n\n/**\n * Measurement functionality has to be within a separate component\n * to leverage snapshot lifecycle.\n */\nclass PopChildMeasure extends react.Component {\n    getSnapshotBeforeUpdate(prevProps) {\n        const element = this.props.childRef.current;\n        if (element && prevProps.isPresent && !this.props.isPresent) {\n            const size = this.props.sizeRef.current;\n            size.height = element.offsetHeight || 0;\n            size.width = element.offsetWidth || 0;\n            size.top = element.offsetTop;\n            size.left = element.offsetLeft;\n        }\n        return null;\n    }\n    /**\n     * Required with getSnapshotBeforeUpdate to stop React complaining.\n     */\n    componentDidUpdate() { }\n    render() {\n        return this.props.children;\n    }\n}\nfunction PopChild({ children, isPresent }) {\n    const id = (0,react.useId)();\n    const ref = (0,react.useRef)(null);\n    const size = (0,react.useRef)({\n        width: 0,\n        height: 0,\n        top: 0,\n        left: 0,\n    });\n    const { nonce } = (0,react.useContext)(MotionConfigContext);\n    /**\n     * We create and inject a style block so we can apply this explicit\n     * sizing in a non-destructive manner by just deleting the style block.\n     *\n     * We can't apply size via render as the measurement happens\n     * in getSnapshotBeforeUpdate (post-render), likewise if we apply the\n     * styles directly on the DOM node, we might be overwriting\n     * styles set via the style prop.\n     */\n    (0,react.useInsertionEffect)(() => {\n        const { width, height, top, left } = size.current;\n        if (isPresent || !ref.current || !width || !height)\n            return;\n        ref.current.dataset.motionPopId = id;\n        const style = document.createElement(\"style\");\n        if (nonce)\n            style.nonce = nonce;\n        document.head.appendChild(style);\n        if (style.sheet) {\n            style.sheet.insertRule(`\n          [data-motion-pop-id=\"${id}\"] {\n            position: absolute !important;\n            width: ${width}px !important;\n            height: ${height}px !important;\n            top: ${top}px !important;\n            left: ${left}px !important;\n          }\n        `);\n        }\n        return () => {\n            document.head.removeChild(style);\n        };\n    }, [isPresent]);\n    return ((0,jsx_runtime.jsx)(PopChildMeasure, { isPresent: isPresent, childRef: ref, sizeRef: size, children: react.cloneElement(children, { ref }) }));\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/components/AnimatePresence/PresenceChild.mjs\n\n\n\n\n\n\n\nconst PresenceChild = ({ children, initial, isPresent, onExitComplete, custom, presenceAffectsLayout, mode, }) => {\n    const presenceChildren = useConstant(newChildrenMap);\n    const id = (0,react.useId)();\n    const context = (0,react.useMemo)(() => ({\n        id,\n        initial,\n        isPresent,\n        custom,\n        onExitComplete: (childId) => {\n            presenceChildren.set(childId, true);\n            for (const isComplete of presenceChildren.values()) {\n                if (!isComplete)\n                    return; // can stop searching when any is incomplete\n            }\n            onExitComplete && onExitComplete();\n        },\n        register: (childId) => {\n            presenceChildren.set(childId, false);\n            return () => presenceChildren.delete(childId);\n        },\n    }), \n    /**\n     * If the presence of a child affects the layout of the components around it,\n     * we want to make a new context value to ensure they get re-rendered\n     * so they can detect that layout change.\n     */\n    presenceAffectsLayout ? [Math.random()] : [isPresent]);\n    (0,react.useMemo)(() => {\n        presenceChildren.forEach((_, key) => presenceChildren.set(key, false));\n    }, [isPresent]);\n    /**\n     * If there's no `motion` components to fire exit animations, we want to remove this\n     * component immediately.\n     */\n    react.useEffect(() => {\n        !isPresent &&\n            !presenceChildren.size &&\n            onExitComplete &&\n            onExitComplete();\n    }, [isPresent]);\n    if (mode === \"popLayout\") {\n        children = (0,jsx_runtime.jsx)(PopChild, { isPresent: isPresent, children: children });\n    }\n    return ((0,jsx_runtime.jsx)(PresenceContext.Provider, { value: context, children: children }));\n};\nfunction newChildrenMap() {\n    return new Map();\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/context/LayoutGroupContext.mjs\n\n\nconst LayoutGroupContext = (0,react.createContext)({});\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/use-unmount-effect.mjs\n\n\nfunction useUnmountEffect(callback) {\n    return (0,react.useEffect)(() => () => callback(), []);\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/utils/errors.mjs\n\n\nlet warning = (/* unused pure expression or super */ null && (noop));\nlet invariant = noop_noop;\nif (false) {}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/framer-motion/dist/es/components/AnimatePresence/index.mjs\n\n\n\n\n\n\n\n\n\n\nconst getChildKey = (child) => child.key || \"\";\nfunction updateChildLookup(children, allChildren) {\n    children.forEach((child) => {\n        const key = getChildKey(child);\n        allChildren.set(key, child);\n    });\n}\nfunction onlyElements(children) {\n    const filtered = [];\n    // We use forEach here instead of map as map mutates the component key by preprending `.$`\n    react.Children.forEach(children, (child) => {\n        if ((0,react.isValidElement)(child))\n            filtered.push(child);\n    });\n    return filtered;\n}\n/**\n * `AnimatePresence` enables the animation of components that have been removed from the tree.\n *\n * When adding/removing more than a single child, every child **must** be given a unique `key` prop.\n *\n * Any `motion` components that have an `exit` property defined will animate out when removed from\n * the tree.\n *\n * ```jsx\n * import { motion, AnimatePresence } from 'framer-motion'\n *\n * export const Items = ({ items }) => (\n *   <AnimatePresence>\n *     {items.map(item => (\n *       <motion.div\n *         key={item.id}\n *         initial={{ opacity: 0 }}\n *         animate={{ opacity: 1 }}\n *         exit={{ opacity: 0 }}\n *       />\n *     ))}\n *   </AnimatePresence>\n * )\n * ```\n *\n * You can sequence exit animations throughout a tree using variants.\n *\n * If a child contains multiple `motion` components with `exit` props, it will only unmount the child\n * once all `motion` components have finished animating out. Likewise, any components using\n * `usePresence` all need to call `safeToRemove`.\n *\n * @public\n */\nconst AnimatePresence = ({ children, custom, initial = true, onExitComplete, exitBeforeEnter, presenceAffectsLayout = true, mode = \"sync\", }) => {\n    invariant(!exitBeforeEnter, \"Replace exitBeforeEnter with mode='wait'\");\n    // We want to force a re-render once all exiting animations have finished. We\n    // either use a local forceRender function, or one from a parent context if it exists.\n    const forceRender = (0,react.useContext)(LayoutGroupContext).forceRender || useForceUpdate()[0];\n    const isMounted = useIsMounted();\n    // Filter out any children that aren't ReactElements. We can only track ReactElements with a props.key\n    const filteredChildren = onlyElements(children);\n    let childrenToRender = filteredChildren;\n    const exitingChildren = (0,react.useRef)(new Map()).current;\n    // Keep a living record of the children we're actually rendering so we\n    // can diff to figure out which are entering and exiting\n    const presentChildren = (0,react.useRef)(childrenToRender);\n    // A lookup table to quickly reference components by key\n    const allChildren = (0,react.useRef)(new Map()).current;\n    // If this is the initial component render, just deal with logic surrounding whether\n    // we play onMount animations or not.\n    const isInitialRender = (0,react.useRef)(true);\n    useIsomorphicLayoutEffect(() => {\n        isInitialRender.current = false;\n        updateChildLookup(filteredChildren, allChildren);\n        presentChildren.current = childrenToRender;\n    });\n    useUnmountEffect(() => {\n        isInitialRender.current = true;\n        allChildren.clear();\n        exitingChildren.clear();\n    });\n    if (isInitialRender.current) {\n        return ((0,jsx_runtime.jsx)(jsx_runtime.Fragment, { children: childrenToRender.map((child) => ((0,jsx_runtime.jsx)(PresenceChild, { isPresent: true, initial: initial ? undefined : false, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)))) }));\n    }\n    // If this is a subsequent render, deal with entering and exiting children\n    childrenToRender = [...childrenToRender];\n    // Diff the keys of the currently-present and target children to update our\n    // exiting list.\n    const presentKeys = presentChildren.current.map(getChildKey);\n    const targetKeys = filteredChildren.map(getChildKey);\n    // Diff the present children with our target children and mark those that are exiting\n    const numPresent = presentKeys.length;\n    for (let i = 0; i < numPresent; i++) {\n        const key = presentKeys[i];\n        if (targetKeys.indexOf(key) === -1 && !exitingChildren.has(key)) {\n            exitingChildren.set(key, undefined);\n        }\n    }\n    // If we currently have exiting children, and we're deferring rendering incoming children\n    // until after all current children have exiting, empty the childrenToRender array\n    if (mode === \"wait\" && exitingChildren.size) {\n        childrenToRender = [];\n    }\n    // Loop through all currently exiting components and clone them to overwrite `animate`\n    // with any `exit` prop they might have defined.\n    exitingChildren.forEach((component, key) => {\n        // If this component is actually entering again, early return\n        if (targetKeys.indexOf(key) !== -1)\n            return;\n        const child = allChildren.get(key);\n        if (!child)\n            return;\n        const insertionIndex = presentKeys.indexOf(key);\n        let exitingComponent = component;\n        if (!exitingComponent) {\n            const onExit = () => {\n                // clean up the exiting children map\n                exitingChildren.delete(key);\n                // compute the keys of children that were rendered once but are no longer present\n                // this could happen in case of too many fast consequent renderings\n                // @link https://github.com/framer/motion/issues/2023\n                const leftOverKeys = Array.from(allChildren.keys()).filter((childKey) => !targetKeys.includes(childKey));\n                // clean up the all children map\n                leftOverKeys.forEach((leftOverKey) => allChildren.delete(leftOverKey));\n                // make sure to render only the children that are actually visible\n                presentChildren.current = filteredChildren.filter((presentChild) => {\n                    const presentChildKey = getChildKey(presentChild);\n                    return (\n                    // filter out the node exiting\n                    presentChildKey === key ||\n                        // filter out the leftover children\n                        leftOverKeys.includes(presentChildKey));\n                });\n                // Defer re-rendering until all exiting children have indeed left\n                if (!exitingChildren.size) {\n                    if (isMounted.current === false)\n                        return;\n                    forceRender();\n                    onExitComplete && onExitComplete();\n                }\n            };\n            exitingComponent = ((0,jsx_runtime.jsx)(PresenceChild, { isPresent: false, onExitComplete: onExit, custom: custom, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)));\n            exitingChildren.set(key, exitingComponent);\n        }\n        childrenToRender.splice(insertionIndex, 0, exitingComponent);\n    });\n    // Add `MotionContext` even to children that don't need it to ensure we're rendering\n    // the same tree between renders\n    childrenToRender = childrenToRender.map((child) => {\n        const key = child.key;\n        return exitingChildren.has(key) ? (child) : ((0,jsx_runtime.jsx)(PresenceChild, { isPresent: true, presenceAffectsLayout: presenceAffectsLayout, mode: mode, children: child }, getChildKey(child)));\n    });\n    if (false) {}\n    return ((0,jsx_runtime.jsx)(jsx_runtime.Fragment, { children: exitingChildren.size\n            ? childrenToRender\n            : childrenToRender.map((child) => (0,react.cloneElement)(child)) }));\n};\n\n\n\n// EXTERNAL MODULE: ./node_modules/next/head.js\nvar head = __webpack_require__(9008);\nvar head_default = /*#__PURE__*/__webpack_require__.n(head);\n// EXTERNAL MODULE: ./node_modules/prop-types/index.js\nvar prop_types = __webpack_require__(5697);\nvar prop_types_default = /*#__PURE__*/__webpack_require__.n(prop_types);\n// EXTERNAL MODULE: ./node_modules/react-query/es/index.js\nvar es = __webpack_require__(8767);\n// EXTERNAL MODULE: ./node_modules/react-query/devtools/index.js\nvar devtools = __webpack_require__(938);\n// EXTERNAL MODULE: ./src/providers/solana/index.tsx + 1 modules\nvar solana = __webpack_require__(3671);\n// EXTERNAL MODULE: ./node_modules/lodash.debounce/index.js\nvar lodash_debounce = __webpack_require__(1296);\n;// CONCATENATED MODULE: ./node_modules/usehooks-ts/dist/index.mjs\n\n\n\n// src/useBoolean/useBoolean.ts\nfunction useBoolean(defaultValue) {\n  const [value, setValue] = useState(!!defaultValue);\n  const setTrue = useCallback(() => {\n    setValue(true);\n  }, []);\n  const setFalse = useCallback(() => {\n    setValue(false);\n  }, []);\n  const toggle = useCallback(() => {\n    setValue((x) => !x);\n  }, []);\n  return { value, setValue, setTrue, setFalse, toggle };\n}\nvar dist_useIsomorphicLayoutEffect = typeof window !== \"undefined\" ? react.useLayoutEffect : react.useEffect;\n\n// src/useEventListener/useEventListener.ts\nfunction useEventListener(eventName, handler, element, options) {\n  const savedHandler = (0,react.useRef)(handler);\n  dist_useIsomorphicLayoutEffect(() => {\n    savedHandler.current = handler;\n  }, [handler]);\n  (0,react.useEffect)(() => {\n    const targetElement = (element == null ? void 0 : element.current) ?? window;\n    if (!(targetElement && targetElement.addEventListener))\n      return;\n    const listener = (event) => {\n      savedHandler.current(event);\n    };\n    targetElement.addEventListener(eventName, listener, options);\n    return () => {\n      targetElement.removeEventListener(eventName, listener, options);\n    };\n  }, [eventName, element, options]);\n}\n\n// src/useClickAnyWhere/useClickAnyWhere.ts\nfunction useClickAnyWhere(handler) {\n  useEventListener(\"click\", (event) => {\n    handler(event);\n  });\n}\nfunction useCopyToClipboard() {\n  const [copiedText, setCopiedText] = useState(null);\n  const copy = useCallback(async (text) => {\n    if (!(navigator == null ? void 0 : navigator.clipboard)) {\n      console.warn(\"Clipboard not supported\");\n      return false;\n    }\n    try {\n      await navigator.clipboard.writeText(text);\n      setCopiedText(text);\n      return true;\n    } catch (error) {\n      console.warn(\"Copy failed\", error);\n      setCopiedText(null);\n      return false;\n    }\n  }, []);\n  return [copiedText, copy];\n}\nfunction useCounter(initialValue) {\n  const [count, setCount] = useState(initialValue ?? 0);\n  const increment = () => {\n    setCount((x) => x + 1);\n  };\n  const decrement = () => {\n    setCount((x) => x - 1);\n  };\n  const reset = () => {\n    setCount(initialValue ?? 0);\n  };\n  return {\n    count,\n    increment,\n    decrement,\n    reset,\n    setCount\n  };\n}\nfunction useInterval(callback, delay) {\n  const savedCallback = useRef(callback);\n  dist_useIsomorphicLayoutEffect(() => {\n    savedCallback.current = callback;\n  }, [callback]);\n  useEffect(() => {\n    if (delay === null) {\n      return;\n    }\n    const id = setInterval(() => {\n      savedCallback.current();\n    }, delay);\n    return () => {\n      clearInterval(id);\n    };\n  }, [delay]);\n}\n\n// src/useCountdown/useCountdown.ts\nfunction useCountdown(countdownOptions) {\n  let isDeprecated = false;\n  let countStart, intervalMs, isIncrement, countStop;\n  if (\"seconds\" in countdownOptions) {\n    console.warn(\n      \"[useCountdown:DEPRECATED] new interface is already available (see https://usehooks-ts.com/react-hook/use-countdown), the old version will retire on usehooks-ts@3.\"\n    );\n    isDeprecated = true;\n    countStart = countdownOptions.seconds;\n    intervalMs = countdownOptions.interval;\n    isIncrement = countdownOptions.isIncrement;\n  } else {\n    ({ countStart, intervalMs, isIncrement, countStop } = countdownOptions);\n  }\n  intervalMs = intervalMs ?? 1e3;\n  isIncrement = isIncrement ?? false;\n  countStop = countStop ?? 0;\n  const {\n    count,\n    increment,\n    decrement,\n    reset: resetCounter\n  } = useCounter(countStart);\n  const {\n    value: isCountdownRunning,\n    setTrue: startCountdown,\n    setFalse: stopCountdown\n  } = useBoolean(false);\n  const resetCountdown = () => {\n    stopCountdown();\n    resetCounter();\n  };\n  const countdownCallback = useCallback(() => {\n    if (count === countStop) {\n      stopCountdown();\n      return;\n    }\n    if (isIncrement) {\n      increment();\n    } else {\n      decrement();\n    }\n  }, [count, countStop, decrement, increment, isIncrement, stopCountdown]);\n  useInterval(countdownCallback, isCountdownRunning ? intervalMs : null);\n  return isDeprecated ? [\n    count,\n    {\n      start: startCountdown,\n      stop: stopCountdown,\n      reset: resetCountdown\n    }\n  ] : [\n    count,\n    {\n      startCountdown,\n      stopCountdown,\n      resetCountdown\n    }\n  ];\n}\nfunction useEventCallback(fn) {\n  const ref = (0,react.useRef)(() => {\n    throw new Error(\"Cannot call an event handler while rendering.\");\n  });\n  dist_useIsomorphicLayoutEffect(() => {\n    ref.current = fn;\n  }, [fn]);\n  return (0,react.useCallback)((...args) => ref.current(...args), [ref]);\n}\n\n// src/useLocalStorage/useLocalStorage.ts\nvar IS_SERVER = typeof window === \"undefined\";\nfunction useLocalStorage(key, initialValue, options = {}) {\n  const { initializeWithValue = true } = options;\n  const serializer = useCallback(\n    (value) => {\n      if (options.serializer) {\n        return options.serializer(value);\n      }\n      return JSON.stringify(value);\n    },\n    [options]\n  );\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      const defaultValue = initialValue instanceof Function ? initialValue() : initialValue;\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return defaultValue;\n      }\n      return parsed;\n    },\n    [options, initialValue]\n  );\n  const readValue = useCallback(() => {\n    const initialValueToUse = initialValue instanceof Function ? initialValue() : initialValue;\n    if (IS_SERVER) {\n      return initialValueToUse;\n    }\n    try {\n      const raw = window.localStorage.getItem(key);\n      return raw ? deserializer(raw) : initialValueToUse;\n    } catch (error) {\n      console.warn(`Error reading localStorage key \\u201C${key}\\u201D:`, error);\n      return initialValueToUse;\n    }\n  }, [initialValue, key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return initialValue instanceof Function ? initialValue() : initialValue;\n  });\n  const setValue = useEventCallback((value) => {\n    if (IS_SERVER) {\n      console.warn(\n        `Tried setting localStorage key \\u201C${key}\\u201D even though environment is not a client`\n      );\n    }\n    try {\n      const newValue = value instanceof Function ? value(readValue()) : value;\n      window.localStorage.setItem(key, serializer(newValue));\n      setStoredValue(newValue);\n      window.dispatchEvent(new StorageEvent(\"local-storage\", { key }));\n    } catch (error) {\n      console.warn(`Error setting localStorage key \\u201C${key}\\u201D:`, error);\n    }\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"local-storage\", handleStorageChange);\n  return [storedValue, setValue];\n}\nvar IS_SERVER2 = typeof window === \"undefined\";\nfunction useMediaQuery(query, options) {\n  const defaultValue = typeof options === \"boolean\" ? options : (options == null ? void 0 : options.defaultValue) ?? false;\n  const initializeWithValue = typeof options === \"boolean\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const getMatches = (query2) => {\n    if (IS_SERVER2) {\n      return defaultValue;\n    }\n    return window.matchMedia(query2).matches;\n  };\n  const [matches, setMatches] = useState(() => {\n    if (initializeWithValue) {\n      return getMatches(query);\n    }\n    return defaultValue;\n  });\n  function handleChange() {\n    setMatches(getMatches(query));\n  }\n  dist_useIsomorphicLayoutEffect(() => {\n    const matchMedia = window.matchMedia(query);\n    handleChange();\n    if (matchMedia.addListener) {\n      matchMedia.addListener(handleChange);\n    } else {\n      matchMedia.addEventListener(\"change\", handleChange);\n    }\n    return () => {\n      if (matchMedia.removeListener) {\n        matchMedia.removeListener(handleChange);\n      } else {\n        matchMedia.removeEventListener(\"change\", handleChange);\n      }\n    };\n  }, [query]);\n  return matches;\n}\n\n// src/useDarkMode/useDarkMode.ts\nvar COLOR_SCHEME_QUERY = \"(prefers-color-scheme: dark)\";\nvar LOCAL_STORAGE_KEY = \"usehooks-ts-dark-mode\";\nfunction useDarkMode(options, localStorageKeyProps = LOCAL_STORAGE_KEY) {\n  const counter = useRef(0);\n  counter.current++;\n  const defaultValue = typeof options === \"boolean\" ? options : options == null ? void 0 : options.defaultValue;\n  const localStorageKey = typeof options === \"boolean\" ? localStorageKeyProps ?? LOCAL_STORAGE_KEY : (options == null ? void 0 : options.localStorageKey) ?? LOCAL_STORAGE_KEY;\n  const initializeWithValue = typeof options === \"boolean\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const isDarkOS = useMediaQuery(COLOR_SCHEME_QUERY, {\n    initializeWithValue,\n    defaultValue\n  });\n  const [isDarkMode, setDarkMode] = useLocalStorage(\n    localStorageKey,\n    defaultValue ?? isDarkOS ?? false,\n    { initializeWithValue }\n  );\n  dist_useIsomorphicLayoutEffect(() => {\n    if (isDarkOS !== isDarkMode) {\n      setDarkMode(isDarkOS);\n    }\n  }, [isDarkOS]);\n  return {\n    isDarkMode,\n    toggle: () => {\n      setDarkMode((prev) => !prev);\n    },\n    enable: () => {\n      setDarkMode(true);\n    },\n    disable: () => {\n      setDarkMode(false);\n    },\n    set: (value) => {\n      setDarkMode(value);\n    }\n  };\n}\nfunction useDebounce(value, delay) {\n  const [debouncedValue, setDebouncedValue] = useState(value);\n  useEffect(() => {\n    const timer = setTimeout(() => {\n      setDebouncedValue(value);\n    }, delay ?? 500);\n    return () => {\n      clearTimeout(timer);\n    };\n  }, [value, delay]);\n  return debouncedValue;\n}\nfunction useUnmount(func) {\n  const funcRef = useRef(func);\n  funcRef.current = func;\n  useEffect(\n    () => () => {\n      funcRef.current();\n    },\n    []\n  );\n}\n\n// src/useDebounceCallback/useDebounceCallback.ts\nfunction useDebounceCallback(func, delay = 500, options) {\n  const debouncedFunc = useRef();\n  useUnmount(() => {\n    if (debouncedFunc.current) {\n      debouncedFunc.current.cancel();\n    }\n  });\n  const debounced = useMemo(() => {\n    const debouncedFuncInstance = debounce(func, delay, options);\n    const wrappedFunc = (...args) => {\n      return debouncedFuncInstance(...args);\n    };\n    wrappedFunc.cancel = () => {\n      debouncedFuncInstance.cancel();\n    };\n    wrappedFunc.isPending = () => {\n      return !!debouncedFunc.current;\n    };\n    wrappedFunc.flush = () => {\n      return debouncedFuncInstance.flush();\n    };\n    return wrappedFunc;\n  }, [func, delay, options]);\n  useEffect(() => {\n    debouncedFunc.current = debounce(func, delay, options);\n  }, [func, delay, options]);\n  return debounced;\n}\nfunction useDebounceValue(initialValue, delay, options) {\n  const eq = (options == null ? void 0 : options.equalityFn) ?? ((left, right) => left === right);\n  const unwrappedInitialValue = initialValue instanceof Function ? initialValue() : initialValue;\n  const [debouncedValue, setDebouncedValue] = useState(unwrappedInitialValue);\n  const previousValueRef = useRef(unwrappedInitialValue);\n  const updateDebouncedValue = useDebounceCallback(\n    setDebouncedValue,\n    delay,\n    options\n  );\n  if (!eq(previousValueRef.current, unwrappedInitialValue)) {\n    updateDebouncedValue(unwrappedInitialValue);\n    previousValueRef.current = unwrappedInitialValue;\n  }\n  return [debouncedValue, updateDebouncedValue];\n}\nfunction useDocumentTitle(title, options = {}) {\n  const { preserveTitleOnUnmount = true } = options;\n  const defaultTitle = useRef(null);\n  dist_useIsomorphicLayoutEffect(() => {\n    defaultTitle.current = window.document.title;\n  }, []);\n  dist_useIsomorphicLayoutEffect(() => {\n    window.document.title = title;\n  }, [title]);\n  useUnmount(() => {\n    if (!preserveTitleOnUnmount && defaultTitle.current) {\n      window.document.title = defaultTitle.current;\n    }\n  });\n}\nfunction useEffectOnce(effect) {\n  useEffect(effect, []);\n}\nfunction useElementSize(options = {}) {\n  const { initializeWithValue = true } = options;\n  const [ref, setRef] = useState(null);\n  const readValue = useCallback(() => {\n    return {\n      width: (ref == null ? void 0 : ref.offsetWidth) ?? void 0,\n      height: (ref == null ? void 0 : ref.offsetHeight) ?? void 0\n    };\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  const [size, setSize] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return { width: void 0, height: void 0 };\n  });\n  const handleSize = useCallback(() => {\n    setSize(readValue());\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  useEventListener(\"resize\", handleSize);\n  dist_useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, [ref == null ? void 0 : ref.offsetHeight, ref == null ? void 0 : ref.offsetWidth]);\n  const result = [setRef, size];\n  result.ref = result[0];\n  result.width = size.width;\n  result.height = size.height;\n  return result;\n}\nfunction useFetch(url, options) {\n  const cache = useRef({});\n  const cancelRequest = useRef(false);\n  const initialState = {\n    error: void 0,\n    data: void 0\n  };\n  const fetchReducer = (state2, action) => {\n    switch (action.type) {\n      case \"loading\":\n        return { ...initialState };\n      case \"fetched\":\n        return { ...initialState, data: action.payload };\n      case \"error\":\n        return { ...initialState, error: action.payload };\n      default:\n        return state2;\n    }\n  };\n  const [state, dispatch] = useReducer(fetchReducer, initialState);\n  useEffect(() => {\n    if (!url)\n      return;\n    cancelRequest.current = false;\n    const fetchData = async () => {\n      dispatch({ type: \"loading\" });\n      const currentCache = cache.current[url];\n      if (currentCache) {\n        dispatch({ type: \"fetched\", payload: currentCache });\n        return;\n      }\n      try {\n        const response = await fetch(url, options);\n        if (!response.ok) {\n          throw new Error(response.statusText);\n        }\n        const data = await response.json();\n        cache.current[url] = data;\n        if (cancelRequest.current)\n          return;\n        dispatch({ type: \"fetched\", payload: data });\n      } catch (error) {\n        if (cancelRequest.current)\n          return;\n        dispatch({ type: \"error\", payload: error });\n      }\n    };\n    void fetchData();\n    return () => {\n      cancelRequest.current = true;\n    };\n  }, [url]);\n  return state;\n}\nfunction useHover(elementRef) {\n  const [value, setValue] = useState(false);\n  const handleMouseEnter = () => {\n    setValue(true);\n  };\n  const handleMouseLeave = () => {\n    setValue(false);\n  };\n  useEventListener(\"mouseenter\", handleMouseEnter, elementRef);\n  useEventListener(\"mouseleave\", handleMouseLeave, elementRef);\n  return value;\n}\nfunction useImageOnLoad() {\n  const [isLoaded, setIsLoaded] = useState(false);\n  const handleImageOnLoad = () => {\n    setIsLoaded(true);\n  };\n  const css = {\n    // Thumbnail style.\n    thumbnail: {\n      visibility: isLoaded ? \"hidden\" : \"visible\",\n      filter: \"blur(8px)\",\n      transition: \"visibility 0ms ease-out 500ms\"\n    },\n    // Full image style.\n    fullSize: {\n      opacity: isLoaded ? 1 : 0,\n      transition: \"opacity 500ms ease-in 0ms\"\n    }\n  };\n  return { handleImageOnLoad, css };\n}\nfunction useIntersectionObserver(optionsOrLegacyRef, legacyOptions) {\n  var _a;\n  const isLegacySignature = \"current\" in optionsOrLegacyRef;\n  const options = isLegacySignature ? legacyOptions : optionsOrLegacyRef;\n  const {\n    threshold = 0,\n    root = null,\n    rootMargin = \"0%\",\n    freezeOnceVisible = false,\n    initialIsIntersecting = false\n  } = options ?? {};\n  const [newRef, setNewRef] = useState(null);\n  const ref = isLegacySignature ? optionsOrLegacyRef.current : newRef;\n  const [state, setState] = useState(() => ({\n    isIntersecting: initialIsIntersecting,\n    entry: void 0\n  }));\n  const callbackRef = useRef();\n  callbackRef.current = options == null ? void 0 : options.onChange;\n  const frozen = ((_a = state.entry) == null ? void 0 : _a.isIntersecting) && freezeOnceVisible;\n  useEffect(() => {\n    if (!ref)\n      return;\n    if (!(\"IntersectionObserver\" in window))\n      return;\n    if (frozen)\n      return;\n    let unobserve;\n    const observer = new IntersectionObserver(\n      (entries) => {\n        const thresholds = Array.isArray(observer.thresholds) ? observer.thresholds : [observer.thresholds];\n        entries.forEach((entry) => {\n          const isIntersecting = entry.isIntersecting && thresholds.some((threshold2) => entry.intersectionRatio >= threshold2);\n          setState({ isIntersecting, entry });\n          if (callbackRef.current) {\n            callbackRef.current(isIntersecting, entry);\n          }\n          if (isIntersecting && freezeOnceVisible && unobserve) {\n            unobserve();\n            unobserve = void 0;\n          }\n        });\n      },\n      { threshold, root, rootMargin }\n    );\n    observer.observe(ref);\n    return () => {\n      observer.disconnect();\n    };\n  }, [\n    ref,\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n    JSON.stringify(threshold),\n    root,\n    rootMargin,\n    frozen,\n    freezeOnceVisible\n  ]);\n  const prevRef = useRef(null);\n  useEffect(() => {\n    var _a2;\n    if (!ref && ((_a2 = state.entry) == null ? void 0 : _a2.target) && !freezeOnceVisible && !frozen && prevRef.current !== state.entry.target) {\n      prevRef.current = state.entry.target;\n      setState({ isIntersecting: initialIsIntersecting, entry: void 0 });\n    }\n  }, [ref, state.entry, freezeOnceVisible, frozen, initialIsIntersecting]);\n  if (isLegacySignature) {\n    return state.entry;\n  }\n  const result = [\n    setNewRef,\n    !!state.isIntersecting,\n    state.entry\n  ];\n  result.ref = result[0];\n  result.isIntersecting = result[1];\n  result.entry = result[2];\n  return result;\n}\nfunction useIsClient() {\n  const [isClient, setClient] = useState(false);\n  useEffect(() => {\n    setClient(true);\n  }, []);\n  return isClient;\n}\nfunction useIsFirstRender() {\n  const isFirst = useRef(true);\n  if (isFirst.current) {\n    isFirst.current = false;\n    return true;\n  }\n  return isFirst.current;\n}\nfunction dist_useIsMounted() {\n  const isMounted = useRef(false);\n  useEffect(() => {\n    isMounted.current = true;\n    return () => {\n      isMounted.current = false;\n    };\n  }, []);\n  return useCallback(() => isMounted.current, []);\n}\nfunction useLockedBody(initialLocked = false, rootId = \"___gatsby\") {\n  const [locked, setLocked] = useState(initialLocked);\n  dist_useIsomorphicLayoutEffect(() => {\n    if (!locked) {\n      return;\n    }\n    const originalOverflow = document.body.style.overflow;\n    const originalPaddingRight = document.body.style.paddingRight;\n    document.body.style.overflow = \"hidden\";\n    const root = document.getElementById(rootId);\n    const scrollBarWidth = root ? root.offsetWidth - root.scrollWidth : 0;\n    if (scrollBarWidth) {\n      document.body.style.paddingRight = `${scrollBarWidth}px`;\n    }\n    return () => {\n      document.body.style.overflow = originalOverflow;\n      if (scrollBarWidth) {\n        document.body.style.paddingRight = originalPaddingRight;\n      }\n    };\n  }, [locked]);\n  useEffect(() => {\n    if (locked !== initialLocked) {\n      setLocked(initialLocked);\n    }\n  }, [initialLocked]);\n  return [locked, setLocked];\n}\nfunction useMap(initialState = /* @__PURE__ */ new Map()) {\n  const [map, setMap] = useState(new Map(initialState));\n  const actions = {\n    set: useCallback((key, value) => {\n      setMap((prev) => {\n        const copy = new Map(prev);\n        copy.set(key, value);\n        return copy;\n      });\n    }, []),\n    setAll: useCallback((entries) => {\n      setMap(() => new Map(entries));\n    }, []),\n    remove: useCallback((key) => {\n      setMap((prev) => {\n        const copy = new Map(prev);\n        copy.delete(key);\n        return copy;\n      });\n    }, []),\n    reset: useCallback(() => {\n      setMap(() => /* @__PURE__ */ new Map());\n    }, [])\n  };\n  return [map, actions];\n}\n\n// src/useOnClickOutside/useOnClickOutside.ts\nfunction useOnClickOutside(ref, handler, eventType = \"mousedown\") {\n  useEventListener(eventType, (event) => {\n    const target = event.target;\n    if (!target || !target.isConnected) {\n      return;\n    }\n    const isOutside = Array.isArray(ref) ? ref.every((r) => r.current && !r.current.contains(target)) : ref.current && !ref.current.contains(target);\n    if (isOutside) {\n      handler(event);\n    }\n  });\n}\nvar IS_SERVER3 = typeof window === \"undefined\";\nfunction useReadLocalStorage(key, options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER3) {\n    initializeWithValue = false;\n  }\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return null;\n      }\n      return parsed;\n    },\n    [options]\n  );\n  const readValue = useCallback(() => {\n    if (IS_SERVER3) {\n      return null;\n    }\n    try {\n      const raw = window.localStorage.getItem(key);\n      return raw ? deserializer(raw) : null;\n    } catch (error) {\n      console.warn(`Error reading localStorage key \\u201C${key}\\u201D:`, error);\n      return null;\n    }\n  }, [key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return void 0;\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"local-storage\", handleStorageChange);\n  return storedValue;\n}\nvar initialSize = {\n  width: void 0,\n  height: void 0\n};\nfunction useResizeObserver(options) {\n  const { ref, box = \"content-box\" } = options;\n  const [{ width, height }, setSize] = useState(initialSize);\n  const isMounted = dist_useIsMounted();\n  const previousSize = useRef({ ...initialSize });\n  const onResize = useRef(void 0);\n  onResize.current = options == null ? void 0 : options.onResize;\n  useEffect(() => {\n    if (!(ref == null ? void 0 : ref.current))\n      return;\n    if (typeof window === \"undefined\" || !(\"ResizeObserver\" in window))\n      return;\n    const observer = new ResizeObserver(([entry]) => {\n      const boxProp = box === \"border-box\" ? \"borderBoxSize\" : box === \"device-pixel-content-box\" ? \"devicePixelContentBoxSize\" : \"contentBoxSize\";\n      const newWidth = extractSize(entry, boxProp, \"inlineSize\");\n      const newHeight = extractSize(entry, boxProp, \"blockSize\");\n      const hasChanged = previousSize.current.width !== newWidth || previousSize.current.height !== newHeight;\n      if (hasChanged) {\n        const newSize = { width: newWidth, height: newHeight };\n        previousSize.current.width = newWidth;\n        previousSize.current.height = newHeight;\n        if (onResize == null ? void 0 : onResize.current) {\n          onResize.current(newSize);\n        } else {\n          if (isMounted()) {\n            setSize(newSize);\n          }\n        }\n      }\n    });\n    observer.observe(ref.current, { box });\n    return () => {\n      observer.disconnect();\n    };\n  }, [box, ref, isMounted]);\n  return { width, height };\n}\nfunction extractSize(entry, box, sizeType) {\n  if (!entry[box]) {\n    if (box === \"contentBoxSize\") {\n      return entry.contentRect[sizeType === \"inlineSize\" ? \"width\" : \"height\"];\n    }\n    return void 0;\n  }\n  return Array.isArray(entry[box]) ? entry[box][0][sizeType] : (\n    // @ts-ignore Support Firefox's non-standard behavior\n    entry[box][sizeType]\n  );\n}\nvar IS_SERVER4 = typeof window === \"undefined\";\nfunction useScreen(options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER4) {\n    initializeWithValue = false;\n  }\n  const readScreen = () => {\n    if (IS_SERVER4) {\n      return void 0;\n    }\n    return window.screen;\n  };\n  const [screen, setScreen] = useState(() => {\n    if (initializeWithValue) {\n      return readScreen();\n    }\n    return void 0;\n  });\n  const debouncedSetScreen = useDebounceCallback(\n    setScreen,\n    options == null ? void 0 : options.debounceDelay\n  );\n  function handleSize() {\n    const newScreen = readScreen();\n    const setSize = (options == null ? void 0 : options.debounceDelay) ? debouncedSetScreen : setScreen;\n    if (newScreen) {\n      const {\n        width,\n        height,\n        availHeight,\n        availWidth,\n        colorDepth,\n        orientation,\n        pixelDepth\n      } = newScreen;\n      setSize({\n        width,\n        height,\n        availHeight,\n        availWidth,\n        colorDepth,\n        orientation,\n        pixelDepth\n      });\n    }\n  }\n  useEventListener(\"resize\", handleSize);\n  dist_useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, []);\n  return screen;\n}\nvar cachedScriptStatuses = /* @__PURE__ */ new Map();\nfunction getScriptNode(src) {\n  const node = document.querySelector(\n    `script[src=\"${src}\"]`\n  );\n  const status = node == null ? void 0 : node.getAttribute(\"data-status\");\n  return {\n    node,\n    status\n  };\n}\nfunction useScript(src, options) {\n  const [status, setStatus] = useState(() => {\n    if (!src || (options == null ? void 0 : options.shouldPreventLoad)) {\n      return \"idle\";\n    }\n    if (typeof window === \"undefined\") {\n      return \"loading\";\n    }\n    return cachedScriptStatuses.get(src) ?? \"loading\";\n  });\n  useEffect(() => {\n    if (!src || (options == null ? void 0 : options.shouldPreventLoad)) {\n      return;\n    }\n    const cachedScriptStatus = cachedScriptStatuses.get(src);\n    if (cachedScriptStatus === \"ready\" || cachedScriptStatus === \"error\") {\n      setStatus(cachedScriptStatus);\n      return;\n    }\n    const script = getScriptNode(src);\n    let scriptNode = script.node;\n    if (!scriptNode) {\n      scriptNode = document.createElement(\"script\");\n      scriptNode.src = src;\n      scriptNode.async = true;\n      if (options == null ? void 0 : options.id) {\n        scriptNode.id = options.id;\n      }\n      scriptNode.setAttribute(\"data-status\", \"loading\");\n      document.body.appendChild(scriptNode);\n      const setAttributeFromEvent = (event) => {\n        const scriptStatus = event.type === \"load\" ? \"ready\" : \"error\";\n        scriptNode == null ? void 0 : scriptNode.setAttribute(\"data-status\", scriptStatus);\n      };\n      scriptNode.addEventListener(\"load\", setAttributeFromEvent);\n      scriptNode.addEventListener(\"error\", setAttributeFromEvent);\n    } else {\n      setStatus(script.status ?? cachedScriptStatus ?? \"loading\");\n    }\n    const setStateFromEvent = (event) => {\n      const newStatus = event.type === \"load\" ? \"ready\" : \"error\";\n      setStatus(newStatus);\n      cachedScriptStatuses.set(src, newStatus);\n    };\n    scriptNode.addEventListener(\"load\", setStateFromEvent);\n    scriptNode.addEventListener(\"error\", setStateFromEvent);\n    return () => {\n      if (scriptNode) {\n        scriptNode.removeEventListener(\"load\", setStateFromEvent);\n        scriptNode.removeEventListener(\"error\", setStateFromEvent);\n      }\n      if (scriptNode && (options == null ? void 0 : options.removeOnUnmount)) {\n        scriptNode.remove();\n        cachedScriptStatuses.delete(src);\n      }\n    };\n  }, [src, options == null ? void 0 : options.shouldPreventLoad, options == null ? void 0 : options.removeOnUnmount, options == null ? void 0 : options.id]);\n  return status;\n}\nvar IS_SERVER5 = typeof window === \"undefined\";\nfunction useScrollLock(options = {}) {\n  const { autoLock = true, lockTarget, widthReflow = true } = options;\n  const [isLocked, setIsLocked] = useState(false);\n  const target = useRef(null);\n  const originalStyle = useRef(null);\n  const lock = () => {\n    if (target.current) {\n      const { overflow, paddingRight } = target.current.style;\n      originalStyle.current = { overflow, paddingRight };\n      if (widthReflow) {\n        const offsetWidth = target.current === document.body ? window.innerWidth : target.current.offsetWidth;\n        const currentPaddingRight = parseInt(window.getComputedStyle(target.current).paddingRight, 10) || 0;\n        const scrollbarWidth = offsetWidth - target.current.scrollWidth;\n        target.current.style.paddingRight = `${scrollbarWidth + currentPaddingRight}px`;\n      }\n      target.current.style.overflow = \"hidden\";\n      setIsLocked(true);\n    }\n  };\n  const unlock = () => {\n    if (target.current && originalStyle.current) {\n      target.current.style.overflow = originalStyle.current.overflow;\n      if (widthReflow) {\n        target.current.style.paddingRight = originalStyle.current.paddingRight;\n      }\n    }\n    setIsLocked(false);\n  };\n  dist_useIsomorphicLayoutEffect(() => {\n    if (IS_SERVER5)\n      return;\n    if (lockTarget) {\n      target.current = typeof lockTarget === \"string\" ? document.querySelector(lockTarget) : lockTarget;\n    }\n    if (!target.current) {\n      target.current = document.body;\n    }\n    if (autoLock) {\n      lock();\n    }\n    return () => {\n      unlock();\n    };\n  }, [autoLock, lockTarget, widthReflow]);\n  return { isLocked, lock, unlock };\n}\nvar IS_SERVER6 = typeof window === \"undefined\";\nfunction useSessionStorage(key, initialValue, options = {}) {\n  const { initializeWithValue = true } = options;\n  const serializer = useCallback(\n    (value) => {\n      if (options.serializer) {\n        return options.serializer(value);\n      }\n      return JSON.stringify(value);\n    },\n    [options]\n  );\n  const deserializer = useCallback(\n    (value) => {\n      if (options.deserializer) {\n        return options.deserializer(value);\n      }\n      if (value === \"undefined\") {\n        return void 0;\n      }\n      const defaultValue = initialValue instanceof Function ? initialValue() : initialValue;\n      let parsed;\n      try {\n        parsed = JSON.parse(value);\n      } catch (error) {\n        console.error(\"Error parsing JSON:\", error);\n        return defaultValue;\n      }\n      return parsed;\n    },\n    [options, initialValue]\n  );\n  const readValue = useCallback(() => {\n    const initialValueToUse = initialValue instanceof Function ? initialValue() : initialValue;\n    if (IS_SERVER6) {\n      return initialValueToUse;\n    }\n    try {\n      const raw = window.sessionStorage.getItem(key);\n      return raw ? deserializer(raw) : initialValueToUse;\n    } catch (error) {\n      console.warn(`Error reading sessionStorage key \\u201C${key}\\u201D:`, error);\n      return initialValueToUse;\n    }\n  }, [initialValue, key, deserializer]);\n  const [storedValue, setStoredValue] = useState(() => {\n    if (initializeWithValue) {\n      return readValue();\n    }\n    return initialValue instanceof Function ? initialValue() : initialValue;\n  });\n  const setValue = useEventCallback((value) => {\n    if (IS_SERVER6) {\n      console.warn(\n        `Tried setting sessionStorage key \\u201C${key}\\u201D even though environment is not a client`\n      );\n    }\n    try {\n      const newValue = value instanceof Function ? value(readValue()) : value;\n      window.sessionStorage.setItem(key, serializer(newValue));\n      setStoredValue(newValue);\n      window.dispatchEvent(new StorageEvent(\"session-storage\", { key }));\n    } catch (error) {\n      console.warn(`Error setting sessionStorage key \\u201C${key}\\u201D:`, error);\n    }\n  });\n  useEffect(() => {\n    setStoredValue(readValue());\n  }, [key]);\n  const handleStorageChange = useCallback(\n    (event) => {\n      if ((event == null ? void 0 : event.key) && event.key !== key) {\n        return;\n      }\n      setStoredValue(readValue());\n    },\n    [key, readValue]\n  );\n  useEventListener(\"storage\", handleStorageChange);\n  useEventListener(\"session-storage\", handleStorageChange);\n  return [storedValue, setValue];\n}\n\n// src/useSsr/useSsr.ts\nfunction useSsr() {\n  var _a;\n  const isDOM = (\n    // eslint-disable-next-line @typescript-eslint/prefer-optional-chain\n    typeof window !== \"undefined\" && !!((_a = window == null ? void 0 : window.document) == null ? void 0 : _a.documentElement)\n  );\n  return {\n    isBrowser: isDOM,\n    isServer: !isDOM\n  };\n}\nfunction useStep(maxStep) {\n  const [currentStep, setCurrentStep] = useState(1);\n  const canGoToNextStep = currentStep + 1 <= maxStep;\n  const canGoToPrevStep = currentStep - 1 > 0;\n  const setStep = useCallback(\n    (step) => {\n      const newStep = step instanceof Function ? step(currentStep) : step;\n      if (newStep >= 1 && newStep <= maxStep) {\n        setCurrentStep(newStep);\n        return;\n      }\n      throw new Error(\"Step not valid\");\n    },\n    [maxStep, currentStep]\n  );\n  const goToNextStep = useCallback(() => {\n    if (canGoToNextStep) {\n      setCurrentStep((step) => step + 1);\n    }\n  }, [canGoToNextStep]);\n  const goToPrevStep = useCallback(() => {\n    if (canGoToPrevStep) {\n      setCurrentStep((step) => step - 1);\n    }\n  }, [canGoToPrevStep]);\n  const reset = useCallback(() => {\n    setCurrentStep(1);\n  }, []);\n  return [\n    currentStep,\n    {\n      goToNextStep,\n      goToPrevStep,\n      canGoToNextStep,\n      canGoToPrevStep,\n      setStep,\n      reset\n    }\n  ];\n}\n\n// src/useTernaryDarkMode/useTernaryDarkMode.ts\nvar COLOR_SCHEME_QUERY2 = \"(prefers-color-scheme: dark)\";\nvar LOCAL_STORAGE_KEY2 = \"usehooks-ts-ternary-dark-mode\";\nfunction useTernaryDarkMode(options) {\n  const defaultValue = typeof options === \"string\" ? \"system\" : (options == null ? void 0 : options.defaultValue) ?? \"system\";\n  const localStorageKey = typeof options === \"string\" ? options : (options == null ? void 0 : options.localStorageKey) ?? LOCAL_STORAGE_KEY2;\n  const initializeWithValue = typeof options === \"string\" ? void 0 : (options == null ? void 0 : options.initializeWithValue) ?? void 0;\n  const isDarkOS = useMediaQuery(COLOR_SCHEME_QUERY2, { initializeWithValue });\n  const [mode, setMode] = useLocalStorage(localStorageKey, defaultValue, {\n    initializeWithValue\n  });\n  const isDarkMode = mode === \"dark\" || mode === \"system\" && isDarkOS;\n  const toggleTernaryDarkMode = () => {\n    const modes = [\"light\", \"system\", \"dark\"];\n    setMode((prevMode) => {\n      const nextIndex = (modes.indexOf(prevMode) + 1) % modes.length;\n      return modes[nextIndex];\n    });\n  };\n  return {\n    isDarkMode,\n    ternaryDarkMode: mode,\n    setTernaryDarkMode: setMode,\n    toggleTernaryDarkMode\n  };\n}\nfunction useTimeout(callback, delay) {\n  const savedCallback = useRef(callback);\n  dist_useIsomorphicLayoutEffect(() => {\n    savedCallback.current = callback;\n  }, [callback]);\n  useEffect(() => {\n    if (!delay && delay !== 0) {\n      return;\n    }\n    const id = setTimeout(() => {\n      savedCallback.current();\n    }, delay);\n    return () => {\n      clearTimeout(id);\n    };\n  }, [delay]);\n}\nfunction useToggle(defaultValue) {\n  const [value, setValue] = useState(!!defaultValue);\n  const toggle = useCallback(() => {\n    setValue((x) => !x);\n  }, []);\n  return [value, toggle, setValue];\n}\nfunction useUpdateEffect(effect, deps) {\n  const isFirst = useIsFirstRender();\n  useEffect(() => {\n    if (!isFirst) {\n      return effect();\n    }\n  }, deps);\n}\nvar IS_SERVER7 = typeof window === \"undefined\";\nfunction useWindowSize(options = {}) {\n  let { initializeWithValue = true } = options;\n  if (IS_SERVER7) {\n    initializeWithValue = false;\n  }\n  const [windowSize, setWindowSize] = useState(() => {\n    if (initializeWithValue) {\n      return {\n        width: window.innerWidth,\n        height: window.innerHeight\n      };\n    }\n    return {\n      width: void 0,\n      height: void 0\n    };\n  });\n  const debouncedSetWindowSize = useDebounceCallback(\n    setWindowSize,\n    options == null ? void 0 : options.debounceDelay\n  );\n  function handleSize() {\n    const setSize = (options == null ? void 0 : options.debounceDelay) ? debouncedSetWindowSize : setWindowSize;\n    setSize({\n      width: window.innerWidth,\n      height: window.innerHeight\n    });\n  }\n  useEventListener(\"resize\", handleSize);\n  dist_useIsomorphicLayoutEffect(() => {\n    handleSize();\n  }, []);\n  return windowSize;\n}\n\n\n\n;// CONCATENATED MODULE: ./src/hooks/use-local-storage.ts\n/* eslint-disable no-console */ \n\nfunction use_local_storage_useLocalStorage(key, initialValue) {\n    const readValue = (0,react.useCallback)(()=>{\n        if (false) {}\n        try {\n            const item = window.localStorage.getItem(key);\n            return item ? JSON.parse(item) : initialValue;\n        } catch (error) {\n            console.warn(\"Error reading localStorage key “\".concat(key, \"”:\"), error);\n            return initialValue;\n        }\n    }, [\n        initialValue,\n        key\n    ]);\n    const [storedValue, setStoredValue] = (0,react.useState)(readValue);\n    const setValue = useEventCallback((value)=>{\n        // Prevent build error \"window is undefined\" but keeps working\n        if (false) {}\n        try {\n            const newValue = value instanceof Function ? value(storedValue) : value;\n            window.localStorage.setItem(key, JSON.stringify(newValue));\n            setStoredValue(newValue);\n            window.dispatchEvent(new Event(\"local-storage\"));\n        } catch (error) {\n            console.warn(\"Error setting localStorage key “\".concat(key, \"”:\"), error);\n        }\n    });\n    (0,react.useEffect)(()=>{\n        setStoredValue(readValue());\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n    }, []);\n    const handleStorageChange = (0,react.useCallback)((event)=>{\n        if ((event === null || event === void 0 ? void 0 : event.key) && event.key !== key) {\n            return;\n        }\n        setStoredValue(readValue());\n    }, [\n        key,\n        readValue\n    ]);\n    useEventListener(\"storage\", handleStorageChange);\n    useEventListener(\"local-storage\", handleStorageChange);\n    return [\n        storedValue,\n        setValue\n    ];\n}\n/* harmony default export */ var use_local_storage = (use_local_storage_useLocalStorage);\n\n// EXTERNAL MODULE: ./node_modules/@mui/material/styles/createTheme.js + 14 modules\nvar createTheme = __webpack_require__(1265);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js\nvar objectWithoutPropertiesLoose = __webpack_require__(3366);\n;// CONCATENATED MODULE: ./node_modules/@mui/private-theming/useTheme/ThemeContext.js\n\nconst ThemeContext = /*#__PURE__*/react.createContext(null);\nif (false) {}\n/* harmony default export */ var useTheme_ThemeContext = (ThemeContext);\n;// CONCATENATED MODULE: ./node_modules/@mui/private-theming/useTheme/useTheme.js\n\n\nfunction useTheme() {\n  const theme = react.useContext(useTheme_ThemeContext);\n  if (false) {}\n  return theme;\n}\n;// CONCATENATED MODULE: ./node_modules/@mui/private-theming/ThemeProvider/nested.js\nconst hasSymbol = typeof Symbol === 'function' && Symbol.for;\n/* harmony default export */ var nested = (hasSymbol ? Symbol.for('mui.nested') : '__THEME_NESTED__');\n;// CONCATENATED MODULE: ./node_modules/@mui/private-theming/ThemeProvider/ThemeProvider.js\n\n\n\n\n\n\n\n\n// To support composition of theme.\n\nfunction mergeOuterLocalTheme(outerTheme, localTheme) {\n  if (typeof localTheme === 'function') {\n    const mergedTheme = localTheme(outerTheme);\n    if (false) {}\n    return mergedTheme;\n  }\n  return (0,esm_extends/* default */.Z)({}, outerTheme, localTheme);\n}\n\n/**\n * This component takes a `theme` prop.\n * It makes the `theme` available down the React tree thanks to React context.\n * This component should preferably be used at **the root of your component tree**.\n */\nfunction ThemeProvider(props) {\n  const {\n    children,\n    theme: localTheme\n  } = props;\n  const outerTheme = useTheme();\n  if (false) {}\n  const theme = react.useMemo(() => {\n    const output = outerTheme === null ? localTheme : mergeOuterLocalTheme(outerTheme, localTheme);\n    if (output != null) {\n      output[nested] = outerTheme !== null;\n    }\n    return output;\n  }, [localTheme, outerTheme]);\n  return /*#__PURE__*/(0,jsx_runtime.jsx)(useTheme_ThemeContext.Provider, {\n    value: theme,\n    children: children\n  });\n}\n false ? 0 : void 0;\nif (false) {}\n/* harmony default export */ var ThemeProvider_ThemeProvider = (ThemeProvider);\n// EXTERNAL MODULE: ./node_modules/@emotion/react/dist/emotion-element-43c6fea0.browser.esm.js\nvar emotion_element_43c6fea0_browser_esm = __webpack_require__(6498);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/useThemeWithoutDefault.js\nvar useThemeWithoutDefault = __webpack_require__(4168);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/RtlProvider/index.js\nvar RtlProvider = __webpack_require__(2056);\n// EXTERNAL MODULE: ./node_modules/@mui/system/esm/DefaultPropsProvider/DefaultPropsProvider.js\nvar DefaultPropsProvider = __webpack_require__(2842);\n;// CONCATENATED MODULE: ./node_modules/@mui/system/esm/ThemeProvider/ThemeProvider.js\n'use client';\n\n\n\n\n\n\n\n\n\n\n\nconst EMPTY_THEME = {};\nfunction useThemeScoping(themeId, upperTheme, localTheme, isPrivate = false) {\n  return react.useMemo(() => {\n    const resolvedTheme = themeId ? upperTheme[themeId] || upperTheme : upperTheme;\n    if (typeof localTheme === 'function') {\n      const mergedTheme = localTheme(resolvedTheme);\n      const result = themeId ? (0,esm_extends/* default */.Z)({}, upperTheme, {\n        [themeId]: mergedTheme\n      }) : mergedTheme;\n      // must return a function for the private theme to NOT merge with the upper theme.\n      // see the test case \"use provided theme from a callback\" in ThemeProvider.test.js\n      if (isPrivate) {\n        return () => result;\n      }\n      return result;\n    }\n    return themeId ? (0,esm_extends/* default */.Z)({}, upperTheme, {\n      [themeId]: localTheme\n    }) : (0,esm_extends/* default */.Z)({}, upperTheme, localTheme);\n  }, [themeId, upperTheme, localTheme, isPrivate]);\n}\n\n/**\n * This component makes the `theme` available down the React tree.\n * It should preferably be used at **the root of your component tree**.\n *\n * <ThemeProvider theme={theme}> // existing use case\n * <ThemeProvider theme={{ id: theme }}> // theme scoping\n */\nfunction ThemeProvider_ThemeProvider_ThemeProvider(props) {\n  const {\n    children,\n    theme: localTheme,\n    themeId\n  } = props;\n  const upperTheme = (0,useThemeWithoutDefault/* default */.Z)(EMPTY_THEME);\n  const upperPrivateTheme = useTheme() || EMPTY_THEME;\n  if (false) {}\n  const engineTheme = useThemeScoping(themeId, upperTheme, localTheme);\n  const privateTheme = useThemeScoping(themeId, upperPrivateTheme, localTheme, true);\n  const rtlValue = engineTheme.direction === 'rtl';\n  return /*#__PURE__*/(0,jsx_runtime.jsx)(ThemeProvider_ThemeProvider, {\n    theme: privateTheme,\n    children: /*#__PURE__*/(0,jsx_runtime.jsx)(emotion_element_43c6fea0_browser_esm.T.Provider, {\n      value: engineTheme,\n      children: /*#__PURE__*/(0,jsx_runtime.jsx)(RtlProvider/* default */.Z, {\n        value: rtlValue,\n        children: /*#__PURE__*/(0,jsx_runtime.jsx)(DefaultPropsProvider/* default */.Z, {\n          value: engineTheme == null ? void 0 : engineTheme.components,\n          children: children\n        })\n      })\n    })\n  });\n}\n false ? 0 : void 0;\nif (false) {}\n/* harmony default export */ var esm_ThemeProvider_ThemeProvider = (ThemeProvider_ThemeProvider_ThemeProvider);\n// EXTERNAL MODULE: ./node_modules/@mui/material/styles/identifier.js\nvar identifier = __webpack_require__(606);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/styles/ThemeProvider.js\n'use client';\n\n\n\nconst _excluded = [\"theme\"];\n\n\n\n\n\nfunction styles_ThemeProvider_ThemeProvider(_ref) {\n  let {\n      theme: themeInput\n    } = _ref,\n    props = (0,objectWithoutPropertiesLoose/* default */.Z)(_ref, _excluded);\n  const scopedTheme = themeInput[identifier/* default */.Z];\n  return /*#__PURE__*/(0,jsx_runtime.jsx)(esm_ThemeProvider_ThemeProvider, (0,esm_extends/* default */.Z)({}, props, {\n    themeId: scopedTheme ? identifier/* default */.Z : undefined,\n    theme: scopedTheme || themeInput\n  }));\n}\n false ? 0 : void 0;\n// EXTERNAL MODULE: ./node_modules/@mui/material/DefaultPropsProvider/DefaultPropsProvider.js\nvar DefaultPropsProvider_DefaultPropsProvider = __webpack_require__(8628);\n// EXTERNAL MODULE: ./node_modules/@mui/material/GlobalStyles/GlobalStyles.js + 1 modules\nvar GlobalStyles = __webpack_require__(9773);\n;// CONCATENATED MODULE: ./node_modules/@mui/material/CssBaseline/CssBaseline.js\n'use client';\n\n\n\n\n\n\n\n\nconst html = (theme, enableColorScheme) => (0,esm_extends/* default */.Z)({\n  WebkitFontSmoothing: 'antialiased',\n  // Antialiasing.\n  MozOsxFontSmoothing: 'grayscale',\n  // Antialiasing.\n  // Change from `box-sizing: content-box` so that `width`\n  // is not affected by `padding` or `border`.\n  boxSizing: 'border-box',\n  // Fix font resize problem in iOS\n  WebkitTextSizeAdjust: '100%'\n}, enableColorScheme && !theme.vars && {\n  colorScheme: theme.palette.mode\n});\nconst body = theme => (0,esm_extends/* default */.Z)({\n  color: (theme.vars || theme).palette.text.primary\n}, theme.typography.body1, {\n  backgroundColor: (theme.vars || theme).palette.background.default,\n  '@media print': {\n    // Save printer ink.\n    backgroundColor: (theme.vars || theme).palette.common.white\n  }\n});\nconst styles = (theme, enableColorScheme = false) => {\n  var _theme$components;\n  const colorSchemeStyles = {};\n  if (enableColorScheme && theme.colorSchemes) {\n    Object.entries(theme.colorSchemes).forEach(([key, scheme]) => {\n      var _scheme$palette;\n      colorSchemeStyles[theme.getColorSchemeSelector(key).replace(/\\s*&/, '')] = {\n        colorScheme: (_scheme$palette = scheme.palette) == null ? void 0 : _scheme$palette.mode\n      };\n    });\n  }\n  let defaultStyles = (0,esm_extends/* default */.Z)({\n    html: html(theme, enableColorScheme),\n    '*, *::before, *::after': {\n      boxSizing: 'inherit'\n    },\n    'strong, b': {\n      fontWeight: theme.typography.fontWeightBold\n    },\n    body: (0,esm_extends/* default */.Z)({\n      margin: 0\n    }, body(theme), {\n      // Add support for document.body.requestFullScreen().\n      // Other elements, if background transparent, are not supported.\n      '&::backdrop': {\n        backgroundColor: (theme.vars || theme).palette.background.default\n      }\n    })\n  }, colorSchemeStyles);\n  const themeOverrides = (_theme$components = theme.components) == null || (_theme$components = _theme$components.MuiCssBaseline) == null ? void 0 : _theme$components.styleOverrides;\n  if (themeOverrides) {\n    defaultStyles = [defaultStyles, themeOverrides];\n  }\n  return defaultStyles;\n};\n\n/**\n * Kickstart an elegant, consistent, and simple baseline to build upon.\n */\nfunction CssBaseline(inProps) {\n  const props = (0,DefaultPropsProvider_DefaultPropsProvider/* useDefaultProps */.i)({\n    props: inProps,\n    name: 'MuiCssBaseline'\n  });\n  const {\n    children,\n    enableColorScheme = false\n  } = props;\n  return /*#__PURE__*/(0,jsx_runtime.jsxs)(react.Fragment, {\n    children: [/*#__PURE__*/(0,jsx_runtime.jsx)(GlobalStyles/* default */.Z, {\n      styles: theme => styles(theme, enableColorScheme)\n    }), children]\n  });\n}\n false ? 0 : void 0;\n/* harmony default export */ var CssBaseline_CssBaseline = (CssBaseline);\n;// CONCATENATED MODULE: ./src/providers/theme/options.ts\nconst breakpoints = {\n    values: {\n        xs: 0,\n        sm: 640,\n        md: 810,\n        lg: 1200,\n        xl: 1500\n    }\n};\nconst fontFamily = \"Inter Variable\";\nconst typography = {\n    fontFamily: fontFamily,\n    h1: {\n        fontFamily: fontFamily\n    },\n    h2: {\n        fontFamily: fontFamily\n    },\n    h3: {\n        fontFamily: fontFamily\n    },\n    h4: {\n        fontFamily: fontFamily\n    },\n    h5: {\n        fontFamily: fontFamily\n    },\n    h6: {\n        fontFamily: fontFamily,\n        fontWeight: 700\n    }\n};\nconst settings = {\n    light: {\n        palette: {\n            mode: \"light\",\n            background: {\n                default: \"#FFFFFF\"\n            },\n            primary: {\n                main: \"#00782A\"\n            },\n            secondary: {\n                main: \"#F5A302\"\n            },\n            text: {\n                primary: \"#000000\",\n                secondary: \"#F5A302\"\n            }\n        },\n        typography,\n        components: {},\n        breakpoints\n    }\n};\nconst getThemeOptions = (mode)=>settings[\"light\"];\n/* harmony default export */ var options = (getThemeOptions);\n\n;// CONCATENATED MODULE: ./src/providers/theme/index.tsx\n\n\n\n\n\nconst theme_ThemeContext = /*#__PURE__*/ (0,react.createContext)({});\nconst localStorageThemeModeKeyName = \"THEME_MODE\";\nfunction Provider(param) {\n    let { children  } = param;\n    const preferredMode = \"light\";\n    const [savedThemeMode, setSavedThemeMode] = use_local_storage(localStorageThemeModeKeyName, preferredMode);\n    const [mode, setMode] = (0,react.useState)(savedThemeMode !== null && savedThemeMode !== void 0 ? savedThemeMode : preferredMode);\n    const contextValues = (0,react.useMemo)(()=>{\n        const themeOptions = (0,createTheme/* default */.Z)(options(mode));\n        return {\n            themeMode: mode,\n            themeOptions,\n            toggleThemeMode: (newMode)=>{\n                setMode((prevMode)=>newMode !== null && newMode !== void 0 ? newMode : prevMode === \"light\" ? \"dark\" : \"light\");\n            }\n        };\n    }, [\n        mode\n    ]);\n    (0,react.useEffect)(()=>{\n        document.documentElement.setAttribute(\"data-theme\", mode);\n        if (mode === \"dark\") {\n            document.documentElement.classList.add(\"dark\");\n        } else {\n            document.documentElement.classList.remove(\"dark\");\n        }\n        setSavedThemeMode(mode);\n    }, [\n        mode,\n        setSavedThemeMode\n    ]);\n    return /*#__PURE__*/ (0,jsx_runtime.jsx)(theme_ThemeContext.Provider, {\n        value: contextValues,\n        children: /*#__PURE__*/ (0,jsx_runtime.jsxs)(styles_ThemeProvider_ThemeProvider, {\n            theme: contextValues.themeOptions,\n            children: [\n                /*#__PURE__*/ (0,jsx_runtime.jsx)(CssBaseline_CssBaseline, {}),\n                children\n            ]\n        })\n    });\n}\n/* harmony default export */ var theme = (Provider);\n\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-adapter-react-ui/styles.css\nvar wallet_adapter_react_ui_styles = __webpack_require__(6672);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/types.js\nvar WalletAdapterNetwork;\n(function (WalletAdapterNetwork) {\n    WalletAdapterNetwork[\"Mainnet\"] = \"mainnet-beta\";\n    WalletAdapterNetwork[\"Testnet\"] = \"testnet\";\n    WalletAdapterNetwork[\"Devnet\"] = \"devnet\";\n})(WalletAdapterNetwork || (WalletAdapterNetwork = {}));\n//# sourceMappingURL=types.js.map\n// EXTERNAL MODULE: ./node_modules/@solana/web3.js/lib/index.browser.esm.js + 15 modules\nvar index_browser_esm = __webpack_require__(6737);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/useConnection.js\n\nconst ConnectionContext = (0,react.createContext)({});\nfunction useConnection() {\n    return (0,react.useContext)(ConnectionContext);\n}\n//# sourceMappingURL=useConnection.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/ConnectionProvider.js\n\n\n\nconst ConnectionProvider = ({ children, endpoint, config = { commitment: 'confirmed' }, }) => {\n    const connection = (0,react.useMemo)(() => new index_browser_esm.Connection(endpoint, config), [endpoint, config]);\n    return react.createElement(ConnectionContext.Provider, { value: { connection } }, children);\n};\n//# sourceMappingURL=ConnectionProvider.js.map\n// EXTERNAL MODULE: ./node_modules/eventemitter3/index.js\nvar eventemitter3 = __webpack_require__(6729);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/errors.js\nclass WalletError extends Error {\n    // eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\n    constructor(message, error) {\n        super(message);\n        this.error = error;\n    }\n}\nclass WalletNotReadyError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotReadyError';\n    }\n}\nclass WalletLoadError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletLoadError';\n    }\n}\nclass WalletConfigError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletConfigError';\n    }\n}\nclass WalletConnectionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletConnectionError';\n    }\n}\nclass WalletDisconnectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletDisconnectedError';\n    }\n}\nclass WalletDisconnectionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletDisconnectionError';\n    }\n}\nclass WalletAccountError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletAccountError';\n    }\n}\nclass WalletPublicKeyError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletPublicKeyError';\n    }\n}\nclass WalletKeypairError extends (/* unused pure expression or super */ null && (WalletError)) {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletKeypairError';\n    }\n}\nclass WalletNotConnectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotConnectedError';\n    }\n}\nclass WalletSendTransactionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSendTransactionError';\n    }\n}\nclass WalletSignTransactionError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignTransactionError';\n    }\n}\nclass WalletSignMessageError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignMessageError';\n    }\n}\nclass WalletSignInError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletSignInError';\n    }\n}\nclass WalletTimeoutError extends (/* unused pure expression or super */ null && (WalletError)) {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletTimeoutError';\n    }\n}\nclass WalletWindowBlockedError extends (/* unused pure expression or super */ null && (WalletError)) {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletWindowBlockedError';\n    }\n}\nclass WalletWindowClosedError extends (/* unused pure expression or super */ null && (WalletError)) {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletWindowClosedError';\n    }\n}\n//# sourceMappingURL=errors.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/adapter.js\n\n\n\n/**\n * A wallet's readiness describes a series of states that the wallet can be in,\n * depending on what kind of wallet it is. An installable wallet (eg. a browser\n * extension like Phantom) might be `Installed` if we've found the Phantom API\n * in the global scope, or `NotDetected` otherwise. A loadable, zero-install\n * runtime (eg. Torus Wallet) might simply signal that it's `Loadable`. Use this\n * metadata to personalize the wallet list for each user (eg. to show their\n * installed wallets first).\n */\nvar WalletReadyState;\n(function (WalletReadyState) {\n    /**\n     * User-installable wallets can typically be detected by scanning for an API\n     * that they've injected into the global context. If such an API is present,\n     * we consider the wallet to have been installed.\n     */\n    WalletReadyState[\"Installed\"] = \"Installed\";\n    WalletReadyState[\"NotDetected\"] = \"NotDetected\";\n    /**\n     * Loadable wallets are always available to you. Since you can load them at\n     * any time, it's meaningless to say that they have been detected.\n     */\n    WalletReadyState[\"Loadable\"] = \"Loadable\";\n    /**\n     * If a wallet is not supported on a given platform (eg. server-rendering, or\n     * mobile) then it will stay in the `Unsupported` state.\n     */\n    WalletReadyState[\"Unsupported\"] = \"Unsupported\";\n})(WalletReadyState || (WalletReadyState = {}));\nclass BaseWalletAdapter extends eventemitter3 {\n    get connected() {\n        return !!this.publicKey;\n    }\n    async autoConnect() {\n        await this.connect();\n    }\n    async prepareTransaction(transaction, connection, options = {}) {\n        const publicKey = this.publicKey;\n        if (!publicKey)\n            throw new WalletNotConnectedError();\n        transaction.feePayer = transaction.feePayer || publicKey;\n        transaction.recentBlockhash =\n            transaction.recentBlockhash ||\n                (await connection.getLatestBlockhash({\n                    commitment: options.preflightCommitment,\n                    minContextSlot: options.minContextSlot,\n                })).blockhash;\n        return transaction;\n    }\n}\nfunction scopePollingDetectionStrategy(detect) {\n    // Early return when server-side rendering\n    if (typeof window === 'undefined' || typeof document === 'undefined')\n        return;\n    const disposers = [];\n    function detectAndDispose() {\n        const detected = detect();\n        if (detected) {\n            for (const dispose of disposers) {\n                dispose();\n            }\n        }\n    }\n    // Strategy #1: Try detecting every second.\n    const interval = \n    // TODO: #334 Replace with idle callback strategy.\n    setInterval(detectAndDispose, 1000);\n    disposers.push(() => clearInterval(interval));\n    // Strategy #2: Detect as soon as the DOM becomes 'ready'/'interactive'.\n    if (\n    // Implies that `DOMContentLoaded` has not yet fired.\n    document.readyState === 'loading') {\n        document.addEventListener('DOMContentLoaded', detectAndDispose, { once: true });\n        disposers.push(() => document.removeEventListener('DOMContentLoaded', detectAndDispose));\n    }\n    // Strategy #3: Detect after the `window` has fully loaded.\n    if (\n    // If the `complete` state has been reached, we're too late.\n    document.readyState !== 'complete') {\n        window.addEventListener('load', detectAndDispose, { once: true });\n        disposers.push(() => window.removeEventListener('load', detectAndDispose));\n    }\n    // Strategy #4: Detect synchronously, now.\n    detectAndDispose();\n}\n/**\n * Users on iOS can be redirected into a wallet's in-app browser automatically,\n * if that wallet has a universal link configured to do so\n * But should not be redirected from within a webview, eg. if they're already\n * inside a wallet's browser\n * This function can be used to identify users who are on iOS and can be redirected\n *\n * @returns true if the user can be redirected\n */\nfunction isIosAndRedirectable() {\n    // SSR: return false\n    if (!navigator)\n        return false;\n    const userAgent = navigator.userAgent.toLowerCase();\n    // if on iOS the user agent will contain either iPhone or iPad\n    // caveat: if requesting desktop site then this won't work\n    const isIos = userAgent.includes('iphone') || userAgent.includes('ipad');\n    // if in a webview then it will not include Safari\n    // note that other iOS browsers also include Safari\n    // so we will redirect only if Safari is also included\n    const isSafari = userAgent.includes('safari');\n    return isIos && isSafari;\n}\n//# sourceMappingURL=adapter.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/transaction.js\nfunction isVersionedTransaction(transaction) {\n    return 'version' in transaction;\n}\n//# sourceMappingURL=transaction.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/signer.js\n\n\n\nclass BaseSignerWalletAdapter extends BaseWalletAdapter {\n    async sendTransaction(transaction, connection, options = {}) {\n        let emit = true;\n        try {\n            if (isVersionedTransaction(transaction)) {\n                if (!this.supportedTransactionVersions)\n                    throw new WalletSendTransactionError(`Sending versioned transactions isn't supported by this wallet`);\n                if (!this.supportedTransactionVersions.has(transaction.version))\n                    throw new WalletSendTransactionError(`Sending transaction version ${transaction.version} isn't supported by this wallet`);\n                try {\n                    transaction = await this.signTransaction(transaction);\n                    const rawTransaction = transaction.serialize();\n                    return await connection.sendRawTransaction(rawTransaction, options);\n                }\n                catch (error) {\n                    // If the error was thrown by `signTransaction`, rethrow it and don't emit a duplicate event\n                    if (error instanceof WalletSignTransactionError) {\n                        emit = false;\n                        throw error;\n                    }\n                    throw new WalletSendTransactionError(error?.message, error);\n                }\n            }\n            else {\n                try {\n                    const { signers, ...sendOptions } = options;\n                    transaction = await this.prepareTransaction(transaction, connection, sendOptions);\n                    signers?.length && transaction.partialSign(...signers);\n                    transaction = await this.signTransaction(transaction);\n                    const rawTransaction = transaction.serialize();\n                    return await connection.sendRawTransaction(rawTransaction, sendOptions);\n                }\n                catch (error) {\n                    // If the error was thrown by `signTransaction`, rethrow it and don't emit a duplicate event\n                    if (error instanceof WalletSignTransactionError) {\n                        emit = false;\n                        throw error;\n                    }\n                    throw new WalletSendTransactionError(error?.message, error);\n                }\n            }\n        }\n        catch (error) {\n            if (emit) {\n                this.emit('error', error);\n            }\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        for (const transaction of transactions) {\n            if (isVersionedTransaction(transaction)) {\n                if (!this.supportedTransactionVersions)\n                    throw new WalletSignTransactionError(`Signing versioned transactions isn't supported by this wallet`);\n                if (!this.supportedTransactionVersions.has(transaction.version))\n                    throw new WalletSignTransactionError(`Signing transaction version ${transaction.version} isn't supported by this wallet`);\n            }\n        }\n        const signedTransactions = [];\n        for (const transaction of transactions) {\n            signedTransactions.push(await this.signTransaction(transaction));\n        }\n        return signedTransactions;\n    }\n}\nclass BaseMessageSignerWalletAdapter extends BaseSignerWalletAdapter {\n}\nclass BaseSignInMessageSignerWalletAdapter extends BaseMessageSignerWalletAdapter {\n}\n//# sourceMappingURL=signer.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-util/lib/esm/signIn.js\n\n\n/**\n * TODO: docs\n */\nfunction verifySignIn(input, output) {\n    const { signedMessage, signature, account: { publicKey }, } = output;\n    const message = deriveSignInMessage(input, output);\n    return !!message && verifyMessageSignature({ message, signedMessage, signature, publicKey });\n}\n/**\n * TODO: docs\n */\nfunction deriveSignInMessage(input, output) {\n    const text = deriveSignInMessageText(input, output);\n    if (!text)\n        return null;\n    return new TextEncoder().encode(text);\n}\n/**\n * TODO: docs\n */\nfunction deriveSignInMessageText(input, output) {\n    const parsed = parseSignInMessage(output.signedMessage);\n    if (!parsed)\n        return null;\n    if (input.domain && input.domain !== parsed.domain)\n        return null;\n    if (input.address && input.address !== parsed.address)\n        return null;\n    if (input.statement !== parsed.statement)\n        return null;\n    if (input.uri !== parsed.uri)\n        return null;\n    if (input.version !== parsed.version)\n        return null;\n    if (input.chainId !== parsed.chainId)\n        return null;\n    if (input.nonce !== parsed.nonce)\n        return null;\n    if (input.issuedAt !== parsed.issuedAt)\n        return null;\n    if (input.expirationTime !== parsed.expirationTime)\n        return null;\n    if (input.notBefore !== parsed.notBefore)\n        return null;\n    if (input.requestId !== parsed.requestId)\n        return null;\n    if (input.resources) {\n        if (!parsed.resources)\n            return null;\n        if (!arraysEqual(input.resources, parsed.resources))\n            return null;\n    }\n    else if (parsed.resources)\n        return null;\n    return createSignInMessageText(parsed);\n}\n/**\n * TODO: docs\n */\nfunction parseSignInMessage(message) {\n    const text = new TextDecoder().decode(message);\n    return parseSignInMessageText(text);\n}\n// TODO: implement https://github.com/solana-labs/solana/blob/master/docs/src/proposals/off-chain-message-signing.md\nconst DOMAIN = '(?<domain>[^\\\\n]+?) wants you to sign in with your Solana account:\\\\n';\nconst ADDRESS = '(?<address>[^\\\\n]+)(?:\\\\n|$)';\nconst STATEMENT = '(?:\\\\n(?<statement>[\\\\S\\\\s]*?)(?:\\\\n|$))??';\nconst URI = '(?:\\\\nURI: (?<uri>[^\\\\n]+))?';\nconst VERSION = '(?:\\\\nVersion: (?<version>[^\\\\n]+))?';\nconst CHAIN_ID = '(?:\\\\nChain ID: (?<chainId>[^\\\\n]+))?';\nconst NONCE = '(?:\\\\nNonce: (?<nonce>[^\\\\n]+))?';\nconst ISSUED_AT = '(?:\\\\nIssued At: (?<issuedAt>[^\\\\n]+))?';\nconst EXPIRATION_TIME = '(?:\\\\nExpiration Time: (?<expirationTime>[^\\\\n]+))?';\nconst NOT_BEFORE = '(?:\\\\nNot Before: (?<notBefore>[^\\\\n]+))?';\nconst REQUEST_ID = '(?:\\\\nRequest ID: (?<requestId>[^\\\\n]+))?';\nconst RESOURCES = '(?:\\\\nResources:(?<resources>(?:\\\\n- [^\\\\n]+)*))?';\nconst FIELDS = `${URI}${VERSION}${CHAIN_ID}${NONCE}${ISSUED_AT}${EXPIRATION_TIME}${NOT_BEFORE}${REQUEST_ID}${RESOURCES}`;\nconst MESSAGE = new RegExp(`^${DOMAIN}${ADDRESS}${STATEMENT}${FIELDS}\\\\n*$`);\n/**\n * TODO: docs\n */\nfunction parseSignInMessageText(text) {\n    const match = MESSAGE.exec(text);\n    if (!match)\n        return null;\n    const groups = match.groups;\n    if (!groups)\n        return null;\n    return {\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        domain: groups.domain,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        address: groups.address,\n        statement: groups.statement,\n        uri: groups.uri,\n        version: groups.version,\n        nonce: groups.nonce,\n        chainId: groups.chainId,\n        issuedAt: groups.issuedAt,\n        expirationTime: groups.expirationTime,\n        notBefore: groups.notBefore,\n        requestId: groups.requestId,\n        resources: groups.resources?.split('\\n- ').slice(1),\n    };\n}\n/**\n * TODO: docs\n */\nfunction createSignInMessage(input) {\n    const text = createSignInMessageText(input);\n    return new TextEncoder().encode(text);\n}\n/**\n * TODO: docs\n */\nfunction createSignInMessageText(input) {\n    // ${domain} wants you to sign in with your Solana account:\n    // ${address}\n    //\n    // ${statement}\n    //\n    // URI: ${uri}\n    // Version: ${version}\n    // Chain ID: ${chain}\n    // Nonce: ${nonce}\n    // Issued At: ${issued-at}\n    // Expiration Time: ${expiration-time}\n    // Not Before: ${not-before}\n    // Request ID: ${request-id}\n    // Resources:\n    // - ${resources[0]}\n    // - ${resources[1]}\n    // ...\n    // - ${resources[n]}\n    let message = `${input.domain} wants you to sign in with your Solana account:\\n`;\n    message += `${input.address}`;\n    if (input.statement) {\n        message += `\\n\\n${input.statement}`;\n    }\n    const fields = [];\n    if (input.uri) {\n        fields.push(`URI: ${input.uri}`);\n    }\n    if (input.version) {\n        fields.push(`Version: ${input.version}`);\n    }\n    if (input.chainId) {\n        fields.push(`Chain ID: ${input.chainId}`);\n    }\n    if (input.nonce) {\n        fields.push(`Nonce: ${input.nonce}`);\n    }\n    if (input.issuedAt) {\n        fields.push(`Issued At: ${input.issuedAt}`);\n    }\n    if (input.expirationTime) {\n        fields.push(`Expiration Time: ${input.expirationTime}`);\n    }\n    if (input.notBefore) {\n        fields.push(`Not Before: ${input.notBefore}`);\n    }\n    if (input.requestId) {\n        fields.push(`Request ID: ${input.requestId}`);\n    }\n    if (input.resources) {\n        fields.push(`Resources:`);\n        for (const resource of input.resources) {\n            fields.push(`- ${resource}`);\n        }\n    }\n    if (fields.length) {\n        message += `\\n\\n${fields.join('\\n')}`;\n    }\n    return message;\n}\n//# sourceMappingURL=signIn.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana-mobile/mobile-wallet-adapter-protocol/lib/esm/index.js\n\n\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaMobileWalletAdapterErrorCode = {\n    ERROR_ASSOCIATION_PORT_OUT_OF_RANGE: 'ERROR_ASSOCIATION_PORT_OUT_OF_RANGE',\n    ERROR_FORBIDDEN_WALLET_BASE_URL: 'ERROR_FORBIDDEN_WALLET_BASE_URL',\n    ERROR_SECURE_CONTEXT_REQUIRED: 'ERROR_SECURE_CONTEXT_REQUIRED',\n    ERROR_SESSION_CLOSED: 'ERROR_SESSION_CLOSED',\n    ERROR_SESSION_TIMEOUT: 'ERROR_SESSION_TIMEOUT',\n    ERROR_WALLET_NOT_FOUND: 'ERROR_WALLET_NOT_FOUND',\n    ERROR_INVALID_PROTOCOL_VERSION: 'ERROR_INVALID_PROTOCOL_VERSION',\n};\nclass SolanaMobileWalletAdapterError extends Error {\n    constructor(...args) {\n        const [code, message, data] = args;\n        super(message);\n        this.code = code;\n        this.data = data;\n        this.name = 'SolanaMobileWalletAdapterError';\n    }\n}\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst SolanaMobileWalletAdapterProtocolErrorCode = {\n    // Keep these in sync with `mobilewalletadapter/common/ProtocolContract.java`.\n    ERROR_AUTHORIZATION_FAILED: -1,\n    ERROR_INVALID_PAYLOADS: -2,\n    ERROR_NOT_SIGNED: -3,\n    ERROR_NOT_SUBMITTED: -4,\n    ERROR_TOO_MANY_PAYLOADS: -5,\n    ERROR_ATTEST_ORIGIN_ANDROID: -100,\n};\nclass SolanaMobileWalletAdapterProtocolError extends Error {\n    constructor(...args) {\n        const [jsonRpcMessageId, code, message, data] = args;\n        super(message);\n        this.code = code;\n        this.data = data;\n        this.jsonRpcMessageId = jsonRpcMessageId;\n        this.name = 'SolanaMobileWalletAdapterProtocolError';\n    }\n}\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction createHelloReq(ecdhPublicKey, associationKeypairPrivateKey) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const publicKeyBuffer = yield crypto.subtle.exportKey('raw', ecdhPublicKey);\n        const signatureBuffer = yield crypto.subtle.sign({ hash: 'SHA-256', name: 'ECDSA' }, associationKeypairPrivateKey, publicKeyBuffer);\n        const response = new Uint8Array(publicKeyBuffer.byteLength + signatureBuffer.byteLength);\n        response.set(new Uint8Array(publicKeyBuffer), 0);\n        response.set(new Uint8Array(signatureBuffer), publicKeyBuffer.byteLength);\n        return response;\n    });\n}\n\nfunction encode(input) {\n    return window.btoa(input);\n}\n\nfunction createSIWSMessage(payload) {\n    return createSignInMessageText(payload);\n}\nfunction createSIWSMessageBase64(payload) {\n    return encode(createSIWSMessage(payload));\n}\n\n// optional features\nconst SolanaSignTransactions = 'solana:signTransactions';\nconst SolanaCloneAuthorization = 'solana:cloneAuthorization';\nconst SolanaSignInWithSolana = 'solana:signInWithSolana';\n\n/**\n * Creates a {@link MobileWallet} proxy that handles backwards compatibility and API to RPC conversion.\n *\n * @param protocolVersion the protocol version in use for this session/request\n * @param protocolRequestHandler callback function that handles sending the RPC request to the wallet endpoint.\n * @returns a {@link MobileWallet} proxy\n */\nfunction createMobileWalletProxy(protocolVersion, protocolRequestHandler) {\n    return new Proxy({}, {\n        get(target, p) {\n            if (target[p] == null) {\n                target[p] = function (inputParams) {\n                    return __awaiter(this, void 0, void 0, function* () {\n                        const { method, params } = handleMobileWalletRequest(p, inputParams, protocolVersion);\n                        const result = yield protocolRequestHandler(method, params);\n                        // if the request tried to sign in but the wallet did not return a sign in result, fallback on message signing\n                        if (method === 'authorize' && params.sign_in_payload && !result.sign_in_result) {\n                            result['sign_in_result'] = yield signInFallback(params.sign_in_payload, result, protocolRequestHandler);\n                        }\n                        return handleMobileWalletResponse(p, result, protocolVersion);\n                    });\n                };\n            }\n            return target[p];\n        },\n        defineProperty() {\n            return false;\n        },\n        deleteProperty() {\n            return false;\n        },\n    });\n}\n/**\n * Handles all {@link MobileWallet} API requests and determines the correct MWA RPC method and params to call.\n * This handles backwards compatibility, based on the provided @protocolVersion.\n *\n * @param methodName the name of {@link MobileWallet} method that was called\n * @param methodParams the parameters that were passed to the method\n * @param protocolVersion the protocol version in use for this session/request\n * @returns the RPC request method and params that should be sent to the wallet endpoint\n */\nfunction handleMobileWalletRequest(methodName, methodParams, protocolVersion) {\n    let params = methodParams;\n    let method = methodName\n        .toString()\n        .replace(/[A-Z]/g, (letter) => `_${letter.toLowerCase()}`)\n        .toLowerCase();\n    switch (methodName) {\n        case 'authorize': {\n            let { chain } = params;\n            if (protocolVersion === 'legacy') {\n                switch (chain) {\n                    case 'solana:testnet': {\n                        chain = 'testnet';\n                        break;\n                    }\n                    case 'solana:devnet': {\n                        chain = 'devnet';\n                        break;\n                    }\n                    case 'solana:mainnet': {\n                        chain = 'mainnet-beta';\n                        break;\n                    }\n                    default: {\n                        chain = params.cluster;\n                    }\n                }\n                params.cluster = chain;\n            }\n            else {\n                switch (chain) {\n                    case 'testnet':\n                    case 'devnet': {\n                        chain = `solana:${chain}`;\n                        break;\n                    }\n                    case 'mainnet-beta': {\n                        chain = 'solana:mainnet';\n                        break;\n                    }\n                }\n                params.chain = chain;\n            }\n        }\n        case 'reauthorize': {\n            const { auth_token, identity } = params;\n            if (auth_token) {\n                switch (protocolVersion) {\n                    case 'legacy': {\n                        method = 'reauthorize';\n                        params = { auth_token: auth_token, identity: identity };\n                        break;\n                    }\n                    default: {\n                        method = 'authorize';\n                        break;\n                    }\n                }\n            }\n            break;\n        }\n    }\n    return { method, params };\n}\n/**\n * Handles all {@link MobileWallet} API responses and modifies the response for backwards compatibility, if needed\n *\n * @param method the {@link MobileWallet} method that was called\n * @param response the original response that was returned by the method call\n * @param protocolVersion the protocol version in use for this session/request\n * @returns the possibly modified response\n */\nfunction handleMobileWalletResponse(method, response, protocolVersion) {\n    switch (method) {\n        case 'getCapabilities': {\n            const capabilities = response;\n            switch (protocolVersion) {\n                case 'legacy': {\n                    const features = [SolanaSignTransactions];\n                    if (capabilities.supports_clone_authorization === true) {\n                        features.push(SolanaCloneAuthorization);\n                    }\n                    return Object.assign(Object.assign({}, capabilities), { features: features });\n                }\n                case 'v1': {\n                    return Object.assign(Object.assign({}, capabilities), { supports_sign_and_send_transactions: true, supports_clone_authorization: capabilities.features.includes(SolanaCloneAuthorization) });\n                }\n            }\n        }\n    }\n    return response;\n}\nfunction signInFallback(signInPayload, authorizationResult, protocolRequestHandler) {\n    var _a;\n    return __awaiter(this, void 0, void 0, function* () {\n        const domain = (_a = signInPayload.domain) !== null && _a !== void 0 ? _a : window.location.host;\n        const address = authorizationResult.accounts[0].address;\n        const siwsMessage = createSIWSMessageBase64(Object.assign(Object.assign({}, signInPayload), { domain, address }));\n        const signMessageResult = yield protocolRequestHandler('sign_messages', {\n            addresses: [address],\n            payloads: [siwsMessage]\n        });\n        const signInResult = {\n            address: address,\n            signed_message: siwsMessage,\n            signature: signMessageResult.signed_payloads[0].slice(siwsMessage.length)\n        };\n        return signInResult;\n    });\n}\n\nconst SEQUENCE_NUMBER_BYTES = 4;\nfunction createSequenceNumberVector(sequenceNumber) {\n    if (sequenceNumber >= 4294967296) {\n        throw new Error('Outbound sequence number overflow. The maximum sequence number is 32-bytes.');\n    }\n    const byteArray = new ArrayBuffer(SEQUENCE_NUMBER_BYTES);\n    const view = new DataView(byteArray);\n    view.setUint32(0, sequenceNumber, /* littleEndian */ false);\n    return new Uint8Array(byteArray);\n}\n\nconst INITIALIZATION_VECTOR_BYTES = 12;\nconst ENCODED_PUBLIC_KEY_LENGTH_BYTES = 65;\nfunction encryptMessage(plaintext, sequenceNumber, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const sequenceNumberVector = createSequenceNumberVector(sequenceNumber);\n        const initializationVector = new Uint8Array(INITIALIZATION_VECTOR_BYTES);\n        crypto.getRandomValues(initializationVector);\n        const ciphertext = yield crypto.subtle.encrypt(getAlgorithmParams(sequenceNumberVector, initializationVector), sharedSecret, new TextEncoder().encode(plaintext));\n        const response = new Uint8Array(sequenceNumberVector.byteLength + initializationVector.byteLength + ciphertext.byteLength);\n        response.set(new Uint8Array(sequenceNumberVector), 0);\n        response.set(new Uint8Array(initializationVector), sequenceNumberVector.byteLength);\n        response.set(new Uint8Array(ciphertext), sequenceNumberVector.byteLength + initializationVector.byteLength);\n        return response;\n    });\n}\nfunction decryptMessage(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const sequenceNumberVector = message.slice(0, SEQUENCE_NUMBER_BYTES);\n        const initializationVector = message.slice(SEQUENCE_NUMBER_BYTES, SEQUENCE_NUMBER_BYTES + INITIALIZATION_VECTOR_BYTES);\n        const ciphertext = message.slice(SEQUENCE_NUMBER_BYTES + INITIALIZATION_VECTOR_BYTES);\n        const plaintextBuffer = yield crypto.subtle.decrypt(getAlgorithmParams(sequenceNumberVector, initializationVector), sharedSecret, ciphertext);\n        const plaintext = getUtf8Decoder().decode(plaintextBuffer);\n        return plaintext;\n    });\n}\nfunction getAlgorithmParams(sequenceNumber, initializationVector) {\n    return {\n        additionalData: sequenceNumber,\n        iv: initializationVector,\n        name: 'AES-GCM',\n        tagLength: 128, // 16 byte tag => 128 bits\n    };\n}\nlet _utf8Decoder;\nfunction getUtf8Decoder() {\n    if (_utf8Decoder === undefined) {\n        _utf8Decoder = new TextDecoder('utf-8');\n    }\n    return _utf8Decoder;\n}\n\nfunction generateAssociationKeypair() {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield crypto.subtle.generateKey({\n            name: 'ECDSA',\n            namedCurve: 'P-256',\n        }, false /* extractable */, ['sign'] /* keyUsages */);\n    });\n}\n\nfunction generateECDHKeypair() {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield crypto.subtle.generateKey({\n            name: 'ECDH',\n            namedCurve: 'P-256',\n        }, false /* extractable */, ['deriveKey', 'deriveBits'] /* keyUsages */);\n    });\n}\n\nfunction encryptJsonRpcMessage(jsonRpcMessage, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = JSON.stringify(jsonRpcMessage);\n        const sequenceNumber = jsonRpcMessage.id;\n        return encryptMessage(plaintext, sequenceNumber, sharedSecret);\n    });\n}\nfunction decryptJsonRpcMessage(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = yield decryptMessage(message, sharedSecret);\n        const jsonRpcMessage = JSON.parse(plaintext);\n        if (Object.hasOwnProperty.call(jsonRpcMessage, 'error')) {\n            throw new SolanaMobileWalletAdapterProtocolError(jsonRpcMessage.id, jsonRpcMessage.error.code, jsonRpcMessage.error.message);\n        }\n        return jsonRpcMessage;\n    });\n}\n\nfunction parseHelloRsp(payloadBuffer, // The X9.62-encoded wallet endpoint ephemeral ECDH public keypoint.\nassociationPublicKey, ecdhPrivateKey) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const [associationPublicKeyBuffer, walletPublicKey] = yield Promise.all([\n            crypto.subtle.exportKey('raw', associationPublicKey),\n            crypto.subtle.importKey('raw', payloadBuffer.slice(0, ENCODED_PUBLIC_KEY_LENGTH_BYTES), { name: 'ECDH', namedCurve: 'P-256' }, false /* extractable */, [] /* keyUsages */),\n        ]);\n        const sharedSecret = yield crypto.subtle.deriveBits({ name: 'ECDH', public: walletPublicKey }, ecdhPrivateKey, 256);\n        const ecdhSecretKey = yield crypto.subtle.importKey('raw', sharedSecret, 'HKDF', false /* extractable */, ['deriveKey'] /* keyUsages */);\n        const aesKeyMaterialVal = yield crypto.subtle.deriveKey({\n            name: 'HKDF',\n            hash: 'SHA-256',\n            salt: new Uint8Array(associationPublicKeyBuffer),\n            info: new Uint8Array(),\n        }, ecdhSecretKey, { name: 'AES-GCM', length: 128 }, false /* extractable */, ['encrypt', 'decrypt']);\n        return aesKeyMaterialVal;\n    });\n}\n\nfunction parseSessionProps(message, sharedSecret) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const plaintext = yield decryptMessage(message, sharedSecret);\n        const jsonProperties = JSON.parse(plaintext);\n        let protocolVersion = 'legacy';\n        if (Object.hasOwnProperty.call(jsonProperties, 'v')) {\n            switch (jsonProperties.v) {\n                case 1:\n                case '1':\n                case 'v1':\n                    protocolVersion = 'v1';\n                    break;\n                case 'legacy':\n                    protocolVersion = 'legacy';\n                    break;\n                default:\n                    throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_INVALID_PROTOCOL_VERSION, `Unknown/unsupported protocol version: ${jsonProperties.v}`);\n            }\n        }\n        return ({\n            protocol_version: protocolVersion\n        });\n    });\n}\n\nfunction getRandomAssociationPort() {\n    return assertAssociationPort(49152 + Math.floor(Math.random() * (65535 - 49152 + 1)));\n}\nfunction assertAssociationPort(port) {\n    if (port < 49152 || port > 65535) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_ASSOCIATION_PORT_OUT_OF_RANGE, `Association port number must be between 49152 and 65535. ${port} given.`, { port });\n    }\n    return port;\n}\n\n// https://stackoverflow.com/a/9458996/802047\nfunction arrayBufferToBase64String(buffer) {\n    let binary = '';\n    const bytes = new Uint8Array(buffer);\n    const len = bytes.byteLength;\n    for (let ii = 0; ii < len; ii++) {\n        binary += String.fromCharCode(bytes[ii]);\n    }\n    return window.btoa(binary);\n}\n\nfunction getStringWithURLUnsafeCharactersReplaced(unsafeBase64EncodedString) {\n    return unsafeBase64EncodedString.replace(/[/+=]/g, (m) => ({\n        '/': '_',\n        '+': '-',\n        '=': '.',\n    }[m]));\n}\n\nconst INTENT_NAME = 'solana-wallet';\nfunction getPathParts(pathString) {\n    return (pathString\n        // Strip leading and trailing slashes\n        .replace(/(^\\/+|\\/+$)/g, '')\n        // Return an array of directories\n        .split('/'));\n}\nfunction getIntentURL(methodPathname, intentUrlBase) {\n    let baseUrl = null;\n    if (intentUrlBase) {\n        try {\n            baseUrl = new URL(intentUrlBase);\n        }\n        catch (_a) { } // eslint-disable-line no-empty\n        if ((baseUrl === null || baseUrl === void 0 ? void 0 : baseUrl.protocol) !== 'https:') {\n            throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Base URLs supplied by wallets must be valid `https` URLs');\n        }\n    }\n    baseUrl || (baseUrl = new URL(`${INTENT_NAME}:/`));\n    const pathname = methodPathname.startsWith('/')\n        ? // Method is an absolute path. Replace it wholesale.\n            methodPathname\n        : // Method is a relative path. Merge it with the existing one.\n            [...getPathParts(baseUrl.pathname), ...getPathParts(methodPathname)].join('/');\n    return new URL(pathname, baseUrl);\n}\nfunction getAssociateAndroidIntentURL(associationPublicKey, putativePort, associationURLBase, protocolVersions = ['v1']) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const associationPort = assertAssociationPort(putativePort);\n        const exportedKey = yield crypto.subtle.exportKey('raw', associationPublicKey);\n        const encodedKey = arrayBufferToBase64String(exportedKey);\n        const url = getIntentURL('v1/associate/local', associationURLBase);\n        url.searchParams.set('association', getStringWithURLUnsafeCharactersReplaced(encodedKey));\n        url.searchParams.set('port', `${associationPort}`);\n        protocolVersions.forEach((version) => {\n            url.searchParams.set('v', version);\n        });\n        return url;\n    });\n}\n\n// Typescript `enums` thwart tree-shaking. See https://bargsten.org/jsts/enums/\nconst Browser = {\n    Firefox: 0,\n    Other: 1,\n};\nfunction assertUnreachable(x) {\n    return x;\n}\nfunction getBrowser() {\n    return navigator.userAgent.indexOf('Firefox/') !== -1 ? Browser.Firefox : Browser.Other;\n}\nfunction getDetectionPromise() {\n    // Chrome and others silently fail if a custom protocol is not supported.\n    // For these, we wait to see if the browser is navigated away from in\n    // a reasonable amount of time (ie. the native wallet opened).\n    return new Promise((resolve, reject) => {\n        function cleanup() {\n            clearTimeout(timeoutId);\n            window.removeEventListener('blur', handleBlur);\n        }\n        function handleBlur() {\n            cleanup();\n            resolve();\n        }\n        window.addEventListener('blur', handleBlur);\n        const timeoutId = setTimeout(() => {\n            cleanup();\n            reject();\n        }, 2000);\n    });\n}\nlet _frame = null;\nfunction launchUrlThroughHiddenFrame(url) {\n    if (_frame == null) {\n        _frame = document.createElement('iframe');\n        _frame.style.display = 'none';\n        document.body.appendChild(_frame);\n    }\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    _frame.contentWindow.location.href = url.toString();\n}\nfunction startSession(associationPublicKey, associationURLBase) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const randomAssociationPort = getRandomAssociationPort();\n        const associationUrl = yield getAssociateAndroidIntentURL(associationPublicKey, randomAssociationPort, associationURLBase);\n        if (associationUrl.protocol === 'https:') {\n            // The association URL is an Android 'App Link' or iOS 'Universal Link'.\n            // These are regular web URLs that are designed to launch an app if it\n            // is installed or load the actual target webpage if not.\n            window.location.assign(associationUrl);\n        }\n        else {\n            // The association URL has a custom protocol (eg. `solana-wallet:`)\n            try {\n                const browser = getBrowser();\n                switch (browser) {\n                    case Browser.Firefox:\n                        // If a custom protocol is not supported in Firefox, it throws.\n                        launchUrlThroughHiddenFrame(associationUrl);\n                        // If we reached this line, it's supported.\n                        break;\n                    case Browser.Other: {\n                        const detectionPromise = getDetectionPromise();\n                        window.location.assign(associationUrl);\n                        yield detectionPromise;\n                        break;\n                    }\n                    default:\n                        assertUnreachable(browser);\n                }\n            }\n            catch (e) {\n                throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_WALLET_NOT_FOUND, 'Found no installed wallet that supports the mobile wallet protocol.');\n            }\n        }\n        return randomAssociationPort;\n    });\n}\n\nconst WEBSOCKET_CONNECTION_CONFIG = {\n    /**\n     * 300 milliseconds is a generally accepted threshold for what someone\n     * would consider an acceptable response time for a user interface\n     * after having performed a low-attention tapping task. We set the initial\n     * interval at which we wait for the wallet to set up the websocket at\n     * half this, as per the Nyquist frequency, with a progressive backoff\n     * sequence from there. The total wait time is 30s, which allows for the\n     * user to be presented with a disambiguation dialog, select a wallet, and\n     * for the wallet app to subsequently start.\n     */\n    retryDelayScheduleMs: [150, 150, 200, 500, 500, 750, 750, 1000],\n    timeoutMs: 30000,\n};\nconst WEBSOCKET_PROTOCOL = 'com.solana.mobilewalletadapter.v1';\nfunction assertSecureContext() {\n    if (typeof window === 'undefined' || window.isSecureContext !== true) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SECURE_CONTEXT_REQUIRED, 'The mobile wallet adapter protocol must be used in a secure context (`https`).');\n    }\n}\nfunction assertSecureEndpointSpecificURI(walletUriBase) {\n    let url;\n    try {\n        url = new URL(walletUriBase);\n    }\n    catch (_a) {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Invalid base URL supplied by wallet');\n    }\n    if (url.protocol !== 'https:') {\n        throw new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_FORBIDDEN_WALLET_BASE_URL, 'Base URLs supplied by wallets must be valid `https` URLs');\n    }\n}\nfunction getSequenceNumberFromByteArray(byteArray) {\n    const view = new DataView(byteArray);\n    return view.getUint32(0, /* littleEndian */ false);\n}\nfunction transact(callback, config) {\n    return __awaiter(this, void 0, void 0, function* () {\n        assertSecureContext();\n        const associationKeypair = yield generateAssociationKeypair();\n        const sessionPort = yield startSession(associationKeypair.publicKey, config === null || config === void 0 ? void 0 : config.baseUri);\n        const websocketURL = `ws://localhost:${sessionPort}/solana-wallet`;\n        let connectionStartTime;\n        const getNextRetryDelayMs = (() => {\n            const schedule = [...WEBSOCKET_CONNECTION_CONFIG.retryDelayScheduleMs];\n            return () => (schedule.length > 1 ? schedule.shift() : schedule[0]);\n        })();\n        let nextJsonRpcMessageId = 1;\n        let lastKnownInboundSequenceNumber = 0;\n        let state = { __type: 'disconnected' };\n        return new Promise((resolve, reject) => {\n            let socket;\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            const jsonRpcResponsePromises = {};\n            const handleOpen = () => __awaiter(this, void 0, void 0, function* () {\n                if (state.__type !== 'connecting') {\n                    console.warn('Expected adapter state to be `connecting` at the moment the websocket opens. ' +\n                        `Got \\`${state.__type}\\`.`);\n                    return;\n                }\n                const { associationKeypair } = state;\n                socket.removeEventListener('open', handleOpen);\n                const ecdhKeypair = yield generateECDHKeypair();\n                socket.send(yield createHelloReq(ecdhKeypair.publicKey, associationKeypair.privateKey));\n                state = {\n                    __type: 'hello_req_sent',\n                    associationPublicKey: associationKeypair.publicKey,\n                    ecdhPrivateKey: ecdhKeypair.privateKey,\n                };\n            });\n            const handleClose = (evt) => {\n                if (evt.wasClean) {\n                    state = { __type: 'disconnected' };\n                }\n                else {\n                    reject(new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SESSION_CLOSED, `The wallet session dropped unexpectedly (${evt.code}: ${evt.reason}).`, { closeEvent: evt }));\n                }\n                disposeSocket();\n            };\n            const handleError = (_evt) => __awaiter(this, void 0, void 0, function* () {\n                disposeSocket();\n                if (Date.now() - connectionStartTime >= WEBSOCKET_CONNECTION_CONFIG.timeoutMs) {\n                    reject(new SolanaMobileWalletAdapterError(SolanaMobileWalletAdapterErrorCode.ERROR_SESSION_TIMEOUT, `Failed to connect to the wallet websocket on port ${sessionPort}.`));\n                }\n                else {\n                    yield new Promise((resolve) => {\n                        const retryDelayMs = getNextRetryDelayMs();\n                        retryWaitTimeoutId = window.setTimeout(resolve, retryDelayMs);\n                    });\n                    attemptSocketConnection();\n                }\n            });\n            const handleMessage = (evt) => __awaiter(this, void 0, void 0, function* () {\n                const responseBuffer = yield evt.data.arrayBuffer();\n                switch (state.__type) {\n                    case 'connected':\n                        try {\n                            const sequenceNumberVector = responseBuffer.slice(0, SEQUENCE_NUMBER_BYTES);\n                            const sequenceNumber = getSequenceNumberFromByteArray(sequenceNumberVector);\n                            if (sequenceNumber !== (lastKnownInboundSequenceNumber + 1)) {\n                                throw new Error('Encrypted message has invalid sequence number');\n                            }\n                            lastKnownInboundSequenceNumber = sequenceNumber;\n                            const jsonRpcMessage = yield decryptJsonRpcMessage(responseBuffer, state.sharedSecret);\n                            const responsePromise = jsonRpcResponsePromises[jsonRpcMessage.id];\n                            delete jsonRpcResponsePromises[jsonRpcMessage.id];\n                            responsePromise.resolve(jsonRpcMessage.result);\n                        }\n                        catch (e) {\n                            if (e instanceof SolanaMobileWalletAdapterProtocolError) {\n                                const responsePromise = jsonRpcResponsePromises[e.jsonRpcMessageId];\n                                delete jsonRpcResponsePromises[e.jsonRpcMessageId];\n                                responsePromise.reject(e);\n                            }\n                            else {\n                                throw e;\n                            }\n                        }\n                        break;\n                    case 'hello_req_sent': {\n                        const sharedSecret = yield parseHelloRsp(responseBuffer, state.associationPublicKey, state.ecdhPrivateKey);\n                        const sessionPropertiesBuffer = responseBuffer.slice(ENCODED_PUBLIC_KEY_LENGTH_BYTES);\n                        const sessionProperties = sessionPropertiesBuffer.byteLength !== 0\n                            ? yield (() => __awaiter(this, void 0, void 0, function* () {\n                                const sequenceNumberVector = sessionPropertiesBuffer.slice(0, SEQUENCE_NUMBER_BYTES);\n                                const sequenceNumber = getSequenceNumberFromByteArray(sequenceNumberVector);\n                                if (sequenceNumber !== (lastKnownInboundSequenceNumber + 1)) {\n                                    throw new Error('Encrypted message has invalid sequence number');\n                                }\n                                lastKnownInboundSequenceNumber = sequenceNumber;\n                                return parseSessionProps(sessionPropertiesBuffer, sharedSecret);\n                            }))() : { protocol_version: 'legacy' };\n                        state = { __type: 'connected', sharedSecret, sessionProperties };\n                        const wallet = createMobileWalletProxy(sessionProperties.protocol_version, (method, params) => __awaiter(this, void 0, void 0, function* () {\n                            const id = nextJsonRpcMessageId++;\n                            socket.send(yield encryptJsonRpcMessage({\n                                id,\n                                jsonrpc: '2.0',\n                                method,\n                                params: params !== null && params !== void 0 ? params : {},\n                            }, sharedSecret));\n                            return new Promise((resolve, reject) => {\n                                jsonRpcResponsePromises[id] = {\n                                    resolve(result) {\n                                        switch (method) {\n                                            case 'authorize':\n                                            case 'reauthorize': {\n                                                const { wallet_uri_base } = result;\n                                                if (wallet_uri_base != null) {\n                                                    try {\n                                                        assertSecureEndpointSpecificURI(wallet_uri_base);\n                                                    }\n                                                    catch (e) {\n                                                        reject(e);\n                                                        return;\n                                                    }\n                                                }\n                                                break;\n                                            }\n                                        }\n                                        resolve(result);\n                                    },\n                                    reject,\n                                };\n                            });\n                        }));\n                        try {\n                            resolve(yield callback(wallet));\n                        }\n                        catch (e) {\n                            reject(e);\n                        }\n                        finally {\n                            disposeSocket();\n                            socket.close();\n                        }\n                        break;\n                    }\n                }\n            });\n            let disposeSocket;\n            let retryWaitTimeoutId;\n            const attemptSocketConnection = () => {\n                if (disposeSocket) {\n                    disposeSocket();\n                }\n                state = { __type: 'connecting', associationKeypair };\n                if (connectionStartTime === undefined) {\n                    connectionStartTime = Date.now();\n                }\n                socket = new WebSocket(websocketURL, [WEBSOCKET_PROTOCOL]);\n                socket.addEventListener('open', handleOpen);\n                socket.addEventListener('close', handleClose);\n                socket.addEventListener('error', handleError);\n                socket.addEventListener('message', handleMessage);\n                disposeSocket = () => {\n                    window.clearTimeout(retryWaitTimeoutId);\n                    socket.removeEventListener('open', handleOpen);\n                    socket.removeEventListener('close', handleClose);\n                    socket.removeEventListener('error', handleError);\n                    socket.removeEventListener('message', handleMessage);\n                };\n            };\n            attemptSocketConnection();\n        });\n    });\n}\n\n\n\n// EXTERNAL MODULE: ./node_modules/bs58/index.js\nvar bs58 = __webpack_require__(7191);\n;// CONCATENATED MODULE: ./node_modules/@solana-mobile/mobile-wallet-adapter-protocol-web3js/lib/esm/index.js\n\n\n\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nfunction esm_awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction fromUint8Array(byteArray) {\n    return window.btoa(String.fromCharCode.call(null, ...byteArray));\n}\nfunction toUint8Array(base64EncodedByteArray) {\n    return new Uint8Array(window\n        .atob(base64EncodedByteArray)\n        .split('')\n        .map((c) => c.charCodeAt(0)));\n}\n\nfunction getPayloadFromTransaction(transaction) {\n    const serializedTransaction = 'version' in transaction\n        ? transaction.serialize()\n        : transaction.serialize({\n            requireAllSignatures: false,\n            verifySignatures: false,\n        });\n    const payload = fromUint8Array(serializedTransaction);\n    return payload;\n}\nfunction getTransactionFromWireMessage(byteArray) {\n    const numSignatures = byteArray[0];\n    const messageOffset = numSignatures * index_browser_esm.SIGNATURE_LENGTH_IN_BYTES + 1;\n    const version = index_browser_esm.VersionedMessage.deserializeMessageVersion(byteArray.slice(messageOffset, byteArray.length));\n    if (version === 'legacy') {\n        return index_browser_esm.Transaction.from(byteArray);\n    }\n    else {\n        return index_browser_esm.VersionedTransaction.deserialize(byteArray);\n    }\n}\nfunction esm_transact(callback, config) {\n    return esm_awaiter(this, void 0, void 0, function* () {\n        const augmentedCallback = (wallet) => {\n            const augmentedAPI = new Proxy({}, {\n                get(target, p) {\n                    if (target[p] == null) {\n                        switch (p) {\n                            case 'signAndSendTransactions':\n                                target[p] = function (_a) {\n                                    var { minContextSlot, commitment, skipPreflight, maxRetries, waitForCommitmentToSendNextTransaction, transactions } = _a, rest = __rest(_a, [\"minContextSlot\", \"commitment\", \"skipPreflight\", \"maxRetries\", \"waitForCommitmentToSendNextTransaction\", \"transactions\"]);\n                                    return esm_awaiter(this, void 0, void 0, function* () {\n                                        const payloads = transactions.map(getPayloadFromTransaction);\n                                        const options = {\n                                            min_context_slot: minContextSlot,\n                                            commitment: commitment,\n                                            skip_preflight: skipPreflight,\n                                            max_retries: maxRetries,\n                                            wait_for_commitment_to_send_next_transaction: waitForCommitmentToSendNextTransaction\n                                        };\n                                        const { signatures: base64EncodedSignatures } = yield wallet.signAndSendTransactions(Object.assign(Object.assign(Object.assign({}, rest), (Object.values(options).some(element => element != null)\n                                            ? { options: options }\n                                            : null)), { payloads }));\n                                        const signatures = base64EncodedSignatures.map(toUint8Array).map(bs58.encode);\n                                        return signatures;\n                                    });\n                                };\n                                break;\n                            case 'signMessages':\n                                target[p] = function (_a) {\n                                    var { payloads } = _a, rest = __rest(_a, [\"payloads\"]);\n                                    return esm_awaiter(this, void 0, void 0, function* () {\n                                        const base64EncodedPayloads = payloads.map(fromUint8Array);\n                                        const { signed_payloads: base64EncodedSignedMessages } = yield wallet.signMessages(Object.assign(Object.assign({}, rest), { payloads: base64EncodedPayloads }));\n                                        const signedMessages = base64EncodedSignedMessages.map(toUint8Array);\n                                        return signedMessages;\n                                    });\n                                };\n                                break;\n                            case 'signTransactions':\n                                target[p] = function (_a) {\n                                    var { transactions } = _a, rest = __rest(_a, [\"transactions\"]);\n                                    return esm_awaiter(this, void 0, void 0, function* () {\n                                        const payloads = transactions.map(getPayloadFromTransaction);\n                                        const { signed_payloads: base64EncodedCompiledTransactions } = yield wallet.signTransactions(Object.assign(Object.assign({}, rest), { payloads }));\n                                        const compiledTransactions = base64EncodedCompiledTransactions.map(toUint8Array);\n                                        const signedTransactions = compiledTransactions.map(getTransactionFromWireMessage);\n                                        return signedTransactions;\n                                    });\n                                };\n                                break;\n                            default: {\n                                target[p] = wallet[p];\n                                break;\n                            }\n                        }\n                    }\n                    return target[p];\n                },\n                defineProperty() {\n                    return false;\n                },\n                deleteProperty() {\n                    return false;\n                },\n            });\n            return callback(augmentedAPI);\n        };\n        return yield transact(augmentedCallback, config);\n    });\n}\n\n\n\n;// CONCATENATED MODULE: ./node_modules/@solana-mobile/wallet-adapter-mobile/lib/esm/index.js\n\n\n\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction lib_esm_awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\n\nfunction esm_toUint8Array(base64EncodedByteArray) {\n    return new Uint8Array(window\n        .atob(base64EncodedByteArray)\n        .split('')\n        .map((c) => c.charCodeAt(0)));\n}\n\nfunction getIsSupported() {\n    return (typeof window !== 'undefined' &&\n        window.isSecureContext &&\n        typeof document !== 'undefined' &&\n        /android/i.test(navigator.userAgent));\n}\n\nconst SolanaMobileWalletAdapterWalletName = 'Mobile Wallet Adapter';\nconst SIGNATURE_LENGTH_IN_BYTES = 64;\nfunction getPublicKeyFromAddress(address) {\n    const publicKeyByteArray = esm_toUint8Array(address);\n    return new index_browser_esm.PublicKey(publicKeyByteArray);\n}\nfunction esm_isVersionedTransaction(transaction) {\n    return 'version' in transaction;\n}\nclass SolanaMobileWalletAdapter extends BaseSignInMessageSignerWalletAdapter {\n    constructor(config) {\n        var _a;\n        super();\n        this.supportedTransactionVersions = new Set(\n        // FIXME(#244): We can't actually know what versions are supported until we know which wallet we're talking to.\n        ['legacy', 0]);\n        this.name = SolanaMobileWalletAdapterWalletName;\n        this.url = 'https://solanamobile.com/wallets';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjI4IiB3aWR0aD0iMjgiIHZpZXdCb3g9Ii0zIDAgMjggMjgiIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyI+PGcgZmlsbD0iI0RDQjhGRiI+PHBhdGggZD0iTTE3LjQgMTcuNEgxNXYyLjRoMi40di0yLjRabTEuMi05LjZoLTIuNHYyLjRoMi40VjcuOFoiLz48cGF0aCBkPSJNMjEuNiAzVjBoLTIuNHYzaC0zLjZWMGgtMi40djNoLTIuNHY2LjZINC41YTIuMSAyLjEgMCAxIDEgMC00LjJoMi43VjNINC41QTQuNSA0LjUgMCAwIDAgMCA3LjVWMjRoMjEuNnYtNi42aC0yLjR2NC4ySDIuNFYxMS41Yy41LjMgMS4yLjQgMS44LjVoNy41QTYuNiA2LjYgMCAwIDAgMjQgOVYzaC0yLjRabTAgNS43YTQuMiA0LjIgMCAxIDEtOC40IDBWNS40aDguNHYzLjNaIi8+PC9nPjwvc3ZnPg==';\n        this._connecting = false;\n        /**\n         * Every time the connection is recycled in some way (eg. `disconnect()` is called)\n         * increment this and use it to make sure that `transact` calls from the previous\n         * 'generation' don't continue to do work and throw exceptions.\n         */\n        this._connectionGeneration = 0;\n        this._readyState = getIsSupported() ? WalletReadyState.Loadable : WalletReadyState.Unsupported;\n        this._authorizationResultCache = config.authorizationResultCache;\n        this._addressSelector = config.addressSelector;\n        this._appIdentity = config.appIdentity;\n        this._chain = (_a = config.chain) !== null && _a !== void 0 ? _a : config.cluster;\n        this._onWalletNotFound = config.onWalletNotFound;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            this._authorizationResultCache.get().then((authorizationResult) => {\n                if (authorizationResult) {\n                    // Having a prior authorization result is, right now, the best\n                    // indication that a mobile wallet is installed. There is no API\n                    // we can use to test for whether the association URI is supported.\n                    this.declareWalletAsInstalled();\n                }\n            });\n        }\n    }\n    get publicKey() {\n        if (this._publicKey == null && this._selectedAddress != null) {\n            try {\n                this._publicKey = getPublicKeyFromAddress(this._selectedAddress);\n            }\n            catch (e) {\n                throw new WalletPublicKeyError((e instanceof Error && (e === null || e === void 0 ? void 0 : e.message)) || 'Unknown error', e);\n            }\n        }\n        return this._publicKey ? this._publicKey : null;\n    }\n    get connected() {\n        return !!this._authorizationResult;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    declareWalletAsInstalled() {\n        if (this._readyState !== WalletReadyState.Installed) {\n            this.emit('readyStateChange', (this._readyState = WalletReadyState.Installed));\n        }\n    }\n    runWithGuard(callback) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            try {\n                return yield callback();\n            }\n            catch (e) {\n                this.emit('error', e);\n                throw e;\n            }\n        });\n    }\n    /** @deprecated Use `autoConnect()` instead. */\n    autoConnect_DO_NOT_USE_OR_YOU_WILL_BE_FIRED() {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.autoConnect();\n        });\n    }\n    autoConnect() {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            if (this.connecting || this.connected) {\n                return;\n            }\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    const cachedAuthorizationResult = yield this._authorizationResultCache.get();\n                    if (cachedAuthorizationResult) {\n                        // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                        this.handleAuthorizationResult(cachedAuthorizationResult);\n                    }\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n    connect() {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            if (this.connecting || this.connected) {\n                return;\n            }\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    yield this.performAuthorization();\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n    performAuthorization(signInPayload) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            try {\n                const cachedAuthorizationResult = yield this._authorizationResultCache.get();\n                if (cachedAuthorizationResult) {\n                    // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                    this.handleAuthorizationResult(cachedAuthorizationResult);\n                    return cachedAuthorizationResult;\n                }\n                return yield this.transact((wallet) => lib_esm_awaiter(this, void 0, void 0, function* () {\n                    const authorizationResult = yield wallet.authorize({\n                        chain: this._chain,\n                        identity: this._appIdentity,\n                        sign_in_payload: signInPayload,\n                    });\n                    // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                    Promise.all([\n                        this._authorizationResultCache.set(authorizationResult),\n                        this.handleAuthorizationResult(authorizationResult),\n                    ]);\n                    return authorizationResult;\n                }));\n            }\n            catch (e) {\n                throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n            }\n        });\n    }\n    handleAuthorizationResult(authorizationResult) {\n        var _a;\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            const didPublicKeysChange = \n            // Case 1: We started from having no authorization.\n            this._authorizationResult == null ||\n                // Case 2: The number of authorized accounts changed.\n                ((_a = this._authorizationResult) === null || _a === void 0 ? void 0 : _a.accounts.length) !== authorizationResult.accounts.length ||\n                // Case 3: The new list of addresses isn't exactly the same as the old list, in the same order.\n                this._authorizationResult.accounts.some((account, ii) => account.address !== authorizationResult.accounts[ii].address);\n            this._authorizationResult = authorizationResult;\n            this.declareWalletAsInstalled();\n            if (didPublicKeysChange) {\n                const nextSelectedAddress = yield this._addressSelector.select(authorizationResult.accounts.map(({ address }) => address));\n                if (nextSelectedAddress !== this._selectedAddress) {\n                    this._selectedAddress = nextSelectedAddress;\n                    delete this._publicKey;\n                    this.emit('connect', \n                    // Having just set `this._selectedAddress`, `this.publicKey` is definitely non-null\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    this.publicKey);\n                }\n            }\n        });\n    }\n    performReauthorization(wallet, authToken) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            try {\n                const authorizationResult = yield wallet.authorize({\n                    auth_token: authToken,\n                    identity: this._appIdentity,\n                });\n                // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n                Promise.all([\n                    this._authorizationResultCache.set(authorizationResult),\n                    this.handleAuthorizationResult(authorizationResult),\n                ]);\n            }\n            catch (e) {\n                this.disconnect();\n                throw new WalletDisconnectedError((e instanceof Error && (e === null || e === void 0 ? void 0 : e.message)) || 'Unknown error', e);\n            }\n        });\n    }\n    disconnect() {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            this._authorizationResultCache.clear(); // TODO: Evaluate whether there's any threat to not `awaiting` this expression\n            this._connecting = false;\n            this._connectionGeneration++;\n            delete this._authorizationResult;\n            delete this._publicKey;\n            delete this._selectedAddress;\n            this.emit('disconnect');\n        });\n    }\n    transact(callback) {\n        var _a;\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            const walletUriBase = (_a = this._authorizationResult) === null || _a === void 0 ? void 0 : _a.wallet_uri_base;\n            const config = walletUriBase ? { baseUri: walletUriBase } : undefined;\n            const currentConnectionGeneration = this._connectionGeneration;\n            try {\n                return yield esm_transact(callback, config);\n            }\n            catch (e) {\n                if (this._connectionGeneration !== currentConnectionGeneration) {\n                    yield new Promise(() => { }); // Never resolve.\n                }\n                if (e instanceof Error &&\n                    e.name === 'SolanaMobileWalletAdapterError' &&\n                    e.code === 'ERROR_WALLET_NOT_FOUND') {\n                    yield this._onWalletNotFound(this);\n                }\n                throw e;\n            }\n        });\n    }\n    assertIsAuthorized() {\n        if (!this._authorizationResult || !this._selectedAddress)\n            throw new WalletNotConnectedError();\n        return {\n            authToken: this._authorizationResult.auth_token,\n            selectedAddress: this._selectedAddress,\n        };\n    }\n    performSignTransactions(transactions) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            const { authToken } = this.assertIsAuthorized();\n            try {\n                return yield this.transact((wallet) => lib_esm_awaiter(this, void 0, void 0, function* () {\n                    yield this.performReauthorization(wallet, authToken);\n                    const signedTransactions = yield wallet.signTransactions({\n                        transactions,\n                    });\n                    return signedTransactions;\n                }));\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error === null || error === void 0 ? void 0 : error.message, error);\n            }\n        });\n    }\n    sendTransaction(transaction, connection, options) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                const { authToken } = this.assertIsAuthorized();\n                const minContextSlot = options === null || options === void 0 ? void 0 : options.minContextSlot;\n                try {\n                    return yield this.transact((wallet) => lib_esm_awaiter(this, void 0, void 0, function* () {\n                        function getTargetCommitment() {\n                            let targetCommitment;\n                            switch (connection.commitment) {\n                                case 'confirmed':\n                                case 'finalized':\n                                case 'processed':\n                                    targetCommitment = connection.commitment;\n                                    break;\n                                default:\n                                    targetCommitment = 'finalized';\n                            }\n                            let targetPreflightCommitment;\n                            switch (options === null || options === void 0 ? void 0 : options.preflightCommitment) {\n                                case 'confirmed':\n                                case 'finalized':\n                                case 'processed':\n                                    targetPreflightCommitment = options.preflightCommitment;\n                                    break;\n                                case undefined:\n                                    targetPreflightCommitment = targetCommitment;\n                                    break;\n                                default:\n                                    targetPreflightCommitment = 'finalized';\n                            }\n                            const preflightCommitmentScore = targetPreflightCommitment === 'finalized'\n                                ? 2\n                                : targetPreflightCommitment === 'confirmed'\n                                    ? 1\n                                    : 0;\n                            const targetCommitmentScore = targetCommitment === 'finalized' ? 2 : targetCommitment === 'confirmed' ? 1 : 0;\n                            return preflightCommitmentScore < targetCommitmentScore\n                                ? targetPreflightCommitment\n                                : targetCommitment;\n                        }\n                        const [capabilities, _1, _2] = yield Promise.all([\n                            wallet.getCapabilities(),\n                            this.performReauthorization(wallet, authToken),\n                            esm_isVersionedTransaction(transaction)\n                                ? null\n                                : /**\n                                   * Unlike versioned transactions, legacy `Transaction` objects\n                                   * may not have an associated `feePayer` or `recentBlockhash`.\n                                   * This code exists to patch them up in case they are missing.\n                                   */\n                                    (() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                                        var _a;\n                                        transaction.feePayer || (transaction.feePayer = (_a = this.publicKey) !== null && _a !== void 0 ? _a : undefined);\n                                        if (transaction.recentBlockhash == null) {\n                                            const { blockhash } = yield connection.getLatestBlockhash({\n                                                commitment: getTargetCommitment(),\n                                            });\n                                            transaction.recentBlockhash = blockhash;\n                                        }\n                                    }))(),\n                        ]);\n                        if (capabilities.supports_sign_and_send_transactions) {\n                            const signatures = yield wallet.signAndSendTransactions({\n                                minContextSlot,\n                                transactions: [transaction],\n                            });\n                            return signatures[0];\n                        }\n                        else {\n                            const [signedTransaction] = yield wallet.signTransactions({\n                                transactions: [transaction],\n                            });\n                            if (esm_isVersionedTransaction(signedTransaction)) {\n                                return yield connection.sendTransaction(signedTransaction);\n                            }\n                            else {\n                                const serializedTransaction = signedTransaction.serialize();\n                                return yield connection.sendRawTransaction(serializedTransaction, Object.assign(Object.assign({}, options), { preflightCommitment: getTargetCommitment() }));\n                            }\n                        }\n                    }));\n                }\n                catch (error) {\n                    throw new WalletSendTransactionError(error === null || error === void 0 ? void 0 : error.message, error);\n                }\n            }));\n        });\n    }\n    signTransaction(transaction) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                const [signedTransaction] = yield this.performSignTransactions([transaction]);\n                return signedTransaction;\n            }));\n        });\n    }\n    signAllTransactions(transactions) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                const signedTransactions = yield this.performSignTransactions(transactions);\n                return signedTransactions;\n            }));\n        });\n    }\n    signMessage(message) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                const { authToken, selectedAddress } = this.assertIsAuthorized();\n                try {\n                    return yield this.transact((wallet) => lib_esm_awaiter(this, void 0, void 0, function* () {\n                        yield this.performReauthorization(wallet, authToken);\n                        const [signedMessage] = yield wallet.signMessages({\n                            addresses: [selectedAddress],\n                            payloads: [message],\n                        });\n                        const signature = signedMessage.slice(-SIGNATURE_LENGTH_IN_BYTES);\n                        return signature;\n                    }));\n                }\n                catch (error) {\n                    throw new WalletSignMessageError(error === null || error === void 0 ? void 0 : error.message, error);\n                }\n            }));\n        });\n    }\n    signIn(input) {\n        return lib_esm_awaiter(this, void 0, void 0, function* () {\n            return yield this.runWithGuard(() => lib_esm_awaiter(this, void 0, void 0, function* () {\n                var _a, _b;\n                if (this._readyState !== WalletReadyState.Installed && this._readyState !== WalletReadyState.Loadable) {\n                    throw new WalletNotReadyError();\n                }\n                this._connecting = true;\n                try {\n                    const authorizationResult = yield this.performAuthorization(Object.assign(Object.assign({}, input), { domain: (_a = input === null || input === void 0 ? void 0 : input.domain) !== null && _a !== void 0 ? _a : window.location.host }));\n                    if (!authorizationResult.sign_in_result) {\n                        throw new Error(\"Sign in failed, no sign in result returned by wallet\");\n                    }\n                    const signedInAddress = authorizationResult.sign_in_result.address;\n                    const signedInAccount = Object.assign(Object.assign({}, (_b = authorizationResult.accounts.find(acc => acc.address == signedInAddress)) !== null && _b !== void 0 ? _b : {\n                        address: signedInAddress\n                    }), { publicKey: esm_toUint8Array(signedInAddress) });\n                    return {\n                        account: signedInAccount,\n                        signedMessage: esm_toUint8Array(authorizationResult.sign_in_result.signed_message),\n                        signature: esm_toUint8Array(authorizationResult.sign_in_result.signature)\n                    };\n                }\n                catch (e) {\n                    throw new WalletConnectionError((e instanceof Error && e.message) || 'Unknown error', e);\n                }\n                finally {\n                    this._connecting = false;\n                }\n            }));\n        });\n    }\n}\n\nfunction createDefaultAddressSelector() {\n    return {\n        select(addresses) {\n            return lib_esm_awaiter(this, void 0, void 0, function* () {\n                return addresses[0];\n            });\n        },\n    };\n}\n\nconst CACHE_KEY = 'SolanaMobileWalletAdapterDefaultAuthorizationCache';\nfunction createDefaultAuthorizationResultCache() {\n    let storage;\n    try {\n        storage = window.localStorage;\n        // eslint-disable-next-line no-empty\n    }\n    catch (_a) { }\n    return {\n        clear() {\n            return lib_esm_awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    storage.removeItem(CACHE_KEY);\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n        get() {\n            return lib_esm_awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    return JSON.parse(storage.getItem(CACHE_KEY)) || undefined;\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n        set(authorizationResult) {\n            return lib_esm_awaiter(this, void 0, void 0, function* () {\n                if (!storage) {\n                    return;\n                }\n                try {\n                    storage.setItem(CACHE_KEY, JSON.stringify(authorizationResult));\n                    // eslint-disable-next-line no-empty\n                }\n                catch (_a) { }\n            });\n        },\n    };\n}\n\nfunction defaultWalletNotFoundHandler(mobileWalletAdapter) {\n    return lib_esm_awaiter(this, void 0, void 0, function* () {\n        if (typeof window !== 'undefined') {\n            window.location.assign(mobileWalletAdapter.url);\n        }\n    });\n}\nfunction createDefaultWalletNotFoundHandler() {\n    return defaultWalletNotFoundHandler;\n}\n\n\n\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-standard-features/lib/esm/signAndSendTransaction.js\nvar signAndSendTransaction = __webpack_require__(3149);\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-standard-features/lib/esm/signTransaction.js\nvar signTransaction = __webpack_require__(8112);\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/features/lib/esm/connect.js\n/** Name of the feature. */\nconst StandardConnect = 'standard:connect';\n/**\n * @deprecated Use {@link StandardConnect} instead.\n *\n * @group Deprecated\n */\nconst Connect = (/* unused pure expression or super */ null && (StandardConnect));\n//# sourceMappingURL=connect.js.map\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/features/lib/esm/events.js\n/** Name of the feature. */\nconst StandardEvents = 'standard:events';\n/**\n * @deprecated Use {@link StandardEvents} instead.\n *\n * @group Deprecated\n */\nconst Events = (/* unused pure expression or super */ null && (StandardEvents));\n//# sourceMappingURL=events.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-base/lib/esm/standard.js\n\n\nfunction isWalletAdapterCompatibleStandardWallet(wallet) {\n    return (StandardConnect in wallet.features &&\n        StandardEvents in wallet.features &&\n        (signAndSendTransaction/* SolanaSignAndSendTransaction */.G in wallet.features || signTransaction/* SolanaSignTransaction */.R in wallet.features));\n}\n//# sourceMappingURL=standard.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-wallet-adapter-base/lib/esm/types.js\n\n/**\n * @deprecated Use `isWalletAdapterCompatibleStandardWallet` from `@solana/wallet-adapter-base` instead.\n *\n * @group Deprecated\n */\nconst isWalletAdapterCompatibleWallet = isWalletAdapterCompatibleStandardWallet;\n//# sourceMappingURL=types.js.map\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-standard-features/lib/esm/signMessage.js\nvar signMessage = __webpack_require__(1999);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-features/lib/esm/signIn.js\n/** Name of the feature. */\nconst SolanaSignIn = 'solana:signIn';\n//# sourceMappingURL=signIn.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-chains/lib/esm/index.js\n/** Solana Mainnet (beta) cluster, e.g. https://api.mainnet-beta.solana.com */\nconst esm_SOLANA_MAINNET_CHAIN = 'solana:mainnet';\n/** Solana Devnet cluster, e.g. https://api.devnet.solana.com */\nconst esm_SOLANA_DEVNET_CHAIN = 'solana:devnet';\n/** Solana Testnet cluster, e.g. https://api.testnet.solana.com */\nconst esm_SOLANA_TESTNET_CHAIN = 'solana:testnet';\n/** Solana Localnet cluster, e.g. http://localhost:8899 */\nconst esm_SOLANA_LOCALNET_CHAIN = 'solana:localnet';\n/** Array of all Solana clusters */\nconst SOLANA_CHAINS = [\n    esm_SOLANA_MAINNET_CHAIN,\n    esm_SOLANA_DEVNET_CHAIN,\n    esm_SOLANA_TESTNET_CHAIN,\n    esm_SOLANA_LOCALNET_CHAIN,\n];\n/**\n * Check if a chain corresponds with one of the Solana clusters.\n */\nfunction isSolanaChain(chain) {\n    return SOLANA_CHAINS.includes(chain);\n}\n//# sourceMappingURL=index.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-util/lib/esm/endpoint.js\n\n/** TODO: docs */\nconst MAINNET_ENDPOINT = 'https://api.mainnet-beta.solana.com';\n/** TODO: docs */\nconst DEVNET_ENDPOINT = 'https://api.devnet.solana.com';\n/** TODO: docs */\nconst TESTNET_ENDPOINT = 'https://api.testnet.solana.com';\n/** TODO: docs */\nconst LOCALNET_ENDPOINT = 'http://localhost:8899';\n/**\n * TODO: docs\n */\nfunction getChainForEndpoint(endpoint) {\n    if (endpoint.includes(MAINNET_ENDPOINT))\n        return esm_SOLANA_MAINNET_CHAIN;\n    if (/\\bdevnet\\b/i.test(endpoint))\n        return esm_SOLANA_DEVNET_CHAIN;\n    if (/\\btestnet\\b/i.test(endpoint))\n        return esm_SOLANA_TESTNET_CHAIN;\n    if (/\\blocalhost\\b/i.test(endpoint) || /\\b127\\.0\\.0\\.1\\b/.test(endpoint))\n        return esm_SOLANA_LOCALNET_CHAIN;\n    return esm_SOLANA_MAINNET_CHAIN;\n}\n/**\n * TODO: docs\n */\nfunction getEndpointForChain(chain, endpoint) {\n    if (endpoint)\n        return endpoint;\n    if (chain === SOLANA_MAINNET_CHAIN)\n        return MAINNET_ENDPOINT;\n    if (chain === SOLANA_DEVNET_CHAIN)\n        return DEVNET_ENDPOINT;\n    if (chain === SOLANA_TESTNET_CHAIN)\n        return TESTNET_ENDPOINT;\n    if (chain === SOLANA_LOCALNET_CHAIN)\n        return LOCALNET_ENDPOINT;\n    return MAINNET_ENDPOINT;\n}\n//# sourceMappingURL=endpoint.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-util/lib/esm/commitment.js\n/**\n * TODO: docs\n */\nfunction getCommitment(commitment) {\n    switch (commitment) {\n        case 'processed':\n        case 'confirmed':\n        case 'finalized':\n        case undefined:\n            return commitment;\n        case 'recent':\n            return 'processed';\n        case 'single':\n        case 'singleGossip':\n            return 'confirmed';\n        case 'max':\n        case 'root':\n            return 'finalized';\n        default:\n            return undefined;\n    }\n}\n//# sourceMappingURL=commitment.js.map\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/features/lib/esm/disconnect.js\n/** Name of the feature. */\nconst StandardDisconnect = 'standard:disconnect';\n/**\n * @deprecated Use {@link StandardDisconnect} instead.\n *\n * @group Deprecated\n */\nconst Disconnect = (/* unused pure expression or super */ null && (StandardDisconnect));\n//# sourceMappingURL=disconnect.js.map\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/wallet/lib/esm/util.js\nvar __classPrivateFieldSet = (undefined && undefined.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (undefined && undefined.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _ReadonlyWalletAccount_address, _ReadonlyWalletAccount_publicKey, _ReadonlyWalletAccount_chains, _ReadonlyWalletAccount_features, _ReadonlyWalletAccount_label, _ReadonlyWalletAccount_icon;\n/**\n * Base implementation of a {@link \"@wallet-standard/base\".WalletAccount} to be used or extended by a\n * {@link \"@wallet-standard/base\".Wallet}.\n *\n * `WalletAccount` properties must be read-only. This class enforces this by making all properties\n * [truly private](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes/Private_class_fields) and\n * read-only, using getters for access, returning copies instead of references, and calling\n * [Object.freeze](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/freeze)\n * on the instance.\n *\n * @group Account\n */\nclass ReadonlyWalletAccount {\n    /**\n     * Create and freeze a read-only account.\n     *\n     * @param account Account to copy properties from.\n     */\n    constructor(account) {\n        _ReadonlyWalletAccount_address.set(this, void 0);\n        _ReadonlyWalletAccount_publicKey.set(this, void 0);\n        _ReadonlyWalletAccount_chains.set(this, void 0);\n        _ReadonlyWalletAccount_features.set(this, void 0);\n        _ReadonlyWalletAccount_label.set(this, void 0);\n        _ReadonlyWalletAccount_icon.set(this, void 0);\n        if (new.target === ReadonlyWalletAccount) {\n            Object.freeze(this);\n        }\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_address, account.address, \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_publicKey, account.publicKey.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_chains, account.chains.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_features, account.features.slice(), \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_label, account.label, \"f\");\n        __classPrivateFieldSet(this, _ReadonlyWalletAccount_icon, account.icon, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.address | WalletAccount::address} */\n    get address() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_address, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.publicKey | WalletAccount::publicKey} */\n    get publicKey() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_publicKey, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.chains | WalletAccount::chains} */\n    get chains() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_chains, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.features | WalletAccount::features} */\n    get features() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_features, \"f\").slice();\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.label | WalletAccount::label} */\n    get label() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_label, \"f\");\n    }\n    /** Implementation of {@link \"@wallet-standard/base\".WalletAccount.icon | WalletAccount::icon} */\n    get icon() {\n        return __classPrivateFieldGet(this, _ReadonlyWalletAccount_icon, \"f\");\n    }\n}\n_ReadonlyWalletAccount_address = new WeakMap(), _ReadonlyWalletAccount_publicKey = new WeakMap(), _ReadonlyWalletAccount_chains = new WeakMap(), _ReadonlyWalletAccount_features = new WeakMap(), _ReadonlyWalletAccount_label = new WeakMap(), _ReadonlyWalletAccount_icon = new WeakMap();\n/**\n * Efficiently compare {@link Indexed} arrays (e.g. `Array` and `Uint8Array`).\n *\n * @param a An array.\n * @param b Another array.\n *\n * @return `true` if the arrays have the same length and elements, `false` otherwise.\n *\n * @group Util\n */\nfunction util_arraysEqual(a, b) {\n    if (a === b)\n        return true;\n    const length = a.length;\n    if (length !== b.length)\n        return false;\n    for (let i = 0; i < length; i++) {\n        if (a[i] !== b[i])\n            return false;\n    }\n    return true;\n}\n/**\n * Efficiently compare byte arrays, using {@link arraysEqual}.\n *\n * @param a A byte array.\n * @param b Another byte array.\n *\n * @return `true` if the byte arrays have the same length and bytes, `false` otherwise.\n *\n * @group Util\n */\nfunction bytesEqual(a, b) {\n    return util_arraysEqual(a, b);\n}\n/**\n * Efficiently concatenate byte arrays without modifying them.\n *\n * @param first  A byte array.\n * @param others Additional byte arrays.\n *\n * @return New byte array containing the concatenation of all the byte arrays.\n *\n * @group Util\n */\nfunction concatBytes(first, ...others) {\n    const length = others.reduce((length, bytes) => length + bytes.length, first.length);\n    const bytes = new Uint8Array(length);\n    bytes.set(first, 0);\n    for (const other of others) {\n        bytes.set(other, bytes.length);\n    }\n    return bytes;\n}\n/**\n * Create a new object with a subset of fields from a source object.\n *\n * @param source Object to pick fields from.\n * @param keys   Names of fields to pick.\n *\n * @return New object with only the picked fields.\n *\n * @group Util\n */\nfunction pick(source, ...keys) {\n    const picked = {};\n    for (const key of keys) {\n        picked[key] = source[key];\n    }\n    return picked;\n}\n/**\n * Call a callback function, catch an error if it throws, and log the error without rethrowing.\n *\n * @param callback Function to call.\n *\n * @group Util\n */\nfunction guard(callback) {\n    try {\n        callback();\n    }\n    catch (error) {\n        console.error(error);\n    }\n}\n//# sourceMappingURL=util.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-wallet-adapter-base/lib/esm/adapter.js\nvar adapter_classPrivateFieldSet = (undefined && undefined.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar adapter_classPrivateFieldGet = (undefined && undefined.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _StandardWalletAdapter_instances, _StandardWalletAdapter_account, _StandardWalletAdapter_publicKey, _StandardWalletAdapter_connecting, _StandardWalletAdapter_disconnecting, _StandardWalletAdapter_off, _StandardWalletAdapter_supportedTransactionVersions, _StandardWalletAdapter_wallet, _StandardWalletAdapter_readyState, _StandardWalletAdapter_connect, _StandardWalletAdapter_connected, _StandardWalletAdapter_disconnected, _StandardWalletAdapter_reset, _StandardWalletAdapter_changed, _StandardWalletAdapter_signTransaction, _StandardWalletAdapter_signAllTransactions, _StandardWalletAdapter_signMessage, _StandardWalletAdapter_signIn;\n\n\n\n\n\n\n\n/** TODO: docs */\nclass StandardWalletAdapter extends BaseWalletAdapter {\n    constructor({ wallet }) {\n        super();\n        _StandardWalletAdapter_instances.add(this);\n        _StandardWalletAdapter_account.set(this, void 0);\n        _StandardWalletAdapter_publicKey.set(this, void 0);\n        _StandardWalletAdapter_connecting.set(this, void 0);\n        _StandardWalletAdapter_disconnecting.set(this, void 0);\n        _StandardWalletAdapter_off.set(this, void 0);\n        _StandardWalletAdapter_supportedTransactionVersions.set(this, void 0);\n        _StandardWalletAdapter_wallet.set(this, void 0);\n        _StandardWalletAdapter_readyState.set(this, typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.Installed);\n        _StandardWalletAdapter_changed.set(this, (properties) => {\n            // If accounts have changed on the wallet, reflect this on the adapter.\n            if ('accounts' in properties) {\n                const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts[0];\n                // If the adapter isn't connected, or is disconnecting, or the first account hasn't changed, do nothing.\n                if (adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\") && !adapter_classPrivateFieldGet(this, _StandardWalletAdapter_disconnecting, \"f\") && account !== adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")) {\n                    // If there's a connected account, connect the adapter. Otherwise, disconnect it.\n                    if (account) {\n                        // Connect the adapter.\n                        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, account);\n                    }\n                    else {\n                        // Emit an error because the wallet spontaneously disconnected.\n                        this.emit('error', new WalletDisconnectedError());\n                        // Disconnect the adapter.\n                        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_disconnected).call(this);\n                    }\n                }\n            }\n            // After reflecting account changes, if features have changed on the wallet, reflect this on the adapter.\n            if ('features' in properties) {\n                adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n            }\n        });\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_wallet, wallet, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_off, adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardEvents].on('change', adapter_classPrivateFieldGet(this, _StandardWalletAdapter_changed, \"f\")), \"f\");\n        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    }\n    get name() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").name;\n    }\n    get url() {\n        return 'https://github.com/solana-labs/wallet-standard';\n    }\n    get icon() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").icon;\n    }\n    get readyState() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_readyState, \"f\");\n    }\n    get publicKey() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_publicKey, \"f\");\n    }\n    get connecting() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_connecting, \"f\");\n    }\n    get supportedTransactionVersions() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_supportedTransactionVersions, \"f\");\n    }\n    get wallet() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\");\n    }\n    get standard() {\n        return true;\n    }\n    destroy() {\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n        const off = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_off, \"f\");\n        if (off) {\n            adapter_classPrivateFieldSet(this, _StandardWalletAdapter_off, null, \"f\");\n            off();\n        }\n    }\n    async autoConnect() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connect).call(this, { silent: true });\n    }\n    async connect() {\n        return adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connect).call(this);\n    }\n    async disconnect() {\n        if (StandardDisconnect in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n            try {\n                adapter_classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, true, \"f\");\n                await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardDisconnect].disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n            finally {\n                adapter_classPrivateFieldSet(this, _StandardWalletAdapter_disconnecting, false, \"f\");\n            }\n        }\n        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_disconnected).call(this);\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n            if (!account)\n                throw new WalletNotConnectedError();\n            let feature;\n            if (signAndSendTransaction/* SolanaSignAndSendTransaction */.G in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n                if (account.features.includes(signAndSendTransaction/* SolanaSignAndSendTransaction */.G)) {\n                    feature = signAndSendTransaction/* SolanaSignAndSendTransaction */.G;\n                }\n                else if (signTransaction/* SolanaSignTransaction */.R in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features &&\n                    account.features.includes(signTransaction/* SolanaSignTransaction */.R)) {\n                    feature = signTransaction/* SolanaSignTransaction */.R;\n                }\n                else {\n                    throw new WalletAccountError();\n                }\n            }\n            else if (signTransaction/* SolanaSignTransaction */.R in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n                if (!account.features.includes(signTransaction/* SolanaSignTransaction */.R))\n                    throw new WalletAccountError();\n                feature = signTransaction/* SolanaSignTransaction */.R;\n            }\n            else {\n                throw new WalletConfigError();\n            }\n            const chain = getChainForEndpoint(connection.rpcEndpoint);\n            if (!account.chains.includes(chain))\n                throw new WalletSendTransactionError();\n            try {\n                const { signers, ...sendOptions } = options;\n                let serializedTransaction;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                    serializedTransaction = transaction.serialize();\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                    serializedTransaction = new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    }));\n                }\n                if (feature === signAndSendTransaction/* SolanaSignAndSendTransaction */.G) {\n                    const [output] = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signAndSendTransaction/* SolanaSignAndSendTransaction */.G].signAndSendTransaction({\n                        account,\n                        chain,\n                        transaction: serializedTransaction,\n                        options: {\n                            preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                            skipPreflight: sendOptions.skipPreflight,\n                            maxRetries: sendOptions.maxRetries,\n                            minContextSlot: sendOptions.minContextSlot,\n                        },\n                    });\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    return bs58.encode(output.signature);\n                }\n                else {\n                    const [output] = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signTransaction/* SolanaSignTransaction */.R].signTransaction({\n                        account,\n                        chain,\n                        transaction: serializedTransaction,\n                        options: {\n                            preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                            minContextSlot: sendOptions.minContextSlot,\n                        },\n                    });\n                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                    return await connection.sendRawTransaction(output.signedTransaction, {\n                        ...sendOptions,\n                        preflightCommitment: getCommitment(sendOptions.preflightCommitment || connection.commitment),\n                    });\n                }\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n_StandardWalletAdapter_account = new WeakMap(), _StandardWalletAdapter_publicKey = new WeakMap(), _StandardWalletAdapter_connecting = new WeakMap(), _StandardWalletAdapter_disconnecting = new WeakMap(), _StandardWalletAdapter_off = new WeakMap(), _StandardWalletAdapter_supportedTransactionVersions = new WeakMap(), _StandardWalletAdapter_wallet = new WeakMap(), _StandardWalletAdapter_readyState = new WeakMap(), _StandardWalletAdapter_changed = new WeakMap(), _StandardWalletAdapter_instances = new WeakSet(), _StandardWalletAdapter_connect = async function _StandardWalletAdapter_connect(input) {\n    try {\n        if (this.connected || this.connecting)\n            return;\n        if (adapter_classPrivateFieldGet(this, _StandardWalletAdapter_readyState, \"f\") !== WalletReadyState.Installed)\n            throw new WalletNotReadyError();\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_connecting, true, \"f\");\n        if (!adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts.length) {\n            try {\n                await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[StandardConnect].connect(input);\n            }\n            catch (error) {\n                throw new WalletConnectionError(error?.message, error);\n            }\n        }\n        const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").accounts[0];\n        if (!account)\n            throw new WalletAccountError();\n        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, account);\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n    finally {\n        adapter_classPrivateFieldSet(this, _StandardWalletAdapter_connecting, false, \"f\");\n    }\n}, _StandardWalletAdapter_connected = function _StandardWalletAdapter_connected(account) {\n    let publicKey;\n    try {\n        // Use account.address instead of account.publicKey since address could be a PDA\n        publicKey = new index_browser_esm.PublicKey(account.address);\n    }\n    catch (error) {\n        throw new WalletPublicKeyError(error?.message, error);\n    }\n    adapter_classPrivateFieldSet(this, _StandardWalletAdapter_account, account, \"f\");\n    adapter_classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, publicKey, \"f\");\n    adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    this.emit('connect', publicKey);\n}, _StandardWalletAdapter_disconnected = function _StandardWalletAdapter_disconnected() {\n    adapter_classPrivateFieldSet(this, _StandardWalletAdapter_account, null, \"f\");\n    adapter_classPrivateFieldSet(this, _StandardWalletAdapter_publicKey, null, \"f\");\n    adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_reset).call(this);\n    this.emit('disconnect');\n}, _StandardWalletAdapter_reset = function _StandardWalletAdapter_reset() {\n    const supportedTransactionVersions = signAndSendTransaction/* SolanaSignAndSendTransaction */.G in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features\n        ? adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signAndSendTransaction/* SolanaSignAndSendTransaction */.G].supportedTransactionVersions\n        : adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signTransaction/* SolanaSignTransaction */.R].supportedTransactionVersions;\n    adapter_classPrivateFieldSet(this, _StandardWalletAdapter_supportedTransactionVersions, util_arraysEqual(supportedTransactionVersions, ['legacy'])\n        ? null\n        : new Set(supportedTransactionVersions), \"f\");\n    if (signTransaction/* SolanaSignTransaction */.R in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features && adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")?.features.includes(signTransaction/* SolanaSignTransaction */.R)) {\n        this.signTransaction = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signTransaction);\n        this.signAllTransactions = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signAllTransactions);\n    }\n    else {\n        delete this.signTransaction;\n        delete this.signAllTransactions;\n    }\n    if (signMessage/* SolanaSignMessage */.g in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features && adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\")?.features.includes(signMessage/* SolanaSignMessage */.g)) {\n        this.signMessage = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signMessage);\n    }\n    else {\n        delete this.signMessage;\n    }\n    if (SolanaSignIn in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features) {\n        this.signIn = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_signIn);\n    }\n    else {\n        delete this.signIn;\n    }\n}, _StandardWalletAdapter_signTransaction = async function _StandardWalletAdapter_signTransaction(transaction) {\n    try {\n        const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(signTransaction/* SolanaSignTransaction */.R in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(signTransaction/* SolanaSignTransaction */.R))\n            throw new WalletAccountError();\n        try {\n            const signedTransactions = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signTransaction/* SolanaSignTransaction */.R].signTransaction({\n                account,\n                transaction: isVersionedTransaction(transaction)\n                    ? transaction.serialize()\n                    : new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    })),\n            });\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const serializedTransaction = signedTransactions[0].signedTransaction;\n            return (isVersionedTransaction(transaction)\n                ? index_browser_esm.VersionedTransaction.deserialize(serializedTransaction)\n                : index_browser_esm.Transaction.from(serializedTransaction));\n        }\n        catch (error) {\n            if (error instanceof WalletError)\n                throw error;\n            throw new WalletSignTransactionError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signAllTransactions = async function _StandardWalletAdapter_signAllTransactions(transactions) {\n    try {\n        const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(signTransaction/* SolanaSignTransaction */.R in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(signTransaction/* SolanaSignTransaction */.R))\n            throw new WalletAccountError();\n        try {\n            const signedTransactions = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signTransaction/* SolanaSignTransaction */.R].signTransaction(...transactions.map((transaction) => ({\n                account,\n                transaction: isVersionedTransaction(transaction)\n                    ? transaction.serialize()\n                    : new Uint8Array(transaction.serialize({\n                        requireAllSignatures: false,\n                        verifySignatures: false,\n                    })),\n            })));\n            return transactions.map((transaction, index) => {\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                const signedTransaction = signedTransactions[index].signedTransaction;\n                return (isVersionedTransaction(transaction)\n                    ? index_browser_esm.VersionedTransaction.deserialize(signedTransaction)\n                    : index_browser_esm.Transaction.from(signedTransaction));\n            });\n        }\n        catch (error) {\n            throw new WalletSignTransactionError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signMessage = async function _StandardWalletAdapter_signMessage(message) {\n    try {\n        const account = adapter_classPrivateFieldGet(this, _StandardWalletAdapter_account, \"f\");\n        if (!account)\n            throw new WalletNotConnectedError();\n        if (!(signMessage/* SolanaSignMessage */.g in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        if (!account.features.includes(signMessage/* SolanaSignMessage */.g))\n            throw new WalletAccountError();\n        try {\n            const signedMessages = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[signMessage/* SolanaSignMessage */.g].signMessage({\n                account,\n                message,\n            });\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            return signedMessages[0].signature;\n        }\n        catch (error) {\n            throw new WalletSignMessageError(error?.message, error);\n        }\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n}, _StandardWalletAdapter_signIn = async function _StandardWalletAdapter_signIn(input = {}) {\n    try {\n        if (!(SolanaSignIn in adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features))\n            throw new WalletConfigError();\n        let output;\n        try {\n            [output] = await adapter_classPrivateFieldGet(this, _StandardWalletAdapter_wallet, \"f\").features[SolanaSignIn].signIn(input);\n        }\n        catch (error) {\n            throw new WalletSignInError(error?.message, error);\n        }\n        if (!output)\n            throw new WalletSignInError();\n        adapter_classPrivateFieldGet(this, _StandardWalletAdapter_instances, \"m\", _StandardWalletAdapter_connected).call(this, output.account);\n        return output;\n    }\n    catch (error) {\n        this.emit('error', error);\n        throw error;\n    }\n};\n//# sourceMappingURL=adapter.js.map\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/app/lib/esm/wallets.js\nvar wallets_classPrivateFieldSet = (undefined && undefined.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar wallets_classPrivateFieldGet = (undefined && undefined.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _AppReadyEvent_detail;\nlet wallets = undefined;\nconst registered = new Set();\nconst listeners = {};\n/**\n * Get an API for {@link Wallets.get | getting}, {@link Wallets.on | listening for}, and\n * {@link Wallets.register | registering} {@link \"@wallet-standard/base\".Wallet | Wallets}.\n *\n * When called for the first time --\n *\n * This dispatches a {@link \"@wallet-standard/base\".WindowAppReadyEvent} to notify each Wallet that the app is ready\n * to register it.\n *\n * This also adds a listener for {@link \"@wallet-standard/base\".WindowRegisterWalletEvent} to listen for a notification\n * from each Wallet that the Wallet is ready to be registered by the app.\n *\n * This combination of event dispatch and listener guarantees that each Wallet will be registered synchronously as soon\n * as the app is ready whether the app loads before or after each Wallet.\n *\n * @return API for getting, listening for, and registering Wallets.\n *\n * @group App\n */\nfunction getWallets() {\n    if (wallets)\n        return wallets;\n    wallets = Object.freeze({ register, get, on });\n    if (typeof window === 'undefined')\n        return wallets;\n    const api = Object.freeze({ register });\n    try {\n        window.addEventListener('wallet-standard:register-wallet', ({ detail: callback }) => callback(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:register-wallet event listener could not be added\\n', error);\n    }\n    try {\n        window.dispatchEvent(new AppReadyEvent(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:app-ready event could not be dispatched\\n', error);\n    }\n    return wallets;\n}\nfunction register(...wallets) {\n    // Filter out wallets that have already been registered.\n    // This prevents the same wallet from being registered twice, but it also prevents wallets from being\n    // unregistered by reusing a reference to the wallet to obtain the unregister function for it.\n    wallets = wallets.filter((wallet) => !registered.has(wallet));\n    // If there are no new wallets to register, just return a no-op unregister function.\n    // eslint-disable-next-line @typescript-eslint/no-empty-function\n    if (!wallets.length)\n        return () => { };\n    wallets.forEach((wallet) => registered.add(wallet));\n    listeners['register']?.forEach((listener) => wallets_guard(() => listener(...wallets)));\n    // Return a function that unregisters the registered wallets.\n    return function unregister() {\n        wallets.forEach((wallet) => registered.delete(wallet));\n        listeners['unregister']?.forEach((listener) => wallets_guard(() => listener(...wallets)));\n    };\n}\nfunction get() {\n    return [...registered];\n}\nfunction on(event, listener) {\n    listeners[event]?.push(listener) || (listeners[event] = [listener]);\n    // Return a function that removes the event listener.\n    return function off() {\n        listeners[event] = listeners[event]?.filter((existingListener) => listener !== existingListener);\n    };\n}\nfunction wallets_guard(callback) {\n    try {\n        callback();\n    }\n    catch (error) {\n        console.error(error);\n    }\n}\nclass AppReadyEvent extends Event {\n    constructor(api) {\n        super('wallet-standard:app-ready', {\n            bubbles: false,\n            cancelable: false,\n            composed: false,\n        });\n        _AppReadyEvent_detail.set(this, void 0);\n        wallets_classPrivateFieldSet(this, _AppReadyEvent_detail, api, \"f\");\n    }\n    get detail() {\n        return wallets_classPrivateFieldGet(this, _AppReadyEvent_detail, \"f\");\n    }\n    get type() {\n        return 'wallet-standard:app-ready';\n    }\n    /** @deprecated */\n    preventDefault() {\n        throw new Error('preventDefault cannot be called');\n    }\n    /** @deprecated */\n    stopImmediatePropagation() {\n        throw new Error('stopImmediatePropagation cannot be called');\n    }\n    /** @deprecated */\n    stopPropagation() {\n        throw new Error('stopPropagation cannot be called');\n    }\n}\n_AppReadyEvent_detail = new WeakMap();\n/**\n * @deprecated Use {@link getWallets} instead.\n *\n * @group Deprecated\n */\nfunction DEPRECATED_getWallets() {\n    if (wallets)\n        return wallets;\n    wallets = getWallets();\n    if (typeof window === 'undefined')\n        return wallets;\n    const callbacks = window.navigator.wallets || [];\n    if (!Array.isArray(callbacks)) {\n        console.error('window.navigator.wallets is not an array');\n        return wallets;\n    }\n    const { register } = wallets;\n    const push = (...callbacks) => callbacks.forEach((callback) => wallets_guard(() => callback({ register })));\n    try {\n        Object.defineProperty(window.navigator, 'wallets', {\n            value: Object.freeze({ push }),\n        });\n    }\n    catch (error) {\n        console.error('window.navigator.wallets could not be set');\n        return wallets;\n    }\n    push(...callbacks);\n    return wallets;\n}\n//# sourceMappingURL=wallets.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-standard-wallet-adapter-react/lib/esm/useStandardWalletAdapters.js\n\n\n\nfunction useStandardWalletAdapters(adapters) {\n    const warnings = useStandardWalletAdapters_useConstant(() => new Set());\n    const { get, on } = useStandardWalletAdapters_useConstant(() => DEPRECATED_getWallets());\n    const [standardAdapters, setStandardAdapters] = (0,react.useState)(() => wrapWalletsWithAdapters(get()));\n    (0,react.useEffect)(() => {\n        const listeners = [\n            on('register', (...wallets) => setStandardAdapters((standardAdapters) => [...standardAdapters, ...wrapWalletsWithAdapters(wallets)])),\n            on('unregister', (...wallets) => setStandardAdapters((standardAdapters) => standardAdapters.filter((standardAdapter) => wallets.some((wallet) => wallet === standardAdapter.wallet)))),\n        ];\n        return () => listeners.forEach((off) => off());\n    }, [on]);\n    const prevStandardAdapters = usePrevious(standardAdapters);\n    (0,react.useEffect)(() => {\n        if (!prevStandardAdapters)\n            return;\n        const currentAdapters = new Set(standardAdapters);\n        const removedAdapters = new Set(prevStandardAdapters.filter((previousAdapter) => !currentAdapters.has(previousAdapter)));\n        removedAdapters.forEach((adapter) => adapter.destroy());\n    }, [prevStandardAdapters, standardAdapters]);\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n    (0,react.useEffect)(() => () => standardAdapters.forEach((adapter) => adapter.destroy()), []);\n    return (0,react.useMemo)(() => [\n        ...standardAdapters,\n        ...adapters.filter(({ name }) => {\n            if (standardAdapters.some((standardAdapter) => standardAdapter.name === name)) {\n                if (!warnings.has(name)) {\n                    warnings.add(name);\n                    console.warn(`${name} was registered as a Standard Wallet. The Wallet Adapter for ${name} can be removed from your app.`);\n                }\n                return false;\n            }\n            return true;\n        }),\n    ], [standardAdapters, adapters, warnings]);\n}\nfunction useStandardWalletAdapters_useConstant(fn) {\n    const ref = (0,react.useRef)();\n    if (!ref.current) {\n        ref.current = { value: fn() };\n    }\n    return ref.current.value;\n}\nfunction usePrevious(state) {\n    const ref = (0,react.useRef)();\n    (0,react.useEffect)(() => {\n        ref.current = state;\n    });\n    return ref.current;\n}\nfunction wrapWalletsWithAdapters(wallets) {\n    return wallets.filter(isWalletAdapterCompatibleWallet).map((wallet) => new StandardWalletAdapter({ wallet }));\n}\n//# sourceMappingURL=useStandardWalletAdapters.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/getEnvironment.js\n\n\nvar Environment;\n(function (Environment) {\n    Environment[Environment[\"DESKTOP_WEB\"] = 0] = \"DESKTOP_WEB\";\n    Environment[Environment[\"MOBILE_WEB\"] = 1] = \"MOBILE_WEB\";\n})(Environment || (Environment = {}));\nfunction isWebView(userAgentString) {\n    return /(WebView|Version\\/.+(Chrome)\\/(\\d+)\\.(\\d+)\\.(\\d+)\\.(\\d+)|; wv\\).+(Chrome)\\/(\\d+)\\.(\\d+)\\.(\\d+)\\.(\\d+))/i.test(userAgentString);\n}\nfunction getEnvironment({ adapters, userAgentString }) {\n    if (adapters.some((adapter) => adapter.name !== SolanaMobileWalletAdapterWalletName &&\n        adapter.readyState === WalletReadyState.Installed)) {\n        /**\n         * There are only two ways a browser extension adapter should be able to reach `Installed` status:\n         *\n         *     1. Its browser extension is installed.\n         *     2. The app is running on a mobile wallet's in-app browser.\n         *\n         * In either case, we consider the environment to be desktop-like.\n         */\n        return Environment.DESKTOP_WEB;\n    }\n    if (userAgentString &&\n        // Step 1: Check whether we're on a platform that supports MWA at all.\n        /android/i.test(userAgentString) &&\n        // Step 2: Determine that we are *not* running in a WebView.\n        !isWebView(userAgentString)) {\n        return Environment.MOBILE_WEB;\n    }\n    else {\n        return Environment.DESKTOP_WEB;\n    }\n}\n//# sourceMappingURL=getEnvironment.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/getInferredClusterFromEndpoint.js\nfunction getInferredClusterFromEndpoint(endpoint) {\n    if (!endpoint) {\n        return 'mainnet-beta';\n    }\n    if (/devnet/i.test(endpoint)) {\n        return 'devnet';\n    }\n    else if (/testnet/i.test(endpoint)) {\n        return 'testnet';\n    }\n    else {\n        return 'mainnet-beta';\n    }\n}\n//# sourceMappingURL=getInferredClusterFromEndpoint.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/useLocalStorage.js\n\nfunction useLocalStorage_useLocalStorage(key, defaultState) {\n    const state = (0,react.useState)(() => {\n        try {\n            const value = localStorage.getItem(key);\n            if (value)\n                return JSON.parse(value);\n        }\n        catch (error) {\n            if (typeof window !== 'undefined') {\n                console.error(error);\n            }\n        }\n        return defaultState;\n    });\n    const value = state[0];\n    const isFirstRenderRef = (0,react.useRef)(true);\n    (0,react.useEffect)(() => {\n        if (isFirstRenderRef.current) {\n            isFirstRenderRef.current = false;\n            return;\n        }\n        try {\n            if (value === null) {\n                localStorage.removeItem(key);\n            }\n            else {\n                localStorage.setItem(key, JSON.stringify(value));\n            }\n        }\n        catch (error) {\n            if (typeof window !== 'undefined') {\n                console.error(error);\n            }\n        }\n    }, [value, key]);\n    return state;\n}\n//# sourceMappingURL=useLocalStorage.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/errors.js\n\nclass WalletNotSelectedError extends WalletError {\n    constructor() {\n        super(...arguments);\n        this.name = 'WalletNotSelectedError';\n    }\n}\n//# sourceMappingURL=errors.js.map\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/useWallet.js\nvar useWallet = __webpack_require__(4306);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/WalletProviderBase.js\n\n\n\n\nfunction WalletProviderBase({ children, wallets: adapters, adapter, isUnloadingRef, onAutoConnectRequest, onConnectError, onError, onSelectWallet, }) {\n    const isConnectingRef = (0,react.useRef)(false);\n    const [connecting, setConnecting] = (0,react.useState)(false);\n    const isDisconnectingRef = (0,react.useRef)(false);\n    const [disconnecting, setDisconnecting] = (0,react.useState)(false);\n    const [publicKey, setPublicKey] = (0,react.useState)(() => adapter?.publicKey ?? null);\n    const [connected, setConnected] = (0,react.useState)(() => adapter?.connected ?? false);\n    /**\n     * Store the error handlers as refs so that a change in the\n     * custom error handler does not recompute other dependencies.\n     */\n    const onErrorRef = (0,react.useRef)(onError);\n    (0,react.useEffect)(() => {\n        onErrorRef.current = onError;\n        return () => {\n            onErrorRef.current = undefined;\n        };\n    }, [onError]);\n    const handleErrorRef = (0,react.useRef)((error, adapter) => {\n        if (!isUnloadingRef.current) {\n            if (onErrorRef.current) {\n                onErrorRef.current(error, adapter);\n            }\n            else {\n                console.error(error, adapter);\n                if (error instanceof WalletNotReadyError && typeof window !== 'undefined' && adapter) {\n                    window.open(adapter.url, '_blank');\n                }\n            }\n        }\n        return error;\n    });\n    // Wrap adapters to conform to the `Wallet` interface\n    const [wallets, setWallets] = (0,react.useState)(() => adapters\n        .map((adapter) => ({\n        adapter,\n        readyState: adapter.readyState,\n    }))\n        .filter(({ readyState }) => readyState !== WalletReadyState.Unsupported));\n    // When the adapters change, start to listen for changes to their `readyState`\n    (0,react.useEffect)(() => {\n        // When the adapters change, wrap them to conform to the `Wallet` interface\n        setWallets((wallets) => adapters\n            .map((adapter, index) => {\n            const wallet = wallets[index];\n            // If the wallet hasn't changed, return the same instance\n            return wallet && wallet.adapter === adapter && wallet.readyState === adapter.readyState\n                ? wallet\n                : {\n                    adapter: adapter,\n                    readyState: adapter.readyState,\n                };\n        })\n            .filter(({ readyState }) => readyState !== WalletReadyState.Unsupported));\n        function handleReadyStateChange(readyState) {\n            setWallets((prevWallets) => {\n                const index = prevWallets.findIndex(({ adapter }) => adapter === this);\n                if (index === -1)\n                    return prevWallets;\n                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n                const { adapter } = prevWallets[index];\n                return [\n                    ...prevWallets.slice(0, index),\n                    { adapter, readyState },\n                    ...prevWallets.slice(index + 1),\n                ].filter(({ readyState }) => readyState !== WalletReadyState.Unsupported);\n            });\n        }\n        adapters.forEach((adapter) => adapter.on('readyStateChange', handleReadyStateChange, adapter));\n        return () => {\n            adapters.forEach((adapter) => adapter.off('readyStateChange', handleReadyStateChange, adapter));\n        };\n    }, [adapter, adapters]);\n    const wallet = (0,react.useMemo)(() => wallets.find((wallet) => wallet.adapter === adapter) ?? null, [adapter, wallets]);\n    // Setup and teardown event listeners when the adapter changes\n    (0,react.useEffect)(() => {\n        if (!adapter)\n            return;\n        const handleConnect = (publicKey) => {\n            setPublicKey(publicKey);\n            isConnectingRef.current = false;\n            setConnecting(false);\n            setConnected(true);\n            isDisconnectingRef.current = false;\n            setDisconnecting(false);\n        };\n        const handleDisconnect = () => {\n            if (isUnloadingRef.current)\n                return;\n            setPublicKey(null);\n            isConnectingRef.current = false;\n            setConnecting(false);\n            setConnected(false);\n            isDisconnectingRef.current = false;\n            setDisconnecting(false);\n        };\n        const handleError = (error) => {\n            handleErrorRef.current(error, adapter);\n        };\n        adapter.on('connect', handleConnect);\n        adapter.on('disconnect', handleDisconnect);\n        adapter.on('error', handleError);\n        return () => {\n            adapter.off('connect', handleConnect);\n            adapter.off('disconnect', handleDisconnect);\n            adapter.off('error', handleError);\n            handleDisconnect();\n        };\n    }, [adapter, isUnloadingRef]);\n    // When the adapter changes, clear the `autoConnect` tracking flag\n    const didAttemptAutoConnectRef = (0,react.useRef)(false);\n    (0,react.useEffect)(() => {\n        return () => {\n            didAttemptAutoConnectRef.current = false;\n        };\n    }, [adapter]);\n    // If auto-connect is enabled, request to connect when the adapter changes and is ready\n    (0,react.useEffect)(() => {\n        if (didAttemptAutoConnectRef.current ||\n            isConnectingRef.current ||\n            connected ||\n            !onAutoConnectRequest ||\n            !(wallet?.readyState === WalletReadyState.Installed || wallet?.readyState === WalletReadyState.Loadable))\n            return;\n        isConnectingRef.current = true;\n        setConnecting(true);\n        didAttemptAutoConnectRef.current = true;\n        (async function () {\n            try {\n                await onAutoConnectRequest();\n            }\n            catch {\n                onConnectError();\n                // Drop the error. It will be caught by `handleError` anyway.\n            }\n            finally {\n                setConnecting(false);\n                isConnectingRef.current = false;\n            }\n        })();\n    }, [connected, onAutoConnectRequest, onConnectError, wallet]);\n    // Send a transaction using the provided connection\n    const sendTransaction = (0,react.useCallback)(async (transaction, connection, options) => {\n        if (!adapter)\n            throw handleErrorRef.current(new WalletNotSelectedError());\n        if (!connected)\n            throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n        return await adapter.sendTransaction(transaction, connection, options);\n    }, [adapter, connected]);\n    // Sign a transaction if the wallet supports it\n    const signTransaction = (0,react.useMemo)(() => adapter && 'signTransaction' in adapter\n        ? async (transaction) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signTransaction(transaction);\n        }\n        : undefined, [adapter, connected]);\n    // Sign multiple transactions if the wallet supports it\n    const signAllTransactions = (0,react.useMemo)(() => adapter && 'signAllTransactions' in adapter\n        ? async (transactions) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signAllTransactions(transactions);\n        }\n        : undefined, [adapter, connected]);\n    // Sign an arbitrary message if the wallet supports it\n    const signMessage = (0,react.useMemo)(() => adapter && 'signMessage' in adapter\n        ? async (message) => {\n            if (!connected)\n                throw handleErrorRef.current(new WalletNotConnectedError(), adapter);\n            return await adapter.signMessage(message);\n        }\n        : undefined, [adapter, connected]);\n    // Sign in if the wallet supports it\n    const signIn = (0,react.useMemo)(() => adapter && 'signIn' in adapter\n        ? async (input) => {\n            return await adapter.signIn(input);\n        }\n        : undefined, [adapter]);\n    const handleConnect = (0,react.useCallback)(async () => {\n        if (isConnectingRef.current || isDisconnectingRef.current || wallet?.adapter.connected)\n            return;\n        if (!wallet)\n            throw handleErrorRef.current(new WalletNotSelectedError());\n        const { adapter, readyState } = wallet;\n        if (!(readyState === WalletReadyState.Installed || readyState === WalletReadyState.Loadable))\n            throw handleErrorRef.current(new WalletNotReadyError(), adapter);\n        isConnectingRef.current = true;\n        setConnecting(true);\n        try {\n            await adapter.connect();\n        }\n        catch (e) {\n            onConnectError();\n            throw e;\n        }\n        finally {\n            setConnecting(false);\n            isConnectingRef.current = false;\n        }\n    }, [onConnectError, wallet]);\n    const handleDisconnect = (0,react.useCallback)(async () => {\n        if (isDisconnectingRef.current)\n            return;\n        if (!adapter)\n            return;\n        isDisconnectingRef.current = true;\n        setDisconnecting(true);\n        try {\n            await adapter.disconnect();\n        }\n        finally {\n            setDisconnecting(false);\n            isDisconnectingRef.current = false;\n        }\n    }, [adapter]);\n    return (react.createElement(useWallet/* WalletContext.Provider */.z.Provider, { value: {\n            autoConnect: !!onAutoConnectRequest,\n            wallets,\n            wallet,\n            publicKey,\n            connected,\n            connecting,\n            disconnecting,\n            select: onSelectWallet,\n            connect: handleConnect,\n            disconnect: handleDisconnect,\n            sendTransaction,\n            signTransaction,\n            signAllTransactions,\n            signMessage,\n            signIn,\n        } }, children));\n}\n//# sourceMappingURL=WalletProviderBase.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/WalletProvider.js\n\n\n\n\n\n\n\n\nlet _userAgent;\nfunction getUserAgent() {\n    if (_userAgent === undefined) {\n        _userAgent = globalThis.navigator?.userAgent ?? null;\n    }\n    return _userAgent;\n}\nfunction getIsMobile(adapters) {\n    const userAgentString = getUserAgent();\n    return getEnvironment({ adapters, userAgentString }) === Environment.MOBILE_WEB;\n}\nfunction getUriForAppIdentity() {\n    const location = globalThis.location;\n    if (!location)\n        return;\n    return `${location.protocol}//${location.host}`;\n}\nfunction WalletProvider({ children, wallets: adapters, autoConnect, localStorageKey = 'walletName', onError, }) {\n    const { connection } = useConnection();\n    const adaptersWithStandardAdapters = useStandardWalletAdapters(adapters);\n    const mobileWalletAdapter = (0,react.useMemo)(() => {\n        if (!getIsMobile(adaptersWithStandardAdapters)) {\n            return null;\n        }\n        const existingMobileWalletAdapter = adaptersWithStandardAdapters.find((adapter) => adapter.name === SolanaMobileWalletAdapterWalletName);\n        if (existingMobileWalletAdapter) {\n            return existingMobileWalletAdapter;\n        }\n        return new SolanaMobileWalletAdapter({\n            addressSelector: createDefaultAddressSelector(),\n            appIdentity: {\n                uri: getUriForAppIdentity(),\n            },\n            authorizationResultCache: createDefaultAuthorizationResultCache(),\n            cluster: getInferredClusterFromEndpoint(connection?.rpcEndpoint),\n            onWalletNotFound: createDefaultWalletNotFoundHandler(),\n        });\n    }, [adaptersWithStandardAdapters, connection?.rpcEndpoint]);\n    const adaptersWithMobileWalletAdapter = (0,react.useMemo)(() => {\n        if (mobileWalletAdapter == null || adaptersWithStandardAdapters.indexOf(mobileWalletAdapter) !== -1) {\n            return adaptersWithStandardAdapters;\n        }\n        return [mobileWalletAdapter, ...adaptersWithStandardAdapters];\n    }, [adaptersWithStandardAdapters, mobileWalletAdapter]);\n    const [walletName, setWalletName] = useLocalStorage_useLocalStorage(localStorageKey, getIsMobile(adaptersWithStandardAdapters) ? SolanaMobileWalletAdapterWalletName : null);\n    const adapter = (0,react.useMemo)(() => adaptersWithMobileWalletAdapter.find((a) => a.name === walletName) ?? null, [adaptersWithMobileWalletAdapter, walletName]);\n    const changeWallet = (0,react.useCallback)((nextWalletName) => {\n        if (walletName === nextWalletName)\n            return;\n        if (adapter &&\n            // Selecting a wallet other than the mobile wallet adapter is not\n            // sufficient reason to call `disconnect` on the mobile wallet adapter.\n            // Calling `disconnect` on the mobile wallet adapter causes the entire\n            // authorization store to be wiped.\n            adapter.name !== SolanaMobileWalletAdapterWalletName) {\n            adapter.disconnect();\n        }\n        setWalletName(nextWalletName);\n    }, [adapter, setWalletName, walletName]);\n    (0,react.useEffect)(() => {\n        if (!adapter)\n            return;\n        function handleDisconnect() {\n            if (isUnloadingRef.current)\n                return;\n            // Leave the adapter selected in the event of a disconnection.\n            if (walletName === SolanaMobileWalletAdapterWalletName && getIsMobile(adaptersWithStandardAdapters))\n                return;\n            setWalletName(null);\n        }\n        adapter.on('disconnect', handleDisconnect);\n        return () => {\n            adapter.off('disconnect', handleDisconnect);\n        };\n    }, [adapter, adaptersWithStandardAdapters, setWalletName, walletName]);\n    const hasUserSelectedAWallet = (0,react.useRef)(false);\n    const handleAutoConnectRequest = (0,react.useMemo)(() => {\n        if (!autoConnect || !adapter)\n            return;\n        return async () => {\n            // If autoConnect is true or returns true, use the default autoConnect behavior.\n            if (autoConnect === true || (await autoConnect(adapter))) {\n                if (hasUserSelectedAWallet.current) {\n                    await adapter.connect();\n                }\n                else {\n                    await adapter.autoConnect();\n                }\n            }\n        };\n    }, [autoConnect, adapter]);\n    const isUnloadingRef = (0,react.useRef)(false);\n    (0,react.useEffect)(() => {\n        if (walletName === SolanaMobileWalletAdapterWalletName && getIsMobile(adaptersWithStandardAdapters)) {\n            isUnloadingRef.current = false;\n            return;\n        }\n        function handleBeforeUnload() {\n            isUnloadingRef.current = true;\n        }\n        /**\n         * Some wallets fire disconnection events when the window unloads. Since there's no way to\n         * distinguish between a disconnection event received because a user initiated it, and one\n         * that was received because they've closed the window, we have to track window unload\n         * events themselves. Downstream components use this information to decide whether to act\n         * upon or drop wallet events and errors.\n         */\n        window.addEventListener('beforeunload', handleBeforeUnload);\n        return () => {\n            window.removeEventListener('beforeunload', handleBeforeUnload);\n        };\n    }, [adaptersWithStandardAdapters, walletName]);\n    const handleConnectError = (0,react.useCallback)(() => {\n        if (adapter && adapter.name !== SolanaMobileWalletAdapterWalletName) {\n            // If any error happens while connecting, unset the adapter.\n            changeWallet(null);\n        }\n    }, [adapter, changeWallet]);\n    const selectWallet = (0,react.useCallback)((walletName) => {\n        hasUserSelectedAWallet.current = true;\n        changeWallet(walletName);\n    }, [changeWallet]);\n    return (react.createElement(WalletProviderBase, { wallets: adaptersWithMobileWalletAdapter, adapter: adapter, isUnloadingRef: isUnloadingRef, onAutoConnectRequest: handleAutoConnectRequest, onConnectError: handleConnectError, onError: onError, onSelectWallet: selectWallet }, children));\n}\n//# sourceMappingURL=WalletProvider.js.map\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/useWalletModal.js\nvar useWalletModal = __webpack_require__(3495);\n// EXTERNAL MODULE: ./node_modules/react-dom/index.js\nvar react_dom = __webpack_require__(3935);\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/Collapse.js\n\nconst Collapse = ({ id, children, expanded = false }) => {\n    const ref = (0,react.useRef)(null);\n    const instant = (0,react.useRef)(true);\n    const transition = 'height 250ms ease-out';\n    const openCollapse = () => {\n        const node = ref.current;\n        if (!node)\n            return;\n        requestAnimationFrame(() => {\n            node.style.height = node.scrollHeight + 'px';\n        });\n    };\n    const closeCollapse = () => {\n        const node = ref.current;\n        if (!node)\n            return;\n        requestAnimationFrame(() => {\n            node.style.height = node.offsetHeight + 'px';\n            node.style.overflow = 'hidden';\n            requestAnimationFrame(() => {\n                node.style.height = '0';\n            });\n        });\n    };\n    (0,react.useLayoutEffect)(() => {\n        if (expanded) {\n            openCollapse();\n        }\n        else {\n            closeCollapse();\n        }\n    }, [expanded]);\n    (0,react.useLayoutEffect)(() => {\n        const node = ref.current;\n        if (!node)\n            return;\n        function handleComplete() {\n            if (!node)\n                return;\n            node.style.overflow = expanded ? 'initial' : 'hidden';\n            if (expanded) {\n                node.style.height = 'auto';\n            }\n        }\n        function handleTransitionEnd(event) {\n            if (node && event.target === node && event.propertyName === 'height') {\n                handleComplete();\n            }\n        }\n        if (instant.current) {\n            handleComplete();\n            instant.current = false;\n        }\n        node.addEventListener('transitionend', handleTransitionEnd);\n        return () => node.removeEventListener('transitionend', handleTransitionEnd);\n    }, [expanded]);\n    return (react.createElement(\"div\", { className: \"wallet-adapter-collapse\", id: id, ref: ref, role: \"region\", style: { height: 0, transition: instant.current ? undefined : transition } }, children));\n};\n//# sourceMappingURL=Collapse.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/Button.js\n\nconst Button = (props) => {\n    return (react.createElement(\"button\", { className: `wallet-adapter-button ${props.className || ''}`, disabled: props.disabled, style: props.style, onClick: props.onClick, tabIndex: props.tabIndex || 0, type: \"button\" },\n        props.startIcon && react.createElement(\"i\", { className: \"wallet-adapter-button-start-icon\" }, props.startIcon),\n        props.children,\n        props.endIcon && react.createElement(\"i\", { className: \"wallet-adapter-button-end-icon\" }, props.endIcon)));\n};\n//# sourceMappingURL=Button.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletIcon.js\n\nconst WalletIcon = ({ wallet, ...props }) => {\n    return wallet && react.createElement(\"img\", { src: wallet.adapter.icon, alt: `${wallet.adapter.name} icon`, ...props });\n};\n//# sourceMappingURL=WalletIcon.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletListItem.js\n\n\n\n\nconst WalletListItem = ({ handleClick, tabIndex, wallet }) => {\n    return (react.createElement(\"li\", null,\n        react.createElement(Button, { onClick: handleClick, startIcon: react.createElement(WalletIcon, { wallet: wallet }), tabIndex: tabIndex },\n            wallet.adapter.name,\n            wallet.readyState === WalletReadyState.Installed && react.createElement(\"span\", null, \"Detected\"))));\n};\n//# sourceMappingURL=WalletListItem.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletSVG.js\n\nconst WalletSVG = () => {\n    return (react.createElement(\"svg\", { width: \"97\", height: \"96\", viewBox: \"0 0 97 96\", fill: \"none\", xmlns: \"http://www.w3.org/2000/svg\" },\n        react.createElement(\"circle\", { cx: \"48.5\", cy: \"48\", r: \"48\", fill: \"url(#paint0_linear_880_5115)\", fillOpacity: \"0.1\" }),\n        react.createElement(\"circle\", { cx: \"48.5\", cy: \"48\", r: \"47\", stroke: \"url(#paint1_linear_880_5115)\", strokeOpacity: \"0.4\", strokeWidth: \"2\" }),\n        react.createElement(\"g\", { clipPath: \"url(#clip0_880_5115)\" },\n            react.createElement(\"path\", { d: \"M65.5769 28.1523H31.4231C27.6057 28.1523 24.5 31.258 24.5 35.0754V60.9215C24.5 64.7389 27.6057 67.8446 31.4231 67.8446H65.5769C69.3943 67.8446 72.5 64.7389 72.5 60.9215V35.0754C72.5 31.258 69.3943 28.1523 65.5769 28.1523ZM69.7308 52.1523H59.5769C57.2865 52.1523 55.4231 50.289 55.4231 47.9985C55.4231 45.708 57.2864 43.8446 59.5769 43.8446H69.7308V52.1523ZM69.7308 41.0754H59.5769C55.7595 41.0754 52.6539 44.1811 52.6539 47.9985C52.6539 51.8159 55.7595 54.9215 59.5769 54.9215H69.7308V60.9215C69.7308 63.2119 67.8674 65.0754 65.5769 65.0754H31.4231C29.1327 65.0754 27.2692 63.212 27.2692 60.9215V35.0754C27.2692 32.785 29.1326 30.9215 31.4231 30.9215H65.5769C67.8673 30.9215 69.7308 32.7849 69.7308 35.0754V41.0754Z\", fill: \"url(#paint2_linear_880_5115)\" }),\n            react.createElement(\"path\", { d: \"M61.4231 46.6172H59.577C58.8123 46.6172 58.1924 47.2371 58.1924 48.0018C58.1924 48.7665 58.8123 49.3863 59.577 49.3863H61.4231C62.1878 49.3863 62.8077 48.7664 62.8077 48.0018C62.8077 47.2371 62.1878 46.6172 61.4231 46.6172Z\", fill: \"url(#paint3_linear_880_5115)\" })),\n        react.createElement(\"defs\", null,\n            react.createElement(\"linearGradient\", { id: \"paint0_linear_880_5115\", x1: \"3.41664\", y1: \"98.0933\", x2: \"103.05\", y2: \"8.42498\", gradientUnits: \"userSpaceOnUse\" },\n                react.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                react.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                react.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                react.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                react.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                react.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            react.createElement(\"linearGradient\", { id: \"paint1_linear_880_5115\", x1: \"3.41664\", y1: \"98.0933\", x2: \"103.05\", y2: \"8.42498\", gradientUnits: \"userSpaceOnUse\" },\n                react.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                react.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                react.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                react.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                react.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                react.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            react.createElement(\"linearGradient\", { id: \"paint2_linear_880_5115\", x1: \"25.9583\", y1: \"68.7101\", x2: \"67.2337\", y2: \"23.7879\", gradientUnits: \"userSpaceOnUse\" },\n                react.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                react.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                react.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                react.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                react.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                react.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            react.createElement(\"linearGradient\", { id: \"paint3_linear_880_5115\", x1: \"58.3326\", y1: \"49.4467\", x2: \"61.0002\", y2: \"45.4453\", gradientUnits: \"userSpaceOnUse\" },\n                react.createElement(\"stop\", { stopColor: \"#9945FF\" }),\n                react.createElement(\"stop\", { offset: \"0.14\", stopColor: \"#8A53F4\" }),\n                react.createElement(\"stop\", { offset: \"0.42\", stopColor: \"#6377D6\" }),\n                react.createElement(\"stop\", { offset: \"0.79\", stopColor: \"#24B0A7\" }),\n                react.createElement(\"stop\", { offset: \"0.99\", stopColor: \"#00D18C\" }),\n                react.createElement(\"stop\", { offset: \"1\", stopColor: \"#00D18C\" })),\n            react.createElement(\"clipPath\", { id: \"clip0_880_5115\" },\n                react.createElement(\"rect\", { width: \"48\", height: \"48\", fill: \"white\", transform: \"translate(24.5 24)\" })))));\n};\n//# sourceMappingURL=WalletSVG.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletModal.js\n\n\n\n\n\n\n\n\nconst WalletModal = ({ className = '', container = 'body' }) => {\n    const ref = (0,react.useRef)(null);\n    const { wallets, select } = (0,useWallet/* useWallet */.O)();\n    const { setVisible } = (0,useWalletModal/* useWalletModal */.h)();\n    const [expanded, setExpanded] = (0,react.useState)(false);\n    const [fadeIn, setFadeIn] = (0,react.useState)(false);\n    const [portal, setPortal] = (0,react.useState)(null);\n    const [listedWallets, collapsedWallets] = (0,react.useMemo)(() => {\n        const installed = [];\n        const notInstalled = [];\n        for (const wallet of wallets) {\n            if (wallet.readyState === WalletReadyState.Installed) {\n                installed.push(wallet);\n            }\n            else {\n                notInstalled.push(wallet);\n            }\n        }\n        return installed.length ? [installed, notInstalled] : [notInstalled, []];\n    }, [wallets]);\n    const hideModal = (0,react.useCallback)(() => {\n        setFadeIn(false);\n        setTimeout(() => setVisible(false), 150);\n    }, [setVisible]);\n    const handleClose = (0,react.useCallback)((event) => {\n        event.preventDefault();\n        hideModal();\n    }, [hideModal]);\n    const handleWalletClick = (0,react.useCallback)((event, walletName) => {\n        select(walletName);\n        handleClose(event);\n    }, [select, handleClose]);\n    const handleCollapseClick = (0,react.useCallback)(() => setExpanded(!expanded), [expanded]);\n    const handleTabKey = (0,react.useCallback)((event) => {\n        const node = ref.current;\n        if (!node)\n            return;\n        // here we query all focusable elements\n        const focusableElements = node.querySelectorAll('button');\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const firstElement = focusableElements[0];\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const lastElement = focusableElements[focusableElements.length - 1];\n        if (event.shiftKey) {\n            // if going backward by pressing tab and firstElement is active, shift focus to last focusable element\n            if (document.activeElement === firstElement) {\n                lastElement.focus();\n                event.preventDefault();\n            }\n        }\n        else {\n            // if going forward by pressing tab and lastElement is active, shift focus to first focusable element\n            if (document.activeElement === lastElement) {\n                firstElement.focus();\n                event.preventDefault();\n            }\n        }\n    }, [ref]);\n    (0,react.useLayoutEffect)(() => {\n        const handleKeyDown = (event) => {\n            if (event.key === 'Escape') {\n                hideModal();\n            }\n            else if (event.key === 'Tab') {\n                handleTabKey(event);\n            }\n        };\n        // Get original overflow\n        const { overflow } = window.getComputedStyle(document.body);\n        // Hack to enable fade in animation after mount\n        setTimeout(() => setFadeIn(true), 0);\n        // Prevent scrolling on mount\n        document.body.style.overflow = 'hidden';\n        // Listen for keydown events\n        window.addEventListener('keydown', handleKeyDown, false);\n        return () => {\n            // Re-enable scrolling when component unmounts\n            document.body.style.overflow = overflow;\n            window.removeEventListener('keydown', handleKeyDown, false);\n        };\n    }, [hideModal, handleTabKey]);\n    (0,react.useLayoutEffect)(() => setPortal(document.querySelector(container)), [container]);\n    return (portal &&\n        (0,react_dom.createPortal)(react.createElement(\"div\", { \"aria-labelledby\": \"wallet-adapter-modal-title\", \"aria-modal\": \"true\", className: `wallet-adapter-modal ${fadeIn && 'wallet-adapter-modal-fade-in'} ${className}`, ref: ref, role: \"dialog\" },\n            react.createElement(\"div\", { className: \"wallet-adapter-modal-container\" },\n                react.createElement(\"div\", { className: \"wallet-adapter-modal-wrapper\" },\n                    react.createElement(\"button\", { onClick: handleClose, className: \"wallet-adapter-modal-button-close\" },\n                        react.createElement(\"svg\", { width: \"14\", height: \"14\" },\n                            react.createElement(\"path\", { d: \"M14 12.461 8.3 6.772l5.234-5.233L12.006 0 6.772 5.234 1.54 0 0 1.539l5.234 5.233L0 12.006l1.539 1.528L6.772 8.3l5.69 5.7L14 12.461z\" }))),\n                    listedWallets.length ? (react.createElement(react.Fragment, null,\n                        react.createElement(\"h1\", { className: \"wallet-adapter-modal-title\" }, \"Connect a wallet on Solana to continue\"),\n                        react.createElement(\"ul\", { className: \"wallet-adapter-modal-list\" },\n                            listedWallets.map((wallet) => (react.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), wallet: wallet }))),\n                            collapsedWallets.length ? (react.createElement(Collapse, { expanded: expanded, id: \"wallet-adapter-modal-collapse\" }, collapsedWallets.map((wallet) => (react.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), tabIndex: expanded ? 0 : -1, wallet: wallet }))))) : null),\n                        collapsedWallets.length ? (react.createElement(\"button\", { className: \"wallet-adapter-modal-list-more\", onClick: handleCollapseClick, tabIndex: 0 },\n                            react.createElement(\"span\", null,\n                                expanded ? 'Less ' : 'More ',\n                                \"options\"),\n                            react.createElement(\"svg\", { width: \"13\", height: \"7\", viewBox: \"0 0 13 7\", xmlns: \"http://www.w3.org/2000/svg\", className: `${expanded ? 'wallet-adapter-modal-list-more-icon-rotate' : ''}` },\n                                react.createElement(\"path\", { d: \"M0.71418 1.626L5.83323 6.26188C5.91574 6.33657 6.0181 6.39652 6.13327 6.43762C6.24844 6.47872 6.37371 6.5 6.50048 6.5C6.62725 6.5 6.75252 6.47872 6.8677 6.43762C6.98287 6.39652 7.08523 6.33657 7.16774 6.26188L12.2868 1.626C12.7753 1.1835 12.3703 0.5 11.6195 0.5H1.37997C0.629216 0.5 0.224175 1.1835 0.71418 1.626Z\" })))) : null)) : (react.createElement(react.Fragment, null,\n                        react.createElement(\"h1\", { className: \"wallet-adapter-modal-title\" }, \"You'll need a wallet on Solana to continue\"),\n                        react.createElement(\"div\", { className: \"wallet-adapter-modal-middle\" },\n                            react.createElement(WalletSVG, null)),\n                        collapsedWallets.length ? (react.createElement(react.Fragment, null,\n                            react.createElement(\"button\", { className: \"wallet-adapter-modal-list-more\", onClick: handleCollapseClick, tabIndex: 0 },\n                                react.createElement(\"span\", null,\n                                    expanded ? 'Hide ' : 'Already have a wallet? View ',\n                                    \"options\"),\n                                react.createElement(\"svg\", { width: \"13\", height: \"7\", viewBox: \"0 0 13 7\", xmlns: \"http://www.w3.org/2000/svg\", className: `${expanded ? 'wallet-adapter-modal-list-more-icon-rotate' : ''}` },\n                                    react.createElement(\"path\", { d: \"M0.71418 1.626L5.83323 6.26188C5.91574 6.33657 6.0181 6.39652 6.13327 6.43762C6.24844 6.47872 6.37371 6.5 6.50048 6.5C6.62725 6.5 6.75252 6.47872 6.8677 6.43762C6.98287 6.39652 7.08523 6.33657 7.16774 6.26188L12.2868 1.626C12.7753 1.1835 12.3703 0.5 11.6195 0.5H1.37997C0.629216 0.5 0.224175 1.1835 0.71418 1.626Z\" }))),\n                            react.createElement(Collapse, { expanded: expanded, id: \"wallet-adapter-modal-collapse\" },\n                                react.createElement(\"ul\", { className: \"wallet-adapter-modal-list\" }, collapsedWallets.map((wallet) => (react.createElement(WalletListItem, { key: wallet.adapter.name, handleClick: (event) => handleWalletClick(event, wallet.adapter.name), tabIndex: expanded ? 0 : -1, wallet: wallet }))))))) : null)))),\n            react.createElement(\"div\", { className: \"wallet-adapter-modal-overlay\", onMouseDown: handleClose })), portal));\n};\n//# sourceMappingURL=WalletModal.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-react-ui/lib/esm/WalletModalProvider.js\n\n\n\nconst WalletModalProvider = ({ children, ...props }) => {\n    const [visible, setVisible] = (0,react.useState)(false);\n    return (react.createElement(useWalletModal/* WalletModalContext.Provider */.g.Provider, { value: {\n            visible,\n            setVisible,\n        } },\n        children,\n        visible && react.createElement(WalletModal, { ...props })));\n};\n//# sourceMappingURL=WalletModalProvider.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-phantom/lib/esm/adapter.js\n\n\nconst PhantomWalletName = 'Phantom';\nclass PhantomWalletAdapter extends BaseMessageSignerWalletAdapter {\n    constructor(config = {}) {\n        super();\n        this.name = PhantomWalletName;\n        this.url = 'https://phantom.app';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHdpZHRoPSIxMDgiIGhlaWdodD0iMTA4IiB2aWV3Qm94PSIwIDAgMTA4IDEwOCIgZmlsbD0ibm9uZSI+CjxyZWN0IHdpZHRoPSIxMDgiIGhlaWdodD0iMTA4IiByeD0iMjYiIGZpbGw9IiNBQjlGRjIiLz4KPHBhdGggZmlsbC1ydWxlPSJldmVub2RkIiBjbGlwLXJ1bGU9ImV2ZW5vZGQiIGQ9Ik00Ni41MjY3IDY5LjkyMjlDNDIuMDA1NCA3Ni44NTA5IDM0LjQyOTIgODUuNjE4MiAyNC4zNDggODUuNjE4MkMxOS41ODI0IDg1LjYxODIgMTUgODMuNjU2MyAxNSA3NS4xMzQyQzE1IDUzLjQzMDUgNDQuNjMyNiAxOS44MzI3IDcyLjEyNjggMTkuODMyN0M4Ny43NjggMTkuODMyNyA5NCAzMC42ODQ2IDk0IDQzLjAwNzlDOTQgNTguODI1OCA4My43MzU1IDc2LjkxMjIgNzMuNTMyMSA3Ni45MTIyQzcwLjI5MzkgNzYuOTEyMiA2OC43MDUzIDc1LjEzNDIgNjguNzA1MyA3Mi4zMTRDNjguNzA1MyA3MS41NzgzIDY4LjgyNzUgNzAuNzgxMiA2OS4wNzE5IDY5LjkyMjlDNjUuNTg5MyA3NS44Njk5IDU4Ljg2ODUgODEuMzg3OCA1Mi41NzU0IDgxLjM4NzhDNDcuOTkzIDgxLjM4NzggNDUuNjcxMyA3OC41MDYzIDQ1LjY3MTMgNzQuNDU5OEM0NS42NzEzIDcyLjk4ODQgNDUuOTc2OCA3MS40NTU2IDQ2LjUyNjcgNjkuOTIyOVpNODMuNjc2MSA0Mi41Nzk0QzgzLjY3NjEgNDYuMTcwNCA4MS41NTc1IDQ3Ljk2NTggNzkuMTg3NSA0Ny45NjU4Qzc2Ljc4MTYgNDcuOTY1OCA3NC42OTg5IDQ2LjE3MDQgNzQuNjk4OSA0Mi41Nzk0Qzc0LjY5ODkgMzguOTg4NSA3Ni43ODE2IDM3LjE5MzEgNzkuMTg3NSAzNy4xOTMxQzgxLjU1NzUgMzcuMTkzMSA4My42NzYxIDM4Ljk4ODUgODMuNjc2MSA0Mi41Nzk0Wk03MC4yMTAzIDQyLjU3OTVDNzAuMjEwMyA0Ni4xNzA0IDY4LjA5MTYgNDcuOTY1OCA2NS43MjE2IDQ3Ljk2NThDNjMuMzE1NyA0Ny45NjU4IDYxLjIzMyA0Ni4xNzA0IDYxLjIzMyA0Mi41Nzk1QzYxLjIzMyAzOC45ODg1IDYzLjMxNTcgMzcuMTkzMSA2NS43MjE2IDM3LjE5MzFDNjguMDkxNiAzNy4xOTMxIDcwLjIxMDMgMzguOTg4NSA3MC4yMTAzIDQyLjU3OTVaIiBmaWxsPSIjRkZGREY4Ii8+Cjwvc3ZnPg==';\n        this.supportedTransactionVersions = new Set(['legacy', 0]);\n        this._readyState = typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.NotDetected;\n        this._disconnected = () => {\n            const wallet = this._wallet;\n            if (wallet) {\n                wallet.off('disconnect', this._disconnected);\n                wallet.off('accountChanged', this._accountChanged);\n                this._wallet = null;\n                this._publicKey = null;\n                this.emit('error', new WalletDisconnectedError());\n                this.emit('disconnect');\n            }\n        };\n        this._accountChanged = (newPublicKey) => {\n            const publicKey = this._publicKey;\n            if (!publicKey)\n                return;\n            try {\n                newPublicKey = new index_browser_esm.PublicKey(newPublicKey.toBytes());\n            }\n            catch (error) {\n                this.emit('error', new WalletPublicKeyError(error?.message, error));\n                return;\n            }\n            if (publicKey.equals(newPublicKey))\n                return;\n            this._publicKey = newPublicKey;\n            this.emit('connect', newPublicKey);\n        };\n        this._connecting = false;\n        this._wallet = null;\n        this._publicKey = null;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            if (isIosAndRedirectable()) {\n                // when in iOS (not webview), set Phantom as loadable instead of checking for install\n                this._readyState = WalletReadyState.Loadable;\n                this.emit('readyStateChange', this._readyState);\n            }\n            else {\n                scopePollingDetectionStrategy(() => {\n                    if (window.phantom?.solana?.isPhantom || window.solana?.isPhantom) {\n                        this._readyState = WalletReadyState.Installed;\n                        this.emit('readyStateChange', this._readyState);\n                        return true;\n                    }\n                    return false;\n                });\n            }\n        }\n    }\n    get publicKey() {\n        return this._publicKey;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    async autoConnect() {\n        // Skip autoconnect in the Loadable state\n        // We can't redirect to a universal link without user input\n        if (this.readyState === WalletReadyState.Installed) {\n            await this.connect();\n        }\n    }\n    async connect() {\n        try {\n            if (this.connected || this.connecting)\n                return;\n            if (this.readyState === WalletReadyState.Loadable) {\n                // redirect to the Phantom /browse universal link\n                // this will open the current URL in the Phantom in-wallet browser\n                const url = encodeURIComponent(window.location.href);\n                const ref = encodeURIComponent(window.location.origin);\n                window.location.href = `https://phantom.app/ul/browse/${url}?ref=${ref}`;\n                return;\n            }\n            if (this.readyState !== WalletReadyState.Installed)\n                throw new WalletNotReadyError();\n            this._connecting = true;\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            const wallet = window.phantom?.solana || window.solana;\n            if (!wallet.isConnected) {\n                try {\n                    await wallet.connect();\n                }\n                catch (error) {\n                    throw new WalletConnectionError(error?.message, error);\n                }\n            }\n            if (!wallet.publicKey)\n                throw new WalletAccountError();\n            let publicKey;\n            try {\n                publicKey = new index_browser_esm.PublicKey(wallet.publicKey.toBytes());\n            }\n            catch (error) {\n                throw new WalletPublicKeyError(error?.message, error);\n            }\n            wallet.on('disconnect', this._disconnected);\n            wallet.on('accountChanged', this._accountChanged);\n            this._wallet = wallet;\n            this._publicKey = publicKey;\n            this.emit('connect', publicKey);\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n        finally {\n            this._connecting = false;\n        }\n    }\n    async disconnect() {\n        const wallet = this._wallet;\n        if (wallet) {\n            wallet.off('disconnect', this._disconnected);\n            wallet.off('accountChanged', this._accountChanged);\n            this._wallet = null;\n            this._publicKey = null;\n            try {\n                await wallet.disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n        }\n        this.emit('disconnect');\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signers, ...sendOptions } = options;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                }\n                sendOptions.preflightCommitment = sendOptions.preflightCommitment || connection.commitment;\n                const { signature } = await wallet.signAndSendTransaction(transaction, sendOptions);\n                return signature;\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signTransaction(transaction) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signTransaction(transaction)) || transaction;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signAllTransactions(transactions)) || transactions;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signMessage(message) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signature } = await wallet.signMessage(message);\n                return signature;\n            }\n            catch (error) {\n                throw new WalletSignMessageError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n//# sourceMappingURL=adapter.js.map\n;// CONCATENATED MODULE: ./node_modules/@wallet-standard/wallet/lib/esm/register.js\nvar register_classPrivateFieldSet = (undefined && undefined.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar register_classPrivateFieldGet = (undefined && undefined.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _RegisterWalletEvent_detail;\n/**\n * Register a {@link \"@wallet-standard/base\".Wallet} as a Standard Wallet with the app.\n *\n * This dispatches a {@link \"@wallet-standard/base\".WindowRegisterWalletEvent} to notify the app that the Wallet is\n * ready to be registered.\n *\n * This also adds a listener for {@link \"@wallet-standard/base\".WindowAppReadyEvent} to listen for a notification from\n * the app that the app is ready to register the Wallet.\n *\n * This combination of event dispatch and listener guarantees that the Wallet will be registered synchronously as soon\n * as the app is ready whether the Wallet loads before or after the app.\n *\n * @param wallet Wallet to register.\n *\n * @group Wallet\n */\nfunction registerWallet(wallet) {\n    const callback = ({ register }) => register(wallet);\n    try {\n        window.dispatchEvent(new RegisterWalletEvent(callback));\n    }\n    catch (error) {\n        console.error('wallet-standard:register-wallet event could not be dispatched\\n', error);\n    }\n    try {\n        window.addEventListener('wallet-standard:app-ready', ({ detail: api }) => callback(api));\n    }\n    catch (error) {\n        console.error('wallet-standard:app-ready event listener could not be added\\n', error);\n    }\n}\nclass RegisterWalletEvent extends Event {\n    constructor(callback) {\n        super('wallet-standard:register-wallet', {\n            bubbles: false,\n            cancelable: false,\n            composed: false,\n        });\n        _RegisterWalletEvent_detail.set(this, void 0);\n        register_classPrivateFieldSet(this, _RegisterWalletEvent_detail, callback, \"f\");\n    }\n    get detail() {\n        return register_classPrivateFieldGet(this, _RegisterWalletEvent_detail, \"f\");\n    }\n    get type() {\n        return 'wallet-standard:register-wallet';\n    }\n    /** @deprecated */\n    preventDefault() {\n        throw new Error('preventDefault cannot be called');\n    }\n    /** @deprecated */\n    stopImmediatePropagation() {\n        throw new Error('stopImmediatePropagation cannot be called');\n    }\n    /** @deprecated */\n    stopPropagation() {\n        throw new Error('stopPropagation cannot be called');\n    }\n}\n_RegisterWalletEvent_detail = new WeakMap();\n/**\n * @deprecated Use {@link registerWallet} instead.\n *\n * @group Deprecated\n */\nfunction DEPRECATED_registerWallet(wallet) {\n    var _a;\n    registerWallet(wallet);\n    try {\n        ((_a = window.navigator).wallets || (_a.wallets = [])).push(({ register }) => register(wallet));\n    }\n    catch (error) {\n        console.error('window.navigator.wallets could not be pushed\\n', error);\n    }\n}\n//# sourceMappingURL=register.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/icon.js\n/** @internal */\nconst icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjMxIiB2aWV3Qm94PSIwIDAgMzEgMzEiIHdpZHRoPSIzMSIgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIiB4bWxuczp4bGluaz0iaHR0cDovL3d3dy53My5vcmcvMTk5OS94bGluayI+PGxpbmVhckdyYWRpZW50IGlkPSJhIiBncmFkaWVudFVuaXRzPSJ1c2VyU3BhY2VPblVzZSIgeDE9IjIwLjI1IiB4Mj0iMjYuNTcxIiB5MT0iMjcuMTczIiB5Mj0iMTkuODU4Ij48c3RvcCBvZmZzZXQ9Ii4wOCIgc3RvcC1jb2xvcj0iIzk5NDVmZiIvPjxzdG9wIG9mZnNldD0iLjMiIHN0b3AtY29sb3I9IiM4NzUyZjMiLz48c3RvcCBvZmZzZXQ9Ii41IiBzdG9wLWNvbG9yPSIjNTQ5N2Q1Ii8+PHN0b3Agb2Zmc2V0PSIuNiIgc3RvcC1jb2xvcj0iIzQzYjRjYSIvPjxzdG9wIG9mZnNldD0iLjcyIiBzdG9wLWNvbG9yPSIjMjhlMGI5Ii8+PHN0b3Agb2Zmc2V0PSIuOTciIHN0b3AtY29sb3I9IiMxOWZiOWIiLz48L2xpbmVhckdyYWRpZW50PjxnIHN0cm9rZS1saW5lam9pbj0icm91bmQiIHN0cm9rZS13aWR0aD0iLjA5NCI+PHBhdGggZD0ibTI2LjEwOSAzLjY0My05LjM2OSA2Ljk1OSAxLjczMy00LjEwNSA3LjYzNy0yLjg1M3oiIGZpbGw9IiNlMjc2MWIiIHN0cm9rZT0iI2UyNzYxYiIvPjxnIGZpbGw9IiNlNDc2MWIiIHN0cm9rZT0iI2U0NzYxYiI+PHBhdGggZD0ibTQuNDgxIDMuNjQzIDkuMjk0IDcuMDI0LTEuNjQ4LTQuMTcxem0xOC4yNTggMTYuMTMtMi40OTUgMy44MjMgNS4zMzkgMS40NjkgMS41MzUtNS4yMDctNC4zNzgtLjA4NXptLTE5LjI0Ny4wODUgMS41MjUgNS4yMDcgNS4zMzktMS40NjktMi40OTUtMy44MjN6Ii8+PHBhdGggZD0ibTEwLjA1NSAxMy4zMTMtMS40ODggMi4yNTEgNS4zMDEuMjM1LS4xODgtNS42OTd6bTEwLjQ4IDAtMy42NzItMy4yNzctLjEyMiA1Ljc2MyA1LjI5Mi0uMjM1LTEuNDk3LTIuMjUxem0tMTAuMTc4IDEwLjI4MyAzLjE4My0xLjU1NC0yLjc0OS0yLjE0Ny0uNDMzIDMuNzAxem02LjY5NS0xLjU1NCAzLjE5MiAxLjU1NC0uNDQzLTMuNzAxeiIvPjwvZz48cGF0aCBkPSJtMjAuMjQ0IDIzLjU5Ni0zLjE5Mi0xLjU1NC4yNTQgMi4wODEtLjAyOC44NzZ6bS05Ljg4NyAwIDIuOTY2IDEuNDAzLS4wMTktLjg3Ni4yMzUtMi4wODEtMy4xODMgMS41NTR6IiBmaWxsPSIjZDdjMWIzIiBzdHJva2U9IiNkN2MxYjMiLz48cGF0aCBkPSJtMTMuMzY5IDE4LjUyMS0yLjY1NS0uNzgxIDEuODc0LS44NTd6bTMuODUxIDAgLjc4MS0xLjYzOCAxLjg4My44NTctMi42NjUuNzgxeiIgZmlsbD0iIzIzMzQ0NyIgc3Ryb2tlPSIjMjMzNDQ3Ii8+PHBhdGggZD0ibTEwLjM1NyAyMy41OTYuNDUyLTMuODIzLTIuOTQ3LjA4NXptOS40MzUtMy44MjMuNDUyIDMuODIzIDIuNDk1LTMuNzM4em0yLjI0MS00LjIwOS01LjI5Mi4yMzUuNDkgMi43MjEuNzgyLTEuNjM4IDEuODgzLjg1N3ptLTExLjMxOCAyLjE3NSAxLjg4My0uODU3Ljc3MiAxLjYzOC40OTktMi43MjEtNS4zMDEtLjIzNXoiIGZpbGw9IiNjZDYxMTYiIHN0cm9rZT0iI2NkNjExNiIvPjxwYXRoIGQ9Im04LjU2NyAxNS41NjQgMi4yMjIgNC4zMzEtLjA3NS0yLjE1NnptMTEuMzI4IDIuMTc1LS4wOTQgMi4xNTYgMi4yMzItNC4zMzEtMi4xMzcgMi4xNzV6bS02LjAyNi0xLjk0LS40OTkgMi43MjEuNjIxIDMuMjExLjE0MS00LjIyOC0uMjY0LTEuNzA0em0yLjg3MiAwLS4yNTQgMS42OTUuMTEzIDQuMjM3LjYzMS0zLjIxMXoiIGZpbGw9IiNlNDc1MWYiIHN0cm9rZT0iI2U0NzUxZiIvPjxwYXRoIGQ9Im0xNy4yMyAxOC41Mi0uNjMxIDMuMjExLjQ1Mi4zMTEgMi43NS0yLjE0Ny4wOTQtMi4xNTZ6bS02LjUxNi0uNzgxLjA3NSAyLjE1NiAyLjc1IDIuMTQ3LjQ1Mi0uMzExLS42MjItMy4yMTF6IiBmaWxsPSIjZjY4NTFiIiBzdHJva2U9IiNmNjg1MWIiLz48cGF0aCBkPSJtMTcuMjc3IDI0Ljk5OS4wMjgtLjg3Ni0uMjM1LS4yMDdoLTMuNTVsLS4yMTcuMjA3LjAxOS44NzYtMi45NjYtMS40MDMgMS4wMzYuODQ4IDIuMSAxLjQ1OWgzLjYwNmwyLjEwOS0xLjQ1OSAxLjAzNi0uODQ4eiIgZmlsbD0iI2MwYWQ5ZSIgc3Ryb2tlPSIjYzBhZDllIi8+PHBhdGggZD0ibTE3LjA1MSAyMi4wNDItLjQ1Mi0uMzExaC0yLjYwOGwtLjQ1Mi4zMTEtLjIzNSAyLjA4MS4yMTctLjIwN2gzLjU1bC4yMzUuMjA3LS4yNTQtMi4wODF6IiBmaWxsPSIjMTYxNjE2IiBzdHJva2U9IiMxNjE2MTYiLz48cGF0aCBkPSJtMjYuNTA1IDExLjA1My44LTMuODQyLTEuMTk2LTMuNTY5LTkuMDU4IDYuNzIzIDMuNDg0IDIuOTQ3IDQuOTI1IDEuNDQxIDEuMDkyLTEuMjcxLS40NzEtLjMzOS43NTMtLjY4Ny0uNTg0LS40NTIuNzUzLS41NzQtLjQ5OS0uMzc3em0tMjMuMjExLTMuODQxLjggMy44NDItLjUwOC4zNzcuNzUzLjU3NC0uNTc0LjQ1Mi43NTMuNjg3LS40NzEuMzM5IDEuMDgzIDEuMjcxIDQuOTI1LTEuNDQxIDMuNDg0LTIuOTQ3LTkuMDU5LTYuNzIzeiIgZmlsbD0iIzc2M2QxNiIgc3Ryb2tlPSIjNzYzZDE2Ii8+PHBhdGggZD0ibTI1LjQ2IDE0Ljc1NC00LjkyNS0xLjQ0MSAxLjQ5NyAyLjI1MS0yLjIzMiA0LjMzMSAyLjkzOC0uMDM4aDQuMzc4bC0xLjY1Ny01LjEwNHptLTE1LjQwNS0xLjQ0MS00LjkyNSAxLjQ0MS0xLjYzOCA1LjEwNGg0LjM2OWwyLjkyOC4wMzgtMi4yMjItNC4zMzEgMS40ODgtMi4yNTF6bTYuNjg1IDIuNDg2LjMxMS01LjQzMyAxLjQzMS0zLjg3aC02LjM1NmwxLjQxMyAzLjg3LjMyOSA1LjQzMy4xMTMgMS43MTQuMDA5IDQuMjE5aDIuNjFsLjAxOS00LjIxOS4xMjItMS43MTR6IiBmaWxsPSIjZjY4NTFiIiBzdHJva2U9IiNmNjg1MWIiLz48L2c+PGNpcmNsZSBjeD0iMjMuNSIgY3k9IjIzLjUiIGZpbGw9IiMwMDAiIHI9IjYuNSIvPjxwYXRoIGQ9Im0yNy40NzMgMjUuNTQ1LTEuMzEgMS4zNjhjLS4wMjkuMDMtLjA2My4wNTMtLjEwMS4wN2EuMzEuMzEgMCAwIDEgLS4xMjEuMDI0aC02LjIwOWMtLjAzIDAtLjA1OS0uMDA4LS4wODMtLjAyNGEuMTUuMTUgMCAwIDEgLS4wNTYtLjA2NWMtLjAxMi0uMDI2LS4wMTUtLjA1Ni0uMDEtLjA4NHMuMDE4LS4wNTUuMDM5LS4wNzZsMS4zMTEtMS4zNjhjLjAyOC0uMDMuMDYzLS4wNTMuMTAxLS4wNjlhLjMxLjMxIDAgMCAxIC4xMjEtLjAyNWg2LjIwOGMuMDMgMCAuMDU5LjAwOC4wODMuMDI0YS4xNS4xNSAwIDAgMSAuMDU2LjA2NWMuMDEyLjAyNi4wMTUuMDU2LjAxLjA4NHMtLjAxOC4wNTUtLjAzOS4wNzZ6bS0xLjMxLTIuNzU2Yy0uMDI5LS4wMy0uMDYzLS4wNTMtLjEwMS0uMDdhLjMxLjMxIDAgMCAwIC0uMTIxLS4wMjRoLTYuMjA5Yy0uMDMgMC0uMDU5LjAwOC0uMDgzLjAyNHMtLjA0NC4wMzgtLjA1Ni4wNjUtLjAxNS4wNTYtLjAxLjA4NC4wMTguMDU1LjAzOS4wNzZsMS4zMTEgMS4zNjhjLjAyOC4wMy4wNjMuMDUzLjEwMS4wNjlhLjMxLjMxIDAgMCAwIC4xMjEuMDI1aDYuMjA4Yy4wMyAwIC4wNTktLjAwOC4wODMtLjAyNGEuMTUuMTUgMCAwIDAgLjA1Ni0uMDY1Yy4wMTItLjAyNi4wMTUtLjA1Ni4wMS0uMDg0cy0uMDE4LS4wNTUtLjAzOS0uMDc2em0tNi40MzEtLjk4M2g2LjIwOWEuMzEuMzEgMCAwIDAgLjEyMS0uMDI0Yy4wMzgtLjAxNi4wNzMtLjA0LjEwMS0uMDdsMS4zMS0xLjM2OGMuMDItLjAyMS4wMzQtLjA0Ny4wMzktLjA3NnMuMDAxLS4wNTgtLjAxLS4wODRhLjE1LjE1IDAgMCAwIC0uMDU2LS4wNjVjLS4wMjUtLjAxNi0uMDU0LS4wMjQtLjA4My0uMDI0aC02LjIwOGEuMzEuMzEgMCAwIDAgLS4xMjEuMDI1Yy0uMDM4LjAxNi0uMDcyLjA0LS4xMDEuMDY5bC0xLjMxIDEuMzY4Yy0uMDIuMDIxLS4wMzQuMDQ3LS4wMzkuMDc2cy0uMDAxLjA1OC4wMS4wODQuMDMxLjA0OS4wNTYuMDY1LjA1NC4wMjQuMDgzLjAyNHoiIGZpbGw9InVybCgjYSkiLz48L3N2Zz4=';\n//# sourceMappingURL=icon.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/wallet.js\nvar wallet_classPrivateFieldGet = (undefined && undefined.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar wallet_classPrivateFieldSet = (undefined && undefined.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar _SolflareMetaMaskWallet_instances, _SolflareMetaMaskWallet_listeners, _SolflareMetaMaskWallet_version, _SolflareMetaMaskWallet_name, _SolflareMetaMaskWallet_icon, _SolflareMetaMaskWallet_solflareMetaMask, _SolflareMetaMaskWallet_on, _SolflareMetaMaskWallet_emit, _SolflareMetaMaskWallet_off, _SolflareMetaMaskWallet_connect, _SolflareMetaMaskWallet_disconnect, _SolflareMetaMaskWallet_signAndSendTransaction, _SolflareMetaMaskWallet_signTransaction, _SolflareMetaMaskWallet_signMessage;\n\n\n\n\n\nclass SolflareMetaMaskWallet {\n    constructor() {\n        _SolflareMetaMaskWallet_instances.add(this);\n        _SolflareMetaMaskWallet_listeners.set(this, {});\n        _SolflareMetaMaskWallet_version.set(this, '1.0.0');\n        _SolflareMetaMaskWallet_name.set(this, 'MetaMask');\n        _SolflareMetaMaskWallet_icon.set(this, icon);\n        _SolflareMetaMaskWallet_solflareMetaMask.set(this, null);\n        _SolflareMetaMaskWallet_on.set(this, (event, listener) => {\n            wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.push(listener) || (wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event] = [listener]);\n            return () => wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_instances, \"m\", _SolflareMetaMaskWallet_off).call(this, event, listener);\n        });\n        _SolflareMetaMaskWallet_connect.set(this, async () => {\n            if (!wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\")) {\n                let SolflareMetaMaskClass;\n                try {\n                    SolflareMetaMaskClass = (await __webpack_require__.e(/* import() */ 525).then(__webpack_require__.bind(__webpack_require__, 9525))).default;\n                }\n                catch (error) {\n                    throw new Error('Unable to load Solflare MetaMask SDK');\n                }\n                wallet_classPrivateFieldSet(this, _SolflareMetaMaskWallet_solflareMetaMask, new SolflareMetaMaskClass(), \"f\");\n                wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").on('standard_change', (properties) => wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_instances, \"m\", _SolflareMetaMaskWallet_emit).call(this, 'change', properties));\n            }\n            if (!this.accounts.length) {\n                await wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").connect();\n            }\n            return { accounts: this.accounts };\n        });\n        _SolflareMetaMaskWallet_disconnect.set(this, async () => {\n            if (!wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                return;\n            await wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").disconnect();\n        });\n        _SolflareMetaMaskWallet_signAndSendTransaction.set(this, async (...inputs) => {\n            if (!wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignAndSendTransaction(...inputs);\n        });\n        _SolflareMetaMaskWallet_signTransaction.set(this, async (...inputs) => {\n            if (!wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignTransaction(...inputs);\n        });\n        _SolflareMetaMaskWallet_signMessage.set(this, async (...inputs) => {\n            if (!wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\"))\n                throw new WalletNotConnectedError();\n            return await wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardSignMessage(...inputs);\n        });\n    }\n    get version() {\n        return wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_version, \"f\");\n    }\n    get name() {\n        return wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_name, \"f\");\n    }\n    get icon() {\n        return wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_icon, \"f\");\n    }\n    get chains() {\n        return [esm_SOLANA_MAINNET_CHAIN, esm_SOLANA_DEVNET_CHAIN, esm_SOLANA_TESTNET_CHAIN];\n    }\n    get features() {\n        return {\n            [StandardConnect]: {\n                version: '1.0.0',\n                connect: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_connect, \"f\"),\n            },\n            [StandardDisconnect]: {\n                version: '1.0.0',\n                disconnect: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_disconnect, \"f\"),\n            },\n            [StandardEvents]: {\n                version: '1.0.0',\n                on: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_on, \"f\"),\n            },\n            [signAndSendTransaction/* SolanaSignAndSendTransaction */.G]: {\n                version: '1.0.0',\n                supportedTransactionVersions: ['legacy', 0],\n                signAndSendTransaction: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_signAndSendTransaction, \"f\"),\n            },\n            [signTransaction/* SolanaSignTransaction */.R]: {\n                version: '1.0.0',\n                supportedTransactionVersions: ['legacy', 0],\n                signTransaction: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_signTransaction, \"f\"),\n            },\n            [signMessage/* SolanaSignMessage */.g]: {\n                version: '1.0.0',\n                signMessage: wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_signMessage, \"f\"),\n            },\n        };\n    }\n    get accounts() {\n        return wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\") ? wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_solflareMetaMask, \"f\").standardAccounts : [];\n    }\n}\n_SolflareMetaMaskWallet_listeners = new WeakMap(), _SolflareMetaMaskWallet_version = new WeakMap(), _SolflareMetaMaskWallet_name = new WeakMap(), _SolflareMetaMaskWallet_icon = new WeakMap(), _SolflareMetaMaskWallet_solflareMetaMask = new WeakMap(), _SolflareMetaMaskWallet_on = new WeakMap(), _SolflareMetaMaskWallet_connect = new WeakMap(), _SolflareMetaMaskWallet_disconnect = new WeakMap(), _SolflareMetaMaskWallet_signAndSendTransaction = new WeakMap(), _SolflareMetaMaskWallet_signTransaction = new WeakMap(), _SolflareMetaMaskWallet_signMessage = new WeakMap(), _SolflareMetaMaskWallet_instances = new WeakSet(), _SolflareMetaMaskWallet_emit = function _SolflareMetaMaskWallet_emit(event, ...args) {\n    // eslint-disable-next-line prefer-spread\n    wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.forEach((listener) => listener.apply(null, args));\n}, _SolflareMetaMaskWallet_off = function _SolflareMetaMaskWallet_off(event, listener) {\n    wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event] = wallet_classPrivateFieldGet(this, _SolflareMetaMaskWallet_listeners, \"f\")[event]?.filter((existingListener) => listener !== existingListener);\n};\n//# sourceMappingURL=wallet.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-solflare/lib/esm/metamask/detect.js\n\n\nlet detect_registered = false;\nfunction detect_register() {\n    if (detect_registered)\n        return;\n    registerWallet(new SolflareMetaMaskWallet());\n    detect_registered = true;\n}\n/** @internal */\nasync function detectAndRegisterSolflareMetaMaskWallet() {\n    const id = 'solflare-detect-metamask';\n    function postMessage() {\n        window.postMessage({\n            target: 'metamask-contentscript',\n            data: {\n                name: 'metamask-provider',\n                data: {\n                    id,\n                    jsonrpc: '2.0',\n                    method: 'wallet_getSnaps',\n                },\n            },\n        }, window.location.origin);\n    }\n    function onMessage(event) {\n        const message = event.data;\n        if (message?.target === 'metamask-inpage' && message.data?.name === 'metamask-provider') {\n            if (message.data.data?.id === id) {\n                window.removeEventListener('message', onMessage);\n                if (!message.data.data.error) {\n                    detect_register();\n                }\n            }\n            else {\n                postMessage();\n            }\n        }\n    }\n    window.addEventListener('message', onMessage);\n    window.setTimeout(() => window.removeEventListener('message', onMessage), 5000);\n    postMessage();\n}\n//# sourceMappingURL=detect.js.map\n;// CONCATENATED MODULE: ./node_modules/@solana/wallet-adapter-solflare/lib/esm/adapter.js\n\n\n\nconst SolflareWalletName = 'Solflare';\nclass SolflareWalletAdapter extends BaseMessageSignerWalletAdapter {\n    constructor(config = {}) {\n        super();\n        this.name = SolflareWalletName;\n        this.url = 'https://solflare.com';\n        this.icon = 'data:image/svg+xml;base64,PHN2ZyBmaWxsPSJub25lIiBoZWlnaHQ9IjUwIiB2aWV3Qm94PSIwIDAgNTAgNTAiIHdpZHRoPSI1MCIgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIiB4bWxuczp4bGluaz0iaHR0cDovL3d3dy53My5vcmcvMTk5OS94bGluayI+PGxpbmVhckdyYWRpZW50IGlkPSJhIj48c3RvcCBvZmZzZXQ9IjAiIHN0b3AtY29sb3I9IiNmZmMxMGIiLz48c3RvcCBvZmZzZXQ9IjEiIHN0b3AtY29sb3I9IiNmYjNmMmUiLz48L2xpbmVhckdyYWRpZW50PjxsaW5lYXJHcmFkaWVudCBpZD0iYiIgZ3JhZGllbnRVbml0cz0idXNlclNwYWNlT25Vc2UiIHgxPSI2LjQ3ODM1IiB4Mj0iMzQuOTEwNyIgeGxpbms6aHJlZj0iI2EiIHkxPSI3LjkyIiB5Mj0iMzMuNjU5MyIvPjxyYWRpYWxHcmFkaWVudCBpZD0iYyIgY3g9IjAiIGN5PSIwIiBncmFkaWVudFRyYW5zZm9ybT0ibWF0cml4KDQuOTkyMTg4MzIgMTIuMDYzODc5NjMgLTEyLjE4MTEzNjU1IDUuMDQwNzEwNzQgMjIuNTIwMiAyMC42MTgzKSIgZ3JhZGllbnRVbml0cz0idXNlclNwYWNlT25Vc2UiIHI9IjEiIHhsaW5rOmhyZWY9IiNhIi8+PHBhdGggZD0ibTI1LjE3MDggNDcuOTEwNGMuNTI1IDAgLjk1MDcuNDIxLjk1MDcuOTQwM3MtLjQyNTcuOTQwMi0uOTUwNy45NDAyLS45NTA3LS40MjA5LS45NTA3LS45NDAyLjQyNTctLjk0MDMuOTUwNy0uOTQwM3ptLTEuMDMyOC00NC45MTU2NWMuNDY0Ni4wMzgzNi44Mzk4LjM5MDQuOTAyNy44NDY4MWwxLjEzMDcgOC4yMTU3NGMuMzc5OCAyLjcxNDMgMy42NTM1IDMuODkwNCA1LjY3NDMgMi4wNDU5bDExLjMyOTEtMTAuMzExNThjLjI3MzMtLjI0ODczLjY5ODktLjIzMTQ5Ljk1MDcuMDM4NTEuMjMwOS4yNDc3Mi4yMzc5LjYyNjk3LjAxNjEuODgyNzdsLTkuODc5MSAxMS4zOTU4Yy0xLjgxODcgMi4wOTQyLS40NzY4IDUuMzY0MyAyLjI5NTYgNS41OTc4bDguNzE2OC44NDAzYy40MzQxLjA0MTguNzUxNy40MjM0LjcwOTMuODUyNC0uMDM0OS4zNTM3LS4zMDc0LjYzOTUtLjY2MjguNjk0OWwtOS4xNTk0IDEuNDMwMmMtMi42NTkzLjM2MjUtMy44NjM2IDMuNTExNy0yLjEzMzkgNS41NTc2bDMuMjIgMy43OTYxYy4yNTk0LjMwNTguMjE4OC43NjE1LS4wOTA4IDEuMDE3OC0uMjYyMi4yMTcyLS42NDE5LjIyNTYtLjkxMzguMDIwM2wtMy45Njk0LTIuOTk3OGMtMi4xNDIxLTEuNjEwOS01LjIyOTctLjI0MTctNS40NTYxIDIuNDI0M2wtLjg3NDcgMTAuMzk3NmMtLjAzNjIuNDI5NS0uNDE3OC43NDg3LS44NTI1LjcxMy0uMzY5LS4wMzAzLS42NjcxLS4zMDk3LS43MTcxLS42NzIxbC0xLjM4NzEtMTAuMDQzN2MtLjM3MTctMi43MTQ0LTMuNjQ1NC0zLjg5MDQtNS42NzQzLTIuMDQ1OWwtMTIuMDUxOTUgMTAuOTc0Yy0uMjQ5NDcuMjI3MS0uNjM4MDkuMjExNC0uODY4LS4wMzUtLjIxMDk0LS4yMjYyLS4yMTczNS0uNTcyNC0uMDE0OTMtLjgwNmwxMC41MTgxOC0xMi4xMzg1YzEuODE4Ny0yLjA5NDIuNDg0OS01LjM2NDQtMi4yODc2LTUuNTk3OGwtOC43MTg3Mi0uODQwNWMtLjQzNDEzLS4wNDE4LS43NTE3Mi0uNDIzNS0uNzA5MzYtLjg1MjQuMDM0OTMtLjM1MzcuMzA3MzktLjYzOTQuNjYyNy0uNjk1bDkuMTUzMzgtMS40Mjk5YzIuNjU5NC0uMzYyNSAzLjg3MTgtMy41MTE3IDIuMTQyMS01LjU1NzZsLTIuMTkyLTIuNTg0MWMtLjMyMTctLjM3OTItLjI3MTMtLjk0NDMuMTEyNi0xLjI2MjEuMzI1My0uMjY5NC43OTYzLS4yNzk3IDEuMTMzNC0uMDI0OWwyLjY5MTggMi4wMzQ3YzIuMTQyMSAxLjYxMDkgNS4yMjk3LjI0MTcgNS40NTYxLTIuNDI0M2wuNzI0MS04LjU1OTk4Yy4wNDU3LS41NDA4LjUyNjUtLjk0MjU3IDEuMDczOS0uODk3Mzd6bS0yMy4xODczMyAyMC40Mzk2NWMuNTI1MDQgMCAuOTUwNjcuNDIxLjk1MDY3Ljk0MDNzLS40MjU2My45NDAzLS45NTA2Ny45NDAzYy0uNTI1MDQxIDAtLjk1MDY3LS40MjEtLjk1MDY3LS45NDAzcy40MjU2MjktLjk0MDMuOTUwNjctLjk0MDN6bTQ3LjY3OTczLS45NTQ3Yy41MjUgMCAuOTUwNy40MjEuOTUwNy45NDAzcy0uNDI1Ny45NDAyLS45NTA3Ljk0MDItLjk1MDctLjQyMDktLjk1MDctLjk0MDIuNDI1Ny0uOTQwMy45NTA3LS45NDAzem0tMjQuNjI5Ni0yMi40Nzk3Yy41MjUgMCAuOTUwNi40MjA5NzMuOTUwNi45NDAyNyAwIC41MTkzLS40MjU2Ljk0MDI3LS45NTA2Ljk0MDI3LS41MjUxIDAtLjk1MDctLjQyMDk3LS45NTA3LS45NDAyNyAwLS41MTkyOTcuNDI1Ni0uOTQwMjcuOTUwNy0uOTQwMjd6IiBmaWxsPSJ1cmwoI2IpIi8+PHBhdGggZD0ibTI0LjU3MSAzMi43NzkyYzQuOTU5NiAwIDguOTgwMi0zLjk3NjUgOC45ODAyLTguODgxOSAwLTQuOTA1My00LjAyMDYtOC44ODE5LTguOTgwMi04Ljg4MTlzLTguOTgwMiAzLjk3NjYtOC45ODAyIDguODgxOWMwIDQuOTA1NCA0LjAyMDYgOC44ODE5IDguOTgwMiA4Ljg4MTl6IiBmaWxsPSJ1cmwoI2MpIi8+PC9zdmc+';\n        this.supportedTransactionVersions = new Set(['legacy', 0]);\n        this._readyState = typeof window === 'undefined' || typeof document === 'undefined'\n            ? WalletReadyState.Unsupported\n            : WalletReadyState.Loadable;\n        this._disconnected = () => {\n            const wallet = this._wallet;\n            if (wallet) {\n                wallet.off('disconnect', this._disconnected);\n                this._wallet = null;\n                this._publicKey = null;\n                this.emit('error', new WalletDisconnectedError());\n                this.emit('disconnect');\n            }\n        };\n        this._accountChanged = (newPublicKey) => {\n            if (!newPublicKey)\n                return;\n            const publicKey = this._publicKey;\n            if (!publicKey)\n                return;\n            try {\n                newPublicKey = new index_browser_esm.PublicKey(newPublicKey.toBytes());\n            }\n            catch (error) {\n                this.emit('error', new WalletPublicKeyError(error?.message, error));\n                return;\n            }\n            if (publicKey.equals(newPublicKey))\n                return;\n            this._publicKey = newPublicKey;\n            this.emit('connect', newPublicKey);\n        };\n        this._connecting = false;\n        this._publicKey = null;\n        this._wallet = null;\n        this._config = config;\n        if (this._readyState !== WalletReadyState.Unsupported) {\n            scopePollingDetectionStrategy(() => {\n                if (window.solflare?.isSolflare || window.SolflareApp) {\n                    this._readyState = WalletReadyState.Installed;\n                    this.emit('readyStateChange', this._readyState);\n                    return true;\n                }\n                return false;\n            });\n            detectAndRegisterSolflareMetaMaskWallet();\n        }\n    }\n    get publicKey() {\n        return this._publicKey;\n    }\n    get connecting() {\n        return this._connecting;\n    }\n    get connected() {\n        return !!this._wallet?.connected;\n    }\n    get readyState() {\n        return this._readyState;\n    }\n    async autoConnect() {\n        // Skip autoconnect in the Loadable state on iOS\n        // We can't redirect to a universal link without user input\n        if (!(this.readyState === WalletReadyState.Loadable && isIosAndRedirectable())) {\n            await this.connect();\n        }\n    }\n    async connect() {\n        try {\n            if (this.connected || this.connecting)\n                return;\n            if (this._readyState !== WalletReadyState.Loadable && this._readyState !== WalletReadyState.Installed)\n                throw new WalletNotReadyError();\n            // redirect to the Solflare /browse universal link\n            // this will open the current URL in the Solflare in-wallet browser\n            if (this.readyState === WalletReadyState.Loadable && isIosAndRedirectable()) {\n                const url = encodeURIComponent(window.location.href);\n                const ref = encodeURIComponent(window.location.origin);\n                window.location.href = `https://solflare.com/ul/v1/browse/${url}?ref=${ref}`;\n                return;\n            }\n            let SolflareClass;\n            try {\n                SolflareClass = (await __webpack_require__.e(/* import() */ 119).then(__webpack_require__.bind(__webpack_require__, 119))).default;\n            }\n            catch (error) {\n                throw new WalletLoadError(error?.message, error);\n            }\n            let wallet;\n            try {\n                wallet = new SolflareClass({ network: this._config.network });\n            }\n            catch (error) {\n                throw new WalletConfigError(error?.message, error);\n            }\n            this._connecting = true;\n            if (!wallet.connected) {\n                try {\n                    await wallet.connect();\n                }\n                catch (error) {\n                    throw new WalletConnectionError(error?.message, error);\n                }\n            }\n            if (!wallet.publicKey)\n                throw new WalletConnectionError();\n            let publicKey;\n            try {\n                publicKey = new index_browser_esm.PublicKey(wallet.publicKey.toBytes());\n            }\n            catch (error) {\n                throw new WalletPublicKeyError(error?.message, error);\n            }\n            wallet.on('disconnect', this._disconnected);\n            wallet.on('accountChanged', this._accountChanged);\n            this._wallet = wallet;\n            this._publicKey = publicKey;\n            this.emit('connect', publicKey);\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n        finally {\n            this._connecting = false;\n        }\n    }\n    async disconnect() {\n        const wallet = this._wallet;\n        if (wallet) {\n            wallet.off('disconnect', this._disconnected);\n            wallet.off('accountChanged', this._accountChanged);\n            this._wallet = null;\n            this._publicKey = null;\n            try {\n                await wallet.disconnect();\n            }\n            catch (error) {\n                this.emit('error', new WalletDisconnectionError(error?.message, error));\n            }\n        }\n        this.emit('disconnect');\n    }\n    async sendTransaction(transaction, connection, options = {}) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                const { signers, ...sendOptions } = options;\n                if (isVersionedTransaction(transaction)) {\n                    signers?.length && transaction.sign(signers);\n                }\n                else {\n                    transaction = (await this.prepareTransaction(transaction, connection, sendOptions));\n                    signers?.length && transaction.partialSign(...signers);\n                }\n                sendOptions.preflightCommitment = sendOptions.preflightCommitment || connection.commitment;\n                return await wallet.signAndSendTransaction(transaction, sendOptions);\n            }\n            catch (error) {\n                if (error instanceof WalletError)\n                    throw error;\n                throw new WalletSendTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signTransaction(transaction) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signTransaction(transaction)) || transaction;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signAllTransactions(transactions) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return (await wallet.signAllTransactions(transactions)) || transactions;\n            }\n            catch (error) {\n                throw new WalletSignTransactionError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n    async signMessage(message) {\n        try {\n            const wallet = this._wallet;\n            if (!wallet)\n                throw new WalletNotConnectedError();\n            try {\n                return await wallet.signMessage(message, 'utf8');\n            }\n            catch (error) {\n                throw new WalletSignMessageError(error?.message, error);\n            }\n        }\n        catch (error) {\n            this.emit('error', error);\n            throw error;\n        }\n    }\n}\n//# sourceMappingURL=adapter.js.map\n;// CONCATENATED MODULE: ./src/providers/wallet/index.tsx\n\n\n// Default styles that can be overridden by your app\n\n\n\n\n\n\nconst wallet_Provider = (param)=>{\n    let { children  } = param;\n    const network = WalletAdapterNetwork.Devnet;\n    // You can also provide a custom RPC endpoint.\n    const endpoint = (0,react.useMemo)(()=>(0,index_browser_esm.clusterApiUrl)(network), [\n        network\n    ]);\n    const wallets = (0,react.useMemo)(()=>[\n            new PhantomWalletAdapter(),\n            new SolflareWalletAdapter()\n        ], [\n        network\n    ]);\n    return /*#__PURE__*/ (0,jsx_runtime.jsx)(ConnectionProvider, {\n        endpoint: endpoint,\n        children: /*#__PURE__*/ (0,jsx_runtime.jsx)(WalletProvider, {\n            wallets: wallets,\n            autoConnect: true,\n            children: /*#__PURE__*/ (0,jsx_runtime.jsx)(WalletModalProvider, {\n                children: children\n            })\n        })\n    });\n};\n/* harmony default export */ var wallet = (wallet_Provider);\n\n// EXTERNAL MODULE: ./node_modules/@emotion/cache/dist/emotion-cache.browser.esm.js + 7 modules\nvar emotion_cache_browser_esm = __webpack_require__(8417);\n;// CONCATENATED MODULE: ./src/utils/create-emotion-cache.ts\n\nconst create_emotion_cache_isBrowser = typeof document !== \"undefined\";\n// On the client side, Create a meta tag at the top of the <head> and set it as insertionPoint.\n// This assures that MUI styles are loaded first.\n// It allows developers to easily override MUI styles with other styling solutions, like CSS modules.\nconst createEmotionCache = ()=>{\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    let insertionPoint;\n    if (create_emotion_cache_isBrowser) {\n        const emotionInsertionPoint = document.querySelector('meta[name=\"emotion-insertion-point\"]');\n        insertionPoint = emotionInsertionPoint !== null && emotionInsertionPoint !== void 0 ? emotionInsertionPoint : undefined;\n    }\n    return (0,emotion_cache_browser_esm/* default */.Z)({\n        key: \"mui-style\",\n        prepend: true,\n        insertionPoint\n    });\n};\n\n\n;// CONCATENATED MODULE: ./src/pages/_app.tsx\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n// Client-side cache, shared for the whole session of the user in the browser.\nconst clientSideEmotionCache = createEmotionCache();\nfunction MyApp(props) {\n    const { Component , emotionCache =clientSideEmotionCache , pageProps  } = props;\n    const queryClient = (0,react.useMemo)(()=>new es.QueryClient(), []);\n    return /*#__PURE__*/ (0,jsx_runtime.jsx)(AnimatePresence, {\n        mode: \"wait\",\n        children: /*#__PURE__*/ (0,jsx_runtime.jsxs)(emotion_element_43c6fea0_browser_esm.C, {\n            value: emotionCache,\n            children: [\n                /*#__PURE__*/ (0,jsx_runtime.jsxs)((head_default()), {\n                    children: [\n                        /*#__PURE__*/ (0,jsx_runtime.jsx)(\"title\", {\n                            children: \"Airdrop\"\n                        }),\n                        /*#__PURE__*/ (0,jsx_runtime.jsx)(\"meta\", {\n                            name: \"viewport\",\n                            content: \"width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1\"\n                        })\n                    ]\n                }),\n                /*#__PURE__*/ (0,jsx_runtime.jsx)(es.QueryClientProvider, {\n                    client: queryClient,\n                    children: /*#__PURE__*/ (0,jsx_runtime.jsx)(es.Hydrate, {\n                        state: pageProps.dehydratedState,\n                        children: /*#__PURE__*/ (0,jsx_runtime.jsx)(theme, {\n                            children: /*#__PURE__*/ (0,jsx_runtime.jsxs)(wallet, {\n                                children: [\n                                    /*#__PURE__*/ (0,jsx_runtime.jsx)(solana/* SolanaProvider */.Q, {\n                                        children: /*#__PURE__*/ (0,jsx_runtime.jsx)(Component, {\n                                            ...pageProps\n                                        })\n                                    }),\n                                    /*#__PURE__*/ (0,jsx_runtime.jsx)(devtools.ReactQueryDevtools, {\n                                        initialIsOpen: false\n                                    })\n                                ]\n                            })\n                        })\n                    })\n                })\n            ]\n        })\n    });\n}\nMyApp.propTypes = {\n    Component: (prop_types_default()).elementType.isRequired,\n    emotionCache: (prop_types_default()).object,\n    pageProps: (prop_types_default()).object.isRequired\n};\n\n\n/***/ }),\n\n/***/ 3671:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Q\": function() { return /* binding */ SolanaProvider; },\n  \"X\": function() { return /* binding */ useSolana; }\n});\n\n// EXTERNAL MODULE: ./node_modules/react/jsx-runtime.js\nvar jsx_runtime = __webpack_require__(5893);\n// EXTERNAL MODULE: ./node_modules/react/index.js\nvar react = __webpack_require__(7294);\n;// CONCATENATED MODULE: ./src/types/merkle_distributor.ts\nconst IDL = {\n    version: \"0.0.1\",\n    name: \"merkle_distributor\",\n    instructions: [\n        {\n            name: \"newDistributor\",\n            docs: [\n                \"READ THE FOLLOWING:\",\n                \"\",\n                \"This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.\",\n                \"\",\n                \"An attack could look like:\",\n                \"- A legitimate user opens a new distributor.\",\n                \"- Someone observes the call to this instruction.\",\n                \"- They replace the clawback_receiver, admin, or time parameters with their own.\",\n                \"\",\n                \"One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.\",\n                \"Then the attacker can steal all funds from the distributor to their own clawback_receiver account.\",\n                \"\",\n                \"HOW TO AVOID:\",\n                \"- When you call into this instruction, ensure your transaction succeeds.\",\n                \"- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and\",\n                \"assert the parameters are what you expect, most importantly the clawback_receiver and admin.\",\n                \"- If your transaction fails, double check the value on-chain matches what you expect.\"\n            ],\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"[MerkleDistributor].\"\n                    ],\n                    pda: {\n                        seeds: [\n                            {\n                                kind: \"const\",\n                                type: \"string\",\n                                value: \"MerkleDistributor\"\n                            },\n                            {\n                                kind: \"account\",\n                                type: \"publicKey\",\n                                account: \"Mint\",\n                                path: \"mint\"\n                            },\n                            {\n                                kind: \"arg\",\n                                type: \"u64\",\n                                path: \"version\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    name: \"clawbackReceiver\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"Clawback receiver token account\"\n                    ]\n                },\n                {\n                    name: \"mint\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The mint to distribute.\"\n                    ]\n                },\n                {\n                    name: \"tokenVault\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"Token vault\"\n                    ]\n                },\n                {\n                    name: \"admin\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Admin wallet, responsible for creating the distributor and paying for the transaction.\",\n                        \"Also has the authority to set the clawback receiver and change itself.\"\n                    ]\n                },\n                {\n                    name: \"systemProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    name: \"associatedTokenProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The [Associated Token] program.\"\n                    ]\n                },\n                {\n                    name: \"tokenProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The [Token] program.\"\n                    ]\n                }\n            ],\n            args: [\n                {\n                    name: \"version\",\n                    type: \"u64\"\n                },\n                {\n                    name: \"root\",\n                    type: {\n                        array: [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                },\n                {\n                    name: \"maxTotalClaim\",\n                    type: \"u64\"\n                },\n                {\n                    name: \"maxNumNodes\",\n                    type: \"u64\"\n                },\n                {\n                    name: \"startTs\",\n                    type: \"i64\"\n                },\n                {\n                    name: \"endTs\",\n                    type: \"i64\"\n                }\n            ]\n        },\n        {\n            name: \"newClaim\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"claimStatus\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"Claim status PDA\"\n                    ],\n                    pda: {\n                        seeds: [\n                            {\n                                kind: \"const\",\n                                type: \"string\",\n                                value: \"ClaimStatus\"\n                            },\n                            {\n                                kind: \"account\",\n                                type: \"publicKey\",\n                                path: \"claimant\"\n                            },\n                            {\n                                kind: \"account\",\n                                type: \"publicKey\",\n                                account: \"MerkleDistributor\",\n                                path: \"distributor\"\n                            }\n                        ]\n                    }\n                },\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"Account to send the claimed tokens to.\"\n                    ]\n                },\n                {\n                    name: \"claimant\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Who is claiming the tokens.\"\n                    ]\n                },\n                {\n                    name: \"tokenProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"SPL [Token] program.\"\n                    ]\n                },\n                {\n                    name: \"systemProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The [System] program.\"\n                    ]\n                }\n            ],\n            args: [\n                {\n                    name: \"index\",\n                    type: \"u64\"\n                },\n                {\n                    name: \"amount\",\n                    type: \"u64\"\n                },\n                {\n                    name: \"proof\",\n                    type: {\n                        vec: {\n                            array: [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    }\n                }\n            ]\n        },\n        {\n            name: \"clawback\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"from\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"Distributor ATA containing the tokens to distribute.\"\n                    ]\n                },\n                {\n                    name: \"to\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The Clawback token account.\"\n                    ]\n                },\n                {\n                    name: \"claimant\",\n                    isMut: false,\n                    isSigner: true,\n                    docs: [\n                        \"Claimant account\",\n                        \"Anyone can claw back the funds\"\n                    ]\n                },\n                {\n                    name: \"systemProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"The [System] program.\"\n                    ]\n                },\n                {\n                    name: \"tokenProgram\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"SPL [Token] program.\"\n                    ]\n                }\n            ],\n            args: [\n                {\n                    name: \"amount\",\n                    type: \"u64\"\n                }\n            ]\n        },\n        {\n            name: \"setClawbackReceiver\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"newClawbackAccount\",\n                    isMut: false,\n                    isSigner: false,\n                    docs: [\n                        \"New clawback account\"\n                    ]\n                },\n                {\n                    name: \"admin\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            args: []\n        },\n        {\n            name: \"setAdmin\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"admin\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Admin signer\"\n                    ]\n                },\n                {\n                    name: \"newAdmin\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"New admin account\"\n                    ]\n                }\n            ],\n            args: []\n        },\n        {\n            name: \"setTimestamp\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"admin\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            args: [\n                {\n                    name: \"startTs\",\n                    type: \"i64\"\n                },\n                {\n                    name: \"endTs\",\n                    type: \"i64\"\n                }\n            ]\n        },\n        {\n            name: \"setMerkleRoot\",\n            accounts: [\n                {\n                    name: \"distributor\",\n                    isMut: true,\n                    isSigner: false,\n                    docs: [\n                        \"The [MerkleDistributor].\"\n                    ]\n                },\n                {\n                    name: \"admin\",\n                    isMut: true,\n                    isSigner: true,\n                    docs: [\n                        \"Admin signer\"\n                    ]\n                }\n            ],\n            args: [\n                {\n                    name: \"root\",\n                    type: {\n                        array: [\n                            \"u8\",\n                            32\n                        ]\n                    }\n                }\n            ]\n        }\n    ],\n    accounts: [\n        {\n            name: \"claimStatus\",\n            docs: [\n                \"Holds whether or not a claimant has claimed tokens.\"\n            ],\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"isClaimed\",\n                        docs: [\n                            \"If true, the tokens have been claimed.\"\n                        ],\n                        type: \"bool\"\n                    },\n                    {\n                        name: \"claimant\",\n                        docs: [\n                            \"Authority that claimed the tokens.\"\n                        ],\n                        type: \"publicKey\"\n                    },\n                    {\n                        name: \"claimedAt\",\n                        docs: [\n                            \"When the tokens were claimed.\"\n                        ],\n                        type: \"i64\"\n                    },\n                    {\n                        name: \"amount\",\n                        docs: [\n                            \"Amount of tokens claimed.\"\n                        ],\n                        type: \"u64\"\n                    }\n                ]\n            }\n        },\n        {\n            name: \"merkleDistributor\",\n            docs: [\n                \"State for the account which distributes tokens.\"\n            ],\n            type: {\n                kind: \"struct\",\n                fields: [\n                    {\n                        name: \"bump\",\n                        docs: [\n                            \"Bump seed.\"\n                        ],\n                        type: \"u8\"\n                    },\n                    {\n                        name: \"version\",\n                        docs: [\n                            \"Version of the airdrop\"\n                        ],\n                        type: \"u64\"\n                    },\n                    {\n                        name: \"root\",\n                        docs: [\n                            \"The 256-bit merkle root.\"\n                        ],\n                        type: {\n                            array: [\n                                \"u8\",\n                                32\n                            ]\n                        }\n                    },\n                    {\n                        name: \"mint\",\n                        docs: [\n                            \"[Mint] of the token to be distributed.\"\n                        ],\n                        type: \"publicKey\"\n                    },\n                    {\n                        name: \"tokenVault\",\n                        docs: [\n                            \"Token Address of the vault\"\n                        ],\n                        type: \"publicKey\"\n                    },\n                    {\n                        name: \"maxTotalClaim\",\n                        docs: [\n                            \"Maximum number of tokens that can ever be claimed from this [MerkleDistributor].\"\n                        ],\n                        type: \"u64\"\n                    },\n                    {\n                        name: \"maxNumNodes\",\n                        docs: [\n                            \"Maximum number of nodes in [MerkleDistributor].\"\n                        ],\n                        type: \"u64\"\n                    },\n                    {\n                        name: \"totalAmountClaimed\",\n                        docs: [\n                            \"Total amount of tokens that have been claimed.\"\n                        ],\n                        type: \"u64\"\n                    },\n                    {\n                        name: \"numNodesClaimed\",\n                        docs: [\n                            \"Number of nodes that have been claimed.\"\n                        ],\n                        type: \"u64\"\n                    },\n                    {\n                        name: \"startTs\",\n                        docs: [\n                            \"Claim time start (Unix Timestamp)\"\n                        ],\n                        type: \"i64\"\n                    },\n                    {\n                        name: \"endTs\",\n                        docs: [\n                            \"Claim time end (Unix Timestamp)\"\n                        ],\n                        type: \"i64\"\n                    },\n                    {\n                        name: \"clawbackReceiver\",\n                        docs: [\n                            \"Clawback receiver\"\n                        ],\n                        type: \"publicKey\"\n                    },\n                    {\n                        name: \"admin\",\n                        docs: [\n                            \"Admin wallet\"\n                        ],\n                        type: \"publicKey\"\n                    }\n                ]\n            }\n        }\n    ],\n    events: [\n        {\n            name: \"NewClaimEvent\",\n            fields: [\n                {\n                    name: \"claimant\",\n                    type: \"publicKey\",\n                    index: false\n                },\n                {\n                    name: \"timestamp\",\n                    type: \"i64\",\n                    index: false\n                }\n            ]\n        },\n        {\n            name: \"ClaimedEvent\",\n            fields: [\n                {\n                    name: \"claimant\",\n                    type: \"publicKey\",\n                    index: false\n                },\n                {\n                    name: \"amount\",\n                    type: \"u64\",\n                    index: false\n                }\n            ]\n        }\n    ],\n    errors: [\n        {\n            code: 6000,\n            name: \"InvalidProof\",\n            msg: \"Invalid Merkle proof\"\n        },\n        {\n            code: 6001,\n            name: \"ExceededMaxClaim\",\n            msg: \"Exceeded maximum claim amount\"\n        },\n        {\n            code: 6002,\n            name: \"MaxNodesExceeded\",\n            msg: \"Exceeded maximum node count\"\n        },\n        {\n            code: 6003,\n            name: \"Unauthorized\",\n            msg: \"Account is not authorized to execute this instruction\"\n        },\n        {\n            code: 6004,\n            name: \"OwnerMismatch\",\n            msg: \"Token account owner did not match intended owner\"\n        },\n        {\n            code: 6005,\n            name: \"SameClawbackReceiver\",\n            msg: \"New and old Clawback receivers are identical\"\n        },\n        {\n            code: 6006,\n            name: \"SameAdmin\",\n            msg: \"New and old admin are identical\"\n        },\n        {\n            code: 6007,\n            name: \"ClaimExpired\",\n            msg: \"Claim window expired\"\n        },\n        {\n            code: 6008,\n            name: \"ArithmeticError\",\n            msg: \"Arithmetic Error (overflow/underflow)\"\n        },\n        {\n            code: 6009,\n            name: \"StartTimestampAfterEnd\",\n            msg: \"Start Timestamp cannot be after end Timestamp\"\n        },\n        {\n            code: 6010,\n            name: \"TimestampsNotInFuture\",\n            msg: \"Timestamps cannot be in the past\"\n        },\n        {\n            code: 6011,\n            name: \"DistributionAlreadyStarted\",\n            msg: \"Distribution already started\"\n        },\n        {\n            code: 6012,\n            name: \"InsufficientClawbackAmount\",\n            msg: \"Insufficient clawback amount\"\n        }\n    ]\n};\n\n// EXTERNAL MODULE: ./node_modules/@coral-xyz/anchor/dist/browser/index.js\nvar browser = __webpack_require__(9828);\n// EXTERNAL MODULE: ./node_modules/@coral-xyz/anchor/dist/cjs/nodewallet.js\nvar nodewallet = __webpack_require__(3909);\n// EXTERNAL MODULE: ./node_modules/@project-serum/anchor/dist/browser/index.js\nvar dist_browser = __webpack_require__(4758);\n// EXTERNAL MODULE: ./node_modules/@renec-foundation/distributor-sdk/dist/index.js\nvar dist = __webpack_require__(1142);\n// EXTERNAL MODULE: ./node_modules/@solana/wallet-adapter-react/lib/esm/useWallet.js\nvar useWallet = __webpack_require__(4306);\n// EXTERNAL MODULE: ./node_modules/@solana/web3.js/lib/index.browser.esm.js + 15 modules\nvar index_browser_esm = __webpack_require__(6737);\n;// CONCATENATED MODULE: ./src/providers/solana/index.tsx\n\n\n\n\n\n\n\n\n\nconst defaultSolanaContext = {\n    connection: null,\n    provider: null,\n    program: null,\n    ctx: null,\n    distributorClient: null,\n    mintPublicKey: new index_browser_esm.PublicKey(\"11111111111111111111111111111111\"),\n    merkleTreeVersion: 1,\n    distributor: null,\n    publicKey: null,\n    connected: false,\n    connect: async ()=>{},\n    disconnect: async ()=>{}\n};\nconst SolanaContext = /*#__PURE__*/ react.createContext(defaultSolanaContext);\nconst SolanaProvider = (param)=>{\n    let { children  } = param;\n    const { connect , disconnect , connected , publicKey: userPublicKey , signTransaction , signAllTransactions  } = (0,useWallet/* useWallet */.O)();\n    const defaultKeypair = index_browser_esm.Keypair.generate();\n    const defaultWallet = new nodewallet/* default */.Z(defaultKeypair);\n    const [publicKey, setPublicKey] = (0,react.useState)(defaultKeypair.publicKey);\n    const connectionUrl = \"https://young-solemn-lake.solana-mainnet.quiknode.pro/f42e97b38309d8c0fa5f463a5945dd044dbdee6c\";\n    if (!connectionUrl) {\n        throw new Error(\"NEXT_PUBLIC_SOLANA_CONNECTION_URL is not defined\");\n    }\n    const connection = new index_browser_esm.Connection(connectionUrl, \"confirmed\");\n    const [provider, setProvider] = (0,react.useState)(new dist_browser.AnchorProvider(connection, defaultWallet, {}));\n    const programAddress = \"EqaUmBqKuUsS8C1HwvckQymErozrmzzivxkP9CazU2mX\";\n    if (!programAddress) {\n        throw new Error(\"NEXT_PUBLIC_PROGRAM_ADDRESS is not defined\");\n    }\n    const programId = new index_browser_esm.PublicKey(programAddress);\n    const program = new dist_browser.Program(IDL, programId, provider);\n    const ctx = dist.Context.withProvider(provider, new index_browser_esm.PublicKey(program.programId));\n    const distributorClient = new dist.DistributorClient(ctx, new dist.PDA(program.programId));\n    const mintAddress = \"DU16Ea8MidPg8GcDYhCBx88THwYXSDiAXDnGA7xfe1HA\"; // TODO move to useEffect if get mintAddress from database\n    if (!mintAddress) {\n        throw new Error(\"NEXT_PUBLIC_MINT_ADDRESS is not defined\");\n    }\n    const mintPublicKey = new index_browser_esm.PublicKey(mintAddress);\n    var _process_env_NEXT_PUBLIC_MERKLE_TREE_VERSION;\n    const merkleTreeVersion = parseInt((_process_env_NEXT_PUBLIC_MERKLE_TREE_VERSION = \"1\") !== null && _process_env_NEXT_PUBLIC_MERKLE_TREE_VERSION !== void 0 ? _process_env_NEXT_PUBLIC_MERKLE_TREE_VERSION : \"1\", 10);\n    const distributor = distributorClient.pda.distributor(mintPublicKey, new browser.BN(merkleTreeVersion));\n    (0,react.useEffect)(()=>{\n        if (connected && userPublicKey) {\n            setPublicKey(userPublicKey);\n            setProvider(new dist_browser.AnchorProvider(connection, {\n                publicKey: userPublicKey,\n                signTransaction: signTransaction,\n                signAllTransactions: signAllTransactions\n            }, {}));\n        } else {\n            setPublicKey(defaultKeypair.publicKey);\n            setProvider(new dist_browser.AnchorProvider(connection, defaultWallet, {}));\n        }\n    }, [\n        connected,\n        userPublicKey\n    ]);\n    const handleConnect = async ()=>{\n        await connect();\n    };\n    const handleDisconnect = async ()=>{\n        await disconnect();\n    };\n    const value = {\n        connection,\n        provider,\n        program,\n        ctx,\n        distributorClient,\n        mintPublicKey,\n        merkleTreeVersion,\n        distributor,\n        publicKey,\n        connected,\n        connect: handleConnect,\n        disconnect: handleDisconnect\n    };\n    return /*#__PURE__*/ (0,jsx_runtime.jsx)(SolanaContext.Provider, {\n        value: value,\n        children: children\n    });\n};\nconst useSolana = ()=>(0,react.useContext)(SolanaContext);\n\n\n/***/ }),\n\n/***/ 393:\n/***/ (function() {\n\n// extracted by mini-css-extract-plugin\n\n/***/ }),\n\n/***/ 511:\n/***/ (function() {\n\n// extracted by mini-css-extract-plugin\n\n/***/ }),\n\n/***/ 6106:\n/***/ (function() {\n\n// extracted by mini-css-extract-plugin\n\n/***/ }),\n\n/***/ 6672:\n/***/ (function() {\n\n// extracted by mini-css-extract-plugin\n\n/***/ }),\n\n/***/ 9008:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nmodule.exports = __webpack_require__(3121)\n\n\n/***/ }),\n\n/***/ 4244:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n\n\n/***/ }),\n\n/***/ 609:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar define = __webpack_require__(4289);\nvar callBind = __webpack_require__(5559);\n\nvar implementation = __webpack_require__(4244);\nvar getPolyfill = __webpack_require__(5624);\nvar shim = __webpack_require__(2281);\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n\n\n/***/ }),\n\n/***/ 5624:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar implementation = __webpack_require__(4244);\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n\n\n/***/ }),\n\n/***/ 2281:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar getPolyfill = __webpack_require__(5624);\nvar define = __webpack_require__(4289);\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n\n\n/***/ }),\n\n/***/ 8987:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = __webpack_require__(1414); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n\n\n/***/ }),\n\n/***/ 2215:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar slice = Array.prototype.slice;\nvar isArgs = __webpack_require__(1414);\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : __webpack_require__(8987);\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n\n\n/***/ }),\n\n/***/ 1414:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n\n\n/***/ }),\n\n/***/ 9908:\n/***/ (function(module) {\n\n\"use strict\";\n\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n\n\n/***/ }),\n\n/***/ 4155:\n/***/ (function(module) {\n\n// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n\n/***/ }),\n\n/***/ 5273:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar errcode = __webpack_require__(2114);\nvar retry = __webpack_require__(1298);\n\nvar hasOwn = Object.prototype.hasOwnProperty;\n\nfunction isRetryError(err) {\n    return err && err.code === 'EPROMISERETRY' && hasOwn.call(err, 'retried');\n}\n\nfunction promiseRetry(fn, options) {\n    var temp;\n    var operation;\n\n    if (typeof fn === 'object' && typeof options === 'function') {\n        // Swap options and fn when using alternate signature (options, fn)\n        temp = options;\n        options = fn;\n        fn = temp;\n    }\n\n    operation = retry.operation(options);\n\n    return new Promise(function (resolve, reject) {\n        operation.attempt(function (number) {\n            Promise.resolve()\n            .then(function () {\n                return fn(function (err) {\n                    if (isRetryError(err)) {\n                        err = err.retried;\n                    }\n\n                    throw errcode(new Error('Retrying'), 'EPROMISERETRY', { retried: err });\n                }, number);\n            })\n            .then(resolve, function (err) {\n                if (isRetryError(err)) {\n                    err = err.retried;\n\n                    if (operation.retry(err || new Error())) {\n                        return;\n                    }\n                }\n\n                reject(err);\n            });\n        });\n    });\n}\n\nmodule.exports = promiseRetry;\n\n\n/***/ }),\n\n/***/ 1298:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nmodule.exports = __webpack_require__(5297);\n\n/***/ }),\n\n/***/ 5297:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\nvar RetryOperation = __webpack_require__(7361);\n\nexports.operation = function(options) {\n  var timeouts = exports.timeouts(options);\n  return new RetryOperation(timeouts, {\n      forever: options && options.forever,\n      unref: options && options.unref,\n      maxRetryTime: options && options.maxRetryTime\n  });\n};\n\nexports.timeouts = function(options) {\n  if (options instanceof Array) {\n    return [].concat(options);\n  }\n\n  var opts = {\n    retries: 10,\n    factor: 2,\n    minTimeout: 1 * 1000,\n    maxTimeout: Infinity,\n    randomize: false\n  };\n  for (var key in options) {\n    opts[key] = options[key];\n  }\n\n  if (opts.minTimeout > opts.maxTimeout) {\n    throw new Error('minTimeout is greater than maxTimeout');\n  }\n\n  var timeouts = [];\n  for (var i = 0; i < opts.retries; i++) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  if (options && options.forever && !timeouts.length) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  // sort the array numerically ascending\n  timeouts.sort(function(a,b) {\n    return a - b;\n  });\n\n  return timeouts;\n};\n\nexports.createTimeout = function(attempt, opts) {\n  var random = (opts.randomize)\n    ? (Math.random() + 1)\n    : 1;\n\n  var timeout = Math.round(random * opts.minTimeout * Math.pow(opts.factor, attempt));\n  timeout = Math.min(timeout, opts.maxTimeout);\n\n  return timeout;\n};\n\nexports.wrap = function(obj, options, methods) {\n  if (options instanceof Array) {\n    methods = options;\n    options = null;\n  }\n\n  if (!methods) {\n    methods = [];\n    for (var key in obj) {\n      if (typeof obj[key] === 'function') {\n        methods.push(key);\n      }\n    }\n  }\n\n  for (var i = 0; i < methods.length; i++) {\n    var method   = methods[i];\n    var original = obj[method];\n\n    obj[method] = function retryWrapper(original) {\n      var op       = exports.operation(options);\n      var args     = Array.prototype.slice.call(arguments, 1);\n      var callback = args.pop();\n\n      args.push(function(err) {\n        if (op.retry(err)) {\n          return;\n        }\n        if (err) {\n          arguments[0] = op.mainError();\n        }\n        callback.apply(this, arguments);\n      });\n\n      op.attempt(function() {\n        original.apply(obj, args);\n      });\n    }.bind(obj, original);\n    obj[method].options = options;\n  }\n};\n\n\n/***/ }),\n\n/***/ 7361:\n/***/ (function(module) {\n\nfunction RetryOperation(timeouts, options) {\n  // Compatibility for the old (timeouts, retryForever) signature\n  if (typeof options === 'boolean') {\n    options = { forever: options };\n  }\n\n  this._originalTimeouts = JSON.parse(JSON.stringify(timeouts));\n  this._timeouts = timeouts;\n  this._options = options || {};\n  this._maxRetryTime = options && options.maxRetryTime || Infinity;\n  this._fn = null;\n  this._errors = [];\n  this._attempts = 1;\n  this._operationTimeout = null;\n  this._operationTimeoutCb = null;\n  this._timeout = null;\n  this._operationStart = null;\n\n  if (this._options.forever) {\n    this._cachedTimeouts = this._timeouts.slice(0);\n  }\n}\nmodule.exports = RetryOperation;\n\nRetryOperation.prototype.reset = function() {\n  this._attempts = 1;\n  this._timeouts = this._originalTimeouts;\n}\n\nRetryOperation.prototype.stop = function() {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  this._timeouts       = [];\n  this._cachedTimeouts = null;\n};\n\nRetryOperation.prototype.retry = function(err) {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  if (!err) {\n    return false;\n  }\n  var currentTime = new Date().getTime();\n  if (err && currentTime - this._operationStart >= this._maxRetryTime) {\n    this._errors.unshift(new Error('RetryOperation timeout occurred'));\n    return false;\n  }\n\n  this._errors.push(err);\n\n  var timeout = this._timeouts.shift();\n  if (timeout === undefined) {\n    if (this._cachedTimeouts) {\n      // retry forever, only keep last error\n      this._errors.splice(this._errors.length - 1, this._errors.length);\n      this._timeouts = this._cachedTimeouts.slice(0);\n      timeout = this._timeouts.shift();\n    } else {\n      return false;\n    }\n  }\n\n  var self = this;\n  var timer = setTimeout(function() {\n    self._attempts++;\n\n    if (self._operationTimeoutCb) {\n      self._timeout = setTimeout(function() {\n        self._operationTimeoutCb(self._attempts);\n      }, self._operationTimeout);\n\n      if (self._options.unref) {\n          self._timeout.unref();\n      }\n    }\n\n    self._fn(self._attempts);\n  }, timeout);\n\n  if (this._options.unref) {\n      timer.unref();\n  }\n\n  return true;\n};\n\nRetryOperation.prototype.attempt = function(fn, timeoutOps) {\n  this._fn = fn;\n\n  if (timeoutOps) {\n    if (timeoutOps.timeout) {\n      this._operationTimeout = timeoutOps.timeout;\n    }\n    if (timeoutOps.cb) {\n      this._operationTimeoutCb = timeoutOps.cb;\n    }\n  }\n\n  var self = this;\n  if (this._operationTimeoutCb) {\n    this._timeout = setTimeout(function() {\n      self._operationTimeoutCb();\n    }, self._operationTimeout);\n  }\n\n  this._operationStart = new Date().getTime();\n\n  this._fn(this._attempts);\n};\n\nRetryOperation.prototype.try = function(fn) {\n  console.log('Using RetryOperation.try() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = function(fn) {\n  console.log('Using RetryOperation.start() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = RetryOperation.prototype.try;\n\nRetryOperation.prototype.errors = function() {\n  return this._errors;\n};\n\nRetryOperation.prototype.attempts = function() {\n  return this._attempts;\n};\n\nRetryOperation.prototype.mainError = function() {\n  if (this._errors.length === 0) {\n    return null;\n  }\n\n  var counts = {};\n  var mainError = null;\n  var mainErrorCount = 0;\n\n  for (var i = 0; i < this._errors.length; i++) {\n    var error = this._errors[i];\n    var message = error.message;\n    var count = (counts[message] || 0) + 1;\n\n    counts[message] = count;\n\n    if (count >= mainErrorCount) {\n      mainError = error;\n      mainErrorCount = count;\n    }\n  }\n\n  return mainError;\n};\n\n\n/***/ }),\n\n/***/ 2703:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n\n\nvar ReactPropTypesSecret = __webpack_require__(414);\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n  function shim(props, propName, componentName, location, propFullName, secret) {\n    if (secret === ReactPropTypesSecret) {\n      // It is still safe when called from React.\n      return;\n    }\n    var err = new Error(\n      'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n      'Use PropTypes.checkPropTypes() to call them. ' +\n      'Read more at http://fb.me/use-check-prop-types'\n    );\n    err.name = 'Invariant Violation';\n    throw err;\n  };\n  shim.isRequired = shim;\n  function getShim() {\n    return shim;\n  };\n  // Important!\n  // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n  var ReactPropTypes = {\n    array: shim,\n    bigint: shim,\n    bool: shim,\n    func: shim,\n    number: shim,\n    object: shim,\n    string: shim,\n    symbol: shim,\n\n    any: shim,\n    arrayOf: getShim,\n    element: shim,\n    elementType: shim,\n    instanceOf: getShim,\n    node: shim,\n    objectOf: getShim,\n    oneOf: getShim,\n    oneOfType: getShim,\n    shape: getShim,\n    exact: getShim,\n\n    checkPropTypes: emptyFunctionWithReset,\n    resetWarningCache: emptyFunction\n  };\n\n  ReactPropTypes.PropTypes = ReactPropTypes;\n\n  return ReactPropTypes;\n};\n\n\n/***/ }),\n\n/***/ 5697:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (false) { var throwOnDirectAccess, ReactIs; } else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = __webpack_require__(2703)();\n}\n\n\n/***/ }),\n\n/***/ 414:\n/***/ (function(module) {\n\n\"use strict\";\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n\n\n/***/ }),\n\n/***/ 938:\n/***/ (function(module) {\n\nif (true) {\n  module.exports = {\n    ReactQueryDevtools: function () {\n      return null\n    },\n    ReactQueryDevtoolsPanel: function () {\n      return null\n    },\n  }\n} else {}\n\n\n/***/ }),\n\n/***/ 9852:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"j\": function() { return /* binding */ focusManager; }\n/* harmony export */ });\n/* unused harmony export FocusManager */\n/* harmony import */ var _babel_runtime_helpers_esm_inheritsLoose__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(5068);\n/* harmony import */ var _subscribable__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(2943);\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(2288);\n\n\n\nvar FocusManager = /*#__PURE__*/function (_Subscribable) {\n  (0,_babel_runtime_helpers_esm_inheritsLoose__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(FocusManager, _Subscribable);\n\n  function FocusManager() {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n\n    _this.setup = function (onFocus) {\n      var _window;\n\n      if (!_utils__WEBPACK_IMPORTED_MODULE_1__/* .isServer */ .sk && ((_window = window) == null ? void 0 : _window.addEventListener)) {\n        var listener = function listener() {\n          return onFocus();\n        }; // Listen to visibillitychange and focus\n\n\n        window.addEventListener('visibilitychange', listener, false);\n        window.addEventListener('focus', listener, false);\n        return function () {\n          // Be sure to unsubscribe if a new handler is set\n          window.removeEventListener('visibilitychange', listener);\n          window.removeEventListener('focus', listener);\n        };\n      }\n    };\n\n    return _this;\n  }\n\n  var _proto = FocusManager.prototype;\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (!this.cleanup) {\n      this.setEventListener(this.setup);\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.hasListeners()) {\n      var _this$cleanup;\n\n      (_this$cleanup = this.cleanup) == null ? void 0 : _this$cleanup.call(this);\n      this.cleanup = undefined;\n    }\n  };\n\n  _proto.setEventListener = function setEventListener(setup) {\n    var _this$cleanup2,\n        _this2 = this;\n\n    this.setup = setup;\n    (_this$cleanup2 = this.cleanup) == null ? void 0 : _this$cleanup2.call(this);\n    this.cleanup = setup(function (focused) {\n      if (typeof focused === 'boolean') {\n        _this2.setFocused(focused);\n      } else {\n        _this2.onFocus();\n      }\n    });\n  };\n\n  _proto.setFocused = function setFocused(focused) {\n    this.focused = focused;\n\n    if (focused) {\n      this.onFocus();\n    }\n  };\n\n  _proto.onFocus = function onFocus() {\n    this.listeners.forEach(function (listener) {\n      listener();\n    });\n  };\n\n  _proto.isFocused = function isFocused() {\n    if (typeof this.focused === 'boolean') {\n      return this.focused;\n    } // document global can be unavailable in react native\n\n\n    if (typeof document === 'undefined') {\n      return true;\n    }\n\n    return [undefined, 'visible', 'prerender'].includes(document.visibilityState);\n  };\n\n  return FocusManager;\n}(_subscribable__WEBPACK_IMPORTED_MODULE_2__/* .Subscribable */ .l);\nvar focusManager = new FocusManager();\n\n/***/ }),\n\n/***/ 6747:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"QueryClient\": function() { return /* reexport safe */ _queryClient__WEBPACK_IMPORTED_MODULE_0__.S; }\n/* harmony export */ });\n/* harmony import */ var _queryClient__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(9043);\n/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6755);\n/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_types__WEBPACK_IMPORTED_MODULE_1__);\n/* harmony reexport (checked) */ if(__webpack_require__.o(_types__WEBPACK_IMPORTED_MODULE_1__, \"Hydrate\")) __webpack_require__.d(__webpack_exports__, { \"Hydrate\": function() { return _types__WEBPACK_IMPORTED_MODULE_1__.Hydrate; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_types__WEBPACK_IMPORTED_MODULE_1__, \"QueryClientProvider\")) __webpack_require__.d(__webpack_exports__, { \"QueryClientProvider\": function() { return _types__WEBPACK_IMPORTED_MODULE_1__.QueryClientProvider; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_types__WEBPACK_IMPORTED_MODULE_1__, \"useMutation\")) __webpack_require__.d(__webpack_exports__, { \"useMutation\": function() { return _types__WEBPACK_IMPORTED_MODULE_1__.useMutation; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_types__WEBPACK_IMPORTED_MODULE_1__, \"useQuery\")) __webpack_require__.d(__webpack_exports__, { \"useQuery\": function() { return _types__WEBPACK_IMPORTED_MODULE_1__.useQuery; } });\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n // Types\n\n\n\n/***/ }),\n\n/***/ 1909:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"E\": function() { return /* binding */ setLogger; },\n/* harmony export */   \"j\": function() { return /* binding */ getLogger; }\n/* harmony export */ });\n// TYPES\n// FUNCTIONS\nvar logger = console;\nfunction getLogger() {\n  return logger;\n}\nfunction setLogger(newLogger) {\n  logger = newLogger;\n}\n\n/***/ }),\n\n/***/ 1262:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"R\": function() { return /* binding */ getDefaultState; },\n/* harmony export */   \"m\": function() { return /* binding */ Mutation; }\n/* harmony export */ });\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7462);\n/* harmony import */ var _logger__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(1909);\n/* harmony import */ var _notifyManager__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(101);\n/* harmony import */ var _retryer__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(1216);\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(2288);\n\n\n\n\n // TYPES\n\n// CLASS\nvar Mutation = /*#__PURE__*/function () {\n  function Mutation(config) {\n    this.options = (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, config.defaultOptions, config.options);\n    this.mutationId = config.mutationId;\n    this.mutationCache = config.mutationCache;\n    this.observers = [];\n    this.state = config.state || getDefaultState();\n    this.meta = config.meta;\n  }\n\n  var _proto = Mutation.prototype;\n\n  _proto.setState = function setState(state) {\n    this.dispatch({\n      type: 'setState',\n      state: state\n    });\n  };\n\n  _proto.addObserver = function addObserver(observer) {\n    if (this.observers.indexOf(observer) === -1) {\n      this.observers.push(observer);\n    }\n  };\n\n  _proto.removeObserver = function removeObserver(observer) {\n    this.observers = this.observers.filter(function (x) {\n      return x !== observer;\n    });\n  };\n\n  _proto.cancel = function cancel() {\n    if (this.retryer) {\n      this.retryer.cancel();\n      return this.retryer.promise.then(_utils__WEBPACK_IMPORTED_MODULE_1__/* .noop */ .ZT).catch(_utils__WEBPACK_IMPORTED_MODULE_1__/* .noop */ .ZT);\n    }\n\n    return Promise.resolve();\n  };\n\n  _proto.continue = function _continue() {\n    if (this.retryer) {\n      this.retryer.continue();\n      return this.retryer.promise;\n    }\n\n    return this.execute();\n  };\n\n  _proto.execute = function execute() {\n    var _this = this;\n\n    var data;\n    var restored = this.state.status === 'loading';\n    var promise = Promise.resolve();\n\n    if (!restored) {\n      this.dispatch({\n        type: 'loading',\n        variables: this.options.variables\n      });\n      promise = promise.then(function () {\n        // Notify cache callback\n        _this.mutationCache.config.onMutate == null ? void 0 : _this.mutationCache.config.onMutate(_this.state.variables, _this);\n      }).then(function () {\n        return _this.options.onMutate == null ? void 0 : _this.options.onMutate(_this.state.variables);\n      }).then(function (context) {\n        if (context !== _this.state.context) {\n          _this.dispatch({\n            type: 'loading',\n            context: context,\n            variables: _this.state.variables\n          });\n        }\n      });\n    }\n\n    return promise.then(function () {\n      return _this.executeMutation();\n    }).then(function (result) {\n      data = result; // Notify cache callback\n\n      _this.mutationCache.config.onSuccess == null ? void 0 : _this.mutationCache.config.onSuccess(data, _this.state.variables, _this.state.context, _this);\n    }).then(function () {\n      return _this.options.onSuccess == null ? void 0 : _this.options.onSuccess(data, _this.state.variables, _this.state.context);\n    }).then(function () {\n      return _this.options.onSettled == null ? void 0 : _this.options.onSettled(data, null, _this.state.variables, _this.state.context);\n    }).then(function () {\n      _this.dispatch({\n        type: 'success',\n        data: data\n      });\n\n      return data;\n    }).catch(function (error) {\n      // Notify cache callback\n      _this.mutationCache.config.onError == null ? void 0 : _this.mutationCache.config.onError(error, _this.state.variables, _this.state.context, _this); // Log error\n\n      (0,_logger__WEBPACK_IMPORTED_MODULE_2__/* .getLogger */ .j)().error(error);\n      return Promise.resolve().then(function () {\n        return _this.options.onError == null ? void 0 : _this.options.onError(error, _this.state.variables, _this.state.context);\n      }).then(function () {\n        return _this.options.onSettled == null ? void 0 : _this.options.onSettled(undefined, error, _this.state.variables, _this.state.context);\n      }).then(function () {\n        _this.dispatch({\n          type: 'error',\n          error: error\n        });\n\n        throw error;\n      });\n    });\n  };\n\n  _proto.executeMutation = function executeMutation() {\n    var _this2 = this,\n        _this$options$retry;\n\n    this.retryer = new _retryer__WEBPACK_IMPORTED_MODULE_3__/* .Retryer */ .m4({\n      fn: function fn() {\n        if (!_this2.options.mutationFn) {\n          return Promise.reject('No mutationFn found');\n        }\n\n        return _this2.options.mutationFn(_this2.state.variables);\n      },\n      onFail: function onFail() {\n        _this2.dispatch({\n          type: 'failed'\n        });\n      },\n      onPause: function onPause() {\n        _this2.dispatch({\n          type: 'pause'\n        });\n      },\n      onContinue: function onContinue() {\n        _this2.dispatch({\n          type: 'continue'\n        });\n      },\n      retry: (_this$options$retry = this.options.retry) != null ? _this$options$retry : 0,\n      retryDelay: this.options.retryDelay\n    });\n    return this.retryer.promise;\n  };\n\n  _proto.dispatch = function dispatch(action) {\n    var _this3 = this;\n\n    this.state = reducer(this.state, action);\n    _notifyManager__WEBPACK_IMPORTED_MODULE_4__/* .notifyManager.batch */ .V.batch(function () {\n      _this3.observers.forEach(function (observer) {\n        observer.onMutationUpdate(action);\n      });\n\n      _this3.mutationCache.notify(_this3);\n    });\n  };\n\n  return Mutation;\n}();\nfunction getDefaultState() {\n  return {\n    context: undefined,\n    data: undefined,\n    error: null,\n    failureCount: 0,\n    isPaused: false,\n    status: 'idle',\n    variables: undefined\n  };\n}\n\nfunction reducer(state, action) {\n  switch (action.type) {\n    case 'failed':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        failureCount: state.failureCount + 1\n      });\n\n    case 'pause':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        isPaused: true\n      });\n\n    case 'continue':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        isPaused: false\n      });\n\n    case 'loading':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        context: action.context,\n        data: undefined,\n        error: null,\n        isPaused: false,\n        status: 'loading',\n        variables: action.variables\n      });\n\n    case 'success':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        data: action.data,\n        error: null,\n        status: 'success',\n        isPaused: false\n      });\n\n    case 'error':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, {\n        data: undefined,\n        error: action.error,\n        failureCount: state.failureCount + 1,\n        isPaused: false,\n        status: 'error'\n      });\n\n    case 'setState':\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, state, action.state);\n\n    default:\n      return state;\n  }\n}\n\n/***/ }),\n\n/***/ 101:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"V\": function() { return /* binding */ notifyManager; }\n/* harmony export */ });\n/* unused harmony export NotifyManager */\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(2288);\n // TYPES\n\n// CLASS\nvar NotifyManager = /*#__PURE__*/function () {\n  function NotifyManager() {\n    this.queue = [];\n    this.transactions = 0;\n\n    this.notifyFn = function (callback) {\n      callback();\n    };\n\n    this.batchNotifyFn = function (callback) {\n      callback();\n    };\n  }\n\n  var _proto = NotifyManager.prototype;\n\n  _proto.batch = function batch(callback) {\n    var result;\n    this.transactions++;\n\n    try {\n      result = callback();\n    } finally {\n      this.transactions--;\n\n      if (!this.transactions) {\n        this.flush();\n      }\n    }\n\n    return result;\n  };\n\n  _proto.schedule = function schedule(callback) {\n    var _this = this;\n\n    if (this.transactions) {\n      this.queue.push(callback);\n    } else {\n      (0,_utils__WEBPACK_IMPORTED_MODULE_0__/* .scheduleMicrotask */ .A4)(function () {\n        _this.notifyFn(callback);\n      });\n    }\n  }\n  /**\n   * All calls to the wrapped function will be batched.\n   */\n  ;\n\n  _proto.batchCalls = function batchCalls(callback) {\n    var _this2 = this;\n\n    return function () {\n      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n\n      _this2.schedule(function () {\n        callback.apply(void 0, args);\n      });\n    };\n  };\n\n  _proto.flush = function flush() {\n    var _this3 = this;\n\n    var queue = this.queue;\n    this.queue = [];\n\n    if (queue.length) {\n      (0,_utils__WEBPACK_IMPORTED_MODULE_0__/* .scheduleMicrotask */ .A4)(function () {\n        _this3.batchNotifyFn(function () {\n          queue.forEach(function (callback) {\n            _this3.notifyFn(callback);\n          });\n        });\n      });\n    }\n  }\n  /**\n   * Use this method to set a custom notify function.\n   * This can be used to for example wrap notifications with `React.act` while running tests.\n   */\n  ;\n\n  _proto.setNotifyFunction = function setNotifyFunction(fn) {\n    this.notifyFn = fn;\n  }\n  /**\n   * Use this method to set a custom function to batch notifications together into a single tick.\n   * By default React Query will use the batch function provided by ReactDOM or React Native.\n   */\n  ;\n\n  _proto.setBatchNotifyFunction = function setBatchNotifyFunction(fn) {\n    this.batchNotifyFn = fn;\n  };\n\n  return NotifyManager;\n}(); // SINGLETON\n\nvar notifyManager = new NotifyManager();\n\n/***/ }),\n\n/***/ 68:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"N\": function() { return /* binding */ onlineManager; }\n/* harmony export */ });\n/* unused harmony export OnlineManager */\n/* harmony import */ var _babel_runtime_helpers_esm_inheritsLoose__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(5068);\n/* harmony import */ var _subscribable__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(2943);\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(2288);\n\n\n\nvar OnlineManager = /*#__PURE__*/function (_Subscribable) {\n  (0,_babel_runtime_helpers_esm_inheritsLoose__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)(OnlineManager, _Subscribable);\n\n  function OnlineManager() {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n\n    _this.setup = function (onOnline) {\n      var _window;\n\n      if (!_utils__WEBPACK_IMPORTED_MODULE_1__/* .isServer */ .sk && ((_window = window) == null ? void 0 : _window.addEventListener)) {\n        var listener = function listener() {\n          return onOnline();\n        }; // Listen to online\n\n\n        window.addEventListener('online', listener, false);\n        window.addEventListener('offline', listener, false);\n        return function () {\n          // Be sure to unsubscribe if a new handler is set\n          window.removeEventListener('online', listener);\n          window.removeEventListener('offline', listener);\n        };\n      }\n    };\n\n    return _this;\n  }\n\n  var _proto = OnlineManager.prototype;\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (!this.cleanup) {\n      this.setEventListener(this.setup);\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.hasListeners()) {\n      var _this$cleanup;\n\n      (_this$cleanup = this.cleanup) == null ? void 0 : _this$cleanup.call(this);\n      this.cleanup = undefined;\n    }\n  };\n\n  _proto.setEventListener = function setEventListener(setup) {\n    var _this$cleanup2,\n        _this2 = this;\n\n    this.setup = setup;\n    (_this$cleanup2 = this.cleanup) == null ? void 0 : _this$cleanup2.call(this);\n    this.cleanup = setup(function (online) {\n      if (typeof online === 'boolean') {\n        _this2.setOnline(online);\n      } else {\n        _this2.onOnline();\n      }\n    });\n  };\n\n  _proto.setOnline = function setOnline(online) {\n    this.online = online;\n\n    if (online) {\n      this.onOnline();\n    }\n  };\n\n  _proto.onOnline = function onOnline() {\n    this.listeners.forEach(function (listener) {\n      listener();\n    });\n  };\n\n  _proto.isOnline = function isOnline() {\n    if (typeof this.online === 'boolean') {\n      return this.online;\n    }\n\n    if (typeof navigator === 'undefined' || typeof navigator.onLine === 'undefined') {\n      return true;\n    }\n\n    return navigator.onLine;\n  };\n\n  return OnlineManager;\n}(_subscribable__WEBPACK_IMPORTED_MODULE_2__/* .Subscribable */ .l);\nvar onlineManager = new OnlineManager();\n\n/***/ }),\n\n/***/ 9043:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"S\": function() { return /* binding */ QueryClient; }\n});\n\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/utils.js\nvar utils = __webpack_require__(2288);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/inheritsLoose.js + 1 modules\nvar inheritsLoose = __webpack_require__(5068);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/notifyManager.js\nvar notifyManager = __webpack_require__(101);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/logger.js\nvar logger = __webpack_require__(1909);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/retryer.js\nvar retryer = __webpack_require__(1216);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/query.js\n\n\n\n\n // TYPES\n\n// CLASS\nvar Query = /*#__PURE__*/function () {\n  function Query(config) {\n    this.abortSignalConsumed = false;\n    this.hadObservers = false;\n    this.defaultOptions = config.defaultOptions;\n    this.setOptions(config.options);\n    this.observers = [];\n    this.cache = config.cache;\n    this.queryKey = config.queryKey;\n    this.queryHash = config.queryHash;\n    this.initialState = config.state || this.getDefaultState(this.options);\n    this.state = this.initialState;\n    this.meta = config.meta;\n    this.scheduleGc();\n  }\n\n  var _proto = Query.prototype;\n\n  _proto.setOptions = function setOptions(options) {\n    var _this$options$cacheTi;\n\n    this.options = (0,esm_extends/* default */.Z)({}, this.defaultOptions, options);\n    this.meta = options == null ? void 0 : options.meta; // Default to 5 minutes if not cache time is set\n\n    this.cacheTime = Math.max(this.cacheTime || 0, (_this$options$cacheTi = this.options.cacheTime) != null ? _this$options$cacheTi : 5 * 60 * 1000);\n  };\n\n  _proto.setDefaultOptions = function setDefaultOptions(options) {\n    this.defaultOptions = options;\n  };\n\n  _proto.scheduleGc = function scheduleGc() {\n    var _this = this;\n\n    this.clearGcTimeout();\n\n    if ((0,utils/* isValidTimeout */.PN)(this.cacheTime)) {\n      this.gcTimeout = setTimeout(function () {\n        _this.optionalRemove();\n      }, this.cacheTime);\n    }\n  };\n\n  _proto.clearGcTimeout = function clearGcTimeout() {\n    if (this.gcTimeout) {\n      clearTimeout(this.gcTimeout);\n      this.gcTimeout = undefined;\n    }\n  };\n\n  _proto.optionalRemove = function optionalRemove() {\n    if (!this.observers.length) {\n      if (this.state.isFetching) {\n        if (this.hadObservers) {\n          this.scheduleGc();\n        }\n      } else {\n        this.cache.remove(this);\n      }\n    }\n  };\n\n  _proto.setData = function setData(updater, options) {\n    var _this$options$isDataE, _this$options;\n\n    var prevData = this.state.data; // Get the new data\n\n    var data = (0,utils/* functionalUpdate */.SE)(updater, prevData); // Use prev data if an isDataEqual function is defined and returns `true`\n\n    if ((_this$options$isDataE = (_this$options = this.options).isDataEqual) == null ? void 0 : _this$options$isDataE.call(_this$options, prevData, data)) {\n      data = prevData;\n    } else if (this.options.structuralSharing !== false) {\n      // Structurally share data between prev and new data if needed\n      data = (0,utils/* replaceEqualDeep */.Q$)(prevData, data);\n    } // Set data and mark it as cached\n\n\n    this.dispatch({\n      data: data,\n      type: 'success',\n      dataUpdatedAt: options == null ? void 0 : options.updatedAt\n    });\n    return data;\n  };\n\n  _proto.setState = function setState(state, setStateOptions) {\n    this.dispatch({\n      type: 'setState',\n      state: state,\n      setStateOptions: setStateOptions\n    });\n  };\n\n  _proto.cancel = function cancel(options) {\n    var _this$retryer;\n\n    var promise = this.promise;\n    (_this$retryer = this.retryer) == null ? void 0 : _this$retryer.cancel(options);\n    return promise ? promise.then(utils/* noop */.ZT).catch(utils/* noop */.ZT) : Promise.resolve();\n  };\n\n  _proto.destroy = function destroy() {\n    this.clearGcTimeout();\n    this.cancel({\n      silent: true\n    });\n  };\n\n  _proto.reset = function reset() {\n    this.destroy();\n    this.setState(this.initialState);\n  };\n\n  _proto.isActive = function isActive() {\n    return this.observers.some(function (observer) {\n      return observer.options.enabled !== false;\n    });\n  };\n\n  _proto.isFetching = function isFetching() {\n    return this.state.isFetching;\n  };\n\n  _proto.isStale = function isStale() {\n    return this.state.isInvalidated || !this.state.dataUpdatedAt || this.observers.some(function (observer) {\n      return observer.getCurrentResult().isStale;\n    });\n  };\n\n  _proto.isStaleByTime = function isStaleByTime(staleTime) {\n    if (staleTime === void 0) {\n      staleTime = 0;\n    }\n\n    return this.state.isInvalidated || !this.state.dataUpdatedAt || !(0,utils/* timeUntilStale */.Kp)(this.state.dataUpdatedAt, staleTime);\n  };\n\n  _proto.onFocus = function onFocus() {\n    var _this$retryer2;\n\n    var observer = this.observers.find(function (x) {\n      return x.shouldFetchOnWindowFocus();\n    });\n\n    if (observer) {\n      observer.refetch();\n    } // Continue fetch if currently paused\n\n\n    (_this$retryer2 = this.retryer) == null ? void 0 : _this$retryer2.continue();\n  };\n\n  _proto.onOnline = function onOnline() {\n    var _this$retryer3;\n\n    var observer = this.observers.find(function (x) {\n      return x.shouldFetchOnReconnect();\n    });\n\n    if (observer) {\n      observer.refetch();\n    } // Continue fetch if currently paused\n\n\n    (_this$retryer3 = this.retryer) == null ? void 0 : _this$retryer3.continue();\n  };\n\n  _proto.addObserver = function addObserver(observer) {\n    if (this.observers.indexOf(observer) === -1) {\n      this.observers.push(observer);\n      this.hadObservers = true; // Stop the query from being garbage collected\n\n      this.clearGcTimeout();\n      this.cache.notify({\n        type: 'observerAdded',\n        query: this,\n        observer: observer\n      });\n    }\n  };\n\n  _proto.removeObserver = function removeObserver(observer) {\n    if (this.observers.indexOf(observer) !== -1) {\n      this.observers = this.observers.filter(function (x) {\n        return x !== observer;\n      });\n\n      if (!this.observers.length) {\n        // If the transport layer does not support cancellation\n        // we'll let the query continue so the result can be cached\n        if (this.retryer) {\n          if (this.retryer.isTransportCancelable || this.abortSignalConsumed) {\n            this.retryer.cancel({\n              revert: true\n            });\n          } else {\n            this.retryer.cancelRetry();\n          }\n        }\n\n        if (this.cacheTime) {\n          this.scheduleGc();\n        } else {\n          this.cache.remove(this);\n        }\n      }\n\n      this.cache.notify({\n        type: 'observerRemoved',\n        query: this,\n        observer: observer\n      });\n    }\n  };\n\n  _proto.getObserversCount = function getObserversCount() {\n    return this.observers.length;\n  };\n\n  _proto.invalidate = function invalidate() {\n    if (!this.state.isInvalidated) {\n      this.dispatch({\n        type: 'invalidate'\n      });\n    }\n  };\n\n  _proto.fetch = function fetch(options, fetchOptions) {\n    var _this2 = this,\n        _this$options$behavio,\n        _context$fetchOptions,\n        _abortController$abor;\n\n    if (this.state.isFetching) {\n      if (this.state.dataUpdatedAt && (fetchOptions == null ? void 0 : fetchOptions.cancelRefetch)) {\n        // Silently cancel current fetch if the user wants to cancel refetches\n        this.cancel({\n          silent: true\n        });\n      } else if (this.promise) {\n        var _this$retryer4;\n\n        // make sure that retries that were potentially cancelled due to unmounts can continue\n        (_this$retryer4 = this.retryer) == null ? void 0 : _this$retryer4.continueRetry(); // Return current promise if we are already fetching\n\n        return this.promise;\n      }\n    } // Update config if passed, otherwise the config from the last execution is used\n\n\n    if (options) {\n      this.setOptions(options);\n    } // Use the options from the first observer with a query function if no function is found.\n    // This can happen when the query is hydrated or created with setQueryData.\n\n\n    if (!this.options.queryFn) {\n      var observer = this.observers.find(function (x) {\n        return x.options.queryFn;\n      });\n\n      if (observer) {\n        this.setOptions(observer.options);\n      }\n    }\n\n    var queryKey = (0,utils/* ensureQueryKeyArray */.mc)(this.queryKey);\n    var abortController = (0,utils/* getAbortController */.G9)(); // Create query function context\n\n    var queryFnContext = {\n      queryKey: queryKey,\n      pageParam: undefined,\n      meta: this.meta\n    };\n    Object.defineProperty(queryFnContext, 'signal', {\n      enumerable: true,\n      get: function get() {\n        if (abortController) {\n          _this2.abortSignalConsumed = true;\n          return abortController.signal;\n        }\n\n        return undefined;\n      }\n    }); // Create fetch function\n\n    var fetchFn = function fetchFn() {\n      if (!_this2.options.queryFn) {\n        return Promise.reject('Missing queryFn');\n      }\n\n      _this2.abortSignalConsumed = false;\n      return _this2.options.queryFn(queryFnContext);\n    }; // Trigger behavior hook\n\n\n    var context = {\n      fetchOptions: fetchOptions,\n      options: this.options,\n      queryKey: queryKey,\n      state: this.state,\n      fetchFn: fetchFn,\n      meta: this.meta\n    };\n\n    if ((_this$options$behavio = this.options.behavior) == null ? void 0 : _this$options$behavio.onFetch) {\n      var _this$options$behavio2;\n\n      (_this$options$behavio2 = this.options.behavior) == null ? void 0 : _this$options$behavio2.onFetch(context);\n    } // Store state in case the current fetch needs to be reverted\n\n\n    this.revertState = this.state; // Set to fetching state if not already in it\n\n    if (!this.state.isFetching || this.state.fetchMeta !== ((_context$fetchOptions = context.fetchOptions) == null ? void 0 : _context$fetchOptions.meta)) {\n      var _context$fetchOptions2;\n\n      this.dispatch({\n        type: 'fetch',\n        meta: (_context$fetchOptions2 = context.fetchOptions) == null ? void 0 : _context$fetchOptions2.meta\n      });\n    } // Try to fetch the data\n\n\n    this.retryer = new retryer/* Retryer */.m4({\n      fn: context.fetchFn,\n      abort: abortController == null ? void 0 : (_abortController$abor = abortController.abort) == null ? void 0 : _abortController$abor.bind(abortController),\n      onSuccess: function onSuccess(data) {\n        _this2.setData(data); // Notify cache callback\n\n\n        _this2.cache.config.onSuccess == null ? void 0 : _this2.cache.config.onSuccess(data, _this2); // Remove query after fetching if cache time is 0\n\n        if (_this2.cacheTime === 0) {\n          _this2.optionalRemove();\n        }\n      },\n      onError: function onError(error) {\n        // Optimistically update state if needed\n        if (!((0,retryer/* isCancelledError */.DV)(error) && error.silent)) {\n          _this2.dispatch({\n            type: 'error',\n            error: error\n          });\n        }\n\n        if (!(0,retryer/* isCancelledError */.DV)(error)) {\n          // Notify cache callback\n          _this2.cache.config.onError == null ? void 0 : _this2.cache.config.onError(error, _this2); // Log error\n\n          (0,logger/* getLogger */.j)().error(error);\n        } // Remove query after fetching if cache time is 0\n\n\n        if (_this2.cacheTime === 0) {\n          _this2.optionalRemove();\n        }\n      },\n      onFail: function onFail() {\n        _this2.dispatch({\n          type: 'failed'\n        });\n      },\n      onPause: function onPause() {\n        _this2.dispatch({\n          type: 'pause'\n        });\n      },\n      onContinue: function onContinue() {\n        _this2.dispatch({\n          type: 'continue'\n        });\n      },\n      retry: context.options.retry,\n      retryDelay: context.options.retryDelay\n    });\n    this.promise = this.retryer.promise;\n    return this.promise;\n  };\n\n  _proto.dispatch = function dispatch(action) {\n    var _this3 = this;\n\n    this.state = this.reducer(this.state, action);\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this3.observers.forEach(function (observer) {\n        observer.onQueryUpdate(action);\n      });\n\n      _this3.cache.notify({\n        query: _this3,\n        type: 'queryUpdated',\n        action: action\n      });\n    });\n  };\n\n  _proto.getDefaultState = function getDefaultState(options) {\n    var data = typeof options.initialData === 'function' ? options.initialData() : options.initialData;\n    var hasInitialData = typeof options.initialData !== 'undefined';\n    var initialDataUpdatedAt = hasInitialData ? typeof options.initialDataUpdatedAt === 'function' ? options.initialDataUpdatedAt() : options.initialDataUpdatedAt : 0;\n    var hasData = typeof data !== 'undefined';\n    return {\n      data: data,\n      dataUpdateCount: 0,\n      dataUpdatedAt: hasData ? initialDataUpdatedAt != null ? initialDataUpdatedAt : Date.now() : 0,\n      error: null,\n      errorUpdateCount: 0,\n      errorUpdatedAt: 0,\n      fetchFailureCount: 0,\n      fetchMeta: null,\n      isFetching: false,\n      isInvalidated: false,\n      isPaused: false,\n      status: hasData ? 'success' : 'idle'\n    };\n  };\n\n  _proto.reducer = function reducer(state, action) {\n    var _action$meta, _action$dataUpdatedAt;\n\n    switch (action.type) {\n      case 'failed':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          fetchFailureCount: state.fetchFailureCount + 1\n        });\n\n      case 'pause':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          isPaused: true\n        });\n\n      case 'continue':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          isPaused: false\n        });\n\n      case 'fetch':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          fetchFailureCount: 0,\n          fetchMeta: (_action$meta = action.meta) != null ? _action$meta : null,\n          isFetching: true,\n          isPaused: false\n        }, !state.dataUpdatedAt && {\n          error: null,\n          status: 'loading'\n        });\n\n      case 'success':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          data: action.data,\n          dataUpdateCount: state.dataUpdateCount + 1,\n          dataUpdatedAt: (_action$dataUpdatedAt = action.dataUpdatedAt) != null ? _action$dataUpdatedAt : Date.now(),\n          error: null,\n          fetchFailureCount: 0,\n          isFetching: false,\n          isInvalidated: false,\n          isPaused: false,\n          status: 'success'\n        });\n\n      case 'error':\n        var error = action.error;\n\n        if ((0,retryer/* isCancelledError */.DV)(error) && error.revert && this.revertState) {\n          return (0,esm_extends/* default */.Z)({}, this.revertState);\n        }\n\n        return (0,esm_extends/* default */.Z)({}, state, {\n          error: error,\n          errorUpdateCount: state.errorUpdateCount + 1,\n          errorUpdatedAt: Date.now(),\n          fetchFailureCount: state.fetchFailureCount + 1,\n          isFetching: false,\n          isPaused: false,\n          status: 'error'\n        });\n\n      case 'invalidate':\n        return (0,esm_extends/* default */.Z)({}, state, {\n          isInvalidated: true\n        });\n\n      case 'setState':\n        return (0,esm_extends/* default */.Z)({}, state, action.state);\n\n      default:\n        return state;\n    }\n  };\n\n  return Query;\n}();\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/subscribable.js\nvar subscribable = __webpack_require__(2943);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/queryCache.js\n\n\n\n\n\n// CLASS\nvar QueryCache = /*#__PURE__*/function (_Subscribable) {\n  (0,inheritsLoose/* default */.Z)(QueryCache, _Subscribable);\n\n  function QueryCache(config) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.config = config || {};\n    _this.queries = [];\n    _this.queriesMap = {};\n    return _this;\n  }\n\n  var _proto = QueryCache.prototype;\n\n  _proto.build = function build(client, options, state) {\n    var _options$queryHash;\n\n    var queryKey = options.queryKey;\n    var queryHash = (_options$queryHash = options.queryHash) != null ? _options$queryHash : (0,utils/* hashQueryKeyByOptions */.Rm)(queryKey, options);\n    var query = this.get(queryHash);\n\n    if (!query) {\n      query = new Query({\n        cache: this,\n        queryKey: queryKey,\n        queryHash: queryHash,\n        options: client.defaultQueryOptions(options),\n        state: state,\n        defaultOptions: client.getQueryDefaults(queryKey),\n        meta: options.meta\n      });\n      this.add(query);\n    }\n\n    return query;\n  };\n\n  _proto.add = function add(query) {\n    if (!this.queriesMap[query.queryHash]) {\n      this.queriesMap[query.queryHash] = query;\n      this.queries.push(query);\n      this.notify({\n        type: 'queryAdded',\n        query: query\n      });\n    }\n  };\n\n  _proto.remove = function remove(query) {\n    var queryInMap = this.queriesMap[query.queryHash];\n\n    if (queryInMap) {\n      query.destroy();\n      this.queries = this.queries.filter(function (x) {\n        return x !== query;\n      });\n\n      if (queryInMap === query) {\n        delete this.queriesMap[query.queryHash];\n      }\n\n      this.notify({\n        type: 'queryRemoved',\n        query: query\n      });\n    }\n  };\n\n  _proto.clear = function clear() {\n    var _this2 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this2.queries.forEach(function (query) {\n        _this2.remove(query);\n      });\n    });\n  };\n\n  _proto.get = function get(queryHash) {\n    return this.queriesMap[queryHash];\n  };\n\n  _proto.getAll = function getAll() {\n    return this.queries;\n  };\n\n  _proto.find = function find(arg1, arg2) {\n    var _parseFilterArgs = (0,utils/* parseFilterArgs */.I6)(arg1, arg2),\n        filters = _parseFilterArgs[0];\n\n    if (typeof filters.exact === 'undefined') {\n      filters.exact = true;\n    }\n\n    return this.queries.find(function (query) {\n      return (0,utils/* matchQuery */._x)(filters, query);\n    });\n  };\n\n  _proto.findAll = function findAll(arg1, arg2) {\n    var _parseFilterArgs2 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2),\n        filters = _parseFilterArgs2[0];\n\n    return Object.keys(filters).length > 0 ? this.queries.filter(function (query) {\n      return (0,utils/* matchQuery */._x)(filters, query);\n    }) : this.queries;\n  };\n\n  _proto.notify = function notify(event) {\n    var _this3 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this3.listeners.forEach(function (listener) {\n        listener(event);\n      });\n    });\n  };\n\n  _proto.onFocus = function onFocus() {\n    var _this4 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this4.queries.forEach(function (query) {\n        query.onFocus();\n      });\n    });\n  };\n\n  _proto.onOnline = function onOnline() {\n    var _this5 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this5.queries.forEach(function (query) {\n        query.onOnline();\n      });\n    });\n  };\n\n  return QueryCache;\n}(subscribable/* Subscribable */.l);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/mutation.js\nvar core_mutation = __webpack_require__(1262);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/mutationCache.js\n\n\n\n\n // TYPES\n\n// CLASS\nvar MutationCache = /*#__PURE__*/function (_Subscribable) {\n  (0,inheritsLoose/* default */.Z)(MutationCache, _Subscribable);\n\n  function MutationCache(config) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.config = config || {};\n    _this.mutations = [];\n    _this.mutationId = 0;\n    return _this;\n  }\n\n  var _proto = MutationCache.prototype;\n\n  _proto.build = function build(client, options, state) {\n    var mutation = new core_mutation/* Mutation */.m({\n      mutationCache: this,\n      mutationId: ++this.mutationId,\n      options: client.defaultMutationOptions(options),\n      state: state,\n      defaultOptions: options.mutationKey ? client.getMutationDefaults(options.mutationKey) : undefined,\n      meta: options.meta\n    });\n    this.add(mutation);\n    return mutation;\n  };\n\n  _proto.add = function add(mutation) {\n    this.mutations.push(mutation);\n    this.notify(mutation);\n  };\n\n  _proto.remove = function remove(mutation) {\n    this.mutations = this.mutations.filter(function (x) {\n      return x !== mutation;\n    });\n    mutation.cancel();\n    this.notify(mutation);\n  };\n\n  _proto.clear = function clear() {\n    var _this2 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this2.mutations.forEach(function (mutation) {\n        _this2.remove(mutation);\n      });\n    });\n  };\n\n  _proto.getAll = function getAll() {\n    return this.mutations;\n  };\n\n  _proto.find = function find(filters) {\n    if (typeof filters.exact === 'undefined') {\n      filters.exact = true;\n    }\n\n    return this.mutations.find(function (mutation) {\n      return (0,utils/* matchMutation */.X7)(filters, mutation);\n    });\n  };\n\n  _proto.findAll = function findAll(filters) {\n    return this.mutations.filter(function (mutation) {\n      return (0,utils/* matchMutation */.X7)(filters, mutation);\n    });\n  };\n\n  _proto.notify = function notify(mutation) {\n    var _this3 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this3.listeners.forEach(function (listener) {\n        listener(mutation);\n      });\n    });\n  };\n\n  _proto.onFocus = function onFocus() {\n    this.resumePausedMutations();\n  };\n\n  _proto.onOnline = function onOnline() {\n    this.resumePausedMutations();\n  };\n\n  _proto.resumePausedMutations = function resumePausedMutations() {\n    var pausedMutations = this.mutations.filter(function (x) {\n      return x.state.isPaused;\n    });\n    return notifyManager/* notifyManager.batch */.V.batch(function () {\n      return pausedMutations.reduce(function (promise, mutation) {\n        return promise.then(function () {\n          return mutation.continue().catch(utils/* noop */.ZT);\n        });\n      }, Promise.resolve());\n    });\n  };\n\n  return MutationCache;\n}(subscribable/* Subscribable */.l);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/focusManager.js\nvar focusManager = __webpack_require__(9852);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/onlineManager.js\nvar onlineManager = __webpack_require__(68);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/infiniteQueryBehavior.js\n\n\nfunction infiniteQueryBehavior() {\n  return {\n    onFetch: function onFetch(context) {\n      context.fetchFn = function () {\n        var _context$fetchOptions, _context$fetchOptions2, _context$fetchOptions3, _context$fetchOptions4, _context$state$data, _context$state$data2;\n\n        var refetchPage = (_context$fetchOptions = context.fetchOptions) == null ? void 0 : (_context$fetchOptions2 = _context$fetchOptions.meta) == null ? void 0 : _context$fetchOptions2.refetchPage;\n        var fetchMore = (_context$fetchOptions3 = context.fetchOptions) == null ? void 0 : (_context$fetchOptions4 = _context$fetchOptions3.meta) == null ? void 0 : _context$fetchOptions4.fetchMore;\n        var pageParam = fetchMore == null ? void 0 : fetchMore.pageParam;\n        var isFetchingNextPage = (fetchMore == null ? void 0 : fetchMore.direction) === 'forward';\n        var isFetchingPreviousPage = (fetchMore == null ? void 0 : fetchMore.direction) === 'backward';\n        var oldPages = ((_context$state$data = context.state.data) == null ? void 0 : _context$state$data.pages) || [];\n        var oldPageParams = ((_context$state$data2 = context.state.data) == null ? void 0 : _context$state$data2.pageParams) || [];\n        var abortController = (0,utils/* getAbortController */.G9)();\n        var abortSignal = abortController == null ? void 0 : abortController.signal;\n        var newPageParams = oldPageParams;\n        var cancelled = false; // Get query function\n\n        var queryFn = context.options.queryFn || function () {\n          return Promise.reject('Missing queryFn');\n        };\n\n        var buildNewPages = function buildNewPages(pages, param, page, previous) {\n          newPageParams = previous ? [param].concat(newPageParams) : [].concat(newPageParams, [param]);\n          return previous ? [page].concat(pages) : [].concat(pages, [page]);\n        }; // Create function to fetch a page\n\n\n        var fetchPage = function fetchPage(pages, manual, param, previous) {\n          if (cancelled) {\n            return Promise.reject('Cancelled');\n          }\n\n          if (typeof param === 'undefined' && !manual && pages.length) {\n            return Promise.resolve(pages);\n          }\n\n          var queryFnContext = {\n            queryKey: context.queryKey,\n            signal: abortSignal,\n            pageParam: param,\n            meta: context.meta\n          };\n          var queryFnResult = queryFn(queryFnContext);\n          var promise = Promise.resolve(queryFnResult).then(function (page) {\n            return buildNewPages(pages, param, page, previous);\n          });\n\n          if ((0,retryer/* isCancelable */.LE)(queryFnResult)) {\n            var promiseAsAny = promise;\n            promiseAsAny.cancel = queryFnResult.cancel;\n          }\n\n          return promise;\n        };\n\n        var promise; // Fetch first page?\n\n        if (!oldPages.length) {\n          promise = fetchPage([]);\n        } // Fetch next page?\n        else if (isFetchingNextPage) {\n            var manual = typeof pageParam !== 'undefined';\n            var param = manual ? pageParam : getNextPageParam(context.options, oldPages);\n            promise = fetchPage(oldPages, manual, param);\n          } // Fetch previous page?\n          else if (isFetchingPreviousPage) {\n              var _manual = typeof pageParam !== 'undefined';\n\n              var _param = _manual ? pageParam : getPreviousPageParam(context.options, oldPages);\n\n              promise = fetchPage(oldPages, _manual, _param, true);\n            } // Refetch pages\n            else {\n                (function () {\n                  newPageParams = [];\n                  var manual = typeof context.options.getNextPageParam === 'undefined';\n                  var shouldFetchFirstPage = refetchPage && oldPages[0] ? refetchPage(oldPages[0], 0, oldPages) : true; // Fetch first page\n\n                  promise = shouldFetchFirstPage ? fetchPage([], manual, oldPageParams[0]) : Promise.resolve(buildNewPages([], oldPageParams[0], oldPages[0])); // Fetch remaining pages\n\n                  var _loop = function _loop(i) {\n                    promise = promise.then(function (pages) {\n                      var shouldFetchNextPage = refetchPage && oldPages[i] ? refetchPage(oldPages[i], i, oldPages) : true;\n\n                      if (shouldFetchNextPage) {\n                        var _param2 = manual ? oldPageParams[i] : getNextPageParam(context.options, pages);\n\n                        return fetchPage(pages, manual, _param2);\n                      }\n\n                      return Promise.resolve(buildNewPages(pages, oldPageParams[i], oldPages[i]));\n                    });\n                  };\n\n                  for (var i = 1; i < oldPages.length; i++) {\n                    _loop(i);\n                  }\n                })();\n              }\n\n        var finalPromise = promise.then(function (pages) {\n          return {\n            pages: pages,\n            pageParams: newPageParams\n          };\n        });\n        var finalPromiseAsAny = finalPromise;\n\n        finalPromiseAsAny.cancel = function () {\n          cancelled = true;\n          abortController == null ? void 0 : abortController.abort();\n\n          if ((0,retryer/* isCancelable */.LE)(promise)) {\n            promise.cancel();\n          }\n        };\n\n        return finalPromise;\n      };\n    }\n  };\n}\nfunction getNextPageParam(options, pages) {\n  return options.getNextPageParam == null ? void 0 : options.getNextPageParam(pages[pages.length - 1], pages);\n}\nfunction getPreviousPageParam(options, pages) {\n  return options.getPreviousPageParam == null ? void 0 : options.getPreviousPageParam(pages[0], pages);\n}\n/**\n * Checks if there is a next page.\n * Returns `undefined` if it cannot be determined.\n */\n\nfunction hasNextPage(options, pages) {\n  if (options.getNextPageParam && Array.isArray(pages)) {\n    var nextPageParam = getNextPageParam(options, pages);\n    return typeof nextPageParam !== 'undefined' && nextPageParam !== null && nextPageParam !== false;\n  }\n}\n/**\n * Checks if there is a previous page.\n * Returns `undefined` if it cannot be determined.\n */\n\nfunction hasPreviousPage(options, pages) {\n  if (options.getPreviousPageParam && Array.isArray(pages)) {\n    var previousPageParam = getPreviousPageParam(options, pages);\n    return typeof previousPageParam !== 'undefined' && previousPageParam !== null && previousPageParam !== false;\n  }\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/queryClient.js\n\n\n\n\n\n\n\n\n// CLASS\nvar QueryClient = /*#__PURE__*/function () {\n  function QueryClient(config) {\n    if (config === void 0) {\n      config = {};\n    }\n\n    this.queryCache = config.queryCache || new QueryCache();\n    this.mutationCache = config.mutationCache || new MutationCache();\n    this.defaultOptions = config.defaultOptions || {};\n    this.queryDefaults = [];\n    this.mutationDefaults = [];\n  }\n\n  var _proto = QueryClient.prototype;\n\n  _proto.mount = function mount() {\n    var _this = this;\n\n    this.unsubscribeFocus = focusManager/* focusManager.subscribe */.j.subscribe(function () {\n      if (focusManager/* focusManager.isFocused */.j.isFocused() && onlineManager/* onlineManager.isOnline */.N.isOnline()) {\n        _this.mutationCache.onFocus();\n\n        _this.queryCache.onFocus();\n      }\n    });\n    this.unsubscribeOnline = onlineManager/* onlineManager.subscribe */.N.subscribe(function () {\n      if (focusManager/* focusManager.isFocused */.j.isFocused() && onlineManager/* onlineManager.isOnline */.N.isOnline()) {\n        _this.mutationCache.onOnline();\n\n        _this.queryCache.onOnline();\n      }\n    });\n  };\n\n  _proto.unmount = function unmount() {\n    var _this$unsubscribeFocu, _this$unsubscribeOnli;\n\n    (_this$unsubscribeFocu = this.unsubscribeFocus) == null ? void 0 : _this$unsubscribeFocu.call(this);\n    (_this$unsubscribeOnli = this.unsubscribeOnline) == null ? void 0 : _this$unsubscribeOnli.call(this);\n  };\n\n  _proto.isFetching = function isFetching(arg1, arg2) {\n    var _parseFilterArgs = (0,utils/* parseFilterArgs */.I6)(arg1, arg2),\n        filters = _parseFilterArgs[0];\n\n    filters.fetching = true;\n    return this.queryCache.findAll(filters).length;\n  };\n\n  _proto.isMutating = function isMutating(filters) {\n    return this.mutationCache.findAll((0,esm_extends/* default */.Z)({}, filters, {\n      fetching: true\n    })).length;\n  };\n\n  _proto.getQueryData = function getQueryData(queryKey, filters) {\n    var _this$queryCache$find;\n\n    return (_this$queryCache$find = this.queryCache.find(queryKey, filters)) == null ? void 0 : _this$queryCache$find.state.data;\n  };\n\n  _proto.getQueriesData = function getQueriesData(queryKeyOrFilters) {\n    return this.getQueryCache().findAll(queryKeyOrFilters).map(function (_ref) {\n      var queryKey = _ref.queryKey,\n          state = _ref.state;\n      var data = state.data;\n      return [queryKey, data];\n    });\n  };\n\n  _proto.setQueryData = function setQueryData(queryKey, updater, options) {\n    var parsedOptions = (0,utils/* parseQueryArgs */._v)(queryKey);\n    var defaultedOptions = this.defaultQueryOptions(parsedOptions);\n    return this.queryCache.build(this, defaultedOptions).setData(updater, options);\n  };\n\n  _proto.setQueriesData = function setQueriesData(queryKeyOrFilters, updater, options) {\n    var _this2 = this;\n\n    return notifyManager/* notifyManager.batch */.V.batch(function () {\n      return _this2.getQueryCache().findAll(queryKeyOrFilters).map(function (_ref2) {\n        var queryKey = _ref2.queryKey;\n        return [queryKey, _this2.setQueryData(queryKey, updater, options)];\n      });\n    });\n  };\n\n  _proto.getQueryState = function getQueryState(queryKey, filters) {\n    var _this$queryCache$find2;\n\n    return (_this$queryCache$find2 = this.queryCache.find(queryKey, filters)) == null ? void 0 : _this$queryCache$find2.state;\n  };\n\n  _proto.removeQueries = function removeQueries(arg1, arg2) {\n    var _parseFilterArgs2 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2),\n        filters = _parseFilterArgs2[0];\n\n    var queryCache = this.queryCache;\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      queryCache.findAll(filters).forEach(function (query) {\n        queryCache.remove(query);\n      });\n    });\n  };\n\n  _proto.resetQueries = function resetQueries(arg1, arg2, arg3) {\n    var _this3 = this;\n\n    var _parseFilterArgs3 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2, arg3),\n        filters = _parseFilterArgs3[0],\n        options = _parseFilterArgs3[1];\n\n    var queryCache = this.queryCache;\n\n    var refetchFilters = (0,esm_extends/* default */.Z)({}, filters, {\n      active: true\n    });\n\n    return notifyManager/* notifyManager.batch */.V.batch(function () {\n      queryCache.findAll(filters).forEach(function (query) {\n        query.reset();\n      });\n      return _this3.refetchQueries(refetchFilters, options);\n    });\n  };\n\n  _proto.cancelQueries = function cancelQueries(arg1, arg2, arg3) {\n    var _this4 = this;\n\n    var _parseFilterArgs4 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2, arg3),\n        filters = _parseFilterArgs4[0],\n        _parseFilterArgs4$ = _parseFilterArgs4[1],\n        cancelOptions = _parseFilterArgs4$ === void 0 ? {} : _parseFilterArgs4$;\n\n    if (typeof cancelOptions.revert === 'undefined') {\n      cancelOptions.revert = true;\n    }\n\n    var promises = notifyManager/* notifyManager.batch */.V.batch(function () {\n      return _this4.queryCache.findAll(filters).map(function (query) {\n        return query.cancel(cancelOptions);\n      });\n    });\n    return Promise.all(promises).then(utils/* noop */.ZT).catch(utils/* noop */.ZT);\n  };\n\n  _proto.invalidateQueries = function invalidateQueries(arg1, arg2, arg3) {\n    var _ref3,\n        _filters$refetchActiv,\n        _filters$refetchInact,\n        _this5 = this;\n\n    var _parseFilterArgs5 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2, arg3),\n        filters = _parseFilterArgs5[0],\n        options = _parseFilterArgs5[1];\n\n    var refetchFilters = (0,esm_extends/* default */.Z)({}, filters, {\n      // if filters.refetchActive is not provided and filters.active is explicitly false,\n      // e.g. invalidateQueries({ active: false }), we don't want to refetch active queries\n      active: (_ref3 = (_filters$refetchActiv = filters.refetchActive) != null ? _filters$refetchActiv : filters.active) != null ? _ref3 : true,\n      inactive: (_filters$refetchInact = filters.refetchInactive) != null ? _filters$refetchInact : false\n    });\n\n    return notifyManager/* notifyManager.batch */.V.batch(function () {\n      _this5.queryCache.findAll(filters).forEach(function (query) {\n        query.invalidate();\n      });\n\n      return _this5.refetchQueries(refetchFilters, options);\n    });\n  };\n\n  _proto.refetchQueries = function refetchQueries(arg1, arg2, arg3) {\n    var _this6 = this;\n\n    var _parseFilterArgs6 = (0,utils/* parseFilterArgs */.I6)(arg1, arg2, arg3),\n        filters = _parseFilterArgs6[0],\n        options = _parseFilterArgs6[1];\n\n    var promises = notifyManager/* notifyManager.batch */.V.batch(function () {\n      return _this6.queryCache.findAll(filters).map(function (query) {\n        return query.fetch(undefined, (0,esm_extends/* default */.Z)({}, options, {\n          meta: {\n            refetchPage: filters == null ? void 0 : filters.refetchPage\n          }\n        }));\n      });\n    });\n    var promise = Promise.all(promises).then(utils/* noop */.ZT);\n\n    if (!(options == null ? void 0 : options.throwOnError)) {\n      promise = promise.catch(utils/* noop */.ZT);\n    }\n\n    return promise;\n  };\n\n  _proto.fetchQuery = function fetchQuery(arg1, arg2, arg3) {\n    var parsedOptions = (0,utils/* parseQueryArgs */._v)(arg1, arg2, arg3);\n    var defaultedOptions = this.defaultQueryOptions(parsedOptions); // https://github.com/tannerlinsley/react-query/issues/652\n\n    if (typeof defaultedOptions.retry === 'undefined') {\n      defaultedOptions.retry = false;\n    }\n\n    var query = this.queryCache.build(this, defaultedOptions);\n    return query.isStaleByTime(defaultedOptions.staleTime) ? query.fetch(defaultedOptions) : Promise.resolve(query.state.data);\n  };\n\n  _proto.prefetchQuery = function prefetchQuery(arg1, arg2, arg3) {\n    return this.fetchQuery(arg1, arg2, arg3).then(utils/* noop */.ZT).catch(utils/* noop */.ZT);\n  };\n\n  _proto.fetchInfiniteQuery = function fetchInfiniteQuery(arg1, arg2, arg3) {\n    var parsedOptions = (0,utils/* parseQueryArgs */._v)(arg1, arg2, arg3);\n    parsedOptions.behavior = infiniteQueryBehavior();\n    return this.fetchQuery(parsedOptions);\n  };\n\n  _proto.prefetchInfiniteQuery = function prefetchInfiniteQuery(arg1, arg2, arg3) {\n    return this.fetchInfiniteQuery(arg1, arg2, arg3).then(utils/* noop */.ZT).catch(utils/* noop */.ZT);\n  };\n\n  _proto.cancelMutations = function cancelMutations() {\n    var _this7 = this;\n\n    var promises = notifyManager/* notifyManager.batch */.V.batch(function () {\n      return _this7.mutationCache.getAll().map(function (mutation) {\n        return mutation.cancel();\n      });\n    });\n    return Promise.all(promises).then(utils/* noop */.ZT).catch(utils/* noop */.ZT);\n  };\n\n  _proto.resumePausedMutations = function resumePausedMutations() {\n    return this.getMutationCache().resumePausedMutations();\n  };\n\n  _proto.executeMutation = function executeMutation(options) {\n    return this.mutationCache.build(this, options).execute();\n  };\n\n  _proto.getQueryCache = function getQueryCache() {\n    return this.queryCache;\n  };\n\n  _proto.getMutationCache = function getMutationCache() {\n    return this.mutationCache;\n  };\n\n  _proto.getDefaultOptions = function getDefaultOptions() {\n    return this.defaultOptions;\n  };\n\n  _proto.setDefaultOptions = function setDefaultOptions(options) {\n    this.defaultOptions = options;\n  };\n\n  _proto.setQueryDefaults = function setQueryDefaults(queryKey, options) {\n    var result = this.queryDefaults.find(function (x) {\n      return (0,utils/* hashQueryKey */.yF)(queryKey) === (0,utils/* hashQueryKey */.yF)(x.queryKey);\n    });\n\n    if (result) {\n      result.defaultOptions = options;\n    } else {\n      this.queryDefaults.push({\n        queryKey: queryKey,\n        defaultOptions: options\n      });\n    }\n  };\n\n  _proto.getQueryDefaults = function getQueryDefaults(queryKey) {\n    var _this$queryDefaults$f;\n\n    return queryKey ? (_this$queryDefaults$f = this.queryDefaults.find(function (x) {\n      return (0,utils/* partialMatchKey */.to)(queryKey, x.queryKey);\n    })) == null ? void 0 : _this$queryDefaults$f.defaultOptions : undefined;\n  };\n\n  _proto.setMutationDefaults = function setMutationDefaults(mutationKey, options) {\n    var result = this.mutationDefaults.find(function (x) {\n      return (0,utils/* hashQueryKey */.yF)(mutationKey) === (0,utils/* hashQueryKey */.yF)(x.mutationKey);\n    });\n\n    if (result) {\n      result.defaultOptions = options;\n    } else {\n      this.mutationDefaults.push({\n        mutationKey: mutationKey,\n        defaultOptions: options\n      });\n    }\n  };\n\n  _proto.getMutationDefaults = function getMutationDefaults(mutationKey) {\n    var _this$mutationDefault;\n\n    return mutationKey ? (_this$mutationDefault = this.mutationDefaults.find(function (x) {\n      return (0,utils/* partialMatchKey */.to)(mutationKey, x.mutationKey);\n    })) == null ? void 0 : _this$mutationDefault.defaultOptions : undefined;\n  };\n\n  _proto.defaultQueryOptions = function defaultQueryOptions(options) {\n    if (options == null ? void 0 : options._defaulted) {\n      return options;\n    }\n\n    var defaultedOptions = (0,esm_extends/* default */.Z)({}, this.defaultOptions.queries, this.getQueryDefaults(options == null ? void 0 : options.queryKey), options, {\n      _defaulted: true\n    });\n\n    if (!defaultedOptions.queryHash && defaultedOptions.queryKey) {\n      defaultedOptions.queryHash = (0,utils/* hashQueryKeyByOptions */.Rm)(defaultedOptions.queryKey, defaultedOptions);\n    }\n\n    return defaultedOptions;\n  };\n\n  _proto.defaultQueryObserverOptions = function defaultQueryObserverOptions(options) {\n    return this.defaultQueryOptions(options);\n  };\n\n  _proto.defaultMutationOptions = function defaultMutationOptions(options) {\n    if (options == null ? void 0 : options._defaulted) {\n      return options;\n    }\n\n    return (0,esm_extends/* default */.Z)({}, this.defaultOptions.mutations, this.getMutationDefaults(options == null ? void 0 : options.mutationKey), options, {\n      _defaulted: true\n    });\n  };\n\n  _proto.clear = function clear() {\n    this.queryCache.clear();\n    this.mutationCache.clear();\n  };\n\n  return QueryClient;\n}();\n\n/***/ }),\n\n/***/ 1216:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"DV\": function() { return /* binding */ isCancelledError; },\n/* harmony export */   \"LE\": function() { return /* binding */ isCancelable; },\n/* harmony export */   \"m4\": function() { return /* binding */ Retryer; }\n/* harmony export */ });\n/* unused harmony export CancelledError */\n/* harmony import */ var _focusManager__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(9852);\n/* harmony import */ var _onlineManager__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(68);\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(2288);\n\n\n\n\nfunction defaultRetryDelay(failureCount) {\n  return Math.min(1000 * Math.pow(2, failureCount), 30000);\n}\n\nfunction isCancelable(value) {\n  return typeof (value == null ? void 0 : value.cancel) === 'function';\n}\nvar CancelledError = function CancelledError(options) {\n  this.revert = options == null ? void 0 : options.revert;\n  this.silent = options == null ? void 0 : options.silent;\n};\nfunction isCancelledError(value) {\n  return value instanceof CancelledError;\n} // CLASS\n\nvar Retryer = function Retryer(config) {\n  var _this = this;\n\n  var cancelRetry = false;\n  var cancelFn;\n  var continueFn;\n  var promiseResolve;\n  var promiseReject;\n  this.abort = config.abort;\n\n  this.cancel = function (cancelOptions) {\n    return cancelFn == null ? void 0 : cancelFn(cancelOptions);\n  };\n\n  this.cancelRetry = function () {\n    cancelRetry = true;\n  };\n\n  this.continueRetry = function () {\n    cancelRetry = false;\n  };\n\n  this.continue = function () {\n    return continueFn == null ? void 0 : continueFn();\n  };\n\n  this.failureCount = 0;\n  this.isPaused = false;\n  this.isResolved = false;\n  this.isTransportCancelable = false;\n  this.promise = new Promise(function (outerResolve, outerReject) {\n    promiseResolve = outerResolve;\n    promiseReject = outerReject;\n  });\n\n  var resolve = function resolve(value) {\n    if (!_this.isResolved) {\n      _this.isResolved = true;\n      config.onSuccess == null ? void 0 : config.onSuccess(value);\n      continueFn == null ? void 0 : continueFn();\n      promiseResolve(value);\n    }\n  };\n\n  var reject = function reject(value) {\n    if (!_this.isResolved) {\n      _this.isResolved = true;\n      config.onError == null ? void 0 : config.onError(value);\n      continueFn == null ? void 0 : continueFn();\n      promiseReject(value);\n    }\n  };\n\n  var pause = function pause() {\n    return new Promise(function (continueResolve) {\n      continueFn = continueResolve;\n      _this.isPaused = true;\n      config.onPause == null ? void 0 : config.onPause();\n    }).then(function () {\n      continueFn = undefined;\n      _this.isPaused = false;\n      config.onContinue == null ? void 0 : config.onContinue();\n    });\n  }; // Create loop function\n\n\n  var run = function run() {\n    // Do nothing if already resolved\n    if (_this.isResolved) {\n      return;\n    }\n\n    var promiseOrValue; // Execute query\n\n    try {\n      promiseOrValue = config.fn();\n    } catch (error) {\n      promiseOrValue = Promise.reject(error);\n    } // Create callback to cancel this fetch\n\n\n    cancelFn = function cancelFn(cancelOptions) {\n      if (!_this.isResolved) {\n        reject(new CancelledError(cancelOptions));\n        _this.abort == null ? void 0 : _this.abort(); // Cancel transport if supported\n\n        if (isCancelable(promiseOrValue)) {\n          try {\n            promiseOrValue.cancel();\n          } catch (_unused) {}\n        }\n      }\n    }; // Check if the transport layer support cancellation\n\n\n    _this.isTransportCancelable = isCancelable(promiseOrValue);\n    Promise.resolve(promiseOrValue).then(resolve).catch(function (error) {\n      var _config$retry, _config$retryDelay;\n\n      // Stop if the fetch is already resolved\n      if (_this.isResolved) {\n        return;\n      } // Do we need to retry the request?\n\n\n      var retry = (_config$retry = config.retry) != null ? _config$retry : 3;\n      var retryDelay = (_config$retryDelay = config.retryDelay) != null ? _config$retryDelay : defaultRetryDelay;\n      var delay = typeof retryDelay === 'function' ? retryDelay(_this.failureCount, error) : retryDelay;\n      var shouldRetry = retry === true || typeof retry === 'number' && _this.failureCount < retry || typeof retry === 'function' && retry(_this.failureCount, error);\n\n      if (cancelRetry || !shouldRetry) {\n        // We are done if the query does not need to be retried\n        reject(error);\n        return;\n      }\n\n      _this.failureCount++; // Notify on fail\n\n      config.onFail == null ? void 0 : config.onFail(_this.failureCount, error); // Delay\n\n      (0,_utils__WEBPACK_IMPORTED_MODULE_0__/* .sleep */ .Gh)(delay) // Pause if the document is not visible or when the device is offline\n      .then(function () {\n        if (!_focusManager__WEBPACK_IMPORTED_MODULE_1__/* .focusManager.isFocused */ .j.isFocused() || !_onlineManager__WEBPACK_IMPORTED_MODULE_2__/* .onlineManager.isOnline */ .N.isOnline()) {\n          return pause();\n        }\n      }).then(function () {\n        if (cancelRetry) {\n          reject(error);\n        } else {\n          run();\n        }\n      });\n    });\n  }; // Start loop\n\n\n  run();\n};\n\n/***/ }),\n\n/***/ 2943:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"l\": function() { return /* binding */ Subscribable; }\n/* harmony export */ });\nvar Subscribable = /*#__PURE__*/function () {\n  function Subscribable() {\n    this.listeners = [];\n  }\n\n  var _proto = Subscribable.prototype;\n\n  _proto.subscribe = function subscribe(listener) {\n    var _this = this;\n\n    var callback = listener || function () {\n      return undefined;\n    };\n\n    this.listeners.push(callback);\n    this.onSubscribe();\n    return function () {\n      _this.listeners = _this.listeners.filter(function (x) {\n        return x !== callback;\n      });\n\n      _this.onUnsubscribe();\n    };\n  };\n\n  _proto.hasListeners = function hasListeners() {\n    return this.listeners.length > 0;\n  };\n\n  _proto.onSubscribe = function onSubscribe() {// Do nothing\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {// Do nothing\n  };\n\n  return Subscribable;\n}();\n\n/***/ }),\n\n/***/ 6755:\n/***/ (function() {\n\n\n\n/***/ }),\n\n/***/ 2288:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"A4\": function() { return /* binding */ scheduleMicrotask; },\n/* harmony export */   \"G9\": function() { return /* binding */ getAbortController; },\n/* harmony export */   \"Gh\": function() { return /* binding */ sleep; },\n/* harmony export */   \"I6\": function() { return /* binding */ parseFilterArgs; },\n/* harmony export */   \"Kp\": function() { return /* binding */ timeUntilStale; },\n/* harmony export */   \"PN\": function() { return /* binding */ isValidTimeout; },\n/* harmony export */   \"Q$\": function() { return /* binding */ replaceEqualDeep; },\n/* harmony export */   \"Rm\": function() { return /* binding */ hashQueryKeyByOptions; },\n/* harmony export */   \"SE\": function() { return /* binding */ functionalUpdate; },\n/* harmony export */   \"VS\": function() { return /* binding */ shallowEqualObjects; },\n/* harmony export */   \"X7\": function() { return /* binding */ matchMutation; },\n/* harmony export */   \"ZT\": function() { return /* binding */ noop; },\n/* harmony export */   \"_v\": function() { return /* binding */ parseQueryArgs; },\n/* harmony export */   \"_x\": function() { return /* binding */ matchQuery; },\n/* harmony export */   \"lV\": function() { return /* binding */ parseMutationArgs; },\n/* harmony export */   \"mc\": function() { return /* binding */ ensureQueryKeyArray; },\n/* harmony export */   \"sk\": function() { return /* binding */ isServer; },\n/* harmony export */   \"to\": function() { return /* binding */ partialMatchKey; },\n/* harmony export */   \"yF\": function() { return /* binding */ hashQueryKey; }\n/* harmony export */ });\n/* unused harmony exports difference, replaceAt, parseMutationFilterArgs, mapQueryStatusFilter, stableValueHash, partialDeepEqual, isPlainObject, isQueryKey, isError */\n/* harmony import */ var _babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7462);\n\n// TYPES\n// UTILS\nvar isServer = typeof window === 'undefined';\nfunction noop() {\n  return undefined;\n}\nfunction functionalUpdate(updater, input) {\n  return typeof updater === 'function' ? updater(input) : updater;\n}\nfunction isValidTimeout(value) {\n  return typeof value === 'number' && value >= 0 && value !== Infinity;\n}\nfunction ensureQueryKeyArray(value) {\n  return Array.isArray(value) ? value : [value];\n}\nfunction difference(array1, array2) {\n  return array1.filter(function (x) {\n    return array2.indexOf(x) === -1;\n  });\n}\nfunction replaceAt(array, index, value) {\n  var copy = array.slice(0);\n  copy[index] = value;\n  return copy;\n}\nfunction timeUntilStale(updatedAt, staleTime) {\n  return Math.max(updatedAt + (staleTime || 0) - Date.now(), 0);\n}\nfunction parseQueryArgs(arg1, arg2, arg3) {\n  if (!isQueryKey(arg1)) {\n    return arg1;\n  }\n\n  if (typeof arg2 === 'function') {\n    return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg3, {\n      queryKey: arg1,\n      queryFn: arg2\n    });\n  }\n\n  return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg2, {\n    queryKey: arg1\n  });\n}\nfunction parseMutationArgs(arg1, arg2, arg3) {\n  if (isQueryKey(arg1)) {\n    if (typeof arg2 === 'function') {\n      return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg3, {\n        mutationKey: arg1,\n        mutationFn: arg2\n      });\n    }\n\n    return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg2, {\n      mutationKey: arg1\n    });\n  }\n\n  if (typeof arg1 === 'function') {\n    return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg2, {\n      mutationFn: arg1\n    });\n  }\n\n  return (0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg1);\n}\nfunction parseFilterArgs(arg1, arg2, arg3) {\n  return isQueryKey(arg1) ? [(0,_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__/* [\"default\"] */ .Z)({}, arg2, {\n    queryKey: arg1\n  }), arg3] : [arg1 || {}, arg2];\n}\nfunction parseMutationFilterArgs(arg1, arg2) {\n  return isQueryKey(arg1) ? _extends({}, arg2, {\n    mutationKey: arg1\n  }) : arg1;\n}\nfunction mapQueryStatusFilter(active, inactive) {\n  if (active === true && inactive === true || active == null && inactive == null) {\n    return 'all';\n  } else if (active === false && inactive === false) {\n    return 'none';\n  } else {\n    // At this point, active|inactive can only be true|false or false|true\n    // so, when only one value is provided, the missing one has to be the negated value\n    var isActive = active != null ? active : !inactive;\n    return isActive ? 'active' : 'inactive';\n  }\n}\nfunction matchQuery(filters, query) {\n  var active = filters.active,\n      exact = filters.exact,\n      fetching = filters.fetching,\n      inactive = filters.inactive,\n      predicate = filters.predicate,\n      queryKey = filters.queryKey,\n      stale = filters.stale;\n\n  if (isQueryKey(queryKey)) {\n    if (exact) {\n      if (query.queryHash !== hashQueryKeyByOptions(queryKey, query.options)) {\n        return false;\n      }\n    } else if (!partialMatchKey(query.queryKey, queryKey)) {\n      return false;\n    }\n  }\n\n  var queryStatusFilter = mapQueryStatusFilter(active, inactive);\n\n  if (queryStatusFilter === 'none') {\n    return false;\n  } else if (queryStatusFilter !== 'all') {\n    var isActive = query.isActive();\n\n    if (queryStatusFilter === 'active' && !isActive) {\n      return false;\n    }\n\n    if (queryStatusFilter === 'inactive' && isActive) {\n      return false;\n    }\n  }\n\n  if (typeof stale === 'boolean' && query.isStale() !== stale) {\n    return false;\n  }\n\n  if (typeof fetching === 'boolean' && query.isFetching() !== fetching) {\n    return false;\n  }\n\n  if (predicate && !predicate(query)) {\n    return false;\n  }\n\n  return true;\n}\nfunction matchMutation(filters, mutation) {\n  var exact = filters.exact,\n      fetching = filters.fetching,\n      predicate = filters.predicate,\n      mutationKey = filters.mutationKey;\n\n  if (isQueryKey(mutationKey)) {\n    if (!mutation.options.mutationKey) {\n      return false;\n    }\n\n    if (exact) {\n      if (hashQueryKey(mutation.options.mutationKey) !== hashQueryKey(mutationKey)) {\n        return false;\n      }\n    } else if (!partialMatchKey(mutation.options.mutationKey, mutationKey)) {\n      return false;\n    }\n  }\n\n  if (typeof fetching === 'boolean' && mutation.state.status === 'loading' !== fetching) {\n    return false;\n  }\n\n  if (predicate && !predicate(mutation)) {\n    return false;\n  }\n\n  return true;\n}\nfunction hashQueryKeyByOptions(queryKey, options) {\n  var hashFn = (options == null ? void 0 : options.queryKeyHashFn) || hashQueryKey;\n  return hashFn(queryKey);\n}\n/**\n * Default query keys hash function.\n */\n\nfunction hashQueryKey(queryKey) {\n  var asArray = ensureQueryKeyArray(queryKey);\n  return stableValueHash(asArray);\n}\n/**\n * Hashes the value into a stable hash.\n */\n\nfunction stableValueHash(value) {\n  return JSON.stringify(value, function (_, val) {\n    return isPlainObject(val) ? Object.keys(val).sort().reduce(function (result, key) {\n      result[key] = val[key];\n      return result;\n    }, {}) : val;\n  });\n}\n/**\n * Checks if key `b` partially matches with key `a`.\n */\n\nfunction partialMatchKey(a, b) {\n  return partialDeepEqual(ensureQueryKeyArray(a), ensureQueryKeyArray(b));\n}\n/**\n * Checks if `b` partially matches with `a`.\n */\n\nfunction partialDeepEqual(a, b) {\n  if (a === b) {\n    return true;\n  }\n\n  if (typeof a !== typeof b) {\n    return false;\n  }\n\n  if (a && b && typeof a === 'object' && typeof b === 'object') {\n    return !Object.keys(b).some(function (key) {\n      return !partialDeepEqual(a[key], b[key]);\n    });\n  }\n\n  return false;\n}\n/**\n * This function returns `a` if `b` is deeply equal.\n * If not, it will replace any deeply equal children of `b` with those of `a`.\n * This can be used for structural sharing between JSON values for example.\n */\n\nfunction replaceEqualDeep(a, b) {\n  if (a === b) {\n    return a;\n  }\n\n  var array = Array.isArray(a) && Array.isArray(b);\n\n  if (array || isPlainObject(a) && isPlainObject(b)) {\n    var aSize = array ? a.length : Object.keys(a).length;\n    var bItems = array ? b : Object.keys(b);\n    var bSize = bItems.length;\n    var copy = array ? [] : {};\n    var equalItems = 0;\n\n    for (var i = 0; i < bSize; i++) {\n      var key = array ? i : bItems[i];\n      copy[key] = replaceEqualDeep(a[key], b[key]);\n\n      if (copy[key] === a[key]) {\n        equalItems++;\n      }\n    }\n\n    return aSize === bSize && equalItems === aSize ? a : copy;\n  }\n\n  return b;\n}\n/**\n * Shallow compare objects. Only works with objects that always have the same properties.\n */\n\nfunction shallowEqualObjects(a, b) {\n  if (a && !b || b && !a) {\n    return false;\n  }\n\n  for (var key in a) {\n    if (a[key] !== b[key]) {\n      return false;\n    }\n  }\n\n  return true;\n} // Copied from: https://github.com/jonschlinkert/is-plain-object\n\nfunction isPlainObject(o) {\n  if (!hasObjectPrototype(o)) {\n    return false;\n  } // If has modified constructor\n\n\n  var ctor = o.constructor;\n\n  if (typeof ctor === 'undefined') {\n    return true;\n  } // If has modified prototype\n\n\n  var prot = ctor.prototype;\n\n  if (!hasObjectPrototype(prot)) {\n    return false;\n  } // If constructor does not have an Object-specific method\n\n\n  if (!prot.hasOwnProperty('isPrototypeOf')) {\n    return false;\n  } // Most likely a plain Object\n\n\n  return true;\n}\n\nfunction hasObjectPrototype(o) {\n  return Object.prototype.toString.call(o) === '[object Object]';\n}\n\nfunction isQueryKey(value) {\n  return typeof value === 'string' || Array.isArray(value);\n}\nfunction isError(value) {\n  return value instanceof Error;\n}\nfunction sleep(timeout) {\n  return new Promise(function (resolve) {\n    setTimeout(resolve, timeout);\n  });\n}\n/**\n * Schedules a microtask.\n * This can be useful to schedule state updates after rendering.\n */\n\nfunction scheduleMicrotask(callback) {\n  Promise.resolve().then(callback).catch(function (error) {\n    return setTimeout(function () {\n      throw error;\n    });\n  });\n}\nfunction getAbortController() {\n  if (typeof AbortController === 'function') {\n    return new AbortController();\n  }\n}\n\n/***/ }),\n\n/***/ 8767:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Hydrate\": function() { return /* reexport safe */ _react__WEBPACK_IMPORTED_MODULE_1__.Hydrate; },\n/* harmony export */   \"QueryClient\": function() { return /* reexport safe */ _core__WEBPACK_IMPORTED_MODULE_0__.QueryClient; },\n/* harmony export */   \"QueryClientProvider\": function() { return /* reexport safe */ _react__WEBPACK_IMPORTED_MODULE_1__.QueryClientProvider; },\n/* harmony export */   \"useMutation\": function() { return /* reexport safe */ _react__WEBPACK_IMPORTED_MODULE_1__.useMutation; },\n/* harmony export */   \"useQuery\": function() { return /* reexport safe */ _react__WEBPACK_IMPORTED_MODULE_1__.useQuery; }\n/* harmony export */ });\n/* harmony import */ var _core__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(6747);\n/* harmony reexport (checked) */ if(__webpack_require__.o(_core__WEBPACK_IMPORTED_MODULE_0__, \"Hydrate\")) __webpack_require__.d(__webpack_exports__, { \"Hydrate\": function() { return _core__WEBPACK_IMPORTED_MODULE_0__.Hydrate; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_core__WEBPACK_IMPORTED_MODULE_0__, \"QueryClientProvider\")) __webpack_require__.d(__webpack_exports__, { \"QueryClientProvider\": function() { return _core__WEBPACK_IMPORTED_MODULE_0__.QueryClientProvider; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_core__WEBPACK_IMPORTED_MODULE_0__, \"useMutation\")) __webpack_require__.d(__webpack_exports__, { \"useMutation\": function() { return _core__WEBPACK_IMPORTED_MODULE_0__.useMutation; } });\n/* harmony reexport (checked) */ if(__webpack_require__.o(_core__WEBPACK_IMPORTED_MODULE_0__, \"useQuery\")) __webpack_require__.d(__webpack_exports__, { \"useQuery\": function() { return _core__WEBPACK_IMPORTED_MODULE_0__.useQuery; } });\n/* harmony import */ var _react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(4830);\n\n\n\n/***/ }),\n\n/***/ 4830:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Hydrate\": function() { return /* reexport */ Hydrate; },\n  \"QueryClientProvider\": function() { return /* reexport */ QueryClientProvider; },\n  \"useMutation\": function() { return /* reexport */ useMutation; },\n  \"useQuery\": function() { return /* reexport */ useQuery; }\n});\n\n// UNUSED EXPORTS: QueryErrorResetBoundary, useHydrate, useInfiniteQuery, useIsFetching, useIsMutating, useQueries, useQueryClient, useQueryErrorResetBoundary\n\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/notifyManager.js\nvar notifyManager = __webpack_require__(101);\n// EXTERNAL MODULE: ./node_modules/react-dom/index.js\nvar react_dom = __webpack_require__(3935);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/reactBatchedUpdates.js\n\nvar unstable_batchedUpdates = react_dom.unstable_batchedUpdates;\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/setBatchUpdatesFn.js\n\n\nnotifyManager/* notifyManager.setBatchNotifyFunction */.V.setBatchNotifyFunction(unstable_batchedUpdates);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/logger.js\nvar logger = __webpack_require__(1909);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/logger.js\nvar logger_logger = console;\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/setLogger.js\n\n\n(0,logger/* setLogger */.E)(logger_logger);\n// EXTERNAL MODULE: ./node_modules/react/index.js\nvar react = __webpack_require__(7294);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/QueryClientProvider.js\n\nvar defaultContext = /*#__PURE__*/react.createContext(undefined);\nvar QueryClientSharingContext = /*#__PURE__*/react.createContext(false); // if contextSharing is on, we share the first and at least one\n// instance of the context across the window\n// to ensure that if React Query is used across\n// different bundles or microfrontends they will\n// all use the same **instance** of context, regardless\n// of module scoping.\n\nfunction getQueryClientContext(contextSharing) {\n  if (contextSharing && typeof window !== 'undefined') {\n    if (!window.ReactQueryClientContext) {\n      window.ReactQueryClientContext = defaultContext;\n    }\n\n    return window.ReactQueryClientContext;\n  }\n\n  return defaultContext;\n}\n\nvar useQueryClient = function useQueryClient() {\n  var queryClient = react.useContext(getQueryClientContext(react.useContext(QueryClientSharingContext)));\n\n  if (!queryClient) {\n    throw new Error('No QueryClient set, use QueryClientProvider to set one');\n  }\n\n  return queryClient;\n};\nvar QueryClientProvider = function QueryClientProvider(_ref) {\n  var client = _ref.client,\n      _ref$contextSharing = _ref.contextSharing,\n      contextSharing = _ref$contextSharing === void 0 ? false : _ref$contextSharing,\n      children = _ref.children;\n  react.useEffect(function () {\n    client.mount();\n    return function () {\n      client.unmount();\n    };\n  }, [client]);\n  var Context = getQueryClientContext(contextSharing);\n  return /*#__PURE__*/react.createElement(QueryClientSharingContext.Provider, {\n    value: contextSharing\n  }, /*#__PURE__*/react.createElement(Context.Provider, {\n    value: client\n  }, children));\n};\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/extends.js\nvar esm_extends = __webpack_require__(7462);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/utils.js\nvar utils = __webpack_require__(2288);\n// EXTERNAL MODULE: ./node_modules/@babel/runtime/helpers/esm/inheritsLoose.js + 1 modules\nvar inheritsLoose = __webpack_require__(5068);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/mutation.js\nvar mutation = __webpack_require__(1262);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/subscribable.js\nvar subscribable = __webpack_require__(2943);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/mutationObserver.js\n\n\n\n\n\n// CLASS\nvar MutationObserver = /*#__PURE__*/function (_Subscribable) {\n  (0,inheritsLoose/* default */.Z)(MutationObserver, _Subscribable);\n\n  function MutationObserver(client, options) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.client = client;\n\n    _this.setOptions(options);\n\n    _this.bindMethods();\n\n    _this.updateResult();\n\n    return _this;\n  }\n\n  var _proto = MutationObserver.prototype;\n\n  _proto.bindMethods = function bindMethods() {\n    this.mutate = this.mutate.bind(this);\n    this.reset = this.reset.bind(this);\n  };\n\n  _proto.setOptions = function setOptions(options) {\n    this.options = this.client.defaultMutationOptions(options);\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.listeners.length) {\n      var _this$currentMutation;\n\n      (_this$currentMutation = this.currentMutation) == null ? void 0 : _this$currentMutation.removeObserver(this);\n    }\n  };\n\n  _proto.onMutationUpdate = function onMutationUpdate(action) {\n    this.updateResult(); // Determine which callbacks to trigger\n\n    var notifyOptions = {\n      listeners: true\n    };\n\n    if (action.type === 'success') {\n      notifyOptions.onSuccess = true;\n    } else if (action.type === 'error') {\n      notifyOptions.onError = true;\n    }\n\n    this.notify(notifyOptions);\n  };\n\n  _proto.getCurrentResult = function getCurrentResult() {\n    return this.currentResult;\n  };\n\n  _proto.reset = function reset() {\n    this.currentMutation = undefined;\n    this.updateResult();\n    this.notify({\n      listeners: true\n    });\n  };\n\n  _proto.mutate = function mutate(variables, options) {\n    this.mutateOptions = options;\n\n    if (this.currentMutation) {\n      this.currentMutation.removeObserver(this);\n    }\n\n    this.currentMutation = this.client.getMutationCache().build(this.client, (0,esm_extends/* default */.Z)({}, this.options, {\n      variables: typeof variables !== 'undefined' ? variables : this.options.variables\n    }));\n    this.currentMutation.addObserver(this);\n    return this.currentMutation.execute();\n  };\n\n  _proto.updateResult = function updateResult() {\n    var state = this.currentMutation ? this.currentMutation.state : (0,mutation/* getDefaultState */.R)();\n\n    var result = (0,esm_extends/* default */.Z)({}, state, {\n      isLoading: state.status === 'loading',\n      isSuccess: state.status === 'success',\n      isError: state.status === 'error',\n      isIdle: state.status === 'idle',\n      mutate: this.mutate,\n      reset: this.reset\n    });\n\n    this.currentResult = result;\n  };\n\n  _proto.notify = function notify(options) {\n    var _this2 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      // First trigger the mutate callbacks\n      if (_this2.mutateOptions) {\n        if (options.onSuccess) {\n          _this2.mutateOptions.onSuccess == null ? void 0 : _this2.mutateOptions.onSuccess(_this2.currentResult.data, _this2.currentResult.variables, _this2.currentResult.context);\n          _this2.mutateOptions.onSettled == null ? void 0 : _this2.mutateOptions.onSettled(_this2.currentResult.data, null, _this2.currentResult.variables, _this2.currentResult.context);\n        } else if (options.onError) {\n          _this2.mutateOptions.onError == null ? void 0 : _this2.mutateOptions.onError(_this2.currentResult.error, _this2.currentResult.variables, _this2.currentResult.context);\n          _this2.mutateOptions.onSettled == null ? void 0 : _this2.mutateOptions.onSettled(undefined, _this2.currentResult.error, _this2.currentResult.variables, _this2.currentResult.context);\n        }\n      } // Then trigger the listeners\n\n\n      if (options.listeners) {\n        _this2.listeners.forEach(function (listener) {\n          listener(_this2.currentResult);\n        });\n      }\n    });\n  };\n\n  return MutationObserver;\n}(subscribable/* Subscribable */.l);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/utils.js\nfunction shouldThrowError(suspense, _useErrorBoundary, params) {\n  // Allow useErrorBoundary function to override throwing behavior on a per-error basis\n  if (typeof _useErrorBoundary === 'function') {\n    return _useErrorBoundary.apply(void 0, params);\n  } // Allow useErrorBoundary to override suspense's throwing behavior\n\n\n  if (typeof _useErrorBoundary === 'boolean') return _useErrorBoundary; // If suspense is enabled default to throwing errors\n\n  return !!suspense;\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/useMutation.js\n\n\n\n\n\n\n // HOOK\n\nfunction useMutation(arg1, arg2, arg3) {\n  var mountedRef = react.useRef(false);\n\n  var _React$useState = react.useState(0),\n      forceUpdate = _React$useState[1];\n\n  var options = (0,utils/* parseMutationArgs */.lV)(arg1, arg2, arg3);\n  var queryClient = useQueryClient();\n  var obsRef = react.useRef();\n\n  if (!obsRef.current) {\n    obsRef.current = new MutationObserver(queryClient, options);\n  } else {\n    obsRef.current.setOptions(options);\n  }\n\n  var currentResult = obsRef.current.getCurrentResult();\n  react.useEffect(function () {\n    mountedRef.current = true;\n    var unsubscribe = obsRef.current.subscribe(notifyManager/* notifyManager.batchCalls */.V.batchCalls(function () {\n      if (mountedRef.current) {\n        forceUpdate(function (x) {\n          return x + 1;\n        });\n      }\n    }));\n    return function () {\n      mountedRef.current = false;\n      unsubscribe();\n    };\n  }, []);\n  var mutate = react.useCallback(function (variables, mutateOptions) {\n    obsRef.current.mutate(variables, mutateOptions).catch(utils/* noop */.ZT);\n  }, []);\n\n  if (currentResult.error && shouldThrowError(undefined, obsRef.current.options.useErrorBoundary, [currentResult.error])) {\n    throw currentResult.error;\n  }\n\n  return (0,esm_extends/* default */.Z)({}, currentResult, {\n    mutate: mutate,\n    mutateAsync: currentResult.mutate\n  });\n}\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/focusManager.js\nvar focusManager = __webpack_require__(9852);\n// EXTERNAL MODULE: ./node_modules/react-query/es/core/retryer.js\nvar retryer = __webpack_require__(1216);\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/queryObserver.js\n\n\n\n\n\n\n\n\nvar QueryObserver = /*#__PURE__*/function (_Subscribable) {\n  (0,inheritsLoose/* default */.Z)(QueryObserver, _Subscribable);\n\n  function QueryObserver(client, options) {\n    var _this;\n\n    _this = _Subscribable.call(this) || this;\n    _this.client = client;\n    _this.options = options;\n    _this.trackedProps = [];\n    _this.selectError = null;\n\n    _this.bindMethods();\n\n    _this.setOptions(options);\n\n    return _this;\n  }\n\n  var _proto = QueryObserver.prototype;\n\n  _proto.bindMethods = function bindMethods() {\n    this.remove = this.remove.bind(this);\n    this.refetch = this.refetch.bind(this);\n  };\n\n  _proto.onSubscribe = function onSubscribe() {\n    if (this.listeners.length === 1) {\n      this.currentQuery.addObserver(this);\n\n      if (shouldFetchOnMount(this.currentQuery, this.options)) {\n        this.executeFetch();\n      }\n\n      this.updateTimers();\n    }\n  };\n\n  _proto.onUnsubscribe = function onUnsubscribe() {\n    if (!this.listeners.length) {\n      this.destroy();\n    }\n  };\n\n  _proto.shouldFetchOnReconnect = function shouldFetchOnReconnect() {\n    return shouldFetchOn(this.currentQuery, this.options, this.options.refetchOnReconnect);\n  };\n\n  _proto.shouldFetchOnWindowFocus = function shouldFetchOnWindowFocus() {\n    return shouldFetchOn(this.currentQuery, this.options, this.options.refetchOnWindowFocus);\n  };\n\n  _proto.destroy = function destroy() {\n    this.listeners = [];\n    this.clearTimers();\n    this.currentQuery.removeObserver(this);\n  };\n\n  _proto.setOptions = function setOptions(options, notifyOptions) {\n    var prevOptions = this.options;\n    var prevQuery = this.currentQuery;\n    this.options = this.client.defaultQueryObserverOptions(options);\n\n    if (typeof this.options.enabled !== 'undefined' && typeof this.options.enabled !== 'boolean') {\n      throw new Error('Expected enabled to be a boolean');\n    } // Keep previous query key if the user does not supply one\n\n\n    if (!this.options.queryKey) {\n      this.options.queryKey = prevOptions.queryKey;\n    }\n\n    this.updateQuery();\n    var mounted = this.hasListeners(); // Fetch if there are subscribers\n\n    if (mounted && shouldFetchOptionally(this.currentQuery, prevQuery, this.options, prevOptions)) {\n      this.executeFetch();\n    } // Update result\n\n\n    this.updateResult(notifyOptions); // Update stale interval if needed\n\n    if (mounted && (this.currentQuery !== prevQuery || this.options.enabled !== prevOptions.enabled || this.options.staleTime !== prevOptions.staleTime)) {\n      this.updateStaleTimeout();\n    }\n\n    var nextRefetchInterval = this.computeRefetchInterval(); // Update refetch interval if needed\n\n    if (mounted && (this.currentQuery !== prevQuery || this.options.enabled !== prevOptions.enabled || nextRefetchInterval !== this.currentRefetchInterval)) {\n      this.updateRefetchInterval(nextRefetchInterval);\n    }\n  };\n\n  _proto.getOptimisticResult = function getOptimisticResult(options) {\n    var defaultedOptions = this.client.defaultQueryObserverOptions(options);\n    var query = this.client.getQueryCache().build(this.client, defaultedOptions);\n    return this.createResult(query, defaultedOptions);\n  };\n\n  _proto.getCurrentResult = function getCurrentResult() {\n    return this.currentResult;\n  };\n\n  _proto.trackResult = function trackResult(result, defaultedOptions) {\n    var _this2 = this;\n\n    var trackedResult = {};\n\n    var trackProp = function trackProp(key) {\n      if (!_this2.trackedProps.includes(key)) {\n        _this2.trackedProps.push(key);\n      }\n    };\n\n    Object.keys(result).forEach(function (key) {\n      Object.defineProperty(trackedResult, key, {\n        configurable: false,\n        enumerable: true,\n        get: function get() {\n          trackProp(key);\n          return result[key];\n        }\n      });\n    });\n\n    if (defaultedOptions.useErrorBoundary || defaultedOptions.suspense) {\n      trackProp('error');\n    }\n\n    return trackedResult;\n  };\n\n  _proto.getNextResult = function getNextResult(options) {\n    var _this3 = this;\n\n    return new Promise(function (resolve, reject) {\n      var unsubscribe = _this3.subscribe(function (result) {\n        if (!result.isFetching) {\n          unsubscribe();\n\n          if (result.isError && (options == null ? void 0 : options.throwOnError)) {\n            reject(result.error);\n          } else {\n            resolve(result);\n          }\n        }\n      });\n    });\n  };\n\n  _proto.getCurrentQuery = function getCurrentQuery() {\n    return this.currentQuery;\n  };\n\n  _proto.remove = function remove() {\n    this.client.getQueryCache().remove(this.currentQuery);\n  };\n\n  _proto.refetch = function refetch(options) {\n    return this.fetch((0,esm_extends/* default */.Z)({}, options, {\n      meta: {\n        refetchPage: options == null ? void 0 : options.refetchPage\n      }\n    }));\n  };\n\n  _proto.fetchOptimistic = function fetchOptimistic(options) {\n    var _this4 = this;\n\n    var defaultedOptions = this.client.defaultQueryObserverOptions(options);\n    var query = this.client.getQueryCache().build(this.client, defaultedOptions);\n    return query.fetch().then(function () {\n      return _this4.createResult(query, defaultedOptions);\n    });\n  };\n\n  _proto.fetch = function fetch(fetchOptions) {\n    var _this5 = this;\n\n    return this.executeFetch(fetchOptions).then(function () {\n      _this5.updateResult();\n\n      return _this5.currentResult;\n    });\n  };\n\n  _proto.executeFetch = function executeFetch(fetchOptions) {\n    // Make sure we reference the latest query as the current one might have been removed\n    this.updateQuery(); // Fetch\n\n    var promise = this.currentQuery.fetch(this.options, fetchOptions);\n\n    if (!(fetchOptions == null ? void 0 : fetchOptions.throwOnError)) {\n      promise = promise.catch(utils/* noop */.ZT);\n    }\n\n    return promise;\n  };\n\n  _proto.updateStaleTimeout = function updateStaleTimeout() {\n    var _this6 = this;\n\n    this.clearStaleTimeout();\n\n    if (utils/* isServer */.sk || this.currentResult.isStale || !(0,utils/* isValidTimeout */.PN)(this.options.staleTime)) {\n      return;\n    }\n\n    var time = (0,utils/* timeUntilStale */.Kp)(this.currentResult.dataUpdatedAt, this.options.staleTime); // The timeout is sometimes triggered 1 ms before the stale time expiration.\n    // To mitigate this issue we always add 1 ms to the timeout.\n\n    var timeout = time + 1;\n    this.staleTimeoutId = setTimeout(function () {\n      if (!_this6.currentResult.isStale) {\n        _this6.updateResult();\n      }\n    }, timeout);\n  };\n\n  _proto.computeRefetchInterval = function computeRefetchInterval() {\n    var _this$options$refetch;\n\n    return typeof this.options.refetchInterval === 'function' ? this.options.refetchInterval(this.currentResult.data, this.currentQuery) : (_this$options$refetch = this.options.refetchInterval) != null ? _this$options$refetch : false;\n  };\n\n  _proto.updateRefetchInterval = function updateRefetchInterval(nextInterval) {\n    var _this7 = this;\n\n    this.clearRefetchInterval();\n    this.currentRefetchInterval = nextInterval;\n\n    if (utils/* isServer */.sk || this.options.enabled === false || !(0,utils/* isValidTimeout */.PN)(this.currentRefetchInterval) || this.currentRefetchInterval === 0) {\n      return;\n    }\n\n    this.refetchIntervalId = setInterval(function () {\n      if (_this7.options.refetchIntervalInBackground || focusManager/* focusManager.isFocused */.j.isFocused()) {\n        _this7.executeFetch();\n      }\n    }, this.currentRefetchInterval);\n  };\n\n  _proto.updateTimers = function updateTimers() {\n    this.updateStaleTimeout();\n    this.updateRefetchInterval(this.computeRefetchInterval());\n  };\n\n  _proto.clearTimers = function clearTimers() {\n    this.clearStaleTimeout();\n    this.clearRefetchInterval();\n  };\n\n  _proto.clearStaleTimeout = function clearStaleTimeout() {\n    if (this.staleTimeoutId) {\n      clearTimeout(this.staleTimeoutId);\n      this.staleTimeoutId = undefined;\n    }\n  };\n\n  _proto.clearRefetchInterval = function clearRefetchInterval() {\n    if (this.refetchIntervalId) {\n      clearInterval(this.refetchIntervalId);\n      this.refetchIntervalId = undefined;\n    }\n  };\n\n  _proto.createResult = function createResult(query, options) {\n    var prevQuery = this.currentQuery;\n    var prevOptions = this.options;\n    var prevResult = this.currentResult;\n    var prevResultState = this.currentResultState;\n    var prevResultOptions = this.currentResultOptions;\n    var queryChange = query !== prevQuery;\n    var queryInitialState = queryChange ? query.state : this.currentQueryInitialState;\n    var prevQueryResult = queryChange ? this.currentResult : this.previousQueryResult;\n    var state = query.state;\n    var dataUpdatedAt = state.dataUpdatedAt,\n        error = state.error,\n        errorUpdatedAt = state.errorUpdatedAt,\n        isFetching = state.isFetching,\n        status = state.status;\n    var isPreviousData = false;\n    var isPlaceholderData = false;\n    var data; // Optimistically set result in fetching state if needed\n\n    if (options.optimisticResults) {\n      var mounted = this.hasListeners();\n      var fetchOnMount = !mounted && shouldFetchOnMount(query, options);\n      var fetchOptionally = mounted && shouldFetchOptionally(query, prevQuery, options, prevOptions);\n\n      if (fetchOnMount || fetchOptionally) {\n        isFetching = true;\n\n        if (!dataUpdatedAt) {\n          status = 'loading';\n        }\n      }\n    } // Keep previous data if needed\n\n\n    if (options.keepPreviousData && !state.dataUpdateCount && (prevQueryResult == null ? void 0 : prevQueryResult.isSuccess) && status !== 'error') {\n      data = prevQueryResult.data;\n      dataUpdatedAt = prevQueryResult.dataUpdatedAt;\n      status = prevQueryResult.status;\n      isPreviousData = true;\n    } // Select data if needed\n    else if (options.select && typeof state.data !== 'undefined') {\n        // Memoize select result\n        if (prevResult && state.data === (prevResultState == null ? void 0 : prevResultState.data) && options.select === this.selectFn) {\n          data = this.selectResult;\n        } else {\n          try {\n            this.selectFn = options.select;\n            data = options.select(state.data);\n\n            if (options.structuralSharing !== false) {\n              data = (0,utils/* replaceEqualDeep */.Q$)(prevResult == null ? void 0 : prevResult.data, data);\n            }\n\n            this.selectResult = data;\n            this.selectError = null;\n          } catch (selectError) {\n            (0,logger/* getLogger */.j)().error(selectError);\n            this.selectError = selectError;\n          }\n        }\n      } // Use query data\n      else {\n          data = state.data;\n        } // Show placeholder data if needed\n\n\n    if (typeof options.placeholderData !== 'undefined' && typeof data === 'undefined' && (status === 'loading' || status === 'idle')) {\n      var placeholderData; // Memoize placeholder data\n\n      if ((prevResult == null ? void 0 : prevResult.isPlaceholderData) && options.placeholderData === (prevResultOptions == null ? void 0 : prevResultOptions.placeholderData)) {\n        placeholderData = prevResult.data;\n      } else {\n        placeholderData = typeof options.placeholderData === 'function' ? options.placeholderData() : options.placeholderData;\n\n        if (options.select && typeof placeholderData !== 'undefined') {\n          try {\n            placeholderData = options.select(placeholderData);\n\n            if (options.structuralSharing !== false) {\n              placeholderData = (0,utils/* replaceEqualDeep */.Q$)(prevResult == null ? void 0 : prevResult.data, placeholderData);\n            }\n\n            this.selectError = null;\n          } catch (selectError) {\n            (0,logger/* getLogger */.j)().error(selectError);\n            this.selectError = selectError;\n          }\n        }\n      }\n\n      if (typeof placeholderData !== 'undefined') {\n        status = 'success';\n        data = placeholderData;\n        isPlaceholderData = true;\n      }\n    }\n\n    if (this.selectError) {\n      error = this.selectError;\n      data = this.selectResult;\n      errorUpdatedAt = Date.now();\n      status = 'error';\n    }\n\n    var result = {\n      status: status,\n      isLoading: status === 'loading',\n      isSuccess: status === 'success',\n      isError: status === 'error',\n      isIdle: status === 'idle',\n      data: data,\n      dataUpdatedAt: dataUpdatedAt,\n      error: error,\n      errorUpdatedAt: errorUpdatedAt,\n      failureCount: state.fetchFailureCount,\n      errorUpdateCount: state.errorUpdateCount,\n      isFetched: state.dataUpdateCount > 0 || state.errorUpdateCount > 0,\n      isFetchedAfterMount: state.dataUpdateCount > queryInitialState.dataUpdateCount || state.errorUpdateCount > queryInitialState.errorUpdateCount,\n      isFetching: isFetching,\n      isRefetching: isFetching && status !== 'loading',\n      isLoadingError: status === 'error' && state.dataUpdatedAt === 0,\n      isPlaceholderData: isPlaceholderData,\n      isPreviousData: isPreviousData,\n      isRefetchError: status === 'error' && state.dataUpdatedAt !== 0,\n      isStale: isStale(query, options),\n      refetch: this.refetch,\n      remove: this.remove\n    };\n    return result;\n  };\n\n  _proto.shouldNotifyListeners = function shouldNotifyListeners(result, prevResult) {\n    if (!prevResult) {\n      return true;\n    }\n\n    var _this$options = this.options,\n        notifyOnChangeProps = _this$options.notifyOnChangeProps,\n        notifyOnChangePropsExclusions = _this$options.notifyOnChangePropsExclusions;\n\n    if (!notifyOnChangeProps && !notifyOnChangePropsExclusions) {\n      return true;\n    }\n\n    if (notifyOnChangeProps === 'tracked' && !this.trackedProps.length) {\n      return true;\n    }\n\n    var includedProps = notifyOnChangeProps === 'tracked' ? this.trackedProps : notifyOnChangeProps;\n    return Object.keys(result).some(function (key) {\n      var typedKey = key;\n      var changed = result[typedKey] !== prevResult[typedKey];\n      var isIncluded = includedProps == null ? void 0 : includedProps.some(function (x) {\n        return x === key;\n      });\n      var isExcluded = notifyOnChangePropsExclusions == null ? void 0 : notifyOnChangePropsExclusions.some(function (x) {\n        return x === key;\n      });\n      return changed && !isExcluded && (!includedProps || isIncluded);\n    });\n  };\n\n  _proto.updateResult = function updateResult(notifyOptions) {\n    var prevResult = this.currentResult;\n    this.currentResult = this.createResult(this.currentQuery, this.options);\n    this.currentResultState = this.currentQuery.state;\n    this.currentResultOptions = this.options; // Only notify if something has changed\n\n    if ((0,utils/* shallowEqualObjects */.VS)(this.currentResult, prevResult)) {\n      return;\n    } // Determine which callbacks to trigger\n\n\n    var defaultNotifyOptions = {\n      cache: true\n    };\n\n    if ((notifyOptions == null ? void 0 : notifyOptions.listeners) !== false && this.shouldNotifyListeners(this.currentResult, prevResult)) {\n      defaultNotifyOptions.listeners = true;\n    }\n\n    this.notify((0,esm_extends/* default */.Z)({}, defaultNotifyOptions, notifyOptions));\n  };\n\n  _proto.updateQuery = function updateQuery() {\n    var query = this.client.getQueryCache().build(this.client, this.options);\n\n    if (query === this.currentQuery) {\n      return;\n    }\n\n    var prevQuery = this.currentQuery;\n    this.currentQuery = query;\n    this.currentQueryInitialState = query.state;\n    this.previousQueryResult = this.currentResult;\n\n    if (this.hasListeners()) {\n      prevQuery == null ? void 0 : prevQuery.removeObserver(this);\n      query.addObserver(this);\n    }\n  };\n\n  _proto.onQueryUpdate = function onQueryUpdate(action) {\n    var notifyOptions = {};\n\n    if (action.type === 'success') {\n      notifyOptions.onSuccess = true;\n    } else if (action.type === 'error' && !(0,retryer/* isCancelledError */.DV)(action.error)) {\n      notifyOptions.onError = true;\n    }\n\n    this.updateResult(notifyOptions);\n\n    if (this.hasListeners()) {\n      this.updateTimers();\n    }\n  };\n\n  _proto.notify = function notify(notifyOptions) {\n    var _this8 = this;\n\n    notifyManager/* notifyManager.batch */.V.batch(function () {\n      // First trigger the configuration callbacks\n      if (notifyOptions.onSuccess) {\n        _this8.options.onSuccess == null ? void 0 : _this8.options.onSuccess(_this8.currentResult.data);\n        _this8.options.onSettled == null ? void 0 : _this8.options.onSettled(_this8.currentResult.data, null);\n      } else if (notifyOptions.onError) {\n        _this8.options.onError == null ? void 0 : _this8.options.onError(_this8.currentResult.error);\n        _this8.options.onSettled == null ? void 0 : _this8.options.onSettled(undefined, _this8.currentResult.error);\n      } // Then trigger the listeners\n\n\n      if (notifyOptions.listeners) {\n        _this8.listeners.forEach(function (listener) {\n          listener(_this8.currentResult);\n        });\n      } // Then the cache listeners\n\n\n      if (notifyOptions.cache) {\n        _this8.client.getQueryCache().notify({\n          query: _this8.currentQuery,\n          type: 'observerResultsUpdated'\n        });\n      }\n    });\n  };\n\n  return QueryObserver;\n}(subscribable/* Subscribable */.l);\n\nfunction shouldLoadOnMount(query, options) {\n  return options.enabled !== false && !query.state.dataUpdatedAt && !(query.state.status === 'error' && options.retryOnMount === false);\n}\n\nfunction shouldFetchOnMount(query, options) {\n  return shouldLoadOnMount(query, options) || query.state.dataUpdatedAt > 0 && shouldFetchOn(query, options, options.refetchOnMount);\n}\n\nfunction shouldFetchOn(query, options, field) {\n  if (options.enabled !== false) {\n    var value = typeof field === 'function' ? field(query) : field;\n    return value === 'always' || value !== false && isStale(query, options);\n  }\n\n  return false;\n}\n\nfunction shouldFetchOptionally(query, prevQuery, options, prevOptions) {\n  return options.enabled !== false && (query !== prevQuery || prevOptions.enabled === false) && (!options.suspense || query.state.status !== 'error') && isStale(query, options);\n}\n\nfunction isStale(query, options) {\n  return query.isStaleByTime(options.staleTime);\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/QueryErrorResetBoundary.js\n // CONTEXT\n\nfunction createValue() {\n  var _isReset = false;\n  return {\n    clearReset: function clearReset() {\n      _isReset = false;\n    },\n    reset: function reset() {\n      _isReset = true;\n    },\n    isReset: function isReset() {\n      return _isReset;\n    }\n  };\n}\n\nvar QueryErrorResetBoundaryContext = /*#__PURE__*/react.createContext(createValue()); // HOOK\n\nvar useQueryErrorResetBoundary = function useQueryErrorResetBoundary() {\n  return react.useContext(QueryErrorResetBoundaryContext);\n}; // COMPONENT\n\nvar QueryErrorResetBoundary = function QueryErrorResetBoundary(_ref) {\n  var children = _ref.children;\n  var value = React.useMemo(function () {\n    return createValue();\n  }, []);\n  return /*#__PURE__*/React.createElement(QueryErrorResetBoundaryContext.Provider, {\n    value: value\n  }, typeof children === 'function' ? children(value) : children);\n};\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/useBaseQuery.js\n\n\n\n\n\nfunction useBaseQuery(options, Observer) {\n  var mountedRef = react.useRef(false);\n\n  var _React$useState = react.useState(0),\n      forceUpdate = _React$useState[1];\n\n  var queryClient = useQueryClient();\n  var errorResetBoundary = useQueryErrorResetBoundary();\n  var defaultedOptions = queryClient.defaultQueryObserverOptions(options); // Make sure results are optimistically set in fetching state before subscribing or updating options\n\n  defaultedOptions.optimisticResults = true; // Include callbacks in batch renders\n\n  if (defaultedOptions.onError) {\n    defaultedOptions.onError = notifyManager/* notifyManager.batchCalls */.V.batchCalls(defaultedOptions.onError);\n  }\n\n  if (defaultedOptions.onSuccess) {\n    defaultedOptions.onSuccess = notifyManager/* notifyManager.batchCalls */.V.batchCalls(defaultedOptions.onSuccess);\n  }\n\n  if (defaultedOptions.onSettled) {\n    defaultedOptions.onSettled = notifyManager/* notifyManager.batchCalls */.V.batchCalls(defaultedOptions.onSettled);\n  }\n\n  if (defaultedOptions.suspense) {\n    // Always set stale time when using suspense to prevent\n    // fetching again when directly mounting after suspending\n    if (typeof defaultedOptions.staleTime !== 'number') {\n      defaultedOptions.staleTime = 1000;\n    } // Set cache time to 1 if the option has been set to 0\n    // when using suspense to prevent infinite loop of fetches\n\n\n    if (defaultedOptions.cacheTime === 0) {\n      defaultedOptions.cacheTime = 1;\n    }\n  }\n\n  if (defaultedOptions.suspense || defaultedOptions.useErrorBoundary) {\n    // Prevent retrying failed query if the error boundary has not been reset yet\n    if (!errorResetBoundary.isReset()) {\n      defaultedOptions.retryOnMount = false;\n    }\n  }\n\n  var _React$useState2 = react.useState(function () {\n    return new Observer(queryClient, defaultedOptions);\n  }),\n      observer = _React$useState2[0];\n\n  var result = observer.getOptimisticResult(defaultedOptions);\n  react.useEffect(function () {\n    mountedRef.current = true;\n    errorResetBoundary.clearReset();\n    var unsubscribe = observer.subscribe(notifyManager/* notifyManager.batchCalls */.V.batchCalls(function () {\n      if (mountedRef.current) {\n        forceUpdate(function (x) {\n          return x + 1;\n        });\n      }\n    })); // Update result to make sure we did not miss any query updates\n    // between creating the observer and subscribing to it.\n\n    observer.updateResult();\n    return function () {\n      mountedRef.current = false;\n      unsubscribe();\n    };\n  }, [errorResetBoundary, observer]);\n  react.useEffect(function () {\n    // Do not notify on updates because of changes in the options because\n    // these changes should already be reflected in the optimistic result.\n    observer.setOptions(defaultedOptions, {\n      listeners: false\n    });\n  }, [defaultedOptions, observer]); // Handle suspense\n\n  if (defaultedOptions.suspense && result.isLoading) {\n    throw observer.fetchOptimistic(defaultedOptions).then(function (_ref) {\n      var data = _ref.data;\n      defaultedOptions.onSuccess == null ? void 0 : defaultedOptions.onSuccess(data);\n      defaultedOptions.onSettled == null ? void 0 : defaultedOptions.onSettled(data, null);\n    }).catch(function (error) {\n      errorResetBoundary.clearReset();\n      defaultedOptions.onError == null ? void 0 : defaultedOptions.onError(error);\n      defaultedOptions.onSettled == null ? void 0 : defaultedOptions.onSettled(undefined, error);\n    });\n  } // Handle error boundary\n\n\n  if (result.isError && !errorResetBoundary.isReset() && !result.isFetching && shouldThrowError(defaultedOptions.suspense, defaultedOptions.useErrorBoundary, [result.error, observer.getCurrentQuery()])) {\n    throw result.error;\n  } // Handle result property usage tracking\n\n\n  if (defaultedOptions.notifyOnChangeProps === 'tracked') {\n    result = observer.trackResult(result, defaultedOptions);\n  }\n\n  return result;\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/useQuery.js\n\n\n // HOOK\n\nfunction useQuery(arg1, arg2, arg3) {\n  var parsedOptions = (0,utils/* parseQueryArgs */._v)(arg1, arg2, arg3);\n  return useBaseQuery(parsedOptions, QueryObserver);\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/core/hydration.js\n\n\n// TYPES\n// FUNCTIONS\nfunction dehydrateMutation(mutation) {\n  return {\n    mutationKey: mutation.options.mutationKey,\n    state: mutation.state\n  };\n} // Most config is not dehydrated but instead meant to configure again when\n// consuming the de/rehydrated data, typically with useQuery on the client.\n// Sometimes it might make sense to prefetch data on the server and include\n// in the html-payload, but not consume it on the initial render.\n\n\nfunction dehydrateQuery(query) {\n  return {\n    state: query.state,\n    queryKey: query.queryKey,\n    queryHash: query.queryHash\n  };\n}\n\nfunction defaultShouldDehydrateMutation(mutation) {\n  return mutation.state.isPaused;\n}\n\nfunction defaultShouldDehydrateQuery(query) {\n  return query.state.status === 'success';\n}\n\nfunction dehydrate(client, options) {\n  var _options, _options2;\n\n  options = options || {};\n  var mutations = [];\n  var queries = [];\n\n  if (((_options = options) == null ? void 0 : _options.dehydrateMutations) !== false) {\n    var shouldDehydrateMutation = options.shouldDehydrateMutation || defaultShouldDehydrateMutation;\n    client.getMutationCache().getAll().forEach(function (mutation) {\n      if (shouldDehydrateMutation(mutation)) {\n        mutations.push(dehydrateMutation(mutation));\n      }\n    });\n  }\n\n  if (((_options2 = options) == null ? void 0 : _options2.dehydrateQueries) !== false) {\n    var shouldDehydrateQuery = options.shouldDehydrateQuery || defaultShouldDehydrateQuery;\n    client.getQueryCache().getAll().forEach(function (query) {\n      if (shouldDehydrateQuery(query)) {\n        queries.push(dehydrateQuery(query));\n      }\n    });\n  }\n\n  return {\n    mutations: mutations,\n    queries: queries\n  };\n}\nfunction hydrate(client, dehydratedState, options) {\n  if (typeof dehydratedState !== 'object' || dehydratedState === null) {\n    return;\n  }\n\n  var mutationCache = client.getMutationCache();\n  var queryCache = client.getQueryCache();\n  var mutations = dehydratedState.mutations || [];\n  var queries = dehydratedState.queries || [];\n  mutations.forEach(function (dehydratedMutation) {\n    var _options$defaultOptio;\n\n    mutationCache.build(client, (0,esm_extends/* default */.Z)({}, options == null ? void 0 : (_options$defaultOptio = options.defaultOptions) == null ? void 0 : _options$defaultOptio.mutations, {\n      mutationKey: dehydratedMutation.mutationKey\n    }), dehydratedMutation.state);\n  });\n  queries.forEach(function (dehydratedQuery) {\n    var _options$defaultOptio2;\n\n    var query = queryCache.get(dehydratedQuery.queryHash); // Do not hydrate if an existing query exists with newer data\n\n    if (query) {\n      if (query.state.dataUpdatedAt < dehydratedQuery.state.dataUpdatedAt) {\n        query.setState(dehydratedQuery.state);\n      }\n\n      return;\n    } // Restore query\n\n\n    queryCache.build(client, (0,esm_extends/* default */.Z)({}, options == null ? void 0 : (_options$defaultOptio2 = options.defaultOptions) == null ? void 0 : _options$defaultOptio2.queries, {\n      queryKey: dehydratedQuery.queryKey,\n      queryHash: dehydratedQuery.queryHash\n    }), dehydratedQuery.state);\n  });\n}\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/Hydrate.js\n\n\n\nfunction useHydrate(state, options) {\n  var queryClient = useQueryClient();\n  var optionsRef = react.useRef(options);\n  optionsRef.current = options; // Running hydrate again with the same queries is safe,\n  // it wont overwrite or initialize existing queries,\n  // relying on useMemo here is only a performance optimization.\n  // hydrate can and should be run *during* render here for SSR to work properly\n\n  react.useMemo(function () {\n    if (state) {\n      hydrate(queryClient, state, optionsRef.current);\n    }\n  }, [queryClient, state]);\n}\nvar Hydrate = function Hydrate(_ref) {\n  var children = _ref.children,\n      options = _ref.options,\n      state = _ref.state;\n  useHydrate(state, options);\n  return children;\n};\n;// CONCATENATED MODULE: ./node_modules/react-query/es/react/index.js\n// Side effects\n\n\n\n\n\n\n\n\n\n\n // Types\n\n\n\n/***/ }),\n\n/***/ 4790:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif (true) {\n  module.exports = EventEmitter;\n}\n\n\n/***/ }),\n\n/***/ 9509:\n/***/ (function(module, exports, __webpack_require__) {\n\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = __webpack_require__(8764)\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n  for (var key in src) {\n    dst[key] = src[key]\n  }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n  module.exports = buffer\n} else {\n  // Copy properties from require('buffer')\n  copyProps(buffer, exports)\n  exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n  if (typeof arg === 'number') {\n    throw new TypeError('Argument must not be a number')\n  }\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  var buf = Buffer(size)\n  if (fill !== undefined) {\n    if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n  } else {\n    buf.fill(0)\n  }\n  return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return buffer.SlowBuffer(size)\n}\n\n\n/***/ }),\n\n/***/ 7771:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar GetIntrinsic = __webpack_require__(210);\nvar define = __webpack_require__(2296);\nvar hasDescriptors = __webpack_require__(1044)();\nvar gOPD = __webpack_require__(7296);\n\nvar $TypeError = __webpack_require__(4453);\nvar $floor = GetIntrinsic('%Math.floor%');\n\n/** @type {import('.')} */\nmodule.exports = function setFunctionLength(fn, length) {\n\tif (typeof fn !== 'function') {\n\t\tthrow new $TypeError('`fn` is not a function');\n\t}\n\tif (typeof length !== 'number' || length < 0 || length > 0xFFFFFFFF || $floor(length) !== length) {\n\t\tthrow new $TypeError('`length` must be a positive 32-bit integer');\n\t}\n\n\tvar loose = arguments.length > 2 && !!arguments[2];\n\n\tvar functionLengthIsConfigurable = true;\n\tvar functionLengthIsWritable = true;\n\tif ('length' in fn && gOPD) {\n\t\tvar desc = gOPD(fn, 'length');\n\t\tif (desc && !desc.configurable) {\n\t\t\tfunctionLengthIsConfigurable = false;\n\t\t}\n\t\tif (desc && !desc.writable) {\n\t\t\tfunctionLengthIsWritable = false;\n\t\t}\n\t}\n\n\tif (functionLengthIsConfigurable || functionLengthIsWritable || !loose) {\n\t\tif (hasDescriptors) {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length, true, true);\n\t\t} else {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length);\n\t\t}\n\t}\n\treturn fn;\n};\n\n\n/***/ }),\n\n/***/ 6018:\n/***/ (function(module) {\n\n\"use strict\";\n\n\nvar isProduction = \"production\" === 'production';\nvar prefix = 'Invariant failed';\nfunction invariant(condition, message) {\n    if (condition) {\n        return;\n    }\n    if (isProduction) {\n        throw new Error(prefix);\n    }\n    var provided = typeof message === 'function' ? message() : message;\n    var value = provided ? \"\".concat(prefix, \": \").concat(provided) : prefix;\n    throw new Error(value);\n}\n\nmodule.exports = invariant;\n\n\n/***/ }),\n\n/***/ 384:\n/***/ (function(module) {\n\nmodule.exports = function isBuffer(arg) {\n  return arg && typeof arg === 'object'\n    && typeof arg.copy === 'function'\n    && typeof arg.fill === 'function'\n    && typeof arg.readUInt8 === 'function';\n}\n\n/***/ }),\n\n/***/ 5955:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n\n\nvar isArgumentsObject = __webpack_require__(2584);\nvar isGeneratorFunction = __webpack_require__(8662);\nvar whichTypedArray = __webpack_require__(6430);\nvar isTypedArray = __webpack_require__(5692);\n\nfunction uncurryThis(f) {\n  return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n  var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n  var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n  if (typeof value !== 'object') {\n    return false;\n  }\n  try {\n    prototypeValueOf(value);\n    return true;\n  } catch(e) {\n    return false;\n  }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n  if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n    return ArrayBuffer.isView(value);\n  }\n\n  return (\n    isTypedArray(value) ||\n    isDataView(value)\n  );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n  return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n  return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n  return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n  return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n  return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n  return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n  return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n  return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n  return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n  return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n  return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n  return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n  typeof Map !== 'undefined' &&\n  isMapToString(new Map())\n);\n\nfunction isMap(value) {\n  if (typeof Map === 'undefined') {\n    return false;\n  }\n\n  return isMapToString.working\n    ? isMapToString(value)\n    : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n  return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n  typeof Set !== 'undefined' &&\n  isSetToString(new Set())\n);\nfunction isSet(value) {\n  if (typeof Set === 'undefined') {\n    return false;\n  }\n\n  return isSetToString.working\n    ? isSetToString(value)\n    : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n  return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n  typeof WeakMap !== 'undefined' &&\n  isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n  if (typeof WeakMap === 'undefined') {\n    return false;\n  }\n\n  return isWeakMapToString.working\n    ? isWeakMapToString(value)\n    : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n  return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n  typeof WeakSet !== 'undefined' &&\n  isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n  return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n  return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n  if (typeof ArrayBuffer === 'undefined') {\n    return false;\n  }\n\n  return isArrayBufferToString.working\n    ? isArrayBufferToString(value)\n    : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n  return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  typeof DataView !== 'undefined' &&\n  isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n  if (typeof DataView === 'undefined') {\n    return false;\n  }\n\n  return isDataViewToString.working\n    ? isDataViewToString(value)\n    : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n  return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n  if (typeof SharedArrayBufferCopy === 'undefined') {\n    return false;\n  }\n\n  if (typeof isSharedArrayBufferToString.working === 'undefined') {\n    isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n  }\n\n  return isSharedArrayBufferToString.working\n    ? isSharedArrayBufferToString(value)\n    : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n  return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n  return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n  return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n  return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n  return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n  return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n  return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n  return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n  return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n  return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n  return (\n    isNumberObject(value) ||\n    isStringObject(value) ||\n    isBooleanObject(value) ||\n    isBigIntObject(value) ||\n    isSymbolObject(value)\n  );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n  return typeof Uint8Array !== 'undefined' && (\n    isArrayBuffer(value) ||\n    isSharedArrayBuffer(value)\n  );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n  Object.defineProperty(exports, method, {\n    enumerable: false,\n    value: function() {\n      throw new Error(method + ' is not supported in userland');\n    }\n  });\n});\n\n\n/***/ }),\n\n/***/ 9539:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n/* provided dependency */ var process = __webpack_require__(4155);\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\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n  function getOwnPropertyDescriptors(obj) {\n    var keys = Object.keys(obj);\n    var descriptors = {};\n    for (var i = 0; i < keys.length; i++) {\n      descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n    }\n    return descriptors;\n  };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n  if (typeof process !== 'undefined' && process.noDeprecation === true) {\n    return fn;\n  }\n\n  // Allow for deprecating things in the process of starting up.\n  if (typeof process === 'undefined') {\n    return function() {\n      return exports.deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n  var debugEnv = process.env.NODE_DEBUG;\n  debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n    .replace(/\\*/g, '.*')\n    .replace(/,/g, '$|^')\n    .toUpperCase();\n  debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (debugEnvRegex.test(set)) {\n      var pid = process.pid;\n      debugs[set] = function() {\n        var msg = exports.format.apply(exports, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    exports._extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== exports.inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').slice(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.slice(1, -1);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = __webpack_require__(5955);\n\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n  return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n  return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = __webpack_require__(384);\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = __webpack_require__(5717);\n\nexports._extend = function(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n  if (typeof original !== 'function')\n    throw new TypeError('The \"original\" argument must be of type Function');\n\n  if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n    var fn = original[kCustomPromisifiedSymbol];\n    if (typeof fn !== 'function') {\n      throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n    }\n    Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n      value: fn, enumerable: false, writable: false, configurable: true\n    });\n    return fn;\n  }\n\n  function fn() {\n    var promiseResolve, promiseReject;\n    var promise = new Promise(function (resolve, reject) {\n      promiseResolve = resolve;\n      promiseReject = reject;\n    });\n\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n    args.push(function (err, value) {\n      if (err) {\n        promiseReject(err);\n      } else {\n        promiseResolve(value);\n      }\n    });\n\n    try {\n      original.apply(this, args);\n    } catch (err) {\n      promiseReject(err);\n    }\n\n    return promise;\n  }\n\n  Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n  if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n    value: fn, enumerable: false, writable: false, configurable: true\n  });\n  return Object.defineProperties(\n    fn,\n    getOwnPropertyDescriptors(original)\n  );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n  // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n  // Because `null` is a special error value in callbacks which means \"no error\n  // occurred\", we error-wrap so the callback consumer can distinguish between\n  // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n  if (!reason) {\n    var newReason = new Error('Promise was rejected with a falsy value');\n    newReason.reason = reason;\n    reason = newReason;\n  }\n  return cb(reason);\n}\n\nfunction callbackify(original) {\n  if (typeof original !== 'function') {\n    throw new TypeError('The \"original\" argument must be of type Function');\n  }\n\n  // We DO NOT return the promise as it gives the user a false sense that\n  // the promise is actually somehow related to the callback's execution\n  // and that the callback throwing will reject the promise.\n  function callbackified() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n\n    var maybeCb = args.pop();\n    if (typeof maybeCb !== 'function') {\n      throw new TypeError('The last argument must be of type Function');\n    }\n    var self = this;\n    var cb = function() {\n      return maybeCb.apply(self, arguments);\n    };\n    // In true node style we process the callback on `nextTick` with all the\n    // implications (stack, `uncaughtException`, `async_hooks`)\n    original.apply(this, args)\n      .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n            function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n  }\n\n  Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n  Object.defineProperties(callbackified,\n                          getOwnPropertyDescriptors(original));\n  return callbackified;\n}\nexports.callbackify = callbackify;\n\n\n/***/ }),\n\n/***/ 4880:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"v4\": function() { return /* reexport */ esm_browser_v4; }\n});\n\n// UNUSED EXPORTS: NIL, parse, stringify, v1, v3, v5, validate, version\n\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/rng.js\n// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nvar getRandomValues;\nvar rnds8 = new Uint8Array(16);\nfunction rng() {\n  // lazy load so that environments that need to polyfill have a chance to do so\n  if (!getRandomValues) {\n    // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation. Also,\n    // find the complete implementation of crypto (msCrypto) on IE11.\n    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto) || typeof msCrypto !== 'undefined' && typeof msCrypto.getRandomValues === 'function' && msCrypto.getRandomValues.bind(msCrypto);\n\n    if (!getRandomValues) {\n      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n    }\n  }\n\n  return getRandomValues(rnds8);\n}\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/regex.js\n/* harmony default export */ var regex = (/^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i);\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/validate.js\n\n\nfunction validate(uuid) {\n  return typeof uuid === 'string' && regex.test(uuid);\n}\n\n/* harmony default export */ var esm_browser_validate = (validate);\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/stringify.js\n\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nvar byteToHex = [];\n\nfor (var i = 0; i < 256; ++i) {\n  byteToHex.push((i + 0x100).toString(16).substr(1));\n}\n\nfunction stringify(arr) {\n  var offset = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  // Note: Be careful editing this code!  It's been tuned for performance\n  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n  var uuid = (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase(); // Consistency check for valid UUID.  If this throws, it's likely due to one\n  // of the following:\n  // - One or more input array values don't map to a hex octet (leading to\n  // \"undefined\" in the uuid)\n  // - Invalid input values for the RFC `version` or `variant` fields\n\n  if (!esm_browser_validate(uuid)) {\n    throw TypeError('Stringified UUID is invalid');\n  }\n\n  return uuid;\n}\n\n/* harmony default export */ var esm_browser_stringify = (stringify);\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/v4.js\n\n\n\nfunction v4(options, buf, offset) {\n  options = options || {};\n  var rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (var i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return esm_browser_stringify(rnds);\n}\n\n/* harmony default export */ var esm_browser_v4 = (v4);\n;// CONCATENATED MODULE: ./node_modules/uuid/dist/esm-browser/index.js\n\n\n\n\n\n\n\n\n\n\n/***/ }),\n\n/***/ 6430:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar forEach = __webpack_require__(4029);\nvar availableTypedArrays = __webpack_require__(3083);\nvar callBind = __webpack_require__(5559);\nvar callBound = __webpack_require__(1924);\nvar gOPD = __webpack_require__(7296);\n\n/** @type {(O: object) => string} */\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = __webpack_require__(6410)();\n\nvar g = typeof globalThis === 'undefined' ? __webpack_require__.g : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\n\n/** @type {<T = unknown>(array: readonly T[], value: unknown) => number} */\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n/** @typedef {(receiver: import('.').TypedArray) => string | typeof Uint8Array.prototype.slice.call | typeof Uint8Array.prototype.set.call} Getter */\n/** @type {{ [k in `\\$${import('.').TypedArrayName}`]?: Getter } & { __proto__: null }} */\nvar cache = { __proto__: null };\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr) {\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(descriptor.get);\n\t\t}\n\t});\n} else {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tvar fn = arr.slice || arr.set;\n\t\tif (fn) {\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(fn);\n\t\t}\n\t});\n}\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\t/** @type {ReturnType<typeof tryAllTypedArrays>} */ var found = false;\n\tforEach(\n\t\t// eslint-disable-next-line no-extra-parens\n\t\t/** @type {Record<`\\$${TypedArrayName}`, Getter>} */ /** @type {any} */ (cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */\n\t\tfunction (getter, typedArray) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t// @ts-expect-error TODO: fix\n\t\t\t\t\tif ('$' + getter(value) === typedArray) {\n\t\t\t\t\t\tfound = $slice(typedArray, 1);\n\t\t\t\t\t}\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar trySlices = function tryAllSlices(value) {\n\t/** @type {ReturnType<typeof tryAllSlices>} */ var found = false;\n\tforEach(\n\t\t// eslint-disable-next-line no-extra-parens\n\t\t/** @type {Record<`\\$${TypedArrayName}`, Getter>} */ /** @type {any} */ (cache),\n\t\t/** @type {(getter: typeof cache, name: `\\$${import('.').TypedArrayName}`) => void} */ function (getter, name) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error TODO: fix\n\t\t\t\t\tgetter(value);\n\t\t\t\t\tfound = $slice(name, 1);\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {import('.')} */\nmodule.exports = function whichTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\t/** @type {string} */\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\tif ($indexOf(typedArrays, tag) > -1) {\n\t\t\treturn tag;\n\t\t}\n\t\tif (tag !== 'Object') {\n\t\t\treturn false;\n\t\t}\n\t\t// node < 0.6 hits here on real Typed Arrays\n\t\treturn trySlices(value);\n\t}\n\tif (!gOPD) { return null; } // unknown engine\n\treturn tryTypedArrays(value);\n};\n\n\n/***/ }),\n\n/***/ 6793:\n/***/ (function() {\n\n/* (ignored) */\n\n/***/ }),\n\n/***/ 6601:\n/***/ (function() {\n\n/* (ignored) */\n\n/***/ }),\n\n/***/ 4836:\n/***/ (function(module) {\n\nfunction _interopRequireDefault(e) {\n  return e && e.__esModule ? e : {\n    \"default\": e\n  };\n}\nmodule.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n\n/***/ }),\n\n/***/ 6578:\n/***/ (function(__unused_webpack_module, exports) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.encodeDecode = void 0;\nconst encodeDecode = (layout) => {\n    const decode = layout.decode.bind(layout);\n    const encode = layout.encode.bind(layout);\n    return { decode, encode };\n};\nexports.encodeDecode = encodeDecode;\n//# sourceMappingURL=base.js.map\n\n/***/ }),\n\n/***/ 802:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n/* provided dependency */ var Buffer = __webpack_require__(8764)[\"Buffer\"];\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.u256be = exports.u256 = exports.u192be = exports.u192 = exports.u128be = exports.u128 = exports.u64be = exports.u64 = exports.bigIntBE = exports.bigInt = void 0;\nconst buffer_layout_1 = __webpack_require__(9386);\nconst bigint_buffer_1 = __webpack_require__(475);\nconst base_1 = __webpack_require__(6578);\nconst bigInt = (length) => (property) => {\n    const layout = (0, buffer_layout_1.blob)(length, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const bigIntLayout = layout;\n    bigIntLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return (0, bigint_buffer_1.toBigIntLE)(Buffer.from(src));\n    };\n    bigIntLayout.encode = (bigInt, buffer, offset) => {\n        const src = (0, bigint_buffer_1.toBufferLE)(bigInt, length);\n        return encode(src, buffer, offset);\n    };\n    return bigIntLayout;\n};\nexports.bigInt = bigInt;\nconst bigIntBE = (length) => (property) => {\n    const layout = (0, buffer_layout_1.blob)(length, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const bigIntLayout = layout;\n    bigIntLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return (0, bigint_buffer_1.toBigIntBE)(Buffer.from(src));\n    };\n    bigIntLayout.encode = (bigInt, buffer, offset) => {\n        const src = (0, bigint_buffer_1.toBufferBE)(bigInt, length);\n        return encode(src, buffer, offset);\n    };\n    return bigIntLayout;\n};\nexports.bigIntBE = bigIntBE;\nexports.u64 = (0, exports.bigInt)(8);\nexports.u64be = (0, exports.bigIntBE)(8);\nexports.u128 = (0, exports.bigInt)(16);\nexports.u128be = (0, exports.bigIntBE)(16);\nexports.u192 = (0, exports.bigInt)(24);\nexports.u192be = (0, exports.bigIntBE)(24);\nexports.u256 = (0, exports.bigInt)(32);\nexports.u256be = (0, exports.bigIntBE)(32);\n//# sourceMappingURL=bigint.js.map\n\n/***/ }),\n\n/***/ 4195:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.decimal = exports.WAD = void 0;\nconst bignumber_js_1 = __importDefault(__webpack_require__(4431));\nconst base_1 = __webpack_require__(6578);\nconst bigint_1 = __webpack_require__(802);\nexports.WAD = new bignumber_js_1.default('1e+18');\nconst decimal = (property) => {\n    const layout = (0, bigint_1.u128)(property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const decimalLayout = layout;\n    decimalLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset).toString();\n        return new bignumber_js_1.default(src).div(exports.WAD);\n    };\n    decimalLayout.encode = (decimal, buffer, offset) => {\n        const src = BigInt(decimal.times(exports.WAD).integerValue().toString());\n        return encode(src, buffer, offset);\n    };\n    return decimalLayout;\n};\nexports.decimal = decimal;\n//# sourceMappingURL=decimal.js.map\n\n/***/ }),\n\n/***/ 7278:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n__exportStar(__webpack_require__(6578), exports);\n__exportStar(__webpack_require__(802), exports);\n__exportStar(__webpack_require__(4195), exports);\n__exportStar(__webpack_require__(8670), exports);\n__exportStar(__webpack_require__(2885), exports);\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n\n/***/ 8670:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.bool = void 0;\nconst buffer_layout_1 = __webpack_require__(9386);\nconst base_1 = __webpack_require__(6578);\nconst bool = (property) => {\n    const layout = (0, buffer_layout_1.u8)(property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const boolLayout = layout;\n    boolLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return !!src;\n    };\n    boolLayout.encode = (bool, buffer, offset) => {\n        const src = Number(bool);\n        return encode(src, buffer, offset);\n    };\n    return boolLayout;\n};\nexports.bool = bool;\n//# sourceMappingURL=native.js.map\n\n/***/ }),\n\n/***/ 2885:\n/***/ (function(__unused_webpack_module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.publicKey = void 0;\nconst buffer_layout_1 = __webpack_require__(9386);\nconst web3_js_1 = __webpack_require__(6737);\nconst base_1 = __webpack_require__(6578);\nconst publicKey = (property) => {\n    const layout = (0, buffer_layout_1.blob)(32, property);\n    const { encode, decode } = (0, base_1.encodeDecode)(layout);\n    const publicKeyLayout = layout;\n    publicKeyLayout.decode = (buffer, offset) => {\n        const src = decode(buffer, offset);\n        return new web3_js_1.PublicKey(src);\n    };\n    publicKeyLayout.encode = (publicKey, buffer, offset) => {\n        const src = publicKey.toBuffer();\n        return encode(src, buffer, offset);\n    };\n    return publicKeyLayout;\n};\nexports.publicKey = publicKey;\n//# sourceMappingURL=web3.js.map\n\n/***/ }),\n\n/***/ 3083:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar possibleNames = __webpack_require__(9908);\n\nvar g = typeof globalThis === 'undefined' ? __webpack_require__.g : globalThis;\n\n/** @type {import('.')} */\nmodule.exports = function availableTypedArrays() {\n\tvar /** @type {ReturnType<typeof availableTypedArrays>} */ out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\t// @ts-expect-error\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n\n\n/***/ }),\n\n/***/ 7462:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ _extends; }\n/* harmony export */ });\nfunction _extends() {\n  return _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, _extends.apply(null, arguments);\n}\n\n\n/***/ }),\n\n/***/ 5068:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"Z\": function() { return /* binding */ _inheritsLoose; }\n});\n\n;// CONCATENATED MODULE: ./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js\nfunction _setPrototypeOf(t, e) {\n  return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {\n    return t.__proto__ = e, t;\n  }, _setPrototypeOf(t, e);\n}\n\n;// CONCATENATED MODULE: ./node_modules/@babel/runtime/helpers/esm/inheritsLoose.js\n\nfunction _inheritsLoose(t, o) {\n  t.prototype = Object.create(o.prototype), t.prototype.constructor = t, _setPrototypeOf(t, o);\n}\n\n\n/***/ }),\n\n/***/ 3366:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Z\": function() { return /* binding */ _objectWithoutPropertiesLoose; }\n/* harmony export */ });\nfunction _objectWithoutPropertiesLoose(r, e) {\n  if (null == r) return {};\n  var t = {};\n  for (var n in r) if ({}.hasOwnProperty.call(r, n)) {\n    if (e.indexOf(n) >= 0) continue;\n    t[n] = r[n];\n  }\n  return t;\n}\n\n\n/***/ }),\n\n/***/ 3527:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"Gg\": function() { return /* binding */ exists; },\n/* harmony export */   \"J8\": function() { return /* binding */ output; },\n/* harmony export */   \"Rx\": function() { return /* binding */ number; },\n/* harmony export */   \"aI\": function() { return /* binding */ bytes; },\n/* harmony export */   \"vp\": function() { return /* binding */ hash; }\n/* harmony export */ });\n/* unused harmony exports isBytes, bool */\nfunction number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(h.outputLen);\n    number(h.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\n\nconst assert = { number, bool, bytes, hash, exists, output };\n/* unused harmony default export */ var __WEBPACK_DEFAULT_EXPORT__ = ((/* unused pure expression or super */ null && (assert)));\n//# sourceMappingURL=_assert.js.map\n\n/***/ }),\n\n/***/ 4359:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"VR\": function() { return /* binding */ HashMD; },\n/* harmony export */   \"bc\": function() { return /* binding */ Chi; },\n/* harmony export */   \"l3\": function() { return /* binding */ Maj; }\n/* harmony export */ });\n/* harmony import */ var _assert_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(3527);\n/* harmony import */ var _utils_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(6409);\n\n\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nclass HashMD extends _utils_js__WEBPACK_IMPORTED_MODULE_0__/* .Hash */ .kb {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = (0,_utils_js__WEBPACK_IMPORTED_MODULE_0__/* .createView */ .GL)(this.buffer);\n    }\n    update(data) {\n        (0,_assert_js__WEBPACK_IMPORTED_MODULE_1__/* .exists */ .Gg)(this);\n        const { view, buffer, blockLen } = this;\n        data = (0,_utils_js__WEBPACK_IMPORTED_MODULE_0__/* .toBytes */ .O0)(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = (0,_utils_js__WEBPACK_IMPORTED_MODULE_0__/* .createView */ .GL)(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        (0,_assert_js__WEBPACK_IMPORTED_MODULE_1__/* .exists */ .Gg)(this);\n        (0,_assert_js__WEBPACK_IMPORTED_MODULE_1__/* .output */ .J8)(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = (0,_utils_js__WEBPACK_IMPORTED_MODULE_0__/* .createView */ .GL)(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_md.js.map\n\n/***/ }),\n\n/***/ 7748:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"J\": function() { return /* binding */ sha256; }\n/* harmony export */ });\n/* unused harmony export sha224 */\n/* harmony import */ var _md_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(4359);\n/* harmony import */ var _utils_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6409);\n\n\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends _md_js__WEBPACK_IMPORTED_MODULE_0__/* .HashMD */ .VR {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = SHA256_IV[0] | 0;\n        this.B = SHA256_IV[1] | 0;\n        this.C = SHA256_IV[2] | 0;\n        this.D = SHA256_IV[3] | 0;\n        this.E = SHA256_IV[4] | 0;\n        this.F = SHA256_IV[5] | 0;\n        this.G = SHA256_IV[6] | 0;\n        this.H = SHA256_IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(W15, 7) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(W15, 18) ^ (W15 >>> 3);\n            const s1 = (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(W2, 17) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(E, 6) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(E, 11) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(E, 25);\n            const T1 = (H + sigma1 + (0,_md_js__WEBPACK_IMPORTED_MODULE_0__/* .Chi */ .bc)(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(A, 2) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(A, 13) ^ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .rotr */ .np)(A, 22);\n            const T2 = (sigma0 + (0,_md_js__WEBPACK_IMPORTED_MODULE_0__/* .Maj */ .l3)(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends (/* unused pure expression or super */ null && (SHA256)) {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nconst sha256 = /* @__PURE__ */ (0,_utils_js__WEBPACK_IMPORTED_MODULE_1__/* .wrapConstructor */ .hE)(() => new SHA256());\nconst sha224 = /* @__PURE__ */ (/* unused pure expression or super */ null && (wrapConstructor(() => new SHA224())));\n//# sourceMappingURL=sha256.js.map\n\n/***/ }),\n\n/***/ 6409:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n  \"kb\": function() { return /* binding */ Hash; },\n  \"l1\": function() { return /* binding */ byteSwap32; },\n  \"eV\": function() { return /* binding */ concatBytes; },\n  \"GL\": function() { return /* binding */ createView; },\n  \"iA\": function() { return /* binding */ isLE; },\n  \"O6\": function() { return /* binding */ randomBytes; },\n  \"np\": function() { return /* binding */ rotr; },\n  \"O0\": function() { return /* binding */ toBytes; },\n  \"Jq\": function() { return /* binding */ u32; },\n  \"hE\": function() { return /* binding */ wrapConstructor; }\n});\n\n// UNUSED EXPORTS: asyncLoop, byteSwap, byteSwapIfBE, bytesToHex, checkOpts, hexToBytes, isBytes, nextTick, rotl, u8, utf8ToBytes, wrapConstructorWithOpts, wrapXOFConstructorWithOpts\n\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/crypto.js\nconst crypto_crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map\n// EXTERNAL MODULE: ./node_modules/@noble/hashes/esm/_assert.js\nvar _assert = __webpack_require__(3527);\n;// CONCATENATED MODULE: ./node_modules/@noble/hashes/esm/utils.js\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\n\n\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nconst u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nconst u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nconst rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nconst isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nconst byteSwap = (word) => ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nconst byteSwapIfBE = (/* unused pure expression or super */ null && (isLE ? (n) => n : (n) => byteSwap(n)));\n// In place byte swap for Uint32Array\nfunction byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nfunction bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nfunction hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nconst nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nasync function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nfunction utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nfunction toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    (0,_assert/* bytes */.aI)(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nfunction concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        (0,_assert/* bytes */.aI)(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// For runtime check if class implements interface\nclass Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nfunction checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nfunction wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nfunction wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nfunction wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nfunction randomBytes(bytesLength = 32) {\n    if (crypto_crypto && typeof crypto_crypto.getRandomValues === 'function') {\n        return crypto_crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map\n\n/***/ }),\n\n/***/ 3495:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"g\": function() { return /* binding */ WalletModalContext; },\n/* harmony export */   \"h\": function() { return /* binding */ useWalletModal; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n\nconst DEFAULT_CONTEXT = {\n    setVisible(_open) {\n        console.error(constructMissingProviderErrorMessage('call', 'setVisible'));\n    },\n    visible: false,\n};\nObject.defineProperty(DEFAULT_CONTEXT, 'visible', {\n    get() {\n        console.error(constructMissingProviderErrorMessage('read', 'visible'));\n        return false;\n    },\n});\nfunction constructMissingProviderErrorMessage(action, valueName) {\n    return ('You have tried to ' +\n        ` ${action} \"${valueName}\"` +\n        ' on a WalletModalContext without providing one.' +\n        ' Make sure to render a WalletModalProvider' +\n        ' as an ancestor of the component that uses ' +\n        'WalletModalContext');\n}\nconst WalletModalContext = (0,react__WEBPACK_IMPORTED_MODULE_0__.createContext)(DEFAULT_CONTEXT);\nfunction useWalletModal() {\n    return (0,react__WEBPACK_IMPORTED_MODULE_0__.useContext)(WalletModalContext);\n}\n//# sourceMappingURL=useWalletModal.js.map\n\n/***/ }),\n\n/***/ 4306:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"O\": function() { return /* binding */ useWallet; },\n/* harmony export */   \"z\": function() { return /* binding */ WalletContext; }\n/* harmony export */ });\n/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7294);\n\nconst EMPTY_ARRAY = [];\nconst DEFAULT_CONTEXT = {\n    autoConnect: false,\n    connecting: false,\n    connected: false,\n    disconnecting: false,\n    select() {\n        logMissingProviderError('call', 'select');\n    },\n    connect() {\n        return Promise.reject(logMissingProviderError('call', 'connect'));\n    },\n    disconnect() {\n        return Promise.reject(logMissingProviderError('call', 'disconnect'));\n    },\n    sendTransaction() {\n        return Promise.reject(logMissingProviderError('call', 'sendTransaction'));\n    },\n    signTransaction() {\n        return Promise.reject(logMissingProviderError('call', 'signTransaction'));\n    },\n    signAllTransactions() {\n        return Promise.reject(logMissingProviderError('call', 'signAllTransactions'));\n    },\n    signMessage() {\n        return Promise.reject(logMissingProviderError('call', 'signMessage'));\n    },\n    signIn() {\n        return Promise.reject(logMissingProviderError('call', 'signIn'));\n    },\n};\nObject.defineProperty(DEFAULT_CONTEXT, 'wallets', {\n    get() {\n        logMissingProviderError('read', 'wallets');\n        return EMPTY_ARRAY;\n    },\n});\nObject.defineProperty(DEFAULT_CONTEXT, 'wallet', {\n    get() {\n        logMissingProviderError('read', 'wallet');\n        return null;\n    },\n});\nObject.defineProperty(DEFAULT_CONTEXT, 'publicKey', {\n    get() {\n        logMissingProviderError('read', 'publicKey');\n        return null;\n    },\n});\nfunction logMissingProviderError(action, property) {\n    const error = new Error(`You have tried to ${action} \"${property}\" on a WalletContext without providing one. ` +\n        'Make sure to render a WalletProvider as an ancestor of the component that uses WalletContext.');\n    console.error(error);\n    return error;\n}\nconst WalletContext = (0,react__WEBPACK_IMPORTED_MODULE_0__.createContext)(DEFAULT_CONTEXT);\nfunction useWallet() {\n    return (0,react__WEBPACK_IMPORTED_MODULE_0__.useContext)(WalletContext);\n}\n//# sourceMappingURL=useWallet.js.map\n\n/***/ }),\n\n/***/ 3149:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"G\": function() { return /* binding */ SolanaSignAndSendTransaction; }\n/* harmony export */ });\n/** Name of the feature. */\nconst SolanaSignAndSendTransaction = 'solana:signAndSendTransaction';\n//# sourceMappingURL=signAndSendTransaction.js.map\n\n/***/ }),\n\n/***/ 1999:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"g\": function() { return /* binding */ SolanaSignMessage; }\n/* harmony export */ });\n/** Name of the feature. */\nconst SolanaSignMessage = 'solana:signMessage';\n//# sourceMappingURL=signMessage.js.map\n\n/***/ }),\n\n/***/ 8112:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"R\": function() { return /* binding */ SolanaSignTransaction; }\n/* harmony export */ });\n/** Name of the feature. */\nconst SolanaSignTransaction = 'solana:signTransaction';\n//# sourceMappingURL=signTransaction.js.map\n\n/***/ }),\n\n/***/ 7885:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"rr\": function() { return /* binding */ inflate_1; }\n/* harmony export */ });\n/* unused harmony exports Deflate, Inflate, constants, default, deflate, deflateRaw, gzip, inflateRaw, ungzip */\n\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\n\n\n\n/***/ }),\n\n/***/ 1127:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"TextDecoder\": function() { return /* binding */ TextDecoder; },\n/* harmony export */   \"TextEncoder\": function() { return /* binding */ TextEncoder; }\n/* harmony export */ });\n\n\n// This is free and unencumbered software released into the public domain.\n// See LICENSE.md for more information.\n\n//\n// Utilities\n//\n\n/**\n * @param {number} a The number to test.\n * @param {number} min The minimum value in the range, inclusive.\n * @param {number} max The maximum value in the range, inclusive.\n * @return {boolean} True if a >= min and a <= max.\n */\nfunction inRange(a, min, max) {\n  return min <= a && a <= max;\n}\n\n/**\n * @param {*} o\n * @return {Object}\n */\nfunction ToDictionary(o) {\n  if (o === undefined) return {};\n  if (o === Object(o)) return o;\n  throw TypeError('Could not convert argument to dictionary');\n}\n\n/**\n * @param {string} string Input string of UTF-16 code units.\n * @return {!Array.<number>} Code points.\n */\nfunction stringToCodePoints(string) {\n  // https://heycam.github.io/webidl/#dfn-obtain-unicode\n\n  // 1. Let S be the DOMString value.\n  var s = String(string);\n\n  // 2. Let n be the length of S.\n  var n = s.length;\n\n  // 3. Initialize i to 0.\n  var i = 0;\n\n  // 4. Initialize U to be an empty sequence of Unicode characters.\n  var u = [];\n\n  // 5. While i < n:\n  while (i < n) {\n\n    // 1. Let c be the code unit in S at index i.\n    var c = s.charCodeAt(i);\n\n    // 2. Depending on the value of c:\n\n    // c < 0xD800 or c > 0xDFFF\n    if (c < 0xD800 || c > 0xDFFF) {\n      // Append to U the Unicode character with code point c.\n      u.push(c);\n    }\n\n    // 0xDC00 ≤ c ≤ 0xDFFF\n    else if (0xDC00 <= c && c <= 0xDFFF) {\n      // Append to U a U+FFFD REPLACEMENT CHARACTER.\n      u.push(0xFFFD);\n    }\n\n    // 0xD800 ≤ c ≤ 0xDBFF\n    else if (0xD800 <= c && c <= 0xDBFF) {\n      // 1. If i = n−1, then append to U a U+FFFD REPLACEMENT\n      // CHARACTER.\n      if (i === n - 1) {\n        u.push(0xFFFD);\n      }\n      // 2. Otherwise, i < n−1:\n      else {\n        // 1. Let d be the code unit in S at index i+1.\n        var d = string.charCodeAt(i + 1);\n\n        // 2. If 0xDC00 ≤ d ≤ 0xDFFF, then:\n        if (0xDC00 <= d && d <= 0xDFFF) {\n          // 1. Let a be c & 0x3FF.\n          var a = c & 0x3FF;\n\n          // 2. Let b be d & 0x3FF.\n          var b = d & 0x3FF;\n\n          // 3. Append to U the Unicode character with code point\n          // 2^16+2^10*a+b.\n          u.push(0x10000 + (a << 10) + b);\n\n          // 4. Set i to i+1.\n          i += 1;\n        }\n\n        // 3. Otherwise, d < 0xDC00 or d > 0xDFFF. Append to U a\n        // U+FFFD REPLACEMENT CHARACTER.\n        else  {\n          u.push(0xFFFD);\n        }\n      }\n    }\n\n    // 3. Set i to i+1.\n    i += 1;\n  }\n\n  // 6. Return U.\n  return u;\n}\n\n/**\n * @param {!Array.<number>} code_points Array of code points.\n * @return {string} string String of UTF-16 code units.\n */\nfunction codePointsToString(code_points) {\n  var s = '';\n  for (var i = 0; i < code_points.length; ++i) {\n    var cp = code_points[i];\n    if (cp <= 0xFFFF) {\n      s += String.fromCharCode(cp);\n    } else {\n      cp -= 0x10000;\n      s += String.fromCharCode((cp >> 10) + 0xD800,\n                               (cp & 0x3FF) + 0xDC00);\n    }\n  }\n  return s;\n}\n\n\n//\n// Implementation of Encoding specification\n// https://encoding.spec.whatwg.org/\n//\n\n//\n// 3. Terminology\n//\n\n/**\n * End-of-stream is a special token that signifies no more tokens\n * are in the stream.\n * @const\n */ var end_of_stream = -1;\n\n/**\n * A stream represents an ordered sequence of tokens.\n *\n * @constructor\n * @param {!(Array.<number>|Uint8Array)} tokens Array of tokens that provide the\n * stream.\n */\nfunction Stream(tokens) {\n  /** @type {!Array.<number>} */\n  this.tokens = [].slice.call(tokens);\n}\n\nStream.prototype = {\n  /**\n   * @return {boolean} True if end-of-stream has been hit.\n   */\n  endOfStream: function() {\n    return !this.tokens.length;\n  },\n\n  /**\n   * When a token is read from a stream, the first token in the\n   * stream must be returned and subsequently removed, and\n   * end-of-stream must be returned otherwise.\n   *\n   * @return {number} Get the next token from the stream, or\n   * end_of_stream.\n   */\n   read: function() {\n    if (!this.tokens.length)\n      return end_of_stream;\n     return this.tokens.shift();\n   },\n\n  /**\n   * When one or more tokens are prepended to a stream, those tokens\n   * must be inserted, in given order, before the first token in the\n   * stream.\n   *\n   * @param {(number|!Array.<number>)} token The token(s) to prepend to the stream.\n   */\n  prepend: function(token) {\n    if (Array.isArray(token)) {\n      var tokens = /**@type {!Array.<number>}*/(token);\n      while (tokens.length)\n        this.tokens.unshift(tokens.pop());\n    } else {\n      this.tokens.unshift(token);\n    }\n  },\n\n  /**\n   * When one or more tokens are pushed to a stream, those tokens\n   * must be inserted, in given order, after the last token in the\n   * stream.\n   *\n   * @param {(number|!Array.<number>)} token The tokens(s) to prepend to the stream.\n   */\n  push: function(token) {\n    if (Array.isArray(token)) {\n      var tokens = /**@type {!Array.<number>}*/(token);\n      while (tokens.length)\n        this.tokens.push(tokens.shift());\n    } else {\n      this.tokens.push(token);\n    }\n  }\n};\n\n//\n// 4. Encodings\n//\n\n// 4.1 Encoders and decoders\n\n/** @const */\nvar finished = -1;\n\n/**\n * @param {boolean} fatal If true, decoding errors raise an exception.\n * @param {number=} opt_code_point Override the standard fallback code point.\n * @return {number} The code point to insert on a decoding error.\n */\nfunction decoderError(fatal, opt_code_point) {\n  if (fatal)\n    throw TypeError('Decoder error');\n  return opt_code_point || 0xFFFD;\n}\n\n/** @interface */\nfunction Decoder() {}\nDecoder.prototype = {\n  /**\n   * @param {Stream} stream The stream of bytes being decoded.\n   * @param {number} bite The next byte read from the stream.\n   * @return {?(number|!Array.<number>)} The next code point(s)\n   *     decoded, or null if not enough data exists in the input\n   *     stream to decode a complete code point, or |finished|.\n   */\n  handler: function(stream, bite) {}\n};\n\n/** @interface */\nfunction Encoder() {}\nEncoder.prototype = {\n  /**\n   * @param {Stream} stream The stream of code points being encoded.\n   * @param {number} code_point Next code point read from the stream.\n   * @return {(number|!Array.<number>)} Byte(s) to emit, or |finished|.\n   */\n  handler: function(stream, code_point) {}\n};\n\n//\n// 7. API\n//\n\n/** @const */ var DEFAULT_ENCODING = 'utf-8';\n\n// 7.1 Interface TextDecoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n *     defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextDecoder(encoding, options) {\n  if (!(this instanceof TextDecoder)) {\n    return new TextDecoder(encoding, options);\n  }\n  encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n  if (encoding !== DEFAULT_ENCODING) {\n    throw new Error('Encoding not supported. Only utf-8 is supported');\n  }\n  options = ToDictionary(options);\n\n  /** @private @type {boolean} */\n  this._streaming = false;\n  /** @private @type {boolean} */\n  this._BOMseen = false;\n  /** @private @type {?Decoder} */\n  this._decoder = null;\n  /** @private @type {boolean} */\n  this._fatal = Boolean(options['fatal']);\n  /** @private @type {boolean} */\n  this._ignoreBOM = Boolean(options['ignoreBOM']);\n\n  Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n  Object.defineProperty(this, 'fatal', {value: this._fatal});\n  Object.defineProperty(this, 'ignoreBOM', {value: this._ignoreBOM});\n}\n\nTextDecoder.prototype = {\n  /**\n   * @param {ArrayBufferView=} input The buffer of bytes to decode.\n   * @param {Object=} options\n   * @return {string} The decoded string.\n   */\n  decode: function decode(input, options) {\n    var bytes;\n    if (typeof input === 'object' && input instanceof ArrayBuffer) {\n      bytes = new Uint8Array(input);\n    } else if (typeof input === 'object' && 'buffer' in input &&\n               input.buffer instanceof ArrayBuffer) {\n      bytes = new Uint8Array(input.buffer,\n                             input.byteOffset,\n                             input.byteLength);\n    } else {\n      bytes = new Uint8Array(0);\n    }\n\n    options = ToDictionary(options);\n\n    if (!this._streaming) {\n      this._decoder = new UTF8Decoder({fatal: this._fatal});\n      this._BOMseen = false;\n    }\n    this._streaming = Boolean(options['stream']);\n\n    var input_stream = new Stream(bytes);\n\n    var code_points = [];\n\n    /** @type {?(number|!Array.<number>)} */\n    var result;\n\n    while (!input_stream.endOfStream()) {\n      result = this._decoder.handler(input_stream, input_stream.read());\n      if (result === finished)\n        break;\n      if (result === null)\n        continue;\n      if (Array.isArray(result))\n        code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n      else\n        code_points.push(result);\n    }\n    if (!this._streaming) {\n      do {\n        result = this._decoder.handler(input_stream, input_stream.read());\n        if (result === finished)\n          break;\n        if (result === null)\n          continue;\n        if (Array.isArray(result))\n          code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n        else\n          code_points.push(result);\n      } while (!input_stream.endOfStream());\n      this._decoder = null;\n    }\n\n    if (code_points.length) {\n      // If encoding is one of utf-8, utf-16be, and utf-16le, and\n      // ignore BOM flag and BOM seen flag are unset, run these\n      // subsubsteps:\n      if (['utf-8'].indexOf(this.encoding) !== -1 &&\n          !this._ignoreBOM && !this._BOMseen) {\n        // If token is U+FEFF, set BOM seen flag.\n        if (code_points[0] === 0xFEFF) {\n          this._BOMseen = true;\n          code_points.shift();\n        } else {\n          // Otherwise, if token is not end-of-stream, set BOM seen\n          // flag and append token to output.\n          this._BOMseen = true;\n        }\n      }\n    }\n\n    return codePointsToString(code_points);\n  }\n};\n\n// 7.2 Interface TextEncoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n *     defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextEncoder(encoding, options) {\n  if (!(this instanceof TextEncoder))\n    return new TextEncoder(encoding, options);\n  encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n  if (encoding !== DEFAULT_ENCODING) {\n    throw new Error('Encoding not supported. Only utf-8 is supported');\n  }\n  options = ToDictionary(options);\n\n  /** @private @type {boolean} */\n  this._streaming = false;\n  /** @private @type {?Encoder} */\n  this._encoder = null;\n  /** @private @type {{fatal: boolean}} */\n  this._options = {fatal: Boolean(options['fatal'])};\n\n  Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n}\n\nTextEncoder.prototype = {\n  /**\n   * @param {string=} opt_string The string to encode.\n   * @param {Object=} options\n   * @return {Uint8Array} Encoded bytes, as a Uint8Array.\n   */\n  encode: function encode(opt_string, options) {\n    opt_string = opt_string ? String(opt_string) : '';\n    options = ToDictionary(options);\n\n    // NOTE: This option is nonstandard. None of the encodings\n    // permitted for encoding (i.e. UTF-8, UTF-16) are stateful,\n    // so streaming is not necessary.\n    if (!this._streaming)\n      this._encoder = new UTF8Encoder(this._options);\n    this._streaming = Boolean(options['stream']);\n\n    var bytes = [];\n    var input_stream = new Stream(stringToCodePoints(opt_string));\n    /** @type {?(number|!Array.<number>)} */\n    var result;\n    while (!input_stream.endOfStream()) {\n      result = this._encoder.handler(input_stream, input_stream.read());\n      if (result === finished)\n        break;\n      if (Array.isArray(result))\n        bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n      else\n        bytes.push(result);\n    }\n    if (!this._streaming) {\n      while (true) {\n        result = this._encoder.handler(input_stream, input_stream.read());\n        if (result === finished)\n          break;\n        if (Array.isArray(result))\n          bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n        else\n          bytes.push(result);\n      }\n      this._encoder = null;\n    }\n    return new Uint8Array(bytes);\n  }\n};\n\n//\n// 8. The encoding\n//\n\n// 8.1 utf-8\n\n/**\n * @constructor\n * @implements {Decoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Decoder(options) {\n  var fatal = options.fatal;\n\n  // utf-8's decoder's has an associated utf-8 code point, utf-8\n  // bytes seen, and utf-8 bytes needed (all initially 0), a utf-8\n  // lower boundary (initially 0x80), and a utf-8 upper boundary\n  // (initially 0xBF).\n  var /** @type {number} */ utf8_code_point = 0,\n      /** @type {number} */ utf8_bytes_seen = 0,\n      /** @type {number} */ utf8_bytes_needed = 0,\n      /** @type {number} */ utf8_lower_boundary = 0x80,\n      /** @type {number} */ utf8_upper_boundary = 0xBF;\n\n  /**\n   * @param {Stream} stream The stream of bytes being decoded.\n   * @param {number} bite The next byte read from the stream.\n   * @return {?(number|!Array.<number>)} The next code point(s)\n   *     decoded, or null if not enough data exists in the input\n   *     stream to decode a complete code point.\n   */\n  this.handler = function(stream, bite) {\n    // 1. If byte is end-of-stream and utf-8 bytes needed is not 0,\n    // set utf-8 bytes needed to 0 and return error.\n    if (bite === end_of_stream && utf8_bytes_needed !== 0) {\n      utf8_bytes_needed = 0;\n      return decoderError(fatal);\n    }\n\n    // 2. If byte is end-of-stream, return finished.\n    if (bite === end_of_stream)\n      return finished;\n\n    // 3. If utf-8 bytes needed is 0, based on byte:\n    if (utf8_bytes_needed === 0) {\n\n      // 0x00 to 0x7F\n      if (inRange(bite, 0x00, 0x7F)) {\n        // Return a code point whose value is byte.\n        return bite;\n      }\n\n      // 0xC2 to 0xDF\n      if (inRange(bite, 0xC2, 0xDF)) {\n        // Set utf-8 bytes needed to 1 and utf-8 code point to byte\n        // − 0xC0.\n        utf8_bytes_needed = 1;\n        utf8_code_point = bite - 0xC0;\n      }\n\n      // 0xE0 to 0xEF\n      else if (inRange(bite, 0xE0, 0xEF)) {\n        // 1. If byte is 0xE0, set utf-8 lower boundary to 0xA0.\n        if (bite === 0xE0)\n          utf8_lower_boundary = 0xA0;\n        // 2. If byte is 0xED, set utf-8 upper boundary to 0x9F.\n        if (bite === 0xED)\n          utf8_upper_boundary = 0x9F;\n        // 3. Set utf-8 bytes needed to 2 and utf-8 code point to\n        // byte − 0xE0.\n        utf8_bytes_needed = 2;\n        utf8_code_point = bite - 0xE0;\n      }\n\n      // 0xF0 to 0xF4\n      else if (inRange(bite, 0xF0, 0xF4)) {\n        // 1. If byte is 0xF0, set utf-8 lower boundary to 0x90.\n        if (bite === 0xF0)\n          utf8_lower_boundary = 0x90;\n        // 2. If byte is 0xF4, set utf-8 upper boundary to 0x8F.\n        if (bite === 0xF4)\n          utf8_upper_boundary = 0x8F;\n        // 3. Set utf-8 bytes needed to 3 and utf-8 code point to\n        // byte − 0xF0.\n        utf8_bytes_needed = 3;\n        utf8_code_point = bite - 0xF0;\n      }\n\n      // Otherwise\n      else {\n        // Return error.\n        return decoderError(fatal);\n      }\n\n      // Then (byte is in the range 0xC2 to 0xF4) set utf-8 code\n      // point to utf-8 code point << (6 × utf-8 bytes needed) and\n      // return continue.\n      utf8_code_point = utf8_code_point << (6 * utf8_bytes_needed);\n      return null;\n    }\n\n    // 4. If byte is not in the range utf-8 lower boundary to utf-8\n    // upper boundary, run these substeps:\n    if (!inRange(bite, utf8_lower_boundary, utf8_upper_boundary)) {\n\n      // 1. Set utf-8 code point, utf-8 bytes needed, and utf-8\n      // bytes seen to 0, set utf-8 lower boundary to 0x80, and set\n      // utf-8 upper boundary to 0xBF.\n      utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n      utf8_lower_boundary = 0x80;\n      utf8_upper_boundary = 0xBF;\n\n      // 2. Prepend byte to stream.\n      stream.prepend(bite);\n\n      // 3. Return error.\n      return decoderError(fatal);\n    }\n\n    // 5. Set utf-8 lower boundary to 0x80 and utf-8 upper boundary\n    // to 0xBF.\n    utf8_lower_boundary = 0x80;\n    utf8_upper_boundary = 0xBF;\n\n    // 6. Increase utf-8 bytes seen by one and set utf-8 code point\n    // to utf-8 code point + (byte − 0x80) << (6 × (utf-8 bytes\n    // needed − utf-8 bytes seen)).\n    utf8_bytes_seen += 1;\n    utf8_code_point += (bite - 0x80) << (6 * (utf8_bytes_needed - utf8_bytes_seen));\n\n    // 7. If utf-8 bytes seen is not equal to utf-8 bytes needed,\n    // continue.\n    if (utf8_bytes_seen !== utf8_bytes_needed)\n      return null;\n\n    // 8. Let code point be utf-8 code point.\n    var code_point = utf8_code_point;\n\n    // 9. Set utf-8 code point, utf-8 bytes needed, and utf-8 bytes\n    // seen to 0.\n    utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n\n    // 10. Return a code point whose value is code point.\n    return code_point;\n  };\n}\n\n/**\n * @constructor\n * @implements {Encoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Encoder(options) {\n  var fatal = options.fatal;\n  /**\n   * @param {Stream} stream Input stream.\n   * @param {number} code_point Next code point read from the stream.\n   * @return {(number|!Array.<number>)} Byte(s) to emit.\n   */\n  this.handler = function(stream, code_point) {\n    // 1. If code point is end-of-stream, return finished.\n    if (code_point === end_of_stream)\n      return finished;\n\n    // 2. If code point is in the range U+0000 to U+007F, return a\n    // byte whose value is code point.\n    if (inRange(code_point, 0x0000, 0x007f))\n      return code_point;\n\n    // 3. Set count and offset based on the range code point is in:\n    var count, offset;\n    // U+0080 to U+07FF:    1 and 0xC0\n    if (inRange(code_point, 0x0080, 0x07FF)) {\n      count = 1;\n      offset = 0xC0;\n    }\n    // U+0800 to U+FFFF:    2 and 0xE0\n    else if (inRange(code_point, 0x0800, 0xFFFF)) {\n      count = 2;\n      offset = 0xE0;\n    }\n    // U+10000 to U+10FFFF: 3 and 0xF0\n    else if (inRange(code_point, 0x10000, 0x10FFFF)) {\n      count = 3;\n      offset = 0xF0;\n    }\n\n    // 4.Let bytes be a byte sequence whose first byte is (code\n    // point >> (6 × count)) + offset.\n    var bytes = [(code_point >> (6 * count)) + offset];\n\n    // 5. Run these substeps while count is greater than 0:\n    while (count > 0) {\n\n      // 1. Set temp to code point >> (6 × (count − 1)).\n      var temp = code_point >> (6 * (count - 1));\n\n      // 2. Append to bytes 0x80 | (temp & 0x3F).\n      bytes.push(0x80 | (temp & 0x3F));\n\n      // 3. Decrease count by one.\n      count -= 1;\n    }\n\n    // 6. Return bytes bytes, in order.\n    return bytes;\n  };\n}\n\n\n\n\n/***/ }),\n\n/***/ 7582:\n/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"__addDisposableResource\": function() { return /* binding */ __addDisposableResource; },\n/* harmony export */   \"__assign\": function() { return /* binding */ __assign; },\n/* harmony export */   \"__asyncDelegator\": function() { return /* binding */ __asyncDelegator; },\n/* harmony export */   \"__asyncGenerator\": function() { return /* binding */ __asyncGenerator; },\n/* harmony export */   \"__asyncValues\": function() { return /* binding */ __asyncValues; },\n/* harmony export */   \"__await\": function() { return /* binding */ __await; },\n/* harmony export */   \"__awaiter\": function() { return /* binding */ __awaiter; },\n/* harmony export */   \"__classPrivateFieldGet\": function() { return /* binding */ __classPrivateFieldGet; },\n/* harmony export */   \"__classPrivateFieldIn\": function() { return /* binding */ __classPrivateFieldIn; },\n/* harmony export */   \"__classPrivateFieldSet\": function() { return /* binding */ __classPrivateFieldSet; },\n/* harmony export */   \"__createBinding\": function() { return /* binding */ __createBinding; },\n/* harmony export */   \"__decorate\": function() { return /* binding */ __decorate; },\n/* harmony export */   \"__disposeResources\": function() { return /* binding */ __disposeResources; },\n/* harmony export */   \"__esDecorate\": function() { return /* binding */ __esDecorate; },\n/* harmony export */   \"__exportStar\": function() { return /* binding */ __exportStar; },\n/* harmony export */   \"__extends\": function() { return /* binding */ __extends; },\n/* harmony export */   \"__generator\": function() { return /* binding */ __generator; },\n/* harmony export */   \"__importDefault\": function() { return /* binding */ __importDefault; },\n/* harmony export */   \"__importStar\": function() { return /* binding */ __importStar; },\n/* harmony export */   \"__makeTemplateObject\": function() { return /* binding */ __makeTemplateObject; },\n/* harmony export */   \"__metadata\": function() { return /* binding */ __metadata; },\n/* harmony export */   \"__param\": function() { return /* binding */ __param; },\n/* harmony export */   \"__propKey\": function() { return /* binding */ __propKey; },\n/* harmony export */   \"__read\": function() { return /* binding */ __read; },\n/* harmony export */   \"__rest\": function() { return /* binding */ __rest; },\n/* harmony export */   \"__runInitializers\": function() { return /* binding */ __runInitializers; },\n/* harmony export */   \"__setFunctionName\": function() { return /* binding */ __setFunctionName; },\n/* harmony export */   \"__spread\": function() { return /* binding */ __spread; },\n/* harmony export */   \"__spreadArray\": function() { return /* binding */ __spreadArray; },\n/* harmony export */   \"__spreadArrays\": function() { return /* binding */ __spreadArrays; },\n/* harmony export */   \"__values\": function() { return /* binding */ __values; }\n/* harmony export */ });\n/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nfunction __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nvar __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nfunction __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nfunction __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nfunction __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nfunction __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nfunction __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nfunction __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nfunction __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nfunction __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nfunction __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nfunction __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nvar __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nfunction __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nfunction __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nfunction __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nfunction __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nfunction __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nfunction __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nfunction __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nfunction __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nfunction __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nfunction __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nfunction __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nfunction __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nfunction __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nfunction __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nfunction __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nfunction __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nfunction __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nfunction __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\n/* harmony default export */ __webpack_exports__[\"default\"] = ({\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n});\n\n\n/***/ }),\n\n/***/ 8616:\n/***/ (function(module) {\n\n\"use strict\";\nmodule.exports = JSON.parse('{\"version\":\"0.0.1\",\"name\":\"merkle_distributor\",\"instructions\":[{\"name\":\"newDistributor\",\"docs\":[\"READ THE FOLLOWING:\",\"\",\"This instruction is susceptible to frontrunning that could result in loss of funds if not handled properly.\",\"\",\"An attack could look like:\",\"- A legitimate user opens a new distributor.\",\"- Someone observes the call to this instruction.\",\"- They replace the clawback_receiver, admin, or time parameters with their own.\",\"\",\"One situation that could happen here is the attacker replaces the admin and clawback_receiver with their own.\",\"Then the attacker can steal all funds from the distributor to their own clawback_receiver account.\",\"\",\"HOW TO AVOID:\",\"- When you call into this instruction, ensure your transaction succeeds.\",\"- To be extra safe, after your transaction succeeds, read back the state of the created MerkleDistributor account and\",\"assert the parameters are what you expect, most importantly the clawback_receiver and admin.\",\"- If your transaction fails, double check the value on-chain matches what you expect.\"],\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"[MerkleDistributor].\"],\"pda\":{\"seeds\":[{\"kind\":\"const\",\"type\":\"string\",\"value\":\"MerkleDistributor\"},{\"kind\":\"account\",\"type\":\"publicKey\",\"account\":\"Mint\",\"path\":\"mint\"},{\"kind\":\"arg\",\"type\":\"u64\",\"path\":\"version\"}]}},{\"name\":\"clawbackReceiver\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"Clawback receiver token account\"]},{\"name\":\"mint\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The mint to distribute.\"]},{\"name\":\"tokenVault\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"Token vault\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin wallet, responsible for creating the distributor and paying for the transaction.\",\"Also has the authority to set the clawback receiver and change itself.\"]},{\"name\":\"systemProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The [System] program.\"]},{\"name\":\"associatedTokenProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The [Associated Token] program.\"]},{\"name\":\"tokenProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The [Token] program.\"]}],\"args\":[{\"name\":\"version\",\"type\":\"u64\"},{\"name\":\"root\",\"type\":{\"array\":[\"u8\",32]}},{\"name\":\"maxTotalClaim\",\"type\":\"u64\"},{\"name\":\"maxNumNodes\",\"type\":\"u64\"},{\"name\":\"startTs\",\"type\":\"i64\"},{\"name\":\"endTs\",\"type\":\"i64\"}]},{\"name\":\"newClaim\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"claimStatus\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"Claim status PDA\"],\"pda\":{\"seeds\":[{\"kind\":\"const\",\"type\":\"string\",\"value\":\"ClaimStatus\"},{\"kind\":\"account\",\"type\":\"publicKey\",\"path\":\"claimant\"},{\"kind\":\"account\",\"type\":\"publicKey\",\"account\":\"MerkleDistributor\",\"path\":\"distributor\"}]}},{\"name\":\"from\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"Distributor ATA containing the tokens to distribute.\"]},{\"name\":\"to\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"Account to send the claimed tokens to.\"]},{\"name\":\"claimant\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Who is claiming the tokens.\"]},{\"name\":\"tokenProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"SPL [Token] program.\"]},{\"name\":\"systemProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The [System] program.\"]}],\"args\":[{\"name\":\"index\",\"type\":\"u64\"},{\"name\":\"amount\",\"type\":\"u64\"},{\"name\":\"proof\",\"type\":{\"vec\":{\"array\":[\"u8\",32]}}}]},{\"name\":\"clawback\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"from\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"Distributor ATA containing the tokens to distribute.\"]},{\"name\":\"to\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The Clawback token account.\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin account\"]},{\"name\":\"systemProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"The [System] program.\"]},{\"name\":\"tokenProgram\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"SPL [Token] program.\"]}],\"args\":[{\"name\":\"amount\",\"type\":\"u64\"}]},{\"name\":\"setClawbackReceiver\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"newClawbackAccount\",\"isMut\":false,\"isSigner\":false,\"docs\":[\"New clawback account\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin signer\"]}],\"args\":[]},{\"name\":\"setAdmin\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin signer\"]},{\"name\":\"newAdmin\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"New admin account\"]}],\"args\":[]},{\"name\":\"setTimestamp\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin signer\"]}],\"args\":[{\"name\":\"startTs\",\"type\":\"i64\"},{\"name\":\"endTs\",\"type\":\"i64\"}]},{\"name\":\"setMerkleRoot\",\"accounts\":[{\"name\":\"distributor\",\"isMut\":true,\"isSigner\":false,\"docs\":[\"The [MerkleDistributor].\"]},{\"name\":\"admin\",\"isMut\":true,\"isSigner\":true,\"docs\":[\"Admin signer\"]}],\"args\":[{\"name\":\"root\",\"type\":{\"array\":[\"u8\",32]}},{\"name\":\"maxTotalClaim\",\"type\":\"u64\"},{\"name\":\"maxNumNodes\",\"type\":\"u64\"}]}],\"accounts\":[{\"name\":\"ClaimStatus\",\"docs\":[\"Holds whether or not a claimant has claimed tokens.\"],\"type\":{\"kind\":\"struct\",\"fields\":[{\"name\":\"isClaimed\",\"docs\":[\"If true, the tokens have been claimed.\"],\"type\":\"bool\"},{\"name\":\"claimant\",\"docs\":[\"Authority that claimed the tokens.\"],\"type\":\"publicKey\"},{\"name\":\"claimedAt\",\"docs\":[\"When the tokens were claimed.\"],\"type\":\"i64\"},{\"name\":\"amount\",\"docs\":[\"Amount of tokens claimed.\"],\"type\":\"u64\"}]}},{\"name\":\"MerkleDistributor\",\"docs\":[\"State for the account which distributes tokens.\"],\"type\":{\"kind\":\"struct\",\"fields\":[{\"name\":\"bump\",\"docs\":[\"Bump seed.\"],\"type\":\"u8\"},{\"name\":\"version\",\"docs\":[\"Version of the airdrop\"],\"type\":\"u64\"},{\"name\":\"root\",\"docs\":[\"The 256-bit merkle root.\"],\"type\":{\"array\":[\"u8\",32]}},{\"name\":\"mint\",\"docs\":[\"[Mint] of the token to be distributed.\"],\"type\":\"publicKey\"},{\"name\":\"tokenVault\",\"docs\":[\"Token Address of the vault\"],\"type\":\"publicKey\"},{\"name\":\"maxTotalClaim\",\"docs\":[\"Maximum number of tokens that can ever be claimed from this [MerkleDistributor].\"],\"type\":\"u64\"},{\"name\":\"maxNumNodes\",\"docs\":[\"Maximum number of nodes in [MerkleDistributor].\"],\"type\":\"u64\"},{\"name\":\"totalAmountClaimed\",\"docs\":[\"Total amount of tokens that have been claimed.\"],\"type\":\"u64\"},{\"name\":\"numNodesClaimed\",\"docs\":[\"Number of nodes that have been claimed.\"],\"type\":\"u64\"},{\"name\":\"startTs\",\"docs\":[\"Claim time start (Unix Timestamp)\"],\"type\":\"i64\"},{\"name\":\"endTs\",\"docs\":[\"Claim time end (Unix Timestamp)\"],\"type\":\"i64\"},{\"name\":\"clawbackReceiver\",\"docs\":[\"Clawback receiver\"],\"type\":\"publicKey\"},{\"name\":\"admin\",\"docs\":[\"Admin wallet\"],\"type\":\"publicKey\"}]}}],\"events\":[{\"name\":\"NewClaimEvent\",\"fields\":[{\"name\":\"claimant\",\"type\":\"publicKey\",\"index\":false},{\"name\":\"timestamp\",\"type\":\"i64\",\"index\":false}]},{\"name\":\"ClaimedEvent\",\"fields\":[{\"name\":\"claimant\",\"type\":\"publicKey\",\"index\":false},{\"name\":\"amount\",\"type\":\"u64\",\"index\":false}]}],\"errors\":[{\"code\":6000,\"name\":\"InvalidProof\",\"msg\":\"Invalid Merkle proof\"},{\"code\":6001,\"name\":\"ExceededMaxClaim\",\"msg\":\"Exceeded maximum claim amount\"},{\"code\":6002,\"name\":\"MaxNodesExceeded\",\"msg\":\"Exceeded maximum node count\"},{\"code\":6003,\"name\":\"Unauthorized\",\"msg\":\"Account is not authorized to execute this instruction\"},{\"code\":6004,\"name\":\"OwnerMismatch\",\"msg\":\"Token account owner did not match intended owner\"},{\"code\":6005,\"name\":\"SameClawbackReceiver\",\"msg\":\"New and old Clawback receivers are identical\"},{\"code\":6006,\"name\":\"SameAdmin\",\"msg\":\"New and old admin are identical\"},{\"code\":6007,\"name\":\"ClaimExpired\",\"msg\":\"Claim window expired\"},{\"code\":6008,\"name\":\"ArithmeticError\",\"msg\":\"Arithmetic Error (overflow/underflow)\"},{\"code\":6009,\"name\":\"StartTimestampAfterEnd\",\"msg\":\"Start Timestamp cannot be after end Timestamp\"},{\"code\":6010,\"name\":\"TimestampsNotInFuture\",\"msg\":\"Timestamps cannot be in the past\"},{\"code\":6011,\"name\":\"DistributionAlreadyStarted\",\"msg\":\"Distribution already started\"},{\"code\":6012,\"name\":\"InsufficientClawbackAmount\",\"msg\":\"Insufficient clawback amount\"}]}');\n\n/***/ })\n\n},\n/******/ function(__webpack_require__) { // webpackRuntimeModules\n/******/ var __webpack_exec__ = function(moduleId) { return __webpack_require__(__webpack_require__.s = moduleId); }\n/******/ __webpack_require__.O(0, [774,179], function() { return __webpack_exec__(6840), __webpack_exec__(880); });\n/******/ var __webpack_exports__ = __webpack_require__.O();\n/******/ _N_E = __webpack_exports__;\n/******/ }\n]);"],"names":["self","push","__unused_webpack_module","__webpack_exports__","__webpack_require__","d","bn_js__WEBPACK_IMPORTED_MODULE_2___default","a","module","exports","global","__self__","ctx","_solana_web3_js__WEBPACK_IMPORTED_MODULE_1__","bn_js__WEBPACK_IMPORTED_MODULE_2__","n","bs58__WEBPACK_IMPORTED_MODULE_3__","bs58__WEBPACK_IMPORTED_MODULE_3___default","_coral_xyz_borsh__WEBPACK_IMPORTED_MODULE_5__","Buffer","chunks","array","size","Array","apply","Math","ceil","length","map","_","index","slice","isVersionedTransaction","tx","encode$1","data","encode","struct","publicKey","vecU8","StructError","TypeError","constructor","failure","failures","cached","message","rest","path","msg","join","value","key","type","refinement","branch","Object","assign","name","_cached","isIterable","x","isObject","Symbol","iterator","print","JSON","stringify","shiftIterator","input","done","next","undefined","toFailure","result","context","toFailures","r","run","options","coerce","mask","coercer","schema","isArray","valid","validator","k","v","s","entries","ts","t","Map","set","Set","add","refiner","Struct","props","TYPE","assert","create","is","validate","tuples","tuple","error","define","any","Element","i","boolean","literal","constant","description","nullable","number","isNaN","optional","string","keys","union$1","Structs","firstMatch","find","e","unknown","S","first","condition","GET_MULTIPLE_ACCOUNTS_LIMIT","getMultipleAccountsAndContextCore","connection","publicKeys","commitmentOverride","commitment","accountInfos","getMultipleAccountsInfoAndContext","accounts","account","idx","simulateTransaction","transaction","signers","includeAccounts","_a","sign","_compile","signData","serialize","wireTransaction","_serialize","encodedTransaction","toString","config","encoding","addresses","nonProgramIds","toBase58","sigVerify","args","unsafeRes","_rpcRequest","res","SimulatedTransactionResponseStruct","logs","traceIndent","logTrace","console","SendTransactionError","jsonRpcResult","createRpcResult","UnknownRpcResult","jsonrpc","id","code","jsonRpcResultAndContext","slot","err","executable","owner","lamports","rentEpoch","unitsConsumed","AnchorProvider","wallet","opts","defaultOptions","preflightCommitment","local","url","env","sendAndConfirm","_b","_c","_d","feePayer","recentBlockhash","getLatestBlockhash","blockhash","signer","partialSign","signTransaction","rawTx","sendAndConfirmRawTransaction","ConfirmError","txSig","signatures","Uint8Array","signature","maxVer","failedTx","getTransaction","maxSupportedTransactionVersion","meta","logMessages","sendAll","txWithSigners","txs","forEach","kp","signedTxs","signAllTransactions","sigs","simulate","SimulateError","Error","simulationResponse","rawTransaction","sendOptions","skipPreflight","sendRawTransaction","status","confirmTransaction","_provider","commonjsGlobal","globalThis","window","g","getDefaultExportFromCjs","__esModule","prototype","hasOwnProperty","call","dist","defineProperty","ANCHOR_ERROR__REQUIRE_EQ_VIOLATED","ANCHOR_ERROR__REQUIRE_VIOLATED","ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_PROGRAM_ID","ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_TRANSFER_HOOK_EXTENSION","ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION_DELEGATE","ANCHOR_ERROR__CONSTRAINT_MINT_PERMANENT_DELEGATE_EXTENSION","ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_CLOSE_AUTHORITY_EXTENSION","ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_METADATA_ADDRESS","ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_METADATA_POINTER_EXTENSION","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_MEMBER_ADDRESS","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_MEMBER_POINTER_EXTENSION","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_GROUP_ADDRESS","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_GROUP_POINTER_EXTENSION","ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_TOKEN_TOKEN_PROGRAM","ANCHOR_ERROR__CONSTRAINT_MINT_TOKEN_PROGRAM","ANCHOR_ERROR__CONSTRAINT_TOKEN_TOKEN_PROGRAM","ANCHOR_ERROR__CONSTRAINT_ACCOUNT_IS_NONE","ANCHOR_ERROR__CONSTRAINT_SPACE","ANCHOR_ERROR__CONSTRAINT_MINT_DECIMALS","ANCHOR_ERROR__CONSTRAINT_MINT_FREEZE_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_MINT_MINT_AUTHORITY","ANCHOR_ERROR__CONSTRAINT_TOKEN_OWNER","ANCHOR_ERROR__CONSTRAINT_TOKEN_MINT","ANCHOR_ERROR__CONSTRAINT_ZERO","ANCHOR_ERROR__CONSTRAINT_ADDRESS","ANCHOR_ERROR__CONSTRAINT_CLOSE","ANCHOR_ERROR__CONSTRAINT_ASSOCIATED_INIT","ANCHOR_ERROR__CONSTRAINT_ASSOCIATED","ANCHOR_ERROR__CONSTRAINT_STATE","ANCHOR_ERROR__CONSTRAINT_EXECUTABLE","ANCHOR_ERROR__CONSTRAINT_SEEDS","ANCHOR_ERROR__CONSTRAINT_RENT_EXEMPT","ANCHOR_ERROR__CONSTRAINT_OWNER","ANCHOR_ERROR__CONSTRAINT_RAW","ANCHOR_ERROR__CONSTRAINT_SIGNER","ANCHOR_ERROR__CONSTRAINT_HAS_ONE","ANCHOR_ERROR__CONSTRAINT_MUT","ANCHOR_ERROR__EVENT_INSTRUCTION_STUB","ANCHOR_ERROR__IDL_ACCOUNT_NOT_EMPTY","ANCHOR_ERROR__IDL_INSTRUCTION_INVALID_PROGRAM","ANCHOR_ERROR__IDL_INSTRUCTION_STUB","ANCHOR_ERROR__INSTRUCTION_DID_NOT_SERIALIZE","ANCHOR_ERROR__INSTRUCTION_DID_NOT_DESERIALIZE","ANCHOR_ERROR__INSTRUCTION_FALLBACK_NOT_FOUND","ANCHOR_ERROR__INSTRUCTION_MISSING","ANCHOR_ERROR__DEPRECATED","ANCHOR_ERROR__INVALID_NUMERIC_CONVERSION","ANCHOR_ERROR__TRYING_TO_INIT_PAYER_AS_PROGRAM_ACCOUNT","ANCHOR_ERROR__DECLARED_PROGRAM_ID_MISMATCH","ANCHOR_ERROR__ACCOUNT_DUPLICATE_REALLOCS","ANCHOR_ERROR__ACCOUNT_REALLOC_EXCEEDS_LIMIT","ANCHOR_ERROR__ACCOUNT_SYSVAR_MISMATCH","ANCHOR_ERROR__ACCOUNT_NOT_ASSOCIATED_TOKEN_ACCOUNT","ANCHOR_ERROR__ACCOUNT_NOT_PROGRAM_DATA","ANCHOR_ERROR__ACCOUNT_NOT_INITIALIZED","ANCHOR_ERROR__ACCOUNT_NOT_SYSTEM_OWNED","ANCHOR_ERROR__ACCOUNT_NOT_SIGNER","ANCHOR_ERROR__INVALID_PROGRAM_EXECUTABLE","ANCHOR_ERROR__INVALID_PROGRAM_ID","ANCHOR_ERROR__ACCOUNT_OWNED_BY_WRONG_PROGRAM","ANCHOR_ERROR__ACCOUNT_NOT_MUTABLE","ANCHOR_ERROR__ACCOUNT_NOT_ENOUGH_KEYS","ANCHOR_ERROR__ACCOUNT_DID_NOT_SERIALIZE","ANCHOR_ERROR__ACCOUNT_DID_NOT_DESERIALIZE","ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_MISMATCH","ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_NOT_FOUND","ANCHOR_ERROR__ACCOUNT_DISCRIMINATOR_ALREADY_SET","ANCHOR_ERROR__REQUIRE_GTE_VIOLATED","ANCHOR_ERROR__REQUIRE_GT_VIOLATED","ANCHOR_ERROR__REQUIRE_KEYS_NEQ_VIOLATED","ANCHOR_ERROR__REQUIRE_NEQ_VIOLATED","ANCHOR_ERROR__REQUIRE_KEYS_EQ_VIOLATED","LangErrorCode","InstructionMissing","InstructionFallbackNotFound","InstructionDidNotDeserialize","InstructionDidNotSerialize","IdlInstructionStub","IdlInstructionInvalidProgram","IdlAccountNotEmpty","EventInstructionStub","ConstraintMut","ConstraintHasOne","ConstraintSigner","ConstraintRaw","ConstraintOwner","ConstraintRentExempt","ConstraintSeeds","ConstraintExecutable","ConstraintState","ConstraintAssociated","ConstraintAssociatedInit","ConstraintClose","ConstraintAddress","ConstraintZero","ConstraintTokenMint","ConstraintTokenOwner","ConstraintMintMintAuthority","ConstraintMintFreezeAuthority","ConstraintMintDecimals","ConstraintSpace","ConstraintAccountIsNone","ConstraintTokenTokenProgram","ConstraintMintTokenProgram","ConstraintAssociatedTokenTokenProgram","ConstraintMintGroupPointerExtension","ConstraintMintGroupPointerExtensionAuthority","ConstraintMintGroupPointerExtensionGroupAddress","ConstraintMintGroupMemberPointerExtension","ConstraintMintGroupMemberPointerExtensionAuthority","ConstraintMintGroupMemberPointerExtensionMemberAddress","ConstraintMintMetadataPointerExtension","ConstraintMintMetadataPointerExtensionAuthority","ConstraintMintMetadataPointerExtensionMetadataAddress","ConstraintMintCloseAuthorityExtension","ConstraintMintCloseAuthorityExtensionAuthority","ConstraintMintPermanentDelegateExtension","ConstraintMintPermanentDelegateExtensionDelegate","ConstraintMintTransferHookExtension","ConstraintMintTransferHookExtensionAuthority","ConstraintMintTransferHookExtensionProgramId","RequireViolated","RequireEqViolated","RequireKeysEqViolated","RequireNeqViolated","RequireKeysNeqViolated","RequireGtViolated","RequireGteViolated","AccountDiscriminatorAlreadySet","AccountDiscriminatorNotFound","AccountDiscriminatorMismatch","AccountDidNotDeserialize","AccountDidNotSerialize","AccountNotEnoughKeys","AccountNotMutable","AccountOwnedByWrongProgram","InvalidProgramId","InvalidProgramExecutable","AccountNotSigner","AccountNotSystemOwned","AccountNotInitialized","AccountNotProgramData","AccountNotAssociatedTokenAccount","AccountSysvarMismatch","AccountReallocExceedsLimit","AccountDuplicateReallocs","DeclaredProgramIdMismatch","TryingToInitPayerAsProgramAccount","InvalidNumericConversion","Deprecated","Layout","span","property","Number","isInteger","makeDestinationObject","decode","b","offset","src","getSpan","replicate","rv","fromArray","values","Layout_2","nameWithProperty","lo","ExternalLayout","isCount","OffsetLayout","layout","UInt","UIntBE","readUIntLE","writeUIntLE","readUIntBE","writeUIntBE","V2E32","divmodInt64","hi32","floor","lo32","roundedInt64","NearUInt64","readUInt32LE","split","writeUInt32LE","NearInt64","readInt32LE","writeInt32LE","Structure","fields","decodePrefixes","reduce","acc","fd","fsp","dest","firstOffset","lastOffset","lastWrote","fv","shift","layoutFor","offsetOf","UnionDiscriminator","UnionLayoutDiscriminator","Union","discr","defaultLayout","upv","discriminator","usesPrefixDiscriminator","registry","boundGetSourceVariant","defaultGetSourceVariant","bind","getSourceVariant","configGetSourceVariant","gsv","vlo","getVariant","tag","dlo","clo","contentOffset","addVariant","variant","VariantLayout","vb","isBuffer","union","Blob$1","write","u8","u32","nu64","ns64","blob","RustStringLayout","chars","from","toNumber","rustStringLayout","publicKey$2","LAYOUT","WrappedLayout$1","decoder","encoder","publicKey$1","PublicKey","toBuffer","browserPonyfill","F","fetch","DOMException","support","searchParams","iterable","Blob","formData","arrayBuffer","isDataView","obj","DataView","isPrototypeOf","viewClasses","isArrayBufferView","ArrayBuffer","isView","indexOf","normalizeName","String","test","toLowerCase","normalizeValue","iteratorFor","items","Headers","headers","append","header","getOwnPropertyNames","consumed","body","bodyUsed","Promise","reject","fileReaderReady","reader","resolve","onload","onerror","readBlobAsArrayBuffer","FileReader","promise","readAsArrayBuffer","readBlobAsText","readAsText","readArrayBufferAsText","buf","view","fromCharCode","bufferClone","byteLength","buffer","Body","_initBody","_bodyInit","_bodyText","_bodyBlob","FormData","_bodyFormData","URLSearchParams","_bodyArrayBuffer","get","rejected","then","text","json","parse","oldValue","has","callback","thisArg","methods","normalizeMethod","method","upcased","toUpperCase","Request","credentials","mode","signal","referrer","form","trim","bytes","replace","decodeURIComponent","parseHeaders","rawHeaders","preProcessedHeaders","line","parts","Response","bodyInit","ok","statusText","clone","response","redirectStatuses","redirect","location","stack","init","request","aborted","xhr","XMLHttpRequest","abortXhr","abort","getAllResponseHeaders","responseURL","responseText","ontimeout","onabort","open","withCredentials","responseType","setRequestHeader","addEventListener","onreadystatechange","readyState","removeEventListener","send","polyfill","ponyfill","default","UPGRADEABLE_LOADER_STATE_LAYOUT","rustEnum","option","u64","decodeUpgradeableLoaderState","uint64","WrappedLayout","fromBuffer","coption","COptionLayout","toArray","reverse","zeroPad","alloc","copy","U","p","buffer_1","web3_js_1","common_js_1","NodeWallet","payer","process","ANCHOR_WALLET","Keypair","fromSecretKey","readFileSync","Z","isBrowser","ANCHOR_BROWSER","__unused_webpack_exports","basex","ALPHABET","UPPERCASE","LOWERCASE","LEADING_CAPITAL","IDENTIFIER","SEPARATORS","LEADING_SEPARATORS","source","SEPARATORS_AND_IDENTIFIER","NUMBERS_AND_IDENTIFIER","preserveCamelCase","isLastCharLower","isLastCharUpper","isLastLastCharUpper","character","preserveConsecutiveUppercase","lastIndex","m1","postProcess","identifier","m","camelCase","pascalCase","filter","locale","toLocaleLowerCase","toLocaleUpperCase","hasUpperCase","charAt","__importDefault","mod","str","tagged","vec","bool","i256","u256","i128","u128","i64","f64","f32","i32","i16","u16","i8","buffer_layout_1","bn_js_1","buffer_layout_2","enumerable","s8","s16","s32","BNLayout","signed","num","fromTwos","toTwos","toArrayLike","OptionLayout","decodeBool","encodeBool","elementLayout","seq","wrappedLayout","decodeTag","receivedTag","eq","variants","discriminant","unionLayout","MapEntryLayout","keyLayout","valueLayout","keyBytes","valueBytes","sheetForTag","sheet","document","styleSheets","ownerNode","createStyleElement","createElement","setAttribute","nonce","appendChild","createTextNode","createCache","StyleSheet","_this","_insertTag","before","tags","insertionPoint","nextSibling","prepend","container","firstChild","insertBefore","isSpeedy","speedy","ctr","_proto","hydrate","nodes","insert","rule","insertRule","cssRules","flush","parentNode","removeChild","abs","Utility_from","Utility_assign","hash","Utility_charat","Utility_match","pattern","exec","Utility_replace","replacement","indexof","search","charCodeAt","Utility_substr","begin","end","Utility_strlen","Utility_sizeof","Utility_append","Utility_combine","column","Tokenizer_length","position","characters","node","root","parent","children","return","Tokenizer_copy","Tokenizer_char","prev","peek","caret","token","dealloc","delimit","delimiter","whitespace","escaping","count","commenter","Enum_MS","Enum_MOZ","Enum_WEBKIT","COMMENT","Enum_RULESET","Enum_DECLARATION","IMPORT","Enum_KEYFRAMES","LAYER","Serializer_serialize","output","element","middleware","collection","rulesheet","compile","rules","rulesets","pseudo","points","declarations","atrule","previous","variable","scanning","ampersand","reference","comment","declaration","ruleset","post","j","y","z","identifierWithPointTracking","toRules","parsed","getRules","fixedElements","WeakMap","compat","isImplicitRule","parentRules","removeLabel","emotion_cache_browser_esm_prefix","defaultStylisPlugins","_insert","currentSheet","ssrStyles","querySelectorAll","dataEmotionAttribute","getAttribute","head","stylisPlugins","inserted","nodesToHydrate","attrib","serializer","omnipresentPlugins","concat","stylis","styles","selector","serialized","shouldCache","cache","registered","memoize","fn","arg","CacheProvider","ThemeContext","withEmotionCache","react__WEBPACK_IMPORTED_MODULE_0__","_emotion_cache__WEBPACK_IMPORTED_MODULE_1__","EmotionCacheContext","createContext","HTMLElement","Provider","func","forwardRef","ref","useContext","keyframes","css","Global","_emotion_element_43c6fea0_browser_esm_js__WEBPACK_IMPORTED_MODULE_5__","_emotion_utils__WEBPACK_IMPORTED_MODULE_6__","_emotion_use_insertion_effect_with_fallbacks__WEBPACK_IMPORTED_MODULE_1__","_emotion_serialize__WEBPACK_IMPORTED_MODULE_2__","w","O","T","_ref","serializedNames","serializedStyles","dangerouslySetInnerHTML","__html","sheetRef","useRef","rehydrating","querySelector","current","sheetRefCurrent","My","nextElementSibling","_len","arguments","_key","insertable","anim","murmur2","h","len","serializeStyles","cursor","unitlessKeys","animationIterationCount","aspectRatio","borderImageOutset","borderImageSlice","borderImageWidth","boxFlex","boxFlexGroup","boxOrdinalGroup","columnCount","columns","flex","flexGrow","flexPositive","flexShrink","flexNegative","flexOrder","gridRow","gridRowEnd","gridRowSpan","gridRowStart","gridColumn","gridColumnEnd","gridColumnSpan","gridColumnStart","msGridRow","msGridRowSpan","msGridColumn","msGridColumnSpan","fontWeight","lineHeight","opacity","order","orphans","tabSize","widows","zIndex","zoom","WebkitLineClamp","fillOpacity","floodOpacity","stopOpacity","strokeDasharray","strokeDashoffset","strokeMiterlimit","strokeOpacity","strokeWidth","emotion_memoize_esm","hyphenateRegex","animationRegex","isCustomProperty","isProcessableValue","processStyleName","styleName","processStyleValue","match","p1","p2","handleInterpolation","mergedProps","interpolation","__emotion_styles","createStringFromObject","previousCursor","_i","interpolated","labelPattern","stringMode","strings","raw","identifierName","useInsertionEffectAlwaysWithSyncFallback","useInsertionEffectWithLayoutFallback","react__WEBPACK_IMPORTED_MODULE_0___namespace_cache","syncFallback","useInsertionEffect","useLayoutEffect","insertStyles","getRegisteredStyles","registerStyles","registeredStyles","classNames","rawClassName","className","isStringTag","useDefaultProps","_mui_system_DefaultPropsProvider__WEBPACK_IMPORTED_MODULE_2__","params","material_GlobalStyles_GlobalStyles","esm_extends","GlobalStyles","useTheme","jsx_runtime","esm_GlobalStyles_GlobalStyles","themeId","defaultTheme","upperTheme","globalStyles","jsx","styles_createTheme","objectWithoutPropertiesLoose","formatMuiErrorMessage","deepmerge","defaultSxConfig","styleFunctionSx","createTheme","createMixins","breakpoints","mixins","toolbar","minHeight","up","colorManipulator","common","black","white","colors_common","grey","A100","A200","A400","A700","colors_grey","purple","colors_purple","red","colors_red","orange","colors_orange","blue","colors_blue","lightBlue","colors_lightBlue","green","colors_green","_excluded","light","primary","secondary","disabled","divider","background","paper","action","active","hover","hoverOpacity","selected","selectedOpacity","disabledBackground","disabledOpacity","focus","focusOpacity","activatedOpacity","dark","icon","addLightOrDark","intent","direction","shade","tonalOffset","tonalOffsetLight","tonalOffsetDark","$n","main","_j","getDefaultPrimary","getDefaultSecondary","getDefaultError","getDefaultInfo","getDefaultSuccess","getDefaultWarning","createPalette","palette","contrastThreshold","other","info","success","warning","getContrastText","contrastText","mi","augmentColor","color","mainShade","lightShade","darkShade","modes","paletteOutput","createTypography_excluded","round","caseAllCaps","textTransform","defaultFontFamily","createTypography","typography","fontFamily","fontSize","fontWeightLight","fontWeightRegular","fontWeightMedium","fontWeightBold","htmlFontSize","allVariants","pxToRem","pxToRem2","coef","buildVariant","letterSpacing","casing","h1","h2","h3","h4","h5","h6","subtitle1","subtitle2","body1","body2","button","caption","overline","inherit","shadowKeyUmbraOpacity","shadowKeyPenumbraOpacity","shadowAmbientShadowOpacity","createShadow","px","shadows","styles_shadows","createTransitions_excluded","easing","easeInOut","easeOut","easeIn","sharp","duration","shortest","shorter","short","standard","complex","enteringScreen","leavingScreen","formatMs","milliseconds","getAutoHeightDuration","height","createTransitions","inputTransitions","mergedEasing","mergedDuration","durationOption","easingOption","delay","animatedProp","mobileStepper","fab","speedDial","appBar","drawer","modal","snackbar","tooltip","styles_zIndex","createTheme_excluded","mixinsInput","paletteInput","transitions","transitionsInput","typographyInput","vars","systemTheme","muiTheme","argument","unstable_sxConfig","unstable_sx","sx","theme","_createTheme__WEBPACK_IMPORTED_MODULE_0__","_emotion_react__WEBPACK_IMPORTED_MODULE_2__","react_jsx_runtime__WEBPACK_IMPORTED_MODULE_1__","isEmpty","themeInput","xB","_interopRequireDefault","Fq","alpha","darken","getContrastRatio","lighten","_formatMuiErrorMessage2","_clamp","clampWrapper","min","max","hexToRgb","re","colors","parseInt","decomposeColor","colorSpace","marker","substring","parseFloat","recomposeColor","hslToRgb","l","f","rgb","getLuminance","val","toFixed","foreground","lumA","lumB","coefficient","_mui_utils_resolveProps__WEBPACK_IMPORTED_MODULE_2__","PropsContext","DefaultPropsProvider","getThemeProps","components","defaultProps","styleOverrides","useRtl","_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_3__","_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_2__","RtlContext","RtlProvider","removeUnusedBreakpoints","resolveBreakpointValues","createEmptyBreakpointObject","mergeBreakpointsInOrder","handleBreakpoints","_mui_utils_deepmerge__WEBPACK_IMPORTED_MODULE_0__","xs","sm","md","lg","xl","defaultBreakpoints","propValue","styleFromPropValue","themeBreakpoints","item","breakpoint","mediaKey","cssKey","breakpointsInput","_breakpointsInput$key","breakpointsInOrder","breakpointStyleKey","breakpointKeys","style","breakpointOutput","isBreakpointUnused","emptyBreakpoints","mergedOutput","computeBreakpointsBase","breakpointValues","base","breakpointsKeys","customBase","applyStyles","getColorSchemeSelector","createBreakpoints","_babel_runtime_helpers_esm_objectWithoutPropertiesLoose__WEBPACK_IMPORTED_MODULE_1__","_babel_runtime_helpers_esm_extends__WEBPACK_IMPORTED_MODULE_0__","sortBreakpointsValues","breakpointsAsArray","sort","breakpoint1","breakpoint2","unit","step","sortedValues","down","between","start","endIndex","only","not","keyIndex","createTheme_createTheme","shape","borderRadius","createTheme_shape","esm_spacing","createSpacing","spacingInput","mui","transform","hB","spacing","argsInput","shapeInput","merge","createUnarySpacing","createUnaryUnit","getValue","margin","padding","properties","directions","aliases","marginX","marginY","paddingX","paddingY","getCssProperties","prop","dir","marginKeys","paddingKeys","spacingKeys","themeKey","defaultValue","propName","_getPath","themeSpacing","DW","transformer","transformed","getStyleFromPropValue","cssProperties","cssProperty","resolveCssProperty","k9","spacing_style","propTypes","filterProps","getPath","getStyleValue","_mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_0__","_breakpoints__WEBPACK_IMPORTED_MODULE_1__","checkVars","themeMapping","propValueFinal","userValue","styleFunctionSx_defaultSxConfig","esm_compose","handlers","borderTransform","createBorderStyle","ZP","border","borderTop","borderRight","borderBottom","borderLeft","borderColor","borderTopColor","borderRightColor","borderBottomColor","borderLeftColor","outline","outlineColor","eI","NA","gap","columnGap","rowGap","gridAutoFlow","gridAutoColumns","gridAutoRows","gridTemplateColumns","gridTemplateRows","gridTemplateAreas","gridArea","paletteTransform","bgcolor","backgroundColor","sizingTransform","width","maxWidth","_props$theme","_props$theme2","VO","minWidth","maxHeight","boxSizing","o3","pt","pr","pb","pl","py","paddingTop","paddingRight","paddingBottom","paddingLeft","paddingInline","paddingInlineStart","paddingInlineEnd","paddingBlock","paddingBlockStart","paddingBlockEnd","e6","mt","mr","mb","ml","mx","my","marginTop","marginRight","marginBottom","marginLeft","marginInline","marginInlineStart","marginInlineEnd","marginBlock","marginBlockStart","marginBlockEnd","displayPrint","display","overflow","textOverflow","visibility","whiteSpace","flexBasis","flexDirection","flexWrap","justifyContent","alignItems","alignContent","alignSelf","justifyItems","justifySelf","top","right","bottom","left","boxShadow","fontStyle","textAlign","unstable_createStyleFunctionSx","_mui_utils_capitalize__WEBPACK_IMPORTED_MODULE_1__","_merge__WEBPACK_IMPORTED_MODULE_4__","_style__WEBPACK_IMPORTED_MODULE_0__","_breakpoints__WEBPACK_IMPORTED_MODULE_2__","_defaultSxConfig__WEBPACK_IMPORTED_MODULE_3__","objectsHaveSameKeys","objects","allKeys","object","every","callIfFn","maybeFn","getThemeValue","Jq","_theme$unstable_sxCon","traverse","sxInput","sxObject","W8","styleKey","breakpointsValues","L7","_useThemeWithoutDefault__WEBPACK_IMPORTED_MODULE_1__","systemDefaultTheme","_mui_styled_engine__WEBPACK_IMPORTED_MODULE_1__","isObjectEmpty","contextTheme","capitalize","_mui_utils_formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__","clamp_clamp","MIN_SAFE_INTEGER","MAX_SAFE_INTEGER","isPlainObject","getPrototypeOf","toStringTag","deepClone","target","encodeURIComponent","_formatMuiErrorMessage__WEBPACK_IMPORTED_MODULE_0__","resolveProps","defaultSlotProps","slotProps","slotPropName","createWSOLAccountInstructions","spl_token_1","walletAddress","amountIn","rentExemptLamports","tempAccount","createAccountInstruction","SystemProgram","createAccount","fromPubkey","newAccountPubkey","space","AccountLayout","programId","TOKEN_PROGRAM_ID","initAccountInstruction","Token","createInitAccountInstruction","NATIVE_MINT","closeWSOLAccountInstruction","createCloseAccountInstruction","address","instructions","cleanupInstructions","__createBinding","o","k2","desc","getOwnPropertyDescriptor","writable","configurable","__exportStar","DecimalUtil","decimal_js_1","adjustDecimals","div","pow","fromU64","fromNumber","toU64","isNeg","shiftedValue","mul","zeroDecimalValue","trunc","MathUtil","U64_MAX","U128","TWO","ONE","ZERO","anchor_1","BN","sub","toX64_BN","toX64_Decimal","toX64","fromX64","fromX64_Decimal","fromX64_BN","shiftRightRoundUp","shrn","gt","divRoundUp","n0","n1","hasRemainder","subUnderflowU128","Percentage","numerator","denominator","fromDecimal","fromFraction","toDecimalPlaces","denom","toDecimal","denomGcd","gcd","denomLcm","p1DenomAdjustment","p2DenomAdjustment","p1NumeratorAdjusted","p2NumeratorAdjusted","newNumerator","AddressUtil","toPubKey","translateAddress","toPubKeys","toStrings","findProgramAddress","seeds","bump","utils","findProgramAddressSync","__awaiter","_arguments","P","generator","adopt","fulfilled","deriveATA","resolveOrCreateATAs","resolveOrCreateATA","token_instructions_1","token_util_1","types_1","ownerAddress","tokenMint","getAccountRentExempt","wrappedSolAmountIn","modeIdempotent","requests","nonNativeMints","equals","nativeMints","instructionMap","nonNativeAddresses","all","tokenAccountInfos","getMultipleAccountsInfo","tokenAccounts","TokenUtil","deserializeTokenAccount","tai","tokenAccount","resolvedInstruction","ataAddress","EMPTY_INSTRUCTION","createAtaInstruction","createAssociatedTokenAccountInstruction","ASSOCIATED_TOKEN_PROGRAM_ID","accountRentExempt","getAssociatedTokenAddress","associatedTokenProgramId","tokenProgramId","mint","associatedAccount","pubkey","isSigner","isWritable","instructionData","TransactionInstruction","getMultipleAccounts","getMultipleParsedAccounts","getParsedAccount","tiny_invariant_1","address_util_1","parser","getAccountInfo","results","responses","chunk","addressChunk","combinedResult","flat","__decorate","decorators","c","Reflect","decorate","staticImplements","ParsableMintInfo","ParsableTokenAccountInfo","MintLayout","mintInfo","mintAuthority","mintAuthorityOption","supply","decimals","isInitialized","freezeAuthority","freezeAuthorityOption","PublicKeyUtils","isBase58","orderKeys","comparePublicKeys","key1","key2","bytes1","toBytes","bytes2","byte1","byte2","__rest","getOwnPropertySymbols","propertyIsEnumerable","math_1","web3_1","isNativeMint","createSendTokensToWalletInstruction","sourceWallet","destinationWallet","tokenDecimals","amount","sendSolTxn","transfer","toPubkey","BigInt","sourceTokenAccount","destinationTokenAccount","destinationAtaIx","transferIx","createTransferCheckedInstruction","accountInfo","delegateOption","delegate","delegatedAmount","state","isFrozen","isNativeOption","rentExemptReserve","isNative","closeAuthorityOption","closeAuthority","TransactionBuilder","transactions_processor_1","addInstruction","instruction","addInstructions","prependInstruction","unshift","prependInstructions","addSigner","compressIx","compressPost","curr","txnSize","latestBlockhash","build","requireAllSignatures","Transaction","ix","buildAndExecute","tp","TransactionProcessor","execute","signAndConstructTransaction","provider","txns","txRequest","txBuilder","transactions","lastValidBlockHeight","signTransactions","txRequests","pSignedTxs","rewriteTransaction","sendTransaction","constructSendTransactions","ex","reason","parallel","executeTx","rawTxs","confirmTx","txId","allSettled","signedTx","signAndConstructTransactions","keypair","Dt","En","vt","st","Nt","Kt","Rt","Tt","Ut","xn","Pn","_t","St","Nn","Yn","Vn","bt","wt","Jn","Ne","_n","Qe","Vt","lt","M","dt","wn","jt","L","At","yn","ze","buffer__WEBPACK_IMPORTED_MODULE_0__","base64_js__WEBPACK_IMPORTED_MODULE_4__","camelcase__WEBPACK_IMPORTED_MODULE_5__","camelcase__WEBPACK_IMPORTED_MODULE_5___default","js_sha256__WEBPACK_IMPORTED_MODULE_6__","_project_serum_borsh__WEBPACK_IMPORTED_MODULE_7__","pako__WEBPACK_IMPORTED_MODULE_8__","eventemitter3__WEBPACK_IMPORTED_MODULE_9__","eventemitter3__WEBPACK_IMPORTED_MODULE_9___default","assert__WEBPACK_IMPORTED_MODULE_10__","TextDecoder","TextEncoder","E","toByteArray","freeze","__proto__","hex","padStart","substr","utf8","bs58","base64","fromByteArray","errors","C","B","D","u","N","R","V","$","K","q","W","G","H","J","X","Q","Y","rt","tt","nt","et","ot","it","invoke","getRecentBlockhash","ct","ut","at","ht","ft","yt","isSet","pop","errorLogs","errorCode","errorMessage","comparedValues","origin","_programErrorStack","findIndex","startsWith","file","program","programErrorStack","includes","log","Proxy","StateInvalidAddress","Et","It","kt","Mt","xt","RegExp","Pt","splitRegexp","stripRegexp","Lt","fieldLayout","defined","typeDefLayout","kind","idl","ixLayout","parseIxLayout","zt","sighashLayouts","_encode","encodeState","types","format","Ct","formatIdlType","formatIdlData","flattenIdlAccounts","formatIdlDataDefined","sha256","digest","Bt","Ot","accountLayouts","accountDiscriminator","compare","decodeUnchecked","memcmp","events","layouts","discriminators","$t","typeLayouts","qt","Ft","Wt","Gt","Ht","Jt","Zt","Xt","Qt","Yt","te","ee","ne","oe","ie","se","ae","ce","ue","de","le","he","pe","fe","me","ye","ge","be","initializeMint","initializeAccount","initializeMultisig","approve","revoke","authorityType","newAuthority","setAuthority","mintTo","burn","closeAccount","freezeAccount","thawAccount","transferChecked","approveChecked","mintToChecked","burnChecked","authority","initilaizeAccount2","syncNative","initializeAccount3","initializeMultisig2","encodeInitializeMint2","we","ve","Ae","_e","Se","ke","Le","Ee","Ie","Me","xe","Pe","Te","Be","Ce","dataSize","Oe","De","Re","Ke","seed","createAccountWithSeed","$e","authorized","advanceNonceAccount","withdrawNonceAccount","initializeNonceAccount","authorizeNonceAccount","allocate","allocateWithSeed","assignWithSeed","transferWithSeed","Ve","Ue","je","qe","Fe","We","NONCE_ACCOUNT_LENGTH","Je","Ge","He","Ze","Xe","Ye","tn","en","rn","isOnCurve","nn","byteOffset","on","sn","createWithSeedSync","createProgramAddressSync","associated","an","cn","un","ASSOCIATED_PROGRAM_ID","associatedAddress","dn","delete","A","ln","hn","programdataAddress","programData","pn","rpc","features","verifiedBuild","verified","verified_slot","fetchData","gn","vn","remainingAccounts","accountsArray","isMut","bn","An","preInstructions","postInstructions","coder","_idl","_programId","_address","Sn","_sub","subscribe","onAccountChange","emit","listener","unsubscribe","removeAccountChangeListener","catch","_idlAccount","_coder","_size","fetchNullable","fetchMultiple","getProgramAccounts","filters","In","warn","createInstruction","getMinimumBalanceForRentExemption","kn","Mn","_eventParser","_eventCallbacks","_eventListeners","_listenerIdCount","_onLogsSubscriptionId","onLogs","parseLogs","removeOnLogsListener","Tn","Ln","handleLog","handleProgramLog","handleSystemLog","Cn","zn","Bn","version","On","_args","_accounts","_idlIx","_accountStore","Dn","CONST_ACCOUNTS","pda","autoPopulatePda","parseProgramId","toBufferConst","argValue","accountValue","toBufferArg","toBufferAccount","toBufferValue","fetchAccount","parseAccountValue","writeUInt16LE","writeBigUInt64LE","associatedTokenProgram","rent","SYSVAR_RENT_PUBKEY","systemProgram","tokenProgram","_cache","Rn","_ixFn","_txFn","_rpcFn","_simulateFn","_viewFn","_remainingAccounts","_signers","_preInstructions","_postInstructions","_autoResolveAccounts","_accountsResolver","pubkeys","accountsStrict","_events","returns","views","fetchIdl","createWithSeed","rr","Un","jn","Kn","qn","Fn","Wn","Gn","Hn","associatedToken","Zn","Xn","Qn","system","IDL","DistributorClient","common_sdk_1","token_utils_1","utils_1","buffer_layout_utils_1","newDistributor","clawbackReceiver","maxTotalClaim","maxNumNodes","startTs","endTs","distributor","clawbackReceiverATA","getATAAddressSync","clawbackTokenAccountInfo","tokenVault","newDistributorIx","admin","inputs","toBytes32Array","setAdmin","newAdmin","distributorData","merkleDistributor","toTx","setClawbackReceiver","setClawbackReceiverIx","newClawbackAccount","setMerkleRoot","setTimestamp","deposit","fetcher","getOneMerkleDistributor","fromAssociatedTokenAccount","addSigners","transferInstructionData","TokenInstruction","Transfer","newClaim","proof","claimStatus","claim_status","to","toTokenAccountInfo","createATAInstruction","newClaimIx","claimant","clawback","MERKLE_DISTRIBUTOR_PROGRAM_ID","PROGRAM_ID","Context","fetcher_1","methods_1","AccountFetcher","anchorProvider","Program","MerkleDistributorIDL","fromWorkspace","withProvider","Methods","parsing_1","refreshAll","bulkRequest","cachedContent","entity","refresh","cachedValue","accountData","list","cachedValues","undefinedAccounts","cacheIndex","dataIndex","addressesSubset","ParsableMerkleDistributor","getOneClaimStatus","ParsableClaimStatus","parseAnchorAccount","accountName","BorshAccountsCoder","subarray","accountsCoder","AccountName","MerkleDistributor","ClaimStatus","__setModuleDefault","__importStar","ixs","PDA","constants_1","BalanceTree","js_sha3_1","merkle_tree_1","balances","_tree","MerkleTree","toNode","verifyProof","pair","combinedHash","keccak_256","LEAF_PREFIX","getHexRoot","getHexProof","getRoot","getProof","getOrCreateATAInstruction","deriveClaimStatus","web3","allowOwnerOffCurve","toAccount","INTERMEDIATE_PREFIX","getPairElement","layer","pairIdx","pairEl","bufDedup","elements","el","bufArrToHexArr","arr","some","sortAndConcat","sorted","_elements","_bufferElementPositionIndex","memo","_layers","getLayers","layers","nextLayerIndex","getNextLayer","second","initialIdx","pairElement","createMerkleDistributorProgram","merkle_distributor_1","ownerOrAuthority","multiSigners","AccountClient","AnchorError","BorshCoder","BorshEventCoder","BorshInstructionCoder","DISCRIMINATOR_SIZE","EventManager","EventParser","IdlError","LangErrorMessage","MethodsBuilderFactory","Native","ProgramError","ProgramErrorStack","SystemCoder","eventDiscriminator","getProvider","parseIdlErrors","setProvider","splitArgsAndCtx","toInstruction","translateError","validateAccounts","camelcase__WEBPACK_IMPORTED_MODULE_4__","camelcase__WEBPACK_IMPORTED_MODULE_4___default","_noble_hashes_sha256__WEBPACK_IMPORTED_MODULE_8__","pako__WEBPACK_IMPORTED_MODULE_6__","eventemitter3__WEBPACK_IMPORTED_MODULE_7__","eventemitter3__WEBPACK_IMPORTED_MODULE_7___default","decode$2","encode$2","index$1","byte","idlIx","ixArg","ixAccounts","getMultipleAccountsAndContext","batches","batch","_AVAILABLE_FEATURES","_FEATURES","programKeyRegex","successRegex","programStack","programKey","anchorErrorLogIndex","anchorErrorLog","pubkeyRegex","leftPubkey","rightPubkey","valueRegex","leftValue","rightValue","regexNoInfo","noInfoAnchorErrorLog","regexFileLine","fileLineAnchorErrorLog","regexAccountName","accountNameAnchorErrorLog","errorCodeString","errorNumber","fileLine","idlErrors","unparsedErrorCode","errString","matches","parseErr","errorMsg","anchorError","programError","handler","__assign$1","__assign","lowerCase","DEFAULT_SPLIT_REGEXP","DEFAULT_STRIP_REGEXP","noCase","dotCase","snakeCase","IdlCoder","field","fieldName","filtered","arrayTy","arrayLen","innerLayout","typeDef","fieldLayouts","SIGHASH_GLOBAL_NAMESPACE","sh","sighash","ixName","nameSpace","methodName","ixLayouts","accountMetas","InstructionFormatter","idlField","flatIdlAccounts","idlType","enumType","namedFields","fieldData","variantName","prefix","accName","sentenceCase","newPrefix","preimage","accountSize","idlAccount","typeSize","variantSizes","ty","arraySize","decodeAny","accountDescriminator","appendData","discriminatorPreimage","eventTypeDef","event","logArr","disc","eventName","BorshTypesCoder","typeName","typeData","SystemInstructionCoder","encodeCreateAccount","encodeAssign","encodeTransfer","encodeCreateAccountWithSeed","encodeAdvanceNonceAccount","encodeWithdrawNonceAccount","encodeInitializeNonceAccount","encodeAuthorizeNonceAccount","encodeAllocate","encodeAllocateWithSeed","encodeAssignWithSeed","encodeTransferWithSeed","_ixName","_ix","encodeData","maxSpan","instructionMaxSpan","SystemAccountsCoder","NONCE_ACCOUNT_LAYOUT","decodeNonceAccount","_appendData","SystemEventsCoder","_log","SystemTypesCoder","_name","_type","_typeData","assoc","fromPublicKey","limit","latestBuildsResp","latestBuilds","programdataAccountInfo","isIdlAccounts","accountItem","idlAddress","IDL_ACCOUNT_LAYOUT","decodeIdlAccount","inputLen","InstructionNamespaceFactory","encodeFn","ixArgs","validateInstruction","accs","nestedAccounts","rpcAccs","isOptional","TransactionFactory","ixFn","txFn","RpcFactory","AccountFactory","accountFns","fetchNullableAndContext","getAccountInfoAndContext","fetchAndContext","fetchMultipleAndContext","coderFilters","resp","subscriptions","sizeOverride","addr","PROGRAM_LOG","PROGRAM_DATA","PROGRAM_LOG_START_INDEX","PROGRAM_DATA_START_INDEX","allListeners","listenerCb","listeners","errorOnDecodeFailure","logScanner","LogScanner","execution","ExecutionContext","newProgram","didPop","logStr","logStart","SimulateFactory","TOKEN_ACCOUNT_LAYOUT","decodeTokenAccount","AccountsResolver","_accountNamespace","_idlTypes","_customResolver","AccountStore","resolveConst","_resolveEventCpi","resolvePdas","resolveRelations","resolveCustom","resolved","resolveOptionalsHelper","partialAccounts","accountItems","nestedAccountsGeneric","partialAccount","isPartialAccounts","flattenPartialAccounts","resolveOptionals","ret","subPath","isLast","accountDescOrAccounts","subAccounts","accountDesc","accountDescName","nextIndex","currentName","nextName","currentPath","nextPath","found","accountDescCasted","Boolean","relations","newPath","accountKey","matching","rel","relName","seedDesc","getType","subType","structType","seedArgName","idlArgPosition","argDesc","pathComponents","fieldPubkey","fieldValue","accountField","bU64","clock","SYSVAR_CLOCK_PUBKEY","_idls","ensureIdl","accountFetcher","firstAccountLayout","rpcFn","simulateFn","viewFn","accountNamespace","idlTypes","customResolver","MethodsBuilder","throwOnNull","toReturn","rpcAndKeys","prepare","ViewFactory","hasReturn","simulationResult","returnPrefix","returnLog","returnData","returnType","NamespaceFactory","getCustomResolver","ixItem","txItem","rpcItem","simulateItem","viewItem","methodItem","idlAddr","inflatedIdl","SYSTEM_PROGRAM_ID","getATAAddressesSync","getATAAddresses","getATAAddress","solana_contrib_1","getProgramAddress","mints","deduped","sleep","getTokenAccount","getMintInfo","createAccountRentExempt","createTokenAccountInstrs","createMintAndVault","createMintInstructions","createToken","createMint","SPL_SHARED_MEMORY_ID","DEFAULT_TOKEN_DECIMALS","tslib_1","index_js_1","generate","fromMint","createInitMintInstruction","vault","createMintToInstruction","depositorAccInfo","deserializeMint","deserializeAccount","ms","setTimeout","SPLToken","validateU256","validateU64","TEN","Rounding","Percent","parseBigintIsh","MAX_U256","MAX_U64","makeDecimalMultiplier","Fraction","token_math_1","buildCreateTokenAccountTX","createTokenAccount","layout_js_1","accountSigner","rentExemptAccountBalance","getMinBalanceRentForExemptAccount","TransactionEnvelope","TokenAccountLayout","getOrCreateATAs","getOrCreateATA","ata_js_1","mintKey","createAccountInstructions","createInitMintTX","createInitMintInstructions","mintKP","rentExemptMintBalance","getMinBalanceRentForExemptMint","mintAuthorityKP","mintNFT","mint_js_1","tempMintAuthority","createSetAuthorityInstruction","Uint64Layout","PublicKeyLayout","structLayout","TypedStructure","TypedLayout","BufferLayout","Price","baseCurrency","quoteCurrency","new","fromUPrice","price","ENV","ChainId","WRAPPED_SOL","RAW_SOL","chainIdToNetwork","networkToChainId","CHAIN_ID_TO_NETWORK","NETWORK_TO_CHAIN_ID","makeTokenForAllNetworks","tokensEqual","RAW_SOL_MINT","_mintAccount","network","chainId","mintAccount","isRawSOL","symbol","logoURI","toJSON","hasTag","Localnet","load","mintAccountInfo","rawSol","wrappedSol","MainnetBeta","devnet","Devnet","testnet","Testnet","localnet","TokenAmount","uiAmount","parseAmountFromString","divideByInteger","toExact","_isTA","dedupeTokens","makeTokenMap","ORIGIN_CHAINS","token_js_1","tokenList","tokens","seen","tokenID","TokenOwner","getATA","getATASync","createTransferInstruction","createATA","TokenAugmentedProvider","ata_js_2","SolanaAugmentedProvider","createTokenTX","walletKey","newTX","transferTo","destination","txEnv","sourceATA","toATA","confirm","loadToken","mintToAccount","fetchMint","fetchTokenAccount","tokenAccountInfo","fetchATA","taAddress","exists","isNotUndefined","isNotNull","mapSome","mapN","MultipleConnectionBroadcaster","SingleConnectionBroadcaster","DEFAULT_FALLBACK_RETRY_OPTIONS","DEFAULT_RETRY_OPTIONS","error_js_1","provider_js_1","index_js_2","simulateTransactionWithCommitment_js_1","sendAndSpamRawTx_js_1","retryTimes","retryInterval","sendConnection","DEFAULT_PROVIDER_OPTIONS","broadcast","printLogs","PendingTransaction","sendAndSpamRawTx","suppressConsoleErrorAsync","verifySigners","simulateTransactionWithCommitment","connections","conn","AggregateError","firstAggregateError","_sendRawTransaction","encoded","TieredBroadcaster","index_js_3","primaryConnection","fallbackConnections","premiumBroadcaster","pending","fc","fallbackRetryOptions","COMPUTE_BUDGET_PROGRAM","requestHeapFrameInstruction","requestComputeUnitsInstruction","layouts_js_1","units","additionalFee","RequestUnitsLayout","RequestHeapFrameLayout","DEFAULT_NETWORK_CONFIG_MAP","formatNetwork","endpoint","firstError","remErrors","SolanaProvider","SolanaTransactionSigner","doSignAndBroadcastTransaction","SolanaReadonlyProvider","DEFAULT_READONLY_PUBLIC_KEY","TransactionEnvelope_js_1","accountId","broadcaster","signAndBroadcastTransaction","signAll","reqs","broadcastConnections","firstBroadcastConnection","theTx","wait","simTX","requestAirdrop","withSigner","SignerWallet","promise_retry_1","txLink_js_1","TransactionReceipt_js_1","_receipt","receipt","useWebsocket","retryOpts","pollForReceipt","retry","TransactionReceipt","retries","minTimeout","awaitSignatureConfirmation","generateSolanaExplorerLink","cluster","generateTXLink","PACKET_DATA_SIZE","txSizer_js_1","utils_js_1","filterRequiredSigners","requiredSigners","flatMap","rs","estimateSizeUnsafe","builtTx","calculateTxSizeUnsafe","estimateSize","suppressConsoleError","EstimatedTXTooBigError","TXSizeEstimationError","buildPartition","partition","estimation","lastTXEnv","_filterRequiredSigners","lastEstimation","nextIXs","nextSigners","nextTXEnv","nextEstimation","generateInspectLink","RECENT_BLOCKHASH_STUB","serializeMessage","generateInspectLinkFromBase64","simulateUnchecked","simulateTable","simulation","printTXTable","combine","writableKeys","inst","instructionsJSON","debugStr","ser","sg","addMemos","addMemo","combineAll","pack","addedTX","combineAllAsync","firstTX","dedupeATAIXs","seenATAs","ataKey","splitATAIXs","ataIXs","newTx","getInstruction","createMemoInstruction","addAdditionalComputeBudget","addAdditionalHeapFrame","confirmTransactionLike","misc_js_1","PendingTransaction_js_1","ish","valueAsPromise","getEvents","eventParser","computeUnits","consumeLog","amtStr","formatInstructionLogs","formatLogEntry","parseTransactionLogs","programErr_js_1","prettyError","depth","prettyLogs","getTransactionInstructionError","regex","matchAll","programAddress","failed","instructionLog","failedIx","buildPrefix","fill","formatLogEntryString","entry","prefixString","innerError","instructionError","getInstructionError","out","BUILTIN_SOLANA_ERROR_MESSAGES","shortvecEncodeLength","rem_len","elem","hasFeePayerSigned","numSigners","signatureCount","generateUncheckedInspectLink","serializeToBase64Unchecked","buildStubbedTransaction","verifySignatures","base64TX","MEMO_PROGRAM_ID","formatPubkeyShort","noop","oldConsoleError","awaitable","leading","trailing","printAccountOwners","plainObj","relativePath","callStack","expectIndex","debugAccountOwnersIndex","versions","targetLine","cwd","targetLineAfterCwd","_transformAccountOwners","gracefulGetMultipleAccountsInfo","unknownConection","rpcRequest","plainObjWithAddressesAndBignums","base58ToResultKey","base58ToLookup","asyncKeys","asyncPromises","base58","pubKey","resultKey","lookupIndex","asyncValues","fakeSigner","estimateTransactionSize","transactionLogs","computeUnitLogStack","cpiLogStack","currentIndex","cpiMatch","cur","computeMatch","instructionTable","computeUnitLog","computeUnitMatch","quota","iso","isolatedInstructionSize","mar","marginalInstructionSize","cum","instructionsSize","used","CPI","table","underlyingError","txEnvelope","simpleInstruction","fs","getFakeSigner","randomProvider","previousInstructions","previousTxSize","biggerTxSize","instructionedTx","getPublicKey","CachedPublicKey","pubkeyCache","_base58","getOrCreatePublicKey","pk","gpaCache","concatSeeds","normalizedSeeds","cacheKey","isPublicKey","parsePublicKey","web3_js_2","isBN","connectionInner","tsToDate","dateToTs","date","getTime","Date","ExplorerType","explorerType","SOLANA_EXPLORER","SOLSCAN","createProvider","nu64be","u48be","u40be","u32be","u24be","u16be","u48","u40","u24","greedy","Constant","UTF8","CString","BitField","BitStructure","Sequence","DoubleBE","Double","FloatBE","Float","NearInt64BE","NearUInt64BE","IntBE","Int","GreedyCount","bindConstructorLayout","uint8ArrayToBuffer","checkUint8Array","cstr","unionLayoutDiscriminator","bits","f64be","f32be","ns64be","s48be","s40be","s32be","s24be","s16be","s48","s40","s24","Class","layout_","boundConstructor_","elementSpan","rem","readIntLE","writeIntLE","readIntBE","writeIntBE","readUInt32BE","writeUInt32BE","readInt32BE","writeInt32BE","readFloatLE","writeFloatLE","readFloatBE","writeFloatBE","readDoubleLE","writeDoubleLE","readDoubleBE","writeDoubleBE","elo","fixBitwiseResult","word","msb","_packedSetValue","_packedGetValue","addField","bf","addBoolean","fieldFor","totalBits","usedBits","sum","valueMask","wordMask","wordValue","srcBuffer","srcb","_typeof","toPrimitive","toPropertyKey","_defineProperty","inherits","_functionsHaveNames","bn_default","index_browser_esm","base64Js","lookup","revLookup","Arr","getLens","b64","validLen","placeHoldersLen","lens","_byteLength","tmp","curByte","tripletToBase64","encodeChunk","uint8","extraBytes","maxChunkLength","len2","ieee754","read","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","NaN","Infinity","LN2","ieee754$1","customInspectSymbol","SlowBuffer","INSPECT_MAX_BYTES","K_MAX_LENGTH","typedArraySupport","proto","foo","setPrototypeOf","createBuffer","encodingOrOffset","allocUnsafe","fromString","fromArrayView","isInstance","SharedArrayBuffer","fromArrayBuffer","valueOf","fromObject","assertSize","checked","isEncoding","actual","fromArrayLike","arrayView","numberIsNaN","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","readUInt16BE","foundIndex","hexWrite","remaining","strLen","utf8Write","blitBuffer","asciiWrite","asciiToBytes","base64Write","ucs2Write","utf16leToBytes","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","poolSize","allocUnsafeSlow","_isBuffer","pos","swap16","swap32","swap64","toLocaleString","inspect","thisStart","thisEnd","thisCopy","targetCopy","isFinite","_arr","MAX_ARGUMENTS_LENGTH","codePoints","hexSliceLookupTable","checkOffset","ext","checkInt","wrtBigUInt64LE","checkIntBI","hi","wrtBigUInt64BE","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","readUintLE","readUintBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUint32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","last","boundsError","readBigUInt64BE","readInt8","readInt16LE","readInt16BE","readBigInt64LE","readBigInt64BE","writeUintLE","maxBytes","writeUintBE","writeUint8","writeUInt8","writeUint16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUint32BE","writeBigUInt64BE","writeInt8","writeInt16LE","writeInt16BE","writeBigInt64LE","writeBigInt64BE","targetStart","copyWithin","sym","getMessage","Base","addNumericalSeparator","checkBounds","range","ERR_OUT_OF_RANGE","ERR_INVALID_ARG_TYPE","ERR_BUFFER_OUT_OF_BOUNDS","RangeError","received","INVALID_BASE64_RE","base64clean","leadSurrogate","byteArray","dst","alphabet","BufferBigIntNotDefined","global$1","inherits$1","ctor","superCtor","super_","TempCtor","inspect$1","stylize","stylizeNoColor","isBoolean","showHidden","_extend","isUndefined","customInspect","stylizeWithColor","formatValue","styleType","arrayToHash","recurseTimes","isFunction","isString","primitive","formatPrimitive","visibleKeys","isError","formatError","isRegExp","isDate","braces","toUTCString","formatArray","formatProperty","reduceToSingleString","simple","isNull","index_browser_esm_hasOwnProperty","ar","isNumber","objectToString","isPrimitive","hasOwn","objectKeys","pSlice","functionsHaveNames","pToString","arrbuf","fail","getName","AssertionError","expected","operator","generatedMessage","stackStartFunction","captureStackTrace","fn_name","next_line","truncate","something","rawname","equal","notEqual","deepEqual","_deepEqual","deepStrictEqual","strict","memos","multiline","ignoreCase","Float32Array","Float64Array","actualIndex","objEquiv","isArguments","actualVisitedObjects","aIsArgs","bIsArgs","ka","kb","notDeepEqual","notDeepStrictEqual","strictEqual","notStrictEqual","expectedException","_tryBlock","block","_throws","shouldThrow","userProvidedMessage","isUnwantedException","isUnexpectedException","index_browser_esm_throws","doesNotThrow","ifError","throws","Layout$1","const","sendAndConfirmTransaction","title","FAILED_TO_FIND_ACCOUNT","INVALID_ACCOUNT_OWNER","pubkeyToBuffer","isAccount","accountOrPublicKey","AuthorityTypeCodes","MintTokens","FreezeAccount","AccountOwner","CloseAccount","MultisigLayout","associatedProgramId","getMinBalanceRentForExemptMultisig","balanceNeeded","newAccount","mintPublicKey","createAssociatedTokenAccount","createAssociatedTokenAccountInternal","getOrCreateAssociatedAccountInfo","createWrappedNativeAccount","createMultisig","multisigAccount","dataLayout","getMultisigInfo","multisig","multisigInfo","signer1","signer2","signer3","signer4","signer5","signer6","signer7","signer8","signer9","signer10","signer11","ownerPublicKey","createApproveInstruction","createRevokeInstruction","currentAuthority","currentAuthorityPublicKey","createBurnInstruction","authorityPublicKey","createFreezeAccountInstruction","createThawAccountInstruction","createApproveCheckedInstruction","createMintToCheckedInstruction","createBurnCheckedInstruction","nativeAccount","createSyncNativeInstruction","commandDataLayout","encodeLength","Account","AddressLookupTableAccount","AddressLookupTableInstruction","AddressLookupTableProgram","Authorized","BLOCKHASH_CACHE_TIMEOUT_MS","BPF_LOADER_DEPRECATED_PROGRAM_ID","BPF_LOADER_PROGRAM_ID","BpfLoader","COMPUTE_BUDGET_INSTRUCTION_LAYOUTS","ComputeBudgetInstruction","ComputeBudgetProgram","Connection","Ed25519Program","Enum","EpochSchedule","FeeCalculatorLayout","LAMPORTS_PER_SOL","LOOKUP_TABLE_INSTRUCTION_LAYOUTS","Loader","Lockup","MAX_SEED_LENGTH","Message","MessageAccountKeys","MessageV0","NonceAccount","PUBLIC_KEY_LENGTH","SIGNATURE_LENGTH_IN_BYTES","SOLANA_SCHEMA","STAKE_CONFIG_ID","STAKE_INSTRUCTION_LAYOUTS","SYSTEM_INSTRUCTION_LAYOUTS","SYSVAR_EPOCH_SCHEDULE_PUBKEY","SYSVAR_INSTRUCTIONS_PUBKEY","SYSVAR_RECENT_BLOCKHASHES_PUBKEY","SYSVAR_REWARDS_PUBKEY","SYSVAR_SLOT_HASHES_PUBKEY","SYSVAR_SLOT_HISTORY_PUBKEY","SYSVAR_STAKE_HISTORY_PUBKEY","Secp256k1Program","SolanaJSONRPCError","SolanaJSONRPCErrorCode","StakeAuthorizationLayout","StakeInstruction","StakeProgram","index_browser_esm_Struct","SystemInstruction","TransactionExpiredBlockheightExceededError","TransactionExpiredNonceInvalidError","TransactionExpiredTimeoutError","TransactionMessage","TransactionStatus","VALIDATOR_INFO_KEY","VERSION_PREFIX_MASK","VOTE_PROGRAM_ID","ValidatorInfo","VersionedMessage","VersionedTransaction","VoteAccount","VoteAuthorizationLayout","VoteInit","VoteInstruction","VoteProgram","clusterApiUrl","_PublicKey","_Lockup","utils_namespaceObject","abytes","bitGet","bitLen","bitMask","bitSet","utils_bytesToHex","utils_bytesToNumberBE","utils_bytesToNumberLE","utils_concatBytes","createHmacDrbg","utils_ensureBytes","utils_equalBytes","hexToBytes","hexToNumber","isBytes","utils_numberToBytesBE","utils_numberToBytesLE","numberToHexUnpadded","numberToVarBytesBE","utils_utf8ToBytes","validateObject","node_modules_buffer","_md","U32_MASK64","_32n","fromBig","lst","Ah","Uint32Array","Al","toBig","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","rotlSH","rotlSL","rotlBH","rotlBL","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5L","El","add5H","Eh","_u64","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","VR","Fh","Fl","Gh","Gl","Hh","Hl","getUint32","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","roundClean","destroy","sha512_sha512","hE","_0n","_1n","_2n","hexes","asciis","_0","_9","_A","_F","_f","asciiToBase16","char","hl","al","ai","n2","expectedLength","arrays","pad","diff","u8n","u8fr","hashLen","qByteLen","hmacFn","reset","reseed","gen","sl","genUntil","pred","validatorFns","bigint","function","stringOrUint8Array","isSafeInteger","Fp","isValid","outputLen","validators","optValidators","checkField","checkVal","modular_0n","modular_1n","modular_2n","_3n","_4n","_5n","_8n","modular_mod","power","modulo","modular_pow2","invert","tonelliShanks","legendreC","p1div4","eql","sqr","Q1div2","neg","t2","FpSqrt","c1","nv","modular_isNegativeLE","FIELD_FIELDS","validateField","initial","ORDER","MASK","BYTES","BITS","FpPow","FpInvertBatch","nums","lastMultiplied","is0","inverted","inv","reduceRight","nLength","nBitLength","_nBitLength","nByteLength","Field","redef","sqrtP","isOdd","lhs","rhs","sqrN","addN","subN","mulN","sqrt","invertBatch","cmov","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","mapHashToField","fieldLen","minLen","reduced","curve_0n","curve_1n","wNAF","constTimeNegate","negate","windows","windowSize","unsafeLadder","elm","double","precomputeWindow","precomputes","BASE","maxNumber","shiftBy","wbits","offset1","offset2","cond1","cond2","wNAFCached","precomputesMap","_WINDOW_SIZE","comp","validateBasic","curve","Gx","Gy","edwards_0n","edwards_1n","edwards_2n","edwards_8n","VERIFY_DEFAULT","zip215","validateOpts","randomBytes","adjustScalarBytes","domain","uvRatio","mapToCurve","edwards_twistedEdwards","curveDef","CURVE","CURVE_ORDER","prehash","cHash","cofactor","modP","phflag","inBig","inRange","in0MaskRange","assertInRange","assertGE0","pointPrecomputes","isPoint","Point","ey","ez","toAffine","fromAffine","normalizeZ","toInv","_setWindowSize","assertValidity","X2","Y2","Z2","Z4","aX2","XY","ZT","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","x1y1","X3","Y3","T3","Z3","T1","T2","subtract","wnaf","multiply","scalar","multiplyUnsafe","I","isSmallOrder","isTorsionFree","iz","ax","ay","zz","clearCofactor","fromHex","normed","lastByte","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getExtendedPublicKey","point","toRawBytes","toHex","modN","modN_LE","hashed","pointBytes","hashDomainToScalar","msgs","verifyOpts","verify","sig","SB","RkA","randomPrivateKey","precompute","ExtendedPoint","ED25519_P","ED25519_SQRT_M1","ed25519_0n","ed25519_1n","ed25519_2n","ed25519_5n","ed25519_8n","ed25519_pow_2_252_3","_10n","_20n","_40n","_80n","x2","b2","b4","b5","b10","b20","b40","b80","b160","b240","b250","pow_p_5_8","v3","v7","vx2","root1","root2","useRoot1","useRoot2","noRoot","ed25519Defaults","O6","ed25519","assertRstPoint","RistPoint","SQRT_M1","SQRT_AD_MINUS_ONE","INVSQRT_A_MINUS_D","ONE_MINUS_D_SQ","D_MINUS_ONE_SQ","invertSqrt","MAX_255B","bytes255ToNumberLE","bytesToNumberLE","calcElligatorRistrettoMap","r0","Ns","Ns_D_is_sq","s_","isNegativeLE","s2","W0","W1","W2","W3","ep","ap","hashToCurve","ensureBytes","r1","R1","r2","R2","emsg","equalBytes","numberToBytesLE","u1","u2","u1_2","u2_2","Dx","Dy","u2sq","invsqrt","D1","D2","zInv","_x","_y","bytesToHex","one","two","bs58_default","esm_sha256","lib","browser","explanation","cause","isNonArrayObject","dist_define","dist_boolean","instance","never","record","Key","Value","Never","coerced","client_browser","browser_default","eventemitter3","WebSocketBrowserImpl","socket","protocols","WebSocket","onopen","onmessage","onclose","optionsOrCallback","cb","close","DefaultDataPack","CommonClient","rpc_id","queue","autoconnect","ready","reconnect","reconnect_timer_id","reconnect_interval","max_reconnects","rest_options","current_reconnects","generate_request_id","webSocketFactory","dataPack","_connect","connect","timeout","ws_opts","login","listMethods","notify","setAutoReconnect","setReconnectInterval","interval","setMaxReconnects","clearTimeout","notification","_assert","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","sha3_0n","sha3_1n","sha3_2n","_7n","_256n","_0x71n","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlL","keccakP","rounds","idx1","idx0","B0","B1","Th","Tl","curH","curL","PI","Keccak","blockLen","suffix","enableXOF","posOut","finished","destroyed","Rx","state32","keccak","iA","l1","update","Gg","O0","take","finish","writeInto","aI","bufferOut","xofInto","xof","digestInto","J8","_cloneInto","HMAC","vp","iHash","oHash","hmac","validatePointOpts","allowedPrivateKeyLengths","wrapPrivateKey","allowInfinityPoint","fromBytes","endo","beta","splitScalar","bytesToNumberBE","b2n","h2b","DER","Err","_parseInt","toSig","sBytes","rBytesLeft","hexFromSig","shl","rhl","rl","weierstrass_0n","weierstrass_1n","weierstrass_3n","weierstrassPoints","_isCompressed","tail","weierstrassEquation","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","lengths","assertPrjPoint","pz","privateKey","hasEvenY","U1","U2","b3","t0","t1","t3","t4","t5","k1neg","k1","k2neg","k1p","k2p","fake","f1p","f2p","multiplyAndAddUnsafe","isCompressed","_bits","ProjectivePoint","weierstrass_validateOpts","bits2int","bits2int_modN","lowS","weierstrass","compressedLen","uncompressedLen","isValidFieldElement","invN","cat","sqrtError","isYOdd","isHeadOdd","numToNByteStr","isBiggerThanHalfOrder","HALF","normalizeS","slcNum","Signature","recovery","fromCompact","fromDER","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","hasHighS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isValidPrivateKey","isProbPub","getSharedSecret","privateA","publicB","delta","ORDER_MASK","int2octets","prepSig","defaultSigOpts","extraEntropy","ent","h1int","seedArgs","k2sig","kBytes","ik","normS","defaultVerOpts","drbg","_sig","derError","getHash","eV","createCurve","defHash","secp256k1P","secp256k1N","secp256k1_1n","secp256k1_2n","divNearest","sqrtMod","_6n","_11n","_22n","_23n","_44n","_88n","b6","b9","b11","b22","b44","b88","b176","b220","b223","secp256k1_Fp","secp256k1","a1","b1","a2","POW_2_128","c2","secp256k1_0n","TAGGED_HASH_PREFIXES","taggedHash","messages","tagP","tagH","concatBytes","generatePrivateKey","generateKeypair","privateScalar","secretKey","deserialize","deserializeUnchecked","enum","isPublicKeyData","_bn","uniquePublicKeyCounter","decoded","unique","publicKeyBytes","createProgramAddress","seedsWithNonce","pubkeyData","_publicKey","_secretKey","secretKeyBuffer","timeoutSeconds","staticAccountKeys","accountKeysFromLookups","keySegments","readonly","keySegment","compileInstructions","U8_MAX","keyIndexMap","findKeyIndex","programIdIndex","accountKeyIndexes","rustString","rsl","_decode","rslShim","lockup","voteInit","voteAuthorizeWithSeedArgs","getAlloc","getItemAlloc","decodeLength","index_browser_esm_assert","CompiledKeys","keyMetaMap","getOrInsertDefault","keyMeta","isInvoked","payerKeyMeta","accountMeta","getMessageComponents","mapEntries","writableSigners","readonlySigners","writableNonSigners","readonlyNonSigners","numRequiredSignatures","numReadonlySignedAccounts","numReadonlyUnsignedAccounts","payerAddress","extractTableLookup","lookupTable","writableIndexes","drainedWritableKeys","drainKeysFoundInLookupTable","readonlyIndexes","drainedReadonlyKeys","lookupTableEntries","keyMetaFilter","lookupTableIndexes","drainedKeys","lookupTableIndex","END_OF_BUFFER_ERROR_MESSAGE","guardedShift","guardedSplice","splice","accountKeys","indexToProgramIds","compiledInstructions","addressTableLookups","getAccountKeys","compiledKeys","payerKey","isAccountSigner","isAccountWritable","numSignedAccounts","unsignedAccountIndex","numUnsignedAccounts","numWritableUnsignedAccounts","numWritableSignedAccounts","isProgramId","programIds","numKeys","keyCount","keyIndicesCount","dataCount","keyIndices","dataLength","instructionCount","instructionBuffer","instructionBufferLength","instructionLayout","signDataLayout","accountCount","dataSlice","messageArgs","numAccountKeysFromLookups","addressLookupTableAccounts","resolveAddressTableLookups","numStaticAccountKeys","lookupAccountKeysIndex","numWritableLookupAccountKeys","tableLookup","tableAccount","lookupTableAccounts","extractResult","addressTableLookup","encodedStaticAccountKeysLength","serializedInstructions","serializeInstructions","encodedInstructionsLength","serializedAddressTableLookups","serializeAddressTableLookups","encodedAddressTableLookupsLength","messageLayout","serializedMessage","MESSAGE_VERSION_0_PREFIX","serializedMessageLength","staticAccountKeysLength","instructionsLength","addressTableLookupsLength","serializedLength","encodedAccountKeyIndexesLength","encodedDataLength","encodedWritableIndexesLength","encodedReadonlyIndexesLength","addressTableLookupLayout","maskedPrefix","accountKeyIndexesLength","addressTableLookupsCount","writableIndexesLength","readonlyIndexesLength","deserializeMessageVersion","DEFAULT_SIGNATURE","nonceInfo","minNonceContextSlot","_message","_json","minContextSlot","nonceInstruction","compileMessage","uniqueMetas","pubkeyString","uniqueIndex","localeMatcher","usage","sensitivity","ignorePunctuation","numeric","caseFirst","localeCompare","feePayerIndex","payerMeta","signedKeys","unsignedKeys","getEstimatedFee","getFeeForMessage","setSigners","uniqueSigners","_partialSign","_addSignature","addSignature","sigpair","signatureErrors","_getMessageSignednessErrors","missing","invalid","sigErrors","transactionLength","keyObj","populate","sigPubkeyPair","decompile","compiledIx","compileToLegacyMessage","compileToV0Message","defaultSignatures","encodedSignaturesLength","transactionLayout","serializedTransaction","serializedTransactionLength","signaturesLength","messageData","signerPubkeys","signerIndex","NUM_TICKS_PER_SECOND","DEFAULT_TICKS_PER_SLOT","NUM_SLOTS_PER_SECOND","MS_PER_SLOT","transactionMessage","maybeLogsOutput","guideText","transactionError","cachedLogs","getLogs","JSON_RPC_SERVER_ERROR_BLOCK_CLEANED_UP","JSON_RPC_SERVER_ERROR_SEND_TRANSACTION_PREFLIGHT_FAILURE","JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_VERIFICATION_FAILURE","JSON_RPC_SERVER_ERROR_BLOCK_NOT_AVAILABLE","JSON_RPC_SERVER_ERROR_NODE_UNHEALTHY","JSON_RPC_SERVER_ERROR_TRANSACTION_PRECOMPILE_VERIFICATION_FAILURE","JSON_RPC_SERVER_ERROR_SLOT_SKIPPED","JSON_RPC_SERVER_ERROR_NO_SNAPSHOT","JSON_RPC_SERVER_ERROR_LONG_TERM_STORAGE_SLOT_SKIPPED","JSON_RPC_SERVER_ERROR_KEY_EXCLUDED_FROM_SECONDARY_INDEX","JSON_RPC_SERVER_ERROR_TRANSACTION_HISTORY_NOT_AVAILABLE","JSON_RPC_SCAN_ERROR","JSON_RPC_SERVER_ERROR_TRANSACTION_SIGNATURE_LEN_MISMATCH","JSON_RPC_SERVER_ERROR_BLOCK_STATUS_NOT_AVAILABLE_YET","JSON_RPC_SERVER_ERROR_UNSUPPORTED_TRANSACTION_VERSION","JSON_RPC_SERVER_ERROR_MIN_CONTEXT_SLOT_NOT_REACHED","customMessage","maxRetries","abortSignal","nonceAccountPubkey","nonceValue","allocLength","layoutFields","decodeData$1","NonceAccountLayout","authorizedPubkey","feeCalculator","fromAccountData","nonceAccount","encodeDecode","bigInt","bigIntLayout","toBigIntLE","toBufferLE","index_browser_esm_u64","decodeInstructionType","checkProgramId","instructionTypeLayout","typeIndex","ixType","decodeCreateAccount","checkKeyLength","Create","decodeTransfer","decodeTransferWithSeed","TransferWithSeed","basePubkey","decodeAllocate","Allocate","accountPubkey","decodeAllocateWithSeed","AllocateWithSeed","decodeAssign","Assign","decodeAssignWithSeed","AssignWithSeed","decodeCreateWithSeed","CreateWithSeed","decodeNonceInitialize","InitializeNonceAccount","noncePubkey","decodeNonceAdvance","AdvanceNonceAccount","decodeNonceWithdraw","WithdrawNonceAccount","decodeNonceAuthorize","AuthorizeNonceAccount","newAuthorizedPubkey","UpgradeNonceAccount","createNonceAccount","initParams","nonceInitialize","nonceAdvance","nonceWithdraw","nonceAuthorize","CHUNK_SIZE","getMinNumSignatures","chunkSize","programInfo","bytesLength","bytesLengthPadding","_rpcEndpoint","REQUESTS_PER_SECOND","deployCommitment","finalizeSignature","currentSlot","getSlot","elf","loaderProgramId","objToString","objKeys","isArrayProp","propVal","toStr","fastStableStringify$1","returnVal","MINIMUM_SLOT_PER_EPOCH","trailingZeros","nextPowerOfTwo","slotsPerEpoch","leaderScheduleSlotOffset","warmup","firstNormalEpoch","firstNormalSlot","getEpoch","getEpochAndSlotIndex","epoch","epochLen","getSlotsInEpoch","slotIndex","normalSlotIndex","normalEpochIndex","getFirstSlotInEpoch","getLastSlotInEpoch","fetchImpl","RpcWebSocketClient","underlyingSocket","decodeData","LOOKUP_TABLE_META_SIZE","isActive","deactivationSlot","LookupTableMetaLayout","serializedAddressesLen","numSerializedAddresses","lastExtendedSlot","lastExtendedSlotStartIndex","lastExtendedStartIndex","URL_RE","makeWebsocketUrl","hostish","portWithColon","protocol","startPort","websocketPort","PublicKeyFromString","RawAccountDataResult","BufferFromRawAccountData","assertEndpointUrl","putativeUrl","extractCommitmentFromConfig","commitmentOrConfig","specifiedCommitment","specifiedConfig","notificationResultAndContext","versionedMessageFromResponse","GetInflationGovernorResult","foundation","foundationTerm","taper","terminal","GetInflationRewardResult","effectiveSlot","postBalance","commission","GetRecentPrioritizationFeesResult","prioritizationFee","GetInflationRateResult","total","GetEpochInfoResult","slotsInEpoch","absoluteSlot","blockHeight","transactionCount","GetEpochScheduleResult","GetLeaderScheduleResult","TransactionErrorResult","SignatureStatusResult","SignatureReceivedResult","VersionResult","ParsedInstructionStruct","PartiallyDecodedInstructionStruct","innerInstructions","BlockProductionResponseStruct","byIdentity","firstSlot","lastSlot","createRpcClient","httpHeaders","customFetch","fetchMiddleware","disableRetryOnRateLimit","httpAgent","agent","fetchWithMiddleware","modifiedFetchArgs","modifiedInfo","modifiedInit","clientBrowser","COMMON_HTTP_HEADERS","too_many_requests_retries","waitTime","createRpcRequest","client","createRpcBatchRequest","GetInflationGovernorRpcResult","GetInflationRateRpcResult","GetRecentPrioritizationFeesRpcResult","GetEpochInfoRpcResult","GetEpochScheduleRpcResult","GetLeaderScheduleRpcResult","SlotRpcResult","GetSupplyRpcResult","circulating","nonCirculating","nonCirculatingAccounts","TokenAmountResult","uiAmountString","GetTokenLargestAccountsResult","GetTokenAccountsByOwner","ParsedAccountDataResult","GetParsedTokenAccountsByOwner","GetLargestAccountsRpcResult","AccountInfoResult","KeyedAccountInfoResult","ParsedOrRawAccountData","ParsedAccountInfoResult","KeyedParsedAccountInfoResult","StakeActivationResult","inactive","GetConfirmedSignaturesForAddress2RpcResult","blockTime","GetSignaturesForAddressRpcResult","AccountNotificationResult","subscription","ProgramAccountInfoResult","ProgramAccountNotificationResult","SlotInfoResult","SlotNotificationResult","SlotUpdateResult","timestamp","stats","numTransactionEntries","numSuccessfulTransactions","numFailedTransactions","maxTransactionsPerEntry","SlotUpdateNotificationResult","SignatureNotificationResult","RootNotificationResult","ContactInfoResult","gossip","tpu","VoteAccountInfoResult","votePubkey","nodePubkey","activatedStake","epochVoteAccount","epochCredits","lastVote","rootSlot","GetVoteAccounts","delinquent","ConfirmationStatus","SignatureStatusResponse","confirmations","confirmationStatus","GetSignatureStatusesRpcResult","GetMinimumBalanceForRentExemptionRpcResult","AddressTableLookupStruct","ConfirmedTransactionResult","AnnotatedAccountKey","ConfirmedTransactionAccountsModeResult","ParsedInstructionResult","RawInstructionResult","InstructionResult","UnknownInstructionResult","ParsedOrRawInstruction","ParsedConfirmedTransactionResult","TokenBalanceResult","accountIndex","uiTokenAmount","LoadedAddressesResult","ConfirmedTransactionMetaResult","fee","preBalances","postBalances","preTokenBalances","postTokenBalances","loadedAddresses","computeUnitsConsumed","ParsedConfirmedTransactionMetaResult","TransactionVersionStruct","RewardsResult","rewardType","GetBlockRpcResult","previousBlockhash","parentSlot","rewards","GetNoneModeBlockRpcResult","GetAccountsModeBlockRpcResult","GetParsedBlockRpcResult","GetParsedAccountsModeBlockRpcResult","GetParsedNoneModeBlockRpcResult","GetConfirmedBlockRpcResult","GetBlockSignaturesRpcResult","GetTransactionRpcResult","GetParsedTransactionRpcResult","GetRecentBlockhashAndContextRpcResult","lamportsPerSignature","GetLatestBlockhashRpcResult","IsBlockhashValidRpcResult","PerfSampleResult","numTransactions","numSlots","samplePeriodSecs","GetRecentPerformanceSamplesRpcResult","GetFeeCalculatorRpcResult","RequestAirdropRpcResult","SendTransactionRpcResult","LogsResult","LogsNotificationResult","_commitmentOrConfig","wsEndpoint","_commitment","_confirmTransactionInitialTimeout","_rpcWsEndpoint","_rpcClient","_rpcBatchRequest","_rpcWebSocket","_rpcWebSocketConnected","_rpcWebSocketHeartbeat","_rpcWebSocketIdleTimeout","_rpcWebSocketGeneration","_disableBlockhashCaching","_pollingBlockhash","_blockhashInfo","lastFetch","transactionSignatures","simulatedSignatures","_nextClientSubscriptionId","_subscriptionDisposeFunctionsByClientSubscriptionId","_subscriptionHashByClientSubscriptionId","_subscriptionStateChangeCallbacksByHash","_subscriptionCallbacksByServerSubscriptionId","_subscriptionsByHash","_subscriptionsAutoDisposedByRpc","getBlockHeight","requestPromises","_buildArgs","requestHash","confirmTransactionInitialTimeout","_wsOnOpen","_wsOnError","_wsOnClose","_wsOnAccountNotification","_wsOnProgramAccountNotification","_wsOnSlotNotification","_wsOnSlotUpdatesNotification","_wsOnSignatureNotification","_wsOnRootNotification","_wsOnLogsNotification","rpcEndpoint","getBalanceAndContext","getBalance","getBlockTime","getMinimumLedgerSlot","getFirstAvailableBlock","getSupply","configArg","getTokenSupply","tokenMintAddress","getTokenAccountBalance","tokenAddress","getTokenAccountsByOwner","getParsedTokenAccountsByOwner","getLargestAccounts","getTokenLargestAccounts","mintAddress","getParsedAccountInfo","rawConfig","getStakeActivation","configOrCommitment","configWithoutEncoding","baseSchema","withContext","getParsedProgramAccounts","strategy","rawSignature","decodedSignature","confirmTransactionUsingLegacyTimeoutStrategy","confirmTransactionUsingBlockHeightExceedanceStrategy","confirmTransactionUsingDurableNonceStrategy","getCancellationPromise","getTransactionConfirmationPromise","signatureSubscriptionId","disposeSignatureSubscriptionStateChangeObserver","confirmationPromise","onSignature","__type","PROCESSED","subscriptionSetupPromise","resolveSubscriptionSetup","_onSubscriptionStateChange","nextState","getSignatureStatus","abortConfirmation","removeSignatureListener","expiryPromise","checkBlockHeight","currentBlockHeight","BLOCKHEIGHT_EXCEEDED","cancellationPromise","outcome","race","currentNonceValue","lastCheckedSlot","getCurrentNonceValue","getNonceAndContext","NONCE_INVALID","slotInWhichNonceDidAdvance","signatureStatus","commitmentForStatus","timeoutId","timeoutMs","TIMED_OUT","getClusterNodes","getVoteAccounts","getSlotLeader","getSlotLeaders","startSlot","getSignatureStatuses","getTransactionCount","getTotalSupply","excludeNonCirculatingAccountsList","getInflationGovernor","getInflationReward","getInflationRate","getEpochInfo","getEpochSchedule","epochSchedule","getLeaderSchedule","getRecentBlockhashAndContext","getRecentPerformanceSamples","getFeeCalculatorForBlockhash","wireMessage","getRecentPrioritizationFees","lockedWritableAccounts","getLatestBlockhashAndContext","isBlockhashValid","getVersion","getGenesisHash","getBlock","_buildArgsAtLeastConfirmed","transactionDetails","getParsedBlock","getBlockProduction","extra","getParsedTransaction","getParsedTransactions","getTransactions","getConfirmedBlock","getBlocks","endSlot","getBlockSignatures","getConfirmedBlockSignatures","getConfirmedTransaction","getParsedConfirmedTransaction","getParsedConfirmedTransactions","getConfirmedSignaturesForAddress","firstAvailableBlock","until","highestConfirmedRoot","confirmedSignatureInfo","getConfirmedSignaturesForAddress2","getSignaturesForAddress","getAddressLookupTable","getNonce","_blockhashWithExpiryBlockHeight","disableCache","timeSinceFetch","now","expired","_pollNewBlockhash","startTime","cachedLatestBlockhash","cachedBlockhash","getStakeMinimumDelegation","transactionOrMessage","configOrSigners","versionedTx","originalTx","signersOrOptions","sendEncodedTransaction","setInterval","_updateSubscriptions","clearInterval","_setSubscription","nextSubscription","prevState","stateChangeCallbacks","clientSubscriptionId","activeWebSocketGeneration","isCurrentConnectionStillActive","callbacks","serverSubscriptionId","unsubscribeMethod","_handleServerNotification","callbackArgs","_makeSubscription","subscriptionConfig","existingSubscription","_unsubscribeClientSubscription","onProgramAccountChange","maybeFilters","removeProgramAccountChangeListener","mentions","onSlotChange","removeSlotChangeListener","onSlotUpdate","removeSlotUpdateListener","subscriptionName","dispose","override","_err","onSignatureWithOptions","onRootChange","removeRootChangeListener","_keypair","skipValidation","computedPublicKey","ii","fromSeed","CreateLookupTable","FreezeLookupTable","ExtendLookupTable","DeactivateLookupTable","CloseLookupTable","layoutType","decodeCreateLookupTable","checkKeysLength","recentSlot","decodeExtendLookupTable","decodeCloseLookupTable","recipient","decodeFreezeLookupTable","decodeDeactivateLookupTable","createLookupTable","lookupTableAddress","bumpSeed","freezeLookupTable","extendLookupTable","deactivateLookupTable","closeLookupTable","decodeRequestUnits","RequestUnits","decodeRequestHeapFrame","RequestHeapFrame","decodeSetComputeUnitLimit","SetComputeUnitLimit","decodeSetComputeUnitPrice","microLamports","SetComputeUnitPrice","requestUnits","requestHeapFrame","setComputeUnitLimit","setComputeUnitPrice","PRIVATE_KEY_BYTES$1","PUBLIC_KEY_BYTES$1","SIGNATURE_BYTES","ED25519_INSTRUCTION_LAYOUT","createInstructionWithPublicKey","instructionIndex","publicKeyOffset","signatureOffset","messageDataOffset","numSignatures","signatureInstructionIndex","publicKeyInstructionIndex","messageDataSize","messageInstructionIndex","createInstructionWithPrivateKey","ecdsaSign","publicKeyCreate","PRIVATE_KEY_BYTES","ETHEREUM_ADDRESS_BYTES","PUBLIC_KEY_BYTES","SIGNATURE_OFFSETS_SERIALIZED_SIZE","SECP256K1_INSTRUCTION_LAYOUT","publicKeyToEthAddress","recoveryId","createInstructionWithEthAddress","ethAddress","rawAddress","dataStart","ethAddressOffset","ethAddressInstructionIndex","pkey","messageHash","staker","withdrawer","unixTimestamp","custodian","decodeInitialize","Initialize","stakePubkey","decodeDelegate","Delegate","decodeAuthorize","newAuthorized","stakeAuthorizationType","Authorize","custodianPubkey","decodeAuthorizeWithSeed","authoritySeed","authorityOwner","AuthorizeWithSeed","authorityBase","decodeSplit","Split","splitStakePubkey","decodeMerge","Merge","sourceStakePubKey","decodeWithdraw","Withdraw","decodeDeactivate","Deactivate","Staker","Withdrawer","initialize","maybeLockup","authorize","authorizeWithSeed","splitInstruction","splitWithSeed","withdraw","deactivate","authorizedVoter","authorizedWithdrawer","VOTE_INSTRUCTION_LAYOUTS","decodeInitializeAccount","InitializeAccount","voteAuthorizationType","currentAuthorityDerivedKeyOwnerPubkey","currentAuthorityDerivedKeySeed","currentAuthorityDerivedKeyBasePubkey","authorizedWithdrawerPubkey","UpdateValidatorIdentity","Voter","safeWithdraw","currentVoteAccountBalance","rentExemptMinimum","updateValidatorIdentity","InfoString","website","details","iconUrl","keybaseUsername","fromConfigData","configKeyCount","configKeys","rawInfo","VoteAccountLayout","votes","authorizedVoters","priorVoters","lastTimestamp","versionOffset","va","rootSlotValid","parseAuthorizedVoter","getPriorVoters","parsePriorVoters","epochOfLastAuthorizedSwitch","targetEpoch","http","https","tls","confirmationStrategyOrConfirmOptions","maybeConfirmOptions","confirmationStrategy","jsbi_1","formatBig","formatDecimal","DEFAULT_DISPLAY_NUMBER_FORMAT","DEFAULT_NUMBER_FORMAT","toSignificantRounding","big_js_1","decimal_js_light_1","constants_js_1","ROUND_DOWN","ROUND_HALF_UP","ROUND_UP","toFixedRounding","roundDown","roundHalfUp","roundUp","decimalSeparator","groupSeparator","groupSize","rounding","formatNum","isNegative","roundingMethod","decimalPlaces","decInternal","integerPart","fractionPart","displayIntegerPart","intd","nd","dec","fmt","big","fractionFromObject","format_js_1","tryParseFraction","isFraction","fractionish","numeratorStr","denominatorStr","compareTo","equalTo","greaterThan","multiplier","quotient","divide","remainder","otherParsed","lessThan","toSignificant","significantDigits","precision","toSignificantDigits","asFraction","asNumber","POSITIVE_INFINITY","NEGATIVE_INFINITY","isZero","EQ","NE","isNonZero","fraction_js_1","ONE_HUNDRED","toPercent","fraction","isPercent","frac","fromBPS","bps","adjusted","quote","tokenAmount","toFixedQuote","stripTrailingZeroes","TokenAmountUnderflow","TokenAmountOverflow","DEFAULT_GROUP_SEPARATOR","DEFAULT_DECIMAL_SEPARATOR","DEFAULT_LOCALE_GROUP_SEPARATOR","DEFAULT_LOCALE_DECIMAL_SEPARATOR","getGroupSeparator","getDecimalSeparator","getSeparator","percent_js_1","separatorType","numberWithDecimalSeparator","Intl","NumberFormat","formatToParts","part","wholeRaw","fractionRaw","whole","combined","greaterThanOrEqual","lessThanOrEqual","newTail","parsedAmount","withAmount","percentOf","divideBy","scale","reduceBy","percent","formatUnits","numberFormatOptions","isTokenAmount","divideByAmount","multiplyBy","BN_WORD_SIZE","wordSize","words","bigintIsh","decimalMultipliersCache","exponentiate","isDeepEqual","isDeepStrictEqual","_defineProperties","descriptor","_toPropertyKey","_createClass","Constructor","protoProps","staticProps","_toPrimitive","hint","prim","_classCallCheck","_require$codes","_require","codes","ERR_AMBIGUOUS_ARGUMENT","ERR_INVALID_ARG_VALUE","ERR_INVALID_RETURN_VALUE","ERR_MISSING_ARGS","_require2","_require$types","isPromise","objectAssign","objectIs","RegExpPrototypeTest","lazyLoadComparison","comparison","warned","NO_EXCEPTION_SENTINEL","innerFail","stackStartFn","internalMessage","argsLen","emitWarning","errArgs","innerOk","argLen","Comparison","compareExceptionKey","getActual","checkIsPromise","waitForActual","promiseFn","resultPromise","expectsError","fnType","expectsNoError","internalMatch","regexp","fnName","_len6","_key6","_len2","_key2","rejects","_len3","_key3","_len4","_key4","doesNotReject","_len5","_key5","newErr","origStack","tmp2","tmp1","doesNotMatch","ownKeys","_objectSpread","getOwnPropertyDescriptors","defineProperties","_inherits","subClass","superClass","_setPrototypeOf","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","Super","_getPrototypeOf","NewTarget","construct","_possibleConstructorReturn","_assertThisInitialized","_wrapNativeSuper","_isNativeFunction","Wrapper","_construct","Parent","Function","sham","endsWith","this_len","repeat","maxCount","kReadableOperator","strictEqualObject","notStrictEqualObject","notIdentical","kMaxShortLength","copyError","inspectValue","compact","maxArrayLength","breakLength","showProxy","getters","createErrDiff","lastPos","skipped","actualInspected","actualLines","expectedLines","indicator","inputLength","stderr","isTTY","maxLines","_actualLines","printedLines","skippedMsg","expectedLine","actualLine","divergingLines","_Error","_inspect$custom","_super","stackTraceLimit","getColorDepth","_res","knownOperators","custom","util","createErrorType","arg1","arg2","arg3","NodeError","_Base","oneOf","thing","determiner","inspected","_slicedToArray","_arrayWithHoles","_iterableToArrayLimit","_unsupportedIterableToArray","_nonIterableRest","_arrayLikeToArray","arr2","regexFlagsSupported","flags","arrayFromSet","arrayFromMap","objectGetOwnPropertySymbols","uncurryThis","isAnyArrayBuffer","isMap","isNativeError","isBoxedPrimitive","isNumberObject","isStringObject","isBooleanObject","isBigIntObject","isSymbolObject","isFloat32Array","isFloat64Array","isNonIndex","getOwnNonIndexProperties","ONLY_ENUMERABLE","kStrict","kLoose","kNoIterator","kIsArray","kIsSet","kIsMap","areSimilarRegExps","areSimilarFloatArrays","areSimilarTypedArrays","areEqualArrayBuffers","buf1","buf2","isEqualBoxedPrimitive","val1","val2","innerDeepEqual","val1Tag","keys1","keys2","keyCheck","_keys","_keys2","getEnumerables","iterationType","aKeys","bKeys","symbolKeysA","symbolKeysB","_symbolKeysB","val2MemoA","val2MemoB","areEq","setHasEqualElement","setValues","findLooseMatchingPrimitives","setMightHaveLoosePrim","altValue","mapMightHaveLoosePrim","curB","setEquiv","aValues","bValues","_val","mapHasEqualEntry","item1","mapEquiv","aEntries","_aEntries$i","item2","bEntries","_i2","_bEntries$_i","keysA","_Buffer","BASE_MAP","xc","LEADER","FACTOR","iFACTOR","decodeUnsafe","psz","zeroes","b256","carry","it3","it4","vch","pbegin","pend","b58","it1","it2","__WEBPACK_AMD_DEFINE_RESULT__","GLOBAL","Big","DP","RM","MAX_DP","MAX_POWER","PE","STRICT","NAME","INVALID","INVALID_DP","INVALID_RM","DIV_BY_ZERO","UNDEFINED","NUMERIC","_Big_","roundHalfEven","nl","sd","rm","more","doExponential","isNonzero","cmp","isneg","yc","dp","bl","ri","bz","qc","qi","gte","lte","minus","xlty","plus","ygtx","times","prec","half","toExponential","toPrecision","reversed","toBigIntBE","toBufferBE","globalObject","BigNumber","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","LOG_BASE","POWS_TEN","SQRT_BASE","MAX","configObject","pow2_53","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","convertBase","parseNumeric","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","secondaryGroupSize","fractionGroupSize","fractionGroupSeparator","alphabetHasNormalDecimalDigits","caseChanged","isNum","_isBigNumber","intCheck","DEBUG","c0","coeffToString","toFixedPoint","maxOrMin","normalise","ni","rd","pows10","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","crypto","getRandomValues","EXPONENTIAL_AT","RANGE","isBigNumber","maximum","minimum","random","rand","decimal","toBaseOut","baseIn","baseOut","arrL","callerIsToString","temp","xlo","xhi","klo","khi","aL","bL","prod","prodL","remL","rem0","xi","xL","yc0","yL","yz","bitFloor","absoluteValue","comparedTo","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","isModExp","nIsBig","nIsNeg","nIsOdd","integerValue","isEqualTo","isGreaterThan","isGreaterThanOrEqualTo","isLessThan","isLessThanOrEqualTo","isPositive","xLTy","multipliedBy","xcL","ycL","ylo","yhi","zc","sqrtBase","negated","shiftedBy","squareRoot","rep","toFormat","g1","g2","intPart","intDigits","toFraction","d0","d1","d2","exp","zs","endian","negative","_init","parseHex4Bits","parseHexByte","lowerBound","parseBase","move","_initNumber","_initArray","_parseHex","_parseBase","off","_strip","parseLength","limbLen","limbPow","imuln","_iaddn","_move","_expand","_normSign","for","zeros","groupSizes","groupBases","groupBase","modrn","idivn","ArrayType","toBitArray","bit","wbit","smallMulTo","ncarry","rword","maxJ","reqLength","_toArrayLikeLE","_toArrayLikeBE","clz32","_countBits","_zeroBits","zeroBits","inotn","iaddn","testn","notn","ineg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","iadd","isub","comb10MulTo","mid","a0","al0","ah0","al1","ah1","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","bl1","bh1","bl2","bh2","bl3","bh3","bl4","bh4","bl5","bh5","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","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","mulTo","makeRBT","revBin","rb","permute","rbt","rws","iws","rtws","itws","rtwdf","cos","itwdf","sin","rtwdf_","itwdf_","ro","io","rx","guessLen13b","odd","conjugate","normalize13b","ws","convert13b","stub","ph","mulp","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","isNegNum","muln","isqr","iushln","carryMask","newCarry","ishln","iushrn","extended","maskedWords","ishrn","shln","ushln","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","bhi","qj","divmod","positive","divn","umod","divRound","dm","andln","modn","egcd","isEven","yp","xp","im","jm","_invmp","x1","cmpn","invm","bincn","ucmp","gtn","gten","ltn","lten","eqn","Red","toRed","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","strip","outLen","mod3","nOne","lpow","wnd","currentLen","mont","nmd","BinaryReader","BinaryWriter","BorshError","baseDecode","baseEncode","bs58_1","ResolvedTextDecoder","textDecoder","fatal","INITIAL_LENGTH","fieldPath","originalMessage","addToFieldPath","maybeResize","writeU8","writeU16","writeU32","writeU64","writeBuffer","writeU128","writeU256","writeU512","writeString","writeFixedArray","writeArray","handlingRangeError","propertyKey","propertyDescriptor","originalMethod","readU8","readU16","readU32","readU64","readBuffer","readU128","readU256","readU512","readString","readFixedArray","readArray","capitalizeFirstLetter","serializeField","fieldType","writer","serializeStruct","borshSerialize","structSchema","Writer","deserializeField","deserializeStruct","classType","borshDeserialize","Reader","GetIntrinsic","callBind","$indexOf","allowMissing","intrinsic","setFunctionLength","$TypeError","$apply","$call","$reflectApply","$defineProperty","$max","originalFunction","applyBind","globalScope","MAX_DIGITS","Decimal","toExpNeg","toExpPos","LN10","external","decimalError","invalidArgument","exponentOutOfRange","mathpow","isDecimal","MAX_E","xd","yd","Ctor","checkInt32","digitsToString","indexOfLastWord","getZeroString","xdL","ydL","exponent","getBase10Exponent","greaterThanOrEqualTo","isint","ispos","lessThanOrEqualTo","logarithm","wpr","naturalExponential","naturalLogarithm","rL","todp","toInteger","toint","toPower","yIsInt","guard","tosd","multiplyInteger","qd","yd0","getLn10","parseDecimal","doRound","xdi","isExp","ps","inexact","quadrant","EXP_LIMIT","NUMERALS","DEFAULTS","minE","maxE","precisionLimitExceeded","cryptoUnavailable","isBinary","isHex","isOctal","LN10_PRECISION","PI_PRECISION","checkRoundingDigits","repeating","di","strL","cosine","tinyPow","taylorSeries","cos2x","finalise","clampedTo","clamp","ys","toLessThanHalfPi","cubeRoot","cbrt","t3plusx","divToInt","hyperbolicCosine","cosh","cosh2_x","d8","hyperbolicSine","sinh","sinh2_x","d5","d16","d20","hyperbolicTangent","tanh","inverseCosine","acos","halfPi","getPi","asin","inverseHyperbolicCosine","acosh","inverseHyperbolicSine","asinh","inverseHyperbolicTangent","atanh","xsd","inverseSine","atan","inverseTangent","isInt","isPos","isBase10","inf","getPrecision","sine","tangent","tan","toBinary","toStringBinary","toDP","finiteToString","maxD","toHexadecimal","toNearest","toOctal","intPow","toSD","truncated","logBase","isTruncated","digits","nonFiniteToString","ltgt","parseOther","divisor","isFloat","sin2_x","isHyperbolic","pi","atan2","useDefaults","defaults","isDecimalInstance","hypot","log10","log2","$SyntaxError","gopd","nonEnumerable","nonWritable","nonConfigurable","loose","hasSymbols","defineDataProperty","supportsDescriptors","predicate","predicates","createError","ErrClass","EvalError","ReferenceError","SyntaxError","URIError","Events","EE","once","addListener","emitter","evt","_eventsCount","clearEvent","EventEmitter","eventNames","names","listenerCount","removeListener","removeAllListeners","prefixed","isCallable","forEachArray","receiver","forEachString","forEachObject","ERROR_MESSAGE","funcType","concatty","slicy","arrLike","joiny","joiner","that","bound","binder","boundLength","boundArgs","Empty","implementation","$Error","$EvalError","$RangeError","$ReferenceError","$URIError","$Function","getEvalledConstructor","expressionSyntax","$gOPD","throwTypeError","ThrowTypeError","callee","calleeThrows","gOPDthrows","hasProto","getProto","needsEval","TypedArray","INTRINSICS","Atomics","BigInt64Array","BigUint64Array","decodeURI","encodeURI","eval","FinalizationRegistry","Int8Array","Int16Array","Int32Array","Uint8ClampedArray","Uint16Array","WeakRef","WeakSet","errorProto","doEval","LEGACY_ALIASES","$concat","$spliceApply","$replace","$strSlice","$exec","rePropName","reEscapeChar","stringToPath","subString","getBaseIntrinsic","alias","intrinsicName","intrinsicBaseName","intrinsicRealName","skipFurtherCaching","isOwn","hasPropertyDescriptors","hasArrayLengthDefineBug","$Object","origSymbol","hasSymbolSham","symObj","symVal","syms","$hasOwn","reactIs","REACT_STATICS","childContextTypes","contextType","contextTypes","displayName","getDefaultProps","getDerivedStateFromError","getDerivedStateFromProps","KNOWN_STATICS","caller","arity","FORWARD_REF_STATICS","render","MEMO_STATICS","TYPE_STATICS","getStatics","component","isMemo","ForwardRef","Memo","objectPrototype","hoistNonReactStatics","targetComponent","sourceComponent","blacklist","inheritedComponent","targetStatics","sourceStatics","$$typeof","AsyncMode","ConcurrentMode","ContextConsumer","ContextProvider","Fragment","Lazy","Portal","Profiler","StrictMode","Suspense","isAsyncMode","isConcurrentMode","isContextConsumer","isContextProvider","isElement","isForwardRef","isFragment","isLazy","isPortal","isProfiler","isStrictMode","isSuspense","isValidElementType","typeOf","hasToStringTag","$toString","callBound","isStandardArguments","isLegacyArguments","supportsStandardArguments","badArrayLike","isCallableMarker","fnToStr","reflectApply","constructorRegex","isES6ClassFn","fnStr","tryFunctionObject","objectClass","fnClass","genClass","ddaClass","ddaClass2","ddaClass3","isIE68","isDDA","strClass","GeneratorFunction","isFnRegex","getGeneratorFunc","generatorFunc","getPolyfill","shim","whichTypedArray","uuid","v4","generateRequest","ClientBrowser","callServer","reviver","replacer","notificationIdNull","isBatch","isRaw","hasCallback","_parseResponse","isNotError","ERROR","WINDOW","JS_SHA256_NO_WINDOW","WEB_WORKER","NODE_JS","JS_SHA256_NO_NODE_JS","COMMON_JS","JS_SHA256_NO_COMMON_JS","AMD","amdO","ARRAY_BUFFER","JS_SHA256_NO_ARRAY_BUFFER","HEX_CHARS","EXTRA","SHIFT","OUTPUT_TYPES","blocks","JS_SHA256_NO_ARRAY_BUFFER_IS_VIEW","createOutputMethod","outputType","is224","Sha256","createMethod","nodeWrap","algorithm","nodeMethod","createHash","createHmacOutputMethod","HmacSha256","createHmacMethod","sharedMemory","h0","h7","hBytes","finalized","oKeyPad","iKeyPad","inner","notString","lastByteIndex","finalize","s0","s1","maj","ch","ab","da","cd","bc","dataView","setUint32","innerHash","sha224","INPUT_ERROR","FINALIZE_ERROR","JS_SHA3_NO_WINDOW","JS_SHA3_NO_NODE_JS","JS_SHA3_NO_COMMON_JS","JS_SHA3_NO_ARRAY_BUFFER","SHAKE_PADDING","CSHAKE_PADDING","KECCAK_PADDING","PADDING","RC","SHAKE_BITS","CSHAKE_BYTEPAD","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","formatMessage","empty","cloneArray","newArray","createShakeOutputMethod","outputBits","createCshakeOutputMethod","createKmacOutputMethod","createOutputMethods","algorithms","bytepad","Kmac","methodNames","newMethodName","blockCount","byteCount","outputBlocks","encodeString","strs","paddingBytes","c3","c4","c5","c6","c7","c8","c9","b12","b13","b14","b15","b16","b17","b18","b19","b21","b23","b24","b25","b26","b27","b28","b29","b30","b31","b32","b33","b34","b35","b36","b37","b38","b39","b41","b42","b43","b45","b46","b47","b48","b49","__kMaxLength","__zero","__isOneDigitInt","__oneDigit","__fromDouble","__fromString","__toPrimitive","toDebugString","__toStringBasePowerOfTwo","__toStringGeneric","__unsignedDigit","__digit","__clz30","__decideRounding","__kBitConversionInts","__kBitConversionDouble","unaryMinus","__copy","bitwiseNot","__absoluteSubOne","__trim","__absoluteAddOne","__kMaxLengthBits","__initializeDigits","__setDigit","__clzmsd","__multiplyAccumulate","__absoluteCompare","__absoluteDivSmall","__absoluteDivLarge","__absoluteModSmall","__absoluteAdd","__absoluteSub","leftShift","__rightShiftByAbsolute","__leftShiftByAbsolute","signedRightShift","unsignedRightShift","__compareToBigInt","bitwiseAnd","__absoluteAnd","__absoluteOr","__absoluteAndNot","bitwiseXor","__absoluteXor","bitwiseOr","asIntN","__truncateToNBits","__truncateAndSubFromPowerOfTwo","asUintN","ADD","__toNumeric","__isBigInt","LT","__compare","LE","GT","GE","__equalToNumber","__isWhitespace","__kMaxBitsPerChar","__kBitsPerCharTableMultiplier","__kBitsPerCharTableShift","__fillFromParts","__inplaceMultiplyAdd","__kConversionChars","__halfDigit","__setHalfDigit","__unequalSign","__absoluteGreater","__absoluteLess","__compareToNumber","__compareToDouble","__comparisonResultToBool","__setDigitGrow","__imul","__internalMultiplyAdd","__halfDigitLength","__clz15","__specialLeftShift","__inplaceSub","__inplaceAdd","__inplaceRightShift","__toShiftAmount","__rightShiftByMaximum","__digitPow","__kBitConversionBuffer","FUNC_ERROR_TEXT","NAN","symbolTag","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","freeGlobal","freeSelf","objectProto","nativeMax","nativeMin","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","maxing","invokeFunc","time","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","shouldInvoke","trailingEdge","cancel","debounced","isInvoking","isObjectLike","isSymbol","__NEXT_P","_utf8Decoder","_userAgent","wallets","MyApp","WalletAdapterNetwork","WalletReadyState","Environment","_ReadonlyWalletAccount_address","_ReadonlyWalletAccount_publicKey","_ReadonlyWalletAccount_chains","_ReadonlyWalletAccount_features","_ReadonlyWalletAccount_label","_ReadonlyWalletAccount_icon","_StandardWalletAdapter_instances","_StandardWalletAdapter_account","_StandardWalletAdapter_publicKey","_StandardWalletAdapter_connecting","_StandardWalletAdapter_disconnecting","_StandardWalletAdapter_off","_StandardWalletAdapter_supportedTransactionVersions","_StandardWalletAdapter_wallet","_StandardWalletAdapter_readyState","_StandardWalletAdapter_connect","_StandardWalletAdapter_connected","_StandardWalletAdapter_disconnected","_StandardWalletAdapter_reset","_StandardWalletAdapter_changed","_StandardWalletAdapter_signTransaction","_StandardWalletAdapter_signAllTransactions","_StandardWalletAdapter_signMessage","_StandardWalletAdapter_signIn","_AppReadyEvent_detail","_RegisterWalletEvent_detail","_SolflareMetaMaskWallet_instances","_SolflareMetaMaskWallet_listeners","_SolflareMetaMaskWallet_version","_SolflareMetaMaskWallet_name","_SolflareMetaMaskWallet_icon","_SolflareMetaMaskWallet_solflareMetaMask","_SolflareMetaMaskWallet_on","_SolflareMetaMaskWallet_emit","_SolflareMetaMaskWallet_off","_SolflareMetaMaskWallet_connect","_SolflareMetaMaskWallet_disconnect","_SolflareMetaMaskWallet_signAndSendTransaction","_SolflareMetaMaskWallet_signTransaction","_SolflareMetaMaskWallet_signMessage","react","useIsomorphicLayoutEffect","useEffect","useIsMounted","isMounted","noop_noop","MotionGlobalConfig","skipAnimations","useManualTiming","Queue","scheduled","remove","clear","createRenderStep","runNextFrame","thisFrame","nextFrame","numToRun","isProcessing","flushNextFrame","toKeepAlive","keepAlive","immediate","addToCurrentFrame","frameData","schedule","stepsOrder","maxElapsed","createRenderBatcher","scheduleNextBatch","allowKeepAlive","useDefaultElapsed","steps","processStep","stepId","processBatch","performance","wake","frame_frame","cancelFrame","requestAnimationFrame","useForceUpdate","forcedRenderCount","setForcedRenderCount","useState","forceRender","useCallback","deferredForceRender","postRender","PresenceContext","useConstant","MotionConfigContext","transformPagePoint","isStatic","reducedMotion","PopChildMeasure","Component","getSnapshotBeforeUpdate","prevProps","childRef","isPresent","sizeRef","offsetHeight","offsetWidth","offsetTop","offsetLeft","componentDidUpdate","PopChild","useId","dataset","motionPopId","cloneElement","PresenceChild","onExitComplete","presenceAffectsLayout","presenceChildren","newChildrenMap","useMemo","childId","isComplete","register","LayoutGroupContext","useUnmountEffect","invariant","getChildKey","child","updateChildLookup","allChildren","onlyElements","Children","isValidElement","AnimatePresence","exitBeforeEnter","filteredChildren","childrenToRender","exitingChildren","presentChildren","isInitialRender","presentKeys","targetKeys","numPresent","insertionIndex","exitingComponent","onExit","leftOverKeys","childKey","leftOverKey","presentChildKey","presentChild","head_default","prop_types","prop_types_default","es","devtools","solana","dist_useIsomorphicLayoutEffect","useEventListener","savedHandler","targetElement","useEventCallback","use_local_storage","initialValue","readValue","localStorage","getItem","storedValue","setStoredValue","setValue","newValue","setItem","dispatchEvent","Event","handleStorageChange","useTheme_ThemeContext","hasSymbol","nested","mergeOuterLocalTheme","outerTheme","localTheme","mergedTheme","ThemeProvider_ThemeProvider","emotion_element_43c6fea0_browser_esm","useThemeWithoutDefault","EMPTY_THEME","useThemeScoping","isPrivate","resolvedTheme","esm_ThemeProvider_ThemeProvider","upperPrivateTheme","engineTheme","privateTheme","rtlValue","styles_ThemeProvider_ThemeProvider","scopedTheme","DefaultPropsProvider_DefaultPropsProvider","html","enableColorScheme","WebkitFontSmoothing","MozOsxFontSmoothing","WebkitTextSizeAdjust","colorScheme","_theme$components","colorSchemeStyles","colorSchemes","scheme","_scheme$palette","defaultStyles","themeOverrides","MuiCssBaseline","CssBaseline_CssBaseline","inProps","jsxs","settings","getThemeOptions","theme_ThemeContext","localStorageThemeModeKeyName","param","preferredMode","savedThemeMode","setSavedThemeMode","setMode","contextValues","themeOptions","themeMode","newMode","prevMode","documentElement","classList","ConnectionContext","useConnection","ConnectionProvider","WalletError","WalletNotReadyError","WalletLoadError","WalletConfigError","WalletConnectionError","WalletDisconnectedError","WalletDisconnectionError","WalletAccountError","WalletPublicKeyError","WalletNotConnectedError","WalletSendTransactionError","WalletSignTransactionError","WalletSignMessageError","WalletSignInError","BaseWalletAdapter","connected","autoConnect","prepareTransaction","scopePollingDetectionStrategy","detect","disposers","detectAndDispose","detected","isIosAndRedirectable","navigator","userAgent","isIos","isSafari","BaseSignerWalletAdapter","supportedTransactionVersions","signedTransactions","BaseMessageSignerWalletAdapter","BaseSignInMessageSignerWalletAdapter","DOMAIN","ADDRESS","STATEMENT","URI","VERSION","CHAIN_ID","NONCE","ISSUED_AT","EXPIRATION_TIME","NOT_BEFORE","REQUEST_ID","RESOURCES","FIELDS","createSignInMessageText","statement","uri","issuedAt","expirationTime","notBefore","requestId","resources","resource","SolanaMobileWalletAdapterErrorCode","ERROR_ASSOCIATION_PORT_OUT_OF_RANGE","ERROR_FORBIDDEN_WALLET_BASE_URL","ERROR_SECURE_CONTEXT_REQUIRED","ERROR_SESSION_CLOSED","ERROR_SESSION_TIMEOUT","ERROR_WALLET_NOT_FOUND","ERROR_INVALID_PROTOCOL_VERSION","SolanaMobileWalletAdapterError","SolanaMobileWalletAdapterProtocolError","jsonRpcMessageId","createHelloReq","ecdhPublicKey","associationKeypairPrivateKey","publicKeyBuffer","subtle","exportKey","signatureBuffer","btoa","createSIWSMessage","payload","createSIWSMessageBase64","SolanaSignTransactions","SolanaCloneAuthorization","createMobileWalletProxy","protocolVersion","protocolRequestHandler","inputParams","handleMobileWalletRequest","sign_in_payload","sign_in_result","signInFallback","handleMobileWalletResponse","deleteProperty","methodParams","letter","chain","auth_token","identity","capabilities","supports_clone_authorization","supports_sign_and_send_transactions","signInPayload","authorizationResult","host","siwsMessage","signMessageResult","payloads","signInResult","signed_message","signed_payloads","SEQUENCE_NUMBER_BYTES","createSequenceNumberVector","sequenceNumber","INITIALIZATION_VECTOR_BYTES","ENCODED_PUBLIC_KEY_LENGTH_BYTES","encryptMessage","plaintext","sharedSecret","sequenceNumberVector","initializationVector","ciphertext","encrypt","getAlgorithmParams","decryptMessage","plaintextBuffer","decrypt","getUtf8Decoder","additionalData","iv","tagLength","generateAssociationKeypair","generateKey","namedCurve","generateECDHKeypair","encryptJsonRpcMessage","jsonRpcMessage","decryptJsonRpcMessage","parseHelloRsp","payloadBuffer","associationPublicKey","ecdhPrivateKey","associationPublicKeyBuffer","walletPublicKey","importKey","deriveBits","public","ecdhSecretKey","aesKeyMaterialVal","deriveKey","salt","parseSessionProps","jsonProperties","protocol_version","getRandomAssociationPort","assertAssociationPort","port","arrayBufferToBase64String","binary","getStringWithURLUnsafeCharactersReplaced","unsafeBase64EncodedString","INTENT_NAME","getPathParts","pathString","getIntentURL","methodPathname","intentUrlBase","baseUrl","URL","pathname","getAssociateAndroidIntentURL","putativePort","associationURLBase","protocolVersions","associationPort","exportedKey","encodedKey","Browser","Firefox","Other","assertUnreachable","getBrowser","getDetectionPromise","cleanup","handleBlur","_frame","launchUrlThroughHiddenFrame","contentWindow","href","startSession","randomAssociationPort","associationUrl","detectionPromise","WEBSOCKET_CONNECTION_CONFIG","retryDelayScheduleMs","WEBSOCKET_PROTOCOL","assertSecureContext","isSecureContext","assertSecureEndpointSpecificURI","walletUriBase","getSequenceNumberFromByteArray","transact","connectionStartTime","associationKeypair","sessionPort","baseUri","websocketURL","getNextRetryDelayMs","nextJsonRpcMessageId","lastKnownInboundSequenceNumber","disposeSocket","retryWaitTimeoutId","jsonRpcResponsePromises","handleOpen","ecdhKeypair","handleClose","wasClean","closeEvent","handleError","retryDelayMs","attemptSocketConnection","handleMessage","responseBuffer","responsePromise","sessionPropertiesBuffer","sessionProperties","wallet_uri_base","esm_awaiter","fromUint8Array","toUint8Array","base64EncodedByteArray","atob","getPayloadFromTransaction","getTransactionFromWireMessage","messageOffset","esm_transact","augmentedCallback","augmentedAPI","waitForCommitmentToSendNextTransaction","min_context_slot","skip_preflight","max_retries","wait_for_commitment_to_send_next_transaction","base64EncodedSignatures","signAndSendTransactions","base64EncodedPayloads","base64EncodedSignedMessages","signMessages","signedMessages","base64EncodedCompiledTransactions","compiledTransactions","lib_esm_awaiter","esm_toUint8Array","getIsSupported","SolanaMobileWalletAdapterWalletName","getPublicKeyFromAddress","publicKeyByteArray","esm_isVersionedTransaction","SolanaMobileWalletAdapter","_connecting","_connectionGeneration","_readyState","Loadable","Unsupported","_authorizationResultCache","authorizationResultCache","_addressSelector","addressSelector","_appIdentity","appIdentity","_chain","_onWalletNotFound","onWalletNotFound","declareWalletAsInstalled","_selectedAddress","_authorizationResult","connecting","Installed","runWithGuard","autoConnect_DO_NOT_USE_OR_YOU_WILL_BE_FIRED","cachedAuthorizationResult","handleAuthorizationResult","performAuthorization","didPublicKeysChange","nextSelectedAddress","select","performReauthorization","authToken","disconnect","currentConnectionGeneration","assertIsAuthorized","selectedAddress","performSignTransactions","getTargetCommitment","targetCommitment","targetPreflightCommitment","preflightCommitmentScore","targetCommitmentScore","_1","_2","getCapabilities","signedTransaction","signMessage","signedMessage","signIn","signedInAddress","signedInAccount","createDefaultAddressSelector","CACHE_KEY","createDefaultAuthorizationResultCache","storage","removeItem","defaultWalletNotFoundHandler","mobileWalletAdapter","createDefaultWalletNotFoundHandler","signAndSendTransaction","StandardConnect","StandardEvents","isWalletAdapterCompatibleStandardWallet","isWalletAdapterCompatibleWallet","SolanaSignIn","esm_SOLANA_MAINNET_CHAIN","esm_SOLANA_DEVNET_CHAIN","esm_SOLANA_TESTNET_CHAIN","esm_SOLANA_LOCALNET_CHAIN","MAINNET_ENDPOINT","getChainForEndpoint","getCommitment","StandardDisconnect","util_arraysEqual","adapter_classPrivateFieldSet","adapter_classPrivateFieldGet","StandardWalletAdapter","silent","feature","chains","wallets_classPrivateFieldSet","wallets_classPrivateFieldGet","getWallets","api","detail","AppReadyEvent","wallets_guard","existingListener","bubbles","cancelable","composed","preventDefault","stopImmediatePropagation","stopPropagation","DEPRECATED_getWallets","useStandardWalletAdapters","adapters","warnings","useStandardWalletAdapters_useConstant","standardAdapters","setStandardAdapters","wrapWalletsWithAdapters","standardAdapter","prevStandardAdapters","usePrevious","currentAdapters","removedAdapters","previousAdapter","adapter","isWebView","userAgentString","getEnvironment","DESKTOP_WEB","MOBILE_WEB","getInferredClusterFromEndpoint","useLocalStorage_useLocalStorage","defaultState","isFirstRenderRef","WalletNotSelectedError","useWallet","WalletProviderBase","isUnloadingRef","onAutoConnectRequest","onConnectError","onError","onSelectWallet","isConnectingRef","setConnecting","isDisconnectingRef","disconnecting","setDisconnecting","setPublicKey","setConnected","onErrorRef","handleErrorRef","setWallets","handleReadyStateChange","prevWallets","handleConnect","handleDisconnect","didAttemptAutoConnectRef","getUserAgent","getIsMobile","getUriForAppIdentity","WalletProvider","localStorageKey","adaptersWithStandardAdapters","existingMobileWalletAdapter","adaptersWithMobileWalletAdapter","walletName","setWalletName","changeWallet","nextWalletName","hasUserSelectedAWallet","handleAutoConnectRequest","handleBeforeUnload","handleConnectError","selectWallet","useWalletModal","react_dom","Collapse","expanded","instant","transition","openCollapse","scrollHeight","closeCollapse","handleComplete","handleTransitionEnd","propertyName","role","Button","onClick","tabIndex","startIcon","endIcon","WalletIcon","alt","WalletListItem","handleClick","WalletSVG","viewBox","xmlns","cx","cy","stroke","clipPath","y1","gradientUnits","stopColor","WalletModal","setVisible","setExpanded","fadeIn","setFadeIn","portal","setPortal","listedWallets","collapsedWallets","installed","notInstalled","hideModal","handleWalletClick","handleCollapseClick","handleTabKey","focusableElements","firstElement","lastElement","shiftKey","activeElement","handleKeyDown","getComputedStyle","createPortal","onMouseDown","WalletModalProvider","visible","PhantomWalletName","PhantomWalletAdapter","NotDetected","_disconnected","_wallet","_accountChanged","newPublicKey","phantom","isPhantom","isConnected","register_classPrivateFieldSet","register_classPrivateFieldGet","registerWallet","RegisterWalletEvent","wallet_classPrivateFieldGet","wallet_classPrivateFieldSet","SolflareMetaMaskWallet","SolflareMetaMaskClass","standardSignAndSendTransaction","standardSignTransaction","standardSignMessage","standardAccounts","detect_registered","detect_register","detectAndRegisterSolflareMetaMaskWallet","postMessage","onMessage","SolflareWalletName","SolflareWalletAdapter","_config","solflare","isSolflare","SolflareApp","SolflareClass","wallet_Provider","emotion_cache_browser_esm","create_emotion_cache_isBrowser","createEmotionCache","emotionInsertionPoint","clientSideEmotionCache","emotionCache","pageProps","queryClient","QueryClient","content","QueryClientProvider","Hydrate","dehydratedState","ReactQueryDevtools","initialIsOpen","elementType","isRequired","useSolana","docs","nodewallet","dist_browser","defaultSolanaContext","distributorClient","merkleTreeVersion","SolanaContext","_process_env_NEXT_PUBLIC_MERKLE_TREE_VERSION","userPublicKey","defaultKeypair","defaultWallet","connectionUrl","keysShim","isArgs","isEnumerable","hasDontEnumBug","hasProtoEnumBug","dontEnums","equalsConstructorPrototype","excludedKeys","$applicationCache","$console","$external","$frame","$frameElement","$frames","$innerHeight","$innerWidth","$onmozfullscreenchange","$onmozfullscreenerror","$outerHeight","$outerWidth","$pageXOffset","$pageYOffset","$parent","$scrollLeft","$scrollTop","$scrollX","$scrollY","$self","$webkitIndexedDB","$webkitStorageInfo","$window","hasAutomationEqualityBug","equalsConstructorPrototypeIfNotBuggy","theKeys","skipProto","skipConstructor","origKeys","originalKeys","cachedSetTimeout","cachedClearTimeout","currentQueue","defaultSetTimout","defaultClearTimeout","runTimeout","fun","runClearTimeout","draining","queueIndex","cleanUpNextTick","drainQueue","Item","nextTick","argv","prependListener","prependOnceListener","binding","chdir","umask","errcode","isRetryError","promiseRetry","operation","attempt","retried","RetryOperation","timeouts","forever","unref","maxRetryTime","factor","maxTimeout","randomize","createTimeout","wrap","original","op","mainError","_originalTimeouts","_timeouts","_options","_maxRetryTime","_fn","_errors","_attempts","_operationTimeout","_operationTimeoutCb","_timeout","_operationStart","_cachedTimeouts","stop","currentTime","timer","timeoutOps","try","attempts","counts","mainErrorCount","ReactPropTypesSecret","emptyFunction","emptyFunctionWithReset","resetWarningCache","componentName","propFullName","secret","getShim","ReactPropTypes","arrayOf","instanceOf","objectOf","oneOfType","exact","checkPropTypes","PropTypes","ReactQueryDevtoolsPanel","focusManager","_babel_runtime_helpers_esm_inheritsLoose__WEBPACK_IMPORTED_MODULE_0__","_subscribable__WEBPACK_IMPORTED_MODULE_2__","_utils__WEBPACK_IMPORTED_MODULE_1__","_Subscribable","FocusManager","setup","onFocus","_window","sk","onSubscribe","setEventListener","onUnsubscribe","hasListeners","_this$cleanup","_this$cleanup2","_this2","focused","setFocused","isFocused","visibilityState","_queryClient__WEBPACK_IMPORTED_MODULE_0__","_types__WEBPACK_IMPORTED_MODULE_1__","useMutation","useQuery","setLogger","getLogger","logger","newLogger","getDefaultState","Mutation","_logger__WEBPACK_IMPORTED_MODULE_2__","_notifyManager__WEBPACK_IMPORTED_MODULE_4__","_retryer__WEBPACK_IMPORTED_MODULE_3__","mutationId","mutationCache","observers","setState","dispatch","addObserver","observer","removeObserver","retryer","continue","restored","variables","onMutate","executeMutation","onSuccess","onSettled","_this$options$retry","m4","mutationFn","onFail","onPause","onContinue","retryDelay","_this3","reducer","onMutationUpdate","failureCount","isPaused","notifyManager","_utils__WEBPACK_IMPORTED_MODULE_0__","NotifyManager","notifyFn","batchNotifyFn","A4","batchCalls","setNotifyFunction","setBatchNotifyFunction","onlineManager","OnlineManager","onOnline","online","setOnline","isOnline","onLine","inheritsLoose","Query","abortSignalConsumed","hadObservers","setOptions","queryKey","queryHash","initialState","scheduleGc","_this$options$cacheTi","cacheTime","setDefaultOptions","clearGcTimeout","PN","gcTimeout","optionalRemove","isFetching","setData","updater","_this$options$isDataE","_this$options","prevData","SE","isDataEqual","structuralSharing","Q$","dataUpdatedAt","updatedAt","setStateOptions","_this$retryer","enabled","isStale","isInvalidated","getCurrentResult","isStaleByTime","staleTime","Kp","_this$retryer2","shouldFetchOnWindowFocus","refetch","_this$retryer3","shouldFetchOnReconnect","query","isTransportCancelable","revert","cancelRetry","getObserversCount","invalidate","fetchOptions","_this$retryer4","_this$options$behavio2","_context$fetchOptions2","_this$options$behavio","_context$fetchOptions","_abortController$abor","cancelRefetch","continueRetry","queryFn","mc","abortController","G9","queryFnContext","pageParam","fetchFn","behavior","onFetch","revertState","fetchMeta","DV","onQueryUpdate","initialData","initialDataUpdatedAt","hasInitialData","hasData","dataUpdateCount","errorUpdateCount","errorUpdatedAt","fetchFailureCount","_action$meta","_action$dataUpdatedAt","subscribable","QueryCache","queries","queriesMap","_options$queryHash","Rm","defaultQueryOptions","getQueryDefaults","queryInMap","getAll","_parseFilterArgs","I6","findAll","_parseFilterArgs2","_this4","_this5","core_mutation","MutationCache","mutations","mutation","defaultMutationOptions","mutationKey","getMutationDefaults","X7","resumePausedMutations","pausedMutations","infiniteQueryBehavior","_context$fetchOptions3","_context$fetchOptions4","_context$state$data","_context$state$data2","refetchPage","fetchMore","isFetchingNextPage","isFetchingPreviousPage","oldPages","pages","oldPageParams","pageParams","newPageParams","cancelled","buildNewPages","page","fetchPage","manual","queryFnResult","promiseAsAny","getNextPageParam","_manual","_param","getPreviousPageParam","shouldFetchFirstPage","_loop","_param2","finalPromise","finalPromiseAsAny","queryCache","queryDefaults","mutationDefaults","mount","unsubscribeFocus","unsubscribeOnline","unmount","_this$unsubscribeFocu","_this$unsubscribeOnli","fetching","isMutating","getQueryData","_this$queryCache$find","getQueriesData","queryKeyOrFilters","getQueryCache","setQueryData","parsedOptions","_v","defaultedOptions","setQueriesData","_ref2","getQueryState","_this$queryCache$find2","removeQueries","resetQueries","_parseFilterArgs3","refetchFilters","refetchQueries","cancelQueries","_parseFilterArgs4","_parseFilterArgs4$","cancelOptions","invalidateQueries","_ref3","_filters$refetchActiv","_filters$refetchInact","_parseFilterArgs5","refetchActive","refetchInactive","_this6","_parseFilterArgs6","throwOnError","fetchQuery","prefetchQuery","fetchInfiniteQuery","prefetchInfiniteQuery","cancelMutations","_this7","getMutationCache","getDefaultOptions","setQueryDefaults","yF","_this$queryDefaults$f","setMutationDefaults","_this$mutationDefault","_defaulted","defaultQueryObserverOptions","isCancelledError","isCancelable","Retryer","_focusManager__WEBPACK_IMPORTED_MODULE_1__","_onlineManager__WEBPACK_IMPORTED_MODULE_2__","defaultRetryDelay","CancelledError","cancelFn","continueFn","promiseResolve","promiseReject","isResolved","outerResolve","outerReject","pause","continueResolve","promiseOrValue","_unused","_config$retry","_config$retryDelay","shouldRetry","Subscribable","scheduleMicrotask","getAbortController","parseFilterArgs","timeUntilStale","isValidTimeout","replaceEqualDeep","hashQueryKeyByOptions","functionalUpdate","shallowEqualObjects","matchMutation","parseQueryArgs","matchQuery","parseMutationArgs","ensureQueryKeyArray","isServer","partialMatchKey","hashQueryKey","isQueryKey","mapQueryStatusFilter","stale","queryStatusFilter","hashFn","queryKeyHashFn","stableValueHash","partialDeepEqual","aSize","bItems","bSize","equalItems","hasObjectPrototype","prot","AbortController","_react__WEBPACK_IMPORTED_MODULE_1__","_core__WEBPACK_IMPORTED_MODULE_0__","unstable_batchedUpdates","logger_logger","defaultContext","QueryClientSharingContext","getQueryClientContext","contextSharing","ReactQueryClientContext","useQueryClient","_ref$contextSharing","MutationObserver","bindMethods","updateResult","mutate","_this$currentMutation","currentMutation","notifyOptions","currentResult","mutateOptions","isLoading","isSuccess","isIdle","shouldThrowError","suspense","_useErrorBoundary","mountedRef","forceUpdate","_React$useState","lV","obsRef","useErrorBoundary","mutateAsync","QueryObserver","trackedProps","selectError","currentQuery","shouldFetchOnMount","executeFetch","updateTimers","shouldFetchOn","refetchOnReconnect","refetchOnWindowFocus","clearTimers","prevOptions","prevQuery","updateQuery","mounted","shouldFetchOptionally","updateStaleTimeout","nextRefetchInterval","computeRefetchInterval","currentRefetchInterval","updateRefetchInterval","getOptimisticResult","createResult","trackResult","trackedResult","trackProp","getNextResult","getCurrentQuery","fetchOptimistic","clearStaleTimeout","staleTimeoutId","_this$options$refetch","refetchInterval","nextInterval","clearRefetchInterval","refetchIntervalId","refetchIntervalInBackground","placeholderData","prevResult","prevResultState","currentResultState","prevResultOptions","currentResultOptions","queryChange","queryInitialState","currentQueryInitialState","prevQueryResult","previousQueryResult","isPreviousData","isPlaceholderData","optimisticResults","fetchOnMount","fetchOptionally","keepPreviousData","selectFn","selectResult","isFetched","isFetchedAfterMount","isRefetching","isLoadingError","isRefetchError","shouldNotifyListeners","notifyOnChangeProps","notifyOnChangePropsExclusions","includedProps","typedKey","changed","isIncluded","isExcluded","VS","defaultNotifyOptions","_this8","shouldLoadOnMount","retryOnMount","refetchOnMount","createValue","_isReset","clearReset","isReset","QueryErrorResetBoundaryContext","useQueryErrorResetBoundary","useBaseQuery","Observer","errorResetBoundary","_React$useState2","dehydratedMutation","_options$defaultOptio","dehydratedQuery","_options$defaultOptio2","useHydrate","optionsRef","copyProps","SafeBuffer","hasDescriptors","gOPD","$floor","functionLengthIsConfigurable","functionLengthIsWritable","isProduction","provided","isArgumentsObject","isGeneratorFunction","isTypedArray","BigIntSupported","SymbolSupported","ObjectToString","numberValue","stringValue","booleanValue","bigIntValue","symbolValue","checkBoxedPrimitive","prototypeValueOf","isUint8Array","isUint8ClampedArray","isUint16Array","isUint32Array","isInt8Array","isInt16Array","isInt32Array","isBigInt64Array","isBigUint64Array","isMapToString","working","isSetToString","isWeakMapToString","isWeakMap","isWeakSetToString","isWeakSet","isArrayBufferToString","isArrayBuffer","isDataViewToString","SharedArrayBufferCopy","isSharedArrayBufferToString","isSharedArrayBuffer","isAsyncFunction","isMapIterator","isSetIterator","isGeneratorObject","isWebAssemblyCompiledModule","descriptors","formatRegExp","deprecate","noDeprecation","throwDeprecation","traceDeprecation","trace","debugs","debugEnvRegex","NODE_DEBUG","debugEnv","numLinesEst","isNullOrUndefined","debuglog","pid","months","getHours","getMinutes","getSeconds","getDate","getMonth","kCustomPromisifiedSymbol","callbackifyOnRejected","newReason","callbackify","callbackified","maybeCb","rej","promisify","esm_browser_v4","rnds8","rng","msCrypto","esm_browser_validate","byteToHex","esm_browser_stringify","rnds","availableTypedArrays","typedArrays","$slice","typedArray","tryTypedArrays","getter","trySlices","u256be","u192be","u192","u128be","u64be","bigIntBE","bigint_buffer_1","base_1","WAD","bignumber_js_1","bigint_1","decimalLayout","boolLayout","publicKeyLayout","possibleNames","__unused_webpack___webpack_module__","_extends","_inheritsLoose","_objectWithoutPropertiesLoose","checkFinished","HashMD","Chi","Maj","_assert_js__WEBPACK_IMPORTED_MODULE_1__","_utils_js__WEBPACK_IMPORTED_MODULE_0__","setBigUint64","_u32_max","wh","wl","padOffset","GL","oview","_md_js__WEBPACK_IMPORTED_MODULE_0__","_utils_js__WEBPACK_IMPORTED_MODULE_1__","SHA256_K","SHA256_IV","SHA256_W","SHA256","W15","np","sigma1","sigma0","l3","Hash","byteSwap32","createView","rotr","wrapConstructor","crypto_crypto","byteSwap","hashCons","hashC","WalletModalContext","DEFAULT_CONTEXT","_open","constructMissingProviderErrorMessage","valueName","WalletContext","EMPTY_ARRAY","logMissingProviderError","SolanaSignAndSendTransaction","SolanaSignMessage","SolanaSignTransaction","static_l_desc","static_d_desc","static_bl_desc","lenfix","distfix","inflate_1","Z_FIXED$1","Z_BINARY","Z_TEXT","Z_UNKNOWN$1","zero$1","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","BL_CODES$1","HEAP_SIZE$1","MAX_BITS$1","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","put_short","pending_buf","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","bi_flush","gen_bitlen","xbits","stree","bl_count","heap","heap_max","opt_len","static_len","gen_codes","next_code","tr_static_init","init_block","dyn_ltree","dyn_dtree","bl_tree","sym_next","bi_windup","smaller","_n2","_m2","pqdownheap","heap_len","compress_block","ltree","dtree","lc","sym_buf","build_tree","scan_tree","curlen","prevlen","nextlen","max_count","min_count","send_tree","build_bl_tree","max_blindex","l_desc","d_desc","bl_desc","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","block_mask","static_init_done","_tr_init$1","_tr_stored_block$1","stored_len","_tr_align$1","_tr_flush_block$1","opt_lenb","static_lenb","level","strm","data_type","_tr_tally$1","sym_end","trees","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","adler32","adler","adler32_1","makeTable","crcTable","crc32","crc","crc32_1","constants$2","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_UNKNOWN","Z_DEFLATED","Z_NO_FLUSH$2","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_DEFAULT_STRATEGY$1","Z_DEFLATED$2","MAX_MEM_LEVEL","MAX_WBITS$1","DEF_MEM_LEVEL","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","GZIP_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","zero","slide_hash","wsize","w_size","hash_size","HASH","hash_shift","hash_mask","flush_pending","avail_out","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","read_buf","avail_in","next_in","total_in","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","_w_size","window_size","ins_h","deflate_stored","min_block","pending_buf_size","have","high_water","deflate_fast","hash_head","bflush","match_length","max_lazy_match","deflate_slow","max_insert","prev_match","match_available","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","configuration_table","lm_init","DeflateState","gzhead","gzindex","last_flush","w_bits","hash_bits","lit_bufsize","deflateStateCheck","deflateResetKeep","deflateReset","deflateSetHeader","deflateInit2","windowBits","memLevel","deflateInit","deflate$2","old_flush","level_flags","hcrc","os","beg","gzhead_extra","bstate","deflateEnd","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","deflate_1$2","deflate","deflateInfo","_has","sources","STR_APPLY_UIA_OK","__","_utf8len","string2buf","m_pos","str_len","buf_len","buf2binstring","utf16buf","c_len","zstream","toString$1","Z_NO_FLUSH$1","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFLATED$1","Deflate$1","opt","gzip","ended","dict","_dict_set","deflate$1","deflator","deflateRaw$1","gzip$1","flush_mode","_flush_mode","onData","onEnd","flattenChunks","deflate_2","deflate_1$1","Deflate","deflateRaw","constants","BAD$1","TYPE$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","from_source","lencode","distcode","lenbits","distbits","dolen","dodist","sane","MAXBITS","ENOUGH_LENS$1","ENOUGH_DISTS$1","CODES$1","LENS$1","DISTS$1","lbase","lext","dbase","dext","inflate_table","lens_index","table_index","work","incr","here_bits","here_op","here_val","drop","huff","offs","inftrees","CODES","LENS","DISTS","Z_FINISH$1","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","HEAD","FLAGS","TIME","OS","EXLEN","HCRC","DICTID","DICT","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","BAD","MEM","SYNC","ENOUGH_LENS","ENOUGH_DISTS","MAX_WBITS","DEF_WBITS","zswap32","InflateState","havedict","check","ncode","nlen","ndist","lendyn","distdyn","back","was","inflateStateCheck","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","inflateInit","virgin","fixedtables","updatewindow","inflate$2","put","last_bits","last_op","last_val","hbuf","inf_leave","xflags","extra_len","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflate_1$2","inflate","inflateInfo","gzheader","Inflate$1","inflate$1","inflator","inflateRaw$1","last_avail_out","next_out_utf8","utf8border","utf8str","buf2string","inflate_2","ungzip$1","inflate_1$1","Inflate","inflateRaw","ungzip","ToDictionary","stringToCodePoints","codePointsToString","code_points","cp","end_of_stream","Stream","endOfStream","decoderError","opt_code_point","DEFAULT_ENCODING","_streaming","_BOMseen","_decoder","_fatal","_ignoreBOM","_encoder","UTF8Decoder","utf8_code_point","utf8_bytes_seen","utf8_bytes_needed","utf8_lower_boundary","utf8_upper_boundary","stream","bite","code_point","UTF8Encoder","input_stream","opt_string","__addDisposableResource","__asyncDelegator","__asyncGenerator","__asyncValues","__await","__classPrivateFieldGet","__classPrivateFieldIn","__classPrivateFieldSet","__disposeResources","__esDecorate","__extends","__generator","__makeTemplateObject","__metadata","__param","__propKey","__read","__runInitializers","__setFunctionName","__spread","__spreadArray","__spreadArrays","__values","extendStatics","paramIndex","decorator","descriptorIn","contextIn","initializers","extraInitializers","accept","access","addInitializer","useValue","metadataKey","metadataValue","metadata","label","sent","trys","ops","verb","il","jl","asyncIterator","awaitReturn","resume","settle","fulfill","cooked","async","asyncDispose","_SuppressedError","SuppressedError","suppressed","hasError","__webpack_exec__","moduleId","_N_E"],"sourceRoot":""}